--- /dev/null
+/**
+ * @author Daniel Grund
+ * @date 09.12.2004
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "debug.h"
+#include "irprog.h"
+#include "irgwalk.h"
+#include "irop.h"
+#include "phiclass_t.h"
+
+#define DEBUG_LVL 0
+
+size_t phi_irn_data_offset = 0;
+static firm_dbg_module_t *dbgphi = NULL;
+
+#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 is_Const(n) (get_irn_opcode(n) == iro_Const)
+
+
+/**
+ * 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);
+}
+
+/**
+ * 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);
+}
+
+/**
+ * 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 phi_class_det(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));
+
+ 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, *phi;
+
+ arg = get_irn_n(curr_phi, i);
+ 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))));
+}
+
+pset *phi_class_compute_by_phis(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))
+ phi_class_det(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;
+}
+
+static void phi_class_construction_walker(ir_node *node, void *env) {
+ if (is_Phi(node) && mode_is_datab(get_irn_mode(node)))
+ phi_class_det(node);
+}
+
+void phi_class_compute(ir_graph *irg) {
+ irg_walk_graph(irg, phi_class_construction_walker, NULL, NULL);
+}
+
+static void phi_class_destruction_walker(ir_node *node, void *env) {
+ if (is_Phi(node) && mode_is_datab(get_irn_mode(node))) {
+ pset *class = _get_phi_class(node);
+ if (class) {
+ free(class);
+ class = NULL;
+ }
+ }
+}
+
+void phi_class_free(ir_graph *irg) {
+ irg_walk_graph(irg, phi_class_destruction_walker, NULL, NULL);
+}
+
+pset *get_phi_class(const ir_node *irn) {
+ ir_node *phi;
+ if (phi = _get_phi(irn), phi)
+ return _get_phi_class(phi);
+ else
+ return NULL;
+}
+
+void phi_class_init(void) {
+ dbgphi = firm_dbg_register("ir.ana.phiclass");
+ firm_dbg_set_mask(dbgphi, DEBUG_LVL);
+ phi_irn_data_offset = register_additional_node_data(sizeof(phi_info_t));
+}
--- /dev/null
+/**
+ * Analysis to conmpute phi congruence classes.
+ * @author Daniel Grund
+ * @date 09.12.2004
+ */
+
+#ifndef _BEPHICONGR_T_H
+#define _BEPHICONGR_T_H
+
+#include "phiclass.h"
+
+typedef struct _phi_info_t {
+ ir_node *phi; /**< For all nodes of a phi class points to a phi node
+ representing the phi class and holding the ptr to
+ the pset phi_class or NULL */
+ pset *phi_class; /**< Only set in phi nodes. A set containing the members
+ of the phi congruence class this phi node represents */
+} phi_info_t;
+
+extern size_t phi_irn_data_offset;
+
+#define get_irn_phi_info(irn) get_irn_data(irn, phi_info_t, phi_irn_data_offset)
+
+/**
+ * Setting this to 0 will treat const nodes like
+ * all other nodes when computing phi congruence classes.
+ * A non zero value results in splitting phi congruence
+ * classes at all const nodes (except they do share
+ * some non-const nodes too)
+ *
+ * If constants are localized this is irrelevant. Set to 0 in this case.
+ */
+#define CONSTS_SPLIT_PHI_CLASSES 0
+
+/**
+ * Computes all phi classes of an irg. All phi nodes of this irg must be
+ * contained in @p all_phi_nodes. Otherwise the results will be incorrect.
+ * @param all_phi_nodes All phi nodes of an irg.
+ * @return A set containing all phi classes as psets
+ */
+pset *phi_class_compute_by_phis(pset *all_phi_nodes);
+
+
+#endif
projects / libfirm / commitdiff