blob: 0abf82e94616a8794216cdfd7edb684862f8afe3 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
|
(** 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
|
