Home
last modified time | relevance | path

Searched refs:stack (Results 1 - 25 of 959) sorted by relevance

12345678910>>...39

/third_party/selinux/libsepol/cil/src/
H A Dcil_stack.c40 void cil_stack_init(struct cil_stack **stack) in cil_stack_init() argument
43 new_stack->stack = cil_malloc(sizeof(*(new_stack->stack)) * CIL_STACK_INIT_SIZE); in cil_stack_init()
46 *stack = new_stack; in cil_stack_init()
49 void cil_stack_destroy(struct cil_stack **stack) in cil_stack_destroy() argument
51 if (stack == NULL || *stack == NULL) { in cil_stack_destroy()
55 free((*stack)->stack); in cil_stack_destroy()
56 free(*stack); in cil_stack_destroy()
60 cil_stack_empty(struct cil_stack *stack) cil_stack_empty() argument
65 cil_stack_is_empty(struct cil_stack *stack) cil_stack_is_empty() argument
70 cil_stack_number_of_items(struct cil_stack *stack) cil_stack_number_of_items() argument
75 cil_stack_push(struct cil_stack *stack, enum cil_flavor flavor, void *data) cil_stack_push() argument
88 cil_stack_pop(struct cil_stack *stack) cil_stack_pop() argument
98 cil_stack_peek(struct cil_stack *stack) cil_stack_peek() argument
107 cil_stack_peek_at(struct cil_stack *stack, int pos) cil_stack_peek_at() argument
[all...]
H A Dcil_stack.h34 struct cil_stack_item *stack; member
44 #define cil_stack_for_each_starting_at(stack, start, pos, item) \
45 for (pos = start, item = cil_stack_peek_at(stack, pos); item != NULL; pos++, item = cil_stack_peek_at(stack, pos))
47 #define cil_stack_for_each(stack, pos, item) cil_stack_for_each_starting_at(stack, 0, pos, item)
50 void cil_stack_init(struct cil_stack **stack);
51 void cil_stack_destroy(struct cil_stack **stack);
53 void cil_stack_empty(struct cil_stack *stack);
54 int cil_stack_is_empty(struct cil_stack *stack);
[all...]
/third_party/skia/third_party/externals/freetype/src/psaux/
H A Dpsstack.c5 * Adobe's code for emulating a CFF stack (body).
58 CF2_Stack stack = NULL; in FT_LOCAL_DEF() local
61 if ( FT_QNEW( stack ) ) in FT_LOCAL_DEF()
64 stack->memory = memory; in FT_LOCAL_DEF()
65 stack->error = e; in FT_LOCAL_DEF()
67 /* allocate the stack buffer */ in FT_LOCAL_DEF()
68 if ( FT_QNEW_ARRAY( stack->buffer, stackSize ) ) in FT_LOCAL_DEF()
70 FT_FREE( stack ); in FT_LOCAL_DEF()
74 stack->stackSize = stackSize; in FT_LOCAL_DEF()
75 stack in FT_LOCAL_DEF()
105 cf2_stack_pushInt( CF2_Stack stack, CF2_Int val ) cf2_stack_pushInt() argument
121 cf2_stack_pushFixed( CF2_Stack stack, CF2_Fixed val ) cf2_stack_pushFixed() argument
210 cf2_stack_setReal( CF2_Stack stack, CF2_UInt idx, CF2_Fixed val ) cf2_stack_setReal() argument
227 cf2_stack_pop( CF2_Stack stack, CF2_UInt num ) cf2_stack_pop() argument
240 cf2_stack_roll( CF2_Stack stack, CF2_Int count, CF2_Int shift ) cf2_stack_roll() argument
[all...]
/third_party/skia/tests/
H A DClipStackTest.cpp40 // Build up a clip stack with a path, an empty clip, and a rect. in test_assign_and_comparison()
131 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
133 SkClipStack::B2TIter iter(stack); in assert_count()
144 SkClipStack stack; in test_iterators() local
155 stack.clipRect(gRects[i], SkMatrix::I(), SkClipOp::kDifference, false); in test_iterators()
158 assert_count(reporter, stack, 4); in test_iterators()
164 SkClipStack::B2TIter iter(stack); in test_iterators()
180 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
196 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
246 SkClipStack stack; in test_bounds() local
479 SkClipStack stack; global() local
489 SkClipStack stack; global() local
513 SkClipStack stack; test_rect_merging() local
526 SkClipStack stack; test_rect_merging() local
539 SkClipStack stack; test_rect_merging() local
552 SkClipStack stack; test_rect_merging() local
565 SkClipStack stack; test_rect_merging() local
578 SkClipStack stack; test_rect_merging() local
607 SkClipStack stack; test_quickContains() local
615 SkClipStack stack; test_quickContains() local
621 SkClipStack stack; test_quickContains() local
630 SkClipStack stack; test_quickContains() local
640 SkClipStack stack; test_quickContains() local
649 SkClipStack stack; test_quickContains() local
655 SkClipStack stack; test_quickContains() local
661 SkClipStack stack; test_quickContains() local
667 SkClipStack stack; test_quickContains() local
674 SkClipStack stack; test_quickContains() local
680 SkClipStack stack; test_quickContains() local
686 SkClipStack stack; test_quickContains() local
692 SkClipStack stack; test_quickContains() local
699 SkClipStack stack; test_quickContains() local
708 SkClipStack stack; test_quickContains() local
717 SkClipStack stack; test_quickContains() local
726 SkClipStack stack; test_quickContains() local
736 SkClipStack stack; test_quickContains() local
744 SkClipStack stack; test_quickContains() local
752 SkClipStack stack; test_quickContains() local
760 SkClipStack stack; test_quickContains() local
768 set_region_to_stack(const SkClipStack& stack, const SkIRect& bounds, SkRegion* region) set_region_to_stack() argument
792 SkClipStack stack; test_invfill_diff_bug() local
821 SkClipStack stack; test_is_rrect_deep_rect_stack() local
839 SkClipStack stack; test_is_rrect_deep_rect_stack() local
853 SkClipStack stack; DEF_TEST() local
[all...]
/third_party/backends/testsuite/backend/genesys/
H A Dtests_image_pipeline.cpp192 ImagePipelineStack stack; in test_node_buffered_callable_source() local
193 stack.push_first_node<ImagePipelineNodeBufferedCallableSource>(4, 3, PixelFormat::I8, in test_node_buffered_callable_source()
201 ASSERT_TRUE(stack.get_next_row_data(out_data.data())); in test_node_buffered_callable_source()
205 ASSERT_TRUE(stack.get_next_row_data(out_data.data())); in test_node_buffered_callable_source()
209 ASSERT_TRUE(stack.get_next_row_data(out_data.data())); in test_node_buffered_callable_source()
224 ImagePipelineStack stack; in test_node_format_convert() local
225 stack.push_first_node<ImagePipelineNodeArraySource>(3, 1, PixelFormat::RGB888, in test_node_format_convert()
227 stack.push_node<ImagePipelineNodeFormatConvert>(PixelFormat::BGR161616); in test_node_format_convert()
229 ASSERT_EQ(stack.get_output_width(), 3u); in test_node_format_convert()
230 ASSERT_EQ(stack in test_node_format_convert()
260 ImagePipelineStack stack; test_node_desegment_1_line() local
288 ImagePipelineStack stack; test_node_deinterleave_lines_i8() local
316 ImagePipelineStack stack; test_node_deinterleave_lines_rgb888() local
346 ImagePipelineStack stack; test_node_swap_16bit_endian() local
384 ImagePipelineStack stack; test_node_invert_16_bits() local
420 ImagePipelineStack stack; test_node_invert_8_bits() local
451 ImagePipelineStack stack; test_node_invert_1_bits() local
481 ImagePipelineStack stack; test_node_merge_mono_lines_to_color() local
514 ImagePipelineStack stack; test_node_merge_color_to_gray() local
545 ImagePipelineStack stack; test_node_split_mono_lines() local
577 ImagePipelineStack stack; test_node_component_shift_lines() local
608 ImagePipelineStack stack; test_node_pixel_shift_lines_2lines() local
644 ImagePipelineStack stack; test_node_pixel_shift_lines_4lines() local
761 ImagePipelineStack stack; test_node_pixel_shift_columns_no_switch() local
784 ImagePipelineStack stack; test_node_pixel_shift_columns_group_switch_pixel_multiple() local
811 ImagePipelineStack stack; test_node_pixel_shift_columns_group_switch_pixel_not_multiple() local
838 ImagePipelineStack stack; test_node_pixel_shift_columns_group_switch_pixel_large_offsets_multiple() local
865 ImagePipelineStack stack; test_node_pixel_shift_columns_group_switch_pixel_large_offsets_not_multiple() local
899 ImagePipelineStack stack; test_node_calibrate_8bit() local
935 ImagePipelineStack stack; test_node_calibrate_16bit() local
[all...]
/third_party/pcre2/pcre2/src/sljit/
H A DsljitUtils.c177 struct sljit_stack *stack; in sljit_allocate_stack() local
185 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); in sljit_allocate_stack()
186 if (stack == NULL) in sljit_allocate_stack()
191 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
195 stack->min_start = (sljit_u8 *)ptr; in sljit_allocate_stack()
196 stack->end = stack->min_start + max_size; in sljit_allocate_stack()
197 stack->start = stack->end - start_size; in sljit_allocate_stack()
198 stack in sljit_allocate_stack()
202 sljit_free_stack(struct sljit_stack *stack, void *allocator_data) sljit_free_stack() argument
209 sljit_stack_resize(struct sljit_stack *stack, sljit_u8 *new_start) sljit_stack_resize() argument
221 sljit_free_stack(struct sljit_stack *stack, void *allocator_data) sljit_free_stack() argument
230 sljit_free_stack(struct sljit_stack *stack, void *allocator_data) sljit_free_stack() argument
241 struct sljit_stack *stack; sljit_allocate_stack() local
296 sljit_stack_resize(struct sljit_stack *stack, sljit_u8 *new_start) sljit_stack_resize() argument
[all...]
/third_party/mesa3d/src/mesa/main/
H A Dmatrix.c103 static void matrix_frustum(struct gl_matrix_stack* stack, in matrix_frustum() argument
121 _math_matrix_frustum(stack->Top, in matrix_frustum()
125 ctx->NewState |= stack->DirtyFlag; in matrix_frustum()
142 * the top matrix of the current matrix stack and sets
166 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, in _mesa_MatrixFrustumEXT() local
168 if (!stack) in _mesa_MatrixFrustumEXT()
171 matrix_frustum(stack, in _mesa_MatrixFrustumEXT()
180 matrix_ortho(struct gl_matrix_stack* stack, in matrix_ortho() argument
202 _math_matrix_ortho( stack->Top, in matrix_ortho()
206 ctx->NewState |= stack in matrix_ortho()
247 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, _mesa_MatrixOrthoEXT() local
274 struct gl_matrix_stack * stack; _mesa_MatrixMode() local
295 push_matrix(struct gl_context *ctx, struct gl_matrix_stack *stack, GLenum matrixMode, const char *func) push_matrix() argument
347 struct gl_matrix_stack *stack = ctx->CurrentStack; _mesa_PushMatrix() local
361 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, _mesa_MatrixPushEXT() local
404 struct gl_matrix_stack *stack = ctx->CurrentStack; _mesa_PopMatrix() local
428 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, _mesa_MatrixPopEXT() local
448 _mesa_load_identity_matrix(struct gl_context *ctx, struct gl_matrix_stack *stack) _mesa_load_identity_matrix() argument
481 struct gl_matrix_stack *stack; _mesa_MatrixLoadIdentityEXT() local
492 _mesa_load_matrix(struct gl_context *ctx, struct gl_matrix_stack *stack, const GLfloat *m) _mesa_load_matrix() argument
504 matrix_load(struct gl_context *ctx, struct gl_matrix_stack *stack, const GLfloat *m, const char* caller) matrix_load() argument
552 struct gl_matrix_stack * stack = _mesa_MatrixLoadfEXT() local
562 matrix_mult(struct gl_matrix_stack *stack, const GLfloat *m, const char* caller) matrix_mult() argument
609 struct gl_matrix_stack * stack = _mesa_MatrixMultfEXT() local
619 matrix_rotate(struct gl_matrix_stack *stack, GLfloat angle, GLfloat x, GLfloat y, GLfloat z, const char* caller) matrix_rotate() argument
658 struct gl_matrix_stack *stack = _mesa_MatrixRotatefEXT() local
694 struct gl_matrix_stack *stack; _mesa_MatrixScalefEXT() local
735 struct gl_matrix_stack *stack = _mesa_MatrixTranslatefEXT() local
992 init_matrix_stack(struct gl_matrix_stack *stack, GLuint maxDepth, GLuint dirtyFlag) init_matrix_stack() argument
[all...]
/third_party/musl/src/misc/
H A Drealpath.c16 char stack[PATH_MAX+1]; in realpath() local
25 l = strnlen(filename, sizeof stack); in realpath()
31 p = sizeof stack - l - 1; in realpath()
33 memcpy(stack+p, filename, l+1); in realpath()
35 /* Main loop. Each iteration pops the next part from stack of in realpath()
38 * pushed to the stack. */ in realpath()
40 for (; ; p+=slash_len(stack+p)) { in realpath()
41 /* If stack starts with /, the whole component is / or // in realpath()
43 if (stack[p] == '/') { in realpath()
50 if (stack[ in realpath()
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sfn/
H A Dsfn_callstack.cpp45 ++m_bc.stack.push; in push()
48 ++m_bc.stack.push_wqm; in push()
51 ++m_bc.stack.loop; in push()
64 --m_bc.stack.push; in pop()
65 assert(m_bc.stack.push >= 0); in pop()
68 --m_bc.stack.push_wqm; in pop()
69 assert(m_bc.stack.push_wqm >= 0); in pop()
72 --m_bc.stack.loop; in pop()
73 assert(m_bc.stack.loop >= 0); in pop()
84 r600_stack_info& stack in update_max_depth() local
[all...]
/third_party/pulseaudio/speex/libspeexdsp/
H A Dstack_alloc.h4 @brief Temporary memory allocation on stack
51 * @def ALIGN(stack, size)
53 * Aligns the stack to a 'size' boundary
55 * @param stack Stack
60 * @def PUSH(stack, size, type)
62 * Allocates 'size' elements of type 'type' on the stack
64 * @param stack Stack
72 * Declare variable on stack
80 * Allocate 'size' elements of 'type' on stack
91 #define ALIGN(stack, siz
[all...]
/third_party/node/deps/v8/src/torque/
H A Dinstructions.cc37 void PeekInstruction::TypeInstruction(Stack<const Type*>* stack, in TypeInstruction() argument
39 const Type* type = stack->Peek(slot); in TypeInstruction()
48 stack->Push(type); in TypeInstruction()
56 void PokeInstruction::TypeInstruction(Stack<const Type*>* stack, in TypeInstruction() argument
58 const Type* type = stack->Top(); in TypeInstruction()
63 stack->Poke(slot, type); in TypeInstruction()
64 stack->Pop(); in TypeInstruction()
72 void DeleteRangeInstruction::TypeInstruction(Stack<const Type*>* stack, in TypeInstruction() argument
74 stack->DeleteRange(range); in TypeInstruction()
83 Stack<const Type*>* stack, ControlFlowGrap in TypeInstruction()
82 TypeInstruction( Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
96 TypeInstruction( Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
110 TypeInstruction( Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
152 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
207 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
279 TypeInstruction( Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
419 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
470 TypeInstruction( Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
516 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
589 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
612 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
631 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
645 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
655 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
665 TypeInstruction( Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
671 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
677 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
691 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
712 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
728 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
744 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
762 TypeInstruction(Stack<const Type*>* stack, ControlFlowGraph* cfg) const TypeInstruction() argument
[all...]
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...]
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...]
/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...]
/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...]
/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/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/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/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...]

Completed in 19 milliseconds

12345678910>>...39