Skip to content

Commit 24d61c0

Browse files
Fix indentation
1 parent 27dd030 commit 24d61c0

File tree

1 file changed

+6
-6
lines changed

1 file changed

+6
-6
lines changed

src/analyses/pthreadBarriers.ml

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -65,19 +65,19 @@ struct
6565
true
6666
else if Z.geq (Z.of_int (count + 1)) min_cap then
6767
(* This is quite a cute problem: Do (min_cap-1) elements exist in the set such that
68-
MHP is pairwise true? This solution is a sledgehammer, there should be something much
69-
better algorithmically (beyond just laziness) *)
68+
MHP is pairwise true? This solution is a sledgehammer, there should be something much
69+
better algorithmically (beyond just laziness) *)
7070
let waiters = Waiters.elements relevant_waiters in
7171
let min_cap = Z.to_int min_cap in
7272
let lists = List.init (min_cap - 1) (fun _ -> waiters) in
7373
let candidates = BatList.n_cartesian_product lists in
7474
List.exists (fun candidate ->
75-
let pairwise = BatList.cartesian_product candidate candidate in
76-
List.for_all (fun (a,b) -> MHP.may_happen_in_parallel a b) pairwise
77-
) candidates
75+
let pairwise = BatList.cartesian_product candidate candidate in
76+
List.for_all (fun (a,b) -> MHP.may_happen_in_parallel a b) pairwise
77+
) candidates
7878
else
7979
false
80-
| _ -> true
80+
| _ -> true
8181
in
8282
if may_run then
8383
(Barriers.add addr may, Barriers.add addr must)

0 commit comments

Comments
 (0)