Release coccinelle-0.2.3rc1
[bpt/coccinelle.git] / parsing_cocci / test_exps.ml
CommitLineData
5636bb2c
C
1(*
2 * Copyright 2005-2010, Ecole des Mines de Nantes, University of Copenhagen
3 * Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix
4 * This file is part of Coccinelle.
5 *
6 * Coccinelle is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, according to version 2 of the License.
9 *
10 * Coccinelle is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
14 *
15 * You should have received a copy of the GNU General Public License
16 * along with Coccinelle. If not, see <http://www.gnu.org/licenses/>.
17 *
18 * The authors reserve the right to distribute this or future versions of
19 * Coccinelle under other licenses.
20 *)
21
22
9f8e26f4 23(*
ae4735db 24 * Copyright 2005-2010, Ecole des Mines de Nantes, University of Copenhagen
9f8e26f4
C
25 * Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix
26 * This file is part of Coccinelle.
27 *
28 * Coccinelle is free software: you can redistribute it and/or modify
29 * it under the terms of the GNU General Public License as published by
30 * the Free Software Foundation, according to version 2 of the License.
31 *
32 * Coccinelle is distributed in the hope that it will be useful,
33 * but WITHOUT ANY WARRANTY; without even the implied warranty of
34 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
35 * GNU General Public License for more details.
36 *
37 * You should have received a copy of the GNU General Public License
38 * along with Coccinelle. If not, see <http://www.gnu.org/licenses/>.
39 *
40 * The authors reserve the right to distribute this or future versions of
41 * Coccinelle under other licenses.
42 *)
43
44
34e49164
C
45module Ast = Ast_cocci
46module Ast0 = Ast0_cocci
47module V0 = Visitor_ast0
b1b2de81 48module VT0 = Visitor_ast0_types
34e49164
C
49
50(* call set_test_pos on test expressions *)
51
52(* The goal of this is to identify test expressions in the SmPL file, so that
53isomorphisms like X != NULL => X are only applied in a test expression context.
54
55There is a related check in cocci_vs_c3.ml that in x || ..., a match
56without the || is only accepted in a test expression context. This uses
57the annotations in the C file. *)
58
59let rec process_exp e =
faf9a90c
C
60 let e = Ast0.set_test_pos e in(* allow test isos *)
61 let e = Ast0.set_test_exp e in(* require that a test expression is matched *)
34e49164 62 match Ast0.unwrap e with
faf9a90c
C
63 Ast0.Paren(lp,e1,rp) ->
64 Ast0.rewrap e (Ast0.Paren(lp,process_exp e1,rp))
34e49164
C
65 | _ -> e
66
67let set_test_poss =
34e49164
C
68 let expression r k e =
69 let e = k e in
70 match Ast0.unwrap e with
71 Ast0.CondExpr(e1,q,e2,c,e3) ->
72 Ast0.rewrap e (Ast0.CondExpr(process_exp e1,q,e2,c,e3))
73 | Ast0.Binary(e1,op,e2) ->
74 (match Ast0.unwrap_mcode op with
75 Ast.Logical(Ast.AndLog) | Ast.Logical(Ast.OrLog) ->
76 Ast0.rewrap e (Ast0.Binary(process_exp e1,op,process_exp e2))
77 | _ -> e)
78 | Ast0.Unary(e1,op) ->
79 (match Ast0.unwrap_mcode op with
80 Ast.Not -> Ast0.rewrap e (Ast0.Unary(process_exp e1,op))
81 | _ -> e)
82 | _ -> e in
83
1be43e12
C
84 let process_wc = function
85 Ast0.WhenNotTrue(e) -> Ast0.WhenNotTrue(process_exp e)
86 | Ast0.WhenNotFalse(e) -> Ast0.WhenNotFalse(process_exp e)
87 | wc -> wc in
88
34e49164
C
89 let statement r k s =
90 let s = k s in
91 match Ast0.unwrap s with
92 Ast0.IfThen(i,lp,e,rp,s1,aft) ->
93 Ast0.rewrap s (Ast0.IfThen(i,lp,process_exp e,rp,s1,aft))
94 | Ast0.IfThenElse(i,lp,e,rp,s1,e1,s2,aft) ->
95 Ast0.rewrap s (Ast0.IfThenElse(i,lp,process_exp e,rp,s1,e1,s2,aft))
96 | Ast0.While(i,lp,e,rp,s1,aft) ->
97 Ast0.rewrap s (Ast0.While(i,lp,process_exp e,rp,s1,aft))
98 | Ast0.Do(d,s1,w,lp,e,rp,sc) ->
99 Ast0.rewrap s (Ast0.Do(d,s1,w,lp,process_exp e,rp,sc))
100 | Ast0.For(f,lp,e1,sc1,Some e2,sc2,e3,rp,s1,aft) ->
101 Ast0.rewrap s
102 (Ast0.For(f,lp,e1,sc1,Some (process_exp e2),sc2,e3,rp,s1,aft))
1be43e12
C
103 | Ast0.Dots(d,wc) ->
104 Ast0.rewrap s (Ast0.Dots(d,List.map process_wc wc))
105 | Ast0.Nest(l,s1,r,wc,m) ->
106 Ast0.rewrap s (Ast0.Nest(l,s1,r,List.map process_wc wc,m))
34e49164
C
107 | _ -> s in
108
109 V0.rebuilder
b1b2de81
C
110 {V0.rebuilder_functions with
111 VT0.rebuilder_exprfn = expression; VT0.rebuilder_stmtfn = statement}
34e49164 112
b1b2de81 113let process = List.map set_test_poss.VT0.rebuilder_rec_top_level
34e49164 114
b1b2de81 115let process_anything = set_test_poss.VT0.rebuilder_rec_anything
34e49164 116