/external/swiftshader/third_party/LLVM/lib/Analysis/ |
D | PathNumbering.cpp | 291 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/compiler/ |
D | frame-elider.cc | 53 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()
|
D | scheduler.cc | 565 void TraceConnect(Node* node, BasicBlock* block, BasicBlock* succ) { in TraceConnect() argument 567 if (succ == nullptr) { in TraceConnect() 572 node->op()->mnemonic(), block->id().ToInt(), succ->id().ToInt()); in TraceConnect() 788 BasicBlock* succ = frame->block->SuccessorAt(frame->index++); in ComputeAndInsertSpecialRPO() local 789 if (succ->rpo_number() == kBlockVisited1) continue; in ComputeAndInsertSpecialRPO() 790 if (succ->rpo_number() == kBlockOnStack) { in ComputeAndInsertSpecialRPO() 793 if (!HasLoopNumber(succ)) { in ComputeAndInsertSpecialRPO() 795 SetLoopNumber(succ, num_loops++); in ComputeAndInsertSpecialRPO() 799 DCHECK_EQ(kBlockUnvisited1, succ->rpo_number()); in ComputeAndInsertSpecialRPO() 800 stack_depth = Push(stack_, stack_depth, succ, kBlockUnvisited1); in ComputeAndInsertSpecialRPO() [all …]
|
D | schedule.h | 222 void AddGoto(BasicBlock* block, BasicBlock* succ); in NON_EXPORTED_BASE() 257 void AddSuccessorForTesting(BasicBlock* block, BasicBlock* succ) { in NON_EXPORTED_BASE() 258 return AddSuccessor(block, succ); in NON_EXPORTED_BASE() 290 void AddSuccessor(BasicBlock* block, BasicBlock* succ); in NON_EXPORTED_BASE()
|
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/PowerPC/ |
D | tail-dup-break-cfg.ll | 97 ; This function arranges for the successors of %succ to have already been laid 98 ; out. When we consider whether to lay out succ after bb and to tail-duplicate 106 ; CHECK: # %succ 120 br i1 %tagbit2eq0, label %succ, label %c, !prof !3 ; %succ more likely 124 br label %succ 125 succ:
|
/external/v8/tools/turbolizer/src/ |
D | schedule-view.ts | 155 for (const succ of block.succ) { constant 156 const succEl = createElement("div", ["block-id", "com", "clickable"], succ); 157 succEl.onclick = mkBlockLinkHandler(succ); 160 if (block.succ.length) schedule_block.appendChild(block_succ);
|
/external/deqp/framework/platform/lnx/X11/ |
D | tcuLnxX11.cpp | 126 bool succ = false; in getVisualInfo() local 133 succ = true; in getVisualInfo() 138 return succ; in getVisualInfo() 181 bool succ = display.getVisualInfo(XVisualIDFromVisual(visual), info); in XlibWindow() local 183 TCU_CHECK_INTERNAL(succ); in XlibWindow()
|
/external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
D | dominator_tree.cpp | 187 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap() local 190 this->successors_[succ].push_back(&bb); in CreateSuccessorMap() 191 pred_list.push_back(succ); in CreateSuccessorMap() 207 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap() local 208 succ_list.push_back(succ); in CreateSuccessorMap() 209 predecessors_[succ].push_back(&bb); in CreateSuccessorMap()
|
/external/deqp-deps/SPIRV-Tools/source/opt/ |
D | dominator_tree.cpp | 187 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap() local 190 this->successors_[succ].push_back(&bb); in CreateSuccessorMap() 191 pred_list.push_back(succ); in CreateSuccessorMap() 207 BasicBlock* succ = GetSuccessorBasicBlock(successor_id); in CreateSuccessorMap() local 208 succ_list.push_back(succ); in CreateSuccessorMap() 209 predecessors_[succ].push_back(&bb); in CreateSuccessorMap()
|
/external/clang/lib/StaticAnalyzer/Core/ |
D | ExplodedGraph.cpp | 106 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/deqp-deps/SPIRV-Tools/source/val/ |
D | construct.cpp | 118 for (auto succ : *block->successors()) { in blocks() 120 if (header->dominates(*succ)) { in blocks() 121 stack.push_back(succ); in blocks()
|
/external/swiftshader/third_party/SPIRV-Tools/source/val/ |
D | construct.cpp | 118 for (auto succ : *block->successors()) { in blocks() 120 if (header->dominates(*succ)) { in blocks() 121 stack.push_back(succ); in blocks()
|
/external/mesa3d/src/compiler/nir/ |
D | nir_liveness.c | 121 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/toolchain-utils/automation/server/ |
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/ |
D | LinkedHashMultimap.java | 128 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()
|
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; 553 successor(this, right, succ); 779 successor(pred, succ); 793 AvlNode<E> newTop = succ; 934 a.succ = b;
|
/external/tensorflow/tensorflow/core/graph/ |
D | mkl_layout_pass.cc | 2676 Node* succ = m->type_string() == csinfo_.bias_add ? m : n; in MergeConv2DWithBiasAdd() local 2686 TF_CHECK_OK(GetNodeAttr(succ->def(), "T", &T_succ)); in MergeConv2DWithBiasAdd() 2691 TF_CHECK_OK(GetNodeAttr(succ->def(), "data_format", &data_format_succ)); in MergeConv2DWithBiasAdd() 2699 pred->assigned_device_name() != succ->assigned_device_name() || in MergeConv2DWithBiasAdd() 2700 pred->def().device() != succ->def().device()) { in MergeConv2DWithBiasAdd() 2706 const int succ_num = succ->num_inputs(); in MergeConv2DWithBiasAdd() 2709 FillInputs(succ, &succ_control_edges, &succ_in); in MergeConv2DWithBiasAdd() 2721 if (e->src_output() == kFirstOutputSlot && e->dst() != succ) { in MergeConv2DWithBiasAdd() 2735 CHECK_EQ(succ->in_edges().size(), 2); in MergeConv2DWithBiasAdd() 2740 NodeBuilder nb(succ->name(), csinfo_.conv2d_with_bias); in MergeConv2DWithBiasAdd() [all …]
|
/external/deqp/modules/gles2/functional/ |
D | es2fFboCompletenessTests.cpp | 339 bool succ = false; in iterate() local 358 succ = tryCombination(comb); in iterate() 359 if (succ) in iterate() 365 if (succ) in iterate()
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
D | MachineBasicBlock.cpp | 341 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()
|
D | UnreachableBlockElim.cpp | 152 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/ |
D | LinkedHashMultimap.java | 132 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()
|
/external/tensorflow/tensorflow/compiler/xla/service/gpu/ |
D | cudnn_conv_algorithm_picker.cc | 47 bool succ = false; in GetAlgorithms() local 50 succ = in GetAlgorithms() 54 succ = stream_exec->GetConvolveBackwardDataAlgorithms(true, &algorithms); in GetAlgorithms() 58 succ = stream_exec->GetConvolveAlgorithms(true, &algorithms); in GetAlgorithms() 61 DCHECK(succ); in GetAlgorithms()
|
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
D | RegionIterator.h | 70 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/ |
D | UnreachableBlockElim.cpp | 159 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/skqp/src/utils/ |
D | SkPolyUtils.cpp | 686 ActiveEdge* succ = nullptr; in insert() local 693 (succ && succ->intersect(p0, v, index0, index1))) { in insert() 703 curr->fBelow = succ; in insert() 707 if (succ) { in insert() 708 succ->fAbove = curr; in insert() 748 succ = curr; in insert() 811 ActiveEdge* succ = found->fBelow; in replace() local 816 if (succ && (succ->intersect(found) || succ->intersect(p1, v, index1, index2))) { in replace() 902 ActiveEdge* succ = found->fBelow; in remove() local 903 if ((pred && pred->intersect(found)) || (succ && succ->intersect(found))) { in remove() [all …]
|