HomeSort by relevance Sort by last modified time
    Searched defs:stack (Results 1 - 25 of 67) sorted by null

1 2 3

  /onnv/onnv-gate/usr/src/cmd/mdb/intel/amd64/kmdb/
kmdb_makecontext.c 37 #include <sys/stack.h>
46 uintptr_t *stack = (uintptr_t *)(((uintptr_t)stk + stksize - 1) & local
49 *stack-- = 0;
52 ucp->uc_mcontext.gregs[REG_SP] = (greg_t)stack;
  /onnv/onnv-gate/usr/src/cmd/mdb/intel/ia32/kmdb/
kmdb_makecontext.c 37 #include <sys/stack.h>
46 uintptr_t *stack = (uintptr_t *)((((uintptr_t)stk + stksize - 1) & local
49 *stack-- = 0;
50 *stack = (uintptr_t)arg;
53 ucp->uc_mcontext.gregs[REG_SP] = (greg_t)stack;
  /onnv/onnv-gate/usr/src/cmd/mdb/sparc/kmdb/
kmdb_makecontext.c 38 #include <sys/stack.h>
48 * Top-of-stack must be rounded down to STACK_ALIGN and
51 uintptr_t stack = (((uintptr_t)stk + stksize - 1) & local
54 /* clear the top stack frame */
55 bzero((void *)stack, SA(MINFRAME));
61 ucp->uc_mcontext.gregs[REG_SP] = (greg_t)(stack - STACK_BIAS);
  /onnv/onnv-gate/usr/src/cmd/fs.d/autofs/
autod_lookup.c 60 char *stack[STACKSIZ]; local
61 char **stkptr = stack;
107 /* initialize the stack of open files for this thread */
108 stack_op(INIT, NULL, stack, &stkptr);
110 err = getmapent(key, mapname, &ml, stack, &stkptr, &iswildcard,
  /onnv/onnv-gate/usr/src/lib/libc/amd64/threads/
machdep.c 40 uint64_t *stack; local
48 * Top-of-stack must be rounded down to STACK_ALIGN and
51 stack = (uint64_t *)(((uintptr_t)stk + stksize) & ~(STACK_ALIGN-1));
55 * a page for the top page of the stack. This will cause
59 stack -= 3;
63 if (uucopy(&frame, stack, sizeof (frame)) == 0)
64 return (stack);
72 uint64_t *stack; local
85 * Setup the top stack frame.
88 if ((stack = setup_top_frame(stk, stksize, ulwp)) == NULL
    [all...]
  /onnv/onnv-gate/usr/src/lib/libc/sparc/threads/
machdep.c 41 uintptr_t stack; local
45 * Top-of-stack must be rounded down to STACK_ALIGN and
48 stack = (((uintptr_t)stk + stksize) & ~(STACK_ALIGN - 1)) -
53 * a page for the top page of the stack. This will cause
58 if (uucopy(frame, (void *)stack, sizeof (frame)) == 0)
59 return ((void *)stack);
67 uintptr_t stack; local
73 * Clear the top stack frame.
76 if ((stack = (uintptr_t)setup_top_frame(stk, stksize, ulwp)) == NULL)
84 ucp->uc_mcontext.gregs[REG_SP] = (greg_t)(stack - STACK_BIAS)
    [all...]
  /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/
debug.c 94 /* Print backtrace stack */
95 void *stack[20]; local
97 int size = backtrace(stack, 20);
98 strings = backtrace_symbols(stack, size);
101 printf(_("Backtrace has %d calls on stack:\n"), size);
  /onnv/onnv-gate/usr/src/lib/libast/common/misc/
stack.c 24 * 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
36 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))
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/common/string/
fmtmatch.c 48 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)
fmtre.c 52 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...]
  /onnv/onnv-gate/usr/src/cmd/dtrace/test/tst/common/
Makefile 43 fasttrap/tst.stack.exe := LDLIBS += -ldtrace
  /onnv/onnv-gate/usr/src/cmd/sendmail/db/btree/
bt_rsearch.c 80 int ret, stack; local
103 stack = LF_ISSET(S_STACK);
105 0, pg, stack ? DB_LOCK_WRITE : DB_LOCK_READ, &lock)) != 0)
120 if (!stack &&
131 stack = 1;
233 if (stack) {
249 * page in the stack. If we do, write lock it and
255 stack = 1;
260 __bam_lget(dbc, 1, pg, stack && LF_ISSET(S_WRITE) ?
bt_search.c 87 int cmp, jump, ret, stack; local
113 stack = F_ISSET(dbp, DB_BT_RECNUM) && LF_ISSET(S_STACK);
115 0, pg, stack ? DB_LOCK_WRITE : DB_LOCK_READ, &lock)) != 0)
130 if (!stack &&
141 stack = 1;
210 if (stack) {
226 * page in the return stack. If so, lock it and never
232 stack = 1;
237 __bam_lget(dbc, 1, pg, stack && LF_ISSET(S_WRITE) ?
310 * Release all pages currently held in the stack
    [all...]
  /onnv/onnv-gate/usr/src/cmd/tnf/prex/
source.c 73 static queue_node_t stack; variable
78 * source_init() - initializes the source stack
90 /* initialize the stack queue head */
91 queue_init(&stack);
93 /* stick the standard input on the bottom of the stack */
101 (void) queue_prepend(&stack, &new_p->qn);
105 * since we are pushing onto a stack, we invert the search order *
128 * source_file() - pushes a new source onto the stack
149 (void) queue_prepend(&stack, &new_p->qn);
192 top = (source_t *) queue_next(&stack, &stack)
    [all...]
  /onnv/onnv-gate/usr/src/lib/libxcurses/src/libc/xcurses/
tparm.c 58 * The parameter mechanism uses a stack and special %
60 * of the parameters onto the stack and then print it in some
93 * the stack works in the usual way, with
106 stack[stack_ptr].num = x; stack_ptr++; }
107 #define npop() (stack_ptr > 0 ? stack[--stack_ptr].num : 0)
108 #define spop() (stack_ptr > 0 ? stack[--stack_ptr].str : (char *) 0)
135 stack_frame stack[STACKSIZE]; local
  /onnv/onnv-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
tparm.c 63 * The parameter mechanism uses a stack and special %
65 * of the parameters onto the stack and then print it in some
98 * the stack works in the usual way, with
111 stack[stack_ptr].num = x; \
114 #define npop() (stack_ptr > 0 ? stack[--stack_ptr].num : 0)
115 #define spop() (stack_ptr > 0 ? stack[--stack_ptr].str : NULL)
138 stack_frame stack[STACKSIZE]; local
  /onnv/onnv-gate/usr/src/psm/promif/ieee1275/common/
prom_node.c 73 * implementation uses an explicitly managed stack in order to save the
80 pnode_t stack[OBP_STACKDEPTH]; local
87 stack[0] = node;
90 pnode_t curnode = stack[stackidx];
104 stack[stackidx] = prom_nextnode(stack[stackidx]);
121 stack[stackidx] = child;
123 stack[stackidx] =
124 prom_nextnode(stack[stackidx]);
  /onnv/onnv-gate/usr/src/lib/libc/i386/threads/
machdep.c 33 * The i386 ABI says that the stack pointer need be only 4-byte aligned
34 * before a function call (STACK_ALIGN == 4). We use a 16-byte stack
38 * for calls made from that function. If the stack is initially
51 uint32_t *stack; local
61 * Top-of-stack must be rounded down to STACK_ALIGN and
63 * stack frame (see <sys/frame.h>) but a construction made here to
65 * with a 16-byte aligned stack pointer (the address of frame.arg
68 stack = (uint32_t *)(((uintptr_t)stk + stksize) & ~(STACK_ALIGN-1));
72 * a page for the top page of the stack. This will cause
76 stack -= 5; /* make the address of frame.arg be 16-byte aligned *
94 uint32_t *stack; local
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/amd64/include/ast/
stack.h 29 * homogenous stack routine definitions
42 typedef struct stacktable* STACK; /* stack pointer */
43 typedef struct stackposition STACKPOS; /* stack position */
45 struct stackblock /* stack block cell */
47 __V_** stack; /* actual stack */ member in struct:stackblock
52 struct stackposition /* stack position */
58 struct stacktable /* stack information */
60 struct stackblock* blocks; /* stack table blocks *
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/common/include/
stack.h 27 * 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 *
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/i386/include/ast/
stack.h 29 * homogenous stack routine definitions
42 typedef struct stacktable* STACK; /* stack pointer */
43 typedef struct stackposition STACKPOS; /* stack position */
45 struct stackblock /* stack block cell */
47 __V_** stack; /* actual stack */ member in struct:stackblock
52 struct stackposition /* stack position */
58 struct stacktable /* stack information */
60 struct stackblock* blocks; /* stack table blocks *
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/sparc/include/ast/
stack.h 29 * homogenous stack routine definitions
42 typedef struct stacktable* STACK; /* stack pointer */
43 typedef struct stackposition STACKPOS; /* stack position */
45 struct stackblock /* stack block cell */
47 __V_** stack; /* actual stack */ member in struct:stackblock
52 struct stackposition /* stack position */
58 struct stacktable /* stack information */
60 struct stackblock* blocks; /* stack table blocks *
    [all...]
  /onnv/onnv-gate/usr/src/lib/libast/sparcv9/include/ast/
stack.h 29 * homogenous stack routine definitions
42 typedef struct stacktable* STACK; /* stack pointer */
43 typedef struct stackposition STACKPOS; /* stack position */
45 struct stackblock /* stack block cell */
47 __V_** stack; /* actual stack */ member in struct:stackblock
52 struct stackposition /* stack position */
58 struct stacktable /* stack information */
60 struct stackblock* blocks; /* stack table blocks *
    [all...]
  /onnv/onnv-gate/usr/src/cmd/sa/
sagb.c 380 static struct array stack[10]; variable in typeref:struct:array
382 &stack[0],
383 &stack[1],
384 &stack[2],
385 &stack[3],
386 &stack[4],
387 &stack[5],
388 &stack[6],
389 &stack[7],
390 &stack[8]
    [all...]
  /onnv/onnv-gate/usr/src/common/util/
qsort.c 121 stk_t stack[8 * sizeof (nrec) + 1]; local
174 * the stack is the bookkeeping mechanism to keep track of all
179 * of the stack and sort it. See the comments at the bottom
182 * initially put the whole partition on the stack
184 sp = stack;
188 while (sp > stack) {
441 * position and do not need to be accounted for by the stack
443 * when adding partitions to the stack
445 * to prevent stack overflow.
448 * push resulting partitions on stack
    [all...]

Completed in 7578 milliseconds

1 2 3