+ /* same number of arguments? */
+ if (parameter1 != NULL || parameter2 != NULL)
+ return false;
+
+ return true;
+}
+
+/**
+ * Check if two array types are compatible.
+ */
+static bool array_types_compatible(const array_type_t *array1,
+ const array_type_t *array2)
+{
+ type_t *element_type1 = skip_typeref(array1->element_type);
+ type_t *element_type2 = skip_typeref(array2->element_type);
+ if (!types_compatible(element_type1, element_type2))
+ return false;
+
+ if (!array1->size_constant || !array2->size_constant)
+ return true;
+
+ return array1->size == array2->size;
+}
+
+/**
+ * Check if two types are compatible.
+ */
+bool types_compatible(const type_t *type1, const type_t *type2)
+{
+ assert(!is_typeref(type1));
+ assert(!is_typeref(type2));
+
+ /* shortcut: the same type is always compatible */
+ if (type1 == type2)
+ return true;
+
+ if (!is_type_valid(type1) || !is_type_valid(type2))
+ return true;
+
+ if (type1->base.qualifiers != type2->base.qualifiers)
+ return false;
+ if (type1->kind != type2->kind)
+ return false;
+
+ switch (type1->kind) {
+ case TYPE_FUNCTION:
+ return function_types_compatible(&type1->function, &type2->function);
+ case TYPE_ATOMIC:
+ return type1->atomic.akind == type2->atomic.akind;
+ case TYPE_COMPLEX:
+ return type1->complex.akind == type2->complex.akind;
+ case TYPE_IMAGINARY:
+ return type1->imaginary.akind == type2->imaginary.akind;
+ case TYPE_ARRAY:
+ return array_types_compatible(&type1->array, &type2->array);
+
+ case TYPE_POINTER: {
+ const type_t *const to1 = skip_typeref(type1->pointer.points_to);
+ const type_t *const to2 = skip_typeref(type2->pointer.points_to);
+ return types_compatible(to1, to2);
+ }
+
+ case TYPE_REFERENCE: {
+ const type_t *const to1 = skip_typeref(type1->reference.refers_to);
+ const type_t *const to2 = skip_typeref(type2->reference.refers_to);
+ return types_compatible(to1, to2);
+ }
+
+ case TYPE_COMPOUND_STRUCT:
+ case TYPE_COMPOUND_UNION: {
+
+
+ break;
+ }
+ case TYPE_ENUM:
+ case TYPE_BUILTIN:
+ /* TODO: not implemented */
+ break;
+
+ case TYPE_BITFIELD:
+ /* not sure if this makes sense or is even needed, implement it if you
+ * really need it! */
+ panic("type compatibility check for bitfield type");
+
+ case TYPE_ERROR:
+ /* Hmm, the error type should be compatible to all other types */
+ return true;
+ case TYPE_INVALID:
+ panic("invalid type found in compatible types");
+ case TYPE_TYPEDEF:
+ case TYPE_TYPEOF:
+ panic("typerefs not skipped in compatible types?!?");
+ }
+
+ /* TODO: incomplete */
+ return false;
+}
+
+/**
+ * Skip all typerefs and return the underlying type.
+ */
+type_t *skip_typeref(type_t *type)
+{
+ type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
+
+ while (true) {
+ switch (type->kind) {
+ case TYPE_ERROR:
+ return type;
+ case TYPE_TYPEDEF: {
+ qualifiers |= type->base.qualifiers;
+
+ const typedef_type_t *typedef_type = &type->typedeft;
+ if (typedef_type->resolved_type != NULL) {
+ type = typedef_type->resolved_type;
+ break;
+ }
+ type = typedef_type->typedefe->type;
+ continue;
+ }
+ case TYPE_TYPEOF:
+ qualifiers |= type->base.qualifiers;
+ type = type->typeoft.typeof_type;
+ continue;
+ default:
+ break;
+ }
+ break;
+ }
+
+ if (qualifiers != TYPE_QUALIFIER_NONE) {
+ type_t *const copy = duplicate_type(type);
+
+ /* for const with typedefed array type the element type has to be
+ * adjusted */
+ if (is_type_array(copy)) {
+ type_t *element_type = copy->array.element_type;
+ element_type = duplicate_type(element_type);
+ element_type->base.qualifiers |= qualifiers;
+ copy->array.element_type = element_type;
+ } else {
+ copy->base.qualifiers |= qualifiers;
+ }
+
+ type = identify_new_type(copy);
+ }
+
+ return type;
+}
+
+unsigned get_type_size(type_t *type)
+{
+ switch (type->kind) {
+ case TYPE_INVALID:
+ break;
+ case TYPE_ERROR:
+ return 0;
+ case TYPE_ATOMIC:
+ return get_atomic_type_size(type->atomic.akind);
+ case TYPE_COMPLEX:
+ return get_atomic_type_size(type->complex.akind) * 2;
+ case TYPE_IMAGINARY:
+ return get_atomic_type_size(type->imaginary.akind);
+ case TYPE_COMPOUND_UNION:
+ layout_union_type(&type->compound);
+ return type->compound.compound->size;
+ case TYPE_COMPOUND_STRUCT:
+ layout_struct_type(&type->compound);
+ return type->compound.compound->size;
+ case TYPE_ENUM:
+ return get_atomic_type_size(type->enumt.akind);
+ case TYPE_FUNCTION:
+ return 0; /* non-const (but "address-const") */
+ case TYPE_REFERENCE:
+ case TYPE_POINTER:
+ /* TODO: make configurable by backend */
+ return 4;
+ case TYPE_ARRAY: {
+ /* TODO: correct if element_type is aligned? */
+ il_size_t element_size = get_type_size(type->array.element_type);
+ return type->array.size * element_size;
+ }
+ case TYPE_BITFIELD:
+ return 0;
+ case TYPE_BUILTIN:
+ return get_type_size(type->builtin.real_type);
+ case TYPE_TYPEDEF:
+ return get_type_size(type->typedeft.typedefe->type);
+ case TYPE_TYPEOF:
+ if (type->typeoft.typeof_type) {
+ return get_type_size(type->typeoft.typeof_type);
+ } else {
+ return get_type_size(type->typeoft.expression->base.type);
+ }
+ }
+ panic("invalid type in get_type_size");
+}
+
+unsigned get_type_alignment(type_t *type)
+{
+ switch (type->kind) {
+ case TYPE_INVALID:
+ break;
+ case TYPE_ERROR:
+ return 0;
+ case TYPE_ATOMIC:
+ return get_atomic_type_alignment(type->atomic.akind);
+ case TYPE_COMPLEX:
+ return get_atomic_type_alignment(type->complex.akind);
+ case TYPE_IMAGINARY:
+ return get_atomic_type_alignment(type->imaginary.akind);
+ case TYPE_COMPOUND_UNION:
+ layout_union_type(&type->compound);
+ return type->compound.compound->alignment;
+ case TYPE_COMPOUND_STRUCT:
+ layout_struct_type(&type->compound);
+ return type->compound.compound->alignment;
+ case TYPE_ENUM:
+ return get_atomic_type_alignment(type->enumt.akind);
+ case TYPE_FUNCTION:
+ /* what is correct here? */
+ return 4;
+ case TYPE_REFERENCE:
+ case TYPE_POINTER:
+ /* TODO: make configurable by backend */
+ return 4;
+ case TYPE_ARRAY:
+ return get_type_alignment(type->array.element_type);
+ case TYPE_BITFIELD:
+ return 0;
+ case TYPE_BUILTIN:
+ return get_type_alignment(type->builtin.real_type);
+ case TYPE_TYPEDEF: {
+ il_alignment_t alignment
+ = get_type_alignment(type->typedeft.typedefe->type);
+ if (type->typedeft.typedefe->alignment > alignment)
+ alignment = type->typedeft.typedefe->alignment;
+
+ return alignment;
+ }
+ case TYPE_TYPEOF:
+ if (type->typeoft.typeof_type) {
+ return get_type_alignment(type->typeoft.typeof_type);
+ } else {
+ return get_type_alignment(type->typeoft.expression->base.type);
+ }
+ }
+ panic("invalid type in get_type_alignment");
+}
+
+decl_modifiers_t get_type_modifiers(const type_t *type)
+{
+ switch(type->kind) {
+ case TYPE_INVALID:
+ case TYPE_ERROR:
+ break;
+ case TYPE_COMPOUND_STRUCT:
+ case TYPE_COMPOUND_UNION:
+ return type->compound.compound->modifiers;
+ case TYPE_FUNCTION:
+ return type->function.modifiers;
+ case TYPE_ENUM:
+ case TYPE_ATOMIC:
+ case TYPE_COMPLEX:
+ case TYPE_IMAGINARY:
+ case TYPE_REFERENCE:
+ case TYPE_POINTER:
+ case TYPE_BITFIELD:
+ case TYPE_ARRAY:
+ return 0;
+ case TYPE_BUILTIN:
+ return get_type_modifiers(type->builtin.real_type);
+ case TYPE_TYPEDEF: {
+ decl_modifiers_t modifiers = type->typedeft.typedefe->modifiers;
+ modifiers |= get_type_modifiers(type->typedeft.typedefe->type);
+ return modifiers;
+ }
+ case TYPE_TYPEOF:
+ if (type->typeoft.typeof_type) {
+ return get_type_modifiers(type->typeoft.typeof_type);
+ } else {
+ return get_type_modifiers(type->typeoft.expression->base.type);
+ }
+ }
+ panic("invalid type found in get_type_modifiers");
+}
+
+type_qualifiers_t get_type_qualifier(const type_t *type, bool skip_array_type)
+{
+ type_qualifiers_t qualifiers = TYPE_QUALIFIER_NONE;
+
+ while (true) {
+ switch (type->base.kind) {
+ case TYPE_ERROR:
+ return TYPE_QUALIFIER_NONE;
+ case TYPE_TYPEDEF:
+ qualifiers |= type->base.qualifiers;
+ const typedef_type_t *typedef_type = &type->typedeft;
+ if (typedef_type->resolved_type != NULL)
+ type = typedef_type->resolved_type;
+ else
+ type = typedef_type->typedefe->type;
+ continue;
+ case TYPE_TYPEOF:
+ type = type->typeoft.typeof_type;
+ continue;
+ case TYPE_ARRAY:
+ if (skip_array_type) {
+ type = type->array.element_type;
+ continue;
+ }
+ break;
+ default:
+ break;
+ }
+ break;
+ }
+ return type->base.qualifiers | qualifiers;
+}
+
+unsigned get_atomic_type_size(atomic_type_kind_t kind)
+{
+ assert(kind <= ATOMIC_TYPE_LAST);
+ return atomic_type_properties[kind].size;
+}
+
+unsigned get_atomic_type_alignment(atomic_type_kind_t kind)
+{
+ assert(kind <= ATOMIC_TYPE_LAST);
+ return atomic_type_properties[kind].alignment;
+}
+
+unsigned get_atomic_type_flags(atomic_type_kind_t kind)
+{
+ assert(kind <= ATOMIC_TYPE_LAST);
+ return atomic_type_properties[kind].flags;
+}
+
+atomic_type_kind_t get_intptr_kind(void)
+{
+ if (machine_size <= 32)
+ return ATOMIC_TYPE_INT;
+ else if (machine_size <= 64)
+ return ATOMIC_TYPE_LONG;
+ else
+ return ATOMIC_TYPE_LONGLONG;
+}
+
+atomic_type_kind_t get_uintptr_kind(void)
+{
+ if (machine_size <= 32)
+ return ATOMIC_TYPE_UINT;
+ else if (machine_size <= 64)
+ return ATOMIC_TYPE_ULONG;
+ else
+ return ATOMIC_TYPE_ULONGLONG;
+}
+
+/**
+ * Find the atomic type kind representing a given size (signed).
+ */
+atomic_type_kind_t find_signed_int_atomic_type_kind_for_size(unsigned size)
+{
+ static atomic_type_kind_t kinds[32];
+
+ assert(size < 32);
+ atomic_type_kind_t kind = kinds[size];
+ if (kind == ATOMIC_TYPE_INVALID) {
+ static const atomic_type_kind_t possible_kinds[] = {
+ ATOMIC_TYPE_SCHAR,
+ ATOMIC_TYPE_SHORT,
+ ATOMIC_TYPE_INT,
+ ATOMIC_TYPE_LONG,
+ ATOMIC_TYPE_LONGLONG
+ };
+ for (size_t i = 0; i < lengthof(possible_kinds); ++i) {
+ if (get_atomic_type_size(possible_kinds[i]) == size) {
+ kind = possible_kinds[i];
+ break;
+ }
+ }
+ kinds[size] = kind;
+ }
+ return kind;
+}
+
+/**
+ * Find the atomic type kind representing a given size (signed).
+ */
+atomic_type_kind_t find_unsigned_int_atomic_type_kind_for_size(unsigned size)
+{
+ static atomic_type_kind_t kinds[32];
+
+ assert(size < 32);
+ atomic_type_kind_t kind = kinds[size];
+ if (kind == ATOMIC_TYPE_INVALID) {
+ static const atomic_type_kind_t possible_kinds[] = {
+ ATOMIC_TYPE_UCHAR,
+ ATOMIC_TYPE_USHORT,
+ ATOMIC_TYPE_UINT,
+ ATOMIC_TYPE_ULONG,
+ ATOMIC_TYPE_ULONGLONG
+ };
+ for (size_t i = 0; i < lengthof(possible_kinds); ++i) {
+ if (get_atomic_type_size(possible_kinds[i]) == size) {
+ kind = possible_kinds[i];
+ break;
+ }
+ }
+ kinds[size] = kind;
+ }
+ return kind;
+}
+
+/**
+ * Hash the given type and return the "singleton" version
+ * of it.
+ */
+type_t *identify_new_type(type_t *type)
+{
+ type_t *result = typehash_insert(type);
+ if (result != type) {
+ obstack_free(type_obst, type);
+ }
+ return result;
+}
+
+/**
+ * Creates a new atomic type.
+ *
+ * @param akind The kind of the atomic type.
+ * @param qualifiers Type qualifiers for the new type.
+ */
+type_t *make_atomic_type(atomic_type_kind_t akind, type_qualifiers_t qualifiers)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(atomic_type_t));
+ memset(type, 0, sizeof(atomic_type_t));
+
+ type->kind = TYPE_ATOMIC;
+ type->base.qualifiers = qualifiers;
+ type->atomic.akind = akind;
+
+ return identify_new_type(type);
+}
+
+/**
+ * Creates a new complex type.
+ *
+ * @param akind The kind of the atomic type.
+ * @param qualifiers Type qualifiers for the new type.
+ */
+type_t *make_complex_type(atomic_type_kind_t akind, type_qualifiers_t qualifiers)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(complex_type_t));
+ memset(type, 0, sizeof(complex_type_t));
+
+ type->kind = TYPE_COMPLEX;
+ type->base.qualifiers = qualifiers;
+ type->complex.akind = akind;
+
+ return identify_new_type(type);
+}
+
+/**
+ * Creates a new imaginary type.
+ *
+ * @param akind The kind of the atomic type.
+ * @param qualifiers Type qualifiers for the new type.
+ */
+type_t *make_imaginary_type(atomic_type_kind_t akind, type_qualifiers_t qualifiers)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(imaginary_type_t));
+ memset(type, 0, sizeof(imaginary_type_t));
+
+ type->kind = TYPE_IMAGINARY;
+ type->base.qualifiers = qualifiers;
+ type->imaginary.akind = akind;
+
+ return identify_new_type(type);
+}
+
+/**
+ * Creates a new pointer type.
+ *
+ * @param points_to The points-to type for the new type.
+ * @param qualifiers Type qualifiers for the new type.
+ */
+type_t *make_pointer_type(type_t *points_to, type_qualifiers_t qualifiers)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(pointer_type_t));
+ memset(type, 0, sizeof(pointer_type_t));
+
+ type->kind = TYPE_POINTER;
+ type->base.qualifiers = qualifiers;
+ type->pointer.points_to = points_to;
+ type->pointer.base_variable = NULL;
+
+ return identify_new_type(type);
+}
+
+/**
+ * Creates a new reference type.
+ *
+ * @param refers_to The referred-to type for the new type.
+ */
+type_t *make_reference_type(type_t *refers_to)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(reference_type_t));
+ memset(type, 0, sizeof(reference_type_t));
+
+ type->kind = TYPE_REFERENCE;
+ type->base.qualifiers = 0;
+ type->reference.refers_to = refers_to;
+
+ return identify_new_type(type);
+}
+
+/**
+ * Creates a new based pointer type.
+ *
+ * @param points_to The points-to type for the new type.
+ * @param qualifiers Type qualifiers for the new type.
+ * @param variable The based variable
+ */
+type_t *make_based_pointer_type(type_t *points_to,
+ type_qualifiers_t qualifiers, variable_t *variable)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(pointer_type_t));
+ memset(type, 0, sizeof(pointer_type_t));
+
+ type->kind = TYPE_POINTER;
+ type->base.qualifiers = qualifiers;
+ type->pointer.points_to = points_to;
+ type->pointer.base_variable = variable;
+
+ return identify_new_type(type);
+}
+
+
+type_t *make_array_type(type_t *element_type, size_t size,
+ type_qualifiers_t qualifiers)
+{
+ type_t *type = obstack_alloc(type_obst, sizeof(array_type_t));
+ memset(type, 0, sizeof(array_type_t));
+
+ type->kind = TYPE_ARRAY;
+ type->base.qualifiers = qualifiers;
+ type->array.element_type = element_type;
+ type->array.size = size;
+ type->array.size_constant = true;
+
+ return identify_new_type(type);
+}
+
+static entity_t *pack_bitfield_members_big_endian(il_size_t *struct_offset,
+ il_alignment_t *struct_alignment, bool packed, entity_t *first)
+{
+ type_t *current_base_type = NULL;
+ il_size_t offset = *struct_offset;
+ il_alignment_t alignment = *struct_alignment;
+ size_t bit_offset = 0;
+
+ if (packed)
+ panic("packed bitfields on big-endian arch not supported yet");
+
+ entity_t *member;
+ for (member = first; member != NULL; member = member->base.next) {
+ if (member->kind != ENTITY_COMPOUND_MEMBER)
+ continue;
+
+ type_t *type = member->declaration.type;
+ if (type->kind != TYPE_BITFIELD)
+ break;
+
+ size_t bit_size = type->bitfield.bit_size;
+ type_t *base_type = skip_typeref(type->bitfield.base_type);
+
+ /* see if we need to start a new "bucket" */
+ if (base_type != current_base_type || bit_size > bit_offset) {
+ if (current_base_type != NULL)
+ offset += get_type_size(current_base_type);
+
+ current_base_type = base_type;
+ il_alignment_t base_alignment = get_type_alignment(base_type);
+ il_alignment_t alignment_mask = base_alignment-1;
+ if (base_alignment > alignment)
+ alignment = base_alignment;
+ offset = (offset + base_alignment-1) & ~alignment_mask;
+ bit_offset = get_type_size(base_type) * BITS_PER_BYTE;
+ assert(bit_offset >= bit_size);
+ }
+
+ bit_offset -= bit_size;
+ member->compound_member.offset = offset;
+ member->compound_member.bit_offset = bit_offset;
+ }
+
+ if (current_base_type != NULL)
+ offset += get_type_size(current_base_type);
+
+ *struct_offset = offset;
+ *struct_alignment = alignment;
+ return member;
+}
+
+static entity_t *pack_bitfield_members(il_size_t *struct_offset,
+ il_alignment_t *struct_alignment,
+ bool packed, entity_t *first)
+{
+ il_size_t offset = *struct_offset;
+ il_alignment_t alignment = *struct_alignment;
+ size_t bit_offset = 0;
+
+ entity_t *member;
+ for (member = first; member != NULL; member = member->base.next) {
+ if (member->kind != ENTITY_COMPOUND_MEMBER)
+ continue;
+
+ type_t *type = member->declaration.type;
+ if (type->kind != TYPE_BITFIELD)
+ break;
+
+ type_t *base_type = skip_typeref(type->bitfield.base_type);
+ il_alignment_t base_alignment = get_type_alignment(base_type);
+ il_alignment_t alignment_mask = base_alignment-1;
+ if (base_alignment > alignment)
+ alignment = base_alignment;
+
+ size_t bit_size = type->bitfield.bit_size;
+ if (!packed) {
+ bit_offset += (offset & alignment_mask) * BITS_PER_BYTE;
+ offset &= ~alignment_mask;
+ size_t base_size = get_type_size(base_type) * BITS_PER_BYTE;
+
+ if (bit_offset + bit_size > base_size || bit_size == 0) {
+ offset += (bit_offset+BITS_PER_BYTE-1) / BITS_PER_BYTE;
+ offset = (offset + base_alignment-1) & ~alignment_mask;
+ bit_offset = 0;
+ }
+ }
+
+ member->compound_member.offset = offset;
+ member->compound_member.bit_offset = bit_offset;
+
+ bit_offset += bit_size;
+ offset += bit_offset / BITS_PER_BYTE;
+ bit_offset %= BITS_PER_BYTE;
+ }
+
+ if (bit_offset > 0)
+ offset += 1;
+
+ *struct_offset = offset;
+ *struct_alignment = alignment;
+ return member;
+}
+
+void layout_struct_type(compound_type_t *type)
+{
+ assert(type->compound != NULL);
+
+ compound_t *compound = type->compound;
+ if (!compound->complete)
+ return;
+ if (type->compound->layouted)
+ return;
+
+ il_size_t offset = 0;
+ il_alignment_t alignment = compound->alignment;
+ bool need_pad = false;
+
+ entity_t *entry = compound->members.entities;
+ while (entry != NULL) {
+ if (entry->kind != ENTITY_COMPOUND_MEMBER) {
+ entry = entry->base.next;
+ continue;
+ }
+
+ type_t *m_type = entry->declaration.type;
+ type_t *skipped = skip_typeref(m_type);
+ if (! is_type_valid(skipped)) {
+ entry = entry->base.next;
+ continue;
+ }
+
+ if (skipped->kind == TYPE_BITFIELD) {
+ if (byte_order_big_endian) {
+ entry = pack_bitfield_members_big_endian(&offset, &alignment,
+ compound->packed,
+ entry);
+ } else {
+ entry = pack_bitfield_members(&offset, &alignment,
+ compound->packed, entry);
+ }
+ continue;
+ }
+
+ il_alignment_t m_alignment = get_type_alignment(m_type);
+ if (m_alignment > alignment)
+ alignment = m_alignment;
+
+ if (!compound->packed) {
+ il_size_t new_offset = (offset + m_alignment-1) & -m_alignment;
+
+ if (new_offset > offset) {
+ need_pad = true;
+ offset = new_offset;
+ }
+ }
+
+ entry->compound_member.offset = offset;
+ offset += get_type_size(m_type);
+
+ entry = entry->base.next;
+ }
+
+ if (!compound->packed) {
+ il_size_t new_offset = (offset + alignment-1) & -alignment;
+ if (new_offset > offset) {
+ need_pad = true;
+ offset = new_offset;
+ }
+ }
+
+ if (need_pad) {
+ if (warning.padded) {
+ warningf(&compound->base.source_position, "'%T' needs padding",
+ type);
+ }
+ } else if (compound->packed && warning.packed) {
+ warningf(&compound->base.source_position,
+ "superfluous packed attribute on '%T'", type);
+ }
+
+ compound->size = offset;
+ compound->alignment = alignment;
+ compound->layouted = true;
+}
+
+void layout_union_type(compound_type_t *type)
+{
+ assert(type->compound != NULL);
+
+ compound_t *compound = type->compound;
+ if (! compound->complete)
+ return;
+
+ il_size_t size = 0;
+ il_alignment_t alignment = compound->alignment;
+
+ entity_t *entry = compound->members.entities;
+ for (; entry != NULL; entry = entry->base.next) {
+ if (entry->kind != ENTITY_COMPOUND_MEMBER)
+ continue;
+
+ type_t *m_type = entry->declaration.type;
+ if (! is_type_valid(skip_typeref(m_type)))
+ continue;
+
+ entry->compound_member.offset = 0;
+ il_size_t m_size = get_type_size(m_type);
+ if (m_size > size)
+ size = m_size;
+ il_alignment_t m_alignment = get_type_alignment(m_type);
+ if (m_alignment > alignment)
+ alignment = m_alignment;
+ }
+ size = (size + alignment - 1) & -alignment;
+
+ compound->size = size;
+ compound->alignment = alignment;
+}
+
+static function_parameter_t *allocate_parameter(type_t *const type)
+{
+ function_parameter_t *const param
+ = obstack_alloc(type_obst, sizeof(*param));
+ memset(param, 0, sizeof(*param));
+ param->type = type;
+ return param;
+}
+
+type_t *make_function_2_type(type_t *return_type, type_t *argument_type1,
+ type_t *argument_type2)
+{
+ function_parameter_t *const parameter2 = allocate_parameter(argument_type2);
+ function_parameter_t *const parameter1 = allocate_parameter(argument_type1);
+ parameter1->next = parameter2;
+
+ type_t *type = allocate_type_zero(TYPE_FUNCTION);
+ type->function.return_type = return_type;
+ type->function.parameters = parameter1;
+ type->function.linkage = LINKAGE_C;
+
+ return identify_new_type(type);
+}
+
+type_t *make_function_1_type(type_t *return_type, type_t *argument_type)
+{
+ function_parameter_t *const parameter = allocate_parameter(argument_type);
+
+ type_t *type = allocate_type_zero(TYPE_FUNCTION);
+ type->function.return_type = return_type;
+ type->function.parameters = parameter;
+ type->function.linkage = LINKAGE_C;
+
+ return identify_new_type(type);
+}
+
+type_t *make_function_1_type_variadic(type_t *return_type,
+ type_t *argument_type)
+{
+ function_parameter_t *const parameter = allocate_parameter(argument_type);
+
+ type_t *type = allocate_type_zero(TYPE_FUNCTION);
+ type->function.return_type = return_type;
+ type->function.parameters = parameter;
+ type->function.variadic = true;
+ type->function.linkage = LINKAGE_C;
+
+ return identify_new_type(type);
+}
+
+type_t *make_function_0_type(type_t *return_type)
+{
+ type_t *type = allocate_type_zero(TYPE_FUNCTION);
+ type->function.return_type = return_type;
+ type->function.parameters = NULL;
+ type->function.linkage = LINKAGE_C;
+
+ return identify_new_type(type);
+}
+
+type_t *make_function_type(type_t *return_type, int n_types,
+ type_t *const *argument_types,
+ decl_modifiers_t modifiers)
+{
+ type_t *type = allocate_type_zero(TYPE_FUNCTION);
+ type->function.return_type = return_type;
+ type->function.modifiers |= modifiers;
+ type->function.linkage = LINKAGE_C;
+
+ function_parameter_t *last = NULL;
+ for (int i = 0; i < n_types; ++i) {
+ function_parameter_t *parameter = allocate_parameter(argument_types[i]);
+ if (last == NULL) {
+ type->function.parameters = parameter;
+ } else {
+ last->next = parameter;
+ }
+ last = parameter;
+ }
+
+ return identify_new_type(type);