-int is_irn_const_expression(ir_node *n) {
- ir_mode *m;
-
- m = get_irn_mode(n);
- switch(get_irn_opcode(n)) {
- case iro_Const:
- case iro_SymConst:
- case iro_Unknown:
- return true; break;
- case iro_Add:
- if (is_irn_const_expression(get_Add_left(n)))
- return is_irn_const_expression(get_Add_right(n));
- case iro_Conv:
- case iro_Cast:
- return is_irn_const_expression(get_irn_n(n, 0));
- default:
- return false;
- break;
- }
- return false;
-}
-
-
-ir_node *copy_const_value(ir_node *n) {
- ir_node *nn;
- ir_mode *m;
-
- m = get_irn_mode(n);
- switch(get_irn_opcode(n)) {
- case iro_Const:
- nn = new_Const(m, get_Const_tarval(n)); break;
- case iro_SymConst:
- nn = new_SymConst(get_SymConst_type_or_id(n), get_SymConst_kind(n)); break;
- case iro_Add:
- nn = new_Add(copy_const_value(get_Add_left(n)),
- copy_const_value(get_Add_right(n)), m); break;
- case iro_Cast:
- nn = new_Cast(copy_const_value(get_Cast_op(n)), get_Cast_type(n)); break;
- case iro_Conv:
- nn = new_Conv(copy_const_value(get_Conv_op(n)), m); break;
- case iro_Unknown:
- nn = new_Unknown(m); break;
- default:
- DDMN(n);
- assert(0 && "opdope invalid or not implemented");
- nn = NULL;
- break;
- }
- return nn;
-}
-
-compound_graph_path *
-new_compound_graph_path(type *tp, int length) {
- compound_graph_path *res;
- assert(is_type(tp) && is_compound_type(tp));
- assert(length > 0);
-
- res = (compound_graph_path *) malloc (sizeof(compound_graph_path) + (length-1) * sizeof(entity *));
- res->kind = k_ir_compound_graph_path;
- res->tp = tp;
- res->len = length;
- memset(res->nodes, 0, sizeof(entity *) * length);
- return res;
-}
-
-INLINE void
-free_compound_graph_path (compound_graph_path *gr) {
- assert(gr && is_compound_graph_path(gr));
- gr->kind = k_BAD;
- free(gr);
-}
-
-INLINE int
-is_compound_graph_path(void *thing) {
- return (get_kind(thing) == k_ir_compound_graph_path);
-}
-
-/* checks whether nodes 0..pos are correct (all lie on a path.) */
-/* @@@ not implemented */
-INLINE int is_proper_compound_graph_path(compound_graph_path *gr, int pos) {
- int i;
- entity *node;
- type *owner = gr->tp;
- for (i = 0; i <= pos; i++) {
- node = get_compound_graph_path_node(gr, i);
- if (get_entity_owner(node) != owner) return false;
- owner = get_entity_type(node);
- }
- if (pos == get_compound_graph_path_length(gr))
- if (!is_atomic_type(owner)) return false;
- return true;
-}
-
-INLINE int
-get_compound_graph_path_length(compound_graph_path *gr) {
- assert(gr && is_compound_graph_path(gr));
- return gr->len;
-}
-
-INLINE entity *
-get_compound_graph_path_node(compound_graph_path *gr, int pos) {
- assert(gr && is_compound_graph_path(gr));
- assert(pos >= 0 && pos < gr->len);
- return gr->nodes[pos];
-}
-
-INLINE void
-set_compound_graph_path_node(compound_graph_path *gr, int pos, entity *node) {
- assert(gr && is_compound_graph_path(gr));
- assert(pos >= 0 && pos < gr->len);
- assert(is_entity(node));
- gr->nodes[pos] = node;
- assert(is_proper_compound_graph_path(gr, pos));
-}
-
-/* A value of a compound entity is a pair of value and the corresponding path to a member of
- the compound. */
-INLINE void
-add_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path) {
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- ARR_APP1 (ir_node *, ent->values, val);
- ARR_APP1 (compound_graph_path *, ent->val_paths, path);
-}
-
-INLINE void
-set_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- ent->values[pos] = val;
- ent->val_paths[pos] = path;
-}
-
-INLINE int
-get_compound_ent_n_values(entity *ent) {
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- return (ARR_LEN (ent->values));
-}
-
-INLINE ir_node *
-get_compound_ent_value(entity *ent, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- return ent->values[pos];
-}
-
-INLINE compound_graph_path *
-get_compound_ent_value_path(entity *ent, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- return ent->val_paths[pos];
-}
-
-void
-remove_compound_ent_value(entity *ent, entity *value_ent) {
- int i;
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- for (i = 0; i < (ARR_LEN (ent->val_paths)); i++) {
- compound_graph_path *path = ent->val_paths[i];
- if (path->nodes[path->len-1] == value_ent) {
- for(; i < (ARR_LEN (ent->val_paths))-1; i++) {
- ent->val_paths[i] = ent->val_paths[i+1];
- ent->values[i] = ent->values[i+1];
- }
- ARR_SETLEN(entity*, ent->val_paths, ARR_LEN(ent->val_paths) - 1);
- ARR_SETLEN(ir_node*, ent->values, ARR_LEN(ent->values) - 1);
- break;
- }
- }
-}
-
-INLINE void
-add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
- compound_graph_path *path;
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- path = new_compound_graph_path(get_entity_owner(ent), 1);
- path->nodes[0] = member;
- add_compound_ent_value_w_path(ent, val, path);
-}
-
-/* Copies the firm subgraph referenced by val to const_code_irg and adds
- the node as constant initialization to ent.
- The subgraph may not contain control flow operations.
-INLINE void
-copy_and_add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
- ir_graph *rem = current_ir_graph;
-
- assert(get_entity_variability(ent) != variability_uninitialized);
- current_ir_graph = get_const_code_irg();
-
- val = copy_const_value(val);
- add_compound_ent_value(ent, val, member);
- current_ir_graph = rem;
- }*/
-
-/* Copies the value i of the entity to current_block in current_ir_graph.
-ir_node *
-copy_compound_ent_value(entity *ent, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- return copy_const_value(ent->values[pos+1]);
- }*/
-
-INLINE entity *
-get_compound_ent_value_member(entity *ent, int pos) {
- compound_graph_path *path;
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- path = get_compound_ent_value_path(ent, pos);
-
- return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
-}
-
-INLINE void
-set_compound_ent_value(entity *ent, ir_node *val, entity *member, int pos) {
- compound_graph_path *path;
- assert(ent && is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- path = get_compound_ent_value_path(ent, pos);
- set_compound_graph_path_node(path, 0, member);
- set_compound_ent_value_w_path(ent, val, path, pos);
-}
-
-void
-set_array_entity_values(entity *ent, tarval **values, int num_vals) {
- int i;
- ir_graph *rem = current_ir_graph;
- type *arrtp = get_entity_type(ent);
- ir_node *val;
-
- assert(is_array_type(arrtp));
- assert(get_array_n_dimensions(arrtp) == 1);
- /* One bound is sufficient, the nunmber of constant fields makes the
- size. */
- assert(get_array_lower_bound (arrtp, 0) || get_array_upper_bound (arrtp, 0));
- assert(get_entity_variability(ent) != variability_uninitialized);
- current_ir_graph = get_const_code_irg();
-
- for (i = 0; i < num_vals; i++) {
- val = new_Const(get_tarval_mode (values[i]), values[i]);
- add_compound_ent_value(ent, val, get_array_element_entity(arrtp));
- }
- current_ir_graph = rem;
-}
-
-INLINE int
-get_entity_offset (entity *ent) {
- return ent->offset;
-}
-
-INLINE void
-set_entity_offset (entity *ent, int offset) {
- ent->offset = offset;
-}
-
-INLINE void
-add_entity_overwrites (entity *ent, entity *overwritten) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- ARR_APP1 (entity *, ent->overwrites, overwritten);
- ARR_APP1 (entity *, overwritten->overwrittenby, ent);
-}
-
-INLINE int
-get_entity_n_overwrites (entity *ent) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- return (ARR_LEN (ent->overwrites));
-}
-
-int
-get_entity_overwrites_index(entity *ent, entity *overwritten) {
- int i;
- assert(ent && is_class_type(get_entity_owner(ent)));
- for (i = 0; i < get_entity_n_overwrites(ent); i++)
- if (get_entity_overwrites(ent, i) == overwritten)
- return i;
- return -1;
-}
-
-INLINE entity *
-get_entity_overwrites (entity *ent, int pos) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- assert(pos < get_entity_n_overwrites(ent));
- return ent->overwrites[pos];
-}
-
-INLINE void
-set_entity_overwrites (entity *ent, int pos, entity *overwritten) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- assert(pos < get_entity_n_overwrites(ent));
- ent->overwrites[pos] = overwritten;
-}
-
-void
-remove_entity_overwrites(entity *ent, entity *overwritten) {
- int i;
- assert(ent && is_class_type(get_entity_owner(ent)));
- for (i = 0; i < (ARR_LEN (ent->overwrites)); i++)
- if (ent->overwrites[i] == overwritten) {
- for(; i < (ARR_LEN (ent->overwrites))-1; i++)
- ent->overwrites[i] = ent->overwrites[i+1];
- ARR_SETLEN(entity*, ent->overwrites, ARR_LEN(ent->overwrites) - 1);
- break;
- }
-}
-
-INLINE void
-add_entity_overwrittenby (entity *ent, entity *overwrites) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- add_entity_overwrites(overwrites, ent);
-}
-
-INLINE int
-get_entity_n_overwrittenby (entity *ent) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- return (ARR_LEN (ent->overwrittenby));