{
 
        struct btree_iter *iter;
+       struct btree_insert_entry *i;
 
        trans_for_each_iter(trans, iter)
-               pr_err("iter: btree %s pos %llu:%llu%s%s%s %ps",
+               printk(KERN_ERR "iter: btree %s pos %llu:%llu%s%s%s %ps\n",
                       bch2_btree_ids[iter->btree_id],
                       iter->pos.inode,
                       iter->pos.offset,
                       (trans->iters_touched & (1ULL << iter->idx)) ? " touched" : "",
                       iter->flags & BTREE_ITER_KEEP_UNTIL_COMMIT ? " keep" : "",
                       (void *) iter->ip_allocated);
+
+       trans_for_each_update(trans, i) {
+               char buf[300];
+
+               bch2_bkey_val_to_text(&PBUF(buf), trans->c, bkey_i_to_s_c(i->k));
+               printk(KERN_ERR "update: btree %s %s\n",
+                      bch2_btree_ids[i->iter->btree_id], buf);
+       }
        panic("trans iter oveflow\n");
 }
 
 
 static inline struct btree_iter *
 __trans_next_iter(struct btree_trans *trans, unsigned idx)
 {
-       u64 l = trans->iters_linked >> idx;
+       u64 l;
+
+       if (idx == BTREE_ITER_MAX)
+               return NULL;
+
+       l = trans->iters_linked >> idx;
        if (!l)
                return NULL;
 
        idx += __ffs64(l);
+       EBUG_ON(idx >= BTREE_ITER_MAX);
        EBUG_ON(trans->iters[idx].idx != idx);
        return &trans->iters[idx];
 }