Lines Matching defs:stack
21 * rewrite arith.y to micro stack based cryptic algorithm by
958 struct strpush *prev; /* preceding string on stack */
968 struct parsefile *prev; /* preceding file on stack */
1147 * Parse trees for commands are allocated in lifo order, so we use a stack
1201 * Like strdup but works with the ash stack.
1243 * stack and only adjust the stack pointer when it knows how big the
1244 * string is. Stackblock (defined in stack.h) returns a pointer to a block
1245 * of space on top of the stack and stackblocklen returns the length of
1316 * effect, STPUTC(c, p) is the same as *p++ = c except that the stack is
1320 * someone else to use the stack temporarily and then continue to grow
1452 * The return string is allocated on the stack.
1566 #define VSTACK 0x10 /* text is allocated on the stack */
3642 * until is runs out of stack space, unless it does a wait call before
5074 * Put a string on the stack.
5698 * Add the value of a specialized variable to the stack string.
8751 * To handle the "." command, a stack of input files is used. Pushfile
8752 * adds a new entry to the stack and popfile restores the previous level.
8837 * old input onto the stack first.
10289 * characters on the top of the stack which must be preserved.
11742 { "stack(kbytes)", RLIMIT_STACK, 1024, 's' },
11930 /* The code uses a simple two-stack algorithm. See
11934 * to the stack instead of adding them to a queue to end up with an
12158 * stack. For a unary operator it will only change the top element, but a
12373 operator *stack = alloca((datasizes) * sizeof(operator)),
12374 *stackptr = stack;
12388 * input stream. If there are still tokens on the operator stack, they
12390 * result on the integer stack */
12488 * stack, because there can be many in a row and it could cause an
12490 * integer stack. */
12492 * stack until we find an operator with a lesser priority than the
12505 while (stackptr != stack) {
12508 * hit an open paren nor the bottom of the stack, pop
12536 /* Push this operator to the stack and remember it. */