| /xsrc/external/mit/xinit/dist/launchd/user_startx/ |
| launchd_startx.c | 44 pid_t child; local
62 assert(posix_spawnp(&child, argv[1], NULL, NULL, &argv[1], envp) == 0);
63 wait4(child, &pstat, 0, (struct rusage *)0);
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| dag.h | 36 struct dag_node *child; member in struct:dag_edge
55 void dag_add_edge(struct dag_node *parent, struct dag_node *child, void *data);
|
| slab.h | 27 * Objects are allocated from "child" pools that are connected to a "parent"
30 * Calls to slab_alloc/slab_free for the same child pool must not occur from
33 * Allocations obtained from one child pool should usually be freed in the
34 * same child pool. Freeing an allocation in a different child pool associated
39 * functions around a single parent-child pair.
88 struct slab_child_pool child; member in struct:slab_mempool
|
| dag.c | 28 * Adds a directed edge from the parent node to the child.
31 * list may contain multiple edges to the same child with different data.
34 dag_add_edge(struct dag_node *parent, struct dag_node *child, void *data)
37 if (edge->child == child && edge->data == data)
40 /* Remove the child as a DAG head. */
41 list_delinit(&child->link);
44 .child = child,
49 child->parent_count++
64 struct dag_node *child = edge->child; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_opt_cse.c | 55 nir_block *child = block->dom_children[i]; local
56 progress |= cse_block(child, instr_set);
|
| nir_lower_to_source_mods.c | 167 nir_instr *child = child_src->parent_instr; local
168 if (child->type != nir_instr_type_alu) {
173 nir_alu_instr *child_alu = nir_instr_as_alu(child);
|
| nir_opt_comparison_pre.c | 340 nir_block *child = block->dom_children[i]; local
342 if (comparison_pre_block(child, bq, bld))
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/rasterizer/common/ |
| rdtsc_buckets.h | 129 BUCKET& child = bt.pCurrent->children[id]; local
130 child.pParent = bt.pCurrent;
131 child.id = id;
132 child.start = tsc;
135 bt.pCurrent = &child;
185 BUCKET& child = bt.pCurrent->children[id];
186 child.pParent = bt.pCurrent;
187 child.id = id;
188 child.count += count;
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| dag.h | 36 struct dag_node *child; member in struct:dag_edge
55 void dag_add_edge(struct dag_node *parent, struct dag_node *child, void *data);
|
| dag.c | 28 * Adds a directed edge from the parent node to the child.
31 * list may contain multiple edges to the same child with different data.
34 dag_add_edge(struct dag_node *parent, struct dag_node *child, void *data)
37 if (edge->child == child && edge->data == data)
40 /* Remove the child as a DAG head. */
41 list_delinit(&child->link);
44 .child = child,
49 child->parent_count++
64 struct dag_node *child = edge->child; local
[all...] |
| slab.h | 27 * Objects are allocated from "child" pools that are connected to a "parent"
30 * Calls to slab_alloc/slab_free for the same child pool must not occur from
33 * Allocations obtained from one child pool should usually be freed in the
34 * same child pool. Freeing an allocation in a different child pool associated
39 * functions around a single parent-child pair.
84 struct slab_child_pool child; member in struct:slab_mempool
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_lower_to_source_mods.c | 162 nir_instr *child = child_src->parent_instr; local
163 if (child->type != nir_instr_type_alu) {
168 nir_alu_instr *child_alu = nir_instr_as_alu(child);
|
| nir_opt_comparison_pre.c | 336 nir_block *child = block->dom_children[i]; local
338 if (comparison_pre_block(child, bq, bld))
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/swr/rasterizer/common/ |
| rdtsc_buckets.h | 139 BUCKET& child = bt.pCurrent->children[id]; local
140 child.pParent = bt.pCurrent;
141 child.id = id;
142 child.start = tsc;
145 bt.pCurrent = &child;
195 BUCKET& child = bt.pCurrent->children[id];
196 child.pParent = bt.pCurrent;
197 child.id = id;
198 child.count += count;
|
| /xsrc/external/mit/xdm/dist/xdm/ |
| reset.c | 62 int child; local
68 for (child = 0; child < nchildren; child++) {
69 Debug ("XKillClient 0x%lx\n", (unsigned long)children[child]);
70 XKillClient (dpy, children[child]);
|
| /xsrc/external/mit/xorg-server/dist/hw/xfree86/loader/ |
| loaderProcs.h | 59 struct module_desc *child; member in struct:module_desc
|
| /xsrc/external/mit/xorg-server.old/dist/hw/xfree86/loader/ |
| loaderProcs.h | 59 struct module_desc *child; member in struct:module_desc
|
| /xsrc/external/mit/MesaGLUT/dist/src/glut/glx/ |
| win32_winproc.c | 29 GLUTwindow* child; local
41 update the visibility for all the child windows. */
42 child = window->children;
43 while (child) {
44 updateWindowState(child, visState);
45 child = child->siblings;
107 window. Therefore, find out if we're in a child window and
108 call the child windows keyboard callback if we are. */
194 window. Therefore, find out if we're in a child window an
[all...] |
| glut_cmap.c | 299 GLUTwindow *child; local
333 child = window->children;
334 while (child) {
335 num = findColormaps(child, winlist, cmaplist, num, max);
336 child = child->siblings;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/ |
| optimize.c | 129 gpir_alu_node *child = gpir_node_to_alu(alu->children[0]); local
130 replace = child->children[0];
136 gpir_alu_node *child = gpir_node_to_alu(alu->children[0]); local
140 new->children[0] = child->children[0];
141 new->children[1] = child->children[1];
|
| /xsrc/external/mit/glu/dist/src/libtess/ |
| priorityq-heap.c | 101 long child; local
105 child = curr << 1;
106 if( child < pq->size && LEQ( h[n[child+1].handle].key,
107 h[n[child].handle].key )) {
108 ++child;
111 assert(child <= pq->max);
113 hChild = n[child].handle;
114 if( child > pq->size || LEQ( h[hCurr].key, h[hChild].key )) {
121 curr = child;
[all...] |
| /xsrc/external/mit/xorg-server/dist/test/ |
| list.c | 45 struct child { struct
75 struct child child[3]; local
76 struct child *c;
80 xorg_list_add(&child[0].node, &parent.children);
83 c = xorg_list_first_entry(&parent.children, struct child, node);
85 assert(memcmp(c, &child[0], sizeof(struct child)) == 0);
88 xorg_list_add(&child[1].node, &parent.children);
89 c = xorg_list_first_entry(&parent.children, struct child, node)
103 struct child child[3]; local
145 struct child child[2]; local
194 struct child child[3]; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/ |
| opt_rebalance_tree.cpp | 107 ir_expression *child = (ir_expression *)scanner->operands[1]; local
108 scanner->operands[1] = child->operands[1];
110 child->operands[1] = scanner->operands[0];
111 scanner->operands[0] = child;
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/ |
| opt_rebalance_tree.cpp | 107 ir_expression *child = (ir_expression *)scanner->operands[1]; local
108 scanner->operands[1] = child->operands[1];
110 child->operands[1] = scanner->operands[0];
111 scanner->operands[0] = child;
|
| /xsrc/external/mit/libXaw/dist/include/X11/Xaw/ |
| ViewportP.h | 83 Widget clip, child; /* The clipping and (scrolled) child widgets */ member in struct:_ViewportPart
99 Bool reparented; /* True if child has been re-parented */
|
