-static inline bool sr_is_simplicial(size_red_t *sr, const ir_node *ifn)
-{
- be_ifg_t *ifg = sr->co->cenv->ifg;
- neighbours_iter_t iter;
- ir_node **all = ALLOCAN(ir_node*, be_ifg_degree(ifg, ifn));
- int size = 0;
- int i;
- int o;
-
- /* get all non-removed neighbors */
- be_ifg_foreach_neighbour(ifg, &iter, ifn, curr)
- if (!sr_is_removed(sr, curr))
- all[size++] = curr;
-
- /* check if these form a clique */
- for (i=0; i<size; ++i)
- for (o=i+1; o<size; ++o)
- if (!be_ifg_connected(ifg, all[i], all[o]))
- return false;
-
- /* all edges exist so this is a clique */
- return true;
-}
-
-void sr_remove(size_red_t *sr)