fib.hpp

Go to the documentation of this file.

 
#pragma once
 
#include "ndn/common.hpp"
#include "ndn/name.hpp"
 
namespace ndn {
 
constexpr size_t FIB_MAX_ENTRIES = 30;
 
constexpr size_t FIB_MAX_NEXTHOPS = 3;
 
struct FibNexthop {
    FaceId faceId = FACE_ID_INVALID;  
    uint8_t cost = 0;                 
};
 
class FibEntry {
public:
    const Name& prefix() const { return prefix_; }
 
    size_t nexthopCount() const { return numNexthops_; }
 
    const FibNexthop& nexthop(size_t index) const;
 
    bool addNexthop(FaceId faceId, uint8_t cost = 0);
 
    bool removeNexthop(FaceId faceId);
private:
    friend class Fib;
    Name prefix_;                                          
    std::array<FibNexthop, FIB_MAX_NEXTHOPS> nexthops_{};  
    uint8_t numNexthops_ = 0;                              
    bool inUse_ = false;                                   
};
 
class Fib {
public:
    Error addRoute(const Name& prefix, FaceId faceId, uint8_t cost = 0);
 
    void removeRoute(const Name& prefix, FaceId faceId);
 
    void removeRoute(const Name& prefix);
 
    void removeFace(FaceId faceId);
    const FibEntry* findLongestMatch(const Name& name) const;
 
    const FibEntry* findExact(const Name& prefix) const;
 
    FibEntry* findExact(const Name& prefix);
    size_t size() const { return size_; }
 
    size_t capacity() const { return FIB_MAX_ENTRIES; }
private:
    std::array<FibEntry, FIB_MAX_ENTRIES> entries_{};  
    size_t size_ = 0;                                  
};
 
}  // namespace ndn