Lines Matching refs:Decls
240 // 1) TagFriend to find undeclared friend decls
241 // 2) Namespace because they can't "overload" with tag decls.
243 // "overload" with tag decls.
311 assert(ResultKind != NotFound || Decls.size() == 0);
312 assert(ResultKind != Found || Decls.size() == 1);
313 assert(ResultKind != FoundOverloaded || Decls.size() > 1 ||
314 (Decls.size() == 1 &&
317 assert(ResultKind != Ambiguous || Decls.size() > 1 ||
318 (Decls.size() == 1 && (Ambiguity == AmbiguousBaseSubobjects ||
338 unsigned N = Decls.size();
349 NamedDecl *D = (*Decls.begin())->getUnderlyingDecl();
371 NamedDecl *D = Decls[I]->getUnderlyingDecl();
384 Decls[I] = Decls[--N];
393 Decls[I] = Decls[--N];
430 if (Decls[UniqueTagIndex]->getDeclContext()->getRedeclContext()->Equals(
431 Decls[UniqueTagIndex? 0 : N-1]->getDeclContext()->getRedeclContext()))
432 Decls[UniqueTagIndex] = Decls[--N];
437 Decls.set_size(N);
456 for (llvm::tie(DI,DE) = I->Decls; DI != DE; ++DI)
477 Out << Decls.size() << " result(s)";
1346 Path.Decls = BaseRecord->lookup(N);
1347 return Path.Decls.first != Path.Decls.second;
1533 if (HasOnlyStaticMembers(Path->Decls.first, Path->Decls.second)) {
1535 DeclContext::lookup_iterator FirstD = FirstPath->Decls.first;
1536 DeclContext::lookup_iterator CurrentD = Path->Decls.first;
1538 while (FirstD != FirstPath->Decls.second &&
1539 CurrentD != Path->Decls.second) {
1548 if (FirstD == FirstPath->Decls.second &&
1549 CurrentD == Path->Decls.second)
1564 if (HasOnlyStaticMembers(Path->Decls.first, Path->Decls.second))
1577 for (llvm::tie(I,E) = Paths.front().Decls; I != E; ++I) {
1604 /// @returns True if any decls were found (but possibly ambiguous)
1658 DeclContext::lookup_iterator Found = Paths->front().Decls.first;
1677 Decl *D = *Path->Decls.first;
2562 // Go through again and remove the raw and template decls we've
2612 NamedDecl *&Old = Decls[cast<NamedDecl>(New->getCanonicalDecl())];
3944 // Store all of the Decls for overloaded symbols
