Home
last modified time | relevance | path

Searched refs:stack (Results 1 – 11 of 11) sorted by relevance

/scripts/kconfig/
Dsymbol.c1092 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym) in dep_stack_insert() argument
1094 memset(stack, 0, sizeof(*stack)); in dep_stack_insert()
1096 check_top->next = stack; in dep_stack_insert()
1097 stack->prev = check_top; in dep_stack_insert()
1098 stack->sym = sym; in dep_stack_insert()
1099 check_top = stack; in dep_stack_insert()
1116 struct dep_stack *stack; in sym_check_print_recursive() local
1127 for (stack = check_top; stack != NULL; stack = stack->prev) in sym_check_print_recursive()
1128 if (stack->sym == last_sym) in sym_check_print_recursive()
1130 if (!stack) { in sym_check_print_recursive()
[all …]
Dzconf.tab.c_shipped358 /* The OS might guarantee only one guard page at the bottom of the stack,
361 to allow for a few compiler-allocated temporary stack slots. */
398 /* A type that is properly aligned for any stack member. */
405 /* The size of the maximum gap between one aligned stack and the next. */
418 elements in the stack, and YYPTR gives the new location of the
419 stack. Advance YYPTR to a properly aligned location for the next
420 stack. */
894 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
927 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
964 if the built-in stack extension method is used).
[all …]
Dzconf.lex.c_shipped280 static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
281 static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
288 * Returns the top of the stack, or NULL.
294 /* Same as previous macro, but useful when we know that the buffer stack is not
991 /* Number of entries by which start-condition stack grows. */
1965 /** Pushes the new state onto the stack. The new state becomes
1966 * the current state. This function will allocate the stack
1997 /** Removes and deletes the top of the stack, if present.
2017 /* Allocates the stack if it does not exist.
2027 * scanner will even need a stack. We use 2 instead of 1 to avoid an
[all …]
/scripts/
Dcheckstack.pl37 my (@stack, $re, $dre, $x, $xs, $funcre);
157 push @stack, "$intro$size\n";
173 push @stack, "$intro$size\n";
178 print sort { ($b =~ /:\t*(\d+)$/)[0] <=> ($a =~ /:\t*(\d+)$/)[0] } @stack;
DMakefile.kasan15 --param asan-stack=1 --param asan-globals=1 \
Dcheckpatch.pl1283 my @stack = ();
1290 @stack = (['', 0]) if ($#stack == -1);
1324 push(@stack, [ $type, $level ]);
1326 ($type, $level) = @{$stack[$#stack - 1]};
1328 ($type, $level) = @{pop(@stack)};
1487 my @stack = ($level);
1496 push(@stack, $level);
1498 $level = $stack[$#stack - 1];
1500 $level = pop(@stack);
DMakefile.build331 include/config/stack/validation.h)
/scripts/genksyms/
Dparse.tab.c_shipped342 /* The OS might guarantee only one guard page at the bottom of the stack,
345 to allow for a few compiler-allocated temporary stack slots. */
384 /* A type that is properly aligned for any stack member. */
391 /* The size of the maximum gap between one aligned stack and the next. */
404 elements in the stack, and YYPTR gives the new location of the
405 stack. Advance YYPTR to a properly aligned location for the next
406 stack. */
1036 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
1085 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
1121 if the built-in stack extension method is used).
[all …]
Dlex.lex.c_shipped252 static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
253 static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
260 * Returns the top of the stack, or NULL.
266 /* Same as previous macro, but useful when we know that the buffer stack is not
710 /* Number of entries by which start-condition stack grows. */
1517 /** Pushes the new state onto the stack. The new state becomes
1518 * the current state. This function will allocate the stack
1549 /** Removes and deletes the top of the stack, if present.
1569 /* Allocates the stack if it does not exist.
1579 * scanner will even need a stack. We use 2 instead of 1 to avoid an
[all …]
/scripts/dtc/
Ddtc-parser.tab.c_shipped343 /* The OS might guarantee only one guard page at the bottom of the stack,
346 to allow for a few compiler-allocated temporary stack slots. */
384 /* A type that is properly aligned for any stack member. */
392 /* The size of the maximum gap between one aligned stack and the next. */
405 elements in the stack, and YYPTR gives the new location of the
406 stack. Advance YYPTR to a properly aligned location for the next
407 stack. */
875 | yy_stack_print -- Print the state stack from its BOTTOM up to its |
908 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
945 if the built-in stack extension method is used).
[all …]
Ddtc-lexer.lex.c_shipped251 static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
252 static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
259 * Returns the top of the stack, or NULL.
265 /* Same as previous macro, but useful when we know that the buffer stack is not
805 /* Number of entries by which start-condition stack grows. */
1830 /** Pushes the new state onto the stack. The new state becomes
1831 * the current state. This function will allocate the stack
1862 /** Removes and deletes the top of the stack, if present.
1882 /* Allocates the stack if it does not exist.
1892 * scanner will even need a stack. We use 2 instead of 1 to avoid an
[all …]