Home
last modified time | relevance | path

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

12345678910>>...41

/freebsd-13.1/usr.bin/dc/
H A Dstack.c130 copy = stack->stack[stack->sp]; in stack_swap()
131 stack->stack[stack->sp] = stack->stack[stack->sp-1]; in stack_swap()
132 stack->stack[stack->sp-1] = copy; in stack_swap()
142 stack->stack = breallocarray(stack->stack, in stack_grow()
154 stack->stack[stack->sp].u.num = b; in stack_pushnumber()
155 stack->stack[stack->sp].array = NULL; in stack_pushnumber()
165 stack->stack[stack->sp].array = NULL; in stack_pushstring()
194 return &stack->stack[stack->sp]; in stack_tos()
205 stack->stack[stack->sp] = *v; in stack_set_tos()
217 return &stack->stack[stack->sp--]; in stack_pop()
[all …]
H A Dextern.h45 void stack_init(struct stack *);
48 void stack_swap(struct stack *);
49 size_t stack_size(const struct stack *);
50 void stack_dup(struct stack *);
52 void stack_pushstring(struct stack *stack, char *);
53 void stack_push(struct stack *, struct value *);
55 struct value *stack_tos(const struct stack *);
56 struct value *stack_pop(struct stack *);
57 struct number *stack_popnumber(struct stack *);
58 char *stack_popstring(struct stack *);
[all …]
/freebsd-13.1/contrib/bmake/unit-tests/
H A Dhanoi-include.exp1 Move the upper disk from stack A to stack C.
2 Move the upper disk from stack A to stack B.
3 Move the upper disk from stack C to stack B.
4 Move the upper disk from stack A to stack C.
5 Move the upper disk from stack B to stack A.
6 Move the upper disk from stack B to stack C.
7 Move the upper disk from stack A to stack C.
8 Move the upper disk from stack A to stack B.
9 Move the upper disk from stack C to stack B.
10 Move the upper disk from stack C to stack A.
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A Dstack20 class stack
36 stack(const stack& q) = default;
37 stack(stack&& q) = default;
39 stack& operator=(const stack& q) = default;
40 stack& operator=(stack&& q) = default;
129 stack()
134 stack(const stack& __q) : c(__q.c) {}
142 stack(stack&& __q)
147 stack& operator=(stack&& __q)
170 stack(const stack& __s, const _Alloc& __a,
[all …]
/freebsd-13.1/contrib/unbound/services/
H A Dmodstack.c94 stack->num = 0; in modstack_init()
95 stack->mod = NULL; in modstack_init()
104 if(stack->num == 0) { in modstack_config()
108 if(stack->num > MAX_MODULE) { in modstack_config()
110 stack->num, MAX_MODULE); in modstack_config()
115 if(!stack->mod) { in modstack_config()
121 if(!stack->mod[i]) { in modstack_config()
226 if(stack->num != 0) in modstack_setup()
254 stack->num = 0; in modstack_desetup()
255 free(stack->mod); in modstack_desetup()
[all …]
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_allocator_report.cpp26 stack(stack_) { in ScopedAllocatorErrorReport()
31 stack->Print(); in ~ScopedAllocatorErrorReport()
33 ReportErrorSummary(error_summary, stack); in ~ScopedAllocatorErrorReport()
39 const StackTrace* const stack; member in __sanitizer::ScopedAllocatorErrorReport
44 const StackTrace *stack) { in ReportCallocOverflow() argument
46 ScopedAllocatorErrorReport report("calloc-overflow", stack); in ReportCallocOverflow()
55 const StackTrace *stack) { in ReportReallocArrayOverflow() argument
68 ScopedAllocatorErrorReport report("pvalloc-overflow", stack); in ReportPvallocOverflow()
108 stack); in ReportInvalidPosixMemalignAlignment()
130 ScopedAllocatorErrorReport report("out-of-memory", stack); in ReportOutOfMemory()
[all …]
H A Dsanitizer_allocator_report.h23 const StackTrace *stack);
25 const StackTrace *stack);
26 void NORETURN ReportPvallocOverflow(uptr size, const StackTrace *stack);
28 const StackTrace *stack);
30 const StackTrace *stack);
32 const StackTrace *stack);
34 const StackTrace *stack);
35 void NORETURN ReportOutOfMemory(uptr requested_size, const StackTrace *stack);
36 void NORETURN ReportRssLimitExceeded(const StackTrace *stack);
H A Dsanitizer_symbolizer_report.cpp78 if (stack->size == 0) { in ReportErrorSummary()
101 stack->Reset(); in ReportMmapWriteExec()
118 stack->Print(); in ReportMmapWriteExec()
183 stack->Reset(); in ReportStackOverflowImpl()
184 unwind(sig, unwind_context, stack); in ReportStackOverflowImpl()
185 stack->Print(); in ReportStackOverflowImpl()
186 ReportErrorSummary(kDescription, stack); in ReportStackOverflowImpl()
222 stack->Reset(); in ReportDeadlySignalImpl()
223 unwind(sig, unwind_context, stack); in ReportDeadlySignalImpl()
224 stack->Print(); in ReportDeadlySignalImpl()
[all …]
/freebsd-13.1/contrib/llvm-project/lldb/source/Expression/
H A DDWARFExpression.cpp1376 stack.push_back(stack.back()); in Evaluate()
1388 stack.pop_back(); in Evaluate()
1402 stack.push_back(stack[stack.size() - 2]); in Evaluate()
1412 stack.push_back(stack[stack.size() - 1 - pick_idx]); in Evaluate()
1434 stack.back() = stack[stack.size() - 2]; in Evaluate()
1435 stack[stack.size() - 2] = tmp; in Evaluate()
1454 stack[last_idx] = stack[last_idx - 1]; in Evaluate()
1455 stack[last_idx - 1] = stack[last_idx - 2]; in Evaluate()
1516 stack.back() = in Evaluate()
2643 if (stack.empty()) { in Evaluate()
[all …]
/freebsd-13.1/sys/sys/
H A Dstack.h49 struct stack *stack_create(int);
50 void stack_destroy(struct stack *);
51 int stack_put(struct stack *, vm_offset_t);
52 void stack_copy(const struct stack *, struct stack *);
53 void stack_zero(struct stack *);
54 void stack_print(const struct stack *);
55 void stack_print_ddb(const struct stack *);
56 void stack_print_short(const struct stack *);
57 void stack_print_short_ddb(const struct stack *);
75 void stack_save(struct stack *);
[all …]
/freebsd-13.1/contrib/bsnmp/snmp_mibII/
H A DmibII_ifstack.c38 struct mibifstack *stack; in mib_ifstack_create() local
40 if ((stack = malloc(sizeof(*stack))) == NULL) in mib_ifstack_create()
43 stack->index.len = 2; in mib_ifstack_create()
44 stack->index.subs[0] = upper ? upper->index : 0; in mib_ifstack_create()
47 INSERT_OBJECT_OID(stack, &mibifstack_list); in mib_ifstack_create()
57 struct mibifstack *stack; in mib_ifstack_delete() local
59 TAILQ_FOREACH(stack, &mibifstack_list, link) in mib_ifstack_delete()
62 TAILQ_REMOVE(&mibifstack_list, stack, link); in mib_ifstack_delete()
63 free(stack); in mib_ifstack_delete()
73 struct mibifstack *stack; in op_ifstack() local
[all …]
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/msan/
H A Dmsan_allocator.cpp177 ReportOutOfMemory(size, stack); in MsanAllocate()
187 stack->tag = StackTrace::TAG_ALLOC; in MsanAllocate()
188 Origin o = Origin::CreateHeapOrigin(stack); in MsanAllocate()
207 stack->tag = StackTrace::TAG_DEALLOC; in MsanDeallocate()
233 stack->tag = StackTrace::TAG_ALLOC; in MsanReallocate()
243 MsanDeallocate(stack, old_p); in MsanReallocate()
252 ReportCallocOverflow(nmemb, size, stack); in MsanCalloc()
277 MsanDeallocate(stack, ptr); in msan_realloc()
290 return msan_realloc(ptr, nmemb * size, stack); in msan_reallocarray()
303 ReportPvallocOverflow(size, stack); in msan_pvalloc()
[all …]
/freebsd-13.1/sys/dev/smartpqi/
H A Dsmartpqi_tag.c166 stack->max_elem = max_elem + 1; in pqisrc_init_taglist()
167 stack->head.data = 0; in pqisrc_init_taglist()
173 if (!(stack->next_index_array)) { in pqisrc_init_taglist()
182 pqisrc_put_tag(stack, index); in pqisrc_init_taglist()
201 if (stack->next_index_array) { in pqisrc_destroy_taglist()
204 stack->next_index_array = NULL; in pqisrc_destroy_taglist()
221 if (index >= stack->max_elem) { in pqisrc_put_tag()
234 cur_head = stack->head; in pqisrc_put_tag()
242 stack->num_elem++; in pqisrc_put_tag()
257 cur_head = stack->head; in pqisrc_get_tag()
[all …]
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/lsan/
H A Dlsan_allocator.cpp65 m->stack_trace_id = StackDepotPut(stack); in RegisterAllocation()
90 return ReportAllocationSizeTooBig(size, stack); in Allocate()
96 ReportOutOfMemory(size, &stack); in Allocate()
101 RegisterAllocation(stack, p, size); in Allocate()
111 ReportCallocOverflow(nmemb, size, &stack); in Calloc()
114 return Allocate(stack, size, 1, true); in Calloc()
127 ReportAllocationSizeTooBig(new_size, stack); in Reallocate()
134 RegisterAllocation(stack, new_p, new_size); in Reallocate()
136 RegisterAllocation(stack, p, new_size); in Reallocate()
207 return lsan_realloc(ptr, nmemb * size, stack); in lsan_reallocarray()
[all …]
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/hwasan/
H A Dhwasan_allocator.cpp147 ReportOutOfMemory(size, stack); in HwasanAllocate()
152 meta->alloc_context_id = StackDepotPut(*stack); in HwasanAllocate()
220 u32 free_context_id = StackDepotPut(*stack); in HwasanDeallocate()
293 HwasanDeallocate(stack, tagged_ptr_old); in HwasanReallocate()
302 ReportCallocOverflow(nmemb, size, stack); in HwasanCalloc()
343 HwasanDeallocate(stack, ptr); in hwasan_realloc()
356 return hwasan_realloc(ptr, nmemb * size, stack); in hwasan_reallocarray()
370 ReportPvallocOverflow(size, stack); in hwasan_pvalloc()
398 StackTrace *stack) { in hwasan_posix_memalign() argument
413 void hwasan_free(void *ptr, StackTrace *stack) { in hwasan_free() argument
[all …]
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/asan/
H A Dasan_allocator.cpp58 context += stack; in AtomicContextStore()
65 stack = context; in AtomicContextLoad()
494 CHECK(stack); in Allocate()
893 u32 stack = 0; in AllocTid() local
902 u32 stack = 0; in FreeTid() local
920 u32 stack = 0; in GetAllocStackId() local
922 return stack; in GetAllocStackId()
929 u32 stack = 0; in GetFreeStackId() local
931 return stack; in GetFreeStackId()
1161 u32 stack = 0; in stack_trace_id() local
[all …]
H A Dasan_errors.h134 stack(stack_), in ErrorMallocUsableSizeNotOwned()
147 stack(stack_), in ErrorSanitizerGetAllocatedSizeNotOwned()
161 stack(stack_), in ErrorCallocOverflow()
176 stack(stack_), in ErrorReallocArrayOverflow()
189 stack(stack_), in ErrorPvallocOverflow()
202 stack(stack_), in ErrorInvalidAllocationAlignment()
216 stack(stack_), in ErrorInvalidAlignedAllocAlignment()
230 stack(stack_), in ErrorInvalidPosixMemalignAlignment()
245 stack(stack_), in ErrorAllocationSizeTooBig()
269 stack(stack_), in ErrorOutOfMemory()
[all …]
H A Dasan_report.h65 BufferedStackTrace *stack);
66 void ReportPvallocOverflow(uptr size, BufferedStackTrace *stack);
68 BufferedStackTrace *stack);
70 BufferedStackTrace *stack);
72 BufferedStackTrace *stack);
74 BufferedStackTrace *stack);
75 void ReportRssLimitExceeded(BufferedStackTrace *stack);
76 void ReportOutOfMemory(uptr requested_size, BufferedStackTrace *stack);
82 BufferedStackTrace *stack);
93 BufferedStackTrace *stack);
[all …]
H A Dasan_errors.cpp57 stack.Print(); in Print()
95 stack.Print(); in Print()
114 stack.Print(); in Print()
134 stack.Print(); in Print()
150 stack->Print(); in Print()
163 stack->Print(); in Print()
176 stack->Print(); in Print()
189 stack->Print(); in Print()
203 stack->Print(); in Print()
216 stack->Print(); in Print()
[all …]
H A Dasan_stack.h36 BufferedStackTrace stack; \
38 stack.size = max_size; \
40 stack.top_frame_bp = GET_CURRENT_FRAME(); \
41 stack.trace_buffer[0] = StackTrace::GetCurrentPc(); \
42 if (max_size > 1) stack.trace_buffer[1] = GET_CALLER_PC(); \
45 stack.Unwind(StackTrace::GetCurrentPc(), \
50 BufferedStackTrace stack; \
51 stack.Unwind(pc, bp, nullptr, \
68 stack.Print(); \
/freebsd-13.1/contrib/subversion/subversion/libsvn_client/
H A Dlayout.c81 while (lb->stack in layout_set_path()
84 it = lb->stack; in layout_set_path()
89 item_pool = svn_pool_create(lb->stack ? lb->stack->pool in layout_set_path()
97 if (lb->stack) in layout_set_path()
119 it->ancestor = lb->stack; in layout_set_path()
120 lb->stack = it; in layout_set_path()
164 it = lb->stack; in layout_link_path()
169 item_pool = svn_pool_create(lb->stack ? lb->stack->pool in layout_link_path()
180 lb->stack = it; in layout_link_path()
215 it = lb->stack; in layout_delete_path()
[all …]
/freebsd-13.1/contrib/libcbor/src/cbor/internal/
H A Dbuilder_callbacks.c21 if (ctx->stack->size == 0) { in _cbor_builder_append()
26 switch (ctx->stack->top->item->type) { in _cbor_builder_append()
36 ctx->stack->top->subitems--; in _cbor_builder_append()
39 _cbor_stack_pop(ctx->stack); in _cbor_builder_append()
61 ctx->stack->top->subitems--; in _cbor_builder_append()
68 ctx->stack->top->subitems ^= in _cbor_builder_append()
78 _cbor_stack_pop(ctx->stack); in _cbor_builder_append()
197 if (ctx->stack->size > 0 && cbor_isa_bytestring(ctx->stack->top->item)) { in cbor_builder_byte_string_callback()
247 if (ctx->stack->size > 0 && cbor_isa_string(ctx->stack->top->item)) { in cbor_builder_string_callback()
324 if (ctx->stack->size > 0) { in cbor_builder_indef_break_callback()
[all …]
H A Dstack.c14 void _cbor_stack_pop(struct _cbor_stack *stack) { in _cbor_stack_pop() argument
15 struct _cbor_stack_record *top = stack->top; in _cbor_stack_pop()
16 stack->top = stack->top->lower; in _cbor_stack_pop()
18 stack->size--; in _cbor_stack_pop()
21 struct _cbor_stack_record *_cbor_stack_push(struct _cbor_stack *stack, in _cbor_stack_push() argument
24 if (stack->size == CBOR_MAX_STACK_SIZE) return NULL; in _cbor_stack_push()
29 *new_top = (struct _cbor_stack_record){stack->top, item, subitems}; in _cbor_stack_push()
30 stack->top = new_top; in _cbor_stack_push()
31 stack->size++; in _cbor_stack_push()
/freebsd-13.1/contrib/libdivsufsort/include/
H A Ddivsufsort_private.h157 stack[ssize].a = (_a), stack[ssize].b = (_b),\
158 stack[ssize].c = (_c), stack[ssize++].d = (_d);\
163 stack[ssize].a = (_a), stack[ssize].b = (_b),\
164 stack[ssize].c = (_c), stack[ssize].d = (_d), stack[ssize++].e = (_e);\
170 (_a) = stack[--ssize].a, (_b) = stack[ssize].b,\
171 (_c) = stack[ssize].c, (_d) = stack[ssize].d;\
177 (_a) = stack[--ssize].a, (_b) = stack[ssize].b,\
178 (_c) = stack[ssize].c, (_d) = stack[ssize].d, (_e) = stack[ssize].e;\
/freebsd-13.1/sys/contrib/ck/include/
H A Dck_stack.h56 struct ck_stack_entry *stack; in ck_stack_push_upmc() local
58 stack = ck_pr_load_ptr(&target->head); in ck_stack_push_upmc()
59 entry->next = stack; in ck_stack_push_upmc()
62 while (ck_pr_cas_ptr_value(&target->head, stack, entry, &stack) == false) { in ck_stack_push_upmc()
63 entry->next = stack; in ck_stack_push_upmc()
80 struct ck_stack_entry *stack; in ck_stack_trypush_upmc() local
82 stack = ck_pr_load_ptr(&target->head); in ck_stack_trypush_upmc()
83 entry->next = stack; in ck_stack_trypush_upmc()
275 struct ck_stack_entry *stack; in ck_stack_push_mpnc() local
337 stack->head = NULL; in ck_stack_init()
[all …]

12345678910>>...41