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"
51 #include "iropt_dbg.h"
60 /* define this to check that all type translations are monotone */
61 #undef VERIFY_MONOTONE
63 /* define this to check the consistency of partitions */
64 #define CHECK_PARTITIONS
66 typedef struct node_t node_t;
67 typedef struct partition_t partition_t;
68 typedef struct opcode_key_t opcode_key_t;
69 typedef struct listmap_entry_t listmap_entry_t;
71 /** The type of the compute function. */
72 typedef void (*compute_func)(node_t *node);
78 ir_opcode code; /**< The Firm opcode. */
79 ir_mode *mode; /**< The mode of all nodes in the partition. */
80 int arity; /**< The arity of this opcode (needed for Phi etc. */
82 long proj; /**< For Proj nodes, its proj number */
83 ir_entity *ent; /**< For Sel Nodes, its entity */
88 * An entry in the list_map.
90 struct listmap_entry_t {
91 void *id; /**< The id. */
92 node_t *list; /**< The associated list for this id. */
93 listmap_entry_t *next; /**< Link to the next entry in the map. */
96 /** We must map id's to lists. */
97 typedef struct listmap_t {
98 set *map; /**< Map id's to listmap_entry_t's */
99 listmap_entry_t *values; /**< List of all values in the map. */
103 * A lattice element. Because we handle constants and symbolic constants different, we
104 * have to use this union.
115 ir_node *node; /**< The IR-node itself. */
116 list_head node_list; /**< Double-linked list of leader/follower entries. */
117 list_head cprop_list; /**< Double-linked partition.cprop list. */
118 partition_t *part; /**< points to the partition this node belongs to */
119 node_t *next; /**< Next node on local list (partition.touched, fallen). */
120 node_t *race_next; /**< Next node on race list. */
121 lattice_elem_t type; /**< The associated lattice element "type". */
122 int max_user_input; /**< Maximum input number of Def-Use edges. */
123 int next_edge; /**< Index of the next Def-Use edge to use. */
124 int n_followers; /**< Number of Follower in the outs set. */
125 unsigned on_touched:1; /**< Set, if this node is on the partition.touched set. */
126 unsigned on_cprop:1; /**< Set, if this node is on the partition.cprop list. */
127 unsigned on_fallen:1; /**< Set, if this node is on the fallen list. */
128 unsigned is_follower:1; /**< Set, if this node is a follower. */
129 unsigned by_all_const:1; /**< Set, if this node was once evaluated by all constants. */
130 unsigned flagged:2; /**< 2 Bits, set if this node was visited by race 1 or 2. */
134 * A partition containing congruent nodes.
137 list_head Leader; /**< The head of partition Leader node list. */
138 list_head Follower; /**< The head of partition Follower node list. */
139 list_head cprop; /**< The head of partition.cprop list. */
140 partition_t *wl_next; /**< Next entry in the work list if any. */
141 partition_t *touched_next; /**< Points to the next partition in the touched set. */
142 partition_t *cprop_next; /**< Points to the next partition in the cprop list. */
143 partition_t *split_next; /**< Points to the next partition in the list that must be split by split_by(). */
144 node_t *touched; /**< The partition.touched set of this partition. */
145 unsigned n_leader; /**< Number of entries in this partition.Leader. */
146 unsigned n_touched; /**< Number of entries in the partition.touched. */
147 int max_user_inputs; /**< Maximum number of user inputs of all entries. */
148 unsigned on_worklist:1; /**< Set, if this partition is in the work list. */
149 unsigned on_touched:1; /**< Set, if this partition is on the touched set. */
150 unsigned on_cprop:1; /**< Set, if this partition is on the cprop list. */
151 unsigned type_is_T_or_C:1;/**< Set, if all nodes in this partition have type Top or Constant. */
153 partition_t *dbg_next; /**< Link all partitions for debugging */
154 unsigned nr; /**< A unique number for (what-)mapping, >0. */
158 typedef struct environment_t {
159 struct obstack obst; /**< obstack to allocate data structures. */
160 partition_t *worklist; /**< The work list. */
161 partition_t *cprop; /**< The constant propagation list. */
162 partition_t *touched; /**< the touched set. */
163 partition_t *initial; /**< The initial partition. */
164 set *opcode2id_map; /**< The opcodeMode->id map. */
165 pmap *type2id_map; /**< The type->id map. */
166 int end_idx; /**< -1 for local and 0 for global congruences. */
167 int lambda_input; /**< Captured argument for lambda_partition(). */
168 char nonstd_cond; /**< Set, if a Condb note has a non-Cmp predecessor. */
169 char modified; /**< Set, if the graph was modified. */
171 partition_t *dbg_list; /**< List of all partitions. */
175 /** Type of the what function. */
176 typedef void *(*what_func)(const node_t *node, environment_t *env);
178 #define get_irn_node(follower) ((node_t *)get_irn_link(follower))
179 #define set_irn_node(follower, node) set_irn_link(follower, node)
181 /* we do NOT use tarval_unreachable here, instead we use Top for this purpose */
182 #undef tarval_unreachable
183 #define tarval_unreachable tarval_top
186 /** The debug module handle. */
187 DEBUG_ONLY(static firm_dbg_module_t *dbg;)
189 /** Next partition number. */
190 DEBUG_ONLY(static unsigned part_nr = 0);
192 /** The tarval returned by Unknown nodes. */
193 static tarval *tarval_UNKNOWN;
196 static node_t *identity(node_t *node);
198 #ifdef CHECK_PARTITIONS
202 static void check_partition(const partition_t *T) {
206 list_for_each_entry(node_t, node, &T->Leader, node_list) {
207 assert(node->is_follower == 0);
208 assert(node->flagged == 0);
209 assert(node->part == T);
212 assert(n == T->n_leader);
214 list_for_each_entry(node_t, node, &T->Follower, node_list) {
215 assert(node->is_follower == 1);
216 assert(node->flagged == 0);
217 assert(node->part == T);
219 } /* check_partition */
221 static void check_all_partitions(environment_t *env) {
226 for (P = env->dbg_list; P != NULL; P = P->dbg_next) {
228 list_for_each_entry(node_t, node, &P->Follower, node_list) {
229 node_t *leader = identity(node);
231 assert(leader != node && leader->part == node->part);
240 static void do_check_list(const node_t *list, int ofs, const partition_t *Z) {
243 #define NEXT(e) *((const node_t **)((char *)(e) + (ofs)))
244 for (e = list; e != NULL; e = NEXT(e)) {
245 assert(e->part == Z);
248 } /* ido_check_list */
251 * Check a local list.
253 static void check_list(const node_t *list, const partition_t *Z) {
254 do_check_list(list, offsetof(node_t, next), Z);
258 #define check_partition(T)
259 #define check_list(list, Z)
260 #define check_all_partitions(env)
261 #endif /* CHECK_PARTITIONS */
264 static INLINE lattice_elem_t get_partition_type(const partition_t *X);
267 * Dump partition to output.
269 static void dump_partition(const char *msg, const partition_t *part) {
272 lattice_elem_t type = get_partition_type(part);
274 DB((dbg, LEVEL_2, "%s part%u%s (%u, %+F) {\n ",
275 msg, part->nr, part->type_is_T_or_C ? "*" : "",
276 part->n_leader, type));
277 list_for_each_entry(node_t, node, &part->Leader, node_list) {
278 DB((dbg, LEVEL_2, "%s%+F", first ? "" : ", ", node->node));
281 if (! list_empty(&part->Follower)) {
282 DB((dbg, LEVEL_2, "\n---\n "));
284 list_for_each_entry(node_t, node, &part->Follower, node_list) {
285 DB((dbg, LEVEL_2, "%s%+F", first ? "" : ", ", node->node));
289 DB((dbg, LEVEL_2, "\n}\n"));
290 } /* dump_partition */
295 static void do_dump_list(const char *msg, const node_t *node, int ofs) {
299 #define GET_LINK(p, ofs) *((const node_t **)((char *)(p) + (ofs)))
301 DB((dbg, LEVEL_3, "%s = {\n ", msg));
302 for (p = node; p != NULL; p = GET_LINK(p, ofs)) {
303 DB((dbg, LEVEL_3, "%s%+F", first ? "" : ", ", p->node));
306 DB((dbg, LEVEL_3, "\n}\n"));
314 static void dump_race_list(const char *msg, const node_t *list) {
315 do_dump_list(msg, list, offsetof(node_t, race_next));
319 * Dumps a local list.
321 static void dump_list(const char *msg, const node_t *list) {
322 do_dump_list(msg, list, offsetof(node_t, next));
326 * Dump all partitions.
328 static void dump_all_partitions(const environment_t *env) {
329 const partition_t *P;
331 DB((dbg, LEVEL_2, "All partitions\n===============\n"));
332 for (P = env->dbg_list; P != NULL; P = P->dbg_next)
333 dump_partition("", P);
337 #define dump_partition(msg, part)
338 #define dump_race_list(msg, list)
339 #define dump_list(msg, list)
340 #define dump_all_partitions(env)
343 #if defined(VERIFY_MONOTONE) && defined (DEBUG_libfirm)
345 * Verify that a type transition is monotone
347 static void verify_type(const lattice_elem_t old_type, const lattice_elem_t new_type) {
348 if (old_type.tv == new_type.tv) {
352 if (old_type.tv == tarval_top) {
353 /* from Top down-to is always allowed */
356 if (old_type.tv == tarval_reachable) {
357 panic("verify_type(): wrong translation from %+F to %+F", old_type, new_type);
359 if (new_type.tv == tarval_bottom || new_type.tv == tarval_reachable) {
363 panic("verify_type(): wrong translation from %+F to %+F", old_type, new_type);
366 #define verify_type(old_type, new_type)
370 * Compare two pointer values of a listmap.
372 static int listmap_cmp_ptr(const void *elt, const void *key, size_t size) {
373 const listmap_entry_t *e1 = elt;
374 const listmap_entry_t *e2 = key;
377 return e1->id != e2->id;
378 } /* listmap_cmp_ptr */
381 * Initializes a listmap.
383 * @param map the listmap
385 static void listmap_init(listmap_t *map) {
386 map->map = new_set(listmap_cmp_ptr, 16);
391 * Terminates a listmap.
393 * @param map the listmap
395 static void listmap_term(listmap_t *map) {
400 * Return the associated listmap entry for a given id.
402 * @param map the listmap
403 * @param id the id to search for
405 * @return the asociated listmap entry for the given id
407 static listmap_entry_t *listmap_find(listmap_t *map, void *id) {
408 listmap_entry_t key, *entry;
413 entry = set_insert(map->map, &key, sizeof(key), HASH_PTR(id));
415 if (entry->list == NULL) {
416 /* a new entry, put into the list */
417 entry->next = map->values;
424 * Calculate the hash value for an opcode map entry.
426 * @param entry an opcode map entry
428 * @return a hash value for the given opcode map entry
430 static unsigned opcode_hash(const opcode_key_t *entry) {
431 return (entry->mode - (ir_mode *)0) * 9 + entry->code + entry->u.proj * 3 + HASH_PTR(entry->u.ent);
435 * Compare two entries in the opcode map.
437 static int cmp_opcode(const void *elt, const void *key, size_t size) {
438 const opcode_key_t *o1 = elt;
439 const opcode_key_t *o2 = key;
442 return o1->code != o2->code || o1->mode != o2->mode ||
443 o1->arity != o2->arity ||
444 o1->u.proj != o2->u.proj || o1->u.ent != o2->u.ent;
448 * Compare two Def-Use edges for input position.
450 static int cmp_def_use_edge(const void *a, const void *b) {
451 const ir_def_use_edge *ea = a;
452 const ir_def_use_edge *eb = b;
454 /* no overrun, because range is [-1, MAXINT] */
455 return ea->pos - eb->pos;
456 } /* cmp_def_use_edge */
459 * We need the Def-Use edges sorted.
461 static void sort_irn_outs(node_t *node) {
462 ir_node *irn = node->node;
463 int n_outs = get_irn_n_outs(irn);
466 qsort(&irn->out[1], n_outs, sizeof(irn->out[0]), cmp_def_use_edge);
468 node->max_user_input = irn->out[n_outs].pos;
469 } /* sort_irn_outs */
472 * Return the type of a node.
474 * @param irn an IR-node
476 * @return the associated type of this node
478 static INLINE lattice_elem_t get_node_type(const ir_node *irn) {
479 return get_irn_node(irn)->type;
480 } /* get_node_type */
483 * Return the tarval of a node.
485 * @param irn an IR-node
487 * @return the associated type of this node
489 static INLINE tarval *get_node_tarval(const ir_node *irn) {
490 lattice_elem_t type = get_node_type(irn);
492 if (is_tarval(type.tv))
494 return tarval_bottom;
495 } /* get_node_type */
498 * Add a partition to the worklist.
500 static INLINE void add_to_worklist(partition_t *X, environment_t *env) {
501 assert(X->on_worklist == 0);
502 X->wl_next = env->worklist;
505 } /* add_to_worklist */
508 * Create a new empty partition.
510 * @param env the environment
512 * @return a newly allocated partition
514 static INLINE partition_t *new_partition(environment_t *env) {
515 partition_t *part = obstack_alloc(&env->obst, sizeof(*part));
517 INIT_LIST_HEAD(&part->Leader);
518 INIT_LIST_HEAD(&part->Follower);
519 INIT_LIST_HEAD(&part->cprop);
520 part->wl_next = NULL;
521 part->touched_next = NULL;
522 part->cprop_next = NULL;
523 part->split_next = NULL;
524 part->touched = NULL;
527 part->max_user_inputs = 0;
528 part->on_worklist = 0;
529 part->on_touched = 0;
531 part->type_is_T_or_C = 0;
533 part->dbg_next = env->dbg_list;
534 env->dbg_list = part;
535 part->nr = part_nr++;
539 } /* new_partition */
542 * Get the first node from a partition.
544 static INLINE node_t *get_first_node(const partition_t *X) {
545 return list_entry(X->Leader.next, node_t, node_list);
546 } /* get_first_node */
549 * Return the type of a partition (assuming partition is non-empty and
550 * all elements have the same type).
552 * @param X a partition
554 * @return the type of the first element of the partition
556 static INLINE lattice_elem_t get_partition_type(const partition_t *X) {
557 const node_t *first = get_first_node(X);
559 } /* get_partition_type */
562 * Creates a partition node for the given IR-node and place it
563 * into the given partition.
565 * @param irn an IR-node
566 * @param part a partition to place the node in
567 * @param env the environment
569 * @return the created node
571 static node_t *create_partition_node(ir_node *irn, partition_t *part, environment_t *env) {
572 /* create a partition node and place it in the partition */
573 node_t *node = obstack_alloc(&env->obst, sizeof(*node));
575 INIT_LIST_HEAD(&node->node_list);
576 INIT_LIST_HEAD(&node->cprop_list);
580 node->race_next = NULL;
581 node->type.tv = tarval_top;
582 node->max_user_input = 0;
584 node->n_followers = 0;
585 node->on_touched = 0;
588 node->is_follower = 0;
589 node->by_all_const = 0;
591 set_irn_node(irn, node);
593 list_add_tail(&node->node_list, &part->Leader);
597 } /* create_partition_node */
600 * Pre-Walker, init all Block-Phi lists.
602 static void init_block_phis(ir_node *irn, void *env) {
606 set_Block_phis(irn, NULL);
608 } /* init_block_phis */
611 * Post-Walker, initialize all Nodes' type to U or top and place
612 * all nodes into the TOP partition.
614 static void create_initial_partitions(ir_node *irn, void *ctx) {
615 environment_t *env = ctx;
616 partition_t *part = env->initial;
619 node = create_partition_node(irn, part, env);
621 if (node->max_user_input > part->max_user_inputs)
622 part->max_user_inputs = node->max_user_input;
625 add_Block_phi(get_nodes_block(irn), irn);
626 } else if (is_Cond(irn)) {
627 /* check if all Cond's have a Cmp predecessor. */
628 if (get_irn_mode(irn) == mode_b && !is_Cmp(skip_Proj(get_Cond_selector(irn))))
629 env->nonstd_cond = 1;
632 } /* create_initial_partitions */
635 * Add a node to the entry.partition.touched set and
636 * node->partition to the touched set if not already there.
639 * @param env the environment
641 static INLINE void add_to_touched(node_t *y, environment_t *env) {
642 if (y->on_touched == 0) {
643 partition_t *part = y->part;
645 y->next = part->touched;
650 if (part->on_touched == 0) {
651 part->touched_next = env->touched;
653 part->on_touched = 1;
656 check_list(part->touched, part);
658 } /* add_to_touched */
661 * Place a node on the cprop list.
664 * @param env the environment
666 static void add_to_cprop(node_t *y, environment_t *env) {
667 /* Add y to y.partition.cprop. */
668 if (y->on_cprop == 0) {
669 partition_t *Y = y->part;
671 list_add_tail(&y->cprop_list, &Y->cprop);
674 DB((dbg, LEVEL_3, "Add %+F to part%u.cprop\n", y->node, Y->nr));
676 /* place its partition on the cprop list */
677 if (Y->on_cprop == 0) {
678 Y->cprop_next = env->cprop;
683 if (get_irn_mode(y->node) == mode_T) {
684 /* mode_T nodes always produce tarval_bottom, so we must explicitly
685 add it's Proj's to get constant evaluation to work */
688 for (i = get_irn_n_outs(y->node) - 1; i >= 0; --i) {
689 node_t *proj = get_irn_node(get_irn_out(y->node, i));
691 add_to_cprop(proj, env);
693 } else if (is_Block(y->node)) {
694 /* Due to the way we handle Phi's, we must place all Phis of a block on the list
695 * if someone placed the block. The Block is only placed if the reachability
696 * changes, and this must be re-evaluated in compute_Phi(). */
698 for (phi = get_Block_phis(y->node); phi != NULL; phi = get_Phi_next(phi)) {
699 node_t *p = get_irn_node(phi);
700 add_to_cprop(p, env);
706 * Update the worklist: If Z is on worklist then add Z' to worklist.
707 * Else add the smaller of Z and Z' to worklist.
709 * @param Z the Z partition
710 * @param Z_prime the Z' partition, a previous part of Z
711 * @param env the environment
713 static void update_worklist(partition_t *Z, partition_t *Z_prime, environment_t *env) {
714 if (Z->on_worklist || Z_prime->n_leader < Z->n_leader) {
715 add_to_worklist(Z_prime, env);
717 add_to_worklist(Z, env);
719 } /* update_worklist */
722 * Make all inputs to x no longer be F.def_use edges.
726 static void move_edges_to_leader(node_t *x) {
727 ir_node *irn = x->node;
730 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
731 node_t *pred = get_irn_node(get_irn_n(irn, i));
736 n = get_irn_n_outs(p);
737 for (j = 1; j <= pred->n_followers; ++j) {
738 if (p->out[j].pos == i && p->out[j].use == irn) {
739 /* found a follower edge to x, move it to the Leader */
740 ir_def_use_edge edge = p->out[j];
742 /* remove this edge from the Follower set */
743 p->out[j] = p->out[pred->n_followers];
746 /* sort it into the leader set */
747 for (k = pred->n_followers + 2; k <= n; ++k) {
748 if (p->out[k].pos >= edge.pos)
750 p->out[k - 1] = p->out[k];
752 /* place the new edge here */
753 p->out[k - 1] = edge;
755 /* edge found and moved */
760 } /* move_edges_to_leader */
763 * Split a partition that has NO followers by a local list.
765 * @param Z partition to split
766 * @param g a (non-empty) node list
767 * @param env the environment
769 * @return a new partition containing the nodes of g
771 static partition_t *split_no_followers(partition_t *Z, node_t *g, environment_t *env) {
772 partition_t *Z_prime;
777 dump_partition("Splitting ", Z);
778 dump_list("by list ", g);
782 /* Remove g from Z. */
783 for (node = g; node != NULL; node = node->next) {
784 assert(node->part == Z);
785 list_del(&node->node_list);
788 assert(n < Z->n_leader);
791 /* Move g to a new partition, Z'. */
792 Z_prime = new_partition(env);
794 for (node = g; node != NULL; node = node->next) {
795 list_add_tail(&node->node_list, &Z_prime->Leader);
796 node->part = Z_prime;
797 if (node->max_user_input > max_input)
798 max_input = node->max_user_input;
800 Z_prime->max_user_inputs = max_input;
801 Z_prime->n_leader = n;
804 check_partition(Z_prime);
806 /* for now, copy the type info tag, it will be adjusted in split_by(). */
807 Z_prime->type_is_T_or_C = Z->type_is_T_or_C;
809 update_worklist(Z, Z_prime, env);
811 dump_partition("Now ", Z);
812 dump_partition("Created new ", Z_prime);
814 } /* split_no_followers */
817 * Make the Follower -> Leader transition for a node.
821 static void follower_to_leader(node_t *n) {
822 assert(n->is_follower == 1);
824 DB((dbg, LEVEL_2, "%+F make the follower -> leader transition\n", n->node));
826 move_edges_to_leader(n);
827 list_del(&n->node_list);
828 list_add_tail(&n->node_list, &n->part->Leader);
830 } /* follower_to_leader */
833 * The environment for one race step.
835 typedef struct step_env {
836 node_t *initial; /**< The initial node list. */
837 node_t *unwalked; /**< The unwalked node list. */
838 node_t *walked; /**< The walked node list. */
839 int index; /**< Next index of Follower use_def edge. */
840 unsigned side; /**< side number. */
844 * Return non-zero, if a input is a real follower
846 * @param irn the node to check
847 * @param input number of the input
849 static int is_real_follower(const ir_node *irn, int input) {
852 switch (get_irn_opcode(irn)) {
855 /* ignore the Confirm bound input */
861 /* ignore the Mux sel input */
866 /* dead inputs are not follower edges */
867 ir_node *block = get_nodes_block(irn);
868 node_t *pred = get_irn_node(get_Block_cfgpred(block, input));
870 if (pred->type.tv == tarval_unreachable)
880 /* only a Sub x,0 / Shift x,0 might be a follower */
887 pred = get_irn_node(get_irn_n(irn, input));
888 if (is_tarval(pred->type.tv) && tarval_is_null(pred->type.tv))
892 pred = get_irn_node(get_irn_n(irn, input));
893 if (is_tarval(pred->type.tv) && tarval_is_one(pred->type.tv))
897 pred = get_irn_node(get_irn_n(irn, input));
898 if (is_tarval(pred->type.tv) && tarval_is_all_one(pred->type.tv))
903 /* all inputs are followers */
906 assert(!"opcode not implemented yet");
913 * Do one step in the race.
915 static int step(step_env *env) {
918 if (env->initial != NULL) {
919 /* Move node from initial to unwalked */
921 env->initial = n->race_next;
923 n->race_next = env->unwalked;
929 while (env->unwalked != NULL) {
930 /* let n be the first node in unwalked */
932 while (env->index < n->n_followers) {
933 const ir_def_use_edge *edge = &n->node->out[1 + env->index];
935 /* let m be n.F.def_use[index] */
936 node_t *m = get_irn_node(edge->use);
938 assert(m->is_follower);
940 * Some inputs, like the get_Confirm_bound are NOT
941 * real followers, sort them out.
943 if (! is_real_follower(m->node, edge->pos)) {
949 /* only followers from our partition */
950 if (m->part != n->part)
953 if ((m->flagged & env->side) == 0) {
954 m->flagged |= env->side;
956 if (m->flagged != 3) {
957 /* visited the first time */
958 /* add m to unwalked not as first node (we might still need to
959 check for more follower node */
960 m->race_next = n->race_next;
964 /* else already visited by the other side and on the other list */
967 /* move n to walked */
968 env->unwalked = n->race_next;
969 n->race_next = env->walked;
977 * Clear the flags from a list and check for
978 * nodes that where touched from both sides.
980 * @param list the list
982 static int clear_flags(node_t *list) {
986 for (n = list; n != NULL; n = n->race_next) {
987 if (n->flagged == 3) {
988 /* we reach a follower from both sides, this will split congruent
989 * inputs and make it a leader. */
990 follower_to_leader(n);
999 * Split a partition by a local list using the race.
1001 * @param pX pointer to the partition to split, might be changed!
1002 * @param gg a (non-empty) node list
1003 * @param env the environment
1005 * @return a new partition containing the nodes of gg
1007 static partition_t *split(partition_t **pX, node_t *gg, environment_t *env) {
1008 partition_t *X = *pX;
1009 partition_t *X_prime;
1011 step_env env1, env2, *winner;
1012 node_t *g, *h, *node, *t;
1013 int max_input, transitions;
1015 DEBUG_ONLY(static int run = 0;)
1017 DB((dbg, LEVEL_2, "Run %d ", run++));
1018 if (list_empty(&X->Follower)) {
1019 /* if the partition has NO follower, we can use the fast
1020 splitting algorithm. */
1021 return split_no_followers(X, gg, env);
1023 /* else do the race */
1025 dump_partition("Splitting ", X);
1026 dump_list("by list ", gg);
1028 INIT_LIST_HEAD(&tmp);
1030 /* Remove gg from X.Leader and put into g */
1032 for (node = gg; node != NULL; node = node->next) {
1033 assert(node->part == X);
1034 assert(node->is_follower == 0);
1036 list_del(&node->node_list);
1037 list_add_tail(&node->node_list, &tmp);
1038 node->race_next = g;
1043 list_for_each_entry(node_t, node, &X->Leader, node_list) {
1044 node->race_next = h;
1047 /* restore X.Leader */
1048 list_splice(&tmp, &X->Leader);
1051 env1.unwalked = NULL;
1057 env2.unwalked = NULL;
1072 assert(winner->initial == NULL);
1073 assert(winner->unwalked == NULL);
1075 /* clear flags from walked/unwalked */
1076 transitions = clear_flags(env1.unwalked);
1077 transitions |= clear_flags(env1.walked);
1078 transitions |= clear_flags(env2.unwalked);
1079 transitions |= clear_flags(env2.walked);
1081 dump_race_list("winner ", winner->walked);
1083 /* Move walked_{winner} to a new partition, X'. */
1084 X_prime = new_partition(env);
1087 for (node = winner->walked; node != NULL; node = node->race_next) {
1088 list_del(&node->node_list);
1089 node->part = X_prime;
1090 if (node->is_follower) {
1091 list_add_tail(&node->node_list, &X_prime->Follower);
1093 list_add_tail(&node->node_list, &X_prime->Leader);
1096 if (node->max_user_input > max_input)
1097 max_input = node->max_user_input;
1099 X_prime->n_leader = n;
1100 X_prime->max_user_inputs = max_input;
1101 X->n_leader -= X_prime->n_leader;
1103 /* for now, copy the type info tag, it will be adjusted in split_by(). */
1104 X_prime->type_is_T_or_C = X->type_is_T_or_C;
1107 * Even if a follower was not checked by both sides, it might have
1108 * loose its congruence, so we need to check this case for all follower.
1110 list_for_each_entry_safe(node_t, node, t, &X_prime->Follower, node_list) {
1111 if (identity(node) == node) {
1112 follower_to_leader(node);
1118 check_partition(X_prime);
1120 /* X' is the smaller part */
1121 add_to_worklist(X_prime, env);
1124 * If there where follower to leader transitions, ensure that the nodes
1125 * can be split out if necessary.
1128 /* place partitions on the cprop list */
1129 if (X_prime->on_cprop == 0) {
1130 X_prime->cprop_next = env->cprop;
1131 env->cprop = X_prime;
1132 X_prime->on_cprop = 1;
1136 dump_partition("Now ", X);
1137 dump_partition("Created new ", X_prime);
1139 /* we have to ensure that the partition containing g is returned */
1140 if (winner == &env2) {
1149 * Returns non-zero if the i'th input of a Phi node is live.
1151 * @param phi a Phi-node
1152 * @param i an input number
1154 * @return non-zero if the i'th input of the given Phi node is live
1156 static int is_live_input(ir_node *phi, int i) {
1158 ir_node *block = get_nodes_block(phi);
1159 ir_node *pred = get_Block_cfgpred(block, i);
1160 lattice_elem_t type = get_node_type(pred);
1162 return type.tv != tarval_unreachable;
1164 /* else it's the control input, always live */
1166 } /* is_live_input */
1169 * Return non-zero if a type is a constant.
1171 static int is_constant_type(lattice_elem_t type) {
1172 if (type.tv != tarval_bottom && type.tv != tarval_top)
1175 } /* is_constant_type */
1178 * Check whether a type is neither Top or a constant.
1179 * Note: U is handled like Top here, R is a constant.
1181 * @param type the type to check
1183 static int type_is_neither_top_nor_const(const lattice_elem_t type) {
1184 if (is_tarval(type.tv)) {
1185 if (type.tv == tarval_top)
1187 if (tarval_is_constant(type.tv))
1197 * Collect nodes to the touched list.
1199 * @param list the list which contains the nodes that must be evaluated
1200 * @param idx the index of the def_use edge to evaluate
1201 * @param env the environment
1203 static void collect_touched(list_head *list, int idx, environment_t *env) {
1205 int end_idx = env->end_idx;
1207 list_for_each_entry(node_t, x, list, node_list) {
1211 /* leader edges start AFTER follower edges */
1212 x->next_edge = x->n_followers + 1;
1214 num_edges = get_irn_n_outs(x->node);
1216 /* for all edges in x.L.def_use_{idx} */
1217 while (x->next_edge <= num_edges) {
1218 const ir_def_use_edge *edge = &x->node->out[x->next_edge];
1221 /* check if we have necessary edges */
1222 if (edge->pos > idx)
1229 /* ignore the "control input" for non-pinned nodes
1230 if we are running in GCSE mode */
1231 if (idx < end_idx && get_irn_pinned(succ) != op_pin_state_pinned)
1234 y = get_irn_node(succ);
1235 assert(get_irn_n(succ, idx) == x->node);
1237 /* ignore block edges touching followers */
1238 if (idx == -1 && y->is_follower)
1241 if (is_constant_type(y->type)) {
1242 ir_opcode code = get_irn_opcode(succ);
1243 if (code == iro_Sub || code == iro_Eor || code == iro_Cmp)
1244 add_to_cprop(y, env);
1247 /* Partitions of constants should not be split simply because their Nodes have unequal
1248 functions or incongruent inputs. */
1249 if (type_is_neither_top_nor_const(y->type) &&
1250 (! is_Phi(y->node) || is_live_input(y->node, idx))) {
1251 add_to_touched(y, env);
1255 } /* collect_touched */
1258 * Split the partitions if caused by the first entry on the worklist.
1260 * @param env the environment
1262 static void cause_splits(environment_t *env) {
1263 partition_t *X, *Z, *N;
1266 /* remove the first partition from the worklist */
1268 env->worklist = X->wl_next;
1271 dump_partition("Cause_split: ", X);
1273 /* combine temporary leader and follower list */
1274 for (idx = -1; idx <= X->max_user_inputs; ++idx) {
1275 /* empty the touched set: already done, just clear the list */
1276 env->touched = NULL;
1278 collect_touched(&X->Leader, idx, env);
1279 collect_touched(&X->Follower, idx, env);
1281 for (Z = env->touched; Z != NULL; Z = N) {
1283 node_t *touched = Z->touched;
1284 unsigned n_touched = Z->n_touched;
1286 assert(Z->touched != NULL);
1288 /* beware, split might change Z */
1289 N = Z->touched_next;
1291 /* remove it from the touched set */
1294 /* Empty local Z.touched. */
1295 for (e = touched; e != NULL; e = e->next) {
1296 assert(e->is_follower == 0);
1302 if (0 < n_touched && n_touched < Z->n_leader) {
1303 DB((dbg, LEVEL_2, "Split part%d by touched\n", Z->nr));
1304 split(&Z, touched, env);
1306 assert(n_touched <= Z->n_leader);
1309 } /* cause_splits */
1312 * Implements split_by_what(): Split a partition by characteristics given
1313 * by the what function.
1315 * @param X the partition to split
1316 * @param What a function returning an Id for every node of the partition X
1317 * @param P a list to store the result partitions
1318 * @param env the environment
1322 static partition_t *split_by_what(partition_t *X, what_func What,
1323 partition_t **P, environment_t *env) {
1326 listmap_entry_t *iter;
1329 /* Let map be an empty mapping from the range of What to (local) list of Nodes. */
1331 list_for_each_entry(node_t, x, &X->Leader, node_list) {
1332 void *id = What(x, env);
1333 listmap_entry_t *entry;
1336 /* input not allowed, ignore */
1339 /* Add x to map[What(x)]. */
1340 entry = listmap_find(&map, id);
1341 x->next = entry->list;
1344 /* Let P be a set of Partitions. */
1346 /* for all sets S except one in the range of map do */
1347 for (iter = map.values; iter != NULL; iter = iter->next) {
1348 if (iter->next == NULL) {
1349 /* this is the last entry, ignore */
1354 /* Add SPLIT( X, S ) to P. */
1355 DB((dbg, LEVEL_2, "Split part%d by what\n", X->nr));
1356 R = split(&X, S, env);
1366 } /* split_by_what */
1368 /** lambda n.(n.type) */
1369 static void *lambda_type(const node_t *node, environment_t *env) {
1371 return node->type.tv;
1374 /** lambda n.(n.opcode) */
1375 static void *lambda_opcode(const node_t *node, environment_t *env) {
1376 opcode_key_t key, *entry;
1377 ir_node *irn = node->node;
1379 key.code = get_irn_opcode(irn);
1380 key.mode = get_irn_mode(irn);
1381 key.arity = get_irn_arity(irn);
1385 switch (get_irn_opcode(irn)) {
1387 key.u.proj = get_Proj_proj(irn);
1390 key.u.ent = get_Sel_entity(irn);
1396 entry = set_insert(env->opcode2id_map, &key, sizeof(key), opcode_hash(&key));
1398 } /* lambda_opcode */
1400 /** lambda n.(n[i].partition) */
1401 static void *lambda_partition(const node_t *node, environment_t *env) {
1402 ir_node *skipped = skip_Proj(node->node);
1405 int i = env->lambda_input;
1407 if (i >= get_irn_arity(node->node)) {
1408 /* we are outside the allowed range */
1412 /* ignore the "control input" for non-pinned nodes
1413 if we are running in GCSE mode */
1414 if (i < env->end_idx && get_irn_pinned(skipped) != op_pin_state_pinned)
1417 pred = i == -1 ? get_irn_n(skipped, i) : get_irn_n(node->node, i);
1418 p = get_irn_node(pred);
1421 } /* lambda_partition */
1424 * Returns true if a type is a constant.
1426 static int is_con(const lattice_elem_t type) {
1427 /* be conservative */
1428 if (is_tarval(type.tv))
1429 return tarval_is_constant(type.tv);
1430 return is_entity(type.sym.entity_p);
1434 * Implements split_by().
1436 * @param X the partition to split
1437 * @param env the environment
1439 static void split_by(partition_t *X, environment_t *env) {
1440 partition_t *I, *P = NULL;
1443 dump_partition("split_by", X);
1445 if (X->n_leader == 1) {
1446 /* we have only one leader, no need to split, just check it's type */
1447 node_t *x = get_first_node(X);
1448 X->type_is_T_or_C = x->type.tv == tarval_top || is_con(x->type);
1452 DB((dbg, LEVEL_2, "WHAT = lambda n.(n.type) on part%d\n", X->nr));
1453 P = split_by_what(X, lambda_type, &P, env);
1455 /* adjust the type tags, we have split partitions by type */
1456 for (I = P; I != NULL; I = I->split_next) {
1457 node_t *x = get_first_node(I);
1458 I->type_is_T_or_C = x->type.tv == tarval_top || is_con(x->type);
1465 if (Y->n_leader > 1) {
1466 /* we do not want split the TOP or constant partitions */
1467 if (! Y->type_is_T_or_C) {
1468 partition_t *Q = NULL;
1470 DB((dbg, LEVEL_2, "WHAT = lambda n.(n.opcode) on part%d\n", Y->nr));
1471 Q = split_by_what(Y, lambda_opcode, &Q, env);
1477 if (Z->n_leader > 1) {
1478 const node_t *first = get_first_node(Z);
1479 int arity = get_irn_arity(first->node);
1483 * BEWARE: during splitting by input 2 for instance we might
1484 * create new partitions which are different by input 1, so collect
1485 * them and split further.
1487 Z->split_next = NULL;
1490 for (input = arity - 1; input >= -1; --input) {
1492 partition_t *Z_prime = R;
1495 if (Z_prime->n_leader > 1) {
1496 env->lambda_input = input;
1497 DB((dbg, LEVEL_2, "WHAT = lambda n.(n[%d].partition) on part%d\n", input, Z_prime->nr));
1498 S = split_by_what(Z_prime, lambda_partition, &S, env);
1500 Z_prime->split_next = S;
1503 } while (R != NULL);
1508 } while (Q != NULL);
1511 } while (P != NULL);
1515 * (Re-)compute the type for a given node.
1517 * @param node the node
1519 static void default_compute(node_t *node) {
1521 ir_node *irn = node->node;
1522 node_t *block = get_irn_node(get_nodes_block(irn));
1524 if (block->type.tv == tarval_unreachable) {
1525 node->type.tv = tarval_top;
1529 /* if any of the data inputs have type top, the result is type top */
1530 for (i = get_irn_arity(irn) - 1; i >= 0; --i) {
1531 ir_node *pred = get_irn_n(irn, i);
1532 node_t *p = get_irn_node(pred);
1534 if (p->type.tv == tarval_top) {
1535 node->type.tv = tarval_top;
1540 if (get_irn_mode(node->node) == mode_X)
1541 node->type.tv = tarval_reachable;
1543 node->type.tv = computed_value(irn);
1544 } /* default_compute */
1547 * (Re-)compute the type for a Block node.
1549 * @param node the node
1551 static void compute_Block(node_t *node) {
1553 ir_node *block = node->node;
1555 if (block == get_irg_start_block(current_ir_graph)) {
1556 /* start block is always reachable */
1557 node->type.tv = tarval_reachable;
1561 for (i = get_Block_n_cfgpreds(block) - 1; i >= 0; --i) {
1562 node_t *pred = get_irn_node(get_Block_cfgpred(block, i));
1564 if (pred->type.tv == tarval_reachable) {
1565 /* A block is reachable, if at least of predecessor is reachable. */
1566 node->type.tv = tarval_reachable;
1570 node->type.tv = tarval_top;
1571 } /* compute_Block */
1574 * (Re-)compute the type for a Bad node.
1576 * @param node the node
1578 static void compute_Bad(node_t *node) {
1579 /* Bad nodes ALWAYS compute Top */
1580 node->type.tv = tarval_top;
1584 * (Re-)compute the type for an Unknown node.
1586 * @param node the node
1588 static void compute_Unknown(node_t *node) {
1589 /* While Unknown nodes should compute Top this is dangerous:
1590 * a Top input to a Cond would lead to BOTH control flows unreachable.
1591 * While this is correct in the given semantics, it would destroy the Firm
1594 * It would be safe to compute Top IF it can be assured, that only Cmp
1595 * nodes are inputs to Conds. We check that first.
1596 * This is the way Frontends typically build Firm, but some optimizations
1597 * (cond_eval for instance) might replace them by Phib's...
1599 node->type.tv = tarval_UNKNOWN;
1600 } /* compute_Unknown */
1603 * (Re-)compute the type for a Jmp node.
1605 * @param node the node
1607 static void compute_Jmp(node_t *node) {
1608 node_t *block = get_irn_node(get_nodes_block(node->node));
1610 node->type = block->type;
1614 * (Re-)compute the type for the End node.
1616 * @param node the node
1618 static void compute_End(node_t *node) {
1619 /* the End node is NOT dead of course */
1620 node->type.tv = tarval_reachable;
1624 * (Re-)compute the type for a SymConst node.
1626 * @param node the node
1628 static void compute_SymConst(node_t *node) {
1629 ir_node *irn = node->node;
1630 node_t *block = get_irn_node(get_nodes_block(irn));
1632 if (block->type.tv == tarval_unreachable) {
1633 node->type.tv = tarval_top;
1636 switch (get_SymConst_kind(irn)) {
1637 case symconst_addr_ent:
1638 /* case symconst_addr_name: cannot handle this yet */
1639 node->type.sym = get_SymConst_symbol(irn);
1642 node->type.tv = computed_value(irn);
1644 } /* compute_SymConst */
1647 * (Re-)compute the type for a Phi node.
1649 * @param node the node
1651 static void compute_Phi(node_t *node) {
1653 ir_node *phi = node->node;
1654 lattice_elem_t type;
1656 /* if a Phi is in a unreachable block, its type is TOP */
1657 node_t *block = get_irn_node(get_nodes_block(phi));
1659 if (block->type.tv == tarval_unreachable) {
1660 node->type.tv = tarval_top;
1664 /* Phi implements the Meet operation */
1665 type.tv = tarval_top;
1666 for (i = get_Phi_n_preds(phi) - 1; i >= 0; --i) {
1667 node_t *pred = get_irn_node(get_Phi_pred(phi, i));
1668 node_t *pred_X = get_irn_node(get_Block_cfgpred(block->node, i));
1670 if (pred_X->type.tv == tarval_unreachable || pred->type.tv == tarval_top) {
1671 /* ignore TOP inputs: We must check here for unreachable blocks,
1672 because Firm constants live in the Start Block are NEVER Top.
1673 Else, a Phi (1,2) will produce Bottom, even if the 2 for instance
1674 comes from a unreachable input. */
1677 if (pred->type.tv == tarval_bottom) {
1678 node->type.tv = tarval_bottom;
1680 } else if (type.tv == tarval_top) {
1681 /* first constant found */
1683 } else if (type.tv != pred->type.tv) {
1684 /* different constants or tarval_bottom */
1685 node->type.tv = tarval_bottom;
1688 /* else nothing, constants are the same */
1694 * (Re-)compute the type for an Add. Special case: one nodes is a Zero Const.
1696 * @param node the node
1698 static void compute_Add(node_t *node) {
1699 ir_node *sub = node->node;
1700 node_t *l = get_irn_node(get_Add_left(sub));
1701 node_t *r = get_irn_node(get_Add_right(sub));
1702 lattice_elem_t a = l->type;
1703 lattice_elem_t b = r->type;
1706 if (a.tv == tarval_top || b.tv == tarval_top) {
1707 node->type.tv = tarval_top;
1708 } else if (a.tv == tarval_bottom || b.tv == tarval_bottom) {
1709 node->type.tv = tarval_bottom;
1711 /* x + 0 = 0 + x = x, but beware of floating point +0 + -0, so we
1712 must call tarval_add() first to handle this case! */
1713 if (is_tarval(a.tv)) {
1714 if (is_tarval(b.tv)) {
1715 node->type.tv = tarval_add(a.tv, b.tv);
1718 mode = get_tarval_mode(a.tv);
1719 if (a.tv == get_mode_null(mode)) {
1723 } else if (is_tarval(b.tv)) {
1724 mode = get_tarval_mode(b.tv);
1725 if (b.tv == get_mode_null(mode)) {
1730 node->type.tv = tarval_bottom;
1735 * (Re-)compute the type for a Sub. Special case: both nodes are congruent.
1737 * @param node the node
1739 static void compute_Sub(node_t *node) {
1740 ir_node *sub = node->node;
1741 node_t *l = get_irn_node(get_Sub_left(sub));
1742 node_t *r = get_irn_node(get_Sub_right(sub));
1743 lattice_elem_t a = l->type;
1744 lattice_elem_t b = r->type;
1747 if (a.tv == tarval_top || b.tv == tarval_top) {
1748 node->type.tv = tarval_top;
1749 } else if (is_con(a) && is_con(b)) {
1750 if (is_tarval(a.tv) && is_tarval(b.tv)) {
1751 node->type.tv = tarval_sub(a.tv, b.tv, get_irn_mode(sub));
1752 } else if (is_tarval(a.tv) && tarval_is_null(a.tv)) {
1754 } else if (is_tarval(b.tv) && tarval_is_null(b.tv)) {
1757 node->type.tv = tarval_bottom;
1759 node->by_all_const = 1;
1760 } else if (r->part == l->part &&
1761 (!mode_is_float(get_irn_mode(l->node)))) {
1763 * BEWARE: a - a is NOT always 0 for floating Point values, as
1764 * NaN op NaN = NaN, so we must check this here.
1766 ir_mode *mode = get_irn_mode(sub);
1767 tv = get_mode_null(mode);
1769 /* if the node was ONCE evaluated by all constants, but now
1770 this breakes AND we cat by partition a different result, switch to bottom.
1771 This happens because initially all nodes are in the same partition ... */
1772 if (node->by_all_const && node->type.tv != tv)
1776 node->type.tv = tarval_bottom;
1781 * (Re-)compute the type for an Eor. Special case: both nodes are congruent.
1783 * @param node the node
1785 static void compute_Eor(node_t *node) {
1786 ir_node *eor = node->node;
1787 node_t *l = get_irn_node(get_Eor_left(eor));
1788 node_t *r = get_irn_node(get_Eor_right(eor));
1789 lattice_elem_t a = l->type;
1790 lattice_elem_t b = r->type;
1793 if (a.tv == tarval_top || b.tv == tarval_top) {
1794 node->type.tv = tarval_top;
1795 } else if (is_con(a) && is_con(b)) {
1796 if (is_tarval(a.tv) && is_tarval(b.tv)) {
1797 node->type.tv = tarval_eor(a.tv, b.tv);
1798 } else if (is_tarval(a.tv) && tarval_is_null(a.tv)) {
1800 } else if (is_tarval(b.tv) && tarval_is_null(b.tv)) {
1803 node->type.tv = tarval_bottom;
1805 node->by_all_const = 1;
1806 } else if (r->part == l->part) {
1807 ir_mode *mode = get_irn_mode(eor);
1808 tv = get_mode_null(mode);
1810 /* if the node was ONCE evaluated by all constants, but now
1811 this breakes AND we cat by partition a different result, switch to bottom.
1812 This happens because initially all nodes are in the same partition ... */
1813 if (node->by_all_const && node->type.tv != tv)
1817 node->type.tv = tarval_bottom;
1822 * (Re-)compute the type for Cmp.
1824 * @param node the node
1826 static void compute_Cmp(node_t *node) {
1827 ir_node *cmp = node->node;
1828 node_t *l = get_irn_node(get_Cmp_left(cmp));
1829 node_t *r = get_irn_node(get_Cmp_right(cmp));
1830 lattice_elem_t a = l->type;
1831 lattice_elem_t b = r->type;
1833 if (a.tv == tarval_top || b.tv == tarval_top) {
1836 * Top is congruent to any other value, we can
1837 * calculate the compare result.
1839 node->type.tv = tarval_b_true;
1841 node->type.tv = tarval_top;
1843 } else if (is_con(a) && is_con(b)) {
1844 /* both nodes are constants, we can probably do something */
1845 node->type.tv = tarval_b_true;
1846 } else if (r->part == l->part) {
1847 /* both nodes congruent, we can probably do something */
1848 node->type.tv = tarval_b_true;
1850 node->type.tv = tarval_bottom;
1852 } /* compute_Proj_Cmp */
1855 * (Re-)compute the type for a Proj(Cmp).
1857 * @param node the node
1858 * @param cond the predecessor Cmp node
1860 static void compute_Proj_Cmp(node_t *node, ir_node *cmp) {
1861 ir_node *proj = node->node;
1862 node_t *l = get_irn_node(get_Cmp_left(cmp));
1863 node_t *r = get_irn_node(get_Cmp_right(cmp));
1864 lattice_elem_t a = l->type;
1865 lattice_elem_t b = r->type;
1866 pn_Cmp pnc = get_Proj_proj(proj);
1869 if (a.tv == tarval_top || b.tv == tarval_top) {
1872 tv = new_tarval_from_long((pnc & pn_Cmp_Eq) ^ pn_Cmp_Eq, mode_b);
1875 node->type.tv = tarval_top;
1877 } else if (is_con(a) && is_con(b)) {
1878 default_compute(node);
1879 node->by_all_const = 1;
1880 } else if (r->part == l->part &&
1881 (!mode_is_float(get_irn_mode(l->node)) || pnc == pn_Cmp_Lt || pnc == pn_Cmp_Gt)) {
1883 * BEWARE: a == a is NOT always True for floating Point values, as
1884 * NaN != NaN is defined, so we must check this here.
1886 tv = new_tarval_from_long(pnc & pn_Cmp_Eq, mode_b);
1891 /* if the node was ONCE evaluated by all constants, but now
1892 this breakes AND we cat by partition a different result, switch to bottom.
1893 This happens because initially all nodes are in the same partition ... */
1894 if (node->by_all_const && node->type.tv != tv)
1898 node->type.tv = tarval_bottom;
1900 } /* compute_Proj_Cmp */
1903 * (Re-)compute the type for a Proj(Cond).
1905 * @param node the node
1906 * @param cond the predecessor Cond node
1908 static void compute_Proj_Cond(node_t *node, ir_node *cond) {
1909 ir_node *proj = node->node;
1910 long pnc = get_Proj_proj(proj);
1911 ir_node *sel = get_Cond_selector(cond);
1912 node_t *selector = get_irn_node(sel);
1914 if (get_irn_mode(sel) == mode_b) {
1916 if (pnc == pn_Cond_true) {
1917 if (selector->type.tv == tarval_b_false) {
1918 node->type.tv = tarval_unreachable;
1919 } else if (selector->type.tv == tarval_b_true) {
1920 node->type.tv = tarval_reachable;
1921 } else if (selector->type.tv == tarval_bottom) {
1922 node->type.tv = tarval_reachable;
1924 assert(selector->type.tv == tarval_top);
1925 node->type.tv = tarval_unreachable;
1928 assert(pnc == pn_Cond_false);
1930 if (selector->type.tv == tarval_b_false) {
1931 node->type.tv = tarval_reachable;
1932 } else if (selector->type.tv == tarval_b_true) {
1933 node->type.tv = tarval_unreachable;
1934 } else if (selector->type.tv == tarval_bottom) {
1935 node->type.tv = tarval_reachable;
1937 assert(selector->type.tv == tarval_top);
1938 node->type.tv = tarval_unreachable;
1943 if (selector->type.tv == tarval_bottom) {
1944 node->type.tv = tarval_reachable;
1945 } else if (selector->type.tv == tarval_top) {
1946 node->type.tv = tarval_unreachable;
1948 long value = get_tarval_long(selector->type.tv);
1949 if (pnc == get_Cond_defaultProj(cond)) {
1950 /* default switch, have to check ALL other cases */
1953 for (i = get_irn_n_outs(cond) - 1; i >= 0; --i) {
1954 ir_node *succ = get_irn_out(cond, i);
1958 if (value == get_Proj_proj(succ)) {
1959 /* we found a match, will NOT take the default case */
1960 node->type.tv = tarval_unreachable;
1964 /* all cases checked, no match, will take default case */
1965 node->type.tv = tarval_reachable;
1968 node->type.tv = value == pnc ? tarval_reachable : tarval_unreachable;
1972 } /* compute_Proj_Cond */
1975 * (Re-)compute the type for a Proj-Node.
1977 * @param node the node
1979 static void compute_Proj(node_t *node) {
1980 ir_node *proj = node->node;
1981 ir_mode *mode = get_irn_mode(proj);
1982 node_t *block = get_irn_node(get_nodes_block(skip_Proj(proj)));
1983 ir_node *pred = get_Proj_pred(proj);
1985 if (block->type.tv == tarval_unreachable) {
1986 /* a Proj in a unreachable Block stay Top */
1987 node->type.tv = tarval_top;
1990 if (get_irn_node(pred)->type.tv == tarval_top) {
1991 /* if the predecessor is Top, its Proj follow */
1992 node->type.tv = tarval_top;
1996 if (mode == mode_M) {
1997 /* mode M is always bottom */
1998 node->type.tv = tarval_bottom;
2001 if (mode != mode_X) {
2003 compute_Proj_Cmp(node, pred);
2005 default_compute(node);
2008 /* handle mode_X nodes */
2010 switch (get_irn_opcode(pred)) {
2012 /* the Proj_X from the Start is always reachable.
2013 However this is already handled at the top. */
2014 node->type.tv = tarval_reachable;
2017 compute_Proj_Cond(node, pred);
2020 default_compute(node);
2022 } /* compute_Proj */
2025 * (Re-)compute the type for a Confirm.
2027 * @param node the node
2029 static void compute_Confirm(node_t *node) {
2030 ir_node *confirm = node->node;
2031 node_t *pred = get_irn_node(get_Confirm_value(confirm));
2033 if (get_Confirm_cmp(confirm) == pn_Cmp_Eq) {
2034 node_t *bound = get_irn_node(get_Confirm_bound(confirm));
2036 if (is_con(bound->type)) {
2037 /* is equal to a constant */
2038 node->type = bound->type;
2042 /* a Confirm is a copy OR a Const */
2043 node->type = pred->type;
2044 } /* compute_Confirm */
2047 * (Re-)compute the type for a Max.
2049 * @param node the node
2051 static void compute_Max(node_t *node) {
2052 ir_node *op = node->node;
2053 node_t *l = get_irn_node(get_binop_left(op));
2054 node_t *r = get_irn_node(get_binop_right(op));
2055 lattice_elem_t a = l->type;
2056 lattice_elem_t b = r->type;
2058 if (a.tv == tarval_top || b.tv == tarval_top) {
2059 node->type.tv = tarval_top;
2060 } else if (is_con(a) && is_con(b)) {
2061 /* both nodes are constants, we can probably do something */
2063 /* this case handles symconsts as well */
2066 ir_mode *mode = get_irn_mode(op);
2067 tarval *tv_min = get_mode_min(mode);
2071 else if (b.tv == tv_min)
2073 else if (is_tarval(a.tv) && is_tarval(b.tv)) {
2074 if (tarval_cmp(a.tv, b.tv) & pn_Cmp_Gt)
2075 node->type.tv = a.tv;
2077 node->type.tv = b.tv;
2079 node->type.tv = tarval_bad;
2082 } else if (r->part == l->part) {
2083 /* both nodes congruent, we can probably do something */
2086 node->type.tv = tarval_bottom;
2091 * (Re-)compute the type for a Min.
2093 * @param node the node
2095 static void compute_Min(node_t *node) {
2096 ir_node *op = node->node;
2097 node_t *l = get_irn_node(get_binop_left(op));
2098 node_t *r = get_irn_node(get_binop_right(op));
2099 lattice_elem_t a = l->type;
2100 lattice_elem_t b = r->type;
2102 if (a.tv == tarval_top || b.tv == tarval_top) {
2103 node->type.tv = tarval_top;
2104 } else if (is_con(a) && is_con(b)) {
2105 /* both nodes are constants, we can probably do something */
2107 /* this case handles symconsts as well */
2110 ir_mode *mode = get_irn_mode(op);
2111 tarval *tv_max = get_mode_max(mode);
2115 else if (b.tv == tv_max)
2117 else if (is_tarval(a.tv) && is_tarval(b.tv)) {
2118 if (tarval_cmp(a.tv, b.tv) & pn_Cmp_Gt)
2119 node->type.tv = a.tv;
2121 node->type.tv = b.tv;
2123 node->type.tv = tarval_bad;
2126 } else if (r->part == l->part) {
2127 /* both nodes congruent, we can probably do something */
2130 node->type.tv = tarval_bottom;
2135 * (Re-)compute the type for a given node.
2137 * @param node the node
2139 static void compute(node_t *node) {
2142 if (is_no_Block(node->node)) {
2143 node_t *block = get_irn_node(get_nodes_block(node->node));
2145 if (block->type.tv == tarval_unreachable) {
2146 node->type.tv = tarval_top;
2151 func = (compute_func)node->node->op->ops.generic;
2157 * Identity functions: Note that one might thing that identity() is just a
2158 * synonym for equivalent_node(). While this is true, we cannot use it for the algorithm
2159 * here, because it expects that the identity node is one of the inputs, which is NOT
2160 * always true for equivalent_node() which can handle (and does sometimes) DAGs.
2161 * So, we have our own implementation, which copies some parts of equivalent_node()
2165 * Calculates the Identity for Phi nodes
2167 static node_t *identity_Phi(node_t *node) {
2168 ir_node *phi = node->node;
2169 ir_node *block = get_nodes_block(phi);
2170 node_t *n_part = NULL;
2173 for (i = get_Phi_n_preds(phi) - 1; i >= 0; --i) {
2174 node_t *pred_X = get_irn_node(get_Block_cfgpred(block, i));
2176 if (pred_X->type.tv == tarval_reachable) {
2177 node_t *pred = get_irn_node(get_Phi_pred(phi, i));
2181 else if (n_part->part != pred->part) {
2182 /* incongruent inputs, not a follower */
2187 /* if n_part is NULL here, all inputs path are dead, the Phi computes
2188 * tarval_top, is in the TOP partition and should NOT being split! */
2189 assert(n_part != NULL);
2191 } /* identity_Phi */
2194 * Calculates the Identity for commutative 0 neutral nodes.
2196 static node_t *identity_comm_zero_binop(node_t *node) {
2197 ir_node *op = node->node;
2198 node_t *a = get_irn_node(get_binop_left(op));
2199 node_t *b = get_irn_node(get_binop_right(op));
2200 ir_mode *mode = get_irn_mode(op);
2203 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2204 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2207 /* node: no input should be tarval_top, else the binop would be also
2208 * Top and not being split. */
2209 zero = get_mode_null(mode);
2210 if (a->type.tv == zero)
2212 if (b->type.tv == zero)
2215 } /* identity_comm_zero_binop */
2218 * Calculates the Identity for Shift nodes.
2220 static node_t *identity_shift(node_t *node) {
2221 ir_node *op = node->node;
2222 node_t *b = get_irn_node(get_binop_right(op));
2223 ir_mode *mode = get_irn_mode(b->node);
2226 /* node: no input should be tarval_top, else the binop would be also
2227 * Top and not being split. */
2228 zero = get_mode_null(mode);
2229 if (b->type.tv == zero)
2230 return get_irn_node(get_binop_left(op));
2232 } /* identity_shift */
2235 * Calculates the Identity for Mul nodes.
2237 static node_t *identity_Mul(node_t *node) {
2238 ir_node *op = node->node;
2239 node_t *a = get_irn_node(get_Mul_left(op));
2240 node_t *b = get_irn_node(get_Mul_right(op));
2241 ir_mode *mode = get_irn_mode(op);
2244 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2245 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2248 /* node: no input should be tarval_top, else the binop would be also
2249 * Top and not being split. */
2250 one = get_mode_one(mode);
2251 if (a->type.tv == one)
2253 if (b->type.tv == one)
2256 } /* identity_Mul */
2259 * Calculates the Identity for Sub nodes.
2261 static node_t *identity_Sub(node_t *node) {
2262 ir_node *sub = node->node;
2263 node_t *b = get_irn_node(get_Sub_right(sub));
2264 ir_mode *mode = get_irn_mode(sub);
2266 /* for FP these optimizations are only allowed if fp_strict_algebraic is disabled */
2267 if (mode_is_float(mode) && (get_irg_fp_model(current_ir_graph) & fp_strict_algebraic))
2270 /* node: no input should be tarval_top, else the binop would be also
2271 * Top and not being split. */
2272 if (b->type.tv == get_mode_null(mode))
2273 return get_irn_node(get_Sub_left(sub));
2275 } /* identity_Mul */
2278 * Calculates the Identity for And nodes.
2280 static node_t *identity_And(node_t *node) {
2281 ir_node *and = node->node;
2282 node_t *a = get_irn_node(get_And_left(and));
2283 node_t *b = get_irn_node(get_And_right(and));
2284 tarval *neutral = get_mode_all_one(get_irn_mode(and));
2286 /* node: no input should be tarval_top, else the And would be also
2287 * Top and not being split. */
2288 if (a->type.tv == neutral)
2290 if (b->type.tv == neutral)
2293 } /* identity_And */
2296 * Calculates the Identity for Confirm nodes.
2298 static node_t *identity_Confirm(node_t *node) {
2299 ir_node *confirm = node->node;
2301 /* a Confirm is always a Copy */
2302 return get_irn_node(get_Confirm_value(confirm));
2303 } /* identity_Confirm */
2306 * Calculates the Identity for Mux nodes.
2308 static node_t *identity_Mux(node_t *node) {
2309 ir_node *mux = node->node;
2310 node_t *t = get_irn_node(get_Mux_true(mux));
2311 node_t *f = get_irn_node(get_Mux_false(mux));
2314 if (t->part == f->part)
2317 /* for now, the 1-input identity is not supported */
2319 sel = get_irn_node(get_Mux_sel(mux));
2321 /* Mux sel input is mode_b, so it is always a tarval */
2322 if (sel->type.tv == tarval_b_true)
2324 if (sel->type.tv == tarval_b_false)
2328 } /* identity_Mux */
2331 * Calculates the Identity for Min nodes.
2333 static node_t *identity_Min(node_t *node) {
2334 ir_node *op = node->node;
2335 node_t *a = get_irn_node(get_binop_left(op));
2336 node_t *b = get_irn_node(get_binop_right(op));
2337 ir_mode *mode = get_irn_mode(op);
2340 if (a->part == b->part) {
2341 /* leader of multiple predecessors */
2345 /* works even with NaN */
2346 tv_max = get_mode_max(mode);
2347 if (a->type.tv == tv_max)
2349 if (b->type.tv == tv_max)
2352 } /* identity_Min */
2355 * Calculates the Identity for Max nodes.
2357 static node_t *identity_Max(node_t *node) {
2358 ir_node *op = node->node;
2359 node_t *a = get_irn_node(get_binop_left(op));
2360 node_t *b = get_irn_node(get_binop_right(op));
2361 ir_mode *mode = get_irn_mode(op);
2364 if (a->part == b->part) {
2365 /* leader of multiple predecessors */
2369 /* works even with NaN */
2370 tv_min = get_mode_min(mode);
2371 if (a->type.tv == tv_min)
2373 if (b->type.tv == tv_min)
2376 } /* identity_Max */
2379 * Calculates the Identity for nodes.
2381 static node_t *identity(node_t *node) {
2382 ir_node *irn = node->node;
2384 switch (get_irn_opcode(irn)) {
2386 return identity_Phi(node);
2388 return identity_Mul(node);
2392 return identity_comm_zero_binop(node);
2397 return identity_shift(node);
2399 return identity_And(node);
2401 return identity_Sub(node);
2403 return identity_Confirm(node);
2405 return identity_Mux(node);
2407 return identity_Min(node);
2409 return identity_Max(node);
2416 * Node follower is a (new) follower of leader, segregate Leader
2419 static void segregate_def_use_chain_1(const ir_node *follower, node_t *leader) {
2420 ir_node *l = leader->node;
2421 int j, i, n = get_irn_n_outs(l);
2423 DB((dbg, LEVEL_2, "%+F is a follower of %+F\n", follower, leader->node));
2424 /* The leader edges must remain sorted, but follower edges can
2426 for (i = leader->n_followers + 1; i <= n; ++i) {
2427 if (l->out[i].use == follower) {
2428 ir_def_use_edge t = l->out[i];
2430 for (j = i - 1; j >= leader->n_followers + 1; --j)
2431 l->out[j + 1] = l->out[j];
2432 ++leader->n_followers;
2433 l->out[leader->n_followers] = t;
2437 } /* segregate_def_use_chain_1 */
2440 * Node follower is a (new) follower of leader, segregate Leader
2441 * out edges. If follower is a n-congruent Input identity, all follower
2442 * inputs congruent to follower are also leader.
2444 * @param follower the follower IR node
2446 static void segregate_def_use_chain(const ir_node *follower) {
2449 for (i = get_irn_arity(follower) - 1; i >= 0; --i) {
2450 node_t *pred = get_irn_node(get_irn_n(follower, i));
2452 segregate_def_use_chain_1(follower, pred);
2454 } /* segregate_def_use_chain */
2457 * Propagate constant evaluation.
2459 * @param env the environment
2461 static void propagate(environment_t *env) {
2464 lattice_elem_t old_type;
2466 unsigned n_fallen, old_type_was_T_or_C;
2469 while (env->cprop != NULL) {
2470 void *oldopcode = NULL;
2472 /* remove the first partition X from cprop */
2475 env->cprop = X->cprop_next;
2477 old_type_was_T_or_C = X->type_is_T_or_C;
2479 DB((dbg, LEVEL_2, "Propagate type on part%d\n", X->nr));
2482 while (! list_empty(&X->cprop)) {
2483 /* remove the first Node x from X.cprop */
2484 x = list_entry(X->cprop.next, node_t, cprop_list);
2485 //assert(x->part == X);
2486 list_del(&x->cprop_list);
2489 if (x->is_follower && identity(x) == x) {
2490 /* check the opcode first */
2491 if (oldopcode == NULL) {
2492 oldopcode = lambda_opcode(get_first_node(X), env);
2494 if (oldopcode != lambda_opcode(x, env)) {
2495 if (x->on_fallen == 0) {
2496 /* different opcode -> x falls out of this partition */
2501 DB((dbg, LEVEL_2, "Add node %+F to fallen\n", x->node));
2505 /* x will make the follower -> leader transition */
2506 follower_to_leader(x);
2509 /* compute a new type for x */
2511 DB((dbg, LEVEL_3, "computing type of %+F\n", x->node));
2513 if (x->type.tv != old_type.tv) {
2514 verify_type(old_type, x->type);
2515 DB((dbg, LEVEL_2, "node %+F has changed type from %+F to %+F\n", x->node, old_type, x->type));
2517 if (x->on_fallen == 0) {
2518 /* Add x to fallen. Nodes might fall from T -> const -> _|_, so check that they are
2519 not already on the list. */
2524 DB((dbg, LEVEL_2, "Add node %+F to fallen\n", x->node));
2526 for (i = get_irn_n_outs(x->node) - 1; i >= 0; --i) {
2527 ir_node *succ = get_irn_out(x->node, i);
2528 node_t *y = get_irn_node(succ);
2530 /* Add y to y.partition.cprop. */
2531 add_to_cprop(y, env);
2536 if (n_fallen > 0 && n_fallen != X->n_leader) {
2537 DB((dbg, LEVEL_2, "Splitting part%d by fallen\n", X->nr));
2538 Y = split(&X, fallen, env);
2540 * We have split out fallen node. The type of the result
2541 * partition is NOT set yet.
2543 Y->type_is_T_or_C = 0;
2547 /* remove the flags from the fallen list */
2548 for (x = fallen; x != NULL; x = x->next)
2551 if (old_type_was_T_or_C) {
2554 if (Y->on_worklist == 0)
2555 add_to_worklist(Y, env);
2557 /* check if some nodes will make the leader -> follower transition */
2558 list_for_each_entry_safe(node_t, y, tmp, &Y->Leader, node_list) {
2559 if (y->type.tv != tarval_top && ! is_con(y->type)) {
2560 node_t *eq_node = identity(y);
2562 if (eq_node != y && eq_node->part == y->part) {
2563 DB((dbg, LEVEL_2, "Node %+F is a follower of %+F\n", y->node, eq_node->node));
2564 /* move to Follower */
2566 list_del(&y->node_list);
2567 list_add_tail(&y->node_list, &Y->Follower);
2570 segregate_def_use_chain(y->node);
2580 * Get the leader for a given node from its congruence class.
2582 * @param irn the node
2584 static ir_node *get_leader(node_t *node) {
2585 partition_t *part = node->part;
2587 if (part->n_leader > 1 || node->is_follower) {
2588 if (node->is_follower) {
2589 DB((dbg, LEVEL_2, "Replacing follower %+F\n", node->node));
2592 DB((dbg, LEVEL_2, "Found congruence class for %+F\n", node->node));
2594 return get_first_node(part)->node;
2600 * Return non-zero if the control flow predecessor node pred
2601 * is the only reachable control flow exit of its block.
2603 * @param pred the control flow exit
2605 static int can_exchange(ir_node *pred) {
2608 else if (is_Jmp(pred))
2610 else if (get_irn_mode(pred) == mode_T) {
2613 /* if the predecessor block has more than one
2614 reachable outputs we cannot remove the block */
2616 for (i = get_irn_n_outs(pred) - 1; i >= 0; --i) {
2617 ir_node *proj = get_irn_out(pred, i);
2620 /* skip non-control flow Proj's */
2621 if (get_irn_mode(proj) != mode_X)
2624 node = get_irn_node(proj);
2625 if (node->type.tv == tarval_reachable) {
2633 } /* can_exchange */
2636 * Block Post-Walker, apply the analysis results on control flow by
2637 * shortening Phi's and Block inputs.
2639 static void apply_cf(ir_node *block, void *ctx) {
2640 environment_t *env = ctx;
2641 node_t *node = get_irn_node(block);
2643 ir_node **ins, **in_X;
2644 ir_node *phi, *next;
2646 n = get_Block_n_cfgpreds(block);
2648 if (node->type.tv == tarval_unreachable) {
2651 for (i = n - 1; i >= 0; --i) {
2652 ir_node *pred = get_Block_cfgpred(block, i);
2654 if (! is_Bad(pred)) {
2655 node_t *pred_bl = get_irn_node(get_nodes_block(skip_Proj(pred)));
2657 if (pred_bl->flagged == 0) {
2658 pred_bl->flagged = 3;
2660 if (pred_bl->type.tv == tarval_reachable) {
2662 * We will remove an edge from block to its pred.
2663 * This might leave the pred block as an endless loop
2665 if (! is_backedge(block, i))
2666 keep_alive(pred_bl->node);
2672 /* the EndBlock is always reachable even if the analysis
2673 finds out the opposite :-) */
2674 if (block != get_irg_end_block(current_ir_graph)) {
2675 /* mark dead blocks */
2676 set_Block_dead(block);
2677 DB((dbg, LEVEL_1, "Removing dead %+F\n", block));
2679 /* the endblock is unreachable */
2680 set_irn_in(block, 0, NULL);
2686 /* only one predecessor combine */
2687 ir_node *pred = skip_Proj(get_Block_cfgpred(block, 0));
2689 if (can_exchange(pred)) {
2690 ir_node *new_block = get_nodes_block(pred);
2691 DB((dbg, LEVEL_1, "Fuse %+F with %+F\n", block, new_block));
2692 DBG_OPT_COMBO(block, new_block, FS_OPT_COMBO_CF);
2693 exchange(block, new_block);
2694 node->node = new_block;
2700 NEW_ARR_A(ir_node *, in_X, n);
2702 for (i = 0; i < n; ++i) {
2703 ir_node *pred = get_Block_cfgpred(block, i);
2704 node_t *node = get_irn_node(pred);
2706 if (node->type.tv == tarval_reachable) {
2709 DB((dbg, LEVEL_1, "Removing dead input %d from %+F (%+F)\n", i, block, pred));
2710 if (! is_Bad(pred)) {
2711 node_t *pred_bl = get_irn_node(get_nodes_block(skip_Proj(pred)));
2713 if (pred_bl->flagged == 0) {
2714 pred_bl->flagged = 3;
2716 if (pred_bl->type.tv == tarval_reachable) {
2718 * We will remove an edge from block to its pred.
2719 * This might leave the pred block as an endless loop
2721 if (! is_backedge(block, i))
2722 keep_alive(pred_bl->node);
2731 NEW_ARR_A(ir_node *, ins, n);
2732 for (phi = get_Block_phis(block); phi != NULL; phi = next) {
2733 node_t *node = get_irn_node(phi);
2735 next = get_Phi_next(phi);
2736 if (is_tarval(node->type.tv) && tarval_is_constant(node->type.tv)) {
2737 /* this Phi is replaced by a constant */
2738 tarval *tv = node->type.tv;
2739 ir_node *c = new_r_Const(current_ir_graph, block, get_tarval_mode(tv), tv);
2741 set_irn_node(c, node);
2743 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", phi, c));
2744 DBG_OPT_COMBO(phi, c, FS_OPT_COMBO_CONST);
2749 for (i = 0; i < n; ++i) {
2750 node_t *pred = get_irn_node(get_Block_cfgpred(block, i));
2752 if (pred->type.tv == tarval_reachable) {
2753 ins[j++] = get_Phi_pred(phi, i);
2757 /* this Phi is replaced by a single predecessor */
2758 ir_node *s = ins[0];
2759 node_t *phi_node = get_irn_node(phi);
2762 DB((dbg, LEVEL_1, "%+F is replaced by %+F because of cf change\n", phi, s));
2763 DBG_OPT_COMBO(phi, s, FS_OPT_COMBO_FOLLOWER);
2768 set_irn_in(phi, j, ins);
2775 /* this Block has only one live predecessor */
2776 ir_node *pred = skip_Proj(in_X[0]);
2778 if (can_exchange(pred)) {
2779 ir_node *new_block = get_nodes_block(pred);
2780 DBG_OPT_COMBO(block, new_block, FS_OPT_COMBO_CF);
2781 exchange(block, new_block);
2782 node->node = new_block;
2786 set_irn_in(block, k, in_X);
2792 * Post-Walker, apply the analysis results;
2794 static void apply_result(ir_node *irn, void *ctx) {
2795 environment_t *env = ctx;
2796 node_t *node = get_irn_node(irn);
2798 if (is_Block(irn) || is_End(irn) || is_Bad(irn)) {
2799 /* blocks already handled, do not touch the End node */
2801 node_t *block = get_irn_node(get_nodes_block(irn));
2803 if (block->type.tv == tarval_unreachable) {
2804 ir_node *bad = get_irg_bad(current_ir_graph);
2806 /* here, bad might already have a node, but this can be safely ignored
2807 as long as bad has at least ONE valid node */
2808 set_irn_node(bad, node);
2810 DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
2814 else if (node->type.tv == tarval_unreachable) {
2815 /* don't kick away Unknown */
2816 if (! is_Unknown(irn)) {
2817 ir_node *bad = get_irg_bad(current_ir_graph);
2819 /* see comment above */
2820 set_irn_node(bad, node);
2822 DB((dbg, LEVEL_1, "%+F is unreachable\n", irn));
2827 else if (get_irn_mode(irn) == mode_X) {
2830 ir_node *cond = get_Proj_pred(irn);
2832 if (is_Cond(cond)) {
2833 node_t *sel = get_irn_node(get_Cond_selector(cond));
2835 if (is_tarval(sel->type.tv) && tarval_is_constant(sel->type.tv)) {
2836 /* Cond selector is a constant and the Proj is reachable, make a Jmp */
2837 ir_node *jmp = new_r_Jmp(current_ir_graph, block->node);
2838 set_irn_node(jmp, node);
2840 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, jmp));
2841 DBG_OPT_COMBO(irn, jmp, FS_OPT_COMBO_CF);
2848 /* normal data node */
2849 if (is_tarval(node->type.tv) && tarval_is_constant(node->type.tv)) {
2850 tarval *tv = node->type.tv;
2853 * Beware: never replace mode_T nodes by constants. Currently we must mark
2854 * mode_T nodes with constants, but do NOT replace them.
2856 if (! is_Const(irn) && get_irn_mode(irn) != mode_T) {
2857 /* can be replaced by a constant */
2858 ir_node *c = new_r_Const(current_ir_graph, block->node, get_tarval_mode(tv), tv);
2859 set_irn_node(c, node);
2861 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, c));
2862 DBG_OPT_COMBO(irn, c, FS_OPT_COMBO_CONST);
2866 } else if (is_entity(node->type.sym.entity_p)) {
2867 if (! is_SymConst(irn)) {
2868 /* can be replaced by a Symconst */
2869 ir_node *symc = new_r_SymConst(current_ir_graph, block->node, get_irn_mode(irn), node->type.sym, symconst_addr_ent);
2870 set_irn_node(symc, node);
2873 DB((dbg, LEVEL_1, "%+F is replaced by %+F\n", irn, symc));
2874 DBG_OPT_COMBO(irn, symc, FS_OPT_COMBO_CONST);
2875 exchange(irn, symc);
2878 } else if (is_Confirm(irn)) {
2879 /* Confirms are always follower, but do not kill them here */
2881 ir_node *leader = get_leader(node);
2883 if (leader != irn) {
2884 DB((dbg, LEVEL_1, "%+F from part%d is replaced by %+F\n", irn, node->part->nr, leader));
2885 if (node->is_follower)
2886 DBG_OPT_COMBO(irn, leader, FS_OPT_COMBO_FOLLOWER);
2888 DBG_OPT_COMBO(irn, leader, FS_OPT_COMBO_CONGRUENT);
2889 exchange(irn, leader);
2895 } /* apply_result */
2898 * Fix the keep-alives by deleting unreachable ones.
2900 static void apply_end(ir_node *end, environment_t *env) {
2901 int i, j, n = get_End_n_keepalives(end);
2905 NEW_ARR_A(ir_node *, in, n);
2907 /* fix the keep alive */
2908 for (i = j = 0; i < n; i++) {
2909 ir_node *ka = get_End_keepalive(end, i);
2910 node_t *node = get_irn_node(ka);
2913 node = get_irn_node(get_nodes_block(ka));
2915 if (node->type.tv != tarval_unreachable)
2919 set_End_keepalives(end, j, in);
2924 #define SET(code) op_##code->ops.generic = (op_func)compute_##code
2927 * sets the generic functions to compute.
2929 static void set_compute_functions(void) {
2932 /* set the default compute function */
2933 for (i = get_irp_n_opcodes() - 1; i >= 0; --i) {
2934 ir_op *op = get_irp_opcode(i);
2935 op->ops.generic = (op_func)default_compute;
2938 /* set specific functions */
2958 } /* set_compute_functions */
2960 static int dump_partition_hook(FILE *F, ir_node *n, ir_node *local) {
2961 #ifdef DEBUG_libfirm
2962 ir_node *irn = local != NULL ? local : n;
2963 node_t *node = get_irn_node(irn);
2965 ir_fprintf(F, "info2 : \"partition %u type %+F\"\n", node->part->nr, node->type);
2970 void combo(ir_graph *irg) {
2972 ir_node *initial_bl;
2974 ir_graph *rem = current_ir_graph;
2976 current_ir_graph = irg;
2978 /* register a debug mask */
2979 FIRM_DBG_REGISTER(dbg, "firm.opt.combo");
2980 //firm_dbg_set_mask(dbg, SET_LEVEL_3);
2982 DB((dbg, LEVEL_1, "Doing COMBO for %+F\n", irg));
2984 obstack_init(&env.obst);
2985 env.worklist = NULL;
2989 #ifdef DEBUG_libfirm
2990 env.dbg_list = NULL;
2992 env.opcode2id_map = new_set(cmp_opcode, iro_Last * 4);
2993 env.type2id_map = pmap_create();
2994 env.end_idx = get_opt_global_cse() ? 0 : -1;
2995 env.lambda_input = 0;
2996 env.nonstd_cond = 0;
2999 assure_irg_outs(irg);
3000 assure_cf_loop(irg);
3003 /* we have our own value_of function */
3004 set_value_of_func(get_node_tarval);
3006 set_compute_functions();
3007 DEBUG_ONLY(part_nr = 0);
3009 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
3011 /* create the initial partition and place it on the work list */
3012 env.initial = new_partition(&env);
3013 add_to_worklist(env.initial, &env);
3014 irg_walk_graph(irg, init_block_phis, create_initial_partitions, &env);
3017 tarval_UNKNOWN = env.nonstd_cond ? tarval_bad : tarval_top;
3019 tarval_UNKNOWN = tarval_bad;
3022 /* all nodes on the initial partition have type Top */
3023 env.initial->type_is_T_or_C = 1;
3025 /* Place the START Node's partition on cprop.
3026 Place the START Node on its local worklist. */
3027 initial_bl = get_irg_start_block(irg);
3028 start = get_irn_node(initial_bl);
3029 add_to_cprop(start, &env);
3033 if (env.worklist != NULL)
3035 } while (env.cprop != NULL || env.worklist != NULL);
3037 dump_all_partitions(&env);
3038 check_all_partitions(&env);
3041 set_dump_node_vcgattr_hook(dump_partition_hook);
3042 dump_ir_block_graph(irg, "-partition");
3043 set_dump_node_vcgattr_hook(NULL);
3045 (void)dump_partition_hook;
3048 /* apply the result */
3049 irg_block_walk_graph(irg, NULL, apply_cf, &env);
3050 irg_walk_graph(irg, NULL, apply_result, &env);
3051 apply_end(get_irg_end(irg), &env);
3054 /* control flow might changed */
3055 set_irg_outs_inconsistent(irg);
3056 set_irg_extblk_inconsistent(irg);
3057 set_irg_doms_inconsistent(irg);
3058 set_irg_loopinfo_inconsistent(irg);
3061 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
3063 pmap_destroy(env.type2id_map);
3064 del_set(env.opcode2id_map);
3065 obstack_free(&env.obst, NULL);
3067 /* restore value_of() default behavior */
3068 set_value_of_func(NULL);
3069 current_ir_graph = rem;