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
|
(*
* This file is part of Coccinelle, licensed under the terms of the GPL v2.
* See copyright.txt in the Coccinelle source code for more information.
* The Coccinelle source code can be obtained at http://coccinelle.lip6.fr
*)
module Ast = Ast_cocci
module Past = Ast_popl
(* --------------------------------------------------------------------- *)
let rec fvs_sequence = function
Past.Seq(elem,seq) ->
Common.union_set (fvs_element elem) (fvs_sequence seq)
| Past.Empty -> []
| Past.SExists(var,seq) -> failwith "not possible"
and fvs_element = function
Past.Term(term) -> Ast.get_fvs term
| Past.Or(seq1,seq2) ->
Common.union_set (fvs_sequence seq1) (fvs_sequence seq2)
| Past.DInfo(dots,seq_bef,seq_aft) ->
List.fold_left
(function prev ->
function cur ->
Common.union_set (fvs_element cur) prev)
(fvs_dots dots) seq_bef
| Past.EExists(var,seq) -> failwith "not possible"
and fvs_dots = function
Past.Dots -> []
| Past.Nest(seq) -> fvs_sequence seq
| Past.When(dots,seq) -> Common.union_set (fvs_dots dots) (fvs_sequence seq)
| Past.DExists(var,dots) -> failwith "not possible"
(* --------------------------------------------------------------------- *)
let rec quant_sequence bound = function
Past.Seq(elem,seq) ->
let fe = fvs_element elem in
let fs = fvs_sequence seq in
let inter = Common.inter_set fe fs in
let free = Common.minus_set inter bound in
let new_bound = free @ bound in
List.fold_right (function cur -> function rest -> Past.SExists(cur,rest))
free (Past.Seq(quant_element new_bound elem,
quant_sequence new_bound seq))
| Past.Empty -> Past.Empty
| Past.SExists(var,seq) -> failwith "not possible"
and quant_element bound = function
Past.Term(term) as x ->
let free = Common.minus_set (fvs_element x) bound in
List.fold_right (function cur -> function rest -> Past.EExists(cur,rest))
free x
| Past.Or(seq1,seq2) ->
Past.Or(quant_sequence bound seq1,quant_sequence bound seq2)
| Past.DInfo(dots,seq_bef,seq_aft) ->
Past.DInfo(quant_dots bound dots,seq_bef,
List.map (quant_element bound) seq_aft)
| Past.EExists(var,seq) -> failwith "not possible"
and quant_dots bound = function
Past.Dots -> Past.Dots
| Past.Nest(seq) -> Past.Nest(quant_sequence bound seq)
| Past.When(dots,seq) ->
let fd = fvs_dots dots in
let fs = fvs_sequence seq in
let inter = Common.inter_set fd fs in
let free = Common.minus_set inter bound in
let new_bound = free @ bound in
List.fold_right (function cur -> function rest -> Past.DExists(cur,rest))
free (Past.When(quant_dots new_bound dots,
quant_sequence new_bound seq))
| Past.DExists(var,dots) -> failwith "not possible"
(* --------------------------------------------------------------------- *)
let insert_quantifiers x = quant_sequence [] x
|
