popl/asttopopl.ml

   1 (*
   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.
   7  *
   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.
  11  *
  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.
  16  *
  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/>.
  19  *
  20  * The authors reserve the right to distribute this or future versions of
  21  * Coccinelle under other licenses.
  22  *)
  23
  24
  25 module Ast = Ast_cocci
  26 module Past = Ast_popl
  27
  28 (* --------------------------------------------------------------------- *)
  29
  30 let rec stm s =
  31   match Ast.unwrap s with
  32     Ast.Atomic(ast) ->
  33       (match Ast.unwrap ast with
  34         Ast.ExprStatement(_,_) -> Past.Term ast
  35       | Ast.Exp(_) -> Past.Term ast
  36       | Ast.Decl(_,_,_) -> Past.Term ast
  37       | _ -> failwith "complex statements not supported")
  38   | Ast.Disj(stm1::stm2::stmts) ->
  39       List.fold_left
  40         (function prev ->
  41           function cur ->
  42             Past.Or(Past.Seq(prev,Past.Empty),stm_list cur))
  43         (Past.Or(stm_list stm1,stm_list stm2)) stmts
  44   | Ast.Dots(dots,whencodes,_,_) ->
  45       (match whencodes with
  46         [Ast.WhenNot(a)] -> Past.DInfo(Past.When(Past.Dots,stm_list a),[],[])
  47       | _ -> failwith "only one when != supported")
  48   | Ast.Nest(stmt_dots,whencodes,false,_,_) ->
  49       let nest = Past.Nest(stm_list stmt_dots) in
  50       (match whencodes with
  51         [Ast.WhenNot(a)] -> Past.DInfo(Past.When(nest,stm_list a),[],[])
  52       | _ -> failwith "only when != supported")
  53   | Ast.While(header,body,(_,_,_,aft)) | Ast.For(header,body,(_,_,_,aft)) ->
  54       (* only allowed if only the header is significant *)
  55       (match (Ast.unwrap body,aft) with
  56         (Ast.Atomic(re),Ast.CONTEXT(_,Ast.NOTHING)) ->
  57           (match Ast.unwrap re with
  58             Ast.MetaStmt(_,Type_cocci.Unitary,_,false) -> Past.Term header
  59           | _ -> failwith "unsupported statement1")
  60       | _ -> failwith "unsupported statement2")
  61   | _ ->
  62       Pretty_print_cocci.statement "" s;
  63       failwith "unsupported statement3"
  64
  65 and stm_list s =
  66   match Ast.unwrap s with
  67     Ast.DOTS(d) ->
  68       List.fold_right
  69         (function cur -> function rest -> Past.Seq(stm cur, rest))
  70         d Past.Empty
  71   | _ -> failwith "only DOTS handled"
  72
  73 let top s =
  74   match Ast.unwrap s with
  75     Ast.CODE(stmt_dots) -> stm_list stmt_dots
  76   | _ -> failwith "only CODE handled"