beverify.c 21.7 KB
Newer Older
1
/*
Christian Würdig's avatar
Christian Würdig committed
2
3
4
5
6
 * Author:    Matthias Braun
 * Date:      05.05.2006
 * Copyright: (c) Universitaet Karlsruhe
 * License:   This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
 * CVS-Id:    $Id$
7
8
9
10
11
 */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

12
13
14
#include "bitset.h"
#include "set.h"
#include "array.h"
15
16
17
18
19
20

#include "irnode.h"
#include "irgraph.h"
#include "irgwalk.h"
#include "irprintf.h"
#include "irdump_t.h"
21
#include "iredges.h"
22
23
24
25

#include "beverify.h"
#include "belive.h"
#include "besched_t.h"
26
#include "benode_t.h"
27

28
29
static int my_values_interfere(const ir_node *a, const ir_node *b);

30
typedef struct be_verify_register_pressure_env_t_ {
Christian Würdig's avatar
Christian Würdig committed
31
	ir_graph                    *irg;                 /**< the irg to verify */
Sebastian Hack's avatar
Sebastian Hack committed
32
	 be_lv_t                    *lv;                  /**< Liveness information. */
Christian Würdig's avatar
Christian Würdig committed
33
34
35
36
	const arch_env_t            *arch_env;            /**< an architecture environment */
	const arch_register_class_t *cls;                 /**< the register class to check for */
	int                         registers_available;  /**< number of available registers */
	int                         problem_found;        /**< flag indicating if a problem was found */
37
38
} be_verify_register_pressure_env_t;

Christian Würdig's avatar
Christian Würdig committed
39
40
41
/**
 * Print all nodes of a pset into a file.
 */
42
static void print_living_values(FILE *F, pset *live_nodes) {
43
44
	ir_node *node;

Christian Würdig's avatar
Christian Würdig committed
45
	ir_fprintf(F, "\t");
46
	foreach_pset(live_nodes, node) {
Christian Würdig's avatar
Christian Würdig committed
47
		ir_fprintf(F, "%+F ", node);
48
	}
Christian Würdig's avatar
Christian Würdig committed
49
	ir_fprintf(F, "\n");
50
51
}

Christian Würdig's avatar
Christian Würdig committed
52
53
54
/**
 * Check if number of live nodes never exceeds the number of available registers.
 */
55
static void verify_liveness_walker(ir_node *block, void *data) {
Christian Würdig's avatar
Christian Würdig committed
56
57
	be_verify_register_pressure_env_t *env = (be_verify_register_pressure_env_t *)data;
	pset    *live_nodes = pset_new_ptr_default();
58
	ir_node *irn;
59
	int pressure;
60

Christian Würdig's avatar
Christian Würdig committed
61
	/* collect register pressure info, start with end of a block */
Sebastian Hack's avatar
Sebastian Hack committed
62
	be_liveness_end_of_block(env->lv, env->arch_env, env->cls, block, live_nodes);
Christian Würdig's avatar
Christian Würdig committed
63

64
65
66
67
68
69
70
	pressure = pset_count(live_nodes);
	if(pressure > env->registers_available) {
		ir_fprintf(stderr, "Verify Warning: Register pressure too high at end of block %+F(%s) (%d/%d):\n",
			block, get_irg_dump_name(env->irg), pressure, env->registers_available);
		print_living_values(stderr, live_nodes);
		env->problem_found = 1;
	}
71

72
	sched_foreach_reverse(block, irn) {
Christian Würdig's avatar
Christian Würdig committed
73
		if (is_Phi(irn))
74
75
			break;

76
77
78
79
		be_liveness_transfer(env->arch_env, env->cls, irn, live_nodes);

		pressure = pset_count(live_nodes);

80
		if(pressure > env->registers_available) {
81
82
			ir_fprintf(stderr, "Verify Warning: Register pressure too high before node %+F in %+F(%s) (%d/%d):\n",
				irn, block, get_irg_dump_name(env->irg), pressure, env->registers_available);
Christian Würdig's avatar
Christian Würdig committed
83
			print_living_values(stderr, live_nodes);
84
85
86
87
88
89
			env->problem_found = 1;
		}
	}
	del_pset(live_nodes);
}

Christian Würdig's avatar
Christian Würdig committed
90
91
92
/**
 * Start a walk over the irg and check the register pressure.
 */
Sebastian Hack's avatar
Sebastian Hack committed
93
int be_verify_register_pressure(const be_irg_t *birg, const arch_register_class_t *cls, ir_graph *irg) {
94
95
	be_verify_register_pressure_env_t env;

Sebastian Hack's avatar
Sebastian Hack committed
96
	env.lv                  = be_liveness(irg);
Christian Würdig's avatar
Christian Würdig committed
97
	env.irg                 = irg;
Sebastian Hack's avatar
Sebastian Hack committed
98
	env.arch_env            = birg->main_env->arch_env;
Christian Würdig's avatar
Christian Würdig committed
99
	env.cls                 = cls;
Sebastian Hack's avatar
Sebastian Hack committed
100
	env.registers_available = env.cls->n_regs - be_put_ignore_regs(birg, env.cls, NULL);
Christian Würdig's avatar
Christian Würdig committed
101
	env.problem_found       = 0;
102

Christian Würdig's avatar
Christian Würdig committed
103
	irg_block_walk_graph(irg, verify_liveness_walker, NULL, &env);
Sebastian Hack's avatar
Sebastian Hack committed
104
	be_liveness_free(env.lv);
Christian Würdig's avatar
Christian Würdig committed
105
106

	return ! env.problem_found;
107
108
109
}

typedef struct be_verify_schedule_env_t_ {
Christian Würdig's avatar
Christian Würdig committed
110
111
	int      problem_found;    /**< flags indicating if there was a problem */
	ir_graph *irg;             /**< the irg to check */
112
113
} be_verify_schedule_env_t;

Christian Würdig's avatar
Christian Würdig committed
114
115
116
/**
 * Simple schedule checker.
 */
117
static void verify_schedule_walker(ir_node *block, void *data) {
118
	be_verify_schedule_env_t *env = (be_verify_schedule_env_t*) data;
119
	ir_node *node;
Christian Würdig's avatar
Christian Würdig committed
120
	int non_phi_found  = 0;
121
	int cfchange_found = 0;
Matthias Braun's avatar
Matthias Braun committed
122
	// TODO ask arch about delay branches
123
	int delay_branches = 0;
124
125

	/*
126
127
128
129
	 * Tests for the following things:
	 *   1. Make sure that all phi nodes are scheduled at the beginning of the block
	 *   2. There is 1 or no control flow changing node scheduled and exactly delay_branches operations after it.
	 *   3. No value is defined after it has been used
130
	 */
131
132
133
134
135
	sched_foreach(block, node) {
		int i, arity;

		// 1. Check for phis
		if (is_Phi(node)) {
Christian Würdig's avatar
Christian Würdig committed
136
137
			if (non_phi_found) {
				ir_fprintf(stderr, "Verify Warning: Phi node %+F scheduled after non-Phi nodes in block %+F (%s)\n",
138
					node, block, get_irg_dump_name(env->irg));
139
140
				env->problem_found = 1;
			}
Matthias Braun's avatar
Matthias Braun committed
141
		} else {
142
143
			non_phi_found = 1;
		}
144

145
146
		// 2. Check for control flow changing nodes
		if (is_cfop(node) && get_irn_opcode(node) != iro_Start) {
Christian Würdig's avatar
Christian Würdig committed
147
148
149
			/* check, that only one CF operation is scheduled */
			if (cfchange_found == 1) {
				ir_fprintf(stderr, "Verify Warning: More than 1 control flow changing node (%+F) scheduled in block %+F (%s)\n",
150
					node, block, get_irg_dump_name(env->irg));
151
152
153
				env->problem_found = 1;
			}
			cfchange_found = 1;
Christian Würdig's avatar
Christian Würdig committed
154
		} else if (cfchange_found) {
155
156
157
158
159
160
161
162
163
164
			// proj and keepany aren't real instructions...
			if(!is_Proj(node) && !be_is_Keep(node)) {
				/* check for delay branches */
				if (delay_branches == 0) {
					ir_fprintf(stderr, "Verify Warning: Node %+F scheduled after control flow changing node (+delay branches) in block %+F (%s)\n",
						node, block, get_irg_dump_name(env->irg));
					env->problem_found = 1;
				} else {
					delay_branches--;
				}
165
166
			}
		}
167
168

		// 3. Check for uses
169
		if(!is_Phi(node)) {
170
			int nodetime = sched_get_time_step(node);
171
			for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
172
173
174
175
176
177
178
179
180
181
				ir_node *arg = get_irn_n(node, i);
				if(get_nodes_block(arg) != block
				   || !sched_is_scheduled(arg))
					continue;

				if(sched_get_time_step(arg) >= nodetime) {
					ir_fprintf(stderr, "Verify Warning: Value %+F used by %+F before it was defined in block %+F (%s)\n",
					           arg, node, block, get_irg_dump_name(env->irg));
					env->problem_found = 1;
				}
182
			}
183
		}
184
185
186
187
188
189
190

		// 4. check for dead nodes
		if(get_irn_n_edges(node) == 0) {
			ir_fprintf(stderr, "Verify warning: Node %+F is dead but scheduled in block %+F (%s)\n",
			           node, block, get_irg_dump_name(env->irg));
			env->problem_found = 1;
		}
191
192
	}

193
	/* check that all delay branches are filled (at least with NOPs) */
Christian Würdig's avatar
Christian Würdig committed
194
	if (cfchange_found && delay_branches != 0) {
195
		ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
196
			block, get_irg_dump_name(env->irg));
197
198
199
		env->problem_found = 1;
	}
}
200

201
static int should_be_scheduled(ir_node *node) {
202
203
204
	if(is_Block(node))
		return -1;

205
	if(get_irn_mode(node) == mode_M) {
206
207
		if(is_Proj(node))
			return -1;
Michael Beck's avatar
Michael Beck committed
208
		if(is_Phi(node) || is_Sync(node) || is_Pin(node))
209
210
211
212
			return 0;
	}
	if(is_Proj(node) && get_irn_mode(node) == mode_X)
		return 0;
213
	if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
214
215
		return 0;

216
217
218
219
220
221
222
223
224
	switch(get_irn_opcode(node)) {
	case iro_End:
	case iro_NoMem:
	case iro_Bad:
		return 0;
	default:
		break;
	}

225
226
227
228
229
230
231
232
	return 1;
}

static void check_schedule(ir_node *node, void *data) {
	be_verify_schedule_env_t *env = data;
	int should_be;

	should_be = should_be_scheduled(node);
233
234
	if(should_be == -1)
		return;
235
236
237

	if(should_be ? !sched_is_scheduled(node) : sched_is_scheduled(node)) {
		ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should%s be scheduled\n",
238
			node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
239
240
241
242
		env->problem_found = 1;
	}
}

Christian Würdig's avatar
Christian Würdig committed
243
244
245
/**
 * Start a walk over the irg and check schedule.
 */
246
int be_verify_schedule(ir_graph *irg)
247
248
249
250
{
	be_verify_schedule_env_t env;

	env.problem_found = 0;
Christian Würdig's avatar
Christian Würdig committed
251
	env.irg           = irg;
252
253

	irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
254
255
	// check if all nodes are scheduled
	irg_walk_graph(irg, check_schedule, NULL, &env);
256

Christian Würdig's avatar
Christian Würdig committed
257
	return ! env.problem_found;
258
}
259

260
261


262
263
264
//---------------------------------------------------------------------------


265
266
267
268
269
270
271

typedef struct _spill_t {
	ir_node *spill;
	entity *ent;
} spill_t;

typedef struct {
272
	const arch_env_t *arch_env;
273
274
275
276
277
278
279
280
281
282
283
284
	ir_graph *irg;
	set *spills;
	ir_node **reloads;
	int problem_found;
} be_verify_spillslots_env_t;

static int cmp_spill(const void* d1, const void* d2, size_t size) {
	const spill_t* s1 = d1;
	const spill_t* s2 = d2;
	return s1->spill != s2->spill;
}

285
286
287
288
289
290
291
static spill_t *find_spill(be_verify_spillslots_env_t *env, ir_node *node) {
	spill_t spill;

	spill.spill = node;
	return set_find(env->spills, &spill, sizeof(spill), HASH_PTR(node));
}

292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
static spill_t *get_spill(be_verify_spillslots_env_t *env, ir_node *node, entity *ent) {
	spill_t spill, *res;
	int hash = HASH_PTR(node);

	spill.spill = node;
	res = set_find(env->spills, &spill, sizeof(spill), hash);

	if(res == NULL) {
		spill.ent = ent;
		res = set_insert(env->spills, &spill, sizeof(spill), hash);
	}

	return res;
}

307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
static ir_node *get_memory_edge(const ir_node *node) {
	int i, arity;
	ir_node *result = NULL;

	arity = get_irn_arity(node);
	for(i = arity - 1; i >= 0; --i) {
		ir_node *arg = get_irn_n(node, i);
		if(get_irn_mode(arg) == mode_M) {
			assert(result == NULL);
			result = arg;
		}
	}

	return result;
}

323
324
static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent);

325
326
327
328
329
330
331
static void check_entity(be_verify_spillslots_env_t *env, ir_node *node, entity *ent) {
	if(ent == NULL) {
		ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have an entity assigned\n",
		           node, get_nodes_block(node), get_irg_dump_name(env->irg));
	}
}

332
static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
333
	entity *spillent = arch_get_frame_entity(env->arch_env, node);
334
	check_entity(env, node, spillent);
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
	get_spill(env, node, ent);

	if(spillent != ent) {
		ir_fprintf(stderr, "Verify warning: Spill %+F has different entity than reload %+F in block %+F(%s)\n",
			node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
		env->problem_found = 1;
	}
}

static void collect_memperm(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
	int i, arity;
	spill_t spill, *res;
	int hash = HASH_PTR(node);
	int out;
	ir_node* memperm;
	entity *spillent;

	assert(is_Proj(node));

	memperm = get_Proj_pred(node);
	out = get_Proj_proj(node);

	spillent = be_get_MemPerm_out_entity(memperm, out);
358
	check_entity(env, memperm, spillent);
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
	if(spillent != ent) {
		ir_fprintf(stderr, "Verify warning: MemPerm %+F has different entity than reload %+F in block %+F(%s)\n",
			node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
		env->problem_found = 1;
	}

	spill.spill = node;
	res = set_find(env->spills, &spill, sizeof(spill), hash);
	if(res != NULL) {
		return;
	}

	spill.ent = spillent;
	res = set_insert(env->spills, &spill, sizeof(spill), hash);

374
375
	for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
		ir_node* arg = get_irn_n(memperm, i + 1);
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
		entity* argent = be_get_MemPerm_in_entity(memperm, i);

		collect(env, arg, memperm, argent);
	}
}

static void collect_memphi(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity *ent) {
	int i, arity;
	spill_t spill, *res;
	int hash = HASH_PTR(node);

	assert(is_Phi(node));

	spill.spill = node;
	res = set_find(env->spills, &spill, sizeof(spill), hash);
	if(res != NULL) {
		return;
	}

	spill.ent = ent;
	res = set_insert(env->spills, &spill, sizeof(spill), hash);

	// is 1 of the arguments a spill?
	for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
		ir_node* arg = get_irn_n(node, i);
		collect(env, arg, reload, ent);
	}
}

static void collect(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
	if(be_is_Spill(node)) {
		collect_spill(env, node, reload, ent);
	} else if(is_Proj(node)) {
		collect_memperm(env, node, reload, ent);
	} else if(is_Phi(node) && get_irn_mode(node) == mode_M) {
		collect_memphi(env, node, reload, ent);
	} else {
		ir_fprintf(stderr, "Verify warning: No spill, memperm or memphi attached to node %+F found from node %+F in block %+F(%s)\n",
			node, reload, get_nodes_block(node), get_irg_dump_name(env->irg));
		env->problem_found = 1;
	}
}

/**
 * This walker function searches for reloads and collects all the spills
 * and memphis attached to them.
 */
static void collect_spills_walker(ir_node *node, void *data) {
	be_verify_spillslots_env_t *env = data;
425
	const arch_env_t *arch_env = env->arch_env;
426

427
428
429
430
431
432
	// @@@ ia32_classify returns classification of Proj_pred :-/
	if(is_Proj(node))
		return;

	if(arch_irn_class_is(arch_env, node, reload)) {
		ir_node *spill = get_memory_edge(node);
Matthias Braun's avatar
Matthias Braun committed
433
434
		entity *ent;

435
436
437
438
439
440
		if(spill == NULL) {
			ir_fprintf(stderr, "Verify warning: No spill attached to reload %+F in block %+F(%s)\n",
			           node, get_nodes_block(node), get_irg_dump_name(env->irg));
			env->problem_found = 1;
			return;
		}
Matthias Braun's avatar
Matthias Braun committed
441
		ent = arch_get_frame_entity(env->arch_env, node);
442
		check_entity(env, node, ent);
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468

		collect(env, spill, node, ent);
		ARR_APP1(ir_node*, env->reloads, node);
	}
}

static void check_spillslot_interference(be_verify_spillslots_env_t *env) {
	int spillcount = set_count(env->spills);
	spill_t **spills = alloca(spillcount * sizeof(spills[0]));
	spill_t *spill;
	int i;

	for(spill = set_first(env->spills), i = 0; spill != NULL; spill = set_next(env->spills), ++i) {
		spills[i] = spill;
	}

	for(i = 0; i < spillcount; ++i) {
		spill_t *sp1 = spills[i];
		int i2;

		for(i2 = i+1; i2 < spillcount; ++i2) {
			spill_t *sp2 = spills[i2];

			if(sp1->ent != sp2->ent)
				continue;

469
			if(my_values_interfere(sp1->spill, sp2->spill)) {
470
471
472
473
				ir_fprintf(stderr, "Verify warning: Spillslots for %+F in block %+F(%s) and %+F in block %+F(%s) interfere\n",
					sp1->spill, get_nodes_block(sp1->spill), get_irg_dump_name(env->irg),
					sp2->spill, get_nodes_block(sp2->spill), get_irg_dump_name(env->irg));
				env->problem_found = 1;
474
				my_values_interfere(sp1->spill, sp2->spill);
475
476
477
478
479
			}
		}
	}
}

480
481
482
483
484
485
static void check_lonely_spills(ir_node *node, void *data) {
	be_verify_spillslots_env_t *env = data;

	if(be_is_Spill(node) || (is_Proj(node) && be_is_MemPerm(get_Proj_pred(node)))) {
		spill_t *spill = find_spill(env, node);
		if(be_is_Spill(node)) {
486
			entity *ent = arch_get_frame_entity(env->arch_env, node);
487
488
489
490
491
492
493
494
495
496
			check_entity(env, node, ent);
		}

		if(spill == NULL) {
			ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) not connected to a reaload\n",
			           node, get_nodes_block(node), get_irg_dump_name(env->irg));
		}
	}
}

497
int be_verify_spillslots(const arch_env_t *arch_env, ir_graph *irg)
498
499
500
{
	be_verify_spillslots_env_t env;

501
	env.arch_env = arch_env;
502
503
504
505
506
507
	env.irg = irg;
	env.spills = new_set(cmp_spill, 10);
	env.reloads = NEW_ARR_F(ir_node*, 0);
	env.problem_found = 0;

	irg_walk_graph(irg, collect_spills_walker, NULL, &env);
508
	irg_walk_graph(irg, check_lonely_spills, NULL, &env);
509
510
511
512
513
514
515
516
517

	check_spillslot_interference(&env);

	DEL_ARR_F(env.reloads);
	del_set(env.spills);

	return ! env.problem_found;
}

518
519
520
521
522
523
524
525
526
527
528


//---------------------------------------------------------------------------



/**
 * Check, if two values interfere.
 * @param a The first value.
 * @param b The second value.
 * @return 1, if a and b interfere, 0 if not.
529
 */
530
static int my_values_interfere(const ir_node *a, const ir_node *b) {
531
532
	const ir_edge_t *edge;
	ir_node *bb;
533
534
	int a2b = value_dominates(a, b);
	int b2a = value_dominates(b, a);
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567

	/* If there is no dominance relation, they do not interfere. */
	if(!a2b && !b2a)
		return 0;

	/*
	 * Adjust a and b so, that a dominates b if
	 * a dominates b or vice versa.
	 */
	if(b2a) {
		const ir_node *t = a;
		a = b;
		b = t;
	}

	bb = get_nodes_block(b);

	/*
	 * Look at all usages of a.
	 * If there's one usage of a in the block of b, then
	 * we check, if this use is dominated by b, if that's true
	 * a and b interfere. Note that b must strictly dominate the user,
	 * since if b is the last user of in the block, b and a do not
	 * interfere.
	 * Uses of a not in b's block can be disobeyed, because the
	 * check for a being live at the end of b's block is already
	 * performed.
	 */
	foreach_out_edge(a, edge) {
		const ir_node *user = get_edge_src_irn(edge);
		if(b == user)
			continue;

568
569
570
		if(get_irn_opcode(user) == iro_End)
			continue;

571
572
573
		// in case of phi arguments we compare with the block the value comes from
		if(is_Phi(user)) {
			ir_node *phiblock = get_nodes_block(user);
574
575
			if(phiblock == bb)
				continue;
576
577
578
			user = get_irn_n(phiblock, get_edge_src_pos(edge));
		}

579
		if(value_dominates(b, user))
580
581
582
583
584
			return 1;
	}

	return 0;
}
585
586
587
588
589
590
591
592
593
594
595
596
597
598



//---------------------------------------------------------------------------



typedef struct _be_verify_register_allocation_env_t {
	const arch_env_t *arch_env;
	ir_graph *irg;
	be_lv_t *lv;
	int problem_found;
} be_verify_register_allocation_env_t;

599
static void check_register_constraints(ir_node *node, be_verify_register_allocation_env_t *env) {
600
	const arch_env_t      *arch_env = env->arch_env;
601
	const arch_register_t *reg;
602
	int                   i, arity;
603

604
605
	/* verify output register */
	if (arch_get_irn_reg_class(arch_env, node, -1) != NULL) {
606
		reg = arch_get_irn_register(arch_env, node);
607
		if (reg == NULL) {
608
609
610
611
			ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
					node, get_nodes_block(node), get_irg_dump_name(env->irg));
			env->problem_found = 1;
		}
612
		else if (! arch_register_type_is(reg, joker) && !arch_reg_is_allocatable(arch_env, node, -1, reg)) {
613
614
615
616
617
618
			ir_fprintf(stderr, "Verify warning: Register %s assigned as output of %+F not allowed (register constraint) in block %+F(%s)\n",
					reg->name, node, get_nodes_block(node), get_irg_dump_name(env->irg));
			env->problem_found = 1;
		}
	}

619
	/* verify input register */
620
	arity = get_irn_arity(node);
621
	for (i = 0; i < arity; ++i) {
622
623
		ir_node *pred = get_irn_n(node, i);

Christian Würdig's avatar
Christian Würdig committed
624
625
626
627
628
629
630
		if (is_Bad(pred)) {
			ir_fprintf(stderr, "Verify warning: %+F in block %+F(%s) has Bad as input %d\n",
				node, get_nodes_block(node), get_irg_dump_name(env->irg), i);
			env->problem_found = 1;
			continue;
		}

631
		if (arch_get_irn_reg_class(arch_env, node, i) == NULL)
632
633
634
			continue;

		reg = arch_get_irn_register(arch_env, pred);
635
		if (reg == NULL) {
636
637
638
639
640
			ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) should have a register assigned\n",
			           pred, get_nodes_block(pred), get_irg_dump_name(env->irg));
			env->problem_found = 1;
			continue;
		}
641
		else if (! arch_register_type_is(reg, joker) && ! arch_reg_is_allocatable(arch_env, node, i, reg)) {
642
643
644
645
646
647
648
			ir_fprintf(stderr, "Verify warning: Register %s as input %d of %+F not allowed (register constraint) in block %+F(%s)\n",
			           reg->name, i, node, get_nodes_block(node), get_irg_dump_name(env->irg));
			env->problem_found = 1;
		}
	}
}

649
650
651
652
static void check_register_allocation(be_verify_register_allocation_env_t *env,
                                      const arch_register_class_t *regclass, pset *nodes) {
	const arch_env_t *arch_env = env->arch_env;
	ir_node *node;
653
	const arch_register_t *reg = NULL;
654
	int fail = 0;
655
656
657
658
659
660
661
662
663

	bitset_t *registers = bitset_alloca(arch_register_class_n_regs(regclass));

	foreach_pset(nodes, node) {
		if(arch_get_irn_reg_class(arch_env, node, -1) != regclass)
			continue;

		reg = arch_get_irn_register(arch_env, node);
		if(bitset_is_set(registers, reg->index)) {
664
665
666
			pset_break(nodes);
			fail = 1;
			break;
667
668
669
		}
		bitset_set(registers, reg->index);
	}
670
671
672
673
674
675
676
677
678
679
680
	if (fail) {
		ir_fprintf(stderr, "Verify warning: Register %s assigned more than once in block %+F(%s)\n",
			       reg->name, get_nodes_block(node), get_irg_dump_name(env->irg));
		env->problem_found = 1;

		foreach_pset(nodes, node) {
			if (arch_get_irn_register(arch_env, node) == reg) {
				ir_fprintf(stderr, "  at node %+F\n", node);
			}
		}
	}
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
}

static void verify_block_register_allocation(ir_node *block, void *data) {
	be_verify_register_allocation_env_t *env = data;
	const arch_env_t *arch_env = env->arch_env;
	const arch_isa_t *isa = arch_env->isa;
	int i, nregclasses;

	nregclasses = arch_isa_get_n_reg_class(isa);
	for (i = 0; i < nregclasses; ++i) {
		const arch_register_class_t *regclass = arch_isa_get_reg_class(isa, i);
		ir_node *node;
		pset *live_nodes = pset_new_ptr_default();

		be_liveness_end_of_block(env->lv, env->arch_env, regclass, block, live_nodes);
		check_register_allocation(env, regclass, live_nodes);

		sched_foreach_reverse(block, node) {
			if (is_Phi(node))
				break;

			be_liveness_transfer(env->arch_env, regclass, node, live_nodes);
			check_register_allocation(env, regclass, live_nodes);
704
			check_register_constraints(node, env);
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
		}

		del_pset(live_nodes);
	}
}

int be_verify_register_allocation(const arch_env_t *arch_env, ir_graph *irg) {
	be_verify_register_allocation_env_t env;

	env.arch_env = arch_env;
	env.irg = irg;
	env.lv = be_liveness(irg);
	env.problem_found = 0;

	irg_block_walk_graph(irg, verify_block_register_allocation, NULL, &env);

	be_liveness_free(env.lv);

	return !env.problem_found;
}
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776



//---------------------------------------------------------------------------



typedef struct _verify_out_dead_nodes_env {
	ir_graph *irg;
	bitset_t *reachable;
	bitset_t *visited;
	int problem_found;
} verify_out_dead_nodes_env;

static void check_out_edges(ir_node *node, verify_out_dead_nodes_env *env) {
	const ir_edge_t* edge;

	foreach_out_edge(node, edge) {
		ir_node* src = get_edge_src_irn(edge);

		if(!bitset_is_set(env->reachable, get_irn_idx(src))) {
			ir_fprintf(stderr, "Verify warning: Node %+F in block %+F(%s) only reachable through out edges from %+F\n",
			           src, get_nodes_block(src), get_irg_dump_name(env->irg), node);
			env->problem_found = 1;
		}

		if(!bitset_is_set(env->visited, get_irn_idx(src))) {
			bitset_set(env->visited, get_irn_idx(src));
			if(!is_Block(src))
				check_out_edges(src, env);
		}
	}
}

static void set_reachable(ir_node *node, void* data)
{
	bitset_t* reachable = data;
	bitset_set(reachable, get_irn_idx(node));
}

int be_verify_out_edges(ir_graph *irg) {
	verify_out_dead_nodes_env env;
	env.irg = irg;
	env.reachable = bitset_alloca(get_irg_last_idx(irg));
	env.visited = bitset_alloca(get_irg_last_idx(irg));
	env.problem_found = 0;

	irg_walk_graph(irg, set_reachable, NULL, env.reachable);
	check_out_edges(get_irg_start(irg), &env);

	return !env.problem_found;
}