42 	struct xfs_extent_busy	*new;  in xfs_extent_busy_insert()  local
48 	new = kmem_zalloc(sizeof(struct xfs_extent_busy), KM_MAYFAIL);  in xfs_extent_busy_insert()
49 	if (!new) {  in xfs_extent_busy_insert()
60 	new->agno = agno;  in xfs_extent_busy_insert()
61 	new->bno = bno;  in xfs_extent_busy_insert()
62 	new->length = len;  in xfs_extent_busy_insert()
63 	INIT_LIST_HEAD(&new->list);  in xfs_extent_busy_insert()
64 	new->flags = flags;  in xfs_extent_busy_insert()
69 	pag = xfs_perag_get(tp->t_mountp, new->agno);  in xfs_extent_busy_insert()
76 		if (new->bno < busyp->bno) {  in xfs_extent_busy_insert()
78 			ASSERT(new->bno + new->length <= busyp->bno);  in xfs_extent_busy_insert()
79 		} else if (new->bno > busyp->bno) {  in xfs_extent_busy_insert()
87 	rb_link_node(&new->rb_node, parent, rbp);  in xfs_extent_busy_insert()
88 	rb_insert_color(&new->rb_node, &pag->pagb_tree);  in xfs_extent_busy_insert()
90 	list_add(&new->list, &tp->t_busy);  in xfs_extent_busy_insert()