Home
last modified time | relevance | path

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

123

/external/v8/src/compiler/
Dframe-elider.cc50 for (auto succ : block->successors()) { in MarkDeConstruction() local
51 if (!InstructionBlockAt(succ)->needs_frame()) { in MarkDeConstruction()
58 for (auto succ : block->successors()) { in MarkDeConstruction() local
59 if (InstructionBlockAt(succ)->needs_frame()) { in MarkDeConstruction()
61 InstructionBlockAt(succ)->mark_must_construct_frame(); in MarkDeConstruction()
107 for (auto succ : block->successors()) { in PropagateIntoBlock() local
108 if (!InstructionBlockAt(succ)->needs_frame()) return false; in PropagateIntoBlock()
Dscheduler.cc529 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) { in TraceConnect() argument
531 if (succ == nullptr) { in TraceConnect()
536 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt()); in TraceConnect()
750 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); in ComputeAndInsertSpecialRPO() local
751 if (succ->rpo_number() == kBlockVisited1) continue; in ComputeAndInsertSpecialRPO()
752 if (succ->rpo_number() == kBlockOnStack) { in ComputeAndInsertSpecialRPO()
755 if (!HasLoopNumber(succ)) { in ComputeAndInsertSpecialRPO()
757 SetLoopNumber(succ, num_loops++); in ComputeAndInsertSpecialRPO()
761 DCHECK(succ->rpo_number() == kBlockUnvisited1); in ComputeAndInsertSpecialRPO()
762 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited1); in ComputeAndInsertSpecialRPO()
[all …]
Dschedule.h207 void AddGoto(BasicBlock* block, BasicBlock* succ);
242 void AddSuccessorForTesting(BasicBlock* block, BasicBlock* succ) { in AddSuccessorForTesting() argument
243 return AddSuccessor(block, succ); in AddSuccessorForTesting()
258 void AddSuccessor(BasicBlock* block, BasicBlock* succ);
Dschedule.cc196 void Schedule::AddGoto(BasicBlock* block, BasicBlock* succ) { in AddGoto() argument
199 AddSuccessor(block, succ); in AddGoto()
302 void Schedule::AddSuccessor(BasicBlock* block, BasicBlock* succ) { in AddSuccessor() argument
303 block->AddSuccessor(succ); in AddSuccessor()
304 succ->AddPredecessor(block); in AddSuccessor()
/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.cc176 HCheckTable* Copy(HBasicBlock* succ, HBasicBlock* from_block, Zone* zone) { in Copy() argument
187 old_entry->check_->block()->Dominates(succ)) { in Copy()
199 if (!succ->IsLoopHeader() && succ->phis()->length() > 0) { in Copy()
200 int pred_index = succ->PredecessorIndexOf(from_block); in Copy()
202 phi_index < succ->phis()->length(); in Copy()
204 HPhi* phi = succ->phis()->at(phi_index); in Copy()
218 if (succ->predecessors()->length() == 1) { in Copy()
219 HControlInstruction* end = succ->predecessors()->at(0)->end(); in Copy()
220 bool is_true_branch = end->SuccessorAt(0) == succ; in Copy()
300 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/dexmaker/src/dx/java/com/android/dx/rop/code/
DBasicBlock.java186 int succ = successors.get(0); in getSecondarySuccessor() local
187 if (succ == primarySuccessor) { in getSecondarySuccessor()
188 succ = successors.get(1); in getSecondarySuccessor()
191 return succ; in getSecondarySuccessor()
DLocalVariableExtractor.java182 int succ = successors.get(i); in processBlock() local
183 RegisterSpecSet state = (succ == primarySuccessor) ? in processBlock()
186 if (resultInfo.mergeStarts(succ, state)) { in processBlock()
187 Bits.set(workSet, succ); in processBlock()
/external/deqp/framework/platform/X11/
DtcuX11.cpp99 bool succ = false; in getVisualInfo() local
106 succ = true; in getVisualInfo()
111 return succ; in getVisualInfo()
152 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); in Window() local
154 TCU_CHECK_INTERNAL(succ); in Window()
/external/dexmaker/src/dx/java/com/android/dx/ssa/
DLocalVariableExtractor.java199 int succ = successors.get(i); in processBlock() local
200 RegisterSpecSet state = (succ == primarySuccessor) ? in processBlock()
203 if (resultInfo.mergeStarts(succ, state)) { in processBlock()
204 workSet.set(succ); in processBlock()
DSsaConverter.java247 SsaBasicBlock succ = blocks.get(j); in edgeSplitSuccessors() local
249 if (needsNewSuccessor(block, succ)) { in edgeSplitSuccessors()
250 block.insertNewSuccessor(succ); in edgeSplitSuccessors()
267 SsaBasicBlock succ) { in needsNewSuccessor() argument
273 && succ.getPredecessors().cardinality() > 1; in needsNewSuccessor()
/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/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/libpcap/
Doptimize.c262 if (ep->succ) { in propedom()
263 SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords); in propedom()
264 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords); in propedom()
1261 use_conflict(struct block *b, struct block *succ) in use_conflict() argument
1264 atomset use = succ->out_use; in use_conflict()
1271 if (b->val[atom] != succ->val[atom]) in use_conflict()
1334 if (JT(ep->succ) == 0) in opt_j()
1337 if (JT(ep->succ) == JF(ep->succ)) { in opt_j()
1342 if (!use_conflict(ep->pred, ep->succ->et.succ)) { in opt_j()
1344 ep->succ = JT(ep->succ); in opt_j()
[all …]
Dgencode.h242 struct block *succ; member
362 #define JT(b) ((b)->et.succ)
363 #define JF(b) ((b)->ef.succ)
/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/llvm/lib/CodeGen/
DUnreachableBlockElim.cpp145 MachineBasicBlock* succ = *BB->succ_begin(); in runOnMachineFunction() local
147 MachineBasicBlock::iterator start = succ->begin(); in runOnMachineFunction()
148 while (start != succ->end() && start->isPHI()) { in runOnMachineFunction()
/external/llvm/lib/Transforms/Scalar/
DSink.cpp219 Loop *succ = LI->getLoopFor(SuccToSinkTo); in IsAcceptableTarget() local
221 if (succ != nullptr && succ != cur) in IsAcceptableTarget()
/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/dexmaker/src/dx/java/com/android/dx/dex/code/
DRopTranslator.java270 int succ = block.getPrimarySuccessor(); in outputBlock() local
278 if ((succ >= 0) && (succ != nextLabel)) { in outputBlock()
293 output.reverseBranch(1, addresses.getStart(succ)); in outputBlock()
302 addresses.getStart(succ)); in outputBlock()

123