fs/zfs/dsl_deadlist.c

85 		dsl_deadlist_entry_t *dle = kmem_alloc(sizeof (*dle), KM_SLEEP);
86 		dle->dle_mintxg = strtonum(za.za_name, NULL);
87 		VERIFY3U(0, ==, bpobj_open(&dle->dle_bpobj, dl->dl_os,
89 		avl_add(&dl->dl_tree, dle);
122 	dsl_deadlist_entry_t *dle;
133 		while ((dle = avl_destroy_nodes(&dl->dl_tree, &cookie))
135 			bpobj_close(&dle->dle_bpobj);
136 			kmem_free(dle, sizeof (*dle));
182 dle_enqueue(dsl_deadlist_t *dl, dsl_deadlist_entry_t *dle,
185 	if (dle->dle_bpobj.bpo_object ==
188 		bpobj_close(&dle->dle_bpobj);
190 		VERIFY3U(0, ==, bpobj_open(&dle->dle_bpobj, dl->dl_os, obj));
192 		    dle->dle_mintxg, obj, tx));
194 	bpobj_enqueue(&dle->dle_bpobj, bp, tx);
198 dle_enqueue_subobj(dsl_deadlist_t *dl, dsl_deadlist_entry_t *dle,
201 	if (dle->dle_bpobj.bpo_object !=
203 		bpobj_enqueue_subobj(&dle->dle_bpobj, obj, tx);
205 		bpobj_close(&dle->dle_bpobj);
207 		VERIFY3U(0, ==, bpobj_open(&dle->dle_bpobj, dl->dl_os, obj));
209 		    dle->dle_mintxg, obj, tx));
217 	dsl_deadlist_entry_t *dle;
236 	dle = avl_find(&dl->dl_tree, &dle_tofind, &where);
237 	if (dle == NULL)
238 		dle = avl_nearest(&dl->dl_tree, where, AVL_BEFORE);
240 		dle = AVL_PREV(&dl->dl_tree, dle);
241 	dle_enqueue(dl, dle, bp, tx);
252 	dsl_deadlist_entry_t *dle;
259 	dle = kmem_alloc(sizeof (*dle), KM_SLEEP);
260 	dle->dle_mintxg = mintxg;
262 	VERIFY3U(0, ==, bpobj_open(&dle->dle_bpobj, dl->dl_os, obj));
263 	avl_add(&dl->dl_tree, dle);
276 	dsl_deadlist_entry_t *dle, *dle_prev;
284 	dle = avl_find(&dl->dl_tree, &dle_tofind, NULL);
285 	dle_prev = AVL_PREV(&dl->dl_tree, dle);
287 	dle_enqueue_subobj(dl, dle_prev, dle->dle_bpobj.bpo_object, tx);
289 	avl_remove(&dl->dl_tree, dle);
290 	bpobj_close(&dle->dle_bpobj);
291 	kmem_free(dle, sizeof (*dle));
327 	dsl_deadlist_entry_t *dle;
339 	for (dle = avl_first(&dl->dl_tree); dle;
340 	    dle = AVL_NEXT(&dl->dl_tree, dle)) {
343 		if (dle->dle_mintxg >= maxtxg)
348 		    dle->dle_mintxg, obj, tx));
380 	dsl_deadlist_entry_t *dle;
395 	dle = avl_find(&dl->dl_tree, &dle_tofind, &where);
400 	ASSERT(dle != NULL ||
403 	for (; dle && dle->dle_mintxg < maxtxg;
404 	    dle = AVL_NEXT(&dl->dl_tree, dle)) {
407 		VERIFY3U(0, ==, bpobj_space(&dle->dle_bpobj,
422 	dsl_deadlist_entry_t *dle;
441 	dle = avl_find(&dl->dl_tree, &dle_tofind, &where);
442 	if (dle == NULL)
443 		dle = avl_nearest(&dl->dl_tree, where, AVL_BEFORE);
444 	dle_enqueue_subobj(dl, dle, obj, tx);
502 	dsl_deadlist_entry_t *dle;
510 	dle = avl_find(&dl->dl_tree, &dle_tofind, &where);
511 	if (dle == NULL)
512 		dle = avl_nearest(&dl->dl_tree, where, AVL_AFTER);
513 	while (dle) {
517 		bpobj_enqueue_subobj(bpo, dle->dle_bpobj.bpo_object, tx);
519 		VERIFY3U(0, ==, bpobj_space(&dle->dle_bpobj,
531 		    dle->dle_mintxg, tx));
533 		dle_next = AVL_NEXT(&dl->dl_tree, dle);
534 		avl_remove(&dl->dl_tree, dle);
535 		bpobj_close(&dle->dle_bpobj);
536 		kmem_free(dle, sizeof (*dle));
537 		dle = dle_next;