NS-3 based Named Data Networking (NDN) simulator
ndnSIM 2.0: NDN, CCN, CCNx, content centric networks
API Documentation
fib-updater.cpp
Go to the documentation of this file.
1 /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
26 #include "fib-updater.hpp"
27 
28 #include "core/logger.hpp"
29 
30 #include <ndn-cxx/management/nfd-control-parameters.hpp>
31 
32 namespace nfd {
33 namespace rib {
34 
36 
37 NFD_LOG_INIT("FibUpdater");
38 
39 const unsigned int FibUpdater::MAX_NUM_TIMEOUTS = 10;
40 const uint32_t FibUpdater::ERROR_FACE_NOT_FOUND = 410;
41 
43  : m_rib(rib)
44  , m_controller(controller)
45 {
46  rib.setFibUpdater(this);
47 }
48 
49 void
51  const FibUpdateSuccessCallback& onSuccess,
52  const FibUpdateFailureCallback& onFailure)
53 {
54  m_batchFaceId = batch.getFaceId();
55 
56  // Erase previously calculated inherited routes
57  m_inheritedRoutes.clear();
58 
59  // Erase previously calculated FIB updates
60  m_updatesForBatchFaceId.clear();
61  m_updatesForNonBatchFaceId.clear();
62 
63  computeUpdates(batch);
64 
65  sendUpdatesForBatchFaceId(onSuccess, onFailure);
66 }
67 
68 void
69 FibUpdater::computeUpdates(const RibUpdateBatch& batch)
70 {
71  NFD_LOG_DEBUG("Computing updates for batch with faceID: " << batch.getFaceId());
72 
73  // Compute updates and add to m_fibUpdates
74  for (const RibUpdate& update : batch)
75  {
76  switch(update.getAction()) {
78  computeUpdatesForRegistration(update);
79  break;
81  computeUpdatesForUnregistration(update);
82  break;
84  computeUpdatesForUnregistration(update);
85 
86  // Do not apply updates with the same face ID as the destroyed face
87  // since they will be rejected by the FIB
88  m_updatesForBatchFaceId.clear();
89  break;
90  }
91  }
92 }
93 
94 void
95 FibUpdater::computeUpdatesForRegistration(const RibUpdate& update)
96 {
97  const Name& prefix = update.getName();
98  const Route& route = update.getRoute();
99 
100  Rib::const_iterator it = m_rib.find(prefix);
101 
102  // Name prefix exists
103  if (it != m_rib.end()) {
104  shared_ptr<const RibEntry> entry(it->second);
105 
106  RibEntry::const_iterator existingRoute = entry->findRoute(route);
107 
108  // Route will be new
109  if (existingRoute == entry->end()) {
110  // Will the new route change the namespace's capture flag?
111  bool willCaptureBeTurnedOn = (entry->hasCapture() == false && route.isCapture());
112 
113  createFibUpdatesForNewRoute(*entry, route, willCaptureBeTurnedOn);
114  }
115  else {
116  // Route already exists
117  RibEntry entryCopy = *entry;
118 
119  Route& routeToUpdate = *(entryCopy.findRoute(route));
120 
121  routeToUpdate.flags = route.flags;
122  routeToUpdate.cost = route.cost;
123  routeToUpdate.expires = route.expires;
124 
125  createFibUpdatesForUpdatedRoute(entryCopy, route, *existingRoute);
126  }
127  }
128  else {
129  // New name in RIB
130  // Find prefix's parent
131  shared_ptr<RibEntry> parent = m_rib.findParent(prefix);
132 
133  Rib::RibEntryList descendants = m_rib.findDescendantsForNonInsertedName(prefix);
134  Rib::RibEntryList children;
135 
136  for (const auto& descendant : descendants) {
137  // If the child has the same parent as the new entry,
138  // the new entry must be the child's new parent
139  if (descendant->getParent() == parent) {
140  children.push_back(descendant);
141  }
142  }
143 
144  createFibUpdatesForNewRibEntry(prefix, route, children);
145  }
146 }
147 
148 void
149 FibUpdater::computeUpdatesForUnregistration(const RibUpdate& update)
150 {
151  const Name& prefix = update.getName();
152  const Route& route = update.getRoute();
153 
154  Rib::const_iterator ribIt = m_rib.find(prefix);
155 
156  // Name prefix exists
157  if (ribIt != m_rib.end()) {
158  shared_ptr<const RibEntry> entry(ribIt->second);
159 
160  const bool hadCapture = entry->hasCapture();
161 
162  RibEntry::const_iterator existing = entry->findRoute(route);
163 
164  if (existing != entry->end()) {
165  RibEntry temp = *entry;
166 
167  // Erase route in temp entry
168  temp.eraseRoute(route);
169 
170  const bool captureWasTurnedOff = (hadCapture && !temp.hasCapture());
171 
172  createFibUpdatesForErasedRoute(temp, *existing, captureWasTurnedOff);
173 
174  // The RibEntry still has the face ID; need to update FIB
175  // with lowest cost for the same face instead of removing the face from the FIB
176  const Route* next = entry->getRouteWithSecondLowestCostByFaceId(route.faceId);
177 
178  if (next != nullptr) {
179  createFibUpdatesForNewRoute(temp, *next, false);
180  }
181 
182  // The RibEntry will be empty after this removal
183  if (entry->getNRoutes() == 1) {
184  createFibUpdatesForErasedRibEntry(*entry);
185  }
186  }
187  }
188 }
189 
190 void
191 FibUpdater::sendUpdates(const FibUpdateList& updates,
192  const FibUpdateSuccessCallback& onSuccess,
193  const FibUpdateFailureCallback& onFailure)
194 {
195  std::string updateString = (updates.size() == 1) ? " update" : " updates";
196  NFD_LOG_DEBUG("Applying " << updates.size() << updateString << " to FIB");
197 
198  for (const FibUpdate& update : updates) {
199  NFD_LOG_DEBUG("Sending FIB update: " << update);
200 
201  if (update.action == FibUpdate::ADD_NEXTHOP) {
202  sendAddNextHopUpdate(update, onSuccess, onFailure);
203  }
204  else if (update.action == FibUpdate::REMOVE_NEXTHOP) {
205  sendRemoveNextHopUpdate(update, onSuccess, onFailure);
206  }
207  }
208 }
209 
210 void
211 FibUpdater::sendUpdatesForBatchFaceId(const FibUpdateSuccessCallback& onSuccess,
212  const FibUpdateFailureCallback& onFailure)
213 {
214  if (m_updatesForBatchFaceId.size() > 0) {
215  sendUpdates(m_updatesForBatchFaceId, onSuccess, onFailure);
216  }
217  else {
218  sendUpdatesForNonBatchFaceId(onSuccess, onFailure);
219  }
220 }
221 
222 void
223 FibUpdater::sendUpdatesForNonBatchFaceId(const FibUpdateSuccessCallback& onSuccess,
224  const FibUpdateFailureCallback& onFailure)
225 {
226  if (m_updatesForNonBatchFaceId.size() > 0) {
227  sendUpdates(m_updatesForNonBatchFaceId, onSuccess, onFailure);
228  }
229  else {
230  onSuccess(m_inheritedRoutes);
231  }
232 }
233 
234 void
235 FibUpdater::sendAddNextHopUpdate(const FibUpdate& update,
236  const FibUpdateSuccessCallback& onSuccess,
237  const FibUpdateFailureCallback& onFailure,
238  uint32_t nTimeouts)
239 {
242  .setName(update.name)
243  .setFaceId(update.faceId)
244  .setCost(update.cost),
245  bind(&FibUpdater::onUpdateSuccess, this, update, onSuccess, onFailure),
246  bind(&FibUpdater::onUpdateError, this, update, onSuccess, onFailure, _1, _2, nTimeouts));
247 }
248 
249 void
250 FibUpdater::sendRemoveNextHopUpdate(const FibUpdate& update,
251  const FibUpdateSuccessCallback& onSuccess,
252  const FibUpdateFailureCallback& onFailure,
253  uint32_t nTimeouts)
254 {
257  .setName(update.name)
258  .setFaceId(update.faceId),
259  bind(&FibUpdater::onUpdateSuccess, this, update, onSuccess, onFailure),
260  bind(&FibUpdater::onUpdateError, this, update, onSuccess, onFailure, _1, _2, nTimeouts));
261 }
262 
263 void
264 FibUpdater::onUpdateSuccess(const FibUpdate update,
265  const FibUpdateSuccessCallback& onSuccess,
266  const FibUpdateFailureCallback& onFailure)
267 {
268  if (update.faceId == m_batchFaceId) {
269  m_updatesForBatchFaceId.remove(update);
270 
271  if (m_updatesForBatchFaceId.size() == 0) {
272  sendUpdatesForNonBatchFaceId(onSuccess, onFailure);
273  }
274  }
275  else {
276  m_updatesForNonBatchFaceId.remove(update);
277 
278  if (m_updatesForNonBatchFaceId.size() == 0) {
279  onSuccess(m_inheritedRoutes);
280  }
281  }
282 }
283 
284 void
285 FibUpdater::onUpdateError(const FibUpdate update,
286  const FibUpdateSuccessCallback& onSuccess,
287  const FibUpdateFailureCallback& onFailure,
288  uint32_t code, const std::string& error, uint32_t nTimeouts)
289 {
290  NFD_LOG_DEBUG("Failed to apply " << update << " (code: " << code << ", error: " << error << ")");
291 
292  if (code == ndn::nfd::Controller::ERROR_TIMEOUT && nTimeouts < MAX_NUM_TIMEOUTS) {
293  sendAddNextHopUpdate(update, onSuccess, onFailure, ++nTimeouts);
294  }
295  else if (code == ERROR_FACE_NOT_FOUND) {
296  if (update.faceId == m_batchFaceId) {
297  onFailure(code, error);
298  }
299  else {
300  m_updatesForNonBatchFaceId.remove(update);
301 
302  if (m_updatesForNonBatchFaceId.size() == 0) {
303  onSuccess(m_inheritedRoutes);
304  }
305  }
306  }
307  else {
308  BOOST_THROW_EXCEPTION(Error("Non-recoverable error: " + error + " code: " + to_string(code)));
309  }
310 }
311 
312 void
313 FibUpdater::addFibUpdate(FibUpdate update)
314 {
315  FibUpdateList& updates = (update.faceId == m_batchFaceId) ? m_updatesForBatchFaceId :
316  m_updatesForNonBatchFaceId;
317 
318  // If an update with the same name and route already exists,
319  // replace it
320  FibUpdateList::iterator it = std::find_if(updates.begin(), updates.end(),
321  [&update] (const FibUpdate& other) {
322  return update.name == other.name && update.faceId == other.faceId;
323  });
324 
325  if (it != updates.end()) {
326  FibUpdate& existingUpdate = *it;
327  existingUpdate.action = update.action;
328  existingUpdate.cost = update.cost;
329  }
330  else {
331  updates.push_back(update);
332  }
333 }
334 
335 void
336 FibUpdater::addInheritedRoutes(const RibEntry& entry, const Rib::RouteSet& routesToAdd)
337 {
338  for (const Route& route : routesToAdd) {
339  // Don't add an ancestor faceId if the namespace has an entry for that faceId
340  if (!entry.hasFaceId(route.faceId)) {
341  // Create a record of the inherited route so it can be added to the RIB later
342  addInheritedRoute(entry.getName(), route);
343 
344  addFibUpdate(FibUpdate::createAddUpdate(entry.getName(), route.faceId, route.cost));
345  }
346  }
347 }
348 
349 void
350 FibUpdater::addInheritedRoutes(const Name& name, const Rib::RouteSet& routesToAdd,
351  const Route& ignore)
352 {
353  for (const Route& route : routesToAdd) {
354  if (route.faceId != ignore.faceId) {
355  // Create a record of the inherited route so it can be added to the RIB later
356  addInheritedRoute(name, route);
357 
358  addFibUpdate(FibUpdate::createAddUpdate(name, route.faceId, route.cost));
359  }
360  }
361 }
362 
363 void
364 FibUpdater::removeInheritedRoutes(const RibEntry& entry, const Rib::Rib::RouteSet& routesToRemove)
365 {
366  for (const Route& route : routesToRemove) {
367  // Only remove if the route has been inherited
368  if (entry.hasInheritedRoute(route)) {
369  removeInheritedRoute(entry.getName(), route);
370  addFibUpdate(FibUpdate::createRemoveUpdate(entry.getName(), route.faceId));
371  }
372  }
373 }
374 
375 void
376 FibUpdater::createFibUpdatesForNewRibEntry(const Name& name, const Route& route,
377  const Rib::RibEntryList& children)
378 {
379  // Create FIB update for new entry
380  addFibUpdate(FibUpdate::createAddUpdate(name, route.faceId, route.cost));
381 
382  // No flags are set
383  if (!route.isChildInherit() && !route.isCapture()) {
384  // Add ancestor routes to self
385  addInheritedRoutes(name, m_rib.getAncestorRoutes(name), route);
386  }
387  else if (route.isChildInherit() && route.isCapture()) {
388  // Add route to children
389  Rib::RouteSet routesToAdd;
390  routesToAdd.insert(route);
391 
392  // Remove routes blocked by capture and add self to children
393  modifyChildrensInheritedRoutes(children, routesToAdd, m_rib.getAncestorRoutes(name));
394  }
395  else if (route.isChildInherit()) {
396  Rib::RouteSet ancestorRoutes = m_rib.getAncestorRoutes(name);
397 
398  // Add ancestor routes to self
399  addInheritedRoutes(name, ancestorRoutes, route);
400 
401  // If there is an ancestor route which is the same as the new route, replace it
402  // with the new route
403  Rib::RouteSet::iterator it = ancestorRoutes.find(route);
404 
405  // There is a route that needs to be overwritten, erase and then replace
406  if (it != ancestorRoutes.end()) {
407  ancestorRoutes.erase(it);
408  }
409 
410  // Add new route to ancestor list so it can be added to children
411  ancestorRoutes.insert(route);
412 
413  // Add ancestor routes to children
414  modifyChildrensInheritedRoutes(children, ancestorRoutes, Rib::RouteSet());
415  }
416  else if (route.isCapture()) {
417  // Remove routes blocked by capture
418  modifyChildrensInheritedRoutes(children, Rib::RouteSet(), m_rib.getAncestorRoutes(name));
419  }
420 }
421 
422 void
423 FibUpdater::createFibUpdatesForNewRoute(const RibEntry& entry, const Route& route,
424  bool captureWasTurnedOn)
425 {
426  // Only update if the new route has a lower cost than a previously installed route
427  const Route* prevRoute = entry.getRouteWithLowestCostAndChildInheritByFaceId(route.faceId);
428 
429  Rib::RouteSet routesToAdd;
430  if (route.isChildInherit()) {
431  // Add to children if this new route doesn't override a previous lower cost, or
432  // add to children if this new route is lower cost than a previous route.
433  // Less than equal, since entry may find this route
434  if (prevRoute == nullptr || route.cost <= prevRoute->cost) {
435  // Add self to children
436  routesToAdd.insert(route);
437  }
438  }
439 
440  Rib::RouteSet routesToRemove;
441  if (captureWasTurnedOn) {
442  // Capture flag on
443  routesToRemove = m_rib.getAncestorRoutes(entry);
444 
445  // Remove ancestor routes from self
446  removeInheritedRoutes(entry, routesToRemove);
447  }
448 
449  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, routesToRemove);
450 
451  // If another route with same faceId and lower cost exists, don't update.
452  // Must be done last so that add updates replace removal updates
453  // Create FIB update for new entry
454  const Route* other = entry.getRouteWithLowestCostByFaceId(route.faceId);
455 
456  if (other == nullptr || route.cost <= other->cost) {
457  addFibUpdate(FibUpdate::createAddUpdate(entry.getName(), route.faceId, route.cost));
458  }
459 }
460 
461 void
462 FibUpdater::createFibUpdatesForUpdatedRoute(const RibEntry& entry, const Route& route,
463  const Route& existingRoute)
464 {
465  const bool costDidChange = (route.cost != existingRoute.cost);
466 
467  // Look for an installed route with the lowest cost and child inherit set
468  const Route* prevRoute = entry.getRouteWithLowestCostAndChildInheritByFaceId(route.faceId);
469 
470  // No flags changed and cost didn't change, no change in FIB
471  if (route.flags == existingRoute.flags && !costDidChange) {
472  return;
473  }
474 
475  // Cost changed so create update for the entry itself
476  if (costDidChange) {
477  // Create update if this route's cost is lower than other routes
478  if (route.cost <= entry.getRouteWithLowestCostByFaceId(route.faceId)->cost) {
479  // Create FIB update for the updated entry
480  addFibUpdate(FibUpdate::createAddUpdate(entry.getName(), route.faceId, route.cost));
481  }
482  else if (existingRoute.cost < entry.getRouteWithLowestCostByFaceId(route.faceId)->cost) {
483  // Create update if this route used to be the lowest route but is no longer
484  // the lowest cost route.
485  addFibUpdate(FibUpdate::createAddUpdate(entry.getName(), prevRoute->faceId, prevRoute->cost));
486  }
487 
488  // If another route with same faceId and lower cost and ChildInherit exists,
489  // don't update children.
490  if (prevRoute == nullptr || route.cost <= prevRoute->cost) {
491  // If no flags changed but child inheritance is set, need to update children
492  // with new cost
493  if ((route.flags == existingRoute.flags) && route.isChildInherit()) {
494  // Add self to children
495  Rib::RouteSet routesToAdd;
496  routesToAdd.insert(route);
497  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, Rib::RouteSet());
498 
499  return;
500  }
501  }
502  }
503 
504  // Child inherit was turned on
505  if (!existingRoute.isChildInherit() && route.isChildInherit()) {
506  // If another route with same faceId and lower cost and ChildInherit exists,
507  // don't update children.
508  if (prevRoute == nullptr || route.cost <= prevRoute->cost) {
509  // Add self to children
510  Rib::RouteSet routesToAdd;
511  routesToAdd.insert(route);
512  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, Rib::RouteSet());
513  }
514  } // Child inherit was turned off
515  else if (existingRoute.isChildInherit() && !route.isChildInherit()) {
516  // Remove self from children
517  Rib::RouteSet routesToRemove;
518  routesToRemove.insert(route);
519 
520  Rib::RouteSet routesToAdd;
521  // If another route with same faceId and ChildInherit exists, update children with this route.
522  if (prevRoute != nullptr) {
523  routesToAdd.insert(*prevRoute);
524  }
525  else {
526  // Look for an ancestor that was blocked previously
527  const Rib::RouteSet ancestorRoutes = m_rib.getAncestorRoutes(entry);
528  Rib::RouteSet::iterator it = ancestorRoutes.find(route);
529 
530  // If an ancestor is found, add it to children
531  if (it != ancestorRoutes.end()) {
532  routesToAdd.insert(*it);
533  }
534  }
535 
536  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, routesToRemove);
537  }
538 
539  // Capture was turned on
540  if (!existingRoute.isCapture() && route.isCapture()) {
541  Rib::RouteSet ancestorRoutes = m_rib.getAncestorRoutes(entry);
542 
543  // Remove ancestor routes from self
544  removeInheritedRoutes(entry, ancestorRoutes);
545 
546  // Remove ancestor routes from children
547  modifyChildrensInheritedRoutes(entry.getChildren(), Rib::RouteSet(), ancestorRoutes);
548  } // Capture was turned off
549  else if (existingRoute.isCapture() && !route.isCapture()) {
550  Rib::RouteSet ancestorRoutes = m_rib.getAncestorRoutes(entry);
551 
552  // Add ancestor routes to self
553  addInheritedRoutes(entry, ancestorRoutes);
554 
555  // Add ancestor routes to children
556  modifyChildrensInheritedRoutes(entry.getChildren(), ancestorRoutes, Rib::RouteSet());
557  }
558 }
559 
560 void
561 FibUpdater::createFibUpdatesForErasedRoute(const RibEntry& entry, const Route& route,
562  const bool captureWasTurnedOff)
563 {
564  addFibUpdate(FibUpdate::createRemoveUpdate(entry.getName(), route.faceId));
565 
566  if (route.isChildInherit() && route.isCapture()) {
567  // Remove self from children
568  Rib::RouteSet routesToRemove;
569  routesToRemove.insert(route);
570 
571  // If capture is turned off for the route and another route is installed in the RibEntry,
572  // add ancestors to self
573  Rib::RouteSet routesToAdd;
574  if (captureWasTurnedOff && entry.getNRoutes() != 0) {
575  // Look for an ancestors that were blocked previously
576  routesToAdd = m_rib.getAncestorRoutes(entry);
577 
578  // Add ancestor routes to self
579  addInheritedRoutes(entry, routesToAdd);
580  }
581 
582  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, routesToRemove);
583  }
584  else if (route.isChildInherit()) {
585  // If not blocked by capture, add inherited routes to children
586  Rib::RouteSet routesToAdd;
587  if (!entry.hasCapture()) {
588  routesToAdd = m_rib.getAncestorRoutes(entry);
589  }
590 
591  Rib::RouteSet routesToRemove;
592  routesToRemove.insert(route);
593 
594  // Add ancestor routes to children
595  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, routesToRemove);
596  }
597  else if (route.isCapture()) {
598  // If capture is turned off for the route and another route is installed in the RibEntry,
599  // add ancestors to self
600  Rib::RouteSet routesToAdd;
601  if (captureWasTurnedOff && entry.getNRoutes() != 0) {
602  // Look for an ancestors that were blocked previously
603  routesToAdd = m_rib.getAncestorRoutes(entry);
604 
605  // Add ancestor routes to self
606  addInheritedRoutes(entry, routesToAdd);
607  }
608 
609  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, Rib::RouteSet());
610  }
611 
612  // Need to check if the removed route was blocking an inherited route
613  Rib::RouteSet ancestorRoutes = m_rib.getAncestorRoutes(entry);
614 
615  // If the current entry has capture set or is pending removal, don't add inherited route
616  if (!entry.hasCapture() && entry.getNRoutes() != 0) {
617  // If there is an ancestor route which is the same as the erased route, add that route
618  // to the current entry
619  Rib::RouteSet::iterator it = ancestorRoutes.find(route);
620 
621  if (it != ancestorRoutes.end()) {
622  addInheritedRoute(entry.getName(), *it);
623  addFibUpdate(FibUpdate::createAddUpdate(entry.getName(), it->faceId, it->cost));
624  }
625  }
626 }
627 
628 void
629 FibUpdater::createFibUpdatesForErasedRibEntry(const RibEntry& entry)
630 {
631  for (const Route& route : entry.getInheritedRoutes()) {
632  addFibUpdate(FibUpdate::createRemoveUpdate(entry.getName(), route.faceId));
633  }
634 }
635 
636 void
637 FibUpdater::modifyChildrensInheritedRoutes(const Rib::RibEntryList& children,
638  const Rib::RouteSet& routesToAdd,
639  const Rib::RouteSet& routesToRemove)
640 {
641  for (const auto& child : children) {
642  traverseSubTree(*child, routesToAdd, routesToRemove);
643  }
644 }
645 
646 void
647 FibUpdater::traverseSubTree(const RibEntry& entry, Rib::Rib::RouteSet routesToAdd,
648  Rib::Rib::RouteSet routesToRemove)
649 {
650  // If a route on the namespace has the capture flag set, ignore self and children
651  if (entry.hasCapture()) {
652  return;
653  }
654 
655  // Remove inherited routes from current namespace
656  for (Rib::RouteSet::const_iterator removeIt = routesToRemove.begin();
657  removeIt != routesToRemove.end(); )
658  {
659  // If a route on the namespace has the same face ID and child inheritance set,
660  // ignore this route
661  if (entry.hasChildInheritOnFaceId(removeIt->faceId)) {
662  routesToRemove.erase(removeIt++);
663  continue;
664  }
665 
666  // Only remove route if it removes an existing inherited route
667  if (entry.hasInheritedRoute(*removeIt)) {
668  removeInheritedRoute(entry.getName(), *removeIt);
669  addFibUpdate(FibUpdate::createRemoveUpdate(entry.getName(), removeIt->faceId));
670  }
671 
672  ++removeIt;
673  }
674 
675  // Add inherited routes to current namespace
676  for (Rib::RouteSet::const_iterator addIt = routesToAdd.begin(); addIt != routesToAdd.end(); ) {
677 
678  // If a route on the namespace has the same face ID and child inherit set, ignore this face
679  if (entry.hasChildInheritOnFaceId(addIt->faceId)) {
680  routesToAdd.erase(addIt++);
681  continue;
682  }
683 
684  // Only add route if it does not override an existing route
685  if (!entry.hasFaceId(addIt->faceId)) {
686  addInheritedRoute(entry.getName(), *addIt);
687  addFibUpdate(FibUpdate::createAddUpdate(entry.getName(), addIt->faceId, addIt->cost));
688  }
689 
690  ++addIt;
691  }
692 
693  modifyChildrensInheritedRoutes(entry.getChildren(), routesToAdd, routesToRemove);
694 }
695 
696 void
697 FibUpdater::addInheritedRoute(const Name& name, const Route& route)
698 {
699  RibUpdate update;
701  .setName(name)
702  .setRoute(route);
703 
704  m_inheritedRoutes.push_back(update);
705 }
706 
707 void
708 FibUpdater::removeInheritedRoute(const Name& name, const Route& route)
709 {
710  RibUpdate update;
712  .setName(name)
713  .setRoute(route);
714 
715  m_inheritedRoutes.push_back(update);
716 }
717 
718 } // namespace rib
719 } // namespace nfd
RibUpdate & setRoute(const Route &route)
Definition: rib-update.hpp:107
void start(const ControlParameters &parameters, const CommandSucceedCallback &onSuccess, const CommandFailCallback &onFailure, const CommandOptions &options=CommandOptions())
start command execution
const_iterator end() const
Definition: rib.hpp:243
FibUpdater(Rib &rib, ndn::nfd::Controller &controller)
Definition: fib-updater.cpp:42
represents the RIB
Definition: rib.hpp:45
#define NFD_LOG_DEBUG(expression)
Definition: logger.hpp:55
represents a fib/add-nexthop command
const Route & getRoute() const
Definition: rib-update.hpp:114
function< void(RibUpdateList inheritedRoutes)> FibUpdateSuccessCallback
Definition: fib-updater.hpp:57
time::steady_clock::TimePoint expires
Definition: route.hpp:84
iterator findRoute(const Route &route)
Definition: rib-entry.cpp:38
bool hasFaceId(const uint64_t faceId) const
Definition: rib-entry.cpp:84
represents a collection of RibUpdates to be applied to a single FaceId
size_t getNRoutes() const
Definition: rib-entry.cpp:92
const_iterator find(const Name &prefix) const
Definition: rib.cpp:59
bool isChildInherit() const
Definition: route.hpp:68
std::list< FibUpdate > FibUpdateList
Definition: fib-updater.hpp:55
uint64_t cost
Definition: route.hpp:83
uint64_t faceId
Definition: route.hpp:80
function< void(uint32_t code, const std::string &error)> FibUpdateFailureCallback
Definition: fib-updater.hpp:58
represents a fib/remove-nexthop command
const Name & getName() const
Definition: rib-entry.hpp:202
static const uint32_t ERROR_TIMEOUT
error code for timeout
std::set< Route, RouteComparePredicate > RouteSet
Definition: rib.hpp:53
represents a FIB update
Definition: fib-update.hpp:37
Table::const_iterator iterator
Definition: cs-internal.hpp:41
std::list< shared_ptr< RibEntry > > RibEntryList
Definition: rib.hpp:48
const Name & getName() const
Definition: rib-update.hpp:101
static FibUpdate createRemoveUpdate(const Name &name, const uint64_t faceId)
Definition: fib-update.cpp:45
Copyright (c) 2011-2015 Regents of the University of California.
Definition: ndn-common.hpp:40
static FibUpdate createAddUpdate(const Name &name, const uint64_t faceId, const uint64_t cost)
Definition: fib-update.cpp:32
const Route * getRouteWithLowestCostAndChildInheritByFaceId(uint64_t faceId) const
Returns the route with the lowest cost that has the passed face ID and its child inherit flag set...
Definition: rib-entry.cpp:225
RibUpdate & setAction(Action action)
Definition: rib-update.hpp:81
represents a RIB entry, which contains one or more Routes with the same prefix
Definition: rib-entry.hpp:36
represents a route for a name prefix
Definition: route.hpp:38
shared_ptr< RibEntry > findParent(const Name &prefix) const
Definition: rib.cpp:200
NFD Management protocol - ControlCommand client.
bool hasInheritedRoute(const Route &route) const
Determines if the entry has an inherited route with a matching face ID.
Definition: rib-entry.cpp:153
Name abstraction to represent an absolute name.
Definition: name.hpp:46
RibTable::const_iterator const_iterator
Definition: rib.hpp:50
bool hasChildInheritOnFaceId(uint64_t faceId) const
Determines if the entry has an inherited route with the passed face ID and its child inherit flag set...
Definition: rib-entry.cpp:167
#define NFD_LOG_INIT(name)
Definition: logger.hpp:34
uint64_t flags
Definition: route.hpp:82
RibUpdate & setName(const Name &name)
Definition: rib-update.hpp:94
RouteList::const_iterator const_iterator
Definition: rib-entry.hpp:41
const RouteList & getInheritedRoutes() const
Returns the routes this namespace has inherited.
Definition: rib-entry.hpp:232
void eraseRoute(const Route &route)
erases a Route with the same faceId and origin
Definition: rib-entry.cpp:69
std::list< shared_ptr< RibEntry > > findDescendantsForNonInsertedName(const Name &prefix) const
finds namespaces under the passed prefix
Definition: rib.cpp:236
std::string to_string(const V &v)
Definition: backports.hpp:55
bool hasCapture() const
Definition: rib-entry.cpp:161
An update triggered by a face destruction notification.
Definition: rib-update.hpp:51
void computeAndSendFibUpdates(const RibUpdateBatch &batch, const FibUpdateSuccessCallback &onSuccess, const FibUpdateFailureCallback &onFailure)
computes FibUpdates using the provided RibUpdateBatch and then sends the updates to NFD&#39;s FIB ...
Definition: fib-updater.cpp:50
const Route * getRouteWithLowestCostByFaceId(uint64_t faceId) const
Returns the route with the lowest cost that has the passed face ID.
Definition: rib-entry.cpp:179
bool isCapture() const
Definition: route.hpp:74
void setFibUpdater(FibUpdater *updater)
Definition: rib.cpp:53
const std::list< shared_ptr< RibEntry > > & getChildren() const
Definition: rib-entry.hpp:220