Searched refs:node (Results 1 - 25 of 628) sorted by relevance

1234567891011>>

/xsrc/external/mit/xorg-server.old/dist/hw/dmx/doc/html/
H A Dnavtree.js150 function createIndent(o,domNode,node,level)
152 if (node.parentNode && node.parentNode.parentNode)
154 createIndent(o,domNode,node.parentNode,level+1);
157 if (level==0 && node.childrenData)
159 node.plus_img = imgNode;
160 node.expandToggle = document.createElement("a");
161 node.expandToggle.href = "javascript:void(0)";
162 node.expandToggle.onclick = function()
164 if (node
[all...]
/xsrc/external/mit/glu/dist/src/libtess/
H A Ddict.c63 DictNode *node, *next; local in function:dictDeleteDict
65 for( node = dict->head.next; node != &dict->head; node = next ) {
66 next = node->next;
67 memFree( node );
73 DictNode *dictInsertBefore( Dict *dict, DictNode *node, DictKey key ) argument
78 node = node->prev;
79 } while( node
94 dictDelete(Dict * dict,DictNode * node) argument
104 DictNode *node = &dict->head; local in function:dictSearch
[all...]
/xsrc/external/mit/MesaLib/dist/src/util/tests/
H A Ddag_test.cpp50 struct node: public dag_node { struct in inherits:dag_node
54 struct node &operator>>(struct node &child) {
63 struct node *node = static_cast<struct node *>(dag_node); local in function:output_cb
65 util_dynarray_append(output, int, node->val);
69 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes)
79 struct node node[(num_node
[all...]
/xsrc/external/mit/xorg-server/dist/hw/xquartz/xpr/
H A Dx-hook.c52 x_list *node, *cell; local in function:X_PFX
55 for (node = lst; node != NULL; node = node->next) {
56 cell = node->data;
61 for (node = to_delete; node != NULL; node = node
73 x_list *node; local in function:X_PFX
90 x_list *node; local in function:X_PFX
[all...]
/xsrc/external/mit/freetype/dist/src/cache/
H A Dftcmru.c29 FTC_MruNode node )
46 if ( cnode == node )
57 first->prev = node;
58 last->next = node;
59 node->next = first;
60 node->prev = last;
64 node->next = node;
65 node->prev = node;
28 FTC_MruNode_Prepend(FTC_MruNode * plist,FTC_MruNode node) argument
72 FTC_MruNode_Up(FTC_MruNode * plist,FTC_MruNode node) argument
121 FTC_MruNode_Remove(FTC_MruNode * plist,FTC_MruNode node) argument
206 FTC_MruNode first, node; local in function:FTC_MruList_Find
240 FTC_MruNode node = NULL; local in function:FTC_MruList_New
294 FTC_MruNode node; local in function:FTC_MruList_Lookup
307 FTC_MruList_Remove(FTC_MruList list,FTC_MruNode node) argument
330 FTC_MruNode first, node, next; local in function:FTC_MruList_RemoveSelection
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/
H A Dlower.c34 list_for_each_entry_safe(gpir_node, node, &block->node_list, list) {
35 if (node->op == gpir_op_const) {
36 if (gpir_node_is_root(node))
37 gpir_node_delete(node);
54 list_for_each_entry_safe(gpir_node, node, &block->node_list, list) {
55 if (node->op == gpir_op_const) {
56 gpir_const_node *c = gpir_node_to_const(node);
58 if (!gpir_node_is_root(node)) {
67 gpir_node_replace_succ(&load->node, node);
124 gpir_lower_neg(gpir_block * block,gpir_node * node) argument
172 gpir_lower_complex(gpir_block * block,gpir_node * node) argument
312 gpir_lower_eq_ne(gpir_block * block,gpir_node * node) argument
369 gpir_lower_abs(gpir_block * block,gpir_node * node) argument
388 gpir_lower_not(gpir_block * block,gpir_node * node) argument
417 gpir_lower_branch_uncond(gpir_block * block,gpir_node * node) argument
[all...]
H A Dscheduler.c106 * stores. Each input node on the ready list represents a live value register
111 * An input node is a "max node" if it has a use two cycles ago, which must be
112 * connected to a definition this cycle. Otherwise it may be a "next max node"
113 * if it will be a max node on the next instruction (i.e. it has a use at most
118 * rewritten to be uses of the move so that the original node returns to
121 * slots, we reserve a slot for each max node, so that we can connect a
123 * slot for every next-max node above 5, so that for the next instruction
124 * there are no more than 5 max nodes. When a max or next-max node gets
135 * of slots. So, thanks to the total input node restrictio
351 schedule_update_distance(gpir_node * node) argument
370 gpir_is_input_node(gpir_node * node) argument
382 gpir_get_slots_required(gpir_node * node) argument
465 gpir_get_max_start(gpir_node * node) argument
483 gpir_get_min_end(gpir_node * node) argument
501 gpir_sched_instr_has_load(gpir_instr * instr,gpir_node * node) argument
524 _try_place_node(sched_ctx * ctx,gpir_instr * instr,gpir_node * node) argument
604 schedule_try_place_node(sched_ctx * ctx,gpir_node * node,bool speculative) argument
655 create_replacement(sched_ctx * ctx,gpir_node * node,gpir_op op) argument
685 create_move(sched_ctx * ctx,gpir_node * node) argument
692 create_postlog2(sched_ctx * ctx,gpir_node * node) argument
722 _schedule_try_node(sched_ctx * ctx,gpir_node * node,bool speculative) argument
779 schedule_undo_node(sched_ctx * ctx,gpir_node * node) argument
796 schedule_try_node(sched_ctx * ctx,gpir_node * node,bool speculative) argument
824 get_available_regs(sched_ctx * ctx,gpir_node * node,int * min_index) argument
913 spill_node(sched_ctx * ctx,gpir_node * node,gpir_store_node * store) argument
964 used_by_store(gpir_node * node,gpir_instr * instr) argument
978 consuming_postlog2(gpir_node * node) argument
995 try_spill_node(sched_ctx * ctx,gpir_node * node) argument
1141 gpir_get_min_end_as_move(gpir_node * node) argument
1178 can_use_complex(gpir_node * node) argument
1300 for (gpir_node *node = LIST_ENTRY(gpir_node, ctx->ready_list.next, list); local in function:try_node
1343 place_move(sched_ctx * ctx,gpir_node * node) argument
1376 can_place_move(sched_ctx * ctx,gpir_node * node) argument
[all...]
H A Dinstr.c62 static bool gpir_instr_check_acc_same_op(gpir_instr *instr, gpir_node *node, int slot) argument
67 /* spill move case may get acc_node == node */
68 if (acc_node && acc_node != node &&
69 !gpir_codegen_acc_same_op(node->op, acc_node->op))
75 static int gpir_instr_get_consume_slot(gpir_instr *instr, gpir_node *node) argument
77 if (gpir_op_infos[node->op].may_consume_two_slots) {
78 gpir_node *acc_node = gpir_instr_get_the_other_acc_node(instr, node->sched.pos);
80 /* at this point node must have the same acc op with acc_node,
90 static bool gpir_instr_insert_alu_check(gpir_instr *instr, gpir_node *node) argument
92 if (!gpir_instr_check_acc_same_op(instr, node, nod
159 gpir_instr_remove_alu(gpir_instr * instr,gpir_node * node) argument
184 gpir_instr_insert_reg0_check(gpir_instr * instr,gpir_node * node) argument
208 gpir_instr_remove_reg0(gpir_instr * instr,gpir_node * node) argument
215 gpir_instr_insert_reg1_check(gpir_instr * instr,gpir_node * node) argument
234 gpir_instr_remove_reg1(gpir_instr * instr,gpir_node * node) argument
239 gpir_instr_insert_mem_check(gpir_instr * instr,gpir_node * node) argument
263 gpir_instr_remove_mem(gpir_instr * instr,gpir_node * node) argument
270 gpir_instr_insert_store_check(gpir_instr * instr,gpir_node * node) argument
370 gpir_instr_remove_store(gpir_instr * instr,gpir_node * node) argument
404 gpir_node *node = instr->slots[slot]; local in function:gpir_instr_spill_move
427 gpir_instr_slot_free(gpir_instr * instr,gpir_node * node) argument
453 gpir_instr_try_insert_node(gpir_instr * instr,gpir_node * node) argument
495 gpir_instr_remove_node(gpir_instr * instr,gpir_node * node) argument
565 gpir_node *node = instr->slots[j]; local in function:gpir_instr_print_prog
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/pp/
H A Dnode_to_instr.c28 static bool create_new_instr(ppir_block *block, ppir_node *node) argument
34 if (!ppir_instr_insert_node(instr, node))
41 * If a node has a pipeline dest, schedule it in the same instruction as its
48 static bool ppir_do_node_to_instr_try_insert(ppir_block *block, ppir_node *node) argument
50 ppir_dest *dest = ppir_node_get_dest(node);
53 assert(ppir_node_has_single_src_succ(node));
54 ppir_node *succ = ppir_node_first_succ(node);
58 return ppir_instr_insert_node(succ->instr, node);
61 switch (node->type) {
68 if (!ppir_node_has_single_src_succ(node))
78 ppir_do_one_node_to_instr(ppir_block * block,ppir_node * node) argument
218 ppir_node_score(ppir_node * node) argument
270 ppir_node *node = ppir_ready_list_pick_best(block, &ready_list); local in function:ppir_do_node_to_instr
325 ppir_node *node = instr->slots[i]; local in function:ppir_build_instr_dependency
[all...]
/xsrc/external/mit/glu/dist/src/libnurbs/internals/
H A Ddisplaylist.cc65 for( Dlnode *node = nodes; node; node = node->next ) local in function:DisplayList::play
66 if( node->work != 0 ) (nt->*node->work)( node->arg );
78 Dlnode *node = new(dlnodePool) Dlnode( work, arg, cleanup ); local in function:DisplayList::append
79 *lastNode = node;
80 lastNode = &(node
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Drb_tree.h31 /** A red-black tree node
33 * This struct represents a node in the red-black tree. This struct should
38 /** Parent and color of this node
47 /** Left child of this node, null for a leaf */
50 /** Right child of this node, null for a leaf */
54 /** Return the parent node of the given node or NULL if it is the root */
64 * to the root node with no other metadata.
80 /** Retrieve the data structure containing a node
84 * \param node
119 rb_tree_insert(struct rb_tree * T,struct rb_node * node,int (* cmp)(const struct rb_node *,const struct rb_node *)) argument
[all...]
H A Ddag.c28 * Adds a directed edge from the parent node to the child.
78 dag_prune_head(struct dag *dag, struct dag_node *node) argument
80 assert(!node->parent_count);
82 list_delinit(&node->link);
84 util_dynarray_foreach(&node->edges, struct dag_edge, edge) {
90 * Initializes DAG node (probably embedded in some other datastructure in the
94 dag_init_node(struct dag *dag, struct dag_node *node) argument
96 util_dynarray_init(&node->edges, dag);
97 list_addtail(&node->link, &dag->heads);
106 dag_traverse_bottom_up_node(struct dag_node *node, argument
127 dag_traverse_bottom_up(struct dag * dag,void (* cb)(struct dag_node * node,void * data),void * data) argument
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/gp/
H A Dscheduler.c34 * 2. convert the real reg read/write to GP load/store node, now all
39 * after step 3, node sequence is
43 * we should add a fake dependency of node 3 to node 2 like a
107 /* store must use alu node as input */
220 static void schedule_update_distance(gpir_node *node) argument
222 if (gpir_node_is_leaf(node)) {
223 node->sched.dist = 0;
227 gpir_node_foreach_pred(node, dep) {
234 if (node
280 gpir_get_max_start(gpir_node * node) argument
298 gpir_get_min_end(gpir_node * node) argument
316 gpir_sched_instr_has_load(gpir_instr * instr,gpir_node * node) argument
333 schedule_try_place_node(gpir_instr * instr,gpir_node * node) argument
364 schedule_create_move_node(gpir_node * node) argument
381 gpir_sched_node(gpir_instr * instr,gpir_node * node) argument
409 gpir_is_input_node(gpir_node * node) argument
418 gpir_get_min_scheduled_succ(gpir_node * node) argument
581 gpir_node *node = gpir_sched_instr_pass(instr, ready_list); local in function:schedule_one_instr
[all...]
H A Dinstr.c54 static bool gpir_instr_check_acc_same_op(gpir_instr *instr, gpir_node *node, int slot) argument
59 /* spill move case may get acc_node == node */
60 if (acc_node && acc_node != node &&
61 !gpir_codegen_acc_same_op(node->op, acc_node->op))
67 static int gpir_instr_get_consume_slot(gpir_instr *instr, gpir_node *node) argument
69 if (gpir_op_infos[node->op].may_consume_two_slots) {
70 gpir_node *acc_node = gpir_instr_get_the_other_acc_node(instr, node->sched.pos);
72 /* at this point node must have the same acc op with acc_node,
82 static bool gpir_instr_insert_alu_check(gpir_instr *instr, gpir_node *node) argument
84 if (!gpir_instr_check_acc_same_op(instr, node, nod
118 gpir_instr_remove_alu(gpir_instr * instr,gpir_node * node) argument
134 gpir_instr_insert_reg0_check(gpir_instr * instr,gpir_node * node) argument
158 gpir_instr_remove_reg0(gpir_instr * instr,gpir_node * node) argument
165 gpir_instr_insert_reg1_check(gpir_instr * instr,gpir_node * node) argument
184 gpir_instr_remove_reg1(gpir_instr * instr,gpir_node * node) argument
189 gpir_instr_insert_mem_check(gpir_instr * instr,gpir_node * node) argument
213 gpir_instr_remove_mem(gpir_instr * instr,gpir_node * node) argument
220 gpir_instr_insert_store_check(gpir_instr * instr,gpir_node * node) argument
295 gpir_instr_remove_store(gpir_instr * instr,gpir_node * node) argument
321 gpir_node *node = instr->slots[slot]; local in function:gpir_instr_spill_move
344 gpir_instr_slot_free(gpir_instr * instr,gpir_node * node) argument
370 gpir_instr_try_insert_node(gpir_instr * instr,gpir_node * node) argument
409 gpir_instr_remove_node(gpir_instr * instr,gpir_node * node) argument
468 gpir_node *node = instr->slots[j]; local in function:gpir_instr_print_prog
[all...]
H A Dvalue_regalloc.c27 /* Linear scan register alloc for value reg alloc of each node */
36 /* spill farest node */
44 gpir_debug("value regalloc spill node %d for value reg %d\n",
47 /* create store node for spilled node */
52 store->node.value_reg = spill->value_reg;
53 list_addtail(&store->node.list, &spill->list);
62 gpir_node_replace_pred(dep, &load->node);
63 gpir_node_replace_child(succ, spill, &load->node);
64 list_addtail(&load->node
[all...]
H A Dreduce_scheduler.c34 static void schedule_calc_sched_info(gpir_node *node) argument
40 gpir_node_foreach_pred(node, dep) {
47 if (node->rsched.est < est)
48 node->rsched.est = est;
59 node->rsched.reg_pressure = 0;
65 gpir_node_foreach_pred(node, dep) {
83 if (pressure > node->rsched.reg_pressure)
84 node->rsched.reg_pressure = pressure;
87 /* If all children of this node have multi parents, then this
88 * node nee
129 gpir_node *node = list_first_entry(ready_list, gpir_node, list); local in function:schedule_ready_list
[all...]
/xsrc/external/mit/MesaLib/dist/src/util/
H A Ddag.c28 * Adds a directed edge from the parent node to the child.
78 dag_prune_head(struct dag *dag, struct dag_node *node) argument
80 assert(!node->parent_count);
82 list_delinit(&node->link);
84 util_dynarray_foreach(&node->edges, struct dag_edge, edge) {
90 * Initializes DAG node (probably embedded in some other datastructure in the
94 dag_init_node(struct dag *dag, struct dag_node *node) argument
96 util_dynarray_init(&node->edges, dag);
97 list_addtail(&node->link, &dag->heads);
106 dag_traverse_bottom_up_node(struct dag_node *node, argument
165 dag_traverse_bottom_up(struct dag * dag,void (* cb)(struct dag_node * node,void * data),void * data) argument
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/cso_cache/
H A Dcso_hash.h62 struct cso_node *node; member in struct:cso_hash_iter
124 struct cso_node *cso_hash_data_next(struct cso_node *node);
129 return !iter.node || iter.node == iter.hash->end;
135 if (!iter.node || iter.hash->end == iter.node)
137 return iter.node->value;
143 struct cso_node **node; local in function:cso_hash_find_node
146 node = &hash->buckets[akey % hash->numBuckets];
147 assert(*node
[all...]
/xsrc/external/bsd/libuuid_ul/dist/
H A Dunparse.c52 uuid.node[0], uuid.node[1], uuid.node[2],
53 uuid.node[3], uuid.node[4], uuid.node[5]);
/xsrc/external/mit/xkeyboard-config/dist/rules/
H A Dxml2lst.pl63 local ($node, $attrvalue);
66 foreach $node (@{$nodelist}) {
67 $attrvalue = node_attribute($node, $attr);
69 return $node;
73 foreach $node (@{$nodelist}) {
74 if (! defined node_attribute($node, $attr)) {
75 return $node;
110 if (defined ($node = open_tag($parent, $tag))) {
112 $parent = $node;
144 my %node;
[all...]
/xsrc/external/mit/xorg-server.old/dist/hw/xquartz/xpr/
H A Dx-hook.c53 x_list *node, *cell; local in function:X_PFX
56 for (node = lst; node != NULL; node = node->next)
58 cell = node->data;
63 for (node = to_delete; node != NULL; node = node
77 x_list *node, *cell; local in function:X_PFX
112 x_list *node; local in function:X_PFX
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/pp/
H A Dnode_to_instr.c28 static bool create_new_instr(ppir_block *block, ppir_node *node) argument
34 if (!ppir_instr_insert_node(instr, node))
57 /* Create move node */
87 static bool insert_to_each_succ_instr(ppir_block *block, ppir_node *node) argument
89 ppir_dest *dest = ppir_node_get_dest(node);
94 ppir_node_foreach_succ_safe(node, dep) {
98 if (!ppir_instr_insert_node(succ->instr, node)) {
99 /* create a move node to insert for failed node */
106 move->index, node
186 ppir_do_node_to_instr(ppir_block * block,ppir_node * node) argument
379 ppir_node *node = instr->slots[i]; local in function:ppir_build_instr_dependency
[all...]
/xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
H A DsearchTree.h44 void TreeNodeDeleteSingleNode(treeNode* node);
45 void TreeNodeDeleteWholeTree(treeNode* node);
46 void TreeNodePrint(treeNode* node,
49 treeNode* TreeNodeMinimum(treeNode* node);
50 treeNode* TreeNodeMaximum(treeNode* node);
51 treeNode* TreeNodePredecessor(treeNode* node);
52 treeNode* TreeNodeSuccessor(treeNode* node);
58 treeNode* TreeNodeDeleteSingleNode(treeNode* tree, treeNode* node);
H A DsearchTree.cc57 void TreeNodeDeleteSingleNode(treeNode* node) argument
59 free(node);
62 void TreeNodeDeleteWholeTree(treeNode* node) argument
64 if(node == NULL) return;
65 TreeNodeDeleteWholeTree(node->left);
66 TreeNodeDeleteWholeTree(node->right);
67 TreeNodeDeleteSingleNode(node);
70 void TreeNodePrint(treeNode* node, argument
73 if(node ==NULL) return;
74 TreeNodePrint(node
142 TreeNodeDeleteSingleNode(treeNode * tree,treeNode * node) argument
220 TreeNodeMinimum(treeNode * node) argument
232 TreeNodeMaximum(treeNode * node) argument
244 TreeNodeSuccessor(treeNode * node) argument
266 TreeNodePredecessor(treeNode * node) argument
[all...]
/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_control_flow.h51 /** puts a control flow node where the cursor is */
52 void nir_cf_node_insert(nir_cursor cursor, nir_cf_node *node);
54 /** puts a control flow node immediately after another control flow node */
56 nir_cf_node_insert_after(nir_cf_node *node, nir_cf_node *after) argument
58 nir_cf_node_insert(nir_after_cf_node(node), after);
61 /** puts a control flow node immediately before another control flow node */
63 nir_cf_node_insert_before(nir_cf_node *node, nir_cf_node *before) argument
65 nir_cf_node_insert(nir_before_cf_node(node), befor
70 nir_cf_node_insert_begin(struct exec_list * list,nir_cf_node * node) argument
77 nir_cf_node_insert_end(struct exec_list * list,nir_cf_node * node) argument
167 nir_cf_node_remove(nir_cf_node * node) argument
[all...]

Completed in 23 milliseconds

1234567891011>>