Release coccinelle-0.1.6

[bpt/coccinelle.git] / engine / lib_matcher_c.ml

diff --git a/engine/lib_matcher_c.ml b/engine/lib_matcher_c.ml
dissimilarity index 100%
index 87b0a72..e69de29 100644 (file)
--- a/engine/lib_matcher_c.ml
+++ b/engine/lib_matcher_c.ml
@@ -1,156 +0,0 @@
-(*
-* Copyright 2005-2009, Ecole des Mines de Nantes, University of Copenhagen
-* Yoann Padioleau, Julia Lawall, Rene Rydhof Hansen, Henrik Stuart, Gilles Muller
-* This file is part of Coccinelle.
-* 
-* Coccinelle is free software: you can redistribute it and/or modify
-* it under the terms of the GNU General Public License as published by
-* the Free Software Foundation, according to version 2 of the License.
-* 
-* Coccinelle is distributed in the hope that it will be useful,
-* but WITHOUT ANY WARRANTY; without even the implied warranty of
-* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-* GNU General Public License for more details.
-* 
-* You should have received a copy of the GNU General Public License
-* along with Coccinelle.  If not, see <http://www.gnu.org/licenses/>.
-* 
-* The authors reserve the right to distribute this or future versions of
-* Coccinelle under other licenses.
-*)
-
-
-open Common
-
-(*****************************************************************************)
-(* Types *)
-(*****************************************************************************)
-
-type protocol_match = 
-  | MatchPos of Ograph_extended.nodei
-  | MatchNeg of Ograph_extended.nodei
-  | NoMatch 
-  (* could generate exn instead, but in many cases as for my acomment gui
-   * I still want to print the match for the other elements, so one failure
-   * should not stop everything
-   *)
-  | MatchProblem of string
-
-
-(*****************************************************************************)
-(* Helpers *)
-(*****************************************************************************)
-
-(*****************************************************************************)
-(* Specific finder wrappers *)
-(*****************************************************************************)
-let (find_nodes_satisfying_pattern: 
-    Control_flow_c.cflow -> Ast_cocci.rule_elem -> Ograph_extended.nodei list)= 
- fun flow pattern -> 
-
-  let nodes = flow#nodes in
-  let nodes = nodes#tolist in
-  nodes +> Common.map_filter (fun (nodei, node) -> 
-    let res = 
-      Pattern_c.match_re_node [] (* dropped isos *)
-        pattern node 
-        [] 
-    in
-    if List.length res > 0
-    then Some nodei
-    else None
-  )
-
-
-let (find_nodes_containing_expr: 
-    Control_flow_c.cflow -> Ast_c.expression -> Ograph_extended.nodei list)= 
- fun flow expr -> 
-
-  let expr = Lib_parsing_c.real_al_expr expr in
-
-  let nodes = flow#nodes in
-  let nodes = nodes#tolist in
-  nodes +> Common.map_filter (fun (nodei, node) -> 
-    let node = Lib_parsing_c.real_al_node node in 
-
-    let found = ref false in 
-    
-    Visitor_c.vk_node { Visitor_c.default_visitor_c with
-      Visitor_c.kexpr = (fun (k, bigf) e2 -> 
-        if e2 =*= expr
-        then found := true
-        else k e2
-      );
-    } node;
-
-    if !found
-    then Some nodei
-    else None
-  )
-
-
-
-(*****************************************************************************)
-(* Main entries *)
-(*****************************************************************************)
-
-(*
- * 
- * todo: Check for all path upwards ?
- *)
-
-let (find_nodes_upward_satisfying_protocol: 
-  Ograph_extended.nodei -> Control_flow_c.cflow -> 
-  Ast_cocci.rule_elem * Ast_cocci.rule_elem -> 
-  protocol_match
-  ) = 
- fun nodei flow (pattern1, pattern2) ->
-
-   let already_done = ref [nodei] in
-   let found = ref [] in
-
-   let rec aux nodei = 
-     let pred = 
-       List.map fst ((flow#predecessors nodei)#tolist)
-     in
-     pred +> List.iter (fun nodei2 -> 
-       if List.mem nodei2 !already_done
-       then ()
-       else begin
-         Common.push2 nodei2 already_done;
-
-         let node2 = flow#nodes#assoc nodei2 in
-
-         let res1 = 
-           Pattern_c.match_re_node [] 
-             pattern1 node2
-             [] 
-         in
-         let res2 = 
-           Pattern_c.match_re_node [] 
-             pattern2 node2
-             [] 
-         in
-         match List.length res1 > 0, List.length res2 > 0 with
-         | true, false -> 
-             Common.push2 (MatchPos nodei2) found
-         | false, true -> 
-             Common.push2 (MatchNeg nodei2) found
-         | true, true -> 
-             failwith "wierd, node match both rule_elem"
-         | false, false -> 
-             aux nodei2
-       end
-     );
-   in
-   aux nodei;
-   (match !found with
-   | [] -> NoMatch
-   | [x] -> x
-   | x::y::ys -> 
-       failwith "multiple found";
-   )
-
-
-
-