Searched refs:stack (Results 1 – 9 of 9) sorted by relevance
/scripts/kconfig/ |
D | symbol.c | 996 static void dep_stack_insert(struct dep_stack *stack, struct symbol *sym) in dep_stack_insert() argument 998 memset(stack, 0, sizeof(*stack)); in dep_stack_insert() 1000 check_top->next = stack; in dep_stack_insert() 1001 stack->prev = check_top; in dep_stack_insert() 1002 stack->sym = sym; in dep_stack_insert() 1003 check_top = stack; in dep_stack_insert() 1020 struct dep_stack *stack; in sym_check_print_recursive() local 1031 for (stack = check_top; stack != NULL; stack = stack->prev) in sym_check_print_recursive() 1032 if (stack->sym == last_sym) in sym_check_print_recursive() 1034 if (!stack) { in sym_check_print_recursive() [all …]
|
D | zconf.tab.c_shipped | 320 /* The OS might guarantee only one guard page at the bottom of the stack, 323 to allow for a few compiler-allocated temporary stack slots. */ 362 /* A type that is properly aligned for any stack member. */ 369 /* The size of the maximum gap between one aligned stack and the next. */ 398 elements in the stack, and YYPTR gives the new location of the 399 stack. Advance YYPTR to a properly aligned location for the next 400 stack. */ 975 | yy_stack_print -- Print the state stack from its BOTTOM up to its | 1024 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", 1060 if the built-in stack extension method is used). [all …]
|
D | zconf.lex.c_shipped | 271 static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ 272 static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ 279 * Returns the top of the stack, or NULL. 285 /* Same as previous macro, but useful when we know that the buffer stack is not 954 /* Number of entries by which start-condition stack grows. */ 1912 /** Pushes the new state onto the stack. The new state becomes 1913 * the current state. This function will allocate the stack 1944 /** Removes and deletes the top of the stack, if present. 1964 /* Allocates the stack if it does not exist. 1974 * scanner will even need a stack. We use 2 instead of 1 to avoid an [all …]
|
/scripts/ |
D | checkstack.pl | 37 my (@stack, $re, $dre, $x, $xs); 150 push @stack, "$intro$size\n"; 166 push @stack, "$intro$size\n"; 171 print sort { ($b =~ /:\t*(\d+)$/)[0] <=> ($a =~ /:\t*(\d+)$/)[0] } @stack;
|
D | checkpatch.pl | 657 my @stack = (); 664 @stack = (['', 0]) if ($#stack == -1); 698 push(@stack, [ $type, $level ]); 700 ($type, $level) = @{$stack[$#stack - 1]}; 702 ($type, $level) = @{pop(@stack)}; 861 my @stack = ($level); 870 push(@stack, $level); 872 $level = $stack[$#stack - 1]; 874 $level = pop(@stack);
|
/scripts/dtc/ |
D | dtc-parser.tab.c_shipped | 277 /* The OS might guarantee only one guard page at the bottom of the stack, 280 to allow for a few compiler-allocated temporary stack slots. */ 319 /* A type that is properly aligned for any stack member. */ 326 /* The size of the maximum gap between one aligned stack and the next. */ 355 elements in the stack, and YYPTR gives the new location of the 356 stack. Advance YYPTR to a properly aligned location for the next 357 stack. */ 771 | yy_stack_print -- Print the state stack from its BOTTOM up to its | 820 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", 856 if the built-in stack extension method is used). [all …]
|
D | dtc-lexer.lex.c_shipped | 252 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 728 /* Number of entries by which start-condition stack grows. */ 1566 /** Pushes the new state onto the stack. The new state becomes 1567 * the current state. This function will allocate the stack 1598 /** Removes and deletes the top of the stack, if present. 1618 /* Allocates the stack if it does not exist. 1628 * scanner will even need a stack. We use 2 instead of 1 to avoid an [all …]
|
/scripts/genksyms/ |
D | parse.tab.c_shipped | 319 /* The OS might guarantee only one guard page at the bottom of the stack, 322 to allow for a few compiler-allocated temporary stack slots. */ 361 /* A type that is properly aligned for any stack member. */ 368 /* The size of the maximum gap between one aligned stack and the next. */ 381 elements in the stack, and YYPTR gives the new location of the 382 stack. Advance YYPTR to a properly aligned location for the next 383 stack. */ 1040 | yy_stack_print -- Print the state stack from its BOTTOM up to its | 1089 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n", 1125 if the built-in stack extension method is used). [all …]
|
D | lex.lex.c_shipped | 252 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 …]
|