Home
last modified time | relevance | path

Searched refs:scratch (Results 1 – 2 of 2) sorted by relevance

/mOS-networking-stack/core/src/include/
H A Dtree.h88 (assert(&(scratch)->stack[sizeof((scratch)->stack)] > (scratch)->sp), \
91 (*(((scratch)->sp)--))
94 for ((scratch)->stack[0] = NULL, (scratch)->sp = (scratch)->stack, \
104 for ((scratch)->stack[0] = NULL, (scratch)->sp = (scratch)->stack, \
116 (*(((scratch)->head)++))
119 for ((scratch)->head = (scratch)->tail = (scratch)->queue, \
126 : (scratch)->head != (scratch)->tail \
135 : (scratch)->head != (scratch)->tail \
141 for ((scratch)->head = (scratch)->tail = (scratch)->queue, \
148 : (scratch)->head != (scratch)->tail \
[all …]
/mOS-networking-stack/core/test/tree/
H A Dtest.c14 TREE_SCRATCH(tree, 10) scratch; in main()
30 TREE_DFS_FOREACH(walk, &nodes[0], &scratch, link) in main()
33 TREE_BFS_FOREACH(walk, &nodes[0], &scratch, link) in main()