* This operation evaluates an IR node into a tarval if possible,
* returning tarval_bad otherwise.
*/
* This operation evaluates an IR node into a tarval if possible,
* returning tarval_bad otherwise.
*/
- * It does not create new nodes. It is therefore safe to free n
- * if the node returned is not n.
+ * It does not create new nodes. It is therefore safe to free self
+ * if the node returned is not self.
* 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., possible for Div).
*/
* 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., possible for Div).
*/
* transformations _do_ generate new nodes, and thus the old node must
* not be freed even if the equivalent node isn't the old one.
*/
* transformations _do_ generate new nodes, and thus the old node must
* not be freed even if the equivalent node isn't the old one.
*/
node_cmp_attr_func node_cmp_attr; /**< compares two node attributes. */
reassociate_func reassociate; /**< reassociate a tree */
copy_attr_func copy_attr; /**< copy node attributes */
node_cmp_attr_func node_cmp_attr; /**< compares two node attributes. */
reassociate_func reassociate; /**< reassociate a tree */
copy_attr_func copy_attr; /**< copy node attributes */