Home
last modified time | relevance | path

Searched refs:successor (Results 1 - 25 of 63) sorted by relevance

123

/third_party/mesa3d/src/intel/compiler/
H A Dbrw_cfg.cpp34 * blocks with successor/predecessor edges connecting them.
74 bblock_t::add_successor(void *mem_ctx, bblock_t *successor, in add_successor() argument
77 successor->parents.push_tail(::link(mem_ctx, this, kind)); in add_successor()
78 children.push_tail(::link(mem_ctx, successor, kind)); in add_successor()
290 * (which is represented as the "next" successor), or disabled (if it in cfg_t()
292 * iteration, which is represented as the "cur_while" successor). in cfg_t()
324 * end of the loop which is why the successor is not the top-level in cfg_t()
420 /* Remove block from all of its predecessors' successor lists. */ in remove_block()
421 foreach_list_typed_safe (bblock_link, successor, link, in remove_block()
423 if (block == successor in remove_block()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dcall_graph.cpp114 // in-degrees of their successors. A successor who's in-degree becomes zero in ComputeTopologicalOrderOfFunctions()
120 for (auto successor : GetDirectCallees(next)) { in ComputeTopologicalOrderOfFunctions()
121 assert(function_in_degree.at(successor) > 0 && in ComputeTopologicalOrderOfFunctions()
122 "The in-degree cannot be zero if the function is a successor."); in ComputeTopologicalOrderOfFunctions()
123 function_in_degree[successor] = function_in_degree.at(successor) - 1; in ComputeTopologicalOrderOfFunctions()
124 if (function_in_degree.at(successor) == 0) { in ComputeTopologicalOrderOfFunctions()
125 queue.push(successor); in ComputeTopologicalOrderOfFunctions()
H A Dtransformation_replace_branch_from_dead_block_with_exit.cpp95 // If the successor block has OpPhi instructions then arguments related to in Apply()
100 auto successor = ir_context->get_instr_block( in Apply() local
102 successor->ForEachPhiInst([block](opt::Instruction* phi_inst) { in Apply()
159 auto successor = ir_context->get_instr_block( in BlockIsSuitable() local
161 if (ir_context->cfg()->preds(successor->id()).size() < 2) { in BlockIsSuitable()
165 // from the |block| to its |successor|. in BlockIsSuitable()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dcall_graph.cpp114 // in-degrees of their successors. A successor who's in-degree becomes zero in ComputeTopologicalOrderOfFunctions()
120 for (auto successor : GetDirectCallees(next)) { in ComputeTopologicalOrderOfFunctions()
121 assert(function_in_degree.at(successor) > 0 && in ComputeTopologicalOrderOfFunctions()
122 "The in-degree cannot be zero if the function is a successor."); in ComputeTopologicalOrderOfFunctions()
123 function_in_degree[successor] = function_in_degree.at(successor) - 1; in ComputeTopologicalOrderOfFunctions()
124 if (function_in_degree.at(successor) == 0) { in ComputeTopologicalOrderOfFunctions()
125 queue.push(successor); in ComputeTopologicalOrderOfFunctions()
H A Dtransformation_replace_branch_from_dead_block_with_exit.cpp95 // If the successor block has OpPhi instructions then arguments related to in Apply()
100 auto successor = ir_context->get_instr_block( in Apply() local
102 successor->ForEachPhiInst([block](opt::Instruction* phi_inst) { in Apply()
159 auto successor = ir_context->get_instr_block( in BlockIsSuitable() local
161 if (ir_context->cfg()->preds(successor->id()).size() < 2) { in BlockIsSuitable()
165 // from the |block| to its |successor|. in BlockIsSuitable()
/third_party/spirv-tools/source/fuzz/
H A Dcall_graph.cpp114 // in-degrees of their successors. A successor who's in-degree becomes zero in ComputeTopologicalOrderOfFunctions()
120 for (auto successor : GetDirectCallees(next)) { in ComputeTopologicalOrderOfFunctions()
121 assert(function_in_degree.at(successor) > 0 && in ComputeTopologicalOrderOfFunctions()
122 "The in-degree cannot be zero if the function is a successor."); in ComputeTopologicalOrderOfFunctions()
123 function_in_degree[successor] = function_in_degree.at(successor) - 1; in ComputeTopologicalOrderOfFunctions()
124 if (function_in_degree.at(successor) == 0) { in ComputeTopologicalOrderOfFunctions()
125 queue.push(successor); in ComputeTopologicalOrderOfFunctions()
H A Dtransformation_replace_branch_from_dead_block_with_exit.cpp95 // If the successor block has OpPhi instructions then arguments related to in Apply()
100 auto successor = ir_context->get_instr_block( in Apply() local
102 successor->ForEachPhiInst([block](opt::Instruction* phi_inst) { in Apply()
159 auto successor = ir_context->get_instr_block( in BlockIsSuitable() local
161 if (ir_context->cfg()->preds(successor->id()).size() < 2) { in BlockIsSuitable()
165 // from the |block| to its |successor|. in BlockIsSuitable()
/third_party/mesa3d/src/panfrost/util/
H A Dpan_ir.c79 pan_block_add_successor(pan_block *block, pan_block *successor) in pan_block_add_successor() argument
82 assert(successor); in pan_block_add_successor()
90 if (block->successors[i] == successor) in pan_block_add_successor()
96 block->successors[i] = successor; in pan_block_add_successor()
97 _mesa_set_add(successor->predecessors, block); in pan_block_add_successor()
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-scheduler.cc113 // as successor of every instruction. in AddTerminator()
233 for (ScheduleGraphNode* successor : candidate->successors()) { in Schedule()
234 successor->DropUnscheduledPredecessor(); in Schedule()
235 successor->set_start_cycle( in Schedule()
236 std::max(successor->start_cycle(), cycle + candidate->latency())); in Schedule()
238 if (!successor->HasUnscheduledPredecessor()) { in Schedule()
239 ready_list.AddNode(successor); in Schedule()
400 for (ScheduleGraphNode* successor : node->successors()) { in ComputeTotalLatencies()
401 DCHECK_NE(-1, successor->total_latency()); in ComputeTotalLatencies()
402 if (successor in ComputeTotalLatencies()
[all...]
H A Dspill-placer.cc164 // non-deferred successor needs it.
168 // deferred successor needs it.
305 InstructionBlock* successor = code->InstructionBlockAt(successor_id); in FirstBackwardPass() local
307 if (successor->IsDeferred()) { in FirstBackwardPass()
383 // If only some of the predecessors require a spill, but some successor in ForwardPass()
410 InstructionBlock* successor = code->InstructionBlockAt(successor_id); in SecondBackwardPass() local
412 if (successor->IsDeferred()) { in SecondBackwardPass()
437 // Any deferred successor needing a spill is sufficient to make the in SecondBackwardPass()
454 InstructionBlock* successor = code->InstructionBlockAt(successor_id); in SecondBackwardPass() local
459 CommitSpill(vreg_numbers_[index_to_spill], block, successor); in SecondBackwardPass()
465 CommitSpill(int vreg, InstructionBlock* predecessor, InstructionBlock* successor) CommitSpill() argument
[all...]
/third_party/node/deps/v8/src/regexp/
H A Dregexp-dotprinter.cc193 RegExpNode* successor = that->on_success(); in VisitAssertion() local
194 os_ << " n" << that << " -> n" << successor << ";\n"; in VisitAssertion() local
195 Visit(successor); in VisitAssertion()
239 RegExpNode* successor = that->on_success(); in VisitAction() local
240 os_ << " n" << that << " -> n" << successor << ";\n"; in VisitAction() local
241 Visit(successor); in VisitAction()
/third_party/skia/third_party/externals/spirv-tools/source/reduce/
H A Dremove_selection_reduction_opportunity_finder.cpp87 // that has a successor that is not the merge block of this construct and not in CanOpSelectionMergeBeRemoved()
98 &divergent_successor_count](uint32_t successor) { in CanOpSelectionMergeBeRemoved()
100 if (seen_successors.find(successor) == seen_successors.end()) { in CanOpSelectionMergeBeRemoved()
101 seen_successors.insert(successor); in CanOpSelectionMergeBeRemoved()
103 if (merge_and_continue_blocks_from_loops.find(successor) == in CanOpSelectionMergeBeRemoved()
128 // The successor is not the merge block, nor a loop merge or in CanOpSelectionMergeBeRemoved()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/
H A Dremove_selection_reduction_opportunity_finder.cpp87 // that has a successor that is not the merge block of this construct and not in CanOpSelectionMergeBeRemoved()
98 &divergent_successor_count](uint32_t successor) { in CanOpSelectionMergeBeRemoved()
100 if (seen_successors.find(successor) == seen_successors.end()) { in CanOpSelectionMergeBeRemoved()
101 seen_successors.insert(successor); in CanOpSelectionMergeBeRemoved()
103 if (merge_and_continue_blocks_from_loops.find(successor) == in CanOpSelectionMergeBeRemoved()
128 // The successor is not the merge block, nor a loop merge or in CanOpSelectionMergeBeRemoved()
/third_party/spirv-tools/source/reduce/
H A Dremove_selection_reduction_opportunity_finder.cpp87 // that has a successor that is not the merge block of this construct and not in CanOpSelectionMergeBeRemoved()
98 &divergent_successor_count](uint32_t successor) { in CanOpSelectionMergeBeRemoved()
100 if (seen_successors.find(successor) == seen_successors.end()) { in CanOpSelectionMergeBeRemoved()
101 seen_successors.insert(successor); in CanOpSelectionMergeBeRemoved()
103 if (merge_and_continue_blocks_from_loops.find(successor) == in CanOpSelectionMergeBeRemoved()
128 // The successor is not the merge block, nor a loop merge or in CanOpSelectionMergeBeRemoved()
/third_party/node/deps/v8/src/compiler/
H A Dschedule.cc45 void BasicBlock::AddSuccessor(BasicBlock* successor) { in AddSuccessor() argument
46 successors_.push_back(successor); in AddSuccessor()
442 for (BasicBlock* const successor : from->successors()) { in MoveSuccessors()
443 to->AddSuccessor(successor); in MoveSuccessors()
444 for (BasicBlock*& predecessor : successor->predecessors()) { in MoveSuccessors()
502 for (BasicBlock const* successor : block->successors()) { in operator <<()
505 if (successor->rpo_number() == -1) { in operator <<()
506 os << "id:" << successor->id(); in operator <<()
508 os << "B" << successor->rpo_number(); in operator <<()
/third_party/python/Lib/
H A Dgraphlib.py21 # List of successor nodes. The list can contain duplicated elements as
22 # long as they're all reflected in the successor's npredecessors attribute.
154 This method unblocks any successor of each node in *nodes* for being returned
191 for successor in nodeinfo.successors:
192 successor_info = n2i[successor]
195 self._ready_nodes.append(successor)
215 # else go on to get next successor
223 # at least another successor.
/third_party/node/deps/v8/src/compiler/backend/arm64/
H A Dunwinding-info-writer-arm64.cc41 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock()
42 int successor_index = successor.ToInt(); in EndInstructionBlock()
/third_party/node/deps/v8/src/compiler/backend/x64/
H A Dunwinding-info-writer-x64.cc42 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock()
43 int successor_index = successor.ToInt(); in EndInstructionBlock()
/third_party/node/deps/v8/src/compiler/backend/arm/
H A Dunwinding-info-writer-arm.cc37 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock()
38 int successor_index = successor.ToInt(); in EndInstructionBlock()
/third_party/node/deps/v8/src/compiler/backend/ppc/
H A Dunwinding-info-writer-ppc.cc38 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock()
39 int successor_index = successor.ToInt(); in EndInstructionBlock()
/third_party/node/deps/v8/src/compiler/backend/s390/
H A Dunwinding-info-writer-s390.cc37 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock()
38 int successor_index = successor.ToInt(); in EndInstructionBlock()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dmem_pass.cpp426 auto successor = cfg()->block(label_id);
427 if (visited_blocks.count(successor) == 0) {
428 reachable_blocks.insert(successor);
429 worklist.push(successor);
430 visited_blocks.insert(successor);
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dmem_pass.cpp426 auto successor = cfg()->block(label_id);
427 if (visited_blocks.count(successor) == 0) {
428 reachable_blocks.insert(successor);
429 worklist.push(successor);
430 visited_blocks.insert(successor);
/third_party/spirv-tools/source/opt/
H A Dmem_pass.cpp429 auto successor = cfg()->block(label_id);
430 if (visited_blocks.count(successor) == 0) {
431 reachable_blocks.insert(successor);
432 worklist.push(successor);
433 visited_blocks.insert(successor);
/third_party/skia/third_party/externals/spirv-tools/tools/cfg/
H A Dbin_to_dot.cpp140 for (auto successor : successors) { in FlushBlock()
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock() local

Completed in 13 milliseconds

123