]>
Commit | Line | Data |
---|---|---|
79e68feb | 1 | /* Output variables, constants and external declarations, for GNU compiler. |
829bd124 | 2 | Copyright (C) 1987, 88, 89, 92, 93, 94, 1995 Free Software Foundation, Inc. |
79e68feb RS |
3 | |
4 | This file is part of GNU CC. | |
5 | ||
6 | GNU CC is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2, or (at your option) | |
9 | any later version. | |
10 | ||
11 | GNU CC is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with GNU CC; see the file COPYING. If not, write to | |
18 | the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */ | |
19 | ||
20 | ||
21 | /* This file handles generation of all the assembler code | |
22 | *except* the instructions of a function. | |
23 | This includes declarations of variables and their initial values. | |
24 | ||
25 | We also output the assembler code for constants stored in memory | |
26 | and are responsible for combining constants with the same value. */ | |
27 | ||
28 | #include <stdio.h> | |
29 | #include <setjmp.h> | |
30 | /* #include <stab.h> */ | |
31 | #include "config.h" | |
32 | #include "rtl.h" | |
33 | #include "tree.h" | |
34 | #include "flags.h" | |
57632c51 | 35 | #include "function.h" |
79e68feb | 36 | #include "expr.h" |
5a13eaa4 | 37 | #include "output.h" |
79e68feb RS |
38 | #include "hard-reg-set.h" |
39 | #include "regs.h" | |
9a631e8e | 40 | #include "defaults.h" |
24b09b50 | 41 | #include "real.h" |
ca695ac9 | 42 | #include "bytecode.h" |
79e68feb RS |
43 | |
44 | #include "obstack.h" | |
45 | ||
b4ac57ab | 46 | #ifdef XCOFF_DEBUGGING_INFO |
f246a305 | 47 | #include "xcoffout.h" |
b4ac57ab RS |
48 | #endif |
49 | ||
6baacf63 RS |
50 | #include <ctype.h> |
51 | ||
79e68feb RS |
52 | #ifndef ASM_STABS_OP |
53 | #define ASM_STABS_OP ".stabs" | |
54 | #endif | |
55 | ||
561e6650 RS |
56 | /* This macro gets just the user-specified name |
57 | out of the string in a SYMBOL_REF. On most machines, | |
58 | we discard the * if any and that's all. */ | |
59 | #ifndef STRIP_NAME_ENCODING | |
60 | #define STRIP_NAME_ENCODING(VAR,SYMBOL_NAME) \ | |
61 | (VAR) = ((SYMBOL_NAME) + ((SYMBOL_NAME)[0] == '*')) | |
62 | #endif | |
63 | ||
79e68feb RS |
64 | /* File in which assembler code is being written. */ |
65 | ||
66 | extern FILE *asm_out_file; | |
67 | ||
68 | /* The (assembler) name of the first globally-visible object output. */ | |
69 | char *first_global_object_name; | |
70 | ||
71 | extern struct obstack *current_obstack; | |
72 | extern struct obstack *saveable_obstack; | |
75974726 | 73 | extern struct obstack *rtl_obstack; |
79e68feb RS |
74 | extern struct obstack permanent_obstack; |
75 | #define obstack_chunk_alloc xmalloc | |
79e68feb RS |
76 | |
77 | /* Number for making the label on the next | |
78 | constant that is stored in memory. */ | |
79 | ||
80 | int const_labelno; | |
81 | ||
82 | /* Number for making the label on the next | |
83 | static variable internal to a function. */ | |
84 | ||
85 | int var_labelno; | |
86 | ||
dcc8e5e6 RS |
87 | /* Carry information from ASM_DECLARE_OBJECT_NAME |
88 | to ASM_FINISH_DECLARE_OBJECT. */ | |
89 | ||
90 | int size_directive_output; | |
91 | ||
cbed4565 RS |
92 | /* The last decl for which assemble_variable was called, |
93 | if it did ASM_DECLARE_OBJECT_NAME. | |
94 | If the last call to assemble_variable didn't do that, | |
95 | this holds 0. */ | |
96 | ||
97 | tree last_assemble_variable_decl; | |
98 | ||
79e68feb RS |
99 | /* Nonzero if at least one function definition has been seen. */ |
100 | static int function_defined; | |
101 | ||
5a13eaa4 RK |
102 | struct addr_const; |
103 | struct constant_descriptor; | |
104 | struct rtx_const; | |
105 | struct pool_constant; | |
106 | ||
107 | static void bc_make_decl_rtl PROTO((tree, char *, int)); | |
108 | static char *strip_reg_name PROTO((char *)); | |
109 | static void bc_output_ascii PROTO((FILE *, char *, int)); | |
110 | static int contains_pointers_p PROTO((tree)); | |
111 | static void decode_addr_const PROTO((tree, struct addr_const *)); | |
112 | static int const_hash PROTO((tree)); | |
113 | static int compare_constant PROTO((tree, | |
114 | struct constant_descriptor *)); | |
115 | static char *compare_constant_1 PROTO((tree, char *)); | |
116 | static struct constant_descriptor *record_constant PROTO((tree)); | |
117 | static void record_constant_1 PROTO((tree)); | |
118 | static tree copy_constant PROTO((tree)); | |
119 | static void output_constant_def_contents PROTO((tree, int, int)); | |
120 | static void decode_rtx_const PROTO((enum machine_mode, rtx, | |
121 | struct rtx_const *)); | |
122 | static int const_hash_rtx PROTO((enum machine_mode, rtx)); | |
123 | static int compare_constant_rtx PROTO((enum machine_mode, rtx, | |
124 | struct constant_descriptor *)); | |
125 | static struct constant_descriptor *record_constant_rtx PROTO((enum machine_mode, | |
126 | rtx)); | |
127 | static struct pool_constant *find_pool_constant PROTO((rtx)); | |
128 | static int output_addressed_constants PROTO((tree)); | |
129 | static void bc_assemble_integer PROTO((tree, int)); | |
130 | static void output_constructor PROTO((tree, int)); | |
79e68feb RS |
131 | \f |
132 | #ifdef EXTRA_SECTIONS | |
8a425a05 | 133 | static enum in_section {no_section, in_text, in_data, in_named, EXTRA_SECTIONS} in_section |
79e68feb RS |
134 | = no_section; |
135 | #else | |
8a425a05 | 136 | static enum in_section {no_section, in_text, in_data, in_named} in_section |
79e68feb RS |
137 | = no_section; |
138 | #endif | |
139 | ||
8a425a05 DE |
140 | /* Return a non-zero value if DECL has a section attribute. */ |
141 | #define IN_NAMED_SECTION(DECL) \ | |
142 | ((TREE_CODE (DECL) == FUNCTION_DECL || TREE_CODE (DECL) == VAR_DECL) \ | |
143 | && DECL_SECTION_NAME (DECL) != NULL_TREE) | |
144 | ||
145 | /* Text of section name when in_section == in_named. */ | |
146 | static char *in_named_name; | |
147 | ||
79e68feb RS |
148 | /* Define functions like text_section for any extra sections. */ |
149 | #ifdef EXTRA_SECTION_FUNCTIONS | |
150 | EXTRA_SECTION_FUNCTIONS | |
151 | #endif | |
152 | ||
153 | /* Tell assembler to switch to text section. */ | |
154 | ||
155 | void | |
156 | text_section () | |
157 | { | |
158 | if (in_section != in_text) | |
159 | { | |
ca695ac9 JB |
160 | if (output_bytecode) |
161 | bc_text (); | |
162 | else | |
163 | fprintf (asm_out_file, "%s\n", TEXT_SECTION_ASM_OP); | |
164 | ||
79e68feb RS |
165 | in_section = in_text; |
166 | } | |
167 | } | |
168 | ||
79e68feb RS |
169 | /* Tell assembler to switch to data section. */ |
170 | ||
171 | void | |
172 | data_section () | |
173 | { | |
174 | if (in_section != in_data) | |
175 | { | |
ca695ac9 JB |
176 | if (output_bytecode) |
177 | bc_data (); | |
178 | else | |
79e68feb | 179 | { |
ca695ac9 JB |
180 | if (flag_shared_data) |
181 | { | |
79e68feb | 182 | #ifdef SHARED_SECTION_ASM_OP |
ca695ac9 | 183 | fprintf (asm_out_file, "%s\n", SHARED_SECTION_ASM_OP); |
79e68feb | 184 | #else |
ca695ac9 | 185 | fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP); |
79e68feb | 186 | #endif |
ca695ac9 JB |
187 | } |
188 | else | |
189 | fprintf (asm_out_file, "%s\n", DATA_SECTION_ASM_OP); | |
79e68feb | 190 | } |
79e68feb RS |
191 | |
192 | in_section = in_data; | |
193 | } | |
194 | } | |
195 | ||
7c6d68c8 RS |
196 | /* Tell assembler to switch to read-only data section. This is normally |
197 | the text section. */ | |
198 | ||
199 | void | |
200 | readonly_data_section () | |
201 | { | |
202 | #ifdef READONLY_DATA_SECTION | |
203 | READONLY_DATA_SECTION (); /* Note this can call data_section. */ | |
204 | #else | |
205 | text_section (); | |
206 | #endif | |
207 | } | |
208 | ||
79e68feb RS |
209 | /* Determine if we're in the text section. */ |
210 | ||
211 | int | |
212 | in_text_section () | |
213 | { | |
214 | return in_section == in_text; | |
215 | } | |
8a425a05 | 216 | |
2ffe831c DE |
217 | /* Tell assembler to change to section NAME for DECL. |
218 | If DECL is NULL, just switch to section NAME. | |
219 | If NAME is NULL, get the name from DECL. */ | |
8a425a05 DE |
220 | |
221 | void | |
2ffe831c DE |
222 | named_section (decl, name) |
223 | tree decl; | |
8a425a05 DE |
224 | char *name; |
225 | { | |
2ffe831c DE |
226 | if (decl != NULL_TREE |
227 | && (TREE_CODE (decl) != FUNCTION_DECL && TREE_CODE (decl) != VAR_DECL)) | |
228 | abort (); | |
229 | if (name == NULL) | |
230 | name = TREE_STRING_POINTER (DECL_SECTION_NAME (decl)); | |
231 | ||
8a425a05 DE |
232 | if (in_section != in_named || strcmp (name, in_named_name)) |
233 | { | |
234 | in_named_name = name; | |
235 | in_section = in_named; | |
236 | ||
237 | #ifdef ASM_OUTPUT_SECTION_NAME | |
2ffe831c | 238 | ASM_OUTPUT_SECTION_NAME (asm_out_file, decl, name); |
8a425a05 DE |
239 | #else |
240 | /* Section attributes are not supported if this macro isn't provided - | |
241 | some host formats don't support them at all. The front-end should | |
242 | already have flagged this as an error. */ | |
243 | abort (); | |
244 | #endif | |
245 | } | |
246 | } | |
4d1065ed DE |
247 | |
248 | /* Switch to the section for function DECL. | |
249 | ||
250 | If DECL is NULL_TREE, switch to the text section. | |
251 | ??? It's not clear that we will ever be passed NULL_TREE, but it's | |
252 | safer to handle it. */ | |
253 | ||
254 | void | |
255 | function_section (decl) | |
256 | tree decl; | |
257 | { | |
258 | if (decl != NULL_TREE | |
259 | && DECL_SECTION_NAME (decl) != NULL_TREE) | |
260 | named_section (decl, (char *) 0); | |
261 | else | |
262 | text_section (); | |
263 | } | |
79e68feb RS |
264 | \f |
265 | /* Create the rtl to represent a function, for a function definition. | |
266 | DECL is a FUNCTION_DECL node which describes which function. | |
267 | The rtl is stored into DECL. */ | |
268 | ||
269 | void | |
270 | make_function_rtl (decl) | |
271 | tree decl; | |
272 | { | |
273 | char *name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); | |
274 | ||
ca695ac9 JB |
275 | if (output_bytecode) |
276 | { | |
277 | if (DECL_RTL (decl) == 0) | |
278 | DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0); | |
279 | ||
280 | /* Record that at least one function has been defined. */ | |
281 | function_defined = 1; | |
282 | return; | |
283 | } | |
284 | ||
79e68feb RS |
285 | /* Rename a nested function to avoid conflicts. */ |
286 | if (decl_function_context (decl) != 0 | |
287 | && DECL_INITIAL (decl) != 0 | |
288 | && DECL_RTL (decl) == 0) | |
289 | { | |
290 | char *label; | |
291 | ||
292 | name = IDENTIFIER_POINTER (DECL_NAME (decl)); | |
293 | ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno); | |
294 | name = obstack_copy0 (saveable_obstack, label, strlen (label)); | |
295 | var_labelno++; | |
296 | } | |
297 | ||
298 | if (DECL_RTL (decl) == 0) | |
299 | { | |
300 | DECL_RTL (decl) | |
301 | = gen_rtx (MEM, DECL_MODE (decl), | |
302 | gen_rtx (SYMBOL_REF, Pmode, name)); | |
303 | ||
304 | /* Optionally set flags or add text to the name to record information | |
305 | such as that it is a function name. If the name is changed, the macro | |
8a425a05 | 306 | ASM_OUTPUT_LABELREF will have to know how to strip this information. */ |
79e68feb RS |
307 | #ifdef ENCODE_SECTION_INFO |
308 | ENCODE_SECTION_INFO (decl); | |
309 | #endif | |
310 | } | |
311 | ||
312 | /* Record at least one function has been defined. */ | |
313 | function_defined = 1; | |
314 | } | |
315 | ||
ca695ac9 JB |
316 | /* Create the DECL_RTL for a declaration for a static or external |
317 | variable or static or external function. | |
318 | ASMSPEC, if not 0, is the string which the user specified | |
319 | as the assembler symbol name. | |
320 | TOP_LEVEL is nonzero if this is a file-scope variable. | |
321 | This is never called for PARM_DECLs. */ | |
5a13eaa4 RK |
322 | |
323 | static void | |
ca695ac9 JB |
324 | bc_make_decl_rtl (decl, asmspec, top_level) |
325 | tree decl; | |
326 | char *asmspec; | |
327 | int top_level; | |
328 | { | |
329 | register char *name = TREE_STRING_POINTER (DECL_ASSEMBLER_NAME (decl)); | |
330 | ||
331 | if (DECL_RTL (decl) == 0) | |
332 | { | |
333 | /* Print an error message for register variables. */ | |
334 | if (DECL_REGISTER (decl) && TREE_CODE (decl) == FUNCTION_DECL) | |
335 | error ("function declared `register'"); | |
336 | else if (DECL_REGISTER (decl)) | |
337 | error ("global register variables not supported in the interpreter"); | |
338 | ||
339 | /* Handle ordinary static variables and functions. */ | |
340 | if (DECL_RTL (decl) == 0) | |
341 | { | |
342 | /* Can't use just the variable's own name for a variable | |
343 | whose scope is less than the whole file. | |
344 | Concatenate a distinguishing number. */ | |
345 | if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0) | |
346 | { | |
347 | char *label; | |
348 | ||
349 | ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno); | |
350 | name = obstack_copy0 (saveable_obstack, label, strlen (label)); | |
351 | var_labelno++; | |
352 | } | |
353 | ||
354 | DECL_RTL (decl) = bc_gen_rtx (name, 0, (struct bc_label *) 0); | |
355 | } | |
356 | } | |
357 | } | |
358 | ||
b4ac57ab RS |
359 | /* Given NAME, a putative register name, discard any customary prefixes. */ |
360 | ||
361 | static char * | |
362 | strip_reg_name (name) | |
363 | char *name; | |
364 | { | |
365 | #ifdef REGISTER_PREFIX | |
366 | if (!strncmp (name, REGISTER_PREFIX, strlen (REGISTER_PREFIX))) | |
367 | name += strlen (REGISTER_PREFIX); | |
368 | #endif | |
369 | if (name[0] == '%' || name[0] == '#') | |
370 | name++; | |
371 | return name; | |
372 | } | |
dcfedcd0 | 373 | \f |
79e68feb RS |
374 | /* Decode an `asm' spec for a declaration as a register name. |
375 | Return the register number, or -1 if nothing specified, | |
c09e6498 RS |
376 | or -2 if the ASMSPEC is not `cc' or `memory' and is not recognized, |
377 | or -3 if ASMSPEC is `cc' and is not recognized, | |
378 | or -4 if ASMSPEC is `memory' and is not recognized. | |
dcfedcd0 RK |
379 | Accept an exact spelling or a decimal number. |
380 | Prefixes such as % are optional. */ | |
79e68feb RS |
381 | |
382 | int | |
383 | decode_reg_name (asmspec) | |
384 | char *asmspec; | |
385 | { | |
386 | if (asmspec != 0) | |
387 | { | |
388 | int i; | |
389 | ||
b4ac57ab RS |
390 | /* Get rid of confusing prefixes. */ |
391 | asmspec = strip_reg_name (asmspec); | |
392 | ||
fff9e713 MT |
393 | /* Allow a decimal number as a "register name". */ |
394 | for (i = strlen (asmspec) - 1; i >= 0; i--) | |
395 | if (! (asmspec[i] >= '0' && asmspec[i] <= '9')) | |
396 | break; | |
397 | if (asmspec[0] != 0 && i < 0) | |
398 | { | |
399 | i = atoi (asmspec); | |
400 | if (i < FIRST_PSEUDO_REGISTER && i >= 0) | |
401 | return i; | |
402 | else | |
403 | return -2; | |
404 | } | |
405 | ||
79e68feb | 406 | for (i = 0; i < FIRST_PSEUDO_REGISTER; i++) |
b4ac57ab RS |
407 | if (reg_names[i][0] |
408 | && ! strcmp (asmspec, strip_reg_name (reg_names[i]))) | |
79e68feb RS |
409 | return i; |
410 | ||
79e68feb RS |
411 | #ifdef ADDITIONAL_REGISTER_NAMES |
412 | { | |
413 | static struct { char *name; int number; } table[] | |
414 | = ADDITIONAL_REGISTER_NAMES; | |
415 | ||
416 | for (i = 0; i < sizeof (table) / sizeof (table[0]); i++) | |
417 | if (! strcmp (asmspec, table[i].name)) | |
418 | return table[i].number; | |
79e68feb RS |
419 | } |
420 | #endif /* ADDITIONAL_REGISTER_NAMES */ | |
421 | ||
c09e6498 RS |
422 | if (!strcmp (asmspec, "memory")) |
423 | return -4; | |
424 | ||
dcfedcd0 RK |
425 | if (!strcmp (asmspec, "cc")) |
426 | return -3; | |
427 | ||
79e68feb RS |
428 | return -2; |
429 | } | |
430 | ||
431 | return -1; | |
432 | } | |
433 | \f | |
434 | /* Create the DECL_RTL for a declaration for a static or external variable | |
435 | or static or external function. | |
436 | ASMSPEC, if not 0, is the string which the user specified | |
437 | as the assembler symbol name. | |
438 | TOP_LEVEL is nonzero if this is a file-scope variable. | |
439 | ||
440 | This is never called for PARM_DECL nodes. */ | |
441 | ||
442 | void | |
443 | make_decl_rtl (decl, asmspec, top_level) | |
444 | tree decl; | |
445 | char *asmspec; | |
446 | int top_level; | |
447 | { | |
0a5152d0 | 448 | register char *name = 0; |
ca695ac9 JB |
449 | int reg_number; |
450 | ||
451 | if (output_bytecode) | |
452 | { | |
453 | bc_make_decl_rtl (decl, asmspec, top_level); | |
454 | return; | |
455 | } | |
456 | ||
457 | reg_number = decode_reg_name (asmspec); | |
79e68feb RS |
458 | |
459 | if (DECL_ASSEMBLER_NAME (decl) != NULL_TREE) | |
460 | name = IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl)); | |
461 | ||
462 | if (reg_number == -2) | |
463 | { | |
464 | /* ASMSPEC is given, and not the name of a register. */ | |
465 | name = (char *) obstack_alloc (saveable_obstack, | |
466 | strlen (asmspec) + 2); | |
467 | name[0] = '*'; | |
468 | strcpy (&name[1], asmspec); | |
469 | } | |
470 | ||
471 | /* For a duplicate declaration, we can be called twice on the | |
ff8f4401 RS |
472 | same DECL node. Don't discard the RTL already made. */ |
473 | if (DECL_RTL (decl) == 0) | |
79e68feb RS |
474 | { |
475 | DECL_RTL (decl) = 0; | |
476 | ||
477 | /* First detect errors in declaring global registers. */ | |
44fe2e80 | 478 | if (DECL_REGISTER (decl) && reg_number == -1) |
79e68feb RS |
479 | error_with_decl (decl, |
480 | "register name not specified for `%s'"); | |
44fe2e80 | 481 | else if (DECL_REGISTER (decl) && reg_number < 0) |
79e68feb RS |
482 | error_with_decl (decl, |
483 | "invalid register name for `%s'"); | |
44fe2e80 | 484 | else if ((reg_number >= 0 || reg_number == -3) && ! DECL_REGISTER (decl)) |
79e68feb RS |
485 | error_with_decl (decl, |
486 | "register name given for non-register variable `%s'"); | |
44fe2e80 | 487 | else if (DECL_REGISTER (decl) && TREE_CODE (decl) == FUNCTION_DECL) |
79e68feb | 488 | error ("function declared `register'"); |
44fe2e80 | 489 | else if (DECL_REGISTER (decl) && TYPE_MODE (TREE_TYPE (decl)) == BLKmode) |
79e68feb | 490 | error_with_decl (decl, "data type of `%s' isn't suitable for a register"); |
ce2fb245 RS |
491 | else if (DECL_REGISTER (decl) |
492 | && ! HARD_REGNO_MODE_OK (reg_number, TYPE_MODE (TREE_TYPE (decl)))) | |
493 | error_with_decl (decl, "register number for `%s' isn't suitable for the data type"); | |
79e68feb | 494 | /* Now handle properly declared static register variables. */ |
44fe2e80 | 495 | else if (DECL_REGISTER (decl)) |
79e68feb RS |
496 | { |
497 | int nregs; | |
498 | #if 0 /* yylex should print the warning for this */ | |
499 | if (pedantic) | |
500 | pedwarn ("ANSI C forbids global register variables"); | |
501 | #endif | |
502 | if (DECL_INITIAL (decl) != 0 && top_level) | |
503 | { | |
504 | DECL_INITIAL (decl) = 0; | |
505 | error ("global register variable has initial value"); | |
506 | } | |
507 | if (fixed_regs[reg_number] == 0 | |
508 | && function_defined && top_level) | |
509 | error ("global register variable follows a function definition"); | |
510 | if (TREE_THIS_VOLATILE (decl)) | |
511 | warning ("volatile register variables don't work as you might wish"); | |
31e4b1c0 RK |
512 | |
513 | /* If the user specified one of the eliminables registers here, | |
514 | e.g., FRAME_POINTER_REGNUM, we don't want to get this variable | |
515 | confused with that register and be eliminated. Although this | |
516 | usage is somewhat suspect, we nevertheless use the following | |
517 | kludge to avoid setting DECL_RTL to frame_pointer_rtx. */ | |
518 | ||
519 | DECL_RTL (decl) | |
520 | = gen_rtx (REG, DECL_MODE (decl), FIRST_PSEUDO_REGISTER); | |
521 | REGNO (DECL_RTL (decl)) = reg_number; | |
79e68feb RS |
522 | REG_USERVAR_P (DECL_RTL (decl)) = 1; |
523 | ||
524 | if (top_level) | |
525 | { | |
ad800eb1 RK |
526 | /* Make this register global, so not usable for anything |
527 | else. */ | |
79e68feb RS |
528 | nregs = HARD_REGNO_NREGS (reg_number, DECL_MODE (decl)); |
529 | while (nregs > 0) | |
ad800eb1 | 530 | globalize_reg (reg_number + --nregs); |
79e68feb RS |
531 | } |
532 | } | |
8a425a05 DE |
533 | /* Specifying a section attribute on an uninitialized variable does not |
534 | (and cannot) cause it to be put in the given section. The linker | |
535 | can only put initialized objects in specific sections, everything | |
536 | else goes in bss for the linker to sort out later (otherwise the | |
537 | linker would give a duplicate definition error for each compilation | |
538 | unit that behaved thusly). So warn the user. */ | |
539 | else if (TREE_CODE (decl) == VAR_DECL | |
540 | && DECL_SECTION_NAME (decl) != NULL_TREE | |
541 | && DECL_INITIAL (decl) == NULL_TREE) | |
542 | { | |
543 | warning_with_decl (decl, | |
544 | "section attribute ignored for uninitialized variable `%s'"); | |
b3de8b75 DE |
545 | /* Remove the section name so subsequent declarations won't see it. |
546 | We are ignoring it, remember. */ | |
547 | DECL_SECTION_NAME (decl) = NULL_TREE; | |
8a425a05 | 548 | } |
79e68feb RS |
549 | |
550 | /* Now handle ordinary static variables and functions (in memory). | |
551 | Also handle vars declared register invalidly. */ | |
552 | if (DECL_RTL (decl) == 0) | |
553 | { | |
554 | /* Can't use just the variable's own name for a variable | |
555 | whose scope is less than the whole file. | |
556 | Concatenate a distinguishing number. */ | |
44fe2e80 | 557 | if (!top_level && !DECL_EXTERNAL (decl) && asmspec == 0) |
79e68feb RS |
558 | { |
559 | char *label; | |
560 | ||
561 | ASM_FORMAT_PRIVATE_NAME (label, name, var_labelno); | |
562 | name = obstack_copy0 (saveable_obstack, label, strlen (label)); | |
563 | var_labelno++; | |
564 | } | |
565 | ||
0a5152d0 RK |
566 | if (name == 0) |
567 | abort (); | |
568 | ||
79e68feb RS |
569 | DECL_RTL (decl) = gen_rtx (MEM, DECL_MODE (decl), |
570 | gen_rtx (SYMBOL_REF, Pmode, name)); | |
3771b9b2 RK |
571 | |
572 | /* If this variable is to be treated as volatile, show its | |
573 | tree node has side effects. If it has side effects, either | |
574 | because of this test or from TREE_THIS_VOLATILE also | |
575 | being set, show the MEM is volatile. */ | |
576 | if (flag_volatile_global && TREE_CODE (decl) == VAR_DECL | |
577 | && TREE_PUBLIC (decl)) | |
578 | TREE_SIDE_EFFECTS (decl) = 1; | |
579 | if (TREE_SIDE_EFFECTS (decl)) | |
79e68feb | 580 | MEM_VOLATILE_P (DECL_RTL (decl)) = 1; |
3771b9b2 | 581 | |
79e68feb RS |
582 | if (TREE_READONLY (decl)) |
583 | RTX_UNCHANGING_P (DECL_RTL (decl)) = 1; | |
584 | MEM_IN_STRUCT_P (DECL_RTL (decl)) | |
05e3bdb9 | 585 | = AGGREGATE_TYPE_P (TREE_TYPE (decl)); |
79e68feb RS |
586 | |
587 | /* Optionally set flags or add text to the name to record information | |
588 | such as that it is a function name. | |
589 | If the name is changed, the macro ASM_OUTPUT_LABELREF | |
8a425a05 | 590 | will have to know how to strip this information. */ |
79e68feb RS |
591 | #ifdef ENCODE_SECTION_INFO |
592 | ENCODE_SECTION_INFO (decl); | |
593 | #endif | |
594 | } | |
595 | } | |
ff8f4401 RS |
596 | /* If the old RTL had the wrong mode, fix the mode. */ |
597 | else if (GET_MODE (DECL_RTL (decl)) != DECL_MODE (decl)) | |
598 | { | |
599 | rtx rtl = DECL_RTL (decl); | |
600 | PUT_MODE (rtl, DECL_MODE (decl)); | |
601 | } | |
79e68feb | 602 | } |
4724d87a RS |
603 | |
604 | /* Make the rtl for variable VAR be volatile. | |
605 | Use this only for static variables. */ | |
606 | ||
fcbaecc6 | 607 | void |
4724d87a RS |
608 | make_var_volatile (var) |
609 | tree var; | |
610 | { | |
611 | if (GET_CODE (DECL_RTL (var)) != MEM) | |
612 | abort (); | |
613 | ||
614 | MEM_VOLATILE_P (DECL_RTL (var)) = 1; | |
615 | } | |
79e68feb | 616 | \f |
d447ec6f RS |
617 | /* Output alignment directive to align for constant expression EXP. */ |
618 | ||
619 | void | |
620 | assemble_constant_align (exp) | |
621 | tree exp; | |
622 | { | |
623 | int align; | |
624 | ||
625 | /* Align the location counter as required by EXP's data type. */ | |
626 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
627 | #ifdef CONSTANT_ALIGNMENT | |
628 | align = CONSTANT_ALIGNMENT (exp, align); | |
629 | #endif | |
630 | ||
631 | if (align > BITS_PER_UNIT) | |
632 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
633 | } | |
634 | ||
79e68feb RS |
635 | /* Output a string of literal assembler code |
636 | for an `asm' keyword used between functions. */ | |
637 | ||
638 | void | |
639 | assemble_asm (string) | |
640 | tree string; | |
641 | { | |
ca695ac9 JB |
642 | if (output_bytecode) |
643 | { | |
644 | error ("asm statements not allowed in interpreter"); | |
645 | return; | |
646 | } | |
647 | ||
79e68feb RS |
648 | app_enable (); |
649 | ||
650 | if (TREE_CODE (string) == ADDR_EXPR) | |
651 | string = TREE_OPERAND (string, 0); | |
652 | ||
653 | fprintf (asm_out_file, "\t%s\n", TREE_STRING_POINTER (string)); | |
654 | } | |
655 | ||
9bb2e4fe RS |
656 | #if 0 /* This should no longer be needed, because |
657 | flag_gnu_linker should be 0 on these systems, | |
658 | which should prevent any output | |
659 | if ASM_OUTPUT_CONSTRUCTOR and ASM_OUTPUT_DESTRUCTOR are absent. */ | |
79e68feb RS |
660 | #if !(defined(DBX_DEBUGGING_INFO) && !defined(FASCIST_ASSEMBLER)) |
661 | #ifndef ASM_OUTPUT_CONSTRUCTOR | |
662 | #define ASM_OUTPUT_CONSTRUCTOR(file, name) | |
663 | #endif | |
664 | #ifndef ASM_OUTPUT_DESTRUCTOR | |
665 | #define ASM_OUTPUT_DESTRUCTOR(file, name) | |
666 | #endif | |
667 | #endif | |
9bb2e4fe | 668 | #endif /* 0 */ |
79e68feb RS |
669 | |
670 | /* Record an element in the table of global destructors. | |
671 | How this is done depends on what sort of assembler and linker | |
672 | are in use. | |
673 | ||
674 | NAME should be the name of a global function to be called | |
675 | at exit time. This name is output using assemble_name. */ | |
676 | ||
677 | void | |
678 | assemble_destructor (name) | |
679 | char *name; | |
680 | { | |
681 | #ifdef ASM_OUTPUT_DESTRUCTOR | |
682 | ASM_OUTPUT_DESTRUCTOR (asm_out_file, name); | |
683 | #else | |
684 | if (flag_gnu_linker) | |
685 | { | |
686 | /* Now tell GNU LD that this is part of the static destructor set. */ | |
687 | /* This code works for any machine provided you use GNU as/ld. */ | |
688 | fprintf (asm_out_file, "%s \"___DTOR_LIST__\",22,0,0,", ASM_STABS_OP); | |
689 | assemble_name (asm_out_file, name); | |
690 | fputc ('\n', asm_out_file); | |
691 | } | |
692 | #endif | |
693 | } | |
694 | ||
695 | /* Likewise for global constructors. */ | |
696 | ||
697 | void | |
698 | assemble_constructor (name) | |
699 | char *name; | |
700 | { | |
701 | #ifdef ASM_OUTPUT_CONSTRUCTOR | |
702 | ASM_OUTPUT_CONSTRUCTOR (asm_out_file, name); | |
703 | #else | |
704 | if (flag_gnu_linker) | |
705 | { | |
706 | /* Now tell GNU LD that this is part of the static constructor set. */ | |
707 | /* This code works for any machine provided you use GNU as/ld. */ | |
708 | fprintf (asm_out_file, "%s \"___CTOR_LIST__\",22,0,0,", ASM_STABS_OP); | |
709 | assemble_name (asm_out_file, name); | |
710 | fputc ('\n', asm_out_file); | |
711 | } | |
712 | #endif | |
713 | } | |
714 | ||
715 | /* Likewise for entries we want to record for garbage collection. | |
716 | Garbage collection is still under development. */ | |
717 | ||
718 | void | |
719 | assemble_gc_entry (name) | |
720 | char *name; | |
721 | { | |
722 | #ifdef ASM_OUTPUT_GC_ENTRY | |
723 | ASM_OUTPUT_GC_ENTRY (asm_out_file, name); | |
724 | #else | |
725 | if (flag_gnu_linker) | |
726 | { | |
727 | /* Now tell GNU LD that this is part of the static constructor set. */ | |
728 | fprintf (asm_out_file, "%s \"___PTR_LIST__\",22,0,0,", ASM_STABS_OP); | |
729 | assemble_name (asm_out_file, name); | |
730 | fputc ('\n', asm_out_file); | |
731 | } | |
732 | #endif | |
733 | } | |
734 | \f | |
735 | /* Output assembler code for the constant pool of a function and associated | |
736 | with defining the name of the function. DECL describes the function. | |
737 | NAME is the function's name. For the constant pool, we use the current | |
738 | constant pool data. */ | |
739 | ||
740 | void | |
741 | assemble_start_function (decl, fnname) | |
742 | tree decl; | |
743 | char *fnname; | |
744 | { | |
745 | int align; | |
746 | ||
747 | /* The following code does not need preprocessing in the assembler. */ | |
748 | ||
749 | app_disable (); | |
750 | ||
751 | output_constant_pool (fnname, decl); | |
752 | ||
4d1065ed | 753 | function_section (decl); |
79e68feb RS |
754 | |
755 | /* Tell assembler to move to target machine's alignment for functions. */ | |
756 | align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
757 | if (align > 0) | |
ca695ac9 JB |
758 | { |
759 | if (output_bytecode) | |
760 | BC_OUTPUT_ALIGN (asm_out_file, align); | |
761 | else | |
762 | ASM_OUTPUT_ALIGN (asm_out_file, align); | |
763 | } | |
79e68feb RS |
764 | |
765 | #ifdef ASM_OUTPUT_FUNCTION_PREFIX | |
766 | ASM_OUTPUT_FUNCTION_PREFIX (asm_out_file, fnname); | |
767 | #endif | |
768 | ||
769 | #ifdef SDB_DEBUGGING_INFO | |
770 | /* Output SDB definition of the function. */ | |
771 | if (write_symbols == SDB_DEBUG) | |
772 | sdbout_mark_begin_function (); | |
773 | #endif | |
774 | ||
775 | #ifdef DBX_DEBUGGING_INFO | |
e5c90c23 | 776 | /* Output DBX definition of the function. */ |
79e68feb | 777 | if (write_symbols == DBX_DEBUG) |
e5c90c23 | 778 | dbxout_begin_function (decl); |
79e68feb RS |
779 | #endif |
780 | ||
781 | /* Make function name accessible from other files, if appropriate. */ | |
782 | ||
783 | if (TREE_PUBLIC (decl)) | |
784 | { | |
785 | if (!first_global_object_name) | |
561e6650 | 786 | STRIP_NAME_ENCODING (first_global_object_name, fnname); |
ca695ac9 JB |
787 | if (output_bytecode) |
788 | BC_GLOBALIZE_LABEL (asm_out_file, fnname); | |
789 | else | |
790 | ASM_GLOBALIZE_LABEL (asm_out_file, fnname); | |
79e68feb RS |
791 | } |
792 | ||
793 | /* Do any machine/system dependent processing of the function name */ | |
794 | #ifdef ASM_DECLARE_FUNCTION_NAME | |
795 | ASM_DECLARE_FUNCTION_NAME (asm_out_file, fnname, current_function_decl); | |
796 | #else | |
797 | /* Standard thing is just output label for the function. */ | |
ca695ac9 JB |
798 | if (output_bytecode) |
799 | BC_OUTPUT_LABEL (asm_out_file, fnname); | |
800 | else | |
801 | ASM_OUTPUT_LABEL (asm_out_file, fnname); | |
79e68feb RS |
802 | #endif /* ASM_DECLARE_FUNCTION_NAME */ |
803 | } | |
804 | ||
805 | /* Output assembler code associated with defining the size of the | |
806 | function. DECL describes the function. NAME is the function's name. */ | |
807 | ||
808 | void | |
809 | assemble_end_function (decl, fnname) | |
810 | tree decl; | |
811 | char *fnname; | |
812 | { | |
813 | #ifdef ASM_DECLARE_FUNCTION_SIZE | |
814 | ASM_DECLARE_FUNCTION_SIZE (asm_out_file, fnname, decl); | |
815 | #endif | |
816 | } | |
817 | \f | |
818 | /* Assemble code to leave SIZE bytes of zeros. */ | |
819 | ||
820 | void | |
821 | assemble_zeros (size) | |
822 | int size; | |
823 | { | |
ca695ac9 JB |
824 | if (output_bytecode) |
825 | { | |
826 | bc_emit_const_skip (size); | |
827 | return; | |
828 | } | |
829 | ||
79e68feb RS |
830 | #ifdef ASM_NO_SKIP_IN_TEXT |
831 | /* The `space' pseudo in the text section outputs nop insns rather than 0s, | |
832 | so we must output 0s explicitly in the text section. */ | |
833 | if (ASM_NO_SKIP_IN_TEXT && in_text_section ()) | |
834 | { | |
835 | int i; | |
836 | ||
837 | for (i = 0; i < size - 20; i += 20) | |
838 | { | |
839 | #ifdef ASM_BYTE_OP | |
840 | fprintf (asm_out_file, | |
841 | "%s 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n", ASM_BYTE_OP); | |
842 | #else | |
843 | fprintf (asm_out_file, | |
844 | "\tbyte 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n"); | |
845 | #endif | |
846 | } | |
847 | if (i < size) | |
848 | { | |
849 | #ifdef ASM_BYTE_OP | |
850 | fprintf (asm_out_file, "%s 0", ASM_BYTE_OP); | |
851 | #else | |
852 | fprintf (asm_out_file, "\tbyte 0"); | |
853 | #endif | |
854 | i++; | |
855 | for (; i < size; i++) | |
856 | fprintf (asm_out_file, ",0"); | |
857 | fprintf (asm_out_file, "\n"); | |
858 | } | |
859 | } | |
860 | else | |
861 | #endif | |
41fe4d9e | 862 | if (size > 0) |
ca695ac9 JB |
863 | { |
864 | if (output_bytecode) | |
865 | BC_OUTPUT_SKIP (asm_out_file, size); | |
866 | else | |
867 | ASM_OUTPUT_SKIP (asm_out_file, size); | |
868 | } | |
79e68feb RS |
869 | } |
870 | ||
a785e67e RS |
871 | /* Assemble an alignment pseudo op for an ALIGN-bit boundary. */ |
872 | ||
873 | void | |
874 | assemble_align (align) | |
875 | int align; | |
876 | { | |
877 | if (align > BITS_PER_UNIT) | |
878 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
879 | } | |
880 | ||
79e68feb RS |
881 | /* Assemble a string constant with the specified C string as contents. */ |
882 | ||
883 | void | |
884 | assemble_string (p, size) | |
fcbaecc6 | 885 | char *p; |
79e68feb RS |
886 | int size; |
887 | { | |
888 | register int i; | |
889 | int pos = 0; | |
890 | int maximum = 2000; | |
891 | ||
ca695ac9 JB |
892 | if (output_bytecode) |
893 | { | |
894 | bc_emit (p, size); | |
895 | return; | |
896 | } | |
897 | ||
79e68feb RS |
898 | /* If the string is very long, split it up. */ |
899 | ||
900 | while (pos < size) | |
901 | { | |
902 | int thissize = size - pos; | |
903 | if (thissize > maximum) | |
904 | thissize = maximum; | |
905 | ||
ca695ac9 | 906 | if (output_bytecode) |
69249c1b | 907 | bc_output_ascii (asm_out_file, p, thissize); |
ca695ac9 | 908 | else |
d5896f20 RS |
909 | { |
910 | ASM_OUTPUT_ASCII (asm_out_file, p, thissize); | |
911 | } | |
79e68feb RS |
912 | |
913 | pos += thissize; | |
914 | p += thissize; | |
915 | } | |
916 | } | |
69249c1b RS |
917 | |
918 | static void | |
919 | bc_output_ascii (file, p, size) | |
920 | FILE *file; | |
921 | char *p; | |
922 | int size; | |
923 | { | |
924 | BC_OUTPUT_ASCII (file, p, size); | |
925 | } | |
79e68feb RS |
926 | \f |
927 | /* Assemble everything that is needed for a variable or function declaration. | |
928 | Not used for automatic variables, and not used for function definitions. | |
929 | Should not be called for variables of incomplete structure type. | |
930 | ||
931 | TOP_LEVEL is nonzero if this variable has file scope. | |
932 | AT_END is nonzero if this is the special handling, at end of compilation, | |
ff8f4401 RS |
933 | to define things that have had only tentative definitions. |
934 | DONT_OUTPUT_DATA if nonzero means don't actually output the | |
935 | initial value (that will be done by the caller). */ | |
79e68feb RS |
936 | |
937 | void | |
ff8f4401 | 938 | assemble_variable (decl, top_level, at_end, dont_output_data) |
79e68feb RS |
939 | tree decl; |
940 | int top_level; | |
941 | int at_end; | |
5a13eaa4 | 942 | int dont_output_data; |
79e68feb RS |
943 | { |
944 | register char *name; | |
945 | int align; | |
946 | tree size_tree; | |
947 | int reloc = 0; | |
edbc355b | 948 | enum in_section saved_in_section; |
79e68feb | 949 | |
cbed4565 RS |
950 | last_assemble_variable_decl = 0; |
951 | ||
ca695ac9 JB |
952 | if (output_bytecode) |
953 | return; | |
954 | ||
79e68feb RS |
955 | if (GET_CODE (DECL_RTL (decl)) == REG) |
956 | { | |
957 | /* Do output symbol info for global register variables, but do nothing | |
958 | else for them. */ | |
959 | ||
960 | if (TREE_ASM_WRITTEN (decl)) | |
961 | return; | |
962 | TREE_ASM_WRITTEN (decl) = 1; | |
963 | ||
ca695ac9 JB |
964 | if (!output_bytecode) |
965 | { | |
b4ac57ab | 966 | #if defined (DBX_DEBUGGING_INFO) || defined (XCOFF_DEBUGGING_INFO) |
ca695ac9 JB |
967 | /* File-scope global variables are output here. */ |
968 | if ((write_symbols == DBX_DEBUG || write_symbols == XCOFF_DEBUG) | |
969 | && top_level) | |
970 | dbxout_symbol (decl, 0); | |
79e68feb RS |
971 | #endif |
972 | #ifdef SDB_DEBUGGING_INFO | |
ca695ac9 JB |
973 | if (write_symbols == SDB_DEBUG && top_level |
974 | /* Leave initialized global vars for end of compilation; | |
975 | see comment in compile_file. */ | |
976 | && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0)) | |
977 | sdbout_symbol (decl, 0); | |
79e68feb | 978 | #endif |
ca695ac9 | 979 | } |
79e68feb RS |
980 | |
981 | /* Don't output any DWARF debugging information for variables here. | |
982 | In the case of local variables, the information for them is output | |
983 | when we do our recursive traversal of the tree representation for | |
984 | the entire containing function. In the case of file-scope variables, | |
985 | we output information for all of them at the very end of compilation | |
986 | while we are doing our final traversal of the chain of file-scope | |
987 | declarations. */ | |
988 | ||
989 | return; | |
990 | } | |
991 | ||
d36d70cc RK |
992 | /* Normally no need to say anything here for external references, |
993 | since assemble_external is called by the langauge-specific code | |
994 | when a declaration is first seen. */ | |
79e68feb | 995 | |
44fe2e80 | 996 | if (DECL_EXTERNAL (decl)) |
79e68feb RS |
997 | return; |
998 | ||
999 | /* Output no assembler code for a function declaration. | |
1000 | Only definitions of functions output anything. */ | |
1001 | ||
1002 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
1003 | return; | |
1004 | ||
1005 | /* If type was incomplete when the variable was declared, | |
1006 | see if it is complete now. */ | |
1007 | ||
1008 | if (DECL_SIZE (decl) == 0) | |
1009 | layout_decl (decl, 0); | |
1010 | ||
1011 | /* Still incomplete => don't allocate it; treat the tentative defn | |
1012 | (which is what it must have been) as an `extern' reference. */ | |
1013 | ||
ff8f4401 | 1014 | if (!dont_output_data && DECL_SIZE (decl) == 0) |
79e68feb RS |
1015 | { |
1016 | error_with_file_and_line (DECL_SOURCE_FILE (decl), | |
1017 | DECL_SOURCE_LINE (decl), | |
ea80ee44 | 1018 | "storage size of `%s' isn't known", |
79e68feb | 1019 | IDENTIFIER_POINTER (DECL_NAME (decl))); |
1c1a7ba4 | 1020 | TREE_ASM_WRITTEN (decl) = 1; |
79e68feb RS |
1021 | return; |
1022 | } | |
1023 | ||
1024 | /* The first declaration of a variable that comes through this function | |
1025 | decides whether it is global (in C, has external linkage) | |
1026 | or local (in C, has internal linkage). So do nothing more | |
1027 | if this function has already run. */ | |
1028 | ||
1029 | if (TREE_ASM_WRITTEN (decl)) | |
1030 | return; | |
1031 | ||
1032 | TREE_ASM_WRITTEN (decl) = 1; | |
1033 | ||
79e68feb RS |
1034 | /* If storage size is erroneously variable, just continue. |
1035 | Error message was already made. */ | |
1036 | ||
ff8f4401 RS |
1037 | if (DECL_SIZE (decl)) |
1038 | { | |
1039 | if (TREE_CODE (DECL_SIZE (decl)) != INTEGER_CST) | |
1040 | goto finish; | |
79e68feb | 1041 | |
ff8f4401 | 1042 | app_disable (); |
79e68feb | 1043 | |
ff8f4401 RS |
1044 | /* This is better than explicit arithmetic, since it avoids overflow. */ |
1045 | size_tree = size_binop (CEIL_DIV_EXPR, | |
1046 | DECL_SIZE (decl), size_int (BITS_PER_UNIT)); | |
79e68feb | 1047 | |
ff8f4401 RS |
1048 | if (TREE_INT_CST_HIGH (size_tree) != 0) |
1049 | { | |
1050 | error_with_decl (decl, "size of variable `%s' is too large"); | |
1051 | goto finish; | |
1052 | } | |
79e68feb RS |
1053 | } |
1054 | ||
1055 | name = XSTR (XEXP (DECL_RTL (decl), 0), 0); | |
1056 | ||
1057 | /* Handle uninitialized definitions. */ | |
1058 | ||
1059 | /* ANSI specifies that a tentative definition which is not merged with | |
1060 | a non-tentative definition behaves exactly like a definition with an | |
1061 | initializer equal to zero. (Section 3.7.2) | |
21432660 JW |
1062 | -fno-common gives strict ANSI behavior. Usually you don't want it. |
1063 | This matters only for variables with external linkage. */ | |
1064 | if ((! flag_no_common || ! TREE_PUBLIC (decl)) | |
2c0d84d6 | 1065 | && DECL_COMMON (decl) |
ff8f4401 | 1066 | && ! dont_output_data |
79e68feb RS |
1067 | && (DECL_INITIAL (decl) == 0 || DECL_INITIAL (decl) == error_mark_node)) |
1068 | { | |
1069 | int size = TREE_INT_CST_LOW (size_tree); | |
1070 | int rounded = size; | |
1071 | ||
1072 | if (TREE_INT_CST_HIGH (size_tree) != 0) | |
1073 | error_with_decl (decl, "size of variable `%s' is too large"); | |
1074 | /* Don't allocate zero bytes of common, | |
1075 | since that means "undefined external" in the linker. */ | |
1076 | if (size == 0) rounded = 1; | |
1077 | /* Round size up to multiple of BIGGEST_ALIGNMENT bits | |
1078 | so that each uninitialized object starts on such a boundary. */ | |
1079 | rounded += (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1; | |
1080 | rounded = (rounded / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
1081 | * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); | |
edbc355b RS |
1082 | |
1083 | #ifdef DBX_DEBUGGING_INFO | |
1084 | /* File-scope global variables are output here. */ | |
1085 | if (write_symbols == DBX_DEBUG && top_level) | |
1086 | dbxout_symbol (decl, 0); | |
1087 | #endif | |
1088 | #ifdef SDB_DEBUGGING_INFO | |
1089 | if (write_symbols == SDB_DEBUG && top_level | |
1090 | /* Leave initialized global vars for end of compilation; | |
1091 | see comment in compile_file. */ | |
1092 | && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0)) | |
1093 | sdbout_symbol (decl, 0); | |
1094 | #endif | |
1095 | ||
1096 | /* Don't output any DWARF debugging information for variables here. | |
1097 | In the case of local variables, the information for them is output | |
1098 | when we do our recursive traversal of the tree representation for | |
1099 | the entire containing function. In the case of file-scope variables, | |
1100 | we output information for all of them at the very end of compilation | |
1101 | while we are doing our final traversal of the chain of file-scope | |
1102 | declarations. */ | |
1103 | ||
79e68feb RS |
1104 | #if 0 |
1105 | if (flag_shared_data) | |
1106 | data_section (); | |
1107 | #endif | |
1108 | if (TREE_PUBLIC (decl)) | |
1109 | { | |
1110 | #ifdef ASM_OUTPUT_SHARED_COMMON | |
1111 | if (flag_shared_data) | |
1112 | ASM_OUTPUT_SHARED_COMMON (asm_out_file, name, size, rounded); | |
1113 | else | |
1114 | #endif | |
ca695ac9 | 1115 | if (output_bytecode) |
69249c1b RS |
1116 | { |
1117 | BC_OUTPUT_COMMON (asm_out_file, name, size, rounded); | |
1118 | } | |
ca695ac9 JB |
1119 | else |
1120 | { | |
79e68feb | 1121 | #ifdef ASM_OUTPUT_ALIGNED_COMMON |
ca695ac9 JB |
1122 | ASM_OUTPUT_ALIGNED_COMMON (asm_out_file, name, size, |
1123 | DECL_ALIGN (decl)); | |
79e68feb | 1124 | #else |
ca695ac9 | 1125 | ASM_OUTPUT_COMMON (asm_out_file, name, size, rounded); |
79e68feb | 1126 | #endif |
ca695ac9 | 1127 | } |
79e68feb RS |
1128 | } |
1129 | else | |
1130 | { | |
1131 | #ifdef ASM_OUTPUT_SHARED_LOCAL | |
1132 | if (flag_shared_data) | |
1133 | ASM_OUTPUT_SHARED_LOCAL (asm_out_file, name, size, rounded); | |
1134 | else | |
1135 | #endif | |
ca695ac9 | 1136 | if (output_bytecode) |
69249c1b RS |
1137 | { |
1138 | BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded); | |
1139 | } | |
ca695ac9 JB |
1140 | else |
1141 | { | |
79e68feb | 1142 | #ifdef ASM_OUTPUT_ALIGNED_LOCAL |
ca695ac9 JB |
1143 | ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, |
1144 | DECL_ALIGN (decl)); | |
79e68feb | 1145 | #else |
ca695ac9 | 1146 | ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded); |
79e68feb | 1147 | #endif |
ca695ac9 | 1148 | } |
79e68feb | 1149 | } |
b4ac57ab | 1150 | goto finish; |
79e68feb RS |
1151 | } |
1152 | ||
1153 | /* Handle initialized definitions. */ | |
1154 | ||
1155 | /* First make the assembler name(s) global if appropriate. */ | |
1156 | if (TREE_PUBLIC (decl) && DECL_NAME (decl)) | |
1157 | { | |
1158 | if (!first_global_object_name) | |
561e6650 | 1159 | STRIP_NAME_ENCODING(first_global_object_name, name); |
79e68feb RS |
1160 | ASM_GLOBALIZE_LABEL (asm_out_file, name); |
1161 | } | |
1162 | #if 0 | |
1163 | for (d = equivalents; d; d = TREE_CHAIN (d)) | |
1164 | { | |
1165 | tree e = TREE_VALUE (d); | |
1166 | if (TREE_PUBLIC (e) && DECL_NAME (e)) | |
1167 | ASM_GLOBALIZE_LABEL (asm_out_file, | |
1168 | XSTR (XEXP (DECL_RTL (e), 0), 0)); | |
1169 | } | |
1170 | #endif | |
1171 | ||
1172 | /* Output any data that we will need to use the address of. */ | |
2e9effae RS |
1173 | if (DECL_INITIAL (decl) == error_mark_node) |
1174 | reloc = contains_pointers_p (TREE_TYPE (decl)); | |
1175 | else if (DECL_INITIAL (decl)) | |
79e68feb RS |
1176 | reloc = output_addressed_constants (DECL_INITIAL (decl)); |
1177 | ||
1178 | /* Switch to the proper section for this data. */ | |
8a425a05 | 1179 | if (IN_NAMED_SECTION (decl)) |
2ffe831c | 1180 | named_section (decl, NULL); |
8a425a05 DE |
1181 | else |
1182 | { | |
07aeab22 JW |
1183 | /* C++ can have const variables that get initialized from constructors, |
1184 | and thus can not be in a readonly section. We prevent this by | |
1185 | verifying that the initial value is constant for objects put in a | |
1186 | readonly section. | |
1187 | ||
1188 | error_mark_node is used by the C front end to indicate that the | |
1189 | initializer has not been seen yet. In this case, we assume that | |
1190 | the initializer must be constant. */ | |
79e68feb | 1191 | #ifdef SELECT_SECTION |
8a425a05 | 1192 | SELECT_SECTION (decl, reloc); |
79e68feb | 1193 | #else |
8a425a05 DE |
1194 | if (TREE_READONLY (decl) |
1195 | && ! TREE_THIS_VOLATILE (decl) | |
07aeab22 JW |
1196 | && DECL_INITIAL (decl) |
1197 | && (DECL_INITIAL (decl) == error_mark_node | |
1198 | || TREE_CONSTANT (DECL_INITIAL (decl))) | |
8a425a05 DE |
1199 | && ! (flag_pic && reloc)) |
1200 | readonly_data_section (); | |
1201 | else | |
1202 | data_section (); | |
79e68feb | 1203 | #endif |
8a425a05 | 1204 | } |
79e68feb | 1205 | |
a8e2f179 RS |
1206 | /* dbxout.c needs to know this. */ |
1207 | if (in_text_section ()) | |
1208 | DECL_IN_TEXT_SECTION (decl) = 1; | |
1209 | ||
edbc355b RS |
1210 | /* Record current section so we can restore it if dbxout.c clobbers it. */ |
1211 | saved_in_section = in_section; | |
1212 | ||
1213 | /* Output the dbx info now that we have chosen the section. */ | |
1214 | ||
1215 | #ifdef DBX_DEBUGGING_INFO | |
1216 | /* File-scope global variables are output here. */ | |
1217 | if (write_symbols == DBX_DEBUG && top_level) | |
1218 | dbxout_symbol (decl, 0); | |
1219 | #endif | |
1220 | #ifdef SDB_DEBUGGING_INFO | |
1221 | if (write_symbols == SDB_DEBUG && top_level | |
1222 | /* Leave initialized global vars for end of compilation; | |
1223 | see comment in compile_file. */ | |
1224 | && (TREE_PUBLIC (decl) == 0 || DECL_INITIAL (decl) == 0)) | |
1225 | sdbout_symbol (decl, 0); | |
1226 | #endif | |
1227 | ||
1228 | /* Don't output any DWARF debugging information for variables here. | |
1229 | In the case of local variables, the information for them is output | |
1230 | when we do our recursive traversal of the tree representation for | |
1231 | the entire containing function. In the case of file-scope variables, | |
1232 | we output information for all of them at the very end of compilation | |
1233 | while we are doing our final traversal of the chain of file-scope | |
1234 | declarations. */ | |
1235 | ||
a8e2f179 RS |
1236 | /* If the debugging output changed sections, reselect the section |
1237 | that's supposed to be selected. */ | |
edbc355b RS |
1238 | if (in_section != saved_in_section) |
1239 | { | |
1240 | /* Switch to the proper section for this data. */ | |
1241 | #ifdef SELECT_SECTION | |
1242 | SELECT_SECTION (decl, reloc); | |
1243 | #else | |
1244 | if (TREE_READONLY (decl) | |
1245 | && ! TREE_THIS_VOLATILE (decl) | |
07aeab22 JW |
1246 | && DECL_INITIAL (decl) |
1247 | && (DECL_INITIAL (decl) == error_mark_node | |
1248 | || TREE_CONSTANT (DECL_INITIAL (decl))) | |
edbc355b RS |
1249 | && ! (flag_pic && reloc)) |
1250 | readonly_data_section (); | |
1251 | else | |
1252 | data_section (); | |
1253 | #endif | |
1254 | } | |
1255 | ||
79e68feb RS |
1256 | /* Compute and output the alignment of this data. */ |
1257 | ||
1258 | align = DECL_ALIGN (decl); | |
a785e67e RS |
1259 | /* In the case for initialing an array whose length isn't specified, |
1260 | where we have not yet been able to do the layout, | |
1261 | figure out the proper alignment now. */ | |
1262 | if (dont_output_data && DECL_SIZE (decl) == 0 | |
1263 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
1264 | align = MAX (align, TYPE_ALIGN (TREE_TYPE (TREE_TYPE (decl)))); | |
1265 | ||
79e68feb RS |
1266 | /* Some object file formats have a maximum alignment which they support. |
1267 | In particular, a.out format supports a maximum alignment of 4. */ | |
1268 | #ifndef MAX_OFILE_ALIGNMENT | |
1269 | #define MAX_OFILE_ALIGNMENT BIGGEST_ALIGNMENT | |
1270 | #endif | |
1271 | if (align > MAX_OFILE_ALIGNMENT) | |
1272 | { | |
1273 | warning_with_decl (decl, | |
1274 | "alignment of `%s' is greater than maximum object file alignment"); | |
1275 | align = MAX_OFILE_ALIGNMENT; | |
1276 | } | |
1277 | #ifdef DATA_ALIGNMENT | |
1278 | /* On some machines, it is good to increase alignment sometimes. */ | |
1279 | align = DATA_ALIGNMENT (TREE_TYPE (decl), align); | |
1280 | #endif | |
1281 | #ifdef CONSTANT_ALIGNMENT | |
1282 | if (DECL_INITIAL (decl)) | |
1283 | align = CONSTANT_ALIGNMENT (DECL_INITIAL (decl), align); | |
1284 | #endif | |
1285 | ||
1286 | /* Reset the alignment in case we have made it tighter, so we can benefit | |
1287 | from it in get_pointer_alignment. */ | |
1288 | DECL_ALIGN (decl) = align; | |
1289 | ||
1290 | if (align > BITS_PER_UNIT) | |
ca695ac9 JB |
1291 | { |
1292 | if (output_bytecode) | |
1293 | BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
1294 | else | |
1295 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
1296 | } | |
79e68feb RS |
1297 | |
1298 | /* Do any machine/system dependent processing of the object. */ | |
1299 | #ifdef ASM_DECLARE_OBJECT_NAME | |
cbed4565 | 1300 | last_assemble_variable_decl = decl; |
79e68feb RS |
1301 | ASM_DECLARE_OBJECT_NAME (asm_out_file, name, decl); |
1302 | #else | |
1303 | /* Standard thing is just output label for the object. */ | |
ca695ac9 JB |
1304 | if (output_bytecode) |
1305 | BC_OUTPUT_LABEL (asm_out_file, name); | |
1306 | else | |
1307 | ASM_OUTPUT_LABEL (asm_out_file, name); | |
79e68feb RS |
1308 | #endif /* ASM_DECLARE_OBJECT_NAME */ |
1309 | ||
ff8f4401 | 1310 | if (!dont_output_data) |
79e68feb | 1311 | { |
ff8f4401 RS |
1312 | if (DECL_INITIAL (decl)) |
1313 | /* Output the actual data. */ | |
1314 | output_constant (DECL_INITIAL (decl), | |
1315 | int_size_in_bytes (TREE_TYPE (decl))); | |
1316 | else | |
1317 | /* Leave space for it. */ | |
1318 | assemble_zeros (int_size_in_bytes (TREE_TYPE (decl))); | |
79e68feb | 1319 | } |
b4ac57ab RS |
1320 | |
1321 | finish: | |
1322 | #ifdef XCOFF_DEBUGGING_INFO | |
1323 | /* Unfortunately, the IBM assembler cannot handle stabx before the actual | |
1324 | declaration. When something like ".stabx "aa:S-2",aa,133,0" is emitted | |
1325 | and `aa' hasn't been output yet, the assembler generates a stab entry with | |
1326 | a value of zero, in addition to creating an unnecessary external entry | |
6dc42e49 | 1327 | for `aa'. Hence, we must postpone dbxout_symbol to here at the end. */ |
b4ac57ab RS |
1328 | |
1329 | /* File-scope global variables are output here. */ | |
1330 | if (write_symbols == XCOFF_DEBUG && top_level) | |
05be4cea JW |
1331 | { |
1332 | saved_in_section = in_section; | |
1333 | ||
1334 | dbxout_symbol (decl, 0); | |
1335 | ||
1336 | if (in_section != saved_in_section) | |
1337 | { | |
1338 | /* Switch to the proper section for this data. */ | |
1339 | #ifdef SELECT_SECTION | |
1340 | SELECT_SECTION (decl, reloc); | |
1341 | #else | |
1342 | if (TREE_READONLY (decl) | |
1343 | && ! TREE_THIS_VOLATILE (decl) | |
07aeab22 JW |
1344 | && DECL_INITIAL (decl) |
1345 | && (DECL_INITIAL (decl) == error_mark_node | |
1346 | || TREE_CONSTANT (DECL_INITIAL (decl))) | |
05be4cea JW |
1347 | && ! (flag_pic && reloc)) |
1348 | readonly_data_section (); | |
1349 | else | |
1350 | data_section (); | |
1351 | #endif | |
1352 | } | |
1353 | } | |
b4ac57ab RS |
1354 | #else |
1355 | /* There must be a statement after a label. */ | |
1356 | ; | |
1357 | #endif | |
79e68feb RS |
1358 | } |
1359 | ||
2e9effae RS |
1360 | /* Return 1 if type TYPE contains any pointers. */ |
1361 | ||
1362 | static int | |
1363 | contains_pointers_p (type) | |
1364 | tree type; | |
1365 | { | |
1366 | switch (TREE_CODE (type)) | |
1367 | { | |
1368 | case POINTER_TYPE: | |
1369 | case REFERENCE_TYPE: | |
1370 | /* I'm not sure whether OFFSET_TYPE needs this treatment, | |
1371 | so I'll play safe and return 1. */ | |
1372 | case OFFSET_TYPE: | |
1373 | return 1; | |
1374 | ||
1375 | case RECORD_TYPE: | |
1376 | case UNION_TYPE: | |
1377 | case QUAL_UNION_TYPE: | |
1378 | { | |
1379 | tree fields; | |
1380 | /* For a type that has fields, see if the fields have pointers. */ | |
1381 | for (fields = TYPE_FIELDS (type); fields; fields = TREE_CHAIN (fields)) | |
ce49ea8a JM |
1382 | if (TREE_CODE (fields) == FIELD_DECL |
1383 | && contains_pointers_p (TREE_TYPE (fields))) | |
2e9effae RS |
1384 | return 1; |
1385 | return 0; | |
1386 | } | |
1387 | ||
1388 | case ARRAY_TYPE: | |
1389 | /* An array type contains pointers if its element type does. */ | |
1390 | return contains_pointers_p (TREE_TYPE (type)); | |
1391 | ||
1392 | default: | |
1393 | return 0; | |
1394 | } | |
1395 | } | |
1396 | ||
be972023 | 1397 | /* Output text storage for constructor CONSTR. */ |
ca695ac9 | 1398 | |
be972023 | 1399 | void |
5a13eaa4 RK |
1400 | bc_output_constructor (constr, size) |
1401 | tree constr; | |
1402 | int size; | |
ca695ac9 JB |
1403 | { |
1404 | int i; | |
1405 | ||
1406 | /* Must always be a literal; non-literal constructors are handled | |
1407 | differently. */ | |
1408 | ||
1409 | if (!TREE_CONSTANT (constr)) | |
1410 | abort (); | |
1411 | ||
1412 | /* Always const */ | |
1413 | text_section (); | |
1414 | ||
1415 | /* Align */ | |
5a13eaa4 RK |
1416 | for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++) |
1417 | ; | |
1418 | ||
ca695ac9 JB |
1419 | if (i > 0) |
1420 | BC_OUTPUT_ALIGN (asm_out_file, i); | |
1421 | ||
1422 | /* Output data */ | |
5a13eaa4 | 1423 | output_constant (constr, size); |
ca695ac9 JB |
1424 | } |
1425 | ||
ca695ac9 JB |
1426 | /* Create storage for constructor CONSTR. */ |
1427 | ||
1428 | void | |
1429 | bc_output_data_constructor (constr) | |
1430 | tree constr; | |
1431 | { | |
1432 | int i; | |
1433 | ||
1434 | /* Put in data section */ | |
1435 | data_section (); | |
1436 | ||
1437 | /* Align */ | |
1438 | for (i = 0; TYPE_ALIGN (constr) >= BITS_PER_UNIT << (i + 1); i++); | |
1439 | if (i > 0) | |
1440 | BC_OUTPUT_ALIGN (asm_out_file, i); | |
1441 | ||
1442 | /* The constructor is filled in at runtime. */ | |
1443 | BC_OUTPUT_SKIP (asm_out_file, int_size_in_bytes (TREE_TYPE (constr))); | |
1444 | } | |
1445 | ||
79e68feb | 1446 | /* Output something to declare an external symbol to the assembler. |
fff9e713 MT |
1447 | (Most assemblers don't need this, so we normally output nothing.) |
1448 | Do nothing if DECL is not external. */ | |
79e68feb RS |
1449 | |
1450 | void | |
1451 | assemble_external (decl) | |
1452 | tree decl; | |
1453 | { | |
ca695ac9 JB |
1454 | if (output_bytecode) |
1455 | return; | |
1456 | ||
79e68feb | 1457 | #ifdef ASM_OUTPUT_EXTERNAL |
fff9e713 | 1458 | if (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd' |
44fe2e80 | 1459 | && DECL_EXTERNAL (decl) && TREE_PUBLIC (decl)) |
79e68feb | 1460 | { |
fff9e713 MT |
1461 | rtx rtl = DECL_RTL (decl); |
1462 | ||
1463 | if (GET_CODE (rtl) == MEM && GET_CODE (XEXP (rtl, 0)) == SYMBOL_REF | |
1464 | && ! SYMBOL_REF_USED (XEXP (rtl, 0))) | |
1465 | { | |
1466 | /* Some systems do require some output. */ | |
1467 | SYMBOL_REF_USED (XEXP (rtl, 0)) = 1; | |
1468 | ASM_OUTPUT_EXTERNAL (asm_out_file, decl, XSTR (XEXP (rtl, 0), 0)); | |
1469 | } | |
79e68feb RS |
1470 | } |
1471 | #endif | |
1472 | } | |
1473 | ||
1474 | /* Similar, for calling a library function FUN. */ | |
1475 | ||
1476 | void | |
1477 | assemble_external_libcall (fun) | |
1478 | rtx fun; | |
1479 | { | |
1480 | #ifdef ASM_OUTPUT_EXTERNAL_LIBCALL | |
ca695ac9 | 1481 | if (!output_bytecode) |
79e68feb | 1482 | { |
ca695ac9 JB |
1483 | /* Declare library function name external when first used, if nec. */ |
1484 | if (! SYMBOL_REF_USED (fun)) | |
1485 | { | |
1486 | SYMBOL_REF_USED (fun) = 1; | |
1487 | ASM_OUTPUT_EXTERNAL_LIBCALL (asm_out_file, fun); | |
1488 | } | |
79e68feb RS |
1489 | } |
1490 | #endif | |
1491 | } | |
1492 | ||
1493 | /* Declare the label NAME global. */ | |
1494 | ||
1495 | void | |
1496 | assemble_global (name) | |
1497 | char *name; | |
1498 | { | |
1499 | ASM_GLOBALIZE_LABEL (asm_out_file, name); | |
1500 | } | |
1501 | ||
1502 | /* Assemble a label named NAME. */ | |
1503 | ||
1504 | void | |
1505 | assemble_label (name) | |
1506 | char *name; | |
1507 | { | |
ca695ac9 JB |
1508 | if (output_bytecode) |
1509 | BC_OUTPUT_LABEL (asm_out_file, name); | |
1510 | else | |
1511 | ASM_OUTPUT_LABEL (asm_out_file, name); | |
79e68feb RS |
1512 | } |
1513 | ||
1514 | /* Output to FILE a reference to the assembler name of a C-level name NAME. | |
1515 | If NAME starts with a *, the rest of NAME is output verbatim. | |
1516 | Otherwise NAME is transformed in an implementation-defined way | |
1517 | (usually by the addition of an underscore). | |
1518 | Many macros in the tm file are defined to call this function. */ | |
1519 | ||
1520 | void | |
1521 | assemble_name (file, name) | |
1522 | FILE *file; | |
1523 | char *name; | |
1524 | { | |
648fb7cf RK |
1525 | char *real_name; |
1526 | ||
1527 | STRIP_NAME_ENCODING (real_name, name); | |
1528 | TREE_SYMBOL_REFERENCED (get_identifier (real_name)) = 1; | |
03e42132 | 1529 | |
79e68feb | 1530 | if (name[0] == '*') |
ca695ac9 JB |
1531 | { |
1532 | if (output_bytecode) | |
1533 | bc_emit_labelref (name); | |
1534 | else | |
1535 | fputs (&name[1], file); | |
1536 | } | |
79e68feb | 1537 | else |
ca695ac9 JB |
1538 | { |
1539 | if (output_bytecode) | |
1540 | BC_OUTPUT_LABELREF (file, name); | |
1541 | else | |
1542 | ASM_OUTPUT_LABELREF (file, name); | |
1543 | } | |
79e68feb RS |
1544 | } |
1545 | ||
1546 | /* Allocate SIZE bytes writable static space with a gensym name | |
1547 | and return an RTX to refer to its address. */ | |
1548 | ||
1549 | rtx | |
1550 | assemble_static_space (size) | |
1551 | int size; | |
1552 | { | |
1553 | char name[12]; | |
1554 | char *namestring; | |
1555 | rtx x; | |
1556 | /* Round size up to multiple of BIGGEST_ALIGNMENT bits | |
1557 | so that each uninitialized object starts on such a boundary. */ | |
1558 | int rounded = ((size + (BIGGEST_ALIGNMENT / BITS_PER_UNIT) - 1) | |
1559 | / (BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
1560 | * (BIGGEST_ALIGNMENT / BITS_PER_UNIT)); | |
1561 | ||
1562 | #if 0 | |
1563 | if (flag_shared_data) | |
1564 | data_section (); | |
1565 | #endif | |
1566 | ||
1567 | ASM_GENERATE_INTERNAL_LABEL (name, "LF", const_labelno); | |
1568 | ++const_labelno; | |
1569 | ||
1570 | namestring = (char *) obstack_alloc (saveable_obstack, | |
1571 | strlen (name) + 2); | |
1572 | strcpy (namestring, name); | |
1573 | ||
ca695ac9 JB |
1574 | if (output_bytecode) |
1575 | x = bc_gen_rtx (namestring, 0, (struct bc_label *) 0); | |
1576 | else | |
1577 | x = gen_rtx (SYMBOL_REF, Pmode, namestring); | |
1578 | ||
1579 | if (output_bytecode) | |
69249c1b RS |
1580 | { |
1581 | BC_OUTPUT_LOCAL (asm_out_file, name, size, rounded); | |
1582 | } | |
ca695ac9 JB |
1583 | else |
1584 | { | |
79e68feb | 1585 | #ifdef ASM_OUTPUT_ALIGNED_LOCAL |
ca695ac9 | 1586 | ASM_OUTPUT_ALIGNED_LOCAL (asm_out_file, name, size, BIGGEST_ALIGNMENT); |
79e68feb | 1587 | #else |
ca695ac9 | 1588 | ASM_OUTPUT_LOCAL (asm_out_file, name, size, rounded); |
79e68feb | 1589 | #endif |
ca695ac9 | 1590 | } |
79e68feb RS |
1591 | return x; |
1592 | } | |
1593 | ||
1594 | /* Assemble the static constant template for function entry trampolines. | |
1595 | This is done at most once per compilation. | |
1596 | Returns an RTX for the address of the template. */ | |
1597 | ||
1598 | rtx | |
1599 | assemble_trampoline_template () | |
1600 | { | |
1601 | char label[256]; | |
1602 | char *name; | |
1603 | int align; | |
1604 | ||
ca695ac9 JB |
1605 | /* Shouldn't get here */ |
1606 | if (output_bytecode) | |
1607 | abort (); | |
1608 | ||
37552631 | 1609 | /* By default, put trampoline templates in read-only data section. */ |
f49acdb4 | 1610 | |
37552631 RS |
1611 | #ifdef TRAMPOLINE_SECTION |
1612 | TRAMPOLINE_SECTION (); | |
1613 | #else | |
c8c29f85 | 1614 | readonly_data_section (); |
37552631 | 1615 | #endif |
f49acdb4 | 1616 | |
79e68feb RS |
1617 | /* Write the assembler code to define one. */ |
1618 | align = floor_log2 (FUNCTION_BOUNDARY / BITS_PER_UNIT); | |
1619 | if (align > 0) | |
1620 | ASM_OUTPUT_ALIGN (asm_out_file, align); | |
1621 | ||
1622 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LTRAMP", 0); | |
1623 | TRAMPOLINE_TEMPLATE (asm_out_file); | |
1624 | ||
1625 | /* Record the rtl to refer to it. */ | |
1626 | ASM_GENERATE_INTERNAL_LABEL (label, "LTRAMP", 0); | |
1627 | name | |
1628 | = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label)); | |
1629 | return gen_rtx (SYMBOL_REF, Pmode, name); | |
1630 | } | |
1631 | \f | |
1632 | /* Assemble the integer constant X into an object of SIZE bytes. | |
1633 | X must be either a CONST_INT or CONST_DOUBLE. | |
1634 | ||
1635 | Return 1 if we were able to output the constant, otherwise 0. If FORCE is | |
1636 | non-zero, abort if we can't output the constant. */ | |
1637 | ||
1638 | int | |
1639 | assemble_integer (x, size, force) | |
1640 | rtx x; | |
1641 | int size; | |
1642 | int force; | |
1643 | { | |
1644 | /* First try to use the standard 1, 2, 4, 8, and 16 byte | |
1645 | ASM_OUTPUT... macros. */ | |
1646 | ||
1647 | switch (size) | |
1648 | { | |
1649 | #ifdef ASM_OUTPUT_CHAR | |
1650 | case 1: | |
1651 | ASM_OUTPUT_CHAR (asm_out_file, x); | |
1652 | return 1; | |
1653 | #endif | |
1654 | ||
1655 | #ifdef ASM_OUTPUT_SHORT | |
1656 | case 2: | |
1657 | ASM_OUTPUT_SHORT (asm_out_file, x); | |
1658 | return 1; | |
1659 | #endif | |
1660 | ||
1661 | #ifdef ASM_OUTPUT_INT | |
1662 | case 4: | |
1663 | ASM_OUTPUT_INT (asm_out_file, x); | |
1664 | return 1; | |
1665 | #endif | |
1666 | ||
1667 | #ifdef ASM_OUTPUT_DOUBLE_INT | |
1668 | case 8: | |
1669 | ASM_OUTPUT_DOUBLE_INT (asm_out_file, x); | |
1670 | return 1; | |
1671 | #endif | |
1672 | ||
1673 | #ifdef ASM_OUTPUT_QUADRUPLE_INT | |
1674 | case 16: | |
1675 | ASM_OUTPUT_QUADRUPLE_INT (asm_out_file, x); | |
1676 | return 1; | |
1677 | #endif | |
1678 | } | |
1679 | ||
1680 | /* If we couldn't do it that way, there are two other possibilities: First, | |
1681 | if the machine can output an explicit byte and this is a 1 byte constant, | |
1682 | we can use ASM_OUTPUT_BYTE. */ | |
1683 | ||
1684 | #ifdef ASM_OUTPUT_BYTE | |
1685 | if (size == 1 && GET_CODE (x) == CONST_INT) | |
1686 | { | |
1687 | ASM_OUTPUT_BYTE (asm_out_file, INTVAL (x)); | |
1688 | return 1; | |
1689 | } | |
1690 | #endif | |
1691 | ||
1692 | /* Finally, if SIZE is larger than a single word, try to output the constant | |
1693 | one word at a time. */ | |
1694 | ||
1695 | if (size > UNITS_PER_WORD) | |
1696 | { | |
1697 | int i; | |
1698 | enum machine_mode mode | |
1699 | = mode_for_size (size * BITS_PER_UNIT, MODE_INT, 0); | |
1700 | rtx word; | |
1701 | ||
1702 | for (i = 0; i < size / UNITS_PER_WORD; i++) | |
1703 | { | |
1704 | word = operand_subword (x, i, 0, mode); | |
1705 | ||
1706 | if (word == 0) | |
1707 | break; | |
1708 | ||
fff9e713 MT |
1709 | if (! assemble_integer (word, UNITS_PER_WORD, 0)) |
1710 | break; | |
79e68feb RS |
1711 | } |
1712 | ||
1713 | if (i == size / UNITS_PER_WORD) | |
1714 | return 1; | |
fff9e713 MT |
1715 | /* If we output at least one word and then could not finish, |
1716 | there is no valid way to continue. */ | |
1717 | if (i > 0) | |
1718 | abort (); | |
79e68feb RS |
1719 | } |
1720 | ||
1721 | if (force) | |
1722 | abort (); | |
1723 | ||
1724 | return 0; | |
1725 | } | |
1726 | \f | |
1727 | /* Assemble the floating-point constant D into an object of size MODE. */ | |
1728 | ||
1729 | void | |
1730 | assemble_real (d, mode) | |
1731 | REAL_VALUE_TYPE d; | |
1732 | enum machine_mode mode; | |
1733 | { | |
1734 | jmp_buf output_constant_handler; | |
1735 | ||
1736 | if (setjmp (output_constant_handler)) | |
1737 | { | |
1738 | error ("floating point trap outputting a constant"); | |
1739 | #ifdef REAL_IS_NOT_DOUBLE | |
4c9a05bc | 1740 | bzero ((char *) &d, sizeof d); |
79e68feb RS |
1741 | d = dconst0; |
1742 | #else | |
1743 | d = 0; | |
1744 | #endif | |
1745 | } | |
1746 | ||
1747 | set_float_handler (output_constant_handler); | |
1748 | ||
1749 | switch (mode) | |
1750 | { | |
b7526ea5 RS |
1751 | #ifdef ASM_OUTPUT_BYTE_FLOAT |
1752 | case QFmode: | |
1753 | ASM_OUTPUT_BYTE_FLOAT (asm_out_file, d); | |
1754 | break; | |
1755 | #endif | |
1756 | #ifdef ASM_OUTPUT_SHORT_FLOAT | |
1757 | case HFmode: | |
1758 | ASM_OUTPUT_SHORT_FLOAT (asm_out_file, d); | |
1759 | break; | |
1760 | #endif | |
32c03bfb RK |
1761 | #ifdef ASM_OUTPUT_THREE_QUARTER_FLOAT |
1762 | case TQFmode: | |
1763 | ASM_OUTPUT_THREE_QUARTER_FLOAT (asm_out_file, d); | |
1764 | break; | |
1765 | #endif | |
79e68feb RS |
1766 | #ifdef ASM_OUTPUT_FLOAT |
1767 | case SFmode: | |
1768 | ASM_OUTPUT_FLOAT (asm_out_file, d); | |
1769 | break; | |
1770 | #endif | |
1771 | ||
1772 | #ifdef ASM_OUTPUT_DOUBLE | |
1773 | case DFmode: | |
1774 | ASM_OUTPUT_DOUBLE (asm_out_file, d); | |
1775 | break; | |
1776 | #endif | |
1777 | ||
1778 | #ifdef ASM_OUTPUT_LONG_DOUBLE | |
2c7ff63c | 1779 | case XFmode: |
79e68feb RS |
1780 | case TFmode: |
1781 | ASM_OUTPUT_LONG_DOUBLE (asm_out_file, d); | |
1782 | break; | |
1783 | #endif | |
1784 | ||
1785 | default: | |
1786 | abort (); | |
1787 | } | |
1788 | ||
37366632 | 1789 | set_float_handler (NULL_PTR); |
79e68feb RS |
1790 | } |
1791 | \f | |
1792 | /* Here we combine duplicate floating constants to make | |
1793 | CONST_DOUBLE rtx's, and force those out to memory when necessary. */ | |
1794 | ||
1795 | /* Chain of all CONST_DOUBLE rtx's constructed for the current function. | |
1796 | They are chained through the CONST_DOUBLE_CHAIN. | |
1797 | A CONST_DOUBLE rtx has CONST_DOUBLE_MEM != cc0_rtx iff it is on this chain. | |
1798 | In that case, CONST_DOUBLE_MEM is either a MEM, | |
57632c51 RS |
1799 | or const0_rtx if no MEM has been made for this CONST_DOUBLE yet. |
1800 | ||
1801 | (CONST_DOUBLE_MEM is used only for top-level functions. | |
1802 | See force_const_mem for explanation.) */ | |
79e68feb RS |
1803 | |
1804 | static rtx const_double_chain; | |
1805 | ||
4db92e9a | 1806 | /* Return a CONST_DOUBLE or CONST_INT for a value specified as a pair of ints. |
79e68feb RS |
1807 | For an integer, I0 is the low-order word and I1 is the high-order word. |
1808 | For a real number, I0 is the word with the low address | |
1809 | and I1 is the word with the high address. */ | |
1810 | ||
1811 | rtx | |
1812 | immed_double_const (i0, i1, mode) | |
37366632 | 1813 | HOST_WIDE_INT i0, i1; |
79e68feb RS |
1814 | enum machine_mode mode; |
1815 | { | |
1816 | register rtx r; | |
1817 | int in_current_obstack; | |
1818 | ||
ab8ab9d0 SC |
1819 | if (GET_MODE_CLASS (mode) == MODE_INT |
1820 | || GET_MODE_CLASS (mode) == MODE_PARTIAL_INT) | |
79e68feb RS |
1821 | { |
1822 | /* We clear out all bits that don't belong in MODE, unless they and our | |
1823 | sign bit are all one. So we get either a reasonable negative value | |
1824 | or a reasonable unsigned value for this mode. */ | |
1825 | int width = GET_MODE_BITSIZE (mode); | |
37366632 RK |
1826 | if (width < HOST_BITS_PER_WIDE_INT |
1827 | && ((i0 & ((HOST_WIDE_INT) (-1) << (width - 1))) | |
1828 | != ((HOST_WIDE_INT) (-1) << (width - 1)))) | |
1829 | i0 &= ((HOST_WIDE_INT) 1 << width) - 1, i1 = 0; | |
1830 | else if (width == HOST_BITS_PER_WIDE_INT | |
79e68feb RS |
1831 | && ! (i1 == ~0 && i0 < 0)) |
1832 | i1 = 0; | |
37366632 | 1833 | else if (width > 2 * HOST_BITS_PER_WIDE_INT) |
79e68feb RS |
1834 | /* We cannot represent this value as a constant. */ |
1835 | abort (); | |
1836 | ||
2ba3a0ec JW |
1837 | /* If this would be an entire word for the target, but is not for |
1838 | the host, then sign-extend on the host so that the number will look | |
1839 | the same way on the host that it would on the target. | |
1840 | ||
1841 | For example, when building a 64 bit alpha hosted 32 bit sparc | |
1842 | targeted compiler, then we want the 32 bit unsigned value -1 to be | |
1843 | represented as a 64 bit value -1, and not as 0x00000000ffffffff. | |
1844 | The later confuses the sparc backend. */ | |
1845 | ||
1846 | if (BITS_PER_WORD < HOST_BITS_PER_WIDE_INT && BITS_PER_WORD == width | |
1847 | && (i0 & ((HOST_WIDE_INT) 1 << (width - 1)))) | |
1848 | i0 |= ((HOST_WIDE_INT) (-1) << width); | |
1849 | ||
37366632 | 1850 | /* If MODE fits within HOST_BITS_PER_WIDE_INT, always use a CONST_INT. |
79e68feb RS |
1851 | |
1852 | ??? Strictly speaking, this is wrong if we create a CONST_INT | |
1853 | for a large unsigned constant with the size of MODE being | |
37366632 RK |
1854 | HOST_BITS_PER_WIDE_INT and later try to interpret that constant in a |
1855 | wider mode. In that case we will mis-interpret it as a negative | |
1856 | number. | |
79e68feb RS |
1857 | |
1858 | Unfortunately, the only alternative is to make a CONST_DOUBLE | |
1859 | for any constant in any mode if it is an unsigned constant larger | |
1860 | than the maximum signed integer in an int on the host. However, | |
1861 | doing this will break everyone that always expects to see a CONST_INT | |
1862 | for SImode and smaller. | |
1863 | ||
1864 | We have always been making CONST_INTs in this case, so nothing new | |
1865 | is being broken. */ | |
1866 | ||
37366632 | 1867 | if (width <= HOST_BITS_PER_WIDE_INT) |
79e68feb RS |
1868 | i1 = (i0 < 0) ? ~0 : 0; |
1869 | ||
1870 | /* If this integer fits in one word, return a CONST_INT. */ | |
1871 | if ((i1 == 0 && i0 >= 0) | |
1872 | || (i1 == ~0 && i0 < 0)) | |
37366632 | 1873 | return GEN_INT (i0); |
79e68feb RS |
1874 | |
1875 | /* We use VOIDmode for integers. */ | |
1876 | mode = VOIDmode; | |
1877 | } | |
1878 | ||
1879 | /* Search the chain for an existing CONST_DOUBLE with the right value. | |
1880 | If one is found, return it. */ | |
1881 | ||
1882 | for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r)) | |
1883 | if (CONST_DOUBLE_LOW (r) == i0 && CONST_DOUBLE_HIGH (r) == i1 | |
1884 | && GET_MODE (r) == mode) | |
1885 | return r; | |
1886 | ||
1887 | /* No; make a new one and add it to the chain. | |
1888 | ||
1889 | We may be called by an optimizer which may be discarding any memory | |
1890 | allocated during its processing (such as combine and loop). However, | |
1891 | we will be leaving this constant on the chain, so we cannot tolerate | |
1892 | freed memory. So switch to saveable_obstack for this allocation | |
1893 | and then switch back if we were in current_obstack. */ | |
1894 | ||
2260924f JW |
1895 | push_obstacks_nochange (); |
1896 | rtl_in_saveable_obstack (); | |
79e68feb | 1897 | r = gen_rtx (CONST_DOUBLE, mode, 0, i0, i1); |
2260924f | 1898 | pop_obstacks (); |
79e68feb | 1899 | |
179bb78c JW |
1900 | /* Don't touch const_double_chain in nested function; see force_const_mem. |
1901 | Also, don't touch it if not inside any function. */ | |
1902 | if (outer_function_chain == 0 && current_function_decl != 0) | |
5145eda8 RS |
1903 | { |
1904 | CONST_DOUBLE_CHAIN (r) = const_double_chain; | |
1905 | const_double_chain = r; | |
1906 | } | |
79e68feb RS |
1907 | |
1908 | /* Store const0_rtx in mem-slot since this CONST_DOUBLE is on the chain. | |
1909 | Actual use of mem-slot is only through force_const_mem. */ | |
1910 | ||
1911 | CONST_DOUBLE_MEM (r) = const0_rtx; | |
1912 | ||
1913 | return r; | |
1914 | } | |
1915 | ||
1916 | /* Return a CONST_DOUBLE for a specified `double' value | |
1917 | and machine mode. */ | |
1918 | ||
1919 | rtx | |
1920 | immed_real_const_1 (d, mode) | |
1921 | REAL_VALUE_TYPE d; | |
1922 | enum machine_mode mode; | |
1923 | { | |
1924 | union real_extract u; | |
1925 | register rtx r; | |
1926 | int in_current_obstack; | |
1927 | ||
1928 | /* Get the desired `double' value as a sequence of ints | |
1929 | since that is how they are stored in a CONST_DOUBLE. */ | |
1930 | ||
1931 | u.d = d; | |
1932 | ||
1933 | /* Detect special cases. */ | |
1934 | ||
f246a305 | 1935 | /* Avoid REAL_VALUES_EQUAL here in order to distinguish minus zero. */ |
4c9a05bc | 1936 | if (!bcmp ((char *) &dconst0, (char *) &d, sizeof d)) |
79e68feb | 1937 | return CONST0_RTX (mode); |
12194c38 RS |
1938 | /* Check for NaN first, because some ports (specifically the i386) do not |
1939 | emit correct ieee-fp code by default, and thus will generate a core | |
1940 | dump here if we pass a NaN to REAL_VALUES_EQUAL and if REAL_VALUES_EQUAL | |
1941 | does a floating point comparison. */ | |
1942 | else if (! REAL_VALUE_ISNAN (d) && REAL_VALUES_EQUAL (dconst1, d)) | |
79e68feb RS |
1943 | return CONST1_RTX (mode); |
1944 | ||
37366632 | 1945 | if (sizeof u == 2 * sizeof (HOST_WIDE_INT)) |
79e68feb RS |
1946 | return immed_double_const (u.i[0], u.i[1], mode); |
1947 | ||
1948 | /* The rest of this function handles the case where | |
1949 | a float value requires more than 2 ints of space. | |
1950 | It will be deleted as dead code on machines that don't need it. */ | |
1951 | ||
1952 | /* Search the chain for an existing CONST_DOUBLE with the right value. | |
1953 | If one is found, return it. */ | |
1954 | ||
1955 | for (r = const_double_chain; r; r = CONST_DOUBLE_CHAIN (r)) | |
4c9a05bc | 1956 | if (! bcmp ((char *) &CONST_DOUBLE_LOW (r), (char *) &u, sizeof u) |
79e68feb RS |
1957 | && GET_MODE (r) == mode) |
1958 | return r; | |
1959 | ||
1960 | /* No; make a new one and add it to the chain. | |
1961 | ||
1962 | We may be called by an optimizer which may be discarding any memory | |
1963 | allocated during its processing (such as combine and loop). However, | |
1964 | we will be leaving this constant on the chain, so we cannot tolerate | |
1965 | freed memory. So switch to saveable_obstack for this allocation | |
1966 | and then switch back if we were in current_obstack. */ | |
1967 | ||
2260924f JW |
1968 | push_obstacks_nochange (); |
1969 | rtl_in_saveable_obstack (); | |
79e68feb RS |
1970 | r = rtx_alloc (CONST_DOUBLE); |
1971 | PUT_MODE (r, mode); | |
4c9a05bc | 1972 | bcopy ((char *) &u, (char *) &CONST_DOUBLE_LOW (r), sizeof u); |
2260924f | 1973 | pop_obstacks (); |
79e68feb | 1974 | |
179bb78c JW |
1975 | /* Don't touch const_double_chain in nested function; see force_const_mem. |
1976 | Also, don't touch it if not inside any function. */ | |
1977 | if (outer_function_chain == 0 && current_function_decl != 0) | |
5145eda8 RS |
1978 | { |
1979 | CONST_DOUBLE_CHAIN (r) = const_double_chain; | |
1980 | const_double_chain = r; | |
1981 | } | |
79e68feb RS |
1982 | |
1983 | /* Store const0_rtx in CONST_DOUBLE_MEM since this CONST_DOUBLE is on the | |
1984 | chain, but has not been allocated memory. Actual use of CONST_DOUBLE_MEM | |
1985 | is only through force_const_mem. */ | |
1986 | ||
1987 | CONST_DOUBLE_MEM (r) = const0_rtx; | |
1988 | ||
1989 | return r; | |
1990 | } | |
1991 | ||
1992 | /* Return a CONST_DOUBLE rtx for a value specified by EXP, | |
1993 | which must be a REAL_CST tree node. */ | |
1994 | ||
1995 | rtx | |
1996 | immed_real_const (exp) | |
1997 | tree exp; | |
1998 | { | |
1999 | return immed_real_const_1 (TREE_REAL_CST (exp), TYPE_MODE (TREE_TYPE (exp))); | |
2000 | } | |
2001 | ||
2002 | /* At the end of a function, forget the memory-constants | |
2003 | previously made for CONST_DOUBLEs. Mark them as not on real_constant_chain. | |
2004 | Also clear out real_constant_chain and clear out all the chain-pointers. */ | |
2005 | ||
2006 | void | |
2007 | clear_const_double_mem () | |
2008 | { | |
2009 | register rtx r, next; | |
2010 | ||
57632c51 RS |
2011 | /* Don't touch CONST_DOUBLE_MEM for nested functions. |
2012 | See force_const_mem for explanation. */ | |
2013 | if (outer_function_chain != 0) | |
2014 | return; | |
2015 | ||
79e68feb RS |
2016 | for (r = const_double_chain; r; r = next) |
2017 | { | |
2018 | next = CONST_DOUBLE_CHAIN (r); | |
2019 | CONST_DOUBLE_CHAIN (r) = 0; | |
2020 | CONST_DOUBLE_MEM (r) = cc0_rtx; | |
2021 | } | |
2022 | const_double_chain = 0; | |
2023 | } | |
2024 | \f | |
2025 | /* Given an expression EXP with a constant value, | |
2026 | reduce it to the sum of an assembler symbol and an integer. | |
2027 | Store them both in the structure *VALUE. | |
2028 | Abort if EXP does not reduce. */ | |
2029 | ||
2030 | struct addr_const | |
2031 | { | |
2032 | rtx base; | |
fb351073 | 2033 | HOST_WIDE_INT offset; |
79e68feb RS |
2034 | }; |
2035 | ||
2036 | static void | |
2037 | decode_addr_const (exp, value) | |
2038 | tree exp; | |
2039 | struct addr_const *value; | |
2040 | { | |
2041 | register tree target = TREE_OPERAND (exp, 0); | |
2042 | register int offset = 0; | |
2043 | register rtx x; | |
2044 | ||
2045 | while (1) | |
2046 | { | |
2047 | if (TREE_CODE (target) == COMPONENT_REF | |
2048 | && (TREE_CODE (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) | |
2049 | == INTEGER_CST)) | |
2050 | { | |
2051 | offset += TREE_INT_CST_LOW (DECL_FIELD_BITPOS (TREE_OPERAND (target, 1))) / BITS_PER_UNIT; | |
2052 | target = TREE_OPERAND (target, 0); | |
2053 | } | |
2054 | else if (TREE_CODE (target) == ARRAY_REF) | |
2055 | { | |
2056 | if (TREE_CODE (TREE_OPERAND (target, 1)) != INTEGER_CST | |
2057 | || TREE_CODE (TYPE_SIZE (TREE_TYPE (target))) != INTEGER_CST) | |
2058 | abort (); | |
2059 | offset += ((TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (target))) | |
2060 | * TREE_INT_CST_LOW (TREE_OPERAND (target, 1))) | |
2061 | / BITS_PER_UNIT); | |
2062 | target = TREE_OPERAND (target, 0); | |
2063 | } | |
2064 | else | |
2065 | break; | |
2066 | } | |
2067 | ||
2068 | switch (TREE_CODE (target)) | |
2069 | { | |
2070 | case VAR_DECL: | |
2071 | case FUNCTION_DECL: | |
2072 | x = DECL_RTL (target); | |
2073 | break; | |
2074 | ||
2075 | case LABEL_DECL: | |
ca695ac9 JB |
2076 | if (output_bytecode) |
2077 | /* FIXME: this may not be correct, check it */ | |
2078 | x = bc_gen_rtx (TREE_STRING_POINTER (target), 0, (struct bc_label *) 0); | |
2079 | else | |
2080 | x = gen_rtx (MEM, FUNCTION_MODE, | |
2081 | gen_rtx (LABEL_REF, VOIDmode, | |
2082 | label_rtx (TREE_OPERAND (exp, 0)))); | |
79e68feb RS |
2083 | break; |
2084 | ||
2085 | case REAL_CST: | |
2086 | case STRING_CST: | |
2087 | case COMPLEX_CST: | |
2088 | case CONSTRUCTOR: | |
2089 | x = TREE_CST_RTL (target); | |
2090 | break; | |
2091 | ||
2092 | default: | |
2093 | abort (); | |
2094 | } | |
2095 | ||
ca695ac9 JB |
2096 | if (!output_bytecode) |
2097 | { | |
2098 | if (GET_CODE (x) != MEM) | |
2099 | abort (); | |
2100 | x = XEXP (x, 0); | |
2101 | } | |
79e68feb RS |
2102 | |
2103 | value->base = x; | |
2104 | value->offset = offset; | |
2105 | } | |
2106 | \f | |
2107 | /* Uniquize all constants that appear in memory. | |
2108 | Each constant in memory thus far output is recorded | |
2109 | in `const_hash_table' with a `struct constant_descriptor' | |
2110 | that contains a polish representation of the value of | |
2111 | the constant. | |
2112 | ||
2113 | We cannot store the trees in the hash table | |
2114 | because the trees may be temporary. */ | |
2115 | ||
2116 | struct constant_descriptor | |
2117 | { | |
2118 | struct constant_descriptor *next; | |
2119 | char *label; | |
2120 | char contents[1]; | |
2121 | }; | |
2122 | ||
2123 | #define HASHBITS 30 | |
2124 | #define MAX_HASH_TABLE 1009 | |
2125 | static struct constant_descriptor *const_hash_table[MAX_HASH_TABLE]; | |
2126 | ||
2127 | /* Compute a hash code for a constant expression. */ | |
2128 | ||
5a13eaa4 | 2129 | static int |
79e68feb RS |
2130 | const_hash (exp) |
2131 | tree exp; | |
2132 | { | |
2133 | register char *p; | |
2134 | register int len, hi, i; | |
2135 | register enum tree_code code = TREE_CODE (exp); | |
2136 | ||
2137 | if (code == INTEGER_CST) | |
2138 | { | |
2139 | p = (char *) &TREE_INT_CST_LOW (exp); | |
2140 | len = 2 * sizeof TREE_INT_CST_LOW (exp); | |
2141 | } | |
2142 | else if (code == REAL_CST) | |
2143 | { | |
2144 | p = (char *) &TREE_REAL_CST (exp); | |
2145 | len = sizeof TREE_REAL_CST (exp); | |
2146 | } | |
2147 | else if (code == STRING_CST) | |
2148 | p = TREE_STRING_POINTER (exp), len = TREE_STRING_LENGTH (exp); | |
2149 | else if (code == COMPLEX_CST) | |
2150 | return const_hash (TREE_REALPART (exp)) * 5 | |
2151 | + const_hash (TREE_IMAGPART (exp)); | |
474bda6c PB |
2152 | else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) |
2153 | { | |
2154 | len = int_size_in_bytes (TREE_TYPE (exp)); | |
2155 | p = (char*) alloca (len); | |
2156 | get_set_constructor_bytes (exp, (unsigned char *) p, len); | |
2157 | } | |
79e68feb RS |
2158 | else if (code == CONSTRUCTOR) |
2159 | { | |
2160 | register tree link; | |
2161 | ||
2162 | /* For record type, include the type in the hashing. | |
2163 | We do not do so for array types | |
2164 | because (1) the sizes of the elements are sufficient | |
eb528802 RS |
2165 | and (2) distinct array types can have the same constructor. |
2166 | Instead, we include the array size because the constructor could | |
2167 | be shorter. */ | |
79e68feb | 2168 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) |
fb351073 RK |
2169 | hi = ((HOST_WIDE_INT) TREE_TYPE (exp) & ((1 << HASHBITS) - 1)) |
2170 | % MAX_HASH_TABLE; | |
79e68feb | 2171 | else |
eb528802 RS |
2172 | hi = ((5 + int_size_in_bytes (TREE_TYPE (exp))) |
2173 | & ((1 << HASHBITS) - 1)) % MAX_HASH_TABLE; | |
79e68feb RS |
2174 | |
2175 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
77fa0940 RK |
2176 | if (TREE_VALUE (link)) |
2177 | hi = (hi * 603 + const_hash (TREE_VALUE (link))) % MAX_HASH_TABLE; | |
79e68feb RS |
2178 | |
2179 | return hi; | |
2180 | } | |
2181 | else if (code == ADDR_EXPR) | |
2182 | { | |
2183 | struct addr_const value; | |
2184 | decode_addr_const (exp, &value); | |
2185 | if (GET_CODE (value.base) == SYMBOL_REF) | |
2186 | { | |
2187 | /* Don't hash the address of the SYMBOL_REF; | |
2188 | only use the offset and the symbol name. */ | |
2189 | hi = value.offset; | |
2190 | p = XSTR (value.base, 0); | |
2191 | for (i = 0; p[i] != 0; i++) | |
2192 | hi = ((hi * 613) + (unsigned)(p[i])); | |
2193 | } | |
2194 | else if (GET_CODE (value.base) == LABEL_REF) | |
2195 | hi = value.offset + CODE_LABEL_NUMBER (XEXP (value.base, 0)) * 13; | |
2196 | ||
2197 | hi &= (1 << HASHBITS) - 1; | |
2198 | hi %= MAX_HASH_TABLE; | |
2199 | return hi; | |
2200 | } | |
2201 | else if (code == PLUS_EXPR || code == MINUS_EXPR) | |
2202 | return const_hash (TREE_OPERAND (exp, 0)) * 9 | |
2203 | + const_hash (TREE_OPERAND (exp, 1)); | |
2204 | else if (code == NOP_EXPR || code == CONVERT_EXPR) | |
2205 | return const_hash (TREE_OPERAND (exp, 0)) * 7 + 2; | |
2206 | ||
2207 | /* Compute hashing function */ | |
2208 | hi = len; | |
2209 | for (i = 0; i < len; i++) | |
2210 | hi = ((hi * 613) + (unsigned)(p[i])); | |
2211 | ||
2212 | hi &= (1 << HASHBITS) - 1; | |
2213 | hi %= MAX_HASH_TABLE; | |
2214 | return hi; | |
2215 | } | |
2216 | \f | |
2217 | /* Compare a constant expression EXP with a constant-descriptor DESC. | |
2218 | Return 1 if DESC describes a constant with the same value as EXP. */ | |
2219 | ||
2220 | static int | |
2221 | compare_constant (exp, desc) | |
2222 | tree exp; | |
2223 | struct constant_descriptor *desc; | |
2224 | { | |
2225 | return 0 != compare_constant_1 (exp, desc->contents); | |
2226 | } | |
2227 | ||
2228 | /* Compare constant expression EXP with a substring P of a constant descriptor. | |
2229 | If they match, return a pointer to the end of the substring matched. | |
2230 | If they do not match, return 0. | |
2231 | ||
2232 | Since descriptors are written in polish prefix notation, | |
2233 | this function can be used recursively to test one operand of EXP | |
2234 | against a subdescriptor, and if it succeeds it returns the | |
2235 | address of the subdescriptor for the next operand. */ | |
2236 | ||
2237 | static char * | |
2238 | compare_constant_1 (exp, p) | |
2239 | tree exp; | |
2240 | char *p; | |
2241 | { | |
2242 | register char *strp; | |
2243 | register int len; | |
2244 | register enum tree_code code = TREE_CODE (exp); | |
2245 | ||
2246 | if (code != (enum tree_code) *p++) | |
2247 | return 0; | |
2248 | ||
2249 | if (code == INTEGER_CST) | |
2250 | { | |
2251 | /* Integer constants are the same only if the same width of type. */ | |
2252 | if (*p++ != TYPE_PRECISION (TREE_TYPE (exp))) | |
2253 | return 0; | |
2254 | strp = (char *) &TREE_INT_CST_LOW (exp); | |
2255 | len = 2 * sizeof TREE_INT_CST_LOW (exp); | |
2256 | } | |
2257 | else if (code == REAL_CST) | |
2258 | { | |
2259 | /* Real constants are the same only if the same width of type. */ | |
2260 | if (*p++ != TYPE_PRECISION (TREE_TYPE (exp))) | |
2261 | return 0; | |
2262 | strp = (char *) &TREE_REAL_CST (exp); | |
2263 | len = sizeof TREE_REAL_CST (exp); | |
2264 | } | |
2265 | else if (code == STRING_CST) | |
2266 | { | |
2267 | if (flag_writable_strings) | |
2268 | return 0; | |
2269 | strp = TREE_STRING_POINTER (exp); | |
2270 | len = TREE_STRING_LENGTH (exp); | |
4c9a05bc | 2271 | if (bcmp ((char *) &TREE_STRING_LENGTH (exp), p, |
79e68feb RS |
2272 | sizeof TREE_STRING_LENGTH (exp))) |
2273 | return 0; | |
2274 | p += sizeof TREE_STRING_LENGTH (exp); | |
2275 | } | |
2276 | else if (code == COMPLEX_CST) | |
2277 | { | |
2278 | p = compare_constant_1 (TREE_REALPART (exp), p); | |
2279 | if (p == 0) return 0; | |
2280 | p = compare_constant_1 (TREE_IMAGPART (exp), p); | |
2281 | return p; | |
2282 | } | |
474bda6c PB |
2283 | else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) |
2284 | { | |
2285 | len = int_size_in_bytes (TREE_TYPE (exp)); | |
2286 | strp = (char*) alloca (len); | |
2287 | get_set_constructor_bytes (exp, (unsigned char *) strp, len); | |
2288 | } | |
79e68feb RS |
2289 | else if (code == CONSTRUCTOR) |
2290 | { | |
2291 | register tree link; | |
2292 | int length = list_length (CONSTRUCTOR_ELTS (exp)); | |
2293 | tree type; | |
2294 | ||
4c9a05bc | 2295 | if (bcmp ((char *) &length, p, sizeof length)) |
79e68feb RS |
2296 | return 0; |
2297 | p += sizeof length; | |
2298 | ||
2299 | /* For record constructors, insist that the types match. | |
2300 | For arrays, just verify both constructors are for arrays. */ | |
2301 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) | |
2302 | type = TREE_TYPE (exp); | |
2303 | else | |
2304 | type = 0; | |
4c9a05bc | 2305 | if (bcmp ((char *) &type, p, sizeof type)) |
79e68feb RS |
2306 | return 0; |
2307 | p += sizeof type; | |
2308 | ||
eb528802 RS |
2309 | /* For arrays, insist that the size in bytes match. */ |
2310 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) | |
2311 | { | |
2312 | int size = int_size_in_bytes (TREE_TYPE (exp)); | |
4c9a05bc | 2313 | if (bcmp ((char *) &size, p, sizeof size)) |
eb528802 RS |
2314 | return 0; |
2315 | p += sizeof size; | |
2316 | } | |
2317 | ||
79e68feb | 2318 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) |
77fa0940 RK |
2319 | { |
2320 | if (TREE_VALUE (link)) | |
2321 | { | |
2322 | if ((p = compare_constant_1 (TREE_VALUE (link), p)) == 0) | |
2323 | return 0; | |
2324 | } | |
2325 | else | |
2326 | { | |
2327 | tree zero = 0; | |
2328 | ||
4c9a05bc | 2329 | if (bcmp ((char *) &zero, p, sizeof zero)) |
77fa0940 RK |
2330 | return 0; |
2331 | p += sizeof zero; | |
2332 | } | |
2333 | } | |
2334 | ||
79e68feb RS |
2335 | return p; |
2336 | } | |
2337 | else if (code == ADDR_EXPR) | |
2338 | { | |
2339 | struct addr_const value; | |
2340 | decode_addr_const (exp, &value); | |
2341 | strp = (char *) &value.offset; | |
2342 | len = sizeof value.offset; | |
2343 | /* Compare the offset. */ | |
2344 | while (--len >= 0) | |
2345 | if (*p++ != *strp++) | |
2346 | return 0; | |
2347 | /* Compare symbol name. */ | |
2348 | strp = XSTR (value.base, 0); | |
2349 | len = strlen (strp) + 1; | |
2350 | } | |
2351 | else if (code == PLUS_EXPR || code == MINUS_EXPR) | |
2352 | { | |
2353 | p = compare_constant_1 (TREE_OPERAND (exp, 0), p); | |
2354 | if (p == 0) return 0; | |
2355 | p = compare_constant_1 (TREE_OPERAND (exp, 1), p); | |
2356 | return p; | |
2357 | } | |
2358 | else if (code == NOP_EXPR || code == CONVERT_EXPR) | |
2359 | { | |
2360 | p = compare_constant_1 (TREE_OPERAND (exp, 0), p); | |
2361 | return p; | |
2362 | } | |
2363 | ||
2364 | /* Compare constant contents. */ | |
2365 | while (--len >= 0) | |
2366 | if (*p++ != *strp++) | |
2367 | return 0; | |
2368 | ||
2369 | return p; | |
2370 | } | |
2371 | \f | |
2372 | /* Construct a constant descriptor for the expression EXP. | |
2373 | It is up to the caller to enter the descriptor in the hash table. */ | |
2374 | ||
2375 | static struct constant_descriptor * | |
2376 | record_constant (exp) | |
2377 | tree exp; | |
2378 | { | |
387e854a RK |
2379 | struct constant_descriptor *next = 0; |
2380 | char *label = 0; | |
79e68feb | 2381 | |
387e854a RK |
2382 | /* Make a struct constant_descriptor. The first two pointers will |
2383 | be filled in later. Here we just leave space for them. */ | |
2384 | ||
2385 | obstack_grow (&permanent_obstack, (char *) &next, sizeof next); | |
2386 | obstack_grow (&permanent_obstack, (char *) &label, sizeof label); | |
79e68feb RS |
2387 | record_constant_1 (exp); |
2388 | return (struct constant_descriptor *) obstack_finish (&permanent_obstack); | |
2389 | } | |
2390 | ||
2391 | /* Add a description of constant expression EXP | |
2392 | to the object growing in `permanent_obstack'. | |
2393 | No need to return its address; the caller will get that | |
2394 | from the obstack when the object is complete. */ | |
2395 | ||
2396 | static void | |
2397 | record_constant_1 (exp) | |
2398 | tree exp; | |
2399 | { | |
2400 | register char *strp; | |
2401 | register int len; | |
2402 | register enum tree_code code = TREE_CODE (exp); | |
2403 | ||
2404 | obstack_1grow (&permanent_obstack, (unsigned int) code); | |
2405 | ||
2406 | if (code == INTEGER_CST) | |
2407 | { | |
2408 | obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp))); | |
2409 | strp = (char *) &TREE_INT_CST_LOW (exp); | |
2410 | len = 2 * sizeof TREE_INT_CST_LOW (exp); | |
2411 | } | |
2412 | else if (code == REAL_CST) | |
2413 | { | |
2414 | obstack_1grow (&permanent_obstack, TYPE_PRECISION (TREE_TYPE (exp))); | |
2415 | strp = (char *) &TREE_REAL_CST (exp); | |
2416 | len = sizeof TREE_REAL_CST (exp); | |
2417 | } | |
2418 | else if (code == STRING_CST) | |
2419 | { | |
2420 | if (flag_writable_strings) | |
2421 | return; | |
2422 | strp = TREE_STRING_POINTER (exp); | |
2423 | len = TREE_STRING_LENGTH (exp); | |
2424 | obstack_grow (&permanent_obstack, (char *) &TREE_STRING_LENGTH (exp), | |
2425 | sizeof TREE_STRING_LENGTH (exp)); | |
2426 | } | |
2427 | else if (code == COMPLEX_CST) | |
2428 | { | |
2429 | record_constant_1 (TREE_REALPART (exp)); | |
2430 | record_constant_1 (TREE_IMAGPART (exp)); | |
2431 | return; | |
2432 | } | |
474bda6c PB |
2433 | else if (code == CONSTRUCTOR && TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) |
2434 | { | |
2435 | int nbytes = int_size_in_bytes (TREE_TYPE (exp)); | |
2436 | obstack_grow (&permanent_obstack, &nbytes, sizeof (nbytes)); | |
2437 | obstack_blank (&permanent_obstack, nbytes); | |
2438 | get_set_constructor_bytes (exp, | |
2439 | (unsigned char *) permanent_obstack.next_free, | |
2440 | nbytes); | |
2441 | return; | |
2442 | } | |
79e68feb RS |
2443 | else if (code == CONSTRUCTOR) |
2444 | { | |
2445 | register tree link; | |
2446 | int length = list_length (CONSTRUCTOR_ELTS (exp)); | |
2447 | tree type; | |
2448 | ||
2449 | obstack_grow (&permanent_obstack, (char *) &length, sizeof length); | |
2450 | ||
2451 | /* For record constructors, insist that the types match. | |
2452 | For arrays, just verify both constructors are for arrays. */ | |
2453 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) | |
2454 | type = TREE_TYPE (exp); | |
2455 | else | |
2456 | type = 0; | |
2457 | obstack_grow (&permanent_obstack, (char *) &type, sizeof type); | |
2458 | ||
eb528802 RS |
2459 | /* For arrays, insist that the size in bytes match. */ |
2460 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) | |
2461 | { | |
2462 | int size = int_size_in_bytes (TREE_TYPE (exp)); | |
2463 | obstack_grow (&permanent_obstack, (char *) &size, sizeof size); | |
2464 | } | |
2465 | ||
79e68feb | 2466 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) |
77fa0940 RK |
2467 | { |
2468 | if (TREE_VALUE (link)) | |
2469 | record_constant_1 (TREE_VALUE (link)); | |
2470 | else | |
2471 | { | |
2472 | tree zero = 0; | |
2473 | ||
2474 | obstack_grow (&permanent_obstack, (char *) &zero, sizeof zero); | |
2475 | } | |
2476 | } | |
2477 | ||
79e68feb RS |
2478 | return; |
2479 | } | |
2480 | else if (code == ADDR_EXPR) | |
2481 | { | |
2482 | struct addr_const value; | |
2483 | decode_addr_const (exp, &value); | |
2484 | /* Record the offset. */ | |
2485 | obstack_grow (&permanent_obstack, | |
2486 | (char *) &value.offset, sizeof value.offset); | |
2487 | /* Record the symbol name. */ | |
2488 | obstack_grow (&permanent_obstack, XSTR (value.base, 0), | |
2489 | strlen (XSTR (value.base, 0)) + 1); | |
2490 | return; | |
2491 | } | |
2492 | else if (code == PLUS_EXPR || code == MINUS_EXPR) | |
2493 | { | |
2494 | record_constant_1 (TREE_OPERAND (exp, 0)); | |
2495 | record_constant_1 (TREE_OPERAND (exp, 1)); | |
2496 | return; | |
2497 | } | |
2498 | else if (code == NOP_EXPR || code == CONVERT_EXPR) | |
2499 | { | |
2500 | record_constant_1 (TREE_OPERAND (exp, 0)); | |
2501 | return; | |
2502 | } | |
2503 | ||
2504 | /* Record constant contents. */ | |
2505 | obstack_grow (&permanent_obstack, strp, len); | |
2506 | } | |
2507 | \f | |
ff8f4401 RS |
2508 | /* Record a list of constant expressions that were passed to |
2509 | output_constant_def but that could not be output right away. */ | |
2510 | ||
2511 | struct deferred_constant | |
2512 | { | |
2513 | struct deferred_constant *next; | |
2514 | tree exp; | |
2515 | int reloc; | |
2516 | int labelno; | |
2517 | }; | |
2518 | ||
2519 | static struct deferred_constant *deferred_constants; | |
2520 | ||
2521 | /* Nonzero means defer output of addressed subconstants | |
2522 | (i.e., those for which output_constant_def is called.) */ | |
2523 | static int defer_addressed_constants_flag; | |
2524 | ||
2525 | /* Start deferring output of subconstants. */ | |
2526 | ||
2527 | void | |
2528 | defer_addressed_constants () | |
2529 | { | |
2530 | defer_addressed_constants_flag++; | |
2531 | } | |
2532 | ||
2533 | /* Stop deferring output of subconstants, | |
2534 | and output now all those that have been deferred. */ | |
2535 | ||
2536 | void | |
2537 | output_deferred_addressed_constants () | |
2538 | { | |
2539 | struct deferred_constant *p, *next; | |
2540 | ||
2541 | defer_addressed_constants_flag--; | |
2542 | ||
2543 | if (defer_addressed_constants_flag > 0) | |
2544 | return; | |
2545 | ||
2546 | for (p = deferred_constants; p; p = next) | |
2547 | { | |
2548 | output_constant_def_contents (p->exp, p->reloc, p->labelno); | |
2549 | next = p->next; | |
2550 | free (p); | |
2551 | } | |
2552 | ||
2553 | deferred_constants = 0; | |
2554 | } | |
d12516f1 RS |
2555 | |
2556 | /* Make a copy of the whole tree structure for a constant. | |
2557 | This handles the same types of nodes that compare_constant | |
2558 | and record_constant handle. */ | |
2559 | ||
2560 | static tree | |
2561 | copy_constant (exp) | |
2562 | tree exp; | |
2563 | { | |
2564 | switch (TREE_CODE (exp)) | |
2565 | { | |
2566 | case INTEGER_CST: | |
2567 | case REAL_CST: | |
2568 | case STRING_CST: | |
2569 | case ADDR_EXPR: | |
2570 | /* For ADDR_EXPR, we do not want to copy the decl | |
2571 | whose address is requested. */ | |
2572 | return copy_node (exp); | |
2573 | ||
2574 | case COMPLEX_CST: | |
2575 | return build_complex (copy_constant (TREE_REALPART (exp)), | |
2576 | copy_constant (TREE_IMAGPART (exp))); | |
2577 | ||
2578 | case PLUS_EXPR: | |
2579 | case MINUS_EXPR: | |
2580 | return build (TREE_CODE (exp), TREE_TYPE (exp), | |
2581 | copy_constant (TREE_OPERAND (exp, 0)), | |
2582 | copy_constant (TREE_OPERAND (exp, 1))); | |
2583 | ||
2584 | case NOP_EXPR: | |
2585 | case CONVERT_EXPR: | |
2586 | return build1 (TREE_CODE (exp), TREE_TYPE (exp), | |
2587 | copy_constant (TREE_OPERAND (exp, 0))); | |
2588 | ||
2589 | case CONSTRUCTOR: | |
2590 | { | |
2591 | tree copy = copy_node (exp); | |
2592 | tree list = copy_list (CONSTRUCTOR_ELTS (exp)); | |
2593 | tree tail; | |
2594 | ||
bb31ce0a | 2595 | CONSTRUCTOR_ELTS (copy) = list; |
d12516f1 RS |
2596 | for (tail = list; tail; tail = TREE_CHAIN (tail)) |
2597 | TREE_VALUE (tail) = copy_constant (TREE_VALUE (tail)); | |
474bda6c PB |
2598 | if (TREE_CODE (TREE_TYPE (exp)) == SET_TYPE) |
2599 | for (tail = list; tail; tail = TREE_CHAIN (tail)) | |
2600 | TREE_PURPOSE (tail) = copy_constant (TREE_PURPOSE (tail)); | |
d12516f1 RS |
2601 | |
2602 | return copy; | |
2603 | } | |
2604 | ||
2605 | default: | |
2606 | abort (); | |
2607 | } | |
2608 | } | |
ff8f4401 | 2609 | \f |
79e68feb RS |
2610 | /* Return an rtx representing a reference to constant data in memory |
2611 | for the constant expression EXP. | |
ff8f4401 | 2612 | |
79e68feb RS |
2613 | If assembler code for such a constant has already been output, |
2614 | return an rtx to refer to it. | |
ff8f4401 RS |
2615 | Otherwise, output such a constant in memory (or defer it for later) |
2616 | and generate an rtx for it. | |
2617 | ||
2618 | The TREE_CST_RTL of EXP is set up to point to that rtx. | |
79e68feb RS |
2619 | The const_hash_table records which constants already have label strings. */ |
2620 | ||
2621 | rtx | |
2622 | output_constant_def (exp) | |
2623 | tree exp; | |
2624 | { | |
ff8f4401 | 2625 | register int hash; |
79e68feb RS |
2626 | register struct constant_descriptor *desc; |
2627 | char label[256]; | |
2628 | char *found = 0; | |
2629 | int reloc; | |
2630 | register rtx def; | |
2631 | ||
2632 | if (TREE_CODE (exp) == INTEGER_CST) | |
2633 | abort (); /* No TREE_CST_RTL slot in these. */ | |
2634 | ||
2635 | if (TREE_CST_RTL (exp)) | |
2636 | return TREE_CST_RTL (exp); | |
2637 | ||
2638 | /* Make sure any other constants whose addresses appear in EXP | |
2639 | are assigned label numbers. */ | |
2640 | ||
2641 | reloc = output_addressed_constants (exp); | |
2642 | ||
2643 | /* Compute hash code of EXP. Search the descriptors for that hash code | |
2644 | to see if any of them describes EXP. If yes, the descriptor records | |
2645 | the label number already assigned. */ | |
2646 | ||
00f07fb9 | 2647 | hash = const_hash (exp) % MAX_HASH_TABLE; |
ca695ac9 | 2648 | |
00f07fb9 RK |
2649 | for (desc = const_hash_table[hash]; desc; desc = desc->next) |
2650 | if (compare_constant (exp, desc)) | |
2651 | { | |
2652 | found = desc->label; | |
2653 | break; | |
2654 | } | |
ca695ac9 | 2655 | |
00f07fb9 RK |
2656 | if (found == 0) |
2657 | { | |
2658 | /* No constant equal to EXP is known to have been output. | |
2659 | Make a constant descriptor to enter EXP in the hash table. | |
2660 | Assign the label number and record it in the descriptor for | |
2661 | future calls to this function to find. */ | |
ca695ac9 | 2662 | |
00f07fb9 RK |
2663 | /* Create a string containing the label name, in LABEL. */ |
2664 | ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno); | |
2665 | ||
2666 | desc = record_constant (exp); | |
2667 | desc->next = const_hash_table[hash]; | |
2668 | desc->label | |
2669 | = (char *) obstack_copy0 (&permanent_obstack, label, strlen (label)); | |
2670 | const_hash_table[hash] = desc; | |
2671 | } | |
2672 | else | |
2673 | { | |
2674 | /* Create a string containing the label name, in LABEL. */ | |
2675 | ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno); | |
79e68feb | 2676 | } |
ca695ac9 | 2677 | |
79e68feb RS |
2678 | /* We have a symbol name; construct the SYMBOL_REF and the MEM. */ |
2679 | ||
2680 | push_obstacks_nochange (); | |
2681 | if (TREE_PERMANENT (exp)) | |
2682 | end_temporary_allocation (); | |
2683 | ||
00f07fb9 | 2684 | def = gen_rtx (SYMBOL_REF, Pmode, desc->label); |
ca695ac9 | 2685 | |
00f07fb9 RK |
2686 | TREE_CST_RTL (exp) |
2687 | = gen_rtx (MEM, TYPE_MODE (TREE_TYPE (exp)), def); | |
2688 | RTX_UNCHANGING_P (TREE_CST_RTL (exp)) = 1; | |
05e3bdb9 | 2689 | if (AGGREGATE_TYPE_P (TREE_TYPE (exp))) |
00f07fb9 RK |
2690 | MEM_IN_STRUCT_P (TREE_CST_RTL (exp)) = 1; |
2691 | ||
79e68feb RS |
2692 | pop_obstacks (); |
2693 | ||
2694 | /* Optionally set flags or add text to the name to record information | |
2695 | such as that it is a function name. If the name is changed, the macro | |
8a425a05 | 2696 | ASM_OUTPUT_LABELREF will have to know how to strip this information. */ |
79e68feb RS |
2697 | #ifdef ENCODE_SECTION_INFO |
2698 | ENCODE_SECTION_INFO (exp); | |
2699 | #endif | |
2700 | ||
ff8f4401 RS |
2701 | /* If this is the first time we've seen this particular constant, |
2702 | output it (or defer its output for later). */ | |
79e68feb RS |
2703 | if (found == 0) |
2704 | { | |
ff8f4401 RS |
2705 | if (defer_addressed_constants_flag) |
2706 | { | |
2707 | struct deferred_constant *p; | |
2708 | p = (struct deferred_constant *) xmalloc (sizeof (struct deferred_constant)); | |
2709 | ||
ff8f4401 RS |
2710 | push_obstacks_nochange (); |
2711 | suspend_momentary (); | |
d12516f1 | 2712 | p->exp = copy_constant (exp); |
ff8f4401 RS |
2713 | pop_obstacks (); |
2714 | p->reloc = reloc; | |
2715 | p->labelno = const_labelno++; | |
2716 | p->next = deferred_constants; | |
2717 | deferred_constants = p; | |
2718 | } | |
2719 | else | |
2720 | output_constant_def_contents (exp, reloc, const_labelno++); | |
2721 | } | |
2722 | ||
2723 | return TREE_CST_RTL (exp); | |
2724 | } | |
2725 | ||
2726 | /* Now output assembler code to define the label for EXP, | |
2727 | and follow it with the data of EXP. */ | |
79e68feb | 2728 | |
ff8f4401 RS |
2729 | static void |
2730 | output_constant_def_contents (exp, reloc, labelno) | |
2731 | tree exp; | |
2732 | int reloc; | |
2733 | int labelno; | |
2734 | { | |
2735 | int align; | |
2736 | ||
8a425a05 | 2737 | if (IN_NAMED_SECTION (exp)) |
2ffe831c | 2738 | named_section (exp, NULL); |
8a425a05 DE |
2739 | else |
2740 | { | |
2741 | /* First switch to text section, except for writable strings. */ | |
79e68feb | 2742 | #ifdef SELECT_SECTION |
8a425a05 | 2743 | SELECT_SECTION (exp, reloc); |
79e68feb | 2744 | #else |
8a425a05 DE |
2745 | if (((TREE_CODE (exp) == STRING_CST) && flag_writable_strings) |
2746 | || (flag_pic && reloc)) | |
2747 | data_section (); | |
2748 | else | |
2749 | readonly_data_section (); | |
79e68feb | 2750 | #endif |
8a425a05 | 2751 | } |
79e68feb | 2752 | |
ff8f4401 RS |
2753 | /* Align the location counter as required by EXP's data type. */ |
2754 | align = TYPE_ALIGN (TREE_TYPE (exp)); | |
79e68feb | 2755 | #ifdef CONSTANT_ALIGNMENT |
ff8f4401 | 2756 | align = CONSTANT_ALIGNMENT (exp, align); |
79e68feb RS |
2757 | #endif |
2758 | ||
ff8f4401 | 2759 | if (align > BITS_PER_UNIT) |
ca695ac9 JB |
2760 | { |
2761 | if (!output_bytecode) | |
c02bd5d9 JB |
2762 | { |
2763 | ASM_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
2764 | } | |
ca695ac9 | 2765 | else |
c02bd5d9 JB |
2766 | { |
2767 | BC_OUTPUT_ALIGN (asm_out_file, floor_log2 (align / BITS_PER_UNIT)); | |
2768 | } | |
ca695ac9 | 2769 | } |
79e68feb | 2770 | |
ff8f4401 RS |
2771 | /* Output the label itself. */ |
2772 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", labelno); | |
79e68feb | 2773 | |
ff8f4401 RS |
2774 | /* Output the value of EXP. */ |
2775 | output_constant (exp, | |
2776 | (TREE_CODE (exp) == STRING_CST | |
2777 | ? TREE_STRING_LENGTH (exp) | |
2778 | : int_size_in_bytes (TREE_TYPE (exp)))); | |
79e68feb | 2779 | |
79e68feb RS |
2780 | } |
2781 | \f | |
2782 | /* Similar hash facility for making memory-constants | |
2783 | from constant rtl-expressions. It is used on RISC machines | |
2784 | where immediate integer arguments and constant addresses are restricted | |
2785 | so that such constants must be stored in memory. | |
2786 | ||
2787 | This pool of constants is reinitialized for each function | |
2788 | so each function gets its own constants-pool that comes right before it. | |
2789 | ||
2790 | All structures allocated here are discarded when functions are saved for | |
2791 | inlining, so they do not need to be allocated permanently. */ | |
2792 | ||
2793 | #define MAX_RTX_HASH_TABLE 61 | |
57632c51 | 2794 | static struct constant_descriptor **const_rtx_hash_table; |
79e68feb RS |
2795 | |
2796 | /* Structure to represent sufficient information about a constant so that | |
2797 | it can be output when the constant pool is output, so that function | |
2798 | integration can be done, and to simplify handling on machines that reference | |
2799 | constant pool as base+displacement. */ | |
2800 | ||
2801 | struct pool_constant | |
2802 | { | |
2803 | struct constant_descriptor *desc; | |
2804 | struct pool_constant *next; | |
2805 | enum machine_mode mode; | |
2806 | rtx constant; | |
2807 | int labelno; | |
2808 | int align; | |
2809 | int offset; | |
2810 | }; | |
2811 | ||
2812 | /* Pointers to first and last constant in pool. */ | |
2813 | ||
2814 | static struct pool_constant *first_pool, *last_pool; | |
2815 | ||
2816 | /* Current offset in constant pool (does not include any machine-specific | |
2817 | header. */ | |
2818 | ||
2819 | static int pool_offset; | |
2820 | ||
2821 | /* Structure used to maintain hash table mapping symbols used to their | |
2822 | corresponding constants. */ | |
2823 | ||
2824 | struct pool_sym | |
2825 | { | |
2826 | char *label; | |
2827 | struct pool_constant *pool; | |
2828 | struct pool_sym *next; | |
2829 | }; | |
2830 | ||
57632c51 | 2831 | static struct pool_sym **const_rtx_sym_hash_table; |
79e68feb RS |
2832 | |
2833 | /* Hash code for a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true. | |
2834 | The argument is XSTR (... , 0) */ | |
2835 | ||
2836 | #define SYMHASH(LABEL) \ | |
fb351073 | 2837 | ((((HOST_WIDE_INT) (LABEL)) & ((1 << HASHBITS) - 1)) % MAX_RTX_HASH_TABLE) |
79e68feb RS |
2838 | \f |
2839 | /* Initialize constant pool hashing for next function. */ | |
2840 | ||
2841 | void | |
2842 | init_const_rtx_hash_table () | |
2843 | { | |
57632c51 RS |
2844 | const_rtx_hash_table |
2845 | = ((struct constant_descriptor **) | |
2846 | oballoc (MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *))); | |
2847 | const_rtx_sym_hash_table | |
2848 | = ((struct pool_sym **) | |
2849 | oballoc (MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *))); | |
4c9a05bc | 2850 | bzero ((char *) const_rtx_hash_table, |
57632c51 | 2851 | MAX_RTX_HASH_TABLE * sizeof (struct constant_descriptor *)); |
4c9a05bc | 2852 | bzero ((char *) const_rtx_sym_hash_table, |
57632c51 | 2853 | MAX_RTX_HASH_TABLE * sizeof (struct pool_sym *)); |
79e68feb RS |
2854 | |
2855 | first_pool = last_pool = 0; | |
2856 | pool_offset = 0; | |
2857 | } | |
2858 | ||
5a13eaa4 | 2859 | /* Save and restore status for a nested function. */ |
57632c51 RS |
2860 | |
2861 | void | |
2862 | save_varasm_status (p) | |
2863 | struct function *p; | |
2864 | { | |
2865 | p->const_rtx_hash_table = const_rtx_hash_table; | |
2866 | p->const_rtx_sym_hash_table = const_rtx_sym_hash_table; | |
2867 | p->first_pool = first_pool; | |
2868 | p->last_pool = last_pool; | |
2869 | p->pool_offset = pool_offset; | |
2870 | } | |
2871 | ||
2872 | void | |
2873 | restore_varasm_status (p) | |
2874 | struct function *p; | |
2875 | { | |
2876 | const_rtx_hash_table = p->const_rtx_hash_table; | |
2877 | const_rtx_sym_hash_table = p->const_rtx_sym_hash_table; | |
2878 | first_pool = p->first_pool; | |
2879 | last_pool = p->last_pool; | |
2880 | pool_offset = p->pool_offset; | |
2881 | } | |
2882 | \f | |
79e68feb RS |
2883 | enum kind { RTX_DOUBLE, RTX_INT }; |
2884 | ||
2885 | struct rtx_const | |
2886 | { | |
2887 | #ifdef ONLY_INT_FIELDS | |
2888 | unsigned int kind : 16; | |
2889 | unsigned int mode : 16; | |
2890 | #else | |
2891 | enum kind kind : 16; | |
2892 | enum machine_mode mode : 16; | |
2893 | #endif | |
2894 | union { | |
2895 | union real_extract du; | |
2896 | struct addr_const addr; | |
2897 | } un; | |
2898 | }; | |
2899 | ||
2900 | /* Express an rtx for a constant integer (perhaps symbolic) | |
2901 | as the sum of a symbol or label plus an explicit integer. | |
2902 | They are stored into VALUE. */ | |
2903 | ||
2904 | static void | |
2905 | decode_rtx_const (mode, x, value) | |
2906 | enum machine_mode mode; | |
2907 | rtx x; | |
2908 | struct rtx_const *value; | |
2909 | { | |
2910 | /* Clear the whole structure, including any gaps. */ | |
2911 | ||
2912 | { | |
2913 | int *p = (int *) value; | |
2914 | int *end = (int *) (value + 1); | |
2915 | while (p < end) | |
2916 | *p++ = 0; | |
2917 | } | |
2918 | ||
2919 | value->kind = RTX_INT; /* Most usual kind. */ | |
2920 | value->mode = mode; | |
2921 | ||
2922 | switch (GET_CODE (x)) | |
2923 | { | |
2924 | case CONST_DOUBLE: | |
2925 | value->kind = RTX_DOUBLE; | |
56e2d435 RK |
2926 | if (GET_MODE (x) != VOIDmode) |
2927 | value->mode = GET_MODE (x); | |
4c9a05bc RK |
2928 | bcopy ((char *) &CONST_DOUBLE_LOW (x), |
2929 | (char *) &value->un.du, sizeof value->un.du); | |
79e68feb RS |
2930 | break; |
2931 | ||
2932 | case CONST_INT: | |
2933 | value->un.addr.offset = INTVAL (x); | |
2934 | break; | |
2935 | ||
2936 | case SYMBOL_REF: | |
2937 | case LABEL_REF: | |
3d037392 | 2938 | case PC: |
79e68feb RS |
2939 | value->un.addr.base = x; |
2940 | break; | |
2941 | ||
2942 | case CONST: | |
2943 | x = XEXP (x, 0); | |
2944 | if (GET_CODE (x) == PLUS) | |
2945 | { | |
2946 | value->un.addr.base = XEXP (x, 0); | |
2947 | if (GET_CODE (XEXP (x, 1)) != CONST_INT) | |
2948 | abort (); | |
2949 | value->un.addr.offset = INTVAL (XEXP (x, 1)); | |
2950 | } | |
2951 | else if (GET_CODE (x) == MINUS) | |
2952 | { | |
2953 | value->un.addr.base = XEXP (x, 0); | |
2954 | if (GET_CODE (XEXP (x, 1)) != CONST_INT) | |
2955 | abort (); | |
2956 | value->un.addr.offset = - INTVAL (XEXP (x, 1)); | |
2957 | } | |
2958 | else | |
2959 | abort (); | |
2960 | break; | |
2961 | ||
2962 | default: | |
2963 | abort (); | |
2964 | } | |
2965 | ||
2966 | if (value->kind == RTX_INT && value->un.addr.base != 0) | |
2967 | switch (GET_CODE (value->un.addr.base)) | |
2968 | { | |
2969 | case SYMBOL_REF: | |
2970 | case LABEL_REF: | |
2971 | /* Use the string's address, not the SYMBOL_REF's address, | |
2972 | for the sake of addresses of library routines. | |
2973 | For a LABEL_REF, compare labels. */ | |
2974 | value->un.addr.base = XEXP (value->un.addr.base, 0); | |
2975 | } | |
2976 | } | |
2977 | ||
57632c51 RS |
2978 | /* Given a MINUS expression, simplify it if both sides |
2979 | include the same symbol. */ | |
2980 | ||
2981 | rtx | |
2982 | simplify_subtraction (x) | |
2983 | rtx x; | |
2984 | { | |
2985 | struct rtx_const val0, val1; | |
2986 | ||
2987 | decode_rtx_const (GET_MODE (x), XEXP (x, 0), &val0); | |
2988 | decode_rtx_const (GET_MODE (x), XEXP (x, 1), &val1); | |
2989 | ||
2990 | if (val0.un.addr.base == val1.un.addr.base) | |
2991 | return GEN_INT (val0.un.addr.offset - val1.un.addr.offset); | |
2992 | return x; | |
2993 | } | |
2994 | ||
79e68feb RS |
2995 | /* Compute a hash code for a constant RTL expression. */ |
2996 | ||
5a13eaa4 | 2997 | static int |
79e68feb RS |
2998 | const_hash_rtx (mode, x) |
2999 | enum machine_mode mode; | |
3000 | rtx x; | |
3001 | { | |
3002 | register int hi, i; | |
3003 | ||
3004 | struct rtx_const value; | |
3005 | decode_rtx_const (mode, x, &value); | |
3006 | ||
3007 | /* Compute hashing function */ | |
3008 | hi = 0; | |
3009 | for (i = 0; i < sizeof value / sizeof (int); i++) | |
3010 | hi += ((int *) &value)[i]; | |
3011 | ||
3012 | hi &= (1 << HASHBITS) - 1; | |
3013 | hi %= MAX_RTX_HASH_TABLE; | |
3014 | return hi; | |
3015 | } | |
3016 | ||
3017 | /* Compare a constant rtl object X with a constant-descriptor DESC. | |
3018 | Return 1 if DESC describes a constant with the same value as X. */ | |
3019 | ||
3020 | static int | |
3021 | compare_constant_rtx (mode, x, desc) | |
3022 | enum machine_mode mode; | |
3023 | rtx x; | |
3024 | struct constant_descriptor *desc; | |
3025 | { | |
3026 | register int *p = (int *) desc->contents; | |
3027 | register int *strp; | |
3028 | register int len; | |
3029 | struct rtx_const value; | |
3030 | ||
3031 | decode_rtx_const (mode, x, &value); | |
3032 | strp = (int *) &value; | |
3033 | len = sizeof value / sizeof (int); | |
3034 | ||
3035 | /* Compare constant contents. */ | |
3036 | while (--len >= 0) | |
3037 | if (*p++ != *strp++) | |
3038 | return 0; | |
3039 | ||
3040 | return 1; | |
3041 | } | |
3042 | ||
3043 | /* Construct a constant descriptor for the rtl-expression X. | |
3044 | It is up to the caller to enter the descriptor in the hash table. */ | |
3045 | ||
3046 | static struct constant_descriptor * | |
3047 | record_constant_rtx (mode, x) | |
3048 | enum machine_mode mode; | |
3049 | rtx x; | |
3050 | { | |
3051 | struct constant_descriptor *ptr; | |
3052 | char *label; | |
3053 | struct rtx_const value; | |
3054 | ||
3055 | decode_rtx_const (mode, x, &value); | |
3056 | ||
75974726 RK |
3057 | /* Put these things in the saveable obstack so we can ensure it won't |
3058 | be freed if we are called from combine or some other phase that discards | |
3059 | memory allocated from function_obstack (current_obstack). */ | |
3060 | obstack_grow (saveable_obstack, &ptr, sizeof ptr); | |
3061 | obstack_grow (saveable_obstack, &label, sizeof label); | |
79e68feb RS |
3062 | |
3063 | /* Record constant contents. */ | |
75974726 | 3064 | obstack_grow (saveable_obstack, &value, sizeof value); |
79e68feb | 3065 | |
75974726 | 3066 | return (struct constant_descriptor *) obstack_finish (saveable_obstack); |
79e68feb RS |
3067 | } |
3068 | \f | |
3069 | /* Given a constant rtx X, make (or find) a memory constant for its value | |
3070 | and return a MEM rtx to refer to it in memory. */ | |
3071 | ||
3072 | rtx | |
3073 | force_const_mem (mode, x) | |
3074 | enum machine_mode mode; | |
3075 | rtx x; | |
3076 | { | |
3077 | register int hash; | |
3078 | register struct constant_descriptor *desc; | |
3079 | char label[256]; | |
3080 | char *found = 0; | |
3081 | rtx def; | |
3082 | ||
3083 | /* If we want this CONST_DOUBLE in the same mode as it is in memory | |
3084 | (this will always be true for floating CONST_DOUBLEs that have been | |
3085 | placed in memory, but not for VOIDmode (integer) CONST_DOUBLEs), | |
3086 | use the previous copy. Otherwise, make a new one. Note that in | |
3087 | the unlikely event that this same CONST_DOUBLE is used in two different | |
3088 | modes in an alternating fashion, we will allocate a lot of different | |
3089 | memory locations, but this should be extremely rare. */ | |
3090 | ||
57632c51 RS |
3091 | /* Don't use CONST_DOUBLE_MEM in a nested function. |
3092 | Nested functions have their own constant pools, | |
3093 | so they can't share the same values in CONST_DOUBLE_MEM | |
3094 | with the containing function. */ | |
3095 | if (outer_function_chain == 0) | |
3096 | if (GET_CODE (x) == CONST_DOUBLE | |
3097 | && GET_CODE (CONST_DOUBLE_MEM (x)) == MEM | |
3098 | && GET_MODE (CONST_DOUBLE_MEM (x)) == mode) | |
3099 | return CONST_DOUBLE_MEM (x); | |
79e68feb RS |
3100 | |
3101 | /* Compute hash code of X. Search the descriptors for that hash code | |
3102 | to see if any of them describes X. If yes, the descriptor records | |
3103 | the label number already assigned. */ | |
3104 | ||
3105 | hash = const_hash_rtx (mode, x); | |
3106 | ||
3107 | for (desc = const_rtx_hash_table[hash]; desc; desc = desc->next) | |
3108 | if (compare_constant_rtx (mode, x, desc)) | |
3109 | { | |
3110 | found = desc->label; | |
3111 | break; | |
3112 | } | |
3113 | ||
3114 | if (found == 0) | |
3115 | { | |
3116 | register struct pool_constant *pool; | |
3117 | register struct pool_sym *sym; | |
3118 | int align; | |
3119 | ||
3120 | /* No constant equal to X is known to have been output. | |
3121 | Make a constant descriptor to enter X in the hash table. | |
3122 | Assign the label number and record it in the descriptor for | |
3123 | future calls to this function to find. */ | |
3124 | ||
3125 | desc = record_constant_rtx (mode, x); | |
3126 | desc->next = const_rtx_hash_table[hash]; | |
3127 | const_rtx_hash_table[hash] = desc; | |
3128 | ||
3129 | /* Align the location counter as required by EXP's data type. */ | |
3130 | align = (mode == VOIDmode) ? UNITS_PER_WORD : GET_MODE_SIZE (mode); | |
3131 | if (align > BIGGEST_ALIGNMENT / BITS_PER_UNIT) | |
3132 | align = BIGGEST_ALIGNMENT / BITS_PER_UNIT; | |
3133 | ||
3134 | pool_offset += align - 1; | |
3135 | pool_offset &= ~ (align - 1); | |
3136 | ||
75974726 RK |
3137 | /* If RTL is not being placed into the saveable obstack, make a |
3138 | copy of X that is in the saveable obstack in case we are being | |
3139 | called from combine or some other phase that discards memory | |
3140 | it allocates. We need only do this if it is a CONST, since | |
3141 | no other RTX should be allocated in this situation. */ | |
3142 | if (rtl_obstack != saveable_obstack | |
3143 | && GET_CODE (x) == CONST) | |
3144 | { | |
3145 | push_obstacks_nochange (); | |
3146 | rtl_in_saveable_obstack (); | |
3147 | ||
3148 | x = gen_rtx (CONST, GET_MODE (x), | |
3149 | gen_rtx (PLUS, GET_MODE (x), | |
3150 | XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 0), 1))); | |
3151 | pop_obstacks (); | |
3152 | } | |
3153 | ||
79e68feb RS |
3154 | /* Allocate a pool constant descriptor, fill it in, and chain it in. */ |
3155 | ||
75974726 | 3156 | pool = (struct pool_constant *) savealloc (sizeof (struct pool_constant)); |
79e68feb RS |
3157 | pool->desc = desc; |
3158 | pool->constant = x; | |
3159 | pool->mode = mode; | |
3160 | pool->labelno = const_labelno; | |
3161 | pool->align = align; | |
3162 | pool->offset = pool_offset; | |
3163 | pool->next = 0; | |
3164 | ||
3165 | if (last_pool == 0) | |
3166 | first_pool = pool; | |
3167 | else | |
3168 | last_pool->next = pool; | |
3169 | ||
3170 | last_pool = pool; | |
3171 | pool_offset += GET_MODE_SIZE (mode); | |
3172 | ||
3173 | /* Create a string containing the label name, in LABEL. */ | |
3174 | ASM_GENERATE_INTERNAL_LABEL (label, "LC", const_labelno); | |
3175 | ||
3176 | ++const_labelno; | |
3177 | ||
3178 | desc->label = found | |
3179 | = (char *) obstack_copy0 (saveable_obstack, label, strlen (label)); | |
3180 | ||
3181 | /* Add label to symbol hash table. */ | |
3182 | hash = SYMHASH (found); | |
75974726 | 3183 | sym = (struct pool_sym *) savealloc (sizeof (struct pool_sym)); |
79e68feb RS |
3184 | sym->label = found; |
3185 | sym->pool = pool; | |
3186 | sym->next = const_rtx_sym_hash_table[hash]; | |
3187 | const_rtx_sym_hash_table[hash] = sym; | |
3188 | } | |
3189 | ||
3190 | /* We have a symbol name; construct the SYMBOL_REF and the MEM. */ | |
3191 | ||
3192 | def = gen_rtx (MEM, mode, gen_rtx (SYMBOL_REF, Pmode, found)); | |
3193 | ||
3194 | RTX_UNCHANGING_P (def) = 1; | |
3195 | /* Mark the symbol_ref as belonging to this constants pool. */ | |
3196 | CONSTANT_POOL_ADDRESS_P (XEXP (def, 0)) = 1; | |
3197 | current_function_uses_const_pool = 1; | |
3198 | ||
57632c51 RS |
3199 | if (outer_function_chain == 0) |
3200 | if (GET_CODE (x) == CONST_DOUBLE) | |
3201 | { | |
3202 | if (CONST_DOUBLE_MEM (x) == cc0_rtx) | |
3203 | { | |
3204 | CONST_DOUBLE_CHAIN (x) = const_double_chain; | |
3205 | const_double_chain = x; | |
3206 | } | |
3207 | CONST_DOUBLE_MEM (x) = def; | |
3208 | } | |
79e68feb RS |
3209 | |
3210 | return def; | |
3211 | } | |
3212 | \f | |
3213 | /* Given a SYMBOL_REF with CONSTANT_POOL_ADDRESS_P true, return a pointer to | |
3214 | the corresponding pool_constant structure. */ | |
3215 | ||
3216 | static struct pool_constant * | |
3217 | find_pool_constant (addr) | |
3218 | rtx addr; | |
3219 | { | |
3220 | struct pool_sym *sym; | |
3221 | char *label = XSTR (addr, 0); | |
3222 | ||
3223 | for (sym = const_rtx_sym_hash_table[SYMHASH (label)]; sym; sym = sym->next) | |
3224 | if (sym->label == label) | |
3225 | return sym->pool; | |
3226 | ||
3227 | abort (); | |
3228 | } | |
3229 | ||
3230 | /* Given a constant pool SYMBOL_REF, return the corresponding constant. */ | |
3231 | ||
3232 | rtx | |
3233 | get_pool_constant (addr) | |
3234 | rtx addr; | |
3235 | { | |
3236 | return (find_pool_constant (addr))->constant; | |
3237 | } | |
3238 | ||
3239 | /* Similar, return the mode. */ | |
3240 | ||
3241 | enum machine_mode | |
3242 | get_pool_mode (addr) | |
3243 | rtx addr; | |
3244 | { | |
3245 | return (find_pool_constant (addr))->mode; | |
3246 | } | |
3247 | ||
3248 | /* Similar, return the offset in the constant pool. */ | |
3249 | ||
3250 | int | |
3251 | get_pool_offset (addr) | |
3252 | rtx addr; | |
3253 | { | |
3254 | return (find_pool_constant (addr))->offset; | |
3255 | } | |
3256 | ||
3257 | /* Return the size of the constant pool. */ | |
3258 | ||
3259 | int | |
3260 | get_pool_size () | |
3261 | { | |
3262 | return pool_offset; | |
3263 | } | |
3264 | \f | |
3265 | /* Write all the constants in the constant pool. */ | |
3266 | ||
3267 | void | |
3268 | output_constant_pool (fnname, fndecl) | |
3269 | char *fnname; | |
3270 | tree fndecl; | |
3271 | { | |
3272 | struct pool_constant *pool; | |
3273 | rtx x; | |
3274 | union real_extract u; | |
3275 | ||
3276 | #ifdef ASM_OUTPUT_POOL_PROLOGUE | |
3277 | ASM_OUTPUT_POOL_PROLOGUE (asm_out_file, fnname, fndecl, pool_offset); | |
3278 | #endif | |
3279 | ||
3280 | for (pool = first_pool; pool; pool = pool->next) | |
3281 | { | |
3282 | x = pool->constant; | |
3283 | ||
3284 | /* See if X is a LABEL_REF (or a CONST referring to a LABEL_REF) | |
3285 | whose CODE_LABEL has been deleted. This can occur if a jump table | |
3286 | is eliminated by optimization. If so, write a constant of zero | |
7b2b3f1f RK |
3287 | instead. Note that this can also happen by turning the |
3288 | CODE_LABEL into a NOTE. */ | |
3289 | if (((GET_CODE (x) == LABEL_REF | |
3290 | && (INSN_DELETED_P (XEXP (x, 0)) | |
3291 | || GET_CODE (XEXP (x, 0)) == NOTE))) | |
79e68feb RS |
3292 | || (GET_CODE (x) == CONST && GET_CODE (XEXP (x, 0)) == PLUS |
3293 | && GET_CODE (XEXP (XEXP (x, 0), 0)) == LABEL_REF | |
7b2b3f1f RK |
3294 | && (INSN_DELETED_P (XEXP (XEXP (XEXP (x, 0), 0), 0)) |
3295 | || GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == NOTE))) | |
79e68feb RS |
3296 | x = const0_rtx; |
3297 | ||
3298 | /* First switch to correct section. */ | |
3299 | #ifdef SELECT_RTX_SECTION | |
3300 | SELECT_RTX_SECTION (pool->mode, x); | |
3301 | #else | |
3302 | readonly_data_section (); | |
3303 | #endif | |
3304 | ||
3305 | #ifdef ASM_OUTPUT_SPECIAL_POOL_ENTRY | |
3306 | ASM_OUTPUT_SPECIAL_POOL_ENTRY (asm_out_file, x, pool->mode, | |
3307 | pool->align, pool->labelno, done); | |
3308 | #endif | |
3309 | ||
3310 | if (pool->align > 1) | |
3311 | ASM_OUTPUT_ALIGN (asm_out_file, exact_log2 (pool->align)); | |
3312 | ||
3313 | /* Output the label. */ | |
3314 | ASM_OUTPUT_INTERNAL_LABEL (asm_out_file, "LC", pool->labelno); | |
3315 | ||
3316 | /* Output the value of the constant itself. */ | |
3317 | switch (GET_MODE_CLASS (pool->mode)) | |
3318 | { | |
3319 | case MODE_FLOAT: | |
3320 | if (GET_CODE (x) != CONST_DOUBLE) | |
3321 | abort (); | |
3322 | ||
4c9a05bc | 3323 | bcopy ((char *) &CONST_DOUBLE_LOW (x), (char *) &u, sizeof u); |
79e68feb RS |
3324 | assemble_real (u.d, pool->mode); |
3325 | break; | |
3326 | ||
3327 | case MODE_INT: | |
ab8ab9d0 | 3328 | case MODE_PARTIAL_INT: |
79e68feb RS |
3329 | assemble_integer (x, GET_MODE_SIZE (pool->mode), 1); |
3330 | break; | |
3331 | ||
3332 | default: | |
3333 | abort (); | |
3334 | } | |
3335 | ||
3336 | done: ; | |
3337 | } | |
3338 | ||
3339 | /* Done with this pool. */ | |
3340 | first_pool = last_pool = 0; | |
3341 | } | |
3342 | \f | |
3343 | /* Find all the constants whose addresses are referenced inside of EXP, | |
3344 | and make sure assembler code with a label has been output for each one. | |
3345 | Indicate whether an ADDR_EXPR has been encountered. */ | |
3346 | ||
5a13eaa4 | 3347 | static int |
79e68feb RS |
3348 | output_addressed_constants (exp) |
3349 | tree exp; | |
3350 | { | |
3351 | int reloc = 0; | |
3352 | ||
3353 | switch (TREE_CODE (exp)) | |
3354 | { | |
3355 | case ADDR_EXPR: | |
3356 | { | |
3357 | register tree constant = TREE_OPERAND (exp, 0); | |
3358 | ||
3359 | while (TREE_CODE (constant) == COMPONENT_REF) | |
3360 | { | |
3361 | constant = TREE_OPERAND (constant, 0); | |
3362 | } | |
3363 | ||
3364 | if (TREE_CODE_CLASS (TREE_CODE (constant)) == 'c' | |
3365 | || TREE_CODE (constant) == CONSTRUCTOR) | |
3366 | /* No need to do anything here | |
3367 | for addresses of variables or functions. */ | |
3368 | output_constant_def (constant); | |
3369 | } | |
3370 | reloc = 1; | |
3371 | break; | |
3372 | ||
3373 | case PLUS_EXPR: | |
3374 | case MINUS_EXPR: | |
3375 | reloc = output_addressed_constants (TREE_OPERAND (exp, 0)); | |
3376 | reloc |= output_addressed_constants (TREE_OPERAND (exp, 1)); | |
3377 | break; | |
3378 | ||
3379 | case NOP_EXPR: | |
3380 | case CONVERT_EXPR: | |
37a52112 | 3381 | case NON_LVALUE_EXPR: |
79e68feb RS |
3382 | reloc = output_addressed_constants (TREE_OPERAND (exp, 0)); |
3383 | break; | |
3384 | ||
3385 | case CONSTRUCTOR: | |
3386 | { | |
3387 | register tree link; | |
3388 | for (link = CONSTRUCTOR_ELTS (exp); link; link = TREE_CHAIN (link)) | |
3389 | if (TREE_VALUE (link) != 0) | |
3390 | reloc |= output_addressed_constants (TREE_VALUE (link)); | |
3391 | } | |
3392 | break; | |
3393 | ||
3394 | case ERROR_MARK: | |
3395 | break; | |
3396 | } | |
3397 | return reloc; | |
3398 | } | |
3399 | \f | |
3400 | /* Output assembler code for constant EXP to FILE, with no label. | |
3401 | This includes the pseudo-op such as ".int" or ".byte", and a newline. | |
3402 | Assumes output_addressed_constants has been done on EXP already. | |
3403 | ||
3404 | Generate exactly SIZE bytes of assembler data, padding at the end | |
3405 | with zeros if necessary. SIZE must always be specified. | |
3406 | ||
3407 | SIZE is important for structure constructors, | |
3408 | since trailing members may have been omitted from the constructor. | |
3409 | It is also important for initialization of arrays from string constants | |
3410 | since the full length of the string constant might not be wanted. | |
3411 | It is also needed for initialization of unions, where the initializer's | |
3412 | type is just one member, and that may not be as long as the union. | |
3413 | ||
3414 | There a case in which we would fail to output exactly SIZE bytes: | |
3415 | for a structure constructor that wants to produce more than SIZE bytes. | |
3416 | But such constructors will never be generated for any possible input. */ | |
3417 | ||
3418 | void | |
3419 | output_constant (exp, size) | |
3420 | register tree exp; | |
3421 | register int size; | |
3422 | { | |
3423 | register enum tree_code code = TREE_CODE (TREE_TYPE (exp)); | |
3424 | rtx x; | |
3425 | ||
3426 | if (size == 0) | |
3427 | return; | |
3428 | ||
be1ad04c | 3429 | /* Eliminate the NON_LVALUE_EXPR_EXPR that makes a cast not be an lvalue. |
b81cdf54 | 3430 | That way we get the constant (we hope) inside it. Also, strip off any |
4e1bf5f5 | 3431 | NOP_EXPR that converts between two record, union, array, or set types. */ |
be1ad04c RK |
3432 | while ((TREE_CODE (exp) == NOP_EXPR |
3433 | && (TREE_TYPE (exp) == TREE_TYPE (TREE_OPERAND (exp, 0)) | |
4e1bf5f5 | 3434 | || AGGREGATE_TYPE_P (TREE_TYPE (exp)))) |
be1ad04c RK |
3435 | || TREE_CODE (exp) == NON_LVALUE_EXPR) |
3436 | exp = TREE_OPERAND (exp, 0); | |
3437 | ||
fff9e713 MT |
3438 | /* Allow a constructor with no elements for any data type. |
3439 | This means to fill the space with zeros. */ | |
77fa0940 | 3440 | if (TREE_CODE (exp) == CONSTRUCTOR && CONSTRUCTOR_ELTS (exp) == 0) |
fff9e713 | 3441 | { |
ca695ac9 JB |
3442 | if (output_bytecode) |
3443 | bc_emit_const_skip (size); | |
3444 | else | |
3445 | assemble_zeros (size); | |
fff9e713 MT |
3446 | return; |
3447 | } | |
3448 | ||
79e68feb RS |
3449 | switch (code) |
3450 | { | |
644ea577 RS |
3451 | case CHAR_TYPE: |
3452 | case BOOLEAN_TYPE: | |
79e68feb RS |
3453 | case INTEGER_TYPE: |
3454 | case ENUMERAL_TYPE: | |
3455 | case POINTER_TYPE: | |
3456 | case REFERENCE_TYPE: | |
3457 | /* ??? What about (int)((float)(int)&foo + 4) */ | |
3458 | while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR | |
3459 | || TREE_CODE (exp) == NON_LVALUE_EXPR) | |
3460 | exp = TREE_OPERAND (exp, 0); | |
3461 | ||
37366632 | 3462 | if (! assemble_integer (expand_expr (exp, NULL_RTX, VOIDmode, |
79e68feb RS |
3463 | EXPAND_INITIALIZER), |
3464 | size, 0)) | |
3465 | error ("initializer for integer value is too complicated"); | |
3466 | size = 0; | |
3467 | break; | |
3468 | ||
3469 | case REAL_TYPE: | |
3470 | if (TREE_CODE (exp) != REAL_CST) | |
3471 | error ("initializer for floating value is not a floating constant"); | |
3472 | ||
3473 | assemble_real (TREE_REAL_CST (exp), | |
3474 | mode_for_size (size * BITS_PER_UNIT, MODE_FLOAT, 0)); | |
3475 | size = 0; | |
3476 | break; | |
3477 | ||
3478 | case COMPLEX_TYPE: | |
3479 | output_constant (TREE_REALPART (exp), size / 2); | |
3480 | output_constant (TREE_IMAGPART (exp), size / 2); | |
3481 | size -= (size / 2) * 2; | |
3482 | break; | |
3483 | ||
3484 | case ARRAY_TYPE: | |
3485 | if (TREE_CODE (exp) == CONSTRUCTOR) | |
3486 | { | |
3487 | output_constructor (exp, size); | |
3488 | return; | |
3489 | } | |
3490 | else if (TREE_CODE (exp) == STRING_CST) | |
3491 | { | |
3492 | int excess = 0; | |
3493 | ||
3494 | if (size > TREE_STRING_LENGTH (exp)) | |
3495 | { | |
3496 | excess = size - TREE_STRING_LENGTH (exp); | |
3497 | size = TREE_STRING_LENGTH (exp); | |
3498 | } | |
3499 | ||
3500 | assemble_string (TREE_STRING_POINTER (exp), size); | |
3501 | size = excess; | |
3502 | } | |
3503 | else | |
3504 | abort (); | |
3505 | break; | |
3506 | ||
3507 | case RECORD_TYPE: | |
3508 | case UNION_TYPE: | |
3509 | if (TREE_CODE (exp) == CONSTRUCTOR) | |
3510 | output_constructor (exp, size); | |
3511 | else | |
3512 | abort (); | |
3513 | return; | |
474bda6c PB |
3514 | |
3515 | case SET_TYPE: | |
3516 | if (TREE_CODE (exp) == INTEGER_CST) | |
3517 | assemble_integer (expand_expr (exp, NULL_RTX, | |
3518 | VOIDmode, EXPAND_INITIALIZER), | |
af13b0fb | 3519 | size, 1); |
474bda6c PB |
3520 | else if (TREE_CODE (exp) == CONSTRUCTOR) |
3521 | { | |
af13b0fb DE |
3522 | unsigned char *buffer = (unsigned char *) alloca (size); |
3523 | if (get_set_constructor_bytes (exp, buffer, size)) | |
474bda6c | 3524 | abort (); |
af13b0fb | 3525 | assemble_string (buffer, size); |
474bda6c PB |
3526 | } |
3527 | else | |
3528 | error ("unknown set constructor type"); | |
3529 | return; | |
79e68feb RS |
3530 | } |
3531 | ||
3532 | if (size > 0) | |
3533 | assemble_zeros (size); | |
3534 | } | |
ca695ac9 | 3535 | |
ca695ac9 | 3536 | /* Bytecode specific code to output assembler for integer. */ |
5a13eaa4 | 3537 | |
6e828044 | 3538 | static void |
ca695ac9 JB |
3539 | bc_assemble_integer (exp, size) |
3540 | tree exp; | |
3541 | int size; | |
3542 | { | |
3543 | tree const_part; | |
3544 | tree addr_part; | |
3545 | tree tmp; | |
3546 | ||
3547 | /* FIXME: is this fold() business going to be as good as the | |
3548 | expand_expr() using EXPAND_SUM above in the RTL case? I | |
3549 | hate RMS. | |
3550 | FIXME: Copied as is from BC-GCC1; may need work. Don't hate. -bson */ | |
3551 | ||
3552 | exp = fold (exp); | |
3553 | ||
3554 | while (TREE_CODE (exp) == NOP_EXPR || TREE_CODE (exp) == CONVERT_EXPR) | |
3555 | exp = TREE_OPERAND (exp, 0); | |
3556 | if (TREE_CODE (exp) == INTEGER_CST) | |
3557 | { | |
3558 | const_part = exp; | |
3559 | addr_part = 0; | |
3560 | } | |
3561 | else if (TREE_CODE (exp) == PLUS_EXPR) | |
3562 | { | |
3563 | const_part = TREE_OPERAND (exp, 0); | |
3564 | while (TREE_CODE (const_part) == NOP_EXPR | |
3565 | || TREE_CODE (const_part) == CONVERT_EXPR) | |
3566 | const_part = TREE_OPERAND (const_part, 0); | |
3567 | addr_part = TREE_OPERAND (exp, 1); | |
3568 | while (TREE_CODE (addr_part) == NOP_EXPR | |
3569 | || TREE_CODE (addr_part) == CONVERT_EXPR) | |
3570 | addr_part = TREE_OPERAND (addr_part, 0); | |
3571 | if (TREE_CODE (const_part) != INTEGER_CST) | |
3572 | tmp = const_part, const_part = addr_part, addr_part = tmp; | |
3573 | if (TREE_CODE (const_part) != INTEGER_CST | |
3574 | || TREE_CODE (addr_part) != ADDR_EXPR) | |
3575 | abort (); /* FIXME: we really haven't considered | |
3576 | all the possible cases here. */ | |
3577 | } | |
3578 | else if (TREE_CODE (exp) == ADDR_EXPR) | |
3579 | { | |
3580 | const_part = integer_zero_node; | |
3581 | addr_part = exp; | |
3582 | } | |
3583 | else | |
3584 | abort (); /* FIXME: ditto previous. */ | |
3585 | ||
3586 | if (addr_part == 0) | |
3587 | { | |
3588 | if (size == 1) | |
3589 | { | |
3590 | char c = TREE_INT_CST_LOW (const_part); | |
3591 | bc_emit (&c, 1); | |
3592 | size -= 1; | |
3593 | } | |
3594 | else if (size == 2) | |
3595 | { | |
3596 | short s = TREE_INT_CST_LOW (const_part); | |
3597 | bc_emit ((char *) &s, 2); | |
3598 | size -= 2; | |
3599 | } | |
3600 | else if (size == 4) | |
3601 | { | |
3602 | int i = TREE_INT_CST_LOW (const_part); | |
3603 | bc_emit ((char *) &i, 4); | |
3604 | size -= 4; | |
3605 | } | |
3606 | else if (size == 8) | |
3607 | { | |
f76b9db2 ILT |
3608 | if (WORDS_BIG_ENDIAN) |
3609 | { | |
3610 | int i = TREE_INT_CST_HIGH (const_part); | |
3611 | bc_emit ((char *) &i, 4); | |
3612 | i = TREE_INT_CST_LOW (const_part); | |
3613 | bc_emit ((char *) &i, 4); | |
3614 | } | |
3615 | else | |
3616 | { | |
3617 | int i = TREE_INT_CST_LOW (const_part); | |
3618 | bc_emit ((char *) &i, 4); | |
3619 | i = TREE_INT_CST_HIGH (const_part); | |
3620 | bc_emit ((char *) &i, 4); | |
3621 | } | |
ca695ac9 JB |
3622 | size -= 8; |
3623 | } | |
3624 | } | |
3625 | else | |
3626 | if (size == 4 | |
3627 | && TREE_CODE (TREE_OPERAND (addr_part, 0)) == VAR_DECL) | |
3628 | bc_emit_labelref (DECL_ASSEMBLER_NAME (TREE_OPERAND (addr_part, 0)), | |
3629 | TREE_INT_CST_LOW (const_part)); | |
3630 | else | |
3631 | abort (); /* FIXME: there may be more cases. */ | |
3632 | } | |
79e68feb RS |
3633 | \f |
3634 | /* Subroutine of output_constant, used for CONSTRUCTORs | |
3635 | (aggregate constants). | |
3636 | Generate at least SIZE bytes, padding if necessary. */ | |
3637 | ||
5a13eaa4 | 3638 | static void |
79e68feb RS |
3639 | output_constructor (exp, size) |
3640 | tree exp; | |
3641 | int size; | |
3642 | { | |
3643 | register tree link, field = 0; | |
13b457e7 | 3644 | HOST_WIDE_INT min_index = 0; |
79e68feb RS |
3645 | /* Number of bytes output or skipped so far. |
3646 | In other words, current position within the constructor. */ | |
3647 | int total_bytes = 0; | |
3648 | /* Non-zero means BYTE contains part of a byte, to be output. */ | |
3649 | int byte_buffer_in_use = 0; | |
3650 | register int byte; | |
3651 | ||
37366632 | 3652 | if (HOST_BITS_PER_WIDE_INT < BITS_PER_UNIT) |
79e68feb RS |
3653 | abort (); |
3654 | ||
3655 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE) | |
3656 | field = TYPE_FIELDS (TREE_TYPE (exp)); | |
3657 | ||
d12516f1 RS |
3658 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE |
3659 | && TYPE_DOMAIN (TREE_TYPE (exp)) != 0) | |
13b457e7 RK |
3660 | min_index |
3661 | = TREE_INT_CST_LOW (TYPE_MIN_VALUE (TYPE_DOMAIN (TREE_TYPE (exp)))); | |
3662 | ||
79e68feb RS |
3663 | /* As LINK goes through the elements of the constant, |
3664 | FIELD goes through the structure fields, if the constant is a structure. | |
3665 | if the constant is a union, then we override this, | |
3666 | by getting the field from the TREE_LIST element. | |
3667 | But the constant could also be an array. Then FIELD is zero. */ | |
3668 | for (link = CONSTRUCTOR_ELTS (exp); | |
3669 | link; | |
3670 | link = TREE_CHAIN (link), | |
3671 | field = field ? TREE_CHAIN (field) : 0) | |
3672 | { | |
3673 | tree val = TREE_VALUE (link); | |
3181cbfd RS |
3674 | tree index = 0; |
3675 | ||
79e68feb | 3676 | /* the element in a union constructor specifies the proper field. */ |
3181cbfd RS |
3677 | |
3678 | if (TREE_CODE (TREE_TYPE (exp)) == RECORD_TYPE | |
3679 | || TREE_CODE (TREE_TYPE (exp)) == UNION_TYPE) | |
1108dc3d KKT |
3680 | { |
3681 | /* if available, use the type given by link */ | |
3682 | if (TREE_PURPOSE (link) != 0) | |
3683 | field = TREE_PURPOSE (link); | |
3684 | } | |
79e68feb | 3685 | |
3181cbfd RS |
3686 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) |
3687 | index = TREE_PURPOSE (link); | |
3688 | ||
79e68feb | 3689 | /* Eliminate the marker that makes a cast not be an lvalue. */ |
d964285c CH |
3690 | if (val != 0) |
3691 | STRIP_NOPS (val); | |
79e68feb RS |
3692 | |
3693 | if (field == 0 || !DECL_BIT_FIELD (field)) | |
3694 | { | |
3181cbfd RS |
3695 | /* An element that is not a bit-field. */ |
3696 | ||
79e68feb RS |
3697 | register int fieldsize; |
3698 | /* Since this structure is static, | |
3699 | we know the positions are constant. */ | |
3700 | int bitpos = (field ? (TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)) | |
3701 | / BITS_PER_UNIT) | |
3702 | : 0); | |
3181cbfd RS |
3703 | if (index != 0) |
3704 | bitpos = (TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (val))) | |
3705 | / BITS_PER_UNIT | |
13b457e7 | 3706 | * (TREE_INT_CST_LOW (index) - min_index)); |
79e68feb | 3707 | |
3181cbfd | 3708 | /* Output any buffered-up bit-fields preceding this element. */ |
79e68feb RS |
3709 | if (byte_buffer_in_use) |
3710 | { | |
3711 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
3712 | total_bytes++; | |
3713 | byte_buffer_in_use = 0; | |
3714 | } | |
3715 | ||
3716 | /* Advance to offset of this element. | |
3717 | Note no alignment needed in an array, since that is guaranteed | |
3718 | if each element has the proper size. */ | |
3181cbfd | 3719 | if ((field != 0 || index != 0) && bitpos != total_bytes) |
79e68feb | 3720 | { |
ca695ac9 JB |
3721 | if (!output_bytecode) |
3722 | assemble_zeros (bitpos - total_bytes); | |
3723 | else | |
3724 | bc_emit_const_skip (bitpos - total_bytes); | |
79e68feb RS |
3725 | total_bytes = bitpos; |
3726 | } | |
3727 | ||
3728 | /* Determine size this element should occupy. */ | |
3729 | if (field) | |
3730 | { | |
3731 | if (TREE_CODE (DECL_SIZE (field)) != INTEGER_CST) | |
3732 | abort (); | |
3733 | if (TREE_INT_CST_LOW (DECL_SIZE (field)) > 100000) | |
3734 | { | |
3735 | /* This avoids overflow trouble. */ | |
3736 | tree size_tree = size_binop (CEIL_DIV_EXPR, | |
3737 | DECL_SIZE (field), | |
3738 | size_int (BITS_PER_UNIT)); | |
3739 | fieldsize = TREE_INT_CST_LOW (size_tree); | |
3740 | } | |
3741 | else | |
3742 | { | |
3743 | fieldsize = TREE_INT_CST_LOW (DECL_SIZE (field)); | |
3744 | fieldsize = (fieldsize + BITS_PER_UNIT - 1) / BITS_PER_UNIT; | |
3745 | } | |
3746 | } | |
3747 | else | |
3748 | fieldsize = int_size_in_bytes (TREE_TYPE (TREE_TYPE (exp))); | |
3749 | ||
3750 | /* Output the element's initial value. */ | |
3751 | if (val == 0) | |
3752 | assemble_zeros (fieldsize); | |
3753 | else | |
3754 | output_constant (val, fieldsize); | |
3755 | ||
3756 | /* Count its size. */ | |
3757 | total_bytes += fieldsize; | |
3758 | } | |
3759 | else if (val != 0 && TREE_CODE (val) != INTEGER_CST) | |
3760 | error ("invalid initial value for member `%s'", | |
3761 | IDENTIFIER_POINTER (DECL_NAME (field))); | |
3762 | else | |
3763 | { | |
3764 | /* Element that is a bit-field. */ | |
3765 | ||
3766 | int next_offset = TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field)); | |
3767 | int end_offset | |
3768 | = (next_offset + TREE_INT_CST_LOW (DECL_SIZE (field))); | |
3769 | ||
3770 | if (val == 0) | |
3771 | val = integer_zero_node; | |
3772 | ||
3773 | /* If this field does not start in this (or, next) byte, | |
3774 | skip some bytes. */ | |
3775 | if (next_offset / BITS_PER_UNIT != total_bytes) | |
3776 | { | |
3777 | /* Output remnant of any bit field in previous bytes. */ | |
3778 | if (byte_buffer_in_use) | |
3779 | { | |
3780 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
3781 | total_bytes++; | |
3782 | byte_buffer_in_use = 0; | |
3783 | } | |
3784 | ||
3785 | /* If still not at proper byte, advance to there. */ | |
3786 | if (next_offset / BITS_PER_UNIT != total_bytes) | |
3787 | { | |
3788 | assemble_zeros (next_offset / BITS_PER_UNIT - total_bytes); | |
3789 | total_bytes = next_offset / BITS_PER_UNIT; | |
3790 | } | |
3791 | } | |
3792 | ||
3793 | if (! byte_buffer_in_use) | |
3794 | byte = 0; | |
3795 | ||
3796 | /* We must split the element into pieces that fall within | |
3797 | separate bytes, and combine each byte with previous or | |
3798 | following bit-fields. */ | |
3799 | ||
b4ac57ab | 3800 | /* next_offset is the offset n fbits from the beginning of |
79e68feb RS |
3801 | the structure to the next bit of this element to be processed. |
3802 | end_offset is the offset of the first bit past the end of | |
3803 | this element. */ | |
3804 | while (next_offset < end_offset) | |
3805 | { | |
3806 | int this_time; | |
e7105755 JW |
3807 | int shift; |
3808 | HOST_WIDE_INT value; | |
79e68feb RS |
3809 | int next_byte = next_offset / BITS_PER_UNIT; |
3810 | int next_bit = next_offset % BITS_PER_UNIT; | |
3811 | ||
3812 | /* Advance from byte to byte | |
3813 | within this element when necessary. */ | |
3814 | while (next_byte != total_bytes) | |
3815 | { | |
3816 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
3817 | total_bytes++; | |
3818 | byte = 0; | |
3819 | } | |
3820 | ||
3821 | /* Number of bits we can process at once | |
3822 | (all part of the same byte). */ | |
3823 | this_time = MIN (end_offset - next_offset, | |
3824 | BITS_PER_UNIT - next_bit); | |
f76b9db2 | 3825 | if (BYTES_BIG_ENDIAN) |
79e68feb | 3826 | { |
f76b9db2 ILT |
3827 | /* On big-endian machine, take the most significant bits |
3828 | first (of the bits that are significant) | |
3829 | and put them into bytes from the most significant end. */ | |
3830 | shift = end_offset - next_offset - this_time; | |
3831 | /* Don't try to take a bunch of bits that cross | |
3832 | the word boundary in the INTEGER_CST. */ | |
3833 | if (shift < HOST_BITS_PER_WIDE_INT | |
3834 | && shift + this_time > HOST_BITS_PER_WIDE_INT) | |
3835 | { | |
3836 | this_time -= (HOST_BITS_PER_WIDE_INT - shift); | |
3837 | shift = HOST_BITS_PER_WIDE_INT; | |
3838 | } | |
3839 | ||
3840 | /* Now get the bits from the appropriate constant word. */ | |
3841 | if (shift < HOST_BITS_PER_WIDE_INT) | |
3842 | { | |
3843 | value = TREE_INT_CST_LOW (val); | |
3844 | } | |
3845 | else if (shift < 2 * HOST_BITS_PER_WIDE_INT) | |
3846 | { | |
3847 | value = TREE_INT_CST_HIGH (val); | |
3848 | shift -= HOST_BITS_PER_WIDE_INT; | |
3849 | } | |
3850 | else | |
3851 | abort (); | |
3852 | byte |= (((value >> shift) | |
3853 | & (((HOST_WIDE_INT) 1 << this_time) - 1)) | |
3854 | << (BITS_PER_UNIT - this_time - next_bit)); | |
79e68feb RS |
3855 | } |
3856 | else | |
79e68feb | 3857 | { |
f76b9db2 ILT |
3858 | /* On little-endian machines, |
3859 | take first the least significant bits of the value | |
3860 | and pack them starting at the least significant | |
3861 | bits of the bytes. */ | |
3862 | shift = (next_offset | |
3863 | - TREE_INT_CST_LOW (DECL_FIELD_BITPOS (field))); | |
3864 | /* Don't try to take a bunch of bits that cross | |
3865 | the word boundary in the INTEGER_CST. */ | |
3866 | if (shift < HOST_BITS_PER_WIDE_INT | |
3867 | && shift + this_time > HOST_BITS_PER_WIDE_INT) | |
3868 | { | |
3869 | this_time -= (HOST_BITS_PER_WIDE_INT - shift); | |
3870 | shift = HOST_BITS_PER_WIDE_INT; | |
3871 | } | |
3872 | ||
3873 | /* Now get the bits from the appropriate constant word. */ | |
3874 | if (shift < HOST_BITS_PER_INT) | |
3875 | value = TREE_INT_CST_LOW (val); | |
3876 | else if (shift < 2 * HOST_BITS_PER_WIDE_INT) | |
3877 | { | |
3878 | value = TREE_INT_CST_HIGH (val); | |
3879 | shift -= HOST_BITS_PER_WIDE_INT; | |
3880 | } | |
3881 | else | |
3882 | abort (); | |
3883 | byte |= (((value >> shift) | |
3884 | & (((HOST_WIDE_INT) 1 << this_time) - 1)) | |
3885 | << next_bit); | |
79e68feb | 3886 | } |
79e68feb RS |
3887 | next_offset += this_time; |
3888 | byte_buffer_in_use = 1; | |
3889 | } | |
3890 | } | |
3891 | } | |
3892 | if (byte_buffer_in_use) | |
3893 | { | |
3894 | ASM_OUTPUT_BYTE (asm_out_file, byte); | |
3895 | total_bytes++; | |
3896 | } | |
3897 | if (total_bytes < size) | |
3898 | assemble_zeros (size - total_bytes); | |
3899 | } | |
ca695ac9 JB |
3900 | |
3901 | ||
c02bd5d9 JB |
3902 | #ifdef HANDLE_SYSV_PRAGMA |
3903 | ||
879a4a9a JW |
3904 | /* Support #pragma weak by default if WEAK_ASM_OP and ASM_OUTPUT_DEF |
3905 | are defined. */ | |
3906 | #if defined (WEAK_ASM_OP) && defined (ASM_OUTPUT_DEF) | |
da9f42b1 | 3907 | |
b7560989 RS |
3908 | /* See c-pragma.c for an identical definition. */ |
3909 | enum pragma_state | |
3910 | { | |
3911 | ps_start, | |
3912 | ps_done, | |
3913 | ps_bad, | |
3914 | ps_weak, | |
3915 | ps_name, | |
3916 | ps_equals, | |
3917 | ps_value, | |
3918 | ps_pack, | |
3919 | ps_left, | |
3920 | ps_align, | |
3921 | ps_right | |
3922 | }; | |
3923 | ||
ca695ac9 JB |
3924 | /* Output asm to handle ``#pragma weak'' */ |
3925 | void | |
3926 | handle_pragma_weak (what, asm_out_file, name, value) | |
3927 | enum pragma_state what; | |
3928 | FILE *asm_out_file; | |
3929 | char *name, *value; | |
3930 | { | |
3931 | if (what == ps_name || what == ps_value) | |
3932 | { | |
3933 | fprintf (asm_out_file, "\t%s\t", WEAK_ASM_OP); | |
3934 | ||
3935 | if (output_bytecode) | |
3936 | BC_OUTPUT_LABELREF (asm_out_file, name); | |
3937 | else | |
3938 | ASM_OUTPUT_LABELREF (asm_out_file, name); | |
3939 | ||
3940 | fputc ('\n', asm_out_file); | |
3941 | if (what == ps_value) | |
879a4a9a | 3942 | ASM_OUTPUT_DEF (asm_out_file, name, value); |
ca695ac9 JB |
3943 | } |
3944 | else if (! (what == ps_done || what == ps_start)) | |
3945 | warning ("malformed `#pragma weak'"); | |
3946 | } | |
c02bd5d9 | 3947 | |
da9f42b1 RS |
3948 | #endif /* HANDLE_PRAGMA_WEAK or (WEAK_ASM_OP and SET_ASM_OP) */ |
3949 | ||
879a4a9a | 3950 | #endif /* WEAK_ASM_OP && ASM_OUTPUT_DEF */ |