package goblint
Static analysis framework for C
Install
Dune Dependency
Authors
Maintainers
Sources
goblint-2.5.0.tbz
sha256=452d8491527aea21f2cbb11defcc14ba0daf9fdb6bdb9fc0af73e56eac57b916
sha512=1993cd45c4c7fe124ca6e157f07d17ec50fab5611b270a434ed1b7fb2910aa85a8e6eaaa77dad770430710aafb2f6d676c774dd33942d921f23e2f9854486551
doc/src/goblint.solver/sLRphased.ml.html
Source file sLRphased.ml
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 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208
(** Two-phased terminating SLR3 solver ([slr3tp]). *) open Batteries open ConstrSys open Messages open SLR (** the two-phased terminating SLR3 box solver *) module Make = functor (S:EqConstrSys) -> functor (HM:Hashtbl.S with type key = S.v) -> struct include Generic.SolverStats (S) (HM) module VS = Set.Make (S.Var) module P = struct type t = S.Var.t * S.Var.t [@@deriving eq, hash] end module HPM = Hashtbl.Make (P) let narrow = narrow S.Dom.narrow let solve st vs = let key = HM.create 10 in let module H = Heap.Make (struct type t = S.Var.t let compare x y = compare (HM.find key x) (HM.find key y) end) in let extract_min q = let x = H.find_min !q in q := H.del_min !q; x in let min_key q = let x = H.find_min !q in HM.find key x in let wpoint = HM.create 10 in let infl = HM.create 10 in let set = HM.create 10 in let rho0 = HM.create 10 in (* widening *) let rho1 = HM.create 10 in (* narrowing *) let rho' = HPM.create 10 in let q = ref H.empty in let count = ref 0 in let count_side = ref (max_int - 1) in let rec iterate b prio = if H.size !q = 0 || min_key q > prio then () else let x = extract_min q in if b then solve1 (HM.find key x - 1) x; do_var b x; iterate b prio and do_var b x = let rho = if b then rho1 else rho0 in let wpx = HM.mem wpoint x in HM.remove wpoint x; let old = HM.find rho x in let eval y = get_var_event y; if b then solve1 (HM.find key x - 1) y else solve0 y; if HM.find key x <= HM.find key y then begin HM.replace wpoint y () end; HM.replace infl y (VS.add x (HM.find infl y)); HM.find rho y in let effects = ref Set.empty in let side y d = assert (not (S.Dom.is_bot d)); if tracing then trace "sol" "SIDE: Var: %a\nVal: %a" S.Var.pretty_trace y S.Dom.pretty d; let first = not (Set.mem y !effects) in effects := Set.add y !effects; if first then ( (* let old = try HPM.find rho' (x,y) with _ -> S.Dom.bot () in *) (* let d = S.Dom.join old d in *) HPM.replace rho' (x,y) d; HM.replace set y (VS.add x (try HM.find set y with Not_found -> VS.empty)); if not (HM.mem rho y) then ( if b then solve1 (HM.find key x - 1) ~side:true y else solve0 ~side:true y ) else ( (* trace "sol" "SIDE: Var: %a already exists with Prio: %i and Val: %a" S.Var.pretty_trace y (HM.find key y) S.Dom.pretty d; *) if HM.find key y < 0 then HM.replace key y (Ref.post_decr count_side) ); q := H.add y !q ) else ( assert (HM.mem rho y); let old = HPM.find rho' (x,y) in let newd = S.Dom.join old d in HPM.replace rho' (x,y) newd; if not (S.Dom.equal old newd) then ( q := H.add y !q ) ); HM.replace wpoint y () in let tmp = eq x eval side in let tmp = S.Dom.join tmp (sides x) in (* if (b && not (S.Dom.leq old tmp)) then ( *) (* trace "sol" "Var: %a\nOld: %a\nTmp: %a" S.Var.pretty_trace x S.Dom.pretty old S.Dom.pretty tmp; *) (* assert false *) (* ); *) let val_new = if wpx then if b then let nar = narrow old tmp in if tracing then trace "sol" "NARROW: Var: %a\nOld: %a\nNew: %a\nWiden: %a" S.Var.pretty_trace x S.Dom.pretty old S.Dom.pretty tmp S.Dom.pretty nar; nar else let wid = S.Dom.widen old (S.Dom.join old tmp) in if tracing then trace "sol" "WIDEN: Var: %a\nOld: %a\nNew: %a\nWiden: %a" S.Var.pretty_trace x S.Dom.pretty old S.Dom.pretty tmp S.Dom.pretty wid; wid else tmp in if tracing then trace "sol" "Var: %a" S.Var.pretty_trace x ; if tracing then trace "sol" "Contrib:%a" S.Dom.pretty val_new; if S.Dom.equal old val_new then () else begin update_var_event x old val_new; if tracing then trace "sol" "New Value:%a" S.Dom.pretty val_new; HM.replace rho x val_new; let w = try HM.find infl x with Not_found -> VS.empty in (* let w = if wpx then VS.add x w else w in *) q := Enum.fold (fun x y -> H.add y x) !q (VS.enum w); HM.replace infl x VS.empty end and solve0 ?(side=false) x = if not (HM.mem rho0 x) then ( new_var_event x; let d = S.Dom.bot () in HM.replace rho0 x d; HM.replace infl x VS.empty; if side then ( Logs.debug "%s" @@ "Variable by side-effect " ^ S.Var.var_id x ^ " to " ^ string_of_int !count_side; HM.replace key x !count_side; decr count_side ) else ( Logs.debug "%s" @@ "Variable " ^ S.Var.var_id x ^ " to " ^ string_of_int !count; HM.replace key x !count; decr count ); do_var false x; if side then q := H.add x !q else iterate false (HM.find key x) ) and solve1 ?(side=false) prio x = solve0 ~side:side x; if not (HM.mem rho1 x) then ( new_var_event x; let d = HM.find rho0 x in HM.replace rho1 x d; let w = VS.add x @@ try HM.find infl x with Not_found -> VS.empty in HM.replace infl x VS.empty; q := Enum.fold (fun x y -> H.add y x) !q (VS.enum w); iterate true prio ) and sides x = let w = try HM.find set x with Not_found -> VS.empty in let v = Enum.fold (fun d z -> try S.Dom.join d (HPM.find rho' (z,x)) with Not_found -> d) (S.Dom.bot ()) (VS.enum w) in if tracing then trace "sol" "SIDES: Var: %a\nVal: %a" S.Var.pretty_trace x S.Dom.pretty v; v and eq x get set = eval_rhs_event x; match S.system x with | None -> S.Dom.bot () | Some f -> f get set in let set_start (x,d) = solve0 ~side:true x; HM.replace rho0 x d; HM.replace wpoint x (); q := H.add x !q; HM.replace set x (VS.add x VS.empty); HPM.replace rho' (x,x) d in start_event (); List.iter set_start st; List.iter (solve0) vs; iterate false max_int; List.iter (solve1 max_int) vs; iterate true max_int; (* TODO remove? *) stop_event (); if GobConfig.get_bool "dbg.print_wpoints" then ( Logs.newline (); Logs.debug "Widening points:"; HM.iter (fun k () -> Logs.debug "%a" S.Var.pretty_trace k) wpoint; Logs.newline (); ); HM.clear key ; HM.clear wpoint; HM.clear infl ; HM.clear set ; HPM.clear rho' ; rho1 end let _ = Selector.add_solver ("slr3tp", (module PostSolver.EqIncrSolverFromEqSolver (Make))); (* two-phased slr3t *)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>