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