-
Notifications
You must be signed in to change notification settings - Fork 4
/
dbx.c
1796 lines (1630 loc) · 43.3 KB
/
dbx.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
/*
* Copyright (C) 1985-1992 New York University
*
* This file is part of the Ada/Ed-C system. See the Ada/Ed README file for
* warranty (none) and distribution info and also the GNU General Public
* License for more details.
*/
/* interface to dbx for sem debugging */
/* interface to dbx for sem debugging */
#include "hdr.h"
#include "libhdr.h"
#include "vars.h"
#include "ifile.h"
#include "setprots.h"
#include "arithprots.h"
#include "sspansprots.h"
#include "chapprots.h"
#include "librprots.h"
#include "miscprots.h"
#include "smiscprots.h"
#include "dbxprots.h"
#ifndef EXPORT
typedef struct explored
{
short genre; /* discriminant : is explored a node or a symbol ? */
union {
Node n;
Symbol s;
} addr;
} explored;
#define UNDEFINED_STEP 99
#define EXIT_STEP 100
#define NODE_GENRE 0
#define SYMBOL_GENRE 1
int zpadr_opt = 1;
Symbol zsym;
Set zset;
Node znod;
Declaredmap zdcl;
Tuple ztup;
void give_node_reference(Node);
void give_symbol_reference(Symbol);
void zpnodrefa(char *, Node);
void zpset(Set);
void zpsig(Symbol);
void zpsigt();
void zptup(Tuple);
void zpsetsym(Set);
void zpsym(Symbol);
void zpsymrefa(char *, Symbol);
void zpsymref(Symbol);
void zpnodref(Node);
int analyze(char *, explored, int *, int *);
static int adrflag = 1; /* non zero to print address values */
static int stack_ptr = 0;
static explored stack[ 100 ];
static void push(explored);
static explored pop();
static void display_symbol(Symbol);
static void zpcon1(Const);
static void zprat1(Rational);
/*
* The purpose of this program is to provide the one who is not familiar
* with the structure of the AST with a tool which permits him to travel
* from one node to his eventual father or son (we assume that the
* beginning of the exploration will take place at the root of the AST .)
* and focus on the nodes he wants to examine more precisely in a readable
* way .
*/
static void push (explored site) /*;push*/
{
stack [ stack_ptr++ ] = site;
}
static explored pop () /*;pop*/
{
return (stack [ --stack_ptr ]);
}
static void display_symbol(Symbol symbol_explored) /*;display_symbol*/
{
short nature;
system ("clear");
if (symbol_explored == (Symbol)0)
printf ("(Symbol)0\n");
else {
printf("NATURE %s %d \n\n",
nature_str (NATURE (symbol_explored)), symbol_explored);
printf("TYPE_OF %s %d\n",
nature_str(NATURE(TYPE_OF(symbol_explored))),
TYPE_OF(symbol_explored));
printf("ALIAS %s %d\n",
nature_str(NATURE(ALIAS(symbol_explored))), ALIAS(symbol_explored));
printf("SIGNATURE :\n");
if (SIGNATURE (symbol_explored) != ((Tuple)0))
zptup(SIGNATURE (symbol_explored));
else
printf("empty_tuple\n");
if (SCOPE_OF(symbol_explored))
printf("SCOPE_OF %s %d\n",
nature_str(NATURE(SCOPE_OF(symbol_explored))),
SCOPE_OF(symbol_explored));
else
printf("No scope.\n");
printf("OVERLOADS :\n");
if (OVERLOADS (symbol_explored) != ((Tuple)0)) {
nature = NATURE(symbol_explored);
if (nature == na_enum)
printf(" literal map %d\n", OVERLOADS(symbol_explored));
else if (nature == na_package || nature == na_package_spec
|| nature == na_generic_package_spec
|| nature == na_generic_package || nature == na_task_type
|| nature == na_task_obj)
printf(" private declarations %d\n",
OVERLOADS(symbol_explored));
else
display_symbol_list (OVERLOADS (symbol_explored), 1);
}
else
printf ("empty_set\n");
printf("DECLARED %d\n", DECLARED (symbol_explored));
if (ORIG_NAME (symbol_explored) != (char *)0)
printf("ORIG_NAME %s\n", ORIG_NAME (symbol_explored));
printf("SEQ %d\n", S_SEQ (symbol_explored));
printf("UNIT %d\n", S_UNIT (symbol_explored));
printf("TYPE_ATTR %d\n", TYPE_ATTR (symbol_explored));
if (MISC (symbol_explored) != (char *)0)
printf("MISC %s\n", MISC (symbol_explored));
printf("TYPE_KIND %d\n", TYPE_KIND (symbol_explored));
printf("TYPE_SIZE %d\n", TYPE_SIZE (symbol_explored));
if (INIT_PROC(symbol_explored))
printf("INIT_PROC %s %d\n",
nature_str(NATURE(INIT_PROC(symbol_explored))),
INIT_PROC(symbol_explored));
else printf("INIT_PROC = 0\n");
printf("ASSOCIATED_SYMBOLS :\n");
if (ASSOCIATED_SYMBOLS (symbol_explored) != ((Tuple)0))
display_symbol_list (ASSOCIATED_SYMBOLS (symbol_explored), 1);
else
printf ("empty_tuple\n");
printf("SEGMENT %d\n", S_SEGMENT (symbol_explored));
printf("OFFSET %d\n", S_OFFSET (symbol_explored));
printf("\n");
}
}
void display_node(Node node_explored, int list_begin) /*;display_node*/
{
int kind_explored;
system ("clear");
if (node_explored == (Node)0)
printf ("(Node)0\n");
else {
kind_explored = N_KIND (node_explored);
printf ("kind -> %s ", kind_str (kind_explored));
printf ("unit -> %d ", N_UNIT (node_explored));
printf ("side -> %d ", N_SIDE (node_explored));
printf ("overloaded -> %d ", N_OVERLOADED (node_explored));
printf ("sequence -> %d ", N_SEQ (node_explored));
printf ("\n");
printf ("%d", kind_explored);
printf ("\n");
printf ("\n");
/*****************/
/* nu1 component */
/*****************/
printf (" nu1 : ");
if (N_AST1_DEFINED (kind_explored)) {
if (N_AST1(node_explored) != (Node)0)
printf ("AST1 %s \n", kind_str(N_KIND(N_AST1(node_explored))));
else
printf ("AST1 (Node)0 \n");
}
else
printf ("SPAN %d %d \n", N_SPAN0 (node_explored),
N_SPAN1 (node_explored));
printf ("\n");
/*****************/
/* nu2 component */
/*****************/
printf (" nu2 : ");
if (N_AST2_DEFINED (kind_explored)) {
if (N_AST2(node_explored) != (Node)0)
printf ("AST2 %s \n",
kind_str(N_KIND(N_AST2(node_explored))));
else
printf ("AST2 (Node)0 \n");
}
else if (N_LIST_DEFINED (kind_explored)) {
printf ("LIST ");
if (N_LIST (node_explored) != ((Tuple)0))
display_node_list (N_LIST (node_explored), list_begin);
else
printf ("empty_tuple\n");
}
else { /* (N_VAL_DEFINED (kind_explored) */
display_value (node_explored);
printf ("\n");
}
printf ("\n");
/*****************/
/* nu3 component */
/*****************/
printf (" nu3 : ");
if (N_AST3_DEFINED (kind_explored)) {
if (N_AST3(node_explored) != (Node)0)
printf ("AST3 %s \n", kind_str(N_KIND(N_AST3(node_explored))));
else
printf ("AST3 (Node)0 \n");
}
else if (N_UNQ_DEFINED (kind_explored))
printf ("Symbol unq --> %s \n",
nature_str(NATURE(N_UNQ(node_explored))));
else {
printf ("N_NAMES ");
if (N_NAMES (node_explored) != ((Set)0))
display_node_list((Tuple)N_NAMES(node_explored), list_begin);
else
printf ("empty_set\n");
}
printf ("\n");
/*****************/
/* nu4 component */
/*****************/
printf (" nu4 : ");
if (N_AST4_DEFINED (kind_explored)) {
if (N_AST4(node_explored) != (Node)0)
printf ("AST4 %s \n", kind_str(N_KIND(N_AST4(node_explored))));
else
printf ("AST4 (Node)0 \n");
}
else if (N_TYPE_DEFINED (kind_explored))
printf ("Symbol type --> %s \n",
nature_str(NATURE(N_TYPE(node_explored))));
else {
printf ("N_PTYPES ");
if (N_PTYPES (node_explored) != ((Set)0))
display_node_list((Tuple)N_PTYPES(node_explored), list_begin);
else
printf ("empty_set\n");
}
printf ("\n");
}
}
void explorast (Node root) /*;explorast*/
{
explored current;
int next_step;
int list_node;
int list_low;
char answer[10];
current.genre = NODE_GENRE;
current.addr.n = root;
list_low = 1;
do {
if (current.genre == NODE_GENRE)
display_node (current.addr.n, list_low);
else
display_symbol (current.addr.s);
next_step = UNDEFINED_STEP;
list_node = 0;
while (next_step == UNDEFINED_STEP) {
printf (" what shall be the next step ? ");
scanf ("%10s", answer);
next_step = analyze (answer, current, &list_node, &list_low);
}
switch (next_step) {
case 0 :
current = pop ();
break;
case 11:
push (current);
current.genre = NODE_GENRE;
current.addr.n = N_AST1 (current.addr.n);
break;
case 21:
push (current);
current.genre = NODE_GENRE;
current.addr.n = N_AST2 (current.addr.n);
break;
case 22:
push (current);
current.genre = NODE_GENRE;
current.addr.n = (Node)((N_LIST(current.addr.n))[list_node]);
break;
case 31:
push (current);
current.genre = NODE_GENRE;
current.addr.n = N_AST3 (current.addr.n);
break;
case 33:
push (current);
current.genre = SYMBOL_GENRE;
current.addr.s = N_UNQ (current.addr.n);
break;
case 41:
push (current);
current.genre = NODE_GENRE;
current.addr.n = N_AST4 (current.addr.n);
break;
case 43:
push (current);
current.genre = SYMBOL_GENRE;
current.addr.s = N_TYPE (current.addr.n);
break;
case 91:
push (current);
current.genre = SYMBOL_GENRE;
current.addr.s = TYPE_OF (current.addr.s);
break;
case 92:
push (current);
current.genre = SYMBOL_GENRE;
current.addr.s = SCOPE_OF (current.addr.s);
break;
case 93:
push (current);
current.genre = SYMBOL_GENRE;
current.addr.s = ALIAS (current.addr.s);
break;
case 94:
push (current);
current.genre = SYMBOL_GENRE;
current.addr.s = INIT_PROC (current.addr.s);
break;
case 999:
break;
}
} while (next_step != EXIT_STEP);
}
int analyze (char *way, explored current, int *p_list_num, int *p_list_low)
/*;analyze*/
{
Node current_node;
int current_kind;
Symbol current_symbol;
int current_nature;
if (current.genre == NODE_GENRE) {
current_node = current.addr.n;
if (current_node != (Node)0)
current_kind = N_KIND (current_node);
switch (way [0]) {
case 'f' :
if (stack_ptr == 0) {
printf (" Illegal step : You are at the ROOT\n");
return (UNDEFINED_STEP);
}
else
return (0);
case '1' :
if ((current_node != (Node)0) && (N_AST1_DEFINED (current_kind)))
return (11);
else {
printf (" Illegal step : AST1 undefined\n");
return (UNDEFINED_STEP);
}
case '2' :
if ((current_node != (Node)0) && (N_AST2_DEFINED (current_kind)))
return (21);
else {
printf (" Illegal step : AST2 undefined\n");
return (UNDEFINED_STEP);
}
case '3' :
if ((current_node != (Node)0) && (N_AST3_DEFINED (current_kind)))
return (31);
else {
printf (" Illegal step : AST3 undefined\n");
return (UNDEFINED_STEP);
}
case '4' :
if ((current_node != (Node)0) && (N_AST4_DEFINED (current_kind)))
return (41);
else {
printf (" Illegal step : AST4 undefined\n");
return (UNDEFINED_STEP);
}
case 'l' :
if ((current_node != (Node)0) && (N_LIST_DEFINED (current_kind))) {
if (atoi (way + 1) > 0
&& atoi (way + 1) <= tup_size(N_LIST(current_node))) {
*p_list_num = atoi (way + 1);
return (22);
}
else {
printf (" Illegal list number\n");
return (UNDEFINED_STEP);
}
}
else {
printf (" Illegal step : LIST undefined\n");
return (UNDEFINED_STEP);
}
#ifdef PRETTY
case 's' :
if ((current_node != (Node)0) && (N_LIST_DEFINED (current_kind))) {
if (atoi (way + 1) > 0
&& atoi (way + 1) <= tup_size(N_LIST(current_node))) {
*p_list_num = atoi (way + 1);
regenerate_source1( N_LIST(current_node)[*p_list_num],
stack[stack_ptr - 1].addr.n);
printf("\n");
return (UNDEFINED_STEP);
}
else {
printf (" Illegal list number\n");
return (UNDEFINED_STEP);
}
}
else {
printf (" Illegal step : LIST undefined\n");
return (UNDEFINED_STEP);
}
#endif
case 'v' :
if ((current_node != (Node)0) && (N_LIST_DEFINED (current_kind))) {
if (atoi (way + 1) <= tup_size(N_LIST(current_node))) {
*p_list_low = atoi (way + 1);
return (999);
}
else {
printf (" Illegal list number\n");
return (UNDEFINED_STEP);
}
}
else {
printf (" Illegal step : LIST undefined\n");
return (UNDEFINED_STEP);
}
case 'u' :
if ((current_node != (Node)0) && (N_UNQ_DEFINED (current_kind)))
return (33);
else {
printf (" Illegal step : UNQ undefined\n");
return (UNDEFINED_STEP);
}
case 't' :
if ((current_node != (Node)0) && (N_TYPE_DEFINED (current_kind)))
return (43);
else {
printf (" Illegal step : TYPE undefined\n");
return (UNDEFINED_STEP);
}
case 'q' :
stack_ptr = 0;
return (EXIT_STEP);
case 'h' :
printf (" 1 ==> see AST1 \n");
printf (" 2 ==> see AST2 \n");
printf (" 3 ==> see AST3 \n");
printf (" 4 ==> see AST4 \n");
printf (" l num ==> see list node num \n");
printf (" v num ==> see list begin num \n");
printf (" u ==> see unq \n");
printf (" t ==> see type \n");
return (UNDEFINED_STEP);
default :
printf(" I do not understand where you want to go\n");
return (UNDEFINED_STEP);
}
}
else {
current_symbol = current.addr.s;
if (current_symbol != (Symbol)0)
current_nature = NATURE (current_symbol);
switch (way [0]) {
case 'f' :
if (stack_ptr == 0) {
printf (" Illegal step : You are at the ROOT\n");
return (UNDEFINED_STEP);
}
else
return (0);
case 't' :
return (91);
case 's' :
return (92);
case 'a' :
return (93);
case 'i' :
return (94);
case 'q' :
stack_ptr = 0;
return (EXIT_STEP);
case 'h' :
printf (" t ==> see TYPE_OF \n");
printf (" s ==> see SCOPE_OF \n");
printf (" a ==> see ALIAS \n");
printf (" i ==> see INIT_PROC \n");
return (UNDEFINED_STEP);
default :
printf(" I do not understand where you want to go\n");
return (UNDEFINED_STEP);
}
}
}
void display_node_list (Tuple tup, int low) /*;display_node_list*/
{
int high, i, n;
n = tup_size(tup);
printf("size : %d\n", n);
high = low + 10;
if (high > n)
high = n;
for (i = low; i <= high; i++)
printf("%d 0x%x %d %s \n", i, (int)tup[i], (int)tup[i],
kind_str(N_KIND((Node)tup[i])));
}
void display_symbol_list (Tuple tup, int low) /*;display_symbol_list*/
{
int high, i, n;
n = tup_size(tup);
printf(" size : %d\n", n);
high = low + 10;
if (high > n)
high = n;
for (i = low; i <= high; i++) {
printf(" ");
give_symbol_reference((Symbol)tup[i]);
zpsymrefa("type_of", TYPE_OF((Symbol)tup[i]));
zpsymrefa("scope", SCOPE_OF((Symbol)tup[i]));
if (ORIG_NAME((Symbol)tup[i]) != (char *)0)
printf(" :%s", ORIG_NAME((Symbol)tup[i]));
printf("\n");
}
}
void display_value (Node node_explored) /*;display_value*/
{
int kind_explored, constant_kind;
Const constant_explored;
Rational rational_explored;
Tuple tup;
int i, n;
kind_explored = N_KIND (node_explored);
if (kind_explored == as_simple_name
|| kind_explored == as_int_literal
|| kind_explored == as_real_literal
|| kind_explored == as_string_literal
|| kind_explored == as_character_literal
|| kind_explored == as_subprogram_stub_tr
|| kind_explored == as_package_stub
|| kind_explored == as_task_stub)
printf ("%s", N_VAL (node_explored));
else if (kind_explored == as_line_no
|| kind_explored == as_number
|| kind_explored == as_predef)
printf ("%d", (int) N_VAL (node_explored));
else if (kind_explored == as_mode)
printf ("%d", (int) N_VAL (node_explored));
else if (kind_explored == as_ivalue) {
constant_explored = (Const) N_VAL (node_explored);
constant_kind = constant_explored -> const_kind;
if (NATURE(N_TYPE(node_explored)) == na_enum)
printf ("%s", OVERLOADS(N_TYPE(node_explored))
[2*constant_explored->const_value.const_int+1]);
else {
if (constant_kind == CONST_INT)
printf ("%d", constant_explored->const_value.const_int);
else if (constant_kind == CONST_REAL)
printf ("%f", constant_explored->const_value.const_real);
else if (constant_kind == CONST_UINT)
printf ("%d", constant_explored->const_value.const_uint);
else if (constant_kind == CONST_OM)
printf ("OM");
else if (constant_kind == CONST_RAT) {
rational_explored = constant_explored-> const_value.const_rat;
printf ("num %d den %d", rational_explored -> rnum,
rational_explored -> rden);
}
else if (constant_kind == CONST_CONSTRAINT_ERROR)
printf ("CONSTANT_CONSTRAINT_ERROR");
}
}
else if (kind_explored == as_terminate_alt)
printf ("%d", (int) N_VAL (node_explored));
else if (kind_explored == as_string_ivalue) {
/* N_VAL is a tuple of integer */
printf ("\"");
tup = (Tuple) N_VAL (node_explored);
n = tup_size (tup);
for (i = 1; i <= n; i++)
printf ("%c", tup [i]);
printf ("\"");
}
else if (kind_explored == as_null)
printf ("null");
else if (kind_explored == as_null_s)
printf ("null;");
else if (kind_explored == as_others)
printf ("others");
else if (kind_explored == as_generic)
printf ("(<>)");
else if (kind_explored == as_instance_tuple)
printf (" ??????? ");
}
void display_signature (Symbol sym) /*;display_signature*/
{
int nat, i, n, ctyp;
Tuple sig, tup, tupent;
Symbol s;
Fortup ft1;
static char *constraint_types[] = {
"range", "digits", "delta", "discr", "array" };
/* The signature field is used as follows:
* It is a symbol for:
* na_access
* It is a node for
* na_constant na_in na_inout
* It is also a node (always OPT_NODE) for na_out. For now we write this
* out even though it is not used.
* It is a pair for na_array.
* It is a triple for na_enum.
* It is a triple for na_generic_function_spec na_generic_procedure_spec
* The first component is a tuple of pairs, each pair consisting of
* a symbol and a (default) node.
* The second component is a tuple of symbols.
* The third component is a node
* It is a tuple with four elements for na_generic_package_spec:
* the first is a tuple of pairs, with same for as for generic procedure.
* the second third, and fourth components are nodes.
* It is a 5-tuple for na_record.
* It is a constraint for na_subtype and na_type.
* It is a node for na_obj.
* Otherwise it is the signature for a procedure, namely a tuple
* of quadruples.
* Note however, that for a private type, the signature has the same
* form as for a record.
* For a subtype whose root type is an array, the signature has the
* same form as for an array.
*/
nat = NATURE(sym);
sig = SIGNATURE(sym);
/* treat private types way in same way as for records*/
s = TYPE_OF(sym);
if (s == symbol_private || s == symbol_limited_private
|| s == symbol_incomplete)
nat = na_record;
switch (nat) {
case na_access:
/* access: signature is designated_type;*/
(void) give_symbol_reference ((Symbol) sig);
break;
case na_array:
array_case:
/* array: signature is pair [i_types, comp_type] where
* i_type is tuple of type names
*/
printf(" array_sig %d\n", tup_size((Tuple) sig[1]));
FORTUP(s = (Symbol), (Tuple) sig[1], ft1);
(void) give_symbol_reference (s);
printf("\n");
ENDFORTUP(ft1);
(void) give_symbol_reference ((Symbol) sig[2]);
printf("\n");
break;
case na_block:
/* block: miscellaneous information */
/* This information not needed externally*/
printf ("signature for block\n");
break;
case na_constant:
case na_in:
case na_inout:
case na_out:
case na_discriminant:
(void) give_node_reference ((Node) sig);
break;
case na_entry:
case na_entry_family:
case na_entry_former:
/* entry: list of symbols */
case na_function:
case na_function_spec:
case na_literal: /* is this for literals too? */
case na_op:
case na_procedure:
case na_procedure_spec:
printf(" symbol_list %d\n", tup_size(sig));
FORTUP(s = (Symbol), sig, ft1);
(void) give_symbol_reference(s);
printf("\n");
ENDFORTUP(ft1);
break;
case na_enum :
/* enum: tuple in form ['range', lo, hi]*/
/* we write this as two node references*/
(void) give_node_reference ((Node) sig[2]);
(void) give_node_reference ((Node) sig[3]);
printf ("\n");
break;
case na_type:
case na_subtype:
if (nat == na_subtype && is_access(TYPE_OF(sym)))
/* subtype of access type, signature is anonymous type */
(void) give_symbol_reference ((Symbol)sig);
else {
n = tup_size(sig);
if (is_array (sym)) {
printf(" constrained_array \n");
goto array_case;
}
ctyp = (int) sig[1];
if (ctyp >= 0 && ctyp <= 4)
printf(" co_%s", constraint_types[ctyp]);
else
printf(" unknown constraint type %d", ctyp);
if (ctyp == CONSTRAINT_DISCR) {
/* discriminant map */
tup = (Tuple) numeric_constraint_discr(sig);
n = tup_size(tup);
for (i = 1; i <= n; i += 2) {
printf(" %d", (i+1)/2);
(void) give_symbol_reference ((Symbol) sig[i]);
(void) give_node_reference ((Node) sig[i+1]);
}
}
else {
for (i = 2; i <= n; i++) {
printf(" %d", i);
(void) give_node_reference ((Node) sig[i]);
}
}
}
printf("\n");
break;
case na_generic_function:
case na_generic_procedure:
case na_generic_function_spec:
case na_generic_procedure_spec:
if (tup_size(sig) != 3)
printf ("bad signature for na_generic_procedure_spec\n");
/* tuple count known to be three, just put elements */
tup = (Tuple) sig[1];
/* the first component is a tuple of pairs, just write count
* and the values of the successive pairs
*/
n = tup_size(tup);
printf(" %d\n", n);
for (i = 1; i <= n; i++) {
tupent = (Tuple) tup[i];
(void) give_symbol_reference((Symbol) tupent[1]);
(void) give_node_reference ((Node) tupent[2]);
printf("\n");
}
tup = (Tuple) sig[2];
n = tup_size(tup); /* symbol list */
printf(" symbol_list %d\n", n);
for (i = 1; i <= n; i++) {
(void) give_symbol_reference ((Symbol) tup[i]);
printf("\n");
}
printf(" node ");
(void) give_node_reference((Node) sig[3]);
printf("\n");
break;
case na_generic_package_spec:
case na_generic_package:
/* signature is tuple with three elements */
if (tup_size(sig) != 4)
printf ("bad signature for na_generic_package_spec\n");
tup = (Tuple) sig[1];
/* the first component is a tuple of pairs, just write count
* and the values of the successive pairs
*/
n = tup_size(tup);
printf(" n %d\n", n);
for (i = 1; i <= n; i++) {
tupent = (Tuple) tup[i];
(void) give_symbol_reference ((Symbol) tupent[1]);
(void) give_node_reference ((Node) tupent[2]);
printf("\n");
}
/* the second third, and fourth components are just nodes */
(void) give_node_reference ((Node) sig[2]);
(void) give_node_reference ((Node) sig[3]);
(void) give_node_reference ((Node) sig[4]);
printf("\n");
break;
case na_record:
/* the signature is tuple with five components:
* [node, node, tuple of symbols, declaredmap, node]
* NOTE: we do not write component count - 5 assumed
*/
printf(" record (skip details)\n");
break;
/*
(void) give_node_reference ((Node) sig[1]);
(void) give_node_reference ((Node) sig[2]);
tup = (Tuple) sig[3];
n = tup_size(tup);
for (i = 1; i <= n; i++)
zpsymref((Symbol) tup[i]);
(void) give_node_reference ((Node) sig[5]);
break;
*/
case na_void:
/* special case assume entry for $used, in which case is tuple
* of symbols
*/
if (streq(ORIG_NAME(sym), "$used")) {
n = tup_size(sig);
printf(" symbol_list %d\n", n);
for (i = 1; i <= n; i++) {
(void) give_symbol_reference ((Symbol) sig[i]);
printf("\n");
}
}
else {
(void) give_symbol_reference(sym);
printf ("na_void, not $used\n");
}
break;
case na_obj:
(void) give_node_reference ((Node) sig);
printf("\n");
break;
default:
printf("display_signature : default error\n");
}
}
void give_node_reference (Node node) /*;give_node_reference*/
{
if (node == (Node)0)
printf (" (Node)0 \n");
else
printf(" n%du%d %d%s", N_SEQ (node), N_UNIT (node), node,
kind_str (N_KIND (node)));
}
void give_symbol_reference (Symbol symbol) /*;give_symbol_reference*/
{
if (symbol == (Symbol)0)
printf (" (Symbol)0 \n");
else
printf(" s%du%d %d%s", S_SEQ (symbol), S_UNIT (symbol), symbol,
nature_str (NATURE (symbol)));
}
void zpadr(char *s, char *p) /*;zpadr*/
{
/* print argument as address */
if (zpadr_opt == 0) return; /* quit if disabled */
if (p == (char *)0) return; /* don't print if null pointer */
if (!adrflag) return;
if (s != (char *)0) {
#ifdef IBM_PC
printf(" %s %p", s, p);
#else
printf(" %s %ld", s, p);
#endif
}
else {
#ifdef IBM_PC
printf(" %p", p);
#else
printf(" %ld", p);
#endif
}
}
void zpstr(char *str) /*;zpstr*/
{
printf("%s\n", str);
}
void zpcon(Const con) /*;zpcon*/
{
zpcon1(con);
printf("\n");
}
static void zpcon1(Const con) /*;zpcon1*/
{
int k;
char *s;
k = con->const_kind;
if (k == CONST_OM) s = "om";
else if (k== CONST_INT) s = "int";
else if (k == CONST_REAL) s = "real";
else if (k == CONST_STR) s = "str";
else if (k == CONST_RAT) s = "rat";
else if (k == CONST_CONSTRAINT_ERROR) s = "constraint_error";
else if (k == CONST_UINT) s = "uint";
else if (k == CONST_FIXED) s = "fixed";
else s = "INVALID";
printf(" %s", s);
if (k == CONST_INT) printf(" %d", con->const_value.const_int);
else if (k == CONST_UINT)printf(" %s",int_tos(con->const_value.const_uint));
else if (k == CONST_REAL) printf(" %12.3g", con->const_value.const_real);
else if (k == CONST_STR) printf(" %s", con->const_value.const_str);
else if (k == CONST_RAT) zprat1(RATV(con));
else if (k == CONST_FIXED) printf("%ld", con->const_value.const_fixed);
}
static void zprat1(Rational rat) /*;zprat1*/
{
char *s1, *s2;
s1 = int_tos(rat->rnum);
s2 = int_tos(rat->rden);
printf(" %s/%s", s1, s2);
efreet(s1, "zprat1-num");
efreet(s2, "zprat1-den");
}
void zprat(Rational rat) /*;zprat*/
{
zprat1(rat);
printf("\n");
}
void zpnod(Node nod) /*;zpnod*/
{
int i, seq, unit, has_spans;
unsigned int nk;
Symbol sym;
if (nod == (Node)0) {
printf("(Node)0\n");
return;
}
printf("=n%du%d", N_SEQ(nod), N_UNIT(nod));
zpadr((char *)0, (char *) nod);
nk = N_KIND(nod);