/art/test/509-pre-header/ |
info.txt | 3 first predecessor was not preserved.
|
/external/v8/src/ |
hydrogen-mark-unreachable.cc | 23 HBasicBlock* predecessor = it.Current(); local 28 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) { 31 predecessor->end()->KnownSuccessorBlock(&pred_succ);
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/shortest_paths/tests/ |
test_unweighted.py | 58 assert_equal(nx.predecessor(G,0),{0: [], 1: [0], 2: [1], 3: [2]}) 59 assert_equal(nx.predecessor(G,0,3),[2]) 61 assert_equal(sorted(nx.predecessor(G,(0,0)).items()), 67 p = nx.predecessor(G,0,3) 72 p = nx.predecessor(G,0,3) 74 p = nx.predecessor(G,0,3,cutoff=2) 76 p,s = nx.predecessor(G,0,3,return_seen=True) 79 p,s = nx.predecessor(G,0,3,cutoff=2,return_seen=True)
|
/external/bison/src/ |
AnnotationList.c | 230 state **predecessor; local 231 for (predecessor = predecessors[s->number]; *predecessor; ++predecessor) 252 Sbitset__new_on_obstack ((*predecessor)->nitems, 272 then check all of the predecessor's goto follows for the 284 *predecessor, 299 items, (*predecessor)->nitems); 304 predecessor item's lookahead set. */ 307 /* We don't have to start the predecessor item search a [all...] |
/external/llvm/lib/CodeGen/ |
LatencyPriorityQueue.cpp | 54 /// getSingleUnscheduledPred - If there is exactly one unscheduled predecessor 62 // We found an available, but not scheduled, predecessor. If it's the 89 // successor nodes that have a single unscheduled predecessor. If so, that 90 // single predecessor has a higher priority, since scheduling it will make 101 /// predecessor node that has not been scheduled yet. If SU has exactly ONE 102 /// unscheduled predecessor, we want to increase its priority: it getting 111 // Okay, we found a single predecessor that is available, but not scheduled.
|
/external/icu/icu4c/source/i18n/ |
nfrule.h | 46 const NFRule* predecessor, 83 void extractSubstitutions(const NFRuleSet* ruleSet, const UnicodeString &ruleText, const NFRule* predecessor, UErrorCode& status); 84 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, UErrorCode& status);
|
/dalvik/dx/tests/088-ssa-combine-blocks/ |
Blort.java | 27 * a unique predecessor
|
/external/llvm/test/CodeGen/AArch64/ |
fast-isel-switch-phi.ll | 4 ; from the same predecessor.
|
/external/llvm/test/Transforms/GVN/ |
load-from-unreachable-predecessor.ll | 3 ; Check that an unreachable predecessor to a PHI node doesn't cause a crash.
|
pre-no-cost-phi.ll | 3 ; when the value is already available in every predecessor,
|
/dalvik/dx/src/com/android/dx/ssa/ |
SsaConverter.java | 123 * unique successor or unique predecessor.<p> 128 * predecessor. This ensures move statements can always be 163 * predecessor created for it 168 * predecessors needs a new predecessor node. 182 * unique move-exception block for each predecessor. 198 * one predecessor... 208 SsaBasicBlock predecessor = blocks.get(j); local 210 = predecessor.insertNewSuccessor(block); 259 * successor block has more than one predecessor. 261 * @param block predecessor nod [all...] |
/external/dexmaker/src/dx/java/com/android/dx/ssa/ |
SsaConverter.java | 124 * unique successor or unique predecessor.<p> 129 * predecessor. This ensures move statements can always be 164 * predecessor created for it 169 * predecessors needs a new predecessor node. 183 * unique move-exception block for each predecessor. 199 * one predecessor... 209 SsaBasicBlock predecessor = blocks.get(j); local 211 = predecessor.insertNewSuccessor(block); 260 * successor block has more than one predecessor. 262 * @param block predecessor nod [all...] |
/external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/ |
PreInstructionRegisterInfoMethodItem.java | 149 //in the common case of an instruction that only has a single predecessor which is the previous 158 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { 159 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum); 181 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) { 182 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum); 188 if (predecessor.getInstructionIndex() == -1) { 193 writer.printUnsignedLongAsHex(methodAnalyzer.getInstructionAddress(predecessor));
|
/external/llvm/lib/IR/ |
BasicBlock.cpp | 212 /// If this basic block has a single predecessor block, 222 /// If this basic block has a unique predecessor block, 224 /// Note that unique predecessor doesn't mean single edge, there can be 225 /// multiple edges from the unique predecessor to this block (for example 235 // The same predecessor appears multiple times in the predecessor list. 256 /// specified Predecessor of the block is no longer able to reach it. This is 257 /// actually not used to update the Predecessor list, but is actually used to 259 /// called while the predecessor still refers to this block. 265 "removePredecessor: BB is not a predecessor!"); [all...] |
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/ |
isomorphvf2.py | 624 # For each predecessor n' of n in the partial mapping, the 625 # corresponding node m' is a predecessor of m, and vice versa. Also, 627 for predecessor in self.G1.pred[G1_node]: 628 if predecessor in self.core_1: 629 if not (self.core_1[predecessor] in self.G2.pred[G2_node]): 631 elif self.G1.number_of_edges(predecessor, G1_node) != self.G2.number_of_edges(self.core_1[predecessor], G2_node): 634 for predecessor in self.G2.pred[G2_node]: 635 if predecessor in self.core_2: 636 if not (self.core_2[predecessor] in self.G1.pred[G1_node]) [all...] |
/external/llvm/include/llvm/CodeGen/ |
LatencyPriorityQueue.h | 38 /// predecessor for. This is used as a tie-breaker heuristic for better 87 // successor nodes that have a single unscheduled predecessor. If so, that 88 // single predecessor has a higher priority, since scheduling it will make
|
/external/llvm/include/llvm/IR/ |
PredIteratorCache.h | 25 /// predecessor iterator queries. This is useful for code that repeatedly 26 /// wants the predecessor list for the same blocks. 36 /// GetPreds - Get a cached list for the null-terminated predecessor list of
|
/external/v8/test/webkit/ |
dfg-cfg-simplify-phantom-get-local-on-same-block-set-local.js | 25 "Tests that attempts by the DFG simplification to short-circuit a Phantom to a GetLocal on a variable that is SetLocal'd in the same block, and where the predecessor block(s) make no mention of that variable, do not result in crashes." 55 // the predecessor block making no mention of x.
|
/art/compiler/optimizing/ |
nodes.cc | 164 HBasicBlock* predecessor, 167 block->SetDominator(predecessor); 169 block->SetDominator(FindCommonDominator(block->GetDominator(), predecessor)); 197 // Use `InsertBetween` to ensure the predecessor index and successor index of 223 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); local 224 if (!info->IsBackEdge(*predecessor)) { 225 predecessor->ReplaceSuccessor(header, pre_header); 232 // Make sure the first predecessor of a loop header is the incoming block. 236 HBasicBlock* predecessor = header->GetPredecessors().Get(pred); local 237 if (!info->IsBackEdge(*predecessor)) { 1039 HBasicBlock* predecessor = predecessors_.Get(i); local 1177 HBasicBlock* predecessor = GetPredecessors().Get(0); local 1264 HBasicBlock* predecessor = to->GetPredecessors().Get(0); local 1279 HBasicBlock* predecessor = to->GetPredecessors().Get(i); local [all...] |
/art/test/509-pre-header/smali/ |
PreHeader.smali | 22 # is the first predecessor of the loop header.
|
/dalvik/dx/tests/086-ssa-edge-split/ |
Blort.java | 45 * a unique predecessor
|
/external/iptables/extensions/ |
libipt_ULOG.man | 1 This is the deprecated ipv4-only predecessor of the NFLOG target.
|
/external/llvm/test/CodeGen/Generic/ |
undef-phi.ll | 4 ; inserts an IMPLICIT_DEF instruction in the predecessor so all paths to the use
|
/external/llvm/test/Transforms/JumpThreading/ |
assume-edge-dom.ll | 26 ; predecessor branch (although no assume dominates the cmp itself). Make sure
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/centrality/ |
load.py | 107 # get the predecessor and path length data 109 (pred,length)=nx.predecessor(G,source,cutoff=cutoff,return_seen=True) 168 # get the predecessor data 170 (pred,length)=nx.predecessor(G,source,cutoff=cutoff,return_seen=True)
|