-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathprofile.c
1393 lines (1227 loc) · 30.3 KB
/
profile.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* profile.c - gawk bytecode pretty-printer with counts
*/
/*
* Copyright (C) 1999-2013 the Free Software Foundation, Inc.
*
* This file is part of GAWK, the GNU implementation of the
* AWK Programming Language.
*
* GAWK is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* GAWK is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
*/
#include "awk.h"
static void pprint(INSTRUCTION *startp, INSTRUCTION *endp, bool in_for_header);
static void pp_parenthesize(NODE *n);
static void parenthesize(int type, NODE *left, NODE *right);
static char *pp_list(int nargs, const char *paren, const char *delim);
static char *pp_concat(const char *s1, const char *s2, const char *s3);
static int is_binary(int type);
static int prec_level(int type);
static void pp_push(int type, char *s, int flag);
static NODE *pp_pop(void);
static void pp_free(NODE *n);
const char *redir2str(int redirtype);
#define pp_str vname
#define pp_len sub.nodep.reserved
#define pp_next rnode
#define DONT_FREE 1
#define CAN_FREE 2
static RETSIGTYPE dump_and_exit(int signum) ATTRIBUTE_NORETURN;
static RETSIGTYPE just_dump(int signum);
/* pretty printing related functions and variables */
static NODE *pp_stack = NULL;
static NODE *func_params; /* function parameters */
static FILE *prof_fp; /* where to send the profile */
static long indent_level = 0;
#define SPACEOVER 0
/* set_prof_file --- set the output file for profiling or pretty-printing */
void
set_prof_file(const char *file)
{
assert(file != NULL);
prof_fp = fopen(file, "w");
if (prof_fp == NULL) {
warning(_("could not open `%s' for writing: %s"),
file, strerror(errno));
warning(_("sending profile to standard error"));
prof_fp = stderr;
}
}
/* init_profiling_signals --- set up signal handling for gawk --profile */
void
init_profiling_signals()
{
#ifdef __DJGPP__
signal(SIGINT, dump_and_exit);
signal(SIGQUIT, just_dump);
#else /* !__DJGPP__ */
#ifdef SIGHUP
signal(SIGHUP, dump_and_exit);
#endif
#ifdef SIGUSR1
signal(SIGUSR1, just_dump);
#endif
#endif /* !__DJGPP__ */
}
/* indent --- print out enough tabs */
static void
indent(long count)
{
int i;
if (count == 0)
fprintf(prof_fp, "\t");
else
fprintf(prof_fp, "%6ld ", count);
assert(indent_level >= 0);
for (i = 0; i < indent_level; i++)
fprintf(prof_fp, "\t");
}
/* indent_in --- increase the level, with error checking */
static void
indent_in(void)
{
assert(indent_level >= 0);
indent_level++;
}
/* indent_out --- decrease the level, with error checking */
static void
indent_out(void)
{
indent_level--;
assert(indent_level >= 0);
}
static void
pp_push(int type, char *s, int flag)
{
NODE *n;
getnode(n);
n->pp_str = s;
n->pp_len = strlen(s);
n->flags = flag;
n->type = type;
n->pp_next = pp_stack;
pp_stack = n;
}
static NODE *
pp_pop()
{
NODE *n;
n = pp_stack;
pp_stack = n->pp_next;
return n;
}
static void
pp_free(NODE *n)
{
if ((n->flags & CAN_FREE) != 0)
efree(n->pp_str);
freenode(n);
}
/*
* pprint --- pretty print a program segment
*/
static void
pprint(INSTRUCTION *startp, INSTRUCTION *endp, bool in_for_header)
{
INSTRUCTION *pc;
NODE *t1;
char *str;
NODE *t2;
INSTRUCTION *ip;
NODE *m;
char *tmp;
int rule;
static int rule_count[MAXRULE];
for (pc = startp; pc != endp; pc = pc->nexti) {
if (pc->source_line > 0)
sourceline = pc->source_line;
switch (pc->opcode) {
case Op_rule:
source = pc->source_file;
rule = pc->in_rule;
if (rule != Rule) {
if (! rule_count[rule]++)
fprintf(prof_fp, _("\t# %s block(s)\n\n"), ruletab[rule]);
fprintf(prof_fp, "\t%s {\n", ruletab[rule]);
ip = (pc + 1)->firsti;
} else {
if (! rule_count[rule]++)
fprintf(prof_fp, _("\t# Rule(s)\n\n"));
ip = pc->nexti;
indent(ip->exec_count);
if (ip != (pc + 1)->firsti) { /* non-empty pattern */
pprint(ip->nexti, (pc + 1)->firsti, false);
t1 = pp_pop();
fprintf(prof_fp, "%s {", t1->pp_str);
pp_free(t1);
ip = (pc + 1)->firsti;
if (do_profile && ip->exec_count > 0)
fprintf(prof_fp, " # %ld", ip->exec_count);
fprintf(prof_fp, "\n");
} else {
fprintf(prof_fp, "{\n");
ip = (pc + 1)->firsti;
}
ip = ip->nexti;
}
indent_in();
pprint(ip, (pc + 1)->lasti, false);
indent_out();
fprintf(prof_fp, "\t}\n\n");
pc = (pc + 1)->lasti;
break;
case Op_atexit:
break;
case Op_stop:
memset(rule_count, 0, MAXRULE * sizeof(int));
break;
case Op_push_i:
m = pc->memory;
if (m == Nnull_string) /* optional return or exit value; don't print 0 or "" */
pp_push(pc->opcode, m->stptr, DONT_FREE);
else if ((m->flags & NUMBER) != 0)
pp_push(pc->opcode, pp_number(m), CAN_FREE);
else {
str = pp_string(m->stptr, m->stlen, '"');
if ((m->flags & INTLSTR) != 0) {
char *tmp = str;
str = pp_concat("_", tmp, "");
efree(tmp);
}
pp_push(pc->opcode, str, CAN_FREE);
}
break;
case Op_store_var:
if (pc->initval != NULL)
pp_push(Op_push_i, pp_node(pc->initval), CAN_FREE);
/* fall through */
case Op_store_sub:
case Op_assign_concat:
case Op_push_lhs:
case Op_push_param:
case Op_push_array:
case Op_push:
case Op_push_arg:
m = pc->memory;
switch (m->type) {
case Node_param_list:
pp_push(pc->opcode, func_params[m->param_cnt].param, DONT_FREE);
break;
case Node_var:
case Node_var_new:
case Node_var_array:
if (m->vname != NULL)
pp_push(pc->opcode, m->vname, DONT_FREE);
else
fatal(_("internal error: %s with null vname"),
nodetype2str(m->type));
break;
default:
cant_happen();
}
switch (pc->opcode) {
case Op_store_var:
t2 = pp_pop(); /* l.h.s. */
t1 = pp_pop(); /* r.h.s. */
fprintf(prof_fp, "%s%s%s", t2->pp_str, op2str(pc->opcode), t1->pp_str);
goto cleanup;
case Op_store_sub:
t1 = pp_pop(); /* array */
tmp = pp_list(pc->expr_count, op2str(Op_subscript), ", "); /*subscript*/
t2 = pp_pop(); /* r.h.s. */
fprintf(prof_fp, "%s%s%s%s", t1->pp_str, tmp,
op2str(pc->opcode), t2->pp_str);
efree(tmp);
goto cleanup;
case Op_assign_concat:
t2 = pp_pop(); /* l.h.s. */
t1 = pp_pop();
tmp = pp_concat(t2->pp_str, op2str(Op_concat), t1->pp_str);
fprintf(prof_fp, "%s%s%s", t2->pp_str, op2str(Op_assign), tmp);
efree(tmp);
cleanup:
pp_free(t2);
pp_free(t1);
if (! in_for_header)
fprintf(prof_fp, "\n");
break;
default:
break;
}
break;
case Op_sub_array:
case Op_subscript_lhs:
case Op_subscript:
tmp = pp_list(pc->sub_count, op2str(pc->opcode), ", ");
t1 = pp_pop();
str = pp_concat(t1->pp_str, tmp, "");
efree(tmp);
pp_free(t1);
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_and:
case Op_or:
pprint(pc->nexti, pc->target_jmp, in_for_header);
t2 = pp_pop();
t1 = pp_pop();
parenthesize(pc->opcode, t1, t2);
str = pp_concat(t1->pp_str, op2str(pc->opcode), t2->pp_str);
pp_free(t1);
pp_free(t2);
pp_push(pc->opcode, str, CAN_FREE);
pc = pc->target_jmp;
break;
case Op_plus_i:
case Op_minus_i:
case Op_times_i:
case Op_exp_i:
case Op_quotient_i:
case Op_mod_i:
m = pc->memory;
t1 = pp_pop();
if (prec_level(pc->opcode) > prec_level(t1->type)
&& is_binary(t1->type)) /* (a - b) * 1 */
pp_parenthesize(t1);
if ((m->flags & NUMBER) != 0)
tmp = pp_number(m);
else
tmp = pp_string(m->stptr, m->stlen, '"');
str = pp_concat(t1->pp_str, op2str(pc->opcode), tmp);
efree(tmp);
pp_free(t1);
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_plus:
case Op_minus:
case Op_times:
case Op_exp:
case Op_quotient:
case Op_mod:
case Op_equal:
case Op_notequal:
case Op_less:
case Op_greater:
case Op_leq:
case Op_geq:
t2 = pp_pop();
t1 = pp_pop();
parenthesize(pc->opcode, t1, t2);
str = pp_concat(t1->pp_str, op2str(pc->opcode), t2->pp_str);
pp_free(t1);
pp_free(t2);
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_preincrement:
case Op_predecrement:
case Op_postincrement:
case Op_postdecrement:
t1 = pp_pop();
if (pc->opcode == Op_preincrement || pc->opcode == Op_predecrement)
str = pp_concat(op2str(pc->opcode), t1->pp_str, "");
else
str = pp_concat(t1->pp_str, op2str(pc->opcode), "");
pp_free(t1);
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_field_spec:
case Op_field_spec_lhs:
case Op_unary_minus:
case Op_not:
t1 = pp_pop();
if (is_binary(t1->type))
pp_parenthesize(t1);
/* optypes table (eval.c) includes space after ! */
str = pp_concat(op2str(pc->opcode), t1->pp_str, "");
pp_free(t1);
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_assign:
case Op_assign_plus:
case Op_assign_minus:
case Op_assign_times:
case Op_assign_quotient:
case Op_assign_mod:
case Op_assign_exp:
t2 = pp_pop(); /* l.h.s. */
t1 = pp_pop();
str = pp_concat(t2->pp_str, op2str(pc->opcode), t1->pp_str);
pp_free(t2);
pp_free(t1);
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_store_field:
t1 = pp_pop(); /* field num */
if (is_binary(t1->type))
pp_parenthesize(t1);
t2 = pp_pop(); /* r.h.s. */
fprintf(prof_fp, "$%s%s%s", t1->pp_str, op2str(pc->opcode), t2->pp_str);
pp_free(t2);
pp_free(t1);
if (! in_for_header)
fprintf(prof_fp, "\n");
break;
case Op_concat:
str = pp_list(pc->expr_count, NULL,
(pc->concat_flag & CSUBSEP) != 0 ? ", " : op2str(Op_concat));
pp_push(Op_concat, str, CAN_FREE);
break;
case Op_K_delete:
{
char *array;
t1 = pp_pop();
array = t1->pp_str;
if (pc->expr_count > 0) {
char *sub;
sub = pp_list(pc->expr_count, NULL, ", ");
fprintf(prof_fp, "%s %s[%s]", op2str(Op_K_delete), array, sub);
efree(sub);
} else
fprintf(prof_fp, "%s %s", op2str(Op_K_delete), array);
if (! in_for_header)
fprintf(prof_fp, "\n");
pp_free(t1);
}
break;
case Op_K_delete_loop:
/* Efficency hack not in effect because of exec_count instruction */
cant_happen();
break;
case Op_in_array:
{
char *array, *sub;
t1 = pp_pop();
array = t1->pp_str;
if (pc->expr_count > 1) {
sub = pp_list(pc->expr_count, "()", ", ");
str = pp_concat(sub, op2str(Op_in_array), array);
efree(sub);
} else {
t2 = pp_pop();
sub = t2->pp_str;
str = pp_concat(sub, op2str(Op_in_array), array);
pp_free(t2);
}
pp_free(t1);
pp_push(Op_in_array, str, CAN_FREE);
}
break;
case Op_var_update:
case Op_var_assign:
case Op_field_assign:
case Op_subscript_assign:
case Op_arrayfor_init:
case Op_arrayfor_incr:
case Op_arrayfor_final:
case Op_newfile:
case Op_get_record:
case Op_lint:
case Op_jmp:
case Op_jmp_false:
case Op_jmp_true:
case Op_no_op:
case Op_and_final:
case Op_or_final:
case Op_cond_pair:
case Op_after_beginfile:
case Op_after_endfile:
break;
case Op_sub_builtin:
{
const char *fname = "sub";
if ((pc->sub_flags & GSUB) != 0)
fname = "gsub";
else if ((pc->sub_flags & GENSUB) != 0)
fname = "gensub";
tmp = pp_list(pc->expr_count, "()", ", ");
str = pp_concat(fname, tmp, "");
efree(tmp);
pp_push(Op_sub_builtin, str, CAN_FREE);
}
break;
case Op_builtin:
case Op_ext_builtin:
{
const char *fname;
if (pc->opcode == Op_builtin)
fname = getfname(pc->builtin);
else
fname = (pc + 1)->func_name;
if (fname != NULL) {
if (pc->expr_count > 0) {
tmp = pp_list(pc->expr_count, "()", ", ");
str = pp_concat(fname, tmp, "");
efree(tmp);
} else
str = pp_concat(fname, "()", "");
pp_push(Op_builtin, str, CAN_FREE);
} else
fatal(_("internal error: builtin with null fname"));
}
break;
case Op_K_print:
case Op_K_printf:
case Op_K_print_rec:
if (pc->opcode == Op_K_print_rec)
tmp = pp_concat(" ", op2str(Op_field_spec), "0");
else if (pc->redir_type != 0)
tmp = pp_list(pc->expr_count, "()", ", ");
else {
tmp = pp_list(pc->expr_count, " ", ", ");
tmp[strlen(tmp) - 1] = '\0'; /* remove trailing space */
}
if (pc->redir_type != 0) {
t1 = pp_pop();
if (is_binary(t1->type))
pp_parenthesize(t1);
fprintf(prof_fp, "%s%s%s%s", op2str(pc->opcode),
tmp, redir2str(pc->redir_type), t1->pp_str);
pp_free(t1);
} else
fprintf(prof_fp, "%s%s", op2str(pc->opcode), tmp);
efree(tmp);
if (! in_for_header)
fprintf(prof_fp, "\n");
break;
case Op_push_re:
if (pc->memory->type != Node_regex)
break;
/* else
fall through */
case Op_match_rec:
{
NODE *re = pc->memory->re_exp;
str = pp_string(re->stptr, re->stlen, '/');
pp_push(pc->opcode, str, CAN_FREE);
}
break;
case Op_nomatch:
case Op_match:
{
char *restr, *txt;
t1 = pp_pop();
if (is_binary(t1->type))
pp_parenthesize(t1);
txt = t1->pp_str;
m = pc->memory;
if (m->type == Node_dynregex) {
restr = txt;
t2 = pp_pop();
if (is_binary(t2->type))
pp_parenthesize(t2);
txt = t2->pp_str;
str = pp_concat(txt, op2str(pc->opcode), restr);
pp_free(t2);
} else {
NODE *re = m->re_exp;
restr = pp_string(re->stptr, re->stlen, '/');
str = pp_concat(txt, op2str(pc->opcode), restr);
efree(restr);
}
pp_free(t1);
pp_push(pc->opcode, str, CAN_FREE);
}
break;
case Op_K_getline:
case Op_K_getline_redir:
if (pc->into_var) {
t1 = pp_pop();
tmp = pp_concat(op2str(Op_K_getline), " ", t1->pp_str);
pp_free(t1);
} else
tmp = pp_concat(op2str(Op_K_getline), "", "");
if (pc->redir_type != 0) {
int before = (pc->redir_type == redirect_pipein
|| pc->redir_type == redirect_twoway);
t2 = pp_pop();
if (is_binary(t2->type))
pp_parenthesize(t2);
if (before)
str = pp_concat(t2->pp_str, redir2str(pc->redir_type), tmp);
else
str = pp_concat(tmp, redir2str(pc->redir_type), t2->pp_str);
efree(tmp);
pp_free(t2);
} else
str = tmp;
pp_push(pc->opcode, str, CAN_FREE);
break;
case Op_indirect_func_call:
case Op_func_call:
{
char *fname = pc->func_name;
char *pre;
int pcount;
if (pc->opcode == Op_indirect_func_call)
pre = "@";
else
pre = "";
pcount = (pc + 1)->expr_count;
if (pcount > 0) {
tmp = pp_list(pcount, "()", ", ");
str = pp_concat(pre, fname, tmp);
efree(tmp);
} else
str = pp_concat(pre, fname, "()");
if (pc->opcode == Op_indirect_func_call) {
t1 = pp_pop(); /* indirect var */
pp_free(t1);
}
pp_push(pc->opcode, str, CAN_FREE);
}
break;
case Op_K_continue:
case Op_K_break:
case Op_K_nextfile:
case Op_K_next:
fprintf(prof_fp, "%s\n", op2str(pc->opcode));
break;
case Op_K_return:
case Op_K_exit:
t1 = pp_pop();
if (is_binary(t1->type))
pp_parenthesize(t1);
if (pc->source_line > 0) /* don't print implicit 'return' at end of function */
fprintf(prof_fp, "%s %s\n", op2str(pc->opcode), t1->pp_str);
pp_free(t1);
break;
case Op_pop:
t1 = pp_pop();
fprintf(prof_fp, "%s", t1->pp_str);
if (! in_for_header)
fprintf(prof_fp, "\n");
pp_free(t1);
break;
case Op_line_range:
ip = pc + 1;
pprint(pc->nexti, ip->condpair_left, false);
pprint(ip->condpair_left->nexti, ip->condpair_right, false);
t2 = pp_pop();
t1 = pp_pop();
str = pp_concat(t1->pp_str, ", ", t2->pp_str);
pp_free(t1);
pp_free(t2);
pp_push(Op_line_range, str, CAN_FREE);
pc = ip->condpair_right;
break;
case Op_K_while:
ip = pc + 1;
indent(ip->while_body->exec_count);
fprintf(prof_fp, "%s (", op2str(pc->opcode));
pprint(pc->nexti, ip->while_body, false);
t1 = pp_pop();
fprintf(prof_fp, "%s) {\n", t1->pp_str);
pp_free(t1);
indent_in();
pprint(ip->while_body->nexti, pc->target_break, false);
indent_out();
indent(SPACEOVER);
fprintf(prof_fp, "}\n");
pc = pc->target_break;
break;
case Op_K_do:
ip = pc + 1;
indent(pc->nexti->exec_count);
fprintf(prof_fp, "%s {\n", op2str(pc->opcode));
indent_in();
pprint(pc->nexti->nexti, ip->doloop_cond, false);
indent_out();
pprint(ip->doloop_cond, pc->target_break, false);
indent(SPACEOVER);
t1 = pp_pop();
fprintf(prof_fp, "} %s (%s)\n", op2str(Op_K_while), t1->pp_str);
pp_free(t1);
pc = pc->target_break;
break;
case Op_K_for:
ip = pc + 1;
indent(ip->forloop_body->exec_count);
fprintf(prof_fp, "%s (", op2str(pc->opcode));
pprint(pc->nexti, ip->forloop_cond, true);
fprintf(prof_fp, "; ");
if (ip->forloop_cond->opcode == Op_no_op &&
ip->forloop_cond->nexti == ip->forloop_body)
fprintf(prof_fp, "; ");
else {
pprint(ip->forloop_cond, ip->forloop_body, true);
t1 = pp_pop();
fprintf(prof_fp, "%s; ", t1->pp_str);
pp_free(t1);
}
pprint(pc->target_continue, pc->target_break, true);
fprintf(prof_fp, ") {\n");
indent_in();
pprint(ip->forloop_body->nexti, pc->target_continue, false);
indent_out();
indent(SPACEOVER);
fprintf(prof_fp, "}\n");
pc = pc->target_break;
break;
case Op_K_arrayfor:
{
char *array;
const char *item;
ip = pc + 1;
t1 = pp_pop();
array = t1->pp_str;
m = ip->forloop_cond->array_var;
if (m->type == Node_param_list)
item = func_params[m->param_cnt].param;
else
item = m->vname;
indent(ip->forloop_body->exec_count);
fprintf(prof_fp, "%s (%s%s%s) {\n", op2str(Op_K_arrayfor),
item, op2str(Op_in_array), array);
indent_in();
pp_free(t1);
pprint(ip->forloop_body->nexti, pc->target_break, false);
indent_out();
indent(SPACEOVER);
fprintf(prof_fp, "}\n");
pc = pc->target_break;
}
break;
case Op_K_switch:
ip = pc + 1;
fprintf(prof_fp, "%s (", op2str(pc->opcode));
pprint(pc->nexti, ip->switch_start, false);
t1 = pp_pop();
fprintf(prof_fp, "%s) {\n", t1->pp_str);
pp_free(t1);
pprint(ip->switch_start, ip->switch_end, false);
indent(SPACEOVER);
fprintf(prof_fp, "}\n");
pc = pc->target_break;
break;
case Op_K_case:
case Op_K_default:
indent(pc->stmt_start->exec_count);
if (pc->opcode == Op_K_case) {
t1 = pp_pop();
fprintf(prof_fp, "%s %s:\n", op2str(pc->opcode), t1->pp_str);
pp_free(t1);
} else
fprintf(prof_fp, "%s:\n", op2str(pc->opcode));
indent_in();
pprint(pc->stmt_start->nexti, pc->stmt_end->nexti, false);
indent_out();
break;
case Op_K_if:
fprintf(prof_fp, "%s (", op2str(pc->opcode));
pprint(pc->nexti, pc->branch_if, false);
t1 = pp_pop();
fprintf(prof_fp, "%s) {", t1->pp_str);
pp_free(t1);
ip = pc->branch_if;
if (ip->exec_count > 0)
fprintf(prof_fp, " # %ld", ip->exec_count);
fprintf(prof_fp, "\n");
indent_in();
pprint(ip->nexti, pc->branch_else, false);
indent_out();
pc = pc->branch_else;
if (pc->nexti->opcode == Op_no_op) {
indent(SPACEOVER);
fprintf(prof_fp, "}\n");
}
break;
case Op_K_else:
fprintf(prof_fp, "} %s {\n", op2str(pc->opcode));
indent_in();
pprint(pc->nexti, pc->branch_end, false);
indent_out();
indent(SPACEOVER);
fprintf(prof_fp, "}\n");
pc = pc->branch_end;
break;
case Op_cond_exp:
{
NODE *f, *t, *cond;
size_t len;
pprint(pc->nexti, pc->branch_if, false);
ip = pc->branch_if;
pprint(ip->nexti, pc->branch_else, false);
ip = pc->branch_else->nexti;
pc = ip->nexti;
assert(pc->opcode == Op_cond_exp);
pprint(pc->nexti, pc->branch_end, false);
f = pp_pop();
t = pp_pop();
cond = pp_pop();
len = f->pp_len + t->pp_len + cond->pp_len + 12;
emalloc(str, char *, len, "pprint");
sprintf(str, "(%s ? %s : %s)", cond->pp_str, t->pp_str, f->pp_str);
pp_free(cond);
pp_free(t);
pp_free(f);
pp_push(Op_cond_exp, str, CAN_FREE);
pc = pc->branch_end;
}
break;
case Op_exec_count:
if (! in_for_header)
indent(pc->exec_count);
break;
default:
cant_happen();
}
if (pc == endp)
break;
}
}
/* pp_string_fp --- printy print a string to the fp */
/*
* This routine concentrates string pretty printing in one place,
* so that it can be called from multiple places within gawk.
*/
void
pp_string_fp(Func_print print_func, FILE *fp, const char *in_str,
size_t len, int delim, bool breaklines)
{
char *s = pp_string(in_str, len, delim);
int count;
size_t slen;
const char *str = (const char *) s;
#define BREAKPOINT 70 /* arbitrary */
slen = strlen(str);
for (count = 0; slen > 0; slen--, str++) {
if (++count >= BREAKPOINT && breaklines) {
print_func(fp, "%c\n%c", delim, delim);
count = 0;
} else
print_func(fp, "%c", *str);
}
efree(s);
}
/* just_dump --- dump the profile and function stack and keep going */
static RETSIGTYPE
just_dump(int signum)
{
extern INSTRUCTION *code_block;
dump_prog(code_block);
dump_funcs();
dump_fcall_stack(prof_fp);
fflush(prof_fp);
signal(signum, just_dump); /* for OLD Unix systems ... */
}
/* dump_and_exit --- dump the profile, the function stack, and exit */
static RETSIGTYPE
dump_and_exit(int signum)
{
just_dump(signum);
final_exit(EXIT_FAILURE);
}
/* print_lib_list --- print a list of all libraries loaded */
static void
print_lib_list(FILE *prof_fp)
{
SRCFILE *s;
static bool printed_header = false;
for (s = srcfiles->next; s != srcfiles; s = s->next) {
if (s->stype == SRC_EXTLIB) {
if (! printed_header) {
printed_header = true;
fprintf(prof_fp, _("\t# Loaded extensions (-l and/or @load)\n\n"));
}
fprintf(prof_fp, "\t@load \"%s\"\n", s->src);
}
}
if (printed_header) /* we found some */
fprintf(prof_fp, "\n");
}
/* dump_prog --- dump the program */
/*
* XXX: I am not sure it is right to have the strings in the dump
* be translated, but I'll leave it alone for now.
*/
void
dump_prog(INSTRUCTION *code)
{
time_t now;
(void) time(& now);
/* \n on purpose, with \n in ctime() output */
fprintf(prof_fp, _("\t# gawk profile, created %s\n"), ctime(& now));
print_lib_list(prof_fp);
pprint(code, NULL, false);
}
/* prec_level --- return the precedence of an operator, for paren tests */
static int
prec_level(int type)
{
switch (type) {
case Op_push_lhs:
case Op_push_param:
case Op_push_array:
case Op_push:
case Op_push_i:
case Op_push_re:
case Op_match_rec:
case Op_subscript:
case Op_subscript_lhs:
case Op_func_call:
case Op_K_delete_loop:
case Op_builtin:
return 15;
case Op_field_spec:
case Op_field_spec_lhs:
return 14;
case Op_exp:
case Op_exp_i:
return 13;
case Op_preincrement:
case Op_predecrement:
case Op_postincrement: