/external/e2fsprogs/intl/ |
loadinfo.h | 76 struct loaded_l10nfile *successor[1]; member in struct:loaded_l10nfile 99 furthermore its ->successor[] field contains a list of other lookup
|
/external/v8/src/crankshaft/ |
hydrogen-environment-liveness.cc | 49 // When a value is live in successor A but dead in B, we must 52 HBasicBlock* successor = it.Current(); local 53 int successor_id = successor->block_id();
|
lithium-allocator.cc | 544 // successor edges. 547 // Process all successor blocks. 549 // Add values live on entry to the successor. Note the successor's 551 HBasicBlock* successor = it.Current(); local 552 BitVector* live_in = live_in_sets_[successor->block_id()]; 555 // All phi input operands corresponding to this successor edge are live 557 int index = successor->PredecessorIndexOf(block); 558 const ZoneList<HPhi*>* phis = successor->phis(); [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;
|
/toolchain/binutils/binutils-2.25/intl/ |
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/ |
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);
|
ssa_liveness_analysis_test.cc | 54 HBasicBlock* successor = new (&allocator_) HBasicBlock(graph); local 55 graph->AddBlock(successor); 56 block->AddSuccessor(successor); 57 return successor;
|
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...] |
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) 515 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local 525 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local [all...] |
bounds_check_elimination.cc | 603 // and push the narrowed value range to `successor`. 605 HBasicBlock* successor, ValueRange* range) { 609 AssignRange(successor, instruction, range); 621 AssignRange(successor, instruction, existing_range->Narrow(range)); 646 HBasicBlock* successor = nullptr; local 652 successor = instruction->IfTrueSuccessor(); 654 successor = instruction->IfTrueSuccessor(); 656 successor = instruction->IfFalseSuccessor(); 660 successor = instruction->IfFalseSuccessor(); 667 if (successor != nullptr) [all...] |
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 1965 HBasicBlock* successor = GetSuccessors()[0]; local [all...] |
/dalvik/dx/src/com/android/dx/command/dump/ |
DotDumper.java | 151 int successor = successors.get(j); local 153 if (successor != bb.getPrimarySuccessor()) { 154 System.out.print(" n" + Hex.u2(successor) + " ");
|
/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/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/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
TreeMultiset.java | 122 successor(header, header); method 251 successor(header, newRoot, header); method 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/smali/dexlib2/src/main/java/org/jf/dexlib2/analysis/ |
MethodAnalyzer.java | 186 for (AnalyzedInstruction successor: startOfMethod.successors) { 187 instructionsToAnalyze.set(successor.instructionIndex); 229 for (AnalyzedInstruction successor: instructionToAnalyze.successors) { 230 instructionsToAnalyze.set(successor.getInstructionIndex()); 411 for (AnalyzedInstruction successor: instruction.successors) { 412 if (successor.mergeRegister(registerNumber, postRegisterType, analyzedState, override)) { 413 changedInstructions.set(successor.instructionIndex); 481 //and no reachable code will have an unreachable predessor or successor 535 @Nonnull AnalyzedInstruction successor, 538 addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false) [all...] |
/dalvik/dx/src/com/android/dx/ssa/ |
SsaRenamer.java | 363 * phis in successor blocks. 624 * Updates the phi insns in successor blocks with operands based 656 SsaBasicBlock successor = ssaMeth.getBlocks().get(i); local 657 successor.forEachPhiInsn(visitor);
|
/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...] |
/external/v8/src/compiler/ |
instruction.cc | 656 for (BasicBlock* successor : block->successors()) { 657 instr_block->successors().push_back(GetRpo(successor)); 736 // has an edge to a block (== a successor) with more than one predecessors. 740 const InstructionBlock* successor = InstructionBlockAt(successor_id); local 742 CHECK(successor->PredecessorCount() == 1 && 743 successor->predecessors()[0] == block->rpo_number()); 750 // A deferred block with more than one successor must have all its successors [all...] |
/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/arm64/ |
lithium-arm64.cc | 626 HBasicBlock* successor; local 628 HControlInstruction::cast(current)->KnownSuccessorBlock(&successor) && 629 successor != NULL) { 630 instr = new(zone()) LGoto(successor); [all...] |
/external/v8/src/crankshaft/arm/ |
lithium-arm.cc | 783 HBasicBlock* successor; local 785 HControlInstruction::cast(current)->KnownSuccessorBlock(&successor) && 786 successor != NULL) { 787 instr = new(zone()) LGoto(successor); [all...] |
/external/v8/src/crankshaft/ia32/ |
lithium-ia32.cc | 816 HBasicBlock* successor; local 818 HControlInstruction::cast(current)->KnownSuccessorBlock(&successor) && 819 successor != NULL) { 820 instr = new(zone()) LGoto(successor); [all...] |
/external/v8/src/crankshaft/mips/ |
lithium-mips.cc | 793 HBasicBlock* successor; local 795 HControlInstruction::cast(current)->KnownSuccessorBlock(&successor) && 796 successor != NULL) { 797 instr = new(zone()) LGoto(successor); [all...] |