NDN-DPDK
High-Speed Named Data Networking Forwarder
All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
cs.h
Go to the documentation of this file.
1 #ifndef NDNDPDK_PCCT_CS_H
2 #define NDNDPDK_PCCT_CS_H
3 
6 #include "cs-arc.h"
7 #include "pcct.h"
8 #include "pit-result.h"
9 
11 __attribute__((nonnull)) uint32_t
12 Cs_GetCapacity(Cs* cs, CsListID l);
13 
15 __attribute__((nonnull)) uint32_t
17 
25 __attribute__((nonnull)) void
26 Cs_Insert(Cs* cs, Packet* npkt, PitFindResult pitFound);
27 
33 __attribute__((nonnull)) CsEntry*
34 Cs_MatchInterest(Cs* cs, CsEntry* entry, Packet* interestNpkt);
35 
40 __attribute__((nonnull)) void
41 Cs_Erase(Cs* cs, CsEntry* entry);
42 
43 #endif // NDNDPDK_PCCT_CS_H
CsListID
Definition: cs-enum.h:18
void Cs_Insert(Cs *cs, Packet *npkt, PitFindResult pitFound)
Insert a CS entry.
Definition: cs.c:233
uint32_t Cs_GetCapacity(Cs *cs, CsListID l)
Get capacity in number of entries.
Definition: cs.c:86
CsEntry * Cs_MatchInterest(Cs *cs, CsEntry *entry, Packet *interestNpkt)
Determine whether the CS entry matches an Interest during PIT insertion.
Definition: cs.c:278
void Cs_Erase(Cs *cs, CsEntry *entry)
Erase a CS entry.
Definition: cs.c:340
uint32_t Cs_CountEntries(Cs *cs, CsListID l)
Get number of entries.
Definition: cs.c:94
struct Packet Packet
Definition: common.h:11
A CS entry.
Definition: cs-entry.h:22
The Content Store (CS).
Definition: cs-struct.h:63
Result of PIT find.
Definition: pit-result.h:37