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)) {
154 case symconst_addr_name:
155 obstack_printf(obst, "%s", get_id_str(get_SymConst_name(init)));
158 case symconst_addr_ent:
159 obstack_printf(obst, "%s", get_entity_ld_name(get_SymConst_entity(init)));
162 case symconst_type_size:
163 obstack_printf(obst, "%d", get_type_size_bytes(get_SymConst_type(init)));
166 case symconst_type_align:
167 obstack_printf(obst, "%d", get_type_alignment_bytes(get_SymConst_type(init)));
170 case symconst_enum_const:
171 tarval_snprintf(buf, sizeof(buf), get_enumeration_value(get_SymConst_enum(init)));
172 obstack_printf(obst, "%s", buf);
176 assert(0 && "dump_atomic_init(): don't know how to init from this SymConst");
181 do_dump_atomic_init(obst, get_Add_left(init));
182 obstack_printf(obst, " + ");
183 do_dump_atomic_init(obst, get_Add_right(init));
187 do_dump_atomic_init(obst, get_Sub_left(init));
188 obstack_printf(obst, " - ");
189 do_dump_atomic_init(obst, get_Sub_right(init));
193 do_dump_atomic_init(obst, get_Mul_left(init));
194 obstack_printf(obst, " * ");
195 do_dump_atomic_init(obst, get_Mul_right(init));
199 assert(0 && "dump_atomic_init(): unknown IR-node");
204 * dump an atomic value
206 static void dump_atomic_init(struct obstack *obst, ir_node *init)
208 ir_mode *mode = get_irn_mode(init);
209 int bytes = get_mode_size_bytes(mode);
214 obstack_printf(obst, "\t.byte\t");
218 obstack_printf(obst, "\t.value\t");
222 obstack_printf(obst, "\t.long\t");
226 obstack_printf(obst, "\t.quad\t");
231 /* handled in arith */
235 fprintf(stderr, "Try to dump an tarval with %d bytes\n", bytes);
239 do_dump_atomic_init(obst, init);
240 obstack_printf(obst, "\n");
243 /************************************************************************/
244 /* Routines to dump global variables */
245 /************************************************************************/
248 * Determine if an entity is a string constant
249 * @param ent The entity
250 * @return 1 if it is a string constant, 0 otherwise
252 static int ent_is_string_const(entity *ent)
257 ty = get_entity_type(ent);
259 /* if it's an array */
260 if (is_Array_type(ty)) {
261 ir_type *elm_ty = get_array_element_type(ty);
263 /* and the array's element type is primitive */
264 if (is_Primitive_type(elm_ty)) {
265 ir_mode *mode = get_type_mode(elm_ty);
268 * and the mode of the element type is an int of
269 * the same size as the byte mode
271 if (mode_is_int(mode)
272 && get_mode_size_bits(mode) == get_mode_size_bits(mode_Bs))
276 n = get_compound_ent_n_values(ent);
277 for (i = 0; i < n; ++i) {
278 ir_node *irn = get_compound_ent_value(ent, i);
279 if(get_irn_opcode(irn) != iro_Const)
282 c = (int) get_tarval_long(get_Const_tarval(irn));
284 if((i < n - 1 && !(isgraph(c) || isspace(c)))
285 || (i == n - 1 && c != '\0'))
298 * Dump a atring constant.
299 * No checks are made!!
300 * @param obst The obst to dump on.
301 * @param ent The entity to dump.
303 static void dump_string_cst(struct obstack *obst, entity *ent)
307 obstack_printf(obst, "\t.string \"");
308 n = get_compound_ent_n_values(ent);
310 for (i = 0; i < n-1; ++i) {
314 irn = get_compound_ent_value(ent, i);
315 c = (int) get_tarval_long(get_Const_tarval(irn));
318 case '"' : obstack_printf(obst, "\\\""); break;
319 case '\n': obstack_printf(obst, "\\n"); break;
320 case '\r': obstack_printf(obst, "\\r"); break;
321 case '\t': obstack_printf(obst, "\\t"); break;
322 case '\\': obstack_printf(obst, "\\\\"); break;
325 obstack_printf(obst, "%c", c);
327 obstack_printf(obst, "%O", c);
331 obstack_printf(obst, "\"\n");
340 static void dump_object_size(struct obstack *obst, const char *name, int size) {
341 switch (asm_flavour) {
343 obstack_printf(obst, "\t.type\t%s,@object\n", name);
344 obstack_printf(obst, "\t.size\t%s,%d\n", name, size);
350 * Dumps the initialization of global variables that are not
353 static void dump_global(struct obstack *rdata_obstack, struct obstack *data_obstack, struct obstack *comm_obstack, entity *ent)
355 ir_type *ty = get_entity_type(ent);
356 const char *ld_name = get_entity_ld_name(ent);
358 struct obstack *obst = data_obstack;
361 * FIXME: did NOT work for partly constant values
363 if (! is_Method_type(ty)) {
364 ent_variability variability = get_entity_variability(ent);
365 visibility visibility = get_entity_visibility(ent);
367 if (variability == variability_constant) {
368 /* a constant entity, put it on the rdata */
369 obst = rdata_obstack;
372 /* check, whether it is initialized, if yes create data */
373 if (variability != variability_uninitialized) {
374 if (visibility == visibility_external_visible) {
375 obstack_printf(obst, ".globl\t%s\n", ld_name);
377 dump_object_size(obst, ld_name, (get_type_size_bits(ty) + 7) >> 3);
379 align = get_type_alignment_bytes(ty);
380 ia32_dump_align(obst, align);
382 obstack_printf(obst, "%s:\n", ld_name);
384 if (is_atomic_type(ty)) {
385 if (get_entity_visibility(ent) != visibility_external_allocated)
386 dump_atomic_init(obst, get_atomic_ent_value(ent));
391 if (ent_is_string_const(ent)) {
392 dump_string_cst(obst, ent);
394 else if (is_Array_type(ty)) {
397 /* potential spare values should be already included! */
398 for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
399 entity *step = get_compound_ent_value_member(ent, i);
400 ir_type *stype = get_entity_type(step);
402 if (get_type_mode(stype)) {
403 int align = (get_type_alignment_bits(stype) + 7) >> 3;
404 int n = size % align;
407 obstack_printf(obst, "\t.zero\t%d\n", align - n);
411 dump_atomic_init(obst, get_compound_ent_value(ent, i));
412 size += get_type_size_bytes(stype);
414 filler = get_type_size_bytes(ty) - size;
417 obstack_printf(obst, "\t.zero\t%d\n", filler);
419 else if (is_compound_type(ty)) {
423 /* Compound entities are NOT sorted.
424 * The sorting strategy used doesn't work for `value' compound fields nor
425 * for partially_constant entities.
429 * in the worst case, every entity allocates one byte, so the type
430 * size should be equal or bigger the number of fields
432 type_size = get_type_size_bytes(ty);
433 vals = xcalloc(type_size, sizeof(*vals));
435 /* collect the values and store them at the offsets */
436 for(i = 0; i < get_compound_ent_n_values(ent); ++i) {
437 int graph_length, aipos, offset;
440 compound_graph_path *path = get_compound_ent_value_path(ent, i);
442 /* get the access path to the costant value */
443 graph_length = get_compound_graph_path_length(path);
444 ai = xcalloc(graph_length, sizeof(struct arr_info));
446 /* We wanna know how many arrays are on the path to the entity. We also have to know how
447 * many elements each array holds to calculate the offset for the entity. */
448 for (j = 0; j < graph_length; j++) {
449 entity *step = get_compound_graph_path_node(path, j);
450 ir_type *step_type = get_entity_type(step);
451 int ty_size = (get_type_size_bits(step_type) + 7) >> 3;
454 if (is_Array_type(step_type))
455 for (k = 0; k < get_array_n_dimensions(step_type); k++)
456 n += get_tarval_long(get_Const_tarval(get_array_upper_bound(step_type, k)));
458 ai[j].n_elems = n ? all_n + 1 : 0;
460 ai[j].size = ty_size;
463 aipos = graph_length - 1;
466 for (offset = j = 0; j < graph_length; j++) {
467 entity *step = get_compound_graph_path_node(path, j);
468 ir_type *step_type = get_entity_type(step);
469 int ent_ofs = get_entity_offset_bytes(step);
472 /* add all positive offsets (= offsets in structs) */
473 if (ent_ofs >= 0) offset += ent_ofs;
475 if (j == graph_length - 1) {
476 stepsize = (get_type_size_bits(step_type) + 7) >> 3;
478 /* Search the next free position in vals depending on the information from above (ai). */
479 while (vals[offset] && aipos >= 0) {
480 if (ai[aipos].visit_cnt < ai[aipos].n_elems) {
482 ai[aipos].visit_cnt++;
485 while (aipos >= 0 && ai[aipos].visit_cnt == ai[aipos].n_elems) {
486 stepsize = ai[aipos--].size;
491 assert(aipos >= 0 && "couldn't store entity");
492 vals[offset] = get_compound_ent_value(ent, i);
499 /* now write them sorted */
500 for(i = 0; i < type_size; ) {
502 dump_atomic_init(obst, vals[i]);
503 i += (get_mode_size_bytes(get_irn_mode(vals[i])));
507 obstack_printf(obst, "\t.byte\t0\n");
514 assert(0 && "unsupported type");
517 obstack_printf(obst, "\n");
519 else if (visibility != visibility_external_allocated) {
520 /* calculate the alignment */
521 align = get_type_alignment_bytes(ty);
522 h = highest_bit(align);
524 if ((1 << h) < align)
531 ia32_dump_comm(comm_obstack, ld_name, visibility,
532 (get_type_size_bits(ty) + 7) >> 3, align);
538 * Dumps declarations of global variables and the initialization code.
540 void ia32_dump_globals(struct obstack *rdata_obstack, struct obstack *data_obstack, struct obstack *comm_obstack)
542 ir_type *gt = get_glob_type();
543 int i, n = get_class_n_members(gt);
545 for (i = 0; i < n; i++)
546 dump_global(rdata_obstack, data_obstack, comm_obstack, get_class_member(gt, i));
549 /************************************************************************/
551 void ia32_gen_decls(FILE *out) {
552 struct obstack rodata, data, comm;
556 obstack_init(&rodata);
560 ia32_dump_globals(&rodata, &data, &comm);
562 size = obstack_object_size(&data);
563 cp = obstack_finish(&data);
565 ia32_switch_section(out, SECTION_DATA);
566 fwrite(cp, 1, size, out);
569 size = obstack_object_size(&rodata);
570 cp = obstack_finish(&rodata);
572 fprintf(out, "\t.section\t.rodata\n");
573 fwrite(cp, 1, size, out);
576 size = obstack_object_size(&comm);
577 cp = obstack_finish(&comm);
579 ia32_switch_section(out, SECTION_COMMON);
580 fwrite(cp, 1, size, out);
583 obstack_free(&rodata, NULL);
584 obstack_free(&data, NULL);
585 obstack_free(&comm, NULL);