irnode.c 34 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
Christian Würdig's avatar
Christian Würdig committed
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 *
 * 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.
 */

Matthias Braun's avatar
Matthias Braun committed
20
21
22
23
/**
 * @file
 * @brief   Representation of an intermediate operation.
 * @author  Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
Götz Lindenmaier's avatar
Götz Lindenmaier committed
24
 */
Matthias Braun's avatar
Matthias Braun committed
25
#include "config.h"
Michael Beck's avatar
Michael Beck committed
26

27
#include <string.h>
Boris Boesler's avatar
added    
Boris Boesler committed
28

29
#include "pset_new.h"
30
#include "ident.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
31
#include "irnode_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
32
#include "irgraph_t.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
33
#include "irmode_t.h"
34
#include "irbackedge_t.h"
35
#include "irdump.h"
36
#include "irop_t.h"
37
#include "irprog_t.h"
Sebastian Hack's avatar
Sebastian Hack committed
38
#include "iredgekinds.h"
Sebastian Hack's avatar
Sebastian Hack committed
39
#include "iredges_t.h"
Matthias Braun's avatar
Matthias Braun committed
40
#include "ircons.h"
41
#include "error.h"
Götz Lindenmaier's avatar
Götz Lindenmaier committed
42

43
#include "irhooks.h"
44
#include "irtools.h"
45
#include "util.h"
Michael Beck's avatar
Michael Beck committed
46

47
48
#include "beinfo.h"

Götz Lindenmaier's avatar
Götz Lindenmaier committed
49
50
/* some constants fixing the positions of nodes predecessors
   in the in array */
51
52
53
54
#define CALL_PARAM_OFFSET     (n_Call_max+1)
#define BUILTIN_PARAM_OFFSET  (n_Builtin_max+1)
#define SEL_INDEX_OFFSET      (n_Sel_max+1)
#define RETURN_RESULT_OFFSET  (n_Return_max+1)
Michael Beck's avatar
Michael Beck committed
55
#define END_KEEPALIVE_OFFSET  0
Götz Lindenmaier's avatar
Götz Lindenmaier committed
56

57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
static const char *relation_names [] = {
	"false",
	"equal",
	"less",
	"less_equal",
	"greater",
	"greater_equal",
	"less_greater",
	"less_equal_greater",
	"unordered",
	"unordered_equal",
	"unordered_less",
	"unordered_less_equal",
	"unordered_greater",
	"unordered_greater_equal",
	"not_equal",
	"true"
74
};
Christian Schäfer's avatar
Christian Schäfer committed
75

76
const char *get_relation_string(ir_relation relation)
77
{
78
79
	assert(relation < (ir_relation)ARRAY_SIZE(relation_names));
	return relation_names[relation];
Christian Schäfer's avatar
Christian Schäfer committed
80
81
}

82
ir_relation get_negated_relation(ir_relation relation)
83
{
84
	return relation ^ ir_relation_true;
Christian Schäfer's avatar
Christian Schäfer committed
85
86
}

87
ir_relation get_inversed_relation(ir_relation relation)
88
{
89
90
91
	ir_relation code    = relation & ~(ir_relation_less|ir_relation_greater);
	bool        less    = relation & ir_relation_less;
	bool        greater = relation & ir_relation_greater;
92
93
	code |= (less ? ir_relation_greater : ir_relation_false)
	      | (greater ? ir_relation_less : ir_relation_false);
94
	return code;
Michael Beck's avatar
Michael Beck committed
95
96
}

97
98
99
100
101
102
/**
 * 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;

103
unsigned firm_add_node_size = 0;
104
105


106
107
unsigned firm_register_additional_node_data(unsigned size)
{
108
	assert(!forbid_new_data && "Too late to register additional node data");
109

110
111
	if (forbid_new_data)
		return 0;
112

113
	return firm_add_node_size += size;
114
115
116
}


117
118
void init_irnode(void)
{
119
120
	/* Forbid the addition of new data to an ir node. */
	forbid_new_data = 1;
Christian Schäfer's avatar
Christian Schäfer committed
121
122
}

123
124
125
126
127
128
129
130
131
struct struct_align {
	char c;
	struct s {
		int i;
		float f;
		double d;
	} s;
};

132
ir_node *new_ir_node(dbg_info *db, ir_graph *irg, ir_node *block, ir_op *op,
133
                     ir_mode *mode, int arity, ir_node *const *in)
Christian Schäfer's avatar
Christian Schäfer committed
134
{
135
	ir_node *res;
136
137
138
	unsigned align = offsetof(struct struct_align, s) - 1;
	unsigned add_node_size = (firm_add_node_size + align) & ~align;
	size_t node_size = offsetof(ir_node, attr) + op->attr_size + add_node_size;
139
	char *p;
140
	int i;
141

Christoph Mallon's avatar
Christoph Mallon committed
142
143
144
	assert(irg);
	assert(op);
	assert(mode);
145
	p = (char*)obstack_alloc(irg->obst, node_size);
146
	memset(p, 0, node_size);
147
	res = (ir_node *)(p + add_node_size);
148
149
150
151
152
153
154
155
156
157

	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) {
158
		res->in = NEW_ARR_F(ir_node *, 1);  /* 1: space for block */
159
	} else {
160
161
		/* not nice but necessary: End and Sync must always have a flexible array */
		if (op == op_End || op == op_Sync)
162
163
164
			res->in = NEW_ARR_F(ir_node *, (arity+1));
		else
			res->in = NEW_ARR_D(ir_node *, irg->obst, (arity+1));
165
		memcpy(&res->in[1], in, sizeof(ir_node *) * arity);
166
167
	}

168
	res->in[0]   = block;
169
	set_irn_dbg_info(res, db);
170
	res->out     = NULL;
171
	res->node_nr = get_irp_new_node_nr();
Götz Lindenmaier's avatar
Götz Lindenmaier committed
172

Michael Beck's avatar
Michael Beck committed
173
	for (i = 0; i < EDGE_KIND_LAST; ++i) {
174
		INIT_LIST_HEAD(&res->edge_info[i].outs_head);
Michael Beck's avatar
Michael Beck committed
175
176
177
178
		/* edges will be build immediately */
		res->edge_info[i].edges_built = 1;
		res->edge_info[i].out_count = 0;
	}
179

180
	/* don't put this into the for loop, arity is -1 for some nodes! */
181
182
	edges_notify_edge(res, -1, res->in[0], NULL, irg);
	for (i = 1; i <= arity; ++i)
183
		edges_notify_edge(res, i - 1, res->in[i], NULL, irg);
Sebastian Hack's avatar
Sebastian Hack committed
184

185
	hook_new_node(irg, res);
186
	if (get_irg_phase_state(irg) == phase_backend) {
187
		be_info_new_node(irg, res);
188
	}
Michael Beck's avatar
Michael Beck committed
189

190
	return res;
Christian Schäfer's avatar
Christian Schäfer committed
191
192
}

193
194
int (is_ir_node)(const void *thing)
{
195
	return is_ir_node_(thing);
Sebastian Felis's avatar
Sebastian Felis committed
196
197
}

198
199
int (get_irn_arity)(const ir_node *node)
{
200
	return get_irn_arity_(node);
201
202
}

203
204
ir_node **get_irn_in(const ir_node *node)
{
205
206
207
	return node->in;
}

208
209
void set_irn_in(ir_node *node, int arity, ir_node **in)
{
210
	int i;
Michael Beck's avatar
Michael Beck committed
211
	ir_node *** pOld_in;
212
	ir_graph *irg = get_irn_irg(node);
213

214
	pOld_in = &node->in;
215

216
217
218
219
220
221
222
#ifndef NDEBUG
	assert(node != NULL && node->kind == k_ir_node);
	assert(arity >= 0);
	for (i = 0; i < arity; ++i) {
		assert(in[i] != NULL && in[0]->kind == k_ir_node);
	}
#endif
223
224

	for (i = 0; i < arity; i++) {
225
		if (i < (int)ARR_LEN(*pOld_in)-1)
Michael Beck's avatar
Michael Beck committed
226
			edges_notify_edge(node, i, in[i], (*pOld_in)[i+1], irg);
227
		else
Michael Beck's avatar
Michael Beck committed
228
			edges_notify_edge(node, i, in[i], NULL,            irg);
229
	}
230
	for (;i < (int)ARR_LEN(*pOld_in)-1; i++) {
Michael Beck's avatar
Michael Beck committed
231
		edges_notify_edge(node, i, NULL, (*pOld_in)[i+1], irg);
232
233
	}

234
	if (arity != (int)ARR_LEN(*pOld_in) - 1) {
Michael Beck's avatar
Michael Beck committed
235
236
237
		ir_node * block = (*pOld_in)[0];
		*pOld_in = NEW_ARR_D(ir_node *, irg->obst, arity + 1);
		(*pOld_in)[0] = block;
238
239
240
	}
	fix_backedges(irg->obst, node);

Michael Beck's avatar
Michael Beck committed
241
	memcpy((*pOld_in) + 1, in, sizeof(ir_node *) * arity);
242
243

	/* update irg flags */
244
	clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
245
246
}

247
248
ir_node *(get_irn_n)(const ir_node *node, int n)
{
249
	return get_irn_n_(node, n);
Christian Schäfer's avatar
Christian Schäfer committed
250
251
}

252
253
void set_irn_n(ir_node *node, int n, ir_node *in)
{
254
	ir_graph *irg = get_irn_irg(node);
255
256
257
258
259
260
261
262
263
	assert(node && node->kind == k_ir_node);
	assert(-1 <= n);
	assert(n < get_irn_arity(node));
	assert(in && in->kind == k_ir_node);

	/* 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 */
264
	edges_notify_edge(node, n, in, node->in[n + 1], irg);
265
266

	node->in[n + 1] = in;
267
268

	/* update irg flags */
269
	clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS | IR_GRAPH_PROPERTY_CONSISTENT_LOOPINFO);
Christian Schäfer's avatar
Christian Schäfer committed
270
271
}

272
273
int add_irn_n(ir_node *node, ir_node *in)
{
274
275
276
277
278
279
280
281
	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);

282
283
284
	/* Call the hook */
	hook_set_irn_n(node, pos, node->in[pos + 1], NULL);

285
286
287
	return pos;
}

Christoph Mallon's avatar
Christoph Mallon committed
288
289
290
291
292
293
294
295
296
void del_Sync_n(ir_node *n, int i)
{
	int      arity     = get_Sync_n_preds(n);
	ir_node *last_pred = get_Sync_pred(n, arity - 1);
	set_Sync_pred(n, i, last_pred);
	edges_notify_edge(n, arity - 1, NULL, last_pred, get_irn_irg(n));
	ARR_SHRINKLEN(get_irn_in(n), arity);
}

297
298
int (get_irn_deps)(const ir_node *node)
{
299
	return get_irn_deps_(node);
Sebastian Hack's avatar
Sebastian Hack committed
300
301
}

302
303
ir_node *(get_irn_dep)(const ir_node *node, int pos)
{
304
	return get_irn_dep_(node, pos);
Sebastian Hack's avatar
Sebastian Hack committed
305
306
}

307
308
void (set_irn_dep)(ir_node *node, int pos, ir_node *dep)
{
309
	set_irn_dep_(node, pos, dep);
Sebastian Hack's avatar
Sebastian Hack committed
310
311
}

312
313
int add_irn_dep(ir_node *node, ir_node *dep)
{
Sebastian Hack's avatar
Sebastian Hack committed
314
315
	int res = 0;

316
317
	/* DEP edges are only allowed in backend phase */
	assert(get_irg_phase_state(get_irn_irg(node)) == phase_backend);
Sebastian Hack's avatar
Sebastian Hack committed
318
319
320
	if (node->deps == NULL) {
		node->deps = NEW_ARR_F(ir_node *, 1);
		node->deps[0] = dep;
321
	} else {
Sebastian Hack's avatar
Sebastian Hack committed
322
323
324
		int i, n;
		int first_zero = -1;

325
326
		for (i = 0, n = ARR_LEN(node->deps); i < n; ++i) {
			if (node->deps[i] == NULL)
Sebastian Hack's avatar
Sebastian Hack committed
327
328
				first_zero = i;

329
			if (node->deps[i] == dep)
Sebastian Hack's avatar
Sebastian Hack committed
330
331
332
				return i;
		}

333
		if (first_zero >= 0) {
Sebastian Hack's avatar
Sebastian Hack committed
334
335
			node->deps[first_zero] = dep;
			res = first_zero;
336
		} else {
Sebastian Hack's avatar
Sebastian Hack committed
337
338
339
340
341
342
343
344
345
346
			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;
}

347
348
void add_irn_deps(ir_node *tgt, ir_node *src)
{
Sebastian Hack's avatar
Sebastian Hack committed
349
350
	int i, n;

351
	for (i = 0, n = get_irn_deps(src); i < n; ++i)
Sebastian Hack's avatar
Sebastian Hack committed
352
353
354
355
		add_irn_dep(tgt, get_irn_dep(src, i));
}


356
357
ir_mode *(get_irn_mode)(const ir_node *node)
{
358
	return get_irn_mode_(node);
Christian Schäfer's avatar
Christian Schäfer committed
359
360
}

361
362
void (set_irn_mode)(ir_node *node, ir_mode *mode)
{
363
	set_irn_mode_(node, mode);
Till Riedel's avatar
Till Riedel committed
364
365
}

366
367
ir_op *(get_irn_op)(const ir_node *node)
{
368
	return get_irn_op_(node);
Christian Schäfer's avatar
Christian Schäfer committed
369
370
}

371
372
void (set_irn_op)(ir_node *node, ir_op *op)
{
373
	set_irn_op_(node, op);
Christian Schäfer's avatar
Christian Schäfer committed
374
375
}

376
377
unsigned (get_irn_opcode)(const ir_node *node)
{
378
	return get_irn_opcode_(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
379
380
}

381
382
const char *get_irn_opname(const ir_node *node)
{
383
	return get_id_str(node->op->name);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
384
385
}

386
387
ident *get_irn_opident(const ir_node *node)
{
388
389
	assert(node);
	return node->op->name;
390
391
}

392
393
ir_visited_t (get_irn_visited)(const ir_node *node)
{
394
	return get_irn_visited_(node);
395
396
}

397
398
void (set_irn_visited)(ir_node *node, ir_visited_t visited)
{
399
	set_irn_visited_(node, visited);
Christian Schäfer's avatar
Christian Schäfer committed
400
}
401

402
403
void (mark_irn_visited)(ir_node *node)
{
404
	mark_irn_visited_(node);
405
406
}

407
408
int (irn_visited)(const ir_node *node)
{
409
	return irn_visited_(node);
410
411
}

412
413
int (irn_visited_else_mark)(ir_node *node)
{
414
	return irn_visited_else_mark_(node);
415
416
}

417
418
void (set_irn_link)(ir_node *node, void *link)
{
419
	set_irn_link_(node, link);
Christian Schäfer's avatar
Christian Schäfer committed
420
421
}

422
423
void *(get_irn_link)(const ir_node *node)
{
424
	return get_irn_link_(node);
Christian Schäfer's avatar
Christian Schäfer committed
425
426
}

427
428
op_pin_state (get_irn_pinned)(const ir_node *node)
{
429
	return get_irn_pinned_(node);
430
431
}

432
433
op_pin_state (is_irn_pinned_in_irg) (const ir_node *node)
{
434
	return is_irn_pinned_in_irg_(node);
435
436
}

437
438
void set_irn_pinned(ir_node *node, op_pin_state state)
{
439
	/* due to optimization an opt may be turned into a Tuple */
440
	if (is_Tuple(node))
441
		return;
Michael Beck's avatar
Michael Beck committed
442

443
444
	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
445

446
	node->attr.except.pin_state = state;
Michael Beck's avatar
Michael Beck committed
447
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
448

449
450
long get_irn_node_nr(const ir_node *node)
{
451
452
	assert(node);
	return node->node_nr;
453
}
Götz Lindenmaier's avatar
Götz Lindenmaier committed
454

455
456
void *(get_irn_generic_attr)(ir_node *node)
{
457
	assert(is_ir_node(node));
458
	return get_irn_generic_attr_(node);
459
460
}

461
462
const void *(get_irn_generic_attr_const)(const ir_node *node)
{
463
	assert(is_ir_node(node));
464
	return get_irn_generic_attr_const_(node);
465
466
}

467
468
unsigned (get_irn_idx)(const ir_node *node)
{
469
	assert(is_ir_node(node));
470
	return get_irn_idx_(node);
471
472
}

473
474
int get_irn_pred_pos(ir_node *node, ir_node *arg)
{
475
476
477
478
479
480
	int i;
	for (i = get_irn_arity(node) - 1; i >= 0; i--) {
		if (get_irn_n(node, i) == arg)
			return i;
	}
	return -1;
481
482
}

483
ir_node *(get_nodes_block)(const ir_node *node)
484
{
485
	return get_nodes_block_(node);
Christian Schäfer's avatar
Christian Schäfer committed
486
487
}

488
489
void set_nodes_block(ir_node *node, ir_node *block)
{
490
491
	assert(node->op != op_Block);
	set_irn_n(node, -1, block);
Christian Schäfer's avatar
Christian Schäfer committed
492
493
}

494
495
ir_type *is_frame_pointer(const ir_node *n)
{
496
497
	if (is_Proj(n) && (get_Proj_proj(n) == pn_Start_P_frame_base)) {
		ir_node *start = get_Proj_pred(n);
498
		if (is_Start(start)) {
499
500
501
502
			return get_irg_frame_type(get_irn_irg(start));
		}
	}
	return NULL;
503
504
}

505
506
ir_node **get_Block_cfgpred_arr(ir_node *node)
{
507
	assert(is_Block(node));
508
	return (ir_node **)&(get_irn_in(node)[1]);
509
510
}

511
512
int (get_Block_n_cfgpreds)(const ir_node *node)
{
513
	return get_Block_n_cfgpreds_(node);
Christian Schäfer's avatar
Christian Schäfer committed
514
515
}

516
517
ir_node *(get_Block_cfgpred)(const ir_node *node, int pos)
{
518
	return get_Block_cfgpred_(node, pos);
Christian Schäfer's avatar
Christian Schäfer committed
519
520
}

521
522
void set_Block_cfgpred(ir_node *node, int pos, ir_node *pred)
{
523
	assert(is_Block(node));
524
	set_irn_n(node, pos, pred);
Christian Schäfer's avatar
Christian Schäfer committed
525
526
}

527
528
int get_Block_cfgpred_pos(const ir_node *block, const ir_node *pred)
{
529
530
531
532
533
534
535
536
537
	int i;

	for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
		if (get_Block_cfgpred_block(block, i) == pred)
			return i;
	}
	return -1;
}

538
539
ir_node *(get_Block_cfgpred_block)(const ir_node *node, int pos)
{
540
	return get_Block_cfgpred_block_(node, pos);
541
542
}

543
544
int get_Block_matured(const ir_node *node)
{
545
	assert(is_Block(node));
Michael Beck's avatar
Michael Beck committed
546
	return (int)node->attr.block.is_matured;
Christian Schäfer's avatar
Christian Schäfer committed
547
548
}

549
550
void set_Block_matured(ir_node *node, int matured)
{
551
	assert(is_Block(node));
Michael Beck's avatar
Michael Beck committed
552
	node->attr.block.is_matured = matured;
Christian Schäfer's avatar
Christian Schäfer committed
553
}
Michael Beck's avatar
Michael Beck committed
554

555
556
ir_visited_t (get_Block_block_visited)(const ir_node *node)
{
557
	return get_Block_block_visited_(node);
Christian Schäfer's avatar
Christian Schäfer committed
558
559
}

560
561
void (set_Block_block_visited)(ir_node *node, ir_visited_t visit)
{
562
	set_Block_block_visited_(node, visit);
Christian Schäfer's avatar
Christian Schäfer committed
563
564
}

565
566
void (mark_Block_block_visited)(ir_node *node)
{
567
	mark_Block_block_visited_(node);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
568
569
}

570
571
int (Block_block_visited)(const ir_node *node)
{
572
	return Block_block_visited_(node);
Matthias Braun's avatar
Matthias Braun committed
573
574
}

575
576
ir_graph *(get_Block_irg)(const ir_node *block)
{
577
	return get_Block_irg_(block);
578
579
}

580
581
ir_entity *create_Block_entity(ir_node *block)
{
582
	ir_entity *entity;
Michael Beck's avatar
Michael Beck committed
583
	assert(is_Block(block));
584
585
586

	entity = block->attr.block.entity;
	if (entity == NULL) {
Matthias Braun's avatar
Matthias Braun committed
587
588
		ir_label_t nr = get_irp_next_label_nr();
		entity = new_label_entity(nr);
589
590
		set_entity_visibility(entity, ir_visibility_local);
		set_entity_linkage(entity, IR_LINKAGE_CONSTANT);
591
592
593
594
595
		set_entity_compiler_generated(entity, 1);

		block->attr.block.entity = entity;
	}
	return entity;
Michael Beck's avatar
Michael Beck committed
596
597
}

598
599
ir_node *(get_Block_phis)(const ir_node *block)
{
600
	return get_Block_phis_(block);
601
602
}

603
604
void (set_Block_phis)(ir_node *block, ir_node *phi)
{
605
	set_Block_phis_(block, phi);
606
607
}

608
609
void (add_Block_phi)(ir_node *block, ir_node *phi)
{
610
	add_Block_phi_(block, phi);
Michael Beck's avatar
Michael Beck committed
611
612
}

613
614
unsigned (get_Block_mark)(const ir_node *block)
{
615
	return get_Block_mark_(block);
Michael Beck's avatar
Michael Beck committed
616
617
}

618
619
void (set_Block_mark)(ir_node *block, unsigned mark)
{
620
	set_Block_mark_(block, mark);
Michael Beck's avatar
Michael Beck committed
621
622
}

623
624
int get_End_n_keepalives(const ir_node *end)
{
625
	assert(is_End(end));
626
	return (get_irn_arity(end) - END_KEEPALIVE_OFFSET);
627
628
}

629
630
ir_node *get_End_keepalive(const ir_node *end, int pos)
{
631
	assert(is_End(end));
632
	return get_irn_n(end, pos + END_KEEPALIVE_OFFSET);
633
634
}

635
636
void add_End_keepalive(ir_node *end, ir_node *ka)
{
637
	assert(is_End(end));
638
	add_irn_n(end, ka);
639
640
}

641
642
void set_End_keepalive(ir_node *end, int pos, ir_node *ka)
{
643
	assert(is_End(end));
644
	set_irn_n(end, pos + END_KEEPALIVE_OFFSET, ka);
645
646
}

647
648
void set_End_keepalives(ir_node *end, int n, ir_node *in[])
{
649
650
	size_t e;
	int    i;
651
	ir_graph *irg = get_irn_irg(end);
652

653
	/* notify that edges are deleted */
654
655
	for (e = END_KEEPALIVE_OFFSET; e < ARR_LEN(end->in) - 1; ++e) {
		edges_notify_edge(end, e, NULL, end->in[e + 1], irg);
656
657
	}
	ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);
658

659
660
	for (i = 0; i < n; ++i) {
		end->in[1 + END_KEEPALIVE_OFFSET + i] = in[i];
661
		edges_notify_edge(end, END_KEEPALIVE_OFFSET + i, end->in[1 + END_KEEPALIVE_OFFSET + i], NULL, irg);
662
	}
663
664

	/* update irg flags */
665
	clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
666
}
667

668
669
void remove_End_keepalive(ir_node *end, ir_node *irn)
{
670
671
672
673
674
675
676
677
678
679
680
681
682
	int      n = get_End_n_keepalives(end);
	int      i, idx;
	ir_graph *irg;

	idx = -1;
	for (i = n -1; i >= 0; --i) {
		ir_node *old_ka = end->in[1 + END_KEEPALIVE_OFFSET + i];

		/* find irn */
		if (old_ka == irn) {
			idx = i;
			goto found;
		}
683
	}
684
685
686
687
688
689
690
691
692
693
694
695
696
697
	return;
found:
	irg = get_irn_irg(end);

	/* remove the edge */
	edges_notify_edge(end, idx, NULL, irn, irg);

	if (idx != n - 1) {
		/* exchange with the last one */
		ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
		edges_notify_edge(end, n - 1, NULL, old, irg);
		end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
		edges_notify_edge(end, idx, old, NULL, irg);
	}
698
	/* now n - 1 keeps, 1 block input */
699
	ARR_RESIZE(ir_node *, end->in, (n - 1) + 1 + END_KEEPALIVE_OFFSET);
700
701

	/* update irg flags */
702
	clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
703
}
704

705
706
void remove_End_Bads_and_doublets(ir_node *end)
{
707
708
709
	pset_new_t keeps;
	int        idx, n = get_End_n_keepalives(end);
	ir_graph   *irg;
710
	bool       changed = false;
711
712
713
714
715
716
717
718
719
720

	if (n <= 0)
		return;

	irg = get_irn_irg(end);
	pset_new_init(&keeps);

	for (idx = n - 1; idx >= 0; --idx) {
		ir_node *ka = get_End_keepalive(end, idx);

Michael Beck's avatar
Michael Beck committed
721
		if (is_Bad(ka) || is_NoMem(ka) || pset_new_contains(&keeps, ka)) {
722
			changed = true;
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
			/* remove the edge */
			edges_notify_edge(end, idx, NULL, ka, irg);

			if (idx != n - 1) {
				/* exchange with the last one */
				ir_node *old = end->in[1 + END_KEEPALIVE_OFFSET + n - 1];
				edges_notify_edge(end, n - 1, NULL, old, irg);
				end->in[1 + END_KEEPALIVE_OFFSET + idx] = old;
				edges_notify_edge(end, idx, old, NULL, irg);
			}
			--n;
		} else {
			pset_new_insert(&keeps, ka);
		}
	}
	/* n keeps, 1 block input */
	ARR_RESIZE(ir_node *, end->in, n + 1 + END_KEEPALIVE_OFFSET);

	pset_new_destroy(&keeps);
742
743

	if (changed) {
744
		clear_irg_properties(irg, IR_GRAPH_PROPERTY_CONSISTENT_OUTS);
745
	}
746
747
}

748
749
void free_End(ir_node *end)
{
750
	assert(is_End(end));
751
752
753
754
	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 ... */
755
756
}

757
size_t get_Return_n_ress(const ir_node *node)
758
{
759
	assert(is_Return(node));
760
	return (size_t)(get_irn_arity(node) - RETURN_RESULT_OFFSET);
761
762
}

763
ir_node **get_Return_res_arr(ir_node *node)
764
{
765
	assert(is_Return(node));
766
767
768
769
	if (get_Return_n_ress(node) > 0)
		return (ir_node **)&(get_irn_in(node)[1 + RETURN_RESULT_OFFSET]);
	else
		return NULL;
770
771
}

772
ir_node *get_Return_res(const ir_node *node, int pos)
773
{
774
	assert(is_Return(node));
775
776
	assert(pos >= 0);
	assert(get_Return_n_ress(node) > (size_t)pos);
777
	return get_irn_n(node, pos + RETURN_RESULT_OFFSET);
Christian Schäfer's avatar
Christian Schäfer committed
778
779
}

780
void set_Return_res(ir_node *node, int pos, ir_node *res)
781
{
782
	assert(is_Return(node));
783
	set_irn_n(node, pos + RETURN_RESULT_OFFSET, res);
Christian Schäfer's avatar
Christian Schäfer committed
784
785
}

786
787
int (is_Const_null)(const ir_node *node)
{
788
	return is_Const_null_(node);
789
790
}

791
792
int (is_Const_one)(const ir_node *node)
{
793
	return is_Const_one_(node);
794
795
}

796
797
int (is_Const_all_one)(const ir_node *node)
{
798
	return is_Const_all_one_(node);
Sebastian Hack's avatar
Sebastian Hack committed
799
800
}

801
802


803
symconst_kind get_SymConst_kind(const ir_node *node)
804
{
805
	assert(is_SymConst(node));
806
	return node->attr.symc.kind;
Christian Schäfer's avatar
Christian Schäfer committed
807
808
}

809
void set_SymConst_kind(ir_node *node, symconst_kind kind)
810
{
811
	assert(is_SymConst(node));
812
	node->attr.symc.kind = kind;
Christian Schäfer's avatar
Christian Schäfer committed
813
814
}

815
ir_type *get_SymConst_type(const ir_node *node)
816
{
Michael Beck's avatar
Michael Beck committed
817
818
819
	/* the cast here is annoying, but we have to compensate for
	   the skip_tip() */
	ir_node *irn = (ir_node *)node;
820
	assert(is_SymConst(node) &&
821
	       (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
Matthias Braun's avatar
Matthias Braun committed
822
	return irn->attr.symc.sym.type_p;
Christian Schäfer's avatar
Christian Schäfer committed
823
824
}

825
void set_SymConst_type(ir_node *node, ir_type *tp)
826
{
827
	assert(is_SymConst(node) &&
828
829
	       (SYMCONST_HAS_TYPE(get_SymConst_kind(node))));
	node->attr.symc.sym.type_p = tp;
Christian Schäfer's avatar
Christian Schäfer committed
830
831
}

832
833
ir_entity *get_SymConst_entity(const ir_node *node)
{
834
	assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
835
	return node->attr.symc.sym.entity_p;
Beyhan's avatar
Beyhan committed
836
837
}

838
839
void set_SymConst_entity(ir_node *node, ir_entity *ent)
{
840
	assert(is_SymConst(node) && SYMCONST_HAS_ENT(get_SymConst_kind(node)));
841
	node->attr.symc.sym.entity_p  = ent;
Beyhan's avatar
Beyhan committed
842
843
}

844
845
ir_enum_const *get_SymConst_enum(const ir_node *node)
{
846
	assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
847
	return node->attr.symc.sym.enum_p;
848
849
}

850
851
void set_SymConst_enum(ir_node *node, ir_enum_const *ec)
{
852
	assert(is_SymConst(node) && SYMCONST_HAS_ENUM(get_SymConst_kind(node)));
853
	node->attr.symc.sym.enum_p  = ec;
854
855
}

Michael Beck's avatar
Michael Beck committed
856
union symconst_symbol
857
858
get_SymConst_symbol(const ir_node *node)
{
859
	assert(is_SymConst(node));
860
	return node->attr.symc.sym;
Götz Lindenmaier's avatar
Götz Lindenmaier committed
861
862
}

863
void set_SymConst_symbol(ir_node *node, union symconst_symbol sym)
864
{