Fix apparent nondeterminism in pattern matching compilation. #7557
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Fixes #7465 Pattern matching compilation has some code to find if some exit is used at least 3 times. This is done by iterating on a hash table. However, the exit id is generated based on a global counter, which determines which exit value `n` is generated. This can affect the order in which the hash table is traversed, as the exit id is hashed. This PR makes the code generation deterministic by adding a tie-breaker if more than id leads to the same exit being used at least 3 times: take the smaller id.
cristianoc
force-pushed
the
nondet-pattern-match
branch
from
2fddf8e to
c2a29d0
Compare
rescript
@rescript/darwin-arm64
@rescript/darwin-x64
@rescript/linux-arm64
@rescript/linux-x64
@rescript/win32-x64
commit: |
There was a problem hiding this comment.
Pull Request Overview
This PR fixes an issue with nondeterministic behavior in pattern matching compilation by introducing a deterministic tie-breaker in exit id selection. Key changes include updated tests in JavaScript and ReScript for pattern matching, a revised tie-breaker condition in the compiler backend, and a changelog entry documenting the fix.
Reviewed Changes
Copilot reviewed 5 out of 5 changed files in this pull request and generated 1 comment.
Show a summary per file
| File | Description |
|---|---|
| tests/tests/src/adt_optimize_test.mjs | Updated test cases to reflect changes in pattern matching behavior. |
| tests/tests/src/NondetPatterMatch.res | Added new tests with ReScript syntax for pattern matching. |
| tests/tests/src/NondetPatterMatch.mjs | Added new tests with JS patterns for validating pattern matching. |
| compiler/ml/matching.ml | Updated tie-breaker logic for exit id selection to improve determinism. |
| CHANGELOG.md | Documented the fix in the changelog. |
| (fun i c -> | ||
| if c > !max then ( | ||
| if | ||
| c > !max || (c = !max && i > !i_max) |
There was a problem hiding this comment.
The tie-break condition claims to choose the smallest index, but the condition 'i > !i_max' actually selects the larger index. Consider revising it to 'i < !i_max' to ensure the intended deterministic behavior.
Suggested change
| c > !max || (c = !max && i > !i_max) | |
| c > !max || (c = !max && i < !i_max) |
Copilot uses AI. Check for mistakes.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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.
Fixes #7465
Pattern matching compilation has some code to find if some exit is used at least 3 times. This is done by iterating on a hash table. However, the exit id is generated based on a global counter, which determines which exit value
nis generated. This can affect the order in which the hash table is traversed, as the exit id is hashed. This PR makes the code generation deterministic by adding a tie-breaker if more than id leads to the same exit being used at least 3 times: take the smaller id.