Deleted Added
full compact
bplist.c (219089) bplist.c (248571)
1/*
2 * CDDL HEADER START
3 *
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
7 *
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE

--- 6 unchanged lines hidden (view full) ---

15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21/*
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
1/*
2 * CDDL HEADER START
3 *
4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
7 *
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE

--- 6 unchanged lines hidden (view full) ---

15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21/*
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2012 by Delphix. All rights reserved.
23 */
24
25#include <sys/bplist.h>
26#include <sys/zfs_context.h>
27
28
29void
30bplist_create(bplist_t *bpl)

--- 16 unchanged lines hidden (view full) ---

47 bplist_entry_t *bpe = kmem_alloc(sizeof (*bpe), KM_SLEEP);
48
49 mutex_enter(&bpl->bpl_lock);
50 bpe->bpe_blk = *bp;
51 list_insert_tail(&bpl->bpl_list, bpe);
52 mutex_exit(&bpl->bpl_lock);
53}
54
24 */
25
26#include <sys/bplist.h>
27#include <sys/zfs_context.h>
28
29
30void
31bplist_create(bplist_t *bpl)

--- 16 unchanged lines hidden (view full) ---

48 bplist_entry_t *bpe = kmem_alloc(sizeof (*bpe), KM_SLEEP);
49
50 mutex_enter(&bpl->bpl_lock);
51 bpe->bpe_blk = *bp;
52 list_insert_tail(&bpl->bpl_list, bpe);
53 mutex_exit(&bpl->bpl_lock);
54}
55
56/*
57 * To aid debugging, we keep the most recently removed entry. This way if
58 * we are in the callback, we can easily locate the entry.
59 */
60static bplist_entry_t *bplist_iterate_last_removed;
61
55void
56bplist_iterate(bplist_t *bpl, bplist_itor_t *func, void *arg, dmu_tx_t *tx)
57{
58 bplist_entry_t *bpe;
59
60 mutex_enter(&bpl->bpl_lock);
61 while (bpe = list_head(&bpl->bpl_list)) {
62void
63bplist_iterate(bplist_t *bpl, bplist_itor_t *func, void *arg, dmu_tx_t *tx)
64{
65 bplist_entry_t *bpe;
66
67 mutex_enter(&bpl->bpl_lock);
68 while (bpe = list_head(&bpl->bpl_list)) {
69 bplist_iterate_last_removed = bpe;
62 list_remove(&bpl->bpl_list, bpe);
63 mutex_exit(&bpl->bpl_lock);
64 func(arg, &bpe->bpe_blk, tx);
65 kmem_free(bpe, sizeof (*bpe));
66 mutex_enter(&bpl->bpl_lock);
67 }
68 mutex_exit(&bpl->bpl_lock);
69}
70 list_remove(&bpl->bpl_list, bpe);
71 mutex_exit(&bpl->bpl_lock);
72 func(arg, &bpe->bpe_blk, tx);
73 kmem_free(bpe, sizeof (*bpe));
74 mutex_enter(&bpl->bpl_lock);
75 }
76 mutex_exit(&bpl->bpl_lock);
77}