| /external/clang/lib/Analysis/ |
| CFG.cpp | 258 CFGBlock *Succ;
300 Block(NULL), Succ(NULL),
607 Succ = createBlock();
608 assert(Succ == &cfg->getExit());
632 Succ = B;
678 if (add_successor && Succ)
679 addSuccessor(B, Succ);
[all...] |
| /dalvik/dx/src/com/android/dx/command/dump/ |
| BlockDumper.java | 251 int succ = successors.get(j); local
252 parsed(bytes, end, 0, "next " + Hex.u2(succ));
335 int succ = successors.get(i); local
337 sb.append(Hex.u2(succ));
339 if ((ssz != 1) && (succ == primary)) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 197 * - all live nodes are reachable from head via succ()
211 * - the last node is always reachable from tail via succ()
272 * as sentinel for succ(), below.
284 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
420 for (Node<E> p = first(); p != null; p = succ(p))
438 for (Node<E> p = first(); p != null; p = succ(p)) {
460 for (Node<E> p = first(); p != null; p = succ(p)) {
465 Node<E> next = succ(p);
554 for (Node<E> p = first(); p != null; p = succ(p)) {
602 for (p = first(); p != null && k < a.length; p = succ(p))
[all...] |
| /external/llvm/lib/CodeGen/ |
| UnreachableBlockElim.cpp | 152 MachineBasicBlock* succ = *BB->succ_begin(); local
154 MachineBasicBlock::iterator start = succ->begin();
155 while (start != succ->end() && start->isPHI()) {
|
| /external/valgrind/main/memcheck/tests/x86-linux/ |
| scalar.h | 31 #define SUCC assert(-1 != res);
|
| /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...] |
| gencode.h | 225 struct block *succ; member in struct:edge
329 #define JT(b) ((b)->et.succ)
330 #define JF(b) ((b)->ef.succ)
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineBasicBlock.h | 349 /// addSuccessor - Add succ as a successor of this MachineBasicBlock.
350 /// The Predecessors list of succ is automatically updated. WEIGHT
356 void addSuccessor(MachineBasicBlock *succ, uint32_t weight = 0);
359 /// MachineBasicBlock. The Predecessors list of succ is automatically updated.
361 void removeSuccessor(MachineBasicBlock *succ);
364 /// this MachineBasicBlock. The Predecessors list of succ is automatically
438 MachineBasicBlock *SplitCriticalEdge(MachineBasicBlock *Succ, Pass *P);
577 uint32_t getSuccWeight(const_succ_iterator Succ) const;
|
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 242 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ) {
249 if (Term->getSuccessor(i) == Succ)
256 BasicBlock *llvm::SplitEdge(BasicBlock *BB, BasicBlock *Succ, Pass *P) {
257 unsigned SuccNum = GetSuccessorNumber(BB, Succ);
264 // If the edge isn't critical, then BB has a single successor or Succ has a
267 if (BasicBlock *SP = Succ->getSinglePredecessor()) {
272 return SplitBlock(Succ, Succ->begin(), P);
278 "Should have a single succ!");
|
| LowerSwitch.cpp | 201 BasicBlock* Succ = Leaf.BB;
202 BranchInst::Create(Succ, Default, Comp, NewLeaf);
206 for (BasicBlock::iterator I = Succ->begin(); isa<PHINode>(I); ++I) {
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 328 BlockT *Succ = *SI;
329 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ)
330 << " = " << getEdgeFreq(BB, Succ) << "\n";
|
| 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/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 85 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
127 inline bool SplitCriticalEdge(BasicBlock *Succ, pred_iterator PI, Pass *P = 0) {
131 if (TI->getSuccessor(i) == Succ)
|
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 206 Loop *succ = LI->getLoopFor(SuccToSinkTo);
208 if (succ != 0 && succ != cur)
|
| LoopUnswitch.cpp | [all...] |
| /external/llvm/tools/llvm-prof/ |
| llvm-prof.cpp | 109 BasicBlock* Succ = TI->getSuccessor(s);
110 double w = ignoreMissing(PI.getEdgeWeight(std::make_pair(BB, Succ)));
112 SuccCounts.push_back(std::make_pair(std::make_pair(BB, Succ), w));
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| util.rb | 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
|
| /external/dbus/test/ |
| decode-gcov.c | 628 Arc *succ; member in struct:Block
689 arc->succ_next = function->block_graph[source].succ;
690 function->block_graph[source].succ = arc;
727 /* Must reverse the order of all succ arcs, to ensure that they match
733 if (func->block_graph[i].succ)
734 func->block_graph[i].succ = reverse_arcs (func->block_graph[i].succ);
933 current_arc = current_func->block_graph[current_block].succ;
981 current_arc = current_func->block_graph[current_block].succ;
1051 current_arc = current_func->block_graph[current_block].succ;
[all...] |
| /external/llvm/lib/VMCore/ |
| 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/skia/third_party/glu/libtess/ |
| dict-list.h | 79 * key is NULL. Similarly, Succ(Max(d)) has a NULL key, etc.
|
| dict.h | 81 * key is NULL. Similarly, Succ(Max(d)) has a NULL key, etc.
|
| /external/valgrind/main/memcheck/tests/darwin/ |
| scalar.h | 34 #define SUCC assert(-1 != res);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| ExplodedGraph.cpp | 84 const ExplodedNode *succ = *(node->succ_begin()); local
85 if (succ->pred_size() != 1)
119 const ProgramPoint SuccLoc = succ->getLocation();
134 ExplodedNode *succ = *(node->succ_begin()); local
135 pred->replaceSuccessor(succ);
136 succ->replacePredecessor(pred);
|
| /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) {
|
