2 * Copyright 2010, INRIA, University of Copenhagen
3 * Julia Lawall, Rene Rydhof Hansen, Gilles Muller, Nicolas Palix
4 * Copyright 2005-2009, Ecole des Mines de Nantes, University of Copenhagen
5 * Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix
6 * This file is part of Coccinelle.
8 * Coccinelle is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, according to version 2 of the License.
12 * Coccinelle is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with Coccinelle. If not, see <http://www.gnu.org/licenses/>.
20 * The authors reserve the right to distribute this or future versions of
21 * Coccinelle under other licenses.
26 * Copyright 2010, INRIA, University of Copenhagen
27 * Julia Lawall, Rene Rydhof Hansen, Gilles Muller, Nicolas Palix
28 * Copyright 2005-2009, Ecole des Mines de Nantes, University of Copenhagen
29 * Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix
30 * This file is part of Coccinelle.
32 * Coccinelle is free software: you can redistribute it and/or modify
33 * it under the terms of the GNU General Public License as published by
34 * the Free Software Foundation, according to version 2 of the License.
36 * Coccinelle is distributed in the hope that it will be useful,
37 * but WITHOUT ANY WARRANTY; without even the implied warranty of
38 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
39 * GNU General Public License for more details.
41 * You should have received a copy of the GNU General Public License
42 * along with Coccinelle. If not, see <http://www.gnu.org/licenses/>.
44 * The authors reserve the right to distribute this or future versions of
45 * Coccinelle under other licenses.
54 (* todo?: a txt_to_latex, that use Format to compute the good space but
55 * then generate latex to better output.
59 let char_and_any = "&+"
72 (* need introduce the Val constructor, or use -rectype. *)
73 type ('a
,'b
,'c
) environment
= (string, ('a
,'b
,'c
) binding_val
) Common.assoc
74 and ('a
, 'b
, 'c
) binding_val
=
75 Val
of ('a
,'b
,'c
) generic_ctl
* ('a
,'b
,'c
) environment
78 ('pred
-> unit) * ('mvar
-> unit) -> bool ->
79 ('pred
, 'mvar
, 'info
) generic_ctl
->
81 fun (pp_pred
, pp_mvar
) inline_let_def ctl
->
83 let rec pp_aux env
= function
86 | Pred
(p
) -> pp_pred p
88 pp
char_not; Common.pp_do_in_box
(fun () -> pp_aux env phi
)
89 | Exists
(keep
,v
,phi
) ->
91 if keep
then pp
("Ex ") else pp
("Ex_ ");
95 Common.pp_do_in_box
(fun () -> pp_aux env phi
);
97 | AndAny
(dir
,s
,phi1
,phi2
) ->
98 pp_2args env
(char_and_any^
(pp_dirc dir
)^
(pp_sc s
)) phi1 phi2
;
99 | HackForStmt
(dir
,s
,phi1
,phi2
) ->
100 pp_2args env
(char_hack^
(pp_dirc dir
)^
(pp_sc s
)) phi1 phi2
;
101 | And
(s
,phi1
,phi2
) -> pp_2args env
(char_and^
(pp_sc s
)) phi1 phi2
;
102 | Or
(phi1
,phi2
) -> pp_2args env
char_or phi1 phi2
;
103 | SeqOr
(phi1
,phi2
) -> pp_2args env
char_seqor phi1 phi2
;
104 | Implies
(phi1
,phi2
) -> pp_2args env
"=>" phi1 phi2
;
105 | AF
(dir
,s
,phi1
) -> pp
"AF"; pp_dir dir
; pp_s s
; pp_arg_paren env phi1
;
106 | AX
(dir
,s
,phi1
) -> pp
"AX"; pp_dir dir
; pp_s s
; pp_arg_paren env phi1
;
107 | AG
(dir
,s
,phi1
) -> pp
"AG"; pp_dir dir
; pp_s s
; pp_arg_paren env phi1
;
108 | EF
(dir
,phi1
) -> pp
"EF"; pp_dir dir
; pp_arg_paren env phi1
;
109 | EX
(dir
,phi1
) -> pp
"EX"; pp_dir dir
; pp_arg_paren env phi1
;
110 | EG
(dir
,phi1
) -> pp
"EG"; pp_dir dir
; pp_arg_paren env phi1
;
111 | AW
(dir
,s
,phi1
,phi2
) ->
112 pp
"A"; pp_dir dir
; pp_s s
; pp
"[";
113 pp_2args_bis env
"W" phi1 phi2
;
115 | AU
(dir
,s
,phi1
,phi2
) ->
116 pp
"A"; pp_dir dir
; pp_s s
; pp
"[";
117 pp_2args_bis env
"U" phi1 phi2
;
119 | EU
(dir
,phi1
,phi2
) ->
120 pp
"E"; pp_dir dir
; pp
"[";
121 pp_2args_bis env
"U" phi1 phi2
;
123 | Let
(x
,phi1
,phi2
) ->
124 let env'
= (x
, (Val
(phi1
,env)))::env in
126 if not inline_let_def
132 Common.pp_do_in_box
(fun () -> pp_aux env phi1
);
137 pp_do_in_zero_box
(fun () -> pp_aux env' phi2
);
138 | LetR
(dir
,x
,phi1
,phi2
) ->
139 let env'
= (x
, (Val
(phi1
,env)))::env in
141 if not inline_let_def
144 pp
("LetR"^
" "^x
); pp_dir dir
;
147 Common.pp_do_in_box
(fun () -> pp_aux env phi1
);
152 pp_do_in_zero_box
(fun () -> pp_aux env' phi2
);
156 let Val (phi1
,env'
) = List.assoc s
env in
163 pp
"Uncheck"; pp_arg_paren
env phi1
165 pp
"InnerAnd"; pp_arg_paren
env phi1
166 | XX _
-> failwith
"should be removed"
168 and pp_dir
= function
170 | BACKWARD
-> pp
char_back
172 and pp_dirc
= function
174 | BACKWARD
-> char_back
177 STRICT
-> if !Flag_ctl.partial_match
then pp
"," else ()
184 and pp_2args
env sym phi1 phi2
=
187 Common.pp_do_in_box
(fun () -> pp_aux env phi1
);
191 Common.pp_do_in_box
(fun () -> pp_aux env phi2
);
194 and pp_2args_bis
env sym phi1 phi2
=
196 Common.pp_do_in_box
(fun () -> pp_aux env phi1
);
200 Common.pp_do_in_box
(fun () -> pp_aux env phi2
);
203 and pp_arg_paren
env phi
= Common.pp_do_in_box
(fun () ->
209 Common.pp_do_in_box
(fun () -> pp_aux [] ctl
;)