| /busybox-1.35.0/miscutils/ |
| D | dc.c | 26 double stack[1]; member
28 enum { STACK_SIZE = (COMMON_BUFSIZE - offsetof(struct globals, stack)) / sizeof(double) };
32 #define stack (G.stack ) macro
50 stack[pointer++] = a; in push()
57 return stack[p]; in pop()
185 print_base(stack[--i]); in print_stack_no_pop()
190 print_base(stack[check_under()]); in print_no_pop()
|
| D | bc.c | 5618 BcVec stack; in zxc_num_printNum() local
5631 bc_vec_init(&stack, sizeof(long), NULL); in zxc_num_printNum()
5650 bc_vec_push(&stack, &dig); in zxc_num_printNum()
5653 for (i = 0; i < stack.len; ++i) { in zxc_num_printNum()
5654 ptr = bc_vec_item_rev(&stack, i); in zxc_num_printNum()
5677 bc_vec_free(&stack); in zxc_num_printNum()
|
| /busybox-1.35.0/scripts/ |
| D | checkstack.pl | 41 my (@stack, $re, $dre, $x, $xs, $funcre);
156 push @stack, "$intro$size\n";
173 push @stack, "$intro$size\n";
185 print sort { ($b =~ /:\t*(\d+)$/)[0] <=> ($a =~ /:\t*(\d+)$/)[0] } @stack;
|
| /busybox-1.35.0/arch/i386/ |
| D | Makefile | 12 CFLAGS += $(call cc-option,-mpreferred-stack-boundary=2,)
|
| /busybox-1.35.0/docs/ |
| D | smallint.txt | 14 You save nothing on space here because i is not stored on-stack,
16 it is *stack* storage, which is cheap (unlike data/bss).
36 they are pushed on-stack or stored in registers, bytes here are *harder*
|
| D | style-guide.txt | 495 declared on the stack in the *_main() function and made available globally by
506 char *buffer[BUFSIZ]; /* declared locally, on stack */
512 very limited stack space (e.g., uCLinux).
515 between xmalloc() and stack creation, so you can code the line in question as
|
| D | keep_data_small.txt | 107 to use stack:
|
| /busybox-1.35.0/shell/ |
| D | math.c | 594 operator *const stack = alloca(expr_len * sizeof(stack[0])); in evaluate_string() local
595 operator *stackptr = stack; in evaluate_string()
761 while (stackptr != stack) { in evaluate_string()
|
| D | ash.c | 11034 pgetc_top(struct synstack *stack) in pgetc_top() argument
11036 return stack->syntax == SQSYNTAX ? pgetc() : pgetc_eatbnl(); in pgetc_top()
11040 synstack_push(struct synstack **stack, struct synstack *next, int syntax) in synstack_push() argument
11044 next->next = *stack; in synstack_push()
11045 (*stack)->prev = next; in synstack_push()
11046 *stack = next; in synstack_push()
11050 synstack_pop(struct synstack **stack) in synstack_pop() argument
11052 *stack = (*stack)->next; in synstack_pop()
|
| D | hush.c | 758 struct parse_context *stack; member
4033 ctx->stack = old; in reserved_word()
4055 debug_printf_parse("pop stack %p\n", ctx->stack); in reserved_word()
4056 old = ctx->stack; in reserved_word()
6000 IF_HAS_KEYWORDS(p2 = pctx->stack;) in parse_stream()
|
| /busybox-1.35.0/scripts/kconfig/ |
| D | zconf.tab.c_shipped | 254 /* A type that is properly aligned for any stack member. */
261 /* The size of the maximum gap between one aligned stack and the next. */
290 elements in the stack, and YYPTR gives the new location of the
291 stack. Advance YYPTR to a properly aligned location for the next
292 stack. */
799 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
841 YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
872 if the built-in stack extension method is used).
1106 /* The state stack. */
1111 /* The semantic value stack. */
[all …]
|
| D | lex.zconf.c_shipped | 244 static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
245 static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
252 * Returns the top of the stack, or NULL.
258 /* Same as previous macro, but useful when we know that the buffer stack is not
904 /* Number of entries by which start-condition stack grows. */
1849 /** Pushes the new state onto the stack. The new state becomes
1850 * the current state. This function will allocate the stack
1881 /** Removes and deletes the top of the stack, if present.
1901 /* Allocates the stack if it does not exist.
1911 * scanner will even need a stack. We use 2 instead of 1 to avoid an
[all …]
|
| /busybox-1.35.0/libbb/ |
| D | Config.src | 16 - Put them on stack. For some very small machines with limited stack
110 Buffers which are 4 kb or less will be allocated on stack.
112 stack buffer if mmap fails.
144 Line editing code uses on-stack buffers for storage.
146 benefits from smaller stack usage.
|
| D | procps.c | 257 total->stack += currec.smap_size; in procps_read_smaps()
|
| /busybox-1.35.0/procps/ |
| D | top.c | 766 mem_t stack ; member
862 ulltoa6_and_space(s->stack , &line_buf[7*6]);
1232 topmem[n].stack = p->smaps.stack;
|
| /busybox-1.35.0/shell/ash_test/ash-arith/ |
| D | arith.tests | 187 # test pushing and popping the expression stack
|
| /busybox-1.35.0/shell/hush_test/hush-arith/ |
| D | arith.tests | 191 # test pushing and popping the expression stack
|
| /busybox-1.35.0/ |
| D | TODO | 161 allocation on the stack or the heap. Unfortunately, we're not using it much.
167 optimized out by the compiler in the stack allocation case (since there's no
|
| D | Config.in | 525 bool "Use -mpreferred-stack-boundary=2 on i386 arch"
530 ensuring stack alignment).
|
| /busybox-1.35.0/include/ |
| D | libbb.h | 2006 unsigned long stack; member
|