cs-list.h

Go to the documentation of this file.

#ifndef NDNDPDK_PCCT_CS_LIST_H
#define NDNDPDK_PCCT_CS_LIST_H

 
#include "cs-entry.h"
 
__attribute__((nonnull)) void
CsList_Init(CsList* csl);
 
static __rte_always_inline void
CsList_AppendNode_(CsList* csl, CsNode* node) {
  CsNode* last = csl->prev;
  node->prev = last;
  node->next = (CsNode*)csl;
  last->next = node;
  csl->prev = node;
}
 
static __rte_always_inline void
CsList_RemoveNode_(CsList* csl, CsNode* node) {
  CsNode* prev = node->prev;
  CsNode* next = node->next;
  NDNDPDK_ASSERT(prev->next == node);
  NDNDPDK_ASSERT(next->prev == node);
  prev->next = next;
  next->prev = prev;
}

__attribute__((nonnull)) static __rte_always_inline void
CsList_Append(CsList* csl, CsEntry* entry) {
  CsList_AppendNode_(csl, (CsNode*)entry);
  ++csl->count;
}

__attribute__((nonnull)) static __rte_always_inline void
CsList_Remove(CsList* csl, CsEntry* entry) {
  NDNDPDK_ASSERT(csl->count > 0);
  CsList_RemoveNode_(csl, (CsNode*)entry);
  --csl->count;
}

__attribute__((nonnull, returns_nonnull)) static __rte_always_inline CsEntry*
CsList_GetFront(CsList* csl) {
  NDNDPDK_ASSERT(csl->count > 0);
  return (CsEntry*)csl->next;
}

__attribute__((nonnull)) static __rte_always_inline void
CsList_MoveToLast(CsList* csl, CsEntry* entry) {
  CsList_RemoveNode_(csl, (CsNode*)entry);
  CsList_AppendNode_(csl, (CsNode*)entry);
}
 
typedef void (*CsList_EvictCb)(CsEntry* entry, uintptr_t ctx);

__attribute__((nonnull)) uint32_t
CsList_EvictBulk(CsList* csl, uint32_t max, CsList_EvictCb cb, uintptr_t ctx);
 
#endif // NDNDPDK_PCCT_CS_LIST_H