| /external/chromium_org/sync/internal_api/public/base/ |
| unique_position_unittest.cc | 253 const UniquePosition& predecessor = kSortedPositionArray[i]; local
255 if (IsSuffixInUse(predecessor, suffix))
266 UniquePosition::Between(predecessor, successor, suffix);
268 EXPECT_PRED_FORMAT2(LessThan, predecessor, midpoint);
291 const UniquePosition& predecessor = kSortedPositionArray[i]; local
293 if (IsSuffixInUse(predecessor, suffix))
296 UniquePosition after = UniquePosition::After(predecessor, suffix);
298 EXPECT_PRED_FORMAT2(LessThan, predecessor, after);
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| UndefBranchChecker.cpp | 79 // Get the predecessor node and check if is a PostStmt with the Stmt
84 // Note: any predecessor will do. They should have identical state,
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 71 // (1) 1 predecessor (that has one successor)
72 // (2) 1 successor (that has one predecessor)
75 // with no predecessor is a root.
88 // (5) The 'store' is the same as the predecessor.
89 // (6) The 'GDM' is the same as the predecessor.
90 // (7) The LocationContext is the same as the predecessor.
162 // (b) changing the successors predecessor to the predecessor of this node
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| RopMethod.java | 148 * Calculates the predecessor sets for each block as well as for the
182 // Sort and immutablize all the predecessor lists.
|
| /external/llvm/include/llvm/Analysis/ |
| PHITransAddr.h | 30 /// incorrect pointer in the predecessor block.
80 /// predecessor block, inserting a computation of the value if it is
|
| LoopInfoImpl.h | 133 // The predecessor has exactly one successor, so it is a preheader.
138 /// predecessor outside the loop, return it. Otherwise return null.
140 /// the predecessor to have exactly one successor.
288 // though it is permitted if the predecessor is not itself actually
358 /// result does / not depend on use list (block predecessor) order.
409 // within this subloop tree itself. Note that a predecessor may directly
529 // Check each predecessor of the potential loop header.
|
| /external/llvm/lib/Transforms/Utils/ |
| LoopUnroll.cpp | 59 /// FoldBlockIntoPredecessor - Folds a basic block into its predecessor if it
60 /// only has one predecessor, and that predecessor only has one successor.
65 // Merge basic blocks into their predecessor if there is only one distinct
66 // pred, and if there is only one distinct successor of the predecessor, and
83 // Delete the unconditional branch from the predecessor...
90 // Move all definitions in the successor to the predecessor...
107 // Inherit predecessor's name if it exists...
|
| SimplifyCFG.cpp | 187 /// ExistPred, an existing predecessor of Succ.
467 // predecessors unless there is only one predecessor.
552 /// predecessor block, check to see if that predecessor is also a value
561 if (!PredVal) return false; // Not a value comparison in predecessor.
777 // See if the predecessor is a comparison with the same value.
805 // If there are no predecessor weights but there are successor weights,
[all...] |
| FlattenCFG.cpp | 49 /// If \param [in] BB has more than one predecessor that is a conditional
120 /// its predecessor. In Case 2, \param BB (BB3) only has conditional branches
149 // have a single predecessor (BB2) that is also a predecessor
|
| /dalvik/vm/compiler/ |
| SSATransformation.cpp | 499 * predecessor blocks
581 * from all the predecessor blocks.
586 /* Insert phi-operands with latest SSA names from predecessor blocks */
627 * from all the predecessor blocks.
632 /* Insert phi-operands with latest SSA names from predecessor blocks */
|
| /external/llvm/include/llvm/Support/ |
| CFG.h | 28 template <class Ptr, class USE_iterator> // Predecessor Iterator
71 /// getOperandNo - Return the operand number in the predecessor's
77 /// getUse - Return the operand Use in the predecessor's terminator
285 // a function is considered to be when traversing the predecessor edges of a BB
347 // a function is considered to be when traversing the predecessor edges of a BB
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 50 unsigned NumPreds; // Number of predecessor blocks.
51 BBInfo **Preds; // Array[NumPreds] of predecessor blocks.
126 // Check if BBMap already has a BBInfo for the predecessor block.
134 // Create a new BBInfo for the predecessor.
240 // Treat an unreachable predecessor as a definition with 'undef'.
|
| /external/llvm/lib/Analysis/ |
| PathNumbering.cpp | 79 // Returns an iterator over predecessor edges. Includes phony and
85 // Returns the end sentinel for the predecessor iterator.
90 // Returns the number of predecessor edges. Includes phony and
113 // Add an edge to the predecessor list.
118 // Remove an edge from the predecessor list.
|
| ProfileEstimatorPass.cpp | 139 // If this block is a loop header and the predecessor is contained in this
369 // Try each predecessor if it can be assumend.
374 // Check that edge from predecessor is still free.
376 // Check if there is a circle from this block to predecessor.
|
| /external/chromium/chrome/browser/sync/ |
| profile_sync_service_bookmark_unittest.cc | 104 sync_api::ReadNode* predecessor = NULL; local
107 predecessor = &predecessor_node;
111 node.InitByCreation(type, root, predecessor);
147 sync_api::ReadNode predecessor(trans_);
148 EXPECT_TRUE(predecessor.InitByIdLookup(predecessor_id));
149 EXPECT_EQ(predecessor.GetParentId(), parent.GetId());
151 &predecessor));
217 // Set a new parent and predecessor value. Return the old parent id.
218 // We could return the old predecessor id, but it turns out not to be
229 sync_api::ReadNode predecessor(trans_)
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineVerifier.cpp | 123 // Set versions of block's predecessor and successor lists.
326 "BundledSucc was set on predecessor", MBBI);
329 "but BundledSucc not set on predecessor", MBBI);
471 report("MBB has duplicate entries in its predecessor list.", I);
522 *OS << "MBB is not in the predecessor list of the successor BB#"
527 // Check the predecessor list.
531 report("MBB has predecessor that isn't part of the function.", MBB);
534 *OS << "MBB is not in the successor list of the predecessor BB#"
[all...] |
| PHIElimination.cpp | 65 /// in predecessor basic blocks.
147 // Eliminate PHI instructions by inserting copies into predecessor blocks.
179 /// predecessor basic blocks.
355 // IncomingReg register in the corresponding predecessor basic block.
404 // out of the predecessor. We can also ignore undef sources.
632 // LiveVariables considers uses in PHIs to be in the predecessor basic block,
635 // in the predecessor basic block, so that a register used only in a PHI is live
|
| /art/compiler/sea_ir/ir/ |
| sea.cc | 91 // NewIDom = first (processed) predecessor of b.
509 // The reaching_defs variable will contain reaching defs __for current predecessor only__
515 // The definitions from the reaching set of the predecessor
516 // may be shadowed by downward exposed definitions from the predecessor,
528 // Now we combine the reaching map coming from the current predecessor (reaching_defs)
586 const utils::ScopedHashtable<int, InstructionNode*>* scoped_table, Region* predecessor) {
589 if (predecessors_.at(crt_pred_id) == predecessor) {
|
| /dalvik/vm/analysis/ |
| VfyBasicBlock.cpp | 80 * addresses will only have one predecessor, but a fair number will
105 * Add "curBlock" to the predecessor list in "targetIdx".
145 * Add ourselves to the predecessor list in all blocks we might transfer
320 * new BB, or when we need to add an item to the predecessor list in
|
| /external/bison/lib/ |
| fopen.c | 65 its predecessor."
|
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| ExplodedGraph.h | 68 /// predecessor and many have only one successor. It can also be used to
176 /// addPredeccessor - Adds a predecessor to the current node, and
203 // Iterators over successor and predecessor vertices.
269 /// BVC - Allocator and context for allocating nodes and their predecessor
|
| /external/clang/lib/Analysis/ |
| CFGReachabilityAnalysis.cpp | 64 // Don't insert Dst -> Dst unless it was a predecessor of itself
|
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 302 * where we're also given a pointer to n (predecessor).
304 void llvm_gcda_increment_indirect_counter(uint32_t *predecessor,
309 pred = *predecessor;
322 *counter, *predecessor);
|
| /external/llvm/lib/Transforms/Scalar/ |
| SimplifyCFGPass.cpp | 14 // * Merges a basic block into its predecessor if there is only one and the
15 // predecessor only has one successor.
16 // * Eliminates PHI nodes for basic blocks with a single predecessor.
291 // predecessor but that return different things.
|
| /external/llvm/test/CodeGen/Hexagon/ |
| BranchPredict.ll | 5 ; block as the fall-through block. The unconditional jump in the predecessor
|
