-#define be_lv_foreach(lv, bl, flags, i) \
- for (i = 0; (i = _be_lv_next_irn(lv, bl, flags, i)) >= 0; ++i)
+typedef struct lv_iterator_t
+{
+ be_lv_info_t *info;
+ ir_graph *irg;
+ be_lv_state_t flags;
+ size_t i;
+} lv_iterator_t;
+
+static inline lv_iterator_t be_lv_iteration_begin(const be_lv_t *lv,
+ const ir_node *block, be_lv_state_t flags)
+{
+ lv_iterator_t res;
+ res.info = ir_nodehashmap_get(be_lv_info_t, &lv->map, block);
+ res.irg = get_Block_irg(block);
+ res.flags = flags;
+ res.i = res.info != NULL ? res.info[0].head.n_members : 0;
+ return res;
+}
+
+static inline ir_node *be_lv_iteration_next(lv_iterator_t *iterator)
+{
+ while (iterator->i != 0) {
+ const be_lv_info_t *info = iterator->info + iterator->i--;
+ if (info->node.flags & iterator->flags)
+ return get_idx_irn(iterator->irg, info->node.idx);
+ }
+ return NULL;
+}