Searched refs:stack (Results 1 - 24 of 24) sorted by relevance

/ast/src/lib/libast/misc/
H A Dstack.c24 * pointer stack routines
27 static const char id_stack[] = "\n@(#)$Id: stack (AT&T Bell Laboratories) 1984-05-01 $\0\n";
30 #include <stack.h>
33 * create a new stack
39 register STACK stack; local
43 if (!(stack = newof(0, struct stacktable, 1, 0))) return(0);
46 free(stack);
49 if (!(b->stack = newof(0, void*, size, 0)))
52 free(stack);
55 stack
70 stackfree(register STACK stack) argument
90 stackclear(register STACK stack) argument
101 stackget(register STACK stack) argument
112 stackpush(register STACK stack, void* value) argument
142 stackpop(register STACK stack) argument
168 stacktell(register STACK stack, int set, STACKPOS* position) argument
[all...]
H A Dfts.c88 FTSENT* stack; /* getlist() stack */ \
367 * FTSENT.stack instead of recursion to avoid blowing the real
368 * stack on big directories
374 register FTSENT* stack = 0; local
380 root->stack = stack;
381 stack = root;
397 if (!(root = stack))
402 stack
[all...]
/ast/src/lib/libast/string/
H A Dfmtre.c52 Stack_t stack[32]; local
57 p = stack;
113 if (p >= &stack[elementsof(stack)])
140 if (p >= &stack[elementsof(stack)])
183 if (p >= &stack[elementsof(stack)])
192 if (p == stack)
220 if (p != stack)
[all...]
H A Dfmtmatch.c48 char* stack[32]; local
53 p = stack;
136 if (p >= &stack[elementsof(stack)])
157 if (p == stack)
259 if (p == stack && b == buf + 3)
276 if (p != stack)
/ast/src/lib/libvcodex/
H A Dvcopen.c103 Stack_t stack[4]; local
104 Stack_t *sp = &stack[0];
112 { if(sp <= stack)
130 { if(sp >= &stack[sizeof(stack)/sizeof(stack[0])])
/ast/src/lib/libast/include/
H A Dstack.h27 * homogenous stack routine definitions
33 typedef struct stacktable* STACK; /* stack pointer */
34 typedef struct stackposition STACKPOS; /* stack position */
36 struct stackblock /* stack block cell */
38 void** stack; /* actual stack */ member in struct:stackblock
43 struct stackposition /* stack position */
49 struct stacktable /* stack information */
51 struct stackblock* blocks; /* stack table blocks */
54 STACKPOS position; /* current stack positio
[all...]
/ast/src/lib/libast/tm/
H A Dtmxscan.c177 char* stack[4]; local
187 char** sp = &stack[0];
200 if (sp <= &stack[0])
407 if (sp >= &stack[elementsof(stack)])
421 if (sp > &stack[0])
422 format = (const char*)stack[0];
H A Dtmxfmt.c120 Stack_t stack[8]; local
131 sp = &stack[0];
140 if (sp <= &stack[0])
688 if (sp < &stack[elementsof(stack)])
/ast/src/cmd/mailx/
H A Dmisc.c182 * the stack.
202 state.source.stack[state.source.sp].input = state.input;
203 state.source.stack[state.source.sp].cond = state.cond;
204 state.source.stack[state.source.sp].loading = state.loading;
221 note(0, "\"Source\" stack over-pop");
229 state.cond = state.source.stack[state.source.sp].cond;
230 state.loading = state.source.stack[state.source.sp].loading;
231 state.input = state.source.stack[state.source.sp].input;
H A Dmailx.h725 int sp; /* Top of stack */
730 } stack[NOFILE]; member in struct:__anon136::__anon142
/ast/src/lib/libdss/
H A Dcxlib.h68 struct Cxoperand_s* stack; \
141 struct Cxoperand_s* stack; member in struct:Cxcompile_s
H A Dcxeval.c136 sp = expr->stack + 1;
145 cxcodetrace(cx, "eval", pc, pc - pe + 1, expr->stack, sp);
H A Ddssopen.c869 x->stack = expr->stack;
/ast/src/cmd/codexlib/lzd/
H A Dlzd.c54 unsigned int stack[STACKSIZE + SPARE]; member in struct:State_s
98 state->stack[state->sp++] = c;
103 #define pop(p) ((p)->stack[--(p)->sp])
/ast/src/lib/libtk/generic/
H A DtkImgGIF.c534 static int stack[(1<<(MAX_LWZ_BITS))*2], *sp;
559 sp = stack;
572 if (sp > stack)
589 sp = stack;
644 if (sp > stack)
531 static int stack[(1<<(MAX_LWZ_BITS))*2], *sp; local
/ast/src/lib/libbz/
H A Dblocksort.c283 #define push(lz,hz,dz) { stack[sp].ll = lz; \
284 stack[sp].hh = hz; \
285 stack[sp].dd = dz; \
289 lz = stack[sp].ll; \
290 hz = stack[sp].hh; \
291 dz = stack[sp].dd; }
298 to get a stack overflow whilst sorting,
301 stack go above 27 elems, so the following
311 StackElem stack[QSORT_STACK_SIZE]; local
/ast/src/lib/libast/regex/
H A Dregnexec.c244 * allocate a frame and push a match onto the stack
276 * allocate a frame and push a pos onto the stack
411 if (env->stack && pospush(env, rex, s, END_ANY))
414 if (env->stack)
438 if (env->stack)
448 if (env->stack)
474 if (env->stack && pospush(env, rex, s, END_ANY))
477 if (env->stack)
823 if (env->stack)
1036 if (!env->stack)
[all...]
H A Dreglib.h304 Stk_t* stk; /* stack pointer */
453 * REX_REP catcher. One is created on the stack for
539 Stk_pos_t stk; /* exec stack pos */
553 unsigned char stack; /* hard comp or exec */ member in struct:reglib_s
/ast/src/lib/libast/sfio/
H A Dvthread.h87 #define VT_STACK 1 /* set stack size */
147 size_t stack; /* stack size */ member in struct:_vthread_s
/ast/src/cmd/ksh93/tests/
H A Dcomvar.sh214 stack=()
215 typeset -a stack.items=([0]=foo [1]=bar)
216 [[ ${stack.items[0]} == foo ]] || err_exit 'typeset -a variable not expanding correctly'
/ast/src/cmd/re/
H A Dtestregex.c189 T(" -s use stack instead of malloc\n");
565 char* stack; member in struct:__anon216
1306 if (!(state.stack = stkalloc(stkstd, 0)))
1307 fprintf(stderr, "%s: out of space [stack]", unit);
1399 if (state.stack)
1400 printf(", stack");
1935 if (state.stack)
1936 stkset(stkstd, state.stack, 0);
H A Dtestglob.c275 char* stack; member in struct:__anon211
/ast/src/cmd/html/
H A Dtroff2html.c251 error(3, "input stack overflow");
823 error(3, "output stack overflow");
1758 error(2, "list stack overflow");
2722 error(2, "%s: stack underflow", tp->name);
2727 error(2, "%s: stack overflow", tp->name);
2823 error(3, "%s: conditional stack too deep", tp->name);
4798 * emit tag and optionally check stack
4817 error(2, "tag stack underflow trying to match <%s>", tag_name[OP(index)]);
4818 sfprintf(sfstderr, "stack contents:\n");
4859 error(3, "tag stack overflo
[all...]
/ast/src/lib/libast/
H A DMakefile37 stack.h stak.h stk.h swap.h tar.h times.h tm.h tok.h \
96 strtoip4.c strtoip6.c stack.c stk.c \

Completed in 104 milliseconds