Project

General

Profile

Download (20 KB) Statistics
| Branch: | Tag: | Revision:
1
(********************************************************************)
2
(*                                                                  *)
3
(*  The LustreC compiler toolset   /  The LustreC Development Team  *)
4
(*  Copyright 2012 -    --   ONERA - CNRS - INPT                    *)
5
(*                                                                  *)
6
(*  LustreC is free software, distributed WITHOUT ANY WARRANTY      *)
7
(*  under the terms of the GNU Lesser General Public License        *)
8
(*  version 2.1.                                                    *)
9
(*                                                                  *)
10
(********************************************************************)
11

    
12
open Lustre_types
13
open Machine_code_types
14
open Machine_code_common
15
open Spec_types
16
open Spec_common
17
open Corelang
18
open Clocks
19
open Causality
20
open Utils
21

    
22
exception NormalizationError
23

    
24
(* Questions:
25

    
26
   - where are used the mconst. They contain initialization of constant in
27
   nodes. But they do not seem to be used by c_backend *)
28

    
29
(* translate_<foo> : vars -> context -> <foo> -> machine code/expression *)
30
(* the context contains  m : state aka memory variables  *)
31
(*                      si : initialization instructions *)
32
(*                       j : node aka machine instances  *)
33
(*                       d : local variables             *)
34
(*                       s : step instructions           *)
35

    
36
(* Machine processing requires knowledge about variables and local variables.
37
   Local could be memories while other could not. *)
38
type machine_env = { is_local : string -> bool; get_var : string -> var_decl }
39

    
40
let build_env inputs locals outputs =
41
  let all = List.sort_uniq VDeclModule.compare (locals @ inputs @ outputs) in
42
  {
43
    is_local = (fun id -> List.exists (fun v -> v.var_id = id) locals);
44
    get_var =
45
      (fun id ->
46
        try List.find (fun v -> v.var_id = id) all
47
        with Not_found ->
48
          (* Format.eprintf "Impossible to find variable %s in set %a@.@?" * id
49
             * VSet.pp all; *)
50
          raise Not_found);
51
  }
52

    
53
(****************************************************************)
54
(* Basic functions to translate to machine values, instructions *)
55
(****************************************************************)
56

    
57
let translate_ident env id =
58
  (* Format.eprintf "trnaslating ident: %s@." id; *)
59
  (* id is a var that shall be visible here , ie. in vars *)
60
  try
61
    let var_id = env.get_var id in
62
    vdecl_to_val var_id
63
  with Not_found -> (
64
    (* id is a constant *)
65
    try
66
      let vdecl =
67
        Corelang.var_decl_of_const
68
          (const_of_top (Hashtbl.find Corelang.consts_table id))
69
      in
70
      vdecl_to_val vdecl
71
    with Not_found -> (
72
      (* id is a tag, getting its type in the list of declared enums *)
73
      try id_to_tag id
74
      with Not_found ->
75
        Format.eprintf "internal error: Machine_code.translate_ident %s@.@?" id;
76
        assert false))
77

    
78
(* specialize predefined (polymorphic) operators wrt their instances, so that
79
   the C semantics is preserved *)
80
let specialize_to_c expr =
81
  match expr.expr_desc with
82
  | Expr_appl (id, e, r) ->
83
    if
84
      List.exists
85
        (fun e -> Types.is_bool_type e.expr_type)
86
        (expr_list_of_expr e)
87
    then
88
      let id = match id with "=" -> "equi" | "!=" -> "xor" | _ -> id in
89
      { expr with expr_desc = Expr_appl (id, e, r) }
90
    else expr
91
  | _ ->
92
    expr
93

    
94
let specialize_op expr =
95
  match !Options.output with "C" -> specialize_to_c expr | _ -> expr
96

    
97
let rec translate_expr env expr =
98
  let expr = specialize_op expr in
99
  let translate_expr = translate_expr env in
100
  let value_desc =
101
    match expr.expr_desc with
102
    | Expr_const v ->
103
      Cst v
104
    | Expr_ident x ->
105
      (translate_ident env x).value_desc
106
    | Expr_array el ->
107
      Array (List.map translate_expr el)
108
    | Expr_access (t, i) ->
109
      Access (translate_expr t, translate_expr (expr_of_dimension i))
110
    | Expr_power (e, n) ->
111
      Power (translate_expr e, translate_expr (expr_of_dimension n))
112
    | Expr_when (e1, _, _) ->
113
      (translate_expr e1).value_desc
114
    | Expr_appl (id, e, _) when Basic_library.is_expr_internal_fun expr ->
115
      let nd = node_from_name id in
116
      Fun (node_name nd, List.map translate_expr (expr_list_of_expr e))
117
    | Expr_ite (g, t, e) when Backends.is_functional () ->
118
      (* special treatment depending on the active backend. For functional ones,
119
         like horn backend, ite are preserved in expression. While they are
120
         removed for C or Java backends. *)
121
      Fun ("ite", [ translate_expr g; translate_expr t; translate_expr e ])
122
    | _ ->
123
      Format.eprintf "Normalization error for backend %s: %a@." !Options.output
124
        Printers.pp_expr expr;
125
      raise NormalizationError
126
  in
127
  mk_val value_desc expr.expr_type
128

    
129
let translate_guard env expr =
130
  match expr.expr_desc with
131
  | Expr_ident x ->
132
    translate_ident env x
133
  | _ ->
134
    Format.eprintf "internal error: translate_guard %a@." Printers.pp_expr expr;
135
    assert false
136

    
137
let rec translate_act env (y, expr) =
138
  let translate_act = translate_act env in
139
  let translate_guard = translate_guard env in
140
  let translate_expr = translate_expr env in
141
  let lustre_eq = Corelang.mkeq Location.dummy_loc ([ y.var_id ], expr) in
142
  match expr.expr_desc with
143
  | Expr_ite (c, t, e) ->
144
    let c = translate_guard c in
145
    let t, spec_t = translate_act (y, t) in
146
    let e, spec_e = translate_act (y, e) in
147
    mk_conditional ~lustre_eq c [ t ] [ e ], mk_conditional_tr c spec_t spec_e
148
  | Expr_merge (x, hl) ->
149
    let var_x = env.get_var x in
150
    let hl, spec_hl =
151
      List.(
152
        split
153
          (map
154
             (fun (t, h) ->
155
               let h, spec_h = translate_act (y, h) in
156
               (t, [ h ]), (t, spec_h))
157
             hl))
158
    in
159
    mk_branch' ~lustre_eq var_x hl, mk_branch_tr var_x spec_hl
160
  | _ ->
161
    let e = translate_expr expr in
162
    mk_assign ~lustre_eq y e, mk_assign_tr y e
163

    
164
let get_memory env mems eq =
165
  match eq.eq_lhs, eq.eq_rhs.expr_desc with
166
  | ([ x ], Expr_pre _ | [ x ], Expr_fby _) when env.is_local x ->
167
    let var_x = env.get_var x in
168
    VSet.add var_x mems
169
  | _ ->
170
    mems
171

    
172
let get_memories env = List.fold_left (get_memory env) VSet.empty
173

    
174
(* Datastructure updated while visiting equations *)
175
type machine_ctx = {
176
  (* memories *)
177
  m : ISet.t;
178
  (* Reset instructions *)
179
  si : instr_t list;
180
  (* Instances *)
181
  j : (Lustre_types.top_decl * Dimension.dim_expr list) IMap.t;
182
  (* Step instructions *)
183
  s : instr_t list;
184
  (* Memory pack spec *)
185
  mp : mc_formula_t list;
186
  (* Transition spec *)
187
  t :
188
    (var_decl list
189
    (* vars *)
190
    * ISet.t (* memory footprint *)
191
    * ident IMap.t
192
    (* memory instances footprint *)
193
    * mc_formula_t)
194
    (* formula *)
195
    list;
196
}
197

    
198
let ctx_init =
199
  { m = ISet.empty; si = []; j = IMap.empty; s = []; mp = []; t = [] }
200

    
201
(****************************************************************)
202
(* Main function to translate equations into this machine context we are
203
   building *)
204
(****************************************************************)
205

    
206
let mk_control v l inst = mkinstr (MBranch (vdecl_to_val v, [ l, [ inst ] ]))
207

    
208
let control_on_clock env ck inst =
209
  let rec aux ((fspec, inst) as acc) ck =
210
    match (Clocks.repr ck).cdesc with
211
    | Con (ck, cr, l) ->
212
      let id = Clocks.const_of_carrier cr in
213
      let v = env.get_var id in
214
      aux
215
        ( (fun spec -> Imply (Equal (Var v, Tag l), fspec spec)),
216
          mk_control v l inst )
217
        ck
218
    | _ ->
219
      acc
220
  in
221
  let fspec, inst = aux ((fun spec -> spec), inst) ck in
222
  fspec, inst
223

    
224
let reset_instance env i r c =
225
  match r with
226
  | Some r ->
227
    let r = translate_guard env r in
228
    let _, inst =
229
      control_on_clock env c
230
        (mk_conditional r [ mkinstr (MSetReset i) ] [ mkinstr (MNoReset i) ])
231
    in
232
    Some r, [ inst ]
233
  | None ->
234
    None, []
235

    
236
let translate_eq env ctx nd inputs locals outputs i eq =
237
  let id = nd.node_id in
238
  let translate_expr = translate_expr env in
239
  let translate_act = translate_act env in
240
  let locals_pi = Lustre_live.inter_live_i_with id (i - 1) locals in
241
  let outputs_pi = Lustre_live.inter_live_i_with id (i - 1) outputs in
242
  let locals_i = Lustre_live.inter_live_i_with id i locals in
243
  let outputs_i = Lustre_live.inter_live_i_with id i outputs in
244
  let pred_mp ctx a = And [ mk_memory_pack ~i:(i - 1) id; a ] :: ctx.mp in
245
  let pred_t ctx a =
246
    ( inputs @ locals_i @ outputs_i,
247
      ctx.m,
248
      IMap.map (fun (td, _) -> node_name td) ctx.j,
249
      Exists
250
        ( Lustre_live.existential_vars id i eq (locals @ outputs),
251
          And
252
            [
253
              mk_transition ~i:(i - 1) id
254
                (vdecls_to_vals (inputs @ locals_pi @ outputs_pi));
255
              a;
256
            ] ) )
257
    :: ctx.t
258
  in
259
  let control_on_clock ck inst spec_mp spec_t ctx =
260
    let fspec, inst = control_on_clock env ck inst in
261
    {
262
      ctx with
263
      s =
264
        {
265
          inst with
266
          instr_spec =
267
            (if fst (get_stateless_status_node nd) then []
268
            else [ mk_memory_pack ~i id ])
269
            @ [
270
                mk_transition ~i id
271
                  (vdecls_to_vals (inputs @ locals_i @ outputs_i));
272
              ];
273
        }
274
        :: ctx.s;
275
      mp = pred_mp ctx spec_mp;
276
      t = pred_t ctx (fspec spec_t);
277
    }
278
  in
279
  let reset_instance = reset_instance env in
280
  let mkinstr' = mkinstr ~lustre_eq:eq in
281
  let ctl ?(ck = eq.eq_rhs.expr_clock) instr =
282
    control_on_clock ck (mkinstr' instr)
283
  in
284

    
285
  (* Format.eprintf "translate_eq %a with clock %a@." Printers.pp_node_eq eq
286
     Clocks.print_ck eq.eq_rhs.expr_clock; *)
287
  match eq.eq_lhs, eq.eq_rhs.expr_desc with
288
  | [ x ], Expr_arrow (e1, e2) ->
289
    let var_x = env.get_var x in
290
    let td = Arrow.arrow_top_decl () in
291
    let inst = new_instance td eq.eq_rhs.expr_tag in
292
    let c1 = translate_expr e1 in
293
    let c2 = translate_expr e2 in
294
    assert (c1.value_desc = Cst (Const_tag "true"));
295
    assert (c2.value_desc = Cst (Const_tag "false"));
296
    let ctx =
297
      ctl
298
        (MStep ([ var_x ], inst, [ c1; c2 ]))
299
        (mk_memory_pack ~inst (node_name td))
300
        (mk_transition ~inst (node_name td) [ vdecl_to_val var_x ])
301
        { ctx with j = IMap.add inst (td, []) ctx.j }
302
    in
303
    { ctx with si = mkinstr (MSetReset inst) :: ctx.si }
304
  | [ x ], Expr_pre e when env.is_local x ->
305
    let var_x = env.get_var x in
306
    let e = translate_expr e in
307
    ctl
308
      (MStateAssign (var_x, e))
309
      (mk_state_variable_pack var_x)
310
      (mk_state_assign_tr var_x e)
311
      { ctx with m = ISet.add x ctx.m }
312
  | [ x ], Expr_fby (e1, e2) when env.is_local x ->
313
    let var_x = env.get_var x in
314
    let e2 = translate_expr e2 in
315
    let ctx =
316
      ctl
317
        (MStateAssign (var_x, e2))
318
        (mk_state_variable_pack var_x)
319
        (mk_state_assign_tr var_x e2)
320
        { ctx with m = ISet.add x ctx.m }
321
    in
322
    {
323
      ctx with
324
      si = mkinstr' (MStateAssign (var_x, translate_expr e1)) :: ctx.si;
325
    }
326
  | p, Expr_appl (f, arg, r)
327
    when not (Basic_library.is_expr_internal_fun eq.eq_rhs) ->
328
    let var_p = List.map env.get_var p in
329
    let el = expr_list_of_expr arg in
330
    let vl = List.map translate_expr el in
331
    let node_f = node_from_name f in
332
    let call_f = node_f, NodeDep.filter_static_inputs (node_inputs node_f) el in
333
    let inst = new_instance node_f eq.eq_rhs.expr_tag in
334
    let env_cks =
335
      List.fold_right
336
        (fun arg cks -> arg.expr_clock :: cks)
337
        el [ eq.eq_rhs.expr_clock ]
338
    in
339
    let call_ck =
340
      Clock_calculus.compute_root_clock (Clock_predef.ck_tuple env_cks)
341
    in
342
    let r, reset_inst = reset_instance inst r call_ck in
343
    let ctx =
344
      ctl ~ck:call_ck
345
        (MStep (var_p, inst, vl))
346
        (mk_memory_pack ~inst (node_name node_f))
347
        (mk_transition ?r ~inst (node_name node_f) (vl @ vdecls_to_vals var_p))
348
        {
349
          ctx with
350
          j = IMap.add inst call_f ctx.j;
351
          s = (if Stateless.check_node node_f then [] else reset_inst) @ ctx.s;
352
        }
353
    in
354
    (*Clocks.new_var true in Clock_calculus.unify_imported_clock (Some call_ck)
355
      eq.eq_rhs.expr_clock eq.eq_rhs.expr_loc; Format.eprintf "call %a: %a:
356
      %a@," Printers.pp_expr eq.eq_rhs Clocks.print_ck (Clock_predef.ck_tuple
357
      env_cks) Clocks.print_ck call_ck;*)
358
    {
359
      ctx with
360
      si =
361
        (if Stateless.check_node node_f then ctx.si
362
        else mkinstr (MSetReset inst) :: ctx.si);
363
    }
364
  | [ x ], _ ->
365
    let var_x = env.get_var x in
366
    let instr, spec = translate_act (var_x, eq.eq_rhs) in
367
    control_on_clock eq.eq_rhs.expr_clock instr True spec ctx
368
  | _ ->
369
    Format.eprintf "internal error: Machine_code.translate_eq %a@?"
370
      Printers.pp_node_eq eq;
371
    assert false
372

    
373
let constant_equations locals =
374
  List.fold_left
375
    (fun eqs vdecl ->
376
      if vdecl.var_dec_const then
377
        {
378
          eq_lhs = [ vdecl.var_id ];
379
          eq_rhs = desome vdecl.var_dec_value;
380
          eq_loc = vdecl.var_loc;
381
        }
382
        :: eqs
383
      else eqs)
384
    [] locals
385

    
386
let translate_eqs env ctx nd inputs locals outputs eqs =
387
  List.fold_left
388
    (fun (ctx, i) eq ->
389
      let ctx = translate_eq env ctx nd inputs locals outputs i eq in
390
      ctx, i + 1)
391
    (ctx, 1) eqs
392
  |> fst
393

    
394
(****************************************************************)
395
(* Processing nodes *)
396
(****************************************************************)
397

    
398
let process_asserts nd =
399
  let exprl = List.map (fun assert_ -> assert_.assert_expr) nd.node_asserts in
400
  if Backends.is_functional () then [], [], exprl
401
  else
402
    (* Each assert(e) is associated to a fresh variable v and declared as v=e;
403
       assert (v); *)
404
    let _, vars, eql, assertl =
405
      List.fold_left
406
        (fun (i, vars, eqlist, assertlist) expr ->
407
          let loc = expr.expr_loc in
408
          let var_id = nd.node_id ^ "_assert_" ^ string_of_int i in
409
          let assert_var =
410
            mkvar_decl loc ~orig:false
411
              (* fresh var *)
412
              ( var_id,
413
                mktyp loc Tydec_bool,
414
                mkclock loc Ckdec_any,
415
                false,
416
                (* not a constant *)
417
                None,
418
                (* no default value *)
419
                Some nd.node_id )
420
          in
421
          assert_var.var_type <- Type_predef.type_bool
422
          (* Types.new_ty (Types.Tbool) *);
423
          let eq = mkeq loc ([ var_id ], expr) in
424
          ( i + 1,
425
            assert_var :: vars,
426
            eq :: eqlist,
427
            { expr with expr_desc = Expr_ident var_id } :: assertlist ))
428
        (1, [], [], []) exprl
429
    in
430
    vars, eql, assertl
431

    
432
let translate_core env nd sorted_eqs inputs locals outputs =
433
  let constant_eqs = constant_equations locals in
434

    
435
  (* Compute constants' instructions *)
436
  let ctx0 = translate_eqs env ctx_init nd inputs locals outputs constant_eqs in
437
  assert (ctx0.si = []);
438
  assert (IMap.is_empty ctx0.j);
439

    
440
  (* Compute ctx for all eqs *)
441
  let ctx = translate_eqs env ctx_init nd inputs locals outputs sorted_eqs in
442

    
443
  ctx, ctx0.s
444

    
445
let zero = mk_val (Cst (Const_int 0)) Type_predef.type_int
446

    
447
let memory_pack_0 nd =
448
  {
449
    mpname = nd;
450
    mpindex = Some 0;
451
    mpformula =
452
      And [ StateVarPack ResetFlag; Equal (Memory ResetFlag, Val zero) ];
453
  }
454

    
455
let memory_pack_toplevel nd i =
456
  {
457
    mpname = nd;
458
    mpindex = None;
459
    mpformula =
460
      Ternary
461
        (Memory ResetFlag, StateVarPack ResetFlag, mk_memory_pack ~i nd.node_id);
462
  }
463

    
464
let transition_0 nd =
465
  {
466
    tname = nd;
467
    tindex = Some 0;
468
    tvars = nd.node_inputs;
469
    tformula = True;
470
    tmem_footprint = ISet.empty;
471
    tinst_footprint = IMap.empty;
472
  }
473

    
474
let transition_toplevel nd i =
475
  let tr =
476
    mk_transition nd.node_id ~i
477
      (vdecls_to_vals (nd.node_inputs @ nd.node_outputs))
478
  in
479
  {
480
    tname = nd;
481
    tindex = None;
482
    tvars = nd.node_inputs @ nd.node_outputs;
483
    tformula =
484
      (if fst (get_stateless_status_node nd) then tr
485
      else ExistsMem (nd.node_id, Predicate (ResetCleared nd.node_id), tr));
486
    tmem_footprint = ISet.empty;
487
    tinst_footprint = IMap.empty;
488
  }
489

    
490
let translate_decl nd sch =
491
  (* Format.eprintf "Translating node %s@." nd.node_id; *)
492
  (* Extracting eqs, variables ..  *)
493
  let eqs, auts = get_node_eqs nd in
494
  assert (auts = []);
495

    
496
  (* Automata should be expanded by now *)
497

    
498
  (* In case of non functional backend (eg. C), additional local variables have
499
     to be declared for each assert *)
500
  let new_locals, assert_instrs, nd_node_asserts = process_asserts nd in
501

    
502
  (* Build the env: variables visible in the current scope *)
503
  let locals = nd.node_locals @ new_locals in
504
  (* let locals = VSet.of_list locals_list in *)
505
  (* let inout_vars = nd.node_inputs @ nd.node_outputs in *)
506
  let env = build_env nd.node_inputs locals nd.node_outputs in
507

    
508
  (* Format.eprintf "Node content is %a@." Printers.pp_node nd; *)
509

    
510
  (* Computing main content *)
511
  (* Format.eprintf "ok1@.@?"; *)
512
  let schedule = sch.Scheduling_type.schedule in
513
  (* Format.eprintf "ok2@.@?"; *)
514
  let sorted_eqs, unused =
515
    Scheduling.sort_equations_from_schedule eqs schedule
516
  in
517

    
518
  (* Format.eprintf "ok3@.locals=%a@.inout:%a@?"
519
   *   VSet.pp locals
520
   *   VSet.pp inout_vars
521
   * ; *)
522
  let equations = assert_instrs @ sorted_eqs in
523
  let mems = get_memories env equations in
524
  (* Removing computed memories from locals. We also removed unused variables. *)
525
  let locals =
526
    List.filter
527
      (fun v -> (not (VSet.mem v mems)) && not (List.mem v.var_id unused))
528
      locals
529
  in
530
  (* Compute live sets for spec *)
531
  Lustre_live.set_live_of nd.node_id nd.node_outputs locals equations;
532

    
533
  (* Translate equations *)
534
  let ctx, ctx0_s =
535
    translate_core env nd equations nd.node_inputs locals nd.node_outputs
536
  in
537

    
538
  (* Format.eprintf "ok4@.@?"; *)
539

    
540
  (* Build the machine *)
541
  let mmap = IMap.bindings ctx.j in
542
  let mmemory_packs =
543
    memory_pack_0 nd
544
    ::
545
    List.mapi
546
      (fun i f -> { mpname = nd; mpindex = Some (i + 1); mpformula = red f })
547
      (List.rev ctx.mp)
548
    @ [ memory_pack_toplevel nd (List.length ctx.mp) ]
549
  in
550
  let mtransitions =
551
    transition_0 nd
552
    ::
553
    List.mapi
554
      (fun i (tvars, tmem_footprint, tinst_footprint, f) ->
555
        {
556
          tname = nd;
557
          tindex = Some (i + 1);
558
          tvars;
559
          tformula = red f;
560
          tmem_footprint;
561
          tinst_footprint;
562
        })
563
      (List.rev ctx.t)
564
    @ [ transition_toplevel nd (List.length ctx.t) ]
565
  in
566
  let clear_reset =
567
    mkinstr
568
      ~instr_spec:
569
        ((if fst (get_stateless_status_node nd) then []
570
         else [ mk_memory_pack ~i:0 nd.node_id ])
571
        @ [ mk_transition ~i:0 nd.node_id (vdecls_to_vals nd.node_inputs) ])
572
      MClearReset
573
  in
574
  {
575
    mname = nd;
576
    mmemory = VSet.elements mems;
577
    mcalls = mmap;
578
    minstances =
579
      List.filter (fun (_, (n, _)) -> not (Stateless.check_node n)) mmap;
580
    minit = List.rev ctx.si;
581
    mconst = List.rev ctx0_s;
582
    mstatic = List.filter (fun v -> v.var_dec_const) nd.node_inputs;
583
    mstep =
584
      {
585
        step_inputs = nd.node_inputs;
586
        step_outputs = nd.node_outputs;
587
        step_locals = locals;
588
        step_checks =
589
          List.map
590
            (fun d ->
591
              d.Dimension.dim_loc, translate_expr env (expr_of_dimension d))
592
            nd.node_checks;
593
        step_instrs =
594
          clear_reset
595
          ::
596
          (* special treatment depending on the active backend. For horn
597
             backend, common branches are not merged while they are in C or Java
598
             backends. *)
599
          (if !Backends.join_guards then join_guards_list (List.rev ctx.s)
600
          else List.rev ctx.s);
601
        step_asserts = List.map (translate_expr env) nd_node_asserts;
602
      };
603
    (* Processing spec: there is no processing performed here. Contract have
604
       been processed already. Either one of the other machine is a cocospec
605
       node, or the current one is a cocospec node. Contract do not contain any
606
       statement or import. *)
607
    mspec = { mnode_spec = nd.node_spec; mtransitions; mmemory_packs };
608
    mannot = nd.node_annot;
609
    msch = Some sch;
610
  }
611

    
612
(** takes the global declarations and the scheduling associated to each node *)
613
let translate_prog decls node_schs =
614
  let nodes = get_nodes decls in
615
  let machines =
616
    List.map
617
      (fun decl ->
618
        let node = node_of_top decl in
619
        let sch = IMap.find node.node_id node_schs in
620
        translate_decl node sch)
621
      nodes
622
  in
623
  machines
624

    
625
(* Local Variables: *)
626
(* compile-command:"make -C .." *)
627
(* End: *)
(31-31/66)