Home
last modified time | relevance | path

Searched refs:successor (Results 1 – 25 of 208) sorted by relevance

123456789

/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/
DLabelFlowAnalyzer.java48 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 …]
DLabelInfo.java32 private boolean successor = false; field in LabelInfo
56 if (info.target || info.successor) { in setTarget()
72 info.successor = true; in setSuccessor()
106 return info == null ? false : info.successor; in isSuccessor()
142 return info != null && info.successor in needsProbe()
/external/u-boot/include/linux/
Drbtree_augmented.h146 struct rb_node *successor = child, *child2; in __rb_erase_augmented() local
158 parent = successor; in __rb_erase_augmented()
159 child2 = successor->rb_right; in __rb_erase_augmented()
160 augment->copy(node, successor); in __rb_erase_augmented()
177 parent = successor; in __rb_erase_augmented()
178 successor = tmp; in __rb_erase_augmented()
181 parent->rb_left = child2 = successor->rb_right; in __rb_erase_augmented()
182 successor->rb_right = child; in __rb_erase_augmented()
183 rb_set_parent(child, successor); in __rb_erase_augmented()
184 augment->copy(node, successor); in __rb_erase_augmented()
[all …]
/external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/
DLabelFlowAnalyzerTest.java42 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/e2fsprogs/intl/
Dfinddomain.c102 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/mesa3d/src/intel/compiler/
Dbrw_cfg.cpp62 bblock_t::add_successor(void *mem_ctx, bblock_t *successor) in add_successor() argument
64 successor->parents.push_tail(::link(mem_ctx, this)); in add_successor()
65 children.push_tail(::link(mem_ctx, successor)); in add_successor()
399 foreach_list_typed_safe (bblock_link, successor, link, in remove_block()
401 if (block == successor->block) { in remove_block()
402 successor->link.remove(); in remove_block()
403 ralloc_free(successor); in remove_block()
408 foreach_list_typed (bblock_link, successor, link, &block->children) { in remove_block()
409 if (!successor->block->is_successor_of(predecessor->block)) { in remove_block()
411 successor->block)); in remove_block()
[all …]
/external/v8/src/compiler/
Dinstruction-scheduler.cc229 for (ScheduleGraphNode* successor : candidate->successors()) { in ScheduleBlock()
230 successor->DropUnscheduledPredecessor(); in ScheduleBlock()
231 successor->set_start_cycle( in ScheduleBlock()
232 std::max(successor->start_cycle(), in ScheduleBlock()
235 if (!successor->HasUnscheduledPredecessor()) { in ScheduleBlock()
236 ready_list.AddNode(successor); in ScheduleBlock()
379 for (ScheduleGraphNode* successor : node->successors()) { in ComputeTotalLatencies()
380 DCHECK_NE(-1, successor->total_latency()); in ComputeTotalLatencies()
381 if (successor->total_latency() > max_latency) { in ComputeTotalLatencies()
382 max_latency = successor->total_latency(); in ComputeTotalLatencies()
Dschedule.cc46 void BasicBlock::AddSuccessor(BasicBlock* successor) { in AddSuccessor() argument
47 successors_.push_back(successor); in AddSuccessor()
393 for (auto successor = pred->successors().begin(); in EnsureSplitEdgeForm() local
394 successor != pred->successors().end(); ++successor) { in EnsureSplitEdgeForm()
395 if (*successor == block) { in EnsureSplitEdgeForm()
396 *successor = split_edge_block; in EnsureSplitEdgeForm()
486 for (BasicBlock* const successor : from->successors()) { in MoveSuccessors()
487 to->AddSuccessor(successor); in MoveSuccessors()
488 for (BasicBlock*& predecessor : successor->predecessors()) { in MoveSuccessors()
548 for (BasicBlock const* successor : block->successors()) { in operator <<()
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/
Dhlo_module_group_util.cc128 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->all_reduce_id())) { in GlobalSuccessors()
149 unique.insert(successor); in GlobalSuccessors()
150 successors.push_back(successor); in GlobalSuccessors()
380 for (HloInstruction* successor : GlobalSuccessors(item)) { in UpdateReachabilityThroughInstruction()
381 worklist.push(successor); in UpdateReachabilityThroughInstruction()
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AArch64/
Dccmp-successor-probs.mir3 # 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/lzma/C/
DPpmd7.c358 CPpmd_Void_Ref successor; in CreateSuccessors() local
367 successor = SUCCESSOR(s); in CreateSuccessors()
368 if (successor != upBranch) in CreateSuccessors()
370 c = CTX(successor); in CreateSuccessors()
427 CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState); in UpdateModel() local
474 successor = REF(p->Text); in UpdateModel()
483 if (fSuccessor <= successor) in UpdateModel()
495 successor = fSuccessor; in UpdateModel()
501 SetSuccessor(p->FoundState, successor); in UpdateModel()
565 SetSuccessor(s, successor); in UpdateModel()
/external/swiftshader/third_party/LLVM/lib/Analysis/
DPathNumbering.cpp400 for(succ_iterator successor = succ_begin(currentBlock), in buildNode() local
401 succEnd = succ_end(currentBlock); successor != succEnd; in buildNode()
402 oldSuccessor = *successor, ++successor ) { in buildNode()
403 BasicBlock* succBB = *successor; in buildNode()
/external/guava/guava/src/com/google/common/collect/
DTreeMultiset.java126 successor(header, header); in TreeMultiset()
255 successor(header, newRoot, header); in add()
557 successor(this, right, succ);
566 successor(pred, left, this);
783 successor(pred, succ);
937 private static <T> void successor(AvlNode<T> a, AvlNode<T> b) {
942 private static <T> void successor(AvlNode<T> a, AvlNode<T> b, AvlNode<T> c) {
943 successor(a, b);
944 successor(b, c);
979 successor(header, header);
/external/deqp-deps/SPIRV-Tools/source/opt/
Dmem_pass.cpp412 auto successor = cfg()->block(label_id); in RemoveUnreachableBlocks() local
413 if (visited_blocks.count(successor) == 0) { in RemoveUnreachableBlocks()
414 reachable_blocks.insert(successor); in RemoveUnreachableBlocks()
415 worklist.push(successor); in RemoveUnreachableBlocks()
416 visited_blocks.insert(successor); in RemoveUnreachableBlocks()
/external/swiftshader/third_party/SPIRV-Tools/source/opt/
Dmem_pass.cpp412 auto successor = cfg()->block(label_id); in RemoveUnreachableBlocks() local
413 if (visited_blocks.count(successor) == 0) { in RemoveUnreachableBlocks()
414 reachable_blocks.insert(successor); in RemoveUnreachableBlocks()
415 worklist.push(successor); in RemoveUnreachableBlocks()
416 visited_blocks.insert(successor); in RemoveUnreachableBlocks()
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DTreeMultiset.java122 successor(header, header); in TreeMultiset()
251 successor(header, newRoot, header); in add()
553 successor(this, right, succ);
562 successor(pred, left, this);
779 successor(pred, succ);
933 private static <T> void successor(AvlNode<T> a, AvlNode<T> b) {
938 private static <T> void successor(AvlNode<T> a, AvlNode<T> b, AvlNode<T> c) {
939 successor(a, b);
940 successor(b, c);
/external/v8/src/compiler/arm/
Dunwinding-info-writer-arm.cc44 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock() local
45 int successor_index = successor.ToInt(); in EndInstructionBlock()
/external/v8/src/compiler/arm64/
Dunwinding-info-writer-arm64.cc45 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock() local
46 int successor_index = successor.ToInt(); in EndInstructionBlock()
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/SimplifyCFG/
Dindirectbr.ll53 ; remove it from entry's successor list.
127 ; destination is listed as a successor.
136 ; This needs to have more than one successor for this test, otherwise it gets
137 ; replaced with an unconditional branch to the single successor.
166 ; This needs to have more than one successor for this test, otherwise it gets
167 ; replaced with an unconditional branch to the single successor.
/external/llvm/test/Transforms/SimplifyCFG/
Dindirectbr.ll53 ; remove it from entry's successor list.
127 ; destination is listed as a successor.
136 ; This needs to have more than one successor for this test, otherwise it gets
137 ; replaced with an unconditional branch to the single successor.
166 ; This needs to have more than one successor for this test, otherwise it gets
167 ; replaced with an unconditional branch to the single successor.
/external/swiftshader/third_party/LLVM/test/Transforms/SimplifyCFG/
Dindirectbr.ll53 ; remove it from entry's successor list.
127 ; destination is listed as a successor.
136 ; This needs to have more than one successor for this test, otherwise it gets
137 ; replaced with an unconditional branch to the single successor.
166 ; This needs to have more than one successor for this test, otherwise it gets
167 ; replaced with an unconditional branch to the single successor.
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/
DMethodAnalyzer.java177 for (AnalyzedInstruction successor: startOfMethod.successors) { in analyze()
178 instructionsToAnalyze.set(successor.instructionIndex); in analyze()
220 for (AnalyzedInstruction successor: instructionToAnalyze.successors) { in analyze()
221 instructionsToAnalyze.set(successor.getInstructionIndex()); in analyze()
425 for (AnalyzedInstruction successor: instruction.successors) {
426 … if (successor.mergeRegister(registerNumber, postRegisterType, analyzedState, override)) {
427 changedInstructions.set(successor.instructionIndex);
549 @Nonnull AnalyzedInstruction successor,
552 … addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false);
556 @Nonnull AnalyzedInstruction successor,
[all …]
/external/v8/src/compiler/x64/
Dunwinding-info-writer-x64.cc49 for (const RpoNumber& successor : block->successors()) { in EndInstructionBlock() local
50 int successor_index = successor.ToInt(); in EndInstructionBlock()
/external/deqp-deps/SPIRV-Tools/tools/cfg/
Dbin_to_dot.cpp140 for (auto successor : successors) { in FlushBlock() local
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock()
/external/swiftshader/third_party/SPIRV-Tools/tools/cfg/
Dbin_to_dot.cpp140 for (auto successor : successors) { in FlushBlock() local
141 out_ << current_block_id_ << " -> " << successor << ";\n"; in FlushBlock()

123456789