/* Number of calls crossed by each allocno. */
int calls_crossed;
+ /* Estimated frequency of crossing call by each allocno. */
+ int freq_calls_crossed;
+
/* Number of calls that might throw crossed by each allocno. */
int throwing_calls_crossed;
HARD_REG_SET regs_someone_prefers;
+#ifdef EH_RETURN_DATA_REGNO
+ /* Set to true if allocno can't be allocated in an eh register. */
+ unsigned int no_eh_reg:1;
+#endif
+
#ifdef STACK_REGS
/* Set to true if allocno can't be allocated in the stack register. */
- bool no_stack_reg;
+ unsigned int no_stack_reg:1;
#endif
};
extern struct allocno *allocno;
/* Precalculated partial bit number in the compressed triangular bit matrix.
For two allocnos, the final bit number is: partial_bitnum[LOW] + HIGH. */
-extern int *partial_bitnum;
+extern HOST_WIDE_INT *partial_bitnum;
/* Size in bits of the compressed triangular bit matrix. */
-extern int max_bitnum;
+extern HOST_WIDE_INT max_bitnum;
/* The pool to allocate the adjacency list elements from. */
if (adjlist == NULL || adjlist->index == ADJACENCY_VEC_LENGTH)
{
- adjacency_t *new = pool_alloc (adjacency_pool);
- new->index = 0;
- new->next = adjlist;
- adjlist = new;
+ adjacency_t *new_adj = (adjacency_t *) pool_alloc (adjacency_pool);
+ new_adj->index = 0;
+ new_adj->next = adjlist;
+ adjlist = new_adj;
adjacency[alloc_no] = adjlist;
}