| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| util.rb | 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
|
| /external/chromium_org/tools/gn/ |
| label_unittest.cc | 26 // cur input succ expected dir name tc dir tc name
|
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 43 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
|
| DominatorInternals.h | 93 typename GraphT::NodeType* Succ = *NextSucc;
96 DT.Info[Succ];
99 Worklist.push_back(std::make_pair(Succ, GraphT::child_begin(Succ)));
|
| RegionIterator.h | 70 RegionNode *succ; local
71 succ = getNode()->getParent()->getNode(BB);
72 assert(succ && "BB not in Region or entered subregion!");
73 return succ;
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 344 BasicBlock *Succ = TI->getSuccessor(i);
345 // N.B. Succ might not be a complete BasicBlock, so don't assume
347 for (iterator II = Succ->begin(), IE = Succ->end(); II != IE; ++II) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | [all...] |
| StructurizeCFG.cpp | 300 BasicBlock *Succ = Term->getSuccessor(i);
302 if (Visited.count(Succ))
303 Loops[Succ] = BB;
374 BasicBlock *Succ = Term->getSuccessor(i);
375 if (Succ != BB)
|
| /external/valgrind/main/memcheck/tests/darwin/ |
| scalar.h | 34 #define SUCC assert(-1 != res);
|
| /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/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 105 const ExplodedNode *succ = *(node->succ_begin()); local
106 if (succ->pred_size() != 1)
151 const ProgramPoint SuccLoc = succ->getLocation();
166 ExplodedNode *succ = *(node->succ_begin()); local
167 pred->replaceSuccessor(succ);
168 succ->replacePredecessor(pred);
|
| BugReporterVisitors.cpp | 450 PathDiagnosticPiece *FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ,
481 // (1) Succ has this binding and Pred does not, i.e. this is
483 // (2) Succ has this binding and is a PostStore node for this region, i.e.
486 if (Succ->getState()->getSVal(R) != V)
490 Optional<PostStore> PS = Succ->getLocationAs<PostStore>();
495 StoreSite = Succ;
499 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>())
508 if (Optional<CallEnter> CE = Succ->getLocationAs<CallEnter>()) {
516 Succ->getState());
811 SuppressInlineDefensiveChecksVisitor::VisitNode(const ExplodedNode *Succ,
[all...] |
| /external/llvm/include/llvm/Support/ |
| IntegersSubsetMapping.h | 398 void detachCase(self& NewMapping, SuccessorClass *Succ) {
400 if (i->second == Succ) {
408 void removeCase(SuccessorClass *Succ) {
410 if (i->second == Succ) {
550 const IntTy* getCaseSingleNumber(SuccessorClass *Succ) {
553 if (i->second == Succ) {
|
| /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...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 241 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) {
242 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
249 // If the edge isn't critical, then BB has a single successor or Succ has a
252 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
257 return SplitBlock(Succ, Succ->begin(), P);
263 "Should have a single succ!");
|
| /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));
|
| /external/chromium_org/v8/src/ |
| hydrogen-load-elimination.cc | 138 HLoadEliminationTable* Copy(HBasicBlock* succ, Zone* zone) {
146 TRACE((" copy-to B%d\n", succ->block_id()));
154 HLoadEliminationTable* Merge(HBasicBlock* succ,
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 319 // Invariant: Required == (Required union succ*(Required))
333 // succ(CurrentSet) subset Required
335 // succ(CurrentMinSet) subset Required
|
| /external/clang/lib/Analysis/ |
| UninitializedValues.cpp | 570 const CFGBlock *Succ = *I;
571 if (Succ && SuccsVisited[Succ->getBlockID()] >= Succ->succ_size() &&
572 vals.getValue(Block, Succ, vd) == Uninitialized) {
578 const Stmt *Label = Succ->getLabel();
|
| /external/clang/include/clang/StaticAnalyzer/Core/BugReporter/ |
| BugReporterVisitor.h | 58 virtual PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
328 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 106 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) {
110 if (TI->getSuccessor(i) == Succ)
|
| /external/llvm/lib/Analysis/ |
| CFG.cpp | 73 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) {
80 if (Term->getSuccessor(i) == Succ)
|
| /dalvik/dx/src/com/android/dx/command/dump/ |
| DotDumper.java | 38 * Dumps the pred/succ graph of methods into a format compatible
|
