Searched refs:merge_node (Results 1 - 9 of 9) sorted by relevance
| /third_party/mesa3d/src/compiler/nir/ |
| H A D | nir_from_ssa.c | 106 * Each SSA definition is associated with a merge_node and the association
108 * in the merge_node structure. The merge_set stores a linked list of
122 } merge_node; typedef
138 foreach_list_typed(merge_node, node, node, &set->nodes) {
152 static merge_node *
166 merge_node *node = ralloc(state->dead_ctx, merge_node); in get_merge_node()
177 merge_nodes_interfere(merge_node *a, merge_node *b) in merge_nodes_interfere()
200 merge_node *a_nod in merge_merge_sets()
[all...] |
| /third_party/mesa3d/src/amd/compiler/ |
| H A D | aco_lower_to_cssa.cpp | 54 struct merge_node { struct
69 std::unordered_map<uint32_t, merge_node> merge_node_table; /* tempid -> merge node */
156 merge_node& node_a = ctx.merge_node_table[a.id()]; in defined_after()
157 merge_node& node_b = ctx.merge_node_table[b.id()]; in defined_after()
169 merge_node& node_a = ctx.merge_node_table[a.id()]; in dominates()
170 merge_node& node_b = ctx.merge_node_table[b.id()]; in dominates()
184 merge_node& node_var = ctx.merge_node_table[var.id()]; in intersects()
185 merge_node& node_parent = ctx.merge_node_table[parent.id()]; in intersects()
251 merge_node& node_var = ctx.merge_node_table[var.id()]; in interference()
262 merge_node in interference()
[all...] |
| /third_party/node/deps/v8/src/compiler/ |
| H A D | wasm-loop-peeling.cc | 59 Node* merge_node = in PeelWasmLoop() local
75 copier.map(use)->InputAt(0), merge_node); in PeelWasmLoop()
80 } else if (use != merge_node) { in PeelWasmLoop()
82 use->ReplaceInput(use_edge.index(), merge_node); in PeelWasmLoop()
|
| H A D | loop-unrolling.cc | 109 Node* merge_node = graph->NewNode(common->Merge(iteration_count), in UnrollLoop() local
132 phi_inputs[iteration_count] = merge_node; in UnrollLoop()
138 } else if (use != merge_node) { in UnrollLoop()
140 use->ReplaceInput(use_edge.index(), merge_node); in UnrollLoop()
|
| H A D | js-native-context-specialization.cc | 1491 Node* merge_node = in ReduceJSGetIterator() local
1494 exception_node, merge_node); in ReduceJSGetIterator()
1497 dead_node, exception_node, merge_node); in ReduceJSGetIterator()
1498 ReplaceWithValue(iterator_exception_node, phi, effect_phi, merge_node); in ReduceJSGetIterator()
1501 merge_node->ReplaceInput(0, iterator_exception_node); in ReduceJSGetIterator()
|
| /third_party/skia/third_party/externals/spirv-tools/source/opt/ |
| H A D | struct_cfg_analysis.cpp | 47 uint32_t merge_node; in AddBlocksInFunction() member
58 state[0].merge_node = 0; in AddBlocksInFunction()
67 if (block->id() == state.back().merge_node) { in AddBlocksInFunction()
81 new_state.merge_node = in AddBlocksInFunction()
110 merge_blocks_.Set(new_state.merge_node); in AddBlocksInFunction()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| H A D | struct_cfg_analysis.cpp | 47 uint32_t merge_node; in AddBlocksInFunction() member
58 state[0].merge_node = 0; in AddBlocksInFunction()
67 if (block->id() == state.back().merge_node) { in AddBlocksInFunction()
81 new_state.merge_node = in AddBlocksInFunction()
110 merge_blocks_.Set(new_state.merge_node); in AddBlocksInFunction()
|
| /third_party/spirv-tools/source/opt/ |
| H A D | struct_cfg_analysis.cpp | 46 uint32_t merge_node; in AddBlocksInFunction() member
57 state[0].merge_node = 0; in AddBlocksInFunction()
66 if (block->id() == state.back().merge_node) { in AddBlocksInFunction()
80 new_state.merge_node = in AddBlocksInFunction()
109 merge_blocks_.Set(new_state.merge_node); in AddBlocksInFunction()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| H A D | cord_rep_btree.cc | 605 CordRepBtree* merge_node = ops.BuildStack(dst, depth); in Merge() local
607 // If there is enough space in `merge_node` for all edges from `src`, add all in Merge()
609 // If `merge_node` does not have capacity for `src`, we rely on `Unwind` and in Merge()
613 if (merge_node->size() + src->size() <= kMaxCapacity) { in Merge()
614 result = merge_node->ToOpResult(ops.owned(depth)); in Merge()
|
Completed in 12 milliseconds