2 * Dumps global variables and constants as ia32 assembler.
3 * @author Christian Wuerdig
19 #include "ia32_emitter.h"
20 #include "ia32_gen_decls.h"
22 /************************************************************************/
25 * returns the highest bit value
27 static unsigned highest_bit(unsigned v)
31 if (v >= (1U << 16U)) {
35 if (v >= (1U << 8U)) {
39 if (v >= (1U << 4U)) {
43 if (v >= (1U << 2U)) {
47 if (v >= (1U << 1U)) {
57 static void ia32_dump_comm(struct obstack *obst, const char *name, visibility vis, int size, int align) {
58 switch (asm_flavour) {
60 if (vis == visibility_local)
61 obstack_printf(obst, "\t.local\t%s\n", name);
62 obstack_printf(obst, "\t.comm\t%s,%d,%d\n", name, size, align);
65 if (vis == visibility_local)
66 obstack_printf(obst, "\t.lcomm\t%s,%d\n", name, size);
68 obstack_printf(obst, "\t.comm\t%s,%d\n", name, size);
74 * output the alignment
76 static void ia32_dump_align(struct obstack *obst, int align)
78 int h = highest_bit(align);
85 obstack_printf(obst, "\t.align %d\n", align);
88 static void dump_arith_tarval(struct obstack *obst, tarval *tv, int bytes)
93 obstack_printf(obst, "0x%02x", get_tarval_sub_bits(tv, 0));
97 obstack_printf(obst, "0x%02x%02x", get_tarval_sub_bits(tv, 1), get_tarval_sub_bits(tv, 0));
101 obstack_printf(obst, "0x%02x%02x%02x%02x",
102 get_tarval_sub_bits(tv, 3), get_tarval_sub_bits(tv, 2), get_tarval_sub_bits(tv, 1), get_tarval_sub_bits(tv, 0));
106 obstack_printf(obst, "0x%02x%02x%02x%02x%02x%02x%02x%02x",
107 get_tarval_sub_bits(tv, 7), get_tarval_sub_bits(tv, 6), get_tarval_sub_bits(tv, 5), get_tarval_sub_bits(tv, 4),
108 get_tarval_sub_bits(tv, 3), get_tarval_sub_bits(tv, 2), get_tarval_sub_bits(tv, 1), get_tarval_sub_bits(tv, 0));
116 fprintf(stderr, "Try to dump an tarval with %d bytes\n", bytes);
122 * dump an atomic value
124 static void do_dump_atomic_init(struct obstack *obst, ir_node *init)
126 ir_mode *mode = get_irn_mode(init);
127 int bytes = get_mode_size_bytes(mode);
130 switch (get_irn_opcode(init)) {
133 do_dump_atomic_init(obst, get_Cast_op(init));
137 do_dump_atomic_init(obst, get_Conv_op(init));
141 tv = get_Const_tarval(init);
143 /* beware of old stuff */
144 assert(! mode_is_reference(mode));
146 /* it's a arithmetic value */
147 dump_arith_tarval(obst, tv, bytes);
151 switch (get_SymConst_kind(init)) {
152 case symconst_addr_name:
153 obstack_printf(obst, "%s", get_id_str(get_SymConst_name(init)));
156 case symconst_addr_ent:
157 obstack_printf(obst, "%s", get_entity_ld_name(get_SymConst_entity(init)));
161 obstack_printf(obst, "%d", get_type_size_bytes(get_SymConst_type(init)));
165 assert(0 && "dump_atomic_init(): don't know how to init from this SymConst");
170 do_dump_atomic_init(obst, get_Add_left(init));
171 obstack_printf(obst, " + ");
172 do_dump_atomic_init(obst, get_Add_right(init));
176 do_dump_atomic_init(obst, get_Sub_left(init));
177 obstack_printf(obst, " - ");
178 do_dump_atomic_init(obst, get_Sub_right(init));
182 do_dump_atomic_init(obst, get_Mul_left(init));
183 obstack_printf(obst, " * ");
184 do_dump_atomic_init(obst, get_Mul_right(init));
188 assert(0 && "dump_atomic_init(): unknown IR-node");
193 * dump an atomic value
195 static void dump_atomic_init(struct obstack *obst, ir_node *init)
197 ir_mode *mode = get_irn_mode(init);
198 int bytes = get_mode_size_bytes(mode);
203 obstack_printf(obst, "\t.byte\t");
207 obstack_printf(obst, "\t.value\t");
211 obstack_printf(obst, "\t.long\t");
215 obstack_printf(obst, "\t.quad\t");
220 /* handled in arith */
224 fprintf(stderr, "Try to dump an tarval with %d bytes\n", bytes);
228 do_dump_atomic_init(obst, init);
229 obstack_printf(obst, "\n");
232 /************************************************************************/
233 /* Routines to dump global variables */
234 /************************************************************************/
237 * Determine if an entity is a string constant
238 * @param ent The entity
239 * @return 1 if it is a string constant, 0 otherwise
241 static int ent_is_string_const(entity *ent)
246 ty = get_entity_type(ent);
248 /* if it's an array */
249 if (is_Array_type(ty)) {
250 ir_type *elm_ty = get_array_element_type(ty);
252 /* and the array's element type is primitive */
253 if (is_Primitive_type(elm_ty)) {
254 ir_mode *mode = get_type_mode(elm_ty);
257 * and the mode of the element type is an int of
258 * the same size as the byte mode
260 if (mode_is_int(mode)
261 && get_mode_size_bits(mode) == get_mode_size_bits(mode_Bs))
265 n = get_compound_ent_n_values(ent);
266 for (i = 0; i < n; ++i) {
267 ir_node *irn = get_compound_ent_value(ent, i);
268 if(get_irn_opcode(irn) != iro_Const)
271 c = (int) get_tarval_long(get_Const_tarval(irn));
273 if((i < n - 1 && !(isgraph(c) || isspace(c)))
274 || (i == n - 1 && c != '\0'))
287 * Dump a atring constant.
288 * No checks are made!!
289 * @param obst The obst to dump on.
290 * @param ent The entity to dump.
292 static void dump_string_cst(struct obstack *obst, entity *ent)
296 obstack_printf(obst, "\t.string \"");
297 n = get_compound_ent_n_values(ent);
299 for (i = 0; i < n-1; ++i) {
303 irn = get_compound_ent_value(ent, i);
304 c = (int) get_tarval_long(get_Const_tarval(irn));
307 case '"' : obstack_printf(obst, "\\\""); break;
308 case '\n': obstack_printf(obst, "\\n"); break;
309 case '\r': obstack_printf(obst, "\\r"); break;
310 case '\t': obstack_printf(obst, "\\t"); break;
313 obstack_printf(obst, "%c", c);
315 obstack_printf(obst, "%O", c);
319 obstack_printf(obst, "\"\n");
328 static void dump_object_size(struct obstack *obst, const char *name, int size) {
329 switch (asm_flavour) {
331 obstack_printf(obst, "\t.type\t%s,@object\n", name);
332 obstack_printf(obst, "\t.size\t%s,%d\n", name, size);
338 * Dumps the initialization of global variables that are not
341 static void dump_global(struct obstack *rdata_obstack, struct obstack *data_obstack, struct obstack *comm_obstack, entity *ent)
343 ir_type *ty = get_entity_type(ent);
344 const char *ld_name = get_entity_ld_name(ent);
346 struct obstack *obst = data_obstack;
349 * FIXME: did NOT work for partly constant values
351 if (! is_Method_type(ty)) {
352 ent_variability variability = get_entity_variability(ent);
353 visibility visibility = get_entity_visibility(ent);
355 if (variability == variability_constant) {
356 /* a constant entity, put it on the rdata */
357 obst = rdata_obstack;
360 /* check, whether it is initialized, if yes create data */
361 if (variability != variability_uninitialized) {
362 if (visibility == visibility_external_visible) {
363 obstack_printf(obst, ".globl\t%s\n", ld_name);
365 dump_object_size(obst, ld_name, (get_type_size_bits(ty) + 7) >> 3);
367 align = get_type_alignment_bytes(ty);
368 ia32_dump_align(obst, align);
370 obstack_printf(obst, "%s:\n", ld_name);
372 if (is_atomic_type(ty)) {
373 if (get_entity_visibility(ent) != visibility_external_allocated)
374 dump_atomic_init(obst, get_atomic_ent_value(ent));
379 if (ent_is_string_const(ent)) {
380 dump_string_cst(obst, ent);
382 else if (is_Array_type(ty)) {
385 /* potential spare values should be already included! */
386 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
387 entity *step = get_compound_ent_value_member(ent, i);
388 ir_type *stype = get_entity_type(step);
390 if (get_type_mode(stype)) {
391 int align = (get_type_alignment_bits(stype) + 7) >> 3;
392 int n = size % align;
395 obstack_printf(obst, "\t.zero\t%d\n", align - n);
399 dump_atomic_init(obst, get_compound_ent_value(ent, i));
400 size += get_type_size_bytes(stype);
402 filler = get_type_size_bytes(ty) - size;
405 obstack_printf(obst, "\t.zero\t%d\n", filler);
407 else if (is_compound_type(ty)) {
411 /* Compound entities are NOT sorted.
412 * The sorting strategy used doesn't work for `value' compound fields nor
413 * for partially_constant entities.
417 * in the worst case, every entity allocates one byte, so the type
418 * size should be equal or bigger the number of fields
420 type_size = get_type_size_bytes(ty);
421 vals = xcalloc(type_size, sizeof(*vals));
423 /* collect the values and store them at the offsets */
424 for(i = 0; i < get_compound_ent_n_values(ent); ++i) {
425 int graph_length, aipos, offset;
428 compound_graph_path *path = get_compound_ent_value_path(ent, i);
430 /* get the access path to the costant value */
431 graph_length = get_compound_graph_path_length(path);
432 ai = xcalloc(graph_length, sizeof(struct arr_info));
434 /* We wanna know how many arrays are on the path to the entity. We also have to know how
435 * many elements each array holds to calculate the offset for the entity. */
436 for (j = 0; j < graph_length; j++) {
437 entity *step = get_compound_graph_path_node(path, j);
438 ir_type *step_type = get_entity_type(step);
439 int ty_size = (get_type_size_bits(step_type) + 7) >> 3;
442 if (is_Array_type(step_type))
443 for (k = 0; k < get_array_n_dimensions(step_type); k++)
444 n += get_tarval_long(get_Const_tarval(get_array_upper_bound(step_type, k)));
446 ai[j].n_elems = n ? all_n + 1 : 0;
448 ai[j].size = ty_size;
451 aipos = graph_length - 1;
454 for (offset = j = 0; j < graph_length; j++) {
455 entity *step = get_compound_graph_path_node(path, j);
456 ir_type *step_type = get_entity_type(step);
457 int ent_ofs = get_entity_offset_bytes(step);
460 /* add all positive offsets (= offsets in structs) */
461 if (ent_ofs >= 0) offset += ent_ofs;
463 if (j == graph_length - 1) {
464 stepsize = (get_type_size_bits(step_type) + 7) >> 3;
466 /* Search the next free position in vals depending on the information from above (ai). */
467 while (vals[offset]) {
468 if (ai[aipos].visit_cnt < ai[aipos].n_elems) {
470 ai[aipos].visit_cnt++;
473 while (aipos >= 0 && ai[aipos].visit_cnt == ai[aipos].n_elems) {
474 stepsize = ai[aipos--].size;
479 assert(aipos >= 0 && "couldn't store entity");
480 vals[offset] = get_compound_ent_value(ent, i);
487 /* now write them sorted */
488 for(i = 0; i < type_size; ) {
490 dump_atomic_init(obst, vals[i]);
491 i += (get_mode_size_bytes(get_irn_mode(vals[i])));
495 obstack_printf(obst, "\t.byte\t0\n");
502 assert(0 && "unsupported type");
505 obstack_printf(obst, "\n");
507 else if (visibility != visibility_external_allocated) {
508 /* calculate the alignment */
509 align = get_type_alignment_bytes(ty);
510 h = highest_bit(align);
512 if ((1 << h) < align)
519 ia32_dump_comm(comm_obstack, ld_name, visibility,
520 (get_type_size_bits(ty) + 7) >> 3, align);
526 * Dumps declarations of global variables and the initialization code.
528 void ia32_dump_globals(struct obstack *rdata_obstack, struct obstack *data_obstack, struct obstack *comm_obstack)
530 ir_type *gt = get_glob_type();
531 int i, n = get_class_n_members(gt);
533 for (i = 0; i < n; i++)
534 dump_global(rdata_obstack, data_obstack, comm_obstack, get_class_member(gt, i));
537 /************************************************************************/
539 void ia32_gen_decls(FILE *out) {
540 struct obstack rodata, data, comm;
544 obstack_init(&rodata);
548 ia32_dump_globals(&rodata, &data, &comm);
550 size = obstack_object_size(&data);
551 cp = obstack_finish(&data);
553 ia32_switch_section(out, SECTION_DATA);
554 fwrite(cp, 1, size, out);
557 size = obstack_object_size(&rodata);
558 cp = obstack_finish(&rodata);
560 fprintf(out, "\t.section\t.rodata\n");
561 fwrite(cp, 1, size, out);
564 size = obstack_object_size(&comm);
565 cp = obstack_finish(&comm);
567 ia32_switch_section(out, SECTION_COMMON);
568 fwrite(cp, 1, size, out);
571 obstack_free(&rodata, NULL);
572 obstack_free(&data, NULL);
573 obstack_free(&comm, NULL);