Getting rid of CIL

git-svn-id: https://yquem.inria.fr/compcert/svn/compcert/trunk@1270 fca1b0fc-160b-0410-b1d3-a4f43f01ea2e

1 files changed, 0 insertions, 29 deletions

diff --git a/cil/src/ext/dominators.mli b/cil/src/ext/dominators.mli
deleted file mode 100755
index 0abf82e9..00000000
--- a/cil/src/ext/dominators.mli
+++ /dev/null
@@ -1,29 +0,0 @@
-
-
-(** Compute dominators using data flow analysis *)
-(** Author: George Necula   
-      5/28/2004 
- **)
-
-(** Invoke on a code after filling in the CFG info and it computes the 
- * immediate dominator information. We map each statement to its immediate 
- * dominator (None for the start statement, and for the unreachable 
- * statements). *)
-val computeIDom: Cil.fundec -> Cil.stmt option Inthash.t
-
-
-(** This is like Inthash.find but gives an error if the information is 
- * Not_found *)
-val getIdom:  Cil.stmt option Inthash.t -> Cil.stmt -> Cil.stmt option
-
-(** Check whether one statement dominates another. *)
-val dominates: Cil.stmt option Inthash.t -> Cil.stmt -> Cil.stmt -> bool
-
-
-(** Compute the start of the natural loops. This assumes that the "idom" 
- * field has been computed. For each start, keep a list of origin of a back 
- * edge. The loop consists of the loop start and all predecessors of the 
- * origins of back edges, up to and including the loop start *)
-val findNaturalLoops: Cil.fundec -> 
-                      Cil.stmt option Inthash.t -> 
-                      (Cil.stmt * Cil.stmt list) list