X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Ftr%2Ftype.c;h=78e03d12586db31c39549560c1340a591f1cdad5;hb=2158510961e84fb11e9195c200335f2314e49055;hp=0c29b4ede2bd4d54dc26caee3c1b1d3d4dc188a7;hpb=2bc2dd4bd4f64982e9c5d2f1ea70d63d0eb10044;p=libfirm diff --git a/ir/tr/type.c b/ir/tr/type.c index 0c29b4ede..78e03d125 100644 --- a/ir/tr/type.c +++ b/ir/tr/type.c @@ -76,7 +76,8 @@ ir_type *get_code_type(void) } ir_type *firm_unknown_type; -ir_type *get_unknown_type(void) { +ir_type *get_unknown_type(void) +{ return firm_unknown_type; } @@ -144,7 +145,7 @@ ir_type *new_type(const tp_op *type_op, ir_mode *mode, type_dbg_info *db) res->kind = k_type; res->type_op = type_op; res->mode = mode; - res->visibility = visibility_external_allocated; + res->visibility = ir_visibility_external; res->flags = tf_none; res->size = 0; res->align = 0; @@ -365,7 +366,6 @@ void set_type_state(ir_type *tp, ir_type_state state) case tpo_struct: for (i = 0; i < get_struct_n_members(tp); i++) { assert(get_entity_offset(get_struct_member(tp, i)) > -1); - assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic)); } break; case tpo_union: @@ -561,7 +561,7 @@ int equal_type(ir_type *typ1, ir_type *typ2) return 0; if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2))) return 0; - for(i = 0; i < get_array_n_dimensions(typ1); i++) { + for (i = 0; i < get_array_n_dimensions(typ1); i++) { if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) || get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i)) return 0; @@ -597,7 +597,7 @@ int smaller_type(ir_type *st, ir_type *lt) if (get_type_tpop_code(st) != get_type_tpop_code(lt)) return 0; - switch(get_type_tpop_code(st)) { + switch (get_type_tpop_code(st)) { case tpo_class: return is_SubClass_of(st, lt); @@ -692,12 +692,12 @@ int smaller_type(ir_type *st, ir_type *lt) get_type_size_bytes(set) != get_type_size_bytes(let)) return 0; } - for(i = 0; i < get_array_n_dimensions(st); i++) { + for (i = 0; i < get_array_n_dimensions(st); i++) { if (get_array_lower_bound(lt, i)) - if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i)) + if (get_array_lower_bound(st, i) != get_array_lower_bound(lt, i)) return 0; if (get_array_upper_bound(lt, i)) - if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i)) + if (get_array_upper_bound(st, i) != get_array_upper_bound(lt, i)) return 0; } } break; @@ -952,7 +952,7 @@ void remove_class_supertype(ir_type *clss, ir_type *supertype) assert(clss && (clss->type_op == type_class)); for (i = 0; i < (ARR_LEN(clss->attr.ca.supertypes)); i++) if (clss->attr.ca.supertypes[i] == supertype) { - for(; i < (ARR_LEN(clss->attr.ca.supertypes))-1; i++) + for (; i < (ARR_LEN(clss->attr.ca.supertypes))-1; i++) clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1]; ARR_SETLEN(ir_entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1); break; @@ -1047,7 +1047,8 @@ void set_class_mode(ir_type *tp, ir_mode *mode) tp->mode = mode; } -void set_class_size(ir_type *tp, unsigned size) { +void set_class_size(ir_type *tp, unsigned size) +{ tp->size = size; } @@ -1055,7 +1056,6 @@ void set_class_size(ir_type *tp, unsigned size) { ir_type *new_d_type_struct(ident *name, type_dbg_info *db) { ir_type *res = new_type(type_struct, NULL, db); - assert(name != NULL); res->name = name; res->attr.sa.members = NEW_ARR_F(ir_entity *, 0); @@ -1140,7 +1140,7 @@ void remove_struct_member(ir_type *strct, ir_entity *member) assert(strct && (strct->type_op == type_struct)); for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++) if (strct->attr.sa.members[i] == member) { - for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++) + for (; i < (ARR_LEN (strct->attr.sa.members))-1; i++) strct->attr.sa.members[i] = strct->attr.sa.members[i+1]; ARR_SETLEN(ir_entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1); break; @@ -1604,7 +1604,7 @@ void remove_union_member(ir_type *uni, ir_entity *member) assert(uni && (uni->type_op == type_union)); for (i = 0; i < (ARR_LEN(uni->attr.ua.members)); i++) { if (uni->attr.ua.members[i] == member) { - for(; i < (ARR_LEN(uni->attr.ua.members))-1; i++) + for (; i < (ARR_LEN(uni->attr.ua.members))-1; i++) uni->attr.ua.members[i] = uni->attr.ua.members[i+1]; ARR_SETLEN(ir_entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1); break;