Commit 68f1fef3 authored by Matthias Braun's avatar Matthias Braun
Browse files

fix a bunch of whitespace errors in headerfiles

parent ed85eaaf
......@@ -47,7 +47,7 @@
* @return A pointer to the flexible array (can be used as a pointer to the
* first element of this array).
*/
#define NEW_ARR_F(type, nelts) \
#define NEW_ARR_F(type, nelts) \
((type *)ir_new_arr_f((nelts), sizeof(type) * (nelts)))
/**
......@@ -63,7 +63,7 @@
* @return A pointer to the flexible array (can be used as a pointer to the
* first element of this array).
*/
#define CLONE_ARR_F(type, arr) \
#define CLONE_ARR_F(type, arr) \
NEW_ARR_F(type, ARR_LEN((arr)))
/**
......@@ -78,7 +78,7 @@
* @return A pointer to the flexible array (can be used as a pointer to the
* first element of this array).
*/
#define DUP_ARR_F(type, arr) \
#define DUP_ARR_F(type, arr) \
((type*) memcpy(CLONE_ARR_F(type, (arr)), (arr), sizeof(type) * ARR_LEN((arr))))
/**
......@@ -101,9 +101,9 @@
* @return A pointer to the dynamic array (can be used as a pointer to the
* first element of this array).
*/
#define NEW_ARR_D(type, obstack, nelts) \
( nelts \
? (type *)ir_new_arr_d((obstack), (nelts), sizeof(type) * (nelts)) \
#define NEW_ARR_D(type, obstack, nelts) \
( nelts \
? (type *)ir_new_arr_d((obstack), (nelts), sizeof(type) * (nelts)) \
: (type *)arr_mt_descr.elts)
/**
......@@ -120,7 +120,7 @@
* @return A pointer to the dynamic array (can be used as a pointer to the
* first element of this array).
*/
#define CLONE_ARR_D(type, obstack, arr) \
#define CLONE_ARR_D(type, obstack, arr) \
NEW_ARR_D(type, (obstack), ARR_LEN((arr)))
/**
......@@ -136,7 +136,7 @@
* @return A pointer to the dynamic array (can be used as a pointer to the
* first element of this array).
*/
#define DUP_ARR_D(type, obstack, arr) \
#define DUP_ARR_D(type, obstack, arr) \
((type*)memcpy(CLONE_ARR_D(type, (obstack), (arr)), (arr), sizeof(type) * ARR_LEN ((arr))))
/**
......@@ -156,7 +156,7 @@
*
* @remark This macro may change arr, so update all references!
*/
#define ARR_RESIZE(type, arr, n) \
#define ARR_RESIZE(type, arr, n) \
((arr) = (type*) ir_arr_resize((void *)(arr), (n), sizeof(type)))
/**
......@@ -168,7 +168,7 @@
*
* @remark This macro may change arr, so update all references!
*/
#define ARR_SETLEN(type, arr, n) \
#define ARR_SETLEN(type, arr, n) \
((arr) = (type*) ir_arr_setlen((void *)(arr), (n), sizeof(type) * (n)))
/** Set a length smaller than the current length of the array. Do not
......@@ -184,7 +184,7 @@ static inline void ARR_SHRINKLEN(void *arr, size_t new_len);
*
* @remark This macro may change arr, so update all references!
*/
#define ARR_EXTEND(type, arr, delta) \
#define ARR_EXTEND(type, arr, delta) \
ARR_RESIZE(type, (arr), ARR_LEN((arr)) + (delta))
/**
......@@ -197,7 +197,7 @@ static inline void ARR_SHRINKLEN(void *arr, size_t new_len);
*
* @remark This macro may change arr, so update all references!
*/
#define ARR_EXTO(type, arr, n) \
#define ARR_EXTO(type, arr, n) \
((n) >= ARR_LEN((arr)) ? ARR_RESIZE(type, (arr), (n)+1) : (arr))
/**
......@@ -207,7 +207,7 @@ static inline void ARR_SHRINKLEN(void *arr, size_t new_len);
* @param arr The array, which must be an lvalue.
* @param elt The new element, must be of type (type).
*/
#define ARR_APP1(type, arr, elt) \
#define ARR_APP1(type, arr, elt) \
(ARR_EXTEND(type, (arr), 1), (arr)[ARR_LEN((arr))-1] = (elt))
#ifdef NDEBUG
......@@ -215,7 +215,7 @@ static inline void ARR_SHRINKLEN(void *arr, size_t new_len);
# define ARR_IDX_VRFY(arr, idx) ((void)0)
#else
# define ARR_VRFY(arr) ir_verify_arr(arr)
# define ARR_IDX_VRFY(arr, idx) \
# define ARR_IDX_VRFY(arr, idx) \
assert((0 <= (idx)) && ((idx) < ARR_LEN((arr))))
#endif
......
......@@ -45,8 +45,8 @@ struct list_head {
* the prev/next entries already!
*/
static inline void __list_add(struct list_head *new_node,
struct list_head *prev,
struct list_head *next)
struct list_head *prev,
struct list_head *next)
{
next->prev = new_node;
new_node->next = next;
......@@ -136,7 +136,7 @@ static inline void list_move(struct list_head *list, struct list_head *head)
* @param head the head that will follow our entry
*/
static inline void list_move_tail(struct list_head *list,
struct list_head *head)
struct list_head *head)
{
__list_del(list->prev, list->next);
list_add_tail(list, head);
......@@ -152,7 +152,7 @@ static inline int list_empty(const struct list_head *head)
}
static inline void __list_splice(struct list_head *list,
struct list_head *head)
struct list_head *head)
{
struct list_head *first = list->next;
struct list_head *last = list->prev;
......@@ -202,17 +202,17 @@ static inline void list_splice_init(struct list_head *list,
_list_container_of(ptr, type, member)
/**
* list_for_each - iterate over a list
* @param pos the &struct list_head to use as a loop counter.
* @param head the head for your list.
* list_for_each - iterate over a list
* @param pos the &struct list_head to use as a loop counter.
* @param head the head for your list.
*/
#define list_for_each(pos, head) \
for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* __list_for_each - iterate over a list
* @param pos the &struct list_head to use as a loop counter.
* @param head the head for your list.
* __list_for_each - iterate over a list
* @param pos the &struct list_head to use as a loop counter.
* @param head the head for your list.
*
* This variant differs from list_for_each() in that it's the
* simplest possible list iteration code, no ing is done.
......@@ -223,33 +223,33 @@ static inline void list_splice_init(struct list_head *list,
for (pos = (head)->next; pos != (head); pos = pos->next)
/**
* list_for_each_prev - iterate over a list backwards
* @param pos the &struct list_head to use as a loop counter.
* @param head the head for your list.
* list_for_each_prev - iterate over a list backwards
* @param pos the &struct list_head to use as a loop counter.
* @param head the head for your list.
*/
#define list_for_each_prev(pos, head) \
for (pos = (head)->prev; pos != (head); pos = pos->prev)
/**
* list_for_each_safe - iterate over a list safe against removal of list entry
* @param pos the &struct list_head to use as a loop counter.
* @param n another &struct list_head to use as temporary storage
* @param head the head for your list.
* list_for_each_safe - iterate over a list safe against removal of list entry
* @param pos the &struct list_head to use as a loop counter.
* @param n another &struct list_head to use as temporary storage
* @param head the head for your list.
*/
#define list_for_each_safe(pos, n, head) \
for (pos = (head)->next, n = pos->next; pos != (head); \
pos = n, n = pos->next)
/**
* list_for_each_entry - iterate over list of given type
* list_for_each_entry - iterate over list of given type
* @param type the type of the struct where the listhead is embedded in
* @param pos the type * to use as a loop counter.
* @param head the head for your list.
* @param member the name of the list_struct within the struct.
*/
#define list_for_each_entry(type, pos, head, member) \
for (pos = list_entry((head)->next, type, member); \
&pos->member != (head); \
#define list_for_each_entry(type, pos, head, member) \
for (pos = list_entry((head)->next, type, member); \
&pos->member != (head); \
pos = list_entry(pos->member.next, type, member))
/**
......@@ -259,9 +259,9 @@ static inline void list_splice_init(struct list_head *list,
* @param head the head for your list.
* @param member the name of the list_struct within the struct.
*/
#define list_for_each_entry_reverse(type, pos, head, member) \
for (pos = list_entry((head)->prev, type, member); \
&pos->member != (head); \
#define list_for_each_entry_reverse(type, pos, head, member) \
for (pos = list_entry((head)->prev, type, member); \
&pos->member != (head); \
pos = list_entry(pos->member.prev, type, member))
......@@ -273,10 +273,10 @@ static inline void list_splice_init(struct list_head *list,
* @param head the head for your list.
* @param member the name of the list_struct within the struct.
*/
#define list_for_each_entry_safe(type, pos, n, head, member) \
for (pos = list_entry((head)->next, type, member), \
n = list_entry(pos->member.next, type, member); \
&pos->member != (head); \
#define list_for_each_entry_safe(type, pos, n, head, member) \
for (pos = list_entry((head)->next, type, member), \
n = list_entry(pos->member.next, type, member); \
&pos->member != (head); \
pos = n, n = list_entry(n->member.next, type, member))
#include "../end.h"
......
......@@ -114,7 +114,7 @@ FIRM_API void plist_free(plist_t *list);
* @return The number of elements in a pointer list.
*/
#define plist_count(list) \
((list)->element_count)
((list)->element_count)
/**
* Inserts an element at the back of a pointer list.
......@@ -135,7 +135,7 @@ FIRM_API void plist_insert_front(plist_t *list, void *value);
* which must be non null.
* @param list the pointer list to insert the new element into.
* @param element the list element before which the new element should
* be inserted. This element must be a part of @p list.
* be inserted. This element must be a part of @p list.
* @param value the element value to insert.
*/
FIRM_API void plist_insert_before(plist_t *list, plist_element_t *element, void *value);
......@@ -145,7 +145,7 @@ FIRM_API void plist_insert_before(plist_t *list, plist_element_t *element, void
* which must be non null.
* @param list the pointer list to insert the new element into.
* @param element the list element after which the new element should
* be inserted. This element must be a part of @p list.
* be inserted. This element must be a part of @p list.
* @param value the element value to insert.
*/
FIRM_API void plist_insert_after(plist_t *list, plist_element_t *element, void *value);
......@@ -170,7 +170,7 @@ FIRM_API plist_element_t *plist_find_value(plist_t *list, void *value);
* Erases the specified element from the pointer list.
* @param list the pointer list from which the element should be erased.
* @param element the list element to erase. This element must be a part
* of @p list.
* of @p list.
*/
FIRM_API void plist_erase(plist_t *list, plist_element_t *element);
......@@ -186,7 +186,7 @@ FIRM_API void plist_clear(plist_t *list);
* @return a pointer to the element or NULL if the list is empty
*/
#define plist_first(list) \
((list)->first_element)
((list)->first_element)
/**
* Returns the last element of a pointer list.
......@@ -194,12 +194,12 @@ FIRM_API void plist_clear(plist_t *list);
* @return a pointer to the element or NULL if the list is empty
*/
#define plist_last(list) \
((list)->last_element)
((list)->last_element)
/**
* Checks whether a pointer list element has a successor or not.
* @param element the list element that should be queried for existence
* of a successor.
* of a successor.
* @return TRUE if @p element has a successor, otherwise FALSE.
*/
#define plist_element_has_next(element) \
......@@ -208,7 +208,7 @@ FIRM_API void plist_clear(plist_t *list);
/**
* Checks whether a pointer list element has a predecessor or not.
* @param element the list element that should be queried for existence
* of a predecessor.
* of a predecessor.
* @return TRUE if @p element has a successor, otherwise FALSE.
*/
#define plist_element_has_prev(element) \
......@@ -218,7 +218,7 @@ FIRM_API void plist_clear(plist_t *list);
* Gets the successor of the passed list element.
* @param element the list element to return the successor of.
* @return The successor of @p element or NULL if @p element is the last
* element in the sequence.
* element in the sequence.
*/
#define plist_element_get_next(element) \
((element)->next)
......@@ -227,7 +227,7 @@ FIRM_API void plist_clear(plist_t *list);
* Gets the predecessor of the passed list element.
* @param element the list element to return the predecessor of.
* @return The predecessor of @p element or NULL if @p element is the last
* element in the sequence.
* element in the sequence.
*/
#define plist_element_get_prev(element) \
((element)->prev)
......
......@@ -42,10 +42,10 @@ typedef struct set set;
/** The entry of a set, representing an element in the set and it's meta-information */
typedef struct set_entry {
unsigned hash; /**< the hash value of the element */
size_t size; /**< the size of the element */
int dptr[1]; /**< the element itself, data copied in must not need more
alignment than this */
unsigned hash; /**< the hash value of the element */
size_t size; /**< the size of the element */
int dptr[1]; /**< the element itself, data copied in must not need more
alignment than this */
} set_entry;
/**
......
......@@ -54,9 +54,9 @@ static inline void uf_init(int* data, size_t n_elems)
* Merge 2 sets (union operation). Note that you have to pass the
* representatives of the sets and not just random elements
*
* @param data The union find data
* @param set1 Representative of set1
* @param set2 Representative of set2
* @param data The union find data
* @param set1 Representative of set1
* @param set2 Representative of set2
* @return the new representative of the set (which is set1 or set2)
*/
static inline int uf_union(int* data, int set1, int set2)
......@@ -91,9 +91,9 @@ static inline int uf_union(int* data, int set1, int set2)
* the same/different representatives, then the elements are in the
* the same/different sets.
*
* @param data The union find data
* @param e The element
* @return The representative of the set that contains @p e
* @param data The union find data
* @param e The element
* @return The representative of the set that contains @p e
*/
static inline int uf_find(int* data, int e)
{
......
......@@ -50,9 +50,9 @@
#endif
#ifdef __cplusplus
# define FIRM_NOTHROW throw ()
# define FIRM_NOTHROW throw ()
#else
# define FIRM_NOTHROW
# define FIRM_NOTHROW
#endif
/**
......@@ -61,9 +61,9 @@
* string and variadic argument.
*/
#if defined(__GNUC__)
# define FIRM_PRINTF(a,b) __attribute__((__format__(__printf__, a, b)))
# define FIRM_PRINTF(a,b) __attribute__((__format__(__printf__, a, b)))
#else
# define FIRM_PRINTF(a,b)
# define FIRM_PRINTF(a,b)
#endif
#endif
......
......@@ -93,7 +93,7 @@ typedef const ir_node *ir_node_cnst_ptr;
typedef ir_node *uninitialized_local_variable_func_t(ir_graph *irg, ir_mode *mode, int pos);
#ifdef __cplusplus
# define ENUM_BITSET(type) \
# define ENUM_BITSET(type) \
extern "C++" { \
static inline type operator ~ (type a) { return (type)~(int)a; } \
static inline type operator & (type a, type b) { return (type)((int)a & (int)b); } \
......@@ -104,17 +104,17 @@ typedef ir_node *uninitialized_local_variable_func_t(ir_graph *irg, ir_mode *mod
static inline type operator |= (type& a, type b) { return a = (type)((int)a | (int)b); } \
}
#else
# define ENUM_BITSET(type)
# define ENUM_BITSET(type)
#endif
#ifdef __cplusplus
# define ENUM_COUNTABLE(type) \
# define ENUM_COUNTABLE(type) \
extern "C++" { \
static inline type operator ++(type& a) { return a = (type)((int)a + 1); } \
static inline type operator --(type& a) { return a = (type)((int)a - 1); } \
}
#else
# define ENUM_COUNTABLE(type)
# define ENUM_COUNTABLE(type)
#endif
/**
......
......@@ -212,10 +212,10 @@ FIRM_API void all_optimizations_off(void);
* Possible verification modes.
*/
typedef enum firm_verification_t {
FIRM_VERIFICATION_OFF = 0, /**< do not verify nodes at all */
FIRM_VERIFICATION_ON = 1, /**< do node verification and assert on error in debug version */
FIRM_VERIFICATION_REPORT = 2, /**< do node verification, but report to stderr only */
FIRM_VERIFICATION_ERROR_ONLY = 3 /**< do node verification, but NEVER do assert nor report */
FIRM_VERIFICATION_OFF = 0, /**< do not verify nodes at all */
FIRM_VERIFICATION_ON = 1, /**< do node verification and assert on error in debug version */
FIRM_VERIFICATION_REPORT = 2, /**< do node verification, but report to stderr only */
FIRM_VERIFICATION_ERROR_ONLY = 3 /**< do node verification, but NEVER do assert nor report */
} firm_verification_t;
/** Select verification of IR nodes and types.
......
......@@ -280,7 +280,7 @@ FIRM_API ir_tarval *get_mode_NAN(ir_mode *mode);
FIRM_API ir_mode *mode_M; /**< memory */
/* -- A set of predefined, numerical modes according to Techreport 1999-44 -- */
FIRM_API ir_mode *mode_F; /**< signed float(32) */
FIRM_API ir_mode *mode_F; /**< signed float(32) */
FIRM_API ir_mode *mode_D; /**< signed double(64) */
FIRM_API ir_mode *mode_E; /**< signed extended(80) */
FIRM_API ir_mode *mode_Bs; /**< signed byte (former char) */
......
......@@ -70,8 +70,7 @@ ENUM_COUNTABLE(ir_segment_t)
* This variable should be considered constant. Moreover, one should use get_irp()
* to get access the the irp.
*
* @note
* Think of the irp as the "handle" of a program.
* @note Think of the irp as the "handle" of a program.
*/
FIRM_API ir_prog *irp;
......
......@@ -27,14 +27,14 @@
#include "array.h"
#define ARR_D_MAGIC FOURCC('A','R','R','D')
#define ARR_A_MAGIC FOURCC('A','R','R','A')
#define ARR_F_MAGIC FOURCC('A','R','R','F')
#define ARR_D_MAGIC FOURCC('A','R','R','D')
#define ARR_A_MAGIC FOURCC('A','R','R','A')
#define ARR_F_MAGIC FOURCC('A','R','R','F')
#ifdef NDEBUG
# define ARR_SET_DBGINF(descr, co, es)
#else
# define ARR_SET_DBGINF(descr, co, es) \
# define ARR_SET_DBGINF(descr, co, es) \
( (descr)->magic = (co), (descr)->eltsize = (es) )
#endif
......@@ -49,12 +49,12 @@
* This macro creates a dynamic array on the functions stack of a given type at runtime.
* The size of the array cannot be changed later.
*/
#define NEW_ARR_A(type, var, n) \
do { \
size_t nelts = (n); \
(var) = (type *)((ir_arr_descr *)alloca(ARR_ELTS_OFFS + sizeof(type) * nelts))->elts; \
ARR_SET_DBGINF(ARR_DESCR ((var)), ARR_A_MAGIC, sizeof (type)); \
(void)(ARR_DESCR((var))->nelts = nelts); \
#define NEW_ARR_A(type, var, n) \
do { \
size_t nelts = (n); \
(var) = (type *)((ir_arr_descr *)alloca(ARR_ELTS_OFFS + sizeof(type) * nelts))->elts; \
ARR_SET_DBGINF(ARR_DESCR ((var)), ARR_A_MAGIC, sizeof (type)); \
(void)(ARR_DESCR((var))->nelts = nelts); \
} while (0)
/**
......@@ -71,7 +71,7 @@
* @return A pointer to the dynamic array (can be used as a pointer to the
* first element of this array).
*/
#define CLONE_ARR_A(type, var, arr) \
#define CLONE_ARR_A(type, var, arr) \
NEW_ARR_A(type, (var), ARR_LEN((arr)))
/**
......@@ -87,9 +87,9 @@
* @return A pointer to the dynamic array (can be used as a pointer to the
* first element of this array).
*/
#define DUP_ARR_A(type, var, arr) \
do { CLONE_ARR_A(type, (var), (arr)); \
memcpy((var), (arr), sizeof (type) * ARR_LEN((arr))); } \
#define DUP_ARR_A(type, var, arr) \
do { CLONE_ARR_A(type, (var), (arr)); \
memcpy((var), (arr), sizeof (type) * ARR_LEN((arr))); } \
while (0)
#endif
......@@ -40,8 +40,8 @@ struct dfs_node_t {
const void *ancestor;
int pre_num;
int max_pre_num;
int post_num;
int level;
int post_num;
int level;
};
struct dfs_edge_t {
......
......@@ -112,10 +112,10 @@ enum arm_fp_architectures {
};
/** Returns non-zero if FPA instructions should be issued. */
#define USE_FPA(isa) ((isa)->fpu_arch & ARM_FPU_FPA_EXT_V1)
#define USE_FPA(isa) ((isa)->fpu_arch & ARM_FPU_FPA_EXT_V1)
/** Returns non-zero if VFP instructions should be issued. */
#define USE_VFP(isa) ((isa)->fpu_arch & ARM_FPU_VFP_EXT_V1xD)
#define USE_VFP(isa) ((isa)->fpu_arch & ARM_FPU_VFP_EXT_V1xD)
/** Types of processor to generate code for. */
enum arm_processor_types {
......
......@@ -101,7 +101,7 @@ struct be_abi_callbacks_t {
/**
* Set the flags for a call.
* @param call The call.
* @param flags Some flags to be set.
* @param flags Some flags to be set.
* @param cb The call callbacks for that call.
* @note The ABI phase might change the flags due to analysis.
*/
......
......@@ -77,7 +77,7 @@ static inline struct list_head *_get_block_border_head(const be_chordal_env_t *i
#define get_block_border_head(info, bl) _get_block_border_head(info, bl)
#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
#define foreach_border_head(head, pos) list_for_each_entry_reverse(border_t, pos, head, list)
#define border_next(b) (list_entry((b)->list.next, border_t, list))
#define border_prev(b) (list_entry((b)->list.prev, border_t, list))
......
......@@ -63,7 +63,7 @@ size_red_t *new_size_red(copy_opt_t *co);
/**
* Checks if a node has already been removed
*/
#define sr_is_removed(sr, irn) pset_find_ptr((sr)->all_removed, irn)
#define sr_is_removed(sr, irn) pset_find_ptr((sr)->all_removed, irn)
/**
* Virtually remove all nodes not related to the problem
......
......@@ -101,15 +101,15 @@ void free_copy_opt(copy_opt_t *co);
/**
* Computes the costs of a copy according to loop depth
* @param co The copy opt object.
* @param pos the argument position of arg in the root arguments
* @return Must be >= 0 in all cases.
* @param pos the argument position of arg in the root arguments
* @return Must be >= 0 in all cases.
*/
int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
/**
* Computes the costs of a copy according to execution frequency
* @param co The copy opt object.
* @param pos the argument position of arg in the root arguments
* @param pos the argument position of arg in the root arguments
* @return Must be >= 0 in all cases.
*/
int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
......@@ -125,15 +125,15 @@ int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int
typedef __int64 long64;
typedef unsigned __int64 ulong64;
#define LL_FMT "i64"
#define ULL_FMT "ui64"
#define LL_FMT "i64"
#define ULL_FMT "ui64"
#else
typedef long long long64;
typedef unsigned long long ulong64;
#define LL_FMT "ll"
#define ULL_FMT "llu"
#define LL_FMT "ll"
#define ULL_FMT "llu"
#endif
......
......@@ -47,7 +47,7 @@ struct copy_opt_t {
cost_fct_t get_costs; /**< function ptr used to get costs for copies */
/** Representation as optimization units */
struct list_head units; /**< all units to optimize in specific order */
struct list_head units; /**< all units to optimize in specific order */
/** Representation in graph structure. Only build on demand */
struct obstack obst;
......@@ -55,15 +55,15 @@ struct copy_opt_t {
};
/* Helpers */
#define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not build")
#define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not build")
#define ASSERT_OU_AVAIL(co) assert((co)->units.next && "Representation as optimization-units not build")
#define ASSERT_GS_AVAIL(co) assert((co)->nodes && "Representation as graph not build")
#define get_irn_col(irn) arch_register_get_index(arch_get_irn_register(irn))
#define get_irn_col(irn) arch_register_get_index(arch_get_irn_register(irn))
#define set_irn_col(co, irn, col) arch_set_irn_register(irn, arch_register_for_index((co)->cls, col))
#define list_entry_units(lh) list_entry(lh, unit_t, units)
#define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
#define is_Reg_Phi(irn) (is_Phi(irn) && mode_is_data(get_irn_mode(irn)))
#define get_Perm_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
#define is_Perm_Proj(irn) (is_Proj(irn) && be_is_Perm(get_Proj_pred(irn)))
......@@ -98,7 +98,7 @@ typedef struct unit_t {
int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */
/* for heuristic */
struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
struct list_head queue; /**< list of qn's sorted by weight of qn-mis */
} unit_t;
......@@ -140,12 +140,12 @@ static inline affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_
return (affinity_node_t*)set_find(co->nodes, &find, sizeof(find), hash_irn(irn));
}