Home
last modified time | relevance | path

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

12345

/plan9/sys/src/cmd/gs/src/
H A Dgsclipsr.c39 gx_clip_stack_t *stack = (gx_clip_stack_t *)vstack; in rc_free_clip_stack() local
43 gx_clip_path *pcpath = stack->clip_path; in rc_free_clip_stack()
45 next = stack->next; in rc_free_clip_stack()
46 gs_free_object(stack->rc.memory, stack, cname); in rc_free_clip_stack()
48 } while ((stack = next) != 0 && !--(stack->rc.ref_count)); in rc_free_clip_stack()
58 gx_clip_stack_t *stack = in gs_clipsave() local
62 if (copy == 0 || stack == 0) { in gs_clipsave()
63 gs_free_object(mem, stack, "gs_clipsave(stack)"); in gs_clipsave()
67 rc_init_free(stack, mem, 1, rc_free_clip_stack); in gs_clipsave()
68 stack->clip_path = copy; in gs_clipsave()
[all …]
H A Didstack.c50 dict *pdict = pds->stack.p->value.pdict; in dstack_find_name_by_index()
82 if (pds->stack.extension_size == 0) { /* Only one block of d-stack. */ in dstack_dict_is_permanent()
84 if (pds->stack.bot[i].value.pdict == pdict) in dstack_dict_is_permanent()
87 uint count = ref_stack_count(&pds->stack); in dstack_dict_is_permanent()
90 if (ref_stack_index(&pds->stack, i)->value.pdict == pdict) in dstack_dict_is_permanent()
103 ds_ptr pdref = pds->stack.p; in dstack_find_name_by_index()
127 INCR(depth[min(MAX_STATS_DEPTH, pds->stack.p - pdref)]) in dstack_find_name_by_index()
163 while (pdref-- > pds->stack.bot); in dstack_find_name_by_index()
166 if (!pds->stack.extension_size) /* no more blocks */ in dstack_find_name_by_index()
171 uint i = pds->stack.p + 1 - pds->stack.bot; in dstack_find_name_by_index()
[all …]
H A Dzmisc3.c55 ref2_t stack[MAX_DEPTH + 1]; in zeqproc() local
56 ref2_t *top = stack; in zeqproc()
58 make_array(&stack[0].proc1, 0, 1, op - 1); in zeqproc()
59 make_array(&stack[0].proc2, 0, 1, op); in zeqproc()
65 if (top == stack) { in zeqproc()
103 top < stack + (MAX_DEPTH - 1) in zeqproc()
H A Diestack.h35 if (r_has_type_attrs((pes)->stack.p, t_file, a_executable))\
36 estack_set_cache(pes, (pes)->stack.p);\
H A Dicontext.c194 ref_stack_t *rdstack = &dstack->stack; in context_state_load()
229 ref_stack_cleanup(&pcst->dict_stack.stack); in context_state_store()
230 ref_stack_cleanup(&pcst->exec_stack.stack); in context_state_store()
231 ref_stack_cleanup(&pcst->op_stack.stack); in context_state_store()
H A Dgdevpnga.c83 pdf14_buf *stack; member
111 stack);
382 result->stack = buf; in pdf14_ctx_new()
396 for (buf = ctx->stack; buf != NULL; buf = next) { in pdf14_ctx_free()
412 pdf14_buf *buf = ctx->stack; in pdf14_find_backdrop_buf()
430 pdf14_buf *tos = ctx->stack; in pdf14_push_transparency_group()
453 ctx->stack = buf; in pdf14_push_transparency_group()
493 pdf14_buf *tos = ctx->stack; in pdf14_pop_transparency_group()
590 ctx->stack = nos; in pdf14_pop_transparency_group()
650 pdf14_buf *buf = pdev->ctx->stack; in pnga_output_page()
[all …]
H A Diosdata.h29 ref_stack_t stack; /* the actual operand stack */ member
H A Diesdata.h28 ref_stack_t stack; /* the actual execution stack */ member
H A Didsdata.h32 ref_stack_t stack; /* the actual stack of dictionaries */ member
H A Dostack.h28 #define o_stack (iop_stack.stack)
H A Dttfmemd.c73 ENUM_PTR(8, TExecution_Context, stack);
104 RELOC_PTR(TExecution_Context, stack); in RELOC_PTRS_WITH()
H A Dgdevp14.h62 pdf14_buf *stack; member
H A Ddstack.h28 #define d_stack (idict_stack.stack)
/plan9/sys/src/cmd/pic/
H A Dblockgen.c9 struct pushstack stack[NBRACK]; variable
24 stack[nstack].p_x = curx; in leftthing()
25 stack[nstack].p_y = cury; in leftthing()
26 stack[nstack].p_hvmode = hvmode; in leftthing()
28 stack[nstack].p_xmin = xmin; in leftthing()
29 stack[nstack].p_xmax = xmax; in leftthing()
30 stack[nstack].p_ymin = ymin; in leftthing()
31 stack[nstack].p_ymax = ymax; in leftthing()
64 curx = stack[nstack].p_x; in rightthing()
65 cury = stack[nstack].p_y; in rightthing()
[all …]
H A Dsymtab.c45 for (p = stack[nstack].p_symtab; p != NULL; p = p->s_next) in makevar()
52 p->s_next = stack[nstack].p_symtab; in makevar()
53 stack[nstack].p_symtab = p; /* stick it at front */ in makevar()
67 for (p = stack[i].p_symtab; p != NULL; p = p->s_next) in lookup()
88 for (p = op = q = stack[nstack].p_symtab; p != NULL; p = p->s_next) { in freedef()
93 stack[nstack].p_symtab = p->s_next; in freedef()
/plan9/sys/src/cmd/db/
H A Dprint.c49 int stack; in printtrace() local
65 stack = 1; in printtrace()
67 stack = 0; in printtrace()
71 redirin(stack, fname); in printtrace()
232 redirin(int stack, char *file) in redirin() argument
240 iclose(stack, 0); in redirin()
H A Doutput.c56 iclose(int stack, int err) in iclose() argument
67 } else if (stack == 0) { in iclose()
72 } else if (stack > 0) { in iclose()
/plan9/sys/lib/
H A Dyaccpars127 /* put a state and value onto the stack */
133 yyerror("yacc stack overflow");
203 /* the current yyp has no shift onn "error", pop stack */
209 /* there is no state on the stack with an error shift ... abort */
241 goto yystack; /* stack new state and value */
H A Dyaccpar127 /* put a state and value onto the stack */
133 yyerror("yacc stack overflow");
202 /* the current yyp has no shift onn "error", pop stack */
208 /* there is no state on the stack with an error shift ... abort */
240 goto yystack; /* stack new state and value */
/plan9/sys/src/cmd/jpg/
H A Dreadgif.c380 uchar stack[4096], data[256]; in decode() local
442 stacki = (sizeof stack)-1; in decode()
448 stack[stacki--] = fc; in decode()
457 stack[stacki--] = tbl[c].exten; in decode()
459 nb = (sizeof stack)-(stacki+1); in decode()
465 memmove(pic+pici, stack+stacki+1, sizeof stack - (stacki+1)); in decode()
469 fc = stack[stacki+1]; in decode()
/plan9/sys/src/ape/cmd/diff/
H A Dregex.c1157 fail_stack_elt_t *stack; member
1173 fail_stack.stack = (fail_stack_elt_t *) \
1177 if (fail_stack.stack == NULL) \
1184 #define RESET_FAIL_STACK() REGEX_FREE_STACK (fail_stack.stack)
1214 : ((fail_stack).stack \
1216 REGEX_REALLOCATE_STACK ((fail_stack).stack, \
1222 (fail_stack).stack == NULL \
1239 : ((FAIL_STACK).stack[(FAIL_STACK).avail++].pointer = POINTER, \
1246 fail_stack.stack[fail_stack.avail++].pointer = (unsigned char *) (item)
1252 fail_stack.stack[fail_stack.avail++].integer = (item)
[all …]
/plan9/sys/src/cmd/cwfs/doc/
H A Dchanges36 • check now reports stack usage: 320 bytes upon entry to fsck first time,
37 92 bytes of stack per recursion. given 16000 bytes of stack,
/plan9/sys/src/cmd/hoc/
H A Dcode.c9 static Datum stack[NSTACK]; /* the stack */ variable
34 stackp = stack; in initcode()
43 if (stackp >= &stack[NSTACK]) in push()
51 if (stackp == stack) in pop()
59 if (stackp == stack) in xpop()
/plan9/sys/doc/
H A Dlibmach.ms89 processing which depends on the stack
94 with a similar stack model.
271 Execution context interpretation, such as stack traces
272 and stack frame location.
458 perform stack
459 traces, find stack frames, format floating point
466 process the fixed-frame stack model implemented by
558 stack pointer for a suspended kernel thread. This
577 the stack pointer and program counter, respectively,
578 to properly locate the stack and next
[all …]
/plan9/sys/lib/ghostscript/
H A Dpdf_sec-ps.bak57 % stack: string string index
73 % stack: <key> <stream> <string>
152 % 1600 stack positions, around 3 times what we can expect to have
160 % ) because the scanner uses the operand stack to accumulate procedures.
308 % stack: gen# string obj#
358 % stack: object object key object object

12345