| /third_party/boost/boost/icl/type_traits/ |
| D | succ_pred.hpp | 24 struct successor;
27 struct successor<DomainT, true> struct
29 typedef successor type; argument
34 struct successor<DomainT, false> struct
36 typedef successor type; argument
60 struct successor struct
64 return detail::successor in apply()
|
| /third_party/gettext/gettext-runtime/intl/ |
| D | finddomain.c | 120 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) in _nl_find_domain()
122 if (retval->successor[cnt]->decided <= 0) in _nl_find_domain()
123 _nl_load_domain (retval->successor[cnt], domainbinding); in _nl_find_domain()
125 if (retval->successor[cnt]->data != NULL) in _nl_find_domain()
188 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) in _nl_find_domain()
190 if (retval->successor[cnt]->decided <= 0) in _nl_find_domain()
191 _nl_load_domain (retval->successor[cnt], domainbinding); in _nl_find_domain()
192 if (retval->successor[cnt]->data != NULL) in _nl_find_domain()
|
| D | l10nflist.c | 321 retval->successor[entries++] in _nl_make_l10nflist()
329 retval->successor[entries++] in _nl_make_l10nflist()
338 retval->successor[entries] = NULL; in _nl_make_l10nflist()
|
| D | loadinfo.h | 74 struct loaded_l10nfile *successor[1]; member
|
| /third_party/mesa3d/src/intel/compiler/ |
| D | brw_cfg.cpp | 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()
421 foreach_list_typed_safe (bblock_link, successor, link, in remove_block()
423 if (block == successor->block) { in remove_block()
424 successor->link.remove(); in remove_block()
425 ralloc_free(successor); in remove_block()
430 foreach_list_typed (bblock_link, successor, link, &block->children) { in remove_block()
431 if (!successor->block->is_successor_of(predecessor->block, in remove_block()
432 successor->kind)) { in remove_block()
[all …]
|
| /third_party/mesa3d/src/panfrost/util/ |
| D | pan_ir.c | 79 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/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | call_graph.cpp | 120 for (auto successor : GetDirectCallees(next)) { in ComputeTopologicalOrderOfFunctions() local
121 assert(function_in_degree.at(successor) > 0 && 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()
|
| D | transformation_replace_branch_from_dead_block_with_exit.cpp | 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()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| D | call_graph.cpp | 120 for (auto successor : GetDirectCallees(next)) { in ComputeTopologicalOrderOfFunctions() local
121 assert(function_in_degree.at(successor) > 0 && 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()
|
| D | transformation_replace_branch_from_dead_block_with_exit.cpp | 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()
|
| /third_party/spirv-tools/source/fuzz/ |
| D | call_graph.cpp | 120 for (auto successor : GetDirectCallees(next)) { in ComputeTopologicalOrderOfFunctions() local
121 assert(function_in_degree.at(successor) > 0 && 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()
|
| D | transformation_replace_branch_from_dead_block_with_exit.cpp | 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()
|
| /third_party/spirv-tools/source/reduce/ |
| D | remove_selection_reduction_opportunity_finder.cpp | 98 &divergent_successor_count](uint32_t successor) { in CanOpSelectionMergeBeRemoved() argument
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()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/ |
| D | remove_selection_reduction_opportunity_finder.cpp | 98 &divergent_successor_count](uint32_t successor) { in CanOpSelectionMergeBeRemoved() argument
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()
|
| /third_party/skia/third_party/externals/spirv-tools/source/reduce/ |
| D | remove_selection_reduction_opportunity_finder.cpp | 98 &divergent_successor_count](uint32_t successor) { in CanOpSelectionMergeBeRemoved() argument
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()
|
| /third_party/boost/libs/graph/doc/ |
| D | transitive_closure.w | 35 \keyword{successor set} of a vertex $v$, denoted by $Succ(v)$, is the
38 the successor set of $v$ in the original graph $G$. Computing the
39 transitive closure is equivalent to computing the successor set for
42 All vertices in the same strong component have the same successor set
44 component). Therefore, it is redundant to compute the successor set
270 successor set for a vertex $u$, the successor set for each vertex in
271 $Adj[u]$ has already been computed. The successor set for a vertex $u$
272 can then be constructed by taking the union of the successor sets for
288 topological number. A successor set $S$ is then represented by a
297 Computing the union of two successor sets, $S_3 = S_1 \cup S_2$, can
[all …]
|
| /third_party/python/Lib/ |
| D | graphlib.py | 189 for successor in nodeinfo.successors:
190 successor_info = n2i[successor]
193 self._ready_nodes.append(successor)
|
| /third_party/spirv-tools/source/opt/ |
| D | mem_pass.cpp | 427 auto successor = cfg()->block(label_id); in RemoveUnreachableBlocks() local
428 if (visited_blocks.count(successor) == 0) { in RemoveUnreachableBlocks()
429 reachable_blocks.insert(successor); in RemoveUnreachableBlocks()
430 worklist.push(successor); in RemoveUnreachableBlocks()
431 visited_blocks.insert(successor); in RemoveUnreachableBlocks()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| D | mem_pass.cpp | 426 auto successor = cfg()->block(label_id); in RemoveUnreachableBlocks() local
427 if (visited_blocks.count(successor) == 0) { in RemoveUnreachableBlocks()
428 reachable_blocks.insert(successor); in RemoveUnreachableBlocks()
429 worklist.push(successor); in RemoveUnreachableBlocks()
430 visited_blocks.insert(successor); in RemoveUnreachableBlocks()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | mem_pass.cpp | 426 auto successor = cfg()->block(label_id); in RemoveUnreachableBlocks() local
427 if (visited_blocks.count(successor) == 0) { in RemoveUnreachableBlocks()
428 reachable_blocks.insert(successor); in RemoveUnreachableBlocks()
429 worklist.push(successor); in RemoveUnreachableBlocks()
430 visited_blocks.insert(successor); in RemoveUnreachableBlocks()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/tools/cfg/ |
| D | bin_to_dot.cpp | 140 for (auto successor : successors) { in FlushBlock() local
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock()
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/tools/cfg/ |
| D | bin_to_dot.cpp | 140 for (auto successor : successors) { in FlushBlock() local
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock()
|
| /third_party/skia/third_party/externals/spirv-tools/tools/cfg/ |
| D | bin_to_dot.cpp | 140 for (auto successor : successors) { in FlushBlock() local
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock()
|
| /third_party/spirv-tools/tools/cfg/ |
| D | bin_to_dot.cpp | 140 for (auto successor : successors) { in FlushBlock() local
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock()
|
| /third_party/boost/libs/graph_parallel/doc/ |
| D | strong_components.rst | 143 vertex set, the successor set (the vertices reached in the forward
146 of the predecessor and successor sets form a strongly connected
151 strongly connected component, the vertices in the successor set not
153 initial vertex set not in the predecessor or successor sets. Once
|