| /art/test/473-remove-dead-block/ |
| info.txt | 2 Removing from predecessors require remove successor otherwise
|
| /external/linux-tools-perf/src/include/linux/ |
| rbtree_augmented.h | 159 struct rb_node *successor = child, *child2; local
163 * Case 2: node's successor is its right child
171 parent = successor;
172 child2 = successor->rb_right;
173 augment->copy(node, successor);
176 * Case 3: node's successor is leftmost under
190 parent = successor;
191 successor = tmp;
194 parent->rb_left = child2 = successor->rb_right;
195 successor->rb_right = child
[all...] |
| /dalvik/dx/src/com/android/dx/rop/ |
| package-info.java | 75 * successor.<p>
84 * primary successor} which distinguishes a particular control flow path.
88 * {@link Rops#IF_EQZ_INT}, the primary successor represents the path taken
90 * instructions}, the primary successor is the default case.<p>
92 * A basic block's successor list is ordered and may refer to unique labels
95 * appear in the successor list multiple times. In general, the
96 * significance of the successor list's order (like the significance of
97 * the primary successor) is a property of the final instruction of the basic
99 * its successor list in an order identical to the
101 * primary successor (the no-exception case) listed at the end
[all...] |
| /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)
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBranchProbabilityInfo.h | 32 // weight to just "inherit" the non-zero weight of an adjacent successor.
66 // Return a hot successor for the block BB or null if there isn't one.
72 // only iff SRC block has only one successor.
74 // Src. Querying sequentially for each successor's probability is a quadratic
81 // has only one successor.
|
| /art/compiler/optimizing/ |
| nodes.cc | 69 // We only need to update the successor, which might be live.
89 HBasicBlock* successor = block->GetSuccessors().Get(i); local
90 if (visiting->IsBitSet(successor->GetBlockId())) {
91 successor->AddBackEdge(block);
93 VisitBlockForBackEdges(successor, visited, visiting);
191 void HGraph::SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor) {
192 // Insert a new node between `block` and `successor` to split the
194 HBasicBlock* new_block = new (arena_) HBasicBlock(this, successor->GetDexPc());
197 // Use `InsertBetween` to ensure the predecessor index and successor index of
198 // `block` and `successor` are preserved
267 HBasicBlock* successor = block->GetSuccessors().Get(j); local
940 HBasicBlock* successor = GetSuccessors().Get(i); local
1057 HBasicBlock* successor = successors_.Get(i); local
1121 HBasicBlock* successor = other->successors_.Get(0); local
1160 HBasicBlock* successor = other->successors_.Get(0); local
1181 HBasicBlock* successor = GetSuccessors().Get(0); local
[all...] |
| dead_code_elimination.cc | 105 HBasicBlock* successor = block->GetSuccessors().Get(0); local
106 if (successor->IsExitBlock() || successor->GetPredecessors().Size() != 1u) {
110 block->MergeWith(successor);
112 // Reiterate on this block in case it can be merged with its new successor.
|
| ssa_liveness_analysis.cc | 85 // successor block are visited, the successor block is added in the worklist
93 HBasicBlock* successor = current->GetSuccessors().Get(i); local
94 int block_id = successor->GetBlockId();
97 AddToListForLinearization(&worklist, successor);
189 HBasicBlock* successor = block->GetSuccessors().Get(i); local
190 live_in->Union(GetLiveInSet(*successor));
191 size_t phi_input_index = successor->GetPredecessorIndexOf(block);
192 for (HInstructionIterator inst_it(successor->GetPhis()); !inst_it.Done(); inst_it.Advance()) {
300 HBasicBlock* successor = block.GetSuccessors().Get(i) local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaBasicBlock.java | 56 /** {@code non-null;} successor set (by block list index) */
60 * {@code non-null;} ordered successor list
66 * block list index of primary successor, or {@code -1} for no primary
67 * successor
354 * @return {@code non-null;} ordered successor list, containing block
362 * @return {@code >= -1;} block index of primary successor or
363 * {@code -1} if no primary successor
370 * @return rop label of primary successor
377 * @return {@code null-ok;} the primary successor block or {@code null}
389 * @return successor list of rop label
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaBasicBlock.java | 57 /** {@code non-null;} successor set (by block list index) */
61 * {@code non-null;} ordered successor list
67 * block list index of primary successor, or {@code -1} for no primary
68 * successor
355 * @return {@code non-null;} ordered successor list, containing block
363 * @return {@code >= -1;} block index of primary successor or
364 * {@code -1} if no primary successor
371 * @return rop label of primary successor
378 * @return {@code null-ok;} the primary successor block or {@code null}
390 * @return successor list of rop label
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 23 /// @brief Hierarchical RegionNode successor iterator.
31 /// For a subregion RegionNode there is just one successor. The RegionNode
46 // In region mode there is only one successor, thats the regionnode mapping
48 ItRgBegin, // At the beginning of the regionnode successor.
49 ItRgEnd // At the end of the regionnode successor.
55 // The block successor iterator.
58 // advanceRegionSucc - A region node has only one successor. It reaches end
61 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
70 // Get the immediate successor. This function may return a Basic Block
79 // getRegionSucc - Return the successor basic block of a SubRegion RegionNode
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/ |
| isomorphvf2.py | 644 # For each successor n' of n in the partial mapping, the corresponding
645 # node m' is a successor of m, and vice versa. Also, the number of
647 for successor in self.G1[G1_node]:
648 if successor in self.core_1:
649 if not (self.core_1[successor] in self.G2[G2_node]):
651 elif self.G1.number_of_edges(G1_node, successor) != self.G2.number_of_edges(G2_node, self.core_1[successor]):
654 for successor in self.G2[G2_node]:
655 if successor in self.core_2:
656 if not (self.core_2[successor] in self.G1[G1_node])
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| SubEngine.h | 54 /// Called by CoreEngine. Used to generate new successor
66 /// Called by CoreEngine. Used to generate successor
76 /// Used to generate successor nodes for temporary destructors depending
94 /// Called by CoreEngine. Used to generate successor
98 /// Called by CoreEngine. Used to generate 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/llvm/lib/CodeGen/ |
| MachineBasicBlock.cpp | 223 // A block with a landing pad successor only has one other successor.
396 // The block has an unconditional branch. If its successor is now
397 // its layout successor, delete the branch.
401 // The block has an unconditional fallthrough. If its successor is not
402 // its layout successor, insert a branch. First we have to locate the
403 // only non-landing-pad successor, as that is the fallthrough block.
407 assert(!TBB && "Found more than one non-landing-pad successor!");
411 // If there is no non-landing-pad successor, the block has no
416 // Finally update the unconditional successor to be reached via a branc
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlock.java | 41 * {@code >= -1;} the primary / standard-flow / "default" successor, or
55 * "default" successor, or {@code -1} if this block has no
165 * Gets the primary successor of this block.
167 * @return {@code >= -1;} the primary successor, or {@code -1} if this
175 * Gets the secondary successor of this block. It is only valid to call
178 * @return {@code >= 0;} the secondary successor
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlock.java | 41 * {@code >= -1;} the primary / standard-flow / "default" successor, or
55 * "default" successor, or {@code -1} if this block has no
165 * Gets the primary successor of this block.
167 * @return {@code >= -1;} the primary successor, or {@code -1} if this
175 * Gets the secondary successor of this block. It is only valid to call
178 * @return {@code >= 0;} the secondary successor
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| BasicBlock.java | 41 * {@code >= -1;} the primary / standard-flow / "default" successor, or
55 * "default" successor, or {@code -1} if this block has no
165 * Gets the primary successor of this block.
167 * @return {@code >= -1;} the primary successor, or {@code -1} if this
175 * Gets the secondary successor of this block. It is only valid to call
178 * @return {@code >= 0;} the secondary successor
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 27 * Searches for basic blocks that all have the same successor and insns
129 * all of the successor links that point to the beta blocks to point
156 * @param oldLabel label of successor to replace
157 * @param newLabel label of new successor
|
| /dalvik/dx/tests/083-ssa-phi-placement/ |
| Blort.java | 45 * This method requires an ordered successor list with
|
| /dalvik/dx/tests/086-ssa-edge-split/ |
| Blort.java | 57 * a result needs to have a unique successor. This appies
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/back/ |
| IdenticalBlockCombiner.java | 32 * Searches for basic blocks that all have the same successor and insns
134 * all of the successor links that point to the beta blocks to point
161 * @param oldLabel label of successor to replace
162 * @param newLabel label of new successor
|
| /external/llvm/lib/Analysis/ |
| IntervalPartition.cpp | 53 // updatePredecessors - Interval generation only sets the successor fields of
55 // run through all of the intervals and propagate successor info as
81 // Now that we know all of the successor information, propagate this to the
109 // Now that we know all of the successor information, propagate this to the
|
| /external/llvm/test/CodeGen/Generic/ |
| MachineBranchProb.ll | 6 ; Make sure we have the correct weight attached to each successor.
|
| /external/llvm/test/CodeGen/X86/ |
| hoist-common.ll | 13 ; Common "xorb al, al" instruction in the two successor blocks should be
|
