it->nodes = obstack_finish(&it->obst);
}
-static INLINE void node_break(nodes_iter_t *it, int force)
+static inline void node_break(nodes_iter_t *it, int force)
{
if((it->curr >= it->n || force) && it->nodes) {
obstack_free(&it->obst, NULL);
ir_nodeset_iterator_init(&it->iter, &it->neighbours);
}
-static INLINE void neighbours_break(adj_iter_t *it, int force)
+static inline void neighbours_break(adj_iter_t *it, int force)
{
(void) force;
assert(it->valid == 1);
pset *living;
} cliques_iter_t;
-static INLINE void free_clique_iter(cliques_iter_t *it) {
+static inline void free_clique_iter(cliques_iter_t *it) {
it->n_blocks = -1;
obstack_free(&it->ob, NULL);
del_pset(it->living);
* NOTE: Be careful when changing this function!
* First understand the control flow of consecutive calls.
*/
-static INLINE int get_next_clique(cliques_iter_t *it) {
+static inline int get_next_clique(cliques_iter_t *it) {
/* continue in the block we left the last time */
for (; it->blk < it->n_blocks; it->blk++) {