| /external/mockito/cglib-and-asm/src/org/mockito/asm/ |
| Edge.java | 66 * The successor block of the basic block from which this edge originates.
68 Label successor;
field in class:Edge
|
| Label.java | 213 * The successor of this label, in the order they are visited. This linked
219 Label successor;
field in class:Label
471 * null it is added to the successor of the RET blocks found in the
488 e.successor = JSR.successors.successor;
501 // calls this method recursively on each successor, except JSR targets
508 e.successor.visitSubroutine(JSR, id, nbSubroutines);
|
| /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
|
| /art/compiler/optimizing/ |
| dead_code_elimination.cc | 74 for (HBasicBlock* successor : live_successors) {
76 if (!visited->IsBitSet(successor->GetBlockId())) {
77 visited->SetBit(successor->GetBlockId());
78 worklist.push_back(successor);
143 HBasicBlock* successor = block->GetSingleSuccessor(); local
144 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) {
148 block->MergeWith(successor);
150 // Reiterate on this block in case it can be merged with its new successor.
|
| nodes.cc | 77 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; local
78 uint32_t successor_id = successor->GetBlockId();
80 DCHECK(ContainsElement(worklist, successor));
81 successor->AddBackEdge(current);
85 worklist.push_back(successor);
129 // We only need to update the successor, which might be live.
130 for (HBasicBlock* successor : block->GetSuccessors()) {
131 successor->RemovePredecessor(block);
211 static bool UpdateDominatorOfSuccessor(HBasicBlock* block, HBasicBlock* successor) {
212 DCHECK(ContainsElement(block->GetSuccessors(), successor));
250 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; local
420 HBasicBlock* successor = normal_successors[j]; local
1871 HBasicBlock* successor = other->GetSuccessors()[0]; local
1908 HBasicBlock* successor = other->GetSuccessors()[0]; local
1928 HBasicBlock* successor = GetSuccessors()[0]; local
[all...] |
| ssa_liveness_analysis.cc | 85 // successor block are visited, the successor block is added in the worklist
94 for (HBasicBlock* successor : current->GetSuccessors()) {
95 int block_id = successor->GetBlockId();
98 AddToListForLinearization(&worklist, successor);
220 for (HBasicBlock* successor : block->GetSuccessors()) {
221 live_in->Union(GetLiveInSet(*successor));
222 if (successor->IsCatchBlock()) {
232 size_t phi_input_index = successor->GetPredecessorIndexOf(block);
233 for (HInstructionIterator phi_it(successor->GetPhis()); !phi_it.Done(); phi_it.Advance())
[all...] |
| block_builder.cc | 39 // Create the first block for the dex instructions, single successor of the entry block.
329 // the successor is not in the same TryItem.
334 HBasicBlock* successor = try_block->GetSuccessors()[i]; local
336 // If the successor is a try block, all of its predecessors must be
339 if (GetTryItem(successor, try_block_info) != nullptr) {
340 DCHECK_EQ(entry.second, GetTryItem(successor, try_block_info));
346 new (arena_) HTryBoundary(HTryBoundary::BoundaryKind::kExit, successor->GetDexPc());
347 graph_->SplitEdge(try_block, successor)->AddInstruction(try_exit);
|
| graph_checker.cc | 154 for (HBasicBlock* successor : block->GetNormalSuccessors()) {
155 if (successor->IsCatchBlock()) {
156 AddError(StringPrintf("Catch block %d is a normal successor of block %d.",
157 successor->GetBlockId(),
161 for (HBasicBlock* successor : block->GetExceptionalSuccessors()) {
162 if (!successor->IsCatchBlock()) {
163 AddError(StringPrintf("Normal block %d is an exceptional successor of block %d.",
164 successor->GetBlockId(),
186 for (HBasicBlock* successor : block->GetNormalSuccessors()) {
187 if (successor->GetPredecessors().size() > 1)
515 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local
525 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local
[all...] |
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 67 // as successor of every instruction.
153 for (auto successor : (*candidate)->successors()) {
154 successor->DropUnscheduledPredecessor();
155 successor->set_start_cycle(
156 std::max(successor->start_cycle(),
159 if (!successor->HasUnscheduledPredecessor()) {
160 ready_list.push_back(successor);
267 for (auto successor : node->successors()) {
268 DCHECK(successor->total_latency() != -1);
269 if (successor->total_latency() > max_latency)
[all...] |
| schedule.cc | 43 void BasicBlock::AddSuccessor(BasicBlock* successor) {
44 successors_.push_back(successor);
309 for (BasicBlock* const successor : from->successors()) {
310 to->AddSuccessor(successor);
311 for (BasicBlock*& predecessor : successor->predecessors()) {
364 for (BasicBlock const* successor : block->successors()) {
367 os << "B" << successor->rpo_number();
|
| /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 | 112 boolean methodinvocationline, boolean successor, boolean expected) {
120 if (successor) {
|
| /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/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_fs_cfg.h | 56 void add_successor(void *mem_ctx, fs_bblock *successor);
|
| brw_fs_cfg.cpp | 34 * blocks with successor/predecessor edges connecting them.
57 fs_bblock::add_successor(void *mem_ctx, fs_bblock *successor)
59 successor->parents.push_tail(this->make_list(mem_ctx));
60 children.push_tail(successor->make_list(mem_ctx));
|
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteConnectionPool.java | 625 ConnectionWaiter successor = mConnectionWaiterQueue; local
626 while (successor != null) {
627 if (priority > successor.mPriority) {
628 waiter.mNext = successor;
631 predecessor = successor;
632 successor = successor.mNext;
824 final ConnectionWaiter successor = waiter.mNext; local
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-bch.cc | 137 Element* successor = at(current->end()->SuccessorAt(i)); local
139 if (!successor->is_in_loop()) {
140 if (!successor->is_proper_exit()) {
148 if (successor->is_start()) {
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 148 int successor = successors.get(j); local
150 if (successor != bb.getPrimarySuccessor()) {
151 System.out.print(" n" + Hex.u2(successor) + " ");
|
| /external/guava/guava/src/com/google/common/collect/ |
| TreeMultiset.java | 126 successor(header, header); method
255 successor(header, newRoot, header); method
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)
[all...] |
| /external/lzma/C/ |
| Ppmd7.c | 279 #define SUCCESSOR(p) ((CPpmd_Void_Ref)((p)->SuccessorLow | ((UInt32)(p)->SuccessorHigh << 16)))
347 CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState);
356 CPpmd_Void_Ref successor;
local
365 successor = SUCCESSOR(s);
366 if (successor != upBranch)
368 c = CTX(successor);
425 CPpmd_Void_Ref successor, fSuccessor = SUCCESSOR(p->FoundState);
local
472 successor = REF(p->Text);
[all...] |
