Searched refs:prev (Results 1 – 3 of 3) sorted by relevance
34 struct NLIBQueue *prev; /**< previous (or tail) item */ member40 #define NLIB_Queue_Init(queue) ((queue)->next = (queue)->prev = NULL)50 #define NLIB_Queue_QueryTail(queue) ((queue)->prev)55 #define NLIB_Queue_QueryLinkPrev(item, link) ((item)->link.prev)77 (item)->link.prev = (NLIBQueue*) (previtem); \81 (queue)->prev = (NLIBQueue*) (item); \83 ((type) (item)->link.next)->link.prev = (NLIBQueue*) (item); \91 (item)->link.prev = (afteritem)->link.prev; \93 (afteritem)->link.prev = (NLIBQueue*) (item); \94 if (NLIB_Queue_IsEnd(queue, (item)->link.prev)) \[all …]
366 NNSiFndExpHeapMBlockHead *const prev = block->pMBHeadPrev; in RemoveMBlock() local370 if (prev) in RemoveMBlock()372 prev->pMBHeadNext = next; in RemoveMBlock()382 next->pMBHeadPrev = prev; in RemoveMBlock()386 list->tail = prev; in RemoveMBlock()389 return prev; in RemoveMBlock()396 NNSiFndExpHeapMBlockHead* prev in InsertMBlock() argument402 target->pMBHeadPrev = prev; in InsertMBlock()403 if (prev) in InsertMBlock()405 next = prev->pMBHeadNext; in InsertMBlock()[all …]
336 OrderNode& prev = GetNode(node.prevIndex); in Unlink() local338 prev.nextIndex = node.nextIndex; in Unlink()