diff options
| author | Cyril SIX <cyril.six@kalray.eu> | 2020-03-23 16:32:23 +0100 |
|---|---|---|
| committer | Cyril SIX <cyril.six@kalray.eu> | 2020-03-23 16:32:23 +0100 |
| commit | 1033c2a0ffefc336c343888e1abda02d7a1db228 (patch) | |
| tree | e33f940dc67995eb05b3d4b4a02e31921c1a5bd0 /backend/Linearizeaux.ml | |
| parent | 87b17fa1912da24ba114a181d1fbd1779d33e835 (diff) | |
| download | compcert-kvx-1033c2a0ffefc336c343888e1abda02d7a1db228.tar.gz compcert-kvx-1033c2a0ffefc336c343888e1abda02d7a1db228.zip | |
Removing store heuristic and more fine tuning loop heuristic
Diffstat (limited to 'backend/Linearizeaux.ml')
| -rw-r--r-- | backend/Linearizeaux.ml | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/backend/Linearizeaux.ml b/backend/Linearizeaux.ml index 23ced4c2..e68a9b9a 100644 --- a/backend/Linearizeaux.ml +++ b/backend/Linearizeaux.ml @@ -154,7 +154,7 @@ let forward_sequences code entry = let visited = ref (PTree.map (fun n i -> false) code) in (* returns the list of traversed nodes, and a list of nodes to start traversing next *) let rec traverse_fallthrough code node = - Printf.printf "Traversing %d..\n" (P.to_int node); + (* Printf.printf "Traversing %d..\n" (P.to_int node); *) if not (get_some @@ PTree.get node !visited) then begin visited := PTree.set node true !visited; match PTree.get node code with |