HomeSort by relevance Sort by last modified time
    Searched full:succ (Results 1 - 25 of 181) sorted by null

1 2 3 4 5 6 7 8

  /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...]
EqualPHIEdgeBlockMerge.ll 144 br label %Succ
146 Succ: ; preds = %Common, %BB.nomerge
151 Common: ; preds = %Succ
153 br i1 %cond, label %BB.nomerge, label %Succ
155 Exit: ; preds = %Succ
165 br label %Succ
167 Succ: ; preds = %Common, %BB.nomerge
174 Common: ; preds = %Succ
176 br i1 %cond, label %BB.nomerge, label %Succ
178 Exit: ; preds = %Succ
    [all...]
  /art/compiler/optimizing/
pretty_printer_test.cc 47 "BasicBlock 0, succ: 1\n"
49 "BasicBlock 1, pred: 0, succ: 2\n"
59 "BasicBlock 0, succ: 1\n"
61 "BasicBlock 1, pred: 0, succ: 2\n"
63 "BasicBlock 2, pred: 1, succ: 3\n"
78 "BasicBlock 0, succ: 1\n"
80 "BasicBlock 1, pred: 0, succ: 2\n"
82 "BasicBlock 2, pred: 1, succ: 3\n"
84 "BasicBlock 3, pred: 2, succ: 4\n"
99 "BasicBlock 0, succ: 1\n
    [all...]
ssa_test.cc 106 "BasicBlock 0, succ: 1\n"
109 "BasicBlock 1, pred: 0, succ: 5, 2\n"
112 "BasicBlock 2, pred: 1, succ: 3\n"
114 "BasicBlock 3, pred: 2, 5, succ: 4\n"
119 "BasicBlock 5, pred: 1, succ: 3\n"
135 "BasicBlock 0, succ: 1\n"
139 "BasicBlock 1, pred: 0, succ: 5, 2\n"
142 "BasicBlock 2, pred: 1, succ: 3\n"
144 "BasicBlock 3, pred: 2, 5, succ: 4\n"
150 "BasicBlock 5, pred: 1, succ: 3\n
    [all...]
  /external/chromium_org/third_party/bintrees/bintrees/
walker.py 96 succ = None
101 if (succ is None) or less_than(node.key, succ.key):
102 succ = node
115 if succ is None:
116 succ = node
117 elif less_than(node.key, succ.key):
118 succ = node
119 elif succ is None: # given key is biggest in tree
121 return (succ.key, succ.value
    [all...]
  /external/qemu/distrib/sdl-1.2.15/src/main/symbian/EKA2/
vectorbuffer.h 30 inline TNode* Succ();
38 inline TNodeBuffer::TNode* TNodeBuffer::TNode::Succ()
74 __ASSERT_DEBUG(iBottom < iBottom->Succ(), VECPANIC(KErrCorrupt));
76 reinterpret_cast<const TUint8*>(iBottom->Succ()) -
113 if(iBottom->Succ()->Ptr() - iBuffer > (C - (len + TInt(sizeof(TNode)))))
139 if(iTop->Succ() == NULL)
151 __ASSERT_ALWAYS(iTop->Succ() != NULL, VECPANIC(KErrUnderflow)); //can never pass-by bottom
153 iTop = iTop->Succ();
177 TNode* t = iTop->Size() > 0 ? iTop : iTop->Succ(); //eliminate terminator
180 TNode* nt = t->Succ();
    [all...]
  /external/clang/test/SemaTemplate/
alias-church-numerals.cpp 10 template<template<template<typename> class, typename> class N, template<typename> class F, typename X> using Succ = F<N<F,X>>;
12 template<template<typename> class F, typename X> using One = Succ<Zero, F, X>;
13 template<template<typename> class F, typename X> using Two = Succ<One, F, X>;
  /external/chromium_org/v8/src/
hydrogen-escape-analysis.cc 252 HBasicBlock* succ = block->end()->SuccessorAt(i); local
253 if (!allocate_block->Dominates(succ)) continue;
254 if (succ->predecessors()->length() == 1) {
256 SetStateAt(succ, state);
257 } else if (StateAt(succ) == NULL && succ->IsLoopHeader()) {
260 SetStateAt(succ, NewStateForLoopHeader(succ->first(), state));
261 } else if (StateAt(succ) == NULL) {
264 SetStateAt(succ, NewStateCopy(succ->first(), state))
    [all...]
hydrogen-flow-engine.h 39 inline NoState* Copy(HBasicBlock* succ, Zone* zone) {
45 inline NoState* Merge(HBasicBlock* succ, NoState* other, Zone* zone) {
123 HBasicBlock* succ = block->end()->SuccessorAt(i); local
124 IncrementPredecessorCount(succ);
126 if (max == 1 && succ->predecessors()->length() == 1) {
128 SetStateAt(succ, state);
131 SetStateAt(succ,
132 State::Merge(StateAt(succ), succ, state, block, zone_));
hydrogen-check-elimination.cc 176 HCheckTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, Zone* zone) {
187 old_entry->check_->block()->Dominates(succ)) {
198 // Create entries for succ block's phis.
199 if (!succ->IsLoopHeader() && succ->phis()->length() > 0) {
200 int pred_index = succ->PredecessorIndexOf(from_block);
202 phi_index < succ->phis()->length();
204 HPhi* phi = succ->phis()->at(phi_index);
218 if (succ->predecessors()->length() == 1) {
219 HControlInstruction* end = succ->predecessors()->at(0)->end()
557 int succ; local
598 int succ = 1; local
610 int succ; local
    [all...]
  /external/safe-iop/src/
safe_iop.c 1091 int tests = 0, succ = 0, fail = 0; local
    [all...]
  /external/llvm/lib/CodeGen/
MachineBasicBlock.cpp 488 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
498 Successors.push_back(succ);
499 succ->addPredecessor(this);
502 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) {
503 succ->removePredecessor(this);
504 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
585 MachineBasicBlock *Succ = *fromMBB->succ_begin();
592 addSuccessor(Succ, Weight);
593 fromMBB->removeSuccessor(Succ);
603 MachineBasicBlock *Succ = *fromMBB->succ_begin()
    [all...]
  /external/clang/lib/StaticAnalyzer/Checkers/
TestAfterDivZeroChecker.cpp 73 PathDiagnosticPiece *VisitNode(const ExplodedNode *Succ,
97 PathDiagnosticPiece *DivisionBRVisitor::VisitNode(const ExplodedNode *Succ,
106 if (Optional<PostStmt> P = Succ->getLocationAs<PostStmt>())
118 ProgramStateRef State = Succ->getState();
119 SVal S = State->getSVal(E, Succ->getLocationContext());
120 if (ZeroSymbol == S.getAsSymbol() && SFC == Succ->getStackFrame()) {
124 ProgramPoint P = Succ->getLocation();
  /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()),
552 ExplodedNode *Succ = G->getNode(Loc, N->getState(), false, &IsNew);
553 Succ->addPredecessor(N, *G);
556 WList->enqueue(Succ, Block, Idx+1);
647 ExplodedNode *Succ = generateNodeImpl(Loc, State, NodePred);
648 return Succ;
656 ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock()
    [all...]
  /external/deqp/framework/platform/X11/
tcuX11.cpp 99 bool succ = false; local
106 succ = true;
111 return succ;
140 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); local
142 TCU_CHECK_INTERNAL(succ);
  /external/valgrind/main/memcheck/tests/x86-linux/
scalar.c 127 SY(__NR_getpid); SUCC;
143 SY(__NR_getuid); SUCC;
156 SY(__NR_alarm, x0); SUCC;
184 SY(__NR_nice, x0); SUCC;
192 SY(__NR_sync); SUCC;
196 SY(__NR_kill, x0, x0); SUCC;
228 SY(__NR_brk, x0); SUCC;
236 SY(__NR_getgid); SUCC;
244 SY(__NR_geteuid); SUCC;
248 SY(__NR_getegid); SUCC;
    [all...]
  /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/tests/
__init__.py 35 succ = self.testsRun - (len(self.errors) + len(self.failures))
36 v = "%3d" % succ
  /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);
  /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);
  /dalvik/dx/src/com/android/dx/ssa/
LocalVariableExtractor.java 198 int succ = successors.get(i); local
199 RegisterSpecSet state = (succ == primarySuccessor) ?
202 if (resultInfo.mergeStarts(succ, state)) {
203 workSet.set(succ);
  /external/dexmaker/src/dx/java/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);
  /external/dexmaker/src/dx/java/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);
  /packages/inputmethods/LatinIME/java/res/values-it/
strings-action-keys.xml 24 <string name="label_next_key" msgid="5586407279258592635">"Succ."</string>
  /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/Utils/
Local.cpp 183 BasicBlock *Succ = SI->getSuccessor(i);
184 if (Succ == TheOnlyDest)
187 Succ->removePredecessor(BB);
533 /// almost-empty BB ending in an unconditional branch to Succ, into Succ.
535 /// Assumption: Succ is the single successor for BB.
537 static bool CanPropagatePredecessorsForPHIs(BasicBlock *BB, BasicBlock *Succ) {
538 assert(*succ_begin(BB) == Succ && "Succ is not successor of BB!");
541 << Succ->getName() << "\n")
    [all...]

Completed in 1648 milliseconds

1 2 3 4 5 6 7 8