Searched refs:NumConversions (Results 1 – 2 of 2) sorted by relevance
619 unsigned NumConversions; member659 for (unsigned i = 0, e = NumConversions; i != e; ++i) { in hasAmbiguousConversion()752 OverloadCandidate &addCandidate(unsigned NumConversions = 0) {758 if (NumConversions + NumInlineSequences <= 16) {762 NumInlineSequences += NumConversions;766 .Allocate<ImplicitConversionSequence>(NumConversions);770 for (unsigned i = 0; i != NumConversions; ++i)773 C.NumConversions = NumConversions;
761 for (unsigned ii = 0, ie = i->NumConversions; ii != ie; ++ii) in destroyCandidates()8358 unsigned NumArgs = Cand1.NumConversions; in isBetterOverloadCandidate()8359 assert(Cand2.NumConversions == NumArgs && "Overload candidate mismatch"); in isBetterOverloadCandidate()9298 for (unsigned N = Cand->NumConversions; I != N; ++I) in NoteFunctionCandidate()9352 assert(Cand->NumConversions <= 2 && "builtin operator is not binary"); in NoteBuiltinOperatorCandidate()9357 if (Cand->NumConversions == 1) { in NoteBuiltinOperatorCandidate()9370 unsigned NoOperands = Cand->NumConversions; in NoteAmbiguousUserConversions()9492 assert(L->NumConversions == R->NumConversions); in operator ()()9496 for (unsigned E = L->NumConversions; I != E; ++I) { in operator ()()9560 unsigned ConvCount = Cand->NumConversions; in CompleteNonViableCandidate()