dbg_info *dbg;
int idx;
node_entry_t *entry;
+ (void) node;
+ (void) mode;
irn = get_Store_value(node);
entry = env->entries[get_irn_idx(irn)];
ir_node *sel = get_Cond_selector(node);
ir_mode *m = get_irn_mode(sel);
int idx;
+ (void) mode;
if (m == mode_b) {
node_entry_t *lentry, *rentry;
ir_node **in;
int i, j, n, idx;
int need_conv = 0;
+ (void) mode;
/* check if this return must be lowered */
for (i = 0, n = get_Return_n_ress(node); i < n; ++i) {
long *new_projs;
int i, j, n_params, rem;
ir_node *proj, *args;
+ (void) mode;
if (is_lowered_type(tp)) {
mtp = get_associated_type(tp);
int n_params, n_res, need_lower = 0;
int i, j;
long *res_numbers = NULL;
+ (void) mode;
if (is_lowered_type(tp)) {
call_tp = get_associated_type(tp);
static int cmp_op_mode(const void *elt, const void *key, size_t size) {
const op_mode_entry_t *e1 = elt;
const op_mode_entry_t *e2 = key;
+ (void) size;
return (e1->op - e2->op) | (e1->imode - e2->imode) | (e1->omode - e2->omode);
} /* cmp_op_mode */
static int cmp_conv_tp(const void *elt, const void *key, size_t size) {
const conv_tp_entry_t *e1 = elt;
const conv_tp_entry_t *e2 = key;
+ (void) size;
return (e1->imode - e2->imode) | (e1->omode - e2->omode);
} /* static int cmp_conv_tp */
char buf[64];
ident *id;
ir_entity *ent;
+ (void) context;
if (imode == omode) {
snprintf(buf, sizeof(buf), "__l%s%s", get_op_name(op), get_mode_name(imode));
* lowers IR-nodes, called from walker
*/
static void lower_irnode(ir_node *irn, void *env) {
+ (void) env;
switch (get_irn_opcode(irn)) {
case iro_Sel:
lower_sel(irn);
* Walker: lowers IR-nodes for bitfield access
*/
static void lower_bf_access(ir_node *irn, void *env) {
+ (void) env;
switch (get_irn_opcode(irn)) {
case iro_Proj:
{
wenv->nr_of_intrinsics += r->i_mapper(node, r->ctx) ? 1 : 0;
}
} else {
- if (op->code < (unsigned)ARR_LEN(wenv->i_map)) {
+ if (op->code < (unsigned) ARR_LEN(wenv->i_map)) {
const i_instr_record *r = wenv->i_map[op->code];
/* run all possible mapper */
while (r) {
pmap_insert(c_map, list[i].i_call.i_ent, (void *)&list[i].i_call);
} else {
ir_op *op = list[i].i_instr.op;
- assert(op->code < (unsigned)ARR_LEN(i_map));
+ assert(op->code < (unsigned) ARR_LEN(i_map));
list[i].i_instr.link = i_map[op->code];
i_map[op->code] = &list[i].i_instr;
ir_node *op = get_Call_param(call, 0);
ir_node *irn;
dbg_info *dbg = get_irn_dbg_info(call);
+ (void) ctx;
irn = new_rd_Abs(dbg, current_ir_graph, block, op, get_irn_mode(op));
irn = new_Tuple(1, &irn);
ir_node *op = get_Call_param(call, 0);
ir_node *irn, *exc, *no_exc;
dbg_info *dbg = get_irn_dbg_info(call);
+ (void) ctx;
irn = new_rd_Alloc(dbg, current_ir_graph, block, mem, op, firm_unknown_type, stack_alloc);
mem = new_Proj(irn, mode_M, pn_Alloc_M);