for (P = env->dbg_list; P != NULL; P = P->dbg_next) {
check_partition(P);
list_for_each_entry(node_t, node, &P->Follower, node_list) {
for (P = env->dbg_list; P != NULL; P = P->dbg_next) {
check_partition(P);
list_for_each_entry(node_t, node, &P->Follower, node_list) {
*/
static INLINE void add_to_worklist(partition_t *X, environment_t *env) {
assert(X->on_worklist == 0);
*/
static INLINE void add_to_worklist(partition_t *X, environment_t *env) {
assert(X->on_worklist == 0);
/* check if some nodes will make the leader -> follower transition */
list_for_each_entry_safe(node_t, y, tmp, &Y->Leader, node_list) {
if (y->type.tv != tarval_top && ! is_con(y->type)) {
/* check if some nodes will make the leader -> follower transition */
list_for_each_entry_safe(node_t, y, tmp, &Y->Leader, node_list) {
if (y->type.tv != tarval_top && ! is_con(y->type)) {
} /* set_compute_functions */
static int dump_partition_hook(FILE *F, ir_node *n, ir_node *local) {
} /* set_compute_functions */
static int dump_partition_hook(FILE *F, ir_node *n, ir_node *local) {
ir_node *irn = local != NULL ? local : n;
node_t *node = get_irn_node(irn);
ir_fprintf(F, "info2 : \"partition %u type %+F\"\n", node->part->nr, node->type);
return 1;
ir_node *irn = local != NULL ? local : n;
node_t *node = get_irn_node(irn);
ir_fprintf(F, "info2 : \"partition %u type %+F\"\n", node->part->nr, node->type);
return 1;