Home
last modified time | relevance | path

Searched refs:stack (Results 126 - 150 of 3215) sorted by relevance

12345678910>>...129

/kernel/linux/linux-6.6/include/linux/sched/
H A Dtask_stack.h6 * task->stack (kernel stack) handling interfaces:
15 * When accessing the stack of a non-current task that might exit, use
21 return task->stack; in task_stack_page()
29 return (unsigned long *)((unsigned long)task->stack + THREAD_SIZE) - 1; in end_of_stack()
31 return task->stack; in end_of_stack()
37 #define task_stack_page(task) ((void *)(task)->stack)
46 * Return the address of the last usable long on the stack.
48 * When the stack grows down, this is just above the thread
51 * When the stack grow
89 void *stack = task_stack_page(current); object_is_on_stack() local
[all...]
/kernel/linux/linux-6.6/arch/x86/include/asm/
H A Dstacktrace.h31 bool in_task_stack(unsigned long *stack, struct task_struct *task,
34 bool in_entry_stack(unsigned long *stack, struct stack_info *info);
36 int get_stack_info(unsigned long *stack, struct task_struct *task,
38 bool get_stack_info_noinstr(unsigned long *stack, struct task_struct *task,
42 bool get_stack_guard_info(unsigned long *stack, struct stack_info *info) in get_stack_guard_info() argument
44 /* make sure it's not in the stack proper */ in get_stack_guard_info()
45 if (get_stack_info_noinstr(stack, current, info)) in get_stack_guard_info()
48 return get_stack_info_noinstr((void *)stack + PAGE_SIZE, current, info); in get_stack_guard_info()
101 /* The form of the top of the frame on the stack */
/kernel/linux/linux-6.6/mm/kasan/
H A Dreport_tags.c36 depot_stack_handle_t stack; in kasan_complete_mode_report_info() local
50 * The loop below tries to find stack ring entries relevant to the in kasan_complete_mode_report_info()
72 stack = READ_ONCE(entry->stack); in kasan_complete_mode_report_info()
84 info->free_track.stack = stack; in kasan_complete_mode_report_info()
99 info->alloc_track.stack = stack; in kasan_complete_mode_report_info()
/kernel/liteos_a/testsuites/unittest/process/basic/process/full/
H A Dprocess_test_051.cpp70 void *stack; in Testcase() local
85 stack = malloc(arg); in Testcase()
86 ICUNIT_GOTO_NOT_EQUAL(stack, NULL, stack, EXIT1); in Testcase()
88 stackTop = reinterpret_cast<char *>(reinterpret_cast<unsigned long>(stack) + arg); in Testcase()
97 free(stack); in Testcase()
H A Dprocess_test_050.cpp53 void *stack; in Testcase() local
70 stack = malloc(arg); in Testcase()
71 ICUNIT_GOTO_NOT_EQUAL(stack, NULL, stack, EXIT1); in Testcase()
73 stackTop = reinterpret_cast<char *>(reinterpret_cast<unsigned long>(stack) + arg); in Testcase()
87 free(stack); in Testcase()
H A Dprocess_test_049.cpp83 char *stack; in Testcase() local
95 stack = static_cast<char *>(malloc(arg)); in Testcase()
96 ICUNIT_GOTO_NOT_EQUAL(stack, NULL, stack, EXIT1); in Testcase()
98 stackTop = reinterpret_cast<char *>(reinterpret_cast<unsigned long>(stack) + arg); in Testcase()
107 free(stack); in Testcase()
/kernel/linux/linux-5.10/arch/h8300/kernel/
H A Dtraps.c96 pr_info("(Possibly corrupted stack page??)\n"); in dump()
121 unsigned long *stack, addr; in show_stack() local
127 stack = esp; in show_stack()
129 printk("%sStack from %08lx:", loglvl, (unsigned long)stack); in show_stack()
131 if (((unsigned long)stack & (THREAD_SIZE - 1)) >= in show_stack()
136 pr_cont(" %08lx", *stack++); in show_stack()
141 stack = esp; in show_stack()
142 while (((unsigned long)stack & (THREAD_SIZE - 1)) < THREAD_SIZE-4) { in show_stack()
143 addr = *stack++; in show_stack()
/kernel/linux/linux-5.10/tools/perf/scripts/python/
H A Dstackcollapse.py1 # stackcollapse.py - format perf samples with one line per distinct call stack
5 # separated stack including the program name (from the "comm" field) and the
6 # function names from the call stack. The second is a count:
39 # formatting options for the bottom entry of the stack
42 help="include thread id in stack"),
45 help="include process id in stack"),
97 stack = list()
103 stack.append(tidy_function_name(entry['sym']['name'],
108 stack.append(tidy_function_name(param_dict['symbol'],
119 stack
[all...]
/kernel/linux/linux-6.6/tools/perf/scripts/python/
H A Dstackcollapse.py1 # stackcollapse.py - format perf samples with one line per distinct call stack
5 # separated stack including the program name (from the "comm" field) and the
6 # function names from the call stack. The second is a count:
39 # formatting options for the bottom entry of the stack
42 help="include thread id in stack"),
45 help="include process id in stack"),
97 stack = list()
103 stack.append(tidy_function_name(entry['sym']['name'],
108 stack.append(tidy_function_name(param_dict['symbol'],
119 stack
[all...]
/third_party/node/test/parallel/
H A Dtest-vm-context.js60 assert.match(e.stack, /expected-filename/);
106 let stack = null;
114 stack = err.stack;
115 return /^ \^/m.test(stack) &&
116 /expected-filename\.js:33:131/.test(stack);
117 }, `stack not formatted as expected: ${stack}`);
/third_party/mesa3d/src/util/
H A Ddag.c143 struct util_dynarray stack; in dag_traverse_bottom_up_node() local
144 util_dynarray_init(&stack, NULL); in dag_traverse_bottom_up_node()
150 util_dynarray_append(&stack, struct dag_node *, node); in dag_traverse_bottom_up_node()
152 /* Push unprocessed children onto stack in reverse order. Note that in dag_traverse_bottom_up_node()
154 * stack. in dag_traverse_bottom_up_node()
158 util_dynarray_append(&stack, struct dag_node *, edge->child); in dag_traverse_bottom_up_node()
166 struct dag_node *top = util_dynarray_pop(&stack, struct dag_node *); in dag_traverse_bottom_up_node()
176 /* Find the next unprocessed node in the stack */ in dag_traverse_bottom_up_node()
179 if (stack.size == 0) in dag_traverse_bottom_up_node()
182 node = util_dynarray_pop(&stack, struc in dag_traverse_bottom_up_node()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_consume.cc66 absl::InlinedVector<Entry, 40> stack; in Consume() local
93 stack.push_back({right, 0, length_right}); in Consume()
97 stack.push_back({left, offset, length_left}); in Consume()
107 if (stack.empty()) return; in Consume()
109 rep = stack.back().rep; in Consume()
110 offset = stack.back().offset; in Consume()
111 length = stack.back().length; in Consume()
112 stack.pop_back(); in Consume()
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/
H A Dintel_runtime_pm.c77 depot_stack_handle_t stack, *stacks; in track_intel_runtime_pm_wakeref() local
83 stack = __save_depot_stack(); in track_intel_runtime_pm_wakeref()
84 if (!stack) in track_intel_runtime_pm_wakeref()
90 rpm->debug.last_acquire = stack; in track_intel_runtime_pm_wakeref()
96 stacks[rpm->debug.count++] = stack; in track_intel_runtime_pm_wakeref()
99 stack = -1; in track_intel_runtime_pm_wakeref()
104 return stack; in track_intel_runtime_pm_wakeref()
108 depot_stack_handle_t stack) in untrack_intel_runtime_pm_wakeref()
116 if (unlikely(stack == -1)) in untrack_intel_runtime_pm_wakeref()
121 if (rpm->debug.owners[n] == stack) { in untrack_intel_runtime_pm_wakeref()
107 untrack_intel_runtime_pm_wakeref(struct intel_runtime_pm *rpm, depot_stack_handle_t stack) untrack_intel_runtime_pm_wakeref() argument
191 depot_stack_handle_t stack = dbg->owners[i]; __print_intel_runtime_pm_wakeref() local
[all...]
/kernel/linux/linux-5.10/scripts/kconfig/
H A Dsymbol.c1005 * When we check for recursive dependencies we use a stack to save
1007 * The entries are located on the call stack so no need to free memory.
1008 * Note insert() remove() must always match to properly clear the stack.
1017 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym) in dep_stack_insert() argument
1019 memset(stack, 0, sizeof(*stack)); in dep_stack_insert()
1021 check_top->next = stack; in dep_stack_insert()
1022 stack->prev = check_top; in dep_stack_insert()
1023 stack->sym = sym; in dep_stack_insert()
1024 check_top = stack; in dep_stack_insert()
1041 struct dep_stack *stack; sym_check_print_recursive() local
1167 struct dep_stack stack; sym_check_sym_deps() local
1216 struct dep_stack stack; sym_check_choice_deps() local
1261 struct dep_stack stack; sym_check_deps() local
[all...]
/kernel/linux/linux-6.6/scripts/kconfig/
H A Dsymbol.c961 * When we check for recursive dependencies we use a stack to save
963 * The entries are located on the call stack so no need to free memory.
964 * Note insert() remove() must always match to properly clear the stack.
973 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym) in dep_stack_insert() argument
975 memset(stack, 0, sizeof(*stack)); in dep_stack_insert()
977 check_top->next = stack; in dep_stack_insert()
978 stack->prev = check_top; in dep_stack_insert()
979 stack->sym = sym; in dep_stack_insert()
980 check_top = stack; in dep_stack_insert()
997 struct dep_stack *stack; sym_check_print_recursive() local
1123 struct dep_stack stack; sym_check_sym_deps() local
1172 struct dep_stack stack; sym_check_choice_deps() local
1217 struct dep_stack stack; sym_check_deps() local
[all...]
/third_party/json/tools/cpplint/
H A Dcpplint.py438 'stack.h',
488 'stack',
2002 def FindEndOfExpressionInLine(line, startpos, stack):
2008 stack: nesting stack at startpos.
2013 Otherwise: (-1, new stack at end of this line)
2018 # Found start of parenthesized expression, push to expression stack
2019 stack.append(char)
2024 if stack and stack[
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Djump-threading.cc22 ZoneStack<RpoNumber>& stack; member
27 stack.push(num); in PushIfUnvisited()
32 RpoNumber from = stack.top(); in Forward()
40 stack.push(to); in Forward()
52 if (pop) stack.pop(); in Forward()
64 ZoneStack<RpoNumber> stack(local_zone); in ComputeForwarding()
65 JumpThreadingState state = {false, *result, stack}; in ComputeForwarding()
72 // Iterate over the blocks forward, pushing the blocks onto the stack. in ComputeForwarding()
77 // Process the stack, which implements DFS through empty blocks. in ComputeForwarding()
78 while (!state.stack in ComputeForwarding()
[all...]
/third_party/node/deps/v8/src/codegen/
H A Dsource-position.cc24 const std::vector<SourcePositionInfo>& stack) { in operator <<()
26 for (const SourcePositionInfo& pos : stack) { in operator <<()
52 std::vector<SourcePositionInfo> stack; in InliningStack() local
55 stack.push_back(SourcePositionInfo(pos, inl.shared_info)); in InliningStack()
58 stack.push_back(SourcePositionInfo(pos, cinfo->shared_info())); in InliningStack()
59 return stack; in InliningStack()
68 std::vector<SourcePositionInfo> stack; in InliningStack() local
73 stack.push_back(SourcePositionInfo(pos, function)); in InliningStack()
78 stack.push_back(SourcePositionInfo(pos, function)); in InliningStack()
79 return stack; in InliningStack()
23 operator <<(std::ostream& out, const std::vector<SourcePositionInfo>& stack) operator <<() argument
[all...]
/kernel/linux/linux-5.10/arch/um/kernel/
H A Dsysrq.c30 void show_stack(struct task_struct *task, unsigned long *stack, in show_stack() argument
38 " aborting stack trace!\n"); in show_stack()
42 if (!stack) in show_stack()
43 stack = get_stack_pointer(task, segv_regs); in show_stack()
47 if (kstack_end(stack)) in show_stack()
51 pr_cont(" %08lx", *stack++); in show_stack()
/kernel/liteos_a/testsuites/unittest/container/smoke/
H A DIt_container_001.cpp51 char *stack = nullptr; in ItContainer001() local
53 stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANONYMOUS | MAP_STACK, -1, 0); in ItContainer001()
54 ASSERT_NE(stack, MAP_FAILED); in ItContainer001()
55 stackTop = stack + STACK_SIZE; in ItContainer001()
58 (void)munmap(stack, STACK_SIZE); in ItContainer001()
H A DIt_container_chroot_002.cpp58 char *stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, in TestFunc() local
60 if (stack == nullptr) { in TestFunc()
63 char *stackTop = stack + STACK_SIZE; in TestFunc()
104 char *stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, in ItContainerChroot002() local
106 ASSERT_TRUE(stack != nullptr); in ItContainerChroot002()
107 char *stackTop = stack + STACK_SIZE; in ItContainerChroot002()
H A DIt_net_container_004.cpp55 char *stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, CLONE_STACK_MMAP_FLAG, -1, 0); in ChildFun() local
56 EXPECT_STRNE(stack, nullptr); in ChildFun()
57 char *stackTop = stack + STACK_SIZE; in ChildFun()
109 char *stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, CLONE_STACK_MMAP_FLAG, -1, 0); in ItNetContainer004() local
110 EXPECT_STRNE(stack, nullptr); in ItNetContainer004()
111 char *stackTop = stack + STACK_SIZE; in ItNetContainer004()
H A DIt_net_container_006.cpp91 char *stack = nullptr; in ChildFunc() local
117 stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, CLONE_STACK_MMAP_FLAG, -1, 0); in ChildFunc()
118 EXPECT_STRNE(stack, nullptr); in ChildFunc()
119 stackTop = stack + STACK_SIZE; in ChildFunc()
168 char *stack = (char *)mmap(nullptr, STACK_SIZE, PROT_READ | PROT_WRITE, CLONE_STACK_MMAP_FLAG, -1, 0); in ItNetContainer006() local
169 EXPECT_STRNE(stack, nullptr); in ItNetContainer006()
170 char *stackTop = stack + STACK_SIZE; in ItNetContainer006()
/kernel/linux/linux-5.10/fs/jfs/
H A Djfs_btree.h93 * btree traversal stack
98 struct btframe { /* stack frame */
108 struct btframe stack[MAXTREEHEIGHT]; member
112 (btstack)->top = (btstack)->stack
115 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
126 ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
129 ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
137 (long long)btstack->stack[i].bn, in BT_STACK_DUMP()
138 btstack->stack[i].index); in BT_STACK_DUMP()
/kernel/linux/linux-6.6/fs/jfs/
H A Djfs_btree.h93 * btree traversal stack
98 struct btframe { /* stack frame */
108 struct btframe stack[MAXTREEHEIGHT]; member
112 (btstack)->top = (btstack)->stack
115 ( (btstack)->top == &((btstack)->stack[MAXTREEHEIGHT-1]))
126 ( (btstack)->top == (btstack)->stack ? NULL : --(btstack)->top )
129 ( (btstack)->top == (btstack)->stack ? NULL : (btstack)->top )
137 (long long)btstack->stack[i].bn, in BT_STACK_DUMP()
138 btstack->stack[i].index); in BT_STACK_DUMP()

Completed in 12 milliseconds

12345678910>>...129