/* ensure that iter->k is consistent with iter->pos: */
                        bch2_btree_iter_set_pos(iter, iter->pos);
                        k = bkey_s_c_err(ret);
-                       goto out;
+                       break;
                }
 
                struct btree_path *path = btree_iter_path(trans, iter);
                        /* No btree nodes at requested level: */
                        bch2_btree_iter_set_pos(iter, SPOS_MAX);
                        k = bkey_s_c_null;
-                       goto out;
+                       break;
                }
 
                btree_path_set_should_be_locked(trans, path);
                    k.k &&
                    (k2 = btree_trans_peek_key_cache(iter, k.k->p)).k) {
                        k = k2;
-                       ret = bkey_err(k);
-                       if (ret) {
+                       if (bkey_err(k)) {
                                bch2_btree_iter_set_pos(iter, iter->pos);
-                               goto out;
+                               break;
                        }
                }
 
                        /* End of btree: */
                        bch2_btree_iter_set_pos(iter, SPOS_MAX);
                        k = bkey_s_c_null;
-                       goto out;
+                       break;
                }
        }
-out:
-       bch2_btree_iter_verify(iter);
 
+       bch2_btree_iter_verify(iter);
        return k;
 }