From ea96ae80041cc376f0ec3dce127b414a0a1514a0 Mon Sep 17 00:00:00 2001
From: Cyril SIX <cyril.six@kalray.eu>
Date: Fri, 16 Oct 2020 12:31:42 +0200
Subject: Comment update

---
 backend/Duplicateaux.ml | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

(limited to 'backend/Duplicateaux.ml')

diff --git a/backend/Duplicateaux.ml b/backend/Duplicateaux.ml
index 08d0e1f2..ec7a4d02 100644
--- a/backend/Duplicateaux.ml
+++ b/backend/Duplicateaux.ml
@@ -29,6 +29,7 @@ let get_loop_headers = LICMaux.get_loop_headers
 let get_some = LICMaux.get_some
 let rtl_successors = LICMaux.rtl_successors
 
+(* Get list of nodes following a BFS of the code *)
 let bfs code entrypoint = begin
   debug "bfs\n";
   let visited = ref (PTree.map (fun n i -> false) code)
@@ -57,6 +58,7 @@ let optbool o = match o with Some _ -> true | None -> false
 
 let ptree_get_some n ptree = get_some @@ PTree.get n ptree
 
+(* Returns a PTree: node -> list of the predecessors of that node *)
 let get_predecessors_rtl code = begin
   debug "get_predecessors_rtl\n";
   let preds = ref (PTree.map (fun n i -> []) code) in
@@ -125,6 +127,10 @@ let rec look_ahead code node is_loop_header predicate =
         )
     | _ -> false
 
+(** 
+ * Heuristics mostly based on the paper Branch Prediction for Free 
+ *)
+
 let do_call_heuristic code cond ifso ifnot is_loop_header =
   begin
     debug "\tCall heuristic..\n";
@@ -253,7 +259,7 @@ let get_loop_info is_loop_header bfs_order code =
     !loop_info
   end
 
-(* Remark - compared to the original paper, we don't use the store heuristic *)
+(* Remark - compared to the original Branch Prediction for Free paper, we don't use the store heuristic *)
 let get_directions code entrypoint = begin
   debug "get_directions\n";
   let bfs_order = bfs code entrypoint in
-- 
cgit