Home
last modified time | relevance | path

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

12345

/original-bsd/usr.bin/pascal/px/
H A Dmachdep.h71 #define push2(x) (*--stack.sp) = (x)
75 #define push4(x) (*--stack.lp) = (x)
76 #define push8(x) (*--stack.dbp) = (x)
77 #define pushsze8(x) (*--stack.s8p) = (x)
78 #define pushsp(x) (stack.cp -= (x))
80 #define pop2() (*stack.sp++)
82 #define pop2() (*stack.lp++) >> 16
84 #define pop4() (*stack.lp++)
85 #define pop8() (*stack.dbp++)
86 #define popsze8() (*stack.s8p++)
[all …]
/original-bsd/local/ditroff/ditroff.okeeffe/pic/
H A Dblockgen.c12 struct pushstack stack[NBRACK]; variable
26 stack[nstack].p_x = curx;
27 stack[nstack].p_y = cury;
30 stack[nstack].p_xmin = xmin;
31 stack[nstack].p_xmax = xmax;
32 stack[nstack].p_ymin = ymin;
33 stack[nstack].p_ymax = ymax;
67 curx = stack[nstack].p_x;
68 cury = stack[nstack].p_y;
76 xmin = stack[nstack].p_xmin;
[all …]
H A Dsymtab.c54 for (p = stack[nstack].p_symtab; p != NULL; p = p->s_next)
63 p->s_next = stack[nstack].p_symtab;
64 stack[nstack].p_symtab = p; /* stick it at front */
79 for (p = stack[i].p_symtab; p != NULL; p = p->s_next)
102 for (p = op = q = stack[nstack].p_symtab; p != NULL; p = p->s_next) {
107 stack[nstack].p_symtab = p->s_next;
/original-bsd/old/adb/adb.tahoe/
H A Dkstack.c150 register char *stack; local
153 if ((stack = malloc((u_int)ssize)) == NULL)
155 if (readcore(kvtooff(intstack), stack, ssize) != ssize) {
156 free(stack);
160 if (goodframe((struct frame *)&stack[ssize])) {
162 *frame = *(struct frame *)&stack[ssize];
163 free(stack);
167 free(stack);
H A Dsetup.c236 char stack[NISP*NBPG]; in checkintstack() local
242 read(fcor, stack, sizeof (stack)) != sizeof (stack)) in checkintstack()
247 fp = (struct frame *)&stack[addr - intstack]; in checkintstack()
/original-bsd/old/adb/adb.vax/
H A Dkstack.c155 register char *stack; local
158 if ((stack = malloc((u_int)ssize)) == NULL)
160 if (readcore(kvtooff(intstack), stack, ssize) != ssize) {
161 free(stack);
165 if (goodframe((struct frame *)&stack[ssize])) {
167 *frame = *(struct frame *)&stack[ssize];
168 free(stack);
172 free(stack);
H A Dsetup.c237 char stack[NISP*NBPG]; in checkintstack() local
243 read(fcor, stack, sizeof (stack)) != sizeof (stack)) in checkintstack()
248 fp = (struct frame *)&stack[addr - intstack]; in checkintstack()
/original-bsd/old/berknet/
H A Dnetq.c20 } stack[STSIZE], temp; variable
116 cp = (char *)&(stack[0].name[0]);
120 strcpy(jname,stack[i].name);
131 else summarize( stack[i].filesize );
284 strcpy(stack[stptr].name,f);
285 stack[stptr++].filesize = t;
298 if(compar(&stack[i],&stack[j]) > 0) in sort()
299 swap(&stack[i],&stack[j]); in sort()
/original-bsd/usr.bin/pascal/src/
H A Dyyparse.c66 stack: in yyparse()
125 goto stack; in yyparse()
153 goto stack; in yyparse()
192 goto stack; in yyparse()
/original-bsd/usr.bin/m4/
H A DNOTES34 [1] PD m4 uses a different (and simpler) stack mechanism than the one
36 The triple stack thing is replaced with a single stack containing
38 previous stack frame, which enables us to rewind the stack after
/original-bsd/games/atc/
H A Dinput.c60 #define T_RULE stack[level].rule
61 #define T_STATE stack[level].state
62 #define T_STR stack[level].str
63 #define T_POS stack[level].pos
64 #define T_CH stack[level].ch
162 STACK stack[MAXDEPTH]; variable
251 func = st[stack[i].state].rule[stack[i].rule].func; in getcommand()
253 if ((s = (*func)(stack[i].ch)) != NULL) { in getcommand()
254 ioerror(stack[i].pos, strlen(stack[i].str), s); in getcommand()
/original-bsd/usr.bin/pascal/pdx/runtime/
H A Dframe.rep11 * Definitions for accessing stack frames.
33 FRAME *nextframe(); /* go up the stack */
39 ADDRESS stkaddr(); /* stack address associated with a frame */
/original-bsd/lib/libc/tahoe/gen/
H A Dsetjmp.s33 callf $16,_sigstack # pop args plus signal stack value
38 addl3 $8,fp,8(r6) # save stack pointer of caller
65 ret # unwind stack before signals enabled
/original-bsd/old/adb/common_source/
H A Dprint.c33 int stack, i; local
45 stack = 1;
47 stack = 0;
74 iclose(stack, 0);
H A Doutput.c400 iclose(stack, err) in iclose() argument
401 int stack, err; in iclose()
413 } else if (stack == 0) {
418 } else if (stack > 0) {
/original-bsd/old/yacc/
H A Dold.yaccpar37 yystack: /* put a state and value onto the stack */
42 if( ++yyps> &yys[YYMAXDEPTH] ) { yyerror( "yacc stack overflow" ); return(1); }
105 /* the current yyps has no shift onn "error", pop stack */
114 /* there is no state on the stack with an error shift ... abort */
151 goto yystack; /* stack new state and value */
/original-bsd/local/toolchest/ksh/sh/
H A Dsyscall.s9 movh code,0(%fp) # copy the "ost" to the stack
17 ost &0 # this code is copied to the stack
/original-bsd/sys/hp300/DOC/
H A DDebug.tips5 for the kernel stack at 0xfff00000.
58 0x917000 - 0x91a000 u-area; 1st page is user struct, last k-stack
65 stack are used by the kernel. From 0xFFF00000 to 0xFFF03000 is the u-area.
69 above the user stack. The pages from FFF03000 up are not used. They
70 exist so that the user stack is in the same location as in HPUX.
94 There is no seperate interrupt stack (right now) on the HPs. Interrupt
95 processing is handled on the kernel stack of the "current" process.
148 5. Locating a process' kernel stack:
150 First find the process' page table as described above. The kernel stack
156 kernel stack. Currently it is read/write and actually allocated. Hence
[all …]
H A DPmap.notes8 when deallocating the stack segment. Since the current implementation
9 of the stack is to "lazy allocate" the maximum possible stack size
23 Another solution would be to change the way stack allocation is done
/original-bsd/bin/sh/funcs/
H A Dpushd19 then echo "pushd: directory stack empty."
34 then echo "popd: directory stack empty."
H A Ddirs19 then echo "pushd: directory stack empty."
34 then echo "popd: directory stack empty."
H A Dpopd19 then echo "pushd: directory stack empty."
34 then echo "popd: directory stack empty."
/original-bsd/old/boggle/
H A Dboggle.c81 struct frame stack[SSIZE]; variable
268 stack[0].parent = &stack[0]; in setup()
269 stack[0].place = BSIZE; in setup()
270 level[0] = &stack[0]; in setup()
271 level[1] = &stack[1]; in setup()
493 if (node == &stack[0])
542 if (++top >= &stack[SSIZE]) {
/original-bsd/old/pcc/ccom.vax/
H A Dmacdefs40 /* register cookie for stack poINTer */
54 /* show stack grows negatively */
/original-bsd/old/games.vax/compat/Original/
H A Dcompat.s10 # fixup stack by doing rets from compat and the function

12345