+/*
+ * This file is part of libFirm.
+ * Copyright (C) 2012 University of Karlsruhe.
+ */
+
/**
- * @file beuse.h
- * @date 27.06.2005
- * @author Sebastian Hack, Matthias Braun
- *
- * Determine future usages of values.
- *
- * Copyright (C) 2005 Universitaet Karlsruhe
- * Released under the GPL
+ * @file
+ * @brief Methods to compute when a value will be used again.
+ * @author Sebastian Hack, Matthias Braun
+ * @date 27.06.2005
*/
-#ifndef _BEUSES_H
-#define _BEUSES_H
+#ifndef FIRM_BE_BEUSES_H
+#define FIRM_BE_BEUSES_H
-#include "bearch.h"
+#include "firm_types.h"
#include "belive.h"
-typedef struct _be_next_use_t {
- unsigned time;
- int outermost_loop;
+/**
+ * Describes a use of a value.
+ */
+typedef struct be_next_use_t {
+ unsigned time;
+ unsigned outermost_loop;
+ /* point of the next use is at the beginning of this node. */
+ const ir_node *before;
} be_next_use_t;
-#define USES_INFINITY 10000000
+#define USES_INFINITY 10000000
+#define USES_PENDING 9999999
-static INLINE int USES_IS_INFINITE(unsigned time)
+static inline bool USES_IS_INFINITE(unsigned time)
{
return time >= USES_INFINITY;
}
-typedef struct _be_uses_t be_uses_t;
+static inline bool USES_IS_PENDING(unsigned time)
+{
+ return time == USES_PENDING;
+}
+
+typedef struct be_uses_t be_uses_t;
be_next_use_t be_get_next_use(be_uses_t *uses, ir_node *from,
- unsigned from_step, const ir_node *def,
- int skip_from_uses);
+ const ir_node *def, int skip_from_uses);
+/**
+ * Creates a new uses environment for a graph.
+ *
+ * @param irg the graph
+ * @param lv liveness information for the graph
+ */
be_uses_t *be_begin_uses(ir_graph *irg, const be_lv_t *lv);
+/**
+ * Destroys the given uses environment.
+ *
+ * @param uses the environment
+ */
void be_end_uses(be_uses_t *uses);
-#endif /* _BEUSES_H */
+#endif