| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| D | LabelFlowAnalyzer.java | 48 boolean successor = false; field in LabelFlowAnalyzer
87 successor = opcode != Opcodes.GOTO; in visitJumpInsn()
96 if (successor) { in visitLabel()
125 successor = false; in visitSwitchInsn()
148 successor = false; in visitInsn()
151 successor = true; in visitInsn()
159 successor = true; in visitIntInsn()
165 successor = true; in visitVarInsn()
171 successor = true; in visitTypeInsn()
178 successor = true; in visitFieldInsn()
[all …]
|
| D | LabelInfo.java | 33 private boolean successor = false; field in LabelInfo
57 if (info.target || info.successor) { in setTarget()
73 info.successor = true; in setSuccessor()
107 return info == null ? false : info.successor; in isSuccessor()
143 return info != null && info.successor in needsProbe()
|
| /external/llvm-project/mlir/lib/Dialect/LLVMIR/Transforms/ |
| D | LegalizeForExport.cpp | 24 Block *successor = terminator->getSuccessor(i); in ensureDistinctSuccessors() local
27 if (successor->getNumArguments() == 0) in ensureDistinctSuccessors()
29 successorPositions[successor].push_back(i); in ensureDistinctSuccessors()
39 for (const auto &successor : successorPositions) { in ensureDistinctSuccessors() local
41 for (int position : llvm::drop_begin(successor.second, 1)) { in ensureDistinctSuccessors()
44 dummyBlock->addArguments(successor.first->getArgumentTypes()); in ensureDistinctSuccessors()
46 dummyBlock->getArguments(), successor.first); in ensureDistinctSuccessors()
|
| /external/e2fsprogs/intl/ |
| D | finddomain.c | 102 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) in _nl_find_domain()
104 if (retval->successor[cnt]->decided == 0) in _nl_find_domain()
105 _nl_load_domain (retval->successor[cnt], domainbinding); in _nl_find_domain()
107 if (retval->successor[cnt]->data != NULL) in _nl_find_domain()
156 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt) in _nl_find_domain()
158 if (retval->successor[cnt]->decided == 0) in _nl_find_domain()
159 _nl_load_domain (retval->successor[cnt], domainbinding); in _nl_find_domain()
160 if (retval->successor[cnt]->data != NULL) in _nl_find_domain()
|
| /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/ |
| D | LabelFlowAnalyzerTest.java | 42 assertFalse(analyzer.successor); in testInit()
258 analyzer.successor = !expected; in testInsn()
261 assertTrue(expected == analyzer.successor); in testInsn()
273 assertTrue(analyzer.successor); in testIntInsn()
280 assertTrue(analyzer.successor); in testVarInsn()
287 assertTrue(analyzer.successor); in testTypeInsn()
293 analyzer.successor = false; in testFieldInsn()
295 assertTrue(analyzer.successor); in testFieldInsn()
309 assertTrue(analyzer.successor); in testMethodInsn()
318 assertTrue(analyzer.successor); in testInvokeDynamicInsn()
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | CompactLinkedHashSet.java | 112 @NullableDecl private transient int[] successor; field in CompactLinkedHashSet
139 this.successor = new int[expectedSize]; in allocArrays()
148 this.successor = null; in convertToHashFloodingResistantImplementation()
158 return successor[entry] - 1; in getSuccessor()
162 successor[entry] = succ + 1; in setSuccessor()
201 successor[srcIndex] = 0; in moveLastEntry()
208 successor = Arrays.copyOf(successor, newCapacity); in resizeEntries()
240 Arrays.fill(successor, 0, size(), 0); in clear()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | CompactLinkedHashSet.java | 114 private transient int @Nullable [] successor; field in CompactLinkedHashSet
141 this.successor = new int[expectedSize]; in allocArrays()
150 this.successor = null; in convertToHashFloodingResistantImplementation()
160 return successor[entry] - 1; in getSuccessor()
164 successor[entry] = succ + 1; in setSuccessor()
203 successor[srcIndex] = 0; in moveLastEntry()
210 successor = Arrays.copyOf(successor, newCapacity); in resizeEntries()
247 Arrays.fill(successor, 0, size(), 0); in clear()
|
| /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/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/tensorflow/tensorflow/compiler/mlir/tensorflow/transforms/ |
| D | merge_control_flow.cc | 97 for (auto* successor : side_effect_analysis.DirectControlSuccessors(&op)) { in SafeToMerge() local
98 if (!source_ops.contains(successor)) dependencies.push_back(successor); in SafeToMerge()
102 for (auto* successor : side_effect_analysis.DirectControlSuccessors(&op)) { in SafeToMerge() local
103 if (!source_ops.contains(successor)) dependencies.push_back(successor); in SafeToMerge()
123 for (auto* successor : in SafeToMerge() local
125 if (source_ops.contains(successor)) { in SafeToMerge()
129 dependencies.push_back(successor); in SafeToMerge()
183 for (Operation* successor : in MoveResultsAfter()
185 if (!source_op->isProperAncestor(successor)) queue.push(successor); in MoveResultsAfter()
|
| /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 | 101 auto successor = ir_context->get_instr_block( in Apply() local
103 successor->ForEachPhiInst([block](opt::Instruction* phi_inst) { in Apply()
160 auto successor = ir_context->get_instr_block( in BlockIsSuitable() local
162 if (ir_context->cfg()->preds(successor->id()).size() < 2) { in BlockIsSuitable()
|
| /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 | 101 auto successor = ir_context->get_instr_block( in Apply() local
103 successor->ForEachPhiInst([block](opt::Instruction* phi_inst) { in Apply()
160 auto successor = ir_context->get_instr_block( in BlockIsSuitable() local
162 if (ir_context->cfg()->preds(successor->id()).size() < 2) { in BlockIsSuitable()
|
| /external/llvm-project/mlir/include/mlir/Interfaces/ |
| D | ControlFlowInterfaces.td | 33 successor at the given index. Returns None if the operands to the
34 successor are non-materialized values, i.e. they are internal to the
42 successor at the given index. Returns None if the operands to the
43 successor are non-materialized values, i.e. they are internal to the
55 some successor, or None if `operandIndex` isn't a successor operand
71 Returns the successor that would be chosen with the given constant
72 operands. Returns nullptr if a single successor could not be chosen.
106 entering the region at `index`, which was specified as a successor of this
108 with the successor inputs specified in `getSuccessorRegions`.
125 operation as a successor. This method allows for describing which
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | hlo_module_group_util.cc | 128 auto add_unique_successor = [&](HloInstruction* successor) { in GlobalSuccessors() argument
129 if (unique.find(successor) != unique.end()) { in GlobalSuccessors()
132 if (metadata_.IsCompanionInstruction(successor)) { in GlobalSuccessors()
133 for (HloInstruction* instr : metadata_.Companions(successor)) { in GlobalSuccessors()
140 if (successor->IsCrossModuleAllReduce()) { in GlobalSuccessors()
142 metadata_.GetAllReduceGroup(*successor->channel_id())) { in GlobalSuccessors()
149 unique.insert(successor); in GlobalSuccessors()
150 successors.push_back(successor); in GlobalSuccessors()
375 for (HloInstruction* successor : GlobalSuccessors(item)) { in UpdateReachabilityThroughInstruction()
376 worklist.push(successor); in UpdateReachabilityThroughInstruction()
|
| /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/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/llvm-project/openmp/runtime/src/ |
| D | kmp_taskdeps.h | 123 kmp_depnode_t *successor = p->node; in __kmp_release_deps() local
124 kmp_int32 npredecessors = KMP_ATOMIC_DEC(&successor->dn.npredecessors) - 1; in __kmp_release_deps()
130 if (successor->dn.task) { in __kmp_release_deps()
133 gtid, successor->dn.task, task)); in __kmp_release_deps()
134 __kmp_omp_task(gtid, successor->dn.task, false); in __kmp_release_deps()
|
| /external/llvm-project/clang/test/PCH/ |
| D | delayed-template-parsing.cpp | 11 T successor(T Value) { return Value + 1; } in successor() function
13 int x = successor(42);
|
| /external/llvm-project/llvm/test/CodeGen/AArch64/ |
| D | ccmp-successor-probs.mir | 3 # This test checks that successor probabilties are properly updated after a
6 # CHECK-LABEL: name: aarch64-ccmp-successor-probs
11 name: aarch64-ccmp-successor-probs
|
| /external/llvm-project/mlir/test/mlir-tblgen/ |
| D | op-format-spec.td | 382 // CHECK: error: expected variable to refer to an argument, region, result, or successor
402 // CHECK: error: successor 'successor' is already bound
404 $successor $successor attr-dict
406 let successors = (successor AnySuccessor:$successor);
408 // CHECK: error: successor 'successor' is already bound
410 successors $successor attr-dict
412 let successors = (successor AnySuccessor:$successor);
487 // CHECK: error: successor #0, named 'successor', not found
488 // CHECK: note: suggest adding a '$successor' directive to the custom assembly format
492 let successors = (successor AnySuccessor:$successor);
|