| /external/chromium_org/v8/src/ |
| hydrogen-mark-unreachable.cc | 46 HBasicBlock* predecessor = it.Current(); local
51 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) {
54 predecessor->end()->KnownSuccessorBlock(&pred_succ);
|
| /external/chromium_org/sync/internal_api/ |
| write_node.cc | 345 const BaseNode* predecessor) {
347 // |predecessor| must be a child of |parent| or NULL.
348 if (predecessor && predecessor->GetParentId() != parent.GetId()) {
369 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
370 return PutPredecessor(predecessor);
448 // Now set the predecessor, which sets IS_UNSYNCED as necessary.
457 const BaseNode* predecessor) {
458 // |predecessor| must be a child of |new_parent| or NULL.
459 if (predecessor && predecessor->GetParentId() != new_parent.GetId())
[all...] |
| /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/chromium_org/sync/internal_api/public/ |
| write_node.h | 53 // Setting the predecessor failed
70 // Create a new bookmark node with the specified parent and predecessor. Use
71 // a NULL |predecessor| to indicate that this is to be the first child.
72 // |predecessor| must be a child of |new_parent| or NULL. Returns false on
75 const BaseNode* predecessor);
109 // Set a new parent and position. Position is specified by |predecessor|; if
110 // it is NULL, the node is moved to the first position. |predecessor| must
112 bool SetPosition(const BaseNode& new_parent, const BaseNode* predecessor);
198 bool PutPredecessor(const BaseNode* predecessor) WARN_UNUSED_RESULT;
|
| /external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/ |
| PreInstructionRegisterInfoMethodItem.java | 140 //in the common case of an instruction that only has a single predecessor which is the previous
149 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
150 if (predecessor.getPostInstructionRegisterType(registerNum) != mergedRegisterType) {
182 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
183 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum);
210 for (AnalyzedInstruction predecessor: analyzedInstruction.getPredecessors()) {
211 RegisterType predecessorRegisterType = predecessor.getPostInstructionRegisterType(registerNum);
217 if (predecessor.getInstructionIndex() == -1) {
222 writer.printUnsignedLongAsHex(methodAnalyzer.getInstructionAddress(predecessor));
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| nfrule.h | 45 const NFRule* predecessor,
79 void extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
80 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
|
| /external/icu4c/i18n/ |
| nfrule.h | 45 const NFRule* predecessor,
79 void extractSubstitutions(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
80 NFSubstitution* extractSubstitution(const NFRuleSet* ruleSet, const NFRule* predecessor, const RuleBasedNumberFormat* rbnf, UErrorCode& status);
|
| /external/llvm/include/llvm/Support/ |
| 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
|
| /dalvik/dx/tests/088-ssa-combine-blocks/ |
| Blort.java | 27 * a unique predecessor
|
| /art/compiler/sea_ir/ir/ |
| sea.h | 91 // have multiple predecessor regions; this is why RenameToSSA has
118 // Returns the instruction that defines the phi register from predecessor
212 // Sets the phi-function uses to be as defined in @scoped_table for predecessor @@predecessor.
214 Region* predecessor);
226 void AddPredecessor(Region* predecessor) {
227 DCHECK(predecessor) << "Tried to add NULL predecessor to SEA node.";
228 predecessors_.push_back(predecessor);
240 std::vector<sea_ir::Region*> predecessors_; // CFG predecessor nodes (instructions/regions
[all...] |
| /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/llvm/lib/CodeGen/ |
| LatencyPriorityQueue.cpp | 53 /// getSingleUnscheduledPred - If there is exactly one unscheduled predecessor
61 // We found an available, but not scheduled, predecessor. If it's the
88 // successor nodes that have a single unscheduled predecessor. If so, that
89 // single predecessor has a higher priority, since scheduling it will make
100 /// predecessor node that has not been scheduled yet. If SU has exactly ONE
101 /// unscheduled predecessor, we want to increase its priority: it getting
110 // Okay, we found a single predecessor that is available, but not scheduled.
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 181 /// getSinglePredecessor - If this basic block has a single predecessor block,
191 /// getUniquePredecessor - If this basic block has a unique predecessor block,
193 /// Note that unique predecessor doesn't mean single edge, there can be
194 /// multiple edges from the unique predecessor to this block (for example
204 // The same predecessor appears multiple times in the predecessor list.
211 /// specified Predecessor of the block is no longer able to reach it. This is
212 /// actually not used to update the Predecessor list, but is actually used to
214 /// called while the predecessor still refers to this block.
220 "removePredecessor: BB is not a predecessor!");
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 38 /// predecessor for. This is used as a tie-breaker heuristic for better
89 // successor nodes that have a single unscheduled predecessor. If so, that
90 // single predecessor has a higher priority, since scheduling it will make
|
| /external/chromium_org/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.
|
| /dalvik/dx/tests/086-ssa-edge-split/ |
| Blort.java | 45 * a unique predecessor
|
| /external/chromium_org/sync/engine/ |
| get_commit_ids.h | 29 // The predecessor to successor rule was implemented when we tracked positions
|
| /external/llvm/test/CodeGen/Generic/ |
| undef-phi.ll | 4 ; inserts an IMPLICIT_DEF instruction in the predecessor so all paths to the use
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 179 // If we find an unreachable predecessor, mark this block as reachable so
183 // If we haven't previously visited the unreachable predecessor, recurse
204 // find the condition that led to this block (the predecessor of this block.)
205 // There will never be more than one predecessor.
208 // We only expect a predecessor size of 0 or 1. If it is >1, then an external
220 // Get the predecessor block's terminator conditon
223 //assert(cond && "CFGBlock's predecessor has a terminator condition");
|
| /external/chromium_org/third_party/libjingle/source/talk/xmllite/ |
| xmlelement.cc | 348 void XmlElement::InsertChildAfter(XmlChild* predecessor, XmlChild* next) {
349 if (predecessor == NULL) {
354 next->next_child_ = predecessor->next_child_;
355 predecessor->next_child_ = next;
359 void XmlElement::RemoveChildAfter(XmlChild* predecessor) {
362 if (predecessor == NULL) {
367 next = predecessor->next_child_;
368 predecessor->next_child_ = next->next_child_;
372 last_child_ = predecessor;
|
| /external/chromium/chrome/browser/sync/glue/ |
| bookmark_change_processor.cc | 215 // This node's index should be one more than the predecessor's index.
304 // Find the bookmark model predecessor, and insert after it.
308 LOG(WARNING) << "Predecessor lookup failed";
324 // predecessor of the node (in the bookmark model) matches the predecessor of
326 // As a precondition, this assumes that the predecessor of |source| has been
334 // A return ID of kInvalidId indicates no predecessor.
338 // Otherwise, insert after the predecessor bookmark node.
339 const BookmarkNode* predecessor = local
341 DCHECK(predecessor);
[all...] |
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Code/Analysis/ |
| AnalyzedInstruction.java | 108 protected boolean addPredecessor(AnalyzedInstruction predecessor) {
109 return predecessors.add(predecessor);
154 * To determine this, we simply check if the first predecessor is the fake "StartOfMethod" instruction, which has
204 * given register. Any dead, unreachable, or odexed predecessor is ignored
210 for (AnalyzedInstruction predecessor: predecessors) {
211 RegisterType predecessorRegisterType = predecessor.postRegisterMap[registerNumber];
|
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 65 /// successors, we forward the edge from the predecessor to the successor by
358 /// predecessor based on its terminator.
369 // predecessor, use that information to try to thread this block.
524 // predecessor, use that information to try to thread this block.
560 // and we can figure out the condition value for any predecessor block.
583 // See if the select has a known constant value for this predecessor.
647 // If this block has a single predecessor, and if that pred has a single
650 // predecessors of our predecessor block.
754 // For predecessor edge, determine if the comparison is true or false
824 // TODO: If we have: "br (X > 0)" and we have a predecessor where we kno
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| Local.h | 97 /// method is called when we're about to delete Pred as a predecessor of BB. If
105 /// .. and delete the predecessor corresponding to the '1', this will attempt to
111 /// MergeBasicBlockIntoOnlyPred - BB is a block with one predecessor and its
112 /// predecessor is known to have one successor (BB!). Eliminate the edge
113 /// between them, moving the instructions in the predecessor into BB. This
114 /// deletes the predecessor block.
149 /// and if a predecessor branches to us and one of our successors, fold the
150 /// setcc into the predecessor and use logical operations to pick the right
|
