| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| ir3_remove_unreachable.c | 59 struct ir3_block *succ = block->successors[i]; local
60 if (!succ)
63 unsigned pred_idx = ir3_block_get_pred_index(succ, block);
68 bool swap_pred = pred_idx != succ->predecessors_count - 1;
70 foreach_instr (phi, &succ->instr_list) {
79 succ->predecessors[pred_idx] =
80 succ->predecessors[succ->predecessors_count - 1];
82 succ->predecessors_count--;
86 struct ir3_block *succ = block->physical_successors[i] local
[all...] |
| ir3_merge_regs.c | 403 struct ir3_block *succ = block->successors[i]; local
405 unsigned pred_idx = ir3_block_get_pred_index(succ, block);
408 foreach_instr (phi, &succ->instr_list) {
430 foreach_instr (phi, &succ->instr_list) {
456 foreach_instr (phi, &succ->instr_list) {
|
| ir3_legalize.c | 493 struct ir3_block *succ = old_target->successors[i]; local
494 ir3_block_remove_predecessor(succ, old_target);
|
| ir3_ra_validate.c | 348 struct ir3_block *succ = block->successors[i]; local
349 if (!succ)
352 merge_state(ctx, &ctx->block_reaching[succ->index], &ctx->reaching);
355 struct ir3_block *succ = block->physical_successors[i]; local
356 if (!succ)
358 progress |= merge_state_physical(ctx, &ctx->block_reaching[succ->index],
495 struct ir3_block *succ = block->successors[i]; local
496 if (!succ)
499 unsigned pred_idx = ir3_block_get_pred_index(succ, block);
500 foreach_instr (instr, &succ->instr_list)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| bir.c | 214 struct bi_block *succ = block->successors[0]; local
215 assert(succ->predecessors);
218 return (succ->predecessors->entries > 1);
|
| bi_ra.c | 137 bool succ = false; local
143 succ = true;
149 if (!succ) {
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/ |
| midgard_ra_pipeline.c | 140 bool succ = mir_pipeline_ins(ctx, block, bundle, 0, 0); local
141 mir_pipeline_ins(ctx, block, bundle, 1, succ);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/pp/ |
| liveness.c | 207 ppir_block *succ = block->successors[i]; local
208 if (!succ)
213 while (list_is_empty(&succ->instr_list)) {
214 assert(succ->successors[0] && !succ->successors[1]);
215 succ = succ->successors[0];
218 next_instr = list_first_entry(&succ->instr_list, ppir_instr, list);
|
| scheduler.c | 139 ppir_instr *succ = dep->succ; local
140 if (!succ->scheduled) {
|
| instr.c | 45 void ppir_instr_add_dep(ppir_instr *succ, ppir_instr *pred)
48 ppir_instr_foreach_pred(succ, dep) {
53 ppir_dep *dep = ralloc(succ, ppir_dep);
55 dep->succ = succ;
56 list_addtail(&dep->pred_link, &succ->pred_list);
189 ppir_node *succ = ppir_node_first_succ(node); local
191 for (int s = 0; s < ppir_node_get_src_num(succ); s++) {
192 src = ppir_node_get_src(succ, s);
|
| lower.c | 39 ppir_node *succ = ppir_node_first_succ(node); local
42 switch (succ->type) {
50 /* single succ can still have multiple references to this node */
51 for (int i = 0; i < ppir_node_get_src_num(succ); i++) {
52 ppir_src *src = ppir_node_get_src(succ, i);
111 ppir_node *succ = ppir_node_first_succ(node); local
112 switch (succ->type) {
115 /* single succ can still have multiple references to this node */
116 for (int i = 0; i < ppir_node_get_src_num(succ); i++) {
117 ppir_src *src = ppir_node_get_src(succ, i)
166 ppir_node *succ = ppir_node_first_succ(node); local
[all...] |
| node_to_instr.c | 54 ppir_node *succ = ppir_node_first_succ(node); local
55 assert(succ);
56 assert(succ->instr);
58 return ppir_instr_insert_node(succ->instr, node);
71 ppir_node *succ = ppir_node_first_succ(node);
72 assert(succ);
73 assert(succ->instr);
75 return ppir_instr_insert_node(succ->instr, node);
87 /* merge pred mul and succ add in the same instr can save a reg
92 ppir_node *succ = ppir_node_first_succ(node) local
136 ppir_node *succ = ppir_node_first_succ(node); local
182 ppir_node *succ = ppir_node_first_succ(move); local
291 ppir_node *succ = dep->succ; local
[all...] |
| regalloc.c | 353 ppir_node *succ = dep->succ; local
355 ppir_node_add_dep(succ, store_node, ppir_dep_src);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/gp/ |
| value_regalloc.c | 60 gpir_node *succ = dep->succ; local
61 gpir_load_node *load = gpir_node_create(succ->block, gpir_op_load_reg);
63 gpir_node_replace_child(succ, spill, &load->node);
64 list_addtail(&load->node.list, &succ->list);
66 /* only valid for succ already scheduled, succ not scheduled will
72 load->node.vreg.last = succ;
94 gpir_node *succ = dep->succ; local
[all...] |
| reduce_scheduler.c | 143 gpir_node *succ = dep->succ; local
144 if (!succ->rsched.scheduled) {
|
| lower.c | 191 gpir_node *succ = dep->succ; local
198 gpir_node *new = gpir_node_create(succ->block, node->op);
201 list_addtail(&new->list, &succ->list);
203 gpir_debug("lower load create %d from %d for succ %d\n",
204 new->index, node->index, succ->index);
215 gpir_node_replace_child(succ, node, new);
245 gpir_node *succ = dep->succ; local
246 if (succ->type != gpir_node_type_alu
[all...] |
| scheduler.c | 103 switch (dep->succ->op) {
118 assert(dep->succ->op == gpir_op_store_temp);
122 switch (dep->succ->op) {
141 assert(dep->succ->op == gpir_op_store_temp);
144 assert(dep->succ->op == gpir_op_store_reg);
147 assert(dep->succ->op == gpir_op_store_temp_load_off0 ||
148 dep->succ->op == gpir_op_store_temp_load_off1 ||
149 dep->succ->op == gpir_op_store_temp_load_off2);
201 switch (dep->succ->op) {
212 assert(dep->succ->op == gpir_op_store_temp)
252 gpir_node *succ = dep->succ; local
286 gpir_node *succ = dep->succ; local
304 gpir_node *succ = dep->succ; local
386 gpir_node *succ = dep->succ; local
422 gpir_node *succ = dep->succ; local
643 gpir_node *succ = dep->succ; local
658 gpir_node *succ = dep->succ; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/ |
| reduce_scheduler.c | 150 gpir_node *succ = dep->succ; local
151 if (!succ->rsched.scheduled) {
|
| lower.c | 94 gpir_node *succ = dep->succ; local
101 gpir_node *new = gpir_node_create(succ->block, node->op);
104 list_addtail(&new->list, &succ->list);
106 gpir_debug("lower load create %d from %d for succ %d\n",
107 new->index, node->index, succ->index);
115 gpir_node_replace_child(succ, node, new);
145 gpir_node *succ = dep->succ; local
146 if (succ->type != gpir_node_type_alu
[all...] |
| regalloc.c | 132 gpir_block *succ = block->successors[i]; local
133 if (!succ)
137 BITSET_WORD new = block->def_out[j] & ~succ->def_out[j];
139 succ->def_out[j] |= block->def_out[j];
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/pp/ |
| node_to_instr.c | 95 ppir_node *succ = dep->succ; local
96 assert(succ->type == ppir_node_type_alu);
98 if (!ppir_instr_insert_node(succ->instr, node)) {
117 ppir_node_replace_child(succ, node, move);
140 ppir_node *succ = dep->succ; local
144 node->instr = succ->instr;
148 if (succ->instr == node->instr)
152 if (succ->instr == dup->instr)
196 ppir_node *succ = ppir_node_first_succ(node); local
344 ppir_node *succ = dep->succ; local
[all...] |
| scheduler.c | 139 ppir_instr *succ = dep->succ; local
140 if (!succ->scheduled) {
|
| lower.c | 43 ppir_node *succ = dep->succ; local
45 if (succ->type != ppir_node_type_alu) {
63 ppir_node_replace_child(succ, node, move);
173 ppir_node *succ = dep->succ; local
174 if (succ->type == ppir_node_type_alu) {
175 ppir_alu_node *sa = ppir_node_to_alu(succ);
185 assert(succ->type == ppir_node_type_store);
186 ppir_store_node *ss = ppir_node_to_store(succ);
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_ssa_elimination.cpp | 225 Block& succ = ctx.program->blocks[block->linear_succs[0]]; local
228 branch.target[0] = succ.index;
229 branch.target[1] = succ.index;
231 branch.target[0] = succ.index;
232 } else if (branch.target[0] == succ.index) {
234 branch.target[1] = succ.index;
237 /* check if there is a fall-through path from block to succ */
238 bool falls_through = block->index < succ.index;
239 for (unsigned j = block->index + 1; falls_through && j < succ.index; j++) {
245 branch.target[1] = succ.index
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/panfrost/util/ |
| lcra.c | 177 bool succ = false; local
182 succ = lcra_test_linear(l, l->solutions, step);
184 if (succ) break;
187 if (succ) break;
191 if (!succ) {
|
