Lines Matching defs:node
46 /* Instruction this node represents */
95 struct sched_node *node = rzalloc(memctx, struct sched_node);
96 node->instr = I;
97 dag_init_node(dag, &node->dag);
104 add_dep(node, last_write[label_index(ctx, src)]);
110 add_dep(node, last_read[label_index(ctx, src)]);
119 add_dep(node, last_read[label_index(ctx, dest)]);
120 add_dep(node, last_write[label_index(ctx, dest)]);
122 last_write[label_index(ctx, dest)] = node;
130 last_read[label_index(ctx, src)] = node;
141 add_dep(node, memory_store);
142 memory_load = node;
155 add_dep(node, memory_store);
156 memory_load = node;
163 add_dep(node, memory_load);
164 add_dep(node, memory_store);
165 memory_store = node;
170 add_dep(node, memory_load);
171 add_dep(node, memory_store);
172 memory_load = node;
173 memory_store = node;
179 add_dep(node, coverage);
180 coverage = node;
185 add_dep(node, memory_store);
186 memory_store = node;
189 add_dep(node, coverage);
190 coverage = node;
196 add_dep(node, preload);
200 add_dep(node, coverage);
201 coverage = node;
204 add_dep(node, memory_load);
205 add_dep(node, memory_store);
206 memory_load = node;
207 memory_store = node;
209 preload = node;
235 unsigned node = bi_get_node(I->dest[d]);
237 if (node < max && live[node])
242 unsigned node = bi_get_node(I->src[src]);
243 if (node >= max)
250 if (bi_get_node(I->src[i]) == node) {
256 if (!dupe && !live[node])
312 struct sched_node *node = choose_instr(s);
313 pressure += calculate_pressure_delta(node->instr, s->live, s->max);
315 dag_prune_head(s->dag, &node->dag);
317 schedule[nr_ins++] = node;
318 bi_liveness_ins_update(s->live, node->instr, s->max);