beverify.c 17.5 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.
 */
93
int be_verify_register_pressure(const arch_env_t *arch_env, 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
98
99
	env.irg                 = irg;
	env.arch_env            = arch_env;
	env.cls                 = cls;
100
	env.registers_available = arch_count_non_ignore_regs(arch_env, cls);
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
	pset *uses = pset_new_ptr_default();
125
126

	/*
127
128
129
130
	 * 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
131
	 */
132
133
134
135
136
	sched_foreach(block, node) {
		int i, arity;

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

146
147
		// 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
148
149
150
			/* 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",
151
					node, block, get_irg_dump_name(env->irg));
152
153
154
				env->problem_found = 1;
			}
			cfchange_found = 1;
Christian Würdig's avatar
Christian Würdig committed
155
		} else if (cfchange_found) {
156
157
158
159
160
161
162
163
164
165
			// 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--;
				}
166
167
			}
		}
168
169
170
171
172
173
174

		// 3. Check for uses
		if(pset_find_ptr(uses, node)) {
			ir_fprintf(stderr, "Verify Warning: Value %+F used before it was defined in block %+F (%s)\n",
				node, block, get_irg_dump_name(env->irg));
			env->problem_found = 1;
		}
175
176
177
178
		if(!is_Phi(node)) {
			for(i = 0, arity = get_irn_arity(node); i < arity; ++i) {
				pset_insert_ptr(uses, get_irn_n(node, i));
			}
179
		}
180
	}
181
	del_pset(uses);
182

183
	/* check that all delay branches are filled (at least with NOPs) */
Christian Würdig's avatar
Christian Würdig committed
184
	if (cfchange_found && delay_branches != 0) {
185
		ir_fprintf(stderr, "Verify warning: Not all delay slots filled after jump (%d/%d) in block %+F (%s)\n",
186
			block, get_irg_dump_name(env->irg));
187
188
189
		env->problem_found = 1;
	}
}
190

191
static int should_be_scheduled(ir_node *node) {
192
193
194
	if(is_Block(node))
		return -1;

195
	if(get_irn_mode(node) == mode_M) {
196
197
198
		if(is_Proj(node))
			return -1;
		if(is_Phi(node) || is_Sync(node) || get_irn_opcode(node) == iro_Pin)
199
200
201
202
			return 0;
	}
	if(is_Proj(node) && get_irn_mode(node) == mode_X)
		return 0;
203
	if(be_is_Keep(node) && get_irn_opcode(get_nodes_block(node)) == iro_Bad)
204
205
		return 0;

206
207
208
209
210
211
212
213
214
	switch(get_irn_opcode(node)) {
	case iro_End:
	case iro_NoMem:
	case iro_Bad:
		return 0;
	default:
		break;
	}

215
216
217
218
219
220
221
222
	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);
223
224
	if(should_be == -1)
		return;
225
226
227

	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",
228
			node, get_nodes_block(node), get_irg_dump_name(env->irg), should_be ? "" : " not");
229
230
231
232
		env->problem_found = 1;
	}
}

Christian Würdig's avatar
Christian Würdig committed
233
234
235
/**
 * Start a walk over the irg and check schedule.
 */
236
int be_verify_schedule(ir_graph *irg)
237
238
239
240
{
	be_verify_schedule_env_t env;

	env.problem_found = 0;
Christian Würdig's avatar
Christian Würdig committed
241
	env.irg           = irg;
242
243

	irg_block_walk_graph(irg, verify_schedule_walker, NULL, &env);
244
245
	// check if all nodes are scheduled
	irg_walk_graph(irg, check_schedule, NULL, &env);
246

Christian Würdig's avatar
Christian Würdig committed
247
	return ! env.problem_found;
248
}
249

250
251


252
253
254
//---------------------------------------------------------------------------


255
256
257
258
259
260
261

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

typedef struct {
262
	be_lv_t *lv;
263
264
265
266
267
268
269
270
271
272
273
274
	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;
}

275
276
277
278
279
280
281
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));
}

282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
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;
}

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

299
300
301
302
303
304
305
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));
	}
}

306
307
static void collect_spill(be_verify_spillslots_env_t *env, ir_node *node, ir_node *reload, entity* ent) {
	entity *spillent = be_get_frame_entity(node);
308
	check_entity(env, node, spillent);
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
	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);
332
	check_entity(env, memperm, spillent);
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
	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);

348
349
	for(i = 0, arity = be_get_MemPerm_entity_arity(memperm); i < arity; ++i) {
		ir_node* arg = get_irn_n(memperm, i + 1);
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
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
		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;

	if(be_is_Reload(node)) {
		ir_node *spill = get_irn_n(node, be_pos_Reload_mem);
		entity* ent = be_get_frame_entity(node);
403
		check_entity(env, node, ent);
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429

		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;

430
			if(my_values_interfere(sp1->spill, sp2->spill)) {
431
432
433
434
				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;
435
436
				my_values_interfere(sp1->spill, sp2->spill);
				printf("Intf: %d\n", values_interfere(env->lv, sp1->spill, sp2->spill));
437
438
439
440
441
			}
		}
	}
}

442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
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)) {
			entity *ent = be_get_frame_entity(node);
			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));
		}
	}
}

459
460
461
462
463
464
465
466
int be_verify_spillslots(ir_graph *irg)
{
	be_verify_spillslots_env_t env;

	env.irg = irg;
	env.spills = new_set(cmp_spill, 10);
	env.reloads = NEW_ARR_F(ir_node*, 0);
	env.problem_found = 0;
467
	env.lv = be_liveness(irg);
468
469

	irg_walk_graph(irg, collect_spills_walker, NULL, &env);
470
	irg_walk_graph(irg, check_lonely_spills, NULL, &env);
471
472
473

	check_spillslot_interference(&env);

474
	be_liveness_free(env.lv);
475
476
477
478
479
480
	DEL_ARR_F(env.reloads);
	del_set(env.spills);

	return ! env.problem_found;
}

481
482
483
484
485
486
487
488
489
490
491


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



/**
 * 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.
492
 */
493
static int my_values_interfere(const ir_node *a, const ir_node *b) {
494
495
	const ir_edge_t *edge;
	ir_node *bb;
496
497
	int a2b = value_dominates(a, b);
	int b2a = value_dominates(b, a);
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530

	/* 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;

531
532
533
		if(get_irn_opcode(user) == iro_End)
			continue;

534
535
536
		// 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);
537
538
			if(phiblock == bb)
				continue;
539
540
541
			user = get_irn_n(phiblock, get_edge_src_pos(edge));
		}

542
		if(value_dominates(b, user))
543
544
545
546
547
			return 1;
	}

	return 0;
}
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631



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



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;

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;

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

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

		reg = arch_get_irn_register(arch_env, node);
		if(reg == NULL) {
			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;
			continue;
		}
		if(bitset_is_set(registers, reg->index)) {
			ir_fprintf(stderr, "Verify warning: Register %s assigned more than once at node %+F in block %+F(%s)\n",
			           reg->name, node, get_nodes_block(node), get_irg_dump_name(env->irg));
			env->problem_found = 1;
			continue;
		}
		bitset_set(registers, reg->index);
	}
}

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);
		}

		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;
}