| /external/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 209 if (!TBI->Succ) {
218 unsigned SuccNum = TBI->Succ->getNumber();
353 const MachineBasicBlock *Succ = *I;
355 if (CurLoop && Succ == CurLoop->getHeader())
358 if (isExitingLoop(CurLoop, getLoopFor(Succ)))
361 getHeightResources(Succ);
368 Best = Succ, BestHeight = Height;
493 DEBUG(dbgs() << " succ for BB#" << I->getNumber() << ": ");
496 TBI.Succ = pickTraceSucc(*I);
498 if (TBI.Succ)
[all...] |
| UnreachableBlockElim.cpp | 152 MachineBasicBlock* succ = *BB->succ_begin(); local
154 MachineBasicBlock::iterator start = succ->begin();
155 while (start != succ->end() && start->isPHI()) {
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| SsaConverter.java | 246 SsaBasicBlock succ = blocks.get(j); local
248 if (needsNewSuccessor(block, succ)) {
249 block.insertNewSuccessor(succ);
262 * @param succ successor node
266 SsaBasicBlock succ) {
272 && succ.getPredecessors().cardinality() > 1;
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| SsaConverter.java | 247 SsaBasicBlock succ = blocks.get(j); local
249 if (needsNewSuccessor(block, succ)) {
250 block.insertNewSuccessor(succ);
263 * @param succ successor node
267 SsaBasicBlock succ) {
273 && succ.getPredecessors().cardinality() > 1;
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| OptimalEdgeProfiling.cpp | 183 BasicBlock *Succ = TI->getSuccessor(s);
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ);
189 Succ = TI->getSuccessor(s);
191 InsertedBlocks.insert(Succ);
202 printEdgeCounter(edge, Succ, i);
203 IncrementCounterInBlock(Succ, i, Counters); ++NumEdgesInserted;
|
| /external/clang/lib/Analysis/ |
| CFG.cpp | 296 CFGBlock *Succ;
338 Block(NULL), Succ(NULL),
645 Succ = createBlock();
646 assert(Succ == &cfg->getExit());
670 Succ = B;
716 if (add_successor && Succ)
717 addSuccessor(B, Succ);
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlock.java | 186 int succ = successors.get(0); local
187 if (succ == primarySuccessor) {
188 succ = successors.get(1);
191 return succ;
|
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlock.java | 186 int succ = successors.get(0); local
187 if (succ == primarySuccessor) {
188 succ = successors.get(1);
191 return succ;
|
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| BasicBlock.java | 186 int succ = successors.get(0); local
187 if (succ == primarySuccessor) {
188 succ = successors.get(1);
191 return succ;
|
| /external/llvm/lib/Analysis/ |
| ProfileInfo.cpp | 250 succ_const_iterator Succ = succ_begin(BB), End = succ_end(BB);
251 if (Succ == End) {
258 for(;Succ != End; ++Succ) {
259 if (P.find(*Succ) != P.end()) continue;
260 Edge e = getEdge(BB,*Succ);
262 P[*Succ] = BB;
263 BFS.push(*Succ);
264 if ((Mode & GetPathToDest) && *Succ == Dest) {
266 BB = *Succ;
[all...] |
| /dalvik/dx/src/com/android/dx/command/dump/ |
| BlockDumper.java | 249 int succ = successors.get(j); local
250 parsed(bytes, end, 0, "next " + Hex.u2(succ));
333 int succ = successors.get(i); local
335 sb.append(Hex.u2(succ));
337 if ((ssz != 1) && (succ == primary)) {
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 196 * - all live nodes are reachable from head via succ()
210 * - the last node is always reachable from tail via succ()
270 * as sentinel for succ(), below.
282 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
418 for (Node<E> p = first(); p != null; p = succ(p))
436 for (Node<E> p = first(); p != null; p = succ(p)) {
458 for (Node<E> p = first(); p != null; p = succ(p)) {
463 Node<E> next = succ(p);
552 for (Node<E> p = first(); p != null; p = succ(p)) {
600 for (p = first(); p != null && k < a.length; p = succ(p))
[all...] |
| /external/llvm/lib/MC/ |
| MCObjectDisassembler.cpp | 105 void addSucc(BBInfo &Succ) {
106 Succs.insert(&Succ);
107 Succ.Preds.insert(this);
|
| /system/media/camera/docs/ |
| metadata-generate | 61 local succ=$?
63 if [[ $succ -eq 0 ]]
73 return $succ
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUIndirectAddressing.cpp | 131 for (MachineBasicBlock::succ_iterator Succ = MBB.succ_begin(),
133 SuccEnd != Succ; ++Succ) {
137 (*Succ)->addLiveIn(Key->second);
|
| /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 | 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/chromium_org/v8/src/ |
| hydrogen-check-elimination.cc | 120 HCheckTable* Copy(HBasicBlock* succ, Zone* zone) {
130 if (succ->predecessors()->length() == 1) {
131 HControlInstruction* end = succ->predecessors()->at(0)->end();
132 if (end->IsCompareMap() && end->SuccessorAt(0) == succ) {
151 HCheckTable* Merge(HBasicBlock* succ, HCheckTable* that, Zone* zone) {
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyImpl.h | 333 BlockT *Succ = *SI;
334 OS << " " << getBlockName(BB) << " -> " << getBlockName(Succ)
335 << " = " << getEdgeFreq(BB, Succ) << "\n";
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| DependencyAnalysis.cpp | 255 const BasicBlock *Succ = *SI;
256 if (Succ != StartBB && !Visited.count(Succ)) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 206 Loop *succ = LI->getLoopFor(SuccToSinkTo);
208 if (succ != 0 && succ != cur)
|
| /external/llvm/lib/Transforms/Utils/ |
| 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/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));
|
