Searched refs:NumConversions (Results 1 – 2 of 2) sorted by relevance
632 unsigned NumConversions; member715 for (unsigned i = 0, e = NumConversions; i != e; ++i) { in hasAmbiguousConversion()778 OverloadCandidate &addCandidate(unsigned NumConversions = 0) {784 if (NumConversions + NumInlineSequences <= 16) {788 NumInlineSequences += NumConversions;792 .Allocate<ImplicitConversionSequence>(NumConversions);796 for (unsigned i = 0; i != NumConversions; ++i)799 C.NumConversions = NumConversions;
739 for (unsigned ii = 0, ie = i->NumConversions; ii != ie; ++ii) in clear()7726 unsigned NumArgs = Cand1.NumConversions; in isBetterOverloadCandidate()7727 assert(Cand2.NumConversions == NumArgs && "Overload candidate mismatch"); in isBetterOverloadCandidate()8469 for (unsigned N = Cand->NumConversions; I != N; ++I) in NoteFunctionCandidate()8521 assert(Cand->NumConversions <= 2 && "builtin operator is not binary"); in NoteBuiltinOperatorCandidate()8526 if (Cand->NumConversions == 1) { in NoteBuiltinOperatorCandidate()8539 unsigned NoOperands = Cand->NumConversions; in NoteAmbiguousUserConversions()8643 assert(L->NumConversions == R->NumConversions); in operator ()()8647 for (unsigned E = L->NumConversions; I != E; ++I) { in operator ()()8710 unsigned ConvCount = Cand->NumConversions; in CompleteNonViableCandidate()