irnode.c 65.2 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
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
	ir_node *res;
	size_t node_size = offsetof(ir_node, attr) + op->attr_size + firm_add_node_size;
	char *p;
	int i, is_bl;

	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
	is_bl = is_Block(res);
	for (i = is_bl; i <= arity; ++i)
		edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
Sebastian Hack's avatar
Sebastian Hack committed
162

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

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

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

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

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

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

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

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

192
193
194
195
196
197
/* 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. */
198
ir_node **
199
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
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);
250
251
}

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

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

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

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

269
void
270
set_irn_n (ir_node *node, int n, ir_node *in) {
271
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
	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
302
303
}

Sebastian Hack's avatar
Sebastian Hack committed
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
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;
329
	} else {
Sebastian Hack's avatar
Sebastian Hack committed
330
331
332
333
334
335
336
337
338
339
340
		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;
		}

341
		if (first_zero >= 0) {
Sebastian Hack's avatar
Sebastian Hack committed
342
343
			node->deps[first_zero] = dep;
			res = first_zero;
344
		} else {
Sebastian Hack's avatar
Sebastian Hack committed
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
			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));
}


364
ir_mode *
365
(get_irn_mode)(const ir_node *node) {
366
	return _get_irn_mode(node);
Christian Schäfer's avatar
Christian Schäfer committed
367
368
}

369
void
370
371
(set_irn_mode)(ir_node *node, ir_mode *mode) {
	_set_irn_mode(node, mode);
Till Riedel's avatar
Till Riedel committed
372
373
}

374
modecode
375
376
377
get_irn_modecode(const ir_node *node) {
	assert(node);
	return node->mode->code;
Christian Schäfer's avatar
Christian Schäfer committed
378
379
}

380
/** Gets the string representation of the mode .*/
381
const char *
382
383
384
get_irn_modename(const ir_node *node) {
	assert(node);
	return get_mode_name(node->mode);
385
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
386

387
ident *
388
389
390
get_irn_modeident(const ir_node *node) {
	assert(node);
	return get_mode_ident(node->mode);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
391
392
}

393
ir_op *
394
(get_irn_op)(const ir_node *node) {
395
	return _get_irn_op(node);
Christian Schäfer's avatar
Christian Schäfer committed
396
397
398
}

/* should be private to the library: */
399
void
400
401
(set_irn_op)(ir_node *node, ir_op *op) {
	_set_irn_op(node, op);
Christian Schäfer's avatar
Christian Schäfer committed
402
403
}

404
ir_opcode
405
406
(get_irn_opcode)(const ir_node *node) {
	return _get_irn_opcode(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
407
408
}

409
const char *
410
411
412
413
414
415
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
416
417
}

418
ident *
419
420
421
get_irn_opident(const ir_node *node) {
	assert(node);
	return node->op->name;
422
423
}

424
unsigned long
425
426
(get_irn_visited)(const ir_node *node) {
	return _get_irn_visited(node);
427
428
}

429
void
430
431
(set_irn_visited)(ir_node *node, unsigned long visited) {
	_set_irn_visited(node, visited);
Christian Schäfer's avatar
Christian Schäfer committed
432
}
433

434
void
435
(mark_irn_visited)(ir_node *node) {
436
	_mark_irn_visited(node);
437
438
}

439
int
440
(irn_not_visited)(const ir_node *node) {
441
	return _irn_not_visited(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
442
443
}

444
int
445
(irn_visited)(const ir_node *node) {
446
	return _irn_visited(node);
447
448
}

449
void
450
(set_irn_link)(ir_node *node, void *link) {
451
	_set_irn_link(node, link);
Christian Schäfer's avatar
Christian Schäfer committed
452
453
}

454
void *
455
(get_irn_link)(const ir_node *node) {
456
	return _get_irn_link(node);
Christian Schäfer's avatar
Christian Schäfer committed
457
458
}

459
460
op_pin_state
(get_irn_pinned)(const ir_node *node) {
461
	return _get_irn_pinned(node);
462
463
}

464
465
op_pin_state
(is_irn_pinned_in_irg) (const ir_node *node) {
466
	return _is_irn_pinned_in_irg(node);
467
468
}

Michael Beck's avatar
Michael Beck committed
469
void set_irn_pinned(ir_node *node, op_pin_state state) {
470
471
472
	/* 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
473

474
475
	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
476

477
	node->attr.except.pin_state = state;
Michael Beck's avatar
Michael Beck committed
478
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
479
480
481
482
483

#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) {
484
	return n->av;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
485
486
487
}
/* Set the abstract interpretation information of a node. */
void set_irn_abst_value(ir_node *n, struct abstval *os) {
488
	n->av = os;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
489
490
}
struct section *firm_get_irn_section(ir_node *n) {
491
	return n->sec;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
492
493
}
void firm_set_irn_section(ir_node *n, struct section *s) {
494
	n->sec = s;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
495
}
496
497
498
499
500
501
#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
502
503
504
#endif /* DO_HEAPANALYSIS */


Götz Lindenmaier's avatar
Götz Lindenmaier committed
505
/* Outputs a unique number for this node */
506
long get_irn_node_nr(const ir_node *node) {
507
	assert(node);
508
#ifdef DEBUG_libfirm
509
	return node->node_nr;
510
#else
511
	return (long)PTR_TO_INT(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
512
#endif
513
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
514

515
const_attr
516
517
518
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
519
520
}

521
long
522
523
524
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
525
526
}

527
alloc_attr
528
529
530
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
531
532
}

533
free_attr
534
535
536
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
537
538
}

539
symconst_attr
540
541
542
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
543
544
}

Michael Beck's avatar
Michael Beck committed
545
ir_type *
546
547
548
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
549
550
}

551
sel_attr
552
553
554
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
555
556
}

557
int
558
559
560
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
561
562
}

563
block_attr
564
565
566
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
567
568
}

569
load_attr
570
get_irn_load_attr(ir_node *node)
571
{
572
  assert(node->op == op_Load);
573
574
575
576
  return node->attr.load;
}

store_attr
577
get_irn_store_attr(ir_node *node)
578
{
579
  assert(node->op == op_Store);
580
581
582
583
  return node->attr.store;
}

except_attr
584
585
586
587
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;
588
589
}

590
void *
591
592
get_irn_generic_attr(ir_node *node) {
	return &node->attr;
593
594
}

595
unsigned (get_irn_idx)(const ir_node *node) {
596
597
	assert(is_ir_node(node));
	return _get_irn_idx(node);
598
599
}

600
int get_irn_pred_pos(ir_node *node, ir_node *arg) {
601
602
603
604
605
606
	int i;
	for (i = get_irn_arity(node) - 1; i >= 0; i--) {
		if (get_irn_n(node, i) == arg)
			return i;
	}
	return -1;
607
608
}

Christian Schäfer's avatar
Christian Schäfer committed
609
610
611
612
/** manipulate fields of individual nodes **/

/* this works for all except Block */
ir_node *
613
614
get_nodes_block(const ir_node *node) {
	assert(node->op != op_Block);
615
	assert(is_irn_pinned_in_irg(node) && "block info may be incorrect");
616
	return get_irn_n(node, -1);
Christian Schäfer's avatar
Christian Schäfer committed
617
618
}

619
void
620
621
622
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
623
624
}

625
626
/* 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
627
ir_type *is_frame_pointer(ir_node *n) {
628
629
630
631
632
633
634
	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;
635
636
637
638
}

/* 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
639
ir_type *is_globals_pointer(ir_node *n) {
640
641
642
643
644
645
646
	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;
647
648
}

649
650
651
/* 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) {
652
653
654
655
656
657
658
	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;
659
660
}

661
662
663
/* 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) {
664
665
666
667
668
	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;
669
670
}

671
/* Returns an array with the predecessors of the Block. Depending on
672
   the implementation of the graph data structure this can be a copy of
673
674
   the internal representation of predecessors as well as the internal
   array itself. Therefore writing to this array might obstruct the ir. */
675
ir_node **
676
677
678
get_Block_cfgpred_arr(ir_node *node) {
	assert((node->op == op_Block));
	return (ir_node **)&(get_irn_in(node)[1]);
679
680
}

681
int
Christoph Mallon's avatar
Christoph Mallon committed
682
(get_Block_n_cfgpreds)(const ir_node *node) {
683
	return _get_Block_n_cfgpreds(node);
Christian Schäfer's avatar
Christian Schäfer committed
684
685
}

686
ir_node *
687
(get_Block_cfgpred)(ir_node *node, int pos) {
688
	return _get_Block_cfgpred(node, pos);
Christian Schäfer's avatar
Christian Schäfer committed
689
690
}

691
void
692
693
694
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
695
696
}

697
698
ir_node  *
(get_Block_cfgpred_block)(ir_node *node, int pos) {
699
	return _get_Block_cfgpred_block(node, pos);
700
701
}

702
int
703
704
705
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
706
707
}

708
void
709
710
711
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
712
}
Michael Beck's avatar
Michael Beck committed
713

714
unsigned long
Michael Beck's avatar
Michael Beck committed
715
(get_Block_block_visited)(ir_node *node) {
716
	return _get_Block_block_visited(node);
Christian Schäfer's avatar
Christian Schäfer committed
717
718
}

719
void
Michael Beck's avatar
Michael Beck committed
720
(set_Block_block_visited)(ir_node *node, unsigned long visit) {
721
	_set_Block_block_visited(node, visit);
Christian Schäfer's avatar
Christian Schäfer committed
722
723
}

Götz Lindenmaier's avatar
Götz Lindenmaier committed
724
/* For this current_ir_graph must be set. */
725
void
Michael Beck's avatar
Michael Beck committed
726
(mark_Block_block_visited)(ir_node *node) {
727
	_mark_Block_block_visited(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
728
729
}

730
int
Michael Beck's avatar
Michael Beck committed
731
(Block_not_block_visited)(ir_node *node) {
732
	return _Block_not_block_visited(node);
733
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
734

735
ir_node *
Christian Schäfer's avatar
Christian Schäfer committed
736
get_Block_graph_arr (ir_node *node, int pos) {
737
738
	assert(node->op == op_Block);
	return node->attr.block.graph_arr[pos+1];
Christian Schäfer's avatar
Christian Schäfer committed
739
740
}

741
void
Christian Schäfer's avatar
Christian Schäfer committed
742
set_Block_graph_arr (ir_node *node, int pos, ir_node *value) {
743
744
	assert(node->op == op_Block);
	node->attr.block.graph_arr[pos+1] = value;
Christian Schäfer's avatar
Christian Schäfer committed
745
}
746

747
void set_Block_cg_cfgpred_arr(ir_node * node, int arity, ir_node ** in) {
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
	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);
763
764
765
}

void set_Block_cg_cfgpred(ir_node * node, int pos, ir_node * pred) {
766
767
768
769
	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;
770
771
}

772
773
774
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;
775
776
777
}

int get_Block_cg_n_cfgpreds(ir_node * node) {
778
779
	assert(node->op == op_Block);
	return node->attr.block.in_cg == NULL ? 0 : ARR_LEN(node->attr.block.in_cg) - 1;
780
781
}

782
783
784
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];
785
786
}

787
void remove_Block_cg_cfgpred_arr(ir_node * node) {
788
789
	assert(node->op == op_Block);
	node->attr.block.in_cg = NULL;
790
791
}

792
ir_node *(set_Block_dead)(ir_node *block) {
793
	return _set_Block_dead(block);
794
795
796
}

int (is_Block_dead)(const ir_node *block) {
797
	return _is_Block_dead(block);
798
799
}

800
ir_extblk *get_Block_extbb(const ir_node *block) {
Michael Beck's avatar
Michael Beck committed
801
	ir_extblk *res;
802
	assert(is_Block(block));
Michael Beck's avatar
Michael Beck committed
803
804
	res = block->attr.block.extblk;
	assert(res == NULL || is_ir_extbb(res));
805
	return res;
806
807
808
}

void set_Block_extbb(ir_node *block, ir_extblk *extblk) {
809
	assert(is_Block(block));
Michael Beck's avatar
Michael Beck committed
810
	assert(extblk == NULL || is_ir_extbb(extblk));
811
	block->attr.block.extblk = extblk;
812
813
}

814
int
815
get_End_n_keepalives(ir_node *end) {
816
817
	assert(end->op == op_End);
	return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
818
819
}

820
ir_node *
821
get_End_keepalive(ir_node *end, int pos) {
822
823
	assert(end->op == op_End);
	return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
824
825
}

826
void
827
add_End_keepalive (ir_node *end, ir_node *ka) {
828
829
	int l;
	ir_graph *irg = get_irn_irg(end);
Michael Beck's avatar
Michael Beck committed
830

831
832
833
	assert(end->op == op_End);
	l = ARR_LEN(end->in);
	ARR_APP1(ir_node *, end->in, ka);
834
835
836
#ifndef NO_KEEPALIVE_OUT_EDGES
	edges_notify_edge(end, l, end->in[l], NULL, irg);
#endif /* NO_KEEPALIVE_OUT_EDGES */
837
838
}

839
void
840
set_End_keepalive(ir_node *end, int pos, ir_node *ka) {
841
	assert(end->op == op_End);
842
	end->in[pos + 1 + END_KEEPALIVE_OFFSET] = ka;
843
#ifndef NO_KEEPALIVE_OUT_EDGES
844
	set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
845
#endif /* NO_KEEPALIVE_OUT_EDGES */
846
847
}

848
849
/* Set new keep-alives */
void set_End_keepalives(ir_node *end, int n, ir_node *in[]) {
850
851
	int i;
	ir_graph *irg = get_irn_irg(end);
852

853
#ifndef NO_KEEPALIVE_OUT_EDGES
854
855
	/* notify that edges are deleted */
	for (i = 1 + END_KEEPALIVE_OFFSET; i < ARR_LEN(end->in); ++i) {
856
		edges_notify_edge(end, i, NULL, end->in[i], irg);
857
	}
858
#endif /* NO_KEEPALIVE_OUT_EDGES */
859
	ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
860

861
862
	for (i = 0; i < n; ++i) {
		end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
863
864
865
#ifndef NO_KEEPALIVE_OUT_EDGES
		edges_notify_edge(end, 1 + END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
#endif /* NO_KEEPALIVE_OUT_EDGES */
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).
*/