Lines Matching refs:a

7 DPDK's stack library provides an API for configuration and use of a bounded
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
48 and one thread being preempted/delayed in a push or pop operation will not
51 The lock-free push operation enqueues a linked list of pointers by pointing the
52 list's tail to the current stack head, and using a CAS to swing the stack head
60 from the head -- then swinging the head pointer (using a CAS as well). While
63 The linked list elements themselves are maintained in a lock-free LIFO, and are
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
75 and a modification counter. The ABA problem can occur without a modification
81 3. Thread A changes the head pointer with a compare-and-swap and succeeds.
84 both pop stale data and incorrect change the head pointer. By adding a