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
|
/* Code to test for "definitive assignment".
Copyright (C) 1999 Free Software Foundation, Inc.
This program 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 2, or (at your option)
any later version.
This program 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 GNU CC; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
Java and all Java-based marks are trademarks or registered trademarks
of Sun Microsystems, Inc. in the United States and other countries.
The Free Software Foundation is independent of Sun Microsystems, Inc. */
/* Written by Per Bothner <bothner@cygnus.com>, January 1999. */
#include "config.h"
#include "system.h"
#include "tree.h"
#include "java-tree.h"
#include "toplev.h" /* Needed for fatal. */
/* The basic idea is that we assign each local variable declaration
an index, and then we pass around bitstrings, where the i'th bit
is set if decl whose DECL_BIT_INDEX is i is definitely assigned. */
/* One segment of a bitstring. */
typedef unsigned int word;
/* Pointer to a bitstring. */
typedef word *words;
/* For a local VAR_DECL, holds the index into a words bitstring that
specifies if this decl is definitively assigned.
A DECL_BIT_INDEX of -1 means we no longer care. */
#define DECL_BIT_INDEX(DECL) DECL_FIELD_SIZE(DECL)
/* Number of locals variables currently active. */
int num_current_locals = 0;
/* The index of the first local variable in the current block.
The variables whose DECL_BIT_INDEX are in the range from
start_current_locals (inclusive) up to num_current_locals (exclusive)
are declared in the "current" block. If there is a loop or branch
form, we set start_current_locals to num_current_locals to indicate
there is no current block.
The point is that if a variable in the current block is set,
there are no other control paths that we have to worry about.
Hence, we can remove it from the set of variables we are
checking, making its bit index available for some other variable.
For simplicity, we only do that if the variable's bit index
is (num_current_locals-1); freeing up its bit index is then
just a simple matter of decrementing num_current_locals.
The reason this is worth doing is that it is simple, and
allows us to use short (usually one-word) bit-strings,
even for methods with thousands of local variables, as
long as most of them are initialized immediately after or in
their declaration. */
int start_current_locals = 0;
int num_current_words = 1;
static tree wfl;
#define COPYN(DST, SRC, NWORDS) memcpy (DST, SRC, NWORDS * sizeof(word))
#define COPY(DST, SRC) COPYN (DST, SRC, num_current_words)
#define SET_ALL(DST) memset (DST, ~0, num_current_words * sizeof(word))
#define CLEAR_ALL(DST) memset (DST, 0, num_current_words * sizeof(word))
#define INTERSECTN(DST, SRC1, SRC2, N) \
do { int n = N; \
while (--n >= 0) DST[n] = SRC1[n] & SRC2[n]; \
} while (0)
#define UNION(DST, SRC1, SRC2) \
UNIONN (DST, SRC1, SRC2, num_current_words)
#define UNIONN(DST, SRC1, SRC2, N) \
do { int n = N; \
while (--n >= 0) DST[n] = SRC1[n] | SRC2[n]; \
} while (0)
#define INTERSECT(DST, SRC1, SRC2) \
INTERSECTN (DST, SRC1, SRC2, num_current_words)
#define WORD_SIZE ((unsigned int)(sizeof(word) * 8))
static void check_bool_init PROTO ((tree, words, words, words));
static void check_init PROTO ((tree, words));
static void check_cond_init PROTO ((tree, tree, tree, words, words, words));
#if 0
#define ALLOC_WORDS(NUM) ((word*) xmalloc ((NUM) * sizeof (word)))
#define FREE_WORDS(PTR) (free (PTR))
#else
#define ALLOC_WORDS(NUM) ((word*)alloca ((NUM) * sizeof (word)))
#define FREE_WORDS(PTR) ((void)0)
#endif
#define SET_P(WORDS, BIT) \
(WORDS[BIT / WORD_SIZE] & (1 << (BIT % WORD_SIZE)))
#define CLEAR_BIT(WORDS, BIT) \
(WORDS[BIT / WORD_SIZE] &= ~ (1 << (BIT % WORD_SIZE)))
#define SET_BIT(WORDS, BIT) \
(WORDS[BIT / WORD_SIZE] |= (1 << (BIT % WORD_SIZE)))
#define WORDS_NEEDED(BITS) (((BITS)+(WORD_SIZE-1))/(WORD_SIZE))
/* Check a conditional form (TEST_EXP ? THEN_EXP : ELSE_EXP) for
definite assignment.
BEFORE, WHEN_FALSE, and WHEN_TRUE are as in check_bool_init. */
static void
check_cond_init (test_exp, then_exp, else_exp,
before, when_false, when_true)
tree test_exp, then_exp, else_exp;
words before, when_false, when_true;
{
words tmp = ALLOC_WORDS (6 * num_current_words);
words test_false = tmp;
words test_true = tmp + num_current_words;
words then_false = tmp + 2 * num_current_words;
words then_true = tmp + 3 * num_current_words;
words else_false = tmp + 4 * num_current_words;
words else_true = tmp + 5 * num_current_words;
check_bool_init (test_exp, before, test_false, test_true);
check_bool_init (then_exp, test_true, then_false, then_true);
check_bool_init (else_exp, test_false, else_false, else_true);
INTERSECT (when_false, then_false, else_false);
INTERSECT (when_true, then_true, else_true);
FREE_WORDS (tmp);
}
/* Check a boolean binary form CODE (EXP0, EXP1),
where CODE is one of EQ_EXPR, BIT_AND_EXPR, or BIT_IOR_EXPR.
BEFORE, WHEN_FALSE, and WHEN_TRUE are as in check_bool_init. */
static void
check_bool2_init (code, exp0, exp1, before, when_false, when_true)
enum tree_code code; tree exp0, exp1;
words before, when_false, when_true;
{
word buf[4];
words tmp = num_current_words <= 1 ? buf
: ALLOC_WORDS (4 * num_current_words);
words when_false_0 = tmp;
words when_false_1 = tmp+num_current_words;
words when_true_0 = tmp+2*num_current_words;
words when_true_1 = tmp+3*num_current_words;
check_bool_init (exp0, before, when_false_0, when_true_0);
INTERSECT (before, when_false_0, when_true_0);
check_bool_init (exp1, before, when_false_1, when_true_1);
INTERSECT (before, when_false_1, when_true_1);
if (code == EQ_EXPR)
{
/* Now set:
* when_true = (when_false_1 INTERSECTION when_true_1)
* UNION (when_true_0 INTERSECTION when_false_1)
* UNION (when_false_0 INTERSECTION when_true_1);
* using when_false and before as temporary working areas. */
INTERSECT (when_true, when_true_0, when_false_1);
INTERSECT (when_false, when_true_0, when_false_1);
UNION (when_true, when_true, when_false);
UNION (when_true, when_true, before);
/* Now set:
* when_false = (when_false_1 INTERSECTION when_true_1)
* UNION (when_true_0 INTERSECTION when_true_1)
* UNION (when_false_0 INTERSECTION when_false_1);
* using before as a temporary working area. */
INTERSECT (when_false, when_true_0, when_true_1);
UNION (when_false, when_false, before);
INTERSECT (before, when_false_0, when_false_1);
UNION (when_false, when_false, before);
}
else if (code == BIT_AND_EXPR || code == TRUTH_AND_EXPR)
{
UNION (when_true, when_true_0, when_true_1);
INTERSECT (when_false, when_false_0, when_false_1);
UNION (when_false, when_false, before);
}
else /* if (code == BIT_IOR_EXPR || code == TRUTH_OR_EXPR) */
{
UNION (when_false, when_false_0, when_false_1);
INTERSECT (when_true, when_true_0, when_true_1);
UNION (when_true, when_true, before);
}
if (tmp != buf)
FREE_WORDS (tmp);
}
/* Check a boolean expression EXP for definite assignment.
BEFORE is the set of variables definitely assigned before the conditional.
(This bitstring may be modified arbitrarily in this function.)
On output, WHEN_FALSE is the set of variables definitely assigned after
the conditional when the conditional is false.
On output, WHEN_TRUE is the set of variables definitely assigned after
the conditional when the conditional is true.
(WHEN_FALSE and WHEN_TRUE are overwriten with initial values ignored.)
(None of BEFORE, WHEN_FALSE, or WHEN_TRUE can overlap, as they may
be used as temporary working areas. */
static void
check_bool_init (exp, before, when_false, when_true)
tree exp;
words before, when_false, when_true;
{
switch (TREE_CODE (exp))
{
case COND_EXPR:
check_cond_init (TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
TREE_OPERAND (exp, 2),
before, when_false, when_true);
return;
case TRUTH_ANDIF_EXPR:
check_cond_init (TREE_OPERAND (exp, 0),
TREE_OPERAND (exp, 1), boolean_false_node,
before, when_false, when_true);
return;
case TRUTH_ORIF_EXPR:
check_cond_init (TREE_OPERAND (exp, 0),
boolean_true_node, TREE_OPERAND (exp, 1),
before, when_false, when_true);
return;
case TRUTH_NOT_EXPR:
check_bool_init (TREE_OPERAND (exp, 0), before, when_true, when_false);
return;
case MODIFY_EXPR:
{
tree tmp = TREE_OPERAND (exp, 0);
if (TREE_CODE (tmp) == VAR_DECL && ! FIELD_STATIC (tmp))
{
int index;
check_bool_init (TREE_OPERAND (exp, 1), before,
when_false, when_true);
index = DECL_BIT_INDEX (tmp);
if (index >= 0)
{
SET_BIT (when_false, index);
SET_BIT (when_true, index);
}
break;
}
}
goto do_default;
case BIT_AND_EXPR:
case BIT_IOR_EXPR:
case TRUTH_AND_EXPR:
case TRUTH_OR_EXPR:
case EQ_EXPR:
check_bool2_init (TREE_CODE (exp),
TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
before, when_false, when_true);
return;
case TRUTH_XOR_EXPR:
case BIT_XOR_EXPR:
case NE_EXPR:
/* Just like EQ_EXPR, but switch when_true and when_false. */
check_bool2_init (EQ_EXPR, TREE_OPERAND (exp, 0), TREE_OPERAND (exp, 1),
before, when_true, when_false);
return;
case INTEGER_CST:
if (integer_zerop (exp))
{
SET_ALL (when_true);
COPY (when_false, before);
}
else
{
SET_ALL (when_false);
COPY (when_true, before);
}
break;
default:
do_default:
check_init (exp, before);
COPY (when_false, before);
COPY (when_true, before);
}
}
/* Used to keep track of control flow branches. */
struct alternatives
{
struct alternatives *outer;
/* The value of num_current_locals at the start of this compound. */
int num_locals;
/* The value of the "before" set at the start of the control stucture.
Used for SWITCH_EXPR but not set for LABELED_BLOCK_EXPR. */
words saved;
int save_start_current_locals;
/* If num_current_words==1, combined==&one_word, for efficiency. */
word one_word;
/* The intersection of the "after" sets from previous branches. */
words combined;
tree block;
};
struct alternatives * alternatives = NULL;
#define BEGIN_ALTERNATIVES(before, current) \
{ \
current.saved = NULL; \
current.num_locals = num_current_locals; \
current.combined = num_current_words <= 1 ? ¤t.one_word \
: ALLOC_WORDS (num_current_words); \
SET_ALL (current.combined); \
current.outer = alternatives; \
alternatives = ¤t; \
current.save_start_current_locals = start_current_locals; \
start_current_locals = num_current_locals; \
}
static void
done_alternative (after, current)
words after;
struct alternatives *current;
{
INTERSECTN (current->combined, current->combined, after,
WORDS_NEEDED (current->num_locals));
}
#define END_ALTERNATIVES(after, current) \
{ \
alternatives = current.outer; \
COPY (after, current.combined); \
if (current.combined != ¤t.one_word) \
FREE_WORDS (current.combined); \
start_current_locals = current.save_start_current_locals; \
}
/* Check for (un)initialized local variables in EXP.
*/
static void
check_init (exp, before)
tree exp;
words before;
{
tree tmp;
again:
switch (TREE_CODE (exp))
{
case VAR_DECL:
if (! FIELD_STATIC (exp) && DECL_NAME (exp) != NULL_TREE)
{
int index = DECL_BIT_INDEX (exp);
if (index >= 0 && ! SET_P (before, index))
{
#if 1
parse_error_context (wfl,
"Variable `%s' may not have been initialized"
, IDENTIFIER_POINTER (DECL_NAME (exp)));
#else
error_with_decl (exp, "variable may be used uninitialized");
#endif
/* Suppress further errors. */
DECL_BIT_INDEX (exp) = -1;
}
}
break;
case MODIFY_EXPR:
tmp = TREE_OPERAND (exp, 0);
if (TREE_CODE (tmp) == VAR_DECL && ! FIELD_STATIC (tmp))
{
int index;
check_init (TREE_OPERAND (exp, 1), before);
index = DECL_BIT_INDEX (tmp);
if (index >= 0)
SET_BIT (before, index);
/* Minor optimization. See comment for start_current_locals. */
if (index >= start_current_locals
&& index == num_current_locals - 1)
{
num_current_locals--;
DECL_BIT_INDEX (tmp) = -1;
}
break;
}
else
goto binop;
case BLOCK:
if (BLOCK_EXPR_BODY (exp))
{
tree decl = BLOCK_EXPR_DECLS (exp);
int words_needed;
word* tmp;
int i;
int save_start_current_locals = start_current_locals;
int save_num_current_words = num_current_words;
start_current_locals = num_current_locals;
for (; decl != NULL_TREE; decl = TREE_CHAIN (decl))
{
DECL_BIT_INDEX (decl) = num_current_locals++;
}
words_needed = WORDS_NEEDED (num_current_locals);
if (words_needed > num_current_words)
{
tmp = ALLOC_WORDS (words_needed);
COPY (tmp, before);
num_current_words = words_needed;
}
else
tmp = before;
for (i = start_current_locals; i < num_current_locals; i++)
CLEAR_BIT (tmp, i);
check_init (BLOCK_EXPR_BODY (exp), tmp);
num_current_locals = start_current_locals;
start_current_locals = save_start_current_locals;
if (tmp != before)
{
num_current_words = save_num_current_words;
COPY (before, tmp);
FREE_WORDS (tmp);
}
}
break;
case LOOP_EXPR:
{
struct alternatives alt;
BEGIN_ALTERNATIVES (before, alt);
alt.block = exp;
check_init (TREE_OPERAND (exp, 0), before);
done_alternative (before, &alt);
END_ALTERNATIVES (before, alt);
return;
}
case EXIT_EXPR:
{
struct alternatives *alt = alternatives;
words tmp = ALLOC_WORDS (2 * num_current_words);
words when_true = tmp;
words when_false = tmp + num_current_words;
#ifdef ENABLE_CHECKING
if (TREE_CODE (alt->block) != LOOP_EXPR)
fatal ("internal error in check-init: EXIT_EXPR not in LOOP_EXPR");
#endif
check_bool_init (TREE_OPERAND (exp, 0), before, when_false, when_true);
done_alternative (when_true, alt);
COPY (before, when_false);
FREE_WORDS (tmp);
return;
}
case LABELED_BLOCK_EXPR:
{
struct alternatives alt;
BEGIN_ALTERNATIVES (before, alt);
alt.block = exp;
if (LABELED_BLOCK_BODY (exp))
check_init (LABELED_BLOCK_BODY (exp), before);
done_alternative (before, &alt);
END_ALTERNATIVES (before, alt);
return;
}
case EXIT_BLOCK_EXPR:
{
tree block = TREE_OPERAND (exp, 0);
struct alternatives *alt = alternatives;
while (alt->block != block)
alt = alt->outer;
done_alternative (before, alt);
SET_ALL (before);
return;
}
case SWITCH_EXPR:
{
struct alternatives alt;
check_init (TREE_OPERAND (exp, 0), before);
BEGIN_ALTERNATIVES (before, alt);
alt.saved = ALLOC_WORDS (num_current_words);
COPY (alt.saved, before);
alt.block = exp;
check_init (TREE_OPERAND (exp, 1), before);
done_alternative (before, &alt);
FREE_WORDS (alt.saved);
END_ALTERNATIVES (before, alt);
return;
}
case CASE_EXPR:
case DEFAULT_EXPR:
{
int i;
struct alternatives *alt = alternatives;
while (TREE_CODE (alt->block) != SWITCH_EXPR)
alt = alt->outer;
COPYN (before, alt->saved, WORDS_NEEDED (alt->num_locals));
for (i = alt->num_locals; i < num_current_locals; i++)
CLEAR_BIT (before, i);
break;
}
case CLEANUP_POINT_EXPR:
{
struct alternatives alt;
BEGIN_ALTERNATIVES (before, alt);
CLEAR_ALL (alt.combined);
check_init (TREE_OPERAND (exp, 0), before);
UNION (alt.combined, alt.combined, before);
END_ALTERNATIVES (before, alt);
}
return;
case WITH_CLEANUP_EXPR:
{
struct alternatives *alt = alternatives;
#ifdef ENABLE_CHECKING
if (TREE_CODE (alt->block) != CLEANUP_POINT_EXPR)
fatal ("internal error in check-init: WITH_CLEANUP_EXPR not in CLEANUP_POINT_EXPR");
#endif
check_init (TREE_OPERAND (exp, 0), before);
UNION (alt->combined, alt->combined, before);
check_init (TREE_OPERAND (exp, 2), alt->combined);
return;
}
case TRY_EXPR:
{
tree try_clause = TREE_OPERAND (exp, 0);
tree clause = TREE_OPERAND (exp, 1);
words save = ALLOC_WORDS (num_current_words);
words tmp = ALLOC_WORDS (num_current_words);
struct alternatives alt;
BEGIN_ALTERNATIVES (before, alt);
COPY (save, before);
COPY (tmp, save);
check_init (try_clause, tmp);
done_alternative (tmp, &alt);
for ( ; clause != NULL_TREE; clause = TREE_CHAIN (clause))
{
tree catch_clause = TREE_OPERAND (clause, 0);
COPY (tmp, save);
check_init (catch_clause, tmp);
done_alternative (tmp, &alt);
}
FREE_WORDS (tmp);
FREE_WORDS (save);
END_ALTERNATIVES (before, alt);
}
return;
case TRY_FINALLY_EXPR:
{
words tmp = ALLOC_WORDS (num_current_words);
COPY (tmp, before);
check_init (TREE_OPERAND (exp, 0), tmp);
check_init (TREE_OPERAND (exp, 1), before);
FREE_WORDS (tmp);
}
return;
case RETURN_EXPR:
case THROW_EXPR:
if (TREE_OPERAND (exp, 0))
check_init (TREE_OPERAND (exp, 0), before);
goto never_continues;
case ERROR_MARK:
never_continues:
SET_ALL (before);
return;
case COND_EXPR:
case TRUTH_ANDIF_EXPR:
case TRUTH_ORIF_EXPR:
{
words tmp = ALLOC_WORDS (2 * num_current_words);
words when_true = tmp;
words when_false = tmp + num_current_words;
check_bool_init (exp, before, when_false, when_true);
INTERSECT (before, when_false, when_true);
FREE_WORDS (tmp);
}
break;
case UNARY_PLUS_EXPR:
case NEGATE_EXPR:
case TRUTH_AND_EXPR:
case TRUTH_OR_EXPR:
case TRUTH_XOR_EXPR:
case TRUTH_NOT_EXPR:
case BIT_NOT_EXPR:
case CONVERT_EXPR:
case COMPONENT_REF:
case NOP_EXPR:
case FLOAT_EXPR:
case FIX_TRUNC_EXPR:
case INDIRECT_REF:
case ADDR_EXPR:
case SAVE_EXPR:
case PREDECREMENT_EXPR:
case PREINCREMENT_EXPR:
case POSTDECREMENT_EXPR:
case POSTINCREMENT_EXPR:
case NON_LVALUE_EXPR:
case INSTANCEOF_EXPR:
/* Avoid needless recursion. */
exp = TREE_OPERAND (exp, 0);
goto again;
case COMPOUND_EXPR:
case PLUS_EXPR:
case MINUS_EXPR:
case MULT_EXPR:
case TRUNC_DIV_EXPR:
case TRUNC_MOD_EXPR:
case RDIV_EXPR:
case LSHIFT_EXPR:
case RSHIFT_EXPR:
case URSHIFT_EXPR:
case BIT_AND_EXPR:
case BIT_XOR_EXPR:
case BIT_IOR_EXPR:
case EQ_EXPR:
case NE_EXPR:
case GT_EXPR:
case GE_EXPR:
case LT_EXPR:
case LE_EXPR:
case ARRAY_REF:
binop:
check_init (TREE_OPERAND (exp, 0), before);
/* Avoid needless recursion, especially for COMPOUND_EXPR. */
exp = TREE_OPERAND (exp, 1);
goto again;
case PARM_DECL:
case RESULT_DECL:
case FUNCTION_DECL:
case INTEGER_CST:
case REAL_CST:
case STRING_CST:
break;
case NEW_CLASS_EXPR:
case CALL_EXPR:
{
tree func = TREE_OPERAND (exp, 0);
tree x = TREE_OPERAND (exp, 1);
if (TREE_CODE (func) == ADDR_EXPR)
func = TREE_OPERAND (func, 0);
check_init (func, before);
for ( ; x != NULL_TREE; x = TREE_CHAIN (x))
check_init (TREE_VALUE (x), before);
if (func == throw_node)
goto never_continues;
}
break;
case NEW_ARRAY_INIT:
{
tree x = CONSTRUCTOR_ELTS (TREE_OPERAND (exp, 0));
for ( ; x != NULL_TREE; x = TREE_CHAIN (x))
check_init (TREE_VALUE (x), before);
}
break;
case EXPR_WITH_FILE_LOCATION:
{
char *saved_input_filename = input_filename;
tree saved_wfl = wfl;
tree body = EXPR_WFL_NODE (exp);
int saved_lineno = lineno;
if (body == empty_stmt_node)
break;
wfl = exp;
input_filename = EXPR_WFL_FILENAME (exp);
lineno = EXPR_WFL_LINENO (exp);
check_init (body, before);
input_filename = saved_input_filename;
lineno = saved_lineno;
wfl = saved_wfl;
}
break;
default:
fatal ("internal error in check-init: tree code not implemented: %s",
tree_code_name [(int) TREE_CODE (exp)]);
}
}
void
check_for_initialization (body)
tree body;
{
word before = 0;
check_init (body, &before);
}
|