summaryrefslogtreecommitdiff
path: root/extraction/Kildall.ml.patch
blob: b7e5b0bf137de71e7689639956280b63e000cb2b (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
30
31
32
33
34
35
36
37
38
39
40
*** kildall.ml.orig	2009-06-03 11:32:52.297641897 +0200
--- kildall.ml	2009-06-03 11:34:48.481516509 +0200
***************
*** 151,158 ****
        -> (positive, LAT.t) prod list -> LAT.t PMap.t option **)
    
    let fixpoint successors topnode transf entrypoints =
!     DS.fixpoint (fun s -> PMap.get s (make_predecessors successors topnode))
!       topnode transf entrypoints
   end
  
  module type ORDERED_TYPE_WITH_TOP = 
--- 151,158 ----
        -> (positive, LAT.t) prod list -> LAT.t PMap.t option **)
    
    let fixpoint successors topnode transf entrypoints =
!     let pred = make_predecessors successors topnode in
!     DS.fixpoint (fun s -> PMap.get s pred) topnode transf entrypoints
   end
  
  module type ORDERED_TYPE_WITH_TOP = 
***************
*** 248,255 ****
    (** val basic_block_map :
        (positive -> positive list) -> positive -> positive -> bbmap **)
    
!   let basic_block_map successors topnode entrypoint x =
!     is_basic_block_head entrypoint (make_predecessors successors topnode) x
    
    (** val basic_block_list : positive -> bbmap -> positive list **)
    
--- 248,255 ----
    (** val basic_block_map :
        (positive -> positive list) -> positive -> positive -> bbmap **)
    
!   let basic_block_map successors topnode entrypoint =
!     is_basic_block_head entrypoint (make_predecessors successors topnode)
    
    (** val basic_block_list : positive -> bbmap -> positive list **)