Commit | Line | Data |
---|---|---|
f537ebc4 | 1 | (* |
17ba0788 C |
2 | * Copyright 2012, INRIA |
3 | * Julia Lawall, Gilles Muller | |
4 | * Copyright 2010-2011, INRIA, University of Copenhagen | |
f537ebc4 C |
5 | * Julia Lawall, Rene Rydhof Hansen, Gilles Muller, Nicolas Palix |
6 | * Copyright 2005-2009, Ecole des Mines de Nantes, University of Copenhagen | |
7 | * Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix | |
8 | * This file is part of Coccinelle. | |
9 | * | |
10 | * Coccinelle is free software: you can redistribute it and/or modify | |
11 | * it under the terms of the GNU General Public License as published by | |
12 | * the Free Software Foundation, according to version 2 of the License. | |
13 | * | |
14 | * Coccinelle is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | * | |
19 | * You should have received a copy of the GNU General Public License | |
20 | * along with Coccinelle. If not, see <http://www.gnu.org/licenses/>. | |
21 | * | |
22 | * The authors reserve the right to distribute this or future versions of | |
23 | * Coccinelle under other licenses. | |
24 | *) | |
25 | ||
26 | ||
feec80c3 | 27 | # 0 "./adjacency.ml" |
708f4980 C |
28 | module Ast0 = Ast0_cocci |
29 | module V0 = Visitor_ast0 | |
30 | module VT0 = Visitor_ast0_types | |
31 | ||
32 | let compute_adjacency p = | |
33 | let counter = ref 0 in | |
34 | let mcode (a,b,c,d,e,_) = (a,b,c,d,e,!counter) in | |
35 | let string_mcode ((str,_,info,mc,_,_) as x) = | |
36 | match str with | |
37 | "..." | "<..." | "...>" | "<+..." | "...+>" -> | |
38 | (match mc with | |
39 | Ast0.MINUS _ -> mcode x | |
40 | | Ast0.CONTEXT _ -> counter := !counter + 1; x | |
41 | | _ -> failwith "unexpected mcode for ...") | |
42 | | _ -> mcode x in | |
abad11c5 C |
43 | let statement r k s = |
44 | let s = k s in | |
45 | (* a case for each kind of term that has a fake node *) | |
46 | Ast0.rewrap s | |
47 | (match Ast0.unwrap s with | |
48 | Ast0.IfThen(iff,lp,exp,rp,branch,(info,mc,_)) -> | |
49 | Ast0.IfThen(iff,lp,exp,rp,branch,(info,mc,!counter)) | |
50 | | Ast0.IfThenElse(iff,lp,exp,rp,branch1,els,branch2,(info,mc,_)) -> | |
51 | Ast0.IfThenElse(iff,lp,exp,rp,branch1,els,branch2,(info,mc,!counter)) | |
52 | | Ast0.While(wh,lp,exp,rp,body,(info,mc,_)) -> | |
53 | Ast0.While(wh,lp,exp,rp,body,(info,mc,!counter)) | |
54 | | Ast0.For(fr,lp,first,exp2,sem2,exp3,rp,body,(info,mc,_)) -> | |
55 | Ast0.For(fr,lp,first,exp2,sem2,exp3,rp,body,(info,mc,!counter)) | |
56 | | Ast0.Iterator(nm,lp,args,rp,body,(info,mc,_)) -> | |
57 | Ast0.Iterator(nm,lp,args,rp,body,(info,mc,!counter)) | |
58 | | s -> s) in | |
708f4980 C |
59 | let fn = |
60 | V0.rebuilder | |
61 | {V0.rebuilder_functions with | |
62 | VT0.rebuilder_meta_mcode = mcode; | |
63 | VT0.rebuilder_string_mcode = string_mcode; | |
64 | VT0.rebuilder_const_mcode = mcode; | |
65 | VT0.rebuilder_assign_mcode = mcode; | |
66 | VT0.rebuilder_fix_mcode = mcode; | |
67 | VT0.rebuilder_unary_mcode = mcode; | |
68 | VT0.rebuilder_binary_mcode = mcode; | |
69 | VT0.rebuilder_cv_mcode = mcode; | |
70 | VT0.rebuilder_sign_mcode = mcode; | |
71 | VT0.rebuilder_struct_mcode = mcode; | |
72 | VT0.rebuilder_storage_mcode = mcode; | |
abad11c5 C |
73 | VT0.rebuilder_inc_mcode = mcode; |
74 | VT0.rebuilder_stmtfn = statement;} in | |
708f4980 C |
75 | List.map fn.VT0.rebuilder_rec_top_level p |
76 |