-
Notifications
You must be signed in to change notification settings - Fork 4
/
4c.c
2353 lines (2170 loc) · 71.2 KB
/
4c.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 "4.h"
#include "attr.h"
#include "setprots.h"
#include "libprots.h"
#include "miscprots.h"
#include "smiscprots.h"
#include "errmsgprots.h"
#include "nodesprots.h"
#include "dclmapprots.h"
#include "evalprots.h"
#include "chapprots.h"
static int prev_error_message;
static Triplet *is_partition(Tuple, int, int);
static Tuple sort_case(Tuple);
static int tcompar(Triplet **, Triplet **);
static int abs_val(int);
static void complete_a_aggregate(Tuple, Tuple, Symbol, int, Node);
static void complete_component(Tuple, Tuple, Symbol, int, Node);
static Node new_comp_assoc(Symbol, Node);
static void resolve_r_component(Node, Symbol, Tuple);
static Symbol check_discriminant_dependence(Symbol, Tuple);
static int in_gen_types(Symbol);
static int in_multiple_types(Symbol);
static int is_integer_type(Symbol);
static Triplet *triplet_new();
int can_constrain(Symbol d_type) /*;can_constrain*/
{
/* Determine whether an object, actual parameter, type def, etc. can
* receive a constraint.The predicate -is_unconstrained- used in decla-
* rations is too weak here, because it returns false on discriminated
* records with default values.
*/
if ((NATURE(d_type) == na_array)
|| (is_record(d_type) && NATURE(d_type) != na_subtype
&& has_discriminants(d_type)))
return TRUE;
else
return FALSE;
}
Set valid_array_expn(Node expn) /*;valid_array_expn*/
{
/* Called to validate indexing and slicing operations. The array name may
* be overloaded, and may also be an access to an array type.
*/
Node a_expn, i_node;
Set array_types, types, rset;
Tuple index_list;
Node index;
Symbol n, a_t, t;
int i, exists, forall;
Symbol i_t;
Forset fs1, fs2;
Fortup ft1;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : valid_array_expn");
a_expn = N_AST1(expn);
i_node = N_AST2(expn);
resolve1(a_expn);
types = N_PTYPES(a_expn);
index_list = N_LIST(i_node);
array_types = set_new(0); /* To collect valid types*/
FORTUP(index = (Node), index_list, ft1);
n = N_UNQ(index);
if (N_KIND(index) == as_simple_name && n != (Symbol)0 && is_type(n))
/* In the case of a slice, */
N_PTYPES(index) = set_new1((char *)TYPE_OF(n));
/* may be a type mark.*/
else
resolve1(index);
ENDFORTUP(ft1);
#ifdef TBSN
if (cdebug2 > 3) TO_ERRFILE('index_list ' + str index_list);
#endif
/* Now select those array types that are compatible with given indices.*/
FORSET(a_t = (Symbol), types, fs1);
t = a_t;
if (is_access(t)) {
if (is_fully_private(t)) {
/* Cannot dereference an access to fully private type.*/
if (set_size(array_types) == 1) {
premature_access(t, a_expn);
return set_new(0);
}
else
continue;
}
else t = (Symbol) designated_type(t);
}
#ifdef TBSN
if (cdebug2 > 3) {
TO_ERRFILE('type ' + str t);
TO_ERRFILE('# dims t ' + str no_dimensions(t));
}
#endif
/* Discard incompatible array types */
if (!is_array(t) || no_dimensions(t) != tup_size(index_list))
continue;
/* Now verify all indices in turn.*/
forall = TRUE;
FORTUPI(index = (Node), index_list, i, ft1);
exists = FALSE;
FORSET(i_t = (Symbol), N_PTYPES(index), fs2);
if (compatible_types(i_t, (Symbol) index_types(t)[i])) {
exists = TRUE;
break;
}
ENDFORSET(fs2);
if (exists == FALSE) {
forall = FALSE;
break;
}
ENDFORTUP(ft1);
if (forall)
/* a valid array type*/
array_types = set_with(array_types, (char *)a_t);
ENDFORSET(fs1);
#ifdef TBSN
if (cdebug2 > 3) TO_ERRFILE('valid_array_expn ' + str array_types);
#endif
N_PTYPES(a_expn) = array_types;
rset = set_new(0);
FORSET(a_t = (Symbol), array_types, fs1);
if (is_access(a_t))
rset = set_with(rset, (char *) designated_type(a_t));
else
rset = set_with(rset, (char *) a_t);
ENDFORSET(fs1);
return rset;
}
Symbol complete_array_expn(Node expn, Symbol c_type) /*;complete_array_expn*/
{
/* Called to complete the validation of an index or slice expression. The
* context type is the element type for indexing, and the array type for
* slicing . The array expression may yield an access type, in which case
* a dereference operation is emitted now.
*/
Node a_expn, index_list, a_node;
Set array_types;
Symbol array_type, a_t, t, c, access_type;
Forset fs1;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : complete_array_expn");
a_expn = N_AST1(expn);
index_list = N_AST2(expn);
array_types = N_PTYPES(a_expn);
array_type = (Symbol)0;
/* Iterate over array types to find unique one satisfying context.*/
FORSET(a_t = (Symbol), array_types, fs1);
t = (is_access(a_t)) ? (Symbol)designated_type(a_t): a_t;
c = (N_KIND(expn) == as_slice) ? t: (Symbol) (component_type(t));
if (compatible_types(c_type, c)) {
if (array_type == (Symbol)0) { /* One match found.*/
array_type = t;
access_type = a_t; /* Maybe an access.*/
}
else {
/* If it is ambiguous, then it must an overloaded function*/
/* that returns (an access to) an array.*/
array_type = symbol_any;
}
}
ENDFORSET(fs1);
if (array_type == symbol_any) {
remove_conversions(a_expn); /* last chance. */
if (set_size(N_PTYPES(a_expn)) == 1) {
array_type = (Symbol) set_arb(N_PTYPES(expn));
access_type = array_type;
if (is_access(array_type))
array_type = (Symbol) designated_type(access_type);
}
else { /* still ambiguous */
/* SETL sends {'indexing'}, in C, send {'any'} */
type_error(set_new1((char *) symbol_any), c_type,
set_size(N_PTYPES(a_expn)), expn);
}
}
if (array_type == (Symbol)0) {
/* SETL sends {'indexing'}, in C, send {'any'} */
type_error(set_new1((char *) symbol_any), c_type,
set_size(N_PTYPES(a_expn)), expn);
array_type = symbol_any;
}
if (array_type != access_type) { /* Insert dereference. */
a_node = copy_node(a_expn);
N_KIND(a_expn) = as_all;
N_AST1(a_expn) = a_node;
N_AST2(a_expn) = N_AST3(a_expn) = N_AST4(a_expn) = (Node) 0;
N_PTYPES(a_expn) = set_new1((char *) array_type);
}
resolve2(a_expn, array_type); /* and resolve. */
return array_type;
}
void valid_selected_expn(Node expn) /*;valid_selected_expn*/
{
/* Use the name of the selector to determine the possible types of obj,
* which may be a function returning (an access to) a record or task type
* The possible types of the expression are those of the selected comps.
*/
Node obj, s_node;
Set types1, valid_t;
Symbol o_t, t, comp;
char *selector;
Forset fs1;
Declaredmap decls;
obj = N_AST1(expn);
s_node = N_AST2(expn);
selector = N_VAL(s_node);
resolve1(obj);
types1 = N_PTYPES(obj);
valid_t = set_new(0);
FORSET( o_t = (Symbol), types1, fs1);
t = o_t;
if (is_access(o_t))t = (Symbol) designated_type(o_t);
if (is_record(t))
decls = (Declaredmap) (declared_components(base_type(t)));
else if (is_task_type(t))
decls = DECLARED(t);
else continue;
comp = dcl_get(decls, selector);
if (comp != (Symbol)0) {
if (is_access(o_t) && is_fully_private(o_t)
&& NATURE(comp) != na_discriminant) { /*$ Can't dereference.*/
if (set_size(types1) == 1) {
premature_access(o_t, obj);
return;
}
else continue;
}
else
valid_t = set_with(valid_t, (char *) TYPE_OF(comp));
}
ENDFORSET(fs1);
if (set_size(valid_t) == 0)
pass1_error("invalid selector name", "4.1.3", s_node);
N_PTYPES(expn) = valid_t;
}
Symbol complete_selected_expn(Node expn, Symbol c_type)
/*;complete_selected_expn*/
{
/* Complete the resolution of a selected component expression, by
* choosing the one that yields the context_type. If the type of the
* object selected from is an access type, emit a dereference.
*/
Node obj, s_node, acc_obj;
Set types1;
Symbol comp_t, o_t, t, comp, obj_t, c;
int out_c;
Forset fs1;
char *selector;
Declaredmap decls;
obj = N_AST1(expn);
s_node = N_AST2(expn);
selector = N_VAL(s_node);
types1 = N_PTYPES(obj);
comp_t = (Symbol)0;
FORSET( o_t = (Symbol), types1, fs1);
t = (is_access(o_t)) ? (Symbol) designated_type(o_t): o_t;
if (is_record(t))
decls = (Declaredmap) declared_components(base_type(t));
else if (is_task_type(t))
decls = DECLARED(t);
c = dcl_get(decls, selector);
if (c != (Symbol)0 && compatible_types(TYPE_OF(c), c_type)) {
comp = c;
if (comp_t == (Symbol)0) {
comp_t = TYPE_OF(comp); /* Found a match*/
N_UNQ(s_node) = comp;
obj_t = o_t;
}
else /* ambiguous call to some*/
obj_t = symbol_any;
}
ENDFORSET(fs1);
if (obj_t == symbol_any) {
remove_conversions(obj); /* last hope. */
if (set_size(N_PTYPES(obj)) != 1) {
#ifdef TBSL
type_error(set_new1(symbol_selection), (Symbol)0,
set_size(N_PTYPES(obj)), expn);
#endif
return (Symbol)0;
}
else
obj_t = (Symbol) set_arb(N_PTYPES(obj));
}
out_c = out_context;
/* This is a valid context for the use of an out parameter, if
* it is an assigment to a component of it, or if it is a reading
* of a discriminant.
*/
out_context = (out_c || NATURE(comp) == na_discriminant) ? TRUE:FALSE;
if (is_access(obj_t)) {
obj_t = (Symbol) designated_type(obj_t);
/* Introduce explicit dereference. */
acc_obj = copy_node(obj);
N_KIND(obj) = as_all;
N_AST2(obj) = N_AST3(obj) = N_AST4(obj) = (Node) 0;
N_AST1(obj) = acc_obj;
N_PTYPES(obj) = set_new1((char *)obj_t);
}
resolve2(obj, obj_t);
out_context = out_c;
return comp_t;
}
static Triplet *is_partition(Tuple choice_tuple, int choice_tuple_size,
int exist_other_choice) /*;is_partition*/
{
/* Checks if the ranges of the choice_nodes in a named array aggregate form
* a partition.
* For example: (1|2|4 =>2, 5..10 =>3, 3 =>2, NUM => 4) where you can find
* simple_choices, a range_choice and a choice_unresolved. This will be a
* partition if the type_mark NUM is disjoint with {1..10} assuming that
* the bounds of the array are (1..NUM'LAST). A range such as 7..4 is a
* null range. It is permitted only if alone in the array aggregate.
* This function returns a pointer to a Triplet. This Triplet gives the
* final range of the aggregate. Complete_a_aggregate checks after whether
* the range of the aggregate is the same than the range of the array. It
* uses the system call 'qsort' to sort the ranges by their lower bound
* and then uses this sorted list to verify that it is a partition.
*/
int lbd, ubd = 0, ubd_save;
Triplet *i_trip;
Node choice;
int i;
if (choice_tuple_size != 0) {
/* 1. sort the set of choices giving a tuple */
choice_tuple = sort_case(choice_tuple);
/* 2. pass over choice_tuple checking that:
* - there are only legal null ranges
* - there are no overlapping ranges
* - if the array aggregate does not have an others
* then there are no missing associations
*/
for (i = 1; (i <= choice_tuple_size); i++) {
ubd_save = ubd;
lbd = ((Triplet *) choice_tuple[i])->inf;
ubd = ((Triplet *) choice_tuple[i])->sup;
choice = ((Triplet *) choice_tuple[i])->choice_node;
/* 1. Check for a null range. */
if ((lbd > ubd) && (choice_tuple_size > 1 || exist_other_choice)) {
errmsg(
"A null range in array aggregate must be the only choice",
"4.3.2.(3)", choice);
prev_error_message = 1;
return (Triplet *)0;
}
/* 2. Check that the ranges do not overlap */
else if ((lbd <= ubd_save) && (i > 1)) {
errmsg(
"Component is not allowed to be specified more than once",
"4.3.(6)", choice);
prev_error_message = 1;
return (Triplet *)0;
}
/* 3. Check that the intersection between the ranges is not null*/
else if ((i > 1) && (!exist_other_choice) && (lbd != ubd_save+1)) {
errmsg("Missing association in array aggregate", "4.3.(6)",
choice);
prev_error_message = 1;
return (Triplet *)0;
}
}
i_trip = triplet_new();
i_trip->inf = ((Triplet *) choice_tuple[1])->inf;
i_trip->sup = ((Triplet *) choice_tuple[choice_tuple_size])->sup;
return (i_trip);
}
}
static Tuple sort_case(Tuple tuple_to_sort) /*;sort_case*/
{
/* This function sorts a tuple of triples based on the value of the
* first element
*/
qsort((char *) &tuple_to_sort[1], tup_size(tuple_to_sort), sizeof (char *),
(int (*)(const void *, const void *))tcompar);
return tuple_to_sort;
}
static int tcompar(Triplet **ptup1, Triplet **ptup2) /*;tcompar*/
{
Triplet *tup1, *tup2;
int n1, n2;
tup1 = *ptup1;
tup2 = *ptup2;
n1 = (int) (tup1->inf);
n2 = (int) (tup2->inf);
if (n1 == n2) return 0;
else if (n1 < n2) return -1;
else return 1;
}
static int abs_val(int x) /*;abs_val*/
{
return (x >= 0) ? x : -x;
}
void complete_aggregate(Symbol agg_type, Node expn) /*;complete_aggregate*/
{
/* Given the context type, resolve the aggregate components. For an array
* type we pass index and component types separately to the recursive
* routine complete_a_aggregate. For record types only the base type is
* needed here. Any required constraints are imposed in resolve2.
*/
if (cdebug2 > 3) TO_ERRFILE("AT PROC : complete_aggregate");
if (is_limited_type(agg_type)) {
errmsg_id("aggregates not available for limited type %", agg_type,
"7.4.4", expn);
}
if (is_array(agg_type)) {
/* if the context allows sliding, the bounds of the aggregate need
* only be verified against the unconstrained type.
*/
if (full_others)
complete_a_aggregate(index_types(agg_type), index_types(agg_type),
component_type(agg_type), can_constrain(agg_type), expn);
else
complete_a_aggregate(index_types(agg_type),
index_types(TYPE_OF(agg_type)), component_type(agg_type),
can_constrain(agg_type), expn);
}
else if (is_record(agg_type))
complete_r_aggregate(base_type(agg_type), expn);
else {
errmsg("Invalid context for aggregate", "none", expn);
}
}
static void complete_a_aggregate(Tuple indices, Tuple base_indices,
Symbol comp_type, int is_unc, Node expn) /*;complete_a_aggregate*/
{
/* Complete processing of an array aggregate. The tree is normalized as
* follows:
* N_KIND = as_array_aggregate
* N_AST = [list_node, others_node]
* where list_node has two entries:
* N_AST = [pos_list, nam_list]
* The first two are list nodes. The elements of N_LIST(nam_list) are
* pairs [choice_list, expression]. The N_KIND of choice nodes are
* as_simple_choice and as_range_choice. A simple_choice includes a
* type name specifiying a range.
*/
Tuple arg_list, pos_list, nam_list, tup, b_itup, itup;
Node others_node, last_arg, choice_list, c_expr, lexpn;
Node arg, i_expr, range_constraint, choice, pos_node, nam_node;
Symbol type_mark, indxt, b_indxt;
Fortup ft1, ft2;
int i, n, nn;
int c_ind, exist_other_choice, lbd, ubd, lbd_val, ubd_val;
int static_test, choice_tuple_size;
int raises;
Tuple choice_tuple;
Triplet *aggr_range;
Node lw_bd, hg_bd, lo_bd, up_bd, simple_expr1, simple_expr2;
char *nchoice;
if (cdebug2 > 3) TO_ERRFILE("AT PROC : complete_a_aggregate");
arg_list = N_LIST(expn);
b_indxt = (Symbol) base_indices[1];
indxt = (Symbol) indices[1];
others_node = OPT_NODE;
pos_list = tup_new(0);
nam_list = tup_new(0);
choice_tuple_size = 0;
static_test = 1;
c_ind = 1;
exist_other_choice = 0;
prev_error_message = 0;
raises = FALSE;
/* STEP 1.
* Remove the OTHERS choice from the arggregate list if it is the last
* component and place in -others_choice-. Otherwise if it appears
* elsewhere in the aggregate it will be noted as a error later.
*/
last_arg = (Node) arg_list[tup_size(arg_list)];
if (N_KIND(last_arg) == as_choice_list) {
choice_list = N_AST1(last_arg);
c_expr = N_AST2(last_arg);
tup = N_LIST(choice_list);
choice = (Node) tup[1];
if (N_KIND(choice) == as_others_choice) {
exist_other_choice = 1;
others_node = c_expr;
if (is_unc || (!is_static_subtype(indxt) && tup_size(arg_list)>1)) {
errmsg("OTHERS choice not allowed in this context", "4.3.2",
last_arg);
} /* process anyway*/
tup_frome(arg_list);
resolve1(c_expr);
n = tup_size(base_indices);
nn = tup_size(indices);
if (nn > 0 && n > 0) {
b_itup = tup_new(n-1);
itup = tup_new(n-1);
for (i = 1; i < n; i++)
b_itup[i] = base_indices[i+1];
for (i = 1; i < nn; i++)
itup[i] = indices[i+1];
complete_component(itup, b_itup, comp_type, is_unc, c_expr);
raises = raises || (N_KIND(c_expr) == as_raise);
}
}
}
/* STEP 2.
* After any others clause has been processed, process the named and
* positional associations
*/
FORTUP(arg = (Node), arg_list, ft1);
if (N_KIND(arg) == as_choice_list) {
/* STEP 2a.
* Process named association choice list
*/
choice_list = N_AST1(arg);
c_expr = N_AST2(arg);
resolve1(c_expr);
n = tup_size(base_indices);
nn = tup_size(indices);
if (nn > 0 && n > 0) {
b_itup = tup_new(n-1);
itup = tup_new(n-1);
for (i = 1; i < n; i++)
b_itup[i] = base_indices[i+1];
for (i = 1; i < nn; i++)
itup[i] = indices[i+1];
complete_component(itup, b_itup, comp_type, is_unc, c_expr);
raises = raises || (N_KIND(c_expr) == as_raise);
}
else
chaos("complete_a_aggregate - indices null");
/* STEP 2b.
* Process each choice in the choice list
*/
FORTUP(choice = (Node), N_LIST(choice_list), ft2);
n = -1;
if (N_KIND(choice) == as_choice_unresolved) {
/* Case: choice_unresolved:
* If the index expression is an identifier, it must be
* a type name or an object.
*/
i_expr = N_AST1(choice);
find_old(i_expr);
type_mark = N_UNQ(i_expr);
if (is_type(type_mark)) {
/* Subcase: type type_mark of choice_unresolved
* check that it is either the only choice -or- is
* static...
* set the N_KIND to a as_simple_name
* check that the type_mark is compatible with
* the base index type
*/
tup = SIGNATURE(type_mark);
lo_bd = (Node) tup[2];
up_bd = (Node) tup[3];
if ((!is_static_expr(lo_bd))||(!is_static_expr(up_bd))){
if ((tup_size(arg_list)>1) || exist_other_choice) {
errmsg(
"Non static choice in array aggregate must be the only choice",
"4.3.2.(3)", choice);
}
static_test = 0;
}
else {
lbd_val = INTV((Const) N_VAL(lo_bd));
ubd_val = INTV((Const) N_VAL(up_bd));
}
N_KIND(choice) = as_simple_name;
nchoice = N_VAL(choice); /* preserve N_VAL */
N_AST1(choice) = (Node)0;
N_AST2(choice) = (Node)0;
N_AST3(choice) = (Node)0;
N_AST4(choice) = (Node)0;
N_UNQ(choice) = type_mark;
N_VAL(choice) = nchoice; /* preserve N_VAL */
if (!compatible_types(type_mark, b_indxt)) {
errmsg("invalid type mark in array aggregate",
"4.3", choice);
return;
}
}
else { /* single association*/
/* Subcase: simple_choice of choice_unresolved
* this is a single association
* set the N_KIND to a as_simple_name check that
* it is either the only choice -or- is static...
*/
N_KIND(choice) = as_simple_choice;
i_expr = N_AST1(choice);
check_type(base_type(b_indxt), i_expr);
if (N_TYPE(i_expr) == symbol_any)
static_test = 0;
else if (!is_static_expr(i_expr)) {
if ((tup_size(arg_list)>1) || exist_other_choice) {
errmsg(
"Non static choice in array aggregate must be the only choice", "4.3.2.(3)",
choice);
}
static_test = 0;
}
else {
lbd_val = INTV((Const) N_VAL(i_expr));
ubd_val = INTV((Const) N_VAL(i_expr));
}
}
}
/* Case: as_simple_choice
* The association is known to be a simple expression.
* check that the type of the expression
* check that it is either the only choice -or- is static...
*/
else if (N_KIND(choice) == as_simple_choice) {
i_expr = N_AST1(choice);
adasem(i_expr);
check_type(base_type(b_indxt), i_expr);
if (N_TYPE(i_expr) == symbol_any)
static_test = 0;
else if (!is_static_expr(i_expr)) {
if ((tup_size(arg_list) > 1) || exist_other_choice) {
errmsg(
"Non static choice in array aggregate must be the only choice",
"4.3.2.(3)", choice);
}
static_test = 0;
}
else {
lbd_val = INTV((Const) N_VAL(i_expr));
ubd_val = INTV((Const) N_VAL(i_expr));
}
}
/* Case: range_choice
*/
else if (N_KIND(choice) == as_range_choice) {
i_expr = N_AST1(choice);
check_type(b_indxt, i_expr);
if (N_KIND(i_expr) == as_subtype) {
/* Subcase: expression is subtype in range_choice
* Extract the constraint itself is static, reformat
* choice as range else check that it is the only
* choice
*/
range_constraint = N_AST2(i_expr);
copy_attributes(range_constraint, choice);
simple_expr1 = N_AST1(range_constraint);
simple_expr2 = N_AST2(range_constraint);
if (N_TYPE(i_expr) == symbol_any)
static_test = 0;
else if ((!is_static_expr(simple_expr1))
|| (!is_static_expr(simple_expr2))) {
if ((tup_size(arg_list) > 1) || exist_other_choice){
errmsg(
"Non static choice in array aggregate must be the only choice",
"4.3.2.(3)", choice);
}
static_test = 0;
}
else {
lbd_val = INTV((Const) N_VAL(simple_expr1));
ubd_val = INTV((Const) N_VAL(simple_expr2));
}
}
else { /*attribute RANGE.*/
/* Subcase: attribute range subtype in range_choice
* this means that it is an attrtibute range
*/
static_test = 0;
}
}
/* Case: others choice (illegal at this point)
*/
else if (N_KIND(choice) == as_others_choice) {
errmsg("OTHERS must be the last aggregate component",
"4.3", choice);
return;
}
/* STEP 2c.
* After processing the choice if it is static then add to
* choice list to be tested with is_partition
*/
if (static_test) {
aggr_range = triplet_new();
aggr_range->inf = lbd_val; /*bounds and node of the curr */
aggr_range->sup = ubd_val; /*choice_node for is_partition*/
aggr_range->choice_node = choice;
if (c_ind == 1)
choice_tuple = tup_new1((char *) aggr_range);
else
choice_tuple =tup_with(choice_tuple,(char *)aggr_range);
}
c_ind++;
ENDFORTUP(ft2); /* choice within a named choice list */
/* STEP 2d.
* Add the choice list to the tuple of named associations
*/
nam_list = tup_with(nam_list, (char *) arg);
}
/* STEP 3.
* Process positional components...
*/
else { /* Positional component. */
resolve1(arg);
n = tup_size(base_indices);
nn = tup_size(indices);
if (nn > 0 && n > 0) {
b_itup = tup_new(n-1);
itup = tup_new(n-1);
for (i = 1; i < n; i++)
b_itup[i] = base_indices[i+1];
for (i = 1; i < nn; i++)
itup[i] = indices[i+1];
complete_component(itup, b_itup, comp_type, is_unc, arg);
raises = raises || (N_KIND(arg) == as_raise);
}
else chaos("complete_a_aggregate - indices null");
pos_list = tup_with(pos_list, (char *) arg);
}
ENDFORTUP(ft1); /* end of processing the choice lists */
/* STEP 4.
* Perform the final checks.
* A. Check that either the name list or the position list is null
* B. Check for valid context for Others choice
*/
if (tup_size(pos_list) > 0 && tup_size(nam_list) > 0) {
errmsg_l("In a positional aggregate only named association ",
"allowed is OTHERS", "4.3.2", expn);
return;
}
else if (others_node != OPT_NODE && !full_others && tup_size(nam_list) !=0){
errmsg("Invalid context for OTHERS and named associations",
"4.3.2(6)", others_node);
return;
}
tup = SIGNATURE(indxt); /*range of the array.*/
lw_bd = (Node) tup[2];
hg_bd = (Node) tup[3];
/* STEP 5.
* Perform check is it is static and named
* If it is a partition then check:
* A. If the range is out of bounds (base index) considering sliding
* B. if the size of the choice range is less than the index range
* C. if the size of the choice range is greater that the index range
* D. if the choice range is null and the index range is not
*/
if (n == -1 && static_test) {
choice_tuple_size = tup_size(choice_tuple);
aggr_range = is_partition(choice_tuple, choice_tuple_size,
exist_other_choice);
if (!prev_error_message && !exist_other_choice) {
lbd = aggr_range->inf;
ubd = aggr_range->sup;
tup = SIGNATURE(b_indxt); /*range of the indices.*/
lo_bd = (Node) tup[2];
up_bd = (Node) tup[3];
if ((is_static_expr(lo_bd)) && (is_static_expr(up_bd))) {
lbd_val = INTV((Const) N_VAL(lo_bd));
ubd_val = INTV((Const) N_VAL(up_bd));
/* Check A */
if ((lbd_val > lbd || ubd_val < ubd)
&& (ubd_val > lbd_val && ubd > lbd) /*Non-null range*/
&& full_others) {
/* Does not check anything if the subtype_range or the
* aggregate_range is null, according to test c43206a.
*/
raises = TRUE;
}
}
if (!is_unc) {
if ((is_static_expr(lw_bd)) && (is_static_expr(hg_bd))) {
lbd_val = INTV((Const) N_VAL(lw_bd));
ubd_val = INTV((Const) N_VAL(hg_bd));
/* TBSL : ubd_val-lbd_val may be superior to INTEGER'LAST.
* Use multiprecision.
*/
/* Check B */
if ((ubd_val > lbd_val && ubd > lbd) /*Non-null range*/
&& (abs_val(ubd_val - lbd_val) < abs_val(ubd - lbd)))
raises = TRUE;
/* TBSL : ubd_val-lbd_val may be superior to INTEGER'LAST.
* Use multiprecision.
*/
/* Check C */
else if ((ubd_val > lbd_val && ubd > lbd) /*Non-null range*/
&& (abs_val(ubd_val - lbd_val) > abs_val(ubd - lbd))) {
/* CONSTRAINT_ERROR may be raised according to test
* c48009f instead of:
* errmsg("Missing association in array aggregate",
* "4.3.(6)", expn);
*/
raises = TRUE;
}
/* Check D */
else if (ubd_val < lbd_val && ubd > lbd) {
raises = TRUE;
}
}
}
}
}
/* STEP 6.
* Perform check is it is position, not others and unconstrained
*/
if (n != -1 && !is_unc && !exist_other_choice) { /*Positional components*/
if ((is_static_expr(lw_bd)) && (is_static_expr(hg_bd))) {
lbd_val = INTV((Const) N_VAL(lw_bd));
ubd_val = INTV((Const) N_VAL(hg_bd));
/* TBSL : ubd_val-lbd_val may be superior to INTEGER'LAST.
* Use multiprecision.
*/
if (tup_size(pos_list) != abs_val(ubd_val-lbd_val) + 1) {
raises = TRUE;
}
}
}
/* STEP 7.
* Proccess an others choice by itself by converted into a named
* association
*/
if (tup_size(pos_list) == 0 && tup_size(nam_list) == 0) {
if ((N_KIND(lw_bd) == as_ivalue || N_KIND(lw_bd) == as_discr_ref)
&& (N_KIND(hg_bd) == as_ivalue || N_KIND(hg_bd) == as_discr_ref)) {
choice = node_new(as_range);
N_AST1(choice) = copy_tree(lw_bd);
N_AST2(choice) = copy_tree(hg_bd);
arg = node_new(as_choice_list);
N_AST1(arg) = node_new(as_list);
N_LIST(N_AST1(arg)) = tup_new1( (char *)choice);
N_AST2(arg) = others_node;
nam_list = tup_new1( (char *)arg);
others_node = OPT_NODE;
}
}
/* If any component or subaggregate raises constraint error, replace the
* whole aggregate by a raise node.
*/
if (raises) {
create_raise(expn, symbol_constraint_error);
return;
}
/* STEP 8.
* Create the pos and name lists nodes
*/
pos_node = node_new(as_list);
nam_node = node_new(as_list);
N_LIST(pos_node) = pos_list;
N_LIST(nam_node) = nam_list;
N_KIND(expn) = as_array_aggregate;
N_UNQ(expn) = sym_new(na_void);
N_LIST(expn) = tup_new(0); /* no further need for it.*/
lexpn = node_new(as_aggregate_list);
N_AST1(lexpn) = pos_node;
N_AST2(lexpn) = nam_node;
N_AST1(expn) = lexpn;
N_AST2(expn) = others_node;
N_AST4(expn) = (Node) 0;
}
static void complete_component(Tuple indices, Tuple b_indices, Symbol comp_type,
int is_unc, Node expn) /*;complete_component*/
{
/* Complete the resolution of a component of an array aggregate. If it
* is a multidimensional aggregate, the component itself is an array and
* a recursive call is made with the remaining indices. String literals
* are handled in their own routine.
*/
Node expn2;
if (cdebug2 > 3) TO_ERRFILE("AT PROC complete_component");
if (tup_size(b_indices) == 0)
res2_check(expn, comp_type);
else if (N_KIND(expn) == as_aggregate)
complete_a_aggregate(indices, b_indices, comp_type, is_unc, expn);
else if (N_KIND(expn) == as_string_literal) {
if (tup_size(b_indices) != 1) {
errmsg("Invalid use of literal in aggregate", "4.3.2", expn);
return;
}
complete_string_literal(expn, comp_type);
N_TYPE(expn) = (Symbol) 0; /* clear as no type defined here */
}
else if (N_KIND(expn) == as_parenthesis) {
/* Context of subaggregate is unconstrained, "others" choice is not*/
/* allowed.*/
expn2 = N_AST1(expn);
complete_component(indices, b_indices, comp_type, TRUE, expn2);
}
else {
errmsg("Expect aggregate for component of multidimensional aggregate",
"4.3.2", expn);
}
}
void complete_string_literal(Node node, Symbol comp)
/*;complete_string_literal*/
{
/* String literals can appear as aggregates for arrays of character type.
* We have to verify that each character in the string is an enumeration
* literal for that type.
*/
char *strg, c, *lit;
Tuple arr, lit_map;
Node lo, hi;
Symbol sc;
int i, strglen, istr, ilitmap, v, exists, found;
strg = N_VAL(node);
sc = SCOPE_OF(comp);
if (!tup_mem((char *)sc, open_scopes) && !tup_mem((char *)sc, used_mods)) {
errmsg("characters in a string literal must be directly visible",
"4.2(3)", node);
}
if (comp == symbol_character || comp == symbol_any) {
/*arr := [abs c: c in strg];*/
strglen = strlen(strg);
arr = tup_new(strglen);
for (i = 1; i <= strglen; i++)
arr[i] = (char *) strg[i-1];
N_VAL(node) = (char *) arr;
N_KIND(node) = as_string_ivalue;