Searched refs:succ (Results 1 - 25 of 40) sorted by relevance

12

/external/chromium_org/third_party/bintrees/bintrees/
H A Dwalker.py96 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
[all...]
H A Dctrees.c668 node_t *succ = NULL; local
677 if ((succ == NULL) ||
678 (ct_compare(KEY(node), KEY(succ)) < 0))
679 succ = node;
692 if (succ == NULL)
693 succ = node;
694 else if (ct_compare(KEY(node), KEY(succ)) < 0)
695 succ = node;
697 return succ;
760 node_t *succ local
[all...]
/external/chromium_org/v8/src/
H A Dhydrogen-escape-analysis.cc257 HBasicBlock* succ = block->end()->SuccessorAt(i); local
258 if (!allocate_block->Dominates(succ)) continue;
259 if (succ->predecessors()->length() == 1) {
261 SetStateAt(succ, state);
262 } else if (StateAt(succ) == NULL && succ->IsLoopHeader()) {
265 SetStateAt(succ, NewStateForLoopHeader(succ->first(), state));
266 } else if (StateAt(succ) == NULL) {
269 SetStateAt(succ, NewStateCop
[all...]
H A Dhydrogen-flow-engine.h62 inline NoState* Copy(HBasicBlock* succ, Zone* zone) { argument
68 inline NoState* Merge(HBasicBlock* succ, NoState* other, Zone* zone) { argument
143 HBasicBlock* succ = block->end()->SuccessorAt(i); local
144 IncrementPredecessorCount(succ);
145 if (StateAt(succ) == NULL) {
147 if (max == 1 && succ->predecessors()->length() == 1) {
149 SetStateAt(succ, state);
152 SetStateAt(succ, state->Copy(succ, zone_));
156 SetStateAt(succ, stat
[all...]
H A Dhydrogen-check-elimination.cc120 HCheckTable* Copy(HBasicBlock* succ, Zone* zone) { argument
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) { argument
H A Dhydrogen-load-elimination.cc138 HLoadEliminationTable* Copy(HBasicBlock* succ, Zone* zone) { argument
146 TRACE((" copy-to B%d\n", succ->block_id()));
154 HLoadEliminationTable* Merge(HBasicBlock* succ, argument
/external/llvm/lib/Analysis/
H A DPathNumbering.cpp290 for( BLEdgeIterator succ = node->succBegin(), end = node->succEnd();
291 succ != end; oldTarget = (*succ)->getTarget()->getBlock(), succ++ ) {
293 if( (*succ)->getType() == BallLarusEdge::NORMAL ) {
295 if( oldTarget != (*succ)->getTarget()->getBlock() )
298 // create the new phony edge: root -> succ
300 addEdge(getRoot(), (*succ)->getTarget(), duplicateNumber++);
302 rootEdge->setRealEdge(*succ);
305 (*succ)
[all...]
/external/dexmaker/src/dx/java/com/android/dx/rop/code/
H A DBasicBlock.java186 int succ = successors.get(0);
187 if (succ == primarySuccessor) {
188 succ = successors.get(1);
191 return succ;
H A DLocalVariableExtractor.java182 int succ = successors.get(i);
183 RegisterSpecSet state = (succ == primarySuccessor) ?
186 if (resultInfo.mergeStarts(succ, state)) {
187 Bits.set(workSet, succ);
/external/safe-iop/src/
H A Dsafe_iop.c1091 int tests = 0, succ = 0, fail = 0; local
1092 tests++; if (T_div_s8()) succ++; else fail++;
1093 tests++; if (T_div_s16()) succ++; else fail++;
1094 tests++; if (T_div_s32()) succ++; else fail++;
1095 tests++; if (T_div_s64()) succ++; else fail++;
1096 tests++; if (T_div_long()) succ++; else fail++;
1097 tests++; if (T_div_longlong()) succ++; else fail++;
1098 tests++; if (T_div_ssizet()) succ++; else fail++;
1099 tests++; if (T_div_u8()) succ++; else fail++;
1100 tests++; if (T_div_u16()) succ
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DLocalVariableExtractor.java199 int succ = successors.get(i);
200 RegisterSpecSet state = (succ == primarySuccessor) ?
203 if (resultInfo.mergeStarts(succ, state)) {
204 workSet.set(succ);
H A DSsaConverter.java247 SsaBasicBlock succ = blocks.get(j);
249 if (needsNewSuccessor(block, succ)) {
250 block.insertNewSuccessor(succ);
263 * @param succ successor node
267 SsaBasicBlock succ) {
273 && succ.getPredecessors().cardinality() > 1;
266 needsNewSuccessor(SsaBasicBlock block, SsaBasicBlock succ) argument
H A DSsaBasicBlock.java604 SsaBasicBlock succ;
606 succ = parent.getBlocks().get(i);
607 succ.addMoveToBeginning(result, source);
/external/libpcap/
H A Dgencode.h225 struct block *succ; member in struct:edge
329 #define JT(b) ((b)->et.succ)
330 #define JF(b) ((b)->ef.succ)
H A Doptimize.c294 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)
[all...]
/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp105 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);
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/tests/
H A D__init__.py35 succ = self.testsRun - (len(self.errors) + len(self.failures))
36 v = "%3d" % succ
/external/llvm/include/llvm/Analysis/
H A DRegionIterator.h70 RegionNode *succ; local
71 succ = getNode()->getParent()->getNode(BB);
72 assert(succ && "BB not in Region or entered subregion!");
73 return succ;
H A DDependenceAnalysis.h196 void setNextSuccessor(const Dependence *succ) { argument
197 NextSuccessor = succ;
/external/llvm/lib/CodeGen/
H A DUnreachableBlockElim.cpp152 MachineBasicBlock* succ = *BB->succ_begin(); local
154 MachineBasicBlock::iterator start = succ->begin();
155 while (start != succ->end() && start->isPHI()) {
H A DMachineBasicBlock.cpp482 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { argument
492 Successors.push_back(succ);
493 succ->addPredecessor(this);
496 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { argument
497 succ->removePredecessor(this);
498 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
/external/llvm/lib/Transforms/Scalar/
H A DSink.cpp206 Loop *succ = LI->getLoopFor(SuccToSinkTo);
208 if (succ != 0 && succ != cur)
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dutil.rb156 range.exclude_end? ? last.succ >= range.last : last >= range.last
/external/dexmaker/src/dx/java/com/android/dx/dex/code/
H A DRopTranslator.java270 int succ = block.getPrimarySuccessor();
278 if ((succ >= 0) && (succ != nextLabel)) {
293 output.reverseBranch(1, addresses.getStart(succ));
302 addresses.getStart(succ));
/external/clang/lib/StaticAnalyzer/Checkers/
H A DDeadStoresChecker.cpp98 if (const CFGBlock *succ = *i)
99 worklist.push_back(succ);

Completed in 2635 milliseconds

12