| /external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/flow/ |
| LabelFlowAnalyzer.java | 23 * within a class. It calculates the properties "multitarget" and "successor"
45 * <code>true</code> if the current instruction is a potential successor of
48 boolean successor = false; field in class:LabelFlowAnalyzer
72 // the block already is successor of some other code, adding a target
87 successor = opcode != Opcodes.GOTO;
96 if (successor) {
125 successor = false;
148 successor = false;
151 successor = true;
159 successor = true
[all...] |
| LabelInfo.java | 32 private boolean successor = false; field in class:LabelInfo
56 if (info.target || info.successor) {
64 * Defines that the given label is the possible successor of the previous
72 info.successor = true;
95 * Checks whether this label is the possible successor of the previous
102 * successor
106 return info == null ? false : info.successor;
142 return info != null && info.successor
|
| /external/e2fsprogs/intl/ |
| finddomain.c | 102 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt)
104 if (retval->successor[cnt]->decided == 0)
105 _nl_load_domain (retval->successor[cnt], domainbinding);
107 if (retval->successor[cnt]->data != NULL)
156 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt)
158 if (retval->successor[cnt]->decided == 0)
159 _nl_load_domain (retval->successor[cnt], domainbinding);
160 if (retval->successor[cnt]->data != NULL)
|
| loadinfo.h | 76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
99 furthermore its ->successor[] field contains a list of other lookup
|
| /toolchain/binutils/binutils-2.25/intl/ |
| finddomain.c | 105 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt)
107 if (retval->successor[cnt]->decided == 0)
108 _nl_load_domain (retval->successor[cnt], domainbinding);
110 if (retval->successor[cnt]->data != NULL)
159 for (cnt = 0; retval->successor[cnt] != NULL; ++cnt)
161 if (retval->successor[cnt]->decided == 0)
162 _nl_load_domain (retval->successor[cnt], domainbinding);
163 if (retval->successor[cnt]->data != NULL)
|
| loadinfo.h | 84 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile
107 furthermore its ->successor[] field contains a list of other lookup
|
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 125 // as successor of every instruction.
223 for (ScheduleGraphNode* successor : candidate->successors()) {
224 successor->DropUnscheduledPredecessor();
225 successor->set_start_cycle(
226 std::max(successor->start_cycle(),
229 if (!successor->HasUnscheduledPredecessor()) {
230 ready_list.AddNode(successor);
350 for (ScheduleGraphNode* successor : node->successors()) {
351 DCHECK(successor->total_latency() != -1);
352 if (successor->total_latency() > max_latency)
[all...] |
| schedule.cc | 43 void BasicBlock::AddSuccessor(BasicBlock* successor) {
44 successors_.push_back(successor);
349 // Find a corresponding successor in the previous block, replace it
352 for (auto successor = pred->successors().begin();
353 successor != pred->successors().end(); ++successor) {
354 if (*successor == block) {
355 *successor = split_edge_block;
430 for (BasicBlock* const successor : from->successors()) {
431 to->AddSuccessor(successor);
[all...] |
| /external/jacoco/org.jacoco.core.test/src/org/jacoco/core/internal/flow/ |
| LabelFlowAnalyzerTest.java | 42 assertFalse(analyzer.successor);
258 analyzer.successor = !expected;
261 assertTrue(expected == analyzer.successor);
273 assertTrue(analyzer.successor);
280 assertTrue(analyzer.successor);
287 assertTrue(analyzer.successor);
293 analyzer.successor = false;
295 assertTrue(analyzer.successor);
309 assertTrue(analyzer.successor);
318 assertTrue(analyzer.successor);
[all...] |
| LabelInfoTest.java | 114 boolean methodinvocationline, boolean successor, boolean expected) {
122 if (successor) {
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_cfg.cpp | 33 * blocks with successor/predecessor edges connecting them.
62 bblock_t::add_successor(void *mem_ctx, bblock_t *successor)
64 successor->parents.push_tail(::link(mem_ctx, this));
65 children.push_tail(::link(mem_ctx, successor));
335 /* Remove block from all of its predecessors' successor lists. */
336 foreach_list_typed_safe (bblock_link, successor, link,
338 if (block == successor->block) {
339 successor->link.remove();
340 ralloc_free(successor);
344 /* Add removed-block's successors to its predecessors' successor lists. *
[all...] |
| /art/compiler/optimizing/ |
| dead_code_elimination.cc | 75 for (HBasicBlock* successor : live_successors) {
77 if (!visited->IsBitSet(successor->GetBlockId())) {
78 visited->SetBit(successor->GetBlockId());
79 worklist.push_back(successor);
293 HBasicBlock* successor = block->GetSingleSuccessor(); local
294 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) {
297 DCHECK_LT(i, IndexOfElement(graph_->GetReversePostOrder(), successor));
298 block->MergeWith(successor);
302 // Reiterate on this block in case it can be merged with its new successor
[all...] |
| linear_order.cc | 106 // successor block are visited, the successor block is added in the worklist
115 for (HBasicBlock* successor : current->GetSuccessors()) {
116 int block_id = successor->GetBlockId();
119 AddToListForLinearization(&worklist, successor);
|
| loop_optimization_test.cc | 62 /** Adds a loop nest at given position before successor. */
63 HBasicBlock* AddLoop(HBasicBlock* position, HBasicBlock* successor) {
69 position->ReplaceSuccessor(successor, header);
71 header->AddSuccessor(successor);
|
| nodes.cc | 79 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; local
80 uint32_t successor_id = successor->GetBlockId();
82 DCHECK(ContainsElement(worklist, successor));
83 successor->AddBackEdge(current);
87 worklist.push_back(successor);
128 // We only need to update the successor, which might be live.
129 for (HBasicBlock* successor : block->GetSuccessors()) {
130 successor->RemovePredecessor(block);
210 static bool UpdateDominatorOfSuccessor(HBasicBlock* block, HBasicBlock* successor) {
211 DCHECK(ContainsElement(block->GetSuccessors(), successor));
249 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; local
415 HBasicBlock* successor = normal_successors[j]; local
2064 HBasicBlock* successor = GetSuccessors()[0]; local
[all...] |
| ssa_liveness_analysis_test.cc | 54 HBasicBlock* successor = new (&allocator_) HBasicBlock(graph); local
55 graph->AddBlock(successor);
56 block->AddSuccessor(successor);
57 return successor;
|
| block_builder.cc | 40 // Create the first block for the dex instructions, single successor of the entry block.
341 // the successor is not in the same TryItem.
348 HBasicBlock* successor = try_block->GetSuccessors()[i]; local
350 // If the successor is a try block, all of its predecessors must be
353 if (GetTryItem(successor, try_block_info) != nullptr) {
354 DCHECK_EQ(try_item, GetTryItem(successor, try_block_info));
360 new (arena_) HTryBoundary(HTryBoundary::BoundaryKind::kExit, successor->GetDexPc());
361 graph_->SplitEdge(try_block, successor)->AddInstruction(try_exit);
|
| graph_checker.cc | 156 for (HBasicBlock* successor : block->GetNormalSuccessors()) {
157 if (successor->IsCatchBlock()) {
158 AddError(StringPrintf("Catch block %d is a normal successor of block %d.",
159 successor->GetBlockId(),
163 for (HBasicBlock* successor : block->GetExceptionalSuccessors()) {
164 if (!successor->IsCatchBlock()) {
165 AddError(StringPrintf("Normal block %d is an exceptional successor of block %d.",
166 successor->GetBlockId(),
188 for (HBasicBlock* successor : block->GetNormalSuccessors()) {
189 if (successor->GetPredecessors().size() > 1)
521 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local
531 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.gldebugger/src/com/android/ide/eclipse/gltrace/state/transforms/ |
| GLPropertyAccessor.java | 46 IGLProperty successor = e.getProperty(root); local
47 if (successor == null) {
51 root = successor;
|
| /external/v8/src/compiler/arm/ |
| unwinding-info-writer-arm.cc | 44 for (const RpoNumber& successor : block->successors()) {
45 int successor_index = successor.ToInt();
|
| /external/v8/src/compiler/arm64/ |
| unwinding-info-writer-arm64.cc | 44 for (const RpoNumber& successor : block->successors()) {
45 int successor_index = successor.ToInt();
|
| /external/v8/src/compiler/x64/ |
| unwinding-info-writer-x64.cc | 49 for (const RpoNumber& successor : block->successors()) {
50 int successor_index = successor.ToInt();
|
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| BasicBlock.java | 145 assert index >= 0 : "removeSuccessor did not find the successor to remove";
189 assert successors.contains(block) : "attempt to replace non-existent successor";
253 // Remove the replaced successor.
257 // If the new block is not a successor we don't have to rewrite indices or instructions
258 // and we can just replace the old successor with the new one.
460 for (BasicBlock successor : successors) {
461 successor.filledPredecessor(builder);
465 public void link(BasicBlock successor) {
466 assert !successors.contains(successor);
467 assert !successor.predecessors.contains(this)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| layout.go | 52 // Pick among the successor blocks that have not been scheduled yet.
84 // No successor of the previously scheduled block works.
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| layout.go | 52 // Pick among the successor blocks that have not been scheduled yet.
84 // No successor of the previously scheduled block works.
|
