Lines Matching defs:Sum
496 findIndirectCallFunctionSamples(const Instruction &I, uint64_t &Sum) const;
503 uint64_t &Sum, SmallVector<CallBase *, 8> *InlinedCallSites = nullptr);
718 /// the total call count of the indirect call in \p Sum.
721 const Instruction &Inst, uint64_t &Sum) const {
744 Sum = 0;
746 Sum += FS->getHeadSamplesEstimate();
758 Sum = 0;
761 Sum += T_C.second;
766 Sum += NameFS.second.getHeadSamplesEstimate();
832 /// Usually \p Sum is the sum of counts of all the targets for \p Inst.
839 uint64_t Sum) {
853 if (Sum == 0) {
869 Sum = OldSum;
884 // Sum by Data.Count.
885 assert(Sum >= Data.Count && "Sum should never be less than Data.Count");
886 Sum -= Data.Count;
906 NewCallTargets, Sum, IPVK_IndirectCallTarget, MaxMDCount);
915 /// \param Sum Prorated sum of remaining target counts for indirect call
920 Function &F, InlineCandidate &Candidate, uint64_t SumOrigin, uint64_t &Sum,
956 CI, R->second, Candidate.CallsiteCount, Sum, false, ORE);
958 Sum -= Candidate.CallsiteCount;
1191 uint64_t Sum;
1192 for (const auto *FS : findIndirectCallFunctionSamples(*I, Sum)) {
1193 uint64_t SumOrigin = Sum;
1203 if (tryPromoteAndInlineCandidate(F, Candidate, SumOrigin, Sum)) {
1458 uint64_t Sum = 0;
1459 auto CalleeSamples = findIndirectCallFunctionSamples(*I, Sum);
1460 uint64_t SumOrigin = Sum;
1461 Sum *= Candidate.CallsiteDistribution;
1493 if (tryPromoteAndInlineCandidate(F, Candidate, SumOrigin, Sum,
1649 uint64_t Sum = 0;
1651 Sum += C.second;
1659 Sum += NameFS.second.getHeadSamplesEstimate();
1662 if (Sum)
1663 updateIDTMetaData(I, SortedCallTargets, Sum);