| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| ir3_dominance.c | 58 struct ir3_block *pred = block->predecessors[i]; local
60 if (pred->imm_dom) {
62 new_idom = intersect(pred, new_idom);
64 new_idom = pred;
|
| ir3_remove_unreachable.c | 98 struct ir3_block *pred = block->physical_predecessors[0]; local
101 if (pred->physical_successors[1] == block)
102 pred->physical_successors[1] = next;
104 pred->physical_successors[0] = next;
105 ir3_block_add_physical_predecessor(next, pred);
|
| ir3_liveness.c | 79 const struct ir3_block *pred = block->predecessors[i]; local
81 if (tmp_live[j] & ~live->live_out[pred->index][j])
83 live->live_out[pred->index][j] |= tmp_live[j];
93 if (!BITSET_TEST(live->live_out[pred->index], name)) {
95 BITSET_SET(live->live_out[pred->index], name);
101 const struct ir3_block *pred = block->physical_predecessors[i]; local
107 if (!BITSET_TEST(live->live_out[pred->index], name)) {
109 BITSET_SET(live->live_out[pred->index], name);
|
| ir3_delay.c | 308 bool soft, bool pred, bool mergedregs)
363 if (pred && block->data != block) {
367 struct ir3_block *pred = block->predecessors[i]; local
368 unsigned pred_delay = delay_calc_postra(pred, NULL, consumer, distance,
369 soft, pred, mergedregs);
|
| ir3_print.c | 445 mesa_log_stream_printf(stream, "pred: ");
447 struct ir3_block *pred = block->predecessors[i]; local
450 mesa_log_stream_printf(stream, "block%u", block_id(pred));
457 mesa_log_stream_printf(stream, "physical pred: ");
459 struct ir3_block *pred = block->physical_predecessors[i]; local
462 mesa_log_stream_printf(stream, "block%u", block_id(pred));
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sfn/ |
| sfn_instruction_cf.h | 47 IfInstruction(AluInstruction *pred);
48 const AluInstruction& pred() const {return *m_pred;} function in class:r600::IfInstruction
|
| /xsrc/external/mit/MesaLib/dist/src/intel/vulkan/ |
| anv_nir_lower_ubo_loads.c | 64 nir_ssa_def *pred; local
66 pred = nir_ilt(b, nir_imm_int(b, aligned_offset + i * 64 + 63),
69 pred = nir_imm_true(b);
75 data[i] = nir_load_global_const_block_intel(b, 16, addr, pred);
|
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_lower_gs_intrinsics.c | 169 nir_block *pred = (nir_block *) entry->key; local
170 b->cursor = nir_after_block_before_jump(pred);
|
| nir_dominance.c | 75 nir_block *pred = (nir_block *) entry->key; local
77 if (pred->imm_dom) {
79 new_idom = intersect(pred, new_idom);
81 new_idom = pred;
|
| nir_liveness.c | 111 /** Propagates the live in of succ across the edge to the live out of pred
118 * Returns true if updating live out of pred added anything
121 propagate_across_edge(nir_block *pred, nir_block *succ,
142 if (src->pred == pred) {
151 progress |= live[i] & ~pred->live_out[i];
152 pred->live_out[i] |= live[i];
222 nir_block *pred = (nir_block *)entry->key; local
223 if (propagate_across_edge(pred, block, &state))
224 nir_block_worklist_push_tail(&state.worklist, pred);
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/gp/ |
| value_regalloc.c | 106 gpir_node *pred = dep->pred; local
107 if (pred->vreg.last == node)
108 active[pred->value_reg] = NULL;
153 gpir_node *pred = dep->pred; local
154 printf(" %d/%d", pred->index, pred->value_reg);
|
| reduce_scheduler.c | 41 gpir_node *pred = dep->pred; local
43 if (pred->rsched.reg_pressure < 0)
44 schedule_calc_sched_info(pred);
46 int est = pred->rsched.est + 1;
50 float reg_weight = 1.0f - 1.0f / list_length(&pred->succ_list);
66 gpir_node *pred = dep->pred; local
67 reg[i++] = pred->rsched.reg_pressure;
138 gpir_node *pred = dep->pred local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_dominance.c | 77 nir_block *pred = (nir_block *) entry->key; local
79 if (pred->imm_dom) {
81 new_idom = intersect(pred, new_idom);
83 new_idom = pred;
|
| nir_liveness.c | 98 /** Propagates the live in of succ across the edge to the live out of pred
105 * Returns true if updating live out of pred added anything
108 propagate_across_edge(nir_block *pred, nir_block *succ,
129 if (src->pred == pred) {
138 progress |= live[i] & ~pred->live_out[i];
139 pred->live_out[i] |= live[i];
205 nir_block *pred = (nir_block *)entry->key; local
206 if (propagate_across_edge(pred, block, &state))
207 nir_block_worklist_push_tail(&state.worklist, pred);
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/etnaviv/ |
| etnaviv_compiler_nir_liveness.c | 109 propagate_across_edge(nir_block *pred, nir_block *succ,
114 progress |= succ->live_in[i] & ~pred->live_out[i];
115 pred->live_out[i] |= succ->live_in[i];
229 nir_block *pred = (nir_block *)entry->key; local
230 if (propagate_across_edge(pred, block, &state))
231 nir_block_worklist_push_tail(&state.worklist, pred);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/ |
| reduce_scheduler.c | 41 gpir_node *pred = dep->pred; local
43 if (pred->rsched.reg_pressure < 0)
44 schedule_calc_sched_info(pred);
46 int est = pred->rsched.est + 1;
50 float reg_weight = 1.0f - 1.0f / list_length(&pred->succ_list);
66 gpir_node *pred = dep->pred; local
67 reg[i++] = pred->rsched.reg_pressure;
145 gpir_node *pred = dep->pred local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/pp/ |
| scheduler.c | 37 ppir_instr *pred = dep->pred; local
39 if (pred->reg_pressure < 0)
40 ppir_schedule_calc_sched_info(pred);
42 if (instr->est < pred->est + 1)
43 instr->est = pred->est + 1;
45 float reg_weight = 1.0 - 1.0 / list_length(&pred->succ_list);
60 ppir_instr *pred = dep->pred; local
61 reg[i++] = pred->reg_pressure
134 ppir_instr *pred = dep->pred; local
[all...] |
| lower.c | 252 ppir_node *pred = src0->node; local
253 ppir_dep *dep = ppir_dep_for_pred(node, pred);
259 /* pred can be a register */
260 if (pred)
261 ppir_node_add_dep(move, pred, ppir_dep_src);
267 if (src1->node && src1->node == pred)
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/ |
| sb_psi_ops.cpp | 56 value* &pred = *I; local
57 if (pred) {
59 pred_val = pred;
61 assert(pred == pred_val);
135 a->pred = NULL;
147 value *pred = n.src[3]; local
151 value *sel = get_select_value_for_em(sh, pred);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/pp/ |
| node.c | 328 void ppir_node_add_dep(ppir_node *succ, ppir_node *pred)
331 if (succ->block != pred->block)
336 if (dep->pred == pred)
341 dep->pred = pred;
344 list_addtail(&dep->succ_link, &pred->succ_list);
379 dep->pred = new_pred;
412 ppir_node *pred = dep->pred; local
[all...] |
| node_to_instr.c | 191 /* merge pred mul and succ add in the same instr can save a reg
222 /* merge pred load_uniform into succ instr can save a reg
232 /* merge pred load_temp into succ instr can save a reg
292 ppir_node *pred = dep->pred; local
296 ppir_node_add_dep(move, pred);
334 ppir_node *pred = dep->pred; local
337 /* pred may already be processed by the previous pred
382 ppir_node *pred = dep->pred; local
[all...] |
| scheduler.c | 37 ppir_instr *pred = dep->pred; local
39 if (pred->reg_pressure < 0)
40 ppir_schedule_calc_sched_info(pred);
42 if (instr->est < pred->est + 1)
43 instr->est = pred->est + 1;
45 float reg_weight = 1.0 - 1.0 / list_length(&pred->succ_list);
60 ppir_instr *pred = dep->pred; local
61 reg[i++] = pred->reg_pressure
134 ppir_instr *pred = dep->pred; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/ |
| sb_psi_ops.cpp | 56 value* &pred = *I; local
57 if (pred) {
59 pred_val = pred;
61 assert(pred == pred_val);
135 a->pred = NULL;
147 value *pred = n.src[3]; local
151 value *sel = get_select_value_for_em(sh, pred);
|
| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_lower_phis.cpp | 72 size_t pred = block.linear_preds.size(); local
77 } else if (block.loop_nest_depth > state->loop_nest_depth || pred == 1 ||
81 assert(pred > 1);
92 std::vector<Operand> ops(pred);
93 for (unsigned i = 0; i < pred; i++)
111 create_instruction<Pseudo_instruction>(aco_opcode::p_linear_phi, Format::PSEUDO, pred, 1)};
112 for (unsigned i = 0; i < pred; i++)
260 for (unsigned pred : block->logical_preds)
262 state->all_preds_uniform && (program->blocks[pred].kind & block_kind_uniform);
282 unsigned pred = block->logical_preds[i] local
322 Block* pred = &program->blocks[block->logical_preds[i]]; local
[all...] |
| aco_ssa_elimination.cpp | 203 Block* pred = &ctx.program->blocks[block->linear_preds[i]]; local
204 pred->linear_succs[0] = succ_idx;
205 ctx.program->blocks[succ_idx].linear_preds[i] = pred->index;
207 Pseudo_branch_instruction& branch = pred->instructions.back()->branch();
224 Block& pred = ctx.program->blocks[block->linear_preds[0]];
226 Pseudo_branch_instruction& branch = pred.instructions.back()->branch();
263 pred.linear_succs[0] = pred.linear_succs[1];
264 pred.linear_succs[1] = succ.index;
275 for (unsigned i = 0; i < pred.linear_succs.size(); i++
[all...] |
