!bkey_deleted(&insert->k))
                return 0;
 
-       while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
-                                                     KEY_TYPE_discard))) {
+       while ((_k = bch2_btree_node_iter_peek(&node_iter, b))) {
                struct bkey             unpacked;
                struct bkey_s_c         k = bkey_disassemble(b, _k, &unpacked);
 
                pr_err("overlapping with");
 
                node_iter = iter->l[0].iter;
-               while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
-                                                       KEY_TYPE_discard))) {
+               while ((_k = bch2_btree_node_iter_peek(&node_iter, b))) {
                        struct bkey             unpacked;
                        struct bkey_s_c         k;
 
        if (unlikely(flags & BTREE_TRIGGER_NOOVERWRITES))
                return 0;
 
-       while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
-                                                     KEY_TYPE_discard))) {
+       while ((_k = bch2_btree_node_iter_peek(&node_iter, b))) {
                struct bkey             unpacked;
                struct bkey_s_c         k;
                unsigned                offset = 0;
 
        if (ret < 0)
                return ret;
 
-       while ((_k = bch2_btree_node_iter_peek_filter(&node_iter, b,
-                                                     KEY_TYPE_discard))) {
+       while ((_k = bch2_btree_node_iter_peek(&node_iter, b))) {
                struct bkey     unpacked;
                struct bkey_s_c k = bkey_disassemble(b, _k, &unpacked);
                unsigned offset = 0;
        struct bkey unpacked;
        int sectors;
 
-       _k = bch2_btree_node_iter_peek_filter(&node_iter, l->b,
-                                             KEY_TYPE_discard);
+       _k = bch2_btree_node_iter_peek(&node_iter, l->b);
        if (!_k)
                return BTREE_INSERT_OK;