Home
last modified time | relevance | path

Searched refs:stack (Results 1 – 4 of 4) sorted by relevance

/mOS-networking-stack/
H A DREADME.md1 …vis-ci.org/ndsl-kaist/mOS-networking-stack.svg?branch=master)](https://travis-ci.org/ndsl-kaist/mO…
2 …an.coverity.com/projects/11918/badge.svg)](https://scan.coverity.com/projects/mos-networking-stack)
4 # mOS-networking-stack
6 mOS networking stack provides a high performance user-space programming library
9 codebase of future middleboxes that are developed on our stack.
17 # git clone https://github.com/ndsl-kaist/mOS-networking-stack.git
/mOS-networking-stack/core/src/include/
H A Dtree.h18 qual type *stack[(size)]; \
88 (assert(&(scratch)->stack[sizeof((scratch)->stack)] > (scratch)->sp), \
94 for ((scratch)->stack[0] = NULL, (scratch)->sp = (scratch)->stack, \
104 for ((scratch)->stack[0] = NULL, (scratch)->sp = (scratch)->stack, \
/mOS-networking-stack/core/src/
H A Dscalable_event.c46 struct _tree_node_t *stack[MAX_EVENTS]; member
135 TREE_SCRATCH(_tree_node_t, MAX_DEPTH) stack; in tree_del_recursive()
137 TREE_DFS_FOREACH(walk, node, &stack, link) { in tree_del_recursive()
157 TREE_SCRATCH(_tree_node_t, MAX_DEPTH) stack; in tree_search()
159 TREE_DFS_FOREACH(walk, root, &stack, link) in tree_search()
325 TREE_SCRATCH(_tree_node_t, MAX_DEPTH) stack;
339 TREE_DFS_FOREACH(w, stree->root, &stack, link) {
374 TREE_SCRATCH(_tree_node_t, MAX_DEPTH) stack; in RegCb()
566 TREE_SCRATCH(_tree_node_t, MAX_DEPTH) stack; in UnregCb()
815 (assert(&(s)->stack[sizeof((s)->stack) / sizeof(void *)] > (s)->sp), \
[all …]
H A Devent_callback.c668 } stack[NUM_UDE + 1], *sp = stack; in HandleCallback() local
699 if (sp == stack /* stack is empty */) { in HandleCallback()