HomeSort by relevance Sort by last modified time
    Searched refs:succ (Results 26 - 50 of 76) sorted by null

12 3 4

  /external/llvm/lib/Transforms/Scalar/
Sink.cpp 206 Loop *succ = LI->getLoopFor(SuccToSinkTo);
208 if (succ != 0 && succ != cur)
  /external/libpcap/
optimize.c 294 if (ep->succ) {
295 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
296 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
1288 * Return true if any register that is used on exit from 'succ', has
1293 use_conflict(b, succ)
1294 struct block *b, *succ;
1297 atomset use = succ->out_use;
1304 if (b->val[atom] != succ->val[atom])
1371 if (JT(ep->succ) == 0)
1374 if (JT(ep->succ) == JF(ep->succ))
    [all...]
  /art/compiler/dex/
ssa_transformation.cc 70 std::vector<BasicBlock*> succ; local
72 succ.push_back(block);
73 while (!succ.empty()) {
74 BasicBlock* curr = succ.back();
78 succ.push_back(next_successor);
83 succ.pop_back();
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
util.rb 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentLinkedDeque.java 228 * - all live nodes are reachable from the first node via succ()
697 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
796 for (Node<E> p = first(); p != null; p = succ(p)) {
    [all...]
LinkedTransferQueue.java 734 final Node succ(Node p) { method in class:LinkedTransferQueue
    [all...]
LinkedBlockingDeque.java 1053 private Node<E> succ(Node<E> n) { method in class:LinkedBlockingDeque.AbstractItr
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
RopTranslator.java 263 int succ = block.getPrimarySuccessor(); local
271 if ((succ >= 0) && (succ != nextLabel)) {
286 output.reverseBranch(1, addresses.getStart(succ));
295 addresses.getStart(succ));
  /dalvik/dx/src/com/android/dx/dex/code/
RopTranslator.java 269 int succ = block.getPrimarySuccessor(); local
277 if ((succ >= 0) && (succ != nextLabel)) {
292 output.reverseBranch(1, addresses.getStart(succ));
301 addresses.getStart(succ));
  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
RopTranslator.java 270 int succ = block.getPrimarySuccessor(); local
278 if ((succ >= 0) && (succ != nextLabel)) {
293 output.reverseBranch(1, addresses.getStart(succ));
302 addresses.getStart(succ));
  /system/media/camera/docs/
metadata_model.py 172 succ = True
182 succ = False
184 succ = child.validate_tree() and succ
186 return succ
    [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();
  /dalvik/dx/src/com/android/dx/cf/code/
Ropper.java 769 int succ = successors.get(i); local
771 mergeAndWorkAsNecessary(succ, block.getLabel(),
774 ex.addContext("...while merging to block " + Hex.u2(succ));
1668 int succ = successors.get(i); local
    [all...]
  /external/llvm/lib/CodeGen/
MachineBasicBlock.cpp 482 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
492 Successors.push_back(succ);
493 succ->addPredecessor(this);
496 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
497 succ->removePredecessor(this);
498 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
579 MachineBasicBlock *Succ = *fromMBB->succ_begin();
586 addSuccessor(Succ, Weight);
587 fromMBB->removeSuccessor(Succ);
597 MachineBasicBlock *Succ = *fromMBB->succ_begin()
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
DeadStoresChecker.cpp 98 if (const CFGBlock *succ = *i)
99 worklist.push_back(succ);
  /external/llvm/include/llvm/Analysis/
DependenceAnalysis.h 196 void setNextSuccessor(const Dependence *succ) {
197 NextSuccessor = succ;
    [all...]
  /external/llvm/include/llvm/CodeGen/
MachineBasicBlock.h 357 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
358 /// The Predecessors list of succ is automatically updated. WEIGHT
364 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0);
367 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
369 void removeSuccessor(MachineBasicBlock *succ);
372 /// this MachineBasicBlock. The Predecessors list of succ is automatically
446 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P);
634 uint32_t getSuccWeight(const_succ_iterator Succ) const;
  /external/clang/lib/Analysis/
LiveVariables.cpp 563 if (const CFGBlock *succ = *it) {
564 val = LV->merge(val, LV->blocksBeginToLiveness[succ]);
  /external/clang/lib/StaticAnalyzer/Core/
CoreEngine.cpp 184 const CFGBlock *Succ = *(Entry->succ_begin());
188 BlockEdge StartLoc(Entry, Succ, L);
376 if (const CFGBlock *succ = *it) {
377 generateNode(BlockEdge(B, succ, Pred->getLocationContext()),
547 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew);
548 Succ->addPredecessor(N, *G);
551 WList->enqueue(Succ, Block, Idx+1);
642 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
643 return Succ;
651 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock()
    [all...]
  /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. */

Completed in 538 milliseconds

12 3 4