Home
last modified time | relevance | path

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

12345678910>>...72

/netbsd/src/usr.bin/make/unit-tests/
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 …]
/netbsd/src/external/gpl2/xcvs/dist/src/
Dstack.c21 do_push (List *stack, void *elem, int isstring) in do_push() argument
30 addnode(stack, p); in do_push()
36 push (List *stack, void *elem) in push() argument
38 do_push (stack, elem, 0); in push()
44 push_string (List *stack, char *elem) in push_string() argument
46 do_push (stack, elem, 1); in push_string()
52 do_pop (List *stack, int isstring) in do_pop() argument
56 if (isempty (stack)) return NULL; in do_pop()
60 elem = stack->list->prev->key; in do_pop()
61 stack->list->prev->key = NULL; in do_pop()
[all …]
/netbsd/src/sys/external/bsd/sljit/dist/sljit_src/
DsljitUtils.c251 struct sljit_stack *stack; in sljit_allocate_stack() local
280 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); in sljit_allocate_stack()
281 if (!stack) in sljit_allocate_stack()
290 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
293 stack->max_limit = (sljit_u8 *)ptr; in sljit_allocate_stack()
294 stack->base = stack->max_limit + max_limit; in sljit_allocate_stack()
295 stack->limit = stack->base; in sljit_allocate_stack()
296 if (sljit_stack_resize(stack, stack->base - limit)) { in sljit_allocate_stack()
297 sljit_free_stack(stack, allocator_data); in sljit_allocate_stack()
303 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
[all …]
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
Dstl_stack.h99 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()
122 operator<=>(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&); in _GLIBCXX_VISIBILITY()
157 stack(const _Sequence& __c = _Sequence()) in _GLIBCXX_VISIBILITY()
162 stack() in _GLIBCXX_VISIBILITY()
166 stack(const _Sequence& __c) in _GLIBCXX_VISIBILITY()
170 stack(_Sequence&& __c) in _GLIBCXX_VISIBILITY()
178 stack(_InputIterator __first, _InputIterator __last) in _GLIBCXX_VISIBILITY()
185 stack(const _Alloc& __a) in _GLIBCXX_VISIBILITY()
[all …]
/netbsd/src/common/lib/libprop/
Dprop_stack.c36 _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 …]
/netbsd/src/sys/external/bsd/compiler_rt/dist/lib/lsan/
Dlsan_allocator.cc54 static void RegisterAllocation(const StackTrace &stack, void *p, uptr size) { in RegisterAllocation() argument
59 m->stack_trace_id = StackDepotPut(stack); in RegisterAllocation()
71 static void *ReportAllocationSizeTooBig(uptr size, const StackTrace &stack) { in ReportAllocationSizeTooBig() argument
76 ReportAllocationSizeTooBig(size, kMaxAllowedMallocSize, &stack); in ReportAllocationSizeTooBig()
79 void *Allocate(const StackTrace &stack, uptr size, uptr alignment, in Allocate() argument
84 return ReportAllocationSizeTooBig(size, stack); in Allocate()
90 ReportOutOfMemory(size, &stack); in Allocate()
95 RegisterAllocation(stack, p, size); in Allocate()
101 static void *Calloc(uptr nmemb, uptr size, const StackTrace &stack) { in Calloc() argument
105 ReportCallocOverflow(nmemb, size, &stack); in Calloc()
[all …]
Dlsan_allocator.h25 void *Allocate(const StackTrace &stack, uptr size, uptr alignment,
28 void *Reallocate(const StackTrace &stack, void *p, uptr new_size,
120 const StackTrace &stack);
121 void *lsan_aligned_alloc(uptr alignment, uptr size, const StackTrace &stack);
122 void *lsan_memalign(uptr alignment, uptr size, const StackTrace &stack);
123 void *lsan_malloc(uptr size, const StackTrace &stack);
125 void *lsan_realloc(void *p, uptr size, const StackTrace &stack);
126 void *lsan_calloc(uptr nmemb, uptr size, const StackTrace &stack);
127 void *lsan_valloc(uptr size, const StackTrace &stack);
128 void *lsan_pvalloc(uptr size, const StackTrace &stack);
/netbsd/src/sys/external/bsd/sljit/dist/regex_src/
DregexJIT.c154 struct stack { struct
163 static void stack_check(struct stack *stack) in stack_check() argument
168 if (!stack) in stack_check()
171 SLJIT_ASSERT(stack->index >= 0 && stack->index < STACK_FRAGMENT_SIZE); in stack_check()
173 if (stack->first == NULL) { in stack_check()
174 SLJIT_ASSERT(stack->first == NULL && stack->last == NULL); in stack_check()
175 SLJIT_ASSERT(stack->index == STACK_FRAGMENT_SIZE - 1 && stack->count == 0); in stack_check()
180 if (stack->last == NULL) { in stack_check()
181 SLJIT_ASSERT(stack->index == STACK_FRAGMENT_SIZE - 1 && stack->count == 0); in stack_check()
185 SLJIT_ASSERT(stack->index >= 0 && stack->count >= 0); in stack_check()
[all …]
/netbsd/src/external/gpl3/binutils/dist/binutils/
Dprdbg.c43 struct pr_stack *stack; member
281 info.stack = NULL; in print_debugging_info()
297 while (info.stack != NULL) in print_debugging_info()
299 struct pr_stack *s = info.stack; in print_debugging_info()
300 info.stack = s->next; in print_debugging_info()
337 n->next = info->stack; in push_type()
338 info->stack = n; in push_type()
350 assert (info->stack != NULL); in prepend_type()
352 n = xmalloc (strlen (s) + strlen (info->stack->type) + 1); in prepend_type()
353 sprintf (n, "%s%s", s, info->stack->type); in prepend_type()
[all …]
/netbsd/src/external/bsd/tre/dist/lib/
Dtre-compile.c146 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree, in tre_add_tags() argument
152 int bottom = tre_stack_num_objects(stack); in tre_add_tags()
200 STACK_PUSH(stack, voidptr, node); in tre_add_tags()
201 STACK_PUSH(stack, long, ADDTAGS_RECURSE); in tre_add_tags()
203 while (tre_stack_num_objects(stack) > bottom) in tre_add_tags()
208 symbol = (tre_addtags_symbol_t)tre_stack_pop_long(stack); in tre_add_tags()
214 int id = (int)tre_stack_pop_long(stack); in tre_add_tags()
229 node = tre_stack_pop_voidptr(stack); in tre_add_tags()
264 STACK_PUSHX(stack, long, node->submatch_id); in tre_add_tags()
265 STACK_PUSHX(stack, long, ADDTAGS_SET_SUBMATCH_END); in tre_add_tags()
[all …]
Dtre-match-backtrack.c83 #define BT_STACK_WIDE_IN(_str_wide) stack->item.str_wide = (_str_wide)
84 #define BT_STACK_WIDE_OUT (str_wide) = stack->item.str_wide
91 #define BT_STACK_MBSTATE_IN stack->item.mbstate = (mbstate)
92 #define BT_STACK_MBSTATE_OUT (mbstate) = stack->item.mbstate
114 if (!stack->next) \
129 s->prev = stack; \
144 stack->next = s; \
145 stack = s; \
148 stack = stack->next; \
149 stack->item.pos = (_pos); \
[all …]
Dtre-stack.c29 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; \
/netbsd/src/tests/lib/libc/sys/
Dt_clone.c60 void *stack = mmap(NULL, STACKSIZE, PROT_READ|PROT_WRITE, in getstack() local
62 ATF_REQUIRE_ERRNO(errno, stack != MAP_FAILED); in getstack()
64 stack = (char *)stack + STACKSIZE; in getstack()
66 return stack; in getstack()
70 putstack(void *stack) in putstack() argument
73 stack = (char *)stack - STACKSIZE; in putstack()
75 ATF_REQUIRE_ERRNO(errno, munmap(stack, STACKSIZE) != -1); in putstack()
119 void *stack = getstack(); in ATF_TC_BODY() local
124 printf("parent: stack = %p, frobme = %p\n", stack, frobme); in ATF_TC_BODY()
128 frobme[1] = (long)stack; in ATF_TC_BODY()
[all …]
/netbsd/src/lib/libterminfo/
Dtparm.c65 push(long num, char *string, TPSTACK *stack) in push() argument
67 if (stack->offset >= sizeof(stack->nums)) { in push()
71 stack->nums[stack->offset] = num; in push()
72 stack->strings[stack->offset] = string; in push()
73 stack->offset++; in push()
78 pop(long *num, char **string, TPSTACK *stack) in pop() argument
80 if (stack->offset == 0) { in pop()
88 stack->offset--; in pop()
90 *num = stack->nums[stack->offset]; in pop()
92 *string = stack->strings[stack->offset]; in pop()
[all …]
/netbsd/src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
Dstep-over-clone.c53 unsigned char *stack[6]; in main() local
65 for (i = 0; i < (sizeof (stack) / sizeof (stack[0])); i++) in main()
66 stack[i] = malloc (STACK_SIZE); in main()
68 global_thread_count = (sizeof (stack) / sizeof (stack[0])); in main()
70 for (i = 0; i < (sizeof (stack) / sizeof (stack[0])); i++) in main()
72 pid = clone (clone_fn, stack[i] + STACK_SIZE, CLONE_FILES | CLONE_VM, in main()
76 for (i = 0; i < (sizeof (stack) / sizeof (stack[0])); i++) in main()
77 free (stack[i]); in main()
/netbsd/src/external/gpl3/gcc/dist/libgcc/config/i386/
Dmorestack.S1 # x86/x86_64 support for -fsplit-stack.
28 # Support for allocating more stack space when using -fsplit-stack.
29 # When a function discovers that it needs more stack space, it will
30 # call __morestack with the size of the stack frame and the size of
31 # the parameters to copy from the old stack frame to the new one.
33 # calls __generic_morestack to actually allocate the stack space.
35 # When this is called stack space is very low, but we ensure that
41 # sets it to the size of the allocated stack. OLD_STACK points to
42 # the parameters on the old stack and PARAM_SIZE is the number of
43 # bytes of parameters to copy to the new stack. These are the
[all …]
/netbsd/src/tests/kernel/
Dt_signal_and_sp.c249 char *stack; in ATF_TC_BODY() local
252 REQUIRE_LIBC(stack = malloc(SIGSTKSZ + STACK_ALIGNBYTES), NULL); in ATF_TC_BODY()
253 fprintf(stderr, "stack @ [%p,%p)\n", stack, in ATF_TC_BODY()
254 stack + SIGSTKSZ + STACK_ALIGNBYTES); in ATF_TC_BODY()
261 uc.uc_stack.ss_sp = stack; in ATF_TC_BODY()
269 ATF_CHECK_MSG((uintptr_t)stack <= (uintptr_t)contextsp && in ATF_TC_BODY()
270 (uintptr_t)contextsp <= (uintptr_t)stack + SIGSTKSZ + i, in ATF_TC_BODY()
282 uc.uc_stack.ss_sp = stack + i; in ATF_TC_BODY()
290 ATF_CHECK_MSG((uintptr_t)stack + i <= (uintptr_t)contextsp && in ATF_TC_BODY()
291 (uintptr_t)contextsp <= (uintptr_t)stack + i + SIGSTKSZ, in ATF_TC_BODY()
[all …]
/netbsd/src/external/gpl3/gcc/dist/libgcc/config/s390/
Dmorestack.S1 # s390 support for -fsplit-stack.
94 la %r3, 0x60(%r11) # Caller's stack parameters.
95 l %r4, 4(%r10) # Size of stack parameters.
98 lr %r15, %r2 # Switch to the new stack.
99 ahi %r15, -0x60 # Make a stack frame on it.
102 s %r2, 0x40(%r11) # The end of stack space.
106 st %r2, 0x20(%r1) # Save the new stack boundary.
135 # We need a stack slot now, but have no good way to get it - the frame
136 # on new stack had to be exactly 0x60 bytes, or stack parameters would
146 st %r2, 0x20(%r1) # Save the new stack boundary.
[all …]
/netbsd/src/sys/external/bsd/drm2/dist/drm/i915/
Dintel_runtime_pm.c75 static void __print_depot_stack(depot_stack_handle_t stack, in __print_depot_stack() argument
81 nr_entries = stack_depot_fetch(stack, &entries); in __print_depot_stack()
98 depot_stack_handle_t stack, *stacks; in track_intel_runtime_pm_wakeref() local
104 stack = __save_depot_stack(); in track_intel_runtime_pm_wakeref()
105 if (!stack) in track_intel_runtime_pm_wakeref()
111 rpm->debug.last_acquire = stack; in track_intel_runtime_pm_wakeref()
117 stacks[rpm->debug.count++] = stack; in track_intel_runtime_pm_wakeref()
120 stack = -1; in track_intel_runtime_pm_wakeref()
125 return stack; in track_intel_runtime_pm_wakeref()
129 depot_stack_handle_t stack) in untrack_intel_runtime_pm_wakeref() argument
[all …]
/netbsd/src/external/cddl/osnet/lib/libdtrace/
DMakefile73 COPTS.dt_aggregate.c += -Wno-stack-protector
74 COPTS.dt_consume.c += -Wno-stack-protector
75 COPTS.dt_decl.c += -Wno-stack-protector
76 COPTS.dt_dof.c += -Wno-stack-protector
77 COPTS.dt_handle.c += -Wno-stack-protector
78 COPTS.dt_ident.c += -Wno-stack-protector
79 COPTS.dt_link.c += -Wno-stack-protector
80 COPTS.dt_options.c += -Wno-stack-protector
81 COPTS.dt_parser.c += -Wno-stack-protector
82 COPTS.dt_pragma.c += -Wno-stack-protector
[all …]
/netbsd/src/external/gpl3/gdb/dist/gdb/
Dmn10300-tdep.c318 push_reg (pv_t *regs, struct pv_area *stack, int regnum) in push_reg() argument
321 stack->store (regs[E_SP_REGNUM], 4, regs[regnum]); in push_reg()
381 pv_area stack (E_SP_REGNUM, gdbarch_addr_bit (gdbarch)); in mn10300_analyze_prologue()
389 stack.store (regs[E_SP_REGNUM], 4, regs[E_PC_REGNUM]); in mn10300_analyze_prologue()
413 push_reg (regs, &stack, E_E2_REGNUM); in mn10300_analyze_prologue()
414 push_reg (regs, &stack, E_E3_REGNUM); in mn10300_analyze_prologue()
418 push_reg (regs, &stack, E_E4_REGNUM); in mn10300_analyze_prologue()
419 push_reg (regs, &stack, E_E5_REGNUM); in mn10300_analyze_prologue()
420 push_reg (regs, &stack, E_E6_REGNUM); in mn10300_analyze_prologue()
421 push_reg (regs, &stack, E_E7_REGNUM); in mn10300_analyze_prologue()
[all …]
/netbsd/src/external/gpl2/lvm2/dist/tools/
Dvgchange.c184 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 …]
/netbsd/src/external/ibm-public/postfix/dist/src/global/
Dmime_state.c307 MIME_STACK *stack; /* for composite types */ member
451 MIME_STACK *stack; in mime_state_push() local
465 stack = (MIME_STACK *) mymalloc(sizeof(*stack)); in mime_state_push()
466 stack->def_ctype = def_ctype; in mime_state_push()
467 stack->def_stype = def_stype; in mime_state_push()
468 if ((stack->bound_len = strlen(boundary)) > var_mime_bound_len) in mime_state_push()
469 stack->bound_len = var_mime_bound_len; in mime_state_push()
470 stack->boundary = mystrndup(boundary, stack->bound_len); in mime_state_push()
471 stack->next = state->stack; in mime_state_push()
472 state->stack = stack; in mime_state_push()
[all …]
/netbsd/src/external/bsd/pcc/dist/pcc/arch/powerpc/
DREADME15 - the stack frame is always 200 bytes - need to calculate size and patch
17 - function arguments are always saved to the stack [need to change MI code]
25 The way most modern CPUs create the stack is to allocate the frame
33 and don't know the position of the stack pointer, and the size of the
36 One solution is to have two pointers to the stack. One for the top
37 of the stack and the other pointing just below the temporaries but above
40 argument space, we cannot "dynamically" alter the stack (like we do with mips),
42 in the stack frame is the saved stack pointer (pointing to the previous
43 stack frame). While this is a nice feature for tracking back through the
44 stack frames (which mips has always had problems with), it makes it
[all …]
/netbsd/src/sys/ddb/
Ddb_lwp.c66 uintptr_t stack; in db_lwp_whatis() local
71 stack = (uintptr_t)KSTACK_LOWEST_ADDR((&l)); in db_lwp_whatis()
72 if (addr < stack || stack + KSTACK_SIZE <= addr) { in db_lwp_whatis()
76 (void *)addr, (void *)stack, in db_lwp_whatis()
77 (size_t)(addr - stack), lp); in db_lwp_whatis()

12345678910>>...72