bgp/rib-impl/src/main/java/org/opendaylight/protocol/bgp/rib/impl/EffectiveRibInWriter.java

   1 /*
   2  * Copyright (c) 2015 Cisco Systems, Inc. and others.  All rights reserved.
   3  *
   4  * This program and the accompanying materials are made available under the
   5  * terms of the Eclipse Public License v1.0 which accompanies this distribution,
   6  * and is available at http://www.eclipse.org/legal/epl-v10.html
   7  */
   8 package org.opendaylight.protocol.bgp.rib.impl;
   9
  10 import com.google.common.base.Optional;
  11 import com.google.common.base.Preconditions;
  12 import com.google.common.base.Verify;
  13 import java.util.Collection;
  14 import javax.annotation.Nonnull;
  15 import javax.annotation.concurrent.NotThreadSafe;
  16 import org.opendaylight.controller.md.sal.common.api.data.LogicalDatastoreType;
  17 import org.opendaylight.controller.md.sal.dom.api.DOMDataTreeChangeListener;
  18 import org.opendaylight.controller.md.sal.dom.api.DOMDataTreeChangeService;
  19 import org.opendaylight.controller.md.sal.dom.api.DOMDataTreeIdentifier;
  20 import org.opendaylight.controller.md.sal.dom.api.DOMDataWriteTransaction;
  21 import org.opendaylight.controller.md.sal.dom.api.DOMTransactionChain;
  22 import org.opendaylight.protocol.bgp.rib.impl.spi.RIBSupportContext;
  23 import org.opendaylight.protocol.bgp.rib.impl.spi.RIBSupportContextRegistry;
  24 import org.opendaylight.protocol.bgp.rib.spi.RIBSupport;
  25 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.Peer;
  26 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.peer.AdjRibIn;
  27 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.peer.EffectiveRibIn;
  28 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.rib.Tables;
  29 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.rib.tables.Routes;
  30 import org.opendaylight.yangtools.concepts.ListenerRegistration;
  31 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
  32 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifier;
  33 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifierWithPredicates;
  34 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
  35 import org.opendaylight.yangtools.yang.data.api.schema.ContainerNode;
  36 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
  37 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNodes;
  38 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidate;
  39 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidateNode;
  40 import org.opendaylight.yangtools.yang.data.api.schema.tree.ModificationType;
  41 import org.slf4j.Logger;
  42 import org.slf4j.LoggerFactory;
  43
  44 /**
  45  * Implementation of the BGP import policy. Listens on all Adj-RIB-In, inspects all inbound
  46  * routes in the context of the advertising peer's role and applies the inbound policy.
  47  *
  48  * Inbound policy is applied as follows:
  49  *
  50  * 1) if the peer is an eBGP peer, perform attribute replacement and filtering
  51  * 2) check if a route is admissible based on attributes attached to it, as well as the
  52  *    advertising peer's role
  53  * 3) output admitting routes with edited attributes into /bgp-rib/rib/peer/effective-rib-in/tables/routes
  54  *
  55  * Note that we maintain the peer roles using a DCL, even if we could look up our internal
  56  * structures. This is done so we maintain causality and loose coupling.
  57  */
  58 @NotThreadSafe
  59 final class EffectiveRibInWriter implements AutoCloseable {
  60     private static final Logger LOG = LoggerFactory.getLogger(EffectiveRibInWriter.class);
  61     protected static final NodeIdentifier TABLE_ROUTES = new NodeIdentifier(Routes.QNAME);
  62     private static final NodeIdentifier ADJRIBIN_NID = new NodeIdentifier(AdjRibIn.QNAME);
  63     private static final NodeIdentifier TABLES_NID = new NodeIdentifier(Tables.QNAME);
  64
  65     private final class AdjInTracker implements AutoCloseable, DOMDataTreeChangeListener {
  66         private final RIBSupportContextRegistry registry;
  67         private final YangInstanceIdentifier ribId;
  68         private final ListenerRegistration<?> reg;
  69         private final DOMTransactionChain chain;
  70
  71         AdjInTracker(final DOMDataTreeChangeService service, final RIBSupportContextRegistry registry, final DOMTransactionChain chain, final YangInstanceIdentifier ribId) {
  72             this.registry = Preconditions.checkNotNull(registry);
  73             this.chain = Preconditions.checkNotNull(chain);
  74             this.ribId = Preconditions.checkNotNull(ribId);
  75
  76             final YangInstanceIdentifier tableId = ribId.node(Peer.QNAME).node(Peer.QNAME);
  77             final DOMDataTreeIdentifier treeId = new DOMDataTreeIdentifier(LogicalDatastoreType.OPERATIONAL, tableId);
  78             LOG.debug("Registered Effective RIB on {}", tableId);
  79             this.reg = service.registerDataTreeChangeListener(treeId, this);
  80         }
  81
  82         private void processRoute(final DOMDataWriteTransaction tx, final RIBSupport ribSupport, final AbstractImportPolicy policy, final YangInstanceIdentifier routesPath, final DataTreeCandidateNode route) {
  83             LOG.debug("Process route {}", route.getIdentifier());
  84             final YangInstanceIdentifier routeId = ribSupport.routePath(routesPath, route.getIdentifier());
  85             switch (route.getModificationType()) {
  86             case DELETE:
  87             case DISAPPEARED:
  88                 tx.delete(LogicalDatastoreType.OPERATIONAL, routeId);
  89                 break;
  90             case UNMODIFIED:
  91                 // No-op
  92                 break;
  93             case APPEARED:
  94             case SUBTREE_MODIFIED:
  95             case WRITE:
  96                 tx.put(LogicalDatastoreType.OPERATIONAL, routeId, route.getDataAfter().get());
  97                 // Lookup per-table attributes from RIBSupport
  98                 final ContainerNode advertisedAttrs = (ContainerNode) NormalizedNodes.findNode(route.getDataAfter(), ribSupport.routeAttributesIdentifier()).orNull();
  99                 final ContainerNode effectiveAttrs;
 100
 101                 if (advertisedAttrs != null) {
 102                     effectiveAttrs = policy.effectiveAttributes(advertisedAttrs);
 103                 } else {
 104                     effectiveAttrs = null;
 105                 }
 106
 107                 LOG.debug("Route {} effective attributes {} towards {}", route.getIdentifier(), effectiveAttrs, routeId);
 108
 109                 if (effectiveAttrs != null) {
 110                     tx.put(LogicalDatastoreType.OPERATIONAL, routeId.node(ribSupport.routeAttributesIdentifier()), effectiveAttrs);
 111                 } else {
 112                     LOG.warn("Route {} advertised empty attributes", routeId);
 113                     tx.delete(LogicalDatastoreType.OPERATIONAL,  routeId);
 114                 }
 115                 break;
 116             default:
 117                 LOG.warn("Ignoring unhandled route {}", route);
 118                 break;
 119             }
 120         }
 121
 122         private void processTableChildren(final DOMDataWriteTransaction tx, final RIBSupport ribSupport, final NodeIdentifierWithPredicates peerKey, final YangInstanceIdentifier tablePath, final Collection<DataTreeCandidateNode> children) {
 123             final AbstractImportPolicy policy = EffectiveRibInWriter.this.peerPolicyTracker.policyFor(IdentifierUtils.peerId(peerKey));
 124
 125             for (final DataTreeCandidateNode child : children) {
 126                 final PathArgument childIdentifier = child.getIdentifier();
 127                 final Optional<NormalizedNode<?, ?>> childDataAfter = child.getDataAfter();
 128                 LOG.debug("Process table {} type {}, dataAfter {}, dataBefore {}", childIdentifier, child
 129                     .getModificationType(), childDataAfter, child.getDataBefore());
 130                 final YangInstanceIdentifier childPath = tablePath.node(childIdentifier);
 131                 switch (child.getModificationType()) {
 132                 case DELETE:
 133                 case DISAPPEARED:
 134                     tx.delete(LogicalDatastoreType.OPERATIONAL, tablePath.node(childIdentifier));
 135                     break;
 136                 case UNMODIFIED:
 137                     // No-op
 138                     break;
 139                 case SUBTREE_MODIFIED:
 140                     processModifiedRouteTables(child, childIdentifier,tx, ribSupport, policy, childPath, childDataAfter);
 141                     break;
 142                 case APPEARED:
 143                 case WRITE:
 144                     writeRouteTables(child, childIdentifier,tx, ribSupport, policy, childPath, childDataAfter);
 145
 146                     break;
 147                 default:
 148                     LOG.warn("Ignoring unhandled child {}", child);
 149                     break;
 150                 }
 151             }
 152         }
 153
 154         private void processModifiedRouteTables(final DataTreeCandidateNode child, final PathArgument childIdentifier, final DOMDataWriteTransaction tx,
 155             final RIBSupport ribSupport, final AbstractImportPolicy policy, final YangInstanceIdentifier childPath, final Optional<NormalizedNode<?, ?>> childDataAfter) {
 156             if (TABLE_ROUTES.equals(childIdentifier)) {
 157                 for (final DataTreeCandidateNode route : ribSupport.changedRoutes(child)) {
 158                     processRoute(tx, ribSupport, policy, childPath, route);
 159                 }
 160             } else {
 161                 tx.put(LogicalDatastoreType.OPERATIONAL, childPath, childDataAfter.get());
 162             }
 163         }
 164
 165         private void writeRouteTables(final DataTreeCandidateNode child, final PathArgument childIdentifier, final DOMDataWriteTransaction tx, final RIBSupport ribSupport, final AbstractImportPolicy policy, final YangInstanceIdentifier childPath, final Optional<NormalizedNode<?, ?>> childDataAfter) {
 166             tx.put(LogicalDatastoreType.OPERATIONAL, childPath, childDataAfter.get());
 167             // Routes are special, as they may end up being filtered. The previous put conveniently
 168             // ensured that we have them in at target, so a subsequent delete will not fail :)
 169             if (TABLE_ROUTES.equals(childIdentifier)) {
 170                 for (final DataTreeCandidateNode route : ribSupport.changedRoutes(child)) {
 171                     processRoute(tx, ribSupport, policy, childPath, route);
 172                 }
 173             }
 174         }
 175
 176         private RIBSupportContext getRibSupport(final NodeIdentifierWithPredicates tableKey) {
 177             return this.registry.getRIBSupportContext(tableKey);
 178         }
 179
 180         private YangInstanceIdentifier effectiveTablePath(final NodeIdentifierWithPredicates peerKey, final NodeIdentifierWithPredicates tableKey) {
 181             return this.ribId.node(Peer.QNAME).node(peerKey).node(EffectiveRibIn.QNAME).node(Tables.QNAME).node(tableKey);
 182         }
 183
 184         private void modifyTable(final DOMDataWriteTransaction tx, final NodeIdentifierWithPredicates peerKey, final NodeIdentifierWithPredicates tableKey, final DataTreeCandidateNode table) {
 185             final RIBSupportContext ribSupport = getRibSupport(tableKey);
 186             final YangInstanceIdentifier tablePath = effectiveTablePath(peerKey, tableKey);
 187
 188             processTableChildren(tx, ribSupport.getRibSupport(), peerKey, tablePath, table.getChildNodes());
 189         }
 190
 191         private void writeTable(final DOMDataWriteTransaction tx, final NodeIdentifierWithPredicates peerKey, final NodeIdentifierWithPredicates tableKey, final DataTreeCandidateNode table) {
 192             final RIBSupportContext ribSupport = getRibSupport(tableKey);
 193             final YangInstanceIdentifier tablePath = effectiveTablePath(peerKey, tableKey);
 194
 195             // Create an empty table
 196             LOG.trace("Create Empty table", tablePath);
 197             ribSupport.clearTable(tx, tablePath);
 198
 199             processTableChildren(tx, ribSupport.getRibSupport(), peerKey, tablePath, table.getChildNodes());
 200         }
 201
 202         @Override
 203         public void onDataTreeChanged(@Nonnull final Collection<DataTreeCandidate> changes) {
 204             LOG.trace("Data changed called to effective RIB. Change : {}", changes);
 205
 206             // we have a lot of transactions created for 'nothing' because a lot of changes
 207             // are skipped, so ensure we only create one transaction when we really need it
 208             DOMDataWriteTransaction tx = null;
 209             for (final DataTreeCandidate tc : changes) {
 210                 final YangInstanceIdentifier rootPath = tc.getRootPath();
 211
 212                 // Obtain the peer's key
 213                 final NodeIdentifierWithPredicates peerKey = IdentifierUtils.peerKey(rootPath);
 214                 final DataTreeCandidateNode root = tc.getRootNode();
 215
 216                 // call out peer-role has changed
 217                 final DataTreeCandidateNode roleChange =  root.getModifiedChild(AbstractPeerRoleTracker.PEER_ROLE_NID);
 218                 if (roleChange != null) {
 219                     EffectiveRibInWriter.this.peerPolicyTracker.onDataTreeChanged(roleChange, IdentifierUtils.peerPath(rootPath));
 220                 }
 221
 222                 // filter out any change outside AdjRibsIn
 223                 final DataTreeCandidateNode ribIn =  root.getModifiedChild(ADJRIBIN_NID);
 224                 if (ribIn == null) {
 225                     LOG.debug("Skipping change {}", root.getIdentifier());
 226                     continue;
 227                 }
 228                 final DataTreeCandidateNode tables = ribIn.getModifiedChild(TABLES_NID);
 229                 if (tables == null) {
 230                     LOG.debug("Skipping change {}", root.getIdentifier());
 231                     continue;
 232                 }
 233                 for (final DataTreeCandidateNode table : tables.getChildNodes()) {
 234                     if (tx == null) {
 235                         tx = this.chain.newWriteOnlyTransaction();
 236                     }
 237                     changeDataTree(tx, rootPath, root, peerKey, table);
 238                 }
 239             }
 240             if (tx != null) {
 241                 tx.submit();
 242             }
 243         }
 244
 245         private void changeDataTree(final DOMDataWriteTransaction tx, final YangInstanceIdentifier rootPath,
 246             final DataTreeCandidateNode root, final NodeIdentifierWithPredicates peerKey, final DataTreeCandidateNode table) {
 247             final PathArgument lastArg = table.getIdentifier();
 248             Verify.verify(lastArg instanceof NodeIdentifierWithPredicates, "Unexpected type %s in path %s", lastArg.getClass(), rootPath);
 249             final NodeIdentifierWithPredicates tableKey = (NodeIdentifierWithPredicates) lastArg;
 250             final ModificationType modificationType = root.getModificationType();
 251             switch (modificationType) {
 252             case DELETE:
 253             case DISAPPEARED:
 254                 final YangInstanceIdentifier effectiveTablePath = effectiveTablePath(peerKey, tableKey);
 255                 LOG.debug("Delete Effective Table {} modification type {}, ", effectiveTablePath, modificationType);
 256                 // delete the corresponding effective table
 257                 tx.delete(LogicalDatastoreType.OPERATIONAL, effectiveTablePath);
 258                 break;
 259             case SUBTREE_MODIFIED:
 260                 modifyTable(tx, peerKey, tableKey, table);
 261                 break;
 262             case UNMODIFIED:
 263                 LOG.info("Ignoring spurious notification on {} data {}", rootPath, table);
 264                 break;
 265             case APPEARED:
 266             case WRITE:
 267                 writeTable(tx, peerKey, tableKey, table);
 268                 break;
 269             default:
 270                 LOG.warn("Ignoring unhandled root {}", root);
 271                 break;
 272             }
 273         }
 274
 275         @Override
 276         public void close() {
 277             // FIXME: wipe all effective routes?
 278             this.reg.close();
 279         }
 280     }
 281
 282     private final ImportPolicyPeerTracker peerPolicyTracker;
 283     private final AdjInTracker adjInTracker;
 284
 285     static EffectiveRibInWriter create(@Nonnull final DOMDataTreeChangeService service, @Nonnull final DOMTransactionChain chain,
 286         @Nonnull final YangInstanceIdentifier ribId, @Nonnull final PolicyDatabase pd, @Nonnull final RIBSupportContextRegistry registry) {
 287         return new EffectiveRibInWriter(service, chain, ribId, pd, registry);
 288     }
 289
 290     private EffectiveRibInWriter(final DOMDataTreeChangeService service, final DOMTransactionChain chain, final YangInstanceIdentifier ribId,
 291         final PolicyDatabase pd, final RIBSupportContextRegistry registry) {
 292         this.peerPolicyTracker = new ImportPolicyPeerTracker(pd);
 293         this.adjInTracker = new AdjInTracker(service, registry, chain, ribId);
 294     }
 295
 296     @Override
 297     public void close() {
 298         this.adjInTracker.close();
 299     }
 300 }