[libfirm] / ir / tr / type.c

/*
 * Project:     libFIRM
 * File name:   ir/tr/type.c
 * Purpose:     Representation of types.
 * Author:      Goetz Lindenmaier
 * Modified by: Michael Beck
 * Created:
 * CVS-ID:      $Id$
 * Copyright:   (c) 2001-2003 Universität Karlsruhe
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */

/**
 *
 *  @file type.c
 *
 *  Implementation of the datastructure to hold
 *  type information.
 *
 *  (C) 2001-2005 by Universitaet Karlsruhe
 *  Goetz Lindenmaier
 *
 *  This module supplies a datastructure to represent all types
 *  known in the compiled program.  This includes types specified
 *  in the program as well as types defined by the language.  In the
 *  view of the intermediate representation there is no difference
 *  between these types.
 *
 *  There exist several kinds of types, arranged by the structure of
 *  the type.  A type is described by a set of attributes.  Some of
 *  these attributes are common to all types, others depend on the
 *  kind of the type.
 *
 *  Types are different from the modes defined in irmode:  Types are
 *  on the level of the programming language, modes at the level of
 *  the target processor.
 *
 * @see  type_t.h type tpop
 */

#ifdef HAVE_CONFIG_H
# include "config.h"
#endif

#ifdef HAVE_ALLOCA_H
#include <alloca.h>
#endif
#ifdef HAVE_MALLOC_H
#include <malloc.h>
#endif
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STDLIB_H
# include <stdlib.h>
#endif

# include <stddef.h>

# include "type_t.h"

# include "xmalloc.h"
# include "irprog_t.h"
# include "ircons.h"
# include "tpop_t.h"
# include "typegmod.h"
# include "mangle.h"
# include "tv_t.h"
# include "irhooks.h"

# include "array.h"

/*-----------------------------------------------------------------*/
/** TYPE                                                          **/
/*-----------------------------------------------------------------*/

type *firm_none_type;    type *get_none_type(void)    { return firm_none_type;    }
type *firm_unknown_type; type *get_unknown_type(void) { return firm_unknown_type; }


#ifdef DEBUG_libfirm
/* Returns a new, unique number to number nodes or the like. */
int get_irp_new_node_nr(void);
#endif

/* Suffixes added to types used for pass-by-value representations. */
static ident *value_params_suffix = NULL;
static ident *value_ress_suffix = NULL;

/* Initialize the type module. */
void firm_init_type(dbg_info *builtin_db)
{
  value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
  value_ress_suffix   = new_id_from_str(VALUE_RESS_SUFFIX);

  /* construct none and unknown type. */
  firm_none_type    = new_type(tpop_none,    mode_BAD, new_id_from_str("type_none"), builtin_db);
  set_type_size_bits(firm_none_type, 0);
  set_type_state (firm_none_type, layout_fixed);
  remove_irp_type(firm_none_type);

  firm_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"), builtin_db);
  set_type_size_bits(firm_unknown_type, 0);
  set_type_state (firm_unknown_type, layout_fixed);
  remove_irp_type(firm_unknown_type);
}

/** the global type visited flag */
unsigned long firm_type_visited;

void (set_master_type_visited)(unsigned long val) { _set_master_type_visited(val); }
unsigned long (get_master_type_visited)(void)     { return _get_master_type_visited(); }
void (inc_master_type_visited)(void)              { _inc_master_type_visited(); }

/*
 * Creates a new type representation.
 */
type *
new_type(tp_op *type_op, ir_mode *mode, ident *name, dbg_info *db) {
  type *res;
  int node_size;

  assert(type_op != type_id);
  assert(!id_contains_char(name, ' ') && "type name should not contain spaces");

  node_size = offsetof(type, attr) +  type_op->attr_size;
  res = xmalloc(node_size);
  memset(res, 0, node_size);

  res->kind       = k_type;
  res->type_op    = type_op;
  res->mode       = mode;
  res->name       = name;
  res->visibility = visibility_external_allocated;
  res->frame_type = 0;
  res->state      = layout_undefined;
  res->size       = -1;
  res->align      = -1;
  res->visit      = 0;
  res->link       = NULL;
  res->dbi        = db;
#ifdef DEBUG_libfirm
  res->nr         = get_irp_new_node_nr();
#endif /* defined DEBUG_libfirm */

  add_irp_type(res);   /* Remember the new type global. */

  return res;
}

void        free_type(type *tp) {
  const tp_op *op = get_type_tpop(tp);

  if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
    return;
  /* Remove from list of all types */
  remove_irp_type(tp);
  /* Free the attributes of the type. */
  free_type_attrs(tp);
  /* Free entities automatically allocated with the type */
  if (op->ops.free_auto_entities)
    op->ops.free_auto_entities(tp);
  /* And now the type itself... */
  tp->kind = k_BAD;
  free(tp);
}

void free_type_entities(type *tp) {
  const tp_op *tpop = get_type_tpop(tp);

  if (tpop->ops.free_entities)
    tpop->ops.free_entities(tp);
}

void free_type_attrs(type *tp) {
  const tp_op *tpop = get_type_tpop(tp);

  if (tpop->ops.free_attrs)
    tpop->ops.free_attrs(tp);
}

/* set/get the link field */
void *(get_type_link)(const type *tp) {
  return _get_type_link(tp);
}

void (set_type_link)(type *tp, void *l) {
  _set_type_link(tp, l);
}

const tp_op *(get_type_tpop)(const type *tp) {
  return _get_type_tpop(tp);
}

ident *(get_type_tpop_nameid)(const type *tp) {
  return _get_type_tpop_nameid(tp);
}

const char* get_type_tpop_name(const type *tp) {
  assert(tp && tp->kind == k_type);
  return get_id_str(tp->type_op->name);
}

tp_opcode (get_type_tpop_code)(const type *tp) {
  return _get_type_tpop_code(tp);
}

ir_mode *(get_type_mode)(const type *tp) {
  return _get_type_mode(tp);
}

void        set_type_mode(type *tp, ir_mode *mode) {
  const tp_op *tpop = get_type_tpop(tp);

  if (tpop->ops.set_type_mode)
    tpop->ops.set_type_mode(tp, mode);
  else
    assert(0 && "setting a mode is NOT allowed for this type");
}

ident *(get_type_ident)(const type *tp) {
  return _get_type_ident(tp);
}

void (set_type_ident)(type *tp, ident* id) {
  _set_type_ident(tp, id);
}

/* Outputs a unique number for this node */
long get_type_nr(const type *tp) {
  assert(tp);
#ifdef DEBUG_libfirm
  return tp->nr;
#else
  return (long)tp;
#endif
}

const char* get_type_name(const type *tp) {
  assert(tp && tp->kind == k_type);
  return (get_id_str(tp->name));
}

int (get_type_size_bytes)(const type *tp) {
  return _get_type_size_bytes(tp);
}

int (get_type_size_bits)(const type *tp) {
  return _get_type_size_bits(tp);
}


visibility get_type_visibility (const type *tp) {
#if 0
  visibility res =  visibility_local;
  if (is_compound_type(tp)) {

    if (is_Array_type(tp)) {
      entity *mem = get_array_element_entity(tp);
      if (get_entity_visibility(mem) != visibility_local)
        res = visibility_external_visible;
    } else {
      int i, n_mems = get_compound_n_members(tp);
      for (i = 0; i < n_mems; ++i) {
        entity *mem = get_compound_member(tp, i);
        if (get_entity_visibility(mem) != visibility_local)
          res = visibility_external_visible;
      }
    }
  }
  return res;
#endif
  assert(is_type(tp));
  return tp->visibility;
}

void       set_type_visibility (type *tp, visibility v) {
  assert(is_type(tp));
#if 0
  /* check for correctness */
  if (v != visibility_external_allocated) {
    visibility res =  visibility_local;
    if (is_compound_type(tp)) {
      if (is_Array_type(tp)) {
        entity *mem = get_array_element_entity(tp);
        if (get_entity_visibility(mem) >  res)
                res = get_entity_visibility(mem);
      } else {
        int i, n_mems = get_compound_n_members(tp);
        for (i = 0; i < n_mems; ++i) {
                entity *mem = get_compound_member(tp, i);
                if (get_entity_visibility(mem) > res)
                  res = get_entity_visibility(mem);
        }
      }
    }
    assert(res < v);
  }
#endif
  tp->visibility = v;
}

void
set_type_size_bits(type *tp, int size) {
  const tp_op *tpop = get_type_tpop(tp);

  if (tpop->ops.set_type_size)
    tpop->ops.set_type_size(tp, size);
  else
    assert(0 && "Cannot set size for this type");
}

void
set_type_size_bytes(type *tp, int size) {
  set_type_size_bits(tp, 8*size);
}

int get_type_alignment_bytes(type *tp) {
  int align = get_type_alignment_bits(tp);

  return align < 0 ? align : (align + 7) >> 3;
}

int get_type_alignment_bits(type *tp) {
  int align = 8;

  if (tp->align > 0)
    return tp->align;

  /* alignment NOT set calculate it "on demand" */
  if (tp->mode)
    align = get_mode_size_bits(tp->mode);
  else if (is_Array_type(tp))
    align = get_type_alignment_bits(get_array_element_type(tp));
  else if (is_compound_type(tp)) {
    int i, n = get_compound_n_members(tp);

    align = 0;
    for (i = 0; i < n; ++i) {
      type *t = get_entity_type(get_compound_member(tp, i));
      int   a = get_type_alignment_bits(t);

      if (a > align)
        align = a;
    }
  }
  else if (is_Method_type(tp))
    align = 0;

  /* write back */
  tp->align = align;

  return align;
}

void
set_type_alignment_bits(type *tp, int align) {
  assert(tp && tp->kind == k_type);
  /* Methods don't have an alignment. */
  if (tp->type_op != type_method) {
    tp->align = align;
  }
}

void
set_type_alignment_bytes(type *tp, int align) {
  set_type_alignment_bits(tp, 8*align);
}

/* Returns a human readable string for the enum entry. */
const char *get_type_state_name(type_state s) {
#define X(a)    case a: return #a;
  switch (s) {
    X(layout_undefined);
    X(layout_fixed);
  }
  return "<unknown>";
#undef X
}


type_state (get_type_state)(const type *tp) {
  return _get_type_state(tp);
}

void
set_type_state(type *tp, type_state state) {
  assert(tp && tp->kind == k_type);

  if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
      (tp->type_op == type_method))
    return;

  /* Just a correctness check: */
  if (state == layout_fixed) {
    int i;
    switch (get_type_tpop_code(tp)) {
    case tpo_class:
      {
    assert(get_type_size_bits(tp) > -1);
    if (tp != get_glob_type()) {
      int n_mem = get_class_n_members(tp);
      for (i = 0; i < n_mem; i++) {
        if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
          { DDMT(tp); DDME(get_class_member(tp, i)); }
        assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
            /* TR ??
        assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
           (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
                   */
      }
    }
      } break;
    case tpo_struct:
      {
        assert(get_type_size_bits(tp) > -1);
        for (i = 0; i < get_struct_n_members(tp); i++) {
          assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
          assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
        }
      } break;
    case tpo_union:
      { /* ?? */
      } break;
    case tpo_array:
      { /* ??
         Check order?
         Assure that only innermost dimension is dynamic? */
      } break;
    case tpo_enumeration:
      {
        assert(get_type_mode != NULL);
        for (i = 0; i < get_enumeration_n_enums(tp); i++)
          assert(get_enumeration_enum(tp, i) != NULL);
      } break;
    default: break;
    } /* switch (tp) */
  }
  tp->state = state;
}

unsigned long (get_type_visited)(const type *tp) {
  return _get_type_visited(tp);
}

void (set_type_visited)(type *tp, unsigned long num) {
  _set_type_visited(tp, num);
}

/* Sets visited field in type to type_visited. */
void (mark_type_visited)(type *tp) {
  _mark_type_visited(tp);
}

int (type_visited)(const type *tp) {
  return _type_visited(tp);
}

int (type_not_visited)(const type *tp) {
  return _type_not_visited(tp);
}

int (is_type)(const void *thing) {
  return _is_type(thing);
}

/* Checks whether two types are structural equal.*/
int equal_type(type *typ1, type *typ2) {
  entity **m;
  type **t;
  int i, j;

  if (typ1 == typ2) return 1;

  if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
      (get_type_ident(typ1) != get_type_ident(typ2)) ||
      (get_type_mode(typ1) != get_type_mode(typ2)) ||
      (get_type_state(typ1) != get_type_state(typ2)))
    return 0;
  if ((get_type_state(typ1) == layout_fixed) &&
      (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
    return 0;

  switch (get_type_tpop_code(typ1)) {
  case tpo_class:       {
    if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
    if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
    if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
    if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
    /** Compare the members **/
    m = alloca(sizeof(entity *) * get_class_n_members(typ1));
    memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
    /* First sort the members of typ2 */
    for (i = 0; i < get_class_n_members(typ1); i++) {
      entity *e1 = get_class_member(typ1, i);
      for (j = 0; j < get_class_n_members(typ2); j++) {
        entity *e2 = get_class_member(typ2, j);
        if (get_entity_name(e1) == get_entity_name(e2))
          m[i] = e2;
      }
    }
    for (i = 0; i < get_class_n_members(typ1); i++) {
      if (!m[i]  ||  /* Found no counterpart */
          !equal_entity(get_class_member(typ1, i), m[i]))
        return 0;
    }
    /** Compare the supertypes **/
    t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
    memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
    /* First sort the supertypes of typ2 */
    for (i = 0; i < get_class_n_supertypes(typ1); i++) {
      type *t1 = get_class_supertype(typ1, i);
      for (j = 0; j < get_class_n_supertypes(typ2); j++) {
        type *t2 = get_class_supertype(typ2, j);
        if (get_type_ident(t2) == get_type_ident(t1))
          t[i] = t2;
      }
    }
    for (i = 0; i < get_class_n_supertypes(typ1); i++) {
      if (!t[i]  ||  /* Found no counterpart */
          get_class_supertype(typ1, i) != t[i])
        return 0;
    }
  } break;
  case tpo_struct:      {
    if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
    m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
    memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
    /* First sort the members of lt */
    for (i = 0; i < get_struct_n_members(typ1); i++) {
      entity *e1 = get_struct_member(typ1, i);
      for (j = 0; j < get_struct_n_members(typ2); j++) {
        entity *e2 = get_struct_member(typ2, j);
        if (get_entity_name(e1) == get_entity_name(e2))
          m[i] = e2;
      }
    }
    for (i = 0; i < get_struct_n_members(typ1); i++) {
      if (!m[i]  ||  /* Found no counterpart */
          !equal_entity(get_struct_member(typ1, i), m[i]))
        return 0;
    }
  } break;
  case tpo_method:      {
    int n_param1, n_param2;

    if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
    if (get_method_n_ress(typ1)      != get_method_n_ress(typ2)) return 0;

    if (get_method_variadicity(typ1) == variadicity_non_variadic) {
      n_param1 = get_method_n_params(typ1);
      n_param2 = get_method_n_params(typ2);
    }
    else {
      n_param1 = get_method_first_variadic_param_index(typ1);
      n_param2 = get_method_first_variadic_param_index(typ2);
    }

    if (n_param1 != n_param2) return 0;

    for (i = 0; i < n_param1; i++) {
      if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
    return 0;
    }
    for (i = 0; i < get_method_n_ress(typ1); i++) {
      if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
        return 0;
    }
  } break;
  case tpo_union:       {
    if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
    m = alloca(sizeof(entity *) * get_union_n_members(typ1));
    memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
    /* First sort the members of lt */
    for (i = 0; i < get_union_n_members(typ1); i++) {
      entity *e1 = get_union_member(typ1, i);
      for (j = 0; j < get_union_n_members(typ2); j++) {
        entity *e2 = get_union_member(typ2, j);
        if (get_entity_name(e1) == get_entity_name(e2))
          m[i] = e2;
      }
    }
    for (i = 0; i < get_union_n_members(typ1); i++) {
      if (!m[i]  ||  /* Found no counterpart */
          !equal_entity(get_union_member(typ1, i), m[i]))
        return 0;
    }
  } break;
  case tpo_array:       {
    if (get_array_n_dimensions(typ1) != get_array_n_dimensions(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++) {
      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;
      if (get_array_order(typ1, i) != get_array_order(typ2, i))
        assert(0 && "type compare with different dimension orders not implemented");
    }
  } break;
  case tpo_enumeration: {
    assert(0 && "enumerations not implemented");
  } break;
  case tpo_pointer:     {
    if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
      return 0;
  } break;
  case tpo_primitive:   {
  } break;
  default: break;
  }
  return 1;
}

/* Checks whether two types are structural comparable. */
int smaller_type (type *st, type *lt) {
  entity **m;
  int i, j;

  if (st == lt) return 1;

  if (get_type_tpop_code(st) != get_type_tpop_code(lt))
    return 0;

  switch(get_type_tpop_code(st)) {
  case tpo_class:       {
    return is_subclass_of(st, lt);
  } break;
  case tpo_struct:      {
    if (get_struct_n_members(st) != get_struct_n_members(lt)) return 0;
    m = alloca(sizeof(entity *) * get_struct_n_members(st));
    memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
    /* First sort the members of lt */
    for (i = 0; i < get_struct_n_members(st); i++) {
      entity *se = get_struct_member(st, i);
      for (j = 0; j < get_struct_n_members(lt); j++) {
        entity *le = get_struct_member(lt, j);
        if (get_entity_name(le) == get_entity_name(se))
          m[i] = le;
      }
    }
    for (i = 0; i < get_struct_n_members(st); i++) {
      if (!m[i]  ||  /* Found no counterpart */
          !smaller_type(get_entity_type(get_struct_member(st, i)),
                get_entity_type(m[i])))
        return 0;
    }
  } break;
  case tpo_method:      {
    /** FIXME: is this still 1? */
    if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
    if (get_method_n_params(st) != get_method_n_params(lt)) return 0;
    if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
    for (i = 0; i < get_method_n_params(st); i++) {
      if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
        return 0;
    }
    for (i = 0; i < get_method_n_ress(st); i++) {
      if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
        return 0;
    }
  } break;
  case tpo_union:       {
    if (get_union_n_members(st) != get_union_n_members(lt)) return 0;
    m = alloca(sizeof(entity *) * get_union_n_members(st));
    memset(m, 0, sizeof(entity *) * get_union_n_members(st));
    /* First sort the members of lt */
    for (i = 0; i < get_union_n_members(st); i++) {
      entity *se = get_union_member(st, i);
      for (j = 0; j < get_union_n_members(lt); j++) {
        entity *le = get_union_member(lt, j);
        if (get_entity_name(le) == get_entity_name(se))
          m[i] = le;
          }
    }
    for (i = 0; i < get_union_n_members(st); i++) {
      if (!m[i]  ||  /* Found no counterpart */
          !smaller_type(get_entity_type(get_union_member(st, i)),
                get_entity_type(m[i])))
        return 0;
    }
  } break;
  case tpo_array:       {
    type *set, *let;  /* small/large elt. type */
    if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
      return 0;
    set = get_array_element_type(st);
    let = get_array_element_type(lt);
    if (set != let) {
      /* If the element types are different, set must be convertible
         to let, and they must have the same size so that address
         computations work out.  To have a size the layout must
         be fixed. */
      if ((get_type_state(set) != layout_fixed) ||
          (get_type_state(let) != layout_fixed))
        return 0;
      if (!smaller_type(set, let) ||
          get_type_size_bits(set) != get_type_size_bits(let))
        return 0;
    }
    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))
          return 0;
      if (get_array_upper_bound(lt, i))
        if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
          return 0;
    }
  } break;
  case tpo_enumeration: {
    assert(0 && "enumerations not implemented");
  } break;
  case tpo_pointer:     {
    if (!smaller_type(get_pointer_points_to_type(st),
              get_pointer_points_to_type(lt)))
      return 0;
  } break;
  case tpo_primitive:   {
    if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
      return 0;
  } break;
  default: break;
  }
  return 1;
}

/*-----------------------------------------------------------------*/
/* TYPE_CLASS                                                      */
/*-----------------------------------------------------------------*/

/* create a new class type */
type   *new_d_type_class (ident *name, dbg_info *db) {
  type *res;

  res = new_type(type_class, NULL, name, db);

  res->attr.ca.members     = NEW_ARR_F (entity *, 0);
  res->attr.ca.subtypes    = NEW_ARR_F (type *, 0);
  res->attr.ca.supertypes  = NEW_ARR_F (type *, 0);
  res->attr.ca.peculiarity = peculiarity_existent;
  res->attr.ca.dfn         = 0;
  hook_new_type(res);
  return res;
}

type   *new_type_class (ident *name) {
  return new_d_type_class (name, NULL);
}

void free_class_entities(type *clss) {
  int i;
  assert(clss && (clss->type_op == type_class));
  for (i = get_class_n_members(clss) - 1; i >= 0; --i)
    free_entity(get_class_member(clss, i));
}

void free_class_attrs(type *clss) {
  assert(clss && (clss->type_op == type_class));
  DEL_ARR_F(clss->attr.ca.members);
  DEL_ARR_F(clss->attr.ca.subtypes);
  DEL_ARR_F(clss->attr.ca.supertypes);
}

/* manipulate private fields of class type  */
void    add_class_member   (type *clss, entity *member) {
  assert(clss && (clss->type_op == type_class));
  assert(clss != get_entity_type(member) && "recursive type");
  ARR_APP1 (entity *, clss->attr.ca.members, member);
}

int     (get_class_n_members) (const type *clss) {
  return _get_class_n_members(clss);
}

int     get_class_member_index(type *clss, entity *mem) {
  int i;
  assert(clss && (clss->type_op == type_class));
  for (i = 0; i < get_class_n_members(clss); i++)
    if (get_class_member(clss, i) == mem)
      return i;
  return -1;
}

entity *(get_class_member)   (const type *clss, int pos) {
  return _get_class_member(clss, pos);
}

entity *get_class_member_by_name(type *clss, ident *name) {
  int i, n_mem;
  assert(clss && (clss->type_op == type_class));
  n_mem = get_class_n_members(clss);
  for (i = 0; i < n_mem; ++i) {
    entity *mem = get_class_member(clss, i);
    if (get_entity_ident(mem) == name) return mem;
  }
  return NULL;
}

void    set_class_member   (type *clss, entity *member, int pos) {
  assert(clss && (clss->type_op == type_class));
  assert(pos >= 0 && pos < get_class_n_members(clss));
  clss->attr.ca.members[pos] = member;
}
void    set_class_members  (type *clss, entity **members, int arity) {
  int i;
  assert(clss && (clss->type_op == type_class));
  DEL_ARR_F(clss->attr.ca.members);
  clss->attr.ca.members    = NEW_ARR_F (entity *, 0);
  for (i = 0; i < arity; i++) {
    set_entity_owner(members[i], clss);
    ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
  }
}
void    remove_class_member(type *clss, entity *member) {
  int i;
  assert(clss && (clss->type_op == type_class));
  for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
    if (clss->attr.ca.members[i] == member) {
      for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
        clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
      ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
      break;
    }
  }
}

void    add_class_subtype   (type *clss, type *subtype) {
  int i;
  assert(clss && (clss->type_op == type_class));
  ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
  for (i = 0; i < get_class_n_supertypes(subtype); i++)
    if (get_class_supertype(subtype, i) == clss)
      /* Class already registered */
      return;
  ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
}
int     get_class_n_subtypes (const type *clss) {
  assert(clss && (clss->type_op == type_class));
  return (ARR_LEN (clss->attr.ca.subtypes));
}
type   *get_class_subtype   (type *clss, int pos) {
  assert(clss && (clss->type_op == type_class));
  assert(pos >= 0 && pos < get_class_n_subtypes(clss));
  return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
}
int     get_class_subtype_index(type *clss, const type *subclass) {
  int i, n_subtypes = get_class_n_subtypes(clss);
  assert(is_Class_type(subclass));
  for (i = 0; i < n_subtypes; ++i) {
    if (get_class_subtype(clss, i) == subclass) return i;
  }
  return -1;
}
void    set_class_subtype   (type *clss, type *subtype, int pos) {
  assert(clss && (clss->type_op == type_class));
  assert(pos >= 0 && pos < get_class_n_subtypes(clss));
  clss->attr.ca.subtypes[pos] = subtype;
}
void    remove_class_subtype(type *clss, type *subtype) {
  int i;
  assert(clss && (clss->type_op == type_class));
  for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
    if (clss->attr.ca.subtypes[i] == subtype) {
      for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
        clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
      ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
      break;
    }
}

void    add_class_supertype   (type *clss, type *supertype) {
  int i;
  assert(clss && (clss->type_op == type_class));
  assert(supertype && (supertype -> type_op == type_class));
  ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
  for (i = 0; i < get_class_n_subtypes(supertype); i++)
    if (get_class_subtype(supertype, i) == clss)
      /* Class already registered */
      return;
  ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
}
int     get_class_n_supertypes (const type *clss) {
  assert(clss && (clss->type_op == type_class));
  return (ARR_LEN (clss->attr.ca.supertypes));
}
int get_class_supertype_index(type *clss, type *super_clss) {
  int i, n_supertypes = get_class_n_supertypes(clss);
  assert(super_clss && (super_clss->type_op == type_class));
  for (i = 0; i < n_supertypes; i++)
    if (get_class_supertype(clss, i) == super_clss)
      return i;
  return -1;
}
type   *get_class_supertype   (type *clss, int pos) {
  assert(clss && (clss->type_op == type_class));
  assert(pos >= 0 && pos < get_class_n_supertypes(clss));
  return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
}
void    set_class_supertype   (type *clss, type *supertype, int pos) {
  assert(clss && (clss->type_op == type_class));
  assert(pos >= 0 && pos < get_class_n_supertypes(clss));
  clss->attr.ca.supertypes[pos] = supertype;
}
void    remove_class_supertype(type *clss, type *supertype) {
  int i;
  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++)
    clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
      ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
      break;
    }
}

const char *get_peculiarity_string(peculiarity p) {
#define X(a)    case a: return #a
  switch (p) {
    X(peculiarity_description);
    X(peculiarity_inherited);
    X(peculiarity_existent);
  }
#undef X
  return "invalid peculiarity";
}

peculiarity get_class_peculiarity (const type *clss) {
  assert(clss && (clss->type_op == type_class));
  return clss->attr.ca.peculiarity;
}

void        set_class_peculiarity (type *clss, peculiarity pec) {
  assert(clss && (clss->type_op == type_class));
  assert(pec != peculiarity_inherited);  /* There is no inheritance of types in libFirm. */
  clss->attr.ca.peculiarity = pec;
}

void set_class_dfn (type *clss, int dfn)
{
  clss->attr.ca.dfn        = dfn;
}

int get_class_dfn (const type *clss)
{
  return (clss->attr.ca.dfn);
}

/* typecheck */
int (is_Class_type)(const type *clss) {
  return _is_class_type(clss);
}

void set_class_mode(type *tp, ir_mode *mode) {
  /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
  assert(get_type_state(tp) == layout_fixed &&
    tp->size == get_mode_size_bits(mode) && "mode don't match class layout");
  tp->mode = mode;
}

void set_class_size_bits(type *tp, int size) {
  /* argh: we must allow to set negative values as "invalid size" */
  tp->size = (size >= 0) ? (size + 7) & ~7 : size;
  assert(tp->size == size && "setting a bit size is NOT allowed for this type");
}

/*----------------------------------------------------------------**/
/* TYPE_STRUCT                                                     */
/*----------------------------------------------------------------**/

/* create a new type struct */
type   *new_d_type_struct(ident *name, dbg_info *db) {
  type *res = new_type(type_struct, NULL, name, db);

  res->attr.sa.members = NEW_ARR_F(entity *, 0);
  hook_new_type(res);
  return res;
}

type   *new_type_struct (ident *name) {
  return new_d_type_struct (name, NULL);
}

void free_struct_entities (type *strct) {
  int i;
  assert(strct && (strct->type_op == type_struct));
  for (i = get_struct_n_members(strct)-1; i >= 0; --i)
    free_entity(get_struct_member(strct, i));
}
void free_struct_attrs (type *strct) {
  assert(strct && (strct->type_op == type_struct));
  DEL_ARR_F(strct->attr.sa.members);
}

/* manipulate private fields of struct */
int     get_struct_n_members (const type *strct) {
  assert(strct && (strct->type_op == type_struct));
  return (ARR_LEN (strct->attr.sa.members));
}

void    add_struct_member   (type *strct, entity *member) {
  assert(strct && (strct->type_op == type_struct));
  assert(get_type_tpop(get_entity_type(member)) != type_method);
    /*    @@@ lowerfirm geht nicht durch */
  assert(strct != get_entity_type(member) && "recursive type");
  ARR_APP1 (entity *, strct->attr.sa.members, member);
}

entity *get_struct_member   (const type *strct, int pos) {
  assert(strct && (strct->type_op == type_struct));
  assert(pos >= 0 && pos < get_struct_n_members(strct));
  return strct->attr.sa.members[pos];
}

int     get_struct_member_index(type *strct, entity *mem) {
  int i;
  assert(strct && (strct->type_op == type_struct));
  for (i = 0; i < get_struct_n_members(strct); i++)
    if (get_struct_member(strct, i) == mem)
      return i;
  return -1;
}

void    set_struct_member   (type *strct, int pos, entity *member) {
  assert(strct && (strct->type_op == type_struct));
  assert(pos >= 0 && pos < get_struct_n_members(strct));
  assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
  strct->attr.sa.members[pos] = member;
}
void    remove_struct_member(type *strct, entity *member) {
  int i;
  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++)
    strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
      ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
      break;
    }
}

/* typecheck */
int (is_Struct_type)(const type *strct) {
  return _is_struct_type(strct);
}

void set_struct_mode(type *tp, ir_mode *mode) {
  /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
  assert(get_type_state(tp) == layout_fixed &&
    tp->size == get_mode_size_bits(mode) && "mode don't match struct layout");
  tp->mode = mode;
}

void set_struct_size_bits(type *tp, int size) {
  /* argh: we must allow to set negative values as "invalid size" */
  tp->size = (size >= 0) ? (size + 7) & ~7 : size;
  assert(tp->size == size && "setting a bit size is NOT allowed for this type");
}

/*******************************************************************/
/** TYPE_METHOD                                                   **/
/*******************************************************************/

/**
 * Lazy construction of value argument / result representation.
 * Constructs a struct type and its member.  The types of the members
 * are passed in the argument list.
 *
 * @param name    name of the type constructed
 * @param len     number of fields
 * @param tps     array of field types with length len
 */
static INLINE type *
build_value_type(ident *name, int len, tp_ent_pair *tps) {
  int i;
  type *res = new_type_struct(name);
  /* Remove type from type list.  Must be treated differently than other types. */
  remove_irp_type(res);
  for (i = 0; i < len; i++) {
    /* use res as default if corresponding type is not yet set. */
    type *elt_type = tps[i].tp ? tps[i].tp : res;

    tps[i].ent = new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
  }
  return res;
}

/* Create a new method type.
   N_param is the number of parameters, n_res the number of results.  */
type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
  type *res;

  assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
  res = new_type(type_method, mode_P_code, name, db);
  res->state                        = layout_fixed;
  res->size                         = get_mode_size_bits(mode_P_code);
  res->attr.ma.n_params             = n_param;
  res->attr.ma.param_type           = xcalloc(n_param, sizeof(res->attr.ma.param_type[0]));
  res->attr.ma.value_params         = NULL;
  res->attr.ma.n_res                = n_res;
  res->attr.ma.res_type             = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
  res->attr.ma.value_ress           = NULL;
  res->attr.ma.variadicity          = variadicity_non_variadic;
  res->attr.ma.first_variadic_param = -1;
  hook_new_type(res);
  return res;
}

type *new_type_method(ident *name, int n_param, int n_res) {
  return new_d_type_method(name, n_param, n_res, NULL);
}

void free_method_entities(type *method) {
  assert(method && (method->type_op == type_method));
}

/* Attention: also frees entities in value parameter subtypes! */
void free_method_attrs(type *method) {
  assert(method && (method->type_op == type_method));
  free(method->attr.ma.param_type);
  free(method->attr.ma.res_type);
  if (method->attr.ma.value_params) {
    free_type_entities(method->attr.ma.value_params);
    free_type(method->attr.ma.value_params);
  }
  if (method->attr.ma.value_ress) {
    free_type_entities(method->attr.ma.value_ress);
    free_type(method->attr.ma.value_ress);
  }
}

/* manipulate private fields of method. */
int (get_method_n_params)(const type *method) {
  return _get_method_n_params(method);
}

type *get_method_param_type(type *method, int pos) {
  type *res;
  assert(method && (method->type_op == type_method));
  assert(pos >= 0 && pos < get_method_n_params(method));
  res = method->attr.ma.param_type[pos].tp;
  assert(res != NULL && "empty method param type");
  return method->attr.ma.param_type[pos].tp = skip_tid(res);
}

void  set_method_param_type(type *method, int pos, type* tp) {
  assert(method && (method->type_op == type_method));
  assert(pos >= 0 && pos < get_method_n_params(method));
  method->attr.ma.param_type[pos].tp = tp;
  /* If information constructed set pass-by-value representation. */
  if (method->attr.ma.value_params) {
    assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
    set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
  }
}

/* Returns an entity that represents the copied value argument.  Only necessary
   for compounds passed by value. */
entity *get_method_value_param_ent(type *method, int pos) {
  assert(method && (method->type_op == type_method));
  assert(pos >= 0 && pos < get_method_n_params(method));

  if (!method->attr.ma.value_params) {
    /* parameter value type not created yet, build */
    method->attr.ma.value_params
      = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
             get_method_n_params(method), method->attr.ma.param_type);
  }
  /*
   * build_value_type() sets the method->attr.ma.value_params type as default if
   * no type is set!
   */
  assert((get_entity_type(method->attr.ma.param_type[pos].ent) != method->attr.ma.value_params)
     && "param type not yet set");
  return method->attr.ma.param_type[pos].ent;
}

/*
 * Returns a type that represents the copied value arguments.
 */
type *get_method_value_param_type(const type *method)
{
  assert(method && (method->type_op == type_method));
  return method->attr.ma.value_params;
}

int (get_method_n_ress)(const type *method) {
  return _get_method_n_ress(method);
}

type *get_method_res_type(type *method, int pos) {
  type *res;
  assert(method && (method->type_op == type_method));
  assert(pos >= 0 && pos < get_method_n_ress(method));
  res = method->attr.ma.res_type[pos].tp;
  assert(res != NULL && "empty method return type");
  return method->attr.ma.res_type[pos].tp = skip_tid(res);
}

void  set_method_res_type(type *method, int pos, type* tp) {
  assert(method && (method->type_op == type_method));
  assert(pos >= 0 && pos < get_method_n_ress(method));
  /* set the result type */
  method->attr.ma.res_type[pos].tp = tp;
  /* If information constructed set pass-by-value representation. */
  if (method->attr.ma.value_ress) {
    assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
    set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
  }
}

/* Returns an entity that represents the copied value result.  Only necessary
   for compounds passed by value. */
entity *get_method_value_res_ent(type *method, int pos) {
  assert(method && (method->type_op == type_method));
  assert(pos >= 0 && pos < get_method_n_ress(method));

  if (!method->attr.ma.value_ress) {
    /* result value type not created yet, build */
    method->attr.ma.value_ress
      = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
             get_method_n_ress(method), method->attr.ma.res_type);
  }
  /*
   * build_value_type() sets the method->attr.ma.value_ress type as default if
   * no type is set!
   */
  assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
     && "result type not yet set");

  return method->attr.ma.res_type[pos].ent;
}

/*
 * Returns a type that represents the copied value results.
 */
type *get_method_value_res_type(const type *method) {
  assert(method && (method->type_op == type_method));
  return method->attr.ma.value_ress;
}

/* Returns the null-terminated name of this variadicity. */
const char *get_variadicity_name(variadicity vari)
{
#define X(a)    case a: return #a
  switch (vari) {
    X(variadicity_non_variadic);
    X(variadicity_variadic);
    default:
      return "BAD VALUE";
  }
#undef X
}

variadicity get_method_variadicity(const type *method)
{
  assert(method && (method->type_op == type_method));
  return method->attr.ma.variadicity;
}

void set_method_variadicity(type *method, variadicity vari)
{
  assert(method && (method->type_op == type_method));
  method->attr.ma.variadicity = vari;
}

/*
 * Returns the first variadic parameter index of a type.
 * If this index was NOT set, the index of the last parameter
 * of the method type plus one is returned for variadic functions.
 * Non-variadic function types always return -1 here.
 */
int get_method_first_variadic_param_index(const type *method)
{
  assert(method && (method->type_op == type_method));

  if (method->attr.ma.variadicity == variadicity_non_variadic)
    return -1;

  if (method->attr.ma.first_variadic_param == -1)
    return get_method_n_params(method);
  return method->attr.ma.first_variadic_param;
}

/*
 * Sets the first variadic parameter index. This allows to specify
 * a complete call type (containing the type of all parameters)
 * but still have the knowledge, which parameter must be passed as
 * variadic one.
 */
void set_method_first_variadic_param_index(type *method, int index)
{
  assert(method && (method->type_op == type_method));
  assert(index >= 0 && index <= get_method_n_params(method));

  method->attr.ma.first_variadic_param = index;
}

/* typecheck */
int (is_Method_type)(const type *method) {
  return _is_method_type(method);
}

/*-----------------------------------------------------------------*/
/* TYPE_UNION                                                      */
/*-----------------------------------------------------------------*/

/* create a new type uni */
type  *new_d_type_union(ident *name, dbg_info *db) {
  type *res = new_type(type_union, NULL, name, db);

  res->attr.ua.members = NEW_ARR_F(entity *, 0);
  hook_new_type(res);
  return res;
}

type  *new_type_union(ident *name) {
  return new_d_type_union(name, NULL);
}

void free_union_entities(type *uni) {
  int i;
  assert(uni && (uni->type_op == type_union));
  for (i = get_union_n_members(uni) - 1; i >= 0; --i)
    free_entity(get_union_member(uni, i));
}

void free_union_attrs (type *uni) {
  assert(uni && (uni->type_op == type_union));
  DEL_ARR_F(uni->attr.ua.members);
}

/* manipulate private fields of union */
int    get_union_n_members      (const type *uni) {
  assert(uni && (uni->type_op == type_union));
  return (ARR_LEN (uni->attr.ua.members));
}
void    add_union_member   (type *uni, entity *member) {
  assert(uni && (uni->type_op == type_union));
  assert(uni != get_entity_type(member) && "recursive type");
  ARR_APP1 (entity *, uni->attr.ua.members, member);
}
entity  *get_union_member (const type *uni, int pos) {
  assert(uni && (uni->type_op == type_union));
  assert(pos >= 0 && pos < get_union_n_members(uni));
  return uni->attr.ua.members[pos];
}
void   set_union_member (type *uni, int pos, entity *member) {
  assert(uni && (uni->type_op == type_union));
  assert(pos >= 0 && pos < get_union_n_members(uni));
  uni->attr.ua.members[pos] = member;
}
void   remove_union_member(type *uni, entity *member) {
  int i;
  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++)
        uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
      ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
      break;
    }
}

/* typecheck */
int (is_Union_type)(const type *uni) {
  return _is_union_type(uni);
}

void set_union_size_bits(type *tp, int size) {
  /* argh: we must allow to set negative values as "invalid size" */
  tp->size = (size >= 0) ? (size + 7) & ~7 : size;
  assert(tp->size == size && "setting a bit size is NOT allowed for this type");
}

/*-----------------------------------------------------------------*/
/* TYPE_ARRAY                                                      */
/*-----------------------------------------------------------------*/


/* create a new type array -- set dimension sizes independently */
type *new_d_type_array(ident *name, int n_dimensions, type *element_type, dbg_info *db) {
  type *res;
  int i;
  ir_node *unk;
  ir_graph *rem = current_ir_graph;

  assert(!is_Method_type(element_type));

  res = new_type(type_array, NULL, name, db);
  res->attr.aa.n_dimensions = n_dimensions;
  res->attr.aa.lower_bound  = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
  res->attr.aa.upper_bound  = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
  res->attr.aa.order        = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));

  current_ir_graph = get_const_code_irg();
  unk = new_Unknown( mode_Iu);
  for (i = 0; i < n_dimensions; i++) {
    res->attr.aa.lower_bound[i] =
    res->attr.aa.upper_bound[i] = unk;
    res->attr.aa.order[i]       = i;
  }
  current_ir_graph = rem;

  res->attr.aa.element_type = element_type;
  new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
  hook_new_type(res);
  return res;
}

type *new_type_array(ident *name, int n_dimensions, type *element_type) {
  return new_d_type_array(name, n_dimensions, element_type, NULL);
}

void free_array_automatic_entities(type *array) {
  assert(array && (array->type_op == type_array));
  free_entity(get_array_element_entity(array));
}

void free_array_entities (type *array) {
  assert(array && (array->type_op == type_array));
}

void free_array_attrs (type *array) {
  assert(array && (array->type_op == type_array));
  free(array->attr.aa.lower_bound);
  free(array->attr.aa.upper_bound);
}

/* manipulate private fields of array type */
int   get_array_n_dimensions (const type *array) {
  assert(array && (array->type_op == type_array));
  return array->attr.aa.n_dimensions;
}

void
set_array_bounds (type *array, int dimension, ir_node * lower_bound,
          ir_node * upper_bound) {
  assert(array && (array->type_op == type_array));
  assert(lower_bound && "lower_bound node may not be NULL.");
  assert(upper_bound && "upper_bound node may not be NULL.");
  assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
  array->attr.aa.lower_bound[dimension] = lower_bound;
  array->attr.aa.upper_bound[dimension] = upper_bound;
}
void
set_array_bounds_int (type *array, int dimension, int lower_bound,
              int upper_bound) {
  ir_graph *rem = current_ir_graph;
  current_ir_graph = get_const_code_irg();
  set_array_bounds (array, dimension,
            new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
            new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
  current_ir_graph = rem;
}
void
set_array_lower_bound  (type *array, int dimension, ir_node * lower_bound) {
  assert(array && (array->type_op == type_array));
  assert(lower_bound && "lower_bound node may not be NULL.");
  array->attr.aa.lower_bound[dimension] = lower_bound;
}
void  set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
  ir_graph *rem = current_ir_graph;
  current_ir_graph = get_const_code_irg();
  set_array_lower_bound  (array, dimension,
              new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
  current_ir_graph = rem;
}
void
set_array_upper_bound  (type *array, int dimension, ir_node * upper_bound) {
  assert(array && (array->type_op == type_array));
  assert(upper_bound && "upper_bound node may not be NULL.");
  array->attr.aa.upper_bound[dimension] = upper_bound;
}
void  set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
  ir_graph *rem = current_ir_graph;
  current_ir_graph = get_const_code_irg();
  set_array_upper_bound  (array, dimension,
              new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
  current_ir_graph = rem;
}
int      has_array_lower_bound  (const type *array, int dimension) {
  assert(array && (array->type_op == type_array));
  return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
}
ir_node *get_array_lower_bound  (const type *array, int dimension) {
  assert(array && (array->type_op == type_array));
  return array->attr.aa.lower_bound[dimension];
}
long     get_array_lower_bound_int  (const type *array, int dimension) {
  ir_node *node;
  assert(array && (array->type_op == type_array));
  node = array->attr.aa.lower_bound[dimension];
  assert(get_irn_op(node) == op_Const);
  return get_tarval_long(get_Const_tarval(node));
}
int       has_array_upper_bound  (const type *array, int dimension) {
  assert(array && (array->type_op == type_array));
  return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
}
ir_node * get_array_upper_bound  (const type *array, int dimension) {
  assert(array && (array->type_op == type_array));
  return array->attr.aa.upper_bound[dimension];
}
long     get_array_upper_bound_int  (const type *array, int dimension) {
  ir_node *node;
  assert(array && (array->type_op == type_array));
  node = array->attr.aa.upper_bound[dimension];
  assert(get_irn_op(node) == op_Const);
  return get_tarval_long(get_Const_tarval(node));
}

void set_array_order (type *array, int dimension, int order) {
  assert(array && (array->type_op == type_array));
  array->attr.aa.order[dimension] = order;
}

int  get_array_order (const type *array, int dimension) {
  assert(array && (array->type_op == type_array));
  return array->attr.aa.order[dimension];
}

int find_array_dimension(const type *array, int order) {
  int dim;

  assert(array && (array->type_op == type_array));

  for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
    if (array->attr.aa.order[dim] == order)
      return dim;
  }
  return -1;
}

void  set_array_element_type (type *array, type *tp) {
  assert(array && (array->type_op == type_array));
  assert(!is_Method_type(tp));
  array->attr.aa.element_type = tp;
}
type *get_array_element_type (type *array) {
  assert(array && (array->type_op == type_array));
  return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
}

void  set_array_element_entity (type *array, entity *ent) {
  assert(array && (array->type_op == type_array));
  assert((get_entity_type(ent)->type_op != type_method));
  array->attr.aa.element_ent = ent;
  array->attr.aa.element_type = get_entity_type(ent);
}
entity *get_array_element_entity (const type *array) {
  assert(array && (array->type_op == type_array));
  return array->attr.aa.element_ent;
}

/* typecheck */
int (is_Array_type)(const type *array) {
  return _is_array_type(array);
}

void set_array_size_bits(type *tp, int size) {
  /* FIXME: Here we should make some checks with the element type size */
  tp->size = size;
}
/*-----------------------------------------------------------------*/
/* TYPE_ENUMERATION                                                */
/*-----------------------------------------------------------------*/

/* create a new type enumeration -- set the enumerators independently */
type   *new_d_type_enumeration(ident *name, int n_enums, dbg_info *db) {
  type *res = new_type(type_enumeration, NULL, name, db);

  res->attr.ea.n_enums     = n_enums;
  res->attr.ea.enumer      = xcalloc(n_enums, sizeof(res->attr.ea.enumer[0]));
  res->attr.ea.enum_nameid = xcalloc(n_enums, sizeof(res->attr.ea.enum_nameid[0]));
  hook_new_type(res);
  return res;
}

type   *new_type_enumeration(ident *name, int n_enums) {
  return new_d_type_enumeration(name, n_enums, NULL);
}

void free_enumeration_entities(type *enumeration) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
}
void free_enumeration_attrs(type *enumeration) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  free(enumeration->attr.ea.enumer);
  free(enumeration->attr.ea.enum_nameid);
}

/* manipulate fields of enumeration type. */
int     get_enumeration_n_enums (const type *enumeration) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  return enumeration->attr.ea.n_enums;
}
void    set_enumeration_enum    (type *enumeration, int pos, tarval *con) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
  enumeration->attr.ea.enumer[pos] = con;
}
tarval *get_enumeration_enum    (const type *enumeration, int pos) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
  return enumeration->attr.ea.enumer[pos];
}
void    set_enumeration_nameid  (type *enumeration, int pos, ident *id) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
  enumeration->attr.ea.enum_nameid[pos] = id;
}
ident  *get_enumeration_nameid  (const type *enumeration, int pos) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
  return enumeration->attr.ea.enum_nameid[pos];
}
const char *get_enumeration_name(const type *enumeration, int pos) {
  assert(enumeration && (enumeration->type_op == type_enumeration));
  assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
  return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
}

/* typecheck */
int (is_Enumeration_type)(const type *enumeration) {
  return _is_enumeration_type(enumeration);
}

void set_enumeration_mode(type *tp, ir_mode *mode) {
  assert(mode_is_int(mode) && "Modes of enumerations must be integers");
  /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
  assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");

  tp->size = get_mode_size_bits(mode);
  tp->mode = mode;
}

/*-----------------------------------------------------------------*/
/* TYPE_POINTER                                                    */
/*-----------------------------------------------------------------*/

/* Create a new type pointer */
type *new_d_type_pointer(ident *name, type *points_to, ir_mode *ptr_mode, dbg_info *db) {
  type *res;

  assert(mode_is_reference(ptr_mode));
  res = new_type(type_pointer, ptr_mode, name, db);
  res->attr.pa.points_to = points_to;
  assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
  res->size = get_mode_size_bits(res->mode);
  res->state = layout_fixed;
  hook_new_type(res);
  return res;
}

type *new_type_pointer(ident *name, type *points_to, ir_mode *ptr_mode) {
  return new_d_type_pointer(name, points_to, ptr_mode, NULL);
}

void free_pointer_entities (type *pointer) {
  assert(pointer && (pointer->type_op == type_pointer));
}

void free_pointer_attrs (type *pointer) {
  assert(pointer && (pointer->type_op == type_pointer));
}

/* manipulate fields of type_pointer */
void  set_pointer_points_to_type (type *pointer, type *tp) {
  assert(pointer && (pointer->type_op == type_pointer));
  pointer->attr.pa.points_to = tp;
}

type *get_pointer_points_to_type (type *pointer) {
  assert(pointer && (pointer->type_op == type_pointer));
  return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
}

/* typecheck */
int (is_Pointer_type)(const type *pointer) {
  return _is_pointer_type(pointer);
}

void set_pointer_mode(type *tp, ir_mode *mode) {
  assert(mode_is_reference(mode) && "Modes of pointers must be references");
  /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
  assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");

  tp->size = get_mode_size_bits(mode);
  tp->mode = mode;
}

/* Returns the first pointer type that has as points_to tp.
 *  Not efficient: O(#types).
 *  If not found returns firm_unknown_type. */
type *find_pointer_type_to_type (type *tp) {
  int i;
  for (i = 0; i < get_irp_n_types(); ++i) {
    type *found = get_irp_type(i);
    if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
      return (found);
  }
  return firm_unknown_type;
}


/*-----------------------------------------------------------------*/
/* TYPE_PRIMITIVE                                                  */
/*-----------------------------------------------------------------*/

/* create a new type primitive */
type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
  type *res;
  /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
  res = new_type(type_primitive, mode, name, db);
  res->size  = get_mode_size_bits(mode);
  res->state = layout_fixed;
  hook_new_type(res);
  return res;
}

type *new_type_primitive(ident *name, ir_mode *mode) {
  return new_d_type_primitive(name, mode, NULL);
}

/* typecheck */
int (is_Primitive_type)(const type *primitive) {
  return _is_primitive_type(primitive);
}

void set_primitive_mode(type *tp, ir_mode *mode) {
  /* Modes of primitives must be data */
  assert(mode_is_data(mode));

  /* For primitive size depends on the mode. */
  tp->size = get_mode_size_bits(mode);
  tp->mode = mode;
}


/*-----------------------------------------------------------------*/
/* common functionality                                            */
/*-----------------------------------------------------------------*/


int (is_atomic_type)(const type *tp) {
  return _is_atomic_type(tp);
}

/*
 * Gets the number of elements in a firm compound type.
 */
int get_compound_n_members(const type *tp)
{
  const tp_op *op = get_type_tpop(tp);
  int res = 0;

  if (op->ops.get_n_members)
    res = op->ops.get_n_members(tp);
  else
    assert(0 && "no member count for this type");

  return res;
}

/*
 * Gets the member of a firm compound type at position pos.
 */
entity *get_compound_member(const type *tp, int pos)
{
  const tp_op *op = get_type_tpop(tp);
  entity *res = NULL;

  if (op->ops.get_member)
    res = op->ops.get_member(tp, pos);
  else
    assert(0 && "no members in this type");

  return res;
}

int is_compound_type(const type *tp) {
  assert(tp && tp->kind == k_type);
  return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
}

/* Checks, whether a type is a frame type */
int is_frame_type(const type *tp) {
  return tp->frame_type;
}

/* Makes a new frame type. */
type *new_type_frame(ident *name)
{
  type *res = new_type_class(name);

  res->frame_type = 1;

  /* Remove type from type list.  Must be treated differently than other types. */
  remove_irp_type(res);

  return res;
}

/* set the type size for the unknown and none type */
void set_default_size_bits(type *tp, int size) {
  tp->size = size;
}