-
Notifications
You must be signed in to change notification settings - Fork 10.6k
Rework ForEachStmt Desugaring #86010
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
base: main
Are you sure you want to change the base?
Conversation
5381915 to
e7ec1ab
Compare
| return ctx.getAsyncIteratorNext(); | ||
| } | ||
|
|
||
| static BraceStmt *desugarForEachStmt(ForEachStmt* stmt){ |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Potentially refactor this function to make it more readable.
0dc0a64 to
714b32f
Compare
I have not yet tested any behavior of generated SIL code but it seems reasonable in comparison. I was able to compile the standard library. Here: * include/swift/AST/ASTBridging.h, * include/swift/AST/Expr.h, * include/swift/AST/ExprNodes.def, * include/swift/AST/Stmt.h, * include/swift/AST/StmtNodes.def, * include/swift/AST/TypeCheckRequests.h, * include/swift/AST/TypeCheckerTypeIDZone.def, * include/swift/Sema/ConstraintLocator.h, * include/swift/Sema/SyntacticElementTarget.h, * lib/AST/ASTDumper.cpp, * lib/AST/ASTPrinter.cpp, * lib/AST/ASTScopeCreation.cpp, * lib/AST/ASTVerifier.cpp, * lib/AST/ASTWalker.cpp, * lib/AST/Bridging/StmtBridging.cpp, * lib/AST/Expr.cpp, * lib/AST/Stmt.cpp, * lib/AST/TypeCheckRequests.cpp, * lib/ASTGen/Sources/ASTGen/Stmts.swift, * lib/Parse/ParseStmt.cpp, * lib/SILGen/ASTVisitor.h, * lib/SILGen/SILGenExpr.cpp, * lib/SILGen/SILGenStmt.cpp, * lib/SILOptimizer/Mandatory/MoveOnlyDiagnostics.cpp, * lib/Sema/BuilderTransform.cpp, * lib/Sema/CSApply.cpp, * lib/Sema/CSDiagnostics.cpp, * lib/Sema/CSGen.cpp, * lib/Sema/CSSimplify.cpp, * lib/Sema/CSSyntacticElement.cpp, * lib/Sema/SyntacticElementTarget.cpp, * lib/Sema/TypeCheckEffects.cpp, * lib/Sema/TypeCheckStmt.cpp.
714b32f to
5285f67
Compare
67a017d to
b5e88da
Compare
a985680 to
8dbec9f
Compare
bd1a68e to
623bdc5
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Some initial comments from a quick look though, this is looking really good!
| // FIXME: need to find out if the stmt is part of a foreach's | ||
| // desugared |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Isn't this issue resolved by the opaque pattern fix?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
No it isn't
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@elsakeirouz I think the issue is that markOwnedByStatement is walking into the opaque pattern, I think forEachVariable should probably have a parameter that controls whether it should walk into them
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It might also be worth making it so we don't walk into opaque patterns by default in forEachVariable, only SILGen and maybe a couple of Sema clients should care about that case
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think the same also applies to getSemanticsProvidingPattern, I think we should see if we can get away with not recursing into opaque patterns by default
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looking into all of this!
Co-authored-by: Hamish Knight <[email protected]>
Co-authored-by: Hamish Knight <[email protected]>
This PR aims to lift the desugaring of ForEachStmt (when dealing with Sequences) from SILGen to the AST, and simultaneously delaying the synthesis of makeIterator and next calls until after typechecking.
The motivation for this is support for non-Copyable & non-Escapable sequences with non-Copyable elements in ForEachStmt. In order to know which variant of makeIterator and next calls we need, we must determine whether a Sequence is copyable, asynchronous, or neither. The compiler currently relies on the function choice to infer the type of the elements. However, to determine whether a Sequence is copyable, it must be typed.
For that reason, instead of matching the pattern type with the unwrapped result type of next(), we're now matching it with Sequence. This allows us to delay the decision and synthesis of those function calls until later.
Additionally, in order to avoid having to translate the rest of the complex desugar logic for the borrowing ForEachStmt in SILGen, we chose to represent it directly at the AST level, which SILGen will then use to emit the corresponding SIL code.
To make things simpler all around, we chose to start by reworking this pass for the regular/async ForEachStmts before handling borrowing statements.
We expect to be able to remove ConstraintKind::ValueWitness with this work.