iropt_t.h 3.68 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
/*
 * This file is part of libFirm.
3
 * Copyright (C) 2012 University of Karlsruhe.
Christian Würdig's avatar
Christian Würdig committed
4
5
 */

Michael Beck's avatar
Michael Beck committed
6
/**
Matthias Braun's avatar
Matthias Braun committed
7
8
9
 * @file
 * @brief    iropt --- optimizations intertwined with IR construction -- private header.
 * @author   Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
10
 */
Matthias Braun's avatar
Matthias Braun committed
11
12
#ifndef FIRM_IR_IROPT_T_H
#define FIRM_IR_IROPT_T_H
Götz Lindenmaier's avatar
Götz Lindenmaier committed
13

14
#include <stdbool.h>
15
#include "irop_t.h"
16
17
18
#include "iropt.h"
#include "irnode_t.h"
#include "tv.h"
19

20
21
22
23
24
/**
 * Calculate a hash value of a node.
 *
 * @param node  The IR-node
 */
25
unsigned ir_node_hash(const ir_node *node);
26

27
28
29
30
31
32
33
34
35
/**
 * equivalent_node() returns a node equivalent to input n. It skips all nodes that
 * perform no actual computation, as, e.g., the Id nodes.  It does not create
 * new nodes.  It is therefore safe to free n if the node returned is not n.
 * If a node returns a Tuple we can not just skip it.  If the size of the
 * in array fits, we transform n into a tuple (e.g., Div).
 */
ir_node *equivalent_node(ir_node *n);

36
37
38
39
/**
 * Creates a new value table used for storing CSE identities.
 * The value table is used to identify common expressions.
 */
40
void new_identities(ir_graph *irg);
41

42
43
44
45
46
/**
 * Deletes a identities value table.
 *
 * @param value_table  the identity set
 */
47
void del_identities(ir_graph *irg);
Götz Lindenmaier's avatar
Götz Lindenmaier committed
48

49
50
51
/**
 * Add a node to the identities value table.
 */
52
void add_identities(ir_node *node);
53

54
55
56
57
58
59
60
61
62
63
64
/**
 * Compare function for two nodes in the hash table. Gets two
 * nodes as parameters.  Returns 0 if the nodes are a cse.
 */
int identities_cmp(const void *elt, const void *key);

/**
 * Return the canonical node computing the same value as n.
 * Looks up the node in a hash table, enters it in the table
 * if it isn't there yet.
 */
65
ir_node *identify_remember(ir_node *n);
66

67
68
69
/** Visit each node in the value table of a graph. */
void visit_all_identities(ir_graph *irg, irg_walk_func visit, void *env);

70
71
72
73
74
75
76
77
/**
 * Normalize a node by putting constants (and operands with larger
 * node index) on the right (operator side).
 *
 * @param n   The node to normalize
 */
void ir_normalize_node(ir_node *n);

78
79
ir_node *optimize_in_place_2(ir_node *n);

Michael Beck's avatar
Michael Beck committed
80
/**
81
82
83
84
85
 * The value_of operation.
 * This operation returns for every IR node an associated tarval if existing,
 * returning tarval_bad otherwise.
 * No calculations are done here, just a lookup.
 */
Matthias Braun's avatar
Matthias Braun committed
86
typedef ir_tarval *(*value_of_func)(const ir_node *self);
87
88
89
90
91
92
93
94
95
96
97
98

extern value_of_func value_of_ptr;

/**
 * Set a new value_of function.
 *
 * @param func  the function, NULL restores the default behavior
 */
void set_value_of_func(value_of_func func);

/**
 * Returns the associated tarval of a node.
Michael Beck's avatar
Michael Beck committed
99
 */
Matthias Braun's avatar
Matthias Braun committed
100
static inline ir_tarval *value_of(const ir_node *n)
101
{
102
	return value_of_ptr(n);
Michael Beck's avatar
Michael Beck committed
103
104
}

105
106
107
108
109
/**
 * returns true if a value becomes zero when converted to mode @p mode
 */
bool ir_zero_when_converted(const ir_node *node, ir_mode *dest_mode);

110
111
int ir_mux_is_abs(const ir_node *sel, const ir_node *mux_false,
                  const ir_node *mux_true);
112

113
114
115
116
117
118
119
120
121
122
ir_node *ir_get_abs_op(const ir_node *sel, ir_node *mux_false,
                       ir_node *mux_true);

/**
 * return true if the Mux node will be optimized away. This can be used for
 * the if-conversion callback. Allowing these Muxes should be always safe, even
 * if the backend cannot handle them.
 */
bool ir_is_optimizable_mux(const ir_node *sel, const ir_node *mux_false,
                           const ir_node *mux_true);
123

124
125
126
127
128
/**
 * Returns true if Conv_m0(Conv_m1( x_m2)) is equivalent to Conv_m0(x_m2)
 */
bool may_leave_out_middle_conv(ir_mode *m0, ir_mode *m1, ir_mode *m2);

129
130
131
132
133
134
135
/**
 * Try to predict the value of a Load operation.
 * This can usually be done if it loads from a known global entity with a
 * constant value.
 */
ir_node *predict_load(ir_node *ptr, ir_mode *mode);

136
void ir_register_opt_node_ops(void);
137

Matthias Braun's avatar
Matthias Braun committed
138
#endif