RequirementMachine: Protocol reduction order refactoring #39864
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The previous reduction order did not satisfy the property that a merged associated type pair is smaller than or equal to both original associated types. This would trigger an assertion failure in completion.
That is, if P3 : P2 and P3 : P1, we want
Because the merge of
[P3:T]
with[P1&P2:T]
is in fact[P3:T]
.In the previous order, a merged symbol was always smaller than a single associated type symbol, so we had
[P1&P2:T] < [P3:T]
.Also, storing the reduction order in a per-rewrite system protocol graph didn’t really make sense. Make it global on RewriteContext and fold what remains of the ProtocolGraph into the RewriteSystemBuilder, where it is used to compute the transitive closure of the set of protocol dependencies.
Fixes rdar://problem/83768458.