| /dflybsd-src/usr.bin/dc/ |
| H A D | stack.c | 28 static __inline bool stack_empty(const struct stack *);
29 static void stack_grow(struct stack *);
38 stack_init(struct stack *stack) in stack_init() argument
40 stack->size = 0; in stack_init()
41 stack->sp = -1; in stack_init()
42 stack->stack = NULL; in stack_init()
46 stack_empty(const struct stack *stack) in stack_empty() argument
48 bool empty = stack->sp == -1; in stack_empty()
99 stack_size(const struct stack *stack) in stack_size() argument
101 return stack->sp + 1; in stack_size()
[all …]
|
| H A D | extern.h | 46 void stack_init(struct stack *);
49 void stack_swap(struct stack *);
50 size_t stack_size(const struct stack *);
51 void stack_dup(struct stack *);
52 void stack_pushnumber(struct stack *, struct number *);
53 void stack_pushstring(struct stack *stack, char *);
54 void stack_push(struct stack *, struct value *);
55 void stack_set_tos(struct stack *, struct value *);
56 struct value *stack_tos(const struct stack *);
57 struct value *stack_pop(struct stack *);
[all …]
|
| H A D | bcode.c | 42 struct stack stack; member
49 struct stack *reg;
248 stack_init(&bmachine.stack); in init_bmachine()
440 stack_pushnumber(&bmachine.stack, n); in push_number()
446 stack_pushstring(&bmachine.stack, string); in push_string()
452 stack_push(&bmachine.stack, v); in push()
458 return stack_tos(&bmachine.stack); in tos()
464 return stack_pop(&bmachine.stack); in pop()
470 return stack_popnumber(&bmachine.stack); in pop_number()
476 return stack_popstring(&bmachine.stack); in pop_string()
[all …]
|
| /dflybsd-src/contrib/cvs-1.12/src/ |
| H A D | stack.c | 19 do_push (List *stack, void *elem, int isstring) in do_push() argument
28 addnode(stack, p); in do_push()
34 push (List *stack, void *elem) in push() argument
36 do_push (stack, elem, 0); in push()
42 push_string (List *stack, char *elem) in push_string() argument
44 do_push (stack, elem, 1); in push_string()
50 do_pop (List *stack, int isstring) in do_pop() argument
54 if (isempty (stack)) return NULL; in do_pop()
58 elem = stack->list->prev->key; in do_pop()
59 stack->list->prev->key = NULL; in do_pop()
[all …]
|
| /dflybsd-src/contrib/gcc-8.0/libstdc++-v3/include/bits/ |
| H A D | stl_stack.h | 99 class stack in _GLIBCXX_VISIBILITY()
113 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
117 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
143 stack(const _Sequence& __c = _Sequence()) in _GLIBCXX_VISIBILITY()
148 stack() in _GLIBCXX_VISIBILITY()
152 stack(const _Sequence& __c) in _GLIBCXX_VISIBILITY()
156 stack(_Sequence&& __c) in _GLIBCXX_VISIBILITY()
161 stack(const _Alloc& __a) in _GLIBCXX_VISIBILITY()
165 stack(const _Sequence& __c, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
169 stack(_Sequence&& __c, const _Alloc& __a) in _GLIBCXX_VISIBILITY()
[all …]
|
| /dflybsd-src/sys/libprop/ |
| H A D | prop_stack.c | 36 _prop_stack_init(prop_stack_t stack) in _prop_stack_init() argument
38 stack->used_intern_elems = 0; in _prop_stack_init()
39 SLIST_INIT(&stack->extern_elems); in _prop_stack_init()
43 _prop_stack_push(prop_stack_t stack, prop_object_t obj, void *data1, in _prop_stack_push() argument
49 if (stack->used_intern_elems == PROP_STACK_INTERN_ELEMS) { in _prop_stack_push()
60 SLIST_INSERT_HEAD(&stack->extern_elems, eelem, stack_link); in _prop_stack_push()
65 _PROP_ASSERT(stack->used_intern_elems < PROP_STACK_INTERN_ELEMS); in _prop_stack_push()
66 _PROP_ASSERT(SLIST_EMPTY(&stack->extern_elems)); in _prop_stack_push()
68 ielem = &stack->intern_elems[stack->used_intern_elems]; in _prop_stack_push()
74 ++stack->used_intern_elems; in _prop_stack_push()
[all …]
|
| /dflybsd-src/contrib/gcc-4.7/libstdc++-v3/include/bits/ |
| H A D | stl_stack.h | 95 class stack in _GLIBCXX_VISIBILITY()
105 operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
109 operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
129 stack(const _Sequence& __c = _Sequence()) in _GLIBCXX_VISIBILITY()
133 stack(const _Sequence& __c) in _GLIBCXX_VISIBILITY()
137 stack(_Sequence&& __c = _Sequence()) in _GLIBCXX_VISIBILITY()
219 swap(stack& __s) in _GLIBCXX_VISIBILITY()
242 operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
260 operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
266 operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y) in _GLIBCXX_VISIBILITY()
[all …]
|
| /dflybsd-src/contrib/tre/lib/ |
| H A D | tre-compile.c | 390 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree, in tre_add_tags() argument
396 int bottom = tre_stack_num_objects(stack); in tre_add_tags()
448 STACK_PUSH(stack, voidptr, node); in tre_add_tags()
449 STACK_PUSH(stack, int, ADDTAGS_RECURSE); in tre_add_tags()
451 while (tre_stack_num_objects(stack) > bottom) in tre_add_tags()
456 symbol = (tre_addtags_symbol_t)tre_stack_pop_int(stack); in tre_add_tags()
465 id = tre_stack_pop_int(stack); in tre_add_tags()
466 node = tre_stack_pop_voidptr(stack); in tre_add_tags()
537 node = tre_stack_pop_voidptr(stack); in tre_add_tags()
553 STACK_PUSH(stack, voidptr, node); in tre_add_tags()
[all …]
|
| H A D | tre-match-backtrack.c | 103 #define BT_STACK_WIDE_IN(_str_wide) stack->item.str_wide = (_str_wide)
104 #define BT_STACK_WIDE_OUT (str_wide) = stack->item.str_wide
111 #define BT_STACK_MBSTATE_IN stack->item.mbstate = (mbstate)
112 #define BT_STACK_MBSTATE_OUT (mbstate) = stack->item.mbstate
133 if (!stack->next) \
148 s->prev = stack; \
163 stack->next = s; \
164 stack = s; \
167 stack = stack->next; \
168 stack->item.pos = (_pos); \
[all …]
|
| H A D | tre-stack.c | 29 union tre_stack_item *stack; member
41 s->stack = xmalloc(sizeof(*s->stack) * size); in tre_stack_new()
42 if (s->stack == NULL) in tre_stack_new()
58 xfree(s->stack); in tre_stack_destroy()
73 s->stack[s->ptr] = value; in tre_stack_push()
91 new_buffer = xrealloc(s->stack, sizeof(*new_buffer) * new_size); in tre_stack_push()
100 s->stack = new_buffer; in tre_stack_push()
119 return s->stack[--s->ptr].typetag ## _value; \
|
| H A D | tre-parse.c | 1289 tre_stack_t *stack = ctx->stack; in tre_parse() local
1290 int bottom = tre_stack_num_objects(stack); in tre_parse()
1304 STACK_PUSH(stack, int, ctx->cflags); in tre_parse()
1305 STACK_PUSH(stack, int, ctx->submatch_id); in tre_parse()
1306 STACK_PUSH(stack, int, PARSE_MARK_FOR_SUBMATCH); in tre_parse()
1309 STACK_PUSH(stack, int, 0); // bre_branch_begin in tre_parse()
1310 STACK_PUSH(stack, int, PARSE_RE); in tre_parse()
1319 while (tre_stack_num_objects(stack) > bottom) in tre_parse()
1321 symbol = tre_stack_pop_int(stack); in tre_parse()
1327 bre_branch_begin = tre_stack_pop_int(stack); in tre_parse()
[all …]
|
| /dflybsd-src/contrib/binutils-2.34/binutils/ |
| H A D | prdbg.c | 43 struct pr_stack *stack; member
303 info.stack = NULL; in print_debugging_info()
349 n->next = info->stack; in push_type()
350 info->stack = n; in push_type()
362 assert (info->stack != NULL); in prepend_type()
364 n = (char *) xmalloc (strlen (s) + strlen (info->stack->type) + 1); in prepend_type()
365 sprintf (n, "%s%s", s, info->stack->type); in prepend_type()
366 free (info->stack->type); in prepend_type()
367 info->stack->type = n; in prepend_type()
382 assert (info->stack != NULL); in append_type()
[all …]
|
| /dflybsd-src/contrib/binutils-2.27/binutils/ |
| H A D | prdbg.c | 43 struct pr_stack *stack; member
301 info.stack = NULL; in print_debugging_info()
347 n->next = info->stack; in push_type()
348 info->stack = n; in push_type()
360 assert (info->stack != NULL); in prepend_type()
362 n = (char *) xmalloc (strlen (s) + strlen (info->stack->type) + 1); in prepend_type()
363 sprintf (n, "%s%s", s, info->stack->type); in prepend_type()
364 free (info->stack->type); in prepend_type()
365 info->stack->type = n; in prepend_type()
380 assert (info->stack != NULL); in append_type()
[all …]
|
| /dflybsd-src/contrib/lvm2/dist/tools/ |
| H A D | vgchange.c | 184 stack; in _vgchange_alloc()
195 stack; in _vgchange_alloc()
200 stack; in _vgchange_alloc()
229 stack; in _vgchange_resizeable()
239 stack; in _vgchange_resizeable()
268 stack; in _vgchange_clustered()
276 stack; in _vgchange_clustered()
293 stack; in _vgchange_logicalvolume()
298 stack; in _vgchange_logicalvolume()
303 stack; in _vgchange_logicalvolume()
[all …]
|
| H A D | lvchange.c | 101 stack; in lvchange_monitoring()
249 stack; in lvchange_resync()
251 stack; in lvchange_resync()
258 stack; in lvchange_resync()
260 stack; in lvchange_resync()
289 stack; in lvchange_resync()
585 stack; in lvchange_single()
596 stack; in lvchange_single()
607 stack; in lvchange_single()
618 stack; in lvchange_single()
[all …]
|
| /dflybsd-src/contrib/gcc-4.7/gcc/ |
| H A D | cfganal.c | 44 basic_block *stack; member
164 edge_iterator *stack; in mark_dfs_back_edges() local
178 stack = XNEWVEC (edge_iterator, n_basic_blocks + 1); in mark_dfs_back_edges()
188 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs); in mark_dfs_back_edges()
197 ei = stack[sp - 1]; in mark_dfs_back_edges()
213 stack[sp++] = ei_start (dest->succs); in mark_dfs_back_edges()
229 ei_next (&stack[sp - 1]); in mark_dfs_back_edges()
237 free (stack); in mark_dfs_back_edges()
661 edge_iterator *stack; in post_order_compute() local
671 stack = XNEWVEC (edge_iterator, n_basic_blocks + 1); in post_order_compute()
[all …]
|
| H A D | ipa-utils.c | 64 struct cgraph_node **stack; member
98 env->stack[(env->stack_size)++] = v; in searchc()
138 x = env->stack[--(env->stack_size)]; in searchc()
172 env.stack = XCNEWVEC (struct cgraph_node *, cgraph_n_nodes); in ipa_reduced_postorder()
213 free (env.stack); in ipa_reduced_postorder()
257 struct postorder_stack *stack = in ipa_reverse_postorder() local
276 stack[stack_size].node = node; in ipa_reverse_postorder()
277 stack[stack_size].edge = node->callers; in ipa_reverse_postorder()
278 stack[stack_size].ref = 0; in ipa_reverse_postorder()
285 while (stack[stack_size].edge && !node2) in ipa_reverse_postorder()
[all …]
|
| H A D | timevar.c | 159 static struct timevar_stack_def *stack; variable
271 if (stack) in timevar_push_1()
272 timevar_accumulate (&stack->timevar->elapsed, &start_time, &now); in timevar_push_1()
290 context->next = stack; in timevar_push_1()
291 stack = context; in timevar_push_1()
304 struct timevar_stack_def *popped = stack; in timevar_pop_1()
306 gcc_assert (&timevars[timevar] == stack->timevar); in timevar_pop_1()
319 stack = stack->next; in timevar_pop_1()
450 if (stack) in timevar_print()
451 timevar_accumulate (&stack->timevar->elapsed, &start_time, &now); in timevar_print()
|
| H A D | tree-ssa-threadedge.c | 139 remove_temporary_equivalences (VEC(tree, heap) **stack) in remove_temporary_equivalences() argument
141 while (VEC_length (tree, *stack) > 0) in remove_temporary_equivalences()
145 dest = VEC_pop (tree, *stack); in remove_temporary_equivalences()
152 prev_value = VEC_pop (tree, *stack); in remove_temporary_equivalences()
162 record_temporary_equivalence (tree x, tree y, VEC(tree, heap) **stack) in record_temporary_equivalence() argument
173 VEC_reserve (tree, heap, *stack, 2); in record_temporary_equivalence()
174 VEC_quick_push (tree, *stack, prev_x); in record_temporary_equivalence()
175 VEC_quick_push (tree, *stack, x); in record_temporary_equivalence()
185 record_temporary_equivalences_from_phis (edge e, VEC(tree, heap) **stack) in record_temporary_equivalences_from_phis() argument
212 record_temporary_equivalence (dst, src, stack); in record_temporary_equivalences_from_phis()
[all …]
|
| /dflybsd-src/lib/libthread_xu/thread/ |
| H A D | thr_stack.c | 42 struct stack { struct
43 LIST_ENTRY(stack) qe; /* Stack queue linkage. */
54 static LIST_HEAD(, stack) dstackq = LIST_HEAD_INITIALIZER(dstackq);
63 static LIST_HEAD(, stack) mstackq = LIST_HEAD_INITIALIZER(mstackq);
88 struct stack *spare_stack; in _thr_stack_alloc()
205 struct stack *spare_stack; in _thr_stack_free()
209 spare_stack = (struct stack *)((char *)attr->stackaddr_attr + in _thr_stack_free()
210 attr->stacksize_attr - sizeof(struct stack)); in _thr_stack_free()
230 struct stack *spare; in _thr_stack_cleanup()
|
| /dflybsd-src/contrib/gcc-8.0/gcc/ |
| H A D | auto-profile.c | 190 read_function_instance (function_instance_stack *stack,
310 get_function_instance_by_inline_stack (const inline_stack &stack) const;
373 get_inline_stack (location_t locus, inline_stack *stack) in get_inline_stack() argument
391 stack->safe_push ( in get_inline_stack()
397 stack->safe_push ( in get_inline_stack()
638 function_instance::read_function_instance (function_instance_stack *stack, in read_function_instance() argument
645 stack->safe_push (s); in read_function_instance()
653 for (unsigned j = 0; j < stack->length (); j++) in read_function_instance()
654 (*stack)[j]->total_count_ += count; in read_function_instance()
667 = read_function_instance (stack, 0); in read_function_instance()
[all …]
|
| H A D | cfganal.c | 74 auto_vec<edge_iterator, 20> stack (n_basic_blocks_for_fn (cfun) + 1); in mark_dfs_back_edges()
83 stack.quick_push (ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)); in mark_dfs_back_edges()
85 while (!stack.is_empty ()) in mark_dfs_back_edges()
91 edge_iterator ei = stack.last (); in mark_dfs_back_edges()
108 stack.quick_push (ei_start (dest->succs)); in mark_dfs_back_edges()
126 ei_next (&stack.last ()); in mark_dfs_back_edges()
128 stack.pop (); in mark_dfs_back_edges()
636 auto_vec<edge_iterator, 20> stack (n_basic_blocks_for_fn (cfun) + 1); in post_order_compute()
645 stack.quick_push (ei_start (ENTRY_BLOCK_PTR_FOR_FN (cfun)->succs)); in post_order_compute()
647 while (!stack.is_empty ()) in post_order_compute()
[all …]
|
| H A D | ipa-utils.c | 60 struct cgraph_node **stack; member
93 env->stack[(env->stack_size)++] = v; in searchc()
133 x = env->stack[--(env->stack_size)]; in searchc()
170 env.stack = XCNEWVEC (struct cgraph_node *, symtab->cgraph_count); in ipa_reduced_postorder()
209 free (env.stack); in ipa_reduced_postorder()
286 struct postorder_stack *stack = in ipa_reverse_postorder() local
305 stack[stack_size].node = node; in ipa_reverse_postorder()
306 stack[stack_size].edge = node->callers; in ipa_reverse_postorder()
307 stack[stack_size].ref = 0; in ipa_reverse_postorder()
314 while (stack[stack_size].edge && !node2) in ipa_reverse_postorder()
[all …]
|
| /dflybsd-src/crypto/libressl/crypto/bn/ |
| H A D | bn_ctx.c | 146 BN_STACK stack; member
164 BN_STACK *stack = &ctx->stack; in ctxdbg() local
176 while (fpidx < stack->depth) { in ctxdbg()
177 while (bnidx++ < stack->indexes[fpidx]) in ctxdbg()
216 BN_STACK_reset(&ctx->stack); in BN_CTX_init()
234 BN_STACK_init(&ret->stack); in BN_CTX_new()
250 ctx->stack.size, ctx->pool.size); in BN_CTX_free()
262 BN_STACK_finish(&ctx->stack); in BN_CTX_free()
276 else if (!BN_STACK_push(&ctx->stack, ctx->used)) { in BN_CTX_start()
294 unsigned int fp = BN_STACK_pop(&ctx->stack); in BN_CTX_end()
|
| /dflybsd-src/contrib/lvm2/dist/lib/log/ |
| H A D | log.h | 66 #define stack log_debug("<backtrace>") /* Backtrace on error */ macro
81 #define return_0 do { stack; return 0; } while (0)
82 #define return_NULL do { stack; return NULL; } while (0)
83 #define goto_out do { stack; goto out; } while (0)
84 #define goto_bad do { stack; goto bad; } while (0)
|