*/
#include <stdio.h>
+#include <stdlib.h>
#include <string.h>
-#include "irgraph.h"
-#include "irnode.h"
+#include "debug.h"
+#include "impl.h"
+#include "irprog.h"
#include "irgwalk.h"
#include "irop.h"
-#include "irprog.h"
#include "bephicongr_t.h"
+#define DEBUG_LVL 0
size_t phi_irn_data_offset = 0;
+static firm_dbg_module_t *dbgphi = NULL;
-void be_phi_congr_class_init(void) {
- phi_irn_data_offset = register_additional_node_data(sizeof(phi_info_t));
-}
-
+#define _get_phi(irn) get_irn_phi_info(irn)->phi
+#define _set_phi(irn, p) get_irn_phi_info(irn)->phi = p
+#define _get_phi_class(irn) get_irn_phi_info(irn)->phi_class
+#define _set_phi_class(irn, cls) get_irn_phi_info(irn)->phi_class = cls
-#define set_phi_class(n,new_tgt) get_irn_phi_info(n)->phi_congr_class=new_tgt
-#define set_phi_class_size(n,v) get_irn_phi_info(n)->phi_class_size=v
-#define inc_phi_class_size(n) get_irn_phi_info(n)->phi_class_size++
+#define is_Const(n) (get_irn_opcode(n) == iro_Const)
-static void correct_phi_class(ir_node *n, ir_node *new_tgt){
- int i, max, check;
- check = get_phi_class_size(n) + get_phi_class_size(new_tgt);
- for (i = 0, max = get_irn_arity(n); i < max; i++) {
- ir_node *arg = get_irn_n(n, i);
- set_phi_class(arg, new_tgt);
- inc_phi_class_size(new_tgt);
- }
+/**
+ * Insert a node to the phi class of a phi node
+ * @param class The phi congruence class
+ * @param phi The phi node holding the class
+ * @param arg Node which gets assigned to the class
+ */
+static INLINE void phi_class_insert(pset *class, ir_node *phi, ir_node *member) {
+ DBG((dbgphi, 1, "\tinsert %n in %n\n", member, phi));
+ if (!(is_Const(member) && CONSTS_SPLIT_PHI_CLASSES))
+ _set_phi(member, phi);
+ pset_insert_ptr(class, member);
+}
- get_irn_phi_info(n)->phi_class_size=0;
- //set_phi_class_size(n, 0);
- assert((check == get_phi_class_size(n) + get_phi_class_size(new_tgt)) && "Re-setting pointers went wrong.");
+/**
+ * Unites two phi classes repesented by two phi nodes.
+ * @param n Phi node representing phi class to reassign
+ * @param new_tgt Phi node, which will hold the new bigger phi class
+ */
+static void phi_class_union(ir_node *n, ir_node *new_tgt) {
+ ir_node *p;
+ pset *src, *tgt;
+
+ assert(is_Phi(n) && is_Phi(new_tgt) && "These must be phi nodes.");
+ DBG((dbgphi, 1, "\tcorrect %n\n", n));
+
+ /* copy all class members from n to new_tgt. Duplicates eliminated by pset */
+ src = _get_phi_class(n);
+ tgt = _get_phi_class(new_tgt);
+ for (p = (ir_node *)pset_first(src); p; p = (ir_node *)pset_next(src))
+ phi_class_insert(tgt, new_tgt, p);
+
+ /* phi class of n is no longer needed */
+ del_pset(src);
+ _set_phi_class(n, NULL);
}
-void det_phi_congr_class(ir_node *curr_phi) {
+/**
+ * Determines the phi congruence class of a phi node.
+ * This will assign a phi class to all operands of this
+ * phi node. Exceptions may be const nodes: See CONSTS_SPLIT_PHI_CLASSES
+ */
+static void det_phi_congr_class(ir_node *curr_phi) {
+ pset *pc;
int i, n;
assert(is_Phi(curr_phi) && "This must be a phi node.");
+ DBG((dbgphi, 1, "Det. phi class of %n.\n", curr_phi));
- set_phi_class(curr_phi, curr_phi);
+ pc = _get_phi_class(curr_phi);
+ if (!pc) {
+ pc = pset_new_ptr(2);
+ _set_phi_class(curr_phi, pc);
+ phi_class_insert(pc, curr_phi, curr_phi);
+ }
for (i = 0, n = get_irn_arity(curr_phi); i < n; i++) {
- ir_node *arg, *pc;
+ ir_node *arg, *phi;
arg = get_irn_n(curr_phi, i);
- pc = get_phi_class(arg);
- if (!pc)
- set_phi_class(arg, curr_phi);
- else
- correct_phi_class(pc, curr_phi);
+ DBG((dbgphi, 1, " Arg %n\n", arg));
+
+ phi = _get_phi(arg);
+ if (phi == NULL) { /* Argument is not assigned to another phi class. */
+ phi_class_insert(pc, curr_phi, arg);
+ } else if (phi != curr_phi) {
+ assert(!(is_Const(arg) && CONSTS_SPLIT_PHI_CLASSES) && "Const nodes must not have a phi class assigned. See CONSTS_SPLIT_PHI_CLASSES");
+ phi_class_union(phi, curr_phi);
+ }
}
+ DBG((dbgphi, 1, "Size now: %d\n", pset_count(_get_phi_class(curr_phi))));
}
-void be_det_phi_congr_classes(void) {
- //forall phis: det_phi_congr_classes(n);
- assert(0 && "NYI");
+static void phi_node_walker(ir_node *node, void *env) {
+ if (is_Phi(node) && mode_is_datab(get_irn_mode(node)))
+ det_phi_congr_class(node);
+}
+
+
+void be_phi_congr_compute(ir_graph *irg) {
+ irg_walk_graph(irg, phi_node_walker, NULL, NULL);
+}
+
+
+pset *get_phi_class(const ir_node *irn) {
+ ir_node *phi = _get_phi(irn);
+ if (phi)
+ return _get_phi_class(phi);
+ else
+ return NULL;
+}
+
+pset *be_phi_congr_classes(pset *all_phi_nodes) {
+ int i;
+ ir_node *phi;
+ pset *phi_class, *all_phi_classes;
+
+ /* determine all phi classes */
+ for (i = 0, phi = (ir_node *)pset_first(all_phi_nodes); phi; phi = (ir_node *)pset_next(all_phi_nodes))
+ det_phi_congr_class(phi);
+
+ /* store them in a pset for fast retrieval */
+ all_phi_classes = pset_new_ptr(64);
+ for (i = 0, phi = (ir_node *)pset_first(all_phi_nodes); phi; phi = (ir_node *)pset_next(all_phi_nodes)) {
+ phi_class = _get_phi_class(phi);
+ if (phi_class)
+ pset_insert_ptr(all_phi_classes, phi_class);
+ }
+
+ return all_phi_classes;
+}
+
+
+void be_phi_congr_class_init(void) {
+ dbgphi = firm_dbg_register("Phi classes");
+ firm_dbg_set_mask(dbgphi, DEBUG_LVL);
+ phi_irn_data_offset = register_additional_node_data(sizeof(phi_info_t));
}
projects / libfirm / blobdiff