Home
last modified time | relevance | path

Searched refs:succ (Results 1 - 25 of 133) sorted by relevance

123456

/third_party/mesa3d/src/gallium/drivers/lima/ir/pp/
H A Dnode_to_instr.c54 ppir_node *succ = ppir_node_first_succ(node); in ppir_do_node_to_instr_try_insert() local
55 assert(succ); in ppir_do_node_to_instr_try_insert()
56 assert(succ->instr); in ppir_do_node_to_instr_try_insert()
58 return ppir_instr_insert_node(succ->instr, node); in ppir_do_node_to_instr_try_insert()
66 ppir_node *succ = ppir_node_first_succ(node); in ppir_do_node_to_instr_try_insert() local
67 assert(succ); in ppir_do_node_to_instr_try_insert()
68 assert(succ->instr); in ppir_do_node_to_instr_try_insert()
70 return ppir_instr_insert_node(succ->instr, node); in ppir_do_node_to_instr_try_insert()
83 ppir_node *succ = ppir_node_first_succ(node); in ppir_do_node_to_instr_try_insert()
84 assert(succ); in ppir_do_node_to_instr_try_insert()
105 ppir_node *succ = ppir_node_first_succ(node); ppir_do_one_node_to_instr() local
149 ppir_node *succ = ppir_node_first_succ(node); ppir_do_one_node_to_instr() local
195 ppir_node *succ = ppir_node_first_succ(move); ppir_do_one_node_to_instr() local
309 ppir_node *succ = dep->succ; ppir_do_node_to_instr() local
[all...]
H A Dliveness.c216 ppir_block *succ = block->successors[i]; in ppir_liveness_compute_live_sets() local
217 if (!succ) in ppir_liveness_compute_live_sets()
222 while (list_is_empty(&succ->instr_list)) { in ppir_liveness_compute_live_sets()
223 assert(succ->successors[0] && !succ->successors[1]); in ppir_liveness_compute_live_sets()
224 succ = succ->successors[0]; in ppir_liveness_compute_live_sets()
227 next_instr = list_first_entry(&succ->instr_list, ppir_instr, list); in ppir_liveness_compute_live_sets()
H A Dinstr.c45 void ppir_instr_add_dep(ppir_instr *succ, ppir_instr *pred) in ppir_instr_add_dep() argument
48 ppir_instr_foreach_pred(succ, dep) { in ppir_instr_add_dep()
53 ppir_dep *dep = ralloc(succ, ppir_dep); in ppir_instr_add_dep()
55 dep->succ = succ; in ppir_instr_add_dep()
56 list_addtail(&dep->pred_link, &succ->pred_list); in ppir_instr_add_dep()
190 ppir_node *succ = ppir_node_first_succ(node); in ppir_instr_insert_node() local
191 for (int s = 0; s < ppir_node_get_src_num(succ); s++) { in ppir_instr_insert_node()
192 ppir_src *src = ppir_node_get_src(succ, s); in ppir_instr_insert_node()
H A Dlower.c39 ppir_node *succ = ppir_node_first_succ(node); in ppir_lower_const() local
42 switch (succ->type) { in ppir_lower_const()
50 /* single succ can still have multiple references to this node */ in ppir_lower_const()
51 for (int i = 0; i < ppir_node_get_src_num(succ); i++) { in ppir_lower_const()
52 ppir_src *src = ppir_node_get_src(succ, i); in ppir_lower_const()
111 ppir_node *succ = ppir_node_first_succ(node); in ppir_lower_load() local
112 switch (succ->type) { in ppir_lower_load()
115 /* single succ can still have multiple references to this node */ in ppir_lower_load()
116 for (int i = 0; i < ppir_node_get_src_num(succ); i++) { in ppir_lower_load()
117 ppir_src *src = ppir_node_get_src(succ, in ppir_lower_load()
166 ppir_node *succ = ppir_node_first_succ(node); ppir_lower_texture() local
[all...]
H A Dnode.c392 void ppir_node_add_dep(ppir_node *succ, ppir_node *pred, in ppir_node_add_dep() argument
396 if (succ->block != pred->block) { in ppir_node_add_dep()
402 ppir_node_foreach_pred(succ, dep) { in ppir_node_add_dep()
407 ppir_dep *dep = ralloc(succ, ppir_dep); in ppir_node_add_dep()
409 dep->succ = succ; in ppir_node_add_dep()
411 list_addtail(&dep->pred_link, &succ->pred_list); in ppir_node_add_dep()
498 ppir_node_replace_child(dep->succ, src, dst); in ppir_node_replace_all_succ()
H A Dscheduler.c135 ppir_instr *succ = dep->succ; in ppir_schedule_ready_list() local
136 if (!succ->scheduled) { in ppir_schedule_ready_list()
/third_party/mesa3d/src/freedreno/ir3/
H A Dir3_remove_unreachable.c59 struct ir3_block *succ = block->successors[i]; in delete_block() local
60 if (!succ) in delete_block()
63 unsigned pred_idx = ir3_block_get_pred_index(succ, block); in delete_block()
68 bool swap_pred = pred_idx != succ->predecessors_count - 1; in delete_block()
70 foreach_instr (phi, &succ->instr_list) { in delete_block()
79 succ->predecessors[pred_idx] = in delete_block()
80 succ->predecessors[succ->predecessors_count - 1]; in delete_block()
82 succ->predecessors_count--; in delete_block()
86 struct ir3_block *succ in delete_block() local
[all...]
H A Dir3_ra_validate.c348 struct ir3_block *succ = block->successors[i]; in propagate_block() local
349 if (!succ) in propagate_block()
352 merge_state(ctx, &ctx->block_reaching[succ->index], &ctx->reaching); in propagate_block()
355 struct ir3_block *succ = block->physical_successors[i]; in propagate_block() local
356 if (!succ) in propagate_block()
358 progress |= merge_state_physical(ctx, &ctx->block_reaching[succ->index], in propagate_block()
495 struct ir3_block *succ = block->successors[i]; in check_reaching_block() local
496 if (!succ) in check_reaching_block()
499 unsigned pred_idx = ir3_block_get_pred_index(succ, block); in check_reaching_block()
500 foreach_instr (instr, &succ in check_reaching_block()
[all...]
H A Dir3_lower_subgroups.c208 link_blocks_physical(struct ir3_block *pred, struct ir3_block *succ, in link_blocks_physical() argument
211 pred->physical_successors[index] = succ; in link_blocks_physical()
212 ir3_block_add_physical_predecessor(succ, pred); in link_blocks_physical()
216 link_blocks(struct ir3_block *pred, struct ir3_block *succ, unsigned index) in link_blocks() argument
218 pred->successors[index] = succ; in link_blocks()
219 ir3_block_add_predecessor(succ, pred); in link_blocks()
220 link_blocks_physical(pred, succ, index); in link_blocks()
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dscheduler.c249 switch (dep->succ->op) { in gpir_get_min_dist()
269 assert(dep->succ->op == gpir_op_store_temp); in gpir_get_min_dist()
273 if (dep->succ->op == gpir_op_load_temp && in gpir_get_min_dist()
276 } else if (dep->succ->op == gpir_op_load_reg && in gpir_get_min_dist()
282 dep->succ->op == gpir_op_load_uniform) { in gpir_get_min_dist()
332 switch (dep->succ->op) { in gpir_get_max_dist()
343 assert(dep->succ->op == gpir_op_store_temp); in gpir_get_max_dist()
407 assert(dep->succ->sched.instr); in verify_ready_list()
413 unscheduled |= !(dep->succ->sched.instr); in verify_ready_list()
434 gpir_node *succ in schedule_insert_ready_list() local
471 gpir_node *succ = dep->succ; gpir_get_max_start() local
489 gpir_node *succ = dep->succ; gpir_get_min_end() local
705 gpir_node *succ = other_dep->succ; pred_almost_ready() local
1145 gpir_node *succ = dep->succ; gpir_get_min_end_as_move() local
1184 gpir_node *succ = dep->succ; can_use_complex() local
1358 gpir_node *succ = dep->succ; place_move() local
1443 gpir_node *succ = dep->succ; sched_move() local
1625 gpir_node *succ = dep->succ; schedule_build_dependency() local
[all...]
H A Dnode.c333 gpir_dep *gpir_node_add_dep(gpir_node *succ, gpir_node *pred, int type) in gpir_node_add_dep() argument
336 if (succ->block != pred->block) in gpir_node_add_dep()
340 if (succ == pred) in gpir_node_add_dep()
344 gpir_node_foreach_pred(succ, dep) { in gpir_node_add_dep()
353 gpir_dep *dep = ralloc(succ, gpir_dep); in gpir_node_add_dep()
356 dep->succ = succ; in gpir_node_add_dep()
357 list_addtail(&dep->pred_link, &succ->pred_list); in gpir_node_add_dep()
362 void gpir_node_remove_dep(gpir_node *succ, gpir_node *pred) in gpir_node_remove_dep() argument
364 gpir_node_foreach_pred(succ, de in gpir_node_remove_dep()
[all...]
H A Dlower.c94 gpir_node *succ = dep->succ; in gpir_lower_load() local
101 gpir_node *new = gpir_node_create(succ->block, node->op); in gpir_lower_load()
104 list_addtail(&new->list, &succ->list); in gpir_lower_load()
106 gpir_debug("lower load create %d from %d for succ %d\n", in gpir_lower_load()
107 new->index, node->index, succ->index); in gpir_lower_load()
115 gpir_node_replace_child(succ, node, new); in gpir_lower_load()
145 gpir_node *succ = dep->succ; in gpir_lower_neg() local
146 if (succ in gpir_lower_neg()
[all...]
/third_party/node/deps/v8/src/compiler/backend/
H A Dframe-elider.cc50 for (RpoNumber& succ : block->successors()) { in MarkDeConstruction()
51 if (!InstructionBlockAt(succ)->needs_frame()) { in MarkDeConstruction()
68 for (RpoNumber& succ : block->successors()) { in MarkDeConstruction()
69 if (InstructionBlockAt(succ)->needs_frame()) { in MarkDeConstruction()
71 InstructionBlockAt(succ)->mark_must_construct_frame(); in MarkDeConstruction()
124 for (RpoNumber& succ : block->successors()) { in PropagateIntoBlock()
125 InstructionBlock* successor_block = InstructionBlockAt(succ); in PropagateIntoBlock()
/third_party/mesa3d/src/amd/compiler/
H A Daco_ssa_elimination.cpp226 Block& succ = ctx.program->blocks[block->linear_succs[0]]; in try_remove_simple_block() local
229 branch.target[0] = succ.index; in try_remove_simple_block()
230 branch.target[1] = succ.index; in try_remove_simple_block()
232 branch.target[0] = succ.index; in try_remove_simple_block()
233 } else if (branch.target[0] == succ.index) { in try_remove_simple_block()
235 branch.target[1] = succ.index; in try_remove_simple_block()
238 /* check if there is a fall-through path from block to succ */ in try_remove_simple_block()
239 bool falls_through = block->index < succ.index; in try_remove_simple_block()
240 for (unsigned j = block->index + 1; falls_through && j < succ.index; j++) { in try_remove_simple_block()
246 branch.target[1] = succ in try_remove_simple_block()
[all...]
/third_party/mesa3d/src/panfrost/util/
H A Dlcra.c177 bool succ = false; in lcra_solve() local
182 succ = lcra_test_linear(l, l->solutions, step); in lcra_solve()
184 if (succ) break; in lcra_solve()
187 if (succ) break; in lcra_solve()
191 if (!succ) { in lcra_solve()
/third_party/vk-gl-cts/framework/platform/lnx/X11/
H A DtcuLnxX11.cpp126 bool succ = false; in getVisualInfo() local
133 succ = true; in getVisualInfo()
138 return succ; in getVisualInfo()
181 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); in XlibWindow() local
183 TCU_CHECK_INTERNAL(succ); in XlibWindow()
/third_party/mesa3d/src/broadcom/compiler/
H A Dvir_live_variables.c214 vir_for_each_successor(succ, block) { in vir_live_variables_dataflow()
216 BITSET_WORD new_live_out = (succ->live_in[i] & in vir_live_variables_dataflow()
253 vir_for_each_successor(succ, block) { in vir_live_variables_defin_defout_dataflow()
256 ~succ->defin[i]); in vir_live_variables_defin_defout_dataflow()
257 succ->defin[i] |= new_def; in vir_live_variables_defin_defout_dataflow()
258 succ->defout[i] |= new_def; in vir_live_variables_defin_defout_dataflow()
/third_party/mesa3d/src/panfrost/bifrost/valhall/
H A Dva_insert_flow.c306 bi_foreach_successor(blk, succ) in va_assign_scoreboard()
307 bi_worklist_push_tail(&worklist, succ); in va_assign_scoreboard()
323 bi_block *succ = block->successors[i]; in va_should_end() local
325 if (succ) in va_should_end()
372 bi_foreach_successor(pred, succ) { in va_discard_before_block()
373 if (succ->pass_flags) in va_discard_before_block()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddominator_tree.cpp189 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap()
192 this->successors_[succ].push_back(&bb); in CreateSuccessorMap()
193 pred_list.push_back(succ); in CreateSuccessorMap()
210 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap()
211 succ_list.push_back(succ); in CreateSuccessorMap()
212 predecessors_[succ].push_back(&bb); in CreateSuccessorMap()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddominator_tree.cpp189 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap()
192 this->successors_[succ].push_back(&bb); in CreateSuccessorMap()
193 pred_list.push_back(succ); in CreateSuccessorMap()
210 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap()
211 succ_list.push_back(succ); in CreateSuccessorMap()
212 predecessors_[succ].push_back(&bb); in CreateSuccessorMap()
/third_party/spirv-tools/source/opt/
H A Ddominator_tree.cpp176 BasicBlock* succ = context->get_instr_block(successor_id); in CreateSuccessorMap()
179 this->successors_[succ].push_back(&bb); in CreateSuccessorMap()
180 pred_list.push_back(succ); in CreateSuccessorMap()
197 BasicBlock* succ = context->get_instr_block(successor_id); in CreateSuccessorMap()
198 succ_list.push_back(succ); in CreateSuccessorMap()
199 predecessors_[succ].push_back(&bb); in CreateSuccessorMap()
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_opt_dce.c40 bi_foreach_successor(block, succ) { in bi_opt_dead_code_eliminate()
42 live[i] |= succ->live_in[i]; in bi_opt_dead_code_eliminate()
105 bi_foreach_successor(blk, succ) in bi_postra_liveness_block()
106 blk->reg_live_out |= succ->reg_live_in; in bi_postra_liveness_block()
H A Dbi_validate.c115 bool succ = true; in bi_validate_width() local
138 succ = false; in bi_validate_width()
149 return succ; in bi_validate_width()
/third_party/node/deps/v8/src/compiler/
H A Dscheduler.cc602 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) { in TraceConnect() argument
604 if (succ == nullptr) { in TraceConnect()
609 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt()); in TraceConnect()
824 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); in ComputeAndInsertSpecialRPO() local
825 if (succ->rpo_number() == kBlockVisited1) continue; in ComputeAndInsertSpecialRPO()
826 if (succ->rpo_number() == kBlockOnStack) { in ComputeAndInsertSpecialRPO()
829 if (!HasLoopNumber(succ)) { in ComputeAndInsertSpecialRPO()
831 SetLoopNumber(succ, num_loops++); in ComputeAndInsertSpecialRPO()
835 DCHECK_EQ(kBlockUnvisited1, succ->rpo_number()); in ComputeAndInsertSpecialRPO()
836 stack_depth = Push(stack_depth, succ, kBlockUnvisited in ComputeAndInsertSpecialRPO()
865 BasicBlock* succ = nullptr; ComputeAndInsertSpecialRPO() local
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_liveness.c98 /** Propagates the live in of succ across the edge to the live out of pred
108 propagate_across_edge(nir_block *pred, nir_block *succ, in propagate_across_edge() argument
112 memcpy(live, succ->live_in, state->bitset_words * sizeof *live); in propagate_across_edge()
114 nir_foreach_instr(instr, succ) { in propagate_across_edge()
123 nir_foreach_instr(instr, succ) { in propagate_across_edge()

Completed in 19 milliseconds

123456