-/* Returns true if the the node is representable as code on
- * const_code_irg. */
-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:
- case iro_Sub:
- case iro_Mul:
- case iro_And:
- case iro_Or:
- case iro_Eor:
- if (is_irn_const_expression(get_binop_left(n)))
- return is_irn_const_expression(get_binop_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_symbol(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_Sub:
- nn = new_Sub(copy_const_value(get_Sub_left(n)),
- copy_const_value(get_Sub_right(n)), m); break;
- case iro_Mul:
- nn = new_Mul(copy_const_value(get_Mul_left(n)),
- copy_const_value(get_Mul_right(n)), m); break;
- case iro_And:
- nn = new_And(copy_const_value(get_And_left(n)),
- copy_const_value(get_And_right(n)), m); break;
- case iro_Or:
- nn = new_Or(copy_const_value(get_Or_left(n)),
- copy_const_value(get_Or_right(n)), m); break;
- case iro_Eor:
- nn = new_Eor(copy_const_value(get_Eor_left(n)),
- copy_const_value(get_Eor_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;
-}
-
-void
-free_compound_graph_path (compound_graph_path *gr) {
- assert(gr && is_compound_graph_path(gr));
- gr->kind = k_BAD;
- free(gr);
-}
-
-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 */
-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;
-}
-
-int
-get_compound_graph_path_length(compound_graph_path *gr) {
- assert(gr && is_compound_graph_path(gr));
- return gr->len;
-}
-
-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];
-}
-
-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. */
-void
-add_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path) {
- assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- ARR_APP1 (ir_node *, ent->values, val);
- ARR_APP1 (compound_graph_path *, ent->val_paths, path);
-}
-
-void
-set_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path, int pos) {
- assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- ent->values[pos] = val;
- ent->val_paths[pos] = path;
-}
-
-int
-get_compound_ent_n_values(entity *ent) {
- assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- return (ARR_LEN (ent->values));
-}
-
-ir_node *
-get_compound_ent_value(entity *ent, int pos) {
- assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- return ent->values[pos];
-}
-
-compound_graph_path *
-get_compound_ent_value_path(entity *ent, int pos) {
- assert(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(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;
- }
- }
-}
-
-void
-add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
- compound_graph_path *path;
- assert(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.
-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;
- }*/