bgp/rib-impl/src/main/java/org/opendaylight/protocol/bgp/rib/impl/LocRibWriter.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.primitives.UnsignedInteger;
  13 import java.util.Arrays;
  14 import java.util.Collection;
  15 import java.util.HashMap;
  16 import java.util.Map;
  17 import java.util.Map.Entry;
  18 import javax.annotation.Nonnull;
  19 import javax.annotation.concurrent.NotThreadSafe;
  20 import org.opendaylight.controller.md.sal.common.api.data.LogicalDatastoreType;
  21 import org.opendaylight.controller.md.sal.dom.api.DOMDataTreeChangeListener;
  22 import org.opendaylight.controller.md.sal.dom.api.DOMDataTreeChangeService;
  23 import org.opendaylight.controller.md.sal.dom.api.DOMDataTreeIdentifier;
  24 import org.opendaylight.controller.md.sal.dom.api.DOMDataWriteTransaction;
  25 import org.opendaylight.controller.md.sal.dom.api.DOMTransactionChain;
  26 import org.opendaylight.protocol.bgp.rib.impl.spi.RIBSupportContext;
  27 import org.opendaylight.protocol.bgp.rib.impl.spi.RIBSupportContextRegistry;
  28 import org.opendaylight.protocol.bgp.rib.spi.RIBSupport;
  29 import org.opendaylight.protocol.bgp.rib.spi.RibSupportUtils;
  30 import org.opendaylight.yang.gen.v1.urn.ietf.params.xml.ns.yang.ietf.inet.types.rev100924.AsNumber;
  31 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.PeerId;
  32 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.PeerRole;
  33 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.LocRib;
  34 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.Peer;
  35 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.peer.AdjRibOut;
  36 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.bgp.rib.rib.peer.EffectiveRibIn;
  37 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.rib.Tables;
  38 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.rib.TablesKey;
  39 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.rib.tables.Attributes;
  40 import org.opendaylight.yang.gen.v1.urn.opendaylight.params.xml.ns.yang.bgp.rib.rev130925.rib.tables.Routes;
  41 import org.opendaylight.yangtools.yang.common.QName;
  42 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
  43 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifier;
  44 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifierWithPredicates;
  45 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
  46 import org.opendaylight.yangtools.yang.data.api.schema.ContainerNode;
  47 import org.opendaylight.yangtools.yang.data.api.schema.LeafNode;
  48 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
  49 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidate;
  50 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidateNode;
  51 import org.opendaylight.yangtools.yang.data.impl.schema.ImmutableNodes;
  52 import org.slf4j.Logger;
  53 import org.slf4j.LoggerFactory;
  54
  55 @NotThreadSafe
  56 final class LocRibWriter implements AutoCloseable, DOMDataTreeChangeListener {
  57
  58     private static final Logger LOG = LoggerFactory.getLogger(LocRibWriter.class);
  59
  60     private static final LeafNode<Boolean> ATTRIBUTES_UPTODATE_TRUE = ImmutableNodes.leafNode(QName.create(Attributes.QNAME, "uptodate"), Boolean.TRUE);
  61     private static final NodeIdentifier ROUTES_IDENTIFIER = new NodeIdentifier(Routes.QNAME);
  62     private static final NodeIdentifier EFFRIBIN_NID = new NodeIdentifier(EffectiveRibIn.QNAME);
  63     private static final NodeIdentifier TABLES_NID = new NodeIdentifier(Tables.QNAME);
  64
  65     private final Map<PathArgument, AbstractRouteEntry> routeEntries = new HashMap<>();
  66     private final YangInstanceIdentifier locRibTarget;
  67     private final DOMTransactionChain chain;
  68     private final ExportPolicyPeerTracker peerPolicyTracker;
  69     private final NodeIdentifier attributesIdentifier;
  70     private final Long ourAs;
  71     private final RIBSupport ribSupport;
  72     private final NodeIdentifierWithPredicates tableKey;
  73     private final RIBSupportContextRegistry registry;
  74
  75     LocRibWriter(final RIBSupportContextRegistry registry, final DOMTransactionChain chain, final YangInstanceIdentifier target, final Long ourAs,
  76         final DOMDataTreeChangeService service, final PolicyDatabase pd, final TablesKey tablesKey) {
  77         this.chain = Preconditions.checkNotNull(chain);
  78         this.tableKey = RibSupportUtils.toYangTablesKey(tablesKey);
  79         this.locRibTarget = YangInstanceIdentifier.create(target.node(LocRib.QNAME).node(Tables.QNAME).node(this.tableKey).getPathArguments());
  80         this.ourAs = Preconditions.checkNotNull(ourAs);
  81         this.registry = registry;
  82         this.ribSupport = this.registry.getRIBSupportContext(tablesKey).getRibSupport();
  83         this.attributesIdentifier = this.ribSupport.routeAttributesIdentifier();
  84         this.peerPolicyTracker = new ExportPolicyPeerTracker(pd);
  85
  86         final DOMDataWriteTransaction tx = this.chain.newWriteOnlyTransaction();
  87         tx.merge(LogicalDatastoreType.OPERATIONAL, this.locRibTarget.node(Routes.QNAME), this.ribSupport.emptyRoutes());
  88         tx.merge(LogicalDatastoreType.OPERATIONAL, this.locRibTarget.node(Attributes.QNAME).node(ATTRIBUTES_UPTODATE_TRUE.getNodeType()), ATTRIBUTES_UPTODATE_TRUE);
  89         tx.submit();
  90
  91         final YangInstanceIdentifier tableId = target.node(Peer.QNAME).node(Peer.QNAME);
  92         service.registerDataTreeChangeListener(new DOMDataTreeIdentifier(LogicalDatastoreType.OPERATIONAL, tableId), this);
  93     }
  94
  95     public static LocRibWriter create(@Nonnull final RIBSupportContextRegistry registry, @Nonnull final TablesKey tablesKey, @Nonnull final DOMTransactionChain chain, @Nonnull final YangInstanceIdentifier target,
  96         @Nonnull final AsNumber ourAs, @Nonnull final DOMDataTreeChangeService service, @Nonnull final PolicyDatabase pd) {
  97         return new LocRibWriter(registry, chain, target, ourAs.getValue(), service, pd, tablesKey);
  98     }
  99
 100     @Override
 101     public void close() {
 102         this.chain.close();
 103     }
 104
 105     @Nonnull private AbstractRouteEntry createEntry(final PathArgument routeId) {
 106         final AbstractRouteEntry ret = this.ribSupport.isComplexRoute() ? new ComplexRouteEntry() : new SimpleRouteEntry();
 107
 108         this.routeEntries.put(routeId, ret);
 109         LOG.trace("Created new entry for {}", routeId);
 110         return ret;
 111     }
 112
 113     @Override
 114     public void onDataTreeChanged(final Collection<DataTreeCandidate> changes) {
 115         final DOMDataWriteTransaction tx = this.chain.newWriteOnlyTransaction();
 116         LOG.trace("Received data change to LocRib {}", Arrays.toString(changes.toArray()));
 117         /*
 118          * We use two-stage processing here in hopes that we avoid duplicate
 119          * calculations when multiple peers have changed a particular entry.
 120          */
 121         final Map<RouteUpdateKey, AbstractRouteEntry> toUpdate = new HashMap<>();
 122         update(tx, changes, toUpdate);
 123
 124         // Now walk all updated entries
 125         walkThrough(tx, toUpdate);
 126
 127         tx.submit();
 128     }
 129
 130     private void update(final DOMDataWriteTransaction tx, final Collection<DataTreeCandidate> changes,
 131         final Map<RouteUpdateKey, AbstractRouteEntry> toUpdate) {
 132
 133         for (final DataTreeCandidate tc : changes) {
 134             // call out peer-role has changed
 135             final YangInstanceIdentifier rootPath = tc.getRootPath();
 136             final DataTreeCandidateNode rootNode = tc.getRootNode();
 137             final DataTreeCandidateNode roleChange =  rootNode.getModifiedChild(AbstractPeerRoleTracker.PEER_ROLE_NID);
 138             if (roleChange != null) {
 139                 this.peerPolicyTracker.onDataTreeChanged(roleChange, IdentifierUtils.peerPath(rootPath));
 140             }
 141             // filter out any change outside EffRibsIn
 142             final DataTreeCandidateNode ribIn = rootNode.getModifiedChild(EFFRIBIN_NID);
 143             if (ribIn == null) {
 144                 LOG.debug("Skipping change {}", tc.getRootNode());
 145                 continue;
 146             }
 147             final DataTreeCandidateNode table = ribIn.getModifiedChild(TABLES_NID).getModifiedChild(this.tableKey);
 148             if (table == null) {
 149                 LOG.debug("Skipping change {}", tc.getRootNode());
 150                 continue;
 151             }
 152             final NodeIdentifierWithPredicates peerKey = IdentifierUtils.peerKey(rootPath);
 153             final PeerId peerId = IdentifierUtils.peerId(peerKey);
 154             final UnsignedInteger routerId = RouterIds.routerIdForPeerId(peerId);
 155             for (final DataTreeCandidateNode child : table.getChildNodes()) {
 156                 if ((Attributes.QNAME).equals(child.getIdentifier().getNodeType())) {
 157                     if (child.getDataAfter().isPresent()) {
 158                         // putting uptodate attribute in
 159                         LOG.trace("Uptodate found for {}", child.getDataAfter());
 160                         tx.put(LogicalDatastoreType.OPERATIONAL, this.locRibTarget.node(child.getIdentifier()), child.getDataAfter().get());
 161                     }
 162                     continue;
 163                 }
 164                 for (final DataTreeCandidateNode route : this.ribSupport.changedRoutes(child)) {
 165                     final PathArgument routeId = route.getIdentifier();
 166                     AbstractRouteEntry entry = this.routeEntries.get(routeId);
 167
 168                     final Optional<NormalizedNode<?, ?>> maybeData = route.getDataAfter();
 169                     if (maybeData.isPresent()) {
 170                         if (entry == null) {
 171                             entry = createEntry(routeId);
 172                         }
 173
 174                         entry.addRoute(routerId, this.attributesIdentifier, maybeData.get());
 175                     } else if (entry != null && entry.removeRoute(routerId)) {
 176                         this.routeEntries.remove(routeId);
 177                         entry = null;
 178                         LOG.trace("Removed route from {}", routerId);
 179                     }
 180                     LOG.debug("Updated route {} entry {}", routeId, entry);
 181                     toUpdate.put(new RouteUpdateKey(peerId, routeId), entry);
 182                 }
 183             }
 184         }
 185     }
 186
 187     private void walkThrough(final DOMDataWriteTransaction tx, final Map<RouteUpdateKey, AbstractRouteEntry> toUpdate) {
 188         for (final Entry<RouteUpdateKey, AbstractRouteEntry> e : toUpdate.entrySet()) {
 189             LOG.trace("Walking through {}", e);
 190             final AbstractRouteEntry entry = e.getValue();
 191             final RouteUpdateKey key = e.getKey();
 192             final NormalizedNode<?, ?> value;
 193
 194             if (entry != null) {
 195                 if (!entry.selectBest(this.ourAs)) {
 196                     // Best path has not changed, no need to do anything else. Proceed to next route.
 197                     LOG.trace("Continuing");
 198                     continue;
 199                 }
 200                 value = entry.createValue(key.getRouteId());
 201                 LOG.trace("Selected best value {}", value);
 202             } else {
 203                 value = null;
 204             }
 205
 206             final YangInstanceIdentifier writePath = this.ribSupport.routePath(this.locRibTarget.node(ROUTES_IDENTIFIER), key.getRouteId());
 207             if (value != null) {
 208                 LOG.debug("Write route to LocRib {}", value);
 209                 tx.put(LogicalDatastoreType.OPERATIONAL, writePath, value);
 210             } else {
 211                 LOG.debug("Delete route from LocRib {}", entry);
 212                 tx.delete(LogicalDatastoreType.OPERATIONAL, writePath);
 213             }
 214             fillAdjRibsOut(tx, entry, value, key);
 215         }
 216     }
 217
 218     private void fillAdjRibsOut(final DOMDataWriteTransaction tx, final AbstractRouteEntry entry, final NormalizedNode<?, ?> value, final RouteUpdateKey key) {
 219         /*
 220          * We need to keep track of routers and populate adj-ribs-out, too. If we do not, we need to
 221          * expose from which client a particular route was learned from in the local RIB, and have
 222          * the listener perform filtering.
 223          *
 224          * We walk the policy set in order to minimize the amount of work we do for multiple peers:
 225          * if we have two eBGP peers, for example, there is no reason why we should perform the translation
 226          * multiple times.
 227          */
 228         for (final PeerRole role : PeerRole.values()) {
 229             final PeerExportGroup peerGroup = this.peerPolicyTracker.getPeerGroup(role);
 230             if (peerGroup != null) {
 231                 final ContainerNode attributes = entry == null ? null : entry.attributes();
 232                 final PeerId peerId = key.getPeerId();
 233                 final ContainerNode effectiveAttributes = peerGroup.effectiveAttributes(peerId, attributes);
 234                 for (final Entry<PeerId, YangInstanceIdentifier> pid : peerGroup.getPeers()) {
 235                     // This points to adj-rib-out for a particular peer/table combination
 236                     final RIBSupportContext ribCtx = this.registry.getRIBSupportContext(this.tableKey);
 237                     // FIXME: the table should be created for a peer only once
 238                     ribCtx.clearTable(tx, pid.getValue().node(AdjRibOut.QNAME).node(Tables.QNAME).node(this.tableKey));
 239                     final YangInstanceIdentifier routeTarget = this.ribSupport.routePath(pid.getValue().node(AdjRibOut.QNAME).node(Tables.QNAME).node(this.tableKey).node(ROUTES_IDENTIFIER), key.getRouteId());
 240                     if (effectiveAttributes != null && value != null && !peerId.equals(pid.getKey())) {
 241                         LOG.debug("Write route to AdjRibsOut {}", value);
 242                         tx.put(LogicalDatastoreType.OPERATIONAL, routeTarget, value);
 243                         tx.put(LogicalDatastoreType.OPERATIONAL, routeTarget.node(this.attributesIdentifier), effectiveAttributes);
 244                     } else {
 245                         LOG.trace("Removing {} from transaction", routeTarget);
 246                         tx.delete(LogicalDatastoreType.OPERATIONAL, routeTarget);
 247                     }
 248                 }
 249             }
 250         }
 251     }
 252 }