| /external/annotation-tools/asmx/src/org/objectweb/asm/ |
| Edge.java | 48 * The successor block of the basic block from which this edge originates.
50 Label successor; field in class:Edge
|
| /external/libxkbcommon/xkbcommon/src/compose/ |
| table.h | 54 * - down arrows are `successor` pointers.
61 * Nodes without a successor are leaf nodes. Since a sequence cannot be a
79 uint32_t successor; member in union:compose_node::__anon26675
|
| parser.c | 422 uint32_t successor = add_node(table, production->lhs[lhs_pos + 1]); local
426 node->u.successor = successor;
430 curr = node->u.successor;
|
| /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 | 545 // successor edges.
548 // Process all successor blocks.
550 // Add values live on entry to the successor. Note the successor's
552 HBasicBlock* successor = it.Current(); local
553 BitVector* live_in = live_in_sets_[successor->block_id()];
556 // All phi input operands corresponding to this successor edge are live
558 int index = successor->PredecessorIndexOf(block);
559 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.27/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 | 63 // Create the first block for the dex instructions, single successor of the entry block.
367 // the successor is not in the same TryItem.
374 HBasicBlock* successor = try_block->GetSuccessors()[i]; local
376 // If the successor is a try block, all of its predecessors must be
379 if (GetTryItem(successor, try_block_info) != nullptr) {
380 DCHECK_EQ(try_item, GetTryItem(successor, try_block_info));
386 new (allocator_) HTryBoundary(HTryBoundary::BoundaryKind::kExit, successor->GetDexPc());
387 graph_->SplitEdge(try_block, successor)->AddInstruction(try_exit);
|
| ssa_liveness_analysis_test.cc | 53 HBasicBlock* successor = new (GetAllocator()) HBasicBlock(graph); local
54 graph->AddBlock(successor);
55 block->AddSuccessor(successor);
56 return successor;
|
| dead_code_elimination.cc | 80 for (HBasicBlock* successor : live_successors) {
82 if (!visited->IsBitSet(successor->GetBlockId())) {
83 visited->SetBit(successor->GetBlockId());
84 worklist.push_back(successor);
433 HBasicBlock* successor = block->GetSingleSuccessor(); local
434 if (successor->IsExitBlock() || successor->GetPredecessors().size() != 1u) {
437 DCHECK_LT(i, IndexOfElement(graph_->GetReversePostOrder(), successor));
438 block->MergeWith(successor);
442 // Reiterate on this block in case it can be merged with its new successor
[all...] |
| graph_checker.cc | 168 for (HBasicBlock* successor : block->GetNormalSuccessors()) {
169 if (successor->IsCatchBlock()) {
170 AddError(StringPrintf("Catch block %d is a normal successor of block %d.",
171 successor->GetBlockId(),
175 for (HBasicBlock* successor : block->GetExceptionalSuccessors()) {
176 if (!successor->IsCatchBlock()) {
177 AddError(StringPrintf("Normal block %d is an exceptional successor of block %d.",
178 successor->GetBlockId(),
200 for (HBasicBlock* successor : block->GetNormalSuccessors()) {
201 if (successor->GetPredecessors().size() > 1)
533 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local
543 HBasicBlock* successor = ret->GetBlock()->GetSingleSuccessor(); local
[all...] |
| superblock_cloner.cc | 158 // This flag reflects whether the original successor has at least one phi and this phi
160 // in the end all of the phis in the copy successor have the same number of inputs - the number
161 // of copy successor's predecessors.
252 HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; local
253 uint32_t successor_id = successor->GetBlockId();
259 DCHECK(ContainsElement(worklist, successor));
260 successor->AddBackEdgeWhileUpdating(current);
264 worklist.push_back(successor);
|
| 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...] |
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 155 int successor = successors.get(j); local
157 if (successor != bb.getPrimarySuccessor()) {
158 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 | 177 for (AnalyzedInstruction successor: startOfMethod.successors) {
178 instructionsToAnalyze.set(successor.instructionIndex);
220 for (AnalyzedInstruction successor: instructionToAnalyze.successors) {
221 instructionsToAnalyze.set(successor.getInstructionIndex());
425 for (AnalyzedInstruction successor: instruction.successors) {
426 if (successor.mergeRegister(registerNumber, postRegisterType, analyzedState, override)) {
427 changedInstructions.set(successor.instructionIndex);
495 //and no reachable code will have an unreachable predessor or successor
549 @Nonnull AnalyzedInstruction successor,
552 addPredecessorSuccessor(predecessor, successor, exceptionHandlers, instructionsToProcess, false)
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaRenamer.java | 365 * phis in successor blocks.
629 * Updates the phi insns in successor blocks with operands based
662 SsaBasicBlock successor = ssaMeth.getBlocks().get(i); local
663 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 | 669 for (BasicBlock* successor : block->successors()) {
670 instr_block->successors().push_back(GetRpo(successor));
749 // has an edge to a block (== a successor) with more than one predecessors.
753 const InstructionBlock* successor = InstructionBlockAt(successor_id); local
755 CHECK(successor->PredecessorCount() == 1 &&
756 successor->predecessors()[0] == block->rpo_number());
763 // A deferred block with more than one successor must have all its successors
[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...] |
| /frameworks/base/core/java/android/database/sqlite/ |
| SQLiteConnectionPool.java | 709 ConnectionWaiter successor = mConnectionWaiterQueue; local
710 while (successor != null) {
711 if (priority > successor.mPriority) {
712 waiter.mNext = successor;
715 predecessor = successor;
716 successor = successor.mNext;
910 final ConnectionWaiter successor = waiter.mNext; local
[all...] |
