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