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 Cliff Click's Combined Analysis/Optimization
23 * @author Michael Beck
26 * Note further that we use the terminology from Click's work here, which is different
27 * in some cases from Firm terminology. Especially, Click's type is a
28 * Firm tarval/entity, nevertheless we call it type here for "maximum compatibility".
36 #include "iroptimize.h"
44 #include "irgraph_t.h"
59 /* define this to check that all type translations are monotone */
60 #define VERIFY_MONOTONE
62 /* define this to check the consistency of partitions */
63 #define CHECK_PARTITIONS
65 /* define this to disable followers (may be buggy) */
68 typedef struct node_t node_t;
69 typedef struct partition_t partition_t;
70 typedef struct opcode_key_t opcode_key_t;
71 typedef struct listmap_entry_t listmap_entry_t;
73 /** The type of the compute function. */
74 typedef void (*compute_func)(node_t *node);
80 ir_opcode code; /**< The Firm opcode. */
81 ir_mode *mode; /**< The mode of all nodes in the partition. */
82 int arity; /**< The arity of this opcode (needed for Phi etc. */
84 long proj; /**< For Proj nodes, its proj number */
85 ir_entity *ent; /**< For Sel Nodes, its entity */
90 * An entry in the list_map.
92 struct listmap_entry_t {
93 void *id; /**< The id. */
94 node_t *list; /**< The associated list for this id. */
95 listmap_entry_t *next; /**< Link to the next entry in the map. */
98 /** We must map id's to lists. */
99 typedef struct listmap_t {
100 set *map; /**< Map id's to listmap_entry_t's */
101 listmap_entry_t *values; /**< List of all values in the map. */
105 * A lattice element. Because we handle constants and symbolic constants different, we
106 * have to use this union.
117 ir_node *node; /**< The IR-node itself. */
118 list_head node_list; /**< Double-linked list of leader/follower entries. */
119 list_head cprop_list; /**< Double-linked partition.cprop list. */
120 partition_t *part; /**< points to the partition this node belongs to */
121 node_t *next; /**< Next node on local list (partition.touched, fallen). */
122 node_t *race_next; /**< Next node on race list. */
123 lattice_elem_t type; /**< The associated lattice element "type". */
124 int max_user_input; /**< Maximum input number of Def-Use edges. */
125 int next_edge; /**< Index of the next Def-Use edge to use. */
126 int n_followers; /**< Number of Follower in the outs set. */
127 unsigned on_touched:1; /**< Set, if this node is on the partition.touched set. */
128 unsigned on_cprop:1; /**< Set, if this node is on the partition.cprop list. */
129 unsigned on_fallen:1; /**< Set, if this node is on the fallen list. */
130 unsigned is_follower:1; /**< Set, if this node is a follower. */
131 unsigned by_all_const:1; /**< Set, if this node was once evaluated by all constants. */
132 unsigned flagged:2; /**< 2 Bits, set if this node was visited by race 1 or 2. */
136 * A partition containing congruent nodes.
139 list_head Leader; /**< The head of partition Leader node list. */
140 list_head Follower; /**< The head of partition Follower node list. */
141 list_head cprop; /**< The head of partition.cprop list. */
142 partition_t *wl_next; /**< Next entry in the work list if any. */
143 partition_t *touched_next; /**< Points to the next partition in the touched set. */
144 partition_t *cprop_next; /**< Points to the next partition in the cprop list. */
145 partition_t *split_next; /**< Points to the next partition in the list that must be split by split_by(). */
146 node_t *touched; /**< The partition.touched set of this partition. */
147 unsigned n_leader; /**< Number of entries in this partition.Leader. */
148 unsigned n_touched; /**< Number of entries in the partition.touched. */
149 int max_user_inputs; /**< Maximum number of user inputs of all entries. */
150 unsigned on_worklist:1; /**< Set, if this partition is in the work list. */
151 unsigned on_touched:1; /**< Set, if this partition is on the touched set. */
152 unsigned on_cprop:1; /**< Set, if this partition is on the cprop list. */
153 unsigned type_is_T_or_C:1;/**< Set, if all nodes in this partition have type Top or Constant. */
155 partition_t *dbg_next; /**< Link all partitions for debugging */
156 unsigned nr; /**< A unique number for (what-)mapping, >0. */
160 typedef struct environment_t {
161 struct obstack obst; /**< obstack to allocate data structures. */
162 partition_t *worklist; /**< The work list. */
163 partition_t *cprop; /**< The constant propagation list. */
164 partition_t *touched; /**< the touched set. */
165 partition_t *initial; /**< The initial partition. */
166 set *opcode2id_map; /**< The opcodeMode->id map. */
167 pmap *type2id_map; /**< The type->id map. */
168 int end_idx; /**< -1 for local and 0 for global congruences. */
169 int lambda_input; /**< Captured argument for lambda_partition(). */
170 int modified; /**< Set, if the graph was modified. */
172 partition_t *dbg_list; /**< List of all partitions. */
176 /** Type of the what function. */
177 typedef void *(*what_func)(const node_t *node, environment_t *env);
179 #define get_irn_node(follower) ((node_t *)get_irn_link(follower))
180 #define set_irn_node(follower, node) set_irn_link(follower, node)
182 /* we do NOT use tarval_unreachable here, instead we use Top for this purpose */
183 #undef tarval_unreachable
184 #define tarval_unreachable tarval_top
187 /** The debug module handle. */
188 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
190 /** Next partition number. */
191 DEBUG_ONLY(static unsigned part_nr = 0);
194 static node_t *identity(node_t *node);
196 #ifdef CHECK_PARTITIONS
200 static void check_partition(const partition_t *T) {
204 list_for_each_entry(node_t, node, &T->Leader, node_list) {
205 assert(node->is_follower == 0);
206 assert(node->flagged == 0);
207 assert(node->part == T);
210 assert(n == T->n_leader);
212 list_for_each_entry(node_t, node, &T->Follower, node_list) {
213 assert(node->is_follower == 1);
214 assert(node->flagged == 0);
215 assert(node->part == T);
217 } /* check_partition */
219 static void check_all_partitions(environment_t *env) {
223 for (P = env->dbg_list; P != NULL; P = P->dbg_next) {
225 list_for_each_entry(node_t, node, &P->Follower, node_list) {
226 node_t *leader = identity(node);
228 assert(leader != node && leader->part == node->part);
236 static void do_check_list(const node_t *list, int ofs, const partition_t *Z) {
239 #define NEXT(e) *((const node_t **)((char *)(e) + (ofs)))
240 for (e = list; e != NULL; e = NEXT(e)) {
241 assert(e->part == Z);
244 } /* ido_check_list */
247 * Check a local list.
249 static void check_list(const node_t *list, const partition_t *Z) {
250 do_check_list(list, offsetof(node_t, next), Z);
254 #define check_partition(T)
255 #define check_list(list, Z)
256 #define check_all_partitions(env)
257 #endif /* CHECK_PARTITIONS */
260 static INLINE lattice_elem_t get_partition_type(const partition_t *X);
263 * Dump partition to output.
265 static void dump_partition(const char *msg, const partition_t *part) {
268 lattice_elem_t type = get_partition_type(part);
270 DB((dbg, LEVEL_2, "%s part%u%s (%u, %+F) {\n ",
271 msg, part->nr, part->type_is_T_or_C ? "*" : "",
272 part->n_leader, type));
273 list_for_each_entry(node_t, node, &part->Leader, node_list) {
274 DB((dbg, LEVEL_2, "%s%+F", first ? "" : ", ", node->node));
277 if (! list_empty(&part->Follower)) {
278 DB((dbg, LEVEL_2, "\n---\n "));
280 list_for_each_entry(node_t, node, &part->Follower, node_list) {
281 DB((dbg, LEVEL_2, "%s%+F", first ? "" : ", ", node->node));
285 DB((dbg, LEVEL_2, "\n}\n"));
286 } /* dump_partition */
291 static void do_dump_list(const char *msg, const node_t *node, int ofs) {
295 #define GET_LINK(p, ofs) *((const node_t **)((char *)(p) + (ofs)))
297 DB((dbg, LEVEL_3, "%s = {\n ", msg));
298 for (p = node; p != NULL; p = GET_LINK(p, ofs)) {
299 DB((dbg, LEVEL_3, "%s%+F", first ? "" : ", ", p->node));
302 DB((dbg, LEVEL_3, "\n}\n"));
310 static void dump_race_list(const char *msg, const node_t *list) {
311 do_dump_list(msg, list, offsetof(node_t, race_next));
315 * Dumps a local list.
317 static void dump_list(const char *msg, const node_t *list) {
318 do_dump_list(msg, list, offsetof(node_t, next));
322 * Dump all partitions.
324 static void dump_all_partitions(const environment_t *env) {
325 const partition_t *P;
327 DB((dbg, LEVEL_2, "All partitions\n===============\n"));
328 for (P = env->dbg_list; P != NULL; P = P->dbg_next)
329 dump_partition("", P);
333 #define dump_partition(msg, part)
334 #define dump_race_list(msg, list)
335 #define dump_list(msg, list)
336 #define dump_all_partitions(env)
339 #if defined(VERIFY_MONOTONE) && defined (DEBUG_libfirm)
341 * Verify that a type transition is monotone
343 static void verify_type(const lattice_elem_t old_type, const lattice_elem_t new_type) {
344 if (old_type.tv == new_type.tv) {
348 if (old_type.tv == tarval_top) {
349 /* from Top down-to is always allowed */
352 if (old_type.tv == tarval_reachable) {
353 panic("verify_type(): wrong translation from %+F to %+F", old_type, new_type);
355 if (new_type.tv == tarval_bottom || new_type.tv == tarval_reachable) {
359 panic("verify_type(): wrong translation from %+F to %+F", old_type, new_type);
362 #define verify_type(old_type, new_type)
366 * Compare two pointer values of a listmap.
368 static int listmap_cmp_ptr(const void *elt, const void *key, size_t size) {
369 const listmap_entry_t *e1 = elt;
370 const listmap_entry_t *e2 = key;
373 return e1->id != e2->id;
374 } /* listmap_cmp_ptr */
377 * Initializes a listmap.
379 * @param map the listmap
381 static void listmap_init(listmap_t *map) {
382 map->map = new_set(listmap_cmp_ptr, 16);
387 * Terminates a listmap.
389 * @param map the listmap
391 static void listmap_term(listmap_t *map) {
396 * Return the associated listmap entry for a given id.
398 * @param map the listmap
399 * @param id the id to search for
401 * @return the asociated listmap entry for the given id
403 static listmap_entry_t *listmap_find(listmap_t *map, void *id) {
404 listmap_entry_t key, *entry;
409 entry = set_insert(map->map, &key, sizeof(key), HASH_PTR(id));
411 if (entry->list == NULL) {
412 /* a new entry, put into the list */
413 entry->next = map->values;
420 * Calculate the hash value for an opcode map entry.
422 * @param entry an opcode map entry
424 * @return a hash value for the given opcode map entry
426 static unsigned opcode_hash(const opcode_key_t *entry) {
427 return (entry->mode - (ir_mode *)0) * 9 + entry->code + entry->u.proj * 3 + HASH_PTR(entry->u.ent);
431 * Compare two entries in the opcode map.
433 static int cmp_opcode(const void *elt, const void *key, size_t size) {
434 const opcode_key_t *o1 = elt;
435 const opcode_key_t *o2 = key;
438 return o1->code != o2->code || o1->mode != o2->mode ||
439 o1->arity != o2->arity ||
440 o1->u.proj != o2->u.proj || o1->u.ent != o2->u.ent;
444 * Compare two Def-Use edges for input position.
446 static int cmp_def_use_edge(const void *a, const void *b) {
447 const ir_def_use_edge *ea = a;
448 const ir_def_use_edge *eb = b;
450 /* no overrun, because range is [-1, MAXINT] */
451 return ea->pos - eb->pos;
452 } /* cmp_def_use_edge */
455 * We need the Def-Use edges sorted.
457 static void sort_irn_outs(node_t *node) {
458 ir_node *irn = node->node;
459 int n_outs = get_irn_n_outs(irn);
462 qsort(&irn->out[1], n_outs, sizeof(irn->out[0]), cmp_def_use_edge);
464 node->max_user_input = irn->out[n_outs].pos;
465 } /* sort_irn_outs */
468 * Return the type of a node.
470 * @param irn an IR-node
472 * @return the associated type of this node
474 static INLINE lattice_elem_t get_node_type(const ir_node *irn) {
475 return get_irn_node(irn)->type;
476 } /* get_node_type */
479 * Return the tarval of a node.
481 * @param irn an IR-node
483 * @return the associated type of this node
485 static INLINE tarval *get_node_tarval(const ir_node *irn) {
486 lattice_elem_t type = get_node_type(irn);
488 if (is_tarval(type.tv))
490 return tarval_bottom;
491 } /* get_node_type */
494 * Add a partition to the worklist.
496 static INLINE void add_to_worklist(partition_t *X, environment_t *env) {
497 assert(X->on_worklist == 0);
498 X->wl_next = env->worklist;
501 } /* add_to_worklist */
504 * Create a new empty partition.
506 * @param env the environment
508 * @return a newly allocated partition
510 static INLINE partition_t *new_partition(environment_t *env) {
511 partition_t *part = obstack_alloc(&env->obst, sizeof(*part));
513 INIT_LIST_HEAD(&part->Leader);
514 INIT_LIST_HEAD(&part->Follower);
515 INIT_LIST_HEAD(&part->cprop);
516 part->wl_next = NULL;
517 part->touched_next = NULL;
518 part->cprop_next = NULL;
519 part->split_next = NULL;
520 part->touched = NULL;
523 part->max_user_inputs = 0;
524 part->on_worklist = 0;
525 part->on_touched = 0;
527 part->type_is_T_or_C = 0;
529 part->dbg_next = env->dbg_list;
530 env->dbg_list = part;
531 part->nr = part_nr++;
535 } /* new_partition */
538 * Get the first node from a partition.
540 static INLINE node_t *get_first_node(const partition_t *X) {
541 return list_entry(X->Leader.next, node_t, node_list);
542 } /* get_first_node */
545 * Return the type of a partition (assuming partition is non-empty and
546 * all elements have the same type).
548 * @param X a partition
550 * @return the type of the first element of the partition
552 static INLINE lattice_elem_t get_partition_type(const partition_t *X) {
553 const node_t *first = get_first_node(X);
555 } /* get_partition_type */
558 * Creates a partition node for the given IR-node and place it
559 * into the given partition.
561 * @param irn an IR-node
562 * @param part a partition to place the node in
563 * @param env the environment
565 * @return the created node
567 static node_t *create_partition_node(ir_node *irn, partition_t *part, environment_t *env) {
568 /* create a partition node and place it in the partition */
569 node_t *node = obstack_alloc(&env->obst, sizeof(*node));
571 INIT_LIST_HEAD(&node->node_list);
572 INIT_LIST_HEAD(&node->cprop_list);
576 node->race_next = NULL;
577 node->type.tv = tarval_top;
578 node->max_user_input = 0;
580 node->n_followers = 0;
581 node->on_touched = 0;
584 node->is_follower = 0;
585 node->by_all_const = 0;
587 set_irn_node(irn, node);
589 list_add_tail(&node->node_list, &part->Leader);
593 } /* create_partition_node */
596 * Pre-Walker, init all Block-Phi lists.
598 static void init_block_phis(ir_node *irn, void *env) {
602 set_Block_phis(irn, NULL);
604 } /* init_block_phis */
607 * Post-Walker, initialize all Nodes' type to U or top and place
608 * all nodes into the TOP partition.
610 static void create_initial_partitions(ir_node *irn, void *ctx) {
611 environment_t *env = ctx;
612 partition_t *part = env->initial;
615 node = create_partition_node(irn, part, env);
617 if (node->max_user_input > part->max_user_inputs)
618 part->max_user_inputs = node->max_user_input;
621 add_Block_phi(get_nodes_block(irn), irn);
623 } /* create_initial_partitions */
626 * Add a node to the entry.partition.touched set and
627 * node->partition to the touched set if not already there.
630 * @param env the environment
632 static INLINE void add_to_touched(node_t *y, environment_t *env) {
633 if (y->on_touched == 0) {
634 partition_t *part = y->part;
636 y->next = part->touched;
641 if (part->on_touched == 0) {
642 part->touched_next = env->touched;
644 part->on_touched = 1;
647 check_list(part->touched, part);
649 } /* add_to_touched */
652 * Place a node on the cprop list.
655 * @param env the environment
657 static void add_to_cprop(node_t *y, environment_t *env) {
658 /* Add y to y.partition.cprop. */
659 if (y->on_cprop == 0) {
660 partition_t *Y = y->part;
662 list_add_tail(&y->cprop_list, &Y->cprop);
665 DB((dbg, LEVEL_3, "Add %+F to part%u.cprop\n", y->node, Y->nr));
667 /* place its partition on the cprop list */
668 if (Y->on_cprop == 0) {
669 Y->cprop_next = env->cprop;
674 if (get_irn_mode(y->node) == mode_T) {
675 /* mode_T nodes always produce tarval_bottom, so we must explicitly
676 add it's Proj's to get constant evaluation to work */
679 for (i = get_irn_n_outs(y->node) - 1; i >= 0; --i) {
680 node_t *proj = get_irn_node(get_irn_out(y->node, i));
682 add_to_cprop(proj, env);
684 } else if (is_Block(y->node)) {
685 /* Due to the way we handle Phi's, we must place all Phis of a block on the list
686 * if someone placed the block. The Block is only placed if the reachability
687 * changes, and this must be re-evaluated in compute_Phi(). */
689 for (phi = get_Block_phis(y->node); phi != NULL; phi = get_Phi_next(phi)) {
690 node_t *p = get_irn_node(phi);
691 add_to_cprop(p, env);
697 * Update the worklist: If Z is on worklist then add Z' to worklist.
698 * Else add the smaller of Z and Z' to worklist.
700 * @param Z the Z partition
701 * @param Z_prime the Z' partition, a previous part of Z
702 * @param env the environment
704 static void update_worklist(partition_t *Z, partition_t *Z_prime, environment_t *env) {
705 if (Z->on_worklist || Z_prime->n_leader < Z->n_leader) {
706 add_to_worklist(Z_prime, env);
708 add_to_worklist(Z, env);
710 } /* update_worklist */
713 * Make all inputs to x no longer be F.def_use edges.
717 static void move_edges_to_leader(node_t *x) {
718 ir_node *irn = x->node;
721 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
722 node_t *pred = get_irn_node(get_irn_n(irn, i));
727 n = get_irn_n_outs(p);
728 for (j = 1; j <= pred->n_followers; ++j) {
729 if (p->out[j].pos == i && p->out[j].use == irn) {
730 /* found a follower edge to x, move it to the Leader */
731 ir_def_use_edge edge = p->out[j];
733 /* remove this edge from the Follower set */
734 p->out[j] = p->out[pred->n_followers];
737 /* sort it into the leader set */
738 for (k = pred->n_followers + 2; k <= n; ++k) {
739 if (p->out[k].pos >= edge.pos)
741 p->out[k - 1] = p->out[k];
743 /* place the new edge here */
744 p->out[k - 1] = edge;
746 /* edge found and moved */
751 } /* move_edges_to_leader */
754 * Split a partition that has NO followers by a local list.
756 * @param Z partition to split
757 * @param g a (non-empty) node list
758 * @param env the environment
760 * @return a new partition containing the nodes of g
762 static partition_t *split_no_followers(partition_t *Z, node_t *g, environment_t *env) {
763 partition_t *Z_prime;
768 dump_partition("Splitting ", Z);
769 dump_list("by list ", g);
773 /* Remove g from Z. */
774 for (node = g; node != NULL; node = node->next) {
775 assert(node->part == Z);
776 list_del(&node->node_list);
779 assert(n < Z->n_leader);
782 /* Move g to a new partition, Z'. */
783 Z_prime = new_partition(env);
785 for (node = g; node != NULL; node = node->next) {
786 list_add_tail(&node->node_list, &Z_prime->Leader);
787 node->part = Z_prime;
788 if (node->max_user_input > max_input)
789 max_input = node->max_user_input;
791 Z_prime->max_user_inputs = max_input;
792 Z_prime->n_leader = n;
795 check_partition(Z_prime);
797 /* for now, copy the type info tag, it will be adjusted in split_by(). */
798 Z_prime->type_is_T_or_C = Z->type_is_T_or_C;
800 update_worklist(Z, Z_prime, env);
802 dump_partition("Now ", Z);
803 dump_partition("Created new ", Z_prime);
805 } /* split_no_followers */
809 #define split(Z, g, env) split_no_followers(*(Z), g, env)
814 * Make the Follower -> Leader transition for a node.
818 static void follower_to_leader(node_t *n) {
819 assert(n->is_follower == 1);
821 DB((dbg, LEVEL_2, "%+F make the follower -> leader transition\n", n->node));
823 move_edges_to_leader(n);
824 list_del(&n->node_list);
825 list_add_tail(&n->node_list, &n->part->Leader);
827 } /* follower_to_leader */
830 * The environment for one race step.
832 typedef struct step_env {
833 node_t *initial; /**< The initial node list. */
834 node_t *unwalked; /**< The unwalked node list. */
835 node_t *walked; /**< The walked node list. */
836 int index; /**< Next index of Follower use_def edge. */
837 unsigned side; /**< side number. */
841 * Return non-zero, if a input is a real follower
843 * @param irn the node to check
844 * @param input number of the input
846 static int is_real_follower(const ir_node *irn, int input) {
847 if (input == 1 && is_Confirm(irn)) {
848 /* return the Confirm bound input */
851 if (input == 0 && is_Mux(irn)) {
852 /* ignore the Mux sel input */
856 /* dead inputs are not follower edges */
857 ir_node *block = get_nodes_block(irn);
858 node_t *pred = get_irn_node(get_Block_cfgpred(block, input));
860 if (pred->type.tv == tarval_unreachable)
867 * Do one step in the race.
869 static int step(step_env *env) {
872 if (env->initial != NULL) {
873 /* Move node from initial to unwalked */
875 env->initial = n->race_next;
877 n->race_next = env->unwalked;
883 while (env->unwalked != NULL) {
884 /* let n be the first node in unwalked */
886 while (env->index < n->n_followers) {
887 const ir_def_use_edge *edge = &n->node->out[1 + env->index];
889 /* let m be n.F.def_use[index] */
890 node_t *m = get_irn_node(edge->use);
892 assert(m->is_follower);
894 * Some inputs, like the get_Confirm_bound are NOT
895 * real followers, sort them out.
897 if (! is_real_follower(m->node, edge->pos)) {
903 /* only followers from our partition */
904 if (m->part != n->part)
907 if ((m->flagged & env->side) == 0) {
908 m->flagged |= env->side;
910 if (m->flagged != 3) {
911 /* visited the first time */
912 /* add m to unwalked not as first node (we might still need to
913 check for more follower node */
914 m->race_next = n->race_next;
918 /* else already visited by the other side and on the other list */
921 /* move n to walked */
922 env->unwalked = n->race_next;
923 n->race_next = env->walked;
931 * Clear the flags from a list and check for
932 * nodes that where touched from both sides.
934 * @param list the list
936 static int clear_flags(node_t *list) {
940 for (n = list; n != NULL; n = n->race_next) {
941 if (n->flagged == 3) {
942 /* we reach a follower from both sides, this will split congruent
943 * inputs and make it a leader. */
944 follower_to_leader(n);
953 * Split a partition by a local list using the race.
955 * @param pX pointer to the partition to split, might be changed!
956 * @param gg a (non-empty) node list
957 * @param env the environment
959 * @return a new partition containing the nodes of gg
961 static partition_t *split(partition_t **pX, node_t *gg, environment_t *env) {
962 partition_t *X = *pX;
963 partition_t *X_prime;
965 step_env env1, env2, *winner;
966 node_t *g, *h, *node, *t;
967 int max_input, transitions;
969 DEBUG_ONLY(static int run = 0;)
971 DB((dbg, LEVEL_2, "Run %d ", run++));
972 if (list_empty(&X->Follower)) {
973 /* if the partition has NO follower, we can use the fast
974 splitting algorithm. */
975 return split_no_followers(X, gg, env);
977 /* else do the race */
979 dump_partition("Splitting ", X);
980 dump_list("by list ", gg);
982 INIT_LIST_HEAD(&tmp);
984 /* Remove gg from X.Leader and put into g */
986 for (node = gg; node != NULL; node = node->next) {
987 assert(node->part == X);
988 assert(node->is_follower == 0);
990 list_del(&node->node_list);
991 list_add_tail(&node->node_list, &tmp);
997 list_for_each_entry(node_t, node, &X->Leader, node_list) {
1001 /* restore X.Leader */
1002 list_splice(&tmp, &X->Leader);
1005 env1.unwalked = NULL;
1011 env2.unwalked = NULL;
1026 assert(winner->initial == NULL);
1027 assert(winner->unwalked == NULL);
1029 /* clear flags from walked/unwalked */
1030 transitions = clear_flags(env1.unwalked);
1031 transitions |= clear_flags(env1.walked);
1032 transitions |= clear_flags(env2.unwalked);
1033 transitions |= clear_flags(env2.walked);
1035 dump_race_list("winner ", winner->walked);
1037 /* Move walked_{winner} to a new partition, X'. */
1038 X_prime = new_partition(env);
1041 for (node = winner->walked; node != NULL; node = node->race_next) {
1042 list_del(&node->node_list);
1043 node->part = X_prime;
1044 if (node->is_follower) {
1045 list_add_tail(&node->node_list, &X_prime->Follower);
1047 list_add_tail(&node->node_list, &X_prime->Leader);
1050 if (node->max_user_input > max_input)
1051 max_input = node->max_user_input;
1053 X_prime->n_leader = n;
1054 X_prime->max_user_inputs = max_input;
1055 X->n_leader -= X_prime->n_leader;
1057 /* for now, copy the type info tag, it will be adjusted in split_by(). */
1058 X_prime->type_is_T_or_C = X->type_is_T_or_C;
1061 * Even if a follower was not checked by both sides, it might have
1062 * loose its congruence, so we need to check this case for all follower.
1064 list_for_each_entry_safe(node_t, node, t, &X_prime->Follower, node_list) {
1065 if (identity(node) == node) {
1066 follower_to_leader(node);
1072 check_partition(X_prime);
1074 /* X' is the smaller part */
1075 add_to_worklist(X_prime, env);
1078 * If there where follower to leader transitions, ensure that the nodes
1079 * can be split out if necessary.
1082 /* place partitions on the cprop list */
1083 if (X_prime->on_cprop == 0) {
1084 X_prime->cprop_next = env->cprop;
1085 env->cprop = X_prime;
1086 X_prime->on_cprop = 1;
1088 if (X->on_cprop == 0) {
1089 X->cprop_next = env->cprop;
1095 dump_partition("Now ", X);
1096 dump_partition("Created new ", X_prime);
1098 /* we have to ensure that the partition containing g is returned */
1099 if (winner == &env2) {
1106 #endif /* NO_FOLLOWER */
1109 * Returns non-zero if the i'th input of a Phi node is live.
1111 * @param phi a Phi-node
1112 * @param i an input number
1114 * @return non-zero if the i'th input of the given Phi node is live
1116 static int is_live_input(ir_node *phi, int i) {
1118 ir_node *block = get_nodes_block(phi);
1119 ir_node *pred = get_Block_cfgpred(block, i);
1120 lattice_elem_t type = get_node_type(pred);
1122 return type.tv != tarval_unreachable;
1124 /* else it's the control input, always live */
1126 } /* is_live_input */
1129 * Return non-zero if a type is a constant.
1131 static int is_constant_type(lattice_elem_t type) {
1132 if (type.tv != tarval_bottom && type.tv != tarval_top)
1135 } /* is_constant_type */
1138 * Check whether a type is neither Top or a constant.
1139 * Note: U is handled like Top here, R is a constant.
1141 * @param type the type to check
1143 static int type_is_neither_top_nor_const(const lattice_elem_t type) {
1144 if (is_tarval(type.tv)) {
1145 if (type.tv == tarval_top)
1147 if (tarval_is_constant(type.tv))
1157 * Collect nodes to the touched list.
1159 * @param list the list which contains the nodes that must be evaluated
1160 * @param idx the index of the def_use edge to evaluate
1161 * @param env the environment
1163 static void collect_touched(list_head *list, int idx, environment_t *env) {
1165 int end_idx = env->end_idx;
1167 list_for_each_entry(node_t, x, list, node_list) {
1171 /* leader edges start AFTER follower edges */
1172 x->next_edge = x->n_followers + 1;
1174 num_edges = get_irn_n_outs(x->node);
1176 /* for all edges in x.L.def_use_{idx} */
1177 while (x->next_edge <= num_edges) {
1178 const ir_def_use_edge *edge = &x->node->out[x->next_edge];
1181 /* check if we have necessary edges */
1182 if (edge->pos > idx)
1189 /* ignore the "control input" for non-pinned nodes
1190 if we are running in GCSE mode */
1191 if (idx < end_idx && get_irn_pinned(succ) != op_pin_state_pinned)
1194 y = get_irn_node(succ);
1195 assert(get_irn_n(succ, idx) == x->node);
1197 /* ignore block edges touching followers */
1198 if (idx == -1 && y->is_follower)
1201 if (is_constant_type(y->type)) {
1202 ir_opcode code = get_irn_opcode(succ);
1203 if (code == iro_Sub || code == iro_Cmp)
1204 add_to_cprop(y, env);
1207 /* Partitions of constants should not be split simply because their Nodes have unequal
1208 functions or incongruent inputs. */
1209 if (type_is_neither_top_nor_const(y->type) &&
1210 (! is_Phi(y->node) || is_live_input(y->node, idx))) {
1211 add_to_touched(y, env);
1215 } /* collect_touched */
1218 * Split the partitions if caused by the first entry on the worklist.
1220 * @param env the environment
1222 static void cause_splits(environment_t *env) {
1223 partition_t *X, *Z, *N;
1226 /* remove the first partition from the worklist */
1228 env->worklist = X->wl_next;
1231 dump_partition("Cause_split: ", X);
1233 /* combine temporary leader and follower list */
1234 for (idx = -1; idx <= X->max_user_inputs; ++idx) {
1235 /* empty the touched set: already done, just clear the list */
1236 env->touched = NULL;
1238 collect_touched(&X->Leader, idx, env);
1239 collect_touched(&X->Follower, idx, env);
1241 for (Z = env->touched; Z != NULL; Z = N) {
1243 node_t *touched = Z->touched;
1244 unsigned n_touched = Z->n_touched;
1246 assert(Z->touched != NULL);
1248 /* beware, split might change Z */
1249 N = Z->touched_next;
1251 /* remove it from the touched set */
1254 /* Empty local Z.touched. */
1255 for (e = touched; e != NULL; e = e->next) {
1256 assert(e->is_follower == 0);
1262 if (0 < n_touched && n_touched < Z->n_leader) {
1263 DB((dbg, LEVEL_2, "Split part%d by touched\n", Z->nr));
1264 split(&Z, touched, env);
1266 assert(n_touched <= Z->n_leader);
1269 } /* cause_splits */
1272 * Implements split_by_what(): Split a partition by characteristics given
1273 * by the what function.
1275 * @param X the partition to split
1276 * @param What a function returning an Id for every node of the partition X
1277 * @param P a list to store the result partitions
1278 * @param env the environment
1282 static partition_t *split_by_what(partition_t *X, what_func What,
1283 partition_t **P, environment_t *env) {
1286 listmap_entry_t *iter;
1289 /* Let map be an empty mapping from the range of What to (local) list of Nodes. */
1291 list_for_each_entry(node_t, x, &X->Leader, node_list) {
1292 void *id = What(x, env);
1293 listmap_entry_t *entry;
1296 /* input not allowed, ignore */
1299 /* Add x to map[What(x)]. */
1300 entry = listmap_find(&map, id);
1301 x->next = entry->list;
1304 /* Let P be a set of Partitions. */
1306 /* for all sets S except one in the range of map do */
1307 for (iter = map.values; iter != NULL; iter = iter->next) {
1308 if (iter->next == NULL) {
1309 /* this is the last entry, ignore */
1314 /* Add SPLIT( X, S ) to P. */
1315 DB((dbg, LEVEL_2, "Split part%d by what\n", X->nr));
1316 R = split(&X, S, env);
1326 } /* split_by_what */
1328 /** lambda n.(n.type) */
1329 static void *lambda_type(const node_t *node, environment_t *env) {
1331 return node->type.tv;
1334 /** lambda n.(n.opcode) */
1335 static void *lambda_opcode(const node_t *node, environment_t *env) {
1336 opcode_key_t key, *entry;
1337 ir_node *irn = node->node;
1339 key.code = get_irn_opcode(irn);
1340 key.mode = get_irn_mode(irn);
1341 key.arity = get_irn_arity(irn);
1345 switch (get_irn_opcode(irn)) {
1347 key.u.proj = get_Proj_proj(irn);
1350 key.u.ent = get_Sel_entity(irn);
1356 entry = set_insert(env->opcode2id_map, &key, sizeof(key), opcode_hash(&key));
1358 } /* lambda_opcode */
1360 /** lambda n.(n[i].partition) */
1361 static void *lambda_partition(const node_t *node, environment_t *env) {
1362 ir_node *skipped = skip_Proj(node->node);
1365 int i = env->lambda_input;
1367 if (i >= get_irn_arity(node->node)) {
1368 /* we are outside the allowed range */
1372 /* ignore the "control input" for non-pinned nodes
1373 if we are running in GCSE mode */
1374 if (i < env->end_idx && get_irn_pinned(skipped) != op_pin_state_pinned)
1377 pred = i == -1 ? get_irn_n(skipped, i) : get_irn_n(node->node, i);
1378 p = get_irn_node(pred);
1381 } /* lambda_partition */
1384 * Returns true if a type is a constant.
1386 static int is_con(const lattice_elem_t type) {
1387 /* be conservative */
1388 if (is_tarval(type.tv))
1389 return tarval_is_constant(type.tv);
1390 return is_entity(type.sym.entity_p);
1394 * Implements split_by().
1396 * @param X the partition to split
1397 * @param env the environment
1399 static void split_by(partition_t *X, environment_t *env) {
1400 partition_t *I, *P = NULL;
1403 dump_partition("split_by", X);
1405 if (X->n_leader == 1) {
1406 /* we have only one leader, no need to split, just check it's type */
1407 node_t *x = get_first_node(X);
1408 X->type_is_T_or_C = x->type.tv == tarval_top || is_con(x->type);
1412 DB((dbg, LEVEL_2, "WHAT = lambda n.(n.type) on part%d\n", X->nr));
1413 P = split_by_what(X, lambda_type, &P, env);
1415 /* adjust the type tags, we have split partitions by type */
1416 for (I = P; I != NULL; I = I->split_next) {
1417 node_t *x = get_first_node(I);
1418 I->type_is_T_or_C = x->type.tv == tarval_top || is_con(x->type);
1425 if (Y->n_leader > 1) {
1426 /* we do not want split the TOP or constant partitions */
1427 if (! Y->type_is_T_or_C) {
1428 partition_t *Q = NULL;
1430 DB((dbg, LEVEL_2, "WHAT = lambda n.(n.opcode) on part%d\n", Y->nr));
1431 Q = split_by_what(Y, lambda_opcode, &Q, env);
1437 if (Z->n_leader > 1) {
1438 const node_t *first = get_first_node(Z);
1439 int arity = get_irn_arity(first->node);
1443 * BEWARE: during splitting by input 2 for instance we might
1444 * create new partitions which are different by input 1, so collect
1445 * them and split further.
1447 Z->split_next = NULL;
1450 for (input = arity - 1; input >= -1; --input) {
1452 partition_t *Z_prime = R;
1455 if (Z_prime->n_leader > 1) {
1456 env->lambda_input = input;
1457 DB((dbg, LEVEL_2, "WHAT = lambda n.(n[%d].partition) on part%d\n", input, Z_prime->nr));
1458 S = split_by_what(Z_prime, lambda_partition, &S, env);
1460 Z_prime->split_next = S;
1463 } while (R != NULL);
1468 } while (Q != NULL);
1471 } while (P != NULL);
1475 * (Re-)compute the type for a given node.
1477 * @param node the node
1479 static void default_compute(node_t *node) {
1481 ir_node *irn = node->node;
1482 node_t *block = get_irn_node(get_nodes_block(irn));
1484 if (block->type.tv == tarval_unreachable) {
1485 node->type.tv = tarval_top;
1489 /* if any of the data inputs have type top, the result is type top */
1490 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
1491 ir_node *pred = get_irn_n(irn, i);
1492 node_t *p = get_irn_node(pred);
1494 if (p->type.tv == tarval_top) {
1495 node->type.tv = tarval_top;
1500 if (get_irn_mode(node->node) == mode_X)
1501 node->type.tv = tarval_reachable;
1503 node->type.tv = computed_value(irn);
1504 } /* default_compute */
1507 * (Re-)compute the type for a Block node.
1509 * @param node the node
1511 static void compute_Block(node_t *node) {
1513 ir_node *block = node->node;
1515 if (block == get_irg_start_block(current_ir_graph)) {
1516 /* start block is always reachable */
1517 node->type.tv = tarval_reachable;
1521 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1522 node_t *pred = get_irn_node(get_Block_cfgpred(block, i));
1524 if (pred->type.tv == tarval_reachable) {
1525 /* A block is reachable, if at least of predecessor is reachable. */
1526 node->type.tv = tarval_reachable;
1530 node->type.tv = tarval_top;
1531 } /* compute_Block */
1534 * (Re-)compute the type for a Bad node.
1536 * @param node the node
1538 static void compute_Bad(node_t *node) {
1539 /* Bad nodes ALWAYS compute Top */
1540 node->type.tv = tarval_top;
1544 * (Re-)compute the type for an Unknown node.
1546 * @param node the node
1548 static void compute_Unknown(node_t *node) {
1549 /* While Unknown nodes should compute Top this is dangerous:
1550 * a Top input to a Cond would lead to BOTH control flows unreachable.
1551 * While this is correct in the given semantics, it would destroy the Firm
1554 * It would be safe to compute Top IF it can be assured, that only Cmp
1555 * nodes are inputs to Conds. We check that first.
1556 * This is the way Frontends typically build Firm, but some optimizations
1557 * (cond_eval for instance) might replace them by Phib's...
1559 * For now, we compute bottom here.
1561 node->type.tv = tarval_bottom;
1562 } /* compute_Unknown */
1565 * (Re-)compute the type for a Jmp node.
1567 * @param node the node
1569 static void compute_Jmp(node_t *node) {
1570 node_t *block = get_irn_node(get_nodes_block(node->node));
1572 node->type = block->type;
1576 * (Re-)compute the type for the End node.
1578 * @param node the node
1580 static void compute_End(node_t *node) {
1581 /* the End node is NOT dead of course */
1582 node->type.tv = tarval_reachable;
1586 * (Re-)compute the type for a SymConst node.
1588 * @param node the node
1590 static void compute_SymConst(node_t *node) {
1591 ir_node *irn = node->node;
1592 node_t *block = get_irn_node(get_nodes_block(irn));
1594 if (block->type.tv == tarval_unreachable) {
1595 node->type.tv = tarval_top;
1598 switch (get_SymConst_kind(irn)) {
1599 case symconst_addr_ent:
1600 /* case symconst_addr_name: cannot handle this yet */
1601 node->type.sym = get_SymConst_symbol(irn);
1604 node->type.tv = computed_value(irn);
1606 } /* compute_SymConst */
1609 * (Re-)compute the type for a Phi node.
1611 * @param node the node
1613 static void compute_Phi(node_t *node) {
1615 ir_node *phi = node->node;
1616 lattice_elem_t type;
1618 /* if a Phi is in a unreachable block, its type is TOP */
1619 node_t *block = get_irn_node(get_nodes_block(phi));
1621 if (block->type.tv == tarval_unreachable) {
1622 node->type.tv = tarval_top;
1626 /* Phi implements the Meet operation */
1627 type.tv = tarval_top;
1628 for (i = get_Phi_n_preds(phi) - 1; i >= 0; --i) {
1629 node_t *pred = get_irn_node(get_Phi_pred(phi, i));
1630 node_t *pred_X = get_irn_node(get_Block_cfgpred(block->node, i));
1632 if (pred_X->type.tv == tarval_unreachable || pred->type.tv == tarval_top) {
1633 /* ignore TOP inputs: We must check here for unreachable blocks,
1634 because Firm constants live in the Start Block are NEVER Top.
1635 Else, a Phi (1,2) will produce Bottom, even if the 2 for instance
1636 comes from a unreachable input. */
1639 if (pred->type.tv == tarval_bottom) {
1640 node->type.tv = tarval_bottom;
1642 } else if (type.tv == tarval_top) {
1643 /* first constant found */
1645 } else if (type.tv != pred->type.tv) {
1646 /* different constants or tarval_bottom */
1647 node->type.tv = tarval_bottom;
1650 /* else nothing, constants are the same */
1656 * (Re-)compute the type for an Add. Special case: one nodes is a Zero Const.
1658 * @param node the node
1660 static void compute_Add(node_t *node) {
1661 ir_node *sub = node->node;
1662 node_t *l = get_irn_node(get_Add_left(sub));
1663 node_t *r = get_irn_node(get_Add_right(sub));
1664 lattice_elem_t a = l->type;
1665 lattice_elem_t b = r->type;
1668 if (a.tv == tarval_top || b.tv == tarval_top) {
1669 node->type.tv = tarval_top;
1670 } else if (a.tv == tarval_bottom || b.tv == tarval_bottom) {
1671 node->type.tv = tarval_bottom;
1673 /* x + 0 = 0 + x = x, but beware of floating point +0 + -0, so we
1674 must call tarval_add() first to handle this case! */
1675 if (is_tarval(a.tv)) {
1676 if (is_tarval(b.tv)) {
1677 node->type.tv = tarval_add(a.tv, b.tv);
1680 mode = get_tarval_mode(a.tv);
1681 if (a.tv == get_mode_null(mode)) {
1685 } else if (is_tarval(b.tv)) {
1686 mode = get_tarval_mode(b.tv);
1687 if (b.tv == get_mode_null(mode)) {
1692 node->type.tv = tarval_bottom;
1697 * (Re-)compute the type for a Sub. Special case: both nodes are congruent.
1699 * @param node the node
1701 static void compute_Sub(node_t *node) {
1702 ir_node *sub = node->node;
1703 node_t *l = get_irn_node(get_Sub_left(sub));
1704 node_t *r = get_irn_node(get_Sub_right(sub));
1705 lattice_elem_t a = l->type;
1706 lattice_elem_t b = r->type;
1709 if (a.tv == tarval_top || b.tv == tarval_top) {
1710 node->type.tv = tarval_top;
1711 } else if (is_con(a) && is_con(b)) {
1712 if (is_tarval(a.tv) && is_tarval(b.tv)) {
1713 node->type.tv = tarval_sub(a.tv, b.tv, get_irn_mode(sub));
1714 } else if (is_tarval(a.tv) && tarval_is_null(a.tv)) {
1716 } else if (is_tarval(b.tv) && tarval_is_null(b.tv)) {
1719 node->type.tv = tarval_bottom;
1721 node->by_all_const = 1;
1722 } else if (r->part == l->part &&
1723 (!mode_is_float(get_irn_mode(l->node)))) {
1725 * BEWARE: a - a is NOT always 0 for floating Point values, as
1726 * NaN op NaN = NaN, so we must check this here.
1728 ir_mode *mode = get_irn_mode(sub);
1729 tv = get_mode_null(mode);
1731 /* if the node was ONCE evaluated by all constants, but now
1732 this breakes AND we cat by partition a different result, switch to bottom.
1733 This happens because initially all nodes are in the same partition ... */
1734 if (node->by_all_const && node->type.tv != tv)
1738 node->type.tv = tarval_bottom;
1743 * (Re-)compute the type for Cmp.
1745 * @param node the node
1747 static void compute_Cmp(node_t *node) {
1748 ir_node *cmp = node->node;
1749 node_t *l = get_irn_node(get_Cmp_left(cmp));
1750 node_t *r = get_irn_node(get_Cmp_right(cmp));
1751 lattice_elem_t a = l->type;
1752 lattice_elem_t b = r->type;
1754 if (a.tv == tarval_top || b.tv == tarval_top) {
1755 node->type.tv = tarval_top;
1756 } else if (is_con(a) && is_con(b)) {
1757 /* both nodes are constants, we can probably do something */
1758 node->type.tv = tarval_b_true;
1759 } else if (r->part == l->part) {
1760 /* both nodes congruent, we can probably do something */
1761 node->type.tv = tarval_b_true;
1763 node->type.tv = tarval_bottom;
1765 } /* compute_Proj_Cmp */
1768 * (Re-)compute the type for a Proj(Cmp).
1770 * @param node the node
1771 * @param cond the predecessor Cmp node
1773 static void compute_Proj_Cmp(node_t *node, ir_node *cmp) {
1774 ir_node *proj = node->node;
1775 node_t *l = get_irn_node(get_Cmp_left(cmp));
1776 node_t *r = get_irn_node(get_Cmp_right(cmp));
1777 lattice_elem_t a = l->type;
1778 lattice_elem_t b = r->type;
1779 pn_Cmp pnc = get_Proj_proj(proj);
1782 if (a.tv == tarval_top || b.tv == tarval_top) {
1783 node->type.tv = tarval_top;
1784 } else if (is_con(a) && is_con(b)) {
1785 default_compute(node);
1786 node->by_all_const = 1;
1787 } else if (r->part == l->part &&
1788 (!mode_is_float(get_irn_mode(l->node)) || pnc == pn_Cmp_Lt || pnc == pn_Cmp_Gt)) {
1790 * BEWARE: a == a is NOT always True for floating Point values, as
1791 * NaN != NaN is defined, so we must check this here.
1793 tv = new_tarval_from_long(pnc & pn_Cmp_Eq, mode_b);
1795 /* if the node was ONCE evaluated by all constants, but now
1796 this breakes AND we cat by partition a different result, switch to bottom.
1797 This happens because initially all nodes are in the same partition ... */
1798 if (node->by_all_const && node->type.tv != tv)
1802 node->type.tv = tarval_bottom;
1804 } /* compute_Proj_Cmp */
1807 * (Re-)compute the type for a Proj(Cond).
1809 * @param node the node
1810 * @param cond the predecessor Cond node
1812 static void compute_Proj_Cond(node_t *node, ir_node *cond) {
1813 ir_node *proj = node->node;
1814 long pnc = get_Proj_proj(proj);
1815 ir_node *sel = get_Cond_selector(cond);
1816 node_t *selector = get_irn_node(sel);
1818 if (get_irn_mode(sel) == mode_b) {
1820 if (pnc == pn_Cond_true) {
1821 if (selector->type.tv == tarval_b_false) {
1822 node->type.tv = tarval_unreachable;
1823 } else if (selector->type.tv == tarval_b_true) {
1824 node->type.tv = tarval_reachable;
1825 } else if (selector->type.tv == tarval_bottom) {
1826 node->type.tv = tarval_reachable;
1828 assert(selector->type.tv == tarval_top);
1829 node->type.tv = tarval_unreachable;
1832 assert(pnc == pn_Cond_false);
1834 if (selector->type.tv == tarval_b_false) {
1835 node->type.tv = tarval_reachable;
1836 } else if (selector->type.tv == tarval_b_true) {
1837 node->type.tv = tarval_unreachable;
1838 } else if (selector->type.tv == tarval_bottom) {
1839 node->type.tv = tarval_reachable;
1841 assert(selector->type.tv == tarval_top);
1842 node->type.tv = tarval_unreachable;
1847 if (selector->type.tv == tarval_bottom) {
1848 node->type.tv = tarval_reachable;
1849 } else if (selector->type.tv == tarval_top) {
1850 node->type.tv = tarval_unreachable;
1852 long value = get_tarval_long(selector->type.tv);
1853 if (pnc == get_Cond_defaultProj(cond)) {
1854 /* default switch, have to check ALL other cases */
1857 for (i = get_irn_n_outs(cond) - 1; i >= 0; --i) {
1858 ir_node *succ = get_irn_out(cond, i);
1862 if (value == get_Proj_proj(succ)) {
1863 /* we found a match, will NOT take the default case */
1864 node->type.tv = tarval_unreachable;
1868 /* all cases checked, no match, will take default case */
1869 node->type.tv = tarval_reachable;
1872 node->type.tv = value == pnc ? tarval_reachable : tarval_unreachable;
1876 } /* compute_Proj_Cond */
1879 * (Re-)compute the type for a Proj-Node.
1881 * @param node the node
1883 static void compute_Proj(node_t *node) {
1884 ir_node *proj = node->node;
1885 ir_mode *mode = get_irn_mode(proj);
1886 node_t *block = get_irn_node(get_nodes_block(skip_Proj(proj)));
1887 ir_node *pred = get_Proj_pred(proj);
1889 if (block->type.tv == tarval_unreachable) {
1890 /* a Proj in a unreachable Block stay Top */
1891 node->type.tv = tarval_top;
1894 if (get_irn_node(pred)->type.tv == tarval_top) {
1895 /* if the predecessor is Top, its Proj follow */
1896 node->type.tv = tarval_top;
1900 if (mode == mode_M) {
1901 /* mode M is always bottom */
1902 node->type.tv = tarval_bottom;
1905 if (mode != mode_X) {
1907 compute_Proj_Cmp(node, pred);
1909 default_compute(node);
1912 /* handle mode_X nodes */
1914 switch (get_irn_opcode(pred)) {
1916 /* the Proj_X from the Start is always reachable.
1917 However this is already handled at the top. */
1918 node->type.tv = tarval_reachable;
1921 compute_Proj_Cond(node, pred);
1924 default_compute(node);
1926 } /* compute_Proj */
1929 * (Re-)compute the type for a Confirm.
1931 * @param node the node
1933 static void compute_Confirm(node_t *node) {
1934 ir_node *confirm = node->node;
1935 node_t *pred = get_irn_node(get_Confirm_value(confirm));
1937 if (get_Confirm_cmp(confirm) == pn_Cmp_Eq) {
1938 node_t *bound = get_irn_node(get_Confirm_bound(confirm));
1940 if (is_con(bound->type)) {
1941 /* is equal to a constant */
1942 node->type = bound->type;
1946 /* a Confirm is a copy OR a Const */
1947 node->type = pred->type;
1948 } /* compute_Confirm */
1951 * (Re-)compute the type for a Max.
1953 * @param node the node
1955 static void compute_Max(node_t *node) {
1956 ir_node *op = node->node;
1957 node_t *l = get_irn_node(get_binop_left(op));
1958 node_t *r = get_irn_node(get_binop_right(op));
1959 lattice_elem_t a = l->type;
1960 lattice_elem_t b = r->type;
1962 if (a.tv == tarval_top || b.tv == tarval_top) {
1963 node->type.tv = tarval_top;
1964 } else if (is_con(a) && is_con(b)) {
1965 /* both nodes are constants, we can probably do something */
1967 /* this case handles symconsts as well */
1970 ir_mode *mode = get_irn_mode(op);
1971 tarval *tv_min = get_mode_min(mode);
1975 else if (b.tv == tv_min)
1977 else if (is_tarval(a.tv) && is_tarval(b.tv)) {
1978 if (tarval_cmp(a.tv, b.tv) & pn_Cmp_Gt)
1979 node->type.tv = a.tv;
1981 node->type.tv = b.tv;
1983 node->type.tv = tarval_bad;
1986 } else if (r->part == l->part) {
1987 /* both nodes congruent, we can probably do something */
1990 node->type.tv = tarval_bottom;
1995 * (Re-)compute the type for a Min.
1997 * @param node the node
1999 static void compute_Min(node_t *node) {
2000 ir_node *op = node->node;
2001 node_t *l = get_irn_node(get_binop_left(op));
2002 node_t *r = get_irn_node(get_binop_right(op));
2003 lattice_elem_t a = l->type;
2004 lattice_elem_t b = r->type;
2006 if (a.tv == tarval_top || b.tv == tarval_top) {
2007 node->type.tv = tarval_top;
2008 } else if (is_con(a) && is_con(b)) {
2009 /* both nodes are constants, we can probably do something */
2011 /* this case handles symconsts as well */
2014 ir_mode *mode = get_irn_mode(op);
2015 tarval *tv_max = get_mode_max(mode);
2019 else if (b.tv == tv_max)
2021 else if (is_tarval(a.tv) && is_tarval(b.tv)) {
2022 if (tarval_cmp(a.tv, b.tv) & pn_Cmp_Gt)
2023 node->type.tv = a.tv;
2025 node->type.tv = b.tv;
2027 node->type.tv = tarval_bad;
2030 } else if (r->part == l->part) {
2031 /* both nodes congruent, we can probably do something */
2034 node->type.tv = tarval_bottom;
2039 * (Re-)compute the type for a given node.
2041 * @param node the node
2043 static void compute(node_t *node) {
2046 if (is_no_Block(node->node)) {
2047 node_t *block = get_irn_node(get_nodes_block(node->node));
2049 if (block->type.tv == tarval_unreachable) {
2050 node->type.tv = tarval_top;
2055 func = (compute_func)node->node->op->ops.generic;
2061 * Identity functions: Note that one might thing that identity() is just a
2062 * synonym for equivalent_node(). While this is true, we cannot use it for the algorithm
2063 * here, because it expects that the identity node is one of the inputs, which is NOT
2064 * always true for equivalent_node() which can handle (and does sometimes) DAGs.
2065 * So, we have our own implementation, which copies some parts of equivalent_node()
2069 * Calculates the Identity for Phi nodes
2071 static node_t *identity_Phi(node_t *node) {
2072 ir_node *phi = node->node;
2073 ir_node *block = get_nodes_block(phi);
2074 node_t *n_part = NULL;
2077 for (i = get_Phi_n_preds(phi) - 1; i >= 0; --i) {
2078 node_t *pred_X = get_irn_node(get_Block_cfgpred(block, i));
2080 if (pred_X->type.tv == tarval_reachable) {
2081 node_t *pred = get_irn_node(get_Phi_pred(phi, i));
2085 else if (n_part->part != pred->part) {
2086 /* incongruent inputs, not a follower */
2091 /* if n_part is NULL here, all inputs path are dead, the Phi computes
2092 * tarval_top, is in the TOP partition and should NOT being split! */
2093 assert(n_part != NULL);
2095 } /* identity_Phi */
2098 * Calculates the Identity for commutative 0 neutral nodes.
2100 static node_t *identity_comm_zero_binop(node_t *node) {
2101 ir_node *op = node->node;
2102 node_t *a = get_irn_node(get_binop_left(op));
2103 node_t *b = get_irn_node(get_binop_right(op));
2104 ir_mode *mode = get_irn_mode(op);
2107 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2108 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2111 /* node: no input should be tarval_top, else the binop would be also
2112 * Top and not being split. */
2113 zero = get_mode_null(mode);
2114 if (a->type.tv == zero)
2116 if (b->type.tv == zero)
2119 } /* identity_comm_zero_binop */
2121 #define identity_Add identity_comm_zero_binop
2122 #define identity_Or identity_comm_zero_binop
2125 * Calculates the Identity for Mul nodes.
2127 static node_t *identity_Mul(node_t *node) {
2128 ir_node *op = node->node;
2129 node_t *a = get_irn_node(get_Mul_left(op));
2130 node_t *b = get_irn_node(get_Mul_right(op));
2131 ir_mode *mode = get_irn_mode(op);
2134 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2135 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2138 /* node: no input should be tarval_top, else the binop would be also
2139 * Top and not being split. */
2140 one = get_mode_one(mode);
2141 if (a->type.tv == one)
2143 if (b->type.tv == one)
2146 } /* identity_Mul */
2149 * Calculates the Identity for Sub nodes.
2151 static node_t *identity_Sub(node_t *node) {
2152 ir_node *sub = node->node;
2153 node_t *b = get_irn_node(get_Sub_right(sub));
2154 ir_mode *mode = get_irn_mode(sub);
2156 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2157 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2160 /* node: no input should be tarval_top, else the binop would be also
2161 * Top and not being split. */
2162 if (b->type.tv == get_mode_null(mode))
2163 return get_irn_node(get_Sub_left(sub));
2165 } /* identity_Mul */
2168 * Calculates the Identity for And nodes.
2170 static node_t *identity_And(node_t *node) {
2171 ir_node *and = node->node;
2172 node_t *a = get_irn_node(get_And_left(and));
2173 node_t *b = get_irn_node(get_And_right(and));
2174 tarval *neutral = get_mode_all_one(get_irn_mode(and));
2176 /* node: no input should be tarval_top, else the And would be also
2177 * Top and not being split. */
2178 if (a->type.tv == neutral)
2180 if (b->type.tv == neutral)
2183 } /* identity_And */
2186 * Calculates the Identity for Confirm nodes.
2188 static node_t *identity_Confirm(node_t *node) {
2189 ir_node *confirm = node->node;
2191 /* a Confirm is always a Copy */
2192 return get_irn_node(get_Confirm_value(confirm));
2193 } /* identity_Confirm */
2196 * Calculates the Identity for Mux nodes.
2198 static node_t *identity_Mux(node_t *node) {
2199 ir_node *mux = node->node;
2200 node_t *t = get_irn_node(get_Mux_true(mux));
2201 node_t *f = get_irn_node(get_Mux_false(mux));
2204 if (t->part == f->part)
2207 /* for now, the 1-input identity is not supported */
2209 sel = get_irn_node(get_Mux_sel(mux));
2211 /* Mux sel input is mode_b, so it is always a tarval */
2212 if (sel->type.tv == tarval_b_true)
2214 if (sel->type.tv == tarval_b_false)
2218 } /* identity_Mux */
2221 * Calculates the Identity for Min nodes.
2223 static node_t *identity_Min(node_t *node) {
2224 ir_node *op = node->node;
2225 node_t *a = get_irn_node(get_binop_left(op));
2226 node_t *b = get_irn_node(get_binop_right(op));
2227 ir_mode *mode = get_irn_mode(op);
2230 if (a->part == b->part) {
2231 /* leader of multiple predecessors */
2235 /* works even with NaN */
2236 tv_max = get_mode_max(mode);
2237 if (a->type.tv == tv_max)
2239 if (b->type.tv == tv_max)
2242 } /* identity_Min */
2245 * Calculates the Identity for Max nodes.
2247 static node_t *identity_Max(node_t *node) {
2248 ir_node *op = node->node;
2249 node_t *a = get_irn_node(get_binop_left(op));
2250 node_t *b = get_irn_node(get_binop_right(op));
2251 ir_mode *mode = get_irn_mode(op);
2254 if (a->part == b->part) {
2255 /* leader of multiple predecessors */
2259 /* works even with NaN */
2260 tv_min = get_mode_min(mode);
2261 if (a->type.tv == tv_min)
2263 if (b->type.tv == tv_min)
2266 } /* identity_Max */
2269 * Calculates the Identity for nodes.
2271 static node_t *identity(node_t *node) {
2272 ir_node *irn = node->node;
2274 switch (get_irn_opcode(irn)) {
2276 return identity_Phi(node);
2278 return identity_Add(node);
2280 return identity_Mul(node);
2282 return identity_Or(node);
2284 return identity_And(node);
2286 return identity_Sub(node);
2288 return identity_Confirm(node);
2290 return identity_Mux(node);
2292 return identity_Min(node);
2294 return identity_Max(node);
2301 * Node follower is a (new) follower of leader, segregate Leader
2304 static void segregate_def_use_chain_1(const ir_node *follower, node_t *leader) {
2305 ir_node *l = leader->node;
2306 int j, i, n = get_irn_n_outs(l);
2308 DB((dbg, LEVEL_2, "%+F is a follower of %+F\n", follower, leader->node));
2309 /* The leader edges must remain sorted, but follower edges can
2311 for (i = leader->n_followers + 1; i <= n; ++i) {
2312 if (l->out[i].use == follower) {
2313 ir_def_use_edge t = l->out[i];
2315 for (j = i - 1; j >= leader->n_followers + 1; --j)
2316 l->out[j + 1] = l->out[j];
2317 ++leader->n_followers;
2318 l->out[leader->n_followers] = t;
2322 } /* segregate_def_use_chain_1 */
2325 * Node follower is a (new) follower of leader, segregate Leader
2326 * out edges. If follower is a n-congruent Input identity, all follower
2327 * inputs congruent to follower are also leader.
2329 * @param follower the follower IR node
2331 static void segregate_def_use_chain(const ir_node *follower) {
2334 for (i = get_irn_arity(follower) - 1; i >= 0; --i) {
2335 node_t *pred = get_irn_node(get_irn_n(follower, i));
2337 segregate_def_use_chain_1(follower, pred);
2339 } /* segregate_def_use_chain */
2342 * Propagate constant evaluation.
2344 * @param env the environment
2346 static void propagate(environment_t *env) {
2349 lattice_elem_t old_type;
2351 unsigned n_fallen, old_type_was_T_or_C;
2354 while (env->cprop != NULL) {
2355 void *oldopcode = NULL;
2357 /* remove the first partition X from cprop */
2360 env->cprop = X->cprop_next;
2362 old_type_was_T_or_C = X->type_is_T_or_C;
2364 DB((dbg, LEVEL_2, "Propagate type on part%d\n", X->nr));
2367 while (! list_empty(&X->cprop)) {
2368 /* remove the first Node x from X.cprop */
2369 x = list_entry(X->cprop.next, node_t, cprop_list);
2370 //assert(x->part == X);
2371 list_del(&x->cprop_list);
2374 if (x->is_follower && identity(x) == x) {
2375 /* check the opcode first */
2376 if (oldopcode == NULL) {
2377 oldopcode = lambda_opcode(get_first_node(X), env);
2379 if (oldopcode != lambda_opcode(x, env)) {
2380 if (x->on_fallen == 0) {
2381 /* different opcode -> x falls out of this partition */
2386 DB((dbg, LEVEL_2, "Add node %+F to fallen\n", x->node));
2390 /* x will make the follower -> leader transition */
2391 follower_to_leader(x);
2394 /* compute a new type for x */
2396 DB((dbg, LEVEL_3, "computing type of %+F\n", x->node));
2398 if (x->type.tv != old_type.tv) {
2399 verify_type(old_type, x->type);
2400 DB((dbg, LEVEL_2, "node %+F has changed type from %+F to %+F\n", x->node, old_type, x->type));
2402 if (x->on_fallen == 0) {
2403 /* Add x to fallen. Nodes might fall from T -> const -> _|_, so check that they are
2404 not already on the list. */
2409 DB((dbg, LEVEL_2, "Add node %+F to fallen\n", x->node));
2411 for (i = get_irn_n_outs(x->node) - 1; i >= 0; --i) {
2412 ir_node *succ = get_irn_out(x->node, i);
2413 node_t *y = get_irn_node(succ);
2415 /* Add y to y.partition.cprop. */
2416 add_to_cprop(y, env);
2421 if (n_fallen > 0 && n_fallen != X->n_leader) {
2422 DB((dbg, LEVEL_2, "Splitting part%d by fallen\n", X->nr));
2423 Y = split(&X, fallen, env);
2427 /* remove the flags from the fallen list */
2428 for (x = fallen; x != NULL; x = x->next)
2432 if (old_type_was_T_or_C) {
2435 if (Y->on_worklist == 0)
2436 add_to_worklist(Y, env);
2438 /* check if some nodes will make the leader -> follower transition */
2439 list_for_each_entry_safe(node_t, y, tmp, &Y->Leader, node_list) {
2440 if (y->type.tv != tarval_top && ! is_con(y->type)) {
2441 node_t *eq_node = identity(y);
2443 if (eq_node != y && eq_node->part == y->part) {
2444 DB((dbg, LEVEL_2, "Node %+F is a follower of %+F\n", y->node, eq_node->node));
2445 /* move to Follower */
2447 list_del(&y->node_list);
2448 list_add_tail(&y->node_list, &Y->Follower);
2451 segregate_def_use_chain(y->node);
2462 * Get the leader for a given node from its congruence class.
2464 * @param irn the node
2466 static ir_node *get_leader(node_t *node) {
2467 partition_t *part = node->part;
2469 if (part->n_leader > 1 || node->is_follower) {
2470 if (node->is_follower) {
2471 DB((dbg, LEVEL_2, "Replacing follower %+F\n", node->node));
2474 DB((dbg, LEVEL_2, "Found congruence class for %+F\n", node->node));
2476 return get_first_node(part)->node;
2482 * Return non-zero if the control flow predecessor node pred
2483 * is the only reachable control flow exit of its block.
2485 * @param pred the control flow exit
2487 static int can_exchange(ir_node *pred) {
2490 else if (is_Jmp(pred))
2492 else if (get_irn_mode(pred) == mode_T) {
2495 /* if the predecessor block has more than one
2496 reachable outputs we cannot remove the block */
2498 for (i = get_irn_n_outs(pred) - 1; i >= 0; --i) {
2499 ir_node *proj = get_irn_out(pred, i);
2502 /* skip non-control flow Proj's */
2503 if (get_irn_mode(proj) != mode_X)
2506 node = get_irn_node(proj);
2507 if (node->type.tv == tarval_reachable) {
2518 * Block Post-Walker, apply the analysis results on control flow by
2519 * shortening Phi's and Block inputs.
2521 static void apply_cf(ir_node *block, void *ctx) {
2522 environment_t *env = ctx;
2523 node_t *node = get_irn_node(block);
2525 ir_node **ins, **in_X;
2526 ir_node *phi, *next;
2528 if (block == get_irg_end_block(current_ir_graph) ||
2529 block == get_irg_start_block(current_ir_graph)) {
2530 /* the EndBlock is always reachable even if the analysis
2531 finds out the opposite :-) */
2534 if (node->type.tv == tarval_unreachable) {
2535 /* mark dead blocks */
2536 set_Block_dead(block);
2540 n = get_Block_n_cfgpreds(block);
2543 /* only one predecessor combine */
2544 ir_node *pred = skip_Proj(get_Block_cfgpred(block, 0));
2546 if (can_exchange(pred)) {
2547 exchange(block, get_nodes_block(pred));
2553 NEW_ARR_A(ir_node *, in_X, n);
2555 for (i = 0; i < n; ++i) {
2556 ir_node *pred = get_Block_cfgpred(block, i);
2557 node_t *node = get_irn_node(pred);
2559 if (node->type.tv == tarval_reachable) {
2566 NEW_ARR_A(ir_node *, ins, n);
2567 for (phi = get_Block_phis(block); phi != NULL; phi = next) {
2568 node_t *node = get_irn_node(phi);
2570 next = get_Phi_next(phi);
2571 if (is_tarval(node->type.tv) && tarval_is_constant(node->type.tv)) {
2572 /* this Phi is replaced by a constant */
2573 tarval *tv = node->type.tv;
2574 ir_node *c = new_r_Const(current_ir_graph, block, get_tarval_mode(tv), tv);
2576 set_irn_node(c, node);
2578 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", phi, c));
2583 for (i = 0; i < n; ++i) {
2584 node_t *pred = get_irn_node(get_Block_cfgpred(block, i));
2586 if (pred->type.tv == tarval_reachable) {
2587 ins[j++] = get_Phi_pred(phi, i);
2591 /* this Phi is replaced by a single predecessor */
2592 ir_node *s = ins[0];
2595 DB((dbg, LEVEL_1, "%+F is replaced by %+F because of cf change\n", phi, s));
2599 set_irn_in(phi, j, ins);
2606 /* this Block has only one live predecessor */
2607 ir_node *pred = skip_Proj(in_X[0]);
2609 if (can_exchange(pred)) {
2610 exchange(block, get_nodes_block(pred));
2614 set_irn_in(block, k, in_X);
2620 * Post-Walker, apply the analysis results;
2622 static void apply_result(ir_node *irn, void *ctx) {
2623 environment_t *env = ctx;
2624 node_t *node = get_irn_node(irn);
2626 if (is_Block(irn) || is_End(irn) || is_Bad(irn)) {
2627 /* blocks already handled, do not touch the End node */
2629 node_t *block = get_irn_node(get_nodes_block(irn));
2631 if (block->type.tv == tarval_unreachable) {
2632 ir_node *bad = get_irg_bad(current_ir_graph);
2634 /* here, bad might already have a node, but this can be safely ignored
2635 as long as bad has at least ONE valid node */
2636 set_irn_node(bad, node);
2638 DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
2642 else if (node->type.tv == tarval_unreachable) {
2643 ir_node *bad = get_irg_bad(current_ir_graph);
2645 /* see comment above */
2646 set_irn_node(bad, node);
2648 DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
2652 else if (get_irn_mode(irn) == mode_X) {
2655 ir_node *cond = get_Proj_pred(irn);
2657 if (is_Cond(cond)) {
2658 node_t *sel = get_irn_node(get_Cond_selector(cond));
2660 if (is_tarval(sel->type.tv) && tarval_is_constant(sel->type.tv)) {
2661 /* Cond selector is a constant, make a Jmp */
2662 ir_node *jmp = new_r_Jmp(current_ir_graph, block->node);
2663 set_irn_node(jmp, node);
2665 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, jmp));
2672 /* normal data node */
2673 if (is_tarval(node->type.tv) && tarval_is_constant(node->type.tv)) {
2674 tarval *tv = node->type.tv;
2677 * Beware: never replace mode_T nodes by constants. Currently we must mark
2678 * mode_T nodes with constants, but do NOT replace them.
2680 if (! is_Const(irn) && get_irn_mode(irn) != mode_T) {
2681 /* can be replaced by a constant */
2682 ir_node *c = new_r_Const(current_ir_graph, block->node, get_tarval_mode(tv), tv);
2683 set_irn_node(c, node);
2685 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, c));
2689 } else if (is_entity(node->type.sym.entity_p)) {
2690 if (! is_SymConst(irn)) {
2691 /* can be replaced by a Symconst */
2692 ir_node *symc = new_r_SymConst(current_ir_graph, block->node, get_irn_mode(irn), node->type.sym, symconst_addr_ent);
2693 set_irn_node(symc, node);
2696 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, symc));
2697 exchange(irn, symc);
2700 } else if (is_Confirm(irn)) {
2701 /* Confirms are always follower, but do not kill them here */
2703 ir_node *leader = get_leader(node);
2705 if (leader != irn) {
2706 DB((dbg, LEVEL_1, "%+F from part%d is replaced by %+F\n", irn, node->part->nr, leader));
2707 exchange(irn, leader);
2713 } /* apply_result */
2716 * Fix the keep-alives by deleting unreachable ones.
2718 static void apply_end(ir_node *end, environment_t *env) {
2719 int i, j, n = get_End_n_keepalives(end);
2723 NEW_ARR_A(ir_node *, in, n);
2725 /* fix the keep alive */
2726 for (i = j = 0; i < n; i++) {
2727 ir_node *ka = get_End_keepalive(end, i);
2728 node_t *node = get_irn_node(ka);
2730 /* Use the flagged bits to mark already visited nodes.
2731 * This should not be ready but better safe than sorry. */
2732 if (node->flagged == 0) {
2736 node = get_irn_node(get_nodes_block(ka));
2738 if (node->type.tv != tarval_unreachable)
2743 set_End_keepalives(end, j, in);
2748 #define SET(code) op_##code->ops.generic = (op_func)compute_##code
2751 * sets the generic functions to compute.
2753 static void set_compute_functions(void) {
2756 /* set the default compute function */
2757 for (i = get_irp_n_opcodes() - 1; i >= 0; --i) {
2758 ir_op *op = get_irp_opcode(i);
2759 op->ops.generic = (op_func)default_compute;
2762 /* set specific functions */
2781 } /* set_compute_functions */
2783 static int dump_partition_hook(FILE *F, ir_node *n, ir_node *local) {
2784 ir_node *irn = local != NULL ? local : n;
2785 node_t *node = get_irn_node(irn);
2787 ir_fprintf(F, "info2 : \"partition %u type %+F\"\n", node->part->nr, node->type);
2791 void combo(ir_graph *irg) {
2793 ir_node *initial_bl;
2795 ir_graph *rem = current_ir_graph;
2797 current_ir_graph = irg;
2799 /* register a debug mask */
2800 FIRM_DBG_REGISTER(dbg, "firm.opt.combo");
2801 //firm_dbg_set_mask(dbg, SET_LEVEL_3);
2803 DB((dbg, LEVEL_1, "Doing COMBO for %+F\n", irg));
2805 obstack_init(&env.obst);
2806 env.worklist = NULL;
2810 #ifdef DEBUG_libfirm
2811 env.dbg_list = NULL;
2813 env.opcode2id_map = new_set(cmp_opcode, iro_Last * 4);
2814 env.type2id_map = pmap_create();
2815 env.end_idx = get_opt_global_cse() ? 0 : -1;
2816 env.lambda_input = 0;
2819 assure_irg_outs(irg);
2821 /* we have our own value_of function */
2822 set_value_of_func(get_node_tarval);
2824 set_compute_functions();
2825 DEBUG_ONLY(part_nr = 0);
2827 /* create the initial partition and place it on the work list */
2828 env.initial = new_partition(&env);
2829 add_to_worklist(env.initial, &env);
2830 irg_walk_graph(irg, init_block_phis, create_initial_partitions, &env);
2832 /* all nodes on the initial partition have type Top */
2833 env.initial->type_is_T_or_C = 1;
2835 /* Place the START Node's partition on cprop.
2836 Place the START Node on its local worklist. */
2837 initial_bl = get_irg_start_block(irg);
2838 start = get_irn_node(initial_bl);
2839 add_to_cprop(start, &env);
2843 if (env.worklist != NULL)
2845 } while (env.cprop != NULL || env.worklist != NULL);
2847 dump_all_partitions(&env);
2848 check_all_partitions(&env);
2851 set_dump_node_vcgattr_hook(dump_partition_hook);
2852 dump_ir_block_graph(irg, "-partition");
2853 set_dump_node_vcgattr_hook(NULL);
2855 (void)dump_partition_hook;
2858 /* apply the result */
2859 irg_block_walk_graph(irg, NULL, apply_cf, &env);
2860 irg_walk_graph(irg, NULL, apply_result, &env);
2861 apply_end(get_irg_end(irg), &env);
2864 /* control flow might changed */
2865 set_irg_outs_inconsistent(irg);
2866 set_irg_extblk_inconsistent(irg);
2867 set_irg_doms_inconsistent(irg);
2868 set_irg_loopinfo_inconsistent(irg);
2871 pmap_destroy(env.type2id_map);
2872 del_set(env.opcode2id_map);
2873 obstack_free(&env.obst, NULL);
2875 /* restore value_of() default behavior */
2876 set_value_of_func(NULL);
2877 current_ir_graph = rem;