(*
- * Copyright 2010, INRIA, University of Copenhagen
+ * Copyright 2012, INRIA
+ * Julia Lawall, Gilles Muller
+ * Copyright 2010-2011, INRIA, University of Copenhagen
* Julia Lawall, Rene Rydhof Hansen, Gilles Muller, Nicolas Palix
* Copyright 2005-2009, Ecole des Mines de Nantes, University of Copenhagen
* Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller, Nicolas Palix
*)
+# 0 "./get_constants2.ml"
module Ast = Ast_cocci
module V = Visitor_ast
module TC = Type_cocci
type combine =
And of combine list | Or of combine list | Elem of string | False | True
+let rec dep2c = function
+ And l -> Printf.sprintf "(%s)" (String.concat "&" (List.map dep2c l))
+ | Or l -> Printf.sprintf "(%s)" (String.concat "|" (List.map dep2c l))
+ | Elem x -> x
+ | False -> "false"
+ | True -> "true"
+
(* glimpse often fails on large queries. We can safely remove arguments of
&& as long as we don't remove all of them (note that there is no negation).
This tries just removing one of them and then orders the results by
let do_get_constants constants keywords env neg_pos =
let donothing r k e = k e in
let option_default = True in
+ let bad_default = False in
let bind = build_and in
let inherited ((nm1,_) as x) =
- (* ignore virtuals *)
- if nm1 = "virtual" then option_default
+ (* ignore virtuals, can never match *)
+ if nm1 = "virtual" then bad_default
(* perhaps inherited, but value not required, so no constraints *)
else if List.mem x neg_pos then option_default
else (try List.assoc nm1 env with Not_found -> False) in
let minherited name = inherited (Ast.unwrap_mcode name) in
let mcode _ x =
- match Ast.get_pos_var x with
- Ast.MetaPos(name,constraints,_,keep,inh) -> minherited name
- | _ -> option_default in
+ List.fold_left bind option_default
+ (List.map
+ (function Ast.MetaPos(name,constraints,_,keep,inh) -> minherited name)
+ (Ast.get_pos_var x)) in
(* if one branch gives no information, then we have to take anything *)
let disj_union_all = List.fold_left build_or False in
"NULL" -> keywords "NULL"
| nm -> constants nm)
| Ast.MetaId(name,_,_,_) | Ast.MetaFunc(name,_,_,_)
- | Ast.MetaLocalFunc(name,_,_,_) -> bind (k i) (minherited name)
+ | Ast.MetaLocalFunc(name,_,_,_) ->
+ bind (k i) (minherited name)
+ | Ast.DisjId(ids) -> disj_union_all (List.map r.V.combiner_ident ids)
| _ -> k i in
let rec type_collect res = function
| _ -> k ft in
let baseType = function
- Ast.VoidType -> keywords "void "
- | Ast.CharType -> keywords "char "
- | Ast.ShortType -> keywords "short "
- | Ast.IntType -> keywords "int "
- | Ast.DoubleType -> keywords "double "
- | Ast.FloatType -> keywords "float "
- | Ast.LongType | Ast.LongLongType -> keywords "long "
- | Ast.SizeType -> keywords "size_t "
- | Ast.SSizeType -> keywords "ssize_t "
- | Ast.PtrDiffType -> keywords "ptrdiff_t " in
+ Ast.VoidType -> keywords "void"
+ | Ast.CharType -> keywords "char"
+ | Ast.ShortType -> keywords "short"
+ | Ast.ShortIntType -> keywords "short"
+ | Ast.IntType -> keywords "int"
+ | Ast.DoubleType -> keywords "double"
+ | Ast.LongDoubleType -> keywords "double"
+ | Ast.FloatType -> keywords "float"
+ | Ast.LongType | Ast.LongLongType
+ | Ast.LongIntType | Ast.LongLongIntType -> keywords "long"
+ | Ast.SizeType -> keywords "size_t"
+ | Ast.SSizeType -> keywords "ssize_t"
+ | Ast.PtrDiffType -> keywords "ptrdiff_t" in
let typeC r k ty =
match Ast.unwrap ty with
match Ast.unwrap d with
Ast.MetaDecl(name,_,_) | Ast.MetaField(name,_,_) ->
bind (k d) (minherited name)
+ | Ast.MetaFieldList(name,Ast.MetaListLen(lenname,_,_),_,_) ->
+ bind (minherited name) (bind (minherited lenname) (k d))
| Ast.DisjDecl(decls) ->
disj_union_all (List.map r.V.combiner_declaration decls)
| Ast.OptDecl(decl) -> option_default
bind ((get_all_constants false).V.combiner_anything cur) prev))
[] l in
let process_mcodekind = function
- Ast.MINUS(_,_,_,anythings) -> recurse anythings
+ Ast.MINUS(_,_,_,Ast.REPLACEMENT(anythings,_)) -> recurse anythings
| Ast.CONTEXT(_,Ast.BEFORE(a,_)) -> recurse a
| Ast.CONTEXT(_,Ast.AFTER(a,_)) -> recurse a
| Ast.CONTEXT(_,Ast.BEFOREAFTER(a1,a2,_)) ->
else Ast.AndDep (Ast.Dep rule,prev))
deps mv in
(match dependencies env extra_deps with
- False -> (rest_info, in_plus, (nm,True)::env, nm::locals)
+ False ->
+ (rest_info, in_plus, (nm,True)::env, nm::locals)
| dependencies ->
(build_or dependencies rest_info, in_plus, env, locals))
| (Ast.InitialScriptRule (_,_,deps,_),_)
(rest_info, in_plus, env, locals)
| (Ast.CocciRule (nm,(dep,_,_),cur,_,_),neg_pos_vars) ->
let (cur_info,cur_plus) =
- rule_fn cur in_plus ((nm,True)::env)
- neg_pos_vars in
+ rule_fn cur in_plus ((nm,True)::env) neg_pos_vars in
(match dependencies env dep with
False -> (rest_info,cur_plus,env,locals)
| dependencies ->
if List.for_all all_context.V.combiner_top_level cur
- then (rest_info,cur_plus,(nm,cur_info)::env,nm::locals)
+ then
+ let cur_info = build_and dependencies cur_info in
+ (rest_info,cur_plus,(nm,cur_info)::env,nm::locals)
else
(* no constants if dependent on another rule; then we need to
find the constants of that rule *)
- (build_or (build_and dependencies cur_info) rest_info,
- cur_plus,env,locals)))
+ (build_or (build_and dependencies cur_info) rest_info,
+ cur_plus,(nm,cur_info)::env,locals)))
(False,[],[],[])
(List.combine (rules : Ast.rule list) neg_pos_vars) in
info
| Flag.Google _ ->
let res = run rules neg_pos_vars in
(interpret_grep true res,interpret_google true res,None)
- | Flag.IdUtils _ ->
+ | Flag.IdUtils ->
let res = run rules neg_pos_vars in
(interpret_grep true res,None,Some res)
-