Interf scheduling tries harder with arrays
This commit is contained in:
parent
fc1edf91f0
commit
61e14546df
1 changed files with 2 additions and 3 deletions
|
@ -69,12 +69,11 @@ struct
|
|||
nb_def_vars - nb_killed_vars + b
|
||||
|
||||
in
|
||||
(* returns the minimum element of the list with same_ctrl = true. If there is no such element,
|
||||
return the minimum of the list. *)
|
||||
(* returns the minimum element of the list with same_ctrl = true if possible. *)
|
||||
let rec min_same_ck (min_eq, min_c, min_same_ctrl) l = match l with
|
||||
| [] -> min_eq
|
||||
| (eq, c, same_ctrl)::l ->
|
||||
if (c < min_c && (same_ctrl = min_same_ctrl)) or (same_ctrl && not min_same_ctrl) then
|
||||
if (c < min_c) or (c = min_c && (same_ctrl && not min_same_ctrl)) then
|
||||
min_same_ck (eq, c, same_ctrl) l
|
||||
else
|
||||
min_same_ck (min_eq, min_c, min_same_ctrl) l
|
||||
|
|
Loading…
Reference in a new issue