| /xsrc/external/mit/freetype/dist/src/psaux/ |
| psstack.c | 5 * Adobe's code for emulating a CFF stack (body).
59 CF2_Stack stack = NULL; local
62 if ( FT_NEW( stack ) )
66 stack->memory = memory;
67 stack->error = e;
69 /* allocate the stack buffer */
70 if ( FT_NEW_ARRAY( stack->buffer, stackSize ) )
72 FT_FREE( stack );
76 stack->stackSize = stackSize;
77 stack->top = stack->buffer; /* empty stack *
[all...] |
| psstack.h | 5 * Adobe's code for emulating a CFF stack (specification).
47 /* CFF operand stack; specified maximum of 48 or 192 values */
78 cf2_stack_free( CF2_Stack stack ); variable
81 cf2_stack_count( CF2_Stack stack ); variable
84 cf2_stack_pushInt( CF2_Stack stack,
87 cf2_stack_pushFixed( CF2_Stack stack,
91 cf2_stack_popInt( CF2_Stack stack ); variable
93 cf2_stack_popFixed( CF2_Stack stack ); variable
96 cf2_stack_getReal( CF2_Stack stack,
99 cf2_stack_setReal( CF2_Stack stack,
113 cf2_stack_clear( CF2_Stack stack ); variable
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sfn/ |
| sfn_callstack.cpp | 45 ++m_bc.stack.push;
48 ++m_bc.stack.push_wqm;
51 ++m_bc.stack.loop;
64 --m_bc.stack.push;
65 assert(m_bc.stack.push >= 0);
68 --m_bc.stack.push_wqm;
69 assert(m_bc.stack.push_wqm >= 0);
72 --m_bc.stack.loop;
73 assert(m_bc.stack.loop >= 0);
84 r600_stack_info& stack = m_bc.stack local
[all...] |
| sfn_nir_vectorize_vs_inputs.c | 123 struct util_dynarray *stack = ralloc(mem_ctx, struct util_dynarray); local
124 util_dynarray_init(stack, mem_ctx);
125 return stack;
129 r600_vec_instr_stack_push(struct util_dynarray *stack, nir_instr *instr)
131 util_dynarray_append(stack, nir_instr *, instr);
177 r600_vec_instr_stack_pop(nir_builder *b, struct util_dynarray *stack,
181 nir_instr *last = util_dynarray_pop(stack, nir_instr *);
200 /* Don't bother walking the stack if this component can't be vectorised. */
246 const struct util_dynarray *stack = data; local
247 const nir_instr *first = *(nir_instr **)util_dynarray_begin(stack);
277 struct util_dynarray *stack = (struct util_dynarray *) entry->key; local
311 struct util_dynarray *stack = (struct util_dynarray *) entry->key; local
[all...] |
| sfn_conditionaljumptracker.cpp | 30 #include <stack>
37 using std::stack;
74 stack<PStackFrame> m_jump_stack;
75 stack<PStackFrame> m_loop_stack;
129 sfn_log << "Jump stack empty\n";
136 sfn_log << "Loop jump stack empty\n";
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/tests/ |
| sexps.py | 51 stack = [[]]
55 stack.append([])
57 if len(stack) == 1:
59 sexp = stack.pop()
60 stack[-1].append(sexp)
62 stack[-1].append(token)
63 if len(stack) != 1:
65 if len(stack[0]) != 1:
67 return stack[0][0]
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/tests/ |
| sexps.py | 56 stack = [[]]
60 stack.append([])
62 if len(stack) == 1:
64 sexp = stack.pop()
65 stack[-1].append(sexp)
67 stack[-1].append(token)
68 if len(stack) != 1:
70 if len(stack[0]) != 1:
72 return stack[0][0]
|
| /xsrc/external/mit/MesaLib/dist/src/mesa/main/ |
| matrix.c | 102 static void matrix_frustum(struct gl_matrix_stack* stack,
120 _math_matrix_frustum(stack->Top,
124 ctx->NewState |= stack->DirtyFlag;
141 * the top matrix of the current matrix stack and sets
165 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, local
167 if (!stack)
170 matrix_frustum(stack,
179 matrix_ortho(struct gl_matrix_stack* stack,
201 _math_matrix_ortho( stack->Top,
205 ctx->NewState |= stack->DirtyFlag
246 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, local
273 struct gl_matrix_stack * stack; local
346 struct gl_matrix_stack *stack = ctx->CurrentStack; local
360 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, local
403 struct gl_matrix_stack *stack = ctx->CurrentStack; local
427 struct gl_matrix_stack *stack = get_named_matrix_stack(ctx, matrixMode, local
480 struct gl_matrix_stack *stack; local
551 struct gl_matrix_stack * stack = local
608 struct gl_matrix_stack * stack = local
657 struct gl_matrix_stack *stack = local
693 struct gl_matrix_stack *stack; local
734 struct gl_matrix_stack *stack = local
[all...] |
| /xsrc/external/mit/libXt/dist/src/ |
| Threads.c | 80 ThreadStack stack; member in struct:_LockRec
238 if (app_lock->stack.sp == (int) app_lock->stack.size - 1) {
241 app_lock->stack.st = (struct _Tstack *)
242 XtReallocArray(app_lock->stack.st,
243 (Cardinal) (app_lock->stack.size + STACK_INCR),
245 ii = app_lock->stack.size;
246 app_lock->stack.size += STACK_INCR;
247 for (; ii < app_lock->stack.size; ii++) {
248 app_lock->stack.st[ii].c = xcondition_malloc()
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/mesa/main/ |
| matrix.c | 62 * the top matrix of the current matrix stack and sets
105 * the top matrix of the current matrix stack and sets
138 * Set the current matrix stack.
140 * \param mode matrix stack.
146 * with the specified matrix stack.
216 * Push the current matrix stack.
220 * Verifies the current matrix stack is not full, and duplicates the top-most
221 * matrix in the stack.
222 * Marks __struct gl_contextRec::NewState with the stack dirty flag.
228 struct gl_matrix_stack *stack = ctx->CurrentStack local
285 struct gl_matrix_stack *stack = ctx->CurrentStack; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| dag.c | 114 struct util_dynarray stack; local
115 util_dynarray_init(&stack, NULL);
121 util_dynarray_append(&stack, struct dag_node *, node);
123 /* Push unprocessed children onto stack in reverse order. Note that
125 * stack.
129 util_dynarray_append(&stack, struct dag_node *, edge->child);
137 struct dag_node *top = util_dynarray_pop(&stack, struct dag_node *);
147 /* Find the next unprocessed node in the stack */
150 if (stack.size == 0)
153 node = util_dynarray_pop(&stack, struct dag_node *)
[all...] |
| register_allocate_internal.h | 110 * interfering nodes not in the stack.
123 * into the stack.
144 unsigned int *stack; member in struct:ra_graph::__anon2882
147 /** Bit-set indicating, for each register, if it's in the stack */
167 * stack.
|
| /xsrc/external/mit/MesaLib/dist/src/mapi/glapi/gen/ |
| gl_x86_asm.py | 174 print(' .section .note.GNU-stack,"",%progbits')
182 stack = self.get_stack_size(f)
183 alt = "%s@%u" % (name, stack)
193 stack = self.get_stack_size(f)
194 alt = "%s@%u" % (name, stack)
199 alt2 = "%s@%u" % (n, stack)
|
| /xsrc/external/mit/MesaLib.old/dist/src/mapi/glapi/gen/ |
| gl_x86_asm.py | 185 print(' .section .note.GNU-stack,"",%progbits')
193 stack = self.get_stack_size(f)
194 alt = "%s@%u" % (name, stack)
204 stack = self.get_stack_size(f)
205 alt = "%s@%u" % (name, stack)
210 alt2 = "%s@%u" % (n, stack)
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/core/ |
| context.hpp | 27 #include <stack>
81 std::stack<std::function<void ()>> _destroy_notify;
|
| /xsrc/external/mit/xf86-video-intel/dist/src/sna/brw/ |
| brw_eu.c | 119 assert(p->current != &p->stack[BRW_EU_MAX_INSN_STACK-1]);
121 p->compressed_stack[p->current - p->stack] = p->compressed;
127 assert(p->current != p->stack);
129 p->compressed = p->compressed_stack[p->current - p->stack];
140 p->current = p->stack;
|
| /xsrc/external/mit/xf86-video-intel-2014/dist/src/sna/brw/ |
| brw_eu.c | 119 assert(p->current != &p->stack[BRW_EU_MAX_INSN_STACK-1]);
121 p->compressed_stack[p->current - p->stack] = p->compressed;
127 assert(p->current != p->stack);
129 p->compressed = p->compressed_stack[p->current - p->stack];
140 p->current = p->stack;
|
| /xsrc/external/mit/xorg-server.old/dist/hw/dmx/config/ |
| dmxprint.c | 59 /** Stack of indentation information used for pretty-printing
61 static struct stack { struct
65 struct stack *next;
66 } *stack, initialStack = { 0, 0, 4, NULL }; variable in typeref:struct:stack
84 struct stack *new = dmxConfigAlloc(sizeof(*new));
88 new->next = stack;
89 stack = new;
96 if (stack) indent = stack->comment;
101 if (stack) indent = stack->step
[all...] |
| /xsrc/external/mit/freetype/dist/src/cff/ |
| cffparse.c | 56 parser->top = parser->stack;
64 /* allocate the stack buffer */
65 if ( FT_NEW_ARRAY( parser->stack, stackSize ) )
67 FT_FREE( parser->stack );
72 parser->top = parser->stack; /* empty stack */
102 FT_FREE( parser->stack );
675 FT_Byte** data = parser->stack;
678 if ( parser->top >= parser->stack + 6 )
799 FT_Byte** data = parser->stack;
1266 FT_Fixed* stack; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/glx/ |
| clientattrib.c | 76 if (spp < &gc->attributes.stack[__GL_CLIENT_ATTRIB_STACK_DEPTH]) {
109 if (spp > &gc->attributes.stack[0]) {
138 for (spp = &gc->attributes.stack[0];
139 spp < &gc->attributes.stack[__GL_CLIENT_ATTRIB_STACK_DEPTH]; spp++) {
|
| indirect_vertex_array.c | 118 free(arrays->stack);
119 arrays->stack = NULL;
294 arrays->stack = malloc(sizeof(struct array_stack_state)
298 if (arrays->stack == NULL) {
1958 struct array_stack_state *stack = local
1959 &arrays->stack[(arrays->stack_index * arrays->num_arrays)];
1964 stack[i].data = arrays->arrays[i].data;
1965 stack[i].data_type = arrays->arrays[i].data_type;
1966 stack[i].user_stride = arrays->arrays[i].user_stride;
1967 stack[i].count = arrays->arrays[i].count
1984 struct array_stack_state *stack; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/panfrost/ |
| pan_allocate.c | 126 pandev_allocate_offset(int *stack, size_t sz)
128 /* First, align the stack bottom to something nice; it's not critical
131 int excess = *stack & (ALIGNMENT - 1);
135 *stack += ALIGNMENT - excess;
138 * stack */
140 int ret = *stack;
141 *stack += sz;
|
| /xsrc/external/mit/xedit/dist/lisp/ |
| bytecode.c | 65 pointer where an object value should be read/stored as the stack address
218 CodeBlock *prev; /* Linked list as a stack */
244 int stack; /* max number of objects will be loaded in stack */ member in struct:_LispCom::__anon58
247 } stack; member in struct:_LispCom
679 short stack, num_constants, num_symbols, num_builtins, num_bytecodes; local
685 stack = *(short*)stream;
687 sprintf(buffer, "%d element%s used in the stack\n",
688 stack, stack != 1 ? "s" : "")
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/glx/ |
| indirect_vertex_array.c | 120 free(arrays->stack);
121 arrays->stack = NULL;
296 arrays->stack = malloc(sizeof(struct array_stack_state)
300 if (arrays->stack == NULL) {
1960 struct array_stack_state *stack = local
1961 &arrays->stack[(arrays->stack_index * arrays->num_arrays)];
1966 stack[i].data = arrays->arrays[i].data;
1967 stack[i].data_type = arrays->arrays[i].data_type;
1968 stack[i].user_stride = arrays->arrays[i].user_stride;
1969 stack[i].count = arrays->arrays[i].count
1986 struct array_stack_state *stack; local
[all...] |
| clientattrib.c | 76 if (spp < &gc->attributes.stack[__GL_CLIENT_ATTRIB_STACK_DEPTH]) {
109 if (spp > &gc->attributes.stack[0]) {
|
