File: log.ml

package info (click to toggle)
herdtools7 7.58-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 19,732 kB
  • sloc: ml: 128,583; ansic: 3,827; makefile: 670; python: 407; sh: 212; awk: 14
file content (70 lines) | stat: -rw-r--r-- 2,633 bytes parent folder | download
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
(****************************************************************************)
(*                           the diy toolsuite                              *)
(*                                                                          *)
(* Jade Alglave, University College London, UK.                             *)
(* Luc Maranget, INRIA Paris-Rocquencourt, France.                          *)
(*                                                                          *)
(* Copyright 2010-present Institut National de Recherche en Informatique et *)
(* en Automatique, ARM Ltd and the authors. All rights reserved.            *)
(*                                                                          *)
(* This software is governed by the CeCILL-B license under French law and   *)
(* abiding by the rules of distribution of free software. You can use,      *)
(* modify and/ or redistribute the software under the terms of the CeCILL-B *)
(* license as circulated by CEA, CNRS and INRIA at the following URL        *)
(* "http://www.cecill.info". We also give a copy in LICENSE.txt.            *)
(****************************************************************************)

(** Parse herd output logs. *)

module Option = Base.Option

type t = {
  name : string ;
  kind : ConstrGen.kind option ;
}

let to_ocaml_string l =
  OcamlString.record [
    "name", Base.String.to_ocaml_string l.name ;
    "kind", Option.to_ocaml_string ConstrGen.pp_kind l.kind ;
  ]

let compare a b =
  Compare.chain [
    String.compare a.name b.name ;
    Option.compare ConstrGen.compare_kind a.kind b.kind ;
  ]

let split = LexSplit.words

let rec next_test k = function
  | [] -> List.rev k
  | line::lines ->
      match split line with
      | ["Test"; name ; ("Forbidden"|"Forbid"|"Allowed");] ->
          in_test k name true lines
      | ["Test"; name ; "Required";] ->
          in_test k name false lines
      | _ -> next_test k lines

and in_test k name exists = function
  | [] -> List.rev k
  | line::lines ->
      match split line with
      | "Observation"::name2::r::_ ->
          if name <> name2 then next_test k lines
          else begin
            let kind =
              let open ConstrGen in
              match r with
              | "Always" ->
                  if exists then Allow else Require
              | "Sometimes" -> Allow
              | "Never" -> Forbid
              | _ -> assert false in
            next_test ({ name; kind=Some kind; }::k) lines
          end
      | "Test"::_ -> next_test k (line::lines)
      | _ -> in_test k name exists lines

let of_string_list ls = next_test [] ls