| /third_party/uapp/dash/src/ |
| A D | nodes.h | 40 union node *args;
55 union node *n;
62 union node *ch1;
63 union node *ch2;
69 union node *test;
78 union node *args;
79 union node *body;
87 union node *expr;
148 union node { union
169 union node *n;
[all …]
|
| A D | redir.h | 45 union node;
46 void redirect(union node *, int);
50 int redirectsafe(union node *, int);
52 struct redirtab *pushredir(union node *redir);
|
| A D | eval.h | 55 union node; /* BLETCH for ansi C */
56 int evaltree(union node *, int);
57 void evalbackcmd(union node *, struct backcmd *);
58 void evaltreenr(union node *, int) __attribute__ ((__noreturn__));
|
| A D | parser.c | 132 union node *
146 STATIC union node *
217 STATIC union node *
245 STATIC union node *
289 STATIC union node *
296 union node **rpp2; in command()
576 union node *n; in makename()
647 union node *n; in parseheredoc()
1127 union node *np; in readtoken1()
1310 union node *n; in readtoken1()
[all …]
|
| A D | expand.h | 64 union node;
65 void expandarg(union node *, struct arglist *, int);
69 int casematch(union node *, char *);
|
| A D | redir.c | 80 STATIC int openredirect(union node *);
82 STATIC void dupredirect(union node *, int, char[10]);
84 STATIC void dupredirect(union node *, int);
86 STATIC int openhere(union node *);
98 redirect(union node *redir, int flags) in redirect()
100 union node *n; in redirect()
168 openredirect(union node *redir) in openredirect()
248 union node *redir; in dupredirect()
296 openhere(union node *redir) in openhere()
414 redirectsafe(union node *redir, int flags) in redirectsafe()
[all …]
|
| A D | parser.h | 80 #define NEOF ((union node *)&tokpushback)
85 union node *parsecmd(int);
86 void fixredir(union node *, const char *, int);
|
| A D | eval.c | 85 STATIC void expredir(union node *);
94 STATIC void prehash(union node *);
160 union node *n; in evalstring()
386 evalfor(union node *n, int flags) in evalfor()
389 union node *argp; in evalfor()
428 union node *cp; in evalcase()
429 union node *patp; in evalcase()
520 expredir(union node *n) in expredir()
522 union node *redir; in expredir()
713 union node *argp; in evalcommand()
[all …]
|
| A D | jobs.h | 103 struct job *makejob(union node *, int);
104 int forkshell(struct job *, union node *, int);
105 void forkparent(struct job *, union node *, int, pid_t);
|
| A D | show.h | 37 union node;
38 void showtree(union node *);
|
| A D | nodes.c.pat | 62 STATIC void calcsize(union node *);
64 STATIC union node *copynode(union node *);
69 STATIC void encodenode(union node *);
73 STATIC void decodenode(union node **);
82 copyfunc(union node *n)
103 union node *n;
123 STATIC union node *
125 union node *n;
127 union node *new;
178 encodenode(union node *n)
[all …]
|
| A D | process.h | 10 union node;
16 zx_status_t process_subshell(union node* n, const char* const* envp,
|
| A D | show.c | 48 static void shtree(union node *, int, char *, FILE*);
49 static void shcmd(union node *, FILE *);
50 static void sharg(union node *, FILE *);
56 showtree(union node *n) in showtree()
64 shtree(union node *n, int ind, char *pfx, FILE *fp) in shtree()
115 shcmd(union node *cmd, FILE *fp) in shcmd()
117 union node *np; in shcmd()
157 sharg(union node *arg, FILE *fp) in sharg()
|
| A D | nodes.c | 93 STATIC void calcsize(union node *);
95 STATIC union node *copynode(union node *);
100 STATIC void encodenode(union node *);
113 copyfunc(union node *n) in copyfunc()
134 union node *n; in calcsize()
229 STATIC union node *
231 union node *n; in copynode()
233 union node *new;
371 encodenode(union node *n) in encodenode()
483 decodenode(union node **npp) in decodenode()
[all …]
|
| /third_party/ulib/musl/src/thread/ |
| A D | cnd_timedwait.c | 34 struct waiter node = { in cnd_timedwait() local
41 node.next = c->_c_head; in cnd_timedwait()
42 c->_c_head = &node; in cnd_timedwait()
44 c->_c_tail = &node; in cnd_timedwait()
46 node.next->prev = &node; in cnd_timedwait()
85 else if (node.prev) in cnd_timedwait()
86 node.prev->next = node.next; in cnd_timedwait()
89 else if (node.next) in cnd_timedwait()
90 node.next->prev = node.prev; in cnd_timedwait()
103 if (node.notify) { in cnd_timedwait()
[all …]
|
| /third_party/ulib/musl/pthread/ |
| A D | pthread_cond_timedwait.c | 47 struct waiter node = { in pthread_cond_timedwait() local
55 node.next = c->_c_head; in pthread_cond_timedwait()
56 c->_c_head = &node; in pthread_cond_timedwait()
58 c->_c_tail = &node; in pthread_cond_timedwait()
60 node.next->prev = &node; in pthread_cond_timedwait()
99 else if (node.prev) in pthread_cond_timedwait()
100 node.prev->next = node.next; in pthread_cond_timedwait()
104 node.next->prev = node.prev; in pthread_cond_timedwait()
117 if (node.notify) { in pthread_cond_timedwait()
152 if (!node.next) in pthread_cond_timedwait()
[all …]
|
| /third_party/ulib/jemalloc/include/jemalloc/internal/ |
| A D | rb.h | 465 a_type *node; \
472 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
482 pathp->node = node; \
535 a_type *node; \
542 int cmp = pathp->cmp = a_cmp(node, pathp->node); \
563 assert(nodep->node == node); \
565 if (pathp->node != node) { \
581 nodep->node = pathp->node; \
582 pathp->node = node; \
880 a_field, node), cb, arg)) != NULL || (ret = cb(rbtree, node, \
[all …]
|
| A D | rtree_inlines.h | 10 bool rtree_node_valid(rtree_elm_t *node);
83 rtree_node_valid(rtree_elm_t *node) in rtree_node_valid() argument
85 return ((uintptr_t)node != (uintptr_t)0); in rtree_node_valid()
181 rtree_elm_t *node; in rtree_elm_lookup() local
199 node = rtree_ctx->elms[ctx_start_level]; in rtree_elm_lookup()
202 node = init_missing ? in rtree_elm_lookup()
210 node; in rtree_elm_lookup()
251 node; \ in rtree_elm_lookup()
268 node = &node[subkey]; \ in rtree_elm_lookup()
271 node; \ in rtree_elm_lookup()
[all …]
|
| A D | ctl_structs.h | 9 struct ctl_node_s node; member
19 struct ctl_node_s node; member
|
| /third_party/ulib/jemalloc/test/unit/ |
| A D | rb.c | 77 if (node == NULL) in tree_recurse()
83 if (!rbtn_red_get(node_t, link, node)) in tree_recurse()
124 assert_ptr_eq(search_node, node, in tree_iterate_cb()
129 assert_ptr_eq(search_node, node, in tree_iterate_cb()
134 assert_ptr_eq(search_node, node, in tree_iterate_cb()
170 tree_remove(tree, node); in node_remove()
186 node->magic = 0; in node_remove()
201 node_t *ret = tree_next(tree, node); in remove_iterate_cb()
203 node_remove(tree, node, *nnodes); in remove_iterate_cb()
214 node_remove(tree, node, *nnodes); in remove_reverse_iterate_cb()
[all …]
|
| A D | ph.c | 49 malloc_printf("%2"FMTu64"\n", node->key); in node_print()
149 node_remove(heap_t *heap, node_t *node) in node_remove() argument
151 heap_remove(heap, node); in node_remove()
153 node->magic = 0; in node_remove()
160 node->magic = 0; in node_remove_first()
161 return (node); in node_remove_first()
243 assert_d_ge(node_cmp(node, in TEST_BEGIN()
247 prev = node; in TEST_BEGIN()
257 assert_d_ge(node_cmp(node, in TEST_BEGIN()
261 node_remove(&heap, node); in TEST_BEGIN()
[all …]
|
| A D | rtree.c | 11 rtree_elm_t *node; in rtree_node_alloc_intercept() local
17 node = (rtree_elm_t *)calloc(nelms, sizeof(rtree_elm_t)); in rtree_node_alloc_intercept()
18 assert_ptr_not_null(node, "Unexpected calloc() failure"); in rtree_node_alloc_intercept()
21 return (node); in rtree_node_alloc_intercept()
25 rtree_node_dalloc_intercept(tsdn_t *tsdn, rtree_t *rtree, rtree_elm_t *node) in rtree_node_dalloc_intercept() argument
28 rtree_node_dalloc_orig(tsdn, rtree, node); in rtree_node_dalloc_intercept()
32 free(node); in rtree_node_dalloc_intercept()
|
| /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
142 return node; in tre_ast_new_node()
152 if (!node) in tre_ast_new_literal()
157 return node; in tre_ast_new_literal()
167 if (!node) in tre_ast_new_iter()
174 return node; in tre_ast_new_iter()
191 return node; in tre_ast_new_union()
203 if (!node) in tre_ast_new_catenation()
208 return node; in tre_ast_new_catenation()
644 node = tre_ast_new_union(ctx->mem, node, n); in parse_bracket()
[all …]
|
| /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() argument
100 rtree_delete_subtree(tsdn_t *tsdn, rtree_t *rtree, rtree_elm_t *node, in rtree_delete_subtree() argument
108 rtree_elm_t *child = node[i].child; in rtree_delete_subtree()
115 rtree_node_dalloc(tsdn, rtree, node); in rtree_delete_subtree()
135 rtree_elm_t *node; in rtree_node_init() local
138 node = atomic_read_p((void**)elmp); in rtree_node_init()
139 if (node == NULL) { in rtree_node_init()
140 node = rtree_node_alloc(tsdn, rtree, ZU(1) << in rtree_node_init()
142 if (node == NULL) { in rtree_node_init()
146 atomic_write_p((void **)elmp, node); in rtree_node_init()
[all …]
|
| A D | ctl.c | 22 return ((node->named) ? (const ctl_named_node_t *)node : NULL); in ctl_named_node()
36 return (!node->named ? (const ctl_indexed_node_t *)node : NULL); in ctl_indexed_node()
848 assert(node); in ctl_lookup()
859 node = child; in ctl_lookup()
867 if (node == pnode) { in ctl_lookup()
884 if (node == NULL) { in ctl_lookup()
947 if (node != NULL && node->ctl) in ctl_byname()
989 assert(node); in ctl_bymib()
997 node = ctl_named_children(node, mib[i]); in ctl_bymib()
1004 if (node == NULL) { in ctl_bymib()
[all …]
|