Source file build.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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
open Cil_types
open Dive_types
module Graph = Dive_graph
let dkey = Self.register_category "build"
type locstack = Cil_types.stmt * Callstack.t
type gstmt =
| Local of locstack
| Global of Cil_types.varinfo
module EnumLvals =
struct
let visitor () =
object
inherit Visitor.frama_c_inplace
val mutable acc = []
method get_acc = acc
method! vexpr expr =
match expr.enode with
| Lval lval -> acc <- lval :: acc; Cil.SkipChildren
| UnOp _ | BinOp _ | CastE _ -> Cil.DoChildren
| _ -> Cil.SkipChildren
end
let in_lval lval =
let vis = visitor () in
ignore (Visitor.visitFramacLval (vis :> Visitor.frama_c_inplace) lval);
List.rev vis#get_acc
let in_exp exp =
let vis = visitor () in
ignore (Visitor.visitFramacExpr (vis :> Visitor.frama_c_inplace) exp);
List.rev vis#get_acc
let in_init vi init =
let vis = visitor () in
ignore (Visitor.visitFramacInit (vis :> Visitor.frama_c_inplace) vi NoOffset init);
List.rev vis#get_acc
let in_alarm = function
| Alarms.Division_by_zero e | Index_out_of_bound (e, _) | Invalid_shift (e,_)
| Overflow (_,e,_,_) | Float_to_int (e,_,_) | Is_nan_or_infinite (e,_)
| Is_nan (e,_) | Function_pointer (e,_) | Invalid_pointer e ->
in_exp e
| Pointer_comparison (opt_e1,e2) ->
Option.fold ~none:[] ~some:in_exp opt_e1 @ in_exp e2
| Differing_blocks (e1,e2) ->
in_exp e1 @ in_exp e2
| Memory_access (lval, _) -> in_lval lval
| Not_separated _ | Overlap _
| Uninitialized _ | Dangling _ -> []
| Invalid_bool lv -> [lv]
end
module Eval =
struct
open Eva.Results
let at_start_of = at_start_of
let after = after
let before_gstmt = function
| Global _ -> at_start
| Local (stmt,_) -> before stmt
let after_gstmt = function
| Global _ -> at_start
| Local (stmt,_) -> after stmt
let to_kf_list kinstr callee =
before_kinstr kinstr |> eval_callee callee |>
Result.value ~default:[]
let to_cvalue request lval =
eval_lval lval request |> as_cvalue
let to_location gstmt lval =
before_gstmt gstmt |> eval_address lval |> as_location
let to_zone gstmt lval =
before_gstmt gstmt |> eval_address lval |> as_zone
let to_callstacks stmt =
before stmt |> callstacks
let is_tainted request lval =
let zone = eval_address lval request |> as_zone in
is_tainted zone request |> Result.to_option
let writes zone =
Self.debug ~dkey "computing writes for %a" Locations.Zone.pretty zone;
let writes = Studia.Writes.compute zone in
Self.debug ~dkey "%d found" (List.length writes);
writes
let reads zone =
Self.debug ~dkey "computing reads for %a" Locations.Zone.pretty zone;
let reads = Studia.Reads.compute zone in
Self.debug ~dkey "%d found" (List.length reads);
reads
let does_lval_read_zone zone stmt lval =
let zone' = to_zone (Local (stmt,[])) lval in
Locations.Zone.intersects zone' zone
let does_exp_read_zone zone stmt exp =
List.exists (does_lval_read_zone zone stmt) (EnumLvals.in_exp exp)
let does_init_read_zone zone stmt vi init =
List.exists (does_lval_read_zone zone stmt) (EnumLvals.in_init vi init)
end
let update_node_values context node ?(lval=Node_kind.to_lval node.node_kind) rq =
match lval with
| None -> ()
| Some lval ->
let typ = Cil.typeOfLval lval
and cvalue = Eval.to_cvalue rq lval
and taint = Eval.is_tainted rq lval in
Context.update_node_values context node ~typ ~cvalue ~taint
let get_loc_filename loc =
Filepath.(Normalized.to_pretty_string (fst loc).pos_path)
let is_foldable_type typ =
match Cil.unrollType typ with
| TArray _ | TComp _ -> true
| TVoid _ | TInt _ | TEnum _ | TFloat _ | TPtr _ | TFun _
| TBuiltin_va_list _ -> false
| TNamed _ -> assert false
let enumerate_cells ~is_folded_base gstmt lval =
let typ = Cil.typeOfLval lval in
let location = Eval.to_location gstmt lval in
let open Locations in
let map_base (base,ival) =
match base with
| Base.Var (vi,_) | Allocated (vi,_,_) ->
begin
if is_foldable_type vi.vtype && is_folded_base vi then
Seq.return (Composite (vi))
else
let map_offset offset =
let matching = Bit_utils.MatchType typ in
let offset', _ = Bit_utils.find_offset vi.vtype ~offset matching in
Scalar (vi, typ, offset')
in
try
Ival.to_int_seq ival |> Seq.map map_offset
with Abstract_interp.Error_Top | Bit_utils.NoMatchingOffset ->
Seq.return (Composite (vi))
end
| CLogic_Var _ -> Seq.return (Error "logic variables not supported")
| Null -> Seq.return AbsoluteMemory
| String (i,cs) -> Seq.return (String (i, cs))
in
try
Location_Bits.to_seq_i location.loc |> Seq.flat_map map_base
with Abstract_interp.Error_Top ->
match gstmt with
| Local (stmt,_) -> Seq.return (Unknown (lval, stmt))
| Global _vi ->
Seq.return (Error "Global initialization address cannot be resolved")
let build_node_kind ~is_folded_base gstmt lval =
match lval with
| Var vi, offset ->
Scalar (vi, Cil.typeOfLval lval, offset)
| Mem _, _ ->
let cells_seq = enumerate_cells ~is_folded_base gstmt lval in
match cells_seq () with
| Seq.Cons (node_kind, seq) when Seq.is_empty seq -> node_kind
| _ ->
match gstmt with
| Local (stmt ,_) -> Scattered (lval, stmt)
| Global _vi -> Error "Global initialization address cannot be resolved"
let build_node_locality gstmt node_kind =
let make_local callstack =
match callstack with
| [] -> assert false
| (kf,_kinstr) :: _ ->
let loc_file = get_loc_filename (Kernel_function.get_location kf) in
{ loc_file ; loc_callstack=callstack }
in
let make_global vi =
{ loc_file=get_loc_filename vi.vdecl; loc_callstack=[] }
in
match gstmt with
| Local (_, callstack) ->
begin match node_kind with
| Scalar (vi,_,_) | Composite (vi) ->
begin match Kernel_function.find_defining_kf vi with
| Some kf ->
let callstack =
try
Callstack.pop_downto kf callstack
with Failure _ ->
Callstack.init kf
in
make_local callstack
| None -> make_global vi
end
| Scattered _ | Unknown _ | Alarm _ | AbsoluteMemory | String _ | Const _
| Error _ ->
make_local callstack
end
| Global vi ->
make_global vi
let find_compatible_callstacks stmt callstack =
let kf = Kernel_function.find_englobing_kf stmt in
if callstack = []
then [Callstack.init kf]
else if Kernel_function.equal kf (Callstack.top_kf callstack)
then
[callstack]
else
let callstacks = Eval.to_callstacks stmt in
let make_compatible cs =
let cs = List.rev (Eva.Callstack.to_call_list cs) in
Callstack.truncate_to_sub cs callstack |>
Option.value ~default:(Callstack.init kf)
in
let result = List.map make_compatible callstacks in
List.sort_uniq Callstack.compare result
let add_or_update_node ~context gstmt node_kind =
let node_locality = build_node_locality gstmt node_kind in
let node = Context.add_node context ~node_kind ~node_locality in
begin match node_kind with
| Alarm _ ->
node.node_reads_computation <- Done
| Unknown _ | Const _ | String _ ->
node.node_writes_computation <- Done
| Error _ ->
node.node_reads_computation <- Done;
node.node_writes_computation <- Done
| _ -> ()
end;
node
let build_node ~context gstmt lval =
let is_folded_base = Context.is_folded context in
let node_kind = build_node_kind ~is_folded_base gstmt lval in
add_or_update_node ~context gstmt node_kind
let build_var ~context gstmt varinfo =
let lval = Var varinfo, NoOffset in
build_node ~context gstmt lval
let build_lval ~context gstmt lval =
let node = build_node ~context gstmt lval in
update_node_values context ~lval:(Some lval) node (Eval.after_gstmt gstmt);
node
let build_const ~context gstmt exp =
add_or_update_node ~context gstmt (Const exp)
let build_alarm ~context (stmt,_ as locstack) alarm =
let node_kind = Alarm (stmt,alarm) in
let node_locality = build_node_locality (Local locstack) node_kind in
Context.add_node context ~node_kind ~node_locality
let compatible_writes callstack = function
| Studia.Writes.CallIndirect _ -> None
| Assign _ | CallDirect _ | GlobalInit _ as w -> Some w
| FormalInit (vi, _callsites) as w ->
match Callstack.pop callstack with
| Some (kf,stmt,_callstack) ->
Some (Studia.Writes.FormalInit (vi, [(kf,[stmt])]))
| None -> Some w
type deps_builder = unit Seq.t
let build_node_writes context node =
let is_folded_base = Context.is_folded context in
let rec build_write_deps ~callstack zone : deps_builder =
let add_deps origin =
match origin with
| Studia.Writes.CallIndirect _ ->
Seq.empty
| Assign stmt | CallDirect stmt ->
let instr = match stmt.skind with
| Instr instr -> instr
| _ -> assert false
in
update_node_values context node (Eval.after stmt);
List.to_seq (find_compatible_callstacks stmt callstack) |>
Seq.flat_map
(fun cs -> build_instr_deps ~callstack:cs ~origin stmt instr)
| GlobalInit (vi, initinfo) as origin ->
let init = match initinfo.init with
| None -> SingleInit (Cil.zero ~loc:vi.vdecl)
| Some init -> init
in
build_init_deps ~origin (Global vi) vi init
| FormalInit (vi, callsites) as origin ->
let kf = Option.get (Kernel_function.find_defining_kf vi) in
let pos = Kernel_function.get_formal_position vi kf in
let add_deps stmt =
match stmt.skind with
| Instr
(Call (_,_,args,_) |
(Local_init (_, ConsInit (_, args, _), _))) ->
let exp = List.nth args pos in
let callstack =
match Callstack.pop callstack with
| Some (_kf,_stmt,callstack') -> callstack'
| None -> Callstack.init kf
in
build_exp_deps ~origin (Local (stmt, callstack)) Data exp
| _ ->
assert false
in
update_node_values context node (Eval.at_start_of kf);
let callsites = List.concat_map snd callsites in
Seq.flat_map add_deps (List.to_seq callsites)
in
let writes = Eval.writes zone in
let writes = List.filter_map (compatible_writes callstack) writes in
Context.set_node_writes context node writes;
Seq.flat_map add_deps (List.to_seq writes)
and build_alarm_deps ~callstack stmt alarm : deps_builder =
let lvals = EnumLvals.in_alarm alarm in
let origin = Studia.Writes.Assign stmt in
let gstmt = Local (stmt, callstack) in
build_lvals_deps ~origin gstmt Data lvals
and build_instr_deps ~origin ~callstack stmt instr : deps_builder =
let gstmt = Local (stmt, callstack) in
match instr with
| Set (_, exp, _) ->
build_exp_deps ~origin gstmt Data exp
| Call (_, callee, args, _) ->
build_call_deps ~callstack ~origin stmt callee args
| Local_init (dest, ConsInit (f, args, k), loc) ->
let as_func _dest callee args _loc =
build_call_deps ~callstack ~origin stmt callee args
in
Cil.treat_constructor_as_func as_func dest f args k loc
| Local_init (vi, AssignInit init, _) ->
build_init_deps ~origin gstmt vi init
| Asm _ | Skip _ | Code_annot _ -> Seq.empty
and build_return_deps ~callstack call_stmt args kf : deps_builder =
match Kernel_function.find_return kf with
| {skind = Return (Some {enode = Lval lval_res},_)} as return_stmt ->
let callstack = Callstack.push (kf,call_stmt) callstack in
let origin = Studia.Writes.Assign return_stmt in
let gstmt = Local (return_stmt, callstack) in
build_lval_deps ~origin gstmt Data lval_res
| {skind = Return (None, _)} -> Seq.empty
| _ -> assert false
| exception Kernel_function.No_Statement ->
let origin = Studia.Writes.Assign call_stmt in
let gstmt = Local (call_stmt, callstack) in
List.to_seq args |>
Seq.flat_map (build_exp_deps ~origin gstmt Data)
and build_call_deps ~origin ~callstack stmt callee args : deps_builder =
let gstmt = Local (stmt, callstack) in
let callee_deps = match callee.enode with
| Lval (Var _vi, _offset) -> Seq.empty
| Lval (Mem exp, _offset) ->
build_exp_deps ~origin gstmt Callee exp
| _ ->
Self.warning "Cannot compute all callee dependencies for %a"
Cil_printer.pp_stmt stmt;
Seq.empty
and return_deps =
List.to_seq (Eval.to_kf_list (Kstmt stmt) callee) |>
Seq.flat_map (build_return_deps ~callstack stmt args)
in
Seq.append callee_deps return_deps
and build_init_deps ~origin gstmt vi init : deps_builder =
let lvals = EnumLvals.in_init vi init in
let exp =
match init with
| CompoundInit _ -> None
| SingleInit exp -> Some exp
in
build_lvals_deps ~origin gstmt Data ?exp lvals
and build_exp_deps ~origin gstmt kind exp : deps_builder =
let lvals = EnumLvals.in_exp exp in
build_lvals_deps ~origin gstmt kind ~exp lvals
and build_lvals_deps ~origin gstmt kind ?exp lvals : deps_builder =
if lvals <> [] then
List.to_seq lvals |>
Seq.flat_map (build_lval_deps ~origin gstmt kind)
else
Option.to_seq exp |>
Seq.flat_map (build_const_deps ~origin gstmt kind)
and build_lval_deps ~origin gstmt kind lval : deps_builder =
let dst = build_lval ~context gstmt lval in
Seq.return (Context.add_dep context ~origin ~kind dst node)
and build_const_deps ~origin gstmt kind exp : deps_builder =
let dst = build_const ~context gstmt exp in
Seq.return (Context.add_dep context ~origin ~kind dst node)
and build_scattered_deps ~callstack stmt lval : deps_builder =
let gstmt = Local (stmt,callstack) in
let add_cell node_kind =
let dst = add_or_update_node ~context gstmt node_kind in
update_node_values context node (Eval.after stmt);
let origin = Studia.Writes.Assign stmt in
Context.add_dep context ~origin ~kind:Composition dst node
in
enumerate_cells ~is_folded_base gstmt lval |> Seq.map add_cell
in
let callstack = node.node_locality.loc_callstack in
match node.node_kind with
| Scalar (vi, _typ, offset) ->
let zone = Eval.to_zone (Global vi) (Cil_types.Var vi, offset) in
build_write_deps ~callstack zone
| Composite (vi) ->
let zone = Locations. zone_of_varinfo vi in
build_write_deps ~callstack zone
| Scattered (lval, stmt) ->
build_scattered_deps ~callstack stmt lval
| Alarm (stmt, alarm) ->
build_alarm_deps ~callstack stmt alarm
| Unknown _ | AbsoluteMemory | String _ | Const _ | Error _ ->
Seq.empty
let compatible_reads = function
| Studia.Reads.Indirect _ -> None
| Direct stmt -> Some stmt
let build_node_reads context node =
let rec build_reads_deps callstack zone : deps_builder =
let add_deps stmt =
List.to_seq (find_compatible_callstacks stmt callstack) |>
Seq.flat_map (fun cs -> build_stmt_deps ~callstack:cs (Some zone) stmt)
in
Eval.reads zone |> List.to_seq |>
Seq.filter_map compatible_reads |>
Seq.flat_map add_deps
and exp_contains_read zone stmt exp =
match zone with
| None -> true
| Some zone' ->
Eval.does_exp_read_zone zone' stmt exp
and init_contains_read zone stmt vi init =
match zone with
| None -> true
| Some zone' ->
Eval.does_init_read_zone zone' stmt vi init
and build_stmt_deps ~callstack zone stmt =
match stmt.skind with
| Instr instr -> build_instr_deps callstack zone stmt instr
| Return (Some exp,_)
when exp_contains_read zone stmt exp ->
build_return_deps callstack stmt
| _ -> Seq.empty
and build_instr_deps callstack zone stmt = function
| Set (lval, exp, _)
when exp_contains_read zone stmt exp ->
build_lval_deps ~callstack stmt lval
| Local_init (dest, ConsInit (f, args, k), loc) ->
let as_func _dest callee args _loc =
build_call_deps callstack zone stmt callee args
in
Cil.treat_constructor_as_func as_func dest f args k loc
| Local_init (vi, AssignInit init, _)
when init_contains_read zone stmt vi init ->
build_var_deps ~callstack stmt vi
| Call (_, callee, args, _) ->
build_call_deps callstack zone stmt callee args
| _ -> Seq.empty
and build_return_deps callstack stmt =
let kf = Kernel_function.find_englobing_kf stmt in
let callsites =
match Callstack.pop callstack with
| Some (kf',stmt,callstack) ->
assert (Kernel_function.equal kf' kf);
[(stmt,callstack)]
| None ->
let callsites = Kernel_function.find_syntactic_callsites kf in
List.map (fun (kf,stmt) -> (stmt,Callstack.init kf)) callsites
and add_deps (stmt,callstack) =
match stmt.skind with
| Instr (Call (None,_,_,_)) -> Seq.empty
| Instr (Call (Some lval,_,_,_)) ->
build_lval_deps ~callstack stmt lval
| Instr (Local_init (vi,_,_)) ->
build_var_deps ~callstack stmt vi
| _ ->
assert false
in
Seq.flat_map add_deps (List.to_seq callsites);
and build_call_deps callstack zone stmt callee args =
List.to_seq (Eval.to_kf_list (Kstmt stmt) callee) |>
Seq.flat_map (build_args_deps callstack zone stmt args)
and build_args_deps callstack zone stmt args callee_kf =
let callstack = Callstack.push (callee_kf,stmt) callstack in
let formals = Kernel_function.get_formals callee_kf in
let used_args = Extlib.list_first_n (List.length formals) args in
List.to_seq (List.combine used_args formals) |>
Seq.flat_map (build_arg_dep callstack stmt zone)
and build_arg_dep callstack stmt zone (arg,formal) =
if exp_contains_read zone stmt arg
then build_var_deps ~callstack stmt formal
else Seq.empty
and build_lval_deps ~callstack stmt lval =
let gstmt = Local (stmt, callstack) in
let src = build_lval ~context gstmt lval in
let origin = Studia.Writes.Assign stmt in
Seq.return (Context.add_dep context ~origin ~kind:Data node src)
and build_var_deps ~callstack stmt vi =
build_lval_deps ~callstack stmt (Cil.var vi)
in
let callstack = node.node_locality.loc_callstack in
match node.node_kind with
| Scalar (vi,_typ,offset) ->
let zone = Eval.to_zone (Global vi) (Cil_types.Var vi, offset) in
build_reads_deps callstack zone
| Composite (vi) ->
let zone = Locations. zone_of_varinfo vi in
build_reads_deps callstack zone
| Scattered (_lval,stmt) ->
build_stmt_deps ~callstack None stmt
| Alarm _ | Unknown _ | AbsoluteMemory | Const _ | String _ | Error _ ->
Seq.empty
let should_explore node root =
match node.node_kind with
| Scattered _ -> Graph.Node.equal node root
| _ -> not node.node_hidden
let bfs ~depth ~iter_succ f root =
let module NodeSet = Graph.Node.Set in
let queue : (node * int) Queue.t = Queue.create () in
let marks = ref NodeSet.empty in
Queue.add (root,0) queue;
while not (Queue.is_empty queue) do
let (n,d) = Queue.take queue in
if not (NodeSet.mem n !marks) && d < depth then begin
marks := NodeSet.add n !marks;
f n;
iter_succ (fun n' -> Queue.add (n',d+1) queue) n
end
done
let advance_computation context seq =
let n = Context.get_max_dep_fetch_count context in
match Seq.drop n seq () with
| Seq.Nil -> Done
| node -> Partial (fun () -> node)
let explore_backward ~depth context root =
let iter_succ f n = Graph.iter_pred f (Context.get_graph context) n
and explore_node n =
if n.node_writes_computation <> Done && should_explore n root then begin
let deps_builder =
match n.node_writes_computation with
| Done -> Seq.empty
| Partial builder -> builder
| NotDone -> build_node_writes context n
in
n.node_writes_computation <- advance_computation context deps_builder
end
in
bfs ~depth ~iter_succ explore_node root
let explore_forward ~depth context root =
let iter_succ f n = Graph.iter_succ f (Context.get_graph context) n
and explore_node n =
if n.node_reads_computation <> Done && should_explore n root then begin
let deps_builder =
match n.node_reads_computation with
| Done -> Seq.empty
| Partial builder -> builder
| NotDone -> build_node_reads context n
in
n.node_reads_computation <- advance_computation context deps_builder
end
in
bfs ~depth ~iter_succ explore_node root
let complete context root =
Context.add_root context root;
root
let add_var context vi =
let gstmt = match Kernel_function.find_defining_kf vi with
| Some kf -> Local (Kernel_function.find_first_stmt kf , Callstack.init kf)
| None -> Global vi
in
let node = build_var ~context gstmt vi in
complete context node
let add_lval context stmt lval =
let callstack = Callstack.init (Kernel_function.find_englobing_kf stmt) in
let gstmt = Local (stmt, callstack) in
let node = build_lval ~context gstmt lval in
complete context node
let add_alarm context stmt alarm =
let callstack = Callstack.init (Kernel_function.find_englobing_kf stmt) in
let node = build_alarm ~context (stmt, callstack) alarm in
complete context node
let add_annotation context stmt annot =
Option.map (add_alarm context stmt) (Alarms.find annot)
let add_instr context stmt = function
| Set (lval, _, _)
| Call (Some lval, _, _, _) -> Some (add_lval context stmt lval)
| Local_init (vi, _, _) -> Some (add_var context vi)
| Code_annot (annot, _) -> add_annotation context stmt annot
| _ -> None
let add_stmt context stmt =
match stmt.skind with
| Instr instr -> add_instr context stmt instr
| _ -> None
let add_property context = function
| Property.IPCodeAnnot { ica_stmt ; ica_ca } ->
add_annotation context ica_stmt ica_ca
| _ -> None
let add_localizable context = function
| Printer_tag.PIP prop -> add_property context prop
| PLval (_kf, Kstmt stmt, lval) -> Some (add_lval context stmt lval)
| PVDecl (_kf, _kinstr, varinfo) -> Some (add_var context varinfo)
| PStmt (_kf, stmt) | PStmtStart (_kf, stmt) -> add_stmt context stmt
| _ -> None
let remove_dependencies context node =
Context.remove_node_deps context node;
node.node_writes_computation <- NotDone;
Context.set_node_writes context node []
let remove_disconnected context =
let roots = Context.get_roots context in
let l = Graph.find_independant_nodes (Context.get_graph context) roots in
List.iter (Context.remove_node context) l
let reduce_to_horizon context range new_root =
Context.set_unique_root context new_root ;
let graph = Context.get_graph context
and roots = Context.get_roots context
and backward_bfs = Graph.bfs ~iter_succ:Graph.iter_pred ?limit:range.backward
and forward_bfs = Graph.bfs ~iter_succ:Graph.iter_succ ?limit:range.forward in
let bacward_nodes = backward_bfs graph roots
and forward_nodes = forward_bfs graph roots in
let module Table = Hashtbl.Make (Graph.Node) in
let visible = Table.create 13 in
let is_visible = Table.mem visible in
List.iter (fun n -> Table.add visible n true) (bacward_nodes @ forward_nodes);
let update node =
if not (is_visible node) then
if List.exists is_visible (Graph.succ graph node) then
remove_dependencies context node
else
Context.remove_node context node
in
Graph.iter_vertex update graph
let show _context node =
node.node_hidden <- false
let hide context node =
if not node.node_hidden then begin
node.node_hidden <- true;
Context.remove_root context node;
remove_dependencies context node;
remove_disconnected context
end