Coccinelle release 0.2.5-rc7.
[bpt/coccinelle.git] / parsing_c / pretty_print_c.ml
1 (* Yoann Padioleau, Julia Lawall
2 *
3 * Copyright (C) 2010, University of Copenhagen DIKU and INRIA.
4 * Copyright (C) 2006, 2007, 2008, 2009 Ecole des Mines de Nantes and DIKU
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License (GPL)
8 * version 2 as published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * file license.txt for more details.
14 *)
15 open Common
16
17 open Ast_c
18
19 module F = Control_flow_c
20
21 (*****************************************************************************)
22 (* Wrappers *)
23 (*****************************************************************************)
24 let pr2, pr2_once = Common.mk_pr2_wrappers Flag_parsing_c.verbose_unparsing
25
26 (*****************************************************************************)
27 (* Types *)
28 (*****************************************************************************)
29
30 type type_with_ident =
31 (string * Ast_c.info) option ->
32 (Ast_c.storage * Ast_c.il) option ->
33 Ast_c.fullType ->
34 Ast_c.attribute list -> unit
35
36 type 'a printer = 'a -> unit
37
38 type pretty_printers = {
39 expression : Ast_c.expression printer;
40 arg_list : (Ast_c.argument Ast_c.wrap2 list) printer;
41 statement : Ast_c.statement printer;
42 decl : Ast_c.declaration printer;
43 field : Ast_c.field printer;
44 init : Ast_c.initialiser printer;
45 param : Ast_c.parameterType printer;
46 paramlist : (Ast_c.parameterType Ast_c.wrap2 list) printer;
47 ty : Ast_c.fullType printer;
48 type_with_ident : type_with_ident;
49 toplevel : Ast_c.toplevel printer;
50 flow : Control_flow_c.node printer
51 }
52
53
54
55 (*****************************************************************************)
56
57 (* This module is used by unparse_c, but because unparse_c have also
58 * the list of tokens, pretty_print_c could be useless in the future
59 * (except that the ast_c have some fake tokens not present in the list
60 * of tokens so it's still useful). But this module is also useful to
61 * unparse C when you don't have the ordered list of tokens separately,
62 * or tokens without position information, for instance when you want
63 * to pretty print some piece of C that was generated, or some
64 * abstract-lined piece of code, etc. *)
65
66 let mk_pretty_printers
67 ~pr_elem ~pr_space
68 ~pr_nl ~pr_indent ~pr_outdent ~pr_unindent
69 =
70 let start_block () = pr_nl(); pr_indent() in
71 let end_block () = pr_unindent(); pr_nl() in
72
73 let indent_if_needed st f =
74 match Ast_c.unwrap_st st with
75 Compound _ -> pr_space(); f()
76 | _ ->
77 (*no newline at the end - someone else will do that*)
78 start_block(); f(); pr_unindent() in
79
80
81
82
83 let rec pp_expression = fun ((exp, typ), ii) ->
84 (match exp, ii with
85 | Ident (ident), [] -> pp_name ident
86 (* only a MultiString can have multiple ii *)
87 | Constant (MultiString _), is -> is +> List.iter pr_elem
88 | Constant (c), [i] -> pr_elem i
89 | FunCall (e, es), [i1;i2] ->
90 pp_expression e; pr_elem i1;
91 pp_arg_list es;
92 pr_elem i2;
93
94 | CondExpr (e1, e2, e3), [i1;i2] ->
95 pp_expression e1; pr_space(); pr_elem i1; pr_space();
96 do_option (function x -> pp_expression x; pr_space()) e2; pr_elem i2;
97 pr_space(); pp_expression e3
98 | Sequence (e1, e2), [i] ->
99 pp_expression e1; pr_elem i; pr_space(); pp_expression e2
100 | Assignment (e1, op, e2), [i] ->
101 pp_expression e1; pr_space(); pr_elem i; pr_space(); pp_expression e2
102
103 | Postfix (e, op), [i] -> pp_expression e; pr_elem i;
104 | Infix (e, op), [i] -> pr_elem i; pp_expression e;
105 | Unary (e, op), [i] -> pr_elem i; pp_expression e
106 | Binary (e1, op, e2), [i] ->
107 pp_expression e1; pr_space(); pr_elem i; pr_space(); pp_expression e2
108
109 | ArrayAccess (e1, e2), [i1;i2] ->
110 pp_expression e1; pr_elem i1; pp_expression e2; pr_elem i2
111 | RecordAccess (e, name), [i1] ->
112 pp_expression e; pr_elem i1; pp_name name;
113 | RecordPtAccess (e, name), [i1] ->
114 pp_expression e; pr_elem i1; pp_name name;
115
116 | SizeOfExpr (e), [i] ->
117 pr_elem i;
118 (match Ast_c.unwrap e with
119 ParenExpr (e), _ -> ()
120 | _ -> pr_space());
121 pp_expression e
122 | SizeOfType (t), [i1;i2;i3] ->
123 pr_elem i1; pr_elem i2; pp_type t; pr_elem i3
124 | Cast (t, e), [i1;i2] ->
125 pr_elem i1; pp_type t; pr_elem i2; pp_expression e
126
127 | StatementExpr (statxs, [ii1;ii2]), [i1;i2] ->
128 pr_elem i1;
129 pr_elem ii1;
130 statxs +> List.iter pp_statement_seq;
131 pr_elem ii2;
132 pr_elem i2;
133 | Constructor (t, xs), lp::rp::i1::i2::iicommaopt ->
134 pr_elem lp;
135 pp_type t;
136 pr_elem rp;
137 pr_elem i1;
138 xs +> List.iter (fun (x, ii) ->
139 assert (List.length ii <= 1);
140 ii +> List.iter (function x -> pr_elem x; pr_space());
141 pp_init x
142 );
143 iicommaopt +> List.iter pr_elem;
144 pr_elem i2;
145
146 | ParenExpr (e), [i1;i2] -> pr_elem i1; pp_expression e; pr_elem i2;
147
148 | New (t), [i1] -> pr_elem i1; pp_argument t
149 | Delete(t), [i1] -> pr_elem i1; pp_expression t
150
151 | (Ident (_) | Constant _ | FunCall (_,_) | CondExpr (_,_,_)
152 | Sequence (_,_)
153 | Assignment (_,_,_)
154 | Postfix (_,_) | Infix (_,_) | Unary (_,_) | Binary (_,_,_)
155 | ArrayAccess (_,_) | RecordAccess (_,_) | RecordPtAccess (_,_)
156 | SizeOfExpr (_) | SizeOfType (_) | Cast (_,_)
157 | StatementExpr (_) | Constructor _
158 | ParenExpr (_) | New (_) | Delete (_)),_ -> raise Impossible
159 );
160
161 if !Flag_parsing_c.pretty_print_type_info
162 then begin
163 pr_elem (Ast_c.fakeInfo() +> Ast_c.rewrap_str "/*");
164 !typ +>
165 (fun (ty,_test) -> ty +>
166 Common.do_option
167 (fun (x,l) -> pp_type x;
168 let s = match l with
169 Ast_c.LocalVar _ -> ", local"
170 | _ -> "" in
171 pr_elem (Ast_c.fakeInfo() +> Ast_c.rewrap_str s)));
172 pr_elem (Ast_c.fakeInfo() +> Ast_c.rewrap_str "*/");
173 end
174
175 and pp_arg_list es =
176 es +> List.iter (fun (e, opt) ->
177 assert (List.length opt <= 1); (* opt must be a comma? *)
178 opt +> List.iter (function x -> pr_elem x; pr_space());
179 pp_argument e)
180
181 and pp_argument argument =
182 let rec pp_action (ActMisc ii) = ii +> List.iter pr_elem in
183 match argument with
184 | Left e -> pp_expression e
185 | Right weird ->
186 (match weird with
187 | ArgType param -> pp_param param
188 | ArgAction action -> pp_action action)
189
190 (* ---------------------- *)
191 and pp_name = function
192 | RegularName (s, ii) ->
193 let (i1) = Common.tuple_of_list1 ii in
194 pr_elem i1
195 | CppConcatenatedName xs ->
196 xs +> List.iter (fun ((x,ii1), ii2) ->
197 ii2 +> List.iter pr_elem;
198 ii1 +> List.iter pr_elem;
199 )
200 | CppVariadicName (s, ii) ->
201 ii +> List.iter pr_elem
202 | CppIdentBuilder ((s,iis), xs) ->
203 let (iis, iop, icp) = Common.tuple_of_list3 iis in
204 pr_elem iis;
205 pr_elem iop;
206 xs +> List.iter (fun ((x,iix), iicomma) ->
207 iicomma +> List.iter pr_elem;
208 iix +> List.iter pr_elem;
209 );
210 pr_elem icp
211
212 (* ---------------------- *)
213 and pp_statement = fun st ->
214 match Ast_c.get_st_and_ii st with
215 | Labeled (Label (name, st)), ii ->
216 let (i2) = Common.tuple_of_list1 ii in
217 pr_outdent(); pp_name name; pr_elem i2; pr_nl(); pp_statement st
218 | Labeled (Case (e, st)), [i1;i2] ->
219 pr_unindent();
220 pr_elem i1; pp_expression e; pr_elem i2; pr_nl(); pr_indent();
221 pp_statement st
222 | Labeled (CaseRange (e, e2, st)), [i1;i2;i3] ->
223 pr_unindent();
224 pr_elem i1; pp_expression e; pr_elem i2; pp_expression e2; pr_elem i3;
225 pr_nl(); pr_indent();
226 pp_statement st
227 | Labeled (Default st), [i1;i2] ->
228 pr_unindent(); pr_elem i1; pr_elem i2; pr_nl(); pr_indent();
229 pp_statement st
230 | Compound statxs, [i1;i2] ->
231 pr_elem i1; start_block();
232 statxs +> Common.print_between pr_nl pp_statement_seq;
233 end_block(); pr_elem i2;
234
235 | ExprStatement (None), [i] -> pr_elem i;
236 | ExprStatement (None), [] -> ()
237 | ExprStatement (Some e), [i] -> pp_expression e; pr_elem i
238 (* the last ExprStatement of a for does not have a trailing
239 ';' hence the [] for ii *)
240 | ExprStatement (Some e), [] -> pp_expression e;
241 | Selection (If (e, st1, st2)), i1::i2::i3::is ->
242 pr_elem i1; pr_space(); pr_elem i2; pp_expression e; pr_elem i3;
243 indent_if_needed st1 (function _ -> pp_statement st1);
244 (match (Ast_c.get_st_and_ii st2, is) with
245 | ((ExprStatement None, []), []) -> ()
246 | ((ExprStatement None, []), [iifakend]) -> pr_elem iifakend
247 | _st2, [i4;iifakend] -> pr_elem i4;
248 indent_if_needed st2 (function _ -> pp_statement st2);
249 pr_elem iifakend
250 | x -> raise Impossible
251 )
252 | Selection (Switch (e, st)), [i1;i2;i3;iifakend] ->
253 pr_elem i1; pr_space(); pr_elem i2; pp_expression e; pr_elem i3;
254 indent_if_needed st (function _-> pp_statement st); pr_elem iifakend
255 | Iteration (While (e, st)), [i1;i2;i3;iifakend] ->
256 pr_elem i1; pr_space(); pr_elem i2; pp_expression e; pr_elem i3;
257 indent_if_needed st (function _-> pp_statement st); pr_elem iifakend
258 | Iteration (DoWhile (st, e)), [i1;i2;i3;i4;i5;iifakend] ->
259 pr_elem i1;
260 indent_if_needed st (function _ -> pp_statement st);
261 pr_elem i2; pr_elem i3; pp_expression e;
262 pr_elem i4; pr_elem i5;
263 pr_elem iifakend
264
265
266 | Iteration (For ((e1opt,il1),(e2opt,il2),(e3opt, il3),st)),
267 [i1;i2;i3;iifakend] ->
268
269 pr_elem i1; pr_space();
270 pr_elem i2;
271 pp_statement (Ast_c.mk_st (ExprStatement e1opt) il1);
272 pp_statement (Ast_c.mk_st (ExprStatement e2opt) il2);
273 assert (null il3);
274 pp_statement (Ast_c.mk_st (ExprStatement e3opt) il3);
275 pr_elem i3;
276 indent_if_needed st (function _ -> pp_statement st);
277 pr_elem iifakend
278
279 | Iteration (MacroIteration (s,es,st)), [i1;i2;i3;iifakend] ->
280 pr_elem i1; pr_space();
281 pr_elem i2;
282
283 es +> List.iter (fun (e, opt) ->
284 assert (List.length opt <= 1);
285 opt +> List.iter pr_elem;
286 pp_argument e;
287 );
288
289 pr_elem i3;
290 indent_if_needed st (function _ -> pp_statement st);
291 pr_elem iifakend
292
293 | Jump (Goto name), ii ->
294 let (i1, i3) = Common.tuple_of_list2 ii in
295 pr_elem i1; pr_space(); pp_name name; pr_elem i3;
296 | Jump ((Continue|Break|Return)), [i1;i2] -> pr_elem i1; pr_elem i2;
297 | Jump (ReturnExpr e), [i1;i2] ->
298 pr_elem i1; pr_space(); pp_expression e; pr_elem i2
299 | Jump (GotoComputed e), [i1;i2;i3] ->
300 pr_elem i1; pr_elem i2; pp_expression e; pr_elem i3
301
302 | Decl decl, [] -> pp_decl decl
303 | Asm asmbody, ii ->
304 (match ii with
305 | [iasm;iopar;icpar;iptvirg] ->
306 pr_elem iasm; pr_elem iopar;
307 pp_asmbody asmbody;
308 pr_elem icpar; pr_elem iptvirg
309 | [iasm;ivolatile;iopar;icpar;iptvirg] ->
310 pr_elem iasm; pr_elem ivolatile; pr_elem iopar;
311 pp_asmbody asmbody;
312 pr_elem icpar; pr_elem iptvirg
313 | _ -> raise Impossible
314 )
315
316 | NestedFunc def, ii ->
317 assert (null ii);
318 pp_def def
319 | MacroStmt, ii ->
320 ii +> List.iter pr_elem ;
321
322 | (Labeled (Case (_,_))
323 | Labeled (CaseRange (_,_,_)) | Labeled (Default _)
324 | Compound _ | ExprStatement _
325 | Selection (If (_, _, _)) | Selection (Switch (_, _))
326 | Iteration (While (_, _)) | Iteration (DoWhile (_, _))
327 | Iteration (For ((_,_), (_,_), (_, _), _))
328 | Iteration (MacroIteration (_,_,_))
329 | Jump ((Continue|Break|Return)) | Jump (ReturnExpr _)
330 | Jump (GotoComputed _)
331 | Decl _
332 ), _ -> raise Impossible
333
334 and pp_statement_seq = function
335 | StmtElem st -> pp_statement st
336 | IfdefStmt ifdef -> pp_ifdef ifdef
337 | CppDirectiveStmt cpp -> pp_directive cpp
338 | IfdefStmt2 (ifdef, xxs) -> pp_ifdef_tree_sequence ifdef xxs
339
340 (* ifdef XXX elsif YYY elsif ZZZ endif *)
341 and pp_ifdef_tree_sequence ifdef xxs =
342 match ifdef with
343 | if1::ifxs ->
344 pp_ifdef if1;
345 pp_ifdef_tree_sequence_aux ifxs xxs
346 | _ -> raise Impossible
347
348 (* XXX elsif YYY elsif ZZZ endif *)
349 and pp_ifdef_tree_sequence_aux ifdefs xxs =
350 Common.zip ifdefs xxs +> List.iter (fun (ifdef, xs) ->
351 xs +> List.iter pp_statement_seq;
352 pp_ifdef ifdef
353 )
354
355
356
357
358
359 (* ---------------------- *)
360 and pp_asmbody (string_list, colon_list) =
361 string_list +> List.iter pr_elem ;
362 colon_list +> List.iter (fun (Colon xs, ii) ->
363 ii +> List.iter pr_elem;
364 xs +> List.iter (fun (x,iicomma) ->
365 assert ((List.length iicomma) <= 1);
366 iicomma +> List.iter (function x -> pr_elem x; pr_space());
367 (match x with
368 | ColonMisc, ii -> ii +> List.iter pr_elem;
369 | ColonExpr e, [istring;iopar;icpar] ->
370 pr_elem istring;
371 pr_elem iopar;
372 pp_expression e;
373 pr_elem icpar
374 (* the following case used to be just raise Impossible, but
375 the code __asm__ __volatile__ ("dcbz 0, %[input]"
376 ::[input]"r"(&coherence_data[i]));
377 in linux-2.6.34/drivers/video/fsl-diu-fb.c matches this case *)
378 | (ColonExpr e), ii ->
379 (match List.rev ii with
380 icpar::iopar::istring::rest ->
381 List.iter pr_elem (List.rev rest);
382 pr_elem istring;
383 pr_elem iopar;
384 pp_expression e;
385 pr_elem icpar
386 | _ -> raise Impossible))
387 ))
388
389
390 (* ---------------------- *)
391
392 (*
393 pp_type_with_ident
394 pp_base_type
395 pp_type_with_ident_rest
396 pp_type_left
397 pp_type_right
398 pp_type
399
400 pp_decl
401 *)
402 and (pp_type_with_ident:
403 (string * info) option -> (storage * il) option ->
404 fullType -> attribute list ->
405 unit) =
406 fun ident sto ft attrs ->
407 pp_base_type ft sto;
408 (match (ident, Ast_c.unwrap_typeC ft) with
409 (Some _,_) | (_,Pointer _) -> pr_space()
410 | _ -> ());
411 pp_type_with_ident_rest ident ft attrs
412
413
414 and (pp_base_type: fullType -> (storage * il) option -> unit) =
415 fun (qu, (ty, iity)) sto ->
416 let get_sto sto =
417 match sto with
418 | None -> [] | Some (s, iis) -> (*assert (List.length iis = 1);*) iis
419 in
420 let print_sto_qu (sto, (qu, iiqu)) =
421 let all_ii = get_sto sto ++ iiqu in
422 all_ii
423 +> List.sort Ast_c.compare_pos
424 +> Common.print_between pr_space pr_elem
425
426 in
427 let print_sto_qu_ty (sto, (qu, iiqu), iity) =
428 let all_ii = get_sto sto ++ iiqu ++ iity in
429 let all_ii2 = all_ii +> List.sort Ast_c.compare_pos in
430
431 if all_ii <> all_ii2
432 then begin
433 (* TODO in fact for pointer, the qualifier is after the type
434 * cf -test strangeorder
435 *)
436 pr2 "STRANGEORDER";
437 all_ii2 +> Common.print_between pr_space pr_elem
438 end
439 else all_ii2 +> Common.print_between pr_space pr_elem
440 in
441
442 match ty, iity with
443 | (NoType,_) -> ()
444 | (Pointer t, [i]) -> pp_base_type t sto
445 | (ParenType t, _) -> pp_base_type t sto
446 | (Array (eopt, t), [i1;i2]) -> pp_base_type t sto
447 | (FunctionType (returnt, paramst), [i1;i2]) ->
448 pp_base_type returnt sto;
449
450
451 | (StructUnion (su, sopt, fields),iis) ->
452 print_sto_qu (sto, qu);
453
454 (match sopt,iis with
455 | Some s , [i1;i2;i3;i4] ->
456 pr_elem i1; pr_elem i2; pr_elem i3;
457 | None, [i1;i2;i3] ->
458 pr_elem i1; pr_elem i2;
459 | x -> raise Impossible
460 );
461
462 fields +> List.iter pp_field;
463
464 (match sopt,iis with
465 | Some s , [i1;i2;i3;i4] -> pr_elem i4
466 | None, [i1;i2;i3] -> pr_elem i3;
467 | x -> raise Impossible
468 );
469
470
471
472 | (Enum (sopt, enumt), iis) ->
473 print_sto_qu (sto, qu);
474
475 (match sopt, iis with
476 | (Some s, ([i1;i2;i3;i4]|[i1;i2;i3;i4;_])) ->
477 pr_elem i1; pr_elem i2; pr_elem i3;
478 | (None, ([i1;i2;i3]|[i1;i2;i3;_])) ->
479 pr_elem i1; pr_elem i2
480 | x -> raise Impossible
481 );
482
483 enumt +> List.iter (fun ((name, eopt), iicomma) ->
484 assert (List.length iicomma <= 1);
485 iicomma +> List.iter (function x -> pr_elem x; pr_space());
486 pp_name name;
487 eopt +> Common.do_option (fun (ieq, e) ->
488 pr_elem ieq;
489 pp_expression e;
490 ));
491
492 (match sopt, iis with
493 | (Some s, [i1;i2;i3;i4]) -> pr_elem i4
494 | (Some s, [i1;i2;i3;i4;i5]) ->
495 pr_elem i5; pr_elem i4 (* trailing comma *)
496 | (None, [i1;i2;i3]) -> pr_elem i3
497 | (None, [i1;i2;i3;i4]) ->
498 pr_elem i4; pr_elem i3 (* trailing comma *)
499
500
501 | x -> raise Impossible
502 );
503
504
505 | (BaseType _, iis) ->
506 print_sto_qu_ty (sto, qu, iis);
507
508 | (StructUnionName (s, structunion), iis) ->
509 assert (List.length iis =|= 2);
510 print_sto_qu_ty (sto, qu, iis);
511
512 | (EnumName s, iis) ->
513 assert (List.length iis =|= 2);
514 print_sto_qu_ty (sto, qu, iis);
515
516 | (TypeName (name,typ), noii) ->
517 assert (null noii);
518 let (_s, iis) = get_s_and_info_of_name name in
519 print_sto_qu_ty (sto, qu, [iis]);
520
521 if !Flag_parsing_c.pretty_print_typedef_value
522 then begin
523 pr_elem (Ast_c.fakeInfo() +> Ast_c.rewrap_str "{*");
524 typ +> Common.do_option (fun typ ->
525 pp_type typ;
526 );
527 pr_elem (Ast_c.fakeInfo() +> Ast_c.rewrap_str "*}");
528 end;
529
530 | (TypeOfExpr (e), iis) ->
531 print_sto_qu (sto, qu);
532 (match iis with
533 | [itypeof;iopar;icpar] ->
534 pr_elem itypeof; pr_elem iopar;
535 pp_expression e;
536 pr_elem icpar;
537 | _ -> raise Impossible
538 )
539
540 | (TypeOfType (t), iis) ->
541 print_sto_qu (sto, qu);
542 (match iis with
543 | [itypeof;iopar;icpar] ->
544 pr_elem itypeof; pr_elem iopar;
545 pp_type t;
546 pr_elem icpar;
547 | _ -> raise Impossible
548 )
549
550 | (Pointer _ | (*ParenType _ |*) Array _ | FunctionType _
551 (* | StructUnion _ | Enum _ | BaseType _ *)
552 (* | StructUnionName _ | EnumName _ | TypeName _ *)
553 (* | TypeOfExpr _ | TypeOfType _ *)
554 ), _ -> raise Impossible
555
556 and pp_field = function
557 DeclarationField(FieldDeclList(onefield_multivars,iiptvirg))->
558 (match onefield_multivars with
559 x::xs ->
560 (* handling the first var. Special case, with the
561 first var, we print the whole type *)
562
563 (match x with
564 (Simple (nameopt, typ)), iivirg ->
565 (* first var cant have a preceding ',' *)
566 assert (List.length iivirg =|= 0);
567 let identinfo =
568 match nameopt with
569 | None -> None
570 | Some name -> Some (get_s_and_info_of_name name)
571 in
572 pp_type_with_ident identinfo None typ Ast_c.noattr;
573
574 | (BitField (nameopt, typ, iidot, expr)), iivirg ->
575 (* first var cant have a preceding ',' *)
576 assert (List.length iivirg =|= 0);
577 (match nameopt with
578 | None ->
579 pp_type typ;
580 | Some name ->
581 let (s, is) = get_s_and_info_of_name name in
582 pp_type_with_ident
583 (Some (s, is)) None typ Ast_c.noattr;
584 );
585 pr_elem iidot;
586 pp_expression expr
587
588 ); (* match x, first onefield_multivars *)
589
590 (* for other vars *)
591 xs +> List.iter (function
592 | (Simple (nameopt, typ)), iivirg ->
593 iivirg +> List.iter pr_elem;
594 let identinfo =
595 match nameopt with
596 | None -> None
597 | Some name -> Some (get_s_and_info_of_name name)
598 in
599 pp_type_with_ident_rest identinfo typ Ast_c.noattr
600
601 | (BitField (nameopt, typ, iidot, expr)), iivirg ->
602 iivirg +> List.iter pr_elem;
603 (match nameopt with
604 | Some name ->
605 let (s,is) = get_s_and_info_of_name name in
606 pp_type_with_ident_rest
607 (Some (s, is)) typ Ast_c.noattr;
608 pr_elem iidot;
609 pp_expression expr
610 | None ->
611 (* was raise Impossible, but have no idea why because
612 nameless bit fields are accepted by the parser and
613 nothing seems to be done to give them names *)
614 pr_elem iidot;
615 pp_expression expr
616 )); (* iter other vars *)
617
618 | [] -> raise Impossible
619 ); (* onefield_multivars *)
620 assert (List.length iiptvirg =|= 1);
621 iiptvirg +> List.iter pr_elem;
622
623
624 | MacroDeclField ((s, es), ii) ->
625 let (iis, lp, rp, iiend, ifakestart) =
626 Common.tuple_of_list5 ii in
627 (* iis::lp::rp::iiend::ifakestart::iisto
628 iisto +> List.iter pr_elem; (* static and const *)
629 *)
630 pr_elem ifakestart;
631 pr_elem iis;
632 pr_elem lp;
633 es +> List.iter (fun (e, opt) ->
634 assert (List.length opt <= 1);
635 opt +> List.iter pr_elem;
636 pp_argument e;
637 );
638
639 pr_elem rp;
640 pr_elem iiend;
641
642
643
644 | EmptyField iipttvirg_when_emptyfield ->
645 pr_elem iipttvirg_when_emptyfield
646
647 | CppDirectiveStruct cpp -> pp_directive cpp
648 | IfdefStruct ifdef -> pp_ifdef ifdef
649
650 (* used because of DeclList, in int i,*j[23]; we dont print anymore the
651 int before *j *)
652 and (pp_type_with_ident_rest: (string * info) option ->
653 fullType -> attribute list -> unit) =
654
655 fun ident (((qu, iiqu), (ty, iity)) as fullt) attrs ->
656
657 let print_ident ident = Common.do_option (fun (s, iis) ->
658 (* XXX attrs +> pp_attributes pr_elem pr_space; *)
659 pr_elem iis
660 ) ident
661 in
662
663 match ty, iity with
664 (* the work is to do in base_type !! *)
665 | (NoType _, iis) -> failwith "printing notype"
666 | (BaseType _, iis) -> print_ident ident
667 | (Enum (sopt, enumt), iis) -> print_ident ident
668 | (StructUnion (_, sopt, fields),iis) -> print_ident ident
669 | (StructUnionName (s, structunion), iis) -> print_ident ident
670 | (EnumName s, iis) -> print_ident ident
671 | (TypeName (_name,_typ), iis) -> print_ident ident
672 | (TypeOfExpr (e), iis) -> print_ident ident
673 | (TypeOfType (e), iis) -> print_ident ident
674
675
676
677 | (Pointer t, [i]) ->
678 (* subtil: void ( *done)(int i) is a Pointer
679 (FunctionType (return=void, params=int i) *)
680 (*WRONG I THINK, use left & right function *)
681 (* bug: pp_type_with_ident_rest None t; print_ident ident *)
682 pr_elem i;
683 iiqu +> List.iter pr_elem; (* le const est forcement apres le '*' *)
684 pp_type_with_ident_rest ident t attrs;
685
686 (* ugly special case ... todo? maybe sufficient in practice *)
687 | (ParenType ttop, [i1;i2]) ->
688 (match Ast_c.get_ty_and_ii ttop with
689 | (_q1, (Pointer t2, [ipointer])) ->
690 (match Ast_c.get_ty_and_ii t2 with
691 | (q2, (FunctionType t, ii3)) ->
692
693 pp_type_left (q2, mk_tybis (FunctionType t) ii3);
694 pr_elem i1;
695 pr_elem ipointer;
696 print_ident ident;
697 pr_elem i2;
698 pp_type_right (q2, mk_tybis (FunctionType t) ii3);
699 | _ ->
700 pr2 "PB PARENTYPE ZARB, I forget about the ()";
701 pp_type_with_ident_rest ident ttop attrs;
702 )
703 (* another ugly special case *)
704 | _q1, (Array (eopt,t2 ), [iarray1;iarray2]) ->
705 (match Ast_c.get_ty_and_ii t2 with
706 | (_q2, (Pointer t3, [ipointer])) ->
707 (match Ast_c.get_ty_and_ii t3 with
708 | (q3, (FunctionType t, iifunc)) ->
709
710 pp_type_left (q3, mk_tybis (FunctionType t) iifunc);
711 pr_elem i1;
712 pr_elem ipointer;
713 print_ident ident;
714 pr_elem iarray1;
715 do_option pp_expression eopt;
716 pr_elem iarray2;
717 pr_elem i2;
718 pp_type_right (q3, mk_tybis (FunctionType t) iifunc)
719 | _ ->
720 pr2 "PB PARENTYPE ZARB, I forget about the ()";
721 pp_type_with_ident_rest ident ttop attrs;
722 )
723 | _ ->
724 pr2 "PB PARENTYPE ZARB, I forget about the ()";
725 pp_type_with_ident_rest ident ttop attrs;
726 )
727 | _t ->
728
729 pr2 "PB PARENTYPE ZARB, I forget about the ()";
730 pp_type_with_ident_rest ident ttop attrs;
731 )
732
733
734 | (Array (eopt, t), [i1;i2]) ->
735 pp_type_left fullt;
736
737 iiqu +> List.iter pr_elem;
738 print_ident ident;
739
740 pp_type_right fullt;
741
742
743 | (FunctionType (returnt, paramst), [i1;i2]) ->
744 pp_type_left fullt;
745
746 iiqu +> List.iter pr_elem;
747 print_ident ident;
748
749 pp_type_right fullt;
750
751
752 | (FunctionType _ | Array _ | ParenType _ | Pointer _), _ ->
753 raise Impossible
754
755
756 and (pp_type_left: fullType -> unit) =
757 fun ((qu, iiqu), (ty, iity)) ->
758 match ty, iity with
759 (NoType,_) -> failwith "pp_type_left: unexpected NoType"
760 | (Pointer t, [i]) ->
761 pr_elem i;
762 iiqu +> List.iter pr_elem; (* le const est forcement apres le '*' *)
763 pp_type_left t
764
765 | (Array (eopt, t), [i1;i2]) -> pp_type_left t
766 | (FunctionType (returnt, paramst), [i1;i2]) -> pp_type_left returnt
767
768 | (ParenType t, _) -> failwith "parenType"
769
770
771 | (BaseType _, iis) -> ()
772 | (Enum (sopt, enumt), iis) -> ()
773 | (StructUnion (_, sopt, fields),iis) -> ()
774 | (StructUnionName (s, structunion), iis) -> ()
775 | (EnumName s, iis) -> ()
776 | (TypeName (_name,_typ), iis) -> ()
777
778 | TypeOfType _, _ -> ()
779 | TypeOfExpr _, _ -> ()
780
781 | (FunctionType _ | Array _ | Pointer _), _ -> raise Impossible
782
783
784 and pp_param param =
785 let {p_namei = nameopt;
786 p_register = (b,iib);
787 p_type=t;} = param in
788
789 iib +> List.iter pr_elem;
790
791 match nameopt with
792 | None ->
793 pp_type t
794 | Some name ->
795 let (s,i1) = get_s_and_info_of_name name in
796 pp_type_with_ident
797 (Some (s, i1)) None t Ast_c.noattr
798
799
800
801
802 and pp_type_right (((qu, iiqu), (ty, iity)) : fullType) =
803 match ty, iity with
804 (NoType,_) -> failwith "pp_type_right: unexpected NoType"
805 | (Pointer t, [i]) -> pp_type_right t
806
807 | (Array (eopt, t), [i1;i2]) ->
808 pr_elem i1;
809 eopt +> do_option pp_expression;
810 pr_elem i2;
811 pp_type_right t
812
813 | (ParenType t, _) -> failwith "parenType"
814 | (FunctionType (returnt, paramst), [i1;i2]) ->
815 pr_elem i1;
816 (match paramst with
817 | (ts, (b, iib)) ->
818 ts +> List.iter (fun (param,iicomma) ->
819 assert ((List.length iicomma) <= 1);
820 iicomma +> List.iter (function x -> pr_elem x; pr_space());
821
822 pp_param param;
823 );
824 iib +> List.iter pr_elem;
825 );
826 pr_elem i2
827
828 | (BaseType _, iis) -> ()
829 | (Enum (sopt, enumt), iis) -> ()
830 | (StructUnion (_, sopt, fields),iis)-> ()
831 | (StructUnionName (s, structunion), iis) -> ()
832 | (EnumName s, iis) -> ()
833 | (TypeName (name,_typ), iis) -> ()
834
835 | TypeOfType _, _ -> ()
836 | TypeOfExpr _, _ -> ()
837
838 | (FunctionType _ | Array _ | Pointer _), _ -> raise Impossible
839
840 and pp_type t =
841 pp_type_with_ident None None t Ast_c.noattr
842
843 (* ---------------------- *)
844 and pp_decl = function
845 | DeclList ((({v_namei = var;
846 v_type = returnType;
847 v_storage = storage;
848 v_attr = attrs;
849 },[])::xs),
850 iivirg::ifakestart::iisto) ->
851
852 pr_elem ifakestart;
853
854 (* old: iisto +> List.iter pr_elem; *)
855
856
857 (* handling the first var. Special case, we print the whole type *)
858 (match var with
859 | Some (name, iniopt) ->
860 let (s,iis) = get_s_and_info_of_name name in
861 pp_type_with_ident
862 (Some (s, iis)) (Some (storage, iisto))
863 returnType attrs;
864 (match iniopt with
865 Ast_c.NoInit -> ()
866 | Ast_c.ValInit(iini,init) -> pr_elem iini; pp_init init
867 | Ast_c.ConstrInit((init,[lp;rp])) ->
868 pr_elem lp; pp_arg_list init; pr_elem rp
869 | Ast_c.ConstrInit _ -> raise Impossible)
870 | None -> pp_type returnType
871 );
872
873 (* for other vars, we just call pp_type_with_ident_rest. *)
874 xs +> List.iter (function
875 | ({v_namei = Some (name, iniopt);
876 v_type = returnType;
877 v_storage = storage2;
878 v_attr = attrs;
879 }, iivirg) ->
880
881 let (s,iis) = get_s_and_info_of_name name in
882 assert (storage2 =*= storage);
883 iivirg +> List.iter pr_elem;
884 pp_type_with_ident_rest
885 (Some (s, iis)) returnType attrs;
886 (match iniopt with
887 Ast_c.NoInit -> ()
888 | Ast_c.ValInit(iini,init) -> pr_elem iini; pp_init init
889 | Ast_c.ConstrInit((init,[lp;rp])) ->
890 pr_elem lp; pp_arg_list init; pr_elem rp
891 | Ast_c.ConstrInit _ -> raise Impossible);
892
893
894 | x -> raise Impossible
895 );
896
897 pr_elem iivirg;
898
899 | MacroDecl ((s, es), iis::lp::rp::iiend::ifakestart::iisto) ->
900 pr_elem ifakestart;
901 iisto +> List.iter pr_elem; (* static and const *)
902 pr_elem iis;
903 pr_elem lp;
904 es +> List.iter (fun (e, opt) ->
905 assert (List.length opt <= 1);
906 opt +> List.iter pr_elem;
907 pp_argument e;
908 );
909
910 pr_elem rp;
911 pr_elem iiend;
912
913 | (DeclList (_, _) | (MacroDecl _)) -> raise Impossible
914
915
916 (* ---------------------- *)
917 and pp_init (init, iinit) =
918 match init, iinit with
919 | InitExpr e, [] -> pp_expression e;
920 | InitList xs, i1::i2::iicommaopt ->
921 pr_elem i1; start_block();
922 xs +> List.iter (fun (x, ii) ->
923 assert (List.length ii <= 1);
924 ii +> List.iter (function e -> pr_elem e; pr_nl());
925 pp_init x
926 );
927 iicommaopt +> List.iter pr_elem;
928 end_block();
929 pr_elem i2;
930
931 | InitDesignators (xs, initialiser), [i1] -> (* : *)
932 xs +> List.iter pp_designator;
933 pr_elem i1;
934 pp_init initialiser
935
936 (* no use of '=' in the "Old" style *)
937 | InitFieldOld (string, initialiser), [i1;i2] -> (* label: in oldgcc *)
938 pr_elem i1; pr_elem i2; pp_init initialiser
939 | InitIndexOld (expression, initialiser), [i1;i2] -> (* [1] in oldgcc *)
940 pr_elem i1; pp_expression expression; pr_elem i2;
941 pp_init initialiser
942
943 | (InitIndexOld _ | InitFieldOld _ | InitDesignators _
944 | InitList _ | InitExpr _
945 ), _ -> raise Impossible
946
947
948
949 and pp_designator = function
950 | DesignatorField (s), [i1; i2] ->
951 pr_elem i1; pr_elem i2;
952 | DesignatorIndex (expression), [i1;i2] ->
953 pr_elem i1; pp_expression expression; pr_elem i2;
954
955 | DesignatorRange (e1, e2), [iocro;iellipsis;iccro] ->
956 pr_elem iocro; pp_expression e1; pr_elem iellipsis;
957 pp_expression e2; pr_elem iccro;
958
959 | (DesignatorField _ | DesignatorIndex _ | DesignatorRange _
960 ), _ -> raise Impossible
961
962
963 (* ---------------------- *)
964 and pp_attributes pr_elem pr_space attrs =
965 attrs +> List.iter (fun (attr, ii) ->
966 ii +> List.iter pr_elem;
967 );
968
969 (* ---------------------- *)
970 and pp_def def =
971 let defbis, ii = def in
972 match ii with
973 | iifunc1::iifunc2::i1::i2::ifakestart::isto ->
974 let {f_name = name;
975 f_type = (returnt, (paramst, (b, iib)));
976 f_storage = sto;
977 f_body = statxs;
978 f_attr = attrs;
979 } = defbis
980 in
981 pr_elem ifakestart;
982
983 pp_type_with_ident None (Some (sto, isto))
984 returnt Ast_c.noattr;
985
986 pp_attributes pr_elem pr_space attrs;
987 pr_space();
988 pp_name name;
989
990 pr_elem iifunc1;
991
992 (* not anymore, cf tests/optional_name_parameter and
993 macro_parameter_shortcut.c
994 (match paramst with
995 | [(((bool, None, t), ii_b_s), iicomma)] ->
996 assert
997 (match t with
998 | qu, (BaseType Void, ii) -> true
999 | _ -> true
1000 );
1001 assert (null iicomma);
1002 assert (null ii_b_s);
1003 pp_type_with_ident None None t
1004
1005 | paramst ->
1006 paramst +> List.iter (fun (((bool, s, t), ii_b_s), iicomma) ->
1007 iicomma +> List.iter pr_elem;
1008
1009 (match b, s, ii_b_s with
1010 | false, Some s, [i1] ->
1011 pp_type_with_ident (Some (s, i1)) None t;
1012 | true, Some s, [i1;i2] ->
1013 pr_elem i1;
1014 pp_type_with_ident (Some (s, i2)) None t;
1015
1016 (* in definition we have name for params, except when f(void) *)
1017 | _, None, _ -> raise Impossible
1018 | false, None, [] ->
1019
1020 | _ -> raise Impossible
1021 )));
1022
1023 (* normally ii represent the ",..." but it is also abused
1024 with the f(void) case *)
1025 (* assert (List.length iib <= 2);*)
1026 iib +> List.iter pr_elem;
1027
1028 *)
1029 pp_param_list paramst;
1030 iib +> List.iter pr_elem;
1031
1032
1033 pr_elem iifunc2; pr_space();
1034 pr_elem i1;
1035 statxs +> List.iter pp_statement_seq;
1036 pr_elem i2;
1037 | _ -> raise Impossible
1038
1039 and pp_param_list paramst =
1040 paramst +> List.iter (fun (param,iicomma) ->
1041 assert ((List.length iicomma) <= 1);
1042 iicomma +> List.iter (function x -> pr_elem x; pr_space());
1043 pp_param param)
1044
1045 (* ---------------------- *)
1046
1047 and pp_ifdef ifdef =
1048 match ifdef with
1049 | IfdefDirective (ifdef, ii) ->
1050 List.iter pr_elem ii
1051
1052
1053 and pp_directive = function
1054 | Include {i_include = (s, ii);} ->
1055 let (i1,i2) = Common.tuple_of_list2 ii in
1056 pr_elem i1; pr_space(); pr_elem i2
1057 | Define ((s,ii), (defkind, defval)) ->
1058 let (idefine,iident,ieol) = Common.tuple_of_list3 ii in
1059 pr_elem idefine;
1060 pr_elem iident;
1061
1062 let define_val = function
1063 | DefineExpr e -> pp_expression e
1064 | DefineStmt st -> pp_statement st
1065 | DefineDoWhileZero ((st,e), ii) ->
1066 (match ii with
1067 | [ido;iwhile;iopar;icpar] ->
1068 pr_elem ido;
1069 pp_statement st;
1070 pr_elem iwhile; pr_elem iopar;
1071 pp_expression e;
1072 pr_elem icpar
1073 | _ -> raise Impossible
1074 )
1075 | DefineFunction def -> pp_def def
1076
1077 | DefineType ty -> pp_type ty
1078 | DefineText (s, ii) -> List.iter pr_elem ii
1079 | DefineEmpty -> ()
1080 | DefineInit ini -> pp_init ini
1081
1082 | DefineTodo -> pr2 "DefineTodo"
1083 in
1084 (match defkind with
1085 | DefineVar | Undef -> ()
1086 | DefineFunc (params, ii) ->
1087 let (i1,i2) = tuple_of_list2 ii in
1088 pr_elem i1;
1089 params +> List.iter (fun ((s,iis), iicomma) ->
1090 assert (List.length iicomma <= 1);
1091 iicomma +> List.iter pr_elem;
1092 iis +> List.iter pr_elem;
1093 );
1094 pr_elem i2;
1095 );
1096 define_val defval;
1097 pr_elem ieol
1098
1099 | PragmaAndCo (ii) ->
1100 List.iter pr_elem ii in
1101
1102
1103
1104
1105 let pp_toplevel = function
1106 | Declaration decl -> pp_decl decl
1107 | Definition def -> pp_def def
1108
1109 | CppTop directive -> pp_directive directive
1110
1111
1112 | MacroTop (s, es, [i1;i2;i3;i4]) ->
1113 pr_elem i1;
1114 pr_elem i2;
1115 es +> List.iter (fun (e, opt) ->
1116 assert (List.length opt <= 1);
1117 opt +> List.iter pr_elem;
1118 pp_argument e;
1119 );
1120 pr_elem i3;
1121 pr_elem i4;
1122
1123
1124 | EmptyDef ii -> ii +> List.iter pr_elem
1125 | NotParsedCorrectly ii ->
1126 assert (List.length ii >= 1);
1127 ii +> List.iter pr_elem
1128 | FinalDef info -> pr_elem (Ast_c.rewrap_str "" info)
1129
1130 | IfdefTop ifdefdir -> pp_ifdef ifdefdir
1131
1132 | (MacroTop _) -> raise Impossible in
1133
1134
1135
1136
1137 let pp_flow n =
1138 match F.unwrap n with
1139 | F.FunHeader ({f_name =idb;
1140 f_type = (rett, (paramst,(isvaargs,iidotsb)));
1141 f_storage = stob;
1142 f_body = body;
1143 f_attr = attrs},ii) ->
1144
1145 assert(null body);
1146 (*
1147 iif ii;
1148 iif iidotsb;
1149 attrs +> List.iter (vk_attribute bigf);
1150 vk_type bigf rett;
1151 paramst +> List.iter (fun (param, iicomma) ->
1152 vk_param bigf param;
1153 iif iicomma;
1154 );
1155 *)
1156 pr2 "Def";
1157
1158
1159 | F.Decl decl ->
1160 (* vk_decl bigf decl *)
1161 pr2 "Decl"
1162
1163 | F.ExprStatement (st, (eopt, ii)) ->
1164 pp_statement (Ast_c.mk_st (ExprStatement eopt) ii)
1165
1166 | F.IfHeader (_, (e,ii))
1167 | F.SwitchHeader (_, (e,ii))
1168 | F.WhileHeader (_, (e,ii))
1169 | F.DoWhileTail (e,ii) ->
1170 (*
1171 iif ii;
1172 vk_expr bigf e
1173 *)
1174 pr2 "XXX";
1175
1176
1177 | F.ForHeader (_st, (((e1opt,i1), (e2opt,i2), (e3opt,i3)), ii)) ->
1178 (*
1179 iif i1; iif i2; iif i3;
1180 iif ii;
1181 e1opt +> do_option (vk_expr bigf);
1182 e2opt +> do_option (vk_expr bigf);
1183 e3opt +> do_option (vk_expr bigf);
1184 *)
1185 pr2 "XXX"
1186
1187 | F.MacroIterHeader (_s, ((s,es), ii)) ->
1188 (*
1189 iif ii;
1190 vk_argument_list bigf es;
1191 *)
1192 pr2 "XXX"
1193
1194
1195 | F.ReturnExpr (_st, (e,ii)) ->
1196 (* iif ii; vk_expr bigf e*)
1197 pr2 "XXX"
1198
1199
1200 | F.Case (_st, (e,ii)) ->
1201 (* iif ii; vk_expr bigf e *)
1202 pr2 "XXX"
1203
1204 | F.CaseRange (_st, ((e1, e2),ii)) ->
1205 (* iif ii; vk_expr bigf e1; vk_expr bigf e2 *)
1206 pr2 "XXX"
1207
1208
1209
1210 | F.CaseNode i -> ()
1211
1212 | F.DefineExpr e ->
1213 (* vk_expr bigf e *)
1214 pr2 "XXX"
1215
1216 | F.DefineType ft ->
1217 (* vk_type bigf ft *)
1218 pr2 "XXX"
1219
1220 | F.DefineHeader ((s,ii), (defkind)) ->
1221 (*
1222 iif ii;
1223 vk_define_kind bigf defkind;
1224 *)
1225 pr2 "XXX"
1226
1227
1228 | F.DefineDoWhileZeroHeader (((),ii)) ->
1229 (* iif ii *)
1230 pr2 "XXX"
1231
1232
1233 | F.Include {i_include = (s, ii);} ->
1234 (* iif ii; *)
1235 pr2 "XXX"
1236
1237
1238 | F.MacroTop (s, args, ii) ->
1239 (* iif ii;
1240 vk_argument_list bigf args *)
1241 pr2 "XXX"
1242
1243
1244 | F.Break (st,((),ii)) ->
1245 (* iif ii *)
1246 pr2 "XXX"
1247 | F.Continue (st,((),ii)) ->
1248 (* iif ii *)
1249 pr2 "XXX"
1250 | F.Default (st,((),ii)) ->
1251 (* iif ii *)
1252 pr2 "XXX"
1253 | F.Return (st,((),ii)) ->
1254 (* iif ii *)
1255 pr2 "XXX"
1256 | F.Goto (st, name, ((),ii)) ->
1257 (* iif ii *)
1258 pr2 "XXX"
1259 | F.Label (st, name, ((),ii)) ->
1260 (* iif ii *)
1261 pr2 "XXX"
1262 | F.EndStatement iopt ->
1263 (* do_option infof iopt *)
1264 pr2 "XXX"
1265 | F.DoHeader (st, info) ->
1266 (* infof info *)
1267 pr2 "XXX"
1268 | F.Else info ->
1269 (* infof info *)
1270 pr2 "XXX"
1271 | F.SeqEnd (i, info) ->
1272 (* infof info *)
1273 pr2 "XXX"
1274 | F.SeqStart (st, i, info) ->
1275 (* infof info *)
1276 pr2 "XXX"
1277
1278 | F.MacroStmt (st, ((),ii)) ->
1279 (* iif ii *)
1280 pr2 "XXX"
1281 | F.Asm (st, (asmbody,ii)) ->
1282 (*
1283 iif ii;
1284 vk_asmbody bigf asmbody
1285 *)
1286 pr2 "XXX"
1287
1288
1289 | F.IfdefHeader (info) ->
1290 pp_ifdef info
1291 | F.IfdefElse (info) ->
1292 pp_ifdef info
1293 | F.IfdefEndif (info) ->
1294 pp_ifdef info
1295
1296 | F.DefineTodo ->
1297 pr2 "XXX"
1298
1299
1300 | (F.TopNode|F.EndNode|
1301 F.ErrorExit|F.Exit|F.Enter|F.LoopFallThroughNode|F.FallThroughNode|
1302 F.AfterNode|F.FalseNode|F.TrueNode|F.InLoopNode|
1303 F.Fake) ->
1304 pr2 "YYY" in
1305
1306
1307 { expression = pp_expression;
1308 arg_list = pp_arg_list;
1309 statement = pp_statement;
1310 decl = pp_decl;
1311 field = pp_field;
1312 init = pp_init;
1313 param = pp_param;
1314 paramlist = pp_param_list;
1315 ty = pp_type;
1316 type_with_ident = pp_type_with_ident;
1317 toplevel = pp_toplevel;
1318 flow = pp_flow;
1319 }
1320
1321 (*****************************************************************************)
1322
1323 (* Here we do not use (mcode, env). It is a simple C pretty printer. *)
1324 let pr_elem info =
1325 let s = Ast_c.str_of_info info in
1326 if !Flag_parsing_c.pretty_print_comment_info then begin
1327 let before = !(info.comments_tag).mbefore in
1328 if not (null before) then begin
1329 pp "-->";
1330 before +> List.iter (fun (comment_like, pinfo) ->
1331 let s = pinfo.Common.str in
1332 pp s
1333 );
1334 pp "<--";
1335 end;
1336 end;
1337 pp s
1338
1339 let pr_space _ = Format.print_space()
1340
1341 let pr_nl _ = ()
1342 let pr_indent _ = ()
1343 let pr_outdent _ = ()
1344 let pr_unindent _ = ()
1345
1346
1347 let ppc =
1348 mk_pretty_printers
1349 ~pr_elem ~pr_space ~pr_nl ~pr_outdent ~pr_indent ~pr_unindent
1350
1351 let pp_expression_simple = ppc.expression
1352 let pp_decl_simple = ppc.decl
1353 let pp_field_simple = ppc.field
1354 let pp_statement_simple = ppc.statement
1355 let pp_type_simple = ppc.ty
1356 let pp_init_simple = ppc.init
1357 let pp_toplevel_simple = ppc.toplevel
1358 let pp_flow_simple = ppc.flow
1359
1360
1361 let pp_elem_sp ~pr_elem ~pr_space =
1362 mk_pretty_printers
1363 ~pr_elem ~pr_space
1364 ~pr_nl ~pr_outdent ~pr_indent ~pr_unindent
1365
1366 let pp_expression_gen ~pr_elem ~pr_space =
1367 (pp_elem_sp pr_elem pr_space).expression
1368
1369 let pp_arg_list_gen ~pr_elem ~pr_space =
1370 (pp_elem_sp pr_elem pr_space).arg_list
1371
1372 let pp_statement_gen ~pr_elem ~pr_space =
1373 (pp_elem_sp pr_elem pr_space).statement
1374
1375 let pp_decl_gen ~pr_elem ~pr_space =
1376 (pp_elem_sp pr_elem pr_space).decl
1377
1378 let pp_field_gen ~pr_elem ~pr_space =
1379 (pp_elem_sp pr_elem pr_space).field
1380
1381 let pp_init_gen ~pr_elem ~pr_space =
1382 (pp_elem_sp pr_elem pr_space).init
1383
1384 let pp_param_gen ~pr_elem ~pr_space =
1385 (pp_elem_sp pr_elem pr_space).param
1386
1387 let pp_param_list_gen ~pr_elem ~pr_space =
1388 (pp_elem_sp pr_elem pr_space).paramlist
1389
1390 let pp_type_gen ~pr_elem ~pr_space =
1391 (pp_elem_sp pr_elem pr_space).ty
1392
1393 let pp_type_with_ident_gen pr_elem pr_space =
1394 (pp_elem_sp pr_elem pr_space).type_with_ident
1395
1396 let pp_program_gen ~pr_elem ~pr_space =
1397 (pp_elem_sp pr_elem pr_space).toplevel
1398
1399
1400 let string_of_expression e =
1401 Common.format_to_string (fun () ->
1402 pp_expression_simple e
1403 )
1404
1405 let string_of_toplevel top =
1406 Common.format_to_string (fun () ->
1407 pp_toplevel_simple top
1408 )
1409
1410 let (debug_info_of_node:
1411 Ograph_extended.nodei -> Control_flow_c.cflow -> string) =
1412 fun nodei flow ->
1413 let node = flow#nodes#assoc nodei in
1414 let s = Common.format_to_string (fun () ->
1415 pp_flow_simple node
1416 ) in
1417 let pos = Lib_parsing_c.min_pinfo_of_node node in
1418 (spf "%s(n%d)--> %s" (Common.string_of_parse_info_bis pos) nodei s)
1419