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
|
(*
* 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 Past = Ast_popl
(* --------------------------------------------------------------------- *)
let rec get_before a = function
Past.Seq(elem,seq) ->
let (elem,ea) = get_before_element a elem in
let (seq,sla) = get_before ea seq in
(Past.Seq(elem,seq),sla)
| Past.Empty -> (Past.Empty,a)
| Past.SExists(var,seq) -> failwith "not possible"
and get_before_element a = function
Past.Term(term) as s -> (s,[s])
| Past.Or(seq1,seq2) ->
let (seq1,seq1a) = get_before a seq1 in
let (seq2,seq2a) = get_before a seq2 in
(Past.Or(seq1,seq2),Common.union_set seq1a seq2a)
| Past.DInfo(dots,_,seq_aft) ->
let dots = get_before_dots a dots in
(Past.DInfo(dots,a,seq_aft),a)
| Past.EExists(var,seq) -> failwith "not possible"
and get_before_dots a = function
Past.Dots -> Past.Dots
| Past.Nest(seq) ->
let (seq,_) = get_before a seq in
Past.Nest(seq)
| Past.When(dots,seq) ->
let dots = get_before_dots a dots in
let (seq,_) = get_before [] seq in
Past.When(dots,seq)
| Past.DExists(var,dots) -> failwith "not possible"
(* --------------------------------------------------------------------- *)
let rec get_after a = function
Past.Seq(elem,seq) ->
let (seq,sla) = get_after a seq in
let (elem,ea) = get_after_element sla elem in
(Past.Seq(elem,seq),ea)
| Past.Empty -> (Past.Empty,a)
| Past.SExists(var,seq) -> failwith "not possible"
and get_after_element a = function
Past.Term(term) as s -> (s,[s])
| Past.Or(seq1,seq2) ->
let (seq1,seq1a) = get_after a seq1 in
let (seq2,seq2a) = get_after a seq2 in
(Past.Or(seq1,seq2),Common.union_set seq1a seq2a)
| Past.DInfo(dots,seq_bef,_) ->
let dots = get_after_dots a dots in
(Past.DInfo(dots,seq_bef,a),a)
| Past.EExists(var,seq) -> failwith "not possible"
and get_after_dots a = function
Past.Dots -> Past.Dots
| Past.Nest(seq) ->
let (seq,_) = get_after (Common.union_set (get_first [] seq) a) seq in
Past.Nest(seq)
| Past.When(dots,seq) ->
let dots = get_after_dots a dots in
let (seq,_) = get_after [] seq in
Past.When(dots,seq)
| Past.DExists(var,dots) -> failwith "not possible"
(* --------------------------------------------------------------------- *)
(* like get_after, but just returns the a component; doesn't modify the term *)
and get_first a = function
Past.Seq(elem,seq) ->
let sla = get_first a seq in
let ea = get_first_element sla elem in
ea
| Past.Empty -> a
| Past.SExists(var,seq) -> failwith "not possible"
and get_first_element a = function
Past.Term(term) as s -> [s]
| Past.Or(seq1,seq2) ->
Common.union_set (get_first a seq1) (get_first a seq2)
| Past.DInfo(dots,_,_) -> a
| Past.EExists(var,seq) -> failwith "not possible"
(* --------------------------------------------------------------------- *)
(* Entry point *)
let insert_befaft sl =
let (sl,_) = get_before [] sl in
let (sl,_) = get_after [] sl in
sl
|
