| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| D | LabelFlowAnalyzer.java | 49 boolean successor = false; field in LabelFlowAnalyzer
88 successor = opcode != Opcodes.GOTO; in visitJumpInsn()
97 if (successor) { in visitLabel()
126 successor = false; in visitSwitchInsn()
149 successor = false; in visitInsn()
152 successor = true; in visitInsn()
160 successor = true; in visitIntInsn()
166 successor = true; in visitVarInsn()
172 successor = true; in visitTypeInsn()
179 successor = true; in visitFieldInsn()
[all …]
|
| D | LabelInfo.java | 34 private boolean successor = false; field in LabelInfo
58 if (info.target || info.successor) { in setTarget()
74 info.successor = true; in setSuccessor()
108 return info == null ? false : info.successor; in isSuccessor()
144 return info != null && info.successor in needsProbe()
|
| /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/ |
| D | LabelFlowAnalyzerTest.java | 43 assertFalse(analyzer.successor); in testInit()
260 analyzer.successor = !expected; in testInsn()
263 assertTrue(expected == analyzer.successor); in testInsn()
275 assertTrue(analyzer.successor); in testIntInsn()
282 assertTrue(analyzer.successor); in testVarInsn()
289 assertTrue(analyzer.successor); in testTypeInsn()
295 analyzer.successor = false; in testFieldInsn()
297 assertTrue(analyzer.successor); in testFieldInsn()
311 assertTrue(analyzer.successor); in testMethodInsn()
320 assertTrue(analyzer.successor); in testInvokeDynamicInsn()
[all …]
|
| /external/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()
419 foreach_list_typed_safe (bblock_link, successor, link, in remove_block()
421 if (block == successor->block) { in remove_block()
422 successor->link.remove(); in remove_block()
423 ralloc_free(successor); in remove_block()
428 foreach_list_typed (bblock_link, successor, link, &block->children) { in remove_block()
429 if (!successor->block->is_successor_of(predecessor->block, in remove_block()
430 successor->kind)) { in remove_block()
[all …]
|
| /external/ow2-asm/asm/src/main/java/org/objectweb/asm/ |
| D | Edge.java | 72 final Label successor; field in Edge
86 Edge(final int info, final Label successor, final Edge nextEdge) { in Edge() argument
88 this.successor = successor; in Edge()
|
| D | CurrentFrame.java | 52 Frame successor = new Frame(null); in execute() local
53 merge(symbolTable, successor, 0); in execute()
54 copyFrom(successor); in execute()
|
| D | Label.java | 563 subroutineCaller.outgoingEdges.successor, in addSubroutineRetSuccessors()
598 if (!isJsrTarget && outgoingEdge.successor.nextListElement == null) { in pushSuccessors()
601 outgoingEdge.successor.nextListElement = newListOfLabelsToProcess; in pushSuccessors()
602 newListOfLabelsToProcess = outgoingEdge.successor; in pushSuccessors()
|
| /external/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()
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/transforms/ |
| D | merge_control_flow.cc | 116 for (auto* successor : in SafeToMerge() local
118 if (!downstream_if_ops.contains(successor)) { in SafeToMerge()
119 dependencies.push_back(successor); in SafeToMerge()
123 for (auto* successor : side_effect_analysis.DirectControlSuccessors(&op)) { in SafeToMerge() local
124 if (!downstream_if_ops.contains(successor) && in SafeToMerge()
125 !destination_ops.contains(successor)) in SafeToMerge()
126 dependencies.push_back(successor); in SafeToMerge()
130 for (auto* successor : side_effect_analysis.DirectControlSuccessors(&op)) { in SafeToMerge() local
131 if (!downstream_if_ops.contains(successor) && in SafeToMerge()
132 !destination_ops.contains(successor)) in SafeToMerge()
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | CompactLinkedHashSet.java | 118 @CheckForNull private transient int[] successor; field in CompactLinkedHashSet
145 this.successor = new int[expectedSize]; in allocArrays()
154 this.successor = null; in convertToHashFloodingResistantImplementation()
220 successor = Arrays.copyOf(requireSuccessors(), newCapacity); in resizeEntries()
252 if (predecessor != null && successor != null) { in clear()
254 Arrays.fill(successor, 0, size(), 0); in clear()
269 return requireNonNull(successor); in requireSuccessors()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | CompactLinkedHashSet.java | 120 @CheckForNull private transient int[] successor; field in CompactLinkedHashSet
147 this.successor = new int[expectedSize]; in allocArrays()
156 this.successor = null; in convertToHashFloodingResistantImplementation()
222 successor = Arrays.copyOf(requireSuccessors(), newCapacity); in resizeEntries()
259 if (predecessor != null && successor != null) { in clear()
261 Arrays.fill(successor, 0, size(), 0); in clear()
276 return requireNonNull(successor); in requireSuccessors()
|
| /external/deqp-deps/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()
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/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()
|
| /external/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()
|
| /external/dagger2/java/dagger/internal/codegen/base/ |
| D | TarjanSCCs.java | 82 for (NodeT successor : successorsFunction.successors(node)) { in stronglyConnect()
83 if (!indexes.containsKey(successor)) { in stronglyConnect()
85 stronglyConnect(successor); in stronglyConnect()
86 lowLinks.put(node, min(lowLinks.get(node), lowLinks.get(successor))); in stronglyConnect()
87 } else if (onStack.contains(successor)) { in stronglyConnect()
89 lowLinks.put(node, min(lowLinks.get(node), indexes.get(successor))); in stronglyConnect()
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_module_group_util.cc | 127 auto add_unique_successor = [&](HloInstruction* successor) { in GlobalSuccessors() argument
128 if (unique.find(successor) != unique.end()) { in GlobalSuccessors()
131 if (metadata_.IsCompanionInstruction(successor)) { in GlobalSuccessors()
132 for (HloInstruction* instr : metadata_.Companions(successor)) { in GlobalSuccessors()
139 if (successor->IsCrossModuleAllReduce()) { in GlobalSuccessors()
141 metadata_.GetAllReduceGroup(*successor->channel_id())) { in GlobalSuccessors()
148 unique.insert(successor); in GlobalSuccessors()
149 successors.push_back(successor); in GlobalSuccessors()
375 for (HloInstruction* successor : GlobalSuccessors(item)) { in UpdateReachabilityThroughInstruction()
376 worklist.push(successor); in UpdateReachabilityThroughInstruction()
|
| /external/deqp-deps/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()
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/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()
|
| /external/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()
|
| /external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
| D | gpu_hlo_schedule.cc | 105 for (HloInstruction* successor : instr->control_successors()) { in PostprocessorToScheduleAsEarlyOrLateAsPossible()
106 if (ShouldScheduleSuccessor(*successor, is_scheduled)) { in PostprocessorToScheduleAsEarlyOrLateAsPossible()
107 add_to_schedule(successor); in PostprocessorToScheduleAsEarlyOrLateAsPossible()
|
| /external/guava/guava/src/com/google/common/graph/ |
| D | DirectedGraphConnections.java | 213 N successor = incidentEdge.nodeV(); in ofImmutable() local
214 V value = successorNodeToValueFn.apply(successor); in ofImmutable()
216 Object existingValue = adjacentNodeValues.put(successor, value); in ofImmutable()
219 adjacentNodeValues.put(successor, new PredAndSucc(value)); in ofImmutable()
222 orderedNodeConnectionsBuilder.add(new NodeConnection.Succ<>(successor)); in ofImmutable()
386 (N successor) -> EndpointPair.ordered(thisNode, successor)));
|
| /external/guava/android/guava/src/com/google/common/graph/ |
| D | DirectedGraphConnections.java | 213 N successor = incidentEdge.nodeV(); in ofImmutable() local
214 V value = successorNodeToValueFn.apply(successor); in ofImmutable()
216 Object existingValue = adjacentNodeValues.put(successor, value); in ofImmutable()
219 adjacentNodeValues.put(successor, new PredAndSucc(value)); in ofImmutable()
222 orderedNodeConnectionsBuilder.add(new NodeConnection.Succ<>(successor)); in ofImmutable()
386 (N successor) -> EndpointPair.ordered(thisNode, successor)));
|