Lines Matching refs:stack
2 * Stack-less Just-In-Time compiler
32 Stack-Less JIT compiler for multiple architectures (x86, ARM, PowerPC)
50 - A fixed stack space can be allocated for local variables
58 not stored on the stack. (hence the name comes)
61 - One of the saved registers typically points to a stack interface
139 four will be saved on the stack, because they are defined as saved
147 the stack and restore them after a function call.
169 are allocated on the stack). These registers are called virtual
189 are allocated on the stack). These registers are called virtual
207 /* The SLJIT_SP provides direct access to the linear stack space allocated by
209 The immediate offset is extended by the relative stack offset automatically.
322 /* Local stack size. */
478 all machine registers and stack handling among other things. The
495 way. The sljit_emit_enter is also capable of allocating a stack
500 the function returns. The stack space is not initialized.
525 /* The machine code has a context (which contains the local stack space size,
549 even the stack frame is passed to the callee. The return address is preserved in
555 and setting up a new stack frame would cost too much performance. However, it is still
1131 Note: stack growing should not happen in small steps: 4k, 16k or even
1148 Note: limit and max_limit contains the size for stack allocation.
1152 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_free_stack(struct sljit_stack *stack, void *allocator_data);
1156 max_limit, it will fail. It is very easy to implement a stack data structure,
1158 will do all the necessary checks. The fields of the stack are not changed if
1160 SLJIT_API_FUNC_ATTRIBUTE sljit_sw SLJIT_CALL sljit_stack_resize(struct sljit_stack *stack, sljit_uw new_limit);
