| /third_party/ulib/jemalloc/test/unit/ |
| A D | ph.c | 42 node_print(const node_t *node, unsigned depth) in node_print()
86 node_validate(const node_t *node, const node_t *parent) in node_validate()
149 node_remove(heap_t *heap, node_t *node) in node_remove()
159 node_t *node = heap_remove_first(heap); in node_remove_first() local
239 node_t *node = node_remove_first(&heap); in TEST_BEGIN() local
253 node_t *node = heap_first(&heap); in TEST_BEGIN() local
|
| A D | rb.c | 71 tree_recurse(node_t *node, unsigned black_height, unsigned black_depth) in tree_recurse()
115 tree_iterate_cb(tree_t *tree, node_t *node, void *data) in tree_iterate_cb()
165 node_remove(tree_t *tree, node_t *node, unsigned nnodes) in node_remove()
198 remove_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_iterate_cb()
209 remove_reverse_iterate_cb(tree_t *tree, node_t *node, void *data) in remove_reverse_iterate_cb()
220 destroy_cb(node_t *node, void *data) in destroy_cb()
|
| A D | rtree.c | 11 rtree_elm_t *node; in rtree_node_alloc_intercept() local
25 rtree_node_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree, rtree_elm_t *node) in rtree_node_dalloc_intercept()
|
| /third_party/ulib/jemalloc/src/ |
| A D | rtree.c | 87 rtree_node_dalloc(tsdn_t *tsdn, rtree_t *rtree, rtree_elm_t *node) in rtree_node_dalloc()
100 rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_elm_t *node, in rtree_delete_subtree()
135 rtree_elm_t *node; in rtree_node_init() local
|
| A D | ctl.c | 20 ctl_named_node(const ctl_node_t *node) in ctl_named_node()
26 ctl_named_children(const ctl_named_node_t *node, size_t index) in ctl_named_children()
34 ctl_indexed_node(const ctl_node_t *node) in ctl_indexed_node()
836 const ctl_named_node_t *node; in ctl_lookup() local
934 const ctl_named_node_t *node; in ctl_byname() local
978 const ctl_named_node_t *node; in ctl_bymib() local
|
| /third_party/ulib/musl/third_party/tre/ |
| A D | regcomp.c | 135 tre_ast_node_t* node = tre_mem_calloc(mem, sizeof *node); in tre_ast_new_node() local
147 tre_ast_node_t* node; in tre_ast_new_literal() local
162 tre_ast_node_t* node; in tre_ast_new_iter() local
179 tre_ast_node_t* node; in tre_ast_new_union() local
196 tre_ast_node_t* node; in tre_ast_new_catenation() local
578 tre_ast_node_t *node = 0, *n; in parse_bracket() local
736 tre_ast_node_t* node; in parse_atom() local
1126 tre_ast_node_t* node = tree; /* Tree node we are currently looking at. */ in tre_add_tags() local
1567 tre_ast_node_t* node; in tre_copy_ast() local
1692 tre_ast_node_t* node; in tre_expand_ast() local
[all …]
|
| /third_party/ulib/musl/src/thread/ |
| A D | cnd_timedwait.c | 34 struct waiter node = { in cnd_timedwait() local
|
| /third_party/ulib/jemalloc/include/jemalloc/internal/ |
| A D | ctl_structs.h | 9 struct ctl_node_s node; member
19 struct ctl_node_s node; member
|
| A D | rtree_inlines.h | 83 rtree_node_valid(rtree_elm_t *node) in rtree_node_valid()
181 rtree_elm_t *node; in rtree_elm_lookup() local
|
| /third_party/ulib/musl/pthread/ |
| A D | pthread_cond_timedwait.c | 47 struct waiter node = { in pthread_cond_timedwait() local
|
| /third_party/ulib/musl/src/network/ |
| A D | getnameinfo.c | 57 int getnameinfo(const struct sockaddr* restrict sa, socklen_t sl, char* restrict node, in getnameinfo()
|
| /third_party/uapp/dash/src/ |
| A D | nodes.h | 148 union node { union
|
| A D | jobs.c | 751 makejob(union node *node, int nprocs) in makejob()
|
| /third_party/dev/ethernet/e1000/ |
| A D | fuchsia.c | 89 list_node_t node; member
|