/external/v8/src/compiler/ |
H A D | frame-elider.cc | 52 for (RpoNumber& succ : block->successors()) { 53 if (!InstructionBlockAt(succ)->needs_frame()) { 70 for (RpoNumber& succ : block->successors()) { 71 if (InstructionBlockAt(succ)->needs_frame()) { 73 InstructionBlockAt(succ)->mark_must_construct_frame(); 119 for (RpoNumber& succ : block->successors()) { 120 if (!InstructionBlockAt(succ)->needs_frame()) return false;
|
H A D | scheduler.cc | 537 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) { argument 539 if (succ == nullptr) { 544 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt()); 758 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); local 759 if (succ->rpo_number() == kBlockVisited1) continue; 760 if (succ->rpo_number() == kBlockOnStack) { 763 if (!HasLoopNumber(succ)) { 765 SetLoopNumber(succ, num_loops++); 769 DCHECK(succ->rpo_number() == kBlockUnvisited1); 770 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited 799 BasicBlock* succ = nullptr; local [all...] |
H A D | schedule.h | 210 void AddGoto(BasicBlock* block, BasicBlock* succ); 245 void AddSuccessorForTesting(BasicBlock* block, BasicBlock* succ) { argument 246 return AddSuccessor(block, succ); 272 void AddSuccessor(BasicBlock* block, BasicBlock* succ);
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | 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) [all...] |
/external/v8/src/crankshaft/ |
H A D | hydrogen-escape-analysis.cc | 253 HBasicBlock* succ = block->end()->SuccessorAt(i); local 254 if (!allocate_block->Dominates(succ)) continue; 255 if (succ->predecessors()->length() == 1) { 257 SetStateAt(succ, state); 258 } else if (StateAt(succ) == NULL && succ->IsLoopHeader()) { 261 SetStateAt(succ, NewStateForLoopHeader(succ->first(), state)); 262 } else if (StateAt(succ) == NULL) { 265 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 | 145 HLoadEliminationTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, argument 154 TRACE((" copy-to B%d\n", succ->block_id())); 161 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that, argument 189 TRACE((" merge-to B%d\n", succ->block_id()));
|
/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/deqp/framework/platform/X11/ |
H A D | tcuX11.cpp | 120 bool succ = false; local 127 succ = true; 132 return succ; 173 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); local 175 TCU_CHECK_INTERNAL(succ);
|
/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/deqp/modules/gles2/functional/ |
H A D | es2fFboCompletenessTests.cpp | 303 bool succ = false; local 322 succ = tryCombination(comb); 323 if (succ) 329 if (succ)
|
/external/toolchain-utils/automation/server/ |
H A D | job_manager.py | 155 for succ in job_.successors: 156 if succ.is_ready: 157 if succ not in self.ready_jobs: 158 self.ready_jobs.append(succ)
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedHashMultimap.java | 128 private static <K, V> void succeedsInValueSet(ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) { argument 129 pred.setSuccessorInValueSet(succ); 130 succ.setPredecessorInValueSet(pred); 134 ValueEntry<K, V> pred, ValueEntry<K, V> succ) { 135 pred.setSuccessorInMultimap(succ); 136 succ.setPredecessorInMultimap(pred); 133 succeedsInMultimap( ValueEntry<K, V> pred, ValueEntry<K, V> succ) argument
|
/external/llvm/bindings/ocaml/target/ |
H A D | llvm_target.ml | 90 external succ : t -> t option = "llvm_target_succ" 102 | Some target -> step (succ target) (target :: lst)
|
/external/llvm/include/llvm/Analysis/ |
H A D | RegionIterator.h | 73 NodeType *succ; local 74 succ = getNode()->getParent()->getNode(BB); 75 assert(succ && "BB not in Region or entered subregion!"); 76 return succ;
|
/external/swiftshader/third_party/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 | 242 struct block *succ; member in struct:edge 362 #define JT(b) ((b)->et.succ) 363 #define JF(b) ((b)->ef.succ)
|
H A D | optimize.c | 262 if (ep->succ) { 263 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords); 264 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords); 1256 * Return true if any register that is used on exit from 'succ', has 1261 use_conflict(struct block *b, struct block *succ) argument 1264 atomset use = succ->out_use; 1271 if (b->val[atom] != succ->val[atom]) 1334 if (JT(ep->succ) == 0) 1337 if (JT(ep->succ) == JF(ep->succ)) { [all...] |
/external/llvm/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 159 MachineBasicBlock* succ = *BB->succ_begin(); local 161 MachineBasicBlock::iterator start = succ->begin(); 162 while (start != succ->end() && start->isPHI()) {
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | Sink.cpp | 126 Loop *succ = LI.getLoopFor(SuccToSinkTo); 128 if (succ != nullptr && succ != cur)
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | UnreachableBlockElim.cpp | 152 MachineBasicBlock* succ = *BB->succ_begin(); local 154 MachineBasicBlock::iterator start = succ->begin(); 155 while (start != succ->end() && start->isPHI()) {
|
/external/toolchain-utils/automation/server/monitor/ |
H A D | dashboard.py | 51 successors = [Link('/job/%d' % succ.id, succ.label) 52 for succ in job.successors]
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | LinkedHashMultimap.java | 132 private static <K, V> void succeedsInValueSet(ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) { argument 133 pred.setSuccessorInValueSet(succ); 134 succ.setPredecessorInValueSet(pred); 138 ValueEntry<K, V> pred, ValueEntry<K, V> succ) { 139 pred.setSuccessorInMultimap(succ); 140 succ.setPredecessorInMultimap(pred); 137 succeedsInMultimap( ValueEntry<K, V> pred, ValueEntry<K, V> succ) argument
|
/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
|