nsz Git - libfirm/blob - ir/tr/entity.c

   1 /*
   2  * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   6  * This file may be distributed and/or modified under the terms of the
   7  * GNU General Public License version 2 as published by the Free Software
   8  * Foundation and appearing in the file LICENSE.GPL included in the
   9  * packaging of this file.
  10  *
  11  * Licensees holding valid libFirm Professional Edition licenses may use
  12  * this file in accordance with the libFirm Commercial License.
  13  * Agreement provided with the Software.
  14  *
  15  * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
  16  * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @file
  22  * @brief   Representation of all program known entities.
  23  * @author  Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
  24  * @version $Id$
  25  */
  26 #ifdef HAVE_CONFIG_H
  27 # include "config.h"
  28 #endif
  29
  30 #include <string.h>
  31 #include <stdlib.h>
  32 #include <stddef.h>
  33
  34 #include "firm_common_t.h"
  35
  36 #include "xmalloc.h"
  37 #include "entity_t.h"
  38 #include "array.h"
  39 #include "irtools.h"
  40 #include "irhooks.h"
  41 #include "irprintf.h"
  42
  43 #include "irprog_t.h"
  44 #include "ircons.h"
  45 #include "tv_t.h"
  46 #include "irdump.h"
  47 #include "irgraph_t.h"
  48
  49 #include "callgraph.h"
  50
  51 /**
  52  * An interval initializer.
  53  */
  54 typedef struct interval_initializer interval_initializer;
  55
  56 /**
  57  * A value initializer.
  58  */
  59 typedef struct value_initializer value_initializer;
  60
  61 struct interval_initializer {
  62         int                  first_index; /**< The first index of the initialized interval. */
  63         int                  last_index;  /**< The last index of the initialized interval. */
  64         interval_initializer *next;       /**< Points to the next interval initializer. */
  65 };
  66
  67 struct value_initializer {
  68         ir_entity *ent;           /**< The initialized entity. */
  69         value_initializer *next;  /**< Points to the next value initializer. */
  70 };
  71
  72 typedef union initializer {
  73         ir_node              *value;     /**< The value of the initializer. */
  74         ir_node              **values;   /**< The values of an interval. */
  75         value_initializer    *val_init;  /**< Points the the head of the next value initializers. */
  76         interval_initializer *int_init;  /**< Points to the head of the next value initializers. */
  77 } initializer;
  78
  79 /*-----------------------------------------------------------------*/
  80 /** general                                                       **/
  81 /*-----------------------------------------------------------------*/
  82
  83 ir_entity *unknown_entity = NULL;
  84
  85 ir_entity *get_unknown_entity(void) { return unknown_entity; }
  86
  87 /** The name of the unknown entity. */
  88 #define UNKNOWN_ENTITY_NAME "unknown_entity"
  89
  90 /*-----------------------------------------------------------------*/
  91 /* ENTITY                                                          */
  92 /*-----------------------------------------------------------------*/
  93
  94 /**
  95  * Add an entity to it's already set owner type.
  96  */
  97 static INLINE void insert_entity_in_owner(ir_entity *ent) {
  98         ir_type *owner = ent->owner;
  99         switch (get_type_tpop_code(owner)) {
 100         case tpo_class:
 101                 add_class_member(owner, ent);
 102                 break;
 103         case tpo_struct:
 104                 add_struct_member(owner, ent);
 105                 break;
 106         case tpo_union:
 107                 add_union_member(owner, ent);
 108                 break;
 109         case tpo_array:
 110                 set_array_element_entity(owner, ent);
 111                 break;
 112         default: assert(0);
 113         }
 114 }  /* insert_entity_in_owner */
 115
 116 /**
 117  * Creates a new entity. This entity is NOT inserted in the owner type.
 118  *
 119  * @param db     debug info for this entity
 120  * @param owner  the owner type of the new entity
 121  * @param name   the name of the new entity
 122  * @param type   the type of the new entity
 123  *
 124  * @return the new created entity
 125  */
 126 static INLINE ir_entity *
 127 new_rd_entity(dbg_info *db, ir_type *owner, ident *name, ir_type *type)
 128 {
 129         ir_entity *res;
 130         ir_graph *rem;
 131
 132         assert(!id_contains_char(name, ' ') && "entity name should not contain spaces");
 133
 134         res = xmalloc(sizeof(*res));
 135         memset(res, 0, sizeof(*res));
 136
 137         res->kind    = k_entity;
 138         res->name    = name;
 139         res->ld_name = NULL;
 140         res->type    = type;
 141         res->owner   = owner;
 142
 143         res->allocation           = allocation_automatic;
 144         res->visibility           = visibility_local;
 145         res->volatility           = volatility_non_volatile;
 146         res->align                = align_is_aligned;
 147         res->stickyness           = stickyness_unsticky;
 148         res->peculiarity          = peculiarity_existent;
 149         res->address_taken        = ir_address_taken_unknown;
 150         res->final                = 0;
 151         res->compiler_gen         = 0;
 152         res->backend_marked       = 0;
 153         res->offset               = -1;
 154         res->offset_bit_remainder = 0;
 155         res->link                 = NULL;
 156         res->repr_class           = NULL;
 157
 158         if (is_Method_type(type)) {
 159                 symconst_symbol sym;
 160                 ir_mode *mode = is_Method_type(type) ? mode_P_code : mode_P_data;
 161                 sym.entity_p            = res;
 162                 rem                     = current_ir_graph;
 163                 current_ir_graph        = get_const_code_irg();
 164                 res->value              = new_SymConst(mode, sym, symconst_addr_ent);
 165                 current_ir_graph        = rem;
 166                 res->allocation         = allocation_static;
 167                 res->variability        = variability_constant;
 168                 res->attr.mtd_attr.irg_add_properties = mtp_property_inherited;
 169                 res->attr.mtd_attr.vtable_number      = VTABLE_NUM_NOT_SET;
 170                 res->attr.mtd_attr.param_access       = NULL;
 171                 res->attr.mtd_attr.param_weight       = NULL;
 172                 res->attr.mtd_attr.irg                = NULL;
 173         } else if (is_compound_type(type)) {
 174                 res->variability = variability_uninitialized;
 175                 res->value       = NULL;
 176                 res->attr.cmpd_attr.values    = NULL;
 177                 res->attr.cmpd_attr.val_paths = NULL;
 178         } else {
 179                 res->variability = variability_uninitialized;
 180                 res->value       = NULL;
 181         }
 182
 183         if (is_Class_type(owner)) {
 184                 res->overwrites    = NEW_ARR_F(ir_entity *, 0);
 185                 res->overwrittenby = NEW_ARR_F(ir_entity *, 0);
 186         } else {
 187                 res->overwrites    = NULL;
 188                 res->overwrittenby = NULL;
 189         }
 190
 191 #ifdef DEBUG_libfirm
 192         res->nr = get_irp_new_node_nr();
 193 #endif /* DEBUG_libfirm */
 194
 195         res->visit = 0;
 196         set_entity_dbg_info(res, db);
 197
 198         return res;
 199 }  /* new_rd_entity */
 200
 201 ir_entity *
 202 new_d_entity(ir_type *owner, ident *name, ir_type *type, dbg_info *db) {
 203         ir_entity *res;
 204
 205         assert(is_compound_type(owner));
 206         res = new_rd_entity(db, owner, name, type);
 207         /* Remember entity in it's owner. */
 208         insert_entity_in_owner(res);
 209
 210         hook_new_entity(res);
 211         return res;
 212 }  /* new_d_entity */
 213
 214 ir_entity *
 215 new_entity(ir_type *owner, ident *name, ir_type *type) {
 216         return new_d_entity(owner, name, type, NULL);
 217 }  /* new_entity */
 218
 219 /**
 220  * Free entity attributes.
 221  *
 222  * @param ent  the entity
 223  */
 224 static void free_entity_attrs(ir_entity *ent) {
 225         int i;
 226         if (get_type_tpop(get_entity_owner(ent)) == type_class) {
 227                 DEL_ARR_F(ent->overwrites);    ent->overwrites = NULL;
 228                 DEL_ARR_F(ent->overwrittenby); ent->overwrittenby = NULL;
 229         } else {
 230                 assert(ent->overwrites == NULL);
 231                 assert(ent->overwrittenby == NULL);
 232         }
 233         if (is_compound_entity(ent)) {
 234                 if (ent->attr.cmpd_attr.val_paths) {
 235                         for (i = get_compound_ent_n_values(ent) - 1; i >= 0; --i)
 236                                 if (ent->attr.cmpd_attr.val_paths[i]) {
 237                                         /* free_compound_graph_path(ent->attr.cmpd_attr.val_paths[i]) ;  * @@@ warum nich? */
 238                                         /* Geht nich: wird mehrfach verwendet!!! ==> mehrfach frei gegeben. */
 239                                         /* DEL_ARR_F(ent->attr.cmpd_attr.val_paths); */
 240                                 }
 241                                 ent->attr.cmpd_attr.val_paths = NULL;
 242                 }
 243                 /* if (ent->attr.cmpd_attr.values) DEL_ARR_F(ent->attr.cmpd_attr.values); *//* @@@ warum nich? */
 244                 ent->attr.cmpd_attr.values = NULL;
 245         } else if (is_method_entity(ent)) {
 246                 if (ent->attr.mtd_attr.param_access) {
 247                         DEL_ARR_F(ent->attr.mtd_attr.param_access);
 248                         ent->attr.mtd_attr.param_access = NULL;
 249                 }
 250                 if (ent->attr.mtd_attr.param_weight) {
 251                         DEL_ARR_F(ent->attr.mtd_attr.param_weight);
 252                         ent->attr.mtd_attr.param_weight = NULL;
 253                 }
 254         }
 255 }  /* free_entity_attrs */
 256
 257 /*
 258  * Copies the entity if the new_owner is different from the
 259  * owner of the old entity,  else returns the old entity.
 260  */
 261 ir_entity *
 262 copy_entity_own(ir_entity *old, ir_type *new_owner) {
 263         ir_entity *newe;
 264         assert(is_entity(old));
 265         assert(is_compound_type(new_owner));
 266         assert(get_type_state(new_owner) != layout_fixed);
 267
 268         if (old->owner == new_owner) return old;
 269         newe = xmalloc(sizeof(*newe));
 270         memcpy(newe, old, sizeof(*newe));
 271         newe->owner = new_owner;
 272         if (is_Class_type(new_owner)) {
 273                 newe->overwrites    = NEW_ARR_F(ir_entity *, 0);
 274                 newe->overwrittenby = NEW_ARR_F(ir_entity *, 0);
 275         }
 276 #ifdef DEBUG_libfirm
 277         newe->nr = get_irp_new_node_nr();
 278 #endif
 279
 280         insert_entity_in_owner(newe);
 281
 282         return newe;
 283 }  /* copy_entity_own */
 284
 285 ir_entity *
 286 copy_entity_name(ir_entity *old, ident *new_name) {
 287         ir_entity *newe;
 288         assert(old && old->kind == k_entity);
 289
 290         if (old->name == new_name) return old;
 291         newe = xmalloc(sizeof(*newe));
 292         memcpy(newe, old, sizeof(*newe));
 293         newe->name = new_name;
 294         newe->ld_name = NULL;
 295         if (is_Class_type(newe->owner)) {
 296                 newe->overwrites    = DUP_ARR_F(ir_entity *, old->overwrites);
 297                 newe->overwrittenby = DUP_ARR_F(ir_entity *, old->overwrittenby);
 298         }
 299 #ifdef DEBUG_libfirm
 300         newe->nr = get_irp_new_node_nr();
 301 #endif
 302
 303         insert_entity_in_owner(newe);
 304
 305         return newe;
 306 }  /* copy_entity_name */
 307
 308
 309 void
 310 free_entity(ir_entity *ent) {
 311         assert(ent && ent->kind == k_entity);
 312         free_entity_attrs(ent);
 313         ent->kind = k_BAD;
 314         free(ent);
 315 }  /* free_entity */
 316
 317 /* Outputs a unique number for this node */
 318 long
 319 get_entity_nr(const ir_entity *ent) {
 320         assert(ent && ent->kind == k_entity);
 321 #ifdef DEBUG_libfirm
 322         return ent->nr;
 323 #else
 324         return (long)PTR_TO_INT(ent);
 325 #endif
 326 }  /* get_entity_nr */
 327
 328 const char *
 329 (get_entity_name)(const ir_entity *ent) {
 330         return _get_entity_name(ent);
 331 }  /* get_entity_name */
 332
 333 ident *
 334 (get_entity_ident)(const ir_entity *ent) {
 335         return _get_entity_ident(ent);
 336 }  /* get_entity_ident */
 337
 338 void
 339 (set_entity_ident)(ir_entity *ent, ident *id) {
 340         _set_entity_ident(ent, id);
 341 }  /* set_entity_ident */
 342
 343 ir_type *
 344 (get_entity_owner)(ir_entity *ent) {
 345         return _get_entity_owner(ent);
 346 }  /* get_entity_owner */
 347
 348 void
 349 set_entity_owner(ir_entity *ent, ir_type *owner) {
 350         assert(is_entity(ent));
 351         assert(is_compound_type(owner));
 352         ent->owner = owner;
 353 }  /* set_entity_owner */
 354
 355 ident *
 356 (get_entity_ld_ident)(ir_entity *ent) {
 357         return _get_entity_ld_ident(ent);
 358 }  /* get_entity_ld_ident */
 359
 360 void
 361 (set_entity_ld_ident)(ir_entity *ent, ident *ld_ident) {
 362         _set_entity_ld_ident(ent, ld_ident);
 363 }  /* set_entity_ld_ident */
 364
 365 const char *
 366 (get_entity_ld_name)(ir_entity *ent) {
 367         return _get_entity_ld_name(ent);
 368 }  /* get_entity_ld_name */
 369
 370 ir_type *
 371 (get_entity_type)(ir_entity *ent) {
 372         return _get_entity_type(ent);
 373 }  /* get_entity_type */
 374
 375 void
 376 (set_entity_type)(ir_entity *ent, ir_type *type) {
 377         _set_entity_type(ent, type);
 378 }  /* set_entity_type */
 379
 380 ir_allocation
 381 (get_entity_allocation)(const ir_entity *ent) {
 382         return _get_entity_allocation(ent);
 383 }  /* get_entity_allocation */
 384
 385 void
 386 (set_entity_allocation)(ir_entity *ent, ir_allocation al) {
 387         _set_entity_allocation(ent, al);
 388 }  /* set_entity_allocation */
 389
 390 /* return the name of the visibility */
 391 const char *get_allocation_name(ir_allocation all)
 392 {
 393 #define X(a)    case a: return #a
 394         switch (all) {
 395         X(allocation_automatic);
 396         X(allocation_parameter);
 397         X(allocation_dynamic);
 398         X(allocation_static);
 399     default: return "BAD VALUE";
 400         }
 401 #undef X
 402 }  /* get_allocation_name */
 403
 404 ir_visibility
 405 (get_entity_visibility)(const ir_entity *ent) {
 406         return _get_entity_visibility(ent);
 407 }  /* get_entity_visibility */
 408
 409 void
 410 set_entity_visibility(ir_entity *ent, ir_visibility vis) {
 411         assert(ent && ent->kind == k_entity);
 412         if (vis != visibility_local)
 413                 assert((ent->allocation == allocation_static) ||
 414                 (ent->allocation == allocation_automatic));
 415                 /* @@@ Test that the owner type is not local, but how??
 416         && get_class_visibility(get_entity_owner(ent)) != local));*/
 417         ent->visibility = vis;
 418 }  /* set_entity_visibility */
 419
 420 /* return the name of the visibility */
 421 const char *get_visibility_name(ir_visibility vis)
 422 {
 423 #define X(a)    case a: return #a
 424         switch (vis) {
 425         X(visibility_local);
 426         X(visibility_external_visible);
 427         X(visibility_external_allocated);
 428     default: return "BAD VALUE";
 429         }
 430 #undef X
 431 }  /* get_visibility_name */
 432
 433 ir_variability
 434 (get_entity_variability)(const ir_entity *ent) {
 435         return _get_entity_variability(ent);
 436 }  /* get_entity_variability */
 437
 438 void
 439 set_entity_variability(ir_entity *ent, ir_variability var)
 440 {
 441         assert(ent && ent->kind == k_entity);
 442         if (var == variability_part_constant)
 443                 assert(is_Class_type(ent->type) || is_Struct_type(ent->type));
 444
 445         if ((is_compound_type(ent->type)) &&
 446                 (ent->variability == variability_uninitialized) && (var != variability_uninitialized)) {
 447                 /* Allocate data structures for constant values */
 448                 ent->attr.cmpd_attr.values    = NEW_ARR_F(ir_node *, 0);
 449                 ent->attr.cmpd_attr.val_paths = NEW_ARR_F(compound_graph_path *, 0);
 450         }
 451         if ((is_atomic_type(ent->type)) &&
 452                 (ent->variability == variability_uninitialized) && (var != variability_uninitialized)) {
 453                 /* Set default constant value. */
 454                 ent->value = new_rd_Unknown(get_const_code_irg(), get_type_mode(ent->type));
 455         }
 456
 457         if ((is_compound_type(ent->type)) &&
 458                 (var == variability_uninitialized) && (ent->variability != variability_uninitialized)) {
 459                 /* Free data structures for constant values */
 460                 DEL_ARR_F(ent->attr.cmpd_attr.values);    ent->attr.cmpd_attr.values    = NULL;
 461                 DEL_ARR_F(ent->attr.cmpd_attr.val_paths); ent->attr.cmpd_attr.val_paths = NULL;
 462         }
 463         ent->variability = var;
 464 }  /* set_entity_variability */
 465
 466 /* return the name of the variability */
 467 const char *get_variability_name(ir_variability var)
 468 {
 469 #define X(a)    case a: return #a
 470         switch (var) {
 471         X(variability_uninitialized);
 472         X(variability_initialized);
 473         X(variability_part_constant);
 474         X(variability_constant);
 475     default: return "BAD VALUE";
 476         }
 477 #undef X
 478 }  /* get_variability_name */
 479
 480 ir_volatility
 481 (get_entity_volatility)(const ir_entity *ent) {
 482         return _get_entity_volatility(ent);
 483 }  /* get_entity_volatility */
 484
 485 void
 486 (set_entity_volatility)(ir_entity *ent, ir_volatility vol) {
 487         _set_entity_volatility(ent, vol);
 488 }  /* set_entity_volatility */
 489
 490 /* Return the name of the volatility. */
 491 const char *get_volatility_name(ir_volatility var)
 492 {
 493 #define X(a)    case a: return #a
 494         switch (var) {
 495         X(volatility_non_volatile);
 496         X(volatility_is_volatile);
 497     default: return "BAD VALUE";
 498         }
 499 #undef X
 500 }  /* get_volatility_name */
 501
 502 ir_align
 503 (get_entity_align)(const ir_entity *ent) {
 504         return _get_entity_align(ent);
 505 }  /* get_entity_align */
 506
 507 void
 508 (set_entity_align)(ir_entity *ent, ir_align a) {
 509         _set_entity_align(ent, a);
 510 }  /* set_entity_align */
 511
 512 /* Return the name of the alignment. */
 513 const char *get_align_name(ir_align a)
 514 {
 515 #define X(a)    case a: return #a
 516         switch (a) {
 517         X(align_non_aligned);
 518         X(align_is_aligned);
 519         default: return "BAD VALUE";
 520         }
 521 #undef X
 522 }  /* get_align_name */
 523
 524 ir_peculiarity
 525 (get_entity_peculiarity)(const ir_entity *ent) {
 526         return _get_entity_peculiarity(ent);
 527 }  /* get_entity_peculiarity */
 528
 529 void
 530 (set_entity_peculiarity)(ir_entity *ent, ir_peculiarity pec) {
 531         _set_entity_peculiarity(ent, pec);
 532 }  /* set_entity_peculiarity */
 533
 534 /* Checks if an entity cannot be overridden anymore. */
 535 int (is_entity_final)(const ir_entity *ent) {
 536         return _is_entity_final(ent);
 537 }  /* is_entity_final */
 538
 539 /* Sets/resets the final flag of an entity. */
 540 void (set_entity_final)(ir_entity *ent, int final) {
 541         _set_entity_final(ent, final);
 542 }  /* set_entity_final */
 543
 544 /* Checks if an entity is compiler generated */
 545 int (is_entity_compiler_generated)(const ir_entity *ent) {
 546         return _is_entity_compiler_generated(ent);
 547 }  /* is_entity_compiler_generated */
 548
 549 /* Sets/resets the compiler generated flag */
 550 void (set_entity_compiler_generated)(ir_entity *ent, int flag) {
 551         _set_entity_compiler_generated(ent, flag);
 552 }  /* set_entity_compiler_generated */
 553
 554 /* Checks if an entity is marked by the backend */
 555 int (is_entity_backend_marked)(const ir_entity *ent) {
 556         return _is_entity_backend_marked(ent);
 557 }  /* is_entity_backend_marked */
 558
 559 /* Sets/resets the compiler generated flag */
 560 void (set_entity_backend_marked)(ir_entity *ent, int flag) {
 561         _set_entity_backend_marked(ent, flag);
 562 }  /* set_entity_backend_marked */
 563
 564 /* Checks if the address of an entity was taken. */
 565 ir_address_taken_state (get_entity_address_taken)(const ir_entity *ent) {
 566         return _get_entity_address_taken(ent);
 567 }  /* is_entity_address_taken */
 568
 569 /* Sets/resets the address taken flag. */
 570 void (set_entity_address_taken)(ir_entity *ent, ir_address_taken_state flag) {
 571         _set_entity_address_taken(ent, flag);
 572 }  /* set_entity_address_taken */
 573
 574 /* Return the name of the address_taken state. */
 575 const char *get_address_taken_state_name(ir_address_taken_state state) {
 576 #define X(a)    case a: return #a
 577         switch (state) {
 578         X(ir_address_not_taken);
 579         X(ir_address_taken_unknown);
 580         X(ir_address_taken);
 581     default: return "BAD VALUE";
 582         }
 583 #undef X
 584 }  /* get_address_taken_state_name */
 585
 586 /* Get the entity's stickyness */
 587 ir_stickyness
 588 (get_entity_stickyness)(const ir_entity *ent) {
 589         return _get_entity_stickyness(ent);
 590 }  /* get_entity_stickyness */
 591
 592 /* Set the entity's stickyness */
 593 void
 594 (set_entity_stickyness)(ir_entity *ent, ir_stickyness stickyness) {
 595         _set_entity_stickyness(ent, stickyness);
 596 }  /* set_entity_stickyness */
 597
 598 /* Set has no effect for existent entities of type method. */
 599 ir_node *
 600 get_atomic_ent_value(ir_entity *ent)
 601 {
 602         assert(ent && is_atomic_entity(ent));
 603         assert(ent->variability != variability_uninitialized);
 604         return skip_Id(ent->value);
 605 }  /* get_atomic_ent_value */
 606
 607 void
 608 set_atomic_ent_value(ir_entity *ent, ir_node *val) {
 609         assert(is_atomic_entity(ent) && (ent->variability != variability_uninitialized));
 610         if (is_Method_type(ent->type) && (ent->peculiarity == peculiarity_existent))
 611                 return;
 612         assert(get_irn_mode(val) == get_type_mode(ent->type));
 613         ent->value = val;
 614 }  /* set_atomic_ent_value */
 615
 616 /* Returns true if the the node is representable as code on
 617  *  const_code_irg. */
 618 int is_irn_const_expression(ir_node *n) {
 619         ir_mode *m;
 620
 621         /* we are in danger iff an exception will arise. TODO: be more precisely,
 622          * for instance Div. will NOT rise if divisor != 0
 623          */
 624         if (is_binop(n) && !is_fragile_op(n))
 625                 return is_irn_const_expression(get_binop_left(n)) && is_irn_const_expression(get_binop_right(n));
 626
 627         m = get_irn_mode(n);
 628         switch (get_irn_opcode(n)) {
 629         case iro_Const:
 630         case iro_SymConst:
 631         case iro_Unknown:
 632                 return 1;
 633         case iro_Conv:
 634         case iro_Cast:
 635                 return is_irn_const_expression(get_irn_n(n, 0));
 636         default:
 637                 break;
 638         }
 639         return 0;
 640 }  /* is_irn_const_expression */
 641
 642 /*
 643  * Copies a firm subgraph that complies to the restrictions for
 644  * constant expressions to current_block in current_ir_graph.
 645  */
 646 ir_node *copy_const_value(dbg_info *dbg, ir_node *n) {
 647         ir_node *nn;
 648         ir_mode *m;
 649
 650         /* @@@ GL I think  we should implement this using the routines from irgopt for
 651                dead node elimination/inlineing. */
 652
 653         m = get_irn_mode(n);
 654         switch (get_irn_opcode(n)) {
 655         case iro_Const:
 656                 nn = new_d_Const_type(dbg, m, get_Const_tarval(n), get_Const_type(n));
 657                 break;
 658         case iro_SymConst:
 659                 nn = new_d_SymConst_type(dbg, get_irn_mode(n), get_SymConst_symbol(n), get_SymConst_kind(n),
 660                         get_SymConst_value_type(n));
 661                 break;
 662         case iro_Add:
 663                 nn = new_d_Add(dbg, copy_const_value(dbg, get_Add_left(n)),
 664                         copy_const_value(dbg, get_Add_right(n)), m); break;
 665         case iro_Sub:
 666                 nn = new_d_Sub(dbg, copy_const_value(dbg, get_Sub_left(n)),
 667                         copy_const_value(dbg, get_Sub_right(n)), m); break;
 668         case iro_Mul:
 669                 nn = new_d_Mul(dbg, copy_const_value(dbg, get_Mul_left(n)),
 670                         copy_const_value(dbg, get_Mul_right(n)), m); break;
 671         case iro_And:
 672                 nn = new_d_And(dbg, copy_const_value(dbg, get_And_left(n)),
 673                         copy_const_value(dbg, get_And_right(n)), m); break;
 674         case iro_Or:
 675                 nn = new_d_Or(dbg, copy_const_value(dbg, get_Or_left(n)),
 676                         copy_const_value(dbg, get_Or_right(n)), m); break;
 677         case iro_Eor:
 678                 nn = new_d_Eor(dbg, copy_const_value(dbg, get_Eor_left(n)),
 679                         copy_const_value(dbg, get_Eor_right(n)), m); break;
 680         case iro_Cast:
 681                 nn = new_d_Cast(dbg, copy_const_value(dbg, get_Cast_op(n)), get_Cast_type(n)); break;
 682         case iro_Conv:
 683                 nn = new_d_Conv(dbg, copy_const_value(dbg, get_Conv_op(n)), m); break;
 684         case iro_Unknown:
 685                 nn = new_d_Unknown(m); break;
 686         default:
 687                 assert(0 && "opcode invalid or not implemented");
 688                 nn = NULL;
 689                 break;
 690         }
 691         return nn;
 692 }  /* copy_const_value */
 693
 694 static ir_initializer_t null_initializer = { IR_INITIALIZER_NULL };
 695
 696 ir_initializer_t *get_initializer_null(void)
 697 {
 698         return &null_initializer;
 699 }
 700
 701 ir_initializer_t *create_initializer_const(ir_node *value)
 702 {
 703         struct obstack *obst = get_irg_obstack(get_const_code_irg());
 704
 705         ir_initializer_t *initializer
 706                 = obstack_alloc(obst, sizeof(ir_initializer_const_t));
 707         initializer->kind         = IR_INITIALIZER_CONST;
 708         initializer->consti.value = value;
 709
 710         return initializer;
 711 }
 712
 713 ir_initializer_t *create_initializer_tarval(tarval *tv)
 714 {
 715         struct obstack *obst = get_irg_obstack(get_const_code_irg());
 716
 717         ir_initializer_t *initializer
 718                 = obstack_alloc(obst, sizeof(ir_initializer_tarval_t));
 719         initializer->kind         = IR_INITIALIZER_TARVAL;
 720         initializer->tarval.value = tv;
 721
 722         return initializer;
 723 }
 724
 725 ir_initializer_t *create_initializer_compound(unsigned n_entries)
 726 {
 727         struct obstack *obst = get_irg_obstack(get_const_code_irg());
 728
 729         size_t i;
 730         size_t size  = sizeof(ir_initializer_compound_t)
 731                      + (n_entries-1) * sizeof(ir_initializer_t*);
 732
 733         ir_initializer_t *initializer = obstack_alloc(obst, size);
 734         initializer->kind                    = IR_INITIALIZER_COMPOUND;
 735         initializer->compound.n_initializers = n_entries;
 736
 737         for(i = 0; i < n_entries; ++i) {
 738                 initializer->compound.initializers[i] = get_initializer_null();
 739         }
 740
 741         return initializer;
 742 }
 743
 744 ir_node *get_initializer_const_value(const ir_initializer_t *initializer)
 745 {
 746         assert(initializer->kind == IR_INITIALIZER_CONST);
 747         return initializer->consti.value;
 748 }
 749
 750 tarval *get_initializer_tarval_value(const ir_initializer_t *initializer)
 751 {
 752         assert(initializer->kind == IR_INITIALIZER_TARVAL);
 753         return initializer->tarval.value;
 754 }
 755
 756 unsigned get_initializer_compound_n_entries(const ir_initializer_t *initializer)
 757 {
 758         assert(initializer->kind == IR_INITIALIZER_COMPOUND);
 759         return initializer->compound.n_initializers;
 760 }
 761
 762 void set_initializer_compound_value(ir_initializer_t *initializer,
 763                                     unsigned index, ir_initializer_t *value)
 764 {
 765         assert(initializer->kind == IR_INITIALIZER_COMPOUND);
 766         assert(index < initializer->compound.n_initializers);
 767
 768         initializer->compound.initializers[index] = value;
 769 }
 770
 771 ir_initializer_t *get_initializer_compound_value(
 772                 const ir_initializer_t *initializer, unsigned index)
 773 {
 774         assert(initializer->kind == IR_INITIALIZER_COMPOUND);
 775         assert(index < initializer->compound.n_initializers);
 776
 777         return initializer->compound.initializers[index];
 778 }
 779
 780 ir_initializer_kind_t get_initializer_kind(const ir_initializer_t *initializer)
 781 {
 782         return initializer->kind;
 783 }
 784
 785 static void check_entity_initializer(ir_entity *entity)
 786 {
 787         /* TODO */
 788         (void) entity;
 789 }
 790
 791 void set_entity_initializer(ir_entity *entity, ir_initializer_t *initializer)
 792 {
 793         entity->attr.initializer = initializer;
 794         entity->has_initializer  = 1;
 795         check_entity_initializer(entity);
 796 }
 797
 798 ir_initializer_t *get_entity_initializer(const ir_entity *entity)
 799 {
 800         assert(entity->has_initializer);
 801         return entity->attr.initializer;
 802 }
 803
 804 /* Creates a new compound graph path. */
 805 compound_graph_path *
 806 new_compound_graph_path(ir_type *tp, int length) {
 807         compound_graph_path *res;
 808
 809         assert(is_compound_type(tp));
 810         assert(length > 0);
 811
 812         res = xmalloc(sizeof(*res) + (length-1) * sizeof(res->list[0]));
 813         memset(res, 0, sizeof(*res) + (length-1) * sizeof(res->list[0]));
 814         res->kind         = k_ir_compound_graph_path;
 815         res->tp           = tp;
 816         res->len          = length;
 817
 818         return res;
 819 }  /* new_compound_graph_path */
 820
 821 /* Frees an graph path object */
 822 void free_compound_graph_path (compound_graph_path *gr) {
 823         assert(gr && is_compound_graph_path(gr));
 824         gr->kind = k_BAD;
 825         free(gr);
 826 }  /* free_compound_graph_path */
 827
 828 /* Returns non-zero if an object is a compound graph path */
 829 int is_compound_graph_path(const void *thing) {
 830         return (get_kind(thing) == k_ir_compound_graph_path);
 831 }  /* is_compound_graph_path */
 832
 833 /* Checks whether the path up to pos is correct. If the path contains a NULL,
 834  *  assumes the path is not complete and returns 'true'. */
 835 int is_proper_compound_graph_path(compound_graph_path *gr, int pos) {
 836         int i;
 837         ir_entity *node;
 838         ir_type *owner = gr->tp;
 839
 840         for (i = 0; i <= pos; i++) {
 841                 node = get_compound_graph_path_node(gr, i);
 842                 if (node == NULL)
 843                         /* Path not yet complete. */
 844                         return 1;
 845                 if (get_entity_owner(node) != owner)
 846                         return 0;
 847                 owner = get_entity_type(node);
 848         }
 849         if (pos == get_compound_graph_path_length(gr))
 850                 if (!is_atomic_type(owner))
 851                         return 0;
 852                 return 1;
 853 }  /* is_proper_compound_graph_path */
 854
 855 /* Returns the length of a graph path */
 856 int get_compound_graph_path_length(const compound_graph_path *gr) {
 857         assert(gr && is_compound_graph_path(gr));
 858         return gr->len;
 859 }  /* get_compound_graph_path_length */
 860
 861 ir_entity *
 862 get_compound_graph_path_node(const compound_graph_path *gr, int pos) {
 863         assert(gr && is_compound_graph_path(gr));
 864         assert(pos >= 0 && pos < gr->len);
 865         return gr->list[pos].node;
 866 }  /* get_compound_graph_path_node */
 867
 868 void
 869 set_compound_graph_path_node(compound_graph_path *gr, int pos, ir_entity *node) {
 870         assert(gr && is_compound_graph_path(gr));
 871         assert(pos >= 0 && pos < gr->len);
 872         assert(is_entity(node));
 873         gr->list[pos].node = node;
 874         assert(is_proper_compound_graph_path(gr, pos));
 875 }  /* set_compound_graph_path_node */
 876
 877 int
 878 get_compound_graph_path_array_index(const compound_graph_path *gr, int pos) {
 879         assert(gr && is_compound_graph_path(gr));
 880         assert(pos >= 0 && pos < gr->len);
 881         return gr->list[pos].index;
 882 }  /* get_compound_graph_path_array_index */
 883
 884 void
 885 set_compound_graph_path_array_index(compound_graph_path *gr, int pos, int index) {
 886         assert(gr && is_compound_graph_path(gr));
 887         assert(pos >= 0 && pos < gr->len);
 888         gr->list[pos].index = index;
 889 }  /* set_compound_graph_path_array_index */
 890
 891 ir_type *
 892 get_compound_graph_path_type(const compound_graph_path *gr) {
 893         assert(gr && is_compound_graph_path(gr));
 894         return gr->tp;
 895 }
 896
 897 /* A value of a compound entity is a pair of value and the corresponding path to a member of
 898    the compound. */
 899 void
 900 add_compound_ent_value_w_path(ir_entity *ent, ir_node *val, compound_graph_path *path) {
 901         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
 902         assert(is_compound_graph_path(path));
 903         ARR_APP1(ir_node *, ent->attr.cmpd_attr.values, val);
 904         ARR_APP1(compound_graph_path *, ent->attr.cmpd_attr.val_paths, path);
 905 }  /* add_compound_ent_value_w_path */
 906
 907 void
 908 set_compound_ent_value_w_path(ir_entity *ent, ir_node *val, compound_graph_path *path, int pos) {
 909         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
 910         assert(is_compound_graph_path(path));
 911         assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values));
 912         ent->attr.cmpd_attr.values[pos]    = val;
 913         ent->attr.cmpd_attr.val_paths[pos] = path;
 914 }  /* set_compound_ent_value_w_path */
 915
 916 int
 917 get_compound_ent_n_values(ir_entity *ent) {
 918         assert(!ent->has_initializer);
 919         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
 920         return ARR_LEN(ent->attr.cmpd_attr.values);
 921 }  /* get_compound_ent_n_values */
 922
 923 ir_node *
 924 get_compound_ent_value(ir_entity *ent, int pos) {
 925         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
 926         assert(!ent->has_initializer);
 927         assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values));
 928         return ent->attr.cmpd_attr.values[pos];
 929 }  /* get_compound_ent_value */
 930
 931 compound_graph_path *
 932 get_compound_ent_value_path(ir_entity *ent, int pos) {
 933         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
 934         assert(!ent->has_initializer);
 935         assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.val_paths));
 936         return ent->attr.cmpd_attr.val_paths[pos];
 937 }  /* get_compound_ent_value_path */
 938
 939 /**
 940  * Returns non-zero, if two compound_graph_pathes are equal
 941  *
 942  * @param path1            the first path
 943  * @param path2            the second path
 944  */
 945 static int equal_paths(compound_graph_path *path1, compound_graph_path *path2) {
 946         int i;
 947         int len1 = get_compound_graph_path_length(path1);
 948         int len2 = get_compound_graph_path_length(path2);
 949
 950         if (len2 != len1) return 0;
 951
 952         for (i = 0; i < len1; i++) {
 953                 ir_type *tp;
 954                 ir_entity *node1 = get_compound_graph_path_node(path1, i);
 955                 ir_entity *node2 = get_compound_graph_path_node(path2, i);
 956
 957                 if (node1 != node2) return 0;
 958
 959                 tp = get_entity_owner(node1);
 960                 if (is_Array_type(tp)) {
 961                         int index1 = get_compound_graph_path_array_index(path1, i);
 962                         int index2 = get_compound_graph_path_array_index(path2, i);
 963                         if (index1 != index2)
 964                                 return 0;
 965                 }
 966         }
 967         return 1;
 968 }  /* equal_paths */
 969
 970 /**
 971  * Returns the position of a value with the given path.
 972  * The path must contain array indices for all array element entities.
 973  *
 974  * @todo  This implementation is very slow (O(number of initializers * |path|)
 975  *        and should be replaced when the new tree oriented
 976  *        value representation is finally implemented.
 977  */
 978 static int get_compound_ent_pos_by_path(ir_entity *ent, compound_graph_path *path) {
 979         int i, n_paths = get_compound_ent_n_values(ent);
 980
 981         for (i = 0; i < n_paths; i ++) {
 982                 compound_graph_path *gr = get_compound_ent_value_path(ent, i);
 983                 if (equal_paths(gr, path))
 984                         return i;
 985         }
 986         return -1;
 987 }  /* get_compound_ent_pos_by_path */
 988
 989 /* Returns a constant value given the access path.
 990  *  The path must contain array indices for all array element entities. */
 991 ir_node *get_compound_ent_value_by_path(ir_entity *ent, compound_graph_path *path) {
 992         int pos = get_compound_ent_pos_by_path(ent, path);
 993         if (pos >= 0)
 994                 return get_compound_ent_value(ent, pos);
 995         return NULL;
 996 }  /* get_compound_ent_value_by_path */
 997
 998
 999 void
1000 remove_compound_ent_value(ir_entity *ent, ir_entity *value_ent) {
1001         int i, n;
1002         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
1003
1004         n = ARR_LEN(ent->attr.cmpd_attr.val_paths);
1005         for (i = 0; i < n; ++i) {
1006                 compound_graph_path *path = ent->attr.cmpd_attr.val_paths[i];
1007                 if (path->list[path->len-1].node == value_ent) {
1008                         for (; i < n - 1; ++i) {
1009                                 ent->attr.cmpd_attr.val_paths[i] = ent->attr.cmpd_attr.val_paths[i+1];
1010                                 ent->attr.cmpd_attr.values[i]    = ent->attr.cmpd_attr.values[i+1];
1011                         }
1012                         ARR_SETLEN(ir_entity*, ent->attr.cmpd_attr.val_paths, n - 1);
1013                         ARR_SETLEN(ir_node*,   ent->attr.cmpd_attr.values,    n - 1);
1014                         break;
1015                 }
1016         }
1017 }  /* remove_compound_ent_value */
1018
1019 void
1020 add_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member) {
1021         compound_graph_path *path;
1022         ir_type *owner_tp = get_entity_owner(member);
1023         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
1024         path = new_compound_graph_path(get_entity_type(ent), 1);
1025         path->list[0].node = member;
1026         if (is_Array_type(owner_tp)) {
1027                 int max;
1028                 int i, n;
1029
1030                 assert(get_array_n_dimensions(owner_tp) == 1 && has_array_lower_bound(owner_tp, 0));
1031                 max = get_array_lower_bound_int(owner_tp, 0) -1;
1032                 for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
1033                         int index = get_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0);
1034                         if (index > max) {
1035                                 max = index;
1036                         }
1037                 }
1038                 path->list[0].index = max + 1;
1039         }
1040         add_compound_ent_value_w_path(ent, val, path);
1041 }  /* add_compound_ent_value */
1042
1043
1044 ir_entity *
1045 get_compound_ent_value_member(ir_entity *ent, int pos) {
1046         compound_graph_path *path;
1047         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
1048         path = get_compound_ent_value_path(ent, pos);
1049
1050         return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
1051 }  /* get_compound_ent_value_member */
1052
1053 void
1054 set_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member, int pos) {
1055         compound_graph_path *path;
1056         assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
1057         path = get_compound_ent_value_path(ent, pos);
1058         set_compound_graph_path_node(path, 0, member);
1059         set_compound_ent_value_w_path(ent, val, path, pos);
1060 }  /* set_compound_ent_value */
1061
1062 void
1063 set_array_entity_values(ir_entity *ent, tarval **values, int num_vals) {
1064         int i;
1065         ir_graph *rem = current_ir_graph;
1066         ir_type *arrtp = get_entity_type(ent);
1067         ir_node *val;
1068         ir_type *elttp = get_array_element_type(arrtp);
1069
1070         assert(is_Array_type(arrtp));
1071         assert(get_array_n_dimensions(arrtp) == 1);
1072         /* One bound is sufficient, the number of constant fields makes the
1073            size. */
1074         assert(get_array_lower_bound (arrtp, 0) || get_array_upper_bound (arrtp, 0));
1075         assert(get_entity_variability(ent) != variability_uninitialized);
1076         current_ir_graph = get_const_code_irg();
1077
1078         for (i = 0; i < num_vals; i++) {
1079                 val = new_Const_type(values[i], elttp);
1080                 add_compound_ent_value(ent, val, get_array_element_entity(arrtp));
1081                 set_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0, i);
1082         }
1083         current_ir_graph = rem;
1084 }  /* set_array_entity_values */
1085
1086 /* Return the overall offset of value at position pos in bytes. */
1087 unsigned get_compound_ent_value_offset_bytes(ir_entity *ent, int pos) {
1088         compound_graph_path *path;
1089         int path_len, i;
1090         unsigned offset = 0;
1091         ir_type *curr_tp;
1092
1093         assert(get_type_state(get_entity_type(ent)) == layout_fixed);
1094
1095         path     = get_compound_ent_value_path(ent, pos);
1096         path_len = get_compound_graph_path_length(path);
1097         curr_tp  = path->tp;
1098
1099         for (i = 0; i < path_len; ++i) {
1100                 if (is_Array_type(curr_tp)) {
1101                         ir_type *elem_type = get_array_element_type(curr_tp);
1102                         unsigned size      = get_type_size_bytes(elem_type);
1103                         unsigned align     = get_type_alignment_bytes(elem_type);
1104                         int      idx;
1105
1106                         assert(size > 0);
1107                         if(size % align > 0) {
1108                                 size += align - (size % align);
1109                         }
1110                         idx = get_compound_graph_path_array_index(path, i);
1111                         assert(idx >= 0);
1112                         offset += size * idx;
1113                         curr_tp = elem_type;
1114                 } else {
1115                         ir_entity *node = get_compound_graph_path_node(path, i);
1116                         offset += get_entity_offset(node);
1117                         curr_tp = get_entity_type(node);
1118                 }
1119         }
1120
1121         return offset;
1122 }  /* get_compound_ent_value_offset_bytes */
1123
1124 /* Return the offset in bits from the last byte address. */
1125 unsigned get_compound_ent_value_offset_bit_remainder(ir_entity *ent, int pos) {
1126         compound_graph_path *path;
1127         int path_len;
1128         ir_entity *last_node;
1129
1130         assert(get_type_state(get_entity_type(ent)) == layout_fixed);
1131
1132         path      = get_compound_ent_value_path(ent, pos);
1133         path_len  = get_compound_graph_path_length(path);
1134         last_node = get_compound_graph_path_node(path, path_len - 1);
1135
1136         if(last_node == NULL)
1137                 return 0;
1138
1139         return get_entity_offset_bits_remainder(last_node);
1140 }  /* get_compound_ent_value_offset_bit_remainder */
1141
1142 int
1143 (get_entity_offset)(const ir_entity *ent) {
1144         return _get_entity_offset(ent);
1145 }  /* get_entity_offset */
1146
1147 void
1148 (set_entity_offset)(ir_entity *ent, int offset) {
1149         _set_entity_offset(ent, offset);
1150 }  /* set_entity_offset */
1151
1152 unsigned char
1153 (get_entity_offset_bits_remainder)(const ir_entity *ent) {
1154         return _get_entity_offset_bits_remainder(ent);
1155 }  /* get_entity_offset_bits_remainder */
1156
1157 void
1158 (set_entity_offset_bits_remainder)(ir_entity *ent, unsigned char offset) {
1159         _set_entity_offset_bits_remainder(ent, offset);
1160 }  /* set_entity_offset_bits_remainder */
1161
1162 void
1163 add_entity_overwrites(ir_entity *ent, ir_entity *overwritten) {
1164 #ifndef NDEBUG
1165         ir_type *owner     = get_entity_owner(ent);
1166         ir_type *ovw_ovner = get_entity_owner(overwritten);
1167         assert(is_Class_type(owner));
1168         assert(is_Class_type(ovw_ovner));
1169         assert(! is_class_final(ovw_ovner));
1170 #endif /* NDEBUG */
1171         ARR_APP1(ir_entity *, ent->overwrites, overwritten);
1172         ARR_APP1(ir_entity *, overwritten->overwrittenby, ent);
1173 }  /* add_entity_overwrites */
1174
1175 int
1176 get_entity_n_overwrites(ir_entity *ent) {
1177         assert(is_Class_type(get_entity_owner(ent)));
1178         return (ARR_LEN(ent->overwrites));
1179 }  /* get_entity_n_overwrites */
1180
1181 int
1182 get_entity_overwrites_index(ir_entity *ent, ir_entity *overwritten) {
1183         int i, n;
1184         assert(is_Class_type(get_entity_owner(ent)));
1185         n = get_entity_n_overwrites(ent);
1186         for (i = 0; i < n; ++i) {
1187                 if (get_entity_overwrites(ent, i) == overwritten)
1188                         return i;
1189         }
1190         return -1;
1191 }  /* get_entity_overwrites_index */
1192
1193 ir_entity *
1194 get_entity_overwrites(ir_entity *ent, int pos) {
1195         assert(is_Class_type(get_entity_owner(ent)));
1196         assert(pos < get_entity_n_overwrites(ent));
1197         return ent->overwrites[pos];
1198 }  /* get_entity_overwrites */
1199
1200 void
1201 set_entity_overwrites(ir_entity *ent, int pos, ir_entity *overwritten) {
1202         assert(is_Class_type(get_entity_owner(ent)));
1203         assert(pos < get_entity_n_overwrites(ent));
1204         ent->overwrites[pos] = overwritten;
1205 }  /* set_entity_overwrites */
1206
1207 void
1208 remove_entity_overwrites(ir_entity *ent, ir_entity *overwritten) {
1209         int i, n;
1210         assert(is_Class_type(get_entity_owner(ent)));
1211         n = ARR_LEN(ent->overwrites);
1212         for (i = 0; i < n; ++i) {
1213                 if (ent->overwrites[i] == overwritten) {
1214                         for (; i < n - 1; i++)
1215                                 ent->overwrites[i] = ent->overwrites[i+1];
1216                         ARR_SETLEN(ir_entity*, ent->overwrites, n - 1);
1217                         break;
1218                 }
1219         }
1220 }  /* remove_entity_overwrites */
1221
1222 void
1223 add_entity_overwrittenby(ir_entity *ent, ir_entity *overwrites) {
1224         add_entity_overwrites(overwrites, ent);
1225 }  /* add_entity_overwrittenby */
1226
1227 int
1228 get_entity_n_overwrittenby(ir_entity *ent) {
1229         assert(is_Class_type(get_entity_owner(ent)));
1230         return ARR_LEN(ent->overwrittenby);
1231 }  /* get_entity_n_overwrittenby */
1232
1233 int
1234 get_entity_overwrittenby_index(ir_entity *ent, ir_entity *overwrites) {
1235         int i, n;
1236         assert(is_Class_type(get_entity_owner(ent)));
1237         n = get_entity_n_overwrittenby(ent);
1238         for (i = 0; i < n; ++i) {
1239                 if (get_entity_overwrittenby(ent, i) == overwrites)
1240                         return i;
1241         }
1242         return -1;
1243 }  /* get_entity_overwrittenby_index */
1244
1245 ir_entity *
1246 get_entity_overwrittenby(ir_entity *ent, int pos) {
1247         assert(is_Class_type(get_entity_owner(ent)));
1248         assert(pos < get_entity_n_overwrittenby(ent));
1249         return ent->overwrittenby[pos];
1250 }  /* get_entity_overwrittenby */
1251
1252 void
1253 set_entity_overwrittenby(ir_entity *ent, int pos, ir_entity *overwrites) {
1254         assert(is_Class_type(get_entity_owner(ent)));
1255         assert(pos < get_entity_n_overwrittenby(ent));
1256         ent->overwrittenby[pos] = overwrites;
1257 }  /* set_entity_overwrittenby */
1258
1259 void remove_entity_overwrittenby(ir_entity *ent, ir_entity *overwrites) {
1260         int i, n;
1261         assert(is_Class_type(get_entity_owner(ent)));
1262
1263         n = ARR_LEN(ent->overwrittenby);
1264         for (i = 0; i < n; ++i) {
1265                 if (ent->overwrittenby[i] == overwrites) {
1266                         for(; i < n - 1; ++i)
1267                                 ent->overwrittenby[i] = ent->overwrittenby[i+1];
1268                         ARR_SETLEN(ir_entity*, ent->overwrittenby, n - 1);
1269                         break;
1270                 }
1271         }
1272 }  /* remove_entity_overwrittenby */
1273
1274 /* A link to store intermediate information */
1275 void *
1276 (get_entity_link)(const ir_entity *ent) {
1277         return _get_entity_link(ent);
1278 }  /* get_entity_link */
1279
1280 void
1281 (set_entity_link)(ir_entity *ent, void *l) {
1282         _set_entity_link(ent, l);
1283 }  /* set_entity_link */
1284
1285 ir_graph *
1286 (get_entity_irg)(const ir_entity *ent) {
1287         return _get_entity_irg(ent);
1288 }  /* get_entity_irg */
1289
1290 void
1291 set_entity_irg(ir_entity *ent, ir_graph *irg) {
1292         assert(is_method_entity(ent));
1293         /* Wie kann man die Referenz auf einen IRG löschen, z.B. wenn die
1294          * Methode selbst nicht mehr aufgerufen werden kann, die Entität
1295          * aber erhalten bleiben soll?  Wandle die Entitaet in description oder
1296          * inherited um! */
1297         /* assert(irg); */
1298         assert((irg  && ent->peculiarity == peculiarity_existent) ||
1299                 (!irg && (ent->peculiarity == peculiarity_existent)
1300                 && (ent -> visibility == visibility_external_allocated)) ||
1301                 (!irg && ent->peculiarity == peculiarity_description) ||
1302                 (!irg && ent->peculiarity == peculiarity_inherited));
1303         ent->attr.mtd_attr.irg = irg;
1304 }  /* set_entity_irg */
1305
1306 unsigned get_entity_vtable_number(const ir_entity *ent) {
1307         assert(is_method_entity((ir_entity *)ent));
1308         return ent->attr.mtd_attr.vtable_number;
1309 }  /* get_entity_vtable_number */
1310
1311 void set_entity_vtable_number(ir_entity *ent, unsigned vtable_number) {
1312         assert(is_method_entity(ent));
1313         ent->attr.mtd_attr.vtable_number = vtable_number;
1314 }  /* set_entity_vtable_number */
1315
1316 int
1317 (is_entity)(const void *thing) {
1318         return _is_entity(thing);
1319 }  /* is_entity */
1320
1321 int is_atomic_entity(ir_entity *ent) {
1322         ir_type *t      = get_entity_type(ent);
1323         const tp_op *op = get_type_tpop(t);
1324         return (op == type_primitive || op == type_pointer ||
1325                 op == type_enumeration || op == type_method);
1326 }  /* is_atomic_entity */
1327
1328 int is_compound_entity(ir_entity *ent) {
1329         ir_type     *t  = get_entity_type(ent);
1330         const tp_op *op = get_type_tpop(t);
1331         return (op == type_class || op == type_struct ||
1332                 op == type_array || op == type_union);
1333 }  /* is_compound_entity */
1334
1335 int is_method_entity(ir_entity *ent) {
1336         ir_type *t = get_entity_type(ent);
1337         return is_Method_type(t);
1338 }  /* is_method_entity */
1339
1340 /**
1341  * @todo not implemented!!! */
1342 int equal_entity(ir_entity *ent1, ir_entity *ent2) {
1343         (void) ent1;
1344         (void) ent2;
1345         fprintf(stderr, " calling unimplemented equal entity!!! \n");
1346         return 1;
1347 }  /* equal_entity */
1348
1349
1350 unsigned long (get_entity_visited)(ir_entity *ent) {
1351         return _get_entity_visited(ent);
1352 }  /* get_entity_visited */
1353
1354 void (set_entity_visited)(ir_entity *ent, unsigned long num) {
1355         _set_entity_visited(ent, num);
1356 }  /* set_entity_visited */
1357
1358 /* Sets visited field in ir_entity to entity_visited. */
1359 void (mark_entity_visited)(ir_entity *ent) {
1360         _mark_entity_visited(ent);
1361 }  /* mark_entity_visited */
1362
1363 int (entity_visited)(ir_entity *ent) {
1364         return _entity_visited(ent);
1365 }  /* entity_visited */
1366
1367 int (entity_not_visited)(ir_entity *ent) {
1368         return _entity_not_visited(ent);
1369 }  /* entity_not_visited */
1370
1371 /* Returns the mask of the additional entity properties. */
1372 unsigned get_entity_additional_properties(ir_entity *ent) {
1373         ir_graph *irg;
1374
1375         assert(is_method_entity(ent));
1376
1377         /* first check, if the graph has additional properties */
1378         irg = get_entity_irg(ent);
1379
1380         if (irg)
1381                 return get_irg_additional_properties(irg);
1382
1383         if (ent->attr.mtd_attr.irg_add_properties & mtp_property_inherited)
1384                 return get_method_additional_properties(get_entity_type(ent));
1385
1386         return ent->attr.mtd_attr.irg_add_properties;
1387 }  /* get_entity_additional_properties */
1388
1389 /* Sets the mask of the additional graph properties. */
1390 void set_entity_additional_properties(ir_entity *ent, unsigned property_mask)
1391 {
1392         ir_graph *irg;
1393
1394         assert(is_method_entity(ent));
1395
1396         /* first check, if the graph exists */
1397         irg = get_entity_irg(ent);
1398         if (irg)
1399                 set_irg_additional_properties(irg, property_mask);
1400         else {
1401     /* do not allow to set the mtp_property_inherited flag or
1402                 * the automatic inheritance of flags will not work */
1403                 ent->attr.mtd_attr.irg_add_properties = property_mask & ~mtp_property_inherited;
1404         }
1405 }  /* set_entity_additional_properties */
1406
1407 /* Sets one additional graph property. */
1408 void set_entity_additional_property(ir_entity *ent, mtp_additional_property flag)
1409 {
1410         ir_graph *irg;
1411
1412         assert(is_method_entity(ent));
1413
1414         /* first check, if the graph exists */
1415         irg = get_entity_irg(ent);
1416         if (irg)
1417                 set_irg_additional_property(irg, flag);
1418         else {
1419                 unsigned mask = ent->attr.mtd_attr.irg_add_properties;
1420
1421                 if (mask & mtp_property_inherited)
1422                         mask = get_method_additional_properties(get_entity_type(ent));
1423
1424                         /* do not allow to set the mtp_property_inherited flag or
1425                 * the automatic inheritance of flags will not work */
1426                 ent->attr.mtd_attr.irg_add_properties = mask | (flag & ~mtp_property_inherited);
1427         }
1428 }  /* set_entity_additional_property */
1429
1430 /* Returns the class type that this type info entity represents or NULL
1431    if ent is no type info entity. */
1432 ir_type *(get_entity_repr_class)(const ir_entity *ent) {
1433         return _get_entity_repr_class(ent);
1434 }  /* get_entity_repr_class */
1435
1436 dbg_info *(get_entity_dbg_info)(const ir_entity *ent) {
1437         return _get_entity_dbg_info(ent);
1438 }  /* get_entity_dbg_info */
1439
1440 void (set_entity_dbg_info)(ir_entity *ent, dbg_info *db) {
1441         _set_entity_dbg_info(ent, db);
1442 }  /* set_entity_dbg_info */
1443
1444 /* Initialize entity module. */
1445 void firm_init_entity(void)
1446 {
1447         symconst_symbol sym;
1448
1449         assert(firm_unknown_type && "Call init_type() before firm_init_entity()!");
1450         assert(!unknown_entity && "Call firm_init_entity() only once!");
1451
1452         unknown_entity = new_rd_entity(NULL, firm_unknown_type, new_id_from_str(UNKNOWN_ENTITY_NAME), firm_unknown_type);
1453         set_entity_visibility(unknown_entity, visibility_external_allocated);
1454         set_entity_ld_ident(unknown_entity, get_entity_ident(unknown_entity));
1455
1456         current_ir_graph      = get_const_code_irg();
1457         sym.entity_p          = unknown_entity;
1458         /* TODO: we need two unknown_entities here, one for code and one for data */
1459         unknown_entity->value = new_SymConst(mode_P_data, sym, symconst_addr_ent);
1460 }  /* firm_init_entity */