Lines Matching refs:or
38 An element ``value`` can be added to a queue or stack using the
40 ``BPF_ANY`` or ``BPF_EXIST``. If ``flags`` is set to ``BPF_EXIST`` then,
41 when the queue or stack is full, the oldest element will be removed to
42 make room for ``value`` to be added. Returns ``0`` on success, or
52 This helper fetches an element ``value`` from a queue or stack without
53 removing it. Returns ``0`` on success, or negative error in case of
63 This helper removes an element into ``value`` from a queue or
64 stack. Returns ``0`` on success, or negative error in case of failure.
77 A userspace program can push ``value`` onto a queue or stack using libbpf's
79 ``NULL`` and ``flags`` must be set to ``BPF_ANY`` or ``BPF_EXIST``, with the
81 success, or negative error in case of failure.
90 A userspace program can peek at the ``value`` at the head of a queue or stack
92 set to ``NULL``. Returns ``0`` on success, or negative error in case of
102 A userspace program can pop a ``value`` from the head of a queue or stack using
104 must be set to ``NULL``. Returns ``0`` on success, or negative error in case of