HomeSort by relevance Sort by last modified time
    Searched full:predecessor (Results 276 - 300 of 419) sorted by null

<<11121314151617

  /external/e2fsprogs/e2fsck/
dict.c 915 * Return the given node's predecessor, in the key order.
916 * The nil sentinel node is returned if there is no predecessor.
    [all...]
  /external/llvm/lib/CodeGen/
PrologEpilogInserter.cpp 741 // Check the exit state of the DFS stack predecessor.
745 "DFS stack predecessor is already visited.\n");
    [all...]
ScheduleDAG.cpp 134 // Find the matching predecessor.
SjLjEHPrepare.cpp 327 // Uses for a PHI node occur in their predecessor block.
  /external/llvm/lib/MC/
MCAssembler.cpp 488 // We should never try to compute the fragment layout if its predecessor
491 "Attempt to compute fragment before its predecessor!");
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineSelect.cpp 595 /// values (V) are live in all of the predecessor blocks of the PHI. For
    [all...]
InstCombineVectorOps.cpp 157 // Insert the new instruction into the predecessor basic block.
230 // Push extractelement into predecessor operation if legal and
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
SynchronousQueue.java 738 * Gets rid of cancelled node s with original predecessor pred.
745 * if we cannot delete s, we save its predecessor as
    [all...]
  /dalvik/vm/compiler/
Loop.cpp 199 /* Unconditional goto - continue to trace up the predecessor chain */
  /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/
implement.h 320 predecessor */
    [all...]
  /external/chromium_org/sync/internal_api/
sync_manager_impl_unittest.cc 139 BaseNode* predecessor) {
144 EXPECT_TRUE(node.InitBookmarkByCreation(parent_node, predecessor));
151 BaseNode* predecessor) {
156 EXPECT_TRUE(node.InitBookmarkByCreation(parent_node, predecessor));
    [all...]
  /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExprEngine.h 170 /// \param Node The predecessor node, from which the processing should start.
  /external/clang/lib/StaticAnalyzer/Checkers/
IdempotentOperationChecker.cpp 327 // At the post visit stage, the predecessor ExplodedNode will be the
  /external/llvm/include/llvm/ADT/
SparseMultiSet.h 147 // Is N its own predecessor?
ilist.h 307 /// linked list of nodes. One invariant of the list is that the predecessor
  /external/llvm/include/llvm/Analysis/
MemoryDependenceAnalysis.h 87 /// predecessor blocks.
  /external/llvm/include/llvm/CodeGen/
LiveInterval.h 577 // predecessor.
MachineFunction.h 506 // a function is considered to be when traversing the predecessor edges of a BB
  /external/llvm/include/llvm/IR/
Instruction.h 367 /// are considered to evaluate their operands in the corresponding predecessor
  /external/llvm/lib/CodeGen/AsmPrinter/
AsmPrinter.cpp     [all...]
  /external/llvm/lib/Target/AArch64/
AArch64BranchFixupPass.cpp 412 // Get the offset and known bits at the end of the layout predecessor.
  /external/llvm/lib/Target/ARM/
ARMConstantIslandPass.cpp     [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCContract.cpp 466 // For PHI nodes, insert the bitcast in the predecessor block.
ObjCARCOpts.cpp     [all...]
  /external/llvm/lib/Transforms/Scalar/
CodeGenPrepare.cpp 235 /// pointing to the other basic block, which has a single predecessor.
360 if (BBPreds.count(Pred)) { // Common predecessor?
501 // appropriate predecessor block.
678 /// instructions to the predecessor to enable tail call optimizations. The
    [all...]

Completed in 2262 milliseconds

<<11121314151617