| /system/media/camera/docs/ |
| metadata_model.py | 172 succ = True
182 succ = False
184 succ = child.validate_tree() and succ
186 return succ
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 184 /// AddPredecessorToBlock - Update PHI nodes in Succ to indicate that there will
187 /// ExistPred, an existing predecessor of Succ.
188 static void AddPredecessorToBlock(BasicBlock *Succ, BasicBlock *NewPred,
190 if (!isa<PHINode>(Succ->begin())) return; // Quick exit if nothing to do
193 for (BasicBlock::iterator I = Succ->begin();
500 BasicBlock *Succ = BI->getSuccessor(ICI->getPredicate() == ICmpInst::ICMP_NE);
503 Succ));
658 assert(TIV && "No edge from pred to succ?");
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-regexp.cc | 1126 Label fail, succ; local
1541 unibrow::uchar succ[unibrow::Ecma262UnCanonicalize::kMaxWidth]; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| BranchFolding.cpp | 705 // are not immediately before Succ must have an unconditional branch to
706 // Succ added (but the predecessor/successor lists need no adjustment).
707 // The lone predecessor of Succ that falls through into Succ,
[all...] |
| /external/v8/test/cctest/ |
| test-regexp.cc | 1077 Label fail, succ; local
1490 unibrow::uchar succ[unibrow::Ecma262UnCanonicalize::kMaxWidth]; local
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaBasicBlock.java | 603 SsaBasicBlock succ; local
605 succ = parent.getBlocks().get(i);
606 succ.addMoveToBeginning(result, source);
[all...] |
| SCCP.java | 482 SsaBasicBlock succ = insn.getBlock().getPrimarySuccessor(); local
483 result = succ.getInsns().get(0).getResult();
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaBasicBlock.java | 604 SsaBasicBlock succ; local
606 succ = parent.getBlocks().get(i);
607 succ.addMoveToBeginning(result, source);
[all...] |
| SCCP.java | 483 SsaBasicBlock succ = insn.getBlock().getPrimarySuccessor(); local
484 result = succ.getInsns().get(0).getResult();
|
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 502 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
505 block which is either the pred or succ end of the indexed edge. */
|
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 502 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
505 block which is either the pred or succ end of the indexed edge. */
|
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| basic-block.h | 502 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
505 block which is either the pred or succ end of the indexed edge. */
|
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| basic-block.h | 502 #define EDGE_INDEX(el, pred, succ) (find_edge_index ((el), (pred), (succ)))
505 block which is either the pred or succ end of the indexed edge. */
|
| /external/llvm/include/llvm/Analysis/ |
| IntervalIterator.h | 220 // If we were in the successor list from before... remove from succ list
|
| /external/llvm/lib/Target/Mips/ |
| MipsInstrInfo.cpp | 193 // This block ends with no branches (it just falls through to its succ).
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXInstrInfo.cpp | 149 /// 1. If this block ends with no branches (it just falls through to its succ)
|
| /external/v8/src/ |
| log.cc | 94 if (Succ(head_) == tail_) {
98 head_ = Succ(head_);
108 tail_ = Succ(tail_);
122 int Succ(int index) { return (index + 1) % kBufferSize; }
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 544 * @param succ the expected current successor
548 final boolean link(Index<K,V> succ, Index<K,V> newSucc) {
550 newSucc.right = succ;
551 return n.value != null && casRight(succ, newSucc);
556 * succ. Fails (forcing a retraversal by caller) if this node
558 * @param succ the expected current successor
561 final boolean unlink(Index<K,V> succ) {
562 return !indexesDeletedNode() && casRight(succ, succ.right);
[all...] |
| LinkedTransferQueue.java | 734 final Node succ(Node p) { method in class:LinkedTransferQueue
[all...] |
| /external/clang/lib/Analysis/ |
| LiveVariables.cpp | 563 if (const CFGBlock *succ = *it) {
564 val = LV->merge(val, LV->blocksBeginToLiveness[succ]);
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| FastISel.cpp | [all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 764 void addSucc(BasicBlock *Succ) { Succs.push_back(Succ); }
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporter.cpp | [all...] |
| /art/compiler/dex/ |
| mir_graph.cc | 775 fprintf(file, " succ%04x_%d [shape=%s,label = \"{ \\\n",
800 fprintf(file, " %s:s -> succ%04x_%d:n [style=dashed]\n",
[all...] |
| /external/chromium_org/third_party/bintrees/ |
| README.txt | 106 prev/succ operations
|
