Home
last modified time | relevance | path

Searched refs:stack (Results 26 - 50 of 3084) sorted by relevance

12345678910>>...124

/kernel/linux/linux-5.10/drivers/misc/altera-stapl/
H A Daltera.c119 /* This function checks if enough parameters are available on the stack. */
213 long *stack = astate->stack; in altera_execute() local
528 stack[stack_ptr] = stack[stack_ptr - 1]; in altera_execute()
534 long_tmp = stack[stack_ptr - 2]; in altera_execute()
535 stack[stack_ptr - 2] = stack[stack_ptr - 1]; in altera_execute()
536 stack[stack_ptr - 1] = long_tmp; in altera_execute()
542 stack[stack_pt in altera_execute()
572 stack[stack_ptr - 1] <<= stack[stack_ptr]; altera_execute() local
578 stack[stack_ptr - 1] >>= stack[stack_ptr]; altera_execute() local
[all...]
/kernel/linux/linux-5.10/lib/zstd/
H A Dzstd_common.c28 #define stack_push(stack, size) \
30 void *const ptr = ZSTD_PTR_ALIGN((stack)->ptr); \
31 (stack)->ptr = (char *)ptr + (size); \
32 (stack)->ptr <= (stack)->end ? ptr : NULL; \
38 ZSTD_stack *stack = (ZSTD_stack *)workspace; in ZSTD_initStack() local
44 /* Initialize the stack */ in ZSTD_initStack()
45 stack->ptr = workspace; in ZSTD_initStack()
46 stack->end = (char *)workspace + workspaceSize; in ZSTD_initStack()
47 stack_push(stack, sizeo in ZSTD_initStack()
53 ZSTD_stack *stack = (ZSTD_stack *)opaque; ZSTD_stackAllocAll() local
60 ZSTD_stack *stack = (ZSTD_stack *)opaque; ZSTD_stackAlloc() local
[all...]
/third_party/node/deps/v8/src/torque/
H A Dcc-generator.cc55 Stack<std::string> stack; in EmitBlock() local
59 stack.Push(DefinitionToVariable(def)); in EmitBlock()
64 << " " << stack.Top() << "{}; USE(" << stack.Top() << ");\n"; in EmitBlock()
69 TorqueCodeGenerator::EmitInstruction(instruction, &stack); in EmitBlock()
71 return stack; in EmitBlock()
86 Stack<std::string>* stack) { in EmitInstruction()
92 Stack<std::string>* stack) { in EmitInstruction()
98 Stack<std::string>* stack) { in EmitInstruction()
104 std::vector<std::string> constexpr_arguments, Stack<std::string>* stack) { in ProcessArgumentsCommon()
84 EmitInstruction( const PushUninitializedInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
90 EmitInstruction( const PushBuiltinPointerInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
96 EmitInstruction( const NamespaceConstantInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
102 ProcessArgumentsCommon( const TypeVector& parameter_types, std::vector<std::string> constexpr_arguments, Stack<std::string>* stack) ProcessArgumentsCommon() argument
124 EmitInstruction(const CallIntrinsicInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
207 EmitInstruction(const CallCsaMacroInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
257 EmitInstruction( const CallCsaMacroAndBranchInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
263 EmitInstruction(const MakeLazyNodeInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
268 EmitInstruction(const CallBuiltinInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
273 EmitInstruction( const CallBuiltinPointerInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
279 EmitInstruction(const CallRuntimeInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
284 EmitInstruction(const BranchInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
293 EmitInstruction(const ConstexprBranchInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
302 EmitGoto(const Block* destination, Stack<std::string>* stack, std::string indentation) EmitGoto() argument
316 EmitInstruction(const GotoInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
321 EmitInstruction(const GotoExternalInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
326 EmitInstruction(const ReturnInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
331 EmitInstruction( const PrintConstantStringInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
338 EmitInstruction(const AbortInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
363 EmitInstruction(const UnsafeCastInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
372 EmitInstruction(const LoadReferenceInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
422 EmitInstruction(const StoreReferenceInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
439 EmitInstruction(const LoadBitFieldInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
469 EmitInstruction(const StoreBitFieldInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
[all...]
H A Dcsa-generator.cc70 Stack<std::string> stack; in EmitBlock() local
75 stack.Push(DefinitionToVariable(def)); in EmitBlock()
79 << "> " << stack.Top() << ";\n"; in EmitBlock()
80 phi_names << ", &" << stack.Top(); in EmitBlock()
86 TorqueCodeGenerator::EmitInstruction(instruction, &stack); in EmitBlock()
88 return stack; in EmitBlock()
104 Stack<std::string>* stack) { in EmitInstruction()
110 stack->Push(str); in EmitInstruction()
116 Stack<std::string>* stack) { in EmitInstruction()
120 stack in EmitInstruction()
102 EmitInstruction( const PushUninitializedInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
114 EmitInstruction( const PushBuiltinPointerInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
124 EmitInstruction( const NamespaceConstantInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
154 ProcessArgumentsCommon( const TypeVector& parameter_types, std::vector<std::string> constexpr_arguments, Stack<std::string>* stack) ProcessArgumentsCommon() argument
176 EmitInstruction(const CallIntrinsicInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
312 EmitInstruction(const CallCsaMacroInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
363 EmitInstruction( const CallCsaMacroAndBranchInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
485 EmitInstruction(const MakeLazyNodeInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
520 EmitInstruction(const CallBuiltinInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
602 EmitInstruction( const CallBuiltinPointerInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
653 PostCallableExceptionPreparation( const std::string& catch_name, const Type* return_type, base::Optional<Block*> catch_block, Stack<std::string>* stack, const base::Optional<DefinitionLocation>& exception_object_definition) PostCallableExceptionPreparation() argument
694 EmitInstruction(const CallRuntimeInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
750 EmitInstruction(const BranchInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
783 EmitInstruction( const ConstexprBranchInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
812 EmitInstruction(const GotoInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
827 EmitInstruction(const GotoExternalInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
836 EmitInstruction(const ReturnInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
848 EmitInstruction( const PrintConstantStringInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
855 EmitInstruction(const AbortInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
881 EmitInstruction(const UnsafeCastInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
891 EmitInstruction(const LoadReferenceInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
909 EmitInstruction(const StoreReferenceInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
941 EmitInstruction(const LoadBitFieldInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
982 EmitInstruction(const StoreBitFieldInstruction& instruction, Stack<std::string>* stack) EmitInstruction() argument
[all...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/commonattrs/
H A Dcommonattrs_sepia_test.cpp29 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsSepia001()
32 auto ret = nodeAPI->setAttribute(stack, NODE_SEPIA, &valueItem); in TestCommonAttrsSepia001()
34 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SEPIA)->value[PARAM_0].f32, MIN_VALUE); in TestCommonAttrsSepia001()
40 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsSepia002()
44 auto ret = nodeAPI->setAttribute(stack, NODE_SEPIA, &valueItem); in TestCommonAttrsSepia002()
46 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SEPIA)->value[PARAM_0].f32, sepia); in TestCommonAttrsSepia002()
52 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsSepia003()
56 auto ret = nodeAPI->setAttribute(stack, NODE_SEPIA, &valueItem); in TestCommonAttrsSepia003()
58 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SEPIA)->value[PARAM_0].f32, sepia); in TestCommonAttrsSepia003()
64 NAPI_START(stack, ARKUI_NODE_STAC in TestCommonAttrsSepia004()
[all...]
H A Dcommonattrs_invert_test.cpp26 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsInvert001()
29 auto ret = nodeAPI->setAttribute(stack, NODE_INVERT, &valueItem); in TestCommonAttrsInvert001()
31 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_INVERT)->value[PARAM_0].f32, MIN_VALUE); in TestCommonAttrsInvert001()
37 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsInvert002()
41 auto ret = nodeAPI->setAttribute(stack, NODE_INVERT, &valueItem); in TestCommonAttrsInvert002()
43 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_INVERT)->value[PARAM_0].f32, invert); in TestCommonAttrsInvert002()
49 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsInvert003()
53 auto ret = nodeAPI->setAttribute(stack, NODE_INVERT, &valueItem); in TestCommonAttrsInvert003()
55 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_INVERT)->value[PARAM_0].f32, invert); in TestCommonAttrsInvert003()
61 NAPI_START(stack, ARKUI_NODE_STAC in TestCommonAttrsInvert004()
[all...]
H A Dcommonattrs_grayscale_test.cpp27 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsGrayscale001()
28 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_GRAY_SCALE)->value[PARAM_0].f32, DEFAULT_VALUE); in TestCommonAttrsGrayscale001()
34 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsGrayscale002()
38 auto ret = nodeAPI->setAttribute(stack, NODE_GRAY_SCALE, &valueItem); in TestCommonAttrsGrayscale002()
40 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_GRAY_SCALE)->value[PARAM_0].f32, grayScale); in TestCommonAttrsGrayscale002()
46 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsGrayscale003()
50 auto ret = nodeAPI->setAttribute(stack, NODE_GRAY_SCALE, &valueItem); in TestCommonAttrsGrayscale003()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_GRAY_SCALE)->value[PARAM_0].f32, grayScale); in TestCommonAttrsGrayscale003()
58 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsGrayscale004()
61 auto ret = nodeAPI->setAttribute(stack, NODE_GRAY_SCAL in TestCommonAttrsGrayscale004()
[all...]
H A Dcommonattrs_contrast_test.cpp29 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsContrast001()
32 auto ret = nodeAPI->setAttribute(stack, NODE_CONTRAST, &valueItem); in TestCommonAttrsContrast001()
34 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_CONTRAST)->value[PARAM_0].f32, MIN_VALUE); in TestCommonAttrsContrast001()
40 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsContrast002()
41 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_CONTRAST)->value[PARAM_0].f32, DEFAULT_VALUE); in TestCommonAttrsContrast002()
47 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsContrast003()
50 auto ret = nodeAPI->setAttribute(stack, NODE_CONTRAST, &valueItem); in TestCommonAttrsContrast003()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_CONTRAST)->value[PARAM_0].f32, FIRST_MIDDLE_VALUE); in TestCommonAttrsContrast003()
58 NAPI_START(stack, ARKUI_NODE_STACK); in TestCommonAttrsContrast004()
61 auto ret = nodeAPI->setAttribute(stack, NODE_CONTRAS in TestCommonAttrsContrast004()
[all...]
/test/xts/acts/arkui/ace_c_arkui_test/entry/src/main/cpp/stack/
H A Dstack_saturate_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackSaturate001()
26 auto ret = nodeAPI->setAttribute(stack, NODE_SATURATION, &value_item); in TestStackSaturate001()
28 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SATURATION)->value[PARAM_0].f32, saturateValue); in TestStackSaturate001()
34 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackSaturate002()
38 auto ret = nodeAPI->setAttribute(stack, NODE_SATURATION, &value_item); in TestStackSaturate002()
40 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SATURATION)->value[PARAM_0].f32, saturateValue); in TestStackSaturate002()
46 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackSaturate003()
50 auto ret = nodeAPI->setAttribute(stack, NODE_SATURATION, &value_item); in TestStackSaturate003()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SATURATION)->value[PARAM_0].f32, saturateValue); in TestStackSaturate003()
58 NAPI_START(stack, ARKUI_NODE_STAC in TestStackSaturate004()
[all...]
H A Dstack_opacity_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackOpacity001()
26 auto ret = nodeAPI->setAttribute(stack, NODE_OPACITY, &value_item); in TestStackOpacity001()
28 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_OPACITY)->value[PARAM_0].f32, opacity); in TestStackOpacity001()
34 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackOpacity002()
38 auto ret = nodeAPI->setAttribute(stack, NODE_OPACITY, &value_item); in TestStackOpacity002()
40 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_OPACITY)->value[PARAM_0].f32, opacity); in TestStackOpacity002()
46 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackOpacity003()
50 auto ret = nodeAPI->setAttribute(stack, NODE_OPACITY, &value_item); in TestStackOpacity003()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_OPACITY)->value[PARAM_0].f32, opacity); in TestStackOpacity003()
58 NAPI_START(stack, ARKUI_NODE_STAC in TestStackOpacity004()
[all...]
H A Dstack_bordercolor_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBorderColor001()
26 auto ret = nodeAPI->setAttribute(stack, NODE_BORDER_COLOR, &value_item); in TestStackBorderColor001()
28 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BORDER_COLOR)->value[PARAM_0].u32, borderColor); in TestStackBorderColor001()
34 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBorderColor002()
38 auto ret = nodeAPI->setAttribute(stack, NODE_BORDER_COLOR, &value_item); in TestStackBorderColor002()
40 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BORDER_COLOR)->value[PARAM_0].u32, borderColor); in TestStackBorderColor002()
46 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBorderColor003()
50 auto ret = nodeAPI->setAttribute(stack, NODE_BORDER_COLOR, &value_item); in TestStackBorderColor003()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BORDER_COLOR)->value[PARAM_0].u32, borderColor); in TestStackBorderColor003()
58 NAPI_START(stack, ARKUI_NODE_STAC in TestStackBorderColor004()
[all...]
H A Dstack_shadow_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackShadow001()
25 auto ret = nodeAPI->setAttribute(stack, NODE_SHADOW, &shadow_item); in TestStackShadow001()
27 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SHADOW)->value[PARAM_0].i32, ARKUI_SHADOW_STYLE_OUTER_DEFAULT_XS); in TestStackShadow001()
33 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackShadow002()
36 auto ret = nodeAPI->setAttribute(stack, NODE_SHADOW, &shadow_item); in TestStackShadow002()
38 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SHADOW)->value[PARAM_0].i32, ARKUI_SHADOW_STYLE_OUTER_DEFAULT_SM); in TestStackShadow002()
44 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackShadow003()
47 auto ret = nodeAPI->setAttribute(stack, NODE_SHADOW, &shadow_item); in TestStackShadow003()
49 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_SHADOW)->value[PARAM_0].i32, ARKUI_SHADOW_STYLE_OUTER_DEFAULT_MD); in TestStackShadow003()
55 NAPI_START(stack, ARKUI_NODE_STAC in TestStackShadow004()
[all...]
H A Dstack_brightness_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBrightness001()
26 auto ret = nodeAPI->setAttribute(stack, NODE_BRIGHTNESS, &value_item); in TestStackBrightness001()
28 ASSERT_NE(nodeAPI->getAttribute(stack, NODE_BRIGHTNESS)->value[PARAM_0].f32, brightnessValue); in TestStackBrightness001()
34 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBrightness002()
38 auto ret = nodeAPI->setAttribute(stack, NODE_BRIGHTNESS, &value_item); in TestStackBrightness002()
40 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BRIGHTNESS)->value[PARAM_0].f32, brightnessValue); in TestStackBrightness002()
46 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackBrightness003()
50 auto ret = nodeAPI->setAttribute(stack, NODE_BRIGHTNESS, &value_item); in TestStackBrightness003()
52 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_BRIGHTNESS)->value[PARAM_0].f32, brightnessValue); in TestStackBrightness003()
58 NAPI_START(stack, ARKUI_NODE_STAC in TestStackBrightness004()
[all...]
H A Dstack_margin_test.cpp22 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackMargin001()
27 auto ret = nodeAPI->setAttribute(stack, NODE_MARGIN, &margin_item); in TestStackMargin001()
29 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_MARGIN)->value[PARAM_0].f32, margin); in TestStackMargin001()
35 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackMargin002()
40 auto ret = nodeAPI->setAttribute(stack, NODE_MARGIN, &margin_item); in TestStackMargin002()
42 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_MARGIN)->value[PARAM_0].f32, margin); in TestStackMargin002()
48 NAPI_START(stack, ARKUI_NODE_STACK); in TestStackMargin003()
57 auto ret = nodeAPI->setAttribute(stack, NODE_MARGIN, &margin_item); in TestStackMargin003()
59 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_MARGIN)->value[PARAM_0].f32, marginTop); in TestStackMargin003()
60 ASSERT_EQ(nodeAPI->getAttribute(stack, NODE_MARGI in TestStackMargin003()
[all...]
/third_party/jerryscript/jerry-core/parser/js/
H A Djs-parser-mem.c335 /* Parser stack management functions */
341 * Initialize parser stack.
346 parser_data_init (&context_p->stack, PARSER_STACK_PAGE_SIZE); in parser_stack_init()
351 * Free parser stack.
356 parser_data_free (&context_p->stack, in parser_stack_free()
367 * Pushes an uint8_t value onto the stack.
371 uint8_t uint8_value) /**< value pushed onto the stack */ in parser_stack_push_uint8()
373 parser_mem_page_t *page_p = context_p->stack.first_p; in parser_stack_push_uint8()
379 || context_p->stack_top_uint8 == page_p->bytes[context_p->stack.last_position - 1]); in parser_stack_push_uint8()
381 if (context_p->stack in parser_stack_push_uint8()
[all...]
/third_party/elfutils/libdwfl/
H A Dframe_unwind.c39 /* Maximum number of DWARF expression stack slots before returning an error. */
96 do_push (struct eval_stack *stack, Dwarf_Addr val) in do_push() argument
98 if (stack->used >= DWARF_EXPR_STACK_MAX) in do_push()
103 if (stack->used == stack->allocated) in do_push()
105 stack->allocated = MAX (stack->allocated * 2, 32); in do_push()
107 new_addrs = realloc (stack->addrs, in do_push()
108 stack->allocated * sizeof (*stack in do_push()
121 do_pop(struct eval_stack *stack, Dwarf_Addr *val) do_pop() argument
145 struct eval_stack stack = expr_eval() local
[all...]
/third_party/libwebsockets/lib/tls/mbedtls/wrapper/library/
H A Dssl_stack.c28 * @brief create a openssl stack object
32 OPENSSL_STACK *stack; in OPENSSL_sk_new() local
35 stack = ssl_mem_zalloc(sizeof(OPENSSL_STACK)); in OPENSSL_sk_new()
36 if (!stack) { in OPENSSL_sk_new()
37 SSL_DEBUG(SSL_STACK_ERROR_LEVEL, "no enough memory > (stack)"); in OPENSSL_sk_new()
47 stack->data = data; in OPENSSL_sk_new()
48 stack->num_alloc = MIN_NODES; in OPENSSL_sk_new()
49 stack->c = c; in OPENSSL_sk_new()
51 return stack; in OPENSSL_sk_new()
54 ssl_mem_free(stack); in OPENSSL_sk_new()
70 OPENSSL_sk_free(OPENSSL_STACK *stack) OPENSSL_sk_free() argument
[all...]
/kernel/linux/linux-6.6/drivers/misc/altera-stapl/
H A Daltera.c119 /* This function checks if enough parameters are available on the stack. */
213 long *stack = astate->stack; in altera_execute() local
528 stack[stack_ptr] = stack[stack_ptr - 1]; in altera_execute()
534 swap(stack[stack_ptr - 2], stack[stack_ptr - 1]); in altera_execute()
539 stack[stack_ptr - 1] += stack[stack_ptr]; in altera_execute()
545 stack[stack_pt in altera_execute()
569 stack[stack_ptr - 1] <<= stack[stack_ptr]; altera_execute() local
575 stack[stack_ptr - 1] >>= stack[stack_ptr]; altera_execute() local
[all...]
/kernel/linux/linux-5.10/arch/x86/kernel/
H A Ddumpstack_32.c38 static bool in_hardirq_stack(unsigned long *stack, struct stack_info *info) in in_hardirq_stack() argument
44 * This is a software stack, so 'end' can be a valid stack pointer. in in_hardirq_stack()
45 * It just means the stack is empty. in in_hardirq_stack()
47 if (stack < begin || stack > end) in in_hardirq_stack()
55 * See irq_32.c -- the next stack pointer is stored at the beginning of in in_hardirq_stack()
56 * the stack. in in_hardirq_stack()
63 static bool in_softirq_stack(unsigned long *stack, struct stack_info *info) in in_softirq_stack() argument
69 * This is a software stack, s in in_softirq_stack()
88 in_doublefault_stack(unsigned long *stack, struct stack_info *info) in_doublefault_stack() argument
108 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_32.c38 static bool in_hardirq_stack(unsigned long *stack, struct stack_info *info) in in_hardirq_stack() argument
44 * This is a software stack, so 'end' can be a valid stack pointer. in in_hardirq_stack()
45 * It just means the stack is empty. in in_hardirq_stack()
47 if (stack < begin || stack > end) in in_hardirq_stack()
55 * See irq_32.c -- the next stack pointer is stored at the beginning of in in_hardirq_stack()
56 * the stack. in in_hardirq_stack()
63 static bool in_softirq_stack(unsigned long *stack, struct stack_info *info) in in_softirq_stack() argument
69 * This is a software stack, s in in_softirq_stack()
88 in_doublefault_stack(unsigned long *stack, struct stack_info *info) in_doublefault_stack() argument
108 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/tools/testing/selftests/bpf/progs/
H A Dtest_global_func_ctx_args.c11 static long stack[256]; variable
19 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in kprobe_typedef_ctx_subprog()
33 return bpf_get_stack((void *)ctx, &stack, sizeof(stack), 0); in kprobe_struct_ctx_subprog()
48 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in kprobe_workaround_ctx_subprog()
64 return bpf_get_stack(ctx, &stack, sizeof(stack), 0); in raw_tp_ctx_subprog()
80 return bpf_get_stack(ctx, &stack, sizeo in raw_tp_writable_ctx_subprog()
[all...]
/third_party/vulkan-loader/tests/framework/
H A Djson_writer.h30 #include <stack>
40 std::stack<bool> stack; member
46 stack.push(false); in StartObject()
52 stack.push(false); in StartKeyedObject()
55 stack.pop(); in EndObject()
64 stack.push(false); in StartKeyedArray()
70 stack.push(false); in StartArray()
73 stack.pop(); in EndArray()
103 if (stack in CommaAndNewLine()
[all...]
/third_party/musl/porting/liteos_m/kernel/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/musl/porting/liteos_m_iccarm/kernel/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
966 tre_stack_t *stack = ctx->stack; tre_parse() local
1204 tre_add_tags(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree, tre_tnfa_t *tnfa) tre_add_tags() argument
1688 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
1836 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
2135 tre_match_empty(tre_stack_t *stack, tre_ast_node_t *node, int *tags, int *assertions, int *num_tags_seen) tre_match_empty() argument
2245 tre_compute_nfl(tre_mem_t mem, tre_stack_t *stack, tre_ast_node_t *tree) tre_compute_nfl() argument
2694 tre_stack_t *stack; regcomp() local
[all...]
/third_party/musl/porting/uniproton/kernel/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...]

Completed in 17 milliseconds

12345678910>>...124