/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | 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 [all...] |
H A D | ctrees.c | 668 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 D | 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, NewStateCop [all...] |
H A D | hydrogen-flow-engine.h | 39 inline NoState* Copy(HBasicBlock* succ, Zone* zone) { argument 45 inline NoState* Merge(HBasicBlock* succ, NoState* other, Zone* zone) { argument 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_));
|
H A D | hydrogen-check-elimination.cc | 176 HCheckTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, Zone* zone) { argument 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 310 Merge(HBasicBlock* succ, HCheckTable* that, HBasicBlock* pred_block, Zone* zone) argument 557 int succ; local 598 int succ = 1; local 610 int succ; local [all...] |
H A D | hydrogen-load-elimination.cc | 144 HLoadEliminationTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, argument 153 TRACE((" copy-to B%d\n", succ->block_id())); 160 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that, argument 188 TRACE((" merge-to B%d\n", succ->block_id()));
|
/external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
H A D | BasicBlock.java | 186 int succ = successors.get(0); 187 if (succ == primarySuccessor) { 188 succ = successors.get(1); 191 return succ;
|
H A D | LocalVariableExtractor.java | 182 int succ = successors.get(i); 183 RegisterSpecSet state = (succ == primarySuccessor) ? 186 if (resultInfo.mergeStarts(succ, state)) { 187 Bits.set(workSet, succ);
|
/external/deqp/framework/platform/X11/ |
H A D | 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/safe-iop/src/ |
H A D | safe_iop.c | 1091 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 D | LocalVariableExtractor.java | 199 int succ = successors.get(i); 200 RegisterSpecSet state = (succ == primarySuccessor) ? 203 if (resultInfo.mergeStarts(succ, state)) { 204 workSet.set(succ);
|
H A D | SsaConverter.java | 247 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
|
/external/chromium_org/v8/src/compiler/ |
H A D | scheduler.cc | 208 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) { argument 210 if (succ == NULL) { 215 block->id(), succ->id()); 956 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); local 957 if (succ->rpo_number_ == kBlockVisited1) continue; 958 if (succ->rpo_number_ == kBlockOnStack) { 962 if (succ->loop_end_ < 0) { 964 succ->loop_end_ = num_loops++; 968 DCHECK(succ->rpo_number_ == kBlockUnvisited1); 969 stack_depth = Push(stack, stack_depth, succ, kBlockUnvisited 999 BasicBlock* succ = NULL; local [all...] |
H A D | verifier.cc | 335 BasicBlock* succ = block->SuccessorAt(s); local 336 if (!marked[succ->id()]) { 337 marked[succ->id()] = true; 338 queue.push(succ); 377 BasicBlock* succ = block->SuccessorAt(s); local 378 BitVector* succ_doms = dominators[succ->id()]; 385 dominators[succ->id()] = succ_doms; 386 queue.push(succ); 391 if (succ_doms->IntersectIsChanged(*block_doms)) queue.push(succ);
|
H A D | schedule.h | 229 void AddGoto(BasicBlock* block, BasicBlock* succ) { argument 232 AddSuccessor(block, succ); 273 void AddSuccessor(BasicBlock* block, BasicBlock* succ) { argument 274 succ->AppendInput(zone_, block);
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | ExplodedGraph.cpp | 106 const ExplodedNode *succ = *(node->succ_begin()); local 107 if (succ->pred_size() != 1) 152 const ProgramPoint SuccLoc = succ->getLocation(); 171 ExplodedNode *succ = *(node->succ_begin()); local 172 pred->replaceSuccessor(succ); 173 succ->replacePredecessor(pred);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/tests/ |
H A D | __init__.py | 35 succ = self.testsRun - (len(self.errors) + len(self.failures)) 36 v = "%3d" % succ
|
/external/deqp/modules/gles2/functional/ |
H A D | es2fFboCompletenessTests.cpp | 223 bool succ = false; local 242 succ = tryCombination(comb); 243 if (succ) 249 if (succ)
|
/external/llvm/bindings/ocaml/target/ |
H A D | llvm_target.ml | 94 external succ : t -> t option = "llvm_target_succ" 106 | Some target -> step (succ target) (target :: lst)
|
/external/llvm/include/llvm/Analysis/ |
H A D | 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/libpcap/ |
H A D | gencode.h | 244 struct block *succ; member in struct:edge 355 #define JT(b) ((b)->et.succ) 356 #define JF(b) ((b)->ef.succ)
|
H A D | optimize.c | 266 if (ep->succ) { 267 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords); 268 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords); 1246 * Return true if any register that is used on exit from 'succ', has 1251 use_conflict(struct block *b, struct block *succ) argument 1254 atomset use = succ->out_use; 1261 if (b->val[atom] != succ->val[atom]) 1324 if (JT(ep->succ) == 0) 1327 if (JT(ep->succ) == JF(ep->succ)) { [all...] |
/external/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 148 MachineBasicBlock* succ = *BB->succ_begin(); local 150 MachineBasicBlock::iterator start = succ->begin(); 151 while (start != succ->end() && start->isPHI()) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 209 Loop *succ = LI->getLoopFor(SuccToSinkTo); 211 if (succ != nullptr && succ != cur)
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | util.rb | 156 range.exclude_end? ? last.succ >= range.last : last >= range.last
|