/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/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()) {
|
H A D | MachineBasicBlock.cpp | 341 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { argument 351 Successors.push_back(succ); 352 succ->addPredecessor(this); 355 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { argument 356 succ->removePredecessor(this); 357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); 774 uint32_t MachineBasicBlock::getSuccWeight(MachineBasicBlock *succ) { argument 778 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ);
|
/external/mesa3d/src/compiler/nir/ |
H A D | nir_liveness.c | 111 /** Propagates the live in of succ across the edge to the live out of pred 121 propagate_across_edge(nir_block *pred, nir_block *succ, argument 125 memcpy(live, succ->live_in, state->bitset_words * sizeof *live); 127 nir_foreach_instr(instr, succ) { 136 nir_foreach_instr(instr, succ) {
|
H A D | nir_control_flow.c | 84 unlink_blocks(nir_block *pred, nir_block *succ) argument 86 if (pred->successors[0] == succ) { 90 assert(pred->successors[1] == succ); 94 block_remove_pred(succ, pred);
|
H A D | nir_validate.c | 642 validate_phi_srcs(nir_block *block, nir_block *succ, validate_state *state) argument 644 nir_foreach_instr(instr, succ) {
|
/external/v8/src/crankshaft/ |
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-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-load-elimination.cc | 146 HLoadEliminationTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, argument 155 TRACE((" copy-to B%d\n", succ->block_id())); 162 HLoadEliminationTable* Merge(HBasicBlock* succ, HLoadEliminationTable* that, argument 190 TRACE((" merge-to B%d\n", succ->block_id()));
|
H A D | hydrogen-check-elimination.cc | 177 HCheckTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, Zone* zone) { argument 188 old_entry->check_->block()->Dominates(succ)) { 199 // Create entries for succ block's phis. 200 if (!succ->IsLoopHeader() && succ->phis()->length() > 0) { 201 int pred_index = succ->PredecessorIndexOf(from_block); 203 phi_index < succ->phis()->length(); 205 HPhi* phi = succ->phis()->at(phi_index); 219 if (succ->predecessors()->length() == 1) { 220 HControlInstruction* end = succ 311 Merge(HBasicBlock* succ, HCheckTable* that, HBasicBlock* pred_block, Zone* zone) argument 558 int succ; local 599 int succ = 1; local 611 int succ; local [all...] |
/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/framework/platform/lnx/X11/ |
H A D | tcuLnxX11.cpp | 108 bool succ = false; local 115 succ = true; 120 return succ; 161 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); local 163 TCU_CHECK_INTERNAL(succ);
|
/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/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;
|
H A D | DependenceAnalysis.h | 200 void setNextSuccessor(const Dependence *succ) { NextSuccessor = succ; } argument
|
/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/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
|
H A D | TreeMultiset.java | 370 node = node.succ; 373 node = header.succ; 425 if (current.succ == header) { 428 current = current.succ; 531 private AvlNode<E> succ; field in class:TreeMultiset.AvlNode 557 successor(this, right, succ); 783 successor(pred, succ); 797 AvlNode<E> newTop = succ; 938 a.succ = b;
|
/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
|
H A D | TreeMultiset.java | 366 node = node.succ; 369 node = header.succ; 421 if (current.succ == header) { 424 current = current.succ; 527 private AvlNode<E> succ; field in class:TreeMultiset.AvlNode 553 successor(this, right, succ); 779 successor(pred, succ); 793 AvlNode<E> newTop = succ; 934 a.succ = b;
|
/external/v8/src/compiler/ |
H A D | verifier.cc | 1539 BasicBlock* succ = block->SuccessorAt(s); local 1540 if (!marked[succ->id().ToSize()]) { 1541 marked[succ->id().ToSize()] = true; 1542 queue.push(succ); 1581 BasicBlock* succ = block->SuccessorAt(s); local 1582 BitVector* succ_doms = dominators[succ->id().ToSize()]; 1589 dominators[succ->id().ToSize()] = succ_doms; 1590 queue.push(succ); 1595 if (succ_doms->IntersectIsChanged(*block_doms)) queue.push(succ);
|
H A D | schedule.cc | 196 void Schedule::AddGoto(BasicBlock* block, BasicBlock* succ) { argument 199 AddSuccessor(block, succ); 423 void Schedule::AddSuccessor(BasicBlock* block, BasicBlock* succ) { argument 424 block->AddSuccessor(succ); 425 succ->AddPredecessor(block);
|
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/mesa3d/src/gallium/drivers/freedreno/ir3/ |
H A D | ir3_ra.c | 792 struct ir3_block *succ = block->successors[j]; local 795 if (!succ) 798 succ_bd = succ->data;
|
/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...] |