2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Various verify routines that check a scheduled graph for correctness.
23 * @author Matthias Braun
27 #ifndef FIRM_BE_BEVERIFY_H
28 #define FIRM_BE_BEVERIFY_H
37 * Verifies, that the register pressure for a given register class doesn't
38 * exceed the limit of available registers.
40 * @param irg The irg to check.
41 * @param cls The register class to check.
42 * @return 1 if the pressure is valid, 0 otherwise.
44 int be_verify_register_pressure(ir_graph *irg,
45 const arch_register_class_t* cls);
48 * Does some sanity checks on the schedule.
50 * @param irg The irg to check
51 * @return 1 if the schedule is valid, 0 otherwise
53 int be_verify_schedule(ir_graph *irg);
58 * @param irg The irg to check
59 * @return 1 if spillslots are valid, 0 otherwise
61 int be_verify_spillslots(ir_graph *irg);
64 * Verify register allocation: Checks that no 2 live nodes have the same
65 * register assigned, also checks that each scheduled node has a register
68 * @param irg The graph to check
69 * @return true if verify succeeded, false otherwise
71 bool be_verify_register_allocation(ir_graph *irg);