Searched refs:InEdges (Results 1 – 10 of 10) sorted by relevance
55 for (SizeT i = 0; i < InEdges.size(); ++i) { in replaceInEdge()56 if (InEdges[i] == Old) { in replaceInEdge()57 InEdges[i] = New; in replaceInEdge()97 Succ->InEdges.push_back(this); in computePredecessors()102 InEdges.clear(); in computeSuccessors()304 NewNode->InEdges.push_back(Pred); in splitIncomingEdge()313 for (CfgNode *&I : InEdges) { in splitIncomingEdge()475 for (CfgNode *Pred : InEdges) { in advancedPhiLowering()879 if (InEdges.empty()) in contractIfEmpty()908 for (CfgNode *Pred : InEdges) { in contractIfEmpty()[all …]
71 const NodeList &getInEdges() const { return InEdges; } in getInEdges()119 void addInEdge(CfgNode *In) { InEdges.push_back(In); } in addInEdge()146 NodeList InEdges; /// in no particular order variable
230 const auto &InEdges = Node->getInEdges(); in fixPhiNodes() local234 for (SizeT i = 0; i < InEdges.size(); ++i) { in fixPhiNodes()235 Phi->setLabel(i, InEdges[i]); in fixPhiNodes()
334 const auto &InEdges = Control.toCfgNode()->getInEdges(); in Phi() local335 assert(Count == InEdges.size()); in Phi()349 Phi->addArgument(Op, InEdges[i]); in Phi()
353 SmallVector<unsigned, 8> InEdges; // Edges from header to the loop. in calcLoopBranchHeuristics() local361 InEdges.push_back(I.getSuccessorIndex()); in calcLoopBranchHeuristics()373 (InEdges.empty() ? 0 : LBH_TAKEN_WEIGHT) + in calcLoopBranchHeuristics()377 if (!InEdges.empty()) in calcLoopBranchHeuristics()388 if (uint32_t numInEdges = InEdges.size()) { in calcLoopBranchHeuristics()390 for (unsigned SuccIdx : InEdges) in calcLoopBranchHeuristics()
614 SmallVector<unsigned, 8> InEdges; // Edges from header to the loop. in calcLoopBranchHeuristics() local628 InEdges.push_back(I.getSuccessorIndex()); in calcLoopBranchHeuristics()635 InEdges.push_back(I.getSuccessorIndex()); in calcLoopBranchHeuristics()645 (InEdges.empty() ? 0 : LBH_TAKEN_WEIGHT) + in calcLoopBranchHeuristics()656 if (uint32_t numInEdges = InEdges.size()) { in calcLoopBranchHeuristics()659 for (unsigned SuccIdx : InEdges) in calcLoopBranchHeuristics()
423 DirectEdges InEdges; member647 DestInfo.InEdges.push_back(E.get()); in populateCounters()673 Count.CountValue = sumEdgeCount(Count.InEdges); in populateCounters()685 uint64_t Total = Count.CountValue - sumEdgeCount(Count.InEdges); in populateCounters()686 setEdgeCount(Count.InEdges, Total); in populateCounters()
792 SmallVector<unsigned, 8> InEdges; // Edges from header to the loop. in calcLoopBranchHeuristics() local808 InEdges.push_back(I.getSuccessorIndex()); in calcLoopBranchHeuristics()818 (InEdges.empty() ? 0 : LBH_TAKEN_WEIGHT) + in calcLoopBranchHeuristics()831 if (uint32_t numInEdges = InEdges.size()) { in calcLoopBranchHeuristics()834 for (unsigned SuccIdx : InEdges) in calcLoopBranchHeuristics()
905 DirectEdges InEdges; member934 InEdges.push_back(E); in addInEdge()1111 if (DestInfo.CountValid && DestInfo.InEdges.size() == 1) in setInstrumentedCounts()1231 Count->CountValue = sumEdgeCount(Count->InEdges); in populateCounters()1250 uint64_t InSum = sumEdgeCount(Count->InEdges); in populateCounters()1253 setEdgeCount(Count->InEdges, Total); in populateCounters()
981 DirectEdges InEdges; member1010 InEdges.push_back(E); in addInEdge()1196 if (DestInfo.CountValid && DestInfo.InEdges.size() == 1) in setInstrumentedCounts()1320 Count->CountValue = sumEdgeCount(Count->InEdges); in populateCounters()1339 uint64_t InSum = sumEdgeCount(Count->InEdges); in populateCounters()1342 setEdgeCount(Count->InEdges, Total); in populateCounters()