18 #include "bephicongr_t.h"
23 size_t phi_irn_data_offset = 0;
24 static firm_dbg_module_t *dbgphi = NULL;
26 void be_phi_congr_class_init(void) {
27 dbgphi = firm_dbg_register("Phi classes");
28 firm_dbg_set_mask(dbgphi, DEBUG_LVL);
29 phi_irn_data_offset = register_additional_node_data(sizeof(phi_info_t));
32 #define get_phi(irn) get_irn_phi_info(irn)->phi
33 #define set_phi(irn, p) get_irn_phi_info(irn)->phi = p
34 #define set_phi_class(irn, cls) get_irn_phi_info(irn)->phi_class = cls
36 #define is_Const(n) (get_irn_opcode(n) == iro_Const)
40 * Insert a node to the phi class of a phi node
41 * @param class The phi congruence class
42 * @param phi The phi node holding the class
43 * @param arg Node which gets assigned to the class
45 static INLINE void phi_class_insert(pset *class, ir_node *phi, ir_node *member) {
46 DBG((dbgphi, 1, "\tinsert %n in %n\n", member, phi));
47 if (!(is_Const(member) && CONSTS_SPLIT_PHI_CLASSES))
49 pset_insert_ptr(class, member);
54 * Unites two phi classes repesented by two phi nodes.
55 * @param n Phi node representing phi class to reassign
56 * @param new_tgt Phi node, which will hold the new bigger phi class
58 static void phi_class_union(ir_node *n, ir_node *new_tgt) {
62 assert(is_Phi(n) && is_Phi(new_tgt) && "These must be phi nodes.");
63 DBG((dbgphi, 1, "\tcorrect %n\n", n));
65 /* copy all class members from n to new_tgt. Duplicates eliminated by pset */
66 src = get_phi_class(n);
67 tgt = get_phi_class(new_tgt);
68 for (p = (ir_node *)pset_first(src); p; p = (ir_node *)pset_next(src))
69 phi_class_insert(tgt, new_tgt, p);
71 /* phi class of n is no longer needed */
73 set_phi_class(n, NULL);
78 * Determines the phi congruence class of a phi node.
79 * This will assign a phi class to all operands of this
80 * phi node. Exceptions may be const nodes: See CONSTS_SPLIT_PHI_CLASSES
82 static void det_phi_congr_class(ir_node *curr_phi) {
85 assert(is_Phi(curr_phi) && "This must be a phi node.");
86 DBG((dbgphi, 1, "Det. phi class of %n.\n", curr_phi));
88 pc = get_phi_class(curr_phi);
91 set_phi_class(curr_phi, pc);
92 phi_class_insert(pc, curr_phi, curr_phi);
95 for (i = 0, n = get_irn_arity(curr_phi); i < n; i++) {
98 arg = get_irn_n(curr_phi, i);
99 DBG((dbgphi, 1, " Arg %n\n", arg));
102 if (phi == NULL) { /* Argument is not assigned to another phi class. */
103 phi_class_insert(pc, curr_phi, arg);
104 } else if (phi != curr_phi) {
105 assert(!(is_Const(arg) && CONSTS_SPLIT_PHI_CLASSES) && "Const nodes must not have a phi class assigned. See CONSTS_SPLIT_PHI_CLASSES");
106 phi_class_union(phi, curr_phi);
109 DBG((dbgphi, 1, "Size now: %d\n", pset_count(get_phi_class(curr_phi))));
114 * Determines the phi congruence classes of
115 * all phi nodes in a given pset
117 pset *be_phi_congr_classes(pset *all_phi_nodes) {
120 pset *phi_class, *all_phi_classes;
122 /* determine all phi classes */
123 for (i = 0, phi = (ir_node *)pset_first(all_phi_nodes); phi; phi = (ir_node *)pset_next(all_phi_nodes))
124 det_phi_congr_class(phi);
126 /* store them in a pset for fast retrieval */
127 all_phi_classes = pset_new_ptr(64);
128 for (i = 0, phi = (ir_node *)pset_first(all_phi_nodes); phi; phi = (ir_node *)pset_next(all_phi_nodes)) {
129 phi_class = get_phi_class(phi);
131 pset_insert_ptr(all_phi_classes, phi_class);
134 return all_phi_classes;