Home
last modified time | relevance | path

Searched refs:stack (Results 51 - 75 of 3084) sorted by relevance

12345678910>>...124

/third_party/musl/src/regex/
H A Dregcomp.c225 from tre-stack.c and tre-stack.h
230 /* Creates a new stack object. `size' is initial size in bytes, `max_size'
232 allocated with realloc() if all space gets used up. Returns the stack
237 /* Frees the stack object. */
241 /* Returns the current number of objects in the stack. */
246 `value' on top of stack `s'. Returns REG_ESPACE if out of memory.
256 element off of stack `s' and returns it. The stack must not be
297 union tre_stack_item *stack; member
399 tre_stack_t *stack; global() member
965 tre_stack_t *stack = ctx->stack; tre_parse() local
1203 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree, tre_tnfa_t *tnfa) tre_add_tags() argument
1687 tre_copy_ast(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *ast, int flags, int *pos_add, tre_tag_direction_t *tag_directions, tre_ast_node_t **copy, int *max_pos) tre_copy_ast() argument
1835 tre_expand_ast(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *ast, int *position, tre_tag_direction_t *tag_directions) tre_expand_ast() argument
2134 tre_match_empty(tre_stack_t *stack, tre_ast_node_t *node, int *tags, int *assertions, int *num_tags_seen) tre_match_empty() argument
2244 tre_compute_nfl(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree) tre_compute_nfl() argument
2693 tre_stack_t *stack; regcomp() local
[all...]
/third_party/node/deps/v8/src/torque/
H A Dtorque-code-generator.cc28 Stack<std::string>* stack) { in EmitInstruction()
39 EmitIRAnnotation(instruction.Cast<T>(), stack); \ in EmitInstruction()
41 return EmitInstruction(instruction.Cast<T>(), stack); in EmitInstruction()
48 Stack<std::string>* stack) { in EmitInstruction()
49 stack->Push(stack->Peek(instruction.slot)); in EmitInstruction()
53 Stack<std::string>* stack) { in EmitInstruction()
54 stack->Poke(instruction.slot, stack->Top()); in EmitInstruction()
55 stack in EmitInstruction()
27 EmitInstruction(const Instruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
47 EmitInstruction(const PeekInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
52 EmitInstruction(const PokeInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
58 EmitInstruction( const DeleteRangeInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
[all...]
/kernel/linux/linux-5.10/tools/lib/traceevent/plugins/
H A Dplugin_function.c15 char **stack; member
53 static void add_child(struct func_stack *stack, const char *child, int pos) in add_child() argument
60 if (pos < stack->size) in add_child()
61 free(stack->stack[pos]); in add_child()
65 ptr = realloc(stack->stack, sizeof(char *) * in add_child()
66 (stack->size + STK_BLK)); in add_child()
72 stack->stack in add_child()
[all...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/stack/
H A Dstack_backgroundimagesize_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBackgroundImageSize001()
28 auto ret = nodeAPI->setAttribute(stack, NODE_BACKGROUND_IMAGE_SIZE, &value_item); in TestStackBackgroundImageSize001()
30 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BACKGROUND_IMAGE_SIZE)->value[PARAM_0].f32, imageWidth); in TestStackBackgroundImageSize001()
31 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BACKGROUND_IMAGE_SIZE)->value[PARAM_1].f32, imageHeight); in TestStackBackgroundImageSize001()
37 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBackgroundImageSize002()
43 auto ret = nodeAPI->setAttribute(stack, NODE_BACKGROUND_IMAGE_SIZE, &value_item); in TestStackBackgroundImageSize002()
45 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BACKGROUND_IMAGE_SIZE)->value[PARAM_0].f32, imageWidth); in TestStackBackgroundImageSize002()
46 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BACKGROUND_IMAGE_SIZE)->value[PARAM_1].f32, imageHeight); in TestStackBackgroundImageSize002()
52 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBackgroundImageSize003()
59 auto ret = nodeAPI->setAttribute(stack, NODE_BACKGROUND_IMAGE_SIZ in TestStackBackgroundImageSize003()
[all...]
H A Dstack_position_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackPosition001()
28 auto ret = nodeAPI->setAttribute(stack, NODE_POSITION, &value_item); in TestStackPosition001()
30 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_POSITION)->value[PARAM_0].f32, positionX); in TestStackPosition001()
31 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_POSITION)->value[PARAM_1].f32, positionY); in TestStackPosition001()
37 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackPosition002()
43 auto ret = nodeAPI->setAttribute(stack, NODE_POSITION, &value_item); in TestStackPosition002()
45 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_POSITION)->value[PARAM_0].f32, positionX); in TestStackPosition002()
46 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_POSITION)->value[PARAM_1].f32, positionY); in TestStackPosition002()
52 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackPosition003()
58 auto ret = nodeAPI->setAttribute(stack, NODE_POSITIO in TestStackPosition003()
[all...]
H A Dstack_scale_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackScale001()
27 auto ret = nodeAPI->setAttribute(stack, NODE_SCALE, &value_item); in TestStackScale001()
29 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SCALE)->value[PARAM_0].f32, x); in TestStackScale001()
30 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SCALE)->value[PARAM_1].f32, y); in TestStackScale001()
36 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackScale002()
41 auto ret = nodeAPI->setAttribute(stack, NODE_SCALE, &value_item); in TestStackScale002()
43 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SCALE)->value[PARAM_0].f32, x); in TestStackScale002()
44 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SCALE)->value[PARAM_1].f32, y); in TestStackScale002()
50 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackScale003()
55 auto ret = nodeAPI->setAttribute(stack, NODE_SCAL in TestStackScale003()
[all...]
H A Dstack_rotate_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackRotate001()
30 auto ret = nodeAPI->setAttribute(stack, NODE_ROTATE, &value_item); in TestStackRotate001()
32 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_ROTATE)->value[PARAM_0].f32, x); in TestStackRotate001()
33 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_ROTATE)->value[PARAM_1].f32, y); in TestStackRotate001()
34 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_ROTATE)->value[PARAM_2].f32, z); in TestStackRotate001()
35 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_ROTATE)->value[PARAM_3].f32, angle); in TestStackRotate001()
36 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_ROTATE)->value[PARAM_4].f32, perspective); in TestStackRotate001()
42 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackRotate002()
50 auto ret = nodeAPI->setAttribute(stack, NODE_ROTATE, &value_item); in TestStackRotate002()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_ROTAT in TestStackRotate002()
[all...]
H A Dstack_height_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackHeight001()
27 auto ret = nodeAPI->setAttribute(stack, NODE_HEIGHT, &value_item); in TestStackHeight001()
29 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_HEIGHT)->value[PARAM_0].f32, height); in TestStackHeight001()
35 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackHeight002()
40 auto ret = nodeAPI->setAttribute(stack, NODE_HEIGHT, &value_item); in TestStackHeight002()
42 if (nodeAPI->getAttribute(stack, NODE_HEIGHT) != nullptr) { in TestStackHeight002()
43 ASSERT_NE(nodeAPI->getAttribute(stack, NODE_HEIGHT)->value[PARAM_0].f32, height); in TestStackHeight002()
50 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackHeight003()
55 auto ret = nodeAPI->setAttribute(stack, NODE_HEIGHT, &value_item); in TestStackHeight003()
57 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_HEIGH in TestStackHeight003()
[all...]
H A Dstack_width_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackWidth001()
27 auto ret = nodeAPI->setAttribute(stack, NODE_WIDTH, &value_item); in TestStackWidth001()
29 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_WIDTH)->value[PARAM_0].f32, width); in TestStackWidth001()
35 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackWidth002()
40 auto ret = nodeAPI->setAttribute(stack, NODE_WIDTH, &value_item); in TestStackWidth002()
42 if (nodeAPI->getAttribute(stack, NODE_WIDTH) != nullptr) { in TestStackWidth002()
43 ASSERT_NE(nodeAPI->getAttribute(stack, NODE_WIDTH)->value[PARAM_0].f32, width); in TestStackWidth002()
50 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackWidth003()
55 auto ret = nodeAPI->setAttribute(stack, NODE_WIDTH, &value_item); in TestStackWidth003()
57 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_WIDT in TestStackWidth003()
[all...]
H A Dstack_translate_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackTranslate001()
28 auto ret = nodeAPI->setAttribute(stack, NODE_TRANSLATE, &value_item); in TestStackTranslate001()
30 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_TRANSLATE)->value[PARAM_0].f32, x); in TestStackTranslate001()
31 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_TRANSLATE)->value[PARAM_1].f32, y); in TestStackTranslate001()
32 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_TRANSLATE)->value[PARAM_2].f32, z); in TestStackTranslate001()
38 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackTranslate002()
44 auto ret = nodeAPI->setAttribute(stack, NODE_TRANSLATE, &value_item); in TestStackTranslate002()
46 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_TRANSLATE)->value[PARAM_0].f32, x); in TestStackTranslate002()
47 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_TRANSLATE)->value[PARAM_1].f32, y); in TestStackTranslate002()
48 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_TRANSLAT in TestStackTranslate002()
[all...]
/third_party/node/lib/
H A Ddomain.js128 // Get the stack trace at the point where `domain` was required.
130 const domainRequireStack = new Error('require(`domain`) at this point').stack;
135 err.stack = err.stack + '\n' + '-'.repeat(40) + '\n' + domainRequireStack;
169 // another one. The stack is each entered domain.
170 let stack = [];
171 exports._stack = stack;
175 if (ArrayPrototypeEvery(stack,
191 // the domain stack.
208 stack
[all...]
/third_party/ltp/lib/
H A Dcloner.c55 * 1. hppa takes bottom of stack and no stacksize (stack grows up)
56 * 2. __ia64__ takes bottom of stack and uses clone2
57 * 3. all others take top of stack (stack grows down)
61 size_t stack_size, void *stack, pid_t *ptid, void *tls, pid_t *ctid) in ltp_clone_()
66 ret = __clone2(fn, stack, stack_size, flags, arg, ptid, tls, ctid); in ltp_clone_()
70 * These arches grow their stack up, so don't need to adjust the base. in ltp_clone_()
75 * For archs where stack grows downwards, stack point in ltp_clone_()
60 ltp_clone_(unsigned long flags, int (*fn)(void *arg), void *arg, size_t stack_size, void *stack, pid_t *ptid, void *tls, pid_t *ctid) ltp_clone_() argument
88 ltp_clone(unsigned long flags, int (*fn)(void *arg), void *arg, size_t stack_size, void *stack) ltp_clone() argument
94 ltp_clone7(unsigned long flags, int (*fn)(void *arg), void *arg, size_t stack_size, void *stack, ...) ltp_clone7() argument
136 void *stack; ltp_clone_alloc() local
[all...]
/third_party/skia/third_party/externals/freetype/src/psaux/
H A Dpsstack.h5 * Adobe's code for emulating a CFF stack (specification).
47 /* CFF operand stack; specified maximum of 48 or 192 values */
78 cf2_stack_free( CF2_Stack stack ); variable
81 cf2_stack_count( CF2_Stack stack ); variable
84 cf2_stack_pushInt( CF2_Stack stack,
87 cf2_stack_pushFixed( CF2_Stack stack,
91 cf2_stack_popInt( CF2_Stack stack ); variable
93 cf2_stack_popFixed( CF2_Stack stack ); variable
96 cf2_stack_getReal( CF2_Stack stack,
99 cf2_stack_setReal( CF2_Stack stack,
113 cf2_stack_clear( CF2_Stack stack ); global() variable
[all...]
/third_party/python/Lib/test/
H A Dtest_contextlib.py641 with self.exit_stack() as stack:
644 f = stack.callback(_exit, *args, **kwds)
646 f = stack.callback(_exit, *args)
648 f = stack.callback(_exit, **kwds)
650 f = stack.callback(_exit)
652 for wrapper in stack._exit_callbacks:
659 with self.exit_stack() as stack:
661 stack.callback(arg=1)
665 stack.callback(callback=_exit, arg=3)
685 with self.exit_stack() as stack
[all...]
/third_party/skia/third_party/externals/swiftshader/src/OpenGL/common/
H A DMatrixStack.cpp23 stack = new Matrix[size]; in MatrixStack()
24 stack[0] = 1; in MatrixStack()
32 delete[] stack; in ~MatrixStack()
33 stack = 0; in ~MatrixStack()
38 stack[top] = 1; in identity()
43 stack[top] = M; in load()
48 stack[top] = Matrix(M[0], M[4], M[8], M[12], in load()
56 stack[top] = Matrix((float)M[0], (float)M[4], (float)M[8], (float)M[12], in load()
64 stack[top] *= Matrix::translate(x, y, z); in translate()
90 stack[to in rotate()
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/
H A Ddumpstack.c32 bool noinstr in_task_stack(unsigned long *stack, struct task_struct *task, in in_task_stack() argument
38 if (stack < begin || stack >= end) in in_task_stack()
50 bool noinstr in_entry_stack(unsigned long *stack, struct stack_info *info) in in_entry_stack() argument
57 if ((void *)stack < begin || (void *)stack >= end) in in_entry_stack()
134 /* No access to the user space stack of other tasks. Ignore. */ in show_opcodes()
166 * ordering reasons: if the registers are on the next stack, we don't in show_regs_if_on_stack()
168 * the wrong stack. Later, when show_trace_log_lvl() switches to the in show_regs_if_on_stack()
169 * next stack, thi in show_regs_if_on_stack()
186 show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs, unsigned long *stack, const char *log_lvl) show_trace_log_lvl() argument
[all...]
H A Ddumpstack_64.c40 * On 64-bit, we have a generic entry stack that we in stack_type_name()
55 * @offs: Offset from the start of the exception stack area
56 * @size: Size of the exception stack
73 * Array of exception stack page descriptors. If the stack is larger than
74 * PAGE_SIZE, all pages covering a particular stack will have the same
75 * info. The guard pages including the not mapped DB2 stack are zeroed
88 static __always_inline bool in_exception_stack(unsigned long *stack, struct stack_info *info) in in_exception_stack() argument
90 unsigned long begin, end, stk = (unsigned long)stack; in in_exception_stack()
99 * Handle the case where stack trac in in_exception_stack()
129 in_irq_stack(unsigned long *stack, struct stack_info *info) in_irq_stack() argument
154 get_stack_info_noinstr(unsigned long *stack, struct task_struct *task, struct stack_info *info) get_stack_info_noinstr() argument
175 get_stack_info(unsigned long *stack, struct task_struct *task, struct stack_info *info, unsigned long *visit_mask) get_stack_info() argument
[all...]
/kernel/linux/linux-6.6/arch/x86/kernel/
H A Ddumpstack.c32 bool noinstr in_task_stack(unsigned long *stack, struct task_struct *task, in in_task_stack() argument
38 if (stack < begin || stack >= end) in in_task_stack()
50 bool noinstr in_entry_stack(unsigned long *stack, struct stack_info *info) in in_entry_stack() argument
57 if ((void *)stack < begin || (void *)stack >= end) in in_entry_stack()
128 /* No access to the user space stack of other tasks. Ignore. */ in show_opcodes()
160 * ordering reasons: if the registers are on the next stack, we don't in show_regs_if_on_stack()
162 * the wrong stack. Later, when show_trace_log_lvl() switches to the in show_regs_if_on_stack()
163 * next stack, thi in show_regs_if_on_stack()
186 show_trace_log_lvl(struct task_struct *task, struct pt_regs *regs, unsigned long *stack, const char *log_lvl) show_trace_log_lvl() argument
[all...]
/third_party/python/Tools/scripts/
H A Difdef.py54 stack = []
79 stack.append((ok, ko, word))
82 stack.append((ok, not ko, word))
85 stack.append((ok, -1, word))
88 stack.append((ok, -1, ''))
90 elif keyword == 'else' and stack:
91 s_ok, s_ko, s_word = stack[-1]
98 stack[-1] = s_ok, s_ko, s_word
99 elif keyword == 'endif' and stack:
100 s_ok, s_ko, s_word = stack[
[all...]
/third_party/skia/third_party/externals/spirv-cross/
H A Dspirv_reflect.cpp41 using Stack = std::stack<State>;
45 Stack stack; member in simple_json::Stream
121 if (!stack.empty() && stack.top().second) in begin_json_array()
127 stack.emplace(Type::Array, false); in begin_json_array()
132 if (stack.empty() || stack.top().first != Type::Array) in end_json_array()
134 if (stack.top().second) in end_json_array()
140 stack.pop(); in end_json_array()
141 if (!stack in end_json_array()
[all...]
/kernel/linux/linux-6.6/arch/s390/kernel/
H A Ddumpstack.c44 enum stack_type type, unsigned long stack) in in_stack()
46 if (sp < stack || sp >= stack + THREAD_SIZE) in in_stack()
49 info->begin = stack; in in_stack()
50 info->end = stack + THREAD_SIZE; in in_stack()
57 unsigned long stack = (unsigned long)task_stack_page(task); in in_task_stack() local
59 return in_stack(sp, info, STACK_TYPE_TASK, stack); in in_task_stack()
64 unsigned long stack = S390_lowcore.async_stack - STACK_INIT_OFFSET; in in_irq_stack() local
66 return in_stack(sp, info, STACK_TYPE_IRQ, stack); in in_irq_stack()
71 unsigned long stack in in_nodat_stack() local
43 in_stack(unsigned long sp, struct stack_info *info, enum stack_type type, unsigned long stack) in_stack() argument
78 unsigned long stack = S390_lowcore.mcck_stack - STACK_INIT_OFFSET; in_mcck_stack() local
85 unsigned long stack = S390_lowcore.restart_stack - STACK_INIT_OFFSET; in_restart_stack() local
129 show_stack(struct task_struct *task, unsigned long *stack, const char *loglvl) show_stack() argument
[all...]
/third_party/mesa3d/src/compiler/glsl/tests/
H A Dsexps.py51 stack = [[]]
55 stack.append([])
57 if len(stack) == 1:
59 sexp = stack.pop()
60 stack[-1].append(sexp)
62 stack[-1].append(token)
63 if len(stack) != 1:
65 if len(stack[0]) != 1:
67 return stack[0][0]
/third_party/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/docs/
H A DCheckTags.java47 DocStack stack = new DocStack(); field in CheckTags
70 private DocNode[] stack; field in CheckTags.DocStack
75 if (stack == null) { in push()
76 stack = new DocNode[5]; in push()
78 if (index == stack.length) { in push()
79 DocNode[] temp = new DocNode[stack.length * 2]; in push()
80 System.arraycopy(stack, 0, temp, 0, index); in push()
81 stack = temp; in push()
84 if (stack[index] == null) { in push()
85 stack[inde in push()
[all...]
/kernel/linux/linux-6.6/arch/um/kernel/skas/
H A Dmmu.c21 unsigned long stack = 0; in init_new_context() local
24 stack = __get_free_pages(GFP_KERNEL | __GFP_ZERO, ilog2(STUB_DATA_PAGES)); in init_new_context()
25 if (stack == 0) in init_new_context()
28 to_mm->id.stack = stack; in init_new_context()
34 to_mm->id.u.pid = copy_context_skas0(stack, in init_new_context()
36 else to_mm->id.u.pid = start_userspace(stack); in init_new_context()
54 if (to_mm->id.stack != 0) in init_new_context()
55 free_pages(to_mm->id.stack, ilog2(STUB_DATA_PAGES)); in init_new_context()
77 free_pages(mmu->id.stack, ilog in destroy_context()
[all...]
/third_party/node/test/parallel/
H A Dtest-internal-util-decorate-error-stack.js24 // Verify that a stack property is not added to non-Errors.
27 assert.strictEqual(obj.stack, undefined);
29 // Verify that the stack is decorated when possible.
30 function checkStack(stack) {
31 // Matching only on a minimal piece of the stack because the string will vary
36 assert.match(stack, /;/g);
38 assert.match(stack, /\n/g);
51 checkStack(err.stack);
53 // Verify that the stack is only decorated once.
56 checkStack(err.stack);
[all...]

Completed in 12 milliseconds

12345678910>>...124