Home
last modified time | relevance | path

Searched refs:succ (Results 1 – 25 of 63) sorted by relevance

123

/external/swiftshader/third_party/LLVM/lib/Analysis/
DPathNumbering.cpp291 for( BLEdgeIterator succ = node->succBegin(), end = node->succEnd(); in calculatePathNumbers() local
292 succ != end; oldTarget = (*succ)->getTarget()->getBlock(), succ++ ) { in calculatePathNumbers()
294 if( (*succ)->getType() == BallLarusEdge::NORMAL ) { in calculatePathNumbers()
296 if( oldTarget != (*succ)->getTarget()->getBlock() ) in calculatePathNumbers()
301 addEdge(getRoot(), (*succ)->getTarget(), duplicateNumber++); in calculatePathNumbers()
303 rootEdge->setRealEdge(*succ); in calculatePathNumbers()
306 (*succ)->setType(BallLarusEdge::SPLITEDGE); in calculatePathNumbers()
307 (*succ)->setPhonyRoot(rootEdge); in calculatePathNumbers()
308 (*succ)->setPhonyExit(exitEdge); in calculatePathNumbers()
309 (*succ)->setWeight(0); in calculatePathNumbers()
[all …]
/external/v8/src/crankshaft/
Dhydrogen-escape-analysis.cc253 HBasicBlock* succ = block->end()->SuccessorAt(i); in AnalyzeDataFlow() local
254 if (!allocate_block->Dominates(succ)) continue; in AnalyzeDataFlow()
255 if (succ->predecessors()->length() == 1) { in AnalyzeDataFlow()
257 SetStateAt(succ, state); in AnalyzeDataFlow()
258 } else if (StateAt(succ) == NULL && succ->IsLoopHeader()) { in AnalyzeDataFlow()
261 SetStateAt(succ, NewStateForLoopHeader(succ->first(), state)); in AnalyzeDataFlow()
262 } else if (StateAt(succ) == NULL) { in AnalyzeDataFlow()
265 SetStateAt(succ, NewStateCopy(succ->first(), state)); in AnalyzeDataFlow()
270 HCapturedObject* succ_state = StateAt(succ); in AnalyzeDataFlow()
274 if (succ_operand->IsPhi() && succ_operand->block() == succ) { in AnalyzeDataFlow()
[all …]
Dhydrogen-flow-engine.h39 inline NoState* Copy(HBasicBlock* succ, Zone* zone) { in Copy() argument
45 inline NoState* Merge(HBasicBlock* succ, NoState* other, Zone* zone) { in Merge() argument
123 HBasicBlock* succ = block->end()->SuccessorAt(i); in AnalyzeDominatedBlocks() local
124 IncrementPredecessorCount(succ); in AnalyzeDominatedBlocks()
126 if (max == 1 && succ->predecessors()->length() == 1) { in AnalyzeDominatedBlocks()
128 SetStateAt(succ, state); in AnalyzeDominatedBlocks()
131 SetStateAt(succ, in AnalyzeDominatedBlocks()
132 State::Merge(StateAt(succ), succ, state, block, zone_)); in AnalyzeDominatedBlocks()
Dhydrogen-check-elimination.cc177 HCheckTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, Zone* zone) { in Copy() argument
188 old_entry->check_->block()->Dominates(succ)) { in Copy()
200 if (!succ->IsLoopHeader() && succ->phis()->length() > 0) { in Copy()
201 int pred_index = succ->PredecessorIndexOf(from_block); in Copy()
203 phi_index < succ->phis()->length(); in Copy()
205 HPhi* phi = succ->phis()->at(phi_index); in Copy()
219 if (succ->predecessors()->length() == 1) { in Copy()
220 HControlInstruction* end = succ->predecessors()->at(0)->end(); in Copy()
221 bool is_true_branch = end->SuccessorAt(0) == succ; in Copy()
301 succ->block_id(), in Copy()
[all …]
/external/safe-iop/src/
Dsafe_iop.c1091 int tests = 0, succ = 0, fail = 0; in main() local
1092 tests++; if (T_div_s8()) succ++; else fail++; in main()
1093 tests++; if (T_div_s16()) succ++; else fail++; in main()
1094 tests++; if (T_div_s32()) succ++; else fail++; in main()
1095 tests++; if (T_div_s64()) succ++; else fail++; in main()
1096 tests++; if (T_div_long()) succ++; else fail++; in main()
1097 tests++; if (T_div_longlong()) succ++; else fail++; in main()
1098 tests++; if (T_div_ssizet()) succ++; else fail++; in main()
1099 tests++; if (T_div_u8()) succ++; else fail++; in main()
1100 tests++; if (T_div_u16()) succ++; else fail++; in main()
[all …]
/external/v8/src/compiler/
Dframe-elider.cc53 for (RpoNumber& succ : block->successors()) { in MarkDeConstruction()
54 if (!InstructionBlockAt(succ)->needs_frame()) { in MarkDeConstruction()
71 for (RpoNumber& succ : block->successors()) { in MarkDeConstruction()
72 if (InstructionBlockAt(succ)->needs_frame()) { in MarkDeConstruction()
74 InstructionBlockAt(succ)->mark_must_construct_frame(); in MarkDeConstruction()
130 for (RpoNumber& succ : block->successors()) { in PropagateIntoBlock()
131 InstructionBlock* successor_block = InstructionBlockAt(succ); in PropagateIntoBlock()
Dscheduler.cc537 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) { in TraceConnect() argument
539 if (succ == nullptr) { in TraceConnect()
544 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt()); in TraceConnect()
758 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); in ComputeAndInsertSpecialRPO() local
759 if (succ->rpo_number() == kBlockVisited1) continue; in ComputeAndInsertSpecialRPO()
760 if (succ->rpo_number() == kBlockOnStack) { in ComputeAndInsertSpecialRPO()
763 if (!HasLoopNumber(succ)) { in ComputeAndInsertSpecialRPO()
765 SetLoopNumber(succ, num_loops++); in ComputeAndInsertSpecialRPO()
769 DCHECK(succ->rpo_number() == kBlockUnvisited1); in ComputeAndInsertSpecialRPO()
770 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited1); in ComputeAndInsertSpecialRPO()
[all …]
Dschedule.h210 void AddGoto(BasicBlock* block, BasicBlock* succ); in NON_EXPORTED_BASE()
245 void AddSuccessorForTesting(BasicBlock* block, BasicBlock* succ) { in NON_EXPORTED_BASE()
246 return AddSuccessor(block, succ); in NON_EXPORTED_BASE()
272 void AddSuccessor(BasicBlock* block, BasicBlock* succ); in NON_EXPORTED_BASE()
/external/deqp/framework/platform/lnx/X11/
DtcuLnxX11.cpp101 bool succ = false; in getVisualInfo() local
108 succ = true; in getVisualInfo()
113 return succ; in getVisualInfo()
154 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); in XlibWindow() local
156 TCU_CHECK_INTERNAL(succ); in XlibWindow()
/external/clang/lib/StaticAnalyzer/Core/
DExplodedGraph.cpp106 const ExplodedNode *succ = *(node->succ_begin()); in shouldCollect() local
107 if (succ->pred_size() != 1) in shouldCollect()
152 const ProgramPoint SuccLoc = succ->getLocation(); in shouldCollect()
171 ExplodedNode *succ = *(node->succ_begin()); in collectNode() local
172 pred->replaceSuccessor(succ); in collectNode()
173 succ->replacePredecessor(pred); in collectNode()
/external/toolchain-utils/automation/server/
Djob_manager.py155 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/mesa3d/src/compiler/nir/
Dnir_liveness.c121 propagate_across_edge(nir_block *pred, nir_block *succ, in propagate_across_edge() argument
125 memcpy(live, succ->live_in, state->bitset_words * sizeof *live); in propagate_across_edge()
127 nir_foreach_instr(instr, succ) { in propagate_across_edge()
136 nir_foreach_instr(instr, succ) { in propagate_across_edge()
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DLinkedHashMultimap.java128 private static <K, V> void succeedsInValueSet(ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) { in succeedsInValueSet() argument
129 pred.setSuccessorInValueSet(succ); in succeedsInValueSet()
130 succ.setPredecessorInValueSet(pred); in succeedsInValueSet()
134 ValueEntry<K, V> pred, ValueEntry<K, V> succ) { in succeedsInMultimap() argument
135 pred.setSuccessorInMultimap(succ); in succeedsInMultimap()
136 succ.setPredecessorInMultimap(pred); in succeedsInMultimap()
DTreeMultiset.java366 node = node.succ;
369 node = header.succ;
421 if (current.succ == header) {
424 current = current.succ;
527 private AvlNode<E> succ;
553 successor(this, right, succ);
779 successor(pred, succ);
793 AvlNode<E> newTop = succ;
934 a.succ = b;
/external/deqp/modules/gles2/functional/
Des2fFboCompletenessTests.cpp303 bool succ = false; in iterate() local
322 succ = tryCombination(comb); in iterate()
323 if (succ) in iterate()
329 if (succ) in iterate()
/external/r8/src/main/java/com/android/tools/r8/ir/code/
DIRCode.java116 for (BasicBlock succ : block.getSuccessors()) { in depthFirstSorting()
117 index = depthFirstSorting(succ, sorted, index); in depthFirstSorting()
222 for (BasicBlock succ : block.getSuccessors()) { in consistentPredecessorSuccessors()
224 assert blocks.contains(succ); in consistentPredecessorSuccessors()
226 assert succ.getPredecessors().contains(block); in consistentPredecessorSuccessors()
DBasicBlock.java537 BasicBlock succ = pair.second; in unlink() local
538 assert pred.successors.contains(succ); in unlink()
539 assert succ.predecessors.contains(pred); in unlink()
541 pred.removeSuccessor(succ); in unlink()
543 size = succ.predecessors.size(); in unlink()
544 succ.removePredecessor(pred); in unlink()
545 assert size == succ.predecessors.size() + 1; in unlink()
548 if (allPredecessorsDominated(succ, dominator)) { in unlink()
549 removedBlocks.add(succ); in unlink()
550 for (BasicBlock block : succ.successors) { in unlink()
[all …]
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DMachineBasicBlock.cpp341 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) { in addSuccessor() argument
351 Successors.push_back(succ); in addSuccessor()
352 succ->addPredecessor(this); in addSuccessor()
355 void MachineBasicBlock::removeSuccessor(MachineBasicBlock *succ) { in removeSuccessor() argument
356 succ->removePredecessor(this); in removeSuccessor()
357 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); in removeSuccessor()
774 uint32_t MachineBasicBlock::getSuccWeight(MachineBasicBlock *succ) { in getSuccWeight() argument
778 succ_iterator I = std::find(Successors.begin(), Successors.end(), succ); in getSuccWeight()
DUnreachableBlockElim.cpp152 MachineBasicBlock* succ = *BB->succ_begin(); in runOnMachineFunction() local
154 MachineBasicBlock::iterator start = succ->begin(); in runOnMachineFunction()
155 while (start != succ->end() && start->isPHI()) { in runOnMachineFunction()
/external/guava/guava/src/com/google/common/collect/
DLinkedHashMultimap.java132 private static <K, V> void succeedsInValueSet(ValueSetLink<K, V> pred, ValueSetLink<K, V> succ) { in succeedsInValueSet() argument
133 pred.setSuccessorInValueSet(succ); in succeedsInValueSet()
134 succ.setPredecessorInValueSet(pred); in succeedsInValueSet()
138 ValueEntry<K, V> pred, ValueEntry<K, V> succ) { in succeedsInMultimap() argument
139 pred.setSuccessorInMultimap(succ); in succeedsInMultimap()
140 succ.setPredecessorInMultimap(pred); in succeedsInMultimap()
DTreeMultiset.java370 node = node.succ;
373 node = header.succ;
425 if (current.succ == header) {
428 current = current.succ;
531 private AvlNode<E> succ;
557 successor(this, right, succ);
783 successor(pred, succ);
797 AvlNode<E> newTop = succ;
938 a.succ = b;
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DRegionIterator.h70 RegionNode *succ; in getISucc() local
71 succ = getNode()->getParent()->getNode(BB); in getISucc()
72 assert(succ && "BB not in Region or entered subregion!"); in getISucc()
73 return succ; in getISucc()
/external/llvm/lib/CodeGen/
DUnreachableBlockElim.cpp159 MachineBasicBlock* succ = *BB->succ_begin(); in runOnMachineFunction() local
161 MachineBasicBlock::iterator start = succ->begin(); in runOnMachineFunction()
162 while (start != succ->end() && start->isPHI()) { in runOnMachineFunction()
/external/llvm/include/llvm/Analysis/
DRegionIterator.h73 NodeType *succ; in getISucc() local
74 succ = getNode()->getParent()->getNode(BB); in getISucc()
75 assert(succ && "BB not in Region or entered subregion!"); in getISucc()
76 return succ; in getISucc()
/external/libpcap/
Dgencode.h242 struct block *succ; member
394 #define JT(b) ((b)->et.succ)
395 #define JF(b) ((b)->ef.succ)

123