src/Pure/codegen.ML
author berghofe
Tue Sep 27 12:13:17 2005 +0200 (2005-09-27)
changeset 17666 4708ab4626a5
parent 17638 6de497c99e4c
child 18098 227ecb2cfa3d
permissions -rw-r--r--
Optimized unfold_attr.
berghofe@11520
     1
(*  Title:      Pure/codegen.ML
berghofe@11520
     2
    ID:         $Id$
wenzelm@11539
     3
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11520
     4
wenzelm@11539
     5
Generic code generator.
berghofe@11520
     6
*)
berghofe@11520
     7
berghofe@11520
     8
signature CODEGEN =
berghofe@11520
     9
sig
berghofe@11520
    10
  val quiet_mode : bool ref
berghofe@11520
    11
  val message : string -> unit
berghofe@13753
    12
  val mode : string list ref
berghofe@13886
    13
  val margin : int ref
berghofe@11520
    14
berghofe@12452
    15
  datatype 'a mixfix =
berghofe@11520
    16
      Arg
berghofe@11520
    17
    | Ignore
berghofe@16769
    18
    | Module
berghofe@11520
    19
    | Pretty of Pretty.T
berghofe@12452
    20
    | Quote of 'a;
berghofe@11520
    21
berghofe@16649
    22
  type deftab
berghofe@17144
    23
  type node
berghofe@16649
    24
  type codegr
berghofe@12452
    25
  type 'a codegen
berghofe@12452
    26
berghofe@12452
    27
  val add_codegen: string -> term codegen -> theory -> theory
berghofe@12452
    28
  val add_tycodegen: string -> typ codegen -> theory -> theory
berghofe@14197
    29
  val add_attribute: string -> (Args.T list -> theory attribute * Args.T list) -> theory -> theory
berghofe@15261
    30
  val add_preprocessor: (theory -> thm list -> thm list) -> theory -> theory
berghofe@15261
    31
  val preprocess: theory -> thm list -> thm list
berghofe@17549
    32
  val preprocess_term: theory -> term -> term
berghofe@11520
    33
  val print_codegens: theory -> unit
berghofe@17144
    34
  val generate_code: theory -> string list -> string -> (string * string) list ->
berghofe@17144
    35
    (string * string) list * codegr
berghofe@17144
    36
  val generate_code_i: theory -> string list -> string -> (string * term) list ->
berghofe@17144
    37
    (string * string) list * codegr
berghofe@16769
    38
  val assoc_consts: (xstring * string option * (term mixfix list *
berghofe@16769
    39
    (string * string) list)) list -> theory -> theory
berghofe@16769
    40
  val assoc_consts_i: (xstring * typ option * (term mixfix list *
berghofe@16769
    41
    (string * string) list)) list -> theory -> theory
berghofe@16769
    42
  val assoc_types: (xstring * (typ mixfix list *
berghofe@16769
    43
    (string * string) list)) list -> theory -> theory
berghofe@16769
    44
  val get_assoc_code: theory -> string -> typ ->
berghofe@16769
    45
    (term mixfix list * (string * string) list) option
berghofe@16769
    46
  val get_assoc_type: theory -> string ->
berghofe@16769
    47
    (typ mixfix list * (string * string) list) option
berghofe@17144
    48
  val codegen_error: codegr -> string -> string -> 'a
berghofe@16649
    49
  val invoke_codegen: theory -> deftab -> string -> string -> bool ->
berghofe@16649
    50
    codegr * term -> codegr * Pretty.T
berghofe@16649
    51
  val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
berghofe@16649
    52
    codegr * typ -> codegr * Pretty.T
berghofe@14858
    53
  val mk_id: string -> string
berghofe@17144
    54
  val mk_qual_id: string -> string * string -> string
berghofe@17144
    55
  val mk_const_id: string -> string -> codegr -> codegr * (string * string)
berghofe@17144
    56
  val get_const_id: string -> codegr -> string * string
berghofe@17144
    57
  val mk_type_id: string -> string -> codegr -> codegr * (string * string)
berghofe@17144
    58
  val get_type_id: string -> codegr -> string * string
berghofe@16649
    59
  val thyname_of_type: string -> theory -> string
berghofe@16649
    60
  val thyname_of_const: string -> theory -> string
berghofe@16649
    61
  val rename_terms: term list -> term list
berghofe@11520
    62
  val rename_term: term -> term
berghofe@15398
    63
  val new_names: term -> string list -> string list
berghofe@15398
    64
  val new_name: term -> string -> string
berghofe@17144
    65
  val if_library: 'a -> 'a -> 'a
berghofe@16649
    66
  val get_defn: theory -> deftab -> string -> typ ->
berghofe@16649
    67
    ((typ * (string * (term list * term))) * int option) option
berghofe@11520
    68
  val is_instance: theory -> typ -> typ -> bool
berghofe@11520
    69
  val parens: Pretty.T -> Pretty.T
berghofe@11520
    70
  val mk_app: bool -> Pretty.T -> Pretty.T list -> Pretty.T
berghofe@11520
    71
  val eta_expand: term -> term list -> int -> term
berghofe@14105
    72
  val strip_tname: string -> string
berghofe@13753
    73
  val mk_type: bool -> typ -> Pretty.T
berghofe@17144
    74
  val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
berghofe@17144
    75
  val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
berghofe@14105
    76
  val test_fn: (int -> (string * term) list option) ref
berghofe@14105
    77
  val test_term: theory -> int -> int -> term -> (string * term) list option
berghofe@17549
    78
  val eval_result: term ref
berghofe@17549
    79
  val eval_term: theory -> term -> term
berghofe@12452
    80
  val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
berghofe@16649
    81
  val mk_deftab: theory -> deftab
berghofe@17549
    82
berghofe@17144
    83
  val get_node: codegr -> string -> node
berghofe@17144
    84
  val add_edge: string * string -> codegr -> codegr
berghofe@17144
    85
  val add_edge_acyclic: string * string -> codegr -> codegr
berghofe@17144
    86
  val del_nodes: string list -> codegr -> codegr
berghofe@17144
    87
  val map_node: string -> (node -> node) -> codegr -> codegr
berghofe@17144
    88
  val new_node: string * node -> codegr -> codegr
berghofe@11520
    89
end;
berghofe@11520
    90
berghofe@11520
    91
structure Codegen : CODEGEN =
berghofe@11520
    92
struct
berghofe@11520
    93
berghofe@11520
    94
val quiet_mode = ref true;
berghofe@11520
    95
fun message s = if !quiet_mode then () else writeln s;
berghofe@11520
    96
berghofe@13753
    97
val mode = ref ([] : string list);
berghofe@13753
    98
berghofe@13886
    99
val margin = ref 80;
berghofe@13886
   100
berghofe@11520
   101
(**** Mixfix syntax ****)
berghofe@11520
   102
berghofe@12452
   103
datatype 'a mixfix =
berghofe@11520
   104
    Arg
berghofe@11520
   105
  | Ignore
berghofe@16769
   106
  | Module
berghofe@11520
   107
  | Pretty of Pretty.T
berghofe@12452
   108
  | Quote of 'a;
berghofe@11520
   109
berghofe@11520
   110
fun is_arg Arg = true
berghofe@11520
   111
  | is_arg Ignore = true
berghofe@11520
   112
  | is_arg _ = false;
berghofe@11520
   113
berghofe@12452
   114
fun quotes_of [] = []
berghofe@12452
   115
  | quotes_of (Quote q :: ms) = q :: quotes_of ms
berghofe@12452
   116
  | quotes_of (_ :: ms) = quotes_of ms;
berghofe@12452
   117
berghofe@12452
   118
fun args_of [] xs = ([], xs)
berghofe@12452
   119
  | args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
berghofe@12452
   120
  | args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
berghofe@12452
   121
  | args_of (_ :: ms) xs = args_of ms xs;
berghofe@11520
   122
skalberg@15570
   123
fun num_args x = length (List.filter is_arg x);
berghofe@11520
   124
berghofe@11520
   125
berghofe@11520
   126
(**** theory data ****)
berghofe@11520
   127
berghofe@16649
   128
(* preprocessed definition table *)
berghofe@16649
   129
berghofe@16649
   130
type deftab =
berghofe@16649
   131
  (typ *              (* type of constant *)
berghofe@16649
   132
    (string *         (* name of theory containing definition of constant *)
berghofe@16649
   133
      (term list *    (* parameters *)
berghofe@16649
   134
       term)))        (* right-hand side *)
berghofe@16649
   135
  list Symtab.table;
berghofe@16649
   136
berghofe@16649
   137
(* code dependency graph *)
berghofe@16649
   138
berghofe@17144
   139
type nametab = (string * string) Symtab.table * unit Symtab.table;
berghofe@17144
   140
berghofe@17144
   141
fun merge_nametabs ((tab, used), (tab', used')) =
berghofe@17144
   142
  (Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
berghofe@17144
   143
berghofe@17144
   144
type node =
berghofe@16649
   145
  (exn option *    (* slot for arbitrary data *)
berghofe@16649
   146
   string *        (* name of structure containing piece of code *)
berghofe@17144
   147
   string);        (* piece of code *)
berghofe@17144
   148
berghofe@17144
   149
type codegr =
berghofe@17144
   150
  node Graph.T *
berghofe@17144
   151
  (nametab *       (* table for assigned constant names *)
berghofe@17144
   152
   nametab);       (* table for assigned type names *)
berghofe@17144
   153
berghofe@17144
   154
val emptygr : codegr = (Graph.empty,
berghofe@17144
   155
  ((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
berghofe@16649
   156
berghofe@14105
   157
(* type of code generators *)
berghofe@11520
   158
berghofe@16649
   159
type 'a codegen =
berghofe@16649
   160
  theory ->    (* theory in which generate_code was called *)
berghofe@16649
   161
  deftab ->    (* definition table (for efficiency) *)
berghofe@16649
   162
  codegr ->    (* code dependency graph *)
berghofe@16649
   163
  string ->    (* node name of caller (for recording dependencies) *)
berghofe@17144
   164
  string ->    (* module name of caller (for modular code generation) *)
berghofe@16649
   165
  bool ->      (* whether to parenthesize generated expression *)
berghofe@16649
   166
  'a ->        (* item to generate code from *)
berghofe@16649
   167
  (codegr * Pretty.T) option;
berghofe@12452
   168
berghofe@14105
   169
(* parameters for random testing *)
berghofe@14105
   170
berghofe@14105
   171
type test_params =
berghofe@14105
   172
  {size: int, iterations: int, default_type: typ option};
berghofe@14105
   173
berghofe@14105
   174
fun merge_test_params
berghofe@14105
   175
  {size = size1, iterations = iterations1, default_type = default_type1}
berghofe@14105
   176
  {size = size2, iterations = iterations2, default_type = default_type2} =
berghofe@14105
   177
  {size = Int.max (size1, size2),
berghofe@14105
   178
   iterations = Int.max (iterations1, iterations2),
berghofe@14105
   179
   default_type = case default_type1 of
skalberg@15531
   180
       NONE => default_type2
berghofe@14105
   181
     | _ => default_type1};
berghofe@14105
   182
berghofe@14105
   183
val default_test_params : test_params =
skalberg@15531
   184
  {size = 10, iterations = 100, default_type = NONE};
berghofe@14105
   185
berghofe@14105
   186
fun set_size size ({iterations, default_type, ...} : test_params) =
berghofe@14105
   187
  {size = size, iterations = iterations, default_type = default_type};
berghofe@14105
   188
berghofe@14105
   189
fun set_iterations iterations ({size, default_type, ...} : test_params) =
berghofe@14105
   190
  {size = size, iterations = iterations, default_type = default_type};
berghofe@14105
   191
wenzelm@16458
   192
fun set_default_type s thy ({size, iterations, ...} : test_params) =
berghofe@14105
   193
  {size = size, iterations = iterations,
wenzelm@16458
   194
   default_type = SOME (typ_of (read_ctyp thy s))};
berghofe@14105
   195
berghofe@14105
   196
(* data kind 'Pure/codegen' *)
wenzelm@16458
   197
wenzelm@16458
   198
structure CodegenData = TheoryDataFun
wenzelm@16458
   199
(struct
berghofe@11520
   200
  val name = "Pure/codegen";
berghofe@11520
   201
  type T =
berghofe@12452
   202
    {codegens : (string * term codegen) list,
berghofe@12452
   203
     tycodegens : (string * typ codegen) list,
berghofe@16769
   204
     consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
berghofe@16769
   205
     types : (string * (typ mixfix list * (string * string) list)) list,
berghofe@14197
   206
     attrs: (string * (Args.T list -> theory attribute * Args.T list)) list,
berghofe@15261
   207
     preprocs: (stamp * (theory -> thm list -> thm list)) list,
berghofe@17144
   208
     modules: codegr Symtab.table,
berghofe@14105
   209
     test_params: test_params};
berghofe@11520
   210
berghofe@12555
   211
  val empty =
berghofe@14105
   212
    {codegens = [], tycodegens = [], consts = [], types = [], attrs = [],
berghofe@17144
   213
     preprocs = [], modules = Symtab.empty, test_params = default_test_params};
berghofe@11520
   214
  val copy = I;
wenzelm@16458
   215
  val extend = I;
berghofe@11520
   216
wenzelm@16458
   217
  fun merge _
berghofe@12555
   218
    ({codegens = codegens1, tycodegens = tycodegens1,
berghofe@14105
   219
      consts = consts1, types = types1, attrs = attrs1,
berghofe@17144
   220
      preprocs = preprocs1, modules = modules1, test_params = test_params1},
berghofe@12555
   221
     {codegens = codegens2, tycodegens = tycodegens2,
berghofe@14105
   222
      consts = consts2, types = types2, attrs = attrs2,
berghofe@17144
   223
      preprocs = preprocs2, modules = modules2, test_params = test_params2}) =
berghofe@15261
   224
    {codegens = merge_alists' codegens1 codegens2,
berghofe@15261
   225
     tycodegens = merge_alists' tycodegens1 tycodegens2,
berghofe@12555
   226
     consts = merge_alists consts1 consts2,
berghofe@12555
   227
     types = merge_alists types1 types2,
berghofe@14105
   228
     attrs = merge_alists attrs1 attrs2,
berghofe@15261
   229
     preprocs = merge_alists' preprocs1 preprocs2,
berghofe@17144
   230
     modules = Symtab.merge (K true) (modules1, modules2),
berghofe@14105
   231
     test_params = merge_test_params test_params1 test_params2};
berghofe@11520
   232
wenzelm@16458
   233
  fun print _ ({codegens, tycodegens, ...} : T) =
berghofe@12452
   234
    Pretty.writeln (Pretty.chunks
berghofe@12452
   235
      [Pretty.strs ("term code generators:" :: map fst codegens),
berghofe@12452
   236
       Pretty.strs ("type code generators:" :: map fst tycodegens)]);
wenzelm@16458
   237
end);
berghofe@11520
   238
wenzelm@15801
   239
val _ = Context.add_setup [CodegenData.init];
berghofe@11520
   240
val print_codegens = CodegenData.print;
berghofe@11520
   241
berghofe@11520
   242
berghofe@14105
   243
(**** access parameters for random testing ****)
berghofe@14105
   244
berghofe@14105
   245
fun get_test_params thy = #test_params (CodegenData.get thy);
berghofe@14105
   246
berghofe@14105
   247
fun map_test_params f thy =
berghofe@17144
   248
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   249
    CodegenData.get thy;
berghofe@14105
   250
  in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
berghofe@15261
   251
    consts = consts, types = types, attrs = attrs, preprocs = preprocs,
berghofe@17144
   252
    modules = modules, test_params = f test_params} thy
berghofe@17144
   253
  end;
berghofe@17144
   254
berghofe@17144
   255
berghofe@17144
   256
(**** access modules ****)
berghofe@17144
   257
berghofe@17144
   258
fun get_modules thy = #modules (CodegenData.get thy);
berghofe@17144
   259
berghofe@17144
   260
fun map_modules f thy =
berghofe@17144
   261
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@17144
   262
    CodegenData.get thy;
berghofe@17144
   263
  in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
berghofe@17144
   264
    consts = consts, types = types, attrs = attrs, preprocs = preprocs,
berghofe@17144
   265
    modules = f modules, test_params = test_params} thy
berghofe@14105
   266
  end;
berghofe@14105
   267
berghofe@14105
   268
berghofe@12452
   269
(**** add new code generators to theory ****)
berghofe@11520
   270
berghofe@11520
   271
fun add_codegen name f thy =
berghofe@17144
   272
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   273
    CodegenData.get thy
haftmann@17521
   274
  in (case AList.lookup (op =) codegens name of
skalberg@15531
   275
      NONE => CodegenData.put {codegens = (name, f) :: codegens,
berghofe@12555
   276
        tycodegens = tycodegens, consts = consts, types = types,
berghofe@17144
   277
        attrs = attrs, preprocs = preprocs, modules = modules,
berghofe@17144
   278
        test_params = test_params} thy
skalberg@15531
   279
    | SOME _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@12452
   280
  end;
berghofe@12452
   281
berghofe@12452
   282
fun add_tycodegen name f thy =
berghofe@17144
   283
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   284
    CodegenData.get thy
haftmann@17521
   285
  in (case AList.lookup (op =) tycodegens name of
skalberg@15531
   286
      NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
berghofe@12555
   287
        codegens = codegens, consts = consts, types = types,
berghofe@17144
   288
        attrs = attrs, preprocs = preprocs, modules = modules,
berghofe@17144
   289
        test_params = test_params} thy
skalberg@15531
   290
    | SOME _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@11520
   291
  end;
berghofe@11520
   292
berghofe@11520
   293
berghofe@12555
   294
(**** code attribute ****)
berghofe@12555
   295
berghofe@12555
   296
fun add_attribute name att thy =
berghofe@17144
   297
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   298
    CodegenData.get thy
haftmann@17521
   299
  in (case AList.lookup (op =) attrs name of
skalberg@15531
   300
      NONE => CodegenData.put {tycodegens = tycodegens,
berghofe@12555
   301
        codegens = codegens, consts = consts, types = types,
berghofe@15261
   302
        attrs = if name = "" then attrs @ [(name, att)] else (name, att) :: attrs,
berghofe@17144
   303
        preprocs = preprocs, modules = modules,
berghofe@15261
   304
        test_params = test_params} thy
skalberg@15531
   305
    | SOME _ => error ("Code attribute " ^ name ^ " already declared"))
berghofe@12555
   306
  end;
berghofe@12555
   307
berghofe@14197
   308
fun mk_parser (a, p) = (if a = "" then Scan.succeed "" else Args.$$$ a) |-- p;
berghofe@14197
   309
berghofe@12555
   310
val code_attr =
wenzelm@15664
   311
  Attrib.syntax (Scan.peek (fn thy => foldr op || Scan.fail (map mk_parser
wenzelm@15664
   312
    (#attrs (CodegenData.get thy)))));
berghofe@12555
   313
wenzelm@15801
   314
val _ = Context.add_setup
wenzelm@15801
   315
 [Attrib.add_attributes
wenzelm@15801
   316
  [("code", (code_attr, K Attrib.undef_local_attribute),
wenzelm@15801
   317
     "declare theorems for code generation")]];
wenzelm@15801
   318
berghofe@12555
   319
berghofe@15261
   320
(**** preprocessors ****)
berghofe@15261
   321
berghofe@15261
   322
fun add_preprocessor p thy =
berghofe@17144
   323
  let val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@15261
   324
    CodegenData.get thy
berghofe@15261
   325
  in CodegenData.put {tycodegens = tycodegens,
berghofe@15261
   326
    codegens = codegens, consts = consts, types = types,
berghofe@15261
   327
    attrs = attrs, preprocs = (stamp (), p) :: preprocs,
berghofe@17144
   328
    modules = modules, test_params = test_params} thy
berghofe@15261
   329
  end;
berghofe@15261
   330
berghofe@15261
   331
fun preprocess thy ths =
berghofe@15261
   332
  let val {preprocs, ...} = CodegenData.get thy
skalberg@15570
   333
  in Library.foldl (fn (ths, (_, f)) => f thy ths) (ths, preprocs) end;
berghofe@15261
   334
berghofe@17549
   335
fun preprocess_term thy t =
berghofe@17549
   336
  let
berghofe@17549
   337
    val x = Free (variant (add_term_names (t, [])) "x", fastype_of t);
berghofe@17549
   338
    (* fake definition *)
berghofe@17549
   339
    val eq = setmp quick_and_dirty true (SkipProof.make_thm thy)
berghofe@17549
   340
      (Logic.mk_equals (x, t));
berghofe@17549
   341
    fun err () = error "preprocess_term: bad preprocessor"
berghofe@17549
   342
  in case map prop_of (preprocess thy [eq]) of
berghofe@17549
   343
      [Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
berghofe@17549
   344
    | _ => err ()
berghofe@17549
   345
  end;
berghofe@17549
   346
    
berghofe@15261
   347
fun unfold_attr (thy, eqn) =
berghofe@15261
   348
  let
berghofe@17666
   349
    val names = term_consts
berghofe@17666
   350
      (fst (Logic.dest_equals (prop_of eqn)));
berghofe@15261
   351
    fun prep thy = map (fn th =>
berghofe@17666
   352
      let val prop = prop_of th
berghofe@17666
   353
      in
berghofe@17666
   354
        if forall (fn name => exists_Const (equal name o fst) prop) names
berghofe@17666
   355
        then rewrite_rule [eqn] (Thm.transfer thy th)
berghofe@17666
   356
        else th
berghofe@17666
   357
      end)
berghofe@15261
   358
  in (add_preprocessor prep thy, eqn) end;
berghofe@15261
   359
wenzelm@15801
   360
val _ = Context.add_setup [add_attribute "unfold" (Scan.succeed unfold_attr)];
wenzelm@15801
   361
berghofe@15261
   362
berghofe@11520
   363
(**** associate constants with target language code ****)
berghofe@11520
   364
skalberg@15570
   365
fun gen_assoc_consts prep_type xs thy = Library.foldl (fn (thy, (s, tyopt, syn)) =>
berghofe@11520
   366
  let
berghofe@17144
   367
    val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   368
      CodegenData.get thy;
wenzelm@16458
   369
    val cname = Sign.intern_const thy s;
berghofe@11520
   370
  in
wenzelm@16458
   371
    (case Sign.const_type thy cname of
skalberg@15531
   372
       SOME T =>
berghofe@11520
   373
         let val T' = (case tyopt of
skalberg@15531
   374
                NONE => T
skalberg@15531
   375
              | SOME ty =>
wenzelm@16458
   376
                  let val U = prep_type thy ty
wenzelm@16458
   377
                  in if Sign.typ_instance thy (U, T) then U
berghofe@11520
   378
                    else error ("Illegal type constraint for constant " ^ cname)
berghofe@11520
   379
                  end)
haftmann@17521
   380
         in (case AList.lookup (op =) consts (cname, T') of
skalberg@15531
   381
             NONE => CodegenData.put {codegens = codegens,
berghofe@12452
   382
               tycodegens = tycodegens,
berghofe@12555
   383
               consts = ((cname, T'), syn) :: consts,
berghofe@15261
   384
               types = types, attrs = attrs, preprocs = preprocs,
berghofe@17144
   385
               modules = modules, test_params = test_params} thy
skalberg@15531
   386
           | SOME _ => error ("Constant " ^ cname ^ " already associated with code"))
berghofe@11520
   387
         end
berghofe@11520
   388
     | _ => error ("Not a constant: " ^ s))
berghofe@11520
   389
  end) (thy, xs);
berghofe@11520
   390
berghofe@11520
   391
val assoc_consts_i = gen_assoc_consts (K I);
wenzelm@16458
   392
val assoc_consts = gen_assoc_consts (typ_of oo read_ctyp);
berghofe@11520
   393
wenzelm@15801
   394
berghofe@11520
   395
(**** associate types with target language types ****)
berghofe@11520
   396
skalberg@15570
   397
fun assoc_types xs thy = Library.foldl (fn (thy, (s, syn)) =>
berghofe@11520
   398
  let
berghofe@17144
   399
    val {codegens, tycodegens, consts, types, attrs, preprocs, modules, test_params} =
berghofe@14105
   400
      CodegenData.get thy;
berghofe@16649
   401
    val tc = Sign.intern_type thy s
berghofe@11520
   402
  in
haftmann@17521
   403
    (case AList.lookup (op =) types tc of
skalberg@15531
   404
       NONE => CodegenData.put {codegens = codegens,
berghofe@12452
   405
         tycodegens = tycodegens, consts = consts,
berghofe@14105
   406
         types = (tc, syn) :: types, attrs = attrs,
berghofe@17144
   407
         preprocs = preprocs, modules = modules, test_params = test_params} thy
skalberg@15531
   408
     | SOME _ => error ("Type " ^ tc ^ " already associated with code"))
berghofe@11520
   409
  end) (thy, xs);
berghofe@11520
   410
haftmann@17521
   411
fun get_assoc_type thy s = AList.lookup (op =) ((#types o CodegenData.get) thy) s;
wenzelm@11546
   412
berghofe@11520
   413
berghofe@11520
   414
(**** make valid ML identifiers ****)
berghofe@11520
   415
berghofe@14858
   416
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
berghofe@14858
   417
  Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
berghofe@14858
   418
berghofe@14858
   419
fun dest_sym s = (case split_last (snd (take_prefix (equal "\\") (explode s))) of
berghofe@14858
   420
    ("<" :: "^" :: xs, ">") => (true, implode xs)
berghofe@14858
   421
  | ("<" :: xs, ">") => (false, implode xs)
berghofe@14858
   422
  | _ => sys_error "dest_sym");
wenzelm@16458
   423
berghofe@14858
   424
fun mk_id s = if s = "" then "" else
berghofe@11520
   425
  let
berghofe@14858
   426
    fun check_str [] = []
berghofe@14858
   427
      | check_str xs = (case take_prefix is_ascii_letdig xs of
berghofe@14858
   428
          ([], " " :: zs) => check_str zs
berghofe@14858
   429
        | ([], z :: zs) =>
berghofe@14858
   430
          if size z = 1 then string_of_int (ord z) :: check_str zs
berghofe@14858
   431
          else (case dest_sym z of
berghofe@14858
   432
              (true, "isub") => check_str zs
berghofe@14858
   433
            | (true, "isup") => "" :: check_str zs
berghofe@14858
   434
            | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
berghofe@14858
   435
        | (ys, zs) => implode ys :: check_str zs);
berghofe@14858
   436
    val s' = space_implode "_"
skalberg@15570
   437
      (List.concat (map (check_str o Symbol.explode) (NameSpace.unpack s)))
berghofe@11520
   438
  in
berghofe@14858
   439
    if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
berghofe@11520
   440
  end;
berghofe@11520
   441
berghofe@17144
   442
fun mk_long_id (p as (tab, used)) module s =
berghofe@16649
   443
  let
berghofe@17144
   444
    fun find_name [] = sys_error "mk_long_id"
berghofe@17144
   445
      | find_name (ys :: yss) =
berghofe@17144
   446
          let
berghofe@17144
   447
            val s' = NameSpace.pack ys
berghofe@17144
   448
            val s'' = NameSpace.append module s'
wenzelm@17412
   449
          in case Symtab.lookup used s'' of
wenzelm@17261
   450
              NONE => ((module, s'),
wenzelm@17412
   451
                (Symtab.update_new (s, (module, s')) tab,
wenzelm@17412
   452
                 Symtab.update_new (s'', ()) used))
berghofe@17144
   453
            | SOME _ => find_name yss
berghofe@17144
   454
          end
wenzelm@17412
   455
  in case Symtab.lookup tab s of
berghofe@17144
   456
      NONE => find_name (Library.suffixes1 (NameSpace.unpack s))
berghofe@17144
   457
    | SOME name => (name, p)
berghofe@16649
   458
  end;
berghofe@16649
   459
berghofe@17144
   460
(* module:  module name for caller                                        *)
berghofe@17144
   461
(* module': module name for callee                                        *)
berghofe@17144
   462
(* if caller and callee reside in different modules, use qualified access *)
berghofe@16649
   463
berghofe@17144
   464
fun mk_qual_id module (module', s) =
berghofe@17144
   465
  if module = module' orelse module' = "" then s else module' ^ "." ^ s;
berghofe@17144
   466
berghofe@17144
   467
fun mk_const_id module cname (gr, (tab1, tab2)) =
berghofe@16649
   468
  let
berghofe@17144
   469
    val ((module, s), tab1') = mk_long_id tab1 module cname
berghofe@17144
   470
    val s' = mk_id s;
berghofe@16649
   471
    val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_const" else s'
berghofe@17144
   472
  in ((gr, (tab1', tab2)), (module, s'')) end;
berghofe@13073
   473
berghofe@17144
   474
fun get_const_id cname (gr, (tab1, tab2)) =
wenzelm@17412
   475
  case Symtab.lookup (fst tab1) cname of
berghofe@17144
   476
    NONE => error ("get_const_id: no such constant: " ^ quote cname)
berghofe@17144
   477
  | SOME (module, s) =>
berghofe@17144
   478
      let
berghofe@17144
   479
        val s' = mk_id s;
berghofe@17144
   480
        val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_const" else s'
berghofe@17144
   481
      in (module, s'') end;
berghofe@17144
   482
berghofe@17144
   483
fun mk_type_id module tyname (gr, (tab1, tab2)) =
berghofe@16649
   484
  let
berghofe@17144
   485
    val ((module, s), tab2') = mk_long_id tab2 module tyname
berghofe@17144
   486
    val s' = mk_id s;
berghofe@17144
   487
    val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_type" else s'
berghofe@17144
   488
  in ((gr, (tab1, tab2')), (module, s'')) end;
berghofe@16649
   489
berghofe@17144
   490
fun get_type_id tyname (gr, (tab1, tab2)) =
wenzelm@17412
   491
  case Symtab.lookup (fst tab2) tyname of
berghofe@17144
   492
    NONE => error ("get_type_id: no such type: " ^ quote tyname)
berghofe@17144
   493
  | SOME (module, s) =>
berghofe@17144
   494
      let
berghofe@17144
   495
        val s' = mk_id s;
berghofe@17144
   496
        val s'' = if s' mem ThmDatabase.ml_reserved then s' ^ "_type" else s'
berghofe@17144
   497
      in (module, s'') end;
berghofe@17144
   498
berghofe@17144
   499
fun get_type_id' f tyname tab = apsnd f (get_type_id tyname tab);
berghofe@17144
   500
berghofe@17144
   501
fun get_node (gr, x) k = Graph.get_node gr k;
berghofe@17144
   502
fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
berghofe@17144
   503
fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
berghofe@17144
   504
fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
berghofe@17144
   505
fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
berghofe@17144
   506
fun new_node p (gr, x) = (Graph.new_node p gr, x);
berghofe@16649
   507
berghofe@16649
   508
fun theory_of_type s thy = 
berghofe@16649
   509
  if Sign.declared_tyname thy s
berghofe@16649
   510
  then SOME (if_none (get_first (theory_of_type s) (Theory.parents_of thy)) thy)
berghofe@16649
   511
  else NONE;
berghofe@16649
   512
berghofe@16649
   513
fun theory_of_const s thy = 
berghofe@16649
   514
  if Sign.declared_const thy s
berghofe@16649
   515
  then SOME (if_none (get_first (theory_of_const s) (Theory.parents_of thy)) thy)
berghofe@16649
   516
  else NONE;
berghofe@16649
   517
berghofe@16649
   518
fun thyname_of_type s thy = (case theory_of_type s thy of
berghofe@16649
   519
    NONE => error ("thyname_of_type: no such type: " ^ quote s)
berghofe@16649
   520
  | SOME thy' => Context.theory_name thy');
berghofe@16649
   521
berghofe@16649
   522
fun thyname_of_const s thy = (case theory_of_const s thy of
berghofe@16649
   523
    NONE => error ("thyname_of_const: no such constant: " ^ quote s)
berghofe@16649
   524
  | SOME thy' => Context.theory_name thy');
berghofe@11520
   525
berghofe@13731
   526
fun rename_terms ts =
berghofe@11520
   527
  let
skalberg@15574
   528
    val names = foldr add_term_names
skalberg@15574
   529
      (map (fst o fst) (Drule.vars_of_terms ts)) ts;
berghofe@14858
   530
    val reserved = names inter ThmDatabase.ml_reserved;
skalberg@15570
   531
    val (illegal, alt_names) = split_list (List.mapPartial (fn s =>
skalberg@15531
   532
      let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
berghofe@14858
   533
    val ps = (reserved @ illegal) ~~
berghofe@14858
   534
      variantlist (map (suffix "'") reserved @ alt_names, names);
berghofe@11520
   535
haftmann@17521
   536
    fun rename_id s = AList.lookup (op =) ps s |> the_default s;
berghofe@14858
   537
berghofe@14858
   538
    fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
berghofe@14858
   539
      | rename (Free (a, T)) = Free (rename_id a, T)
berghofe@11520
   540
      | rename (Abs (s, T, t)) = Abs (s, T, rename t)
berghofe@11520
   541
      | rename (t $ u) = rename t $ rename u
berghofe@11520
   542
      | rename t = t;
berghofe@11520
   543
  in
berghofe@13731
   544
    map rename ts
berghofe@13731
   545
  end;
berghofe@13731
   546
berghofe@13731
   547
val rename_term = hd o rename_terms o single;
berghofe@13731
   548
berghofe@13731
   549
berghofe@13731
   550
(**** retrieve definition of constant ****)
berghofe@13731
   551
berghofe@13731
   552
fun is_instance thy T1 T2 =
berghofe@16649
   553
  Sign.typ_instance thy (T1, Type.varifyT T2);
berghofe@13731
   554
skalberg@15570
   555
fun get_assoc_code thy s T = Option.map snd (find_first (fn ((s', T'), _) =>
berghofe@13731
   556
  s = s' andalso is_instance thy T T') (#consts (CodegenData.get thy)));
berghofe@13731
   557
berghofe@16769
   558
fun get_aux_code xs = List.mapPartial (fn (m, code) =>
berghofe@16769
   559
  if m = "" orelse m mem !mode then SOME code else NONE) xs;
berghofe@16769
   560
berghofe@16649
   561
fun mk_deftab thy =
berghofe@13731
   562
  let
berghofe@16649
   563
    val axmss = map (fn thy' =>
berghofe@16649
   564
      (Context.theory_name thy', snd (#axioms (Theory.rep_theory thy'))))
berghofe@16649
   565
      (thy :: Theory.ancestors_of thy);
berghofe@15261
   566
    fun prep_def def = (case preprocess thy [def] of
berghofe@16649
   567
      [def'] => prop_of def' | _ => error "mk_deftab: bad preprocessor");
berghofe@15261
   568
    fun dest t =
berghofe@15261
   569
      let
berghofe@15261
   570
        val (lhs, rhs) = Logic.dest_equals t;
berghofe@15261
   571
        val (c, args) = strip_comb lhs;
berghofe@16649
   572
        val (s, T) = dest_Const c
berghofe@16649
   573
      in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
skalberg@15531
   574
      end handle TERM _ => NONE;
berghofe@16649
   575
    fun add_def thyname (defs, (name, t)) = (case dest t of
berghofe@16649
   576
        NONE => defs
berghofe@16649
   577
      | SOME _ => (case dest (prep_def (Thm.get_axiom thy name)) of
berghofe@16649
   578
          NONE => defs
wenzelm@17412
   579
        | SOME (s, (T, (args, rhs))) => Symtab.update
wenzelm@17261
   580
            (s, (T, (thyname, split_last (rename_terms (args @ [rhs])))) ::
wenzelm@17412
   581
            if_none (Symtab.lookup defs s) []) defs))
berghofe@13731
   582
  in
berghofe@16649
   583
    foldl (fn ((thyname, axms), defs) =>
berghofe@16649
   584
      Symtab.foldl (add_def thyname) (defs, axms)) Symtab.empty axmss
berghofe@11520
   585
  end;
berghofe@11520
   586
wenzelm@17412
   587
fun get_defn thy defs s T = (case Symtab.lookup defs s of
berghofe@16649
   588
    NONE => NONE
berghofe@16649
   589
  | SOME ds =>
berghofe@16649
   590
      let val i = find_index (is_instance thy T o fst) ds
berghofe@16649
   591
      in if i >= 0 then
berghofe@16649
   592
          SOME (List.nth (ds, i), if length ds = 1 then NONE else SOME i)
berghofe@16649
   593
        else NONE
berghofe@16649
   594
      end);
berghofe@16649
   595
berghofe@11520
   596
berghofe@12452
   597
(**** invoke suitable code generator for term / type ****)
berghofe@11520
   598
berghofe@17144
   599
fun codegen_error (gr, _) dep s =
berghofe@17144
   600
  error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
berghofe@17144
   601
berghofe@17144
   602
fun invoke_codegen thy defs dep module brack (gr, t) = (case get_first
berghofe@17144
   603
   (fn (_, f) => f thy defs gr dep module brack t) (#codegens (CodegenData.get thy)) of
berghofe@17144
   604
      NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
berghofe@17144
   605
        Sign.string_of_term thy t)
skalberg@15531
   606
    | SOME x => x);
berghofe@12452
   607
berghofe@17144
   608
fun invoke_tycodegen thy defs dep module brack (gr, T) = (case get_first
berghofe@17144
   609
   (fn (_, f) => f thy defs gr dep module brack T) (#tycodegens (CodegenData.get thy)) of
berghofe@17144
   610
      NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
berghofe@17144
   611
        Sign.string_of_typ thy T)
skalberg@15531
   612
    | SOME x => x);
berghofe@11520
   613
berghofe@11520
   614
berghofe@11520
   615
(**** code generator for mixfix expressions ****)
berghofe@11520
   616
berghofe@11520
   617
fun parens p = Pretty.block [Pretty.str "(", p, Pretty.str ")"];
berghofe@11520
   618
berghofe@11520
   619
fun pretty_fn [] p = [p]
berghofe@11520
   620
  | pretty_fn (x::xs) p = Pretty.str ("fn " ^ x ^ " =>") ::
berghofe@11520
   621
      Pretty.brk 1 :: pretty_fn xs p;
berghofe@11520
   622
berghofe@16769
   623
fun pretty_mixfix _ _ [] [] _ = []
berghofe@16769
   624
  | pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
berghofe@16769
   625
      p :: pretty_mixfix module module' ms ps qs
berghofe@16769
   626
  | pretty_mixfix module module' (Ignore :: ms) ps qs =
berghofe@16769
   627
      pretty_mixfix module module' ms ps qs
berghofe@16769
   628
  | pretty_mixfix module module' (Module :: ms) ps qs =
berghofe@17144
   629
      (if module <> module'
berghofe@16769
   630
       then cons (Pretty.str (module' ^ ".")) else I)
berghofe@16769
   631
      (pretty_mixfix module module' ms ps qs)
berghofe@16769
   632
  | pretty_mixfix module module' (Pretty p :: ms) ps qs =
berghofe@16769
   633
      p :: pretty_mixfix module module' ms ps qs
berghofe@16769
   634
  | pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
berghofe@16769
   635
      q :: pretty_mixfix module module' ms ps qs;
berghofe@11520
   636
berghofe@11520
   637
berghofe@12452
   638
(**** default code generators ****)
berghofe@11520
   639
berghofe@11520
   640
fun eta_expand t ts i =
berghofe@11520
   641
  let
berghofe@11520
   642
    val (Ts, _) = strip_type (fastype_of t);
berghofe@11520
   643
    val j = i - length ts
berghofe@11520
   644
  in
skalberg@15574
   645
    foldr (fn (T, t) => Abs ("x", T, t))
skalberg@15574
   646
      (list_comb (t, ts @ map Bound (j-1 downto 0))) (Library.take (j, Ts))
berghofe@11520
   647
  end;
berghofe@11520
   648
berghofe@11520
   649
fun mk_app _ p [] = p
berghofe@11520
   650
  | mk_app brack p ps = if brack then
berghofe@11520
   651
       Pretty.block (Pretty.str "(" ::
berghofe@11520
   652
         separate (Pretty.brk 1) (p :: ps) @ [Pretty.str ")"])
berghofe@11520
   653
     else Pretty.block (separate (Pretty.brk 1) (p :: ps));
berghofe@11520
   654
berghofe@14858
   655
fun new_names t xs = variantlist (map mk_id xs,
berghofe@11520
   656
  map (fst o fst o dest_Var) (term_vars t) union
berghofe@11520
   657
  add_term_names (t, ThmDatabase.ml_reserved));
berghofe@11520
   658
berghofe@11520
   659
fun new_name t x = hd (new_names t [x]);
berghofe@11520
   660
berghofe@17144
   661
fun if_library x y = if "library" mem !mode then x else y;
berghofe@17144
   662
berghofe@17144
   663
fun default_codegen thy defs gr dep module brack t =
berghofe@11520
   664
  let
berghofe@11520
   665
    val (u, ts) = strip_comb t;
berghofe@17144
   666
    fun codegens brack = foldl_map (invoke_codegen thy defs dep module brack)
berghofe@11520
   667
  in (case u of
berghofe@14105
   668
      Var ((s, i), T) =>
berghofe@14105
   669
        let
berghofe@14105
   670
          val (gr', ps) = codegens true (gr, ts);
berghofe@17144
   671
          val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
skalberg@15531
   672
        in SOME (gr'', mk_app brack (Pretty.str (s ^
berghofe@11520
   673
           (if i=0 then "" else string_of_int i))) ps)
berghofe@11520
   674
        end
berghofe@11520
   675
berghofe@14105
   676
    | Free (s, T) =>
berghofe@14105
   677
        let
berghofe@14105
   678
          val (gr', ps) = codegens true (gr, ts);
berghofe@17144
   679
          val (gr'', _) = invoke_tycodegen thy defs dep module false (gr', T)
skalberg@15531
   680
        in SOME (gr'', mk_app brack (Pretty.str s) ps) end
berghofe@11520
   681
berghofe@11520
   682
    | Const (s, T) =>
berghofe@11520
   683
      (case get_assoc_code thy s T of
berghofe@16769
   684
         SOME (ms, aux) =>
berghofe@11520
   685
           let val i = num_args ms
berghofe@11520
   686
           in if length ts < i then
berghofe@17144
   687
               default_codegen thy defs gr dep module brack (eta_expand u ts i)
berghofe@11520
   688
             else
berghofe@11520
   689
               let
berghofe@12452
   690
                 val (ts1, ts2) = args_of ms ts;
berghofe@12452
   691
                 val (gr1, ps1) = codegens false (gr, ts1);
berghofe@12452
   692
                 val (gr2, ps2) = codegens true (gr1, ts2);
berghofe@12452
   693
                 val (gr3, ps3) = codegens false (gr2, quotes_of ms);
berghofe@17549
   694
                 val (gr4, _) = invoke_tycodegen thy defs dep module false
berghofe@17549
   695
                   (gr3, funpow (length ts) (hd o tl o snd o dest_Type) T);
berghofe@17144
   696
                 val (module', suffix) = (case get_defn thy defs s T of
berghofe@17144
   697
                     NONE => (if_library (thyname_of_const s thy) module, "")
berghofe@17144
   698
                   | SOME ((U, (module', _)), NONE) =>
berghofe@17144
   699
                       (if_library module' module, "")
berghofe@17144
   700
                   | SOME ((U, (module', _)), SOME i) =>
berghofe@17144
   701
                       (if_library module' module, " def" ^ string_of_int i));
berghofe@16769
   702
                 val node_id = s ^ suffix;
berghofe@17144
   703
                 fun p module' = mk_app brack (Pretty.block
berghofe@17144
   704
                   (pretty_mixfix module module' ms ps1 ps3)) ps2
berghofe@17549
   705
               in SOME (case try (get_node gr4) node_id of
berghofe@16769
   706
                   NONE => (case get_aux_code aux of
berghofe@17549
   707
                       [] => (gr4, p module)
berghofe@17144
   708
                     | xs => (add_edge (node_id, dep) (new_node
berghofe@17549
   709
                         (node_id, (NONE, module', space_implode "\n" xs ^ "\n")) gr4),
berghofe@17144
   710
                           p module'))
berghofe@17144
   711
                 | SOME (_, module'', _) =>
berghofe@17549
   712
                     (add_edge (node_id, dep) gr4, p module''))
berghofe@11520
   713
               end
berghofe@11520
   714
           end
berghofe@16649
   715
       | NONE => (case get_defn thy defs s T of
skalberg@15531
   716
           NONE => NONE
berghofe@17144
   717
         | SOME ((U, (thyname, (args, rhs))), k) =>
berghofe@11520
   718
             let
berghofe@17144
   719
               val module' = if_library thyname module;
berghofe@17144
   720
               val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
berghofe@16649
   721
               val node_id = s ^ suffix;
berghofe@17144
   722
               val (gr', (ps, def_id)) = codegens true (gr, ts) |>>>
berghofe@17144
   723
                 mk_const_id module' (s ^ suffix);
berghofe@17144
   724
               val p = mk_app brack (Pretty.str (mk_qual_id module def_id)) ps
berghofe@17144
   725
             in SOME (case try (get_node gr') node_id of
berghofe@17144
   726
                 NONE =>
berghofe@17144
   727
                   let
berghofe@17144
   728
                     val _ = message ("expanding definition of " ^ s);
berghofe@17144
   729
                     val (Ts, _) = strip_type T;
berghofe@17144
   730
                     val (args', rhs') =
berghofe@17144
   731
                       if not (null args) orelse null Ts then (args, rhs) else
berghofe@17144
   732
                         let val v = Free (new_name rhs "x", hd Ts)
berghofe@17144
   733
                         in ([v], betapply (rhs, v)) end;
berghofe@17144
   734
                     val (gr1, p') = invoke_codegen thy defs node_id module' false
berghofe@17144
   735
                       (add_edge (node_id, dep)
berghofe@17144
   736
                          (new_node (node_id, (NONE, "", "")) gr'), rhs');
berghofe@17144
   737
                     val (gr2, xs) = codegens false (gr1, args');
berghofe@17144
   738
                     val (gr3, _) = invoke_tycodegen thy defs dep module false (gr2, T);
berghofe@17144
   739
                     val (gr4, ty) = invoke_tycodegen thy defs node_id module' false (gr3, U);
berghofe@17144
   740
                   in (map_node node_id (K (NONE, module', Pretty.string_of
berghofe@17144
   741
                       (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   742
                         (if null args' then
berghofe@17144
   743
                            [Pretty.str ("val " ^ snd def_id ^ " :"), ty]
berghofe@17144
   744
                          else Pretty.str ("fun " ^ snd def_id) :: xs) @
berghofe@17144
   745
                        [Pretty.str " =", Pretty.brk 1, p', Pretty.str ";"])) ^ "\n\n")) gr4,
berghofe@17144
   746
                     p)
berghofe@17144
   747
                   end
berghofe@17144
   748
               | SOME _ => (add_edge (node_id, dep) gr', p))
berghofe@11520
   749
             end))
berghofe@11520
   750
berghofe@11520
   751
    | Abs _ =>
berghofe@11520
   752
      let
berghofe@11520
   753
        val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
berghofe@11520
   754
        val t = strip_abs_body u
berghofe@11520
   755
        val bs' = new_names t bs;
berghofe@12452
   756
        val (gr1, ps) = codegens true (gr, ts);
berghofe@17144
   757
        val (gr2, p) = invoke_codegen thy defs dep module false
berghofe@12452
   758
          (gr1, subst_bounds (map Free (rev (bs' ~~ Ts)), t));
berghofe@11520
   759
      in
skalberg@15531
   760
        SOME (gr2, mk_app brack (Pretty.block (Pretty.str "(" :: pretty_fn bs' p @
berghofe@11520
   761
          [Pretty.str ")"])) ps)
berghofe@11520
   762
      end
berghofe@11520
   763
skalberg@15531
   764
    | _ => NONE)
berghofe@11520
   765
  end;
berghofe@11520
   766
berghofe@17144
   767
fun default_tycodegen thy defs gr dep module brack (TVar ((s, i), _)) =
skalberg@15531
   768
      SOME (gr, Pretty.str (s ^ (if i = 0 then "" else string_of_int i)))
berghofe@17144
   769
  | default_tycodegen thy defs gr dep module brack (TFree (s, _)) =
berghofe@16649
   770
      SOME (gr, Pretty.str s)
berghofe@17144
   771
  | default_tycodegen thy defs gr dep module brack (Type (s, Ts)) =
haftmann@17521
   772
      (case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
skalberg@15531
   773
         NONE => NONE
berghofe@16769
   774
       | SOME (ms, aux) =>
berghofe@12452
   775
           let
berghofe@12452
   776
             val (gr', ps) = foldl_map
berghofe@17144
   777
               (invoke_tycodegen thy defs dep module false)
berghofe@16649
   778
               (gr, fst (args_of ms Ts));
berghofe@12452
   779
             val (gr'', qs) = foldl_map
berghofe@17144
   780
               (invoke_tycodegen thy defs dep module false)
berghofe@16769
   781
               (gr', quotes_of ms);
berghofe@17144
   782
             val module' = if_library (thyname_of_type s thy) module;
berghofe@16769
   783
             val node_id = s ^ " (type)";
berghofe@17144
   784
             fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
berghofe@17144
   785
           in SOME (case try (get_node gr'') node_id of
berghofe@16769
   786
               NONE => (case get_aux_code aux of
berghofe@17144
   787
                   [] => (gr'', p module')
berghofe@17144
   788
                 | xs => (fst (mk_type_id module' s
berghofe@17144
   789
                       (add_edge (node_id, dep) (new_node (node_id,
berghofe@17144
   790
                         (NONE, module', space_implode "\n" xs ^ "\n")) gr''))),
berghofe@17144
   791
                     p module'))
berghofe@17144
   792
             | SOME (_, module'', _) =>
berghofe@17144
   793
                 (add_edge (node_id, dep) gr'', p module''))
berghofe@16769
   794
           end);
berghofe@12452
   795
wenzelm@15801
   796
val _ = Context.add_setup
wenzelm@15801
   797
 [add_codegen "default" default_codegen,
wenzelm@15801
   798
  add_tycodegen "default" default_tycodegen];
wenzelm@15801
   799
berghofe@11520
   800
berghofe@16649
   801
fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
berghofe@16649
   802
haftmann@17521
   803
fun add_to_module name s = AList.map_entry (op =) name (suffix s);
berghofe@16649
   804
berghofe@17144
   805
fun output_code gr module xs =
berghofe@16649
   806
  let
berghofe@17144
   807
    val code = List.mapPartial (fn s =>
berghofe@17144
   808
      let val c as (_, module', _) = Graph.get_node gr s
berghofe@17144
   809
      in if module = "" orelse module = module' then SOME (s, c) else NONE end)
berghofe@17144
   810
        (rev (Graph.all_preds gr xs));
berghofe@16649
   811
    fun string_of_cycle (a :: b :: cs) =
berghofe@16649
   812
          let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
berghofe@16649
   813
            if a = a' then Option.map (pair x)
berghofe@16649
   814
              (find_first (equal b o #2 o Graph.get_node gr)
berghofe@16649
   815
                (Graph.imm_succs gr x))
berghofe@16649
   816
            else NONE) code
berghofe@16649
   817
          in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
berghofe@16649
   818
      | string_of_cycle _ = ""
berghofe@16649
   819
  in
berghofe@17144
   820
    if module = "" then
berghofe@16649
   821
      let
berghofe@16649
   822
        val modules = distinct (map (#2 o snd) code);
berghofe@16649
   823
        val mod_gr = foldr (uncurry Graph.add_edge_acyclic)
berghofe@16649
   824
          (foldr (uncurry (Graph.new_node o rpair ())) Graph.empty modules)
berghofe@17144
   825
          (List.concat (map (fn (s, (_, module, _)) => map (pair module)
berghofe@17144
   826
            (filter_out (equal module) (map (#2 o Graph.get_node gr)
berghofe@16649
   827
              (Graph.imm_succs gr s)))) code));
berghofe@16649
   828
        val modules' =
berghofe@16649
   829
          rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
berghofe@16649
   830
      in
berghofe@17144
   831
        foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
berghofe@16649
   832
          (map (rpair "") modules') code
berghofe@16649
   833
      end handle Graph.CYCLES (cs :: _) =>
berghofe@16649
   834
        error ("Cyclic dependency of modules:\n" ^ commas cs ^
berghofe@16649
   835
          "\n" ^ string_of_cycle cs)
berghofe@17144
   836
    else [(module, implode (map (#3 o snd) code))]
berghofe@16649
   837
  end;
berghofe@11520
   838
berghofe@17144
   839
fun gen_generate_code prep_term thy modules module =
berghofe@14598
   840
  setmp print_mode [] (Pretty.setmp_margin (!margin) (fn xs =>
berghofe@11520
   841
  let
berghofe@17144
   842
    val _ = assert (module <> "" orelse
berghofe@17144
   843
        "library" mem !mode andalso forall (equal "" o fst) xs)
berghofe@17144
   844
      "missing module name";
berghofe@17144
   845
    val graphs = get_modules thy;
berghofe@16649
   846
    val defs = mk_deftab thy;
berghofe@17144
   847
    val gr = new_node ("<Top>", (NONE, module, ""))
berghofe@17144
   848
      (foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
berghofe@17144
   849
        (Graph.merge (fn ((_, module, _), (_, module', _)) =>
berghofe@17144
   850
           module = module') (gr, gr'),
berghofe@17144
   851
         (merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
wenzelm@17412
   852
           (map (fn s => case Symtab.lookup graphs s of
berghofe@17144
   853
                NONE => error ("Undefined code module: " ^ s)
berghofe@17144
   854
              | SOME gr => gr) modules))
berghofe@17144
   855
      handle Graph.DUPS ks => error ("Duplicate code for " ^ commas ks);
berghofe@16649
   856
    fun expand (t as Abs _) = t
berghofe@16649
   857
      | expand t = (case fastype_of t of
berghofe@16649
   858
          Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
berghofe@11520
   859
    val (gr', ps) = foldl_map (fn (gr, (s, t)) => apsnd (pair s)
berghofe@17144
   860
      (invoke_codegen thy defs "<Top>" module false (gr, t)))
berghofe@17549
   861
        (gr, map (apsnd (expand o preprocess_term thy o prep_term thy)) xs);
berghofe@17144
   862
    val code = List.mapPartial
berghofe@17144
   863
      (fn ("", _) => NONE
berghofe@17144
   864
        | (s', p) => SOME (Pretty.string_of (Pretty.block
berghofe@17144
   865
          [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1, p, Pretty.str ";"]))) ps;
berghofe@17144
   866
    val code' = space_implode "\n\n" code ^ "\n\n";
berghofe@17144
   867
    val code'' =
berghofe@17144
   868
      List.mapPartial (fn (name, s) =>
berghofe@17144
   869
          if "library" mem !mode andalso name = module andalso null code
berghofe@17144
   870
          then NONE
berghofe@17144
   871
          else SOME (name, mk_struct name s))
berghofe@17144
   872
        ((if null code then I
berghofe@17144
   873
          else add_to_module module code')
berghofe@17144
   874
           (output_code (fst gr') (if_library "" module) ["<Top>"]))
berghofe@16649
   875
  in
berghofe@17144
   876
    (code'', del_nodes ["<Top>"] gr')
berghofe@16649
   877
  end));
berghofe@11520
   878
berghofe@11520
   879
val generate_code_i = gen_generate_code (K I);
berghofe@11520
   880
val generate_code = gen_generate_code
wenzelm@16458
   881
  (fn thy => term_of o read_cterm thy o rpair TypeInfer.logicT);
berghofe@11520
   882
berghofe@12452
   883
berghofe@13753
   884
(**** Reflection ****)
berghofe@13753
   885
berghofe@13753
   886
val strip_tname = implode o tl o explode;
berghofe@13753
   887
berghofe@13753
   888
fun pretty_list xs = Pretty.block (Pretty.str "[" ::
skalberg@15570
   889
  List.concat (separate [Pretty.str ",", Pretty.brk 1] (map single xs)) @
berghofe@13753
   890
  [Pretty.str "]"]);
berghofe@13753
   891
berghofe@13753
   892
fun mk_type p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   893
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
berghofe@13753
   894
  | mk_type p (TFree (s, _)) = Pretty.str (strip_tname s ^ "T")
berghofe@13753
   895
  | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@13753
   896
      [Pretty.str "Type", Pretty.brk 1, Pretty.str ("(\"" ^ s ^ "\","),
berghofe@13753
   897
       Pretty.brk 1, pretty_list (map (mk_type false) Ts), Pretty.str ")"]);
berghofe@13753
   898
berghofe@17144
   899
fun mk_term_of gr module p (TVar ((s, i), _)) = Pretty.str
berghofe@13753
   900
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
berghofe@17144
   901
  | mk_term_of gr module p (TFree (s, _)) = Pretty.str (strip_tname s ^ "F")
berghofe@17144
   902
  | mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
berghofe@16649
   903
      (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   904
        (Pretty.str (mk_qual_id module
berghofe@17144
   905
          (get_type_id' (fn s' => "term_of_" ^ s') s gr)) ::
berghofe@16649
   906
        List.concat (map (fn T =>
berghofe@17144
   907
          [mk_term_of gr module true T, mk_type true T]) Ts))));
berghofe@13753
   908
berghofe@13753
   909
berghofe@14105
   910
(**** Test data generators ****)
berghofe@14105
   911
berghofe@17144
   912
fun mk_gen gr module p xs a (TVar ((s, i), _)) = Pretty.str
berghofe@14105
   913
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
berghofe@17144
   914
  | mk_gen gr module p xs a (TFree (s, _)) = Pretty.str (strip_tname s ^ "G")
berghofe@17144
   915
  | mk_gen gr module p xs a (Type (s, Ts)) = (if p then parens else I)
berghofe@16649
   916
      (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   917
        (Pretty.str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') s gr) ^
berghofe@16649
   918
          (if s mem xs then "'" else "")) ::
berghofe@17144
   919
         map (mk_gen gr module true xs a) Ts @
berghofe@16649
   920
         (if s mem xs then [Pretty.str a] else []))));
berghofe@14105
   921
skalberg@15531
   922
val test_fn : (int -> (string * term) list option) ref = ref (fn _ => NONE);
berghofe@14105
   923
berghofe@17638
   924
fun test_term thy sz i t =
berghofe@14105
   925
  let
berghofe@14105
   926
    val _ = assert (null (term_tvars t) andalso null (term_tfrees t))
berghofe@14105
   927
      "Term to be tested contains type variables";
berghofe@14105
   928
    val _ = assert (null (term_vars t))
berghofe@14105
   929
      "Term to be tested contains schematic variables";
berghofe@14105
   930
    val frees = map dest_Free (term_frees t);
berghofe@17549
   931
    val frees' = frees ~~
berghofe@17549
   932
      map (fn i => "arg" ^ string_of_int i) (1 upto length frees);
berghofe@17144
   933
    val (code, gr) = setmp mode ["term_of", "test"]
berghofe@17144
   934
      (generate_code_i thy [] "Generated") [("testf", list_abs_free (frees, t))];
berghofe@17638
   935
    val s = setmp print_mode [] (fn () => "structure TestTerm =\nstruct\n\n" ^
berghofe@17144
   936
      space_implode "\n" (map snd code) ^
berghofe@16649
   937
      "\nopen Generated;\n\n" ^ Pretty.string_of
berghofe@14105
   938
        (Pretty.block [Pretty.str "val () = Codegen.test_fn :=",
berghofe@17549
   939
          Pretty.brk 1, Pretty.str ("(fn i =>"), Pretty.brk 1,
berghofe@14105
   940
          Pretty.blk (0, [Pretty.str "let", Pretty.brk 1,
berghofe@17549
   941
            Pretty.blk (0, separate Pretty.fbrk (map (fn ((s, T), s') =>
berghofe@17549
   942
              Pretty.block [Pretty.str ("val " ^ s' ^ " ="), Pretty.brk 1,
berghofe@17144
   943
              mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
berghofe@17549
   944
              Pretty.str "i;"]) frees')),
berghofe@14105
   945
            Pretty.brk 1, Pretty.str "in", Pretty.brk 1,
berghofe@14105
   946
            Pretty.block [Pretty.str "if ",
berghofe@17549
   947
              mk_app false (Pretty.str "testf") (map (Pretty.str o snd) frees'),
skalberg@15531
   948
              Pretty.brk 1, Pretty.str "then NONE",
berghofe@14105
   949
              Pretty.brk 1, Pretty.str "else ",
skalberg@15531
   950
              Pretty.block [Pretty.str "SOME ", Pretty.block (Pretty.str "[" ::
skalberg@15570
   951
                List.concat (separate [Pretty.str ",", Pretty.brk 1]
berghofe@17549
   952
                  (map (fn ((s, T), s') => [Pretty.block
berghofe@15326
   953
                    [Pretty.str ("(" ^ Library.quote (Symbol.escape s) ^ ","), Pretty.brk 1,
berghofe@17144
   954
                     mk_app false (mk_term_of gr "Generated" false T)
berghofe@17549
   955
                       [Pretty.str s'], Pretty.str ")"]]) frees')) @
berghofe@14105
   956
                  [Pretty.str "]"])]],
wenzelm@14980
   957
            Pretty.brk 1, Pretty.str "end"]), Pretty.str ");"]) ^
berghofe@17638
   958
      "\n\nend;\n") ();
berghofe@14105
   959
    val _ = use_text Context.ml_output false s;
skalberg@15531
   960
    fun iter f k = if k > i then NONE
berghofe@14135
   961
      else (case (f () handle Match =>
skalberg@15531
   962
          (warning "Exception Match raised in generated code"; NONE)) of
skalberg@15531
   963
        NONE => iter f (k+1) | SOME x => SOME x);
skalberg@15531
   964
    fun test k = if k > sz then NONE
berghofe@14105
   965
      else (priority ("Test data size: " ^ string_of_int k);
berghofe@14105
   966
        case iter (fn () => !test_fn k) 1 of
skalberg@15531
   967
          NONE => test (k+1) | SOME x => SOME x);
berghofe@17638
   968
  in test 0 end;
berghofe@14105
   969
berghofe@14105
   970
fun test_goal ({size, iterations, default_type}, tvinsts) i st =
berghofe@14105
   971
  let
wenzelm@16458
   972
    val thy = Toplevel.theory_of st;
berghofe@14105
   973
    fun strip (Const ("all", _) $ Abs (_, _, t)) = strip t
berghofe@14105
   974
      | strip t = t;
berghofe@14105
   975
    val (gi, frees) = Logic.goal_params
berghofe@14105
   976
      (prop_of (snd (snd (Proof.get_goal (Toplevel.proof_of st))))) i;
wenzelm@16458
   977
    val gi' = ObjectLogic.atomize_term thy (map_term_types
haftmann@17521
   978
      (map_type_tfree (fn p as (s, _) => getOpt (AList.lookup (op =) tvinsts s,
haftmann@17521
   979
        getOpt (default_type, TFree p)))) (subst_bounds (frees, strip gi)));
berghofe@14105
   980
  in case test_term (Toplevel.theory_of st) size iterations gi' of
skalberg@15531
   981
      NONE => writeln "No counterexamples found."
skalberg@15531
   982
    | SOME cex => writeln ("Counterexample found:\n" ^
berghofe@14105
   983
        Pretty.string_of (Pretty.chunks (map (fn (s, t) =>
berghofe@14105
   984
          Pretty.block [Pretty.str (s ^ " ="), Pretty.brk 1,
wenzelm@16458
   985
            Sign.pretty_term thy t]) cex)))
berghofe@14105
   986
  end;
berghofe@14105
   987
berghofe@14105
   988
berghofe@17549
   989
(**** Evaluator for terms ****)
berghofe@17549
   990
berghofe@17549
   991
val eval_result = ref (Bound 0);
berghofe@17549
   992
berghofe@17549
   993
fun eval_term thy = setmp print_mode [] (fn t =>
berghofe@17549
   994
  let
berghofe@17549
   995
    val _ = assert (null (term_tvars t) andalso null (term_tfrees t))
berghofe@17549
   996
      "Term to be evaluated contains type variables";
berghofe@17549
   997
    val _ = assert (null (term_vars t) andalso null (term_frees t))
berghofe@17549
   998
      "Term to be evaluated contains variables";
berghofe@17549
   999
    val (code, gr) = setmp mode ["term_of"]
berghofe@17549
  1000
      (generate_code_i thy [] "Generated") [("result", t)];
berghofe@17549
  1001
    val s = "structure EvalTerm =\nstruct\n\n" ^
berghofe@17549
  1002
      space_implode "\n" (map snd code) ^
berghofe@17549
  1003
      "\nopen Generated;\n\n" ^ Pretty.string_of
berghofe@17549
  1004
        (Pretty.block [Pretty.str "val () = Codegen.eval_result :=",
berghofe@17549
  1005
          Pretty.brk 1,
berghofe@17549
  1006
          mk_app false (mk_term_of gr "Generated" false (fastype_of t))
berghofe@17549
  1007
            [Pretty.str "result"],
berghofe@17549
  1008
          Pretty.str ";"])  ^
berghofe@17549
  1009
      "\n\nend;\n";
berghofe@17549
  1010
    val _ = use_text Context.ml_output false s
berghofe@17549
  1011
  in !eval_result end);
berghofe@17549
  1012
berghofe@17549
  1013
fun print_evaluated_term s = Toplevel.keep (fn state =>
berghofe@17549
  1014
  let
berghofe@17549
  1015
    val state' = Toplevel.enter_forward_proof state;
berghofe@17549
  1016
    val ctxt = Proof.context_of state';
berghofe@17549
  1017
    val t = eval_term (Proof.theory_of state') (ProofContext.read_term ctxt s);
berghofe@17549
  1018
    val T = Term.type_of t;
berghofe@17549
  1019
  in
berghofe@17549
  1020
    writeln (Pretty.string_of
berghofe@17549
  1021
      (Pretty.block [Pretty.quote (ProofContext.pretty_term ctxt t), Pretty.fbrk,
berghofe@17549
  1022
        Pretty.str "::", Pretty.brk 1, Pretty.quote (ProofContext.pretty_typ ctxt T)]))
berghofe@17549
  1023
  end);
berghofe@17549
  1024
berghofe@17549
  1025
berghofe@12452
  1026
(**** Interface ****)
berghofe@12452
  1027
berghofe@13731
  1028
val str = setmp print_mode [] Pretty.str;
berghofe@13731
  1029
berghofe@11520
  1030
fun parse_mixfix rd s =
berghofe@11520
  1031
  (case Scan.finite Symbol.stopper (Scan.repeat
berghofe@11520
  1032
     (   $$ "_" >> K Arg
berghofe@11520
  1033
      || $$ "?" >> K Ignore
berghofe@16769
  1034
      || $$ "\\<module>" >> K Module
berghofe@11520
  1035
      || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
berghofe@11520
  1036
      || $$ "{" |-- $$ "*" |-- Scan.repeat1
berghofe@11520
  1037
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@11520
  1038
            || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.not_eof)) --|
berghofe@12452
  1039
         $$ "*" --| $$ "}" >> (Quote o rd o implode)
berghofe@11520
  1040
      || Scan.repeat1
berghofe@11520
  1041
           (   $$ "'" |-- Scan.one Symbol.not_eof
berghofe@16769
  1042
            || Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
berghofe@13731
  1043
                 (Scan.one Symbol.not_eof)) >> (Pretty o str o implode)))
berghofe@11520
  1044
       (Symbol.explode s) of
berghofe@11520
  1045
     (p, []) => p
berghofe@11520
  1046
   | _ => error ("Malformed annotation: " ^ quote s));
berghofe@11520
  1047
wenzelm@15801
  1048
val _ = Context.add_setup
berghofe@16769
  1049
  [assoc_types [("fun", (parse_mixfix (K dummyT) "(_ ->/ _)",
berghofe@16769
  1050
     [("term_of",
berghofe@16769
  1051
       "fun term_of_fun_type _ T _ U _ = Free (\"<function>\", T --> U);\n"),
berghofe@16769
  1052
      ("test",
berghofe@16769
  1053
       "fun gen_fun_type _ G i =\n\
berghofe@16769
  1054
       \  let\n\
berghofe@16769
  1055
       \    val f = ref (fn x => raise ERROR);\n\
berghofe@16769
  1056
       \    val _ = (f := (fn x =>\n\
berghofe@16769
  1057
       \      let\n\
berghofe@16769
  1058
       \        val y = G i;\n\
berghofe@16769
  1059
       \        val f' = !f\n\
berghofe@16769
  1060
       \      in (f := (fn x' => if x = x' then y else f' x'); y) end))\n\
berghofe@16769
  1061
       \  in (fn x => !f x) end;\n")]))]];
wenzelm@15801
  1062
wenzelm@15801
  1063
wenzelm@17057
  1064
structure P = OuterParse and K = OuterKeyword;
berghofe@11520
  1065
berghofe@17144
  1066
fun strip_whitespace s = implode (fst (take_suffix (equal "\n" orf equal " ")
berghofe@17144
  1067
  (snd (take_prefix (equal "\n" orf equal " ") (explode s))))) ^ "\n";
berghofe@16769
  1068
berghofe@16769
  1069
val parse_attach = Scan.repeat (P.$$$ "attach" |--
berghofe@16769
  1070
  Scan.optional (P.$$$ "(" |-- P.xname --| P.$$$ ")") "" --
berghofe@17144
  1071
    (P.verbatim >> strip_whitespace));
berghofe@16769
  1072
berghofe@11520
  1073
val assoc_typeP =
berghofe@11520
  1074
  OuterSyntax.command "types_code"
wenzelm@11546
  1075
  "associate types with target language types" K.thy_decl
berghofe@16769
  1076
    (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
berghofe@12452
  1077
     (fn xs => Toplevel.theory (fn thy => assoc_types
berghofe@16769
  1078
       (map (fn ((name, mfx), aux) => (name, (parse_mixfix
berghofe@16769
  1079
         (typ_of o read_ctyp thy) mfx, aux))) xs) thy)));
berghofe@11520
  1080
berghofe@11520
  1081
val assoc_constP =
berghofe@11520
  1082
  OuterSyntax.command "consts_code"
wenzelm@11546
  1083
  "associate constants with target language code" K.thy_decl
berghofe@11520
  1084
    (Scan.repeat1
wenzelm@13003
  1085
       (P.xname -- (Scan.option (P.$$$ "::" |-- P.typ)) --|
berghofe@16769
  1086
        P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
berghofe@11520
  1087
     (fn xs => Toplevel.theory (fn thy => assoc_consts
berghofe@16769
  1088
       (map (fn (((name, optype), mfx), aux) => (name, optype, (parse_mixfix
berghofe@16769
  1089
         (term_of o read_cterm thy o rpair TypeInfer.logicT) mfx, aux)))
berghofe@11520
  1090
           xs) thy)));
berghofe@11520
  1091
berghofe@17144
  1092
fun parse_code lib =
berghofe@17144
  1093
  Scan.optional (P.$$$ "(" |-- P.enum "," P.xname --| P.$$$ ")") (!mode) --
berghofe@17144
  1094
  (if lib then Scan.optional P.name "" else P.name) --
berghofe@17144
  1095
  Scan.option (P.$$$ "file" |-- P.name) --
berghofe@17144
  1096
  (if lib then Scan.succeed []
berghofe@17144
  1097
   else Scan.optional (P.$$$ "imports" |-- Scan.repeat1 P.name) []) --|
berghofe@17144
  1098
  P.$$$ "contains" --
berghofe@17144
  1099
  (   Scan.repeat1 (P.name --| P.$$$ "=" -- P.term)
berghofe@17144
  1100
   || Scan.repeat1 (P.term >> pair "")) >>
berghofe@17144
  1101
  (fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
berghofe@17144
  1102
     let
berghofe@17144
  1103
       val mode'' = if lib then "library" ins (mode' \ "library")
berghofe@17144
  1104
         else mode' \ "library";
berghofe@17144
  1105
       val (code, gr) = setmp mode mode'' (generate_code thy modules module) xs
berghofe@17144
  1106
     in ((case opt_fname of
berghofe@17144
  1107
         NONE => use_text Context.ml_output false
berghofe@17144
  1108
           (space_implode "\n" (map snd code))
berghofe@17144
  1109
       | SOME fname =>
berghofe@17144
  1110
           if lib then
berghofe@17144
  1111
             app (fn (name, s) => File.write
berghofe@17144
  1112
                 (Path.append (Path.unpack fname) (Path.basic (name ^ ".ML"))) s)
berghofe@17144
  1113
               (("ROOT", implode (map (fn (name, _) =>
berghofe@17144
  1114
                   "use \"" ^ name ^ ".ML\";\n") code)) :: code)
berghofe@17144
  1115
           else File.write (Path.unpack fname) (snd (hd code)));
berghofe@17144
  1116
           if lib then thy
wenzelm@17412
  1117
           else map_modules (Symtab.update (module, gr)) thy)
berghofe@17144
  1118
     end));
berghofe@17144
  1119
berghofe@17144
  1120
val code_libraryP =
berghofe@17144
  1121
  OuterSyntax.command "code_library"
berghofe@17144
  1122
    "generates code for terms (one structure for each theory)" K.thy_decl
berghofe@17144
  1123
    (parse_code true);
berghofe@17144
  1124
berghofe@17144
  1125
val code_moduleP =
berghofe@17144
  1126
  OuterSyntax.command "code_module"
berghofe@17144
  1127
    "generates code for terms (single structure, incremental)" K.thy_decl
berghofe@17144
  1128
    (parse_code false);
berghofe@11520
  1129
berghofe@14105
  1130
val params =
berghofe@14105
  1131
  [("size", P.nat >> (K o set_size)),
berghofe@14105
  1132
   ("iterations", P.nat >> (K o set_iterations)),
berghofe@14105
  1133
   ("default_type", P.typ >> set_default_type)];
berghofe@14105
  1134
berghofe@14105
  1135
val parse_test_params = P.short_ident :-- (fn s =>
haftmann@17521
  1136
  P.$$$ "=" |-- (AList.lookup (op =) params s |> the_default Scan.fail)) >> snd;
berghofe@14105
  1137
berghofe@14105
  1138
fun parse_tyinst xs =
wenzelm@16458
  1139
  (P.type_ident --| P.$$$ "=" -- P.typ >> (fn (v, s) => fn thy =>
wenzelm@16458
  1140
    fn (x, ys) => (x, (v, typ_of (read_ctyp thy s)) :: ys))) xs;
berghofe@14105
  1141
berghofe@14105
  1142
fun app [] x = x
berghofe@14105
  1143
  | app (f :: fs) x = app fs (f x);
berghofe@14105
  1144
berghofe@14105
  1145
val test_paramsP =
berghofe@14105
  1146
  OuterSyntax.command "quickcheck_params" "set parameters for random testing" K.thy_decl
berghofe@14105
  1147
    (P.$$$ "[" |-- P.list1 parse_test_params --| P.$$$ "]" >>
berghofe@14105
  1148
      (fn fs => Toplevel.theory (fn thy =>
berghofe@16649
  1149
         map_test_params (app (map (fn f => f thy) fs)) thy)));
berghofe@14105
  1150
berghofe@14105
  1151
val testP =
berghofe@14105
  1152
  OuterSyntax.command "quickcheck" "try to find counterexample for subgoal" K.diag
berghofe@14105
  1153
  (Scan.option (P.$$$ "[" |-- P.list1
wenzelm@16458
  1154
    (   parse_test_params >> (fn f => fn thy => apfst (f thy))
berghofe@14105
  1155
     || parse_tyinst) --| P.$$$ "]") -- Scan.optional P.nat 1 >>
berghofe@14105
  1156
    (fn (ps, g) => Toplevel.keep (fn st =>
skalberg@15570
  1157
      test_goal (app (getOpt (Option.map
skalberg@15570
  1158
          (map (fn f => f (Toplevel.sign_of st))) ps, []))
berghofe@14105
  1159
        (get_test_params (Toplevel.theory_of st), [])) g st)));
berghofe@14105
  1160
berghofe@17549
  1161
val valueP =
berghofe@17549
  1162
  OuterSyntax.improper_command "value" "read, evaluate and print term" K.diag
berghofe@17549
  1163
    (P.term >> (Toplevel.no_timing oo print_evaluated_term));
berghofe@17549
  1164
berghofe@17144
  1165
val _ = OuterSyntax.add_keywords ["attach", "file", "contains"];
berghofe@16769
  1166
wenzelm@15801
  1167
val _ = OuterSyntax.add_parsers
berghofe@17549
  1168
  [assoc_typeP, assoc_constP, code_libraryP, code_moduleP, test_paramsP, testP, valueP];
berghofe@11520
  1169
berghofe@11520
  1170
end;