irnode.c 64.9 KB
Newer Older
Götz Lindenmaier's avatar
Götz Lindenmaier committed
1
2
3
4
5
/*
 * Project:     libFIRM
 * File name:   ir/ir/irnode.c
 * Purpose:     Representation of an intermediate operation.
 * Author:      Martin Trapp, Christian Schaefer
6
 * Modified by: Goetz Lindenmaier, Michael Beck
Götz Lindenmaier's avatar
Götz Lindenmaier committed
7
8
 * Created:
 * CVS-ID:      $Id$
9
 * Copyright:   (c) 1998-2006 Universitt Karlsruhe
Götz Lindenmaier's avatar
Götz Lindenmaier committed
10
11
 * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 */
Boris Boesler's avatar
Boris Boesler committed
12

Boris Boesler's avatar
added    
Boris Boesler committed
13
#ifdef HAVE_CONFIG_H
Michael Beck's avatar
Michael Beck committed
14
15
16
17
18
# include "config.h"
#endif

#ifdef HAVE_STRING_H
# include <string.h>
Boris Boesler's avatar
added    
Boris Boesler committed
19
20
#endif

21
#include "ident.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
22
#include "irnode_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
23
#include "irgraph_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
24
#include "irmode_t.h"
25
#include "typegmod.h"
26
#include "irbackedge_t.h"
27
#include "irdump.h"
28
#include "irop_t.h"
29
#include "irprog_t.h"
Sebastian Hack's avatar
Sebastian Hack committed
30
#include "iredgekinds.h"
Sebastian Hack's avatar
Sebastian Hack committed
31
#include "iredges_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
32

33
#include "irhooks.h"
34
#include "irtools.h"
Michael Beck's avatar
Michael Beck committed
35

Götz Lindenmaier's avatar
Götz Lindenmaier committed
36
37
/* some constants fixing the positions of nodes predecessors
   in the in array */
Michael Beck's avatar
Michael Beck committed
38
39
40
41
42
#define CALL_PARAM_OFFSET     2
#define FUNCCALL_PARAM_OFFSET 1
#define SEL_INDEX_OFFSET      2
#define RETURN_RESULT_OFFSET  1  /* mem is not a result */
#define END_KEEPALIVE_OFFSET  0
Götz Lindenmaier's avatar
Götz Lindenmaier committed
43

44
static const char *pnc_name_arr [] = {
45
46
47
48
	"pn_Cmp_False", "pn_Cmp_Eq", "pn_Cmp_Lt", "pn_Cmp_Le",
	"pn_Cmp_Gt", "pn_Cmp_Ge", "pn_Cmp_Lg", "pn_Cmp_Leg",
	"pn_Cmp_Uo", "pn_Cmp_Ue", "pn_Cmp_Ul", "pn_Cmp_Ule",
	"pn_Cmp_Ug", "pn_Cmp_Uge", "pn_Cmp_Ne", "pn_Cmp_True"
49
};
Christian Schäfer's avatar
Christian Schäfer committed
50

Michael Beck's avatar
Michael Beck committed
51
52
53
/**
 * returns the pnc name from an pnc constant
 */
54
const char *get_pnc_string(int pnc) {
55
	return pnc_name_arr[pnc];
Christian Schäfer's avatar
Christian Schäfer committed
56
57
}

Michael Beck's avatar
Michael Beck committed
58
/*
59
 * Calculates the negated (Complement(R)) pnc condition.
Michael Beck's avatar
Michael Beck committed
60
 */
61
int get_negated_pnc(int pnc, ir_mode *mode) {
62
	pnc ^= pn_Cmp_True;
63

64
65
66
	/* do NOT add the Uo bit for non-floating point values */
	if (! mode_is_float(mode))
		pnc &= ~pn_Cmp_Uo;
67

68
	return pnc;
Christian Schäfer's avatar
Christian Schäfer committed
69
70
}

71
/* Calculates the inversed (R^-1) pnc condition, i.e., "<" --> ">" */
Michael Beck's avatar
Michael Beck committed
72
int
73
get_inversed_pnc(int pnc) {
74
75
76
	int code    = pnc & ~(pn_Cmp_Lt|pn_Cmp_Gt);
	int lesser  = pnc & pn_Cmp_Lt;
	int greater = pnc & pn_Cmp_Gt;
Michael Beck's avatar
Michael Beck committed
77

78
	code |= (lesser ? pn_Cmp_Gt : 0) | (greater ? pn_Cmp_Lt : 0);
Michael Beck's avatar
Michael Beck committed
79

80
	return code;
Michael Beck's avatar
Michael Beck committed
81
82
}

83
84
85
86
87
88
89
90
91
92
/**
 * Indicates, whether additional data can be registered to ir nodes.
 * If set to 1, this is not possible anymore.
 */
static int forbid_new_data = 0;

/**
 * The amount of additional space for custom data to be allocated upon
 * creating a new node.
 */
93
unsigned firm_add_node_size = 0;
94
95


96
97
/* register new space for every node */
unsigned register_additional_node_data(unsigned size) {
98
	assert(!forbid_new_data && "Too late to register additional node data");
99

100
101
	if (forbid_new_data)
		return 0;
102

103
	return firm_add_node_size += size;
104
105
106
}


Christian Schäfer's avatar
Christian Schäfer committed
107
void
108
init_irnode(void) {
109
110
	/* Forbid the addition of new data to an ir node. */
	forbid_new_data = 1;
Christian Schäfer's avatar
Christian Schäfer committed
111
112
}

113
/*
114
115
116
 * irnode constructor.
 * Create a new irnode in irg, with an op, mode, arity and
 * some incoming irnodes.
117
118
 * If arity is negative, a node with a dynamic array is created.
 */
119
ir_node *
120
new_ir_node (dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op, ir_mode *mode,
Florian Liekweg's avatar
Florian Liekweg committed
121
         int arity, ir_node **in)
Christian Schäfer's avatar
Christian Schäfer committed
122
{
123
124
125
	ir_node *res;
	size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
	char *p;
126
	int i;
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150

	assert(irg && op && mode);
	p = obstack_alloc (irg->obst, node_size);
	memset(p, 0, node_size);
	res = (ir_node *) (p + firm_add_node_size);

	res->kind     = k_ir_node;
	res->op       = op;
	res->mode     = mode;
	res->visited  = 0;
	res->node_idx = irg_register_node_idx(irg, res);
	res->link     = NULL;
	res->deps     = NULL;

	if (arity < 0) {
		res->in = NEW_ARR_F (ir_node *, 1);  /* 1: space for block */
	} else {
		res->in = NEW_ARR_D (ir_node *, irg->obst, (arity+1));
		memcpy (&res->in[1], in, sizeof (ir_node *) * arity);
	}

	res->in[0] = block;
	set_irn_dbg_info(res, db);
	res->out = NULL;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
151
152

#ifdef DEBUG_libfirm
153
	res->node_nr = get_irp_new_node_nr();
Götz Lindenmaier's avatar
Götz Lindenmaier committed
154
155
#endif

156
157
	for(i = 0; i < EDGE_KIND_LAST; ++i)
		INIT_LIST_HEAD(&res->edge_info[i].outs_head);
158

159
160
161
	// don't put this into the for loop, arity is -1 for some nodes!
	edges_notify_edge(res, -1, res->in[0], NULL, irg);
	for (i = 1; i <= arity; ++i)
162
		edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
Sebastian Hack's avatar
Sebastian Hack committed
163

164
	hook_new_node(irg, res);
Michael Beck's avatar
Michael Beck committed
165

166
	return res;
Christian Schäfer's avatar
Christian Schäfer committed
167
168
}

Michael Beck's avatar
Michael Beck committed
169
/*-- getting some parameters from ir_nodes --*/
Christian Schäfer's avatar
Christian Schäfer committed
170

Sebastian Felis's avatar
Sebastian Felis committed
171
int
172
(is_ir_node)(const void *thing) {
173
	return _is_ir_node(thing);
Sebastian Felis's avatar
Sebastian Felis committed
174
175
}

176
int
177
(get_irn_intra_arity)(const ir_node *node) {
178
	return _get_irn_intra_arity(node);
Christian Schäfer's avatar
Christian Schäfer committed
179
180
}

181
int
182
(get_irn_inter_arity)(const ir_node *node) {
183
	return _get_irn_inter_arity(node);
184
185
}

186
int (*_get_irn_arity)(const ir_node *node) = _get_irn_intra_arity;
187

188
int
189
(get_irn_arity)(const ir_node *node) {
190
	return _get_irn_arity(node);
191
192
}

193
194
195
196
197
198
/* Returns the array with ins. This array is shifted with respect to the
   array accessed by get_irn_n: The block operand is at position 0 not -1.
   (@@@ This should be changed.)
   The order of the predecessors in this array is not guaranteed, except that
   lists of operands as predecessors of Block or arguments of a Call are
   consecutive. */
199
ir_node **
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
get_irn_in(const ir_node *node) {
	assert(node);
	if (get_interprocedural_view()) { /* handle Filter and Block specially */
		if (get_irn_opcode(node) == iro_Filter) {
			assert(node->attr.filter.in_cg);
			return node->attr.filter.in_cg;
		} else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
			return node->attr.block.in_cg;
		}
		/* else fall through */
	}
	return node->in;
}

void
set_irn_in(ir_node *node, int arity, ir_node **in) {
	int i;
	ir_node *** arr;
	ir_graph *irg = current_ir_graph;
	assert(node);
	if (get_interprocedural_view()) { /* handle Filter and Block specially */
		if (get_irn_opcode(node) == iro_Filter) {
			assert(node->attr.filter.in_cg);
			arr = &node->attr.filter.in_cg;
		} else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
			arr = &node->attr.block.in_cg;
		} else {
			arr = &node->in;
		}
	} else {
		arr = &node->in;
	}

	for (i = 0; i < arity; i++) {
		if (i < ARR_LEN(*arr)-1)
			edges_notify_edge(node, i, in[i], (*arr)[i+1], irg);
		else
			edges_notify_edge(node, i, in[i], NULL,        irg);
	}
	for(;i < ARR_LEN(*arr)-1; i++) {
		edges_notify_edge(node, i, NULL, (*arr)[i+1], irg);
	}

	if (arity != ARR_LEN(*arr) - 1) {
		ir_node * block = (*arr)[0];
		*arr = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
		(*arr)[0] = block;
	}
	fix_backedges(irg->obst, node);

	memcpy((*arr) + 1, in, sizeof(ir_node *) * arity);
251
252
}

253
ir_node *
Sebastian Hack's avatar
Sebastian Hack committed
254
(get_irn_intra_n)(const ir_node *node, int n) {
255
	return _get_irn_intra_n (node, n);
256
257
}

258
ir_node *
Sebastian Hack's avatar
Sebastian Hack committed
259
(get_irn_inter_n)(const ir_node *node, int n) {
260
	return _get_irn_inter_n (node, n);
261
262
}

263
ir_node *(*_get_irn_n)(const ir_node *node, int n) = _get_irn_intra_n;
264

265
ir_node *
Sebastian Hack's avatar
Sebastian Hack committed
266
(get_irn_n)(const ir_node *node, int n) {
267
	return _get_irn_n(node, n);
Christian Schäfer's avatar
Christian Schäfer committed
268
269
}

270
void
271
set_irn_n (ir_node *node, int n, ir_node *in) {
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
	assert(node && node->kind == k_ir_node);
	assert(-1 <= n);
	assert(n < get_irn_arity(node));
	assert(in && in->kind == k_ir_node);

	if ((n == -1) && (get_irn_opcode(node) == iro_Filter)) {
		/* Change block pred in both views! */
		node->in[n + 1] = in;
		assert(node->attr.filter.in_cg);
		node->attr.filter.in_cg[n + 1] = in;
		return;
	}
	if (get_interprocedural_view()) { /* handle Filter and Block specially */
		if (get_irn_opcode(node) == iro_Filter) {
			assert(node->attr.filter.in_cg);
			node->attr.filter.in_cg[n + 1] = in;
			return;
		} else if (get_irn_opcode(node) == iro_Block && node->attr.block.in_cg) {
			node->attr.block.in_cg[n + 1] = in;
			return;
		}
		/* else fall through */
	}

	/* Call the hook */
	hook_set_irn_n(node, n, in, node->in[n + 1]);

	/* Here, we rely on src and tgt being in the current ir graph */
	edges_notify_edge(node, n, in, node->in[n + 1], current_ir_graph);

	node->in[n + 1] = in;
Christian Schäfer's avatar
Christian Schäfer committed
303
304
}

305
306
307
308
309
310
311
312
313
314
315
316
317
int add_irn_n(ir_node *node, ir_node *in)
{
	int pos;
	ir_graph *irg = get_irn_irg(node);

	assert(node->op->opar == oparity_dynamic);
	pos = ARR_LEN(node->in) - 1;
	ARR_APP1(ir_node *, node->in, in);
	edges_notify_edge(node, pos, node->in[pos + 1], NULL, irg);

	return pos;
}

Sebastian Hack's avatar
Sebastian Hack committed
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
int
(get_irn_deps)(const ir_node *node)
{
	return _get_irn_deps(node);
}

ir_node *
(get_irn_dep)(const ir_node *node, int pos)
{
	return _get_irn_dep(node, pos);
}

void
(set_irn_dep)(ir_node *node, int pos, ir_node *dep)
{
	_set_irn_dep(node, pos, dep);
}

int add_irn_dep(ir_node *node, ir_node *dep)
{
	int res = 0;

	if (node->deps == NULL) {
		node->deps = NEW_ARR_F(ir_node *, 1);
		node->deps[0] = dep;
343
	} else {
Sebastian Hack's avatar
Sebastian Hack committed
344
345
346
347
348
349
350
351
352
353
354
		int i, n;
		int first_zero = -1;

		for(i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
			if(node->deps[i] == NULL)
				first_zero = i;

			if(node->deps[i] == dep)
				return i;
		}

355
		if (first_zero >= 0) {
Sebastian Hack's avatar
Sebastian Hack committed
356
357
			node->deps[first_zero] = dep;
			res = first_zero;
358
		} else {
Sebastian Hack's avatar
Sebastian Hack committed
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
			ARR_APP1(ir_node *, node->deps, dep);
			res = n;
		}
	}

	edges_notify_edge_kind(node, res, dep, NULL, EDGE_KIND_DEP, get_irn_irg(node));

	return res;
}

void add_irn_deps(ir_node *tgt, ir_node *src)
{
	int i, n;

	for(i = 0, n = get_irn_deps(src); i < n; ++i)
		add_irn_dep(tgt, get_irn_dep(src, i));
}


378
ir_mode *
379
(get_irn_mode)(const ir_node *node) {
380
	return _get_irn_mode(node);
Christian Schäfer's avatar
Christian Schäfer committed
381
382
}

383
void
384
385
(set_irn_mode)(ir_node *node, ir_mode *mode) {
	_set_irn_mode(node, mode);
Till Riedel's avatar
Till Riedel committed
386
387
}

388
modecode
389
390
391
get_irn_modecode(const ir_node *node) {
	assert(node);
	return node->mode->code;
Christian Schäfer's avatar
Christian Schäfer committed
392
393
}

394
/** Gets the string representation of the mode .*/
395
const char *
396
397
398
get_irn_modename(const ir_node *node) {
	assert(node);
	return get_mode_name(node->mode);
399
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
400

401
ident *
402
403
404
get_irn_modeident(const ir_node *node) {
	assert(node);
	return get_mode_ident(node->mode);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
405
406
}

407
ir_op *
408
(get_irn_op)(const ir_node *node) {
409
	return _get_irn_op(node);
Christian Schäfer's avatar
Christian Schäfer committed
410
411
412
}

/* should be private to the library: */
413
void
414
415
(set_irn_op)(ir_node *node, ir_op *op) {
	_set_irn_op(node, op);
Christian Schäfer's avatar
Christian Schäfer committed
416
417
}

418
ir_opcode
419
420
(get_irn_opcode)(const ir_node *node) {
	return _get_irn_opcode(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
421
422
}

423
const char *
424
425
426
427
428
429
get_irn_opname(const ir_node *node) {
	assert(node);
	if ((get_irn_op((ir_node *)node) == op_Phi) &&
		(get_irg_phase_state(get_irn_irg((ir_node *)node)) == phase_building) &&
		(get_irn_arity((ir_node *)node) == 0)) return "Phi0";
	return get_id_str(node->op->name);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
430
431
}

432
ident *
433
434
435
get_irn_opident(const ir_node *node) {
	assert(node);
	return node->op->name;
436
437
}

438
unsigned long
439
440
(get_irn_visited)(const ir_node *node) {
	return _get_irn_visited(node);
441
442
}

443
void
444
445
(set_irn_visited)(ir_node *node, unsigned long visited) {
	_set_irn_visited(node, visited);
Christian Schäfer's avatar
Christian Schäfer committed
446
}
447

448
void
449
(mark_irn_visited)(ir_node *node) {
450
	_mark_irn_visited(node);
451
452
}

453
int
454
(irn_not_visited)(const ir_node *node) {
455
	return _irn_not_visited(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
456
457
}

458
int
459
(irn_visited)(const ir_node *node) {
460
	return _irn_visited(node);
461
462
}

463
void
464
(set_irn_link)(ir_node *node, void *link) {
465
	_set_irn_link(node, link);
Christian Schäfer's avatar
Christian Schäfer committed
466
467
}

468
void *
469
(get_irn_link)(const ir_node *node) {
470
	return _get_irn_link(node);
Christian Schäfer's avatar
Christian Schäfer committed
471
472
}

473
474
op_pin_state
(get_irn_pinned)(const ir_node *node) {
475
	return _get_irn_pinned(node);
476
477
}

478
479
op_pin_state
(is_irn_pinned_in_irg) (const ir_node *node) {
480
	return _is_irn_pinned_in_irg(node);
481
482
}

Michael Beck's avatar
Michael Beck committed
483
void set_irn_pinned(ir_node *node, op_pin_state state) {
484
485
486
	/* due to optimization an opt may be turned into a Tuple */
	if (get_irn_op(node) == op_Tuple)
		return;
Michael Beck's avatar
Michael Beck committed
487

488
489
	assert(node && get_op_pinned(get_irn_op(node)) >= op_pin_state_exc_pinned);
	assert(state == op_pin_state_pinned || state == op_pin_state_floats);
Michael Beck's avatar
Michael Beck committed
490

491
	node->attr.except.pin_state = state;
Michael Beck's avatar
Michael Beck committed
492
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
493
494
495
496
497

#ifdef DO_HEAPANALYSIS
/* Access the abstract interpretation information of a node.
   Returns NULL if no such information is available. */
struct abstval *get_irn_abst_value(ir_node *n) {
498
	return n->av;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
499
500
501
}
/* Set the abstract interpretation information of a node. */
void set_irn_abst_value(ir_node *n, struct abstval *os) {
502
	n->av = os;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
503
504
}
struct section *firm_get_irn_section(ir_node *n) {
505
	return n->sec;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
506
507
}
void firm_set_irn_section(ir_node *n, struct section *s) {
508
	n->sec = s;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
509
}
510
511
512
513
514
515
#else
/* Dummies needed for firmjni. */
struct abstval *get_irn_abst_value(ir_node *n) { return NULL; }
void set_irn_abst_value(ir_node *n, struct abstval *os) {}
struct section *firm_get_irn_section(ir_node *n) { return NULL; }
void firm_set_irn_section(ir_node *n, struct section *s) {}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
516
517
518
#endif /* DO_HEAPANALYSIS */


Götz Lindenmaier's avatar
Götz Lindenmaier committed
519
/* Outputs a unique number for this node */
520
long get_irn_node_nr(const ir_node *node) {
521
	assert(node);
522
#ifdef DEBUG_libfirm
523
	return node->node_nr;
524
#else
525
	return (long)PTR_TO_INT(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
526
#endif
527
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
528

529
const_attr
530
531
532
get_irn_const_attr(ir_node *node) {
	assert(node->op == op_Const);
	return node->attr.con;
Christian Schäfer's avatar
Christian Schäfer committed
533
534
}

535
long
536
537
538
get_irn_proj_attr(ir_node *node) {
	assert(node->op == op_Proj);
	return node->attr.proj;
Christian Schäfer's avatar
Christian Schäfer committed
539
540
}

541
alloc_attr
542
543
544
get_irn_alloc_attr(ir_node *node) {
	assert(node->op == op_Alloc);
	return node->attr.alloc;
Christian Schäfer's avatar
Christian Schäfer committed
545
546
}

547
free_attr
548
549
550
get_irn_free_attr(ir_node *node) {
	assert(node->op == op_Free);
	return node->attr.free;
Christian Schäfer's avatar
Christian Schäfer committed
551
552
}

553
symconst_attr
554
555
556
get_irn_symconst_attr(ir_node *node) {
	assert(node->op == op_SymConst);
	return node->attr.symc;
Christian Schäfer's avatar
Christian Schäfer committed
557
558
}

Michael Beck's avatar
Michael Beck committed
559
ir_type *
560
561
562
get_irn_call_attr(ir_node *node) {
	assert(node->op == op_Call);
	return node->attr.call.cld_tp = skip_tid(node->attr.call.cld_tp);
Christian Schäfer's avatar
Christian Schäfer committed
563
564
}

565
sel_attr
566
567
568
get_irn_sel_attr(ir_node *node) {
	assert(node->op == op_Sel);
	return node->attr.sel;
Christian Schäfer's avatar
Christian Schäfer committed
569
570
}

571
int
572
573
574
get_irn_phi_attr(ir_node *node) {
	assert(node->op == op_Phi);
	return node->attr.phi0_pos;
Christian Schäfer's avatar
Christian Schäfer committed
575
576
}

577
block_attr
578
579
580
get_irn_block_attr(ir_node *node) {
	assert(node->op == op_Block);
	return node->attr.block;
Christian Schäfer's avatar
Christian Schäfer committed
581
582
}

583
load_attr
584
get_irn_load_attr(ir_node *node)
585
{
586
  assert(node->op == op_Load);
587
588
589
590
  return node->attr.load;
}

store_attr
591
get_irn_store_attr(ir_node *node)
592
{
593
  assert(node->op == op_Store);
594
595
596
597
  return node->attr.store;
}

except_attr
598
599
600
601
get_irn_except_attr(ir_node *node) {
	assert(node->op == op_Div || node->op == op_Quot ||
	       node->op == op_DivMod || node->op == op_Mod || node->op == op_Call || node->op == op_Alloc);
	return node->attr.except;
602
603
}

604
void *
605
606
get_irn_generic_attr(ir_node *node) {
	return &node->attr;
607
608
}

609
unsigned (get_irn_idx)(const ir_node *node) {
610
611
	assert(is_ir_node(node));
	return _get_irn_idx(node);
612
613
}

614
int get_irn_pred_pos(ir_node *node, ir_node *arg) {
615
616
617
618
619
620
	int i;
	for (i = get_irn_arity(node) - 1; i >= 0; i--) {
		if (get_irn_n(node, i) == arg)
			return i;
	}
	return -1;
621
622
}

Christian Schäfer's avatar
Christian Schäfer committed
623
624
625
626
/** manipulate fields of individual nodes **/

/* this works for all except Block */
ir_node *
627
628
get_nodes_block(const ir_node *node) {
	assert(node->op != op_Block);
629
	assert(is_irn_pinned_in_irg(node) && "block info may be incorrect");
630
	return get_irn_n(node, -1);
Christian Schäfer's avatar
Christian Schäfer committed
631
632
}

633
void
634
635
636
set_nodes_block(ir_node *node, ir_node *block) {
	assert(node->op != op_Block);
	set_irn_n(node, -1, block);
Christian Schäfer's avatar
Christian Schäfer committed
637
638
}

639
640
/* Test whether arbitrary node is frame pointer, i.e. Proj(pn_Start_P_frame_base)
 * from Start.  If so returns frame type, else Null. */
Michael Beck's avatar
Michael Beck committed
641
ir_type *is_frame_pointer(ir_node *n) {
642
643
644
645
646
647
648
	if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
		ir_node *start = get_Proj_pred(n);
		if (get_irn_op(start) == op_Start) {
			return get_irg_frame_type(get_irn_irg(start));
		}
	}
	return NULL;
649
650
651
652
}

/* Test whether arbitrary node is globals pointer, i.e. Proj(pn_Start_P_globals)
 * from Start.  If so returns global type, else Null. */
Michael Beck's avatar
Michael Beck committed
653
ir_type *is_globals_pointer(ir_node *n) {
654
655
656
657
658
659
660
	if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
		ir_node *start = get_Proj_pred(n);
		if (get_irn_op(start) == op_Start) {
			return get_glob_type();
		}
	}
	return NULL;
661
662
}

663
664
665
/* Test whether arbitrary node is tls pointer, i.e. Proj(pn_Start_P_tls)
 * from Start.  If so returns tls type, else Null. */
ir_type *is_tls_pointer(ir_node *n) {
666
667
668
669
670
671
672
	if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_globals)) {
		ir_node *start = get_Proj_pred(n);
		if (get_irn_op(start) == op_Start) {
			return get_tls_type();
		}
	}
	return NULL;
673
674
}

675
676
677
/* Test whether arbitrary node is value arg base, i.e. Proj(pn_Start_P_value_arg_base)
 * from Start.  If so returns 1, else 0. */
int is_value_arg_pointer(ir_node *n) {
678
679
680
681
682
	if ((get_irn_op(n) == op_Proj) &&
		(get_Proj_proj(n) == pn_Start_P_value_arg_base) &&
		(get_irn_op(get_Proj_pred(n)) == op_Start))
		return 1;
	return 0;
683
684
}

685
/* Returns an array with the predecessors of the Block. Depending on
686
   the implementation of the graph data structure this can be a copy of
687
688
   the internal representation of predecessors as well as the internal
   array itself. Therefore writing to this array might obstruct the ir. */
689
ir_node **
690
691
692
get_Block_cfgpred_arr(ir_node *node) {
	assert((node->op == op_Block));
	return (ir_node **)&(get_irn_in(node)[1]);
693
694
}

695
int
Christoph Mallon's avatar
Christoph Mallon committed
696
(get_Block_n_cfgpreds)(const ir_node *node) {
697
	return _get_Block_n_cfgpreds(node);
Christian Schäfer's avatar
Christian Schäfer committed
698
699
}

700
ir_node *
701
(get_Block_cfgpred)(ir_node *node, int pos) {
702
	return _get_Block_cfgpred(node, pos);
Christian Schäfer's avatar
Christian Schäfer committed
703
704
}

705
void
706
707
708
set_Block_cfgpred(ir_node *node, int pos, ir_node *pred) {
	assert(node->op == op_Block);
	set_irn_n(node, pos, pred);
Christian Schäfer's avatar
Christian Schäfer committed
709
710
}

711
712
ir_node  *
(get_Block_cfgpred_block)(ir_node *node, int pos) {
713
	return _get_Block_cfgpred_block(node, pos);
714
715
}

716
int
717
718
719
get_Block_matured(ir_node *node) {
	assert(node->op == op_Block);
	return (int)node->attr.block.matured;
Christian Schäfer's avatar
Christian Schäfer committed
720
721
}

722
void
723
724
725
set_Block_matured(ir_node *node, int matured) {
	assert(node->op == op_Block);
	node->attr.block.matured = matured;
Christian Schäfer's avatar
Christian Schäfer committed
726
}
Michael Beck's avatar
Michael Beck committed
727

728
unsigned long
Michael Beck's avatar
Michael Beck committed
729
(get_Block_block_visited)(ir_node *node) {
730
	return _get_Block_block_visited(node);
Christian Schäfer's avatar
Christian Schäfer committed
731
732
}

733
void
Michael Beck's avatar
Michael Beck committed
734
(set_Block_block_visited)(ir_node *node, unsigned long visit) {
735
	_set_Block_block_visited(node, visit);
Christian Schäfer's avatar
Christian Schäfer committed
736
737
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
738
/* For this current_ir_graph must be set. */
739
void
Michael Beck's avatar
Michael Beck committed
740
(mark_Block_block_visited)(ir_node *node) {
741
	_mark_Block_block_visited(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
742
743
}

744
int
Michael Beck's avatar
Michael Beck committed
745
(Block_not_block_visited)(ir_node *node) {
746
	return _Block_not_block_visited(node);
747
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
748

749
ir_node *
Christian Schäfer's avatar
Christian Schäfer committed
750
get_Block_graph_arr (ir_node *node, int pos) {
751
752
	assert(node->op == op_Block);
	return node->attr.block.graph_arr[pos+1];
Christian Schäfer's avatar
Christian Schäfer committed
753
754
}

755
void
Christian Schäfer's avatar
Christian Schäfer committed
756
set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
757
758
	assert(node->op == op_Block);
	node->attr.block.graph_arr[pos+1] = value;
Christian Schäfer's avatar
Christian Schäfer committed
759
}
760

761
void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
	assert(node->op == op_Block);
	if (node->attr.block.in_cg == NULL || arity != ARR_LEN(node->attr.block.in_cg) - 1) {
		node->attr.block.in_cg = NEW_ARR_D(ir_node *, current_ir_graph->obst, arity + 1);
		node->attr.block.in_cg[0] = NULL;
		node->attr.block.cg_backedge = new_backedge_arr(current_ir_graph->obst, arity);
		{
			/* Fix backedge array.  fix_backedges() operates depending on
			   interprocedural_view. */
			int ipv = get_interprocedural_view();
			set_interprocedural_view(1);
			fix_backedges(current_ir_graph->obst, node);
			set_interprocedural_view(ipv);
		}
	}
	memcpy(node->attr.block.in_cg + 1, in, sizeof(ir_node *) * arity);
777
778
779
}

void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
780
781
782
783
	assert(node->op == op_Block &&
	       node->attr.block.in_cg &&
	       0 <= pos && pos < ARR_LEN(node->attr.block.in_cg) - 1);
	node->attr.block.in_cg[pos + 1] = pred;
784
785
}

786
787
788
ir_node **get_Block_cg_cfgpred_arr(ir_node * node) {
	assert(node->op == op_Block);
	return node->attr.block.in_cg == NULL ? NULL : node->attr.block.in_cg  + 1;
789
790
791
}

int get_Block_cg_n_cfgpreds(ir_node * node) {
792
793
	assert(node->op == op_Block);
	return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
794
795
}

796
797
798
ir_node *get_Block_cg_cfgpred(ir_node * node, int pos) {
	assert(node->op == op_Block && node->attr.block.in_cg);
	return node->attr.block.in_cg[pos + 1];
799
800
}

801
void remove_Block_cg_cfgpred_arr(ir_node * node) {
802
803
	assert(node->op == op_Block);
	node->attr.block.in_cg = NULL;
804
805
}

806
ir_node *(set_Block_dead)(ir_node *block) {
807
	return _set_Block_dead(block);
808
809
810
}

int (is_Block_dead)(const ir_node *block) {
811
	return _is_Block_dead(block);
812
813
}

814
ir_extblk *get_Block_extbb(const ir_node *block) {
Michael Beck's avatar
Michael Beck committed
815
	ir_extblk *res;
816
	assert(is_Block(block));
Michael Beck's avatar
Michael Beck committed
817
818
	res = block->attr.block.extblk;
	assert(res == NULL || is_ir_extbb(res));
819
	return res;
820
821
822
}

void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
823
	assert(is_Block(block));
Michael Beck's avatar
Michael Beck committed
824
	assert(extblk == NULL || is_ir_extbb(extblk));
825
	block->attr.block.extblk = extblk;
826
827
}

828
int
829
get_End_n_keepalives(ir_node *end) {
830
831
	assert(end->op == op_End);
	return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
832
833
}

834
ir_node *
835
get_End_keepalive(ir_node *end, int pos) {
836
837
	assert(end->op == op_End);
	return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
838
839
}

840
void
841
add_End_keepalive (ir_node *end, ir_node *ka) {
842
	assert(end->op == op_End);
843
	add_irn_n(end, ka);
844
845
}

846
void
847
set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
848
849
	assert(end->op == op_End);
	set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
850
851
}

852
853
/* Set new keep-alives */
void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
854
855
	int i;
	ir_graph *irg = get_irn_irg(end);
856

857
	/* notify that edges are deleted */
858
859
	for (i = END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in) - 1; ++i) {
		edges_notify_edge(end, i, NULL, end->in[i + 1], irg);
860
861
	}
	ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
862

863
864
	for (i = 0; i < n; ++i) {
		end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
865
		edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
866
	}
867
}
868

869
870
/* Set new keep-alives from old keep-alives, skipping irn */
void remove_End_keepalive(ir_node *end, ir_node *irn) {
871
872
873
	int     n = get_End_n_keepalives(end);
	ir_node **in;
	int     i, idx;
874

875
	NEW_ARR_A(ir_node *, in, n);
876

877
878
	for (idx = i = 0; i < n; ++i) {
		ir_node *old_ka = get_End_keepalive(end, i);
879

880
881
882
883
		/* skip irn */
		if (old_ka != irn)
			in[idx++] = old_ka;
	}
884

885
886
	/* set new keep-alives */
	set_End_keepalives(end, idx, in);
887
}
888

889
void
890
free_End (ir_node *end) {
891
892
893
894
895
	assert(end->op == op_End);
	end->kind = k_BAD;
	DEL_ARR_F(end->in);
	end->in = NULL;   /* @@@ make sure we get an error if we use the
	                     in array afterwards ... */
896
897
}

898
899
/* Return the target address of an IJmp */
ir_node *get_IJmp_target(ir_node *ijmp) {
900
901
	assert(ijmp->op == op_IJmp);
	return get_irn_n(ijmp, 0);
902
903
904
905
}

/** Sets the target address of an IJmp */
void set_IJmp_target(ir_node *ijmp, ir_node *tgt) {
906
907
	assert(ijmp->op == op_IJmp);
	set_irn_n(ijmp, 0, tgt);
908
}
909

Götz Lindenmaier's avatar
Götz Lindenmaier committed
910
911
912
913
914
915
916
917
918
/*
> Implementing the case construct (which is where the constant Proj node is
> important) involves far more than simply determining the constant values.
> We could argue that this is more properly a function of the translator from
> Firm to the target machine.  That could be done if there was some way of
> projecting "default" out of the Cond node.
I know it's complicated.
Basically there are two proglems:
 - determining the gaps between the projs
919
 - determining the biggest case constant to know the proj number for
Götz Lindenmaier's avatar
Götz Lindenmaier committed
920
921
922
923
924
925
926
927
928
929
930
931
   the default node.
I see several solutions:
1. Introduce a ProjDefault node.  Solves both problems.
   This means to extend all optimizations executed during construction.
2. Give the Cond node for switch two flavors:
   a) there are no gaps in the projs  (existing flavor)
   b) gaps may exist, default proj is still the Proj with the largest
      projection number.  This covers also the gaps.
3. Fix the semantic of the Cond to that of 2b)

Solution 2 seems to be the best:
Computing the gaps in the Firm representation is not too hard, i.e.,
932
libFIRM can implement a routine that transforms between the two
Götz Lindenmaier's avatar
Götz Lindenmaier committed
933
934
935
936
937
938
939
940
flavours.  This is also possible for 1) but 2) does not require to
change any existing optimization.
Further it should be far simpler to determine the biggest constant than
to compute all gaps.
I don't want to choose 3) as 2a) seems to have advantages for
dataflow analysis and 3) does not allow to convert the representation to
2a).
*/
941
ir_node *
942
943
944
get_Cond_selector(ir_node *node) {
	assert(node->op == op_Cond);
	return get_irn_n(node, 0);
Christian Schäfer's avatar
Christian Schäfer committed
945
946
}

947
void
Michael Beck's avatar