| /freebsd/contrib/bmake/unit-tests/ |
| H A D | hanoi-include.exp | 1 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/contrib/llvm-project/libcxx/include/ |
| H A D | stack | 14 stack synopsis 20 class stack 33 stack() = default; 34 ~stack() = default; 36 stack(const stack& q) = default; 37 stack(stack&& q) = default; 39 stack& operator=(const stack& q) = default; 40 stack& operator=(stack&& q) = default; 42 explicit stack(const container_type& c); 43 explicit stack(container_type&& c); [all …]
|
| /freebsd/contrib/libcbor/test/ |
| H A D | callbacks_test.c | 10 #include "cbor/internal/stack.h" 35 struct _cbor_stack stack = _cbor_stack_init(); in test_builder_byte_string_callback_append() local 37 _cbor_stack_push(&stack, cbor_new_indefinite_bytestring(), 0)); in test_builder_byte_string_callback_append() 42 .stack = &stack, in test_builder_byte_string_callback_append() 49 assert_size_equal(context.stack->size, 1); in test_builder_byte_string_callback_append() 51 cbor_item_t* bytestring = stack.top->item; in test_builder_byte_string_callback_append() 70 _cbor_stack_pop(&stack); in test_builder_byte_string_callback_append() 75 struct _cbor_stack stack = _cbor_stack_init(); in test_builder_byte_string_callback_append_alloc_failure() local 77 _cbor_stack_push(&stack, cbor_new_indefinite_bytestrin in test_builder_byte_string_callback_append_alloc_failure() 107 struct _cbor_stack stack = _cbor_stack_init(); test_builder_byte_string_callback_append_item_alloc_failure() local 141 struct _cbor_stack stack = _cbor_stack_init(); test_builder_byte_string_callback_append_parent_alloc_failure() local 175 struct _cbor_stack stack = _cbor_stack_init(); test_builder_string_callback_append() local 212 struct _cbor_stack stack = _cbor_stack_init(); test_builder_string_callback_append_alloc_failure() local 243 struct _cbor_stack stack = _cbor_stack_init(); test_builder_string_callback_append_item_alloc_failure() local 275 struct _cbor_stack stack = _cbor_stack_init(); test_builder_string_callback_append_parent_alloc_failure() local 306 struct _cbor_stack stack = _cbor_stack_init(); test_append_array_failure() local 335 struct _cbor_stack stack = _cbor_stack_init(); test_append_map_failure() local [all...] |
| /freebsd/contrib/unbound/services/ |
| H A D | modstack.c | 2 * services/modstack.c - stack of modules 39 * This file contains functions to help maintain a stack of modules. 92 modstack_init(struct module_stack* stack) in modstack_init() argument 94 stack->num = 0; in modstack_init() 95 stack->mod = NULL; in modstack_init() 99 modstack_free(struct module_stack* stack) in modstack_free() argument 101 if(!stack) in modstack_free() 103 stack->num = 0; in modstack_free() 104 free(stack->mod); in modstack_free() 105 stack->mod = NULL; in modstack_free() [all …]
|
| H A D | modstack.h | 2 * services/modstack.h - stack of modules 39 * This file contains functions to help maintain a stack of modules. 48 * Stack of modules. 58 * Init a stack of modules 59 * @param stack: initialised as empty. 61 void modstack_init(struct module_stack* stack); 64 * Free the stack of modules 65 * @param stack: stack that frees up memory. 67 void modstack_free(struct module_stack* stack); 71 * @param stack: Expected empty, filled according to module_conf [all …]
|
| /freebsd/contrib/llvm-project/lldb/source/Expression/ |
| H A D | DWARFExpression.cpp | 245 case DW_OP_pick: // 0x15 1 1-byte stack index in GetOpcodeDataSize() 490 // by a file address on the stack. We assume that DW_OP_const4u or in LinkThreadLocalStorage() 531 static llvm::Error Evaluate_DW_OP_entry_value(std::vector<Value> &stack, in Evaluate_DW_OP_entry_value() argument 541 // constant literal, or a spilled stack value) in the parent frame. in Evaluate_DW_OP_entry_value() 581 // 1. Find the function which pushed the current frame onto the stack. in Evaluate_DW_OP_entry_value() 598 // If this is null, we're at the end of the stack. in Evaluate_DW_OP_entry_value() 717 stack.push_back(*maybe_result); in Evaluate_DW_OP_entry_value() 831 std::vector<Value> stack; in Evaluate() local 846 stack.push_back(*initial_value_ptr); in Evaluate() 859 // TODO: Implement a real typed stack, and store the genericness of the value in Evaluate() [all …]
|
| /freebsd/share/man/man9/ |
| H A D | stack.9 | 32 .Nm stack 33 .Nd kernel thread stack tracing routines 40 .Cd "options STACK" 45 .Fn stack_destroy "struct stack *st" 47 .Fn stack_put "struct stack *st" "vm_offset_t pc" 49 .Fn stack_copy "const struct stack *src" "struct stack *dst" 51 .Fn stack_zero "struct stack *st" 53 .Fn stack_print "const struct stack *st" 55 .Fn stack_print_ddb "const struct stack *st" 57 .Fn stack_print_short "const struct stack *st" [all …]
|
| H A D | tcp_functions.9 | 31 .Nd Alternate TCP Stack Framework 51 This functionality is intended to encourage experimentation with the TCP stack 55 A system administrator can set a system default stack. 56 By default, all TCP connections will use the system default stack. 57 Additionally, users can specify a particular stack to use on a per-connection 61 for details on setting the system default stack, or selecting a specific stack 66 A "TCP stack" is a collection of functions that implement a set of behavior. 67 Therefore, an alternate "function block" defines an alternate "TCP stack". 193 field identifies the unique name of the TCP stack, and should be no longer than 210 If a TCP stack needs to initialize data when a socket first selects the TCP [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUFrameLowering.cpp | 9 // Interface to describe a layout of a stack frame on a AMDGPU target machine. 29 // The StackWidth determines how stack objects are laid out in memory. in getStackWidth() 30 // For a vector stack variable, like: int4 stack[2], the data will be stored in getStackWidth() 35 // T0.X = stack[0].x in getStackWidth() 36 // T1.X = stack[0].y in getStackWidth() 37 // T2.X = stack[0].z in getStackWidth() 38 // T3.X = stack[0].w in getStackWidth() 39 // T4.X = stack[1].x in getStackWidth() 40 // T5.X = stack[1].y in getStackWidth() 41 // T6.X = stack[1].z in getStackWidth() [all …]
|
| /freebsd/lib/libsys/ |
| H A D | sigaltstack.2 | 33 .Nd set and/or get signal stack context 51 allows defining an alternate stack on which signals 57 .Em "signal stack" 60 should execute on the signal stack (specified with a 63 if the thread is currently executing on that stack. 64 If the thread is not currently executing on the signal stack, 65 the system arranges a switch to the signal stack for the 68 An active stack cannot be modified. 77 are ignored and the signal stack will be disabled. 78 A disabled stack will cause all signals to be [all …]
|
| /freebsd/sys/dev/smartpqi/ |
| H A D | smartpqi_tag.c | 156 pqisrc_init_taglist(pqisrc_softstate_t *softs, lockless_stack_t *stack, in pqisrc_init_taglist() argument 165 stack->max_elem = max_elem + 1; in pqisrc_init_taglist() 166 stack->head.data = 0; in pqisrc_init_taglist() 167 DBG_INFO("Stack head address :%p\n",&stack->head); in pqisrc_init_taglist() 169 /*Allocate memory for stack*/ in pqisrc_init_taglist() 170 stack->next_index_array = (uint32_t*)os_mem_alloc(softs, in pqisrc_init_taglist() 171 (stack->max_elem * sizeof(uint32_t))); in pqisrc_init_taglist() 172 if (!(stack->next_index_array)) { in pqisrc_init_taglist() 173 DBG_ERR("Unable to allocate memory for stack\n"); in pqisrc_init_taglist() 178 /* push all the entries to the stack */ in pqisrc_init_taglist() [all …]
|
| /freebsd/share/doc/usd/05.dc/ |
| H A D | dc | 93 stack. 95 off the stack, performing the desired operation, and pushing the result 96 on the stack. 116 The value of the number is pushed onto the main stack. 127 top two values on the stack are added 135 The two entries are popped off the stack; 136 the result is pushed on the stack in their place. 145 top of the main stack is popped and stored into 156 is treated as a stack and the value is pushed onto it. 166 is pushed onto the stack. [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/BinaryFormat/ |
| H A D | MsgPackDocument.cpp | 108 // A level in the document reading stack. 136 SmallVector<StackLevel, 4> Stack; in readFromBlob() local 140 Stack.push_back(StackLevel(Root, 0, (size_t)-1)); in readFromBlob() 153 if (Multi && Stack.size() == 1) { in readFromBlob() 195 if (Stack.empty()) in readFromBlob() 197 else if (Stack.back().Node.getKind() == Type::Array) { in readFromBlob() 199 auto &Array = Stack.back().Node.getArray(); in readFromBlob() 200 DestNode = &Array[Stack.back().Index++]; in readFromBlob() 202 auto &Map = Stack.back().Node.getMap(); in readFromBlob() 203 if (!Stack in readFromBlob() 258 SmallVector<WriterStackLevel, 4> Stack; writeToBlob() local [all...] |
| /freebsd/contrib/llvm-project/compiler-rt/lib/msan/ |
| H A D | msan_allocator.cpp | 184 static void *MsanAllocate(BufferedStackTrace *stack, uptr size, uptr alignment, in MsanAllocate() argument 191 GET_FATAL_STACK_TRACE_IF_EMPTY(stack); in MsanAllocate() 192 ReportAllocationSizeTooBig(size, max_malloc_size, stack); in MsanAllocate() 197 GET_FATAL_STACK_TRACE_IF_EMPTY(stack); in MsanAllocate() 198 ReportRssLimitExceeded(stack); in MsanAllocate() 214 GET_FATAL_STACK_TRACE_IF_EMPTY(stack); in MsanAllocate() 215 ReportOutOfMemory(size, stack); in MsanAllocate() 228 stack->tag = StackTrace::TAG_ALLOC; in MsanAllocate() 229 Origin o = Origin::CreateHeapOrigin(stack); in MsanAllocate() 238 void MsanDeallocate(BufferedStackTrace *stack, void *p) { in MsanDeallocate() argument [all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/safestack/ |
| H A D | safestack.cpp | 9 // This file implements the runtime support for the safe stack protection 10 // mechanism. The runtime manages allocation/deallocation of the unsafe stack 51 // TODO: To make accessing the unsafe stack pointer faster, we plan to 54 // the same mechanism as currently being used by the traditional stack 55 // protector pass to store the stack guard (see getStackCookieLocation() 67 // TODO: The runtime library does not currently protect the safe stack beyond 68 // relying on the system-enforced ASLR. The protection of the (safe) stack can 72 // architectures: the (safe) stack segment (implicitly accessed via the %ss 78 // to access the safe stack can be prevented from doing so through runtime 79 // instrumentation. One way to do it is to allocate the safe stack(s) in the [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | CodeGenCommonISel.h | 24 /// Encapsulates all of the information needed to generate a stack protector 27 /// *NOTE* The following is a high level documentation of SelectionDAG Stack 31 /// High Level Overview of ISel Stack Protector Generation: 33 /// Previously, the "stack protector" IR pass handled stack protector 42 /// stack, if we could delay the generation of the stack protector check until 44 /// tail call optimization and the stack protector check! 48 /// 1. Preserve the architecture independence of stack protector generation. 50 /// 2. Preserve the normal IR level stack protector check for platforms like 51 /// OpenBSD for which we support platform-specific stack protector 64 /// CallLowering in GlobalISel) which occurs after the Stack Protector [all …]
|
| H A D | MachineFrameInfo.h | 1 //===-- CodeGen/MachineFrameInfo.h - Abstract Stack Frame Rep. --*- C++ -*-===// 33 /// on the stack by setting DstReg instead of FrameIdx. 53 /// Flag indicating whether the register is spilled to stack or another 77 /// The MachineFrameInfo class represents an abstract stack frame until 78 /// prolog/epilog code is inserted. This class is key to allowing stack frame 81 /// of abstract objects on the stack frame. 83 /// To support this, the class assigns unique integer identifiers to stack 85 /// fixed stack objects (such as arguments passed on the stack) or nonnegative 86 /// for objects that may be reordered. Instructions which refer to stack 90 /// Because this class keeps track of all references to the stack frame, it [all …]
|
| /freebsd/sys/contrib/ck/include/ |
| H A D | ck_stack.h | 51 * Stack producer operation safe for multiple unique producers and multiple consumers. 56 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() 74 * Stack producer operation for multiple unique producers and multiple consumers. 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() [all …]
|
| /freebsd/contrib/googletest/googletest/test/ |
| H A D | googletest-output-test-golden-lin.txt | 7 Stack trace: (omitted) 13 Stack trace: (omitted) 47 Stack trace: (omitted) 55 Stack trace: (omitted) 69 Stack trace: (omitted) 80 Stack trace: (omitted) 90 Stack trace: (omitted) 99 Stack trace: (omitted) 109 Stack trace: (omitted) 115 Stack trace: (omitted) [all …]
|
| /freebsd/contrib/bc/manuals/dc/ |
| H A D | EHN.1 | 45 It uses a stack (reverse Polish notation) to store numbers and results 47 Arithmetic operations pop arguments off of the stack and push the 389 Prints the value on top of the stack, whether number or string, and 393 This does not alter the stack. 397 Prints the value on top of the stack, whether number or string, and pops 398 it off of the stack. 401 Pops a value off the stack. 415 Prints the entire contents of the stack, in order from newest to oldest, 425 The top two values are popped off the stack, added, and the result is 426 pushed onto the stack. [all …]
|
| H A D | EH.1 | 45 It uses a stack (reverse Polish notation) to store numbers and results 47 Arithmetic operations pop arguments off of the stack and push the 389 Prints the value on top of the stack, whether number or string, and 393 This does not alter the stack. 397 Prints the value on top of the stack, whether number or string, and pops 398 it off of the stack. 401 Pops a value off the stack. 415 Prints the entire contents of the stack, in order from newest to oldest, 425 The top two values are popped off the stack, added, and the result is 426 pushed onto the stack. [all …]
|
| /freebsd/contrib/libcbor/src/cbor/internal/ |
| H A D | builder_callbacks.c | 26 if (ctx->stack->size == 0) { in _cbor_builder_append() 32 switch (ctx->stack->top->item->type) { in _cbor_builder_append() 37 if (cbor_array_is_definite(ctx->stack->top->item)) { in _cbor_builder_append() 41 CBOR_ASSERT(ctx->stack->top->subitems > 0); in _cbor_builder_append() 44 if (!cbor_array_push(ctx->stack->top->item, item)) { in _cbor_builder_append() 50 ctx->stack->top->subitems--; in _cbor_builder_append() 51 if (ctx->stack->top->subitems == 0) { in _cbor_builder_append() 52 cbor_item_t *stack_item = ctx->stack->top->item; in _cbor_builder_append() 53 _cbor_stack_pop(ctx->stack); in _cbor_builder_append() 58 if (!cbor_array_push(ctx->stack in _cbor_builder_append() [all...] |
| /freebsd/contrib/llvm-project/compiler-rt/lib/lsan/ |
| H A D | lsan_allocator.cpp | 63 static void RegisterAllocation(const StackTrace &stack, void *p, uptr size) { in RegisterAllocation() argument 68 m->stack_trace_id = StackDepotPut(stack); in RegisterAllocation() 82 static void *ReportAllocationSizeTooBig(uptr size, const StackTrace &stack) { in ReportAllocationSizeTooBig() argument 87 ReportAllocationSizeTooBig(size, max_malloc_size, &stack); in ReportAllocationSizeTooBig() 90 void *Allocate(const StackTrace &stack, uptr size, uptr alignment, in Allocate() argument 95 return ReportAllocationSizeTooBig(size, stack); in Allocate() 99 ReportRssLimitExceeded(&stack); in Allocate() 106 ReportOutOfMemory(size, &stack); in Allocate() 111 RegisterAllocation(stack, p, size); in Allocate() 115 static void *Calloc(uptr nmemb, uptr size, const StackTrace &stack) { in Calloc() argument [all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/asan/ |
| H A D | asan_allocator.cpp | 57 u32 tid, u32 stack) { in AtomicContextStore() argument 60 context += stack; in AtomicContextStore() 65 u32 &tid, u32 &stack) { in AtomicContextLoad() argument 67 stack = context; in AtomicContextLoad() 121 void SetAllocContext(u32 tid, u32 stack) { in SetAllocContext() argument 122 AtomicContextStore(&alloc_context_id, tid, stack); in SetAllocContext() 125 void GetAllocContext(u32 &tid, u32 &stack) const { in GetAllocContext() 126 AtomicContextLoad(&alloc_context_id, tid, stack); in GetAllocContext() 134 void SetFreeContext(u32 tid, u32 stack) { in SetFreeContext() argument 135 AtomicContextStore(&free_context_id, tid, stack); in SetFreeContext() [all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_allocator_report.cpp | 26 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 57 ScopedAllocatorErrorReport report("reallocarray-overflow", stack); in ReportReallocArrayOverflow() 66 void NORETURN ReportPvallocOverflow(uptr size, const StackTrace *stack) { in ReportPvallocOverflow() argument 68 ScopedAllocatorErrorReport report("pvalloc-overflow", stack); in ReportPvallocOverflow() [all …]
|