Commit 13588bfa authored by Götz Lindenmaier's avatar Götz Lindenmaier
Browse files

Adapted to changes in tv and irmode

[r983]
parent 3d8eaec4
......@@ -20,7 +20,7 @@
#define SPDICT_COOKIE1 0xB0031E7
#define SPDICT_COOKIE2 0xBA17B003
/* Line N_o_mbers ToDo: Warum o? */
/* Line N_o_mbers ToDo: Warum o? Answer: No. 5, not Nu. 5*/
#define LINO_COOKIE 0x71b83bd5
#endif
......@@ -68,7 +68,7 @@ entity *get_inherited_methods_implementation(entity *inh_meth) {
assert(addr && "constant entity without value");
if (get_irn_op(addr) == op_Const) {
impl_meth = get_tv_entity(get_Const_tarval(addr));
impl_meth = tarval_to_entity(get_Const_tarval(addr));
}
assert(!impl_meth || get_entity_peculiarity(impl_meth) == existent);
......@@ -184,7 +184,7 @@ static void sel_methods_walker(ir_node * node, pmap * ldname_map) {
assert(get_entity_irg(ent));
set_irg_current_block(current_ir_graph, get_nodes_Block(node));
new_node = new_d_Const(get_irn_dbg_info(node),
mode_P, tarval_P_from_entity(ent)); DBG_OPT_NORMALIZE;
mode_P, new_tarval_from_entity(ent, mode_P)); DBG_OPT_NORMALIZE;
exchange(node, new_node);
}
}
......@@ -398,7 +398,7 @@ static void callee_ana_node(ir_node * node, eset * methods) {
case iro_Const: {
/* interne Methode */
entity * ent = get_Const_tarval(node)->u.P.ent;
entity * ent = tarval_to_entity(get_Const_tarval(node));
assert(ent && is_method_type(get_entity_type(ent)));
if (get_entity_visibility(ent) != external_allocated) {
assert(get_entity_irg(ent));
......@@ -570,9 +570,11 @@ static void free_mark(ir_node * node, eset * set) {
break;
case iro_Const: {
tarval * val = get_Const_tarval(node);
entity * ent = val->u.P.ent;
if (ent != NULL && is_method_type(get_entity_type(ent))) {
eset_insert(set, ent);
if (tarval_is_entity(val)) { /* filter null pointer */
entity * ent = tarval_to_entity(val);
if (is_method_type(get_entity_type(ent))) {
eset_insert(set, ent);
}
}
break;
}
......
......@@ -38,11 +38,11 @@ init_firm (default_initialize_local_variable_func_t *func)
/* create the type kinds. */
init_tpop ();
/* create an obstack and put all tarvals in a pdeq */
tarval_init_1 ();
init_tarval_1 ();
/* initialize all modes an ir node can consist of */
init_mode ();
/* initialize tarvals, and floating point arithmetic */
tarval_init_2 ();
init_tarval_2 ();
/* init graph construction */
init_irgraph();
/* kind of obstack initialization */
......
......@@ -12,6 +12,7 @@
#include <ctype.h>
#include <string.h>
#include <stddef.h>
#include <stdlib.h>
#include "ident_t.h"
#include "array.h"
......
......@@ -1627,7 +1627,7 @@ get_r_value_internal (ir_node *block, int pos, ir_mode *mode)
printf("Error: no value set. Use of undefined variable. Initializing to zero.\n");
assert (mode->code >= irm_F && mode->code <= irm_P);
res = new_rd_Const (NULL, current_ir_graph, block, mode,
tarval_mode_null[mode->code]);
get_mode_null(mode));
}
/* The local valid value is available now. */
......
......@@ -813,8 +813,8 @@ static void collect_calls(ir_node *call, void *env) {
if (get_irn_op(addr) == op_Const) {
/* Check whether the constant is the pointer to a compiled entity. */
tv = get_Const_tarval(addr);
if (tv->u.P.ent) {
called_irg = get_entity_irg(tv->u.P.ent);
if (tarval_to_entity(tv)) {
called_irg = get_entity_irg(tarval_to_entity(tv));
if (called_irg && pos < MAX_INLINE) {
/* The Call node calls a locally defined method. Remember to inline. */
calls[pos] = call;
......@@ -856,7 +856,7 @@ void inline_small_irgs(ir_graph *irg, int size) {
tarval *tv;
ir_graph *callee;
tv = get_Const_tarval(get_Call_ptr(calls[i]));
callee = get_entity_irg(tv->u.P.ent);
callee = get_entity_irg(tarval_to_entity(tv));
if ((_obstack_memory_used(callee->obst) - obstack_room(callee->obst)) < size) {
inline_method(calls[i], callee);
}
......
......@@ -326,7 +326,7 @@ INLINE ident *
get_irn_modeident (const ir_node *node)
{
assert(node);
return node->mode->name;
return get_mode_ident(node->mode);
}
INLINE ir_op *
......
......@@ -7,12 +7,34 @@
# ifndef _IRNODE_H_
# define _IRNODE_H_
/* Projection numbers of compare: use for Proj nodes! */
typedef enum {
False, /* false */
Eq, /* equal */
Lt, /* less */
Le, /* less or equal */
Gt, /* greater */
Ge, /* greater or equal */
Lg, /* less or greater */
Leg, /* less, equal or greater = ordered */
Uo, /* unordered */
Ue, /* unordered or equal */
Ul, /* unordered or less */
Ule, /* unordered, less or equal */
Ug, /* unordered or greater */
Uge, /* unordered, greater or equal */
Ne, /* unordered, less or greater = not equal */
True /* true */
/* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for jni interface */
} pnc_number;
#define not_mask Leg
# include "tv.h"
# include "irgraph.h"
# include "entity.h"
# include "firm_common.h"
# include "irop.h"
# include "irmode.h"
# include "tv.h"
# include "type.h"
# include "dbginfo.h"
# include "exc.h"
......@@ -388,28 +410,8 @@ INLINE void set_Eor_right (ir_node *node, ir_node *right);
INLINE ir_node *get_Not_op (ir_node *node);
INLINE void set_Not_op (ir_node *node, ir_node *op);
/** Projection numbers of compare: use for Proj nodes! */
typedef enum {
False, /**< false */
Eq, /**< equal */
Lt, /**< less */
Le, /**< less or equal */
Gt, /**< greater */
Ge, /**< greater or equal */
Lg, /**< less or greater */
Leg, /**< less, equal or greater = ordered */
Uo, /**< unordered */
Ue, /**< unordered or equal */
Ul, /**< unordered or less */
Ule, /**< unordered, less or equal */
Ug, /**< unordered or greater */
Uge, /**< unordered, greater or equal */
Ne, /**< unordered, less or greater = not equal */
True /**< true */
/* not_mask = Leg*/ /* bits to flip to negate comparison * @@ hack for jni interface */
} pnc_number;
#define not_mask Leg
INLINE const char *get_pnc_string(int pnc);
INLINE int get_negated_pnc(int pnc);
INLINE ir_node *get_Cmp_left (ir_node *node);
INLINE void set_Cmp_left (ir_node *node, ir_node *left);
......
......@@ -39,9 +39,9 @@ static INLINE tarval *
value_of (ir_node *n)
{
if ((n != NULL) && (get_irn_op(n) == op_Const))
return get_Const_tarval(n);
return get_Const_tarval(n); /* might return tarval_bad */
else
return NULL;
return tarval_bad;
}
/* if n can be computed, return the value, else NULL. Performs
......@@ -52,9 +52,10 @@ computed_value (ir_node *n)
tarval *res;
ir_node *a = NULL, *b = NULL; /* initialized to shut up gcc */
tarval *ta = NULL, *tb = NULL; /* initialized to shut up gcc */
/* initialized to uniformly filter invalid constants */
tarval *ta = tarval_bad, *tb = tarval_bad;
res = NULL;
res = tarval_bad;
/* get the operands we will work on for simple cases. */
if (is_binop(n)) {
......@@ -77,79 +78,83 @@ computed_value (ir_node *n)
case iro_SymConst:
if ((get_SymConst_kind(n) == size) &&
(get_type_state(get_SymConst_type(n))) == layout_fixed)
res = tarval_from_long (mode_Is, get_type_size(get_SymConst_type(n)));
res = new_tarval_from_long (get_type_size(get_SymConst_type(n)), mode_Is);
break;
case iro_Add:
if (ta && tb && (get_irn_mode(a) == get_irn_mode(b))
&& (get_irn_mode(a) != mode_P)) {
if ((ta != tarval_bad) && (tb != tarval_bad)
&& (get_irn_mode(a) == get_irn_mode(b))
&& !(get_mode_sort(get_irn_mode(a)) == reference)) {
res = tarval_add (ta, tb);
}
break;
case iro_Sub:
if (ta && tb && (get_irn_mode(a) == get_irn_mode(b))
&& (get_irn_mode(a) != mode_P)) {
if ((ta != tarval_bad) && (tb != tarval_bad)
&& (get_irn_mode(a) == get_irn_mode(b))
&& !(get_mode_sort(get_irn_mode(a)) == reference)) {
res = tarval_sub (ta, tb);
} else if (a == b) {
res = tarval_mode_null [get_irn_modecode (n)];
}
break;
case iro_Minus:
if (ta && mode_is_float(get_irn_mode(a)))
if ((ta != tarval_bad) && mode_is_signed(get_irn_mode(a)))
res = tarval_neg (ta);
break;
case iro_Mul:
if (ta && tb) /* tarval_mul tests for equivalent modes itself */ {
if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
res = tarval_mul (ta, tb);
} else {
/* a*0 = 0 or 0*b = 0:
calls computed_value recursive and returns the 0 with proper
mode. */
tarval *v;
if ( (tarval_classify ((v = computed_value (a))) == 0)
|| (tarval_classify ((v = computed_value (b))) == 0)) {
if ( ( ((v = computed_value (a)) != tarval_bad)
&& (v == get_mode_null(get_tarval_mode(v))) )
|| ( ((v = computed_value (b)) != tarval_bad)
&& (v == get_mode_null(get_tarval_mode(v))) )) {
res = v;
}
}
break;
case iro_Quot:
/* This was missing in original implementation. Why? */
if (ta && tb && (get_irn_mode(a) == get_irn_mode(b))) {
if (tarval_classify(tb) == 0) {res = NULL; break;}
if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
if (tb == get_mode_null(get_tarval_mode(tb))) break; /* div by zero: return tarval_bad */
res = tarval_quo(ta, tb);
}
break;
case iro_Div:
/* This was missing in original implementation. Why? */
if (ta && tb && (get_irn_mode(a) == get_irn_mode(b))) {
if (tarval_classify(tb) == 0) {res = NULL; break;}
if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
if (tb == get_mode_null(get_tarval_mode(tb))) break; /* div by zero: return tarval_bad */
res = tarval_div(ta, tb);
}
break;
case iro_Mod:
/* This was missing in original implementation. Why? */
if (ta && tb && (get_irn_mode(a) == get_irn_mode(b))) {
if (tarval_classify(tb) == 0) {res = NULL; break;}
if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
if (tb == get_mode_null(get_tarval_mode(tb))) break; /* div by zero: return tarval_bad */
res = tarval_mod(ta, tb);
}
break;
/* for iro_DivMod see iro_Proj */
case iro_Abs:
if (ta)
if (ta != tarval_bad)
res = tarval_abs (ta);
break;
case iro_And:
if (ta && tb) {
if ((ta != tarval_bad) && (tb != tarval_bad)) {
res = tarval_and (ta, tb);
} else {
tarval *v;
if ( (tarval_classify ((v = computed_value (a))) == 0)
|| (tarval_classify ((v = computed_value (b))) == 0)) {
if ( ( ((v = computed_value (a)) != tarval_bad)
&& (v == get_mode_null(get_tarval_mode(v))) )
|| ( ((v = computed_value (b)) != tarval_bad)
&& (v == get_mode_null(get_tarval_mode(v))) )) {
res = v;
}
}
break;
case iro_Or:
if (ta && tb) {
if ((ta != tarval_bad) && (tb != tarval_bad)) {
res = tarval_or (ta, tb);
} else {
tarval *v;
......@@ -159,14 +164,40 @@ computed_value (ir_node *n)
}
}
break;
case iro_Eor: if (ta && tb) { res = tarval_eor (ta, tb); } break;
case iro_Not: if (ta) { res = tarval_neg (ta); } break;
case iro_Shl: if (ta && tb) { res = tarval_shl (ta, tb); } break;
/* tarval_shr is faulty !! */
case iro_Shr: if (ta && tb) { res = tarval_shr (ta, tb); } break;
case iro_Shrs:if (ta && tb) { /*res = tarval_shrs (ta, tb)*/; } break;
case iro_Rot: if (ta && tb) { /*res = tarval_rot (ta, tb)*/; } break;
case iro_Conv:if (ta) { res = tarval_convert_to (ta, get_irn_mode (n)); }
case iro_Eor:
if ((ta != tarval_bad) && (tb != tarval_bad)) {
res = tarval_eor (ta, tb);
}
break;
case iro_Not:
if ((ta != tarval_bad)) {
res = tarval_neg (ta);
}
break;
case iro_Shl:
if ((ta != tarval_bad) && (tb != tarval_bad)) {
res = tarval_shl (ta, tb);
}
break;
case iro_Shr:
if ((ta != tarval_bad) && (tb != tarval_bad)) {
res = tarval_shr (ta, tb);
}
break;
case iro_Shrs:
if ((ta != tarval_bad) && (tb != tarval_bad)) {
res = tarval_shrs (ta, tb);
}
break;
case iro_Rot:
if ((ta != tarval_bad) && (tb != tarval_bad)) {
/*res = tarval_rot (ta, tb)*/;
}
break;
case iro_Conv:
if (ta != tarval_bad) {
res = tarval_convert_to (ta, get_irn_mode (n));
}
break;
case iro_Proj: /* iro_Cmp */
{
......@@ -193,16 +224,16 @@ computed_value (ir_node *n)
if (aa == ab) { /* 1.: */
/* This is a tric with the bits used for encoding the Cmp
Proj numbers, the following statement is not the same:
res = tarval_from_long (mode_b, (get_Proj_proj(n) == Eq)): */
res = tarval_from_long (mode_b, (get_Proj_proj(n) & irpn_Eq));
res = new_tarval_from_long ((get_Proj_proj(n) == Eq), mode_b) */
res = new_tarval_from_long ((get_Proj_proj(n) & Eq), mode_b);
} else {
tarval *taa = computed_value (aa);
tarval *tab = computed_value (ab);
if (taa && tab) { /* 2.: */
if ((taa != tarval_bad) && (tab != tarval_bad)) { /* 2.: */
/* strange checks... */
ir_pncmp flags = tarval_comp (taa, tab);
if (flags != irpn_False) {
res = tarval_from_long (mode_b, get_Proj_proj(n) & flags);
pnc_number flags = tarval_cmp (taa, tab);
if (flags != False) {
res = new_tarval_from_long (get_Proj_proj(n) & flags, mode_b);
}
} else { /* check for 3.: */
ir_node *aaa = skip_nop(skip_Proj(aa));
......@@ -214,7 +245,7 @@ computed_value (ir_node *n)
&& ( (/* ab is constant void */
(get_irn_op(ab) == op_Const)
&& (get_irn_mode(ab) == mode_P)
&& (get_Const_tarval(ab) == tarval_P_void))
&& (get_Const_tarval(ab) == get_mode_null(mode_P)))
|| (/* ab is other Alloc */
(get_irn_op(ab) == op_Proj)
&& (get_irn_mode(ab) == mode_P)
......@@ -223,19 +254,19 @@ computed_value (ir_node *n)
|| (/* aa is void and aba is Alloc */
(get_irn_op(aa) == op_Const)
&& (get_irn_mode(aa) == mode_P)
&& (get_Const_tarval(aa) == tarval_P_void)
&& (get_Const_tarval(aa) == get_mode_null(mode_P))
&& (get_irn_op(ab) == op_Proj)
&& (get_irn_mode(ab) == mode_P)
&& (get_irn_op(aba) == op_Alloc)))
/* 3.: */
res = tarval_from_long (mode_b, get_Proj_proj(n) & irpn_Ne);
res = new_tarval_from_long (get_Proj_proj(n) & Ne, mode_b);
}
}
} else if (get_irn_op(a) == op_DivMod) {
ta = value_of(get_DivMod_left(a));
tb = value_of(get_DivMod_right(a));
if (ta && tb && (get_irn_mode(a) == get_irn_mode(b))) {
if (tarval_classify(tb) == 0) {res = NULL; break;}
if ((ta != tarval_bad) && (tb != tarval_bad) && (get_irn_mode(a) == get_irn_mode(b))) {
if (tb == get_mode_null(get_tarval_mode(tb))) break; /* div by zero: return tarval_bad */
if (get_Proj_proj(n)== 0) /* Div */
res = tarval_div(ta, tb);
else /* Mod */
......@@ -611,24 +642,24 @@ transform_node (ir_node *n)
switch (get_irn_opcode(n)) {
case iro_Div: {
ta = computed_value(n);
if (ta) {
if (ta != tarval_bad) {
/* Turn Div into a tuple (mem, bad, value) */
ir_node *mem = get_Div_mem(n);
turn_into_tuple(n, 3);
set_Tuple_pred(n, 0, mem);
set_Tuple_pred(n, 1, new_Bad());
set_Tuple_pred(n, 2, new_Const(get_tv_mode(ta), ta));
set_Tuple_pred(n, 2, new_Const(get_tarval_mode(ta), ta));
}
} break;
case iro_Mod: {
ta = computed_value(n);
if (ta) {
if (ta != tarval_bad) {
/* Turn Div into a tuple (mem, bad, value) */
ir_node *mem = get_Mod_mem(n);
turn_into_tuple(n, 3);
set_Tuple_pred(n, 0, mem);
set_Tuple_pred(n, 1, new_Bad());
set_Tuple_pred(n, 2, new_Const(get_tv_mode(ta), ta));
set_Tuple_pred(n, 2, new_Const(get_tarval_mode(ta), ta));
}
} break;
case iro_DivMod: {
......@@ -645,29 +676,29 @@ transform_node (ir_node *n)
break;
if (a == b) {
a = new_Const (mode, tarval_from_long (mode, 1));
b = new_Const (mode, tarval_from_long (mode, 0));
a = new_Const (mode, get_mode_one(mode));
b = new_Const (mode, get_mode_null(mode));
evaluated = 1;
} else {
ta = value_of(a);
tb = value_of(b);
if (tb) {
if (tarval_classify(tb) == 1) {
b = new_Const (mode, tarval_from_long (mode, 0));
if (tb != tarval_bad) {
if (tb == get_mode_one(get_tarval_mode(tb))) {
b = new_Const (mode, get_mode_null(mode));
evaluated = 1;
} else if (ta) {
} else if (ta != tarval_bad) {
tarval *resa, *resb;
resa = tarval_div (ta, tb);
if (!resa) break; /* Causes exception!!! Model by replacing through
Jmp for X result!? */
if (resa == tarval_bad) break; /* Causes exception!!! Model by replacing through
Jmp for X result!? */
resb = tarval_mod (ta, tb);
if (!resb) break; /* Causes exception! */
if (resb == tarval_bad) break; /* Causes exception! */
a = new_Const (mode, resa);
b = new_Const (mode, resb);
evaluated = 1;
}
} else if (tarval_classify (ta) == 0) {
} else if (ta == get_mode_null(get_tarval_mode(ta))) {
b = a;
evaluated = 1;
}
......@@ -691,14 +722,14 @@ transform_node (ir_node *n)
a = get_Cond_selector(n);
ta = value_of(a);
if (ta &&
if ((ta != tarval_bad) &&
(get_irn_mode(a) == mode_b) &&
(get_opt_unreachable_code())) {
/* It's a boolean Cond, branching on a boolean constant.
Replace it by a tuple (Bad, Jmp) or (Jmp, Bad) */
jmp = new_r_Jmp(current_ir_graph, get_nodes_Block(n));
turn_into_tuple(n, 2);
if (tv_val_b(ta) == 1) /* GL: I hope this returns 1 if true */ {
if (ta == tarval_b_true) {
set_Tuple_pred(n, 0, new_Bad());
set_Tuple_pred(n, 1, jmp);
} else {
......@@ -707,7 +738,7 @@ transform_node (ir_node *n)
}
/* We might generate an endless loop, so keep it alive. */
add_End_keepalive(get_irg_end(current_ir_graph), get_nodes_Block(n));
} else if (ta &&
} else if ((ta != tarval_bad) &&
(get_irn_mode(a) == mode_Iu) &&
(get_Cond_kind(n) == dense) &&
(get_opt_unreachable_code())) {
......@@ -759,7 +790,7 @@ transform_node (ir_node *n)
&& (get_Cond_kind(a) == dense)
&& (get_opt_unreachable_code())) {
/* The Cond is a Switch on a Constant */
if (get_Proj_proj(n) == tv_val_uInt(value_of(a))) {
if (get_Proj_proj(n) == tarval_to_long(value_of(a))) {
/* The always taken branch, reuse the existing Jmp. */
if (!get_irn_link(a)) /* well, if it exists ;-> */
set_irn_link(a, new_r_Jmp(current_ir_graph, get_nodes_Block(n)));
......@@ -1028,10 +1059,10 @@ optimize_node (ir_node *n)
if (get_irn_op(n) != op_Const) {
/* try to evaluate */
tv = computed_value (n);
if ((get_irn_mode(n) != mode_T) && (tv != NULL)) {
if ((get_irn_mode(n) != mode_T) && (tv != tarval_bad)) {
/* evaluation was succesful -- replace the node. */
obstack_free (current_ir_graph->obst, n);
return new_Const (get_tv_mode (tv), tv);
return new_Const (get_tarval_mode (tv), tv);
}
}
}
......@@ -1105,9 +1136,9 @@ optimize_in_place_2 (ir_node *n)
if (get_irn_op(n) != op_Const) {
/* try to evaluate */
tv = computed_value (n);
if ((get_irn_mode(n) != mode_T) && (tv != NULL)) {
if ((get_irn_mode(n) != mode_T) && (tv != tarval_bad)) {
/* evaluation was succesful -- replace the node. */
n = new_Const (get_tv_mode (tv), tv);
n = new_Const (get_tarval_mode (tv), tv);
__dbg_info_merge_pair(n, old_n, dbg_const_eval);
return n;
}
......
......@@ -22,6 +22,7 @@
/* All this is needed to build the constant node for methods: */
# include "irprog_t.h"
# include "ircons.h"
# include "tv_t.h"
/*******************************************************************/
/** general **/
......@@ -84,7 +85,7 @@ new_entity (type *owner, ident *name, type *type)
res->variability = constant;
rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
res->value = new_Const(mode_P, tarval_P_from_entity(res));
res->value = new_Const(mode_P, new_tarval_from_entity(res, mode_P));
current_ir_graph = rem;
} else {
res->variability = uninitialized;
......@@ -181,7 +182,7 @@ copy_entity_name (entity *old, ident *new_name) {
void
free_entity (entity *ent) {
free_tv_entity(ent);
free_tarval_entity(ent);
free_entity_attrs(ent);
free(ent);
}
......@@ -468,7 +469,7 @@ set_array_entity_values(entity *ent, tarval **values, int num_vals) {
current_ir_graph = get_const_code_irg();
for (i = 0; i < num_vals; i++) {
val = new_Const(get_tv_mode (values[i]), values[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;
......
......@@ -18,6 +18,7 @@
*/
#include "firm.h"
#include "xprintf.h"
/**
* possible trvrfy() error codes
......
......@@ -156,7 +156,7 @@ void set_type_mode(type *tp, ir_mode* m) {
if ((tp->type_op == type_primitive) || (tp->type_op == type_enumeration)) {
/* For pointer, primitive and enumeration size depends on the mode. */
tp->size = get_mode_size(m);
tp->size = get_mode_size(m)/8;
tp->mode = m;
}
}
......@@ -811,7 +811,7 @@ INLINE type *new_type_method (ident *name, int n_param, int n_res) {
type *res;
res = new_type(type_method, mode_P, name);
res->state = layout_fixed;
res->size = get_mode_size(mode_P);
res->size = get_mode_size(mode_P)/8;
res->attr.ma.n_params = n_param;
res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
res->attr.ma.n_res = n_res;
......@@ -1028,8 +1028,8 @@ set_array_bounds_int (type *array, int dimension, int lower_bound,