Skip to content

[Constraint graph] Eliminate adjacency information in the graph nodes. #26347

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
22 changes: 11 additions & 11 deletions lib/Sema/CSBindings.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -209,14 +209,14 @@ bool ConstraintSystem::PotentialBindings::isViable(
static bool hasNilLiteralConstraint(TypeVariableType *typeVar,
ConstraintSystem &CS) {
// Look for a literal-conformance constraint on the type variable.
llvm::SetVector<Constraint *> constraints;
CS.getConstraintGraph().gatherConstraints(
typeVar, constraints, ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *constraint) -> bool {
return constraint->getKind() == ConstraintKind::LiteralConformsTo &&
constraint->getProtocol()->isSpecificProtocol(
KnownProtocolKind::ExpressibleByNilLiteral);
});
auto constraints =
CS.getConstraintGraph().gatherConstraints(
typeVar, ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *constraint) -> bool {
return constraint->getKind() == ConstraintKind::LiteralConformsTo &&
constraint->getProtocol()->isSpecificProtocol(
KnownProtocolKind::ExpressibleByNilLiteral);
});

for (auto constraint : constraints)
if (CS.simplifyType(constraint->getFirstType())->isEqual(typeVar))
Expand Down Expand Up @@ -392,9 +392,9 @@ ConstraintSystem::getPotentialBindings(TypeVariableType *typeVar) {
}

// Gather the constraints associated with this type variable.
llvm::SetVector<Constraint *> constraints;
getConstraintGraph().gatherConstraints(
typeVar, constraints, ConstraintGraph::GatheringKind::EquivalenceClass);
auto constraints =
getConstraintGraph().gatherConstraints(
typeVar, ConstraintGraph::GatheringKind::EquivalenceClass);

PotentialBindings result(typeVar);

Expand Down
5 changes: 2 additions & 3 deletions lib/Sema/CSDiag.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -6929,9 +6929,8 @@ bool FailureDiagnosis::diagnoseAmbiguousGenericParameters() {
// because type B would have no constraints associated with it.
unsigned numConstraints = 0;
{
llvm::SetVector<Constraint *> constraints;
CS.getConstraintGraph().gatherConstraints(
tv, constraints, ConstraintGraph::GatheringKind::EquivalenceClass,
auto constraints = CS.getConstraintGraph().gatherConstraints(
tv, ConstraintGraph::GatheringKind::EquivalenceClass,
[&](Constraint *constraint) -> bool {
// We are not interested in ConformsTo constraints because
// we can't derive any concrete type information from them.
Expand Down
5 changes: 2 additions & 3 deletions lib/Sema/CSGen.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -533,9 +533,8 @@ namespace {

llvm::SmallSetVector<ProtocolDecl *, 2> literalProtos;
if (auto argTypeVar = argTy->getAs<TypeVariableType>()) {
llvm::SetVector<Constraint *> constraints;
CS.getConstraintGraph().gatherConstraints(
argTypeVar, constraints,
auto constraints = CS.getConstraintGraph().gatherConstraints(
argTypeVar,
ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *constraint) {
return constraint->getKind() == ConstraintKind::LiteralConformsTo;
Expand Down
5 changes: 2 additions & 3 deletions lib/Sema/CSSimplify.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -7133,9 +7133,8 @@ ConstraintSystem::addKeyPathApplicationRootConstraint(Type root, ConstraintLocat
if (!typeVar)
return;

llvm::SetVector<Constraint *> constraints;
CG.gatherConstraints(
typeVar, constraints, ConstraintGraph::GatheringKind::EquivalenceClass,
auto constraints = CG.gatherConstraints(
typeVar, ConstraintGraph::GatheringKind::EquivalenceClass,
[&keyPathExpr](Constraint *constraint) -> bool {
return constraint->getKind() == ConstraintKind::KeyPath &&
constraint->getLocator()->getAnchor() == keyPathExpr;
Expand Down
50 changes: 23 additions & 27 deletions lib/Sema/CSSolver.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1519,9 +1519,8 @@ static Constraint *selectBestBindingDisjunction(
if (!firstBindDisjunction)
firstBindDisjunction = disjunction;

llvm::SetVector<Constraint *> constraints;
cs.getConstraintGraph().gatherConstraints(
typeVar, constraints, ConstraintGraph::GatheringKind::EquivalenceClass,
auto constraints = cs.getConstraintGraph().gatherConstraints(
typeVar, ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *constraint) {
return constraint->getKind() == ConstraintKind::Conversion;
});
Expand Down Expand Up @@ -1576,9 +1575,8 @@ void ConstraintSystem::ArgumentInfoCollector::walk(Type argType) {

visited.insert(rep);

llvm::SetVector<Constraint *> constraints;
CS.getConstraintGraph().gatherConstraints(
rep, constraints, ConstraintGraph::GatheringKind::EquivalenceClass);
auto constraints = CS.getConstraintGraph().gatherConstraints(
rep, ConstraintGraph::GatheringKind::EquivalenceClass);

for (auto *constraint : constraints) {
switch (constraint->getKind()) {
Expand Down Expand Up @@ -1772,9 +1770,8 @@ Constraint *ConstraintSystem::getUnboundBindOverloadDisjunction(
while (visitedVars.insert(rep).second) {
// Look for a disjunction that binds this type variable to an overload set.
TypeVariableType *optionalObjectTypeVar = nullptr;
llvm::SetVector<Constraint *> disjunctions;
getConstraintGraph().gatherConstraints(
rep, disjunctions, ConstraintGraph::GatheringKind::EquivalenceClass,
auto disjunctions = getConstraintGraph().gatherConstraints(
rep, ConstraintGraph::GatheringKind::EquivalenceClass,
[this, rep, &optionalObjectTypeVar](Constraint *match) {
// If we have an "optional object of" constraint where the right-hand
// side is this type variable, we may need to follow that type
Expand Down Expand Up @@ -1875,9 +1872,8 @@ void ConstraintSystem::sortDesignatedTypes(
SmallVectorImpl<NominalTypeDecl *> &nominalTypes,
Constraint *bindOverload) {
auto *tyvar = bindOverload->getFirstType()->castTo<TypeVariableType>();
llvm::SetVector<Constraint *> applicableFns;
getConstraintGraph().gatherConstraints(
tyvar, applicableFns, ConstraintGraph::GatheringKind::EquivalenceClass,
auto applicableFns = getConstraintGraph().gatherConstraints(
tyvar, ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *match) {
return match->getKind() == ConstraintKind::ApplicableFunction;
});
Expand Down Expand Up @@ -2292,21 +2288,21 @@ void DisjunctionChoice::propagateConversionInfo(ConstraintSystem &cs) const {
return;

auto conversionType = bindings.Bindings[0].BindingType;
llvm::SetVector<Constraint *> constraints;
cs.CG.gatherConstraints(typeVar, constraints,
ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *constraint) -> bool {
switch (constraint->getKind()) {
case ConstraintKind::Conversion:
case ConstraintKind::Defaultable:
case ConstraintKind::ConformsTo:
case ConstraintKind::LiteralConformsTo:
return false;

default:
return true;
}
});
auto constraints = cs.CG.gatherConstraints(
typeVar,
ConstraintGraph::GatheringKind::EquivalenceClass,
[](Constraint *constraint) -> bool {
switch (constraint->getKind()) {
case ConstraintKind::Conversion:
case ConstraintKind::Defaultable:
case ConstraintKind::ConformsTo:
case ConstraintKind::LiteralConformsTo:
return false;

default:
return true;
}
});

if (constraints.empty())
cs.addConstraint(ConstraintKind::Bind, typeVar, conversionType,
Expand Down
Loading