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)));
160 case symconst_type_size:
161 obstack_printf(obst, "%d", get_type_size_bytes(get_SymConst_type(init)));
164 case symconst_type_align:
165 obstack_printf(obst, "%d", get_type_alignment_bytes(get_SymConst_type(init)));
168 case symconst_enum_const:
169 tv = get_enumeration_value(get_SymConst_enum(init));
170 dump_arith_tarval(obst, tv, bytes);
174 assert(0 && "dump_atomic_init(): don't know how to init from this SymConst");
179 do_dump_atomic_init(obst, get_Add_left(init));
180 obstack_printf(obst, " + ");
181 do_dump_atomic_init(obst, get_Add_right(init));
185 do_dump_atomic_init(obst, get_Sub_left(init));
186 obstack_printf(obst, " - ");
187 do_dump_atomic_init(obst, get_Sub_right(init));
191 do_dump_atomic_init(obst, get_Mul_left(init));
192 obstack_printf(obst, " * ");
193 do_dump_atomic_init(obst, get_Mul_right(init));
197 assert(0 && "dump_atomic_init(): unknown IR-node");
202 * dump an atomic value
204 static void dump_atomic_init(struct obstack *obst, ir_node *init)
206 ir_mode *mode = get_irn_mode(init);
207 int bytes = get_mode_size_bytes(mode);
212 obstack_printf(obst, "\t.byte\t");
216 obstack_printf(obst, "\t.value\t");
220 obstack_printf(obst, "\t.long\t");
224 obstack_printf(obst, "\t.quad\t");
229 /* handled in arith */
233 fprintf(stderr, "Try to dump an tarval with %d bytes\n", bytes);
237 do_dump_atomic_init(obst, init);
238 obstack_printf(obst, "\n");
241 /************************************************************************/
242 /* Routines to dump global variables */
243 /************************************************************************/
246 * Determine if an entity is a string constant
247 * @param ent The entity
248 * @return 1 if it is a string constant, 0 otherwise
250 static int ent_is_string_const(entity *ent)
255 ty = get_entity_type(ent);
257 /* if it's an array */
258 if (is_Array_type(ty)) {
259 ir_type *elm_ty = get_array_element_type(ty);
261 /* and the array's element type is primitive */
262 if (is_Primitive_type(elm_ty)) {
263 ir_mode *mode = get_type_mode(elm_ty);
266 * and the mode of the element type is an int of
267 * the same size as the byte mode
269 if (mode_is_int(mode)
270 && get_mode_size_bits(mode) == get_mode_size_bits(mode_Bs))
274 n = get_compound_ent_n_values(ent);
275 for (i = 0; i < n; ++i) {
276 ir_node *irn = get_compound_ent_value(ent, i);
277 if(get_irn_opcode(irn) != iro_Const)
280 c = (int) get_tarval_long(get_Const_tarval(irn));
282 if((i < n - 1 && !(isgraph(c) || isspace(c)))
283 || (i == n - 1 && c != '\0'))
296 * Dump a atring constant.
297 * No checks are made!!
298 * @param obst The obst to dump on.
299 * @param ent The entity to dump.
301 static void dump_string_cst(struct obstack *obst, entity *ent)
305 obstack_printf(obst, "\t.string \"");
306 n = get_compound_ent_n_values(ent);
308 for (i = 0; i < n-1; ++i) {
312 irn = get_compound_ent_value(ent, i);
313 c = (int) get_tarval_long(get_Const_tarval(irn));
316 case '"' : obstack_printf(obst, "\\\""); break;
317 case '\n': obstack_printf(obst, "\\n"); break;
318 case '\r': obstack_printf(obst, "\\r"); break;
319 case '\t': obstack_printf(obst, "\\t"); break;
320 case '\\': obstack_printf(obst, "\\\\"); break;
323 obstack_printf(obst, "%c", c);
325 obstack_printf(obst, "%O", c);
329 obstack_printf(obst, "\"\n");
338 static void dump_object_size(struct obstack *obst, const char *name, int size) {
339 switch (asm_flavour) {
341 obstack_printf(obst, "\t.type\t%s,@object\n", name);
342 obstack_printf(obst, "\t.size\t%s,%d\n", name, size);
348 * Dumps the initialization of global variables that are not
351 static void dump_global(struct obstack *rdata_obstack, struct obstack *data_obstack, struct obstack *comm_obstack, entity *ent)
353 ir_type *ty = get_entity_type(ent);
354 const char *ld_name = get_entity_ld_name(ent);
356 struct obstack *obst = data_obstack;
359 * FIXME: did NOT work for partly constant values
361 if (! is_Method_type(ty)) {
362 ent_variability variability = get_entity_variability(ent);
363 visibility visibility = get_entity_visibility(ent);
365 if (variability == variability_constant) {
366 /* a constant entity, put it on the rdata */
367 obst = rdata_obstack;
370 /* check, whether it is initialized, if yes create data */
371 if (variability != variability_uninitialized) {
372 if (visibility == visibility_external_visible) {
373 obstack_printf(obst, ".globl\t%s\n", ld_name);
375 dump_object_size(obst, ld_name, (get_type_size_bits(ty) + 7) >> 3);
377 align = get_type_alignment_bytes(ty);
378 ia32_dump_align(obst, align);
380 obstack_printf(obst, "%s:\n", ld_name);
382 if (is_atomic_type(ty)) {
383 if (get_entity_visibility(ent) != visibility_external_allocated)
384 dump_atomic_init(obst, get_atomic_ent_value(ent));
389 if (ent_is_string_const(ent)) {
390 dump_string_cst(obst, ent);
392 else if (is_Array_type(ty)) {
395 /* potential spare values should be already included! */
396 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
397 entity *step = get_compound_ent_value_member(ent, i);
398 ir_type *stype = get_entity_type(step);
400 if (get_type_mode(stype)) {
401 int align = (get_type_alignment_bits(stype) + 7) >> 3;
402 int n = size % align;
405 obstack_printf(obst, "\t.zero\t%d\n", align - n);
409 dump_atomic_init(obst, get_compound_ent_value(ent, i));
410 size += get_type_size_bytes(stype);
412 filler = get_type_size_bytes(ty) - size;
415 obstack_printf(obst, "\t.zero\t%d\n", filler);
417 else if (is_compound_type(ty)) {
421 /* Compound entities are NOT sorted.
422 * The sorting strategy used doesn't work for `value' compound fields nor
423 * for partially_constant entities.
427 * in the worst case, every entity allocates one byte, so the type
428 * size should be equal or bigger the number of fields
430 type_size = get_type_size_bytes(ty);
431 vals = xcalloc(type_size, sizeof(*vals));
433 /* collect the values and store them at the offsets */
434 for(i = 0; i < get_compound_ent_n_values(ent); ++i) {
435 int graph_length, aipos, offset;
438 compound_graph_path *path = get_compound_ent_value_path(ent, i);
440 /* get the access path to the costant value */
441 graph_length = get_compound_graph_path_length(path);
442 ai = xcalloc(graph_length, sizeof(struct arr_info));
444 /* We wanna know how many arrays are on the path to the entity. We also have to know how
445 * many elements each array holds to calculate the offset for the entity. */
446 for (j = 0; j < graph_length; j++) {
447 entity *step = get_compound_graph_path_node(path, j);
448 ir_type *step_type = get_entity_type(step);
449 int ty_size = (get_type_size_bits(step_type) + 7) >> 3;
452 if (is_Array_type(step_type))
453 for (k = 0; k < get_array_n_dimensions(step_type); k++)
454 n += get_tarval_long(get_Const_tarval(get_array_upper_bound(step_type, k)));
456 ai[j].n_elems = n ? all_n + 1 : 0;
458 ai[j].size = ty_size;
461 aipos = graph_length - 1;
464 for (offset = j = 0; j < graph_length; j++) {
465 entity *step = get_compound_graph_path_node(path, j);
466 ir_type *step_type = get_entity_type(step);
467 int ent_ofs = get_entity_offset_bytes(step);
470 /* add all positive offsets (= offsets in structs) */
471 if (ent_ofs >= 0) offset += ent_ofs;
473 if (j == graph_length - 1) {
474 stepsize = (get_type_size_bits(step_type) + 7) >> 3;
476 /* Search the next free position in vals depending on the information from above (ai). */
477 while (vals[offset] && aipos >= 0) {
478 if (ai[aipos].visit_cnt < ai[aipos].n_elems) {
480 ai[aipos].visit_cnt++;
483 while (aipos >= 0 && ai[aipos].visit_cnt == ai[aipos].n_elems) {
484 stepsize = ai[aipos--].size;
489 assert(aipos >= 0 && "couldn't store entity");
490 vals[offset] = get_compound_ent_value(ent, i);
497 /* now write them sorted */
498 for(i = 0; i < type_size; ) {
500 dump_atomic_init(obst, vals[i]);
501 i += (get_mode_size_bytes(get_irn_mode(vals[i])));
505 obstack_printf(obst, "\t.byte\t0\n");
512 assert(0 && "unsupported type");
515 obstack_printf(obst, "\n");
517 else if (visibility != visibility_external_allocated) {
518 /* calculate the alignment */
519 align = get_type_alignment_bytes(ty);
520 h = highest_bit(align);
522 if ((1 << h) < align)
529 ia32_dump_comm(comm_obstack, ld_name, visibility,
530 (get_type_size_bits(ty) + 7) >> 3, align);
536 * Dumps declarations of global variables and the initialization code.
538 void ia32_dump_globals(struct obstack *rdata_obstack, struct obstack *data_obstack, struct obstack *comm_obstack)
540 ir_type *gt = get_glob_type();
541 int i, n = get_class_n_members(gt);
543 for (i = 0; i < n; i++)
544 dump_global(rdata_obstack, data_obstack, comm_obstack, get_class_member(gt, i));
547 /************************************************************************/
549 void ia32_gen_decls(FILE *out) {
550 struct obstack rodata, data, comm;
554 obstack_init(&rodata);
558 ia32_dump_globals(&rodata, &data, &comm);
560 size = obstack_object_size(&data);
561 cp = obstack_finish(&data);
563 ia32_switch_section(out, SECTION_DATA);
564 fwrite(cp, 1, size, out);
567 size = obstack_object_size(&rodata);
568 cp = obstack_finish(&rodata);
570 fprintf(out, "\t.section\t.rodata\n");
571 fwrite(cp, 1, size, out);
574 size = obstack_object_size(&comm);
575 cp = obstack_finish(&comm);
577 ia32_switch_section(out, SECTION_COMMON);
578 fwrite(cp, 1, size, out);
581 obstack_free(&rodata, NULL);
582 obstack_free(&data, NULL);
583 obstack_free(&comm, NULL);