src/Pure/codegen.ML
author haftmann
Tue Nov 24 17:28:25 2009 +0100 (2009-11-24)
changeset 33955 fff6f11b1f09
parent 33522 737589bb9bb8
child 33957 e9afca2118d4
permissions -rw-r--r--
curried take/drop
berghofe@11520
     1
(*  Title:      Pure/codegen.ML
wenzelm@11539
     2
    Author:     Stefan Berghofer, TU Muenchen
berghofe@11520
     3
wenzelm@11539
     4
Generic code generator.
berghofe@11520
     5
*)
berghofe@11520
     6
berghofe@11520
     7
signature CODEGEN =
berghofe@11520
     8
sig
wenzelm@32738
     9
  val quiet_mode : bool Unsynchronized.ref
berghofe@11520
    10
  val message : string -> unit
wenzelm@32738
    11
  val mode : string list Unsynchronized.ref
wenzelm@32738
    12
  val margin : int Unsynchronized.ref
berghofe@26974
    13
  val string_of : Pretty.T -> string
berghofe@26974
    14
  val str : string -> Pretty.T
berghofe@11520
    15
berghofe@12452
    16
  datatype 'a mixfix =
berghofe@11520
    17
      Arg
berghofe@11520
    18
    | Ignore
berghofe@16769
    19
    | Module
berghofe@11520
    20
    | Pretty of Pretty.T
berghofe@12452
    21
    | Quote of 'a;
berghofe@11520
    22
berghofe@16649
    23
  type deftab
berghofe@17144
    24
  type node
berghofe@16649
    25
  type codegr
berghofe@12452
    26
  type 'a codegen
berghofe@12452
    27
berghofe@12452
    28
  val add_codegen: string -> term codegen -> theory -> theory
berghofe@12452
    29
  val add_tycodegen: string -> typ codegen -> 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
haftmann@22921
    38
  val assoc_const: string * (term mixfix list *
haftmann@22921
    39
    (string * string) list) -> theory -> theory
haftmann@22921
    40
  val assoc_const_i: (string * typ) * (term mixfix list *
haftmann@22921
    41
    (string * string) list) -> theory -> theory
haftmann@22921
    42
  val assoc_type: xstring * (typ mixfix list *
haftmann@22921
    43
    (string * string) list) -> theory -> theory
haftmann@22921
    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 ->
haftmann@28537
    50
    term -> codegr -> Pretty.T * codegr
berghofe@16649
    51
  val invoke_tycodegen: theory -> deftab -> string -> string -> bool ->
haftmann@28537
    52
    typ -> codegr -> Pretty.T * codegr
berghofe@14858
    53
  val mk_id: string -> string
berghofe@17144
    54
  val mk_qual_id: string -> string * string -> string
haftmann@28537
    55
  val mk_const_id: string -> string -> codegr -> (string * string) * codegr
haftmann@28537
    56
  val get_const_id: codegr -> string -> string * string
haftmann@28537
    57
  val mk_type_id: string -> string -> codegr -> (string * string) * codegr
haftmann@28537
    58
  val get_type_id: codegr -> string -> string * string
haftmann@27398
    59
  val thyname_of_type: theory -> string -> string
haftmann@27398
    60
  val thyname_of_const: theory -> string -> 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 ->
haftmann@32085
    67
    ((typ * (string * thm)) * int option) option
wenzelm@24908
    68
  val is_instance: 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@25892
    71
  val mk_tuple: Pretty.T list -> Pretty.T
berghofe@25892
    72
  val mk_let: (Pretty.T * Pretty.T) list -> Pretty.T -> Pretty.T
berghofe@11520
    73
  val eta_expand: term -> term list -> int -> term
berghofe@14105
    74
  val strip_tname: string -> string
berghofe@13753
    75
  val mk_type: bool -> typ -> Pretty.T
berghofe@17144
    76
  val mk_term_of: codegr -> string -> bool -> typ -> Pretty.T
berghofe@17144
    77
  val mk_gen: codegr -> string -> bool -> string list -> string -> typ -> Pretty.T
wenzelm@32738
    78
  val test_fn: (int -> term list option) Unsynchronized.ref
haftmann@28315
    79
  val test_term: Proof.context -> term -> int -> term list option
wenzelm@32738
    80
  val eval_result: (unit -> term) Unsynchronized.ref
berghofe@17549
    81
  val eval_term: theory -> term -> term
haftmann@20599
    82
  val evaluation_conv: cterm -> thm
berghofe@12452
    83
  val parse_mixfix: (string -> 'a) -> string -> 'a mixfix list
haftmann@18102
    84
  val quotes_of: 'a mixfix list -> 'a list
haftmann@18281
    85
  val num_args_of: 'a mixfix list -> int
haftmann@18102
    86
  val replace_quotes: 'b list -> 'a mixfix list -> 'b mixfix list
berghofe@16649
    87
  val mk_deftab: theory -> deftab
haftmann@32071
    88
  val map_unfold: (simpset -> simpset) -> theory -> theory
haftmann@19341
    89
  val add_unfold: thm -> theory -> theory
haftmann@32071
    90
  val del_unfold: thm -> theory -> theory
berghofe@17549
    91
berghofe@17144
    92
  val get_node: codegr -> string -> node
berghofe@17144
    93
  val add_edge: string * string -> codegr -> codegr
berghofe@17144
    94
  val add_edge_acyclic: string * string -> codegr -> codegr
berghofe@17144
    95
  val del_nodes: string list -> codegr -> codegr
berghofe@17144
    96
  val map_node: string -> (node -> node) -> codegr -> codegr
berghofe@17144
    97
  val new_node: string * node -> codegr -> codegr
haftmann@28227
    98
haftmann@28227
    99
  val setup: theory -> theory
berghofe@11520
   100
end;
berghofe@11520
   101
berghofe@11520
   102
structure Codegen : CODEGEN =
berghofe@11520
   103
struct
berghofe@11520
   104
wenzelm@32738
   105
val quiet_mode = Unsynchronized.ref true;
berghofe@11520
   106
fun message s = if !quiet_mode then () else writeln s;
berghofe@11520
   107
wenzelm@33222
   108
val mode = Unsynchronized.ref ([] : string list);   (* FIXME proper functional argument *)
berghofe@13753
   109
wenzelm@32738
   110
val margin = Unsynchronized.ref 80;
berghofe@13886
   111
berghofe@26974
   112
fun string_of p = (Pretty.string_of |>
berghofe@26974
   113
  PrintMode.setmp [] |>
wenzelm@32966
   114
  Pretty.setmp_margin_CRITICAL (!margin)) p;
berghofe@26974
   115
berghofe@26974
   116
val str = PrintMode.setmp [] Pretty.str;
berghofe@26974
   117
berghofe@11520
   118
(**** Mixfix syntax ****)
berghofe@11520
   119
berghofe@12452
   120
datatype 'a mixfix =
berghofe@11520
   121
    Arg
berghofe@11520
   122
  | Ignore
berghofe@16769
   123
  | Module
berghofe@11520
   124
  | Pretty of Pretty.T
berghofe@12452
   125
  | Quote of 'a;
berghofe@11520
   126
berghofe@11520
   127
fun is_arg Arg = true
berghofe@11520
   128
  | is_arg Ignore = true
berghofe@11520
   129
  | is_arg _ = false;
berghofe@11520
   130
berghofe@12452
   131
fun quotes_of [] = []
berghofe@12452
   132
  | quotes_of (Quote q :: ms) = q :: quotes_of ms
berghofe@12452
   133
  | quotes_of (_ :: ms) = quotes_of ms;
berghofe@12452
   134
berghofe@12452
   135
fun args_of [] xs = ([], xs)
berghofe@12452
   136
  | args_of (Arg :: ms) (x :: xs) = apfst (cons x) (args_of ms xs)
berghofe@12452
   137
  | args_of (Ignore :: ms) (_ :: xs) = args_of ms xs
berghofe@12452
   138
  | args_of (_ :: ms) xs = args_of ms xs;
berghofe@11520
   139
wenzelm@33317
   140
fun num_args_of x = length (filter is_arg x);
berghofe@11520
   141
berghofe@11520
   142
berghofe@11520
   143
(**** theory data ****)
berghofe@11520
   144
berghofe@16649
   145
(* preprocessed definition table *)
berghofe@16649
   146
berghofe@16649
   147
type deftab =
berghofe@16649
   148
  (typ *              (* type of constant *)
berghofe@16649
   149
    (string *         (* name of theory containing definition of constant *)
haftmann@32085
   150
      thm))           (* definition theorem *)
berghofe@16649
   151
  list Symtab.table;
berghofe@16649
   152
berghofe@16649
   153
(* code dependency graph *)
berghofe@16649
   154
berghofe@17144
   155
type nametab = (string * string) Symtab.table * unit Symtab.table;
berghofe@17144
   156
haftmann@28227
   157
fun merge_nametabs ((tab, used) : nametab, (tab', used')) =
berghofe@17144
   158
  (Symtab.merge op = (tab, tab'), Symtab.merge op = (used, used'));
berghofe@17144
   159
berghofe@17144
   160
type node =
berghofe@16649
   161
  (exn option *    (* slot for arbitrary data *)
berghofe@16649
   162
   string *        (* name of structure containing piece of code *)
berghofe@17144
   163
   string);        (* piece of code *)
berghofe@17144
   164
berghofe@17144
   165
type codegr =
berghofe@17144
   166
  node Graph.T *
berghofe@17144
   167
  (nametab *       (* table for assigned constant names *)
berghofe@17144
   168
   nametab);       (* table for assigned type names *)
berghofe@17144
   169
berghofe@17144
   170
val emptygr : codegr = (Graph.empty,
berghofe@17144
   171
  ((Symtab.empty, Symtab.empty), (Symtab.empty, Symtab.empty)));
berghofe@16649
   172
berghofe@14105
   173
(* type of code generators *)
berghofe@11520
   174
berghofe@16649
   175
type 'a codegen =
berghofe@16649
   176
  theory ->    (* theory in which generate_code was called *)
berghofe@16649
   177
  deftab ->    (* definition table (for efficiency) *)
berghofe@16649
   178
  string ->    (* node name of caller (for recording dependencies) *)
berghofe@17144
   179
  string ->    (* module name of caller (for modular code generation) *)
berghofe@16649
   180
  bool ->      (* whether to parenthesize generated expression *)
berghofe@16649
   181
  'a ->        (* item to generate code from *)
haftmann@28537
   182
  codegr ->    (* code dependency graph *)
haftmann@28537
   183
  (Pretty.T * codegr) option;
berghofe@12452
   184
wenzelm@22846
   185
wenzelm@22846
   186
(* theory data *)
wenzelm@16458
   187
wenzelm@33522
   188
structure CodegenData = Theory_Data
wenzelm@22846
   189
(
berghofe@11520
   190
  type T =
berghofe@12452
   191
    {codegens : (string * term codegen) list,
berghofe@12452
   192
     tycodegens : (string * typ codegen) list,
berghofe@16769
   193
     consts : ((string * typ) * (term mixfix list * (string * string) list)) list,
berghofe@16769
   194
     types : (string * (typ mixfix list * (string * string) list)) list,
berghofe@15261
   195
     preprocs: (stamp * (theory -> thm list -> thm list)) list,
berghofe@28640
   196
     modules: codegr Symtab.table};
berghofe@11520
   197
berghofe@12555
   198
  val empty =
haftmann@24219
   199
    {codegens = [], tycodegens = [], consts = [], types = [],
berghofe@28640
   200
     preprocs = [], modules = Symtab.empty};
wenzelm@16458
   201
  val extend = I;
berghofe@11520
   202
wenzelm@33522
   203
  fun merge
berghofe@12555
   204
    ({codegens = codegens1, tycodegens = tycodegens1,
haftmann@24219
   205
      consts = consts1, types = types1,
berghofe@28640
   206
      preprocs = preprocs1, modules = modules1} : T,
berghofe@12555
   207
     {codegens = codegens2, tycodegens = tycodegens2,
haftmann@24219
   208
      consts = consts2, types = types2,
wenzelm@33522
   209
      preprocs = preprocs2, modules = modules2}) : T =
haftmann@19119
   210
    {codegens = AList.merge (op =) (K true) (codegens1, codegens2),
haftmann@19119
   211
     tycodegens = AList.merge (op =) (K true) (tycodegens1, tycodegens2),
haftmann@21098
   212
     consts = AList.merge (op =) (K true) (consts1, consts2),
haftmann@21098
   213
     types = AList.merge (op =) (K true) (types1, types2),
haftmann@19119
   214
     preprocs = AList.merge (op =) (K true) (preprocs1, preprocs2),
berghofe@28640
   215
     modules = Symtab.merge (K true) (modules1, modules2)};
wenzelm@22846
   216
);
berghofe@11520
   217
wenzelm@22846
   218
fun print_codegens thy =
wenzelm@22846
   219
  let val {codegens, tycodegens, ...} = CodegenData.get thy in
berghofe@12452
   220
    Pretty.writeln (Pretty.chunks
berghofe@12452
   221
      [Pretty.strs ("term code generators:" :: map fst codegens),
wenzelm@22846
   222
       Pretty.strs ("type code generators:" :: map fst tycodegens)])
wenzelm@22846
   223
  end;
berghofe@11520
   224
berghofe@11520
   225
berghofe@11520
   226
berghofe@17144
   227
(**** access modules ****)
berghofe@17144
   228
berghofe@17144
   229
fun get_modules thy = #modules (CodegenData.get thy);
berghofe@17144
   230
berghofe@17144
   231
fun map_modules f thy =
berghofe@28640
   232
  let val {codegens, tycodegens, consts, types, preprocs, modules} =
berghofe@17144
   233
    CodegenData.get thy;
berghofe@17144
   234
  in CodegenData.put {codegens = codegens, tycodegens = tycodegens,
haftmann@24219
   235
    consts = consts, types = types, preprocs = preprocs,
berghofe@28640
   236
    modules = f modules} thy
berghofe@14105
   237
  end;
berghofe@14105
   238
berghofe@14105
   239
berghofe@12452
   240
(**** add new code generators to theory ****)
berghofe@11520
   241
berghofe@11520
   242
fun add_codegen name f thy =
berghofe@28640
   243
  let val {codegens, tycodegens, consts, types, preprocs, modules} =
berghofe@14105
   244
    CodegenData.get thy
haftmann@17521
   245
  in (case AList.lookup (op =) codegens name of
skalberg@15531
   246
      NONE => CodegenData.put {codegens = (name, f) :: codegens,
berghofe@12555
   247
        tycodegens = tycodegens, consts = consts, types = types,
berghofe@28640
   248
        preprocs = preprocs, modules = modules} thy
skalberg@15531
   249
    | SOME _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@12452
   250
  end;
berghofe@12452
   251
berghofe@12452
   252
fun add_tycodegen name f thy =
berghofe@28640
   253
  let val {codegens, tycodegens, consts, types, preprocs, modules} =
berghofe@14105
   254
    CodegenData.get thy
haftmann@17521
   255
  in (case AList.lookup (op =) tycodegens name of
skalberg@15531
   256
      NONE => CodegenData.put {tycodegens = (name, f) :: tycodegens,
berghofe@12555
   257
        codegens = codegens, consts = consts, types = types,
berghofe@28640
   258
        preprocs = preprocs, modules = modules} thy
skalberg@15531
   259
    | SOME _ => error ("Code generator " ^ name ^ " already declared"))
berghofe@11520
   260
  end;
berghofe@11520
   261
berghofe@11520
   262
berghofe@15261
   263
(**** preprocessors ****)
berghofe@15261
   264
berghofe@15261
   265
fun add_preprocessor p thy =
berghofe@28640
   266
  let val {codegens, tycodegens, consts, types, preprocs, modules} =
berghofe@15261
   267
    CodegenData.get thy
berghofe@15261
   268
  in CodegenData.put {tycodegens = tycodegens,
berghofe@15261
   269
    codegens = codegens, consts = consts, types = types,
haftmann@24219
   270
    preprocs = (stamp (), p) :: preprocs,
berghofe@28640
   271
    modules = modules} thy
berghofe@15261
   272
  end;
berghofe@15261
   273
haftmann@21836
   274
fun preprocess thy =
berghofe@15261
   275
  let val {preprocs, ...} = CodegenData.get thy
haftmann@21836
   276
  in fold (fn (_, f) => f thy) preprocs end;
berghofe@15261
   277
berghofe@17549
   278
fun preprocess_term thy t =
berghofe@17549
   279
  let
wenzelm@29270
   280
    val x = Free (Name.variant (OldTerm.add_term_names (t, [])) "x", fastype_of t);
berghofe@17549
   281
    (* fake definition *)
wenzelm@32970
   282
    val eq = Skip_Proof.make_thm thy (Logic.mk_equals (x, t));
berghofe@17549
   283
    fun err () = error "preprocess_term: bad preprocessor"
berghofe@17549
   284
  in case map prop_of (preprocess thy [eq]) of
berghofe@17549
   285
      [Const ("==", _) $ x' $ t'] => if x = x' then t' else err ()
berghofe@17549
   286
    | _ => err ()
berghofe@17549
   287
  end;
haftmann@18281
   288
wenzelm@33522
   289
structure UnfoldData = Theory_Data
berghofe@28640
   290
(
berghofe@28640
   291
  type T = simpset;
berghofe@28640
   292
  val empty = empty_ss;
berghofe@28640
   293
  val extend = I;
wenzelm@33522
   294
  val merge = merge_ss;
berghofe@28640
   295
);
berghofe@28640
   296
haftmann@32071
   297
val map_unfold = UnfoldData.map;
haftmann@32071
   298
val add_unfold = map_unfold o MetaSimplifier.add_simp;
haftmann@32071
   299
val del_unfold = map_unfold o MetaSimplifier.del_simp;
berghofe@28640
   300
berghofe@28640
   301
fun unfold_preprocessor thy =
berghofe@28640
   302
  let val ss = Simplifier.theory_context thy (UnfoldData.get thy)
berghofe@28640
   303
  in map (Thm.transfer thy #> Simplifier.full_simplify ss) end;
berghofe@15261
   304
berghofe@15261
   305
berghofe@11520
   306
(**** associate constants with target language code ****)
berghofe@11520
   307
haftmann@22921
   308
fun gen_assoc_const prep_const (raw_const, syn) thy =
berghofe@11520
   309
  let
berghofe@28640
   310
    val {codegens, tycodegens, consts, types, preprocs, modules} =
berghofe@14105
   311
      CodegenData.get thy;
haftmann@22921
   312
    val (cname, T) = prep_const thy raw_const;
berghofe@11520
   313
  in
haftmann@22921
   314
    if num_args_of (fst syn) > length (binder_types T) then
haftmann@22921
   315
      error ("More arguments than in corresponding type of " ^ cname)
haftmann@22921
   316
    else case AList.lookup (op =) consts (cname, T) of
haftmann@22921
   317
      NONE => CodegenData.put {codegens = codegens,
haftmann@22921
   318
        tycodegens = tycodegens,
haftmann@22921
   319
        consts = ((cname, T), syn) :: consts,
haftmann@24219
   320
        types = types, preprocs = preprocs,
berghofe@28640
   321
        modules = modules} thy
haftmann@22921
   322
    | SOME _ => error ("Constant " ^ cname ^ " already associated with code")
haftmann@22921
   323
  end;
berghofe@11520
   324
haftmann@22921
   325
val assoc_const_i = gen_assoc_const (K I);
haftmann@31153
   326
val assoc_const = gen_assoc_const Code.read_bare_const;
berghofe@11520
   327
wenzelm@15801
   328
berghofe@11520
   329
(**** associate types with target language types ****)
berghofe@11520
   330
haftmann@22921
   331
fun assoc_type (s, syn) thy =
berghofe@11520
   332
  let
berghofe@28640
   333
    val {codegens, tycodegens, consts, types, preprocs, modules} =
berghofe@14105
   334
      CodegenData.get thy;
haftmann@22921
   335
    val tc = Sign.intern_type thy s;
berghofe@11520
   336
  in
berghofe@18320
   337
    case Symtab.lookup (snd (#types (Type.rep_tsig (Sign.tsig_of thy)))) tc of
wenzelm@33173
   338
      SOME (Type.LogicalType i) =>
berghofe@18320
   339
        if num_args_of (fst syn) > i then
berghofe@18320
   340
          error ("More arguments than corresponding type constructor " ^ s)
wenzelm@33092
   341
        else
wenzelm@33092
   342
          (case AList.lookup (op =) types tc of
wenzelm@33092
   343
            NONE => CodegenData.put {codegens = codegens,
wenzelm@33092
   344
              tycodegens = tycodegens, consts = consts,
wenzelm@33092
   345
              types = (tc, syn) :: types,
wenzelm@33092
   346
              preprocs = preprocs, modules = modules} thy
wenzelm@33092
   347
          | SOME _ => error ("Type " ^ tc ^ " already associated with code"))
berghofe@18320
   348
    | _ => error ("Not a type constructor: " ^ s)
haftmann@22921
   349
  end;
berghofe@11520
   350
haftmann@21098
   351
fun get_assoc_type thy = AList.lookup (op =) ((#types o CodegenData.get) thy);
wenzelm@11546
   352
berghofe@11520
   353
berghofe@11520
   354
(**** make valid ML identifiers ****)
berghofe@11520
   355
berghofe@14858
   356
fun is_ascii_letdig x = Symbol.is_ascii_letter x orelse
berghofe@14858
   357
  Symbol.is_ascii_digit x orelse Symbol.is_ascii_quasi x;
berghofe@14858
   358
wenzelm@28375
   359
fun dest_sym s = (case split_last (snd (take_prefix (fn c => c = "\\") (explode s))) of
berghofe@14858
   360
    ("<" :: "^" :: xs, ">") => (true, implode xs)
berghofe@14858
   361
  | ("<" :: xs, ">") => (false, implode xs)
berghofe@14858
   362
  | _ => sys_error "dest_sym");
wenzelm@16458
   363
berghofe@14858
   364
fun mk_id s = if s = "" then "" else
berghofe@11520
   365
  let
berghofe@14858
   366
    fun check_str [] = []
berghofe@14858
   367
      | check_str xs = (case take_prefix is_ascii_letdig xs of
berghofe@14858
   368
          ([], " " :: zs) => check_str zs
berghofe@14858
   369
        | ([], z :: zs) =>
berghofe@14858
   370
          if size z = 1 then string_of_int (ord z) :: check_str zs
berghofe@14858
   371
          else (case dest_sym z of
berghofe@14858
   372
              (true, "isub") => check_str zs
berghofe@14858
   373
            | (true, "isup") => "" :: check_str zs
berghofe@14858
   374
            | (ctrl, s') => (if ctrl then "ctrl_" ^ s' else s') :: check_str zs)
berghofe@14858
   375
        | (ys, zs) => implode ys :: check_str zs);
wenzelm@30364
   376
    val s' = space_implode "_" (maps (check_str o Symbol.explode) (Long_Name.explode s))
berghofe@11520
   377
  in
berghofe@14858
   378
    if Symbol.is_ascii_letter (hd (explode s')) then s' else "id_" ^ s'
berghofe@11520
   379
  end;
berghofe@11520
   380
berghofe@17144
   381
fun mk_long_id (p as (tab, used)) module s =
berghofe@16649
   382
  let
berghofe@17144
   383
    fun find_name [] = sys_error "mk_long_id"
berghofe@17144
   384
      | find_name (ys :: yss) =
berghofe@17144
   385
          let
wenzelm@30364
   386
            val s' = Long_Name.implode ys
wenzelm@30364
   387
            val s'' = Long_Name.append module s'
wenzelm@17412
   388
          in case Symtab.lookup used s'' of
wenzelm@17261
   389
              NONE => ((module, s'),
wenzelm@17412
   390
                (Symtab.update_new (s, (module, s')) tab,
wenzelm@17412
   391
                 Symtab.update_new (s'', ()) used))
berghofe@17144
   392
            | SOME _ => find_name yss
berghofe@17144
   393
          end
wenzelm@17412
   394
  in case Symtab.lookup tab s of
wenzelm@30364
   395
      NONE => find_name (Library.suffixes1 (Long_Name.explode s))
berghofe@17144
   396
    | SOME name => (name, p)
berghofe@16649
   397
  end;
berghofe@16649
   398
berghofe@17144
   399
(* module:  module name for caller                                        *)
berghofe@17144
   400
(* module': module name for callee                                        *)
berghofe@17144
   401
(* if caller and callee reside in different modules, use qualified access *)
berghofe@16649
   402
berghofe@17144
   403
fun mk_qual_id module (module', s) =
berghofe@17144
   404
  if module = module' orelse module' = "" then s else module' ^ "." ^ s;
berghofe@17144
   405
berghofe@17144
   406
fun mk_const_id module cname (gr, (tab1, tab2)) =
berghofe@16649
   407
  let
berghofe@17144
   408
    val ((module, s), tab1') = mk_long_id tab1 module cname
berghofe@17144
   409
    val s' = mk_id s;
wenzelm@21478
   410
    val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
haftmann@28537
   411
  in (((module, s'')), (gr, (tab1', tab2))) end;
berghofe@13073
   412
haftmann@28537
   413
fun get_const_id (gr, (tab1, tab2)) cname =
wenzelm@17412
   414
  case Symtab.lookup (fst tab1) cname of
berghofe@17144
   415
    NONE => error ("get_const_id: no such constant: " ^ quote cname)
berghofe@17144
   416
  | SOME (module, s) =>
berghofe@17144
   417
      let
berghofe@17144
   418
        val s' = mk_id s;
wenzelm@21478
   419
        val s'' = if ML_Syntax.is_reserved s' then s' ^ "_const" else s'
berghofe@17144
   420
      in (module, s'') end;
berghofe@17144
   421
berghofe@17144
   422
fun mk_type_id module tyname (gr, (tab1, tab2)) =
berghofe@16649
   423
  let
berghofe@17144
   424
    val ((module, s), tab2') = mk_long_id tab2 module tyname
berghofe@17144
   425
    val s' = mk_id s;
wenzelm@21478
   426
    val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
haftmann@28537
   427
  in ((module, s''), (gr, (tab1, tab2'))) end;
berghofe@16649
   428
haftmann@28537
   429
fun get_type_id (gr, (tab1, tab2)) tyname =
wenzelm@17412
   430
  case Symtab.lookup (fst tab2) tyname of
berghofe@17144
   431
    NONE => error ("get_type_id: no such type: " ^ quote tyname)
berghofe@17144
   432
  | SOME (module, s) =>
berghofe@17144
   433
      let
berghofe@17144
   434
        val s' = mk_id s;
wenzelm@21478
   435
        val s'' = if ML_Syntax.is_reserved s' then s' ^ "_type" else s'
berghofe@17144
   436
      in (module, s'') end;
berghofe@17144
   437
haftmann@28537
   438
fun get_type_id' f tab tyname = apsnd f (get_type_id tab tyname);
berghofe@17144
   439
berghofe@17144
   440
fun get_node (gr, x) k = Graph.get_node gr k;
berghofe@17144
   441
fun add_edge e (gr, x) = (Graph.add_edge e gr, x);
berghofe@17144
   442
fun add_edge_acyclic e (gr, x) = (Graph.add_edge_acyclic e gr, x);
berghofe@17144
   443
fun del_nodes ks (gr, x) = (Graph.del_nodes ks gr, x);
berghofe@17144
   444
fun map_node k f (gr, x) = (Graph.map_node k f gr, x);
berghofe@17144
   445
fun new_node p (gr, x) = (Graph.new_node p gr, x);
berghofe@16649
   446
wenzelm@33172
   447
fun thyname_of_type thy = #theory_name o Name_Space.the_entry (Sign.type_space thy);
wenzelm@33172
   448
fun thyname_of_const thy = #theory_name o Name_Space.the_entry (Sign.const_space thy);
berghofe@11520
   449
berghofe@13731
   450
fun rename_terms ts =
berghofe@11520
   451
  let
wenzelm@29270
   452
    val names = List.foldr OldTerm.add_term_names
wenzelm@20286
   453
      (map (fst o fst) (rev (fold Term.add_vars ts []))) ts;
wenzelm@21478
   454
    val reserved = filter ML_Syntax.is_reserved names;
wenzelm@19482
   455
    val (illegal, alt_names) = split_list (map_filter (fn s =>
skalberg@15531
   456
      let val s' = mk_id s in if s = s' then NONE else SOME (s, s') end) names)
berghofe@14858
   457
    val ps = (reserved @ illegal) ~~
wenzelm@20071
   458
      Name.variant_list names (map (suffix "'") reserved @ alt_names);
berghofe@11520
   459
haftmann@17521
   460
    fun rename_id s = AList.lookup (op =) ps s |> the_default s;
berghofe@14858
   461
berghofe@14858
   462
    fun rename (Var ((a, i), T)) = Var ((rename_id a, i), T)
berghofe@14858
   463
      | rename (Free (a, T)) = Free (rename_id a, T)
berghofe@11520
   464
      | rename (Abs (s, T, t)) = Abs (s, T, rename t)
berghofe@11520
   465
      | rename (t $ u) = rename t $ rename u
berghofe@11520
   466
      | rename t = t;
berghofe@11520
   467
  in
berghofe@13731
   468
    map rename ts
berghofe@13731
   469
  end;
berghofe@13731
   470
berghofe@13731
   471
val rename_term = hd o rename_terms o single;
berghofe@13731
   472
berghofe@13731
   473
berghofe@13731
   474
(**** retrieve definition of constant ****)
berghofe@13731
   475
wenzelm@24908
   476
fun is_instance T1 T2 =
wenzelm@29270
   477
  Type.raw_instance (T1, if null (OldTerm.typ_tfrees T2) then T2 else Logic.varifyT T2);
berghofe@13731
   478
haftmann@22921
   479
fun get_assoc_code thy (s, T) = Option.map snd (find_first (fn ((s', T'), _) =>
wenzelm@24908
   480
  s = s' andalso is_instance T T') (#consts (CodegenData.get thy)));
berghofe@13731
   481
wenzelm@19482
   482
fun get_aux_code xs = map_filter (fn (m, code) =>
wenzelm@20665
   483
  if m = "" orelse member (op =) (!mode) m then SOME code else NONE) xs;
berghofe@16769
   484
haftmann@32085
   485
fun dest_prim_def t =
haftmann@32085
   486
  let
haftmann@32085
   487
    val (lhs, rhs) = Logic.dest_equals t;
haftmann@32085
   488
    val (c, args) = strip_comb lhs;
haftmann@32085
   489
    val (s, T) = dest_Const c
haftmann@32085
   490
  in if forall is_Var args then SOME (s, (T, (args, rhs))) else NONE
haftmann@32085
   491
  end handle TERM _ => NONE;
haftmann@32085
   492
berghofe@16649
   493
fun mk_deftab thy =
berghofe@13731
   494
  let
wenzelm@22680
   495
    val axmss = map (fn thy' => (Context.theory_name thy', Theory.axiom_table thy'))
berghofe@16649
   496
      (thy :: Theory.ancestors_of thy);
haftmann@32085
   497
    fun add_def thyname (name, t) = (case dest_prim_def t of
haftmann@21056
   498
        NONE => I
haftmann@32085
   499
      | SOME (s, (T, _)) => Symtab.map_default (s, [])
haftmann@32085
   500
          (cons (T, (thyname, Thm.axiom thy name))));
berghofe@13731
   501
  in
haftmann@21056
   502
    fold (fn (thyname, axms) => Symtab.fold (add_def thyname) axms) axmss Symtab.empty
berghofe@11520
   503
  end;
berghofe@11520
   504
haftmann@32085
   505
fun prep_prim_def thy thm =
haftmann@32085
   506
  let
haftmann@32085
   507
    val prop = case preprocess thy [thm]
haftmann@32085
   508
     of [thm'] => Thm.prop_of thm'
haftmann@32085
   509
      | _ => error "mk_deftab: bad preprocessor"
haftmann@32085
   510
  in ((Option.map o apsnd o apsnd)
haftmann@32085
   511
    (fn (args, rhs) => split_last (rename_terms (args @ [rhs]))) o dest_prim_def) prop
haftmann@32085
   512
  end;
haftmann@32085
   513
wenzelm@17412
   514
fun get_defn thy defs s T = (case Symtab.lookup defs s of
berghofe@16649
   515
    NONE => NONE
berghofe@16649
   516
  | SOME ds =>
wenzelm@24908
   517
      let val i = find_index (is_instance T o fst) ds
berghofe@16649
   518
      in if i >= 0 then
haftmann@32085
   519
          SOME (nth ds i, if length ds = 1 then NONE else SOME i)
berghofe@16649
   520
        else NONE
berghofe@16649
   521
      end);
berghofe@16649
   522
berghofe@11520
   523
berghofe@12452
   524
(**** invoke suitable code generator for term / type ****)
berghofe@11520
   525
berghofe@17144
   526
fun codegen_error (gr, _) dep s =
berghofe@17144
   527
  error (s ^ "\nrequired by:\n" ^ commas (Graph.all_succs gr [dep]));
berghofe@17144
   528
haftmann@28537
   529
fun invoke_codegen thy defs dep module brack t gr = (case get_first
haftmann@28537
   530
   (fn (_, f) => f thy defs dep module brack t gr) (#codegens (CodegenData.get thy)) of
berghofe@17144
   531
      NONE => codegen_error gr dep ("Unable to generate code for term:\n" ^
wenzelm@26939
   532
        Syntax.string_of_term_global thy t)
skalberg@15531
   533
    | SOME x => x);
berghofe@12452
   534
haftmann@28537
   535
fun invoke_tycodegen thy defs dep module brack T gr = (case get_first
haftmann@28537
   536
   (fn (_, f) => f thy defs dep module brack T gr ) (#tycodegens (CodegenData.get thy)) of
berghofe@17144
   537
      NONE => codegen_error gr dep ("Unable to generate code for type:\n" ^
wenzelm@26939
   538
        Syntax.string_of_typ_global thy T)
skalberg@15531
   539
    | SOME x => x);
berghofe@11520
   540
berghofe@11520
   541
berghofe@11520
   542
(**** code generator for mixfix expressions ****)
berghofe@11520
   543
berghofe@26974
   544
fun parens p = Pretty.block [str "(", p, str ")"];
berghofe@11520
   545
berghofe@11520
   546
fun pretty_fn [] p = [p]
berghofe@26974
   547
  | pretty_fn (x::xs) p = str ("fn " ^ x ^ " =>") ::
berghofe@11520
   548
      Pretty.brk 1 :: pretty_fn xs p;
berghofe@11520
   549
berghofe@16769
   550
fun pretty_mixfix _ _ [] [] _ = []
berghofe@16769
   551
  | pretty_mixfix module module' (Arg :: ms) (p :: ps) qs =
berghofe@16769
   552
      p :: pretty_mixfix module module' ms ps qs
berghofe@16769
   553
  | pretty_mixfix module module' (Ignore :: ms) ps qs =
berghofe@16769
   554
      pretty_mixfix module module' ms ps qs
berghofe@16769
   555
  | pretty_mixfix module module' (Module :: ms) ps qs =
berghofe@17144
   556
      (if module <> module'
berghofe@26974
   557
       then cons (str (module' ^ ".")) else I)
berghofe@16769
   558
      (pretty_mixfix module module' ms ps qs)
berghofe@16769
   559
  | pretty_mixfix module module' (Pretty p :: ms) ps qs =
berghofe@16769
   560
      p :: pretty_mixfix module module' ms ps qs
berghofe@16769
   561
  | pretty_mixfix module module' (Quote _ :: ms) ps (q :: qs) =
berghofe@16769
   562
      q :: pretty_mixfix module module' ms ps qs;
berghofe@11520
   563
haftmann@18102
   564
fun replace_quotes [] [] = []
haftmann@18102
   565
  | replace_quotes xs (Arg :: ms) =
haftmann@18102
   566
      Arg :: replace_quotes xs ms
haftmann@18102
   567
  | replace_quotes xs (Ignore :: ms) =
haftmann@18102
   568
      Ignore :: replace_quotes xs ms
haftmann@18102
   569
  | replace_quotes xs (Module :: ms) =
haftmann@18102
   570
      Module :: replace_quotes xs ms
haftmann@18102
   571
  | replace_quotes xs (Pretty p :: ms) =
haftmann@18102
   572
      Pretty p :: replace_quotes xs ms
haftmann@18102
   573
  | replace_quotes (x::xs) (Quote _ :: ms) =
haftmann@18102
   574
      Quote x :: replace_quotes xs ms;
haftmann@18102
   575
berghofe@11520
   576
berghofe@12452
   577
(**** default code generators ****)
berghofe@11520
   578
berghofe@11520
   579
fun eta_expand t ts i =
berghofe@11520
   580
  let
berghofe@24456
   581
    val k = length ts;
haftmann@33955
   582
    val Ts = (uncurry drop) (k, binder_types (fastype_of t));
berghofe@24456
   583
    val j = i - k
berghofe@11520
   584
  in
wenzelm@23178
   585
    List.foldr (fn (T, t) => Abs ("x", T, t))
haftmann@33955
   586
      (list_comb (t, ts @ map Bound (j-1 downto 0))) ((uncurry take) (j, Ts))
berghofe@11520
   587
  end;
berghofe@11520
   588
berghofe@11520
   589
fun mk_app _ p [] = p
berghofe@11520
   590
  | mk_app brack p ps = if brack then
berghofe@26974
   591
       Pretty.block (str "(" ::
berghofe@26974
   592
         separate (Pretty.brk 1) (p :: ps) @ [str ")"])
berghofe@11520
   593
     else Pretty.block (separate (Pretty.brk 1) (p :: ps));
berghofe@11520
   594
wenzelm@20071
   595
fun new_names t xs = Name.variant_list
haftmann@33042
   596
  (union (op =) (map (fst o fst o dest_Var) (OldTerm.term_vars t))
haftmann@33042
   597
    (OldTerm.add_term_names (t, ML_Syntax.reserved_names))) (map mk_id xs);
berghofe@11520
   598
berghofe@11520
   599
fun new_name t x = hd (new_names t [x]);
berghofe@11520
   600
wenzelm@20665
   601
fun if_library x y = if member (op =) (!mode) "library" then x else y;
berghofe@17144
   602
haftmann@28537
   603
fun default_codegen thy defs dep module brack t gr =
berghofe@11520
   604
  let
berghofe@11520
   605
    val (u, ts) = strip_comb t;
haftmann@28537
   606
    fun codegens brack = fold_map (invoke_codegen thy defs dep module brack)
berghofe@11520
   607
  in (case u of
berghofe@14105
   608
      Var ((s, i), T) =>
berghofe@14105
   609
        let
haftmann@28537
   610
          val (ps, gr') = codegens true ts gr;
haftmann@28537
   611
          val (_, gr'') = invoke_tycodegen thy defs dep module false T gr'
haftmann@28537
   612
        in SOME (mk_app brack (str (s ^
haftmann@28537
   613
           (if i=0 then "" else string_of_int i))) ps, gr'')
berghofe@11520
   614
        end
berghofe@11520
   615
berghofe@14105
   616
    | Free (s, T) =>
berghofe@14105
   617
        let
haftmann@28537
   618
          val (ps, gr') = codegens true ts gr;
haftmann@28537
   619
          val (_, gr'') = invoke_tycodegen thy defs dep module false T gr'
haftmann@28537
   620
        in SOME (mk_app brack (str s) ps, gr'') end
berghofe@11520
   621
berghofe@11520
   622
    | Const (s, T) =>
haftmann@22921
   623
      (case get_assoc_code thy (s, T) of
berghofe@16769
   624
         SOME (ms, aux) =>
haftmann@18281
   625
           let val i = num_args_of ms
berghofe@11520
   626
           in if length ts < i then
haftmann@28537
   627
               default_codegen thy defs dep module brack (eta_expand u ts i) gr 
berghofe@11520
   628
             else
berghofe@11520
   629
               let
berghofe@12452
   630
                 val (ts1, ts2) = args_of ms ts;
haftmann@28537
   631
                 val (ps1, gr1) = codegens false ts1 gr;
haftmann@28537
   632
                 val (ps2, gr2) = codegens true ts2 gr1;
haftmann@28537
   633
                 val (ps3, gr3) = codegens false (quotes_of ms) gr2;
haftmann@28537
   634
                 val (_, gr4) = invoke_tycodegen thy defs dep module false
haftmann@28537
   635
                   (funpow (length ts) (hd o tl o snd o dest_Type) T) gr3;
berghofe@17144
   636
                 val (module', suffix) = (case get_defn thy defs s T of
haftmann@27398
   637
                     NONE => (if_library (thyname_of_const thy s) module, "")
berghofe@17144
   638
                   | SOME ((U, (module', _)), NONE) =>
berghofe@17144
   639
                       (if_library module' module, "")
berghofe@17144
   640
                   | SOME ((U, (module', _)), SOME i) =>
berghofe@17144
   641
                       (if_library module' module, " def" ^ string_of_int i));
berghofe@16769
   642
                 val node_id = s ^ suffix;
berghofe@17144
   643
                 fun p module' = mk_app brack (Pretty.block
berghofe@17144
   644
                   (pretty_mixfix module module' ms ps1 ps3)) ps2
berghofe@17549
   645
               in SOME (case try (get_node gr4) node_id of
berghofe@16769
   646
                   NONE => (case get_aux_code aux of
haftmann@28537
   647
                       [] => (p module, gr4)
haftmann@28537
   648
                     | xs => (p module', add_edge (node_id, dep) (new_node
haftmann@28537
   649
                         (node_id, (NONE, module', cat_lines xs ^ "\n")) gr4)))
berghofe@17144
   650
                 | SOME (_, module'', _) =>
haftmann@28537
   651
                     (p module'', add_edge (node_id, dep) gr4))
berghofe@11520
   652
               end
berghofe@11520
   653
           end
berghofe@16649
   654
       | NONE => (case get_defn thy defs s T of
skalberg@15531
   655
           NONE => NONE
haftmann@32085
   656
         | SOME ((U, (thyname, thm)), k) => (case prep_prim_def thy thm
haftmann@32085
   657
            of SOME (_, (_, (args, rhs))) => let
berghofe@17144
   658
               val module' = if_library thyname module;
berghofe@17144
   659
               val suffix = (case k of NONE => "" | SOME i => " def" ^ string_of_int i);
berghofe@16649
   660
               val node_id = s ^ suffix;
haftmann@28537
   661
               val ((ps, def_id), gr') = gr |> codegens true ts
haftmann@28537
   662
                 ||>> mk_const_id module' (s ^ suffix);
berghofe@26974
   663
               val p = mk_app brack (str (mk_qual_id module def_id)) ps
berghofe@17144
   664
             in SOME (case try (get_node gr') node_id of
berghofe@17144
   665
                 NONE =>
berghofe@17144
   666
                   let
berghofe@17144
   667
                     val _ = message ("expanding definition of " ^ s);
berghofe@18788
   668
                     val (Ts, _) = strip_type U;
berghofe@17144
   669
                     val (args', rhs') =
berghofe@17144
   670
                       if not (null args) orelse null Ts then (args, rhs) else
berghofe@17144
   671
                         let val v = Free (new_name rhs "x", hd Ts)
berghofe@17144
   672
                         in ([v], betapply (rhs, v)) end;
haftmann@28537
   673
                     val (p', gr1) = invoke_codegen thy defs node_id module' false
haftmann@28537
   674
                       rhs' (add_edge (node_id, dep)
haftmann@28537
   675
                          (new_node (node_id, (NONE, "", "")) gr'));
haftmann@28537
   676
                     val (xs, gr2) = codegens false args' gr1;
haftmann@28537
   677
                     val (_, gr3) = invoke_tycodegen thy defs dep module false T gr2;
haftmann@28537
   678
                     val (ty, gr4) = invoke_tycodegen thy defs node_id module' false U gr3;
haftmann@28537
   679
                   in (p, map_node node_id (K (NONE, module', string_of
berghofe@17144
   680
                       (Pretty.block (separate (Pretty.brk 1)
berghofe@17144
   681
                         (if null args' then
berghofe@26974
   682
                            [str ("val " ^ snd def_id ^ " :"), ty]
berghofe@26974
   683
                          else str ("fun " ^ snd def_id) :: xs) @
haftmann@28537
   684
                        [str " =", Pretty.brk 1, p', str ";"])) ^ "\n\n")) gr4)
berghofe@17144
   685
                   end
haftmann@28537
   686
               | SOME _ => (p, add_edge (node_id, dep) gr'))
haftmann@32085
   687
             end
haftmann@32085
   688
             | NONE => NONE)))
berghofe@11520
   689
berghofe@11520
   690
    | Abs _ =>
berghofe@11520
   691
      let
berghofe@11520
   692
        val (bs, Ts) = ListPair.unzip (strip_abs_vars u);
berghofe@11520
   693
        val t = strip_abs_body u
berghofe@11520
   694
        val bs' = new_names t bs;
haftmann@28537
   695
        val (ps, gr1) = codegens true ts gr;
haftmann@28537
   696
        val (p, gr2) = invoke_codegen thy defs dep module false
haftmann@28537
   697
          (subst_bounds (map Free (rev (bs' ~~ Ts)), t)) gr1;
berghofe@11520
   698
      in
haftmann@28537
   699
        SOME (mk_app brack (Pretty.block (str "(" :: pretty_fn bs' p @
haftmann@28537
   700
          [str ")"])) ps, gr2)
berghofe@11520
   701
      end
berghofe@11520
   702
skalberg@15531
   703
    | _ => NONE)
berghofe@11520
   704
  end;
berghofe@11520
   705
haftmann@28537
   706
fun default_tycodegen thy defs dep module brack (TVar ((s, i), _)) gr =
haftmann@28537
   707
      SOME (str (s ^ (if i = 0 then "" else string_of_int i)), gr)
haftmann@28537
   708
  | default_tycodegen thy defs dep module brack (TFree (s, _)) gr =
haftmann@28537
   709
      SOME (str s, gr)
haftmann@28537
   710
  | default_tycodegen thy defs dep module brack (Type (s, Ts)) gr =
haftmann@17521
   711
      (case AList.lookup (op =) ((#types o CodegenData.get) thy) s of
skalberg@15531
   712
         NONE => NONE
berghofe@16769
   713
       | SOME (ms, aux) =>
berghofe@12452
   714
           let
haftmann@28537
   715
             val (ps, gr') = fold_map
berghofe@17144
   716
               (invoke_tycodegen thy defs dep module false)
haftmann@28537
   717
               (fst (args_of ms Ts)) gr;
haftmann@28537
   718
             val (qs, gr'') = fold_map
berghofe@17144
   719
               (invoke_tycodegen thy defs dep module false)
haftmann@28537
   720
               (quotes_of ms) gr';
haftmann@27398
   721
             val module' = if_library (thyname_of_type thy s) module;
berghofe@16769
   722
             val node_id = s ^ " (type)";
berghofe@17144
   723
             fun p module' = Pretty.block (pretty_mixfix module module' ms ps qs)
berghofe@17144
   724
           in SOME (case try (get_node gr'') node_id of
berghofe@16769
   725
               NONE => (case get_aux_code aux of
haftmann@28537
   726
                   [] => (p module', gr'')
haftmann@28537
   727
                 | xs => (p module', snd (mk_type_id module' s
berghofe@17144
   728
                       (add_edge (node_id, dep) (new_node (node_id,
haftmann@28537
   729
                         (NONE, module', cat_lines xs ^ "\n")) gr'')))))
berghofe@17144
   730
             | SOME (_, module'', _) =>
haftmann@28537
   731
                 (p module'', add_edge (node_id, dep) gr''))
berghofe@16769
   732
           end);
berghofe@12452
   733
berghofe@25892
   734
fun mk_tuple [p] = p
berghofe@26974
   735
  | mk_tuple ps = Pretty.block (str "(" ::
wenzelm@32952
   736
      flat (separate [str ",", Pretty.brk 1] (map single ps)) @ [str ")"]);
berghofe@25892
   737
berghofe@25892
   738
fun mk_let bindings body =
berghofe@26974
   739
  Pretty.blk (0, [str "let", Pretty.brk 1,
berghofe@25892
   740
    Pretty.blk (0, separate Pretty.fbrk (map (fn (pat, rhs) =>
berghofe@26974
   741
      Pretty.block [str "val ", pat, str " =", Pretty.brk 1,
berghofe@26974
   742
      rhs, str ";"]) bindings)),
berghofe@26974
   743
    Pretty.brk 1, str "in", Pretty.brk 1, body,
berghofe@26974
   744
    Pretty.brk 1, str "end"]);
berghofe@25892
   745
berghofe@16649
   746
fun mk_struct name s = "structure " ^ name ^ " =\nstruct\n\n" ^ s ^ "end;\n";
berghofe@16649
   747
haftmann@28227
   748
fun add_to_module name s = AList.map_entry (op =) (name : string) (suffix s);
berghofe@16649
   749
berghofe@17144
   750
fun output_code gr module xs =
berghofe@16649
   751
  let
wenzelm@19482
   752
    val code = map_filter (fn s =>
berghofe@17144
   753
      let val c as (_, module', _) = Graph.get_node gr s
berghofe@17144
   754
      in if module = "" orelse module = module' then SOME (s, c) else NONE end)
berghofe@17144
   755
        (rev (Graph.all_preds gr xs));
berghofe@16649
   756
    fun string_of_cycle (a :: b :: cs) =
berghofe@16649
   757
          let val SOME (x, y) = get_first (fn (x, (_, a', _)) =>
berghofe@16649
   758
            if a = a' then Option.map (pair x)
wenzelm@28375
   759
              (find_first ((fn (_, b', _) => b' = b) o Graph.get_node gr)
berghofe@16649
   760
                (Graph.imm_succs gr x))
berghofe@16649
   761
            else NONE) code
berghofe@16649
   762
          in x ^ " called by " ^ y ^ "\n" ^ string_of_cycle (b :: cs) end
berghofe@16649
   763
      | string_of_cycle _ = ""
berghofe@16649
   764
  in
berghofe@17144
   765
    if module = "" then
berghofe@16649
   766
      let
wenzelm@19046
   767
        val modules = distinct (op =) (map (#2 o snd) code);
wenzelm@23178
   768
        val mod_gr = fold_rev Graph.add_edge_acyclic
wenzelm@19482
   769
          (maps (fn (s, (_, module, _)) => map (pair module)
wenzelm@28375
   770
            (filter_out (fn s => s = module) (map (#2 o Graph.get_node gr)
wenzelm@23178
   771
              (Graph.imm_succs gr s)))) code)
wenzelm@23178
   772
          (fold_rev (Graph.new_node o rpair ()) modules Graph.empty);
berghofe@16649
   773
        val modules' =
berghofe@16649
   774
          rev (Graph.all_preds mod_gr (map (#2 o Graph.get_node gr) xs))
berghofe@16649
   775
      in
wenzelm@23178
   776
        List.foldl (fn ((_, (_, module, s)), ms) => add_to_module module s ms)
berghofe@16649
   777
          (map (rpair "") modules') code
berghofe@16649
   778
      end handle Graph.CYCLES (cs :: _) =>
berghofe@16649
   779
        error ("Cyclic dependency of modules:\n" ^ commas cs ^
berghofe@16649
   780
          "\n" ^ string_of_cycle cs)
berghofe@17144
   781
    else [(module, implode (map (#3 o snd) code))]
berghofe@16649
   782
  end;
berghofe@11520
   783
berghofe@26974
   784
fun gen_generate_code prep_term thy modules module xs =
berghofe@11520
   785
  let
wenzelm@21858
   786
    val _ = (module <> "" orelse
wenzelm@28375
   787
        member (op =) (!mode) "library" andalso forall (fn (s, _) => s = "") xs)
wenzelm@21858
   788
      orelse error "missing module name";
berghofe@17144
   789
    val graphs = get_modules thy;
berghofe@16649
   790
    val defs = mk_deftab thy;
berghofe@17144
   791
    val gr = new_node ("<Top>", (NONE, module, ""))
wenzelm@23178
   792
      (List.foldl (fn ((gr, (tab1, tab2)), (gr', (tab1', tab2'))) =>
berghofe@17144
   793
        (Graph.merge (fn ((_, module, _), (_, module', _)) =>
berghofe@17144
   794
           module = module') (gr, gr'),
berghofe@17144
   795
         (merge_nametabs (tab1, tab1'), merge_nametabs (tab2, tab2')))) emptygr
wenzelm@17412
   796
           (map (fn s => case Symtab.lookup graphs s of
berghofe@17144
   797
                NONE => error ("Undefined code module: " ^ s)
berghofe@17144
   798
              | SOME gr => gr) modules))
wenzelm@23655
   799
      handle Graph.DUP k => error ("Duplicate code for " ^ k);
berghofe@16649
   800
    fun expand (t as Abs _) = t
berghofe@16649
   801
      | expand t = (case fastype_of t of
berghofe@16649
   802
          Type ("fun", [T, U]) => Abs ("x", T, t $ Bound 0) | _ => t);
haftmann@28537
   803
    val (ps, gr') = fold_map (fn (s, t) => fn gr => apfst (pair s)
haftmann@28537
   804
      (invoke_codegen thy defs "<Top>" module false t gr))
haftmann@28537
   805
        (map (apsnd (expand o preprocess_term thy o prep_term thy)) xs) gr;
wenzelm@19482
   806
    val code = map_filter
berghofe@17144
   807
      (fn ("", _) => NONE
berghofe@26974
   808
        | (s', p) => SOME (string_of (Pretty.block
berghofe@26974
   809
          [str ("val " ^ s' ^ " ="), Pretty.brk 1, p, str ";"]))) ps;
berghofe@17144
   810
    val code' = space_implode "\n\n" code ^ "\n\n";
berghofe@17144
   811
    val code'' =
wenzelm@19482
   812
      map_filter (fn (name, s) =>
wenzelm@20665
   813
          if member (op =) (!mode) "library" andalso name = module andalso null code
berghofe@17144
   814
          then NONE
berghofe@17144
   815
          else SOME (name, mk_struct name s))
berghofe@17144
   816
        ((if null code then I
berghofe@17144
   817
          else add_to_module module code')
berghofe@17144
   818
           (output_code (fst gr') (if_library "" module) ["<Top>"]))
berghofe@16649
   819
  in
berghofe@17144
   820
    (code'', del_nodes ["<Top>"] gr')
berghofe@26974
   821
  end;
berghofe@11520
   822
wenzelm@22680
   823
val generate_code_i = gen_generate_code Sign.cert_term;
wenzelm@32182
   824
val generate_code =
wenzelm@32182
   825
  gen_generate_code (Syntax.read_term o ProofContext.allow_dummies o ProofContext.init);
berghofe@11520
   826
berghofe@12452
   827
berghofe@13753
   828
(**** Reflection ****)
berghofe@13753
   829
berghofe@13753
   830
val strip_tname = implode o tl o explode;
berghofe@13753
   831
berghofe@26974
   832
fun pretty_list xs = Pretty.block (str "[" ::
berghofe@26974
   833
  flat (separate [str ",", Pretty.brk 1] (map single xs)) @
berghofe@26974
   834
  [str "]"]);
berghofe@13753
   835
berghofe@26974
   836
fun mk_type p (TVar ((s, i), _)) = str
berghofe@13753
   837
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "T")
berghofe@26974
   838
  | mk_type p (TFree (s, _)) = str (strip_tname s ^ "T")
berghofe@13753
   839
  | mk_type p (Type (s, Ts)) = (if p then parens else I) (Pretty.block
berghofe@26974
   840
      [str "Type", Pretty.brk 1, str ("(\"" ^ s ^ "\","),
berghofe@26974
   841
       Pretty.brk 1, pretty_list (map (mk_type false) Ts), str ")"]);
berghofe@13753
   842
berghofe@26974
   843
fun mk_term_of gr module p (TVar ((s, i), _)) = str
berghofe@13753
   844
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "F")
berghofe@26974
   845
  | mk_term_of gr module p (TFree (s, _)) = str (strip_tname s ^ "F")
berghofe@17144
   846
  | mk_term_of gr module p (Type (s, Ts)) = (if p then parens else I)
berghofe@16649
   847
      (Pretty.block (separate (Pretty.brk 1)
berghofe@26974
   848
        (str (mk_qual_id module
haftmann@28537
   849
          (get_type_id' (fn s' => "term_of_" ^ s') gr s)) ::
wenzelm@19482
   850
        maps (fn T =>
wenzelm@19482
   851
          [mk_term_of gr module true T, mk_type true T]) Ts)));
berghofe@13753
   852
berghofe@13753
   853
berghofe@14105
   854
(**** Test data generators ****)
berghofe@14105
   855
berghofe@26974
   856
fun mk_gen gr module p xs a (TVar ((s, i), _)) = str
berghofe@14105
   857
      (strip_tname s ^ (if i = 0 then "" else string_of_int i) ^ "G")
berghofe@26974
   858
  | mk_gen gr module p xs a (TFree (s, _)) = str (strip_tname s ^ "G")
berghofe@25892
   859
  | mk_gen gr module p xs a (Type (tyc as (s, Ts))) = (if p then parens else I)
berghofe@16649
   860
      (Pretty.block (separate (Pretty.brk 1)
haftmann@28537
   861
        (str (mk_qual_id module (get_type_id' (fn s' => "gen_" ^ s') gr s) ^
wenzelm@20665
   862
          (if member (op =) xs s then "'" else "")) ::
berghofe@25892
   863
         (case tyc of
berghofe@25892
   864
            ("fun", [T, U]) =>
berghofe@25892
   865
              [mk_term_of gr module true T, mk_type true T,
berghofe@25892
   866
               mk_gen gr module true xs a U, mk_type true U]
berghofe@25892
   867
          | _ => maps (fn T =>
berghofe@25892
   868
              [mk_gen gr module true xs a T, mk_type true T]) Ts) @
berghofe@26974
   869
         (if member (op =) xs s then [str a] else []))));
berghofe@14105
   870
wenzelm@32738
   871
val test_fn : (int -> term list option) Unsynchronized.ref =
wenzelm@32738
   872
  Unsynchronized.ref (fn _ => NONE);
berghofe@14105
   873
haftmann@28315
   874
fun test_term ctxt t =
haftmann@28309
   875
  let
haftmann@28309
   876
    val thy = ProofContext.theory_of ctxt;
wenzelm@32966
   877
    val (code, gr) = setmp_CRITICAL mode ["term_of", "test"]
haftmann@28309
   878
      (generate_code_i thy [] "Generated") [("testf", t)];
berghofe@31145
   879
    val Ts = map snd (fst (strip_abs t));
berghofe@31145
   880
    val args = map_index (fn (i, T) => ("arg" ^ string_of_int i, T)) Ts;
haftmann@28309
   881
    val s = "structure TestTerm =\nstruct\n\n" ^
haftmann@28309
   882
      cat_lines (map snd code) ^
haftmann@28309
   883
      "\nopen Generated;\n\n" ^ string_of
haftmann@28309
   884
        (Pretty.block [str "val () = Codegen.test_fn :=",
haftmann@28309
   885
          Pretty.brk 1, str ("(fn i =>"), Pretty.brk 1,
berghofe@31145
   886
          mk_let (map (fn (s, T) =>
berghofe@31145
   887
              (mk_tuple [str s, str (s ^ "_t")],
haftmann@28309
   888
               Pretty.block [mk_gen gr "Generated" false [] "" T, Pretty.brk 1,
berghofe@31145
   889
                 str "i"])) args)
haftmann@28309
   890
            (Pretty.block [str "if ",
berghofe@31145
   891
              mk_app false (str "testf") (map (str o fst) args),
haftmann@28309
   892
              Pretty.brk 1, str "then NONE",
haftmann@28309
   893
              Pretty.brk 1, str "else ",
haftmann@28309
   894
              Pretty.block [str "SOME ", Pretty.block (str "[" ::
berghofe@31145
   895
                Pretty.commas (map (fn (s, _) => str (s ^ "_t ()")) args) @
haftmann@28309
   896
                  [str "]"])]]),
haftmann@28309
   897
          str ");"]) ^
haftmann@28309
   898
      "\n\nend;\n";
haftmann@28309
   899
    val _ = ML_Context.eval_in (SOME ctxt) false Position.none s;
berghofe@31145
   900
  in ! test_fn end;
haftmann@28309
   901
berghofe@24456
   902
berghofe@14105
   903
berghofe@17549
   904
(**** Evaluator for terms ****)
berghofe@17549
   905
wenzelm@32738
   906
val eval_result = Unsynchronized.ref (fn () => Bound 0);
berghofe@17549
   907
wenzelm@25009
   908
fun eval_term thy t =
wenzelm@28271
   909
  let
wenzelm@28271
   910
    val ctxt = ProofContext.init thy;
wenzelm@28271
   911
    val e =
wenzelm@28271
   912
      let
wenzelm@29266
   913
        val _ = (null (Term.add_tvars t []) andalso null (Term.add_tfrees t [])) orelse
wenzelm@28271
   914
          error "Term to be evaluated contains type variables";
wenzelm@29266
   915
        val _ = (null (Term.add_vars t []) andalso null (Term.add_frees t [])) orelse
wenzelm@28271
   916
          error "Term to be evaluated contains variables";
wenzelm@32966
   917
        val (code, gr) = setmp_CRITICAL mode ["term_of"]
wenzelm@28271
   918
          (generate_code_i thy [] "Generated")
wenzelm@28271
   919
          [("result", Abs ("x", TFree ("'a", []), t))];
wenzelm@28271
   920
        val s = "structure EvalTerm =\nstruct\n\n" ^
wenzelm@28271
   921
          cat_lines (map snd code) ^
wenzelm@28271
   922
          "\nopen Generated;\n\n" ^ string_of
wenzelm@28271
   923
            (Pretty.block [str "val () = Codegen.eval_result := (fn () =>",
wenzelm@28271
   924
              Pretty.brk 1,
wenzelm@28271
   925
              mk_app false (mk_term_of gr "Generated" false (fastype_of t))
wenzelm@28271
   926
                [str "(result ())"],
wenzelm@28271
   927
              str ");"]) ^
wenzelm@28271
   928
          "\n\nend;\n";
wenzelm@33222
   929
        val _ = NAMED_CRITICAL "codegen" (fn () =>   (* FIXME ??? *)
wenzelm@28293
   930
          ML_Context.eval_in (SOME ctxt) false Position.none s);
wenzelm@28271
   931
      in !eval_result end;
wenzelm@25009
   932
  in e () end;
berghofe@17549
   933
wenzelm@28293
   934
val (_, evaluation_conv) = Context.>>> (Context.map_theory_result
wenzelm@30288
   935
  (Thm.add_oracle (Binding.name "evaluation", fn ct =>
wenzelm@28293
   936
    let
wenzelm@28293
   937
      val thy = Thm.theory_of_cterm ct;
wenzelm@28293
   938
      val t = Thm.term_of ct;
wenzelm@28293
   939
    in Thm.cterm_of thy (Logic.mk_equals (t, eval_term thy t)) end)));
haftmann@20599
   940
berghofe@17549
   941
berghofe@12452
   942
(**** Interface ****)
berghofe@12452
   943
berghofe@11520
   944
fun parse_mixfix rd s =
berghofe@11520
   945
  (case Scan.finite Symbol.stopper (Scan.repeat
berghofe@11520
   946
     (   $$ "_" >> K Arg
berghofe@11520
   947
      || $$ "?" >> K Ignore
berghofe@16769
   948
      || $$ "\\<module>" >> K Module
berghofe@11520
   949
      || $$ "/" |-- Scan.repeat ($$ " ") >> (Pretty o Pretty.brk o length)
berghofe@11520
   950
      || $$ "{" |-- $$ "*" |-- Scan.repeat1
wenzelm@23784
   951
           (   $$ "'" |-- Scan.one Symbol.is_regular
wenzelm@23784
   952
            || Scan.unless ($$ "*" -- $$ "}") (Scan.one Symbol.is_regular)) --|
berghofe@12452
   953
         $$ "*" --| $$ "}" >> (Quote o rd o implode)
berghofe@11520
   954
      || Scan.repeat1
wenzelm@23784
   955
           (   $$ "'" |-- Scan.one Symbol.is_regular
berghofe@16769
   956
            || Scan.unless ($$ "_" || $$ "?" || $$ "\\<module>" || $$ "/" || $$ "{" |-- $$ "*")
wenzelm@23784
   957
                 (Scan.one Symbol.is_regular)) >> (Pretty o str o implode)))
berghofe@11520
   958
       (Symbol.explode s) of
berghofe@11520
   959
     (p, []) => p
berghofe@11520
   960
   | _ => error ("Malformed annotation: " ^ quote s));
berghofe@11520
   961
wenzelm@15801
   962
wenzelm@17057
   963
structure P = OuterParse and K = OuterKeyword;
berghofe@11520
   964
wenzelm@27353
   965
val _ = List.app OuterKeyword.keyword ["attach", "file", "contains"];
wenzelm@24867
   966
wenzelm@28375
   967
fun strip_whitespace s = implode (fst (take_suffix (fn c => c = "\n" orelse c = " ")
wenzelm@28375
   968
  (snd (take_prefix (fn c => c = "\n" orelse c = " ") (explode s))))) ^ "\n";
berghofe@16769
   969
berghofe@16769
   970
val parse_attach = Scan.repeat (P.$$$ "attach" |--
berghofe@16769
   971
  Scan.optional (P.$$$ "(" |-- P.xname --| P.$$$ ")") "" --
berghofe@17144
   972
    (P.verbatim >> strip_whitespace));
berghofe@16769
   973
wenzelm@24867
   974
val _ =
berghofe@11520
   975
  OuterSyntax.command "types_code"
wenzelm@11546
   976
  "associate types with target language types" K.thy_decl
berghofe@16769
   977
    (Scan.repeat1 (P.xname --| P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
haftmann@22921
   978
     (fn xs => Toplevel.theory (fn thy => fold (assoc_type o
haftmann@22921
   979
       (fn ((name, mfx), aux) => (name, (parse_mixfix
wenzelm@24707
   980
         (Syntax.read_typ_global thy) mfx, aux)))) xs thy)));
berghofe@11520
   981
wenzelm@24867
   982
val _ =
berghofe@11520
   983
  OuterSyntax.command "consts_code"
wenzelm@11546
   984
  "associate constants with target language code" K.thy_decl
berghofe@11520
   985
    (Scan.repeat1
haftmann@22921
   986
       (P.term --|
berghofe@16769
   987
        P.$$$ "(" -- P.string --| P.$$$ ")" -- parse_attach) >>
wenzelm@25376
   988
     (fn xs => Toplevel.theory (fn thy => fold (assoc_const o
haftmann@22921
   989
       (fn ((const, mfx), aux) =>
berghofe@28640
   990
         (const, (parse_mixfix (Syntax.read_term_global thy) mfx, aux)))) xs thy)));
berghofe@11520
   991
berghofe@17144
   992
fun parse_code lib =
berghofe@17144
   993
  Scan.optional (P.$$$ "(" |-- P.enum "," P.xname --| P.$$$ ")") (!mode) --
berghofe@17144
   994
  (if lib then Scan.optional P.name "" else P.name) --
berghofe@17144
   995
  Scan.option (P.$$$ "file" |-- P.name) --
berghofe@17144
   996
  (if lib then Scan.succeed []
berghofe@17144
   997
   else Scan.optional (P.$$$ "imports" |-- Scan.repeat1 P.name) []) --|
berghofe@17144
   998
  P.$$$ "contains" --
berghofe@17144
   999
  (   Scan.repeat1 (P.name --| P.$$$ "=" -- P.term)
berghofe@17144
  1000
   || Scan.repeat1 (P.term >> pair "")) >>
berghofe@17144
  1001
  (fn ((((mode', module), opt_fname), modules), xs) => Toplevel.theory (fn thy =>
wenzelm@28271
  1002
    let
wenzelm@28271
  1003
      val mode'' = (if lib then insert (op =) "library" else I) (remove (op =) "library" mode');
wenzelm@32966
  1004
      val (code, gr) = setmp_CRITICAL mode mode'' (generate_code thy modules module) xs;
wenzelm@28271
  1005
      val thy' = thy |> Context.theory_map (ML_Context.exec (fn () =>
wenzelm@28271
  1006
        (case opt_fname of
wenzelm@28271
  1007
          NONE => ML_Context.eval false Position.none (cat_lines (map snd code))
wenzelm@28271
  1008
        | SOME fname =>
wenzelm@28271
  1009
            if lib then app (fn (name, s) => File.write
wenzelm@28271
  1010
                (Path.append (Path.explode fname) (Path.basic (name ^ ".ML"))) s)
wenzelm@28271
  1011
              (("ROOT", implode (map (fn (name, _) =>
wenzelm@28271
  1012
                  "use \"" ^ name ^ ".ML\";\n") code)) :: code)
wenzelm@28271
  1013
            else File.write (Path.explode fname) (snd (hd code)))));
wenzelm@28271
  1014
    in
wenzelm@28271
  1015
      if lib then thy'
wenzelm@28271
  1016
      else map_modules (Symtab.update (module, gr)) thy'
wenzelm@28271
  1017
    end));
berghofe@17144
  1018
haftmann@28227
  1019
val setup = add_codegen "default" default_codegen
haftmann@28227
  1020
  #> add_tycodegen "default" default_tycodegen
berghofe@28640
  1021
  #> add_preprocessor unfold_preprocessor;
haftmann@28227
  1022
wenzelm@24867
  1023
val _ =
berghofe@17144
  1024
  OuterSyntax.command "code_library"
berghofe@17144
  1025
    "generates code for terms (one structure for each theory)" K.thy_decl
berghofe@17144
  1026
    (parse_code true);
berghofe@17144
  1027
wenzelm@24867
  1028
val _ =
berghofe@17144
  1029
  OuterSyntax.command "code_module"
berghofe@17144
  1030
    "generates code for terms (single structure, incremental)" K.thy_decl
berghofe@17144
  1031
    (parse_code false);
berghofe@11520
  1032
berghofe@11520
  1033
end;