src/Tools/Code/code_namespace.ML
author haftmann
Mon Feb 03 08:23:20 2014 +0100 (2014-02-03)
changeset 55292 1e973b665b98
parent 55291 82780e5f7622
child 55293 42cf5802d36a
permissions -rw-r--r--
tuned
haftmann@38970
     1
(*  Title:      Tools/Code/code_namespace.ML
haftmann@38970
     2
    Author:     Florian Haftmann, TU Muenchen
haftmann@38970
     3
haftmann@38970
     4
Mastering target language namespaces.
haftmann@38970
     5
*)
haftmann@38970
     6
haftmann@38970
     7
signature CODE_NAMESPACE =
haftmann@38970
     8
sig
haftmann@39208
     9
  type flat_program
haftmann@55147
    10
  val flat_program: Proof.context
haftmann@52138
    11
    -> { module_prefix: string, module_name: string,
haftmann@52138
    12
    reserved: Name.context, identifiers: Code_Target.identifier_data, empty_nsp: 'a,
haftmann@39208
    13
    namify_stmt: Code_Thingol.stmt -> string -> 'a -> string * 'a,
haftmann@39208
    14
    modify_stmt: Code_Thingol.stmt -> Code_Thingol.stmt option }
haftmann@39208
    15
      -> Code_Thingol.program
haftmann@55150
    16
      -> { deresolver: string -> Code_Symbol.T -> string,
haftmann@39208
    17
           flat_program: flat_program }
haftmann@39208
    18
haftmann@39017
    19
  datatype ('a, 'b) node =
haftmann@38970
    20
      Dummy
haftmann@39017
    21
    | Stmt of 'a
haftmann@55147
    22
    | Module of ('b * (string * ('a, 'b) node) Code_Symbol.Graph.T)
haftmann@39208
    23
  type ('a, 'b) hierarchical_program
haftmann@55147
    24
  val hierarchical_program: Proof.context
haftmann@52138
    25
    -> { module_name: string,
haftmann@52138
    26
    reserved: Name.context, identifiers: Code_Target.identifier_data,
haftmann@52138
    27
    empty_nsp: 'c, namify_module: string -> 'c -> string * 'c,
haftmann@39022
    28
    namify_stmt: Code_Thingol.stmt -> string -> 'c -> string * 'c,
haftmann@55150
    29
    cyclic_modules: bool, empty_data: 'b, memorize_data: Code_Symbol.T -> 'b -> 'b,
haftmann@55150
    30
    modify_stmts: (Code_Symbol.T * Code_Thingol.stmt) list -> 'a option list }
haftmann@38970
    31
      -> Code_Thingol.program
haftmann@55150
    32
      -> { deresolver: string list -> Code_Symbol.T -> string,
haftmann@39147
    33
           hierarchical_program: ('a, 'b) hierarchical_program }
haftmann@39147
    34
  val print_hierarchical: { print_module: string list -> string -> 'b -> 'c list -> 'c,
haftmann@55150
    35
    print_stmt: string list -> Code_Symbol.T * 'a -> 'c,
haftmann@39147
    36
    lift_markup: (Pretty.T -> Pretty.T) -> 'c -> 'c }
haftmann@39147
    37
      -> ('a, 'b) hierarchical_program -> 'c list
haftmann@38970
    38
end;
haftmann@38970
    39
haftmann@38970
    40
structure Code_Namespace : CODE_NAMESPACE =
haftmann@38970
    41
struct
haftmann@38970
    42
haftmann@52138
    43
(** fundamental module name hierarchy **)
haftmann@52138
    44
haftmann@55291
    45
fun module_fragments' { identifiers, reserved } name =
haftmann@55291
    46
  case Code_Symbol.lookup_module_data identifiers name of
haftmann@55291
    47
      SOME (fragments, _) => fragments
haftmann@55291
    48
    | NONE => map (fn fragment => fst (Name.variant fragment reserved)) (Long_Name.explode name);
haftmann@55291
    49
haftmann@55291
    50
fun module_fragments { module_name, identifiers, reserved } =
haftmann@55291
    51
  if module_name = ""
haftmann@55291
    52
  then module_fragments' { identifiers = identifiers, reserved = reserved }
haftmann@55291
    53
  else K (Long_Name.explode module_name);
haftmann@39055
    54
haftmann@55291
    55
fun build_module_namespace ctxt { module_prefix, module_name, identifiers, reserved } program =
haftmann@55291
    56
  let
haftmann@55291
    57
    val module_names = Code_Symbol.Graph.fold (insert (op =) o Code_Symbol.default_prefix ctxt o fst) program [];
haftmann@55291
    58
    val module_fragments' = module_fragments
haftmann@55291
    59
      { module_name = module_name, identifiers = identifiers, reserved = reserved };
haftmann@55291
    60
  in
haftmann@55291
    61
    fold (fn name => Symtab.update (name, Long_Name.explode module_prefix @ module_fragments' name))
haftmann@55291
    62
      module_names Symtab.empty
haftmann@55291
    63
  end;
haftmann@55291
    64
haftmann@55292
    65
fun prep_symbol ctxt { module_namespace, force_module, identifiers } sym =
haftmann@55291
    66
  case Code_Symbol.lookup identifiers sym of
haftmann@55292
    67
      NONE => ((the o Symtab.lookup module_namespace o Code_Symbol.default_prefix ctxt) sym,
haftmann@55292
    68
        Code_Symbol.default_base sym)
haftmann@53414
    69
    | SOME prefix_name => if null force_module then prefix_name
haftmann@53414
    70
        else (force_module, snd prefix_name);
haftmann@39055
    71
haftmann@55292
    72
fun build_proto_program { empty, add_stmt, add_dep } program =
haftmann@55292
    73
  empty
haftmann@55292
    74
  |> Code_Symbol.Graph.fold (fn (sym, (stmt, _)) => add_stmt sym stmt) program
haftmann@55292
    75
  |> Code_Symbol.Graph.fold (fn (sym, (_, (_, syms))) =>
haftmann@55292
    76
      Code_Symbol.Graph.Keys.fold (add_dep sym) syms) program;
haftmann@55292
    77
haftmann@39055
    78
haftmann@39208
    79
(** flat program structure **)
haftmann@39208
    80
haftmann@55150
    81
type flat_program = ((string * Code_Thingol.stmt option) Code_Symbol.Graph.T * (string * Code_Symbol.T list) list) Graph.T;
haftmann@39208
    82
haftmann@55147
    83
fun flat_program ctxt { module_prefix, module_name, reserved,
haftmann@52138
    84
    identifiers, empty_nsp, namify_stmt, modify_stmt } program =
haftmann@39208
    85
  let
haftmann@39208
    86
haftmann@39208
    87
    (* building module name hierarchy *)
haftmann@55291
    88
    val module_namespace = build_module_namespace ctxt { module_prefix = module_prefix,
haftmann@55291
    89
      module_name = module_name, identifiers = identifiers, reserved = reserved } program;
haftmann@55292
    90
    val prep_sym = prep_symbol ctxt { module_namespace = module_namespace,
haftmann@55292
    91
      force_module = Long_Name.explode module_name, identifiers = identifiers }
haftmann@52138
    92
      #>> Long_Name.implode;
haftmann@39208
    93
haftmann@39208
    94
    (* distribute statements over hierarchy *)
haftmann@55147
    95
    fun add_stmt sym stmt =
haftmann@39208
    96
      let
haftmann@55147
    97
        val (module_name, base) = prep_sym sym;
haftmann@39208
    98
      in
haftmann@55147
    99
        Graph.default_node (module_name, (Code_Symbol.Graph.empty, []))
haftmann@55147
   100
        #> (Graph.map_node module_name o apfst) (Code_Symbol.Graph.new_node (sym, (base, stmt)))
haftmann@39208
   101
      end;
haftmann@55292
   102
    fun add_dep sym sym' =
haftmann@39208
   103
      let
haftmann@55147
   104
        val (module_name, _) = prep_sym sym;
haftmann@55147
   105
        val (module_name', _) = prep_sym sym';
haftmann@39208
   106
      in if module_name = module_name'
haftmann@55147
   107
        then (Graph.map_node module_name o apfst) (Code_Symbol.Graph.add_edge (sym, sym'))
haftmann@55147
   108
        else (Graph.map_node module_name o apsnd) (AList.map_default (op =) (module_name', []) (insert (op =) sym'))
haftmann@39208
   109
      end;
haftmann@55292
   110
    val proto_program = build_proto_program
haftmann@55292
   111
      { empty = Graph.empty, add_stmt = add_stmt, add_dep = add_dep } program;
haftmann@39208
   112
haftmann@39208
   113
    (* name declarations and statement modifications *)
haftmann@55147
   114
    fun declare sym (base, stmt) (gr, nsp) = 
haftmann@39208
   115
      let
haftmann@39208
   116
        val (base', nsp') = namify_stmt stmt base nsp;
haftmann@55147
   117
        val gr' = (Code_Symbol.Graph.map_node sym o apfst) (K base') gr;
haftmann@39208
   118
      in (gr', nsp') end;
haftmann@39208
   119
    fun declarations gr = (gr, empty_nsp)
haftmann@55147
   120
      |> fold (fn sym => declare sym (Code_Symbol.Graph.get_node gr sym)) (Code_Symbol.Graph.keys gr) 
haftmann@39208
   121
      |> fst
haftmann@55147
   122
      |> (Code_Symbol.Graph.map o K o apsnd) modify_stmt;
haftmann@39208
   123
    val flat_program = proto_program
haftmann@39208
   124
      |> (Graph.map o K o apfst) declarations;
haftmann@39208
   125
haftmann@39208
   126
    (* qualified and unqualified imports, deresolving *)
haftmann@55147
   127
    fun base_deresolver sym = fst (Code_Symbol.Graph.get_node
haftmann@55147
   128
      (fst (Graph.get_node flat_program (fst (prep_sym sym)))) sym);
haftmann@39208
   129
    fun classify_names gr imports =
haftmann@39208
   130
      let
haftmann@39208
   131
        val import_tab = maps
haftmann@55147
   132
          (fn (module_name, syms) => map (rpair module_name) syms) imports;
haftmann@55147
   133
        val imported_syms = map fst import_tab;
haftmann@55147
   134
        val here_syms = Code_Symbol.Graph.keys gr;
haftmann@39208
   135
      in
haftmann@55147
   136
        Code_Symbol.Table.empty
haftmann@55147
   137
        |> fold (fn sym => Code_Symbol.Table.update (sym, base_deresolver sym)) here_syms
haftmann@55147
   138
        |> fold (fn sym => Code_Symbol.Table.update (sym,
haftmann@55147
   139
            Long_Name.append (the (AList.lookup (op =) import_tab sym))
haftmann@55147
   140
              (base_deresolver sym))) imported_syms
haftmann@39208
   141
      end;
haftmann@40630
   142
    val deresolver_tab = Symtab.make (AList.make
haftmann@40630
   143
      (uncurry classify_names o Graph.get_node flat_program)
haftmann@40630
   144
        (Graph.keys flat_program));
haftmann@55147
   145
    fun deresolver "" sym =
haftmann@55147
   146
          Long_Name.append (fst (prep_sym sym)) (base_deresolver sym)
haftmann@55147
   147
      | deresolver module_name sym =
haftmann@55147
   148
          the (Code_Symbol.Table.lookup (the (Symtab.lookup deresolver_tab module_name)) sym)
haftmann@52138
   149
          handle Option.Option => error ("Unknown statement name: "
haftmann@55147
   150
            ^ Code_Symbol.quote ctxt sym);
haftmann@39208
   151
haftmann@39208
   152
  in { deresolver = deresolver, flat_program = flat_program } end;
haftmann@39208
   153
haftmann@39208
   154
haftmann@39055
   155
(** hierarchical program structure **)
haftmann@38970
   156
haftmann@39017
   157
datatype ('a, 'b) node =
haftmann@38970
   158
    Dummy
haftmann@39017
   159
  | Stmt of 'a
haftmann@55147
   160
  | Module of ('b * (string * ('a, 'b) node) Code_Symbol.Graph.T);
haftmann@38970
   161
haftmann@55147
   162
type ('a, 'b) hierarchical_program = (string * ('a, 'b) node) Code_Symbol.Graph.T;
haftmann@39147
   163
haftmann@39018
   164
fun map_module_content f (Module content) = Module (f content);
haftmann@39018
   165
haftmann@39018
   166
fun map_module [] = I
haftmann@39018
   167
  | map_module (name_fragment :: name_fragments) =
haftmann@55147
   168
      apsnd o Code_Symbol.Graph.map_node (Code_Symbol.Module name_fragment) o apsnd o map_module_content
haftmann@39018
   169
        o map_module name_fragments;
haftmann@39018
   170
haftmann@55147
   171
fun hierarchical_program ctxt { module_name, reserved, identifiers, empty_nsp,
haftmann@39023
   172
      namify_module, namify_stmt, cyclic_modules, empty_data, memorize_data, modify_stmts } program =
haftmann@38970
   173
  let
haftmann@38970
   174
haftmann@38970
   175
    (* building module name hierarchy *)
haftmann@55291
   176
    val module_namespace = build_module_namespace ctxt { module_prefix = "",
haftmann@55291
   177
      module_name = module_name, identifiers = identifiers, reserved = reserved } program;
haftmann@55292
   178
    val prep_sym = prep_symbol ctxt { module_namespace = module_namespace,
haftmann@55292
   179
      force_module = Long_Name.explode module_name, identifiers = identifiers };
haftmann@38970
   180
haftmann@38970
   181
    (* building empty module hierarchy *)
haftmann@55147
   182
    val empty_module = (empty_data, Code_Symbol.Graph.empty);
haftmann@38970
   183
    fun ensure_module name_fragment (data, nodes) =
haftmann@55147
   184
      if can (Code_Symbol.Graph.get_node nodes) (Code_Symbol.Module name_fragment) then (data, nodes)
haftmann@38970
   185
      else (data,
haftmann@55147
   186
        nodes |> Code_Symbol.Graph.new_node (Code_Symbol.Module name_fragment, (name_fragment, Module empty_module)));
haftmann@38970
   187
    fun allocate_module [] = I
haftmann@38970
   188
      | allocate_module (name_fragment :: name_fragments) =
haftmann@38970
   189
          ensure_module name_fragment
haftmann@55147
   190
          #> (apsnd o Code_Symbol.Graph.map_node (Code_Symbol.Module name_fragment) o apsnd o map_module_content o allocate_module) name_fragments;
haftmann@52138
   191
    val empty_program =
haftmann@52138
   192
      empty_module
haftmann@55291
   193
      |> Symtab.fold (fn (_, fragments) => allocate_module fragments) module_namespace
haftmann@55147
   194
      |> Code_Symbol.Graph.fold (allocate_module o these o Option.map fst
haftmann@55291
   195
          o Code_Symbol.lookup identifiers o fst) program;
haftmann@38970
   196
haftmann@38970
   197
    (* distribute statements over hierarchy *)
haftmann@55147
   198
    fun add_stmt sym stmt =
haftmann@38970
   199
      let
haftmann@55147
   200
        val (name_fragments, base) = prep_sym sym;
haftmann@38970
   201
      in
haftmann@55147
   202
        (map_module name_fragments o apsnd) (Code_Symbol.Graph.new_node (sym, (base, Stmt stmt)))
haftmann@38970
   203
      end;
haftmann@55292
   204
    fun add_dep sym sym' =
haftmann@38970
   205
      let
haftmann@55147
   206
        val (name_fragments, _) = prep_sym sym;
haftmann@55147
   207
        val (name_fragments', _) = prep_sym sym';
haftmann@38970
   208
        val (name_fragments_common, (diff, diff')) =
haftmann@38970
   209
          chop_prefix (op =) (name_fragments, name_fragments');
haftmann@39023
   210
        val is_module = not (null diff andalso null diff');
haftmann@55147
   211
        val dep = pairself hd (map Code_Symbol.Module diff @ [sym], map Code_Symbol.Module diff' @ [sym']);
haftmann@38970
   212
        val add_edge = if is_module andalso not cyclic_modules
haftmann@55147
   213
          then (fn node => Code_Symbol.Graph.add_edge_acyclic dep node
haftmann@38970
   214
            handle Graph.CYCLES _ => error ("Dependency "
haftmann@55147
   215
              ^ Code_Symbol.quote ctxt sym ^ " -> "
haftmann@55147
   216
              ^ Code_Symbol.quote ctxt sym'
haftmann@38970
   217
              ^ " would result in module dependency cycle"))
haftmann@55147
   218
          else Code_Symbol.Graph.add_edge dep
haftmann@39018
   219
      in (map_module name_fragments_common o apsnd) add_edge end;
haftmann@55292
   220
    val proto_program = build_proto_program
haftmann@55292
   221
      { empty = empty_program, add_stmt = add_stmt, add_dep = add_dep } program;
haftmann@38970
   222
haftmann@39022
   223
    (* name declarations, data and statement modifications *)
haftmann@38970
   224
    fun make_declarations nsps (data, nodes) =
haftmann@38970
   225
      let
haftmann@55147
   226
        val (module_fragments, stmt_syms) = List.partition
haftmann@55147
   227
          (fn sym => case Code_Symbol.Graph.get_node nodes sym
haftmann@55147
   228
            of (_, Module _) => true | _ => false) (Code_Symbol.Graph.keys nodes);
haftmann@55147
   229
        fun declare namify sym (nsps, nodes) =
haftmann@38970
   230
          let
haftmann@55147
   231
            val (base, node) = Code_Symbol.Graph.get_node nodes sym;
haftmann@38970
   232
            val (base', nsps') = namify node base nsps;
haftmann@55147
   233
            val nodes' = Code_Symbol.Graph.map_node sym (K (base', node)) nodes;
haftmann@38970
   234
          in (nsps', nodes') end;
haftmann@38970
   235
        val (nsps', nodes') = (nsps, nodes)
haftmann@39022
   236
          |> fold (declare (K namify_module)) module_fragments
haftmann@55147
   237
          |> fold (declare (namify_stmt o (fn Stmt stmt => stmt))) stmt_syms;
haftmann@39029
   238
        fun zip_fillup xs ys = xs ~~ ys @ replicate (length xs - length ys) NONE;
haftmann@55147
   239
        fun select_syms syms = case filter (member (op =) stmt_syms) syms
haftmann@39029
   240
         of [] => NONE
haftmann@55147
   241
          | syms => SOME syms;
haftmann@55147
   242
        val modify_stmts' = AList.make (snd o Code_Symbol.Graph.get_node nodes)
haftmann@39023
   243
          #> split_list
haftmann@39023
   244
          ##> map (fn Stmt stmt => stmt)
haftmann@55147
   245
          #> (fn (syms, stmts) => zip_fillup syms (modify_stmts (syms ~~ stmts)));
haftmann@55147
   246
        val stmtss' = (maps modify_stmts' o map_filter select_syms o Code_Symbol.Graph.strong_conn) nodes;
haftmann@55147
   247
        val nodes'' = Code_Symbol.Graph.map (fn sym => apsnd (fn Module content => Module (make_declarations nsps' content)
haftmann@55147
   248
            | _ => case AList.lookup (op =) stmtss' sym of SOME (SOME stmt) => Stmt stmt | _ => Dummy)) nodes';
haftmann@55147
   249
        val data' = fold memorize_data stmt_syms data;
haftmann@39018
   250
      in (data', nodes'') end;
haftmann@38970
   251
    val (_, hierarchical_program) = make_declarations empty_nsp proto_program;
haftmann@38970
   252
haftmann@38970
   253
    (* deresolving *)
haftmann@55147
   254
    fun deresolver prefix_fragments sym =
haftmann@38970
   255
      let
haftmann@55147
   256
        val (name_fragments, _) = prep_sym sym;
haftmann@38970
   257
        val (_, (_, remainder)) = chop_prefix (op =) (prefix_fragments, name_fragments);
haftmann@55147
   258
        val nodes = fold (fn name_fragment => fn nodes => case Code_Symbol.Graph.get_node nodes (Code_Symbol.Module name_fragment)
haftmann@38970
   259
         of (_, Module (_, nodes)) => nodes) name_fragments hierarchical_program;
haftmann@55147
   260
        val (base', _) = Code_Symbol.Graph.get_node nodes sym;
haftmann@38970
   261
      in Long_Name.implode (remainder @ [base']) end
haftmann@55147
   262
        handle Code_Symbol.Graph.UNDEF _ => error ("Unknown statement name: "
haftmann@55147
   263
          ^ Code_Symbol.quote ctxt sym);
haftmann@38970
   264
haftmann@38970
   265
  in { deresolver = deresolver, hierarchical_program = hierarchical_program } end;
haftmann@38970
   266
haftmann@39147
   267
fun print_hierarchical { print_module, print_stmt, lift_markup } =
haftmann@39147
   268
  let
haftmann@39147
   269
    fun print_node _ (_, Dummy) =
haftmann@39147
   270
          NONE
haftmann@55147
   271
      | print_node prefix_fragments (sym, Stmt stmt) =
haftmann@55147
   272
          SOME (lift_markup (Code_Printer.markup_stmt sym)
haftmann@55147
   273
            (print_stmt prefix_fragments (sym, stmt)))
haftmann@55147
   274
      | print_node prefix_fragments (Code_Symbol.Module name_fragment, Module (data, nodes)) =
haftmann@39147
   275
          let
haftmann@39147
   276
            val prefix_fragments' = prefix_fragments @ [name_fragment]
haftmann@39147
   277
          in
haftmann@39147
   278
            Option.map (print_module prefix_fragments'
haftmann@39147
   279
              name_fragment data) (print_nodes prefix_fragments' nodes)
haftmann@39147
   280
          end
haftmann@39147
   281
    and print_nodes prefix_fragments nodes =
haftmann@39147
   282
      let
haftmann@55147
   283
        val xs = (map_filter (fn sym => print_node prefix_fragments
haftmann@55147
   284
          (sym, snd (Code_Symbol.Graph.get_node nodes sym))) o rev o flat o Code_Symbol.Graph.strong_conn) nodes
haftmann@39147
   285
      in if null xs then NONE else SOME xs end;
haftmann@39147
   286
  in these o print_nodes [] end;
haftmann@39147
   287
haftmann@55147
   288
end;