/*
- * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
panic("unexpected builtin");
}
- turn_into_tuple(builtin, 2);
- set_irn_n(builtin, pn_Builtin_M, mem);
- set_irn_n(builtin, pn_Builtin_max+1, res);
+ ir_node *const in[] = {
+ [pn_Builtin_M] = mem,
+ [pn_Builtin_max + 1] = res,
+ };
+ turn_into_tuple(builtin, ARRAY_SIZE(in), in);
}
}
n_idx = get_irg_last_idx(irg);
n_idx = n_idx + (n_idx >> 2); /* add 25% */
env->n_entries = n_idx;
- env->entries = NEW_ARR_F(lower64_entry_t*, n_idx);
- memset(env->entries, 0, sizeof(env->entries[0]) * n_idx);
+ env->entries = NEW_ARR_FZ(lower64_entry_t*, n_idx);
env->irg = irg;
env->flags = 0;