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
|
(*
* 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 Ast0 = Ast0_cocci
module Ast = Ast_cocci
module V0 = Visitor_ast0
module VT0 = Visitor_ast0_types
(* find assignments that can match an initialization *)
let pure_mcodekind = function
Ast0.CONTEXT(mc) ->
(match !mc with
(Ast.NOTHING,_,_) -> true
| _ -> false)
| _ -> false
let semi_pure_mcodekind = function
Ast0.CONTEXT(mc) | Ast0.MIXED(mc) ->
(match !mc with
(Ast.NOTHING,_,_) -> true
| _ -> false)
| _ -> false
let is_simple_assign left op =
let is_simple_assign_op op = match Ast0.unwrap op with
| Ast0.OpAssign _ -> false
| _ -> true in
(match Ast0.unwrap left with
Ast0.Ident(_) | Ast0.MetaExpr(_,_,_,_,_,_) -> true
| _ -> false)
&&
is_simple_assign_op op
let is_simple_ast_assign left op minus_left =
let is_simple_ast_assign_op op = match Ast.unwrap op with
| Ast.SimpleAssign _ -> true
| _ -> false in
(match Ast.unwrap left with
Ast.Ident(_) -> true
| Ast.MetaExpr(name,_,_,_,_,_,_bitfield) ->
(match Ast0.unwrap minus_left with
Ast0.MetaExpr(name1,_,_,_,_,_bitfield) ->
Ast.unwrap_mcode name = Ast0.unwrap_mcode name1
| _ -> false)
| _ -> false)
&&
is_simple_ast_assign_op op
let warning e msg =
if !Flag_parsing_cocci.debug_parse_cocci ||
!Flag_parsing_cocci.show_iso_failures
then
Common.pr2
("the simple assignment expression on line "^
(string_of_int (Ast0.get_line e))^
" contains transformations\n"^
"that prevent it from matching a declaration ("^msg^")\n");
e
let rebuild e1 left right op simple =
Ast0.rewrap e1 (Ast0.Assignment(left,op,right,simple))
let rec exp mc e1 =
match Ast0.unwrap e1 with
Ast0.Assignment(left,op,right,_) ->
if is_simple_assign left op
then
(if !Flag.sgrep_mode2
then rebuild e1 left right op true
else
match mc with
Ast0.MINUS(mc) ->
(match !mc with
(Ast.REPLACEMENT([[Ast.ExpressionTag(e2)]],_),_) ->
(match Ast.unwrap e2 with
Ast.Assignment(left',op',_,_) ->
if is_simple_ast_assign left' op' left
then rebuild e1 left right op true
else warning e1 "replacement is not simple"
| _ -> warning e1 "replacement is not an assignment")
| _ -> warning e1 "multiple replacements")
| m ->
let k = match Ast0.unwrap op with
| Ast0.SimpleAssign o -> Ast0.get_mcode_mcodekind o
| Ast0.OpAssign o -> Ast0.get_mcode_mcodekind o
| Ast0.MetaAssign(mv,_,_) -> Ast0.get_mcode_mcodekind mv in
let pure =
(* The goal of this code is to ensure that neither the
left side of the assignment nor its operator is changed. *)
(semi_pure_mcodekind m) &&
(pure_mcodekind (Ast0.get_mcodekind left)) &&
(pure_mcodekind k) in
if not pure
then warning e1 "not pure"
else rebuild e1 left right op pure)
else e1
| Ast0.DisjExpr(lp,exps,mids,rp) ->
Ast0.rewrap e1
(Ast0.DisjExpr
(lp,List.map (function x -> exp (Ast0.get_mcodekind x) x) exps,
mids,rp))
| Ast0.ConjExpr(lp,exps,mids,rp) ->
Ast0.rewrap e1
(Ast0.ConjExpr
(lp,List.map (function x -> exp (Ast0.get_mcodekind x) x) exps,
mids,rp))
| Ast0.OptExp(e) ->
Ast0.rewrap e1 (Ast0.OptExp(exp (Ast0.get_mcodekind e) e))
| _ -> e1
let simple_assignments l =
let statement r k e =
match Ast0.unwrap e with
Ast0.Exp(e1) -> Ast0.rewrap e (Ast0.Exp(exp (Ast0.get_mcodekind e) e1))
| _ -> k e in
let fn =
V0.rebuilder
{V0.rebuilder_functions with VT0.rebuilder_stmtfn = statement} in
List.map fn.VT0.rebuilder_rec_top_level l
|
