-
Notifications
You must be signed in to change notification settings - Fork 4
/
3b.c
1848 lines (1640 loc) · 55.2 KB
/
3b.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.
*/
#include "3.h"
#include "attr.h"
#include "setprots.h"
#include "dclmapprots.h"
#include "errmsgprots.h"
#include "evalprots.h"
#include "nodesprots.h"
#include "miscprots.h"
#include "smiscprots.h"
#include "chapprots.h"
static void new_unconstrained_array(Symbol, Node);
static Symbol constrain_index(Symbol, Node);
static void discr_decl(Node);
static Tuple process_anons(Tuple);
static int reformat_requires(Node);
Tuple apply_range(Node range_expr) /*;apply_range*/
{
/* A'RANGE is equivalent to A'FIRST..A'LAST. When the range attribute
* is used as a constraint, the bounds are expressed according to the
* above equivalence. This is not strictly correct if the elaboration
* of A has side-effects, but we ignore this detail for now.
*/
Node attr, arg1, arg2;
Tuple new_c;
Node l_node, f_node;
int f, l, attr_kind;
if (N_KIND(range_expr) == as_qual_range)
/* discard spurious constraint. */
range_expr = N_AST1(range_expr);
attr = N_AST1(range_expr);
arg1 = N_AST2(range_expr);
arg2 = N_AST3(range_expr);
/* The attribute is either O_RANGE or T_RANGE, according as arg1 is an
* object or a type. FIRST and LAST must be marked accordingly.
*/
/* In C note that base attribute kind followed by O_ kind, then T_. */
attr_kind = (int) attribute_kind(range_expr);
if (attr_kind == ATTR_O_RANGE) {
f = ATTR_O_FIRST;
l = ATTR_O_LAST;
}
else {
f = ATTR_T_FIRST;
l = ATTR_T_LAST;
}
f_node = new_attribute_node(f, arg1, arg2, N_TYPE(range_expr));
l_node = new_attribute_node(l, copy_tree(arg1), copy_tree(arg2),
N_TYPE(range_expr));
N_KIND(range_expr) = as_range;
N_AST1(range_expr) = f_node;
N_AST2(range_expr) = l_node;
/*return ?? ['range', f_node, l_node];*/
new_c = constraint_new(CONSTRAINT_RANGE);
numeric_constraint_low(new_c) = (char *) f_node;
numeric_constraint_high(new_c) = (char *) l_node;
return new_c;
}
void array_typedef(Node node) /*;array_typedef*/
{
Node index_list_node, type_indic_node;
Tuple index_nodes;
Node indx_node, indx1_node;
Tuple index_type_list;
Symbol element_type;
int i, exists;
Fortup ft1;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : array_typedef");
index_list_node = N_AST1(node);
type_indic_node = N_AST2(node);
sem_list(index_list_node);
index_nodes = N_LIST(index_list_node);
index_type_list = tup_new(tup_size(index_nodes));
FORTUPI(indx_node =(Node), index_nodes, i, ft1);
index_type_list[i] = (char *) make_index(indx_node);
ENDFORTUP(ft1);
adasem(type_indic_node);
element_type = promote_subtype(make_subtype(type_indic_node));
/* Validate an array type definition.*/
exists = FALSE;
FORTUP(indx_node =(Node) , index_nodes, ft1);
if (N_KIND(indx_node) == as_box) {
exists = TRUE;
break;
}
ENDFORTUP(ft1);
if (exists) {
exists = FALSE;
/*Unconstrained array . Verify that all indices are unconstrained.*/
FORTUP(indx1_node = (Node), index_nodes, ft1);
if (N_KIND(indx1_node) != as_box) {
exists = TRUE;
break;
}
ENDFORTUP(ft1);
if (exists) {
errmsg("Constraints apply to all indices or none", "3.6.1", node);
}
}
if (is_unconstrained(element_type)) {
errmsg("Unconstrained element type in array declaration",
"3.6.1, 3.7.2", type_indic_node);
}
check_fully_declared2(element_type);
for (i = 1; i<= tup_size(index_nodes); i++) {
Node tmp = (Node) index_nodes[i];
N_UNQ(tmp) = (Symbol) (index_type_list[i]);
}
N_UNQ(type_indic_node) = element_type;
}
void new_array_type(Symbol array_type, Node def_node) /*;new_array_type*/
{
/* This procedure is called whenever an array type is created.
* For each new array type we create a corresponding sequence type,
* which is an unconstrained array. Unconstrained array types have
* nature na_array, while constrained arrays have nature na_subtype.
*/
Node index_list_node;
Tuple tn;
Node tnn;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : new_array_type(array_type");
adasem(def_node);
index_list_node = N_AST1(def_node);
tn = N_LIST(index_list_node);
tnn = (Node) tn[1];
if (N_KIND(tnn) == as_box)
/* Unconstrained array definition. In this case, introduce only the*/
/* unconstrained type, and ignore the actual array type.*/
new_unconstrained_array(array_type, def_node);
else
new_constrained_array(array_type, def_node);
}
static void new_unconstrained_array(Symbol sequence_type, Node def_node)
/*;new_unconstrained_array*/
{
Node index_list_node, type_indic_node, indx_node;
Fortup ft1;
int i, l;
Tuple index_list, array_info;
Symbol comp;
index_list_node= N_AST1(def_node);
type_indic_node = N_AST2(def_node);
/*index_list := [N_UNQ(indx_node) : indx_node in N_LIST(index_list_node)];*/
index_list = tup_new(tup_size(N_LIST(index_list_node)));
FORTUPI(indx_node=(Node), N_LIST(index_list_node), i, ft1);
index_list[i] = (char *) N_UNQ(indx_node);
ENDFORTUP(ft1);
/*??array_info := [index_list, N_UNQ(type_indic_node)];*/
array_info = tup_new(2);
array_info[1] = (char *) index_list;
comp = N_UNQ(type_indic_node);
array_info[2] = (char *) comp;
/*SYMBTAB(sequence_type) := [na_array, sequence_type, array_info];*/
NATURE(sequence_type) = na_array;
TYPE_OF(sequence_type) = sequence_type;
SIGNATURE(sequence_type) = array_info;
/*Mark the type as limited if the component type is.*/
if (is_access(comp))
misc_type_attributes(sequence_type) = 0;
else {
l= (int) private_kind(comp);
misc_type_attributes(sequence_type) = l;
}
root_type(sequence_type) = sequence_type;
initialize_representation_info(sequence_type,TAG_ARRAY);
/* For each unconstrained array type, we introduce an instance of the
* 'aggregate' pseudo-operator for that array.
*/
new_agg_or_access_agg(sequence_type);
}
void new_constrained_array(Symbol array_type, Node def_node)
/*;new_constrained_array*/
{
char *nam;
Fortup ft1;
Symbol sequence_type;
Tuple t, index_list, array_info;
Node index_list_node, type_indic_node, indx_node;
int i;
char *sequence_type_name;
/* Construct meaningful name for anonymous parent type.*/
nam = original_name(array_type);
if (strcmp(nam , "") == 0) nam = "anonymous_array";
sequence_type_name = strjoin(nam , strjoin("\'base" , newat_str()));
sequence_type = sym_new(na_void);
dcl_put(DECLARED(scope_name), sequence_type_name, sequence_type);
SCOPE_OF(sequence_type) = SCOPE_OF(array_type);
/* emit sequence type as an anonymous type. It is used in aggregates
* that are assigned to slices, and in other unconstrained contexts.
* (This should only be needed for one dimensional arrays).
*/
/*top(NEWTYPES) with:= sequence_type;*/
t = (Tuple) newtypes[tup_size(newtypes)];
t = tup_with(t, (char *) sequence_type);
newtypes[tup_size(newtypes)] = (char *) t;
new_unconstrained_array(sequence_type, def_node);
/* Make the actual array type into a subtype of the unconstrained one*/
index_list_node = N_AST1(def_node);
type_indic_node = N_AST2(def_node);
index_list = tup_new(tup_size(N_LIST(index_list_node)));
FORTUPI(indx_node = (Node), N_LIST(index_list_node), i, ft1);
index_list[i] = (char *) N_UNQ(indx_node);
ENDFORTUP(ft1);
/*array_info := [index_list, N_UNQ(type_indic_node)];*/
array_info = tup_new(2);
array_info[1] = (char *) index_list;
array_info[2] = (char *) N_UNQ(type_indic_node);
/*??SYMBTAB(array_type) = [na_subtype, sequence_type, array_info];*/
NATURE(array_type) = na_subtype;
TYPE_OF(array_type) = sequence_type;
SIGNATURE(array_type) = array_info;
misc_type_attributes(array_type) = misc_type_attributes(sequence_type);
root_type(array_type) = sequence_type;
}
Symbol anonymous_array(Node node) /*;anonymous_array*/
{
/* Process an array definition in an object or constant declaration.
* The node is an array_type node.
*/
Symbol typ;
Tuple t;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : anonymous_array");
typ = find_new(strjoin("anon", newat_str())); /*Create a name for it*/
new_array_type(typ, node); /*elaborate definition*/
/*??top(NEWTYPES) with:= typ;*/
/* Insert into type stack */
t = (Tuple) newtypes[tup_size(newtypes)];
t = tup_with(t, (char *) typ);
newtypes[tup_size(newtypes)] = (char *) t;
return typ;
}
Symbol constrain_array(Symbol type_mark, Node constraint) /*;constrain_array*/
{
int i;
Symbol new_array;
Tuple indices, constraint_nodes, new_indices;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : constrain_array");
/* Apply index constraints to array type.*/
if (! can_constrain(type_mark)) {
errmsg("Array type is already constrained", "3.6.1", constraint);
return symbol_any;
}
if (N_LIST_DEFINED(N_KIND(constraint)))
constraint_nodes = N_LIST(constraint);
else
constraint_nodes = (Tuple)0;
if (constraint_nodes == (Tuple)0
|| tup_size(constraint_nodes) != no_dimensions(type_mark)) {
errmsg_id("Incorrect no. of index constraints for type %", type_mark,
"3.6.1", constraint);
return symbol_any;
}
if (constraint == OPT_NODE)
new_array = type_mark;
else {
/* apply constraints to each index type. */
indices = (Tuple) (index_types(type_mark) );
/* ?? new_indices = [constrain_index(indices(i), constraint_nodes(i)):
* i in [1..#constraint_nodes]];
*/
new_indices = tup_new(tup_size(constraint_nodes));
for (i = 1; i <= tup_size(constraint_nodes); i++)
new_indices[i] = (char *) constrain_index((Symbol) indices[i],
(Node) constraint_nodes[i]);
}
new_array = anonymous_type(); /* Create a name for it*/
/* ??SYMBTAB(new_array):= [na_subtype, type_mark,
* [new_indices, component_type(type_mark)]];
*/
/* The signature should be in form of constraint. For now we
* will detect this case by nature na_subtype with signature
* being tuple of length two. This will be compatible with
* uses of this signature.
*/
NATURE(new_array) = na_subtype;
TYPE_OF(new_array) = type_mark;
{
Tuple t;
t = tup_new(2);
t[1] = (char *) new_indices;
t[2] = (char *) component_type(type_mark);
SIGNATURE(new_array) = t;
}
root_type(new_array) = root_type(type_mark);
return new_array;
}
Symbol make_index(Node subtype) /*;make_index*/
{
/* Process an index in an array declaration, an entry family declara-
* tion, or a loop iteration. The index is given by an index declaration
* ( a 'box' ), or by a discrete range. The later can be the name of a
* discrete type, or a subtype indication.
*/
Node type_indic_node, constraint, lo, hi;
Symbol typ, new_index, type_name;
Tuple new_c;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : make_index");
if (N_KIND(subtype) == as_box) {
/* Unconstrained index definition. verify that the type_mark is*/
/* discrete. */
type_indic_node = N_AST1(subtype);
new_index = find_type(type_indic_node);
}
else if (N_KIND(subtype) == as_range_attribute
|| N_KIND(subtype) == as_attribute) {
/* The discrete range is given by a range attribute. Resolve as such.*/
N_KIND(subtype) = as_attribute;
find_old(subtype);
check_type_d(subtype);
typ = N_TYPE(subtype);
new_index = anonymous_type(); /* Create a name for it*/
/*??SYMBTAB(new_index):=[na_subtype, typ, apply_range(subtype)];*/
NATURE(new_index) = na_subtype;
TYPE_OF(new_index) = typ;
SIGNATURE(new_index) = (Tuple) apply_range(subtype);
root_type(new_index) = root_type(typ);
}
else if (N_KIND(subtype) == as_name) {
type_indic_node = N_AST1(subtype);
new_index = find_type(type_indic_node);
}
else if (N_KIND(subtype) == as_subtype) {
/* the index is given by a subtype with a range constraint.*/
type_indic_node = N_AST1(subtype);
constraint = N_AST2(subtype);
lo = N_AST1(constraint);
hi = N_AST2(constraint);
if (type_indic_node == OPT_NODE)
check_type_d(subtype);
else { /* Type name is an identifier.*/
find_old(type_indic_node);
type_name = N_UNQ(type_indic_node);
check_type(base_type(type_name), subtype);
}
new_index = anonymous_type(); /* Create a name for it*/
typ = N_TYPE(subtype);
/*SYMBTAB(new_index) = [na_subtype, typ, ['range', lo, hi]];*/
NATURE(new_index) = na_subtype;
TYPE_OF(new_index) = typ;
new_c = constraint_new(CONSTRAINT_RANGE);
numeric_constraint_low(new_c) = (char *) lo;
numeric_constraint_high(new_c) = (char *) hi;
SIGNATURE(new_index) = new_c;
root_type(new_index) = root_type(typ);
}
else {
errmsg("Invalid expression for index definition", "3.6.1", subtype);
return symbol_any;
}
/* Check that a type for the range was found, and that it is
* discrete, and generate an anonymous type for it.
*/
if (noop_error)
/* Error message was emitted already. */
return symbol_any;
else if (! is_discrete_type(new_index)) {
errmsg("expect discrete type in discrete range", "3.3, 3.6.1", subtype);
return symbol_any;
}
return new_index;
}
static Symbol constrain_index(Symbol index, Node constraint)/*;constrain_index*/
{
/* Process an index constraint in a constrained array declaration.
* The constraint can be a subtype name, or a range with or without
* an explicit type mark. The index has been obtained from the signature
* of the unconstrained array.
*/
Node type_node, range_node, lo, hi;
Symbol base_index, new_index, typ;
Tuple new_constraint;
int nk;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : constrain_index");
base_index = base_type(index);
nk = N_KIND(constraint);
if (nk == as_range_attribute) {
find_old(constraint);
N_KIND(constraint) = as_attribute;/* For resolution*/
check_type_d(constraint);
typ = N_TYPE(constraint);
new_constraint = apply_range(constraint);
if (! compatible_types(index, typ)) {
errmsg_id("Invalid index constraint for %", index, "3.6.1",
constraint);
}
}
else if (nk == as_subtype) {
/* The type name in the given constraint must be the same as the*/
/* original unconstrained index.*/
type_node = N_AST1(constraint);
range_node = N_AST2(constraint);
if (type_node == OPT_NODE) {
type_node = node_new(as_simple_name);
copy_span(range_node, type_node);
N_UNQ(type_node) = index;
N_AST1(constraint) = type_node;
N_AST2(constraint) = range_node;
}
else
find_old(type_node);
check_type(index, constraint);
lo = N_AST1(range_node);
hi = N_AST2(range_node);
/*new_constraint := ['range', lo, hi];*/
new_constraint = constraint_new(CONSTRAINT_RANGE);
numeric_constraint_low(new_constraint) = (char *) lo;
numeric_constraint_high(new_constraint) = (char *) hi;
}
else if (nk == as_range) {
/* In the case of allocator, the constraint appears as a range
* node, because syntactically it is just a name. Rebuild the
* node as a subtype of the index.
*/
type_node = node_new(as_simple_name);
copy_span(constraint, type_node);
N_UNQ(type_node) = index;
range_node = copy_node(constraint);
N_KIND(constraint) = as_subtype;
N_AST1(constraint) = type_node;
N_AST2(constraint) = range_node;
check_type(index, constraint);
lo = N_AST1(range_node);
hi = N_AST2(range_node);
new_constraint = constraint_new(CONSTRAINT_RANGE);
numeric_constraint_low(new_constraint) = (char *) lo;
numeric_constraint_high(new_constraint) = (char *) hi;
}
else if (nk == as_name) {
type_node = N_AST1(constraint);
if (N_KIND(type_node) == as_attribute) {
find_old(constraint);
check_type(symbol_discrete_type, constraint);
typ = N_TYPE(constraint);
new_constraint = apply_range(constraint);
if (! compatible_types(index, typ) ) {
errmsg_id("Invalid index constraint for %", index, "3.6.1",
constraint);
}
}
else {
find_old(type_node);
new_index = N_UNQ(type_node);
if (! compatible_types(index, new_index) ) {
errmsg_id("Invalid index constraint for %", index, "3.6.1",
constraint);
}
}
}
else {
errmsg_id("Invalid index constraint for %", index, "3.6.1", constraint);
new_index = base_index;
}
if (N_KIND(constraint) != as_name ) {
/* create anonymous type for index.*/
new_index = anonymous_type();
/*??SYMBTAB(new_index) := [na_subtype, index, new_constraint];*/
NATURE(new_index) = na_subtype;
TYPE_OF(new_index) = index;
SIGNATURE(new_index) = (Tuple) new_constraint;
root_type(new_index) = root_type(index);
}
return new_index;
}
void record_decl(Symbol type_name, Node opt_disc, Node type_def)/*;record_decl*/
{
/* Records constitute a scope for the component declarations within.
* The scope is created prior to the processing of these declarations.
* Discriminants are processed first, so that they are visible when
* processing the other components. After the discriminants have been
* processed we set the nature of the type to na_record.
*
* If an incomplete or private type declaration was already given for
* the type, then this scope already exists, and the discriminants have
* been declared within. We must verify that the full declaration matches
* the incomplete one.
*/
Node comp_list_node, comp_dec_node, variant_node;
Symbol n;
Fordeclared div;
Symbol comp;
int l;
char *str;
Tuple rectup;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : record_decl");
newscope(type_name);
if (record_declarations(type_name) == (Tuple)0)
process_discr(type_name, opt_disc);
NATURE(type_name) = na_record;
TYPE_OF(type_name) = type_name;
root_type(type_name) = type_name;
/* Now process remaining field declarations.*/
adasem(type_def);
comp_list_node = N_AST1(type_def);
comp_dec_node = N_AST1(comp_list_node);
variant_node = N_AST2(comp_list_node);
/* use indices in next few assignments since cannot use macros
* invariant_part, variant_part and declared_components on left hand side
*/
rectup = SIGNATURE(type_name);
rectup[1] = (char *) comp_dec_node; /* invariant_part */
/*invariant_part(type_name) = (char *) comp_dec_node;*/
/*variant_part(type_name) = (char *) variant_node;*/
rectup[2] = (char *) variant_node;
/*declared_components(type_name) = (char *) DECLARED(scope_name);*/
rectup[4] = (char *) DECLARED(scope_name);
misc_type_attributes(type_name) = 0;
#ifdef TBSL
-- in SETL, following qualified by 'if exists'. review this ds 6-jan-85
#endif
FORDECLARED(str, comp, (Declaredmap)DECLARED(scope_name), div)
l = private_kind(TYPE_OF(comp));
misc_type_attributes(type_name) =
(int) misc_type_attributes(type_name) | l;
if (l != 0)
break;
ENDFORDECLARED(div)
/* The nature of the record components is given as na_field while the
* record is being processed, in order to catch invalid dependencies
* among component declarations. Reset the nature of each to 'obj'
* (except for discriminants of course).
*/
FORDECLARED(str, n, (Declaredmap)(DECLARED(scope_name)), div)
if (NATURE(n) == na_field)
NATURE(n) = na_obj;
else if (NATURE(n) == na_discriminant) {
/* constant folding of default values of discriminants is
* delayed until after conformance checks
*/
eval_static((Node)default_expr(n));
}
ENDFORDECLARED(div)
popscope(); /* Exit record scope.*/
/* For each record type we create an aggregate of the corresponding
* type.
*/
initialize_representation_info(type_name,TAG_RECORD);
#ifdef TBSL
not_chosen_put(type_name, (Symbol)0);
#endif
current_node = type_def;
new_agg_or_access_agg(type_name);
}
void process_discr(Symbol type_name, Node opt_disc) /*;process_discr*/
{
/* Process discriminants, or reprocess them in a full type declaration.
* Introduce the record scope. It is exited after the call, in type_decl
* or record decl, or private_decl.
*/
Tuple disc_names;
Node discr_node, id_list_node, id_node;
Fortup ft1, ft2;
int i, has_default;
Tuple rectup;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : process_discr");
record_declarations(type_name) = tup_new(5);
discr_decl(opt_disc);
/*discr_decl_tree(type_name) = (char *) opt_disc;*/
/* use index since cannot use discr_decl_tree macro on left ds 31 dec 84*/
rectup = SIGNATURE(type_name);
rectup[5] = (char *) opt_disc;
if (opt_disc != OPT_NODE) {
/* add 'constrained' bit as additional discriminant in front.*/
disc_names = tup_new1((char *)symbol_constrained);
FORTUP(discr_node =(Node), N_LIST(opt_disc), ft1 );
id_list_node = N_AST1(discr_node);
FORTUP(id_node =(Node), N_LIST(id_list_node), ft2);
disc_names = tup_with(disc_names, (char *) N_UNQ(id_node));
ENDFORTUP(ft2);
ENDFORTUP(ft1);
/* Check that all discriminants have default values, or none.*/
/* Omit constrained bit from this test. */
has_default = ((Node)default_expr((Symbol)disc_names[2]) != OPT_NODE);
for (i = 3; i <= tup_size(disc_names); i++) {
if (((Node)(default_expr((Symbol)disc_names[i])) != OPT_NODE)
!= has_default) {
errmsg(
"Incomplete specification of default vals for discriminants",
"3.7.1", opt_disc);
}
}
}
else disc_names = tup_new(0);
/*discriminant_list(type_name) = (char *) disc_names;*/
rectup = SIGNATURE(type_name);
rectup[3] = (char *) disc_names;
/* Make names of discriminants visible at this point, because they may
* be used in constraints to other components of the current record type.
*/
/*declared_components(type_name) = DECLARED(scope_name);*/
rectup[4] = (char *) DECLARED(scope_name);
}
static void discr_decl(Node discr_list_node) /*;discr_decl*/
{
/* Process discriminant declarations. Discriminants are processed like
* variable declarations, except that the type of a discriminant must be
* discrete, and the nature of a discriminant is, naturally enough
* na_discriminant. This insures that discriminants cannot appear on the
* left of an assignment, nor in expressions.
*/
Node discr_node, id_list_node, type_node, init_node, id_node;
Tuple id_nodes, nam_list;
Symbol type_mark, n;
int i;
Fortup ft1, ft2;
Node i_node, tmpnode, type_copy;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : discr_decl");
FORTUP(discr_node =(Node), N_LIST(discr_list_node), ft1);
id_list_node = N_AST1(discr_node);
type_node = N_AST2(discr_node);
init_node = N_AST3(discr_node);
id_nodes = N_LIST(id_list_node);
current_node = id_list_node;
nam_list = tup_new(tup_size(id_nodes));
FORTUPI(id_node=(Node), id_nodes, i, ft2);
nam_list[i] = (char *) find_new(N_VAL(id_node));
ENDFORTUP(ft2);
/* save original type_node for later conformance checks */
type_copy = copy_tree(type_node);
find_type(type_copy);
type_mark = N_UNQ(type_copy);
if (! is_discrete_type(type_mark) ) {
errmsg("Discriminant must have discrete type", "3.7.1", type_node);
type_mark = symbol_any;
}
if (init_node != OPT_NODE ) {
/* type check, but do not perform constant folding, for later
* conformance checks
*/
i_node = copy_tree(init_node);
adasem(i_node);
normalize(type_mark, i_node);
}
else i_node = init_node;
FORTUP(n =(Symbol), nam_list, ft2);
NATURE(n) = na_discriminant;
TYPE_OF(n) = type_mark;
SIGNATURE(n) = (Tuple) i_node;
ENDFORTUP(ft2);
for (i = 1; i <= tup_size(id_nodes); i++) {
tmpnode = (Node) id_nodes[i];
N_UNQ(tmpnode) = (Symbol) nam_list[i];
}
ENDFORTUP(ft1);
}
void discr_redecl(Symbol type_name, Node discr_list) /*;discr_redecl */
{
/* Verify conformance of discriminant part on redeclarations of types. */
Node node, old_node, old_discr_list, id_list, type_node, init_node;
Node old_type_node, old_id_list, old_init_node;
Tuple discr_tup, old_discr_tup;
Symbol discr;
int i;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : discr_redecl");
old_discr_list = (Node) discr_decl_tree(type_name);
if (!conform(discr_list, old_discr_list)) {
conformance_error(discr_list != OPT_NODE ? discr_list : current_node);
return;
}
discr_tup = N_LIST(discr_list);
old_discr_tup = N_LIST(old_discr_list);
for (i = 1; i <= tup_size(old_discr_tup); i++) {
node = (Node) discr_tup[i];
old_node = (Node) old_discr_tup[i];
/* Pick a representatitive discriminant from current id list. */
old_id_list = N_AST1(old_node);
id_list = N_AST1(node);
discr = N_UNQ((Node)N_LIST(old_id_list)[1]);
old_type_node = N_AST2(old_node);
type_node = N_AST2(node);
init_node = N_AST3(node);
old_init_node = N_AST3(old_node);
find_type(type_node);
if (N_UNQ(type_node) != TYPE_OF(discr)) {
conformance_error(type_node);
return;
} /* end if; */
if (init_node != OPT_NODE) {
adasem(init_node);
normalize(N_UNQ(type_node), init_node);
}
/* Verify that the default values are the same. */
if (!same_expn(init_node, (Node)default_expr(discr)) ) {
conformance_error(init_node == OPT_NODE ? node : init_node);
return;
}
}
}
int same_expn(Node exp1, Node exp2) /*;same_expn */
{
/* verify that two resolved expression trees designate the same entity,
* or evaluate to the same.
*/
int i, nk;
Tuple l1, l2;
if (N_KIND(exp1) != N_KIND(exp2))
return FALSE;
nk = N_KIND(exp1);
switch (nk) {
case (as_simple_name):
return (N_UNQ(exp1) == N_UNQ(exp2));
case (as_ivalue):
return const_eq((Const)N_VAL(exp1), (Const)N_VAL(exp2));
default:
if (N_AST1_DEFINED(nk) && (N_AST1(exp1) != (Node)0)) {
if (!same_expn(N_AST1(exp1), N_AST1(exp2)))
return FALSE;
if (N_AST2_DEFINED(nk) && N_AST2(exp1) != (Node)0) {
if (!same_expn(N_AST2(exp1), N_AST2(exp2)))
return FALSE;
if (N_AST3_DEFINED(nk) && N_AST3(exp1) != (Node)0) {
if (!same_expn(N_AST3(exp1), N_AST3(exp2)))
return FALSE;
if (N_AST4_DEFINED(nk) && N_AST4(exp1) != (Node)0) {
if (!same_expn(N_AST4(exp1), N_AST4(exp2)))
return FALSE;
}
}
}
}
if (N_LIST_DEFINED(nk))
l1 = N_LIST(exp1);
else
l1 = (Tuple)0;
if (l1 != (Tuple)0 ) {
if (N_LIST_DEFINED(N_KIND(exp2)))
l2 = N_LIST(exp2);
else
l2 = (Tuple) 0;
if (l2 == (Tuple)0 || tup_size(l1) != tup_size(l2))
return FALSE;
for (i = 1; i<= tup_size(l1); i++) {
if (!same_expn((Node)l1[i], (Node)l2[i]))
return FALSE;
}
}
return TRUE; /* AST and LIST match. */
}
}
void conformance_error(Node node) /*;conformance_error */
{
errmsg("non conformance to previous declaration", "6.3.1", node);
}
#ifdef TBSN
Tuple bind_discr(Tuple discr_list) /*;bind_discr*/
{
/* The conformance rules for discriminant specifications require the
* equality of the corresponding trees after name resolution and before
* constant folding. (In fact, overload resolution may be needed if
* function calls appear in the default expressions).
*/
Tuple t1, t2;
Fortup ft1;
Tuple res;
int i;
res = tup_new(tup_size(discr_list));
FORTUPI(t1=(Tuple), discr_list, i, ft1);
t2 = tup_new(4);
t2[1] = t1[1];
t2[2] = t1[2];
t2[3] = t1[3];
t2[4] = (char *) bind_names(t1[4]);
res[i] = (char *) t2;
ENDFORTUP(ft1);
return res;
}
#endif
void comp_decl(Node field_node) /*;comp_decl*/
{
/* Process record component declaration.
* Verify that the type is a constrained one, or that default values
* exist for the discriminants of the type.
*/
Node id_list_node, type_indic_node, expn_node, id_node;
Tuple id_nodes, nam_list;
Symbol type_mark, t_m, n;
int i;
Fortup ft1;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : comp_decl");
id_list_node = N_AST1(field_node);
type_indic_node = N_AST2(field_node);
expn_node = N_AST3(field_node);
id_nodes = N_LIST(id_list_node);
nam_list = tup_new(tup_size(id_nodes));
FORTUPI(id_node=(Node), id_nodes, i, ft1);
nam_list[i] = (char *) find_new(N_VAL(id_node));
ENDFORTUP(ft1);
adasem(type_indic_node);
type_mark = promote_subtype(make_subtype(type_indic_node));
N_UNQ(type_indic_node) = type_mark;
check_fully_declared2(type_mark);
adasem(expn_node);
/* Type-check the initial value, if provided.*/
if (expn_node != OPT_NODE) {
t_m = check_init(type_indic_node, expn_node);
/* check_type(type_mark, expn_node); */
}
/* Try to catch self-reference within a record type (a common mistake).*/
if (in_open_scopes(type_mark )) {
errmsg_nval("Invalid self-reference in definition of %",
type_indic_node, "3.1", type_indic_node);
}
if (is_unconstrained(type_mark)) {
errmsg_nat("Unconstrained % in component declaration", type_mark,
"3.6.1, 3.7.2", type_indic_node);
}
FORTUP(n=(Symbol), nam_list, ft1);
NATURE(n) = na_field;
TYPE_OF(n) = type_mark;
SIGNATURE(n) = (Tuple) expn_node;
ENDFORTUP(ft1);
for (i = 1; i <= tup_size(id_nodes); i++) {
Node tmp = (Node) id_nodes[i];
N_UNQ(tmp) = (Symbol) nam_list[i];
}
}
Symbol constrain_record(Symbol type_mark, Node constraint) /*;constrain_record*/
{
/* Process discriminant constraints of record type.
* Verify that values have been provided for all discriminants, that
* the original type is unconstrained, and that the types of the
* supplied expressions match the discriminant types.
*/
Symbol d_name, typ;
Tuple d_list;
Tuple c_list, discr_map;
char *d_id;
Tuple d_seen;
/* TBSL: d_seen should be freed before return ds 6-jan-85 */
Declaredmap comps;
Tuple constraint_list;
Node ct, choice_list_node, choice_node, expn, name, nam, comp_assoc;
int i, first_named, exists, j, k, d_list_size;
Fortup ft1, ft2;
Tuple dconstraint;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : constrain_record");
if (! is_record(type_mark)) {
errmsg("Invalid type for constraint", "3.3, 3.7.2", constraint);
return symbol_any;
}
d_list = (Tuple) discriminant_list(type_mark);
if(d_list == (Tuple)0 || tup_size(d_list) == 0) {
errmsg("Invalid constraint: Record type has no discriminant",
"3.7.1, 3.7.2", constraint);
return symbol_any;
}
d_seen = tup_new(0); /*To verify that all discriminants were*/
/* given values.*/
constraint_list = N_LIST(constraint);
/* Look for named associations in discriminant constraint list.*/
exists = FALSE;
FORTUPI(ct = (Node), constraint_list, i, ft1);
if (N_KIND(ct) == as_choice_list) {
exists = TRUE;
break;
}
ENDFORTUP(ft1);
if (exists) {
first_named = i;
exists = FALSE;
for (j=i+1; j <= tup_size(constraint_list); j++) {
nam = (Node) constraint_list[j];
if ( N_KIND(nam) != as_choice_list ) {
exists = TRUE;
break;
}
}
if (exists) {
errmsg("Positional associations after named ones", "3.7.2", nam);
return symbol_any;
}
}
else
first_named = tup_size(constraint_list) + 1;
d_list_size = tup_size(d_list);