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