* An inverse operation returned by the backend
*/
typedef struct _arch_inverse_t {
- int n; /**< count of nodes returned in nodes array */
- int costs; /**< costs of this remat */
+ int n; /**< count of nodes returned in nodes array */
+ int costs; /**< costs of this remat */
- /**> nodes for this inverse operation. shall be in
- * schedule order. last element is the target value
- */
- ir_node **nodes;
+ /**< nodes for this inverse operation. shall be in
+ * schedule order. last element is the target value
+ */
+ ir_node **nodes;
} arch_inverse_t;
/**
* of the given node as result.
*
* @param irn The original operation
- * @param i Index of the argument we want the inverse oparation to yield
+ * @param i Index of the argument we want the inverse operation to yield
* @param inverse struct to be filled with the resulting inverse op
* @param obstack The obstack to use for allocation of the returned nodes array
* @return The inverse operation or NULL if operation invertible
*/
- arch_inverse_t *(*get_inverse)(const void *self, const ir_node * irn, int i, arch_inverse_t * inverse, struct obstack * obstack);
+ arch_inverse_t *(*get_inverse)(const void *self, const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack);
};
extern entity *arch_get_frame_entity(const arch_env_t *env, ir_node *irn);
-extern arch_inverse_t *arch_get_inverse(const arch_env_t *env, const ir_node * irn, int i, arch_inverse_t * inverse, struct obstack * obstack);
+extern arch_inverse_t *arch_get_inverse(const arch_env_t *env, const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack);
/**
* Get the register requirements for a node.