Lines Matching defs:Sum

499   findIndirectCallFunctionSamples(const Instruction &I, uint64_t &Sum) const;
506       uint64_t &Sum, SmallVector<CallBase *, 8> *InlinedCallSites = nullptr);
725 /// the total call count of the indirect call in \p Sum.
728     const Instruction &Inst, uint64_t &Sum) const {
751     Sum = 0;
753       Sum += FS->getHeadSamplesEstimate();
765   Sum = 0;
768       Sum += T_C.second;
773       Sum += NameFS.second.getHeadSamplesEstimate();
839 /// Usually \p Sum is the sum of counts of all the targets for \p Inst.
846                   uint64_t Sum) {
860   if (Sum == 0) {
876     Sum = OldSum;
891       // Sum by Data.Count.
892       assert(Sum >= Data.Count && "Sum should never be less than Data.Count");
893       Sum -= Data.Count;
913                     NewCallTargets, Sum, IPVK_IndirectCallTarget, MaxMDCount);
922 /// \param Sum        Prorated sum of remaining target counts for indirect call
927     Function &F, InlineCandidate &Candidate, uint64_t SumOrigin, uint64_t &Sum,
963         CI, R->second, Candidate.CallsiteCount, Sum, false, ORE);
965       Sum -= Candidate.CallsiteCount;
1198         uint64_t Sum;
1199         for (const auto *FS : findIndirectCallFunctionSamples(*I, Sum)) {
1200           uint64_t SumOrigin = Sum;
1210           if (tryPromoteAndInlineCandidate(F, Candidate, SumOrigin, Sum)) {
1465       uint64_t Sum = 0;
1466       auto CalleeSamples = findIndirectCallFunctionSamples(*I, Sum);
1467       uint64_t SumOrigin = Sum;
1468       Sum *= Candidate.CallsiteDistribution;
1500         if (tryPromoteAndInlineCandidate(F, Candidate, SumOrigin, Sum,
1656           uint64_t Sum = 0;
1658             Sum += C.second;
1666                 Sum += NameFS.second.getHeadSamplesEstimate();
1669           if (Sum)
1670             updateIDTMetaData(I, SortedCallTargets, Sum);