| /external/llvm/test/Transforms/SimplifyCFG/ |
| 2008-05-16-PHIBlockMerge.ll | 19 br label %Succ
21 Succ: ; preds = %Common, %BB.nomerge
26 Common: ; preds = %Succ
28 br i1 %cond, label %BB.nomerge, label %Succ
30 Exit: ; preds = %Succ
40 br label %Succ
42 Succ: ; preds = %Common, %BB.nomerge
49 Common: ; preds = %Succ
51 br i1 %cond, label %BB.nomerge, label %Succ
53 Exit: ; preds = %Succ
[all...] |
| /external/clang/test/SemaTemplate/ |
| alias-church-numerals.cpp | 9 template<template<template<typename> class, typename> class N, template<typename> class F, typename X> using Succ = F<N<F,X>>;
11 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>;
12 template<template<typename> class F, typename X> using Two = Succ<One, F, X>;
|
| /external/llvm/lib/Analysis/ |
| PathNumbering.cpp | 291 for( BLEdgeIterator succ = node->succBegin(), end = node->succEnd();
292 succ != end; oldTarget = (*succ)->getTarget()->getBlock(), succ++ ) {
294 if( (*succ)->getType() == BallLarusEdge::NORMAL ) {
296 if( oldTarget != (*succ)->getTarget()->getBlock() )
299 // create the new phony edge: root -> succ
301 addEdge(getRoot(), (*succ)->getTarget(), duplicateNumber++);
303 rootEdge->setRealEdge(*succ);
306 (*succ)->setType(BallLarusEdge::SPLITEDGE)
[all...] |
| BranchProbabilityInfo.cpp | 189 BasicBlock *Succ = *I;
190 if (isReturningBlock(Succ))
191 ReturningEdges.insert(Succ);
193 StayEdges.insert(Succ);
270 BasicBlock *Succ = *I;
271 Loop *SuccL = LI->getLoopFor(Succ);
273 ExitingEdges.insert(Succ);
274 else if (Succ == L->getHeader())
275 BackEdges.insert(Succ);
277 InEdges.insert(Succ);
[all...] |
| 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...] |
| /external/llvm/lib/CodeGen/ |
| MachineBranchProbabilityInfo.cpp | 35 MachineBasicBlock *Succ = *I;
36 uint32_t Weight = getEdgeWeight(MBB, Succ);
74 MachineBasicBlock *Succ = *I;
75 uint32_t Weight = getEdgeWeight(MBB, Succ);
83 MaxSucc = Succ;
|
| MachineBasicBlock.cpp | 341 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
351 Successors.push_back(succ);
352 succ->addPredecessor(this);
355 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
356 succ->removePredecessor(this);
357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
414 MachineBasicBlock *Succ = *fromMBB->succ_begin();
422 addSuccessor(Succ, weight);
423 fromMBB->removeSuccessor(Succ);
433 MachineBasicBlock *Succ = *fromMBB->succ_begin()
[all...] |
| ShrinkWrapping.cpp | 207 MachineBasicBlock* SUCC = *SI;
208 if (SUCC != MBB)
209 successors.push_back(SUCC);
215 MachineBasicBlock* SUCC = successors[i];
217 AnticOut[MBB] = AnticIn[SUCC];
219 SUCC = successors[i];
220 AnticOut[MBB] &= AnticIn[SUCC];
475 MachineBasicBlock* SUCC = *SI;
476 if (CSRUsed[SUCC] != UsedCSRegs)
562 MachineBasicBlock* SUCC = *SI
[all...] |
| UnreachableBlockElim.cpp | 152 MachineBasicBlock* succ = *BB->succ_begin(); local
154 MachineBasicBlock::iterator start = succ->begin();
155 while (start != succ->end() && start->isPHI()) {
|
| /external/safe-iop/src/ |
| safe_iop.c | 1091 int tests = 0, succ = 0, fail = 0; local
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| Local.cpp | 153 BasicBlock *Succ = SI->getSuccessor(i);
154 if (Succ == TheOnlyDest)
157 Succ->removePredecessor(BB);
475 /// almost-empty BB ending in an unconditional branch to Succ, into succ.
477 /// Assumption: Succ is the single successor for BB.
479 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
480 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
483 << Succ->getName() << "\n")
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| CoreEngine.cpp | 169 const CFGBlock *Succ = *(Entry->succ_begin());
173 BlockEdge StartLoc(Entry, Succ, L);
550 ExplodedNode *Succ = C.Eng.G->getNode(Loc, N->State, &IsNew);
551 Succ->addPredecessor(N, *C.Eng.G);
554 C.Eng.WList->enqueue(Succ, C.Block, Idx+1);
578 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
579 return Succ;
588 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(),
591 Succ->addPredecessor(Pred, *Eng.G);
596 Succ->markAsSink()
[all...] |
| /external/valgrind/main/memcheck/tests/x86-linux/ |
| scalar.c | 125 SY(__NR_getpid); SUCC;
141 SY(__NR_getuid); SUCC;
154 SY(__NR_alarm, x0); SUCC;
182 SY(__NR_nice, x0); SUCC;
190 SY(__NR_sync); SUCC;
194 SY(__NR_kill, x0, x0); SUCC;
226 SY(__NR_brk, x0); SUCC;
234 SY(__NR_getgid); SUCC;
242 SY(__NR_geteuid); SUCC;
246 SY(__NR_getegid); SUCC;
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| LocalVariableExtractor.java | 182 int succ = successors.get(i); local
183 RegisterSpecSet state = (succ == primarySuccessor) ?
186 if (resultInfo.mergeStarts(succ, state)) {
187 Bits.set(workSet, succ);
|
| 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/ |
| LocalVariableExtractor.java | 182 int succ = successors.get(i); local
183 RegisterSpecSet state = (succ == primarySuccessor) ?
186 if (resultInfo.mergeStarts(succ, state)) {
187 Bits.set(workSet, succ);
|
| 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/ssa/ |
| LocalVariableExtractor.java | 199 int succ = successors.get(i); local
200 RegisterSpecSet state = (succ == primarySuccessor) ?
203 if (resultInfo.mergeStarts(succ, state)) {
204 workSet.set(succ);
|
| 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/valgrind/main/memcheck/tests/darwin/ |
| scalar.c | 79 SY(__NR_getfsstat, x0+1, x0+1, x0); SUCC; // This should fail...
631 SY(__NR_getfsstat64, x0+1, x0+1, x0); SUCC; // This should fail...
718 SY(__NR_getpid); SUCC;
734 SY(__NR_getuid); SUCC;
747 SY(__NR_alarm, x0); SUCC;
775 SY(__NR_nice, x0); SUCC;
783 SY(__NR_sync); SUCC;
787 SY(__NR_kill, x0, x0); SUCC;
819 SY(__NR_brk, x0); SUCC;
827 SY(__NR_getgid); SUCC;
[all...] |
| /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 | 256 CFGBlock *Succ;
293 Block(NULL), Succ(NULL),
517 Succ = createBlock();
518 assert(Succ == &cfg->getExit());
542 Succ = B;
588 if (add_successor && Succ)
589 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 | 180 * - all live nodes are reachable from head via succ()
194 * - the last node is always reachable from tail via succ()
255 * as sentinel for succ(), below.
267 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
403 for (Node<E> p = first(); p != null; p = succ(p))
421 for (Node<E> p = first(); p != null; p = succ(p)) {
443 for (Node<E> p = first(); p != null; p = succ(p)) {
448 Node<E> next = succ(p);
537 for (Node<E> p = first(); p != null; p = succ(p)) {
586 for (p = first(); p != null && k < a.length; p = succ(p))
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopUnswitch.cpp | [all...] |
