Lines Matching refs:stack

7 DPDK's stack library provides an API for configuration and use of a bounded
8 stack of pointers.
10 The stack library provides the following basic operations:
12 *  Create a uniquely named stack of a user-specified size and using a
16 *  Push and pop a burst of one or more stack objects (pointers). These function
19 *  Free a previously created stack.
21 *  Lookup a pointer to a stack by its name.
23 *  Query a stack's current depth and number of free entries.
36 The lock-based stack consists of a contiguous array of pointers, a current
37 index, and a spinlock. Accesses to the stack are made multi-thread safe by the
45 The lock-free stack consists of a linked list of elements, each containing a
46 data pointer and a next pointer, and an atomic stack depth counter. The
52 list's tail to the current stack head, and using a CAS to swing the stack head
55 adjusts the stack length and returns.
58 adjusting the stack length, to ensure the dequeue operation will succeed
64 allocated before stack pushes and freed after stack pops. Since the stack has a
73 To prevent the ABA problem, this algorithm stack uses a 128-bit
74 compare-and-swap instruction to atomically update both the stack top pointer