-
Notifications
You must be signed in to change notification settings - Fork 61
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
[herd] New "topological order" solver
This PR also introduced two new variants: - `-variant oldsolver` use the previous, iterative, solver. - `-variant oota`, do not reject circular dependencies. Those execution candidates will be rejected by mots models in a subsequent phase.
- Loading branch information
Showing
17 changed files
with
450 additions
and
66 deletions.
There are no files selected for viewing
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
C C13 | ||
(* Forbidden by rc11, allowed by most C11 models that tolerate oota *) | ||
{ | ||
x = 0; | ||
y = 0; | ||
} | ||
|
||
P0(atomic_int *x, atomic_int *y) { | ||
int r1 = atomic_load_explicit(y, memory_order_relaxed); | ||
atomic_store_explicit(x, r1, memory_order_relaxed); | ||
int r2 = (r1^r1)+r1; | ||
} | ||
|
||
P1(atomic_int *x, atomic_int *y) { | ||
int r4 = atomic_load_explicit(x, memory_order_relaxed); | ||
atomic_store_explicit(y, r4, memory_order_relaxed); | ||
} | ||
|
||
locations [0:r2; 1:r4;] | ||
exists 0:r1 != 0 | ||
|
||
|
This file contains 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
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,10 @@ | ||
Test C13 Allowed | ||
States 1 | ||
0:r1=0x0; 0:r2=0x0; 1:r4=0x0; | ||
No | ||
Witnesses | ||
Positive: 0 Negative: 3 | ||
Condition exists (not (0:r1=0x0)) | ||
Observation C13 Never 0 3 | ||
Hash=45b06aedc4caf5ef4fdf494a986f8199 | ||
|
Oops, something went wrong.