/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
- *
* 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.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
static int must_be_scheduled(const ir_node* const irn)
{
- return !is_Proj(irn) && !is_Sync(irn);
+ return !is_Proj(irn) && !arch_irn_is(irn, not_scheduled);
}
if (mode == mode_T)
return 1;
- if (arch_get_irn_register_req(irn)->type & arch_register_req_type_ignore)
+ arch_register_req_t const *const req = arch_get_irn_register_req(irn);
+ if (arch_register_req_is(req, ignore))
return 0;
return 1;
for (i = 0; i < arity; ++i) {
ir_node* pred = get_irn_n(irn, i);
- if (is_Phi(irn) || get_irn_mode(pred) == mode_M || is_Block(pred)) {
+ if (is_Phi(irn) || get_irn_mode(pred) == mode_M) {
cost = 0;
} else if (get_nodes_block(pred) != block) {
cost = 1;
mode = get_irn_mode(op);
if (mode == mode_M)
continue;
- if (arch_get_irn_flags(op) & arch_irn_flags_not_scheduled)
- continue;
- if (mode != mode_T && arch_irn_is_ignore(op))
+ if (arch_irn_is_ignore(op))
continue;
cost = MAX(fc->costs[i].cost + n_op_res, cost);
last = op;
#if defined NORMAL_DBG
ir_fprintf(stderr, "cost walking node %+F\n", irn);
#endif
- if (is_Block(irn)) return;
+ if (is_Block(irn)) {
+ ir_node **const roots = NEW_ARR_F(ir_node*, 0);
+ set_irn_link(irn, roots);
+ return;
+ }
if (!must_be_scheduled(irn)) return;
normal_tree_cost(irn, inst);
}
(void)env;
- if (is_Block(irn)) return;
if (!must_be_scheduled(irn)) return;
is_root = be_is_Keep(irn) || !get_irn_fc(irn)->no_root;
if (is_root) {
ir_node* block = get_nodes_block(irn);
ir_node** roots = (ir_node**)get_irn_link(block);
- if (roots == NULL) {
- roots = NEW_ARR_F(ir_node*, 0);
- }
ARR_APP1(ir_node*, roots, irn);
set_irn_link(block, roots);
}
static ir_node** sched_node(ir_node** sched, ir_node* irn)
{
if (irn_visited_else_mark(irn)) return sched;
- if (is_End(irn)) return sched;
if (!is_Phi(irn) && !be_is_Keep(irn)) {
ir_node* block = get_nodes_block(irn);
{
ir_node** roots = (ir_node**)get_irn_link(block);
ir_heights_t* heights = (ir_heights_t*)env;
- int root_count;
irn_cost_pair* root_costs;
int i;
ir_node** sched;
ir_fprintf(stderr, "sched walking block %+F\n", block);
#endif
- if (roots == NULL) {
+ int const root_count = ARR_LEN(roots);
+ if (root_count == 0) {
#if defined NORMAL_DBG
fprintf(stderr, "has no roots\n");
#endif
return;
}
- root_count = ARR_LEN(roots);
NEW_ARR_A(irn_cost_pair, root_costs, root_count);
for (i = 0; i < root_count; ++i) {
root_costs[i].irn = roots[i];