/usr/src/sys/ufs/ffs/ffs

Bug Summary

File:	ufs/ffs/ffs_softdep.c
Warning:	line 2691, column 25 Access to field 'db_pagedep' results in a dereference of a null pointer (loaded from variable 'newdirblk')
Annotated Source Code

Press '?' to see keyboard shortcuts
Show analyzer invocation
clang -cc1 -cc1 -triple amd64-unknown-openbsd7.4 -analyze -disable-free -clear-ast-before-backend -disable-llvm-verifier -discard-value-names -main-file-name ffs_softdep.c -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model static -mframe-pointer=all -relaxed-aliasing -ffp-contract=on -fno-rounding-math -mconstructor-aliases -ffreestanding -mcmodel=kernel -target-cpu x86-64 -target-feature +retpoline-indirect-calls -target-feature +retpoline-indirect-branches -target-feature -sse2 -target-feature -sse -target-feature -3dnow -target-feature -mmx -target-feature +save-args -target-feature +retpoline-external-thunk -disable-red-zone -no-implicit-float -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/sys/arch/amd64/compile/GENERIC.MP/obj -nostdsysteminc -nobuiltininc -resource-dir /usr/local/llvm16/lib/clang/16 -I /usr/src/sys -I /usr/src/sys/arch/amd64/compile/GENERIC.MP/obj -I /usr/src/sys/arch -I /usr/src/sys/dev/pci/drm/include -I /usr/src/sys/dev/pci/drm/include/uapi -I /usr/src/sys/dev/pci/drm/amd/include/asic_reg -I /usr/src/sys/dev/pci/drm/amd/include -I /usr/src/sys/dev/pci/drm/amd/amdgpu -I /usr/src/sys/dev/pci/drm/amd/display -I /usr/src/sys/dev/pci/drm/amd/display/include -I /usr/src/sys/dev/pci/drm/amd/display/dc -I /usr/src/sys/dev/pci/drm/amd/display/amdgpu_dm -I /usr/src/sys/dev/pci/drm/amd/pm/inc -I /usr/src/sys/dev/pci/drm/amd/pm/legacy-dpm -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu/inc -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu/smu11 -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu/smu12 -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu/smu13 -I /usr/src/sys/dev/pci/drm/amd/pm/powerplay/inc -I /usr/src/sys/dev/pci/drm/amd/pm/powerplay/hwmgr -I /usr/src/sys/dev/pci/drm/amd/pm/powerplay/smumgr -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu/inc -I /usr/src/sys/dev/pci/drm/amd/pm/swsmu/inc/pmfw_if -I /usr/src/sys/dev/pci/drm/amd/display/dc/inc -I /usr/src/sys/dev/pci/drm/amd/display/dc/inc/hw -I /usr/src/sys/dev/pci/drm/amd/display/dc/clk_mgr -I /usr/src/sys/dev/pci/drm/amd/display/modules/inc -I /usr/src/sys/dev/pci/drm/amd/display/modules/hdcp -I /usr/src/sys/dev/pci/drm/amd/display/dmub/inc -I /usr/src/sys/dev/pci/drm/i915 -D DDB -D DIAGNOSTIC -D KTRACE -D ACCOUNTING -D KMEMSTATS -D PTRACE -D POOL_DEBUG -D CRYPTO -D SYSVMSG -D SYSVSEM -D SYSVSHM -D UVM_SWAP_ENCRYPT -D FFS -D FFS2 -D FFS_SOFTUPDATES -D UFS_DIRHASH -D QUOTA -D EXT2FS -D MFS -D NFSCLIENT -D NFSSERVER -D CD9660 -D UDF -D MSDOSFS -D FIFO -D FUSE -D SOCKET_SPLICE -D TCP_ECN -D TCP_SIGNATURE -D INET6 -D IPSEC -D PPP_BSDCOMP -D PPP_DEFLATE -D PIPEX -D MROUTING -D MPLS -D BOOT_CONFIG -D USER_PCICONF -D APERTURE -D MTRR -D NTFS -D SUSPEND -D HIBERNATE -D PCIVERBOSE -D USBVERBOSE -D WSDISPLAY_COMPAT_USL -D WSDISPLAY_COMPAT_RAWKBD -D WSDISPLAY_DEFAULTSCREENS=6 -D X86EMU -D ONEWIREVERBOSE -D MULTIPROCESSOR -D MAXUSERS=80 -D _KERNEL -O2 -Wno-pointer-sign -Wno-address-of-packed-member -Wno-constant-conversion -Wno-unused-but-set-variable -Wno-gnu-folding-constant -fdebug-compilation-dir=/usr/src/sys/arch/amd64/compile/GENERIC.MP/obj -ferror-limit 19 -fwrapv -D_RET_PROTECTOR -ret-protector -fcf-protection=branch -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -o /home/ben/Projects/scan/2024-01-11-110808-61670-1 -x c /usr/src/sys/ufs/ffs/ffs_softdep.c
1/*	$OpenBSD: ffs_softdep.c,v 1.152 2023/07/05 15:13:28 beck Exp $	*/

3/*
* Copyright 1998, 2000 Marshall Kirk McKusick. All Rights Reserved.
*
* The soft updates code is derived from the appendix of a University
* of Michigan technical report (Gregory R. Ganger and Yale N. Patt,
* "Soft Updates: A Solution to the Metadata Update Problem in File
* Systems", CSE-TR-254-95, August 1995).
*
* Further information about soft updates can be obtained from:
*
*	Marshall Kirk McKusick		http://www.mckusick.com/softdep/
*	1614 Oxford Street		mckusick@mckusick.com
*	Berkeley, CA 94709-1608		+1-510-843-9542
*	USA
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
*    notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
*    notice, this list of conditions and the following disclaimer in the
*    documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY MARSHALL KIRK MCKUSICK ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED.  IN NO EVENT SHALL MARSHALL KIRK MCKUSICK BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
*	from: @(#)ffs_softdep.c	9.59 (McKusick) 6/21/00
* $FreeBSD: src/sys/ufs/ffs/ffs_softdep.c,v 1.86 2001/02/04 16:08:18 phk Exp $
*/

44#include <sys/param.h>
45#include <sys/buf.h>
46#include <sys/kernel.h>
47#include <sys/malloc.h>
48#include <sys/mount.h>
49#include <sys/proc.h>
50#include <sys/pool.h>
51#include <sys/syslog.h>
52#include <sys/systm.h>
53#include <sys/vnode.h>
54#include <sys/specdev.h>
55#include <crypto/siphash.h>
56#include <ufs/ufs/dir.h>
57#include <ufs/ufs/quota.h>
58#include <ufs/ufs/inode.h>
59#include <ufs/ufs/ufsmount.h>
60#include <ufs/ffs/fs.h>
61#include <ufs/ffs/softdep.h>
62#include <ufs/ffs/ffs_extern.h>
63#include <ufs/ufs/ufs_extern.h>

65#define STATIC

67/*
* Mapping of dependency structure types to malloc types.
*/
70#define	D_PAGEDEP0	0
71#define	D_INODEDEP1	1
72#define	D_NEWBLK2	2
73#define	D_BMSAFEMAP3	3
74#define	D_ALLOCDIRECT4	4
75#define	D_INDIRDEP5	5
76#define	D_ALLOCINDIR6	6
77#define	D_FREEFRAG7	7
78#define	D_FREEBLKS8	8
79#define	D_FREEFILE9	9
80#define	D_DIRADD10	10
81#define	D_MKDIR11		11
82#define	D_DIRREM12	12
83#define	D_NEWDIRBLK13	13
84#define	D_LAST13		13
85/*
* Names of softdep types.
*/
88const char *softdep_typenames[] = {
"pagedep",
"inodedep",
"newblk",
"bmsafemap",
"allocdirect",
"indirdep",
"allocindir",
"freefrag",
"freeblks",
"freefile",
"diradd",
"mkdir",
"dirrem",
"newdirblk",
103};
104#define	TYPENAME(type)((unsigned)(type) <= 13 ? softdep_typenames[type] : "???") \
((unsigned)(type) <= D_LAST13 ? softdep_typenames[type] : "???")
106/*
* Finding the current process.
*/
109#define CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc curproc({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc
110/*
* End system adaptation definitions.
*/

114/*
* Internal function prototypes.
*/
117STATIC	void softdep_error(char *, int);
118STATIC	void drain_output(struct vnode *, int);
119STATIC	int getdirtybuf(struct buf *, int);
120STATIC	void clear_remove(struct proc *);
121STATIC	void clear_inodedeps(struct proc *);
122STATIC	int flush_pagedep_deps(struct vnode *, struct mount *,
   struct diraddhd *);
124STATIC	int flush_inodedep_deps(struct fs *, ufsino_t);
125STATIC	int handle_written_filepage(struct pagedep *, struct buf *);
126STATIC  void diradd_inode_written(struct diradd *, struct inodedep *);
127STATIC	int handle_written_inodeblock(struct inodedep *, struct buf *);
128STATIC	void handle_allocdirect_partdone(struct allocdirect *);
129STATIC	void handle_allocindir_partdone(struct allocindir *);
130STATIC	void initiate_write_filepage(struct pagedep *, struct buf *);
131STATIC	void handle_written_mkdir(struct mkdir *, int);
132STATIC	void initiate_write_inodeblock_ufs1(struct inodedep *, struct buf *);
133#ifdef FFS21
134STATIC	void initiate_write_inodeblock_ufs2(struct inodedep *, struct buf *);
135#endif
136STATIC	void handle_workitem_freefile(struct freefile *);
137STATIC	void handle_workitem_remove(struct dirrem *);
138STATIC	struct dirrem *newdirrem(struct buf *, struct inode *,
   struct inode *, int, struct dirrem **);
140STATIC	void free_diradd(struct diradd *);
141STATIC	void free_allocindir(struct allocindir *, struct inodedep *);
142STATIC	void free_newdirblk(struct newdirblk *);
143STATIC	int indir_trunc(struct inode *, daddr_t, int, daddr_t, long *);
144STATIC	void deallocate_dependencies(struct buf *, struct inodedep *);
145STATIC	void free_allocdirect(struct allocdirectlst *,
   struct allocdirect *, int);
147STATIC	int check_inode_unwritten(struct inodedep *);
148STATIC	int free_inodedep(struct inodedep *);
149STATIC	void handle_workitem_freeblocks(struct freeblks *);
150STATIC	void merge_inode_lists(struct inodedep *);
151STATIC	void setup_allocindir_phase2(struct buf *, struct inode *,
   struct allocindir *);
153STATIC	struct allocindir *newallocindir(struct inode *, int, daddr_t,
   daddr_t);
155STATIC	void handle_workitem_freefrag(struct freefrag *);
156STATIC	struct freefrag *newfreefrag(struct inode *, daddr_t, long);
157STATIC	void allocdirect_merge(struct allocdirectlst *,
   struct allocdirect *, struct allocdirect *);
159STATIC	struct bmsafemap *bmsafemap_lookup(struct buf *);
160STATIC	int newblk_lookup(struct fs *, daddr_t, int,
   struct newblk **);
162STATIC	int inodedep_lookup(struct fs *, ufsino_t, int, struct inodedep **);
163STATIC	int pagedep_lookup(struct inode *, daddr_t, int, struct pagedep **);
164STATIC	void pause_timer(void *);
165STATIC	int request_cleanup(int, int);
166STATIC	int process_worklist_item(struct mount *, int *, int);
167STATIC	void add_to_worklist(struct worklist *);

169/*
* Exported softdep operations.
*/
172void softdep_disk_io_initiation(struct buf *);
173void softdep_disk_write_complete(struct buf *);
174void softdep_deallocate_dependencies(struct buf *);
175void softdep_move_dependencies(struct buf *, struct buf *);
176int softdep_count_dependencies(struct buf *bp, int, int);

178/*
* Locking primitives.
*
* For a uniprocessor, all we need to do is protect against disk
* interrupts. For a multiprocessor, this lock would have to be
* a mutex. A single mutex is used throughout this file, though
* finer grain locking could be used if contention warranted it.
*
* For a multiprocessor, the sleep call would accept a lock and
* release it after the sleep processing was complete. In a uniprocessor
* implementation there is no such interlock, so we simple mark
* the places where it needs to be done with the `interlocked' form
* of the lock calls. Since the uniprocessor sleep already interlocks
* the spl, there is nothing that really needs to be done.
*/
193#ifndef /* NOT */ DEBUG
194STATIC struct lockit {
int	lkt_spl;
196} lk = { 0 };
197#define ACQUIRE_LOCK(lk)(lk)->lkt_spl = splraise(0x3)		(lk)->lkt_spl = splbio()splraise(0x3)
198#define FREE_LOCK(lk)spllower((lk)->lkt_spl)			splx((lk)->lkt_spl)spllower((lk)->lkt_spl)
199#define ACQUIRE_LOCK_INTERLOCKED(lk,s)(lk)->lkt_spl = (s)	(lk)->lkt_spl = (s)
200#define FREE_LOCK_INTERLOCKED(lk)((lk)->lkt_spl)	((lk)->lkt_spl)

202#else /* DEBUG */
203STATIC struct lockit {
int	lkt_spl;
pid_t	lkt_held;
int     lkt_line;
207} lk = { 0, -1 };
208STATIC int lockcnt;

210STATIC	void acquire_lock(struct lockit *, int);
211STATIC	void free_lock(struct lockit *, int);
212STATIC	void acquire_lock_interlocked(struct lockit *, int, int);
213STATIC	int free_lock_interlocked(struct lockit *, int);

215#define ACQUIRE_LOCK(lk)(lk)->lkt_spl = splraise(0x3)		acquire_lock(lk, __LINE__215)
216#define FREE_LOCK(lk)spllower((lk)->lkt_spl)			free_lock(lk, __LINE__216)
217#define ACQUIRE_LOCK_INTERLOCKED(lk,s)(lk)->lkt_spl = (s)	acquire_lock_interlocked(lk, (s), __LINE__217)
218#define FREE_LOCK_INTERLOCKED(lk)((lk)->lkt_spl)	free_lock_interlocked(lk, __LINE__218)

220STATIC void
221acquire_lock(struct lockit *lk, int line)
222{
pid_t holder;
int original_line;

if (lk->lkt_held != -1) {
holder = lk->lkt_held;
original_line = lk->lkt_line;
FREE_LOCK(lk)spllower((lk)->lkt_spl);
if (holder == CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc->p_tid)
	panic("softdep_lock: locking against myself, acquired at line %d, relocked at line %d", original_line, line);
else
	panic("softdep_lock: lock held by %d, acquired at line %d, relocked at line %d", holder, original_line, line);
}
lk->lkt_spl = splbio()splraise(0x3);
lk->lkt_held = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc->p_tid;
lk->lkt_line = line;
lockcnt++;
239}

241STATIC void
242free_lock(struct lockit *lk, int line)
243{

if (lk->lkt_held == -1)
panic("softdep_unlock: lock not held at line %d", line);
lk->lkt_held = -1;
splx(lk->lkt_spl)spllower(lk->lkt_spl);
249}

251STATIC void
252acquire_lock_interlocked(struct lockit *lk, int s, int line)
253{
pid_t holder;
int original_line;

if (lk->lkt_held != -1) {
holder = lk->lkt_held;
original_line = lk->lkt_line;
FREE_LOCK_INTERLOCKED(lk)((lk)->lkt_spl);
if (holder == CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc->p_tid)
	panic("softdep_lock: locking against myself, acquired at line %d, relocked at line %d", original_line, line);
else
	panic("softdep_lock: lock held by %d, acquired at line %d, relocked at line %d", holder, original_line, line);
}
lk->lkt_held = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc->p_tid;
lk->lkt_line = line;
lk->lkt_spl = s;
lockcnt++;
270}

272STATIC int
273free_lock_interlocked(struct lockit *lk, int line)
274{

if (lk->lkt_held == -1)
panic("softdep_unlock_interlocked: lock not held at line %d", line);
lk->lkt_held = -1;

return (lk->lkt_spl);
281}
282#endif /* DEBUG */

284/*
* Place holder for real semaphores.
*/
287struct sema {
int	value;
pid_t	holder;
char	*name;
int	prio;
292};
293STATIC	void sema_init(struct sema *, char *, int);
294STATIC	int sema_get(struct sema *, struct lockit *);
295STATIC	void sema_release(struct sema *);

297STATIC void
298sema_init(struct sema *semap, char *name, int prio)
299{

semap->holder = -1;
semap->value = 0;
semap->name = name;
semap->prio = prio;
305}

307STATIC int
308sema_get(struct sema *semap, struct lockit *interlock)
309{
int s;

if (semap->value++ > 0) {
if (interlock != NULL((void *)0))
	s = FREE_LOCK_INTERLOCKED(interlock)((interlock)->lkt_spl);
tsleep_nsec(semap, semap->prio, semap->name, INFSLP0xffffffffffffffffULL);
if (interlock != NULL((void *)0)) {
	ACQUIRE_LOCK_INTERLOCKED(interlock, s)(interlock)->lkt_spl = (s);
	FREE_LOCK(interlock)spllower((interlock)->lkt_spl);
}
return (0);
}
semap->holder = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc->p_tid;
if (interlock != NULL((void *)0))
FREE_LOCK(interlock)spllower((interlock)->lkt_spl);
return (1);
326}

328STATIC void
329sema_release(struct sema *semap)
330{

if (semap->value <= 0 || semap->holder != CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc->p_tid) {
333#ifdef DEBUG
if (lk.lkt_held != -1)
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
336#endif
panic("sema_release: not held");
}
if (--semap->value > 0) {
semap->value = 0;
wakeup(semap);
}
semap->holder = -1;
344}

346/*
* Memory management.
*/
349STATIC struct pool pagedep_pool;
350STATIC struct pool inodedep_pool;
351STATIC struct pool newblk_pool;
352STATIC struct pool bmsafemap_pool;
353STATIC struct pool allocdirect_pool;
354STATIC struct pool indirdep_pool;
355STATIC struct pool allocindir_pool;
356STATIC struct pool freefrag_pool;
357STATIC struct pool freeblks_pool;
358STATIC struct pool freefile_pool;
359STATIC struct pool diradd_pool;
360STATIC struct pool mkdir_pool;
361STATIC struct pool dirrem_pool;
362STATIC struct pool newdirblk_pool;

364static __inline void
365softdep_free(struct worklist *item, int type)
366{

switch (type) {
case D_PAGEDEP0:
pool_put(&pagedep_pool, item);
break;

case D_INODEDEP1:
pool_put(&inodedep_pool, item);
break;

case D_BMSAFEMAP3:
pool_put(&bmsafemap_pool, item);
break;

case D_ALLOCDIRECT4:
pool_put(&allocdirect_pool, item);
break;

case D_INDIRDEP5:
pool_put(&indirdep_pool, item);
break;

case D_ALLOCINDIR6:
pool_put(&allocindir_pool, item);
break;

case D_FREEFRAG7:
pool_put(&freefrag_pool, item);
break;

case D_FREEBLKS8:
pool_put(&freeblks_pool, item);
break;

case D_FREEFILE9:
pool_put(&freefile_pool, item);
break;

case D_DIRADD10:
pool_put(&diradd_pool, item);
break;

case D_MKDIR11:
pool_put(&mkdir_pool, item);
break;

case D_DIRREM12:
pool_put(&dirrem_pool, item);
break;

case D_NEWDIRBLK13:
pool_put(&newdirblk_pool, item);
break;

default:
422#ifdef DEBUG
if (lk.lkt_held != -1)
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
425#endif
panic("softdep_free: unknown type %d", type);
}
428}

430struct workhead softdep_freequeue;

432static __inline void
433softdep_freequeue_add(struct worklist *item)
434{
int s;

s = splbio()splraise(0x3);
LIST_INSERT_HEAD(&softdep_freequeue, item, wk_list)do { if (((item)->wk_list.le_next = (&softdep_freequeue
)->lh_first) != ((void *)0)) (&softdep_freequeue)->
lh_first->wk_list.le_prev = &(item)->wk_list.le_next
; (&softdep_freequeue)->lh_first = (item); (item)->
wk_list.le_prev = &(&softdep_freequeue)->lh_first;
 } while (0);
splx(s)spllower(s);
440}

442static __inline void
443softdep_freequeue_process(void)
444{
struct worklist *wk;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

while ((wk = LIST_FIRST(&softdep_freequeue)((&softdep_freequeue)->lh_first)) != NULL((void *)0)) {
LIST_REMOVE(wk, wk_list)do { if ((wk)->wk_list.le_next != ((void *)0)) (wk)->wk_list
.le_next->wk_list.le_prev = (wk)->wk_list.le_prev; *(wk
)->wk_list.le_prev = (wk)->wk_list.le_next; ((wk)->wk_list
.le_prev) = ((void *)-1); ((wk)->wk_list.le_next) = ((void
 *)-1); } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
softdep_free(wk, wk->wk_type);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
}
455}

457/*
* Worklist queue management.
* These routines require that the lock be held.
*/
461#ifndef /* NOT */ DEBUG
462#define WORKLIST_INSERT(head, item)do { (item)->wk_state |= 0x8000; do { if (((item)->wk_list
.le_next = (head)->lh_first) != ((void *)0)) (head)->lh_first
->wk_list.le_prev = &(item)->wk_list.le_next; (head
)->lh_first = (item); (item)->wk_list.le_prev = &(head
)->lh_first; } while (0); } while (0) do {	\
(item)->wk_state |= ONWORKLIST0x8000;		\
LIST_INSERT_HEAD(head, item, wk_list)do { if (((item)->wk_list.le_next = (head)->lh_first) !=
 ((void *)0)) (head)->lh_first->wk_list.le_prev = &
(item)->wk_list.le_next; (head)->lh_first = (item); (item
)->wk_list.le_prev = &(head)->lh_first; } while (0);	\
465} while (0)
466#define WORKLIST_REMOVE(item)do { (item)->wk_state &= ~0x8000; do { if ((item)->
wk_list.le_next != ((void *)0)) (item)->wk_list.le_next->
wk_list.le_prev = (item)->wk_list.le_prev; *(item)->wk_list
.le_prev = (item)->wk_list.le_next; ((item)->wk_list.le_prev
) = ((void *)-1); ((item)->wk_list.le_next) = ((void *)-1)
; } while (0); } while (0) do {		\
(item)->wk_state &= ~ONWORKLIST0x8000;	\
LIST_REMOVE(item, wk_list)do { if ((item)->wk_list.le_next != ((void *)0)) (item)->
wk_list.le_next->wk_list.le_prev = (item)->wk_list.le_prev
; *(item)->wk_list.le_prev = (item)->wk_list.le_next; (
(item)->wk_list.le_prev) = ((void *)-1); ((item)->wk_list
.le_next) = ((void *)-1); } while (0);		\
469} while (0)
470#define WORKITEM_FREE(item, type)softdep_freequeue_add((struct worklist *)item) softdep_freequeue_add((struct worklist *)item)

472#else /* DEBUG */
473STATIC	void worklist_insert(struct workhead *, struct worklist *);
474STATIC	void worklist_remove(struct worklist *);
475STATIC	void workitem_free(struct worklist *);

477#define WORKLIST_INSERT(head, item)do { (item)->wk_state |= 0x8000; do { if (((item)->wk_list
.le_next = (head)->lh_first) != ((void *)0)) (head)->lh_first
->wk_list.le_prev = &(item)->wk_list.le_next; (head
)->lh_first = (item); (item)->wk_list.le_prev = &(head
)->lh_first; } while (0); } while (0) worklist_insert(head, item)
478#define WORKLIST_REMOVE(item)do { (item)->wk_state &= ~0x8000; do { if ((item)->
wk_list.le_next != ((void *)0)) (item)->wk_list.le_next->
wk_list.le_prev = (item)->wk_list.le_prev; *(item)->wk_list
.le_prev = (item)->wk_list.le_next; ((item)->wk_list.le_prev
) = ((void *)-1); ((item)->wk_list.le_next) = ((void *)-1)
; } while (0); } while (0) worklist_remove(item)
479#define WORKITEM_FREE(item, type)softdep_freequeue_add((struct worklist *)item) workitem_free((struct worklist *)item)

481STATIC void
482worklist_insert(struct workhead *head, struct worklist *item)
483{

if (lk.lkt_held == -1)
panic("worklist_insert: lock not held");
if (item->wk_state & ONWORKLIST0x8000) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("worklist_insert: already on list");
}
item->wk_state |= ONWORKLIST0x8000;
LIST_INSERT_HEAD(head, item, wk_list)do { if (((item)->wk_list.le_next = (head)->lh_first) !=
 ((void *)0)) (head)->lh_first->wk_list.le_prev = &
(item)->wk_list.le_next; (head)->lh_first = (item); (item
)->wk_list.le_prev = &(head)->lh_first; } while (0);
493}

495STATIC void
496worklist_remove(struct worklist *item)
497{

if (lk.lkt_held == -1)
panic("worklist_remove: lock not held");
if ((item->wk_state & ONWORKLIST0x8000) == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("worklist_remove: not on list");
}
item->wk_state &= ~ONWORKLIST0x8000;
LIST_REMOVE(item, wk_list)do { if ((item)->wk_list.le_next != ((void *)0)) (item)->
wk_list.le_next->wk_list.le_prev = (item)->wk_list.le_prev
; *(item)->wk_list.le_prev = (item)->wk_list.le_next; (
(item)->wk_list.le_prev) = ((void *)-1); ((item)->wk_list
.le_next) = ((void *)-1); } while (0);
507}

509STATIC void
510workitem_free(struct worklist *item)
511{

if (item->wk_state & ONWORKLIST0x8000) {
if (lk.lkt_held != -1)
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("workitem_free: still on list");
}
softdep_freequeue_add(item);
519}
520#endif /* DEBUG */

522/*
* Workitem queue management
*/
525STATIC struct workhead softdep_workitem_pending;
526STATIC struct worklist *worklist_tail;
527STATIC int num_on_worklist;	/* number of worklist items to be processed */
528STATIC int softdep_worklist_busy; /* 1 => trying to do unmount */
529STATIC int softdep_worklist_req; /* serialized waiters */
530STATIC int max_softdeps;	/* maximum number of structs before slowdown */
531STATIC int tickdelay = 2;	/* number of ticks to pause during slowdown */
532STATIC int proc_waiting;	/* tracks whether we have a timeout posted */
533STATIC int *stat_countp;	/* statistic to count in proc_waiting timeout */
534STATIC struct timeout proc_waiting_timeout; 
535STATIC struct proc *filesys_syncer; /* proc of filesystem syncer process */
536STATIC int req_clear_inodedeps;	/* syncer process flush some inodedeps */
537#define FLUSH_INODES1	1
538STATIC int req_clear_remove;	/* syncer process flush some freeblks */
539#define FLUSH_REMOVE2	2
540/*
* runtime statistics
*/
543STATIC int stat_worklist_push;	/* number of worklist cleanups */
544STATIC int stat_blk_limit_push;	/* number of times block limit neared */
545STATIC int stat_ino_limit_push;	/* number of times inode limit neared */
546STATIC int stat_blk_limit_hit;	/* number of times block slowdown imposed */
547STATIC int stat_ino_limit_hit;	/* number of times inode slowdown imposed */
548STATIC int stat_sync_limit_hit;	/* number of synchronous slowdowns imposed */
549STATIC int stat_indir_blk_ptrs;	/* bufs redirtied as indir ptrs not written */
550STATIC int stat_inode_bitmap;	/* bufs redirtied as inode bitmap not written */
551STATIC int stat_direct_blk_ptrs;/* bufs redirtied as direct ptrs not written */
552STATIC int stat_dir_entry;	/* bufs redirtied as dir entry cannot write */

554/*
* Add an item to the end of the work queue.
* This routine requires that the lock be held.
* This is the only routine that adds items to the list.
* The following routine is the only one that removes items
* and does so in order from first to last.
*/
561STATIC void
562add_to_worklist(struct worklist *wk)
563{

if (wk->wk_state & ONWORKLIST0x8000) {
566#ifdef DEBUG
if (lk.lkt_held != -1)
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
569#endif
panic("add_to_worklist: already on list");
}
wk->wk_state |= ONWORKLIST0x8000;
if (LIST_FIRST(&softdep_workitem_pending)((&softdep_workitem_pending)->lh_first) == NULL((void *)0))
LIST_INSERT_HEAD(&softdep_workitem_pending, wk, wk_list)do { if (((wk)->wk_list.le_next = (&softdep_workitem_pending
)->lh_first) != ((void *)0)) (&softdep_workitem_pending
)->lh_first->wk_list.le_prev = &(wk)->wk_list.le_next
; (&softdep_workitem_pending)->lh_first = (wk); (wk)->
wk_list.le_prev = &(&softdep_workitem_pending)->lh_first
; } while (0);
else
LIST_INSERT_AFTER(worklist_tail, wk, wk_list)do { if (((wk)->wk_list.le_next = (worklist_tail)->wk_list
.le_next) != ((void *)0)) (worklist_tail)->wk_list.le_next
->wk_list.le_prev = &(wk)->wk_list.le_next; (worklist_tail
)->wk_list.le_next = (wk); (wk)->wk_list.le_prev = &
(worklist_tail)->wk_list.le_next; } while (0);
worklist_tail = wk;
num_on_worklist += 1;
579}

581/*
* Process that runs once per second to handle items in the background queue.
*
* Note that we ensure that everything is done in the order in which they
* appear in the queue. The code below depends on this property to ensure
* that blocks of a file are freed before the inode itself is freed. This
* ordering ensures that no new <vfsid, inum, lbn> triples will be generated
* until all the old ones have been purged from the dependency lists.
*/
590int 
591softdep_process_worklist(struct mount *matchmnt)
592{
struct proc *p = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc;
int matchcnt, loopcount;
struct timeval starttime;

/*
* First process any items on the delayed-free queue.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
softdep_freequeue_process();
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);

/*
* Record the process identifier of our caller so that we can give
* this process preferential treatment in request_cleanup below.
* We can't do this in softdep_initialize, because the syncer doesn't
* have to run then.
* NOTE! This function _could_ be called with a curproc != syncerproc.
*/
filesys_syncer = syncerproc;
matchcnt = 0;

/*
* There is no danger of having multiple processes run this
* code, but we have to single-thread it when softdep_flushfiles()
* is in operation to get an accurate count of the number of items
* related to its mount point that are in the list.
*/
if (matchmnt == NULL((void *)0)) {
if (softdep_worklist_busy < 0)
	return(-1);
softdep_worklist_busy += 1;
}

/*
* If requested, try removing inode or removal dependencies.
*/
if (req_clear_inodedeps) {
clear_inodedeps(p);
req_clear_inodedeps -= 1;
wakeup_one(&proc_waiting)wakeup_n((&proc_waiting), 1);
}
if (req_clear_remove) {
clear_remove(p);
req_clear_remove -= 1;
wakeup_one(&proc_waiting)wakeup_n((&proc_waiting), 1);
}
loopcount = 1;
getmicrouptime(&starttime);
while (num_on_worklist > 0) {
if (process_worklist_item(matchmnt, &matchcnt, LK_NOWAIT0x0040UL) == 0)
	break;

/*
 * If a umount operation wants to run the worklist
 * accurately, abort.
 */
if (softdep_worklist_req && matchmnt == NULL((void *)0)) {
	matchcnt = -1;
	break;
}

/*
 * If requested, try removing inode or removal dependencies.
 */
if (req_clear_inodedeps) {
	clear_inodedeps(p);
	req_clear_inodedeps -= 1;
	wakeup_one(&proc_waiting)wakeup_n((&proc_waiting), 1);
}
if (req_clear_remove) {
	clear_remove(p);
	req_clear_remove -= 1;
	wakeup_one(&proc_waiting)wakeup_n((&proc_waiting), 1);
}
/*
 * We do not generally want to stop for buffer space, but if
 * we are really being a buffer hog, we will stop and wait.
 */
671#if 0
if (loopcount++ % 128 == 0)
	bwillwrite();
674#endif
/*
 * Never allow processing to run for more than one
 * second. Otherwise the other syncer tasks may get
 * excessively backlogged.
 */
{
	struct timeval diff;
	struct timeval tv;

	getmicrouptime(&tv);
	timersub(&tv, &starttime, &diff)do { (&diff)->tv_sec = (&tv)->tv_sec - (&starttime
)->tv_sec; (&diff)->tv_usec = (&tv)->tv_usec
 - (&starttime)->tv_usec; if ((&diff)->tv_usec <
 0) { (&diff)->tv_sec--; (&diff)->tv_usec += 1000000
; } } while (0);
	if (diff.tv_sec != 0 && matchmnt == NULL((void *)0)) {
		matchcnt = -1;
		break;
	}
}

/*
 * Process any new items on the delayed-free queue.
 */
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
softdep_freequeue_process();
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
}
if (matchmnt == NULL((void *)0)) {
softdep_worklist_busy -= 1;
if (softdep_worklist_req && softdep_worklist_busy == 0)
	wakeup(&softdep_worklist_req);
}
return (matchcnt);
705}

707/*
* Process one item on the worklist.
*/
710STATIC int
711process_worklist_item(struct mount *matchmnt, int *matchcnt, int flags)
712{
struct worklist *wk, *wkend;
struct dirrem *dirrem;
struct mount *mp;
struct vnode *vp;

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
/*
* Normally we just process each item on the worklist in order.
* However, if we are in a situation where we cannot lock any
* inodes, we have to skip over any dirrem requests whose
* vnodes are resident and locked.
*/
LIST_FOREACH(wk, &softdep_workitem_pending, wk_list)for((wk) = ((&softdep_workitem_pending)->lh_first); (wk
)!= ((void *)0); (wk) = ((wk)->wk_list.le_next)) {
if ((flags & LK_NOWAIT0x0040UL) == 0 || wk->wk_type != D_DIRREM12)
	break;
dirrem = WK_DIRREM(wk)((struct dirrem *)(wk));
vp = ufs_ihashlookup(VFSTOUFS(dirrem->dm_mnt)((struct ufsmount *)((dirrem->dm_mnt)->mnt_data))->um_dev,
    dirrem->dm_oldinum);
if (vp == NULL((void *)0) || !VOP_ISLOCKED(vp))
	break;
}
if (wk == NULL((void *)0)) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (0);
}
/*
* Remove the item to be processed. If we are removing the last
* item on the list, we need to recalculate the tail pointer.
* As this happens rarely and usually when the list is short,
* we just run down the list to find it rather than tracking it
* in the above loop.
*/
WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
if (wk == worklist_tail) {
LIST_FOREACH(wkend, &softdep_workitem_pending, wk_list)for((wkend) = ((&softdep_workitem_pending)->lh_first);
 (wkend)!= ((void *)0); (wkend) = ((wkend)->wk_list.le_next
))
	if (LIST_NEXT(wkend, wk_list)((wkend)->wk_list.le_next) == NULL((void *)0))
		break;
worklist_tail = wkend;
}
num_on_worklist -= 1;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
switch (wk->wk_type) {

case D_DIRREM12:
/* removal of a directory entry */
mp = WK_DIRREM(wk)((struct dirrem *)(wk))->dm_mnt;
759#if 0
if (vn_write_suspend_wait(NULL((void *)0), mp, V_NOWAIT))
	panic("%s: dirrem on suspended filesystem",
		"process_worklist_item");
763#endif
if (matchmnt != NULL((void *)0) && mp == matchmnt)
	*matchcnt += 1;
handle_workitem_remove(WK_DIRREM(wk)((struct dirrem *)(wk)));
break;

case D_FREEBLKS8:
/* releasing blocks and/or fragments from a file */
mp = WK_FREEBLKS(wk)((struct freeblks *)(wk))->fb_mnt;
772#if 0
if (vn_write_suspend_wait(NULL((void *)0), mp, V_NOWAIT))
	panic("%s: freeblks on suspended filesystem",
		"process_worklist_item");
776#endif
if (matchmnt != NULL((void *)0) && mp == matchmnt)
	*matchcnt += 1;
handle_workitem_freeblocks(WK_FREEBLKS(wk)((struct freeblks *)(wk)));
break;

case D_FREEFRAG7:
/* releasing a fragment when replaced as a file grows */
mp = WK_FREEFRAG(wk)((struct freefrag *)(wk))->ff_mnt;
785#if 0
if (vn_write_suspend_wait(NULL((void *)0), mp, V_NOWAIT))
	panic("%s: freefrag on suspended filesystem",
		"process_worklist_item");
789#endif
if (matchmnt != NULL((void *)0) && mp == matchmnt)
	*matchcnt += 1;
handle_workitem_freefrag(WK_FREEFRAG(wk)((struct freefrag *)(wk)));
break;

case D_FREEFILE9:
/* releasing an inode when its link count drops to 0 */
mp = WK_FREEFILE(wk)((struct freefile *)(wk))->fx_mnt;
798#if 0
if (vn_write_suspend_wait(NULL((void *)0), mp, V_NOWAIT))
	panic("%s: freefile on suspended filesystem",
		"process_worklist_item");
802#endif
if (matchmnt != NULL((void *)0) && mp == matchmnt)
	*matchcnt += 1;
handle_workitem_freefile(WK_FREEFILE(wk)((struct freefile *)(wk)));
break;

default:
panic("%s_process_worklist: Unknown type %s",
    "softdep", TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
/* NOTREACHED */
}
return (1);
814}

816/*
* Move dependencies from one buffer to another.
*/
819void
820softdep_move_dependencies(struct buf *oldbp, struct buf *newbp)
821{
struct worklist *wk, *wktail;

if (LIST_FIRST(&newbp->b_dep)((&newbp->b_dep)->lh_first) != NULL((void *)0))
panic("softdep_move_dependencies: need merge code");
wktail = NULL((void *)0);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
while ((wk = LIST_FIRST(&oldbp->b_dep)((&oldbp->b_dep)->lh_first)) != NULL((void *)0)) {
LIST_REMOVE(wk, wk_list)do { if ((wk)->wk_list.le_next != ((void *)0)) (wk)->wk_list
.le_next->wk_list.le_prev = (wk)->wk_list.le_prev; *(wk
)->wk_list.le_prev = (wk)->wk_list.le_next; ((wk)->wk_list
.le_prev) = ((void *)-1); ((wk)->wk_list.le_next) = ((void
 *)-1); } while (0);
if (wktail == NULL((void *)0))
	LIST_INSERT_HEAD(&newbp->b_dep, wk, wk_list)do { if (((wk)->wk_list.le_next = (&newbp->b_dep)->
lh_first) != ((void *)0)) (&newbp->b_dep)->lh_first
->wk_list.le_prev = &(wk)->wk_list.le_next; (&newbp
->b_dep)->lh_first = (wk); (wk)->wk_list.le_prev = &
(&newbp->b_dep)->lh_first; } while (0);
else
	LIST_INSERT_AFTER(wktail, wk, wk_list)do { if (((wk)->wk_list.le_next = (wktail)->wk_list.le_next
) != ((void *)0)) (wktail)->wk_list.le_next->wk_list.le_prev
 = &(wk)->wk_list.le_next; (wktail)->wk_list.le_next
 = (wk); (wk)->wk_list.le_prev = &(wktail)->wk_list
.le_next; } while (0);
wktail = wk;
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
837}

839/*
* Purge the work list of all items associated with a particular mount point.
*/
842int
843softdep_flushworklist(struct mount *oldmnt, int *countp, struct proc *p)
844{
struct vnode *devvp;
int count, error = 0;

/*
* Await our turn to clear out the queue, then serialize access.
*/
while (softdep_worklist_busy) {
softdep_worklist_req += 1;
tsleep_nsec(&softdep_worklist_req, PRIBIO16, "softflush", INFSLP0xffffffffffffffffULL);
softdep_worklist_req -= 1;
}
softdep_worklist_busy = -1;
/*
* Alternately flush the block device associated with the mount
* point and process any dependencies that the flushing
* creates. We continue until no more worklist dependencies
* are found.
*/
*countp = 0;
devvp = VFSTOUFS(oldmnt)((struct ufsmount *)((oldmnt)->mnt_data))->um_devvp;
while ((count = softdep_process_worklist(oldmnt)) > 0) {
*countp += count;
vn_lock(devvp, LK_EXCLUSIVE0x0001UL | LK_RETRY0x2000UL);
error = VOP_FSYNC(devvp, p->p_ucred, MNT_WAIT1, p);
VOP_UNLOCK(devvp);
if (error)
	break;
}
softdep_worklist_busy = 0;
if (softdep_worklist_req)
wakeup(&softdep_worklist_req);
return (error);
877}

879/*
* Flush all vnodes and worklist items associated with a specified mount point.
*/
882int
883softdep_flushfiles(struct mount *oldmnt, int flags, struct proc *p)
884{
int error, count, loopcnt;

/*
* Alternately flush the vnodes associated with the mount
* point and process any dependencies that the flushing
* creates. In theory, this loop can happen at most twice,
* but we give it a few extra just to be sure.
*/
for (loopcnt = 10; loopcnt > 0; loopcnt--) {
/*
 * Do another flush in case any vnodes were brought in
 * as part of the cleanup operations.
 */
if ((error = ffs_flushfiles(oldmnt, flags, p)) != 0)
	break;
if ((error = softdep_flushworklist(oldmnt, &count, p)) != 0 ||
    count == 0)
	break;
}
/*
* If the reboot process sleeps during the loop, the update
* process may call softdep_process_worklist() and create
* new dirty vnodes at the mount point.  Call ffs_flushfiles()
* again after the loop has flushed all soft dependencies.
*/
if (error == 0)
error = ffs_flushfiles(oldmnt, flags, p);
/*
* If we are unmounting then it is an error to fail. If we
* are simply trying to downgrade to read-only, then filesystem
* activity can keep us busy forever, so we just fail with EBUSY.
*/
if (loopcnt == 0) {
error = EBUSY16;
}
return (error);
921}

923/*
* Structure hashing.
* 
* There are three types of structures that can be looked up:
*	1) pagedep structures identified by mount point, inode number,
*	   and logical block.
*	2) inodedep structures identified by mount point and inode number.
*	3) newblk structures identified by mount point and
*	   physical block number.
*
* The "pagedep" and "inodedep" dependency structures are hashed
* separately from the file blocks and inodes to which they correspond.
* This separation helps when the in-memory copy of an inode or
* file block must be replaced. It also obviates the need to access
* an inode or file page when simply updating (or de-allocating)
* dependency structures. Lookup of newblk structures is needed to
* find newly allocated blocks when trying to associate them with
* their allocdirect or allocindir structure.
*
* The lookup routines optionally create and hash a new instance when
* an existing entry is not found.
*/
945#define DEPALLOC0x0001	0x0001	/* allocate structure if lookup fails */
946#define NODELAY0x0002         0x0002  /* cannot do background work */

948SIPHASH_KEY softdep_hashkey;

950/*
* Structures and routines associated with pagedep caching.
*/
953LIST_HEAD(pagedep_hashhead, pagedep)struct pagedep_hashhead { struct pagedep *lh_first; } *pagedep_hashtbl;
954u_long	pagedep_hash;		/* size of hash table - 1 */
955STATIC struct sema pagedep_in_progress;

957/*
* Look up a pagedep. Return 1 if found, 0 if not found or found
* when asked to allocate but not associated with any buffer.
* If not found, allocate if DEPALLOC flag is passed.
* Found or allocated entry is returned in pagedeppp.
* This routine must be called with splbio interrupts blocked.
*/
964STATIC int
965pagedep_lookup(struct inode *ip, daddr_t lbn, int flags,
  struct pagedep **pagedeppp)
967{
SIPHASH_CTX ctx;
struct pagedep *pagedep;
struct pagedep_hashhead *pagedephd;
struct mount *mp;
int i;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

976#ifdef DEBUG
if (lk.lkt_held == -1)
panic("pagedep_lookup: lock not held");
979#endif
mp = ITOV(ip)((ip)->i_vnode)->v_mount;

SipHash24_Init(&ctx, &softdep_hashkey)SipHash_Init((&ctx), (&softdep_hashkey));
SipHash24_Update(&ctx, &mp, sizeof(mp))SipHash_Update((&ctx), 2, 4, (&mp), (sizeof(mp)));
SipHash24_Update(&ctx, &ip->i_number, sizeof(ip->i_number))SipHash_Update((&ctx), 2, 4, (&ip->i_number), (sizeof
(ip->i_number)));
SipHash24_Update(&ctx, &lbn, sizeof(lbn))SipHash_Update((&ctx), 2, 4, (&lbn), (sizeof(lbn)));
pagedephd = &pagedep_hashtbl[SipHash24_End(&ctx)SipHash_End((&ctx), 2, 4) & pagedep_hash];
987top:
LIST_FOREACH(pagedep, pagedephd, pd_hash)for((pagedep) = ((pagedephd)->lh_first); (pagedep)!= ((void
 *)0); (pagedep) = ((pagedep)->pd_hash.le_next))
if (ip->i_number == pagedep->pd_ino &&
    lbn == pagedep->pd_lbn &&
    mp == pagedep->pd_mnt)
	break;
if (pagedep) {
*pagedeppp = pagedep;
if ((flags & DEPALLOC0x0001) != 0 &&
    (pagedep->pd_statepd_list.wk_state & ONWORKLIST0x8000) == 0)
	return (0);
return (1);
}
if ((flags & DEPALLOC0x0001) == 0) {
*pagedeppp = NULL((void *)0);
return (0);
}
if (sema_get(&pagedep_in_progress, &lk) == 0) {
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
goto top;
}
pagedep = pool_get(&pagedep_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
pagedep->pd_list.wk_type = D_PAGEDEP0;
pagedep->pd_mnt = mp;
pagedep->pd_ino = ip->i_number;
pagedep->pd_lbn = lbn;
LIST_INIT(&pagedep->pd_dirremhd)do { ((&pagedep->pd_dirremhd)->lh_first) = ((void *
)0); } while (0);
LIST_INIT(&pagedep->pd_pendinghd)do { ((&pagedep->pd_pendinghd)->lh_first) = ((void *
)0); } while (0);
for (i = 0; i < DAHASHSZ6; i++)
LIST_INIT(&pagedep->pd_diraddhd[i])do { ((&pagedep->pd_diraddhd[i])->lh_first) = ((void
 *)0); } while (0);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
LIST_INSERT_HEAD(pagedephd, pagedep, pd_hash)do { if (((pagedep)->pd_hash.le_next = (pagedephd)->lh_first
) != ((void *)0)) (pagedephd)->lh_first->pd_hash.le_prev
 = &(pagedep)->pd_hash.le_next; (pagedephd)->lh_first
 = (pagedep); (pagedep)->pd_hash.le_prev = &(pagedephd
)->lh_first; } while (0);
sema_release(&pagedep_in_progress);
*pagedeppp = pagedep;
return (0);
1022}

1024/*
* Structures and routines associated with inodedep caching.
*/
1027LIST_HEAD(inodedep_hashhead, inodedep)struct inodedep_hashhead { struct inodedep *lh_first; } *inodedep_hashtbl;
1028STATIC u_long	inodedep_hash;	/* size of hash table - 1 */
1029STATIC long	num_inodedep;	/* number of inodedep allocated */
1030STATIC struct sema inodedep_in_progress;

1032/*
* Look up a inodedep. Return 1 if found, 0 if not found.
* If not found, allocate if DEPALLOC flag is passed.
* Found or allocated entry is returned in inodedeppp.
* This routine must be called with splbio interrupts blocked.
*/
1038STATIC int
1039inodedep_lookup(struct fs *fs, ufsino_t inum, int flags,
  struct inodedep **inodedeppp)
1041{
SIPHASH_CTX ctx;
struct inodedep *inodedep;
struct inodedep_hashhead *inodedephd;
int firsttry;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

1049#ifdef DEBUG
if (lk.lkt_held == -1)
panic("inodedep_lookup: lock not held");
1052#endif
firsttry = 1;
SipHash24_Init(&ctx, &softdep_hashkey)SipHash_Init((&ctx), (&softdep_hashkey));
SipHash24_Update(&ctx, &fs, sizeof(fs))SipHash_Update((&ctx), 2, 4, (&fs), (sizeof(fs)));
SipHash24_Update(&ctx, &inum, sizeof(inum))SipHash_Update((&ctx), 2, 4, (&inum), (sizeof(inum)));
inodedephd = &inodedep_hashtbl[SipHash24_End(&ctx)SipHash_End((&ctx), 2, 4) & inodedep_hash];
1058top:
LIST_FOREACH(inodedep, inodedephd, id_hash)for((inodedep) = ((inodedephd)->lh_first); (inodedep)!= ((
void *)0); (inodedep) = ((inodedep)->id_hash.le_next))
if (inum == inodedep->id_ino && fs == inodedep->id_fs)
	break;
if (inodedep) {
*inodedeppp = inodedep;
return (1);
}
if ((flags & DEPALLOC0x0001) == 0) {
*inodedeppp = NULL((void *)0);
return (0);
}
/*
* If we are over our limit, try to improve the situation.
*/
if (num_inodedep > max_softdeps && firsttry && (flags & NODELAY0x0002) == 0 &&
   request_cleanup(FLUSH_INODES1, 1)) {
firsttry = 0;
goto top;
}
if (sema_get(&inodedep_in_progress, &lk) == 0) {
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
goto top;
}
num_inodedep += 1;
inodedep = pool_get(&inodedep_pool, PR_WAITOK0x0001);
inodedep->id_list.wk_type = D_INODEDEP1;
inodedep->id_fs = fs;
inodedep->id_ino = inum;
inodedep->id_stateid_list.wk_state = ALLCOMPLETE(0x0001 | 0x0004 | 0x0008);
inodedep->id_nlinkdelta = 0;
inodedep->id_savedino1id_un.idu_savedino1 = NULL((void *)0);
inodedep->id_savedsize = -1;
inodedep->id_buf = NULL((void *)0);
LIST_INIT(&inodedep->id_pendinghd)do { ((&inodedep->id_pendinghd)->lh_first) = ((void
 *)0); } while (0);
LIST_INIT(&inodedep->id_inowait)do { ((&inodedep->id_inowait)->lh_first) = ((void *
)0); } while (0);
LIST_INIT(&inodedep->id_bufwait)do { ((&inodedep->id_bufwait)->lh_first) = ((void *
)0); } while (0);
TAILQ_INIT(&inodedep->id_inoupdt)do { (&inodedep->id_inoupdt)->tqh_first = ((void *)
0); (&inodedep->id_inoupdt)->tqh_last = &(&
inodedep->id_inoupdt)->tqh_first; } while (0);
TAILQ_INIT(&inodedep->id_newinoupdt)do { (&inodedep->id_newinoupdt)->tqh_first = ((void
 *)0); (&inodedep->id_newinoupdt)->tqh_last = &
(&inodedep->id_newinoupdt)->tqh_first; } while (0);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
LIST_INSERT_HEAD(inodedephd, inodedep, id_hash)do { if (((inodedep)->id_hash.le_next = (inodedephd)->lh_first
) != ((void *)0)) (inodedephd)->lh_first->id_hash.le_prev
 = &(inodedep)->id_hash.le_next; (inodedephd)->lh_first
 = (inodedep); (inodedep)->id_hash.le_prev = &(inodedephd
)->lh_first; } while (0);
sema_release(&inodedep_in_progress);
*inodedeppp = inodedep;
return (0);
1102}

1104/*
* Structures and routines associated with newblk caching.
*/
1107LIST_HEAD(newblk_hashhead, newblk)struct newblk_hashhead { struct newblk *lh_first; } *newblk_hashtbl;
1108u_long	newblk_hash;		/* size of hash table - 1 */
1109STATIC struct sema newblk_in_progress;

1111/*
* Look up a newblk. Return 1 if found, 0 if not found.
* If not found, allocate if DEPALLOC flag is passed.
* Found or allocated entry is returned in newblkpp.
*/
1116STATIC int
1117newblk_lookup(struct fs *fs, daddr_t newblkno, int flags,
  struct newblk **newblkpp)
1119{
SIPHASH_CTX ctx;
struct newblk *newblk;
struct newblk_hashhead *newblkhd;

SipHash24_Init(&ctx, &softdep_hashkey)SipHash_Init((&ctx), (&softdep_hashkey));
SipHash24_Update(&ctx, &fs, sizeof(fs))SipHash_Update((&ctx), 2, 4, (&fs), (sizeof(fs)));
SipHash24_Update(&ctx, &newblkno, sizeof(newblkno))SipHash_Update((&ctx), 2, 4, (&newblkno), (sizeof(newblkno
)));
newblkhd = &newblk_hashtbl[SipHash24_End(&ctx)SipHash_End((&ctx), 2, 4) & newblk_hash];
1128top:
LIST_FOREACH(newblk, newblkhd, nb_hash)for((newblk) = ((newblkhd)->lh_first); (newblk)!= ((void *
)0); (newblk) = ((newblk)->nb_hash.le_next))
if (newblkno == newblk->nb_newblkno && fs == newblk->nb_fs)
	break;
if (newblk) {
*newblkpp = newblk;
return (1);
}
if ((flags & DEPALLOC0x0001) == 0) {
*newblkpp = NULL((void *)0);
return (0);
}
if (sema_get(&newblk_in_progress, NULL((void *)0)) == 0)
goto top;
newblk = pool_get(&newblk_pool, PR_WAITOK0x0001);
newblk->nb_state = 0;
newblk->nb_fs = fs;
newblk->nb_newblkno = newblkno;
LIST_INSERT_HEAD(newblkhd, newblk, nb_hash)do { if (((newblk)->nb_hash.le_next = (newblkhd)->lh_first
) != ((void *)0)) (newblkhd)->lh_first->nb_hash.le_prev
 = &(newblk)->nb_hash.le_next; (newblkhd)->lh_first
 = (newblk); (newblk)->nb_hash.le_prev = &(newblkhd)->
lh_first; } while (0);
sema_release(&newblk_in_progress);
*newblkpp = newblk;
return (0);
1150}

1152/*
* Executed during filesystem system initialization before
* mounting any file systems.
*/
1156void 
1157softdep_initialize(void)
1158{

bioops.io_start = softdep_disk_io_initiation;
bioops.io_complete = softdep_disk_write_complete;
bioops.io_deallocate = softdep_deallocate_dependencies;
bioops.io_movedeps = softdep_move_dependencies;
bioops.io_countdeps = softdep_count_dependencies;

LIST_INIT(&mkdirlisthd)do { ((&mkdirlisthd)->lh_first) = ((void *)0); } while
 (0);
LIST_INIT(&softdep_workitem_pending)do { ((&softdep_workitem_pending)->lh_first) = ((void *
)0); } while (0);
1168#ifdef KMEMSTATS1
max_softdeps = min (initialvnodes * 8,
   kmemstats[M_INODEDEP79].ks_limit / (2 * sizeof(struct inodedep)));
1171#else
max_softdeps = initialvnodes * 4;
1173#endif
arc4random_buf(&softdep_hashkey, sizeof(softdep_hashkey));
pagedep_hashtbl = hashinit(initialvnodes / 5, M_PAGEDEP78, M_WAITOK0x0001,
   &pagedep_hash);
sema_init(&pagedep_in_progress, "pagedep", PRIBIO16);
inodedep_hashtbl = hashinit(initialvnodes, M_INODEDEP79, M_WAITOK0x0001,
   &inodedep_hash);
sema_init(&inodedep_in_progress, "inodedep", PRIBIO16);
newblk_hashtbl = hashinit(64, M_NEWBLK80, M_WAITOK0x0001, &newblk_hash);
sema_init(&newblk_in_progress, "newblk", PRIBIO16);
timeout_set(&proc_waiting_timeout, pause_timer, NULL((void *)0));
pool_init(&pagedep_pool, sizeof(struct pagedep), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "pagedep", NULL((void *)0));
pool_init(&inodedep_pool, sizeof(struct inodedep), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "inodedep", NULL((void *)0));
pool_init(&newblk_pool, sizeof(struct newblk), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "newblk", NULL((void *)0));
pool_init(&bmsafemap_pool, sizeof(struct bmsafemap), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "bmsafemap", NULL((void *)0));
pool_init(&allocdirect_pool, sizeof(struct allocdirect), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "allocdir", NULL((void *)0));
pool_init(&indirdep_pool, sizeof(struct indirdep), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "indirdep", NULL((void *)0));
pool_init(&allocindir_pool, sizeof(struct allocindir), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "allocindir", NULL((void *)0));
pool_init(&freefrag_pool, sizeof(struct freefrag), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "freefrag", NULL((void *)0));
pool_init(&freeblks_pool, sizeof(struct freeblks), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "freeblks", NULL((void *)0));
pool_init(&freefile_pool, sizeof(struct freefile), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "freefile", NULL((void *)0));
pool_init(&diradd_pool, sizeof(struct diradd), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "diradd", NULL((void *)0));
pool_init(&mkdir_pool, sizeof(struct mkdir), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "mkdir", NULL((void *)0));
pool_init(&dirrem_pool, sizeof(struct dirrem), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "dirrem", NULL((void *)0));
pool_init(&newdirblk_pool, sizeof(struct newdirblk), 0, IPL_NONE0x0,
   PR_WAITOK0x0001, "newdirblk", NULL((void *)0));
1212}

1214/*
* Called at mount time to notify the dependency code that a
* filesystem wishes to use it.
*/
1218int
1219softdep_mount(struct vnode *devvp, struct mount *mp, struct fs *fs,
  struct ucred *cred)
1221{
struct csum_total cstotal;
struct cg *cgp;
struct buf *bp;
int error, cyl;

KASSERTMSG(1, "softdep_mount should not have been called")((1) ? (void)0 : panic("kernel %sassertion \"%s\" failed: file \"%s\", line %d"
 " " "softdep_mount should not have been called", "diagnostic "
, "1", "/usr/src/sys/ufs/ffs/ffs_softdep.c", 1227));

/*
* When doing soft updates, the counters in the
* superblock may have gotten out of sync, so we have
* to scan the cylinder groups and recalculate them.
*/
if ((fs->fs_flags & FS_UNCLEAN0x01) == 0)
return (0);
memset(&cstotal, 0, sizeof(cstotal))__builtin_memset((&cstotal), (0), (sizeof(cstotal)));
for (cyl = 0; cyl < fs->fs_ncg; cyl++) {
if ((error = bread(devvp, fsbtodb(fs, cgtod(fs, cyl))((((((daddr_t)(fs)->fs_fpg * (cyl)) + (fs)->fs_cgoffset
 * ((cyl) & ~((fs)->fs_cgmask))) + (fs)->fs_cblkno)
) << (fs)->fs_fsbtodb),
    fs->fs_cgsize, &bp)) != 0) {
	brelse(bp);
	return (error);
}
cgp = (struct cg *)bp->b_data;
cstotal.cs_nffree += cgp->cg_cs.cs_nffree;
cstotal.cs_nbfree += cgp->cg_cs.cs_nbfree;
cstotal.cs_nifree += cgp->cg_cs.cs_nifree;
cstotal.cs_ndir += cgp->cg_cs.cs_ndir;
fs->fs_cs(fs, cyl)fs_csp[cyl] = cgp->cg_cs;
brelse(bp);
}
1251#ifdef DEBUG
if (memcmp(&cstotal, &fs->fs_cstotal, sizeof(cstotal))__builtin_memcmp((&cstotal), (&fs->fs_cstotal), (sizeof
(cstotal))))
printf("ffs_mountfs: superblock updated for soft updates\n");
1254#endif
memcpy(&fs->fs_cstotal, &cstotal, sizeof(cstotal))__builtin_memcpy((&fs->fs_cstotal), (&cstotal), (sizeof
(cstotal)));
return (0);
1257}

1259/*
* Protecting the freemaps (or bitmaps).
* 
* To eliminate the need to execute fsck before mounting a file system
* after a power failure, one must (conservatively) guarantee that the
* on-disk copy of the bitmaps never indicate that a live inode or block is
* free.  So, when a block or inode is allocated, the bitmap should be
* updated (on disk) before any new pointers.  When a block or inode is
* freed, the bitmap should not be updated until all pointers have been
* reset.  The latter dependency is handled by the delayed de-allocation
* approach described below for block and inode de-allocation.  The former
* dependency is handled by calling the following procedure when a block or
* inode is allocated. When an inode is allocated an "inodedep" is created
* with its DEPCOMPLETE flag cleared until its bitmap is written to disk.
* Each "inodedep" is also inserted into the hash indexing structure so
* that any additional link additions can be made dependent on the inode
* allocation.
* 
* The ufs file system maintains a number of free block counts (e.g., per
* cylinder group, per cylinder and per <cylinder, rotational position> pair)
* in addition to the bitmaps.  These counts are used to improve efficiency
* during allocation and therefore must be consistent with the bitmaps.
* There is no convenient way to guarantee post-crash consistency of these
* counts with simple update ordering, for two main reasons: (1) The counts
* and bitmaps for a single cylinder group block are not in the same disk
* sector.  If a disk write is interrupted (e.g., by power failure), one may
* be written and the other not.  (2) Some of the counts are located in the
* superblock rather than the cylinder group block. So, we focus our soft
* updates implementation on protecting the bitmaps. When mounting a
* filesystem, we recompute the auxiliary counts from the bitmaps.
*/

1291/*
* Called just after updating the cylinder group block to allocate an inode.
*/
1294/* buffer for cylgroup block with inode map */
1295/* inode related to allocation */
1296/* new inode number being allocated */
1297void
1298softdep_setup_inomapdep(struct buf *bp, struct inode *ip, ufsino_t newinum)
1299{
struct inodedep *inodedep;
struct bmsafemap *bmsafemap;

/*
* Create a dependency for the newly allocated inode.
* Panic if it already exists as something is seriously wrong.
* Otherwise add it to the dependency list for the buffer holding
* the cylinder group map from which it was allocated.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(ip->i_fsinode_u.fs, newinum, DEPALLOC0x0001 | NODELAY0x0002, &inodedep)
   != 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("softdep_setup_inomapdep: found inode");
}
inodedep->id_buf = bp;
inodedep->id_stateid_list.wk_state &= ~DEPCOMPLETE0x0008;
bmsafemap = bmsafemap_lookup(bp);
LIST_INSERT_HEAD(&bmsafemap->sm_inodedephd, inodedep, id_deps)do { if (((inodedep)->id_deps.le_next = (&bmsafemap->
sm_inodedephd)->lh_first) != ((void *)0)) (&bmsafemap->
sm_inodedephd)->lh_first->id_deps.le_prev = &(inodedep
)->id_deps.le_next; (&bmsafemap->sm_inodedephd)->
lh_first = (inodedep); (inodedep)->id_deps.le_prev = &
(&bmsafemap->sm_inodedephd)->lh_first; } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
1320}

1322/*
* Called just after updating the cylinder group block to
* allocate block or fragment.
*/
1326/* buffer for cylgroup block with block map */
1327/* filesystem doing allocation */
1328/* number of newly allocated block */
1329void
1330softdep_setup_blkmapdep(struct buf *bp, struct fs *fs, daddr_t newblkno)
1331{
struct newblk *newblk;
struct bmsafemap *bmsafemap;

/*
* Create a dependency for the newly allocated block.
* Add it to the dependency list for the buffer holding
* the cylinder group map from which it was allocated.
*/
if (newblk_lookup(fs, newblkno, DEPALLOC0x0001, &newblk) != 0)
panic("softdep_setup_blkmapdep: found block");
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
newblk->nb_bmsafemap = bmsafemap = bmsafemap_lookup(bp);
LIST_INSERT_HEAD(&bmsafemap->sm_newblkhd, newblk, nb_deps)do { if (((newblk)->nb_deps.le_next = (&bmsafemap->
sm_newblkhd)->lh_first) != ((void *)0)) (&bmsafemap->
sm_newblkhd)->lh_first->nb_deps.le_prev = &(newblk)
->nb_deps.le_next; (&bmsafemap->sm_newblkhd)->lh_first
 = (newblk); (newblk)->nb_deps.le_prev = &(&bmsafemap
->sm_newblkhd)->lh_first; } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
1346}

1348/*
* Find the bmsafemap associated with a cylinder group buffer.
* If none exists, create one. The buffer must be locked when
* this routine is called and this routine must be called with
* splbio interrupts blocked.
*/
1354STATIC struct bmsafemap *
1355bmsafemap_lookup(struct buf *bp)
1356{
struct bmsafemap *bmsafemap;
struct worklist *wk;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

1362#ifdef DEBUG
if (lk.lkt_held == -1)
panic("bmsafemap_lookup: lock not held");
1365#endif
LIST_FOREACH(wk, &bp->b_dep, wk_list)for((wk) = ((&bp->b_dep)->lh_first); (wk)!= ((void *
)0); (wk) = ((wk)->wk_list.le_next))
if (wk->wk_type == D_BMSAFEMAP3)
	return (WK_BMSAFEMAP(wk)((struct bmsafemap *)(wk)));
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
bmsafemap = pool_get(&bmsafemap_pool, PR_WAITOK0x0001);
bmsafemap->sm_list.wk_type = D_BMSAFEMAP3;
bmsafemap->sm_list.wk_state = 0;
bmsafemap->sm_buf = bp;
LIST_INIT(&bmsafemap->sm_allocdirecthd)do { ((&bmsafemap->sm_allocdirecthd)->lh_first) = (
(void *)0); } while (0);
LIST_INIT(&bmsafemap->sm_allocindirhd)do { ((&bmsafemap->sm_allocindirhd)->lh_first) = ((
void *)0); } while (0);
LIST_INIT(&bmsafemap->sm_inodedephd)do { ((&bmsafemap->sm_inodedephd)->lh_first) = ((void
 *)0); } while (0);
LIST_INIT(&bmsafemap->sm_newblkhd)do { ((&bmsafemap->sm_newblkhd)->lh_first) = ((void
 *)0); } while (0);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
WORKLIST_INSERT(&bp->b_dep, &bmsafemap->sm_list)do { (&bmsafemap->sm_list)->wk_state |= 0x8000; do {
 if (((&bmsafemap->sm_list)->wk_list.le_next = (&
bp->b_dep)->lh_first) != ((void *)0)) (&bp->b_dep
)->lh_first->wk_list.le_prev = &(&bmsafemap->
sm_list)->wk_list.le_next; (&bp->b_dep)->lh_first
 = (&bmsafemap->sm_list); (&bmsafemap->sm_list)
->wk_list.le_prev = &(&bp->b_dep)->lh_first;
 } while (0); } while (0);
return (bmsafemap);
1381}

1383/*
* Direct block allocation dependencies.
* 
* When a new block is allocated, the corresponding disk locations must be
* initialized (with zeros or new data) before the on-disk inode points to
* them.  Also, the freemap from which the block was allocated must be
* updated (on disk) before the inode's pointer. These two dependencies are
* independent of each other and are needed for all file blocks and indirect
* blocks that are pointed to directly by the inode.  Just before the
* "in-core" version of the inode is updated with a newly allocated block
* number, a procedure (below) is called to setup allocation dependency
* structures.  These structures are removed when the corresponding
* dependencies are satisfied or when the block allocation becomes obsolete
* (i.e., the file is deleted, the block is de-allocated, or the block is a
* fragment that gets upgraded).  All of these cases are handled in
* procedures described later.
* 
* When a file extension causes a fragment to be upgraded, either to a larger
* fragment or to a full block, the on-disk location may change (if the
* previous fragment could not simply be extended). In this case, the old
* fragment must be de-allocated, but not until after the inode's pointer has
* been updated. In most cases, this is handled by later procedures, which
* will construct a "freefrag" structure to be added to the workitem queue
* when the inode update is complete (or obsolete).  The main exception to
* this is when an allocation occurs while a pending allocation dependency
* (for the same block pointer) remains.  This case is handled in the main
* allocation dependency setup procedure by immediately freeing the
* unreferenced fragments.
*/ 
1412/* inode to which block is being added */
1413/* block pointer within inode */
1414/* disk block number being added */
1415/* previous block number, 0 unless frag */
1416/* size of new block */
1417/* size of new block */
1418/* bp for allocated block */
1419void 
1420softdep_setup_allocdirect(struct inode *ip, daddr_t lbn, daddr_t newblkno,
  daddr_t oldblkno, long newsize, long oldsize, struct buf *bp)
1422{
struct allocdirect *adp, *oldadp;
struct allocdirectlst *adphead;
struct bmsafemap *bmsafemap;
struct inodedep *inodedep;
struct pagedep *pagedep;
struct newblk *newblk;

adp = pool_get(&allocdirect_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
adp->ad_list.wk_type = D_ALLOCDIRECT4;
adp->ad_lbn = lbn;
adp->ad_newblkno = newblkno;
adp->ad_oldblkno = oldblkno;
adp->ad_newsize = newsize;
adp->ad_oldsize = oldsize;
adp->ad_statead_list.wk_state = ATTACHED0x0001;
LIST_INIT(&adp->ad_newdirblk)do { ((&adp->ad_newdirblk)->lh_first) = ((void *)0)
; } while (0);
if (newblkno == oldblkno)
adp->ad_freefrag = NULL((void *)0);
else
adp->ad_freefrag = newfreefrag(ip, oldblkno, oldsize);

if (newblk_lookup(ip->i_fsinode_u.fs, newblkno, 0, &newblk) == 0)
panic("softdep_setup_allocdirect: lost block");

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
inodedep_lookup(ip->i_fsinode_u.fs, ip->i_number, DEPALLOC0x0001 | NODELAY0x0002, &inodedep);
adp->ad_inodedep = inodedep;

if (newblk->nb_state == DEPCOMPLETE0x0008) {
adp->ad_statead_list.wk_state |= DEPCOMPLETE0x0008;
adp->ad_buf = NULL((void *)0);
} else {
bmsafemap = newblk->nb_bmsafemap;
adp->ad_buf = bmsafemap->sm_buf;
LIST_REMOVE(newblk, nb_deps)do { if ((newblk)->nb_deps.le_next != ((void *)0)) (newblk
)->nb_deps.le_next->nb_deps.le_prev = (newblk)->nb_deps
.le_prev; *(newblk)->nb_deps.le_prev = (newblk)->nb_deps
.le_next; ((newblk)->nb_deps.le_prev) = ((void *)-1); ((newblk
)->nb_deps.le_next) = ((void *)-1); } while (0);
LIST_INSERT_HEAD(&bmsafemap->sm_allocdirecthd, adp, ad_deps)do { if (((adp)->ad_deps.le_next = (&bmsafemap->sm_allocdirecthd
)->lh_first) != ((void *)0)) (&bmsafemap->sm_allocdirecthd
)->lh_first->ad_deps.le_prev = &(adp)->ad_deps.le_next
; (&bmsafemap->sm_allocdirecthd)->lh_first = (adp);
 (adp)->ad_deps.le_prev = &(&bmsafemap->sm_allocdirecthd
)->lh_first; } while (0);
}
LIST_REMOVE(newblk, nb_hash)do { if ((newblk)->nb_hash.le_next != ((void *)0)) (newblk
)->nb_hash.le_next->nb_hash.le_prev = (newblk)->nb_hash
.le_prev; *(newblk)->nb_hash.le_prev = (newblk)->nb_hash
.le_next; ((newblk)->nb_hash.le_prev) = ((void *)-1); ((newblk
)->nb_hash.le_next) = ((void *)-1); } while (0);
pool_put(&newblk_pool, newblk);

if (bp == NULL((void *)0)) {
/*
 * XXXUBC - Yes, I know how to fix this, but not right now.
 */
panic("softdep_setup_allocdirect: Bonk art in the head");
}
WORKLIST_INSERT(&bp->b_dep, &adp->ad_list)do { (&adp->ad_list)->wk_state |= 0x8000; do { if (
((&adp->ad_list)->wk_list.le_next = (&bp->b_dep
)->lh_first) != ((void *)0)) (&bp->b_dep)->lh_first
->wk_list.le_prev = &(&adp->ad_list)->wk_list
.le_next; (&bp->b_dep)->lh_first = (&adp->ad_list
); (&adp->ad_list)->wk_list.le_prev = &(&bp
->b_dep)->lh_first; } while (0); } while (0);
if (lbn >= NDADDR12) {
/* allocating an indirect block */
if (oldblkno != 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_setup_allocdirect: non-zero indir");
}
} else {
/*
 * Allocating a direct block.
 *
 * If we are allocating a directory block, then we must
 * allocate an associated pagedep to track additions and
 * deletions.
 */
if ((DIP(ip, mode)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_mode : (ip)->dinode_u.ffs2_din->di_mode) & IFMT0170000) == IFDIR0040000 &&
    pagedep_lookup(ip, lbn, DEPALLOC0x0001, &pagedep) == 0)
	WORKLIST_INSERT(&bp->b_dep, &pagedep->pd_list)do { (&pagedep->pd_list)->wk_state |= 0x8000; do { if
 (((&pagedep->pd_list)->wk_list.le_next = (&bp->
b_dep)->lh_first) != ((void *)0)) (&bp->b_dep)->
lh_first->wk_list.le_prev = &(&pagedep->pd_list
)->wk_list.le_next; (&bp->b_dep)->lh_first = (&
pagedep->pd_list); (&pagedep->pd_list)->wk_list.
le_prev = &(&bp->b_dep)->lh_first; } while (0);
 } while (0);
}
/*
* The list of allocdirects must be kept in sorted and ascending
* order so that the rollback routines can quickly determine the
* first uncommitted block (the size of the file stored on disk
* ends at the end of the lowest committed fragment, or if there
* are no fragments, at the end of the highest committed block).
* Since files generally grow, the typical case is that the new
* block is to be added at the end of the list. We speed this
* special case by checking against the last allocdirect in the
* list before laboriously traversing the list looking for the
* insertion point.
*/
adphead = &inodedep->id_newinoupdt;
oldadp = TAILQ_LAST(adphead, allocdirectlst)(*(((struct allocdirectlst *)((adphead)->tqh_last))->tqh_last
));
if (oldadp == NULL((void *)0) || oldadp->ad_lbn <= lbn) {
/* insert at end of list */
TAILQ_INSERT_TAIL(adphead, adp, ad_next)do { (adp)->ad_next.tqe_next = ((void *)0); (adp)->ad_next
.tqe_prev = (adphead)->tqh_last; *(adphead)->tqh_last =
 (adp); (adphead)->tqh_last = &(adp)->ad_next.tqe_next
; } while (0);
if (oldadp != NULL((void *)0) && oldadp->ad_lbn == lbn)
	allocdirect_merge(adphead, adp, oldadp);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return;
}
TAILQ_FOREACH(oldadp, adphead, ad_next)for((oldadp) = ((adphead)->tqh_first); (oldadp) != ((void *
)0); (oldadp) = ((oldadp)->ad_next.tqe_next)) {
if (oldadp->ad_lbn >= lbn)
	break;
}
if (oldadp == NULL((void *)0)) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("softdep_setup_allocdirect: lost entry");
}
/* insert in middle of list */
TAILQ_INSERT_BEFORE(oldadp, adp, ad_next)do { (adp)->ad_next.tqe_prev = (oldadp)->ad_next.tqe_prev
; (adp)->ad_next.tqe_next = (oldadp); *(oldadp)->ad_next
.tqe_prev = (adp); (oldadp)->ad_next.tqe_prev = &(adp)
->ad_next.tqe_next; } while (0);
if (oldadp->ad_lbn == lbn)
allocdirect_merge(adphead, adp, oldadp);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
1523}

1525/*
* Replace an old allocdirect dependency with a newer one.
* This routine must be called with splbio interrupts blocked.
*/
1529/* head of list holding allocdirects */
1530/* allocdirect being added */
1531/* existing allocdirect being checked */
1532STATIC void
1533allocdirect_merge(struct allocdirectlst *adphead, struct allocdirect *newadp,
  struct allocdirect *oldadp)
1535{
struct worklist *wk;
struct freefrag *freefrag;
struct newdirblk *newdirblk;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

1542#ifdef DEBUG
if (lk.lkt_held == -1)
panic("allocdirect_merge: lock not held");
1545#endif
if (newadp->ad_oldblkno != oldadp->ad_newblkno ||
   newadp->ad_oldsize != oldadp->ad_newsize ||
   newadp->ad_lbn >= NDADDR12) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("allocdirect_merge: old %lld != new %lld || lbn %lld >= "
    "%d", (long long)newadp->ad_oldblkno,
    (long long)oldadp->ad_newblkno, (long long)newadp->ad_lbn,
    NDADDR12);
}
newadp->ad_oldblkno = oldadp->ad_oldblkno;
newadp->ad_oldsize = oldadp->ad_oldsize;
/*
* If the old dependency had a fragment to free or had never
* previously had a block allocated, then the new dependency
* can immediately post its freefrag and adopt the old freefrag.
* This action is done by swapping the freefrag dependencies.
* The new dependency gains the old one's freefrag, and the
* old one gets the new one and then immediately puts it on
* the worklist when it is freed by free_allocdirect. It is
* not possible to do this swap when the old dependency had a
* non-zero size but no previous fragment to free. This condition
* arises when the new block is an extension of the old block.
* Here, the first part of the fragment allocated to the new
* dependency is part of the block currently claimed on disk by
* the old dependency, so cannot legitimately be freed until the
* conditions for the new dependency are fulfilled.
*/
if (oldadp->ad_freefrag != NULL((void *)0) || oldadp->ad_oldblkno == 0) {
freefrag = newadp->ad_freefrag;
newadp->ad_freefrag = oldadp->ad_freefrag;
oldadp->ad_freefrag = freefrag;
}
/*
* If we are tracking a new directory-block allocation,
* move it from the old allocdirect to the new allocdirect.
*/
if ((wk = LIST_FIRST(&oldadp->ad_newdirblk)((&oldadp->ad_newdirblk)->lh_first)) != NULL((void *)0)) {
newdirblk = WK_NEWDIRBLK(wk)((struct newdirblk *)(wk));
WORKLIST_REMOVE(&newdirblk->db_list)do { (&newdirblk->db_list)->wk_state &= ~0x8000
; do { if ((&newdirblk->db_list)->wk_list.le_next !=
 ((void *)0)) (&newdirblk->db_list)->wk_list.le_next
->wk_list.le_prev = (&newdirblk->db_list)->wk_list
.le_prev; *(&newdirblk->db_list)->wk_list.le_prev =
 (&newdirblk->db_list)->wk_list.le_next; ((&newdirblk
->db_list)->wk_list.le_prev) = ((void *)-1); ((&newdirblk
->db_list)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
if (LIST_FIRST(&oldadp->ad_newdirblk)((&oldadp->ad_newdirblk)->lh_first) != NULL((void *)0))
	panic("allocdirect_merge: extra newdirblk");
WORKLIST_INSERT(&newadp->ad_newdirblk, &newdirblk->db_list)do { (&newdirblk->db_list)->wk_state |= 0x8000; do {
 if (((&newdirblk->db_list)->wk_list.le_next = (&
newadp->ad_newdirblk)->lh_first) != ((void *)0)) (&
newadp->ad_newdirblk)->lh_first->wk_list.le_prev = &
(&newdirblk->db_list)->wk_list.le_next; (&newadp
->ad_newdirblk)->lh_first = (&newdirblk->db_list
); (&newdirblk->db_list)->wk_list.le_prev = &(&
newadp->ad_newdirblk)->lh_first; } while (0); } while (
0);
}
free_allocdirect(adphead, oldadp, 0);
1590}

1592/*
* Allocate a new freefrag structure if needed.
*/
1595STATIC struct freefrag *
1596newfreefrag(struct inode *ip, daddr_t blkno, long size)
1597{
struct freefrag *freefrag;
struct fs *fs;

if (blkno == 0)
return (NULL((void *)0));
fs = ip->i_fsinode_u.fs;
if (fragnum(fs, blkno)((blkno) & ((fs)->fs_frag - 1)) + numfrags(fs, size)((size) >> (fs)->fs_fshift) > fs->fs_frag)
panic("newfreefrag: frag size");
freefrag = pool_get(&freefrag_pool, PR_WAITOK0x0001);
freefrag->ff_list.wk_type = D_FREEFRAG7;
freefrag->ff_stateff_list.wk_state = DIP(ip, uid)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_uid : (ip)->dinode_u.ffs2_din->di_uid) & ~ONWORKLIST0x8000; /* used below */
freefrag->ff_inum = ip->i_number;
freefrag->ff_mnt = ITOV(ip)((ip)->i_vnode)->v_mount;
freefrag->ff_devvp = ip->i_devvpi_ump->um_devvp;
freefrag->ff_blkno = blkno;
freefrag->ff_fragsize = size;
return (freefrag);
1615}

1617/*
* This workitem de-allocates fragments that were replaced during
* file block allocation.
*/
1621STATIC void 
1622handle_workitem_freefrag(struct freefrag *freefrag)
1623{
struct inode tip;
struct ufs1_dinode dtip1;

tip.i_vnode = NULL((void *)0);
tip.i_din1dinode_u.ffs1_din = &dtip1;
tip.i_fsinode_u.fs = VFSTOUFS(freefrag->ff_mnt)((struct ufsmount *)((freefrag->ff_mnt)->mnt_data))->um_fsufsmount_u.fs;
tip.i_ump = VFSTOUFS(freefrag->ff_mnt)((struct ufsmount *)((freefrag->ff_mnt)->mnt_data));
tip.i_dev = freefrag->ff_devvp->v_rdevv_un.vu_specinfo->si_rdev;
tip.i_number = freefrag->ff_inum;
tip.i_ffs1_uiddinode_u.ffs1_din->di_uid = freefrag->ff_stateff_list.wk_state & ~ONWORKLIST0x8000; /* set above */
ffs_blkfree(&tip, freefrag->ff_blkno, freefrag->ff_fragsize);
pool_put(&freefrag_pool, freefrag);
1636}

1638/*
* Indirect block allocation dependencies.
* 
* The same dependencies that exist for a direct block also exist when
* a new block is allocated and pointed to by an entry in a block of
* indirect pointers. The undo/redo states described above are also
* used here. Because an indirect block contains many pointers that
* may have dependencies, a second copy of the entire in-memory indirect
* block is kept. The buffer cache copy is always completely up-to-date.
* The second copy, which is used only as a source for disk writes,
* contains only the safe pointers (i.e., those that have no remaining
* update dependencies). The second copy is freed when all pointers
* are safe. The cache is not allowed to replace indirect blocks with
* pending update dependencies. If a buffer containing an indirect
* block with dependencies is written, these routines will mark it
* dirty again. It can only be successfully written once all the
* dependencies are removed. The ffs_fsync routine in conjunction with
* softdep_sync_metadata work together to get all the dependencies
* removed so that a file can be successfully written to disk. Three
* procedures are used when setting up indirect block pointer
* dependencies. The division is necessary because of the organization
* of the "balloc" routine and because of the distinction between file
* pages and file metadata blocks.
*/

1663/*
* Allocate a new allocindir structure.
*/
1666/* inode for file being extended */
1667/* offset of pointer in indirect block */
1668/* disk block number being added */
1669/* previous block number, 0 if none */
1670STATIC struct allocindir *
1671newallocindir(struct inode *ip, int ptrno, daddr_t newblkno,
  daddr_t oldblkno)
1673{
struct allocindir *aip;

aip = pool_get(&allocindir_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
aip->ai_list.wk_type = D_ALLOCINDIR6;
aip->ai_stateai_list.wk_state = ATTACHED0x0001;
aip->ai_offset = ptrno;
aip->ai_newblkno = newblkno;
aip->ai_oldblkno = oldblkno;
aip->ai_freefrag = newfreefrag(ip, oldblkno, ip->i_fsinode_u.fs->fs_bsize);
return (aip);
1684}

1686/*
* Called just before setting an indirect block pointer
* to a newly allocated file page.
*/
1690/* inode for file being extended */
1691/* allocated block number within file */
1692/* buffer with indirect blk referencing page */
1693/* offset of pointer in indirect block */
1694/* disk block number being added */
1695/* previous block number, 0 if none */
1696/* buffer holding allocated page */
1697void
1698softdep_setup_allocindir_page(struct inode *ip, daddr_t lbn, struct buf *bp,
  int ptrno, daddr_t newblkno, daddr_t oldblkno, struct buf *nbp)
1700{
struct allocindir *aip;
struct pagedep *pagedep;

aip = newallocindir(ip, ptrno, newblkno, oldblkno);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
/*
* If we are allocating a directory page, then we must
* allocate an associated pagedep to track additions and
* deletions.
*/
if ((DIP(ip, mode)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_mode : (ip)->dinode_u.ffs2_din->di_mode) & IFMT0170000) == IFDIR0040000 &&
   pagedep_lookup(ip, lbn, DEPALLOC0x0001, &pagedep) == 0)
WORKLIST_INSERT(&nbp->b_dep, &pagedep->pd_list)do { (&pagedep->pd_list)->wk_state |= 0x8000; do { if
 (((&pagedep->pd_list)->wk_list.le_next = (&nbp
->b_dep)->lh_first) != ((void *)0)) (&nbp->b_dep
)->lh_first->wk_list.le_prev = &(&pagedep->pd_list
)->wk_list.le_next; (&nbp->b_dep)->lh_first = (&
pagedep->pd_list); (&pagedep->pd_list)->wk_list.
le_prev = &(&nbp->b_dep)->lh_first; } while (0)
; } while (0);
if (nbp == NULL((void *)0)) {
/*
 * XXXUBC - Yes, I know how to fix this, but not right now.
 */
panic("softdep_setup_allocindir_page: Bonk art in the head");
}
WORKLIST_INSERT(&nbp->b_dep, &aip->ai_list)do { (&aip->ai_list)->wk_state |= 0x8000; do { if (
((&aip->ai_list)->wk_list.le_next = (&nbp->b_dep
)->lh_first) != ((void *)0)) (&nbp->b_dep)->lh_first
->wk_list.le_prev = &(&aip->ai_list)->wk_list
.le_next; (&nbp->b_dep)->lh_first = (&aip->ai_list
); (&aip->ai_list)->wk_list.le_prev = &(&nbp
->b_dep)->lh_first; } while (0); } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
setup_allocindir_phase2(bp, ip, aip);
1723}

1725/*
* Called just before setting an indirect block pointer to a
* newly allocated indirect block.
*/
1729/* newly allocated indirect block */
1730/* inode for file being extended */
1731/* indirect block referencing allocated block */
1732/* offset of pointer in indirect block */
1733/* disk block number being added */
1734void
1735softdep_setup_allocindir_meta(struct buf *nbp, struct inode *ip,
  struct buf *bp, int ptrno, daddr_t newblkno)
1737{
struct allocindir *aip;

aip = newallocindir(ip, ptrno, newblkno, 0);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
WORKLIST_INSERT(&nbp->b_dep, &aip->ai_list)do { (&aip->ai_list)->wk_state |= 0x8000; do { if (
((&aip->ai_list)->wk_list.le_next = (&nbp->b_dep
)->lh_first) != ((void *)0)) (&nbp->b_dep)->lh_first
->wk_list.le_prev = &(&aip->ai_list)->wk_list
.le_next; (&nbp->b_dep)->lh_first = (&aip->ai_list
); (&aip->ai_list)->wk_list.le_prev = &(&nbp
->b_dep)->lh_first; } while (0); } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
setup_allocindir_phase2(bp, ip, aip);
1745}

1747/*
* Called to finish the allocation of the "aip" allocated
* by one of the two routines above.
*/
1751/* in-memory copy of the indirect block */
1752/* inode for file being extended */
1753/* allocindir allocated by the above routines */
1754STATIC void 
1755setup_allocindir_phase2(struct buf *bp, struct inode *ip,
  struct allocindir *aip)
1757{
struct worklist *wk;
struct indirdep *indirdep, *newindirdep;
struct bmsafemap *bmsafemap;
struct allocindir *oldaip;
struct freefrag *freefrag;
struct newblk *newblk;

if (bp->b_lblkno >= 0)
panic("setup_allocindir_phase2: not indir blk");
for (indirdep = NULL((void *)0), newindirdep = NULL((void *)0); ; ) {
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
LIST_FOREACH(wk, &bp->b_dep, wk_list)for((wk) = ((&bp->b_dep)->lh_first); (wk)!= ((void *
)0); (wk) = ((wk)->wk_list.le_next)) {
	if (wk->wk_type != D_INDIRDEP5)
		continue;
	indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk));
	break;
}
if (indirdep == NULL((void *)0) && newindirdep) {
	indirdep = newindirdep;
	WORKLIST_INSERT(&bp->b_dep, &indirdep->ir_list)do { (&indirdep->ir_list)->wk_state |= 0x8000; do {
 if (((&indirdep->ir_list)->wk_list.le_next = (&
bp->b_dep)->lh_first) != ((void *)0)) (&bp->b_dep
)->lh_first->wk_list.le_prev = &(&indirdep->
ir_list)->wk_list.le_next; (&bp->b_dep)->lh_first
 = (&indirdep->ir_list); (&indirdep->ir_list)->
wk_list.le_prev = &(&bp->b_dep)->lh_first; } while
 (0); } while (0);
	newindirdep = NULL((void *)0);
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
if (indirdep) {
	if (newblk_lookup(ip->i_fsinode_u.fs, aip->ai_newblkno, 0,
	    &newblk) == 0)
		panic("setup_allocindir: lost block");
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	if (newblk->nb_state == DEPCOMPLETE0x0008) {
		aip->ai_stateai_list.wk_state |= DEPCOMPLETE0x0008;
		aip->ai_buf = NULL((void *)0);
	} else {
		bmsafemap = newblk->nb_bmsafemap;
		aip->ai_buf = bmsafemap->sm_buf;
		LIST_REMOVE(newblk, nb_deps)do { if ((newblk)->nb_deps.le_next != ((void *)0)) (newblk
)->nb_deps.le_next->nb_deps.le_prev = (newblk)->nb_deps
.le_prev; *(newblk)->nb_deps.le_prev = (newblk)->nb_deps
.le_next; ((newblk)->nb_deps.le_prev) = ((void *)-1); ((newblk
)->nb_deps.le_next) = ((void *)-1); } while (0);
		LIST_INSERT_HEAD(&bmsafemap->sm_allocindirhd,do { if (((aip)->ai_deps.le_next = (&bmsafemap->sm_allocindirhd
)->lh_first) != ((void *)0)) (&bmsafemap->sm_allocindirhd
)->lh_first->ai_deps.le_prev = &(aip)->ai_deps.le_next
; (&bmsafemap->sm_allocindirhd)->lh_first = (aip); (
aip)->ai_deps.le_prev = &(&bmsafemap->sm_allocindirhd
)->lh_first; } while (0)
		    aip, ai_deps)do { if (((aip)->ai_deps.le_next = (&bmsafemap->sm_allocindirhd
)->lh_first) != ((void *)0)) (&bmsafemap->sm_allocindirhd
)->lh_first->ai_deps.le_prev = &(aip)->ai_deps.le_next
; (&bmsafemap->sm_allocindirhd)->lh_first = (aip); (
aip)->ai_deps.le_prev = &(&bmsafemap->sm_allocindirhd
)->lh_first; } while (0);
	}
	LIST_REMOVE(newblk, nb_hash)do { if ((newblk)->nb_hash.le_next != ((void *)0)) (newblk
)->nb_hash.le_next->nb_hash.le_prev = (newblk)->nb_hash
.le_prev; *(newblk)->nb_hash.le_prev = (newblk)->nb_hash
.le_next; ((newblk)->nb_hash.le_prev) = ((void *)-1); ((newblk
)->nb_hash.le_next) = ((void *)-1); } while (0);
	pool_put(&newblk_pool, newblk);
	aip->ai_indirdep = indirdep;
	/*
	 * Check to see if there is an existing dependency
	 * for this block. If there is, merge the old
	 * dependency into the new one.
	 */
	if (aip->ai_oldblkno == 0)
		oldaip = NULL((void *)0);
	else

		LIST_FOREACH(oldaip, &indirdep->ir_deplisthd, ai_next)for((oldaip) = ((&indirdep->ir_deplisthd)->lh_first
); (oldaip)!= ((void *)0); (oldaip) = ((oldaip)->ai_next.le_next
))
			if (oldaip->ai_offset == aip->ai_offset)
				break;
	freefrag = NULL((void *)0);
	if (oldaip != NULL((void *)0)) {
		if (oldaip->ai_newblkno != aip->ai_oldblkno) {
			FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
			panic("setup_allocindir_phase2: blkno");
		}
		aip->ai_oldblkno = oldaip->ai_oldblkno;
		freefrag = aip->ai_freefrag;
		aip->ai_freefrag = oldaip->ai_freefrag;
		oldaip->ai_freefrag = NULL((void *)0);
		free_allocindir(oldaip, NULL((void *)0));
	}
	LIST_INSERT_HEAD(&indirdep->ir_deplisthd, aip, ai_next)do { if (((aip)->ai_next.le_next = (&indirdep->ir_deplisthd
)->lh_first) != ((void *)0)) (&indirdep->ir_deplisthd
)->lh_first->ai_next.le_prev = &(aip)->ai_next.le_next
; (&indirdep->ir_deplisthd)->lh_first = (aip); (aip
)->ai_next.le_prev = &(&indirdep->ir_deplisthd)
->lh_first; } while (0);
	if (ip->i_ump->um_fstype == UM_UFS11)
		((int32_t *)indirdep->ir_savebp->b_data)
		    [aip->ai_offset] = aip->ai_oldblkno;
	else
		((int64_t *)indirdep->ir_savebp->b_data)
		    [aip->ai_offset] = aip->ai_oldblkno;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (freefrag != NULL((void *)0))
		handle_workitem_freefrag(freefrag);
}
if (newindirdep) {
	if (indirdep->ir_savebp != NULL((void *)0))
		brelse(newindirdep->ir_savebp);
	WORKITEM_FREE(newindirdep, D_INDIRDEP)softdep_freequeue_add((struct worklist *)newindirdep);
}
if (indirdep)
	break;
newindirdep = pool_get(&indirdep_pool, PR_WAITOK0x0001);
newindirdep->ir_list.wk_type = D_INDIRDEP5;
newindirdep->ir_stateir_list.wk_state = ATTACHED0x0001;
if (ip->i_ump->um_fstype == UM_UFS11)
	newindirdep->ir_stateir_list.wk_state |= UFS1FMT0x2000;
LIST_INIT(&newindirdep->ir_deplisthd)do { ((&newindirdep->ir_deplisthd)->lh_first) = ((void
 *)0); } while (0);
LIST_INIT(&newindirdep->ir_donehd)do { ((&newindirdep->ir_donehd)->lh_first) = ((void
 *)0); } while (0);
if (bp->b_blkno == bp->b_lblkno) {
	VOP_BMAP(bp->b_vp, bp->b_lblkno, NULL((void *)0), &bp->b_blkno,
		NULL((void *)0));
}
newindirdep->ir_savebp =
    getblk(ip->i_devvpi_ump->um_devvp, bp->b_blkno, bp->b_bcount, 0, INFSLP0xffffffffffffffffULL);
1854#if 0
BUF_KERNPROC(newindirdep->ir_savebp);
1856#endif
memcpy(newindirdep->ir_savebp->b_data, bp->b_data, bp->b_bcount)__builtin_memcpy((newindirdep->ir_savebp->b_data), (bp->
b_data), (bp->b_bcount));
}
1859}

1861/*
* Block de-allocation dependencies.
* 
* When blocks are de-allocated, the on-disk pointers must be nullified before
* the blocks are made available for use by other files.  (The true
* requirement is that old pointers must be nullified before new on-disk
* pointers are set.  We chose this slightly more stringent requirement to
* reduce complexity.) Our implementation handles this dependency by updating
* the inode (or indirect block) appropriately but delaying the actual block
* de-allocation (i.e., freemap and free space count manipulation) until
* after the updated versions reach stable storage.  After the disk is
* updated, the blocks can be safely de-allocated whenever it is convenient.
* This implementation handles only the common case of reducing a file's
* length to zero. Other cases are handled by the conventional synchronous
* write approach.
*
* The ffs implementation with which we worked double-checks
* the state of the block pointers and file size as it reduces
* a file's length.  Some of this code is replicated here in our
* soft updates implementation.  The freeblks->fb_chkcnt field is
* used to transfer a part of this information to the procedure
* that eventually de-allocates the blocks.
*
* This routine should be called from the routine that shortens
* a file's length, before the inode's size or block pointers
* are modified. It will save the block pointer information for
* later release and zero the inode so that the calling routine
* can release it.
*/
1890/* The inode whose length is to be reduced */
1891/* The new length for the file */
1892void
1893softdep_setup_freeblocks(struct inode *ip, off_t length)
1894{
struct freeblks *freeblks;
struct inodedep *inodedep;
struct allocdirect *adp;
struct vnode *vp;
struct buf *bp;
struct fs *fs;
int i, delay, error;

fs = ip->i_fsinode_u.fs;
if (length != 0)
panic("softdep_setup_freeblocks: non-zero length");
freeblks = pool_get(&freeblks_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
freeblks->fb_list.wk_type = D_FREEBLKS8;
freeblks->fb_statefb_list.wk_state = ATTACHED0x0001;
freeblks->fb_uid = DIP(ip, uid)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_uid : (ip)->dinode_u.ffs2_din->di_uid);
freeblks->fb_previousinum = ip->i_number;
freeblks->fb_devvp = ip->i_devvpi_ump->um_devvp;
freeblks->fb_mnt = ITOV(ip)((ip)->i_vnode)->v_mount;
freeblks->fb_oldsize = DIP(ip, size)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_size : (ip)->dinode_u.ffs2_din->di_size);
freeblks->fb_newsize = length;
freeblks->fb_chkcnt = DIP(ip, blocks)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_blocks : (ip)->dinode_u.ffs2_din->di_blocks);

for (i = 0; i < NDADDR12; i++) {
freeblks->fb_dblks[i] = DIP(ip, db[i])(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_db[i] : (ip)->dinode_u.ffs2_din->di_db[i]);
DIP_ASSIGN(ip, db[i], 0)do { if ((ip)->i_ump->um_fstype == 1) (ip)->dinode_u
.ffs1_din->di_db[i] = (0); else (ip)->dinode_u.ffs2_din
->di_db[i] = (0); } while (0);
}

for (i = 0; i < NIADDR3; i++) {
freeblks->fb_iblks[i] = DIP(ip, ib[i])(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_ib[i] : (ip)->dinode_u.ffs2_din->di_ib[i]);
DIP_ASSIGN(ip, ib[i], 0)do { if ((ip)->i_ump->um_fstype == 1) (ip)->dinode_u
.ffs1_din->di_ib[i] = (0); else (ip)->dinode_u.ffs2_din
->di_ib[i] = (0); } while (0);
}

DIP_ASSIGN(ip, blocks, 0)do { if ((ip)->i_ump->um_fstype == 1) (ip)->dinode_u
.ffs1_din->di_blocks = (0); else (ip)->dinode_u.ffs2_din
->di_blocks = (0); } while (0);
DIP_ASSIGN(ip, size, 0)do { if ((ip)->i_ump->um_fstype == 1) (ip)->dinode_u
.ffs1_din->di_size = (0); else (ip)->dinode_u.ffs2_din->
di_size = (0); } while (0);

/*
* Push the zero'ed inode to its disk buffer so that we are free
* to delete its dependencies below. Once the dependencies are gone
* the buffer can be safely released.
*/
if ((error = bread(ip->i_devvpi_ump->um_devvp,
   fsbtodb(fs, ino_to_fsba(fs, ip->i_number))((((daddr_t)(((((daddr_t)(fs)->fs_fpg * (((ip->i_number
) / (fs)->fs_ipg))) + (fs)->fs_cgoffset * ((((ip->i_number
) / (fs)->fs_ipg)) & ~((fs)->fs_cgmask))) + (fs)->
fs_iblkno) + ((((((ip->i_number) % (fs)->fs_ipg) / ((fs
)->fs_inopb))) << ((fs))->fs_fragshift))))) <<
 (fs)->fs_fsbtodb),
   (int)fs->fs_bsize, &bp)) != 0)
softdep_error("softdep_setup_freeblocks", error);

if (ip->i_ump->um_fstype == UM_UFS11)
*((struct ufs1_dinode *) bp->b_data +
    ino_to_fsbo(fs, ip->i_number)((ip->i_number) % ((fs)->fs_inopb))) = *ip->i_din1dinode_u.ffs1_din;
else
*((struct ufs2_dinode *) bp->b_data +
    ino_to_fsbo(fs, ip->i_number)((ip->i_number) % ((fs)->fs_inopb))) = *ip->i_din2dinode_u.ffs2_din;

/*
* Find and eliminate any inode dependencies.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
(void) inodedep_lookup(fs, ip->i_number, DEPALLOC0x0001, &inodedep);
if ((inodedep->id_stateid_list.wk_state & IOSTARTED0x0200) != 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("softdep_setup_freeblocks: inode busy");
}
/*
* Add the freeblks structure to the list of operations that
* must await the zero'ed inode being written to disk. If we
* still have a bitmap dependency (delay == 0), then the inode
* has never been written to disk, so we can process the
* freeblks below once we have deleted the dependencies.
*/
delay = (inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008);
if (delay)
WORKLIST_INSERT(&inodedep->id_bufwait, &freeblks->fb_list)do { (&freeblks->fb_list)->wk_state |= 0x8000; do {
 if (((&freeblks->fb_list)->wk_list.le_next = (&
inodedep->id_bufwait)->lh_first) != ((void *)0)) (&
inodedep->id_bufwait)->lh_first->wk_list.le_prev = &
(&freeblks->fb_list)->wk_list.le_next; (&inodedep
->id_bufwait)->lh_first = (&freeblks->fb_list); (
&freeblks->fb_list)->wk_list.le_prev = &(&inodedep
->id_bufwait)->lh_first; } while (0); } while (0);
/*
* Because the file length has been truncated to zero, any
* pending block allocation dependency structures associated
* with this inode are obsolete and can simply be de-allocated.
* We must first merge the two dependency lists to get rid of
* any duplicate freefrag structures, then purge the merged list.
* If we still have a bitmap dependency, then the inode has never
* been written to disk, so we can free any fragments without delay.
*/
merge_inode_lists(inodedep);
while ((adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first)) != NULL((void *)0))
free_allocdirect(&inodedep->id_inoupdt, adp, delay);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
bdwrite(bp);
/*
* We must wait for any I/O in progress to finish so that
* all potential buffers on the dirty list will be visible.
* Once they are all there, walk the list and get rid of
* any dependencies.
*/
vp = ITOV(ip)((ip)->i_vnode);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
drain_output(vp, 1);
while ((bp = LIST_FIRST(&vp->v_dirtyblkhd)((&vp->v_dirtyblkhd)->lh_first))) {
if (getdirtybuf(bp, MNT_WAIT1) <= 0)
	break;
(void) inodedep_lookup(fs, ip->i_number, 0, &inodedep);
deallocate_dependencies(bp, inodedep);
bp->b_flags |= B_INVAL0x00000800 | B_NOCACHE0x00001000;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
brelse(bp);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
}
if (inodedep_lookup(fs, ip->i_number, 0, &inodedep) != 0)
(void) free_inodedep(inodedep);

if (delay) {
freeblks->fb_statefb_list.wk_state |= DEPCOMPLETE0x0008;
/*
 * If the inode with zeroed block pointers is now on disk we
 * can start freeing blocks. Add freeblks to the worklist
 * instead of calling handle_workitem_freeblocks() directly as
 * it is more likely that additional IO is needed to complete
 * the request than in the !delay case.
 */
if ((freeblks->fb_statefb_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
	add_to_worklist(&freeblks->fb_list);
}

FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
/*
* If the inode has never been written to disk (delay == 0),
* then we can process the freeblks now that we have deleted
* the dependencies.
*/
if (!delay)
handle_workitem_freeblocks(freeblks);
2023}

2025/*
* Reclaim any dependency structures from a buffer that is about to
* be reallocated to a new vnode. The buffer must be locked, thus,
* no I/O completion operations can occur while we are manipulating
* its associated dependencies. The mutex is held so that other I/O's
* associated with related dependencies do not occur.
*/
2032STATIC void
2033deallocate_dependencies(struct buf *bp, struct inodedep *inodedep)
2034{
struct worklist *wk;
struct indirdep *indirdep;
struct allocindir *aip;
struct pagedep *pagedep;
struct dirrem *dirrem;
struct diradd *dap;
int i;

while ((wk = LIST_FIRST(&bp->b_dep)((&bp->b_dep)->lh_first)) != NULL((void *)0)) {
switch (wk->wk_type) {

case D_INDIRDEP5:
	indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk));
	/*
	 * None of the indirect pointers will ever be visible,
	 * so they can simply be tossed. GOINGAWAY ensures
	 * that allocated pointers will be saved in the buffer
	 * cache until they are freed. Note that they will
	 * only be able to be found by their physical address
	 * since the inode mapping the logical address will
	 * be gone. The save buffer used for the safe copy
	 * was allocated in setup_allocindir_phase2 using
	 * the physical address so it could be used for this
	 * purpose. Hence we swap the safe copy with the real
	 * copy, allowing the safe copy to be freed and holding
	 * on to the real copy for later use in indir_trunc.
	 */
	if (indirdep->ir_stateir_list.wk_state & GOINGAWAY0x0100) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("deallocate_dependencies: already gone");
	}
	indirdep->ir_stateir_list.wk_state |= GOINGAWAY0x0100;
	while ((aip = LIST_FIRST(&indirdep->ir_deplisthd)((&indirdep->ir_deplisthd)->lh_first)))
		free_allocindir(aip, inodedep);
	if (bp->b_lblkno >= 0 ||
	    bp->b_blkno != indirdep->ir_savebp->b_lblkno) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("deallocate_dependencies: not indir");
	}
	memcpy(indirdep->ir_savebp->b_data, bp->b_data,__builtin_memcpy((indirdep->ir_savebp->b_data), (bp->
b_data), (bp->b_bcount))
	    bp->b_bcount)__builtin_memcpy((indirdep->ir_savebp->b_data), (bp->
b_data), (bp->b_bcount));
	WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
	WORKLIST_INSERT(&indirdep->ir_savebp->b_dep, wk)do { (wk)->wk_state |= 0x8000; do { if (((wk)->wk_list.
le_next = (&indirdep->ir_savebp->b_dep)->lh_first
) != ((void *)0)) (&indirdep->ir_savebp->b_dep)->
lh_first->wk_list.le_prev = &(wk)->wk_list.le_next;
 (&indirdep->ir_savebp->b_dep)->lh_first = (wk);
 (wk)->wk_list.le_prev = &(&indirdep->ir_savebp
->b_dep)->lh_first; } while (0); } while (0);
	continue;

case D_PAGEDEP0:
	pagedep = WK_PAGEDEP(wk)((struct pagedep *)(wk));
	/*
	 * None of the directory additions will ever be
	 * visible, so they can simply be tossed.
	 */
	for (i = 0; i < DAHASHSZ6; i++)
		while ((dap =
		    LIST_FIRST(&pagedep->pd_diraddhd[i])((&pagedep->pd_diraddhd[i])->lh_first)))
			free_diradd(dap);
	while ((dap = LIST_FIRST(&pagedep->pd_pendinghd)((&pagedep->pd_pendinghd)->lh_first)))
		free_diradd(dap);
	/*
	 * Copy any directory remove dependencies to the list
	 * to be processed after the zero'ed inode is written.
	 * If the inode has already been written, then they 
	 * can be dumped directly onto the work list.
	 */
	while ((dirrem = LIST_FIRST(&pagedep->pd_dirremhd)((&pagedep->pd_dirremhd)->lh_first))) {
		LIST_REMOVE(dirrem, dm_next)do { if ((dirrem)->dm_next.le_next != ((void *)0)) (dirrem
)->dm_next.le_next->dm_next.le_prev = (dirrem)->dm_next
.le_prev; *(dirrem)->dm_next.le_prev = (dirrem)->dm_next
.le_next; ((dirrem)->dm_next.le_prev) = ((void *)-1); ((dirrem
)->dm_next.le_next) = ((void *)-1); } while (0);
		dirrem->dm_dirinumdm_un.dmu_dirinum = pagedep->pd_ino;
		if (inodedep == NULL((void *)0) ||
		    (inodedep->id_stateid_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) ==
		     ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
			add_to_worklist(&dirrem->dm_list);
		else
			WORKLIST_INSERT(&inodedep->id_bufwait,do { (&dirrem->dm_list)->wk_state |= 0x8000; do { if
 (((&dirrem->dm_list)->wk_list.le_next = (&inodedep
->id_bufwait)->lh_first) != ((void *)0)) (&inodedep
->id_bufwait)->lh_first->wk_list.le_prev = &(&
dirrem->dm_list)->wk_list.le_next; (&inodedep->id_bufwait
)->lh_first = (&dirrem->dm_list); (&dirrem->
dm_list)->wk_list.le_prev = &(&inodedep->id_bufwait
)->lh_first; } while (0); } while (0)
			    &dirrem->dm_list)do { (&dirrem->dm_list)->wk_state |= 0x8000; do { if
 (((&dirrem->dm_list)->wk_list.le_next = (&inodedep
->id_bufwait)->lh_first) != ((void *)0)) (&inodedep
->id_bufwait)->lh_first->wk_list.le_prev = &(&
dirrem->dm_list)->wk_list.le_next; (&inodedep->id_bufwait
)->lh_first = (&dirrem->dm_list); (&dirrem->
dm_list)->wk_list.le_prev = &(&inodedep->id_bufwait
)->lh_first; } while (0); } while (0);
	}
	if ((pagedep->pd_statepd_list.wk_state & NEWBLOCK0x0800) != 0) {
		LIST_FOREACH(wk, &inodedep->id_bufwait, wk_list)for((wk) = ((&inodedep->id_bufwait)->lh_first); (wk
)!= ((void *)0); (wk) = ((wk)->wk_list.le_next))
			if (wk->wk_type == D_NEWDIRBLK13 &&
			    WK_NEWDIRBLK(wk)((struct newdirblk *)(wk))->db_pagedep ==
			    pagedep)
				break;
		if (wk != NULL((void *)0)) {
			WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
			free_newdirblk(WK_NEWDIRBLK(wk)((struct newdirblk *)(wk)));
		} else {
			FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
			panic("deallocate_dependencies: "
			    "lost pagedep");
			}
	}
	WORKLIST_REMOVE(&pagedep->pd_list)do { (&pagedep->pd_list)->wk_state &= ~0x8000; do
 { if ((&pagedep->pd_list)->wk_list.le_next != ((void
 *)0)) (&pagedep->pd_list)->wk_list.le_next->wk_list
.le_prev = (&pagedep->pd_list)->wk_list.le_prev; *(
&pagedep->pd_list)->wk_list.le_prev = (&pagedep
->pd_list)->wk_list.le_next; ((&pagedep->pd_list
)->wk_list.le_prev) = ((void *)-1); ((&pagedep->pd_list
)->wk_list.le_next) = ((void *)-1); } while (0); } while (
0);
	LIST_REMOVE(pagedep, pd_hash)do { if ((pagedep)->pd_hash.le_next != ((void *)0)) (pagedep
)->pd_hash.le_next->pd_hash.le_prev = (pagedep)->pd_hash
.le_prev; *(pagedep)->pd_hash.le_prev = (pagedep)->pd_hash
.le_next; ((pagedep)->pd_hash.le_prev) = ((void *)-1); ((pagedep
)->pd_hash.le_next) = ((void *)-1); } while (0);
	WORKITEM_FREE(pagedep, D_PAGEDEP)softdep_freequeue_add((struct worklist *)pagedep);
	continue;

case D_ALLOCINDIR6:
	free_allocindir(WK_ALLOCINDIR(wk)((struct allocindir *)(wk)), inodedep);
	continue;

case D_ALLOCDIRECT4:
case D_INODEDEP1:
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("deallocate_dependencies: Unexpected type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */

default:
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("deallocate_dependencies: Unknown type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */
}
}
2147}

2149/*
* Free an allocdirect. Generate a new freefrag work request if appropriate.
* This routine must be called with splbio interrupts blocked.
*/
2153STATIC void
2154free_allocdirect(struct allocdirectlst *adphead, struct allocdirect *adp,
  int delay)
2156{
struct newdirblk *newdirblk;
struct worklist *wk;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

2162#ifdef DEBUG
if (lk.lkt_held == -1)
panic("free_allocdirect: lock not held");
2165#endif
if ((adp->ad_statead_list.wk_state & DEPCOMPLETE0x0008) == 0)
LIST_REMOVE(adp, ad_deps)do { if ((adp)->ad_deps.le_next != ((void *)0)) (adp)->
ad_deps.le_next->ad_deps.le_prev = (adp)->ad_deps.le_prev
; *(adp)->ad_deps.le_prev = (adp)->ad_deps.le_next; ((adp
)->ad_deps.le_prev) = ((void *)-1); ((adp)->ad_deps.le_next
) = ((void *)-1); } while (0);
TAILQ_REMOVE(adphead, adp, ad_next)do { if (((adp)->ad_next.tqe_next) != ((void *)0)) (adp)->
ad_next.tqe_next->ad_next.tqe_prev = (adp)->ad_next.tqe_prev
; else (adphead)->tqh_last = (adp)->ad_next.tqe_prev; *
(adp)->ad_next.tqe_prev = (adp)->ad_next.tqe_next; ((adp
)->ad_next.tqe_prev) = ((void *)-1); ((adp)->ad_next.tqe_next
) = ((void *)-1); } while (0);
if ((adp->ad_statead_list.wk_state & COMPLETE0x0004) == 0)
WORKLIST_REMOVE(&adp->ad_list)do { (&adp->ad_list)->wk_state &= ~0x8000; do {
 if ((&adp->ad_list)->wk_list.le_next != ((void *)0
)) (&adp->ad_list)->wk_list.le_next->wk_list.le_prev
 = (&adp->ad_list)->wk_list.le_prev; *(&adp->
ad_list)->wk_list.le_prev = (&adp->ad_list)->wk_list
.le_next; ((&adp->ad_list)->wk_list.le_prev) = ((void
 *)-1); ((&adp->ad_list)->wk_list.le_next) = ((void
 *)-1); } while (0); } while (0);
if (adp->ad_freefrag != NULL((void *)0)) {
if (delay)
	WORKLIST_INSERT(&adp->ad_inodedep->id_bufwait,do { (&adp->ad_freefrag->ff_list)->wk_state |= 0x8000
; do { if (((&adp->ad_freefrag->ff_list)->wk_list
.le_next = (&adp->ad_inodedep->id_bufwait)->lh_first
) != ((void *)0)) (&adp->ad_inodedep->id_bufwait)->
lh_first->wk_list.le_prev = &(&adp->ad_freefrag
->ff_list)->wk_list.le_next; (&adp->ad_inodedep->
id_bufwait)->lh_first = (&adp->ad_freefrag->ff_list
); (&adp->ad_freefrag->ff_list)->wk_list.le_prev
 = &(&adp->ad_inodedep->id_bufwait)->lh_first
; } while (0); } while (0)
	    &adp->ad_freefrag->ff_list)do { (&adp->ad_freefrag->ff_list)->wk_state |= 0x8000
; do { if (((&adp->ad_freefrag->ff_list)->wk_list
.le_next = (&adp->ad_inodedep->id_bufwait)->lh_first
) != ((void *)0)) (&adp->ad_inodedep->id_bufwait)->
lh_first->wk_list.le_prev = &(&adp->ad_freefrag
->ff_list)->wk_list.le_next; (&adp->ad_inodedep->
id_bufwait)->lh_first = (&adp->ad_freefrag->ff_list
); (&adp->ad_freefrag->ff_list)->wk_list.le_prev
 = &(&adp->ad_inodedep->id_bufwait)->lh_first
; } while (0); } while (0);
else
	add_to_worklist(&adp->ad_freefrag->ff_list);
}
if ((wk = LIST_FIRST(&adp->ad_newdirblk)((&adp->ad_newdirblk)->lh_first)) != NULL((void *)0)) {
newdirblk = WK_NEWDIRBLK(wk)((struct newdirblk *)(wk));
WORKLIST_REMOVE(&newdirblk->db_list)do { (&newdirblk->db_list)->wk_state &= ~0x8000
; do { if ((&newdirblk->db_list)->wk_list.le_next !=
 ((void *)0)) (&newdirblk->db_list)->wk_list.le_next
->wk_list.le_prev = (&newdirblk->db_list)->wk_list
.le_prev; *(&newdirblk->db_list)->wk_list.le_prev =
 (&newdirblk->db_list)->wk_list.le_next; ((&newdirblk
->db_list)->wk_list.le_prev) = ((void *)-1); ((&newdirblk
->db_list)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
if (LIST_FIRST(&adp->ad_newdirblk)((&adp->ad_newdirblk)->lh_first) != NULL((void *)0))
	panic("free_allocdirect: extra newdirblk");
if (delay)
	WORKLIST_INSERT(&adp->ad_inodedep->id_bufwait,do { (&newdirblk->db_list)->wk_state |= 0x8000; do {
 if (((&newdirblk->db_list)->wk_list.le_next = (&
adp->ad_inodedep->id_bufwait)->lh_first) != ((void *
)0)) (&adp->ad_inodedep->id_bufwait)->lh_first->
wk_list.le_prev = &(&newdirblk->db_list)->wk_list
.le_next; (&adp->ad_inodedep->id_bufwait)->lh_first
 = (&newdirblk->db_list); (&newdirblk->db_list)
->wk_list.le_prev = &(&adp->ad_inodedep->id_bufwait
)->lh_first; } while (0); } while (0)
	    &newdirblk->db_list)do { (&newdirblk->db_list)->wk_state |= 0x8000; do {
 if (((&newdirblk->db_list)->wk_list.le_next = (&
adp->ad_inodedep->id_bufwait)->lh_first) != ((void *
)0)) (&adp->ad_inodedep->id_bufwait)->lh_first->
wk_list.le_prev = &(&newdirblk->db_list)->wk_list
.le_next; (&adp->ad_inodedep->id_bufwait)->lh_first
 = (&newdirblk->db_list); (&newdirblk->db_list)
->wk_list.le_prev = &(&adp->ad_inodedep->id_bufwait
)->lh_first; } while (0); } while (0);
else
	free_newdirblk(newdirblk);
}
WORKITEM_FREE(adp, D_ALLOCDIRECT)softdep_freequeue_add((struct worklist *)adp);
2190}

2192/*
* Free a newdirblk. Clear the NEWBLOCK flag on its associated pagedep.
* This routine must be called with splbio interrupts blocked.
*/
2196void
2197free_newdirblk(struct newdirblk *newdirblk)
2198{
struct pagedep *pagedep;
struct diradd *dap;
int i;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

2205#ifdef DEBUG
if (lk.lkt_held == -1)
panic("free_newdirblk: lock not held");
2208#endif
/*
* If the pagedep is still linked onto the directory buffer
* dependency chain, then some of the entries on the
* pd_pendinghd list may not be committed to disk yet. In
* this case, we will simply clear the NEWBLOCK flag and
* let the pd_pendinghd list be processed when the pagedep
* is next written. If the pagedep is no longer on the buffer
* dependency chain, then all the entries on the pd_pending
* list are committed to disk and we can free them here.
*/
pagedep = newdirblk->db_pagedep;
pagedep->pd_statepd_list.wk_state &= ~NEWBLOCK0x0800;
if ((pagedep->pd_statepd_list.wk_state & ONWORKLIST0x8000) == 0)
while ((dap = LIST_FIRST(&pagedep->pd_pendinghd)((&pagedep->pd_pendinghd)->lh_first)) != NULL((void *)0))
	free_diradd(dap);
/*
* If no dependencies remain, the pagedep will be freed.
*/
for (i = 0; i < DAHASHSZ6; i++)
if (LIST_FIRST(&pagedep->pd_diraddhd[i])((&pagedep->pd_diraddhd[i])->lh_first) != NULL((void *)0))
	break;
if (i == DAHASHSZ6 && (pagedep->pd_statepd_list.wk_state & ONWORKLIST0x8000) == 0) {
LIST_REMOVE(pagedep, pd_hash)do { if ((pagedep)->pd_hash.le_next != ((void *)0)) (pagedep
)->pd_hash.le_next->pd_hash.le_prev = (pagedep)->pd_hash
.le_prev; *(pagedep)->pd_hash.le_prev = (pagedep)->pd_hash
.le_next; ((pagedep)->pd_hash.le_prev) = ((void *)-1); ((pagedep
)->pd_hash.le_next) = ((void *)-1); } while (0);
WORKITEM_FREE(pagedep, D_PAGEDEP)softdep_freequeue_add((struct worklist *)pagedep);
}
WORKITEM_FREE(newdirblk, D_NEWDIRBLK)softdep_freequeue_add((struct worklist *)newdirblk);
2235}

2237/*
* Prepare an inode to be freed. The actual free operation is not
* done until the zero'ed inode has been written to disk.
*/
2241void
2242softdep_freefile(struct vnode *pvp, ufsino_t ino, mode_t mode)
2243{
struct inode *ip = VTOI(pvp)((struct inode *)(pvp)->v_data);
struct inodedep *inodedep;
struct freefile *freefile;

/*
* This sets up the inode de-allocation dependency.
*/
freefile = pool_get(&freefile_pool, PR_WAITOK0x0001);
freefile->fx_list.wk_type = D_FREEFILE9;
freefile->fx_list.wk_state = 0;
freefile->fx_mode = mode;
freefile->fx_oldinum = ino;
freefile->fx_devvp = ip->i_devvpi_ump->um_devvp;
freefile->fx_mnt = ITOV(ip)((ip)->i_vnode)->v_mount;

/*
* If the inodedep does not exist, then the zero'ed inode has
* been written to disk. If the allocated inode has never been
* written to disk, then the on-disk inode is zero'ed. In either
* case we can free the file immediately.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(ip->i_fsinode_u.fs, ino, 0, &inodedep) == 0 ||
   check_inode_unwritten(inodedep)) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
handle_workitem_freefile(freefile);
return;
}
WORKLIST_INSERT(&inodedep->id_inowait, &freefile->fx_list)do { (&freefile->fx_list)->wk_state |= 0x8000; do {
 if (((&freefile->fx_list)->wk_list.le_next = (&
inodedep->id_inowait)->lh_first) != ((void *)0)) (&
inodedep->id_inowait)->lh_first->wk_list.le_prev = &
(&freefile->fx_list)->wk_list.le_next; (&inodedep
->id_inowait)->lh_first = (&freefile->fx_list); (
&freefile->fx_list)->wk_list.le_prev = &(&inodedep
->id_inowait)->lh_first; } while (0); } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
2274}

2276/*
* Check to see if an inode has never been written to disk. If
* so free the inodedep and return success, otherwise return failure.
* This routine must be called with splbio interrupts blocked.
*
* If we still have a bitmap dependency, then the inode has never
* been written to disk. Drop the dependency as it is no longer
* necessary since the inode is being deallocated. We set the
* ALLCOMPLETE flags since the bitmap now properly shows that the
* inode is not allocated. Even if the inode is actively being
* written, it has been rolled back to its zero'ed state, so we
* are ensured that a zero inode is what is on the disk. For short
* lived files, this change will usually result in removing all the
* dependencies from the inode so that it can be freed immediately.
*/
2291STATIC int
2292check_inode_unwritten(struct inodedep *inodedep)
2293{
splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) != 0 ||
   LIST_FIRST(&inodedep->id_pendinghd)((&inodedep->id_pendinghd)->lh_first) != NULL((void *)0) ||
   LIST_FIRST(&inodedep->id_bufwait)((&inodedep->id_bufwait)->lh_first) != NULL((void *)0) ||
   LIST_FIRST(&inodedep->id_inowait)((&inodedep->id_inowait)->lh_first) != NULL((void *)0) ||
   TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) != NULL((void *)0) ||
   TAILQ_FIRST(&inodedep->id_newinoupdt)((&inodedep->id_newinoupdt)->tqh_first) != NULL((void *)0) ||
   inodedep->id_nlinkdelta != 0)
return (0);
inodedep->id_stateid_list.wk_state |= ALLCOMPLETE(0x0001 | 0x0004 | 0x0008);
LIST_REMOVE(inodedep, id_deps)do { if ((inodedep)->id_deps.le_next != ((void *)0)) (inodedep
)->id_deps.le_next->id_deps.le_prev = (inodedep)->id_deps
.le_prev; *(inodedep)->id_deps.le_prev = (inodedep)->id_deps
.le_next; ((inodedep)->id_deps.le_prev) = ((void *)-1); ((
inodedep)->id_deps.le_next) = ((void *)-1); } while (0);
inodedep->id_buf = NULL((void *)0);
if (inodedep->id_stateid_list.wk_state & ONWORKLIST0x8000)
WORKLIST_REMOVE(&inodedep->id_list)do { (&inodedep->id_list)->wk_state &= ~0x8000;
 do { if ((&inodedep->id_list)->wk_list.le_next != (
(void *)0)) (&inodedep->id_list)->wk_list.le_next->
wk_list.le_prev = (&inodedep->id_list)->wk_list.le_prev
; *(&inodedep->id_list)->wk_list.le_prev = (&inodedep
->id_list)->wk_list.le_next; ((&inodedep->id_list
)->wk_list.le_prev) = ((void *)-1); ((&inodedep->id_list
)->wk_list.le_next) = ((void *)-1); } while (0); } while (
0);
if (inodedep->id_savedino1id_un.idu_savedino1 != NULL((void *)0)) {
free(inodedep->id_savedino1id_un.idu_savedino1, M_INODEDEP79, inodedep->id_unsize);
inodedep->id_savedino1id_un.idu_savedino1 = NULL((void *)0);
}
if (free_inodedep(inodedep) == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("check_inode_unwritten: busy inode");
}
return (1);
2318}

2320/*
* Try to free an inodedep structure. Return 1 if it could be freed.
*/
2323STATIC int
2324free_inodedep(struct inodedep *inodedep)
2325{

if ((inodedep->id_stateid_list.wk_state & ONWORKLIST0x8000) != 0 ||
   (inodedep->id_stateid_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) != ALLCOMPLETE(0x0001 | 0x0004 | 0x0008) ||
   LIST_FIRST(&inodedep->id_pendinghd)((&inodedep->id_pendinghd)->lh_first) != NULL((void *)0) ||
   LIST_FIRST(&inodedep->id_bufwait)((&inodedep->id_bufwait)->lh_first) != NULL((void *)0) ||
   LIST_FIRST(&inodedep->id_inowait)((&inodedep->id_inowait)->lh_first) != NULL((void *)0) ||
   TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) != NULL((void *)0) ||
   TAILQ_FIRST(&inodedep->id_newinoupdt)((&inodedep->id_newinoupdt)->tqh_first) != NULL((void *)0) ||
   inodedep->id_nlinkdelta != 0 || inodedep->id_savedino1id_un.idu_savedino1 != NULL((void *)0))
return (0);
LIST_REMOVE(inodedep, id_hash)do { if ((inodedep)->id_hash.le_next != ((void *)0)) (inodedep
)->id_hash.le_next->id_hash.le_prev = (inodedep)->id_hash
.le_prev; *(inodedep)->id_hash.le_prev = (inodedep)->id_hash
.le_next; ((inodedep)->id_hash.le_prev) = ((void *)-1); ((
inodedep)->id_hash.le_next) = ((void *)-1); } while (0);
WORKITEM_FREE(inodedep, D_INODEDEP)softdep_freequeue_add((struct worklist *)inodedep);
num_inodedep -= 1;
return (1);
2340}

2342/*
* This workitem routine performs the block de-allocation.
* The workitem is added to the pending list after the updated
* inode block has been written to disk.  As mentioned above,
* checks regarding the number of blocks de-allocated (compared
* to the number of blocks allocated for the file) are also
* performed in this function.
*/
2350STATIC void
2351handle_workitem_freeblocks(struct freeblks *freeblks)
2352{
struct inode tip;
daddr_t bn;
union {
struct ufs1_dinode di1;
struct ufs2_dinode di2;
} di;
struct fs *fs;
int i, level, bsize;
long nblocks, blocksreleased = 0;
int error, allerror = 0;
daddr_t baselbns[NIADDR3], tmpval;

if (VFSTOUFS(freeblks->fb_mnt)((struct ufsmount *)((freeblks->fb_mnt)->mnt_data))->um_fstype == UM_UFS11)
tip.i_din1dinode_u.ffs1_din = &di.di1;
else
tip.i_din2dinode_u.ffs2_din = &di.di2;

tip.i_fsinode_u.fs = fs = VFSTOUFS(freeblks->fb_mnt)((struct ufsmount *)((freeblks->fb_mnt)->mnt_data))->um_fsufsmount_u.fs;
tip.i_number = freeblks->fb_previousinum;
tip.i_ump = VFSTOUFS(freeblks->fb_mnt)((struct ufsmount *)((freeblks->fb_mnt)->mnt_data));
tip.i_dev = freeblks->fb_devvp->v_rdevv_un.vu_specinfo->si_rdev;
DIP_ASSIGN(&tip, size, freeblks->fb_oldsize)do { if ((&tip)->i_ump->um_fstype == 1) (&tip)->
dinode_u.ffs1_din->di_size = (freeblks->fb_oldsize); else
 (&tip)->dinode_u.ffs2_din->di_size = (freeblks->
fb_oldsize); } while (0);
DIP_ASSIGN(&tip, uid, freeblks->fb_uid)do { if ((&tip)->i_ump->um_fstype == 1) (&tip)->
dinode_u.ffs1_din->di_uid = (freeblks->fb_uid); else (&
tip)->dinode_u.ffs2_din->di_uid = (freeblks->fb_uid)
; } while (0);
tip.i_vnode = NULL((void *)0);
tmpval = 1;
baselbns[0] = NDADDR12;
for (i = 1; i < NIADDR3; i++) {
tmpval *= NINDIR(fs)((fs)->fs_nindir);
baselbns[i] = baselbns[i - 1] + tmpval;
}
nblocks = btodb(fs->fs_bsize)((fs->fs_bsize) >> 9);
blocksreleased = 0;
/*
* Indirect blocks first.
*/
for (level = (NIADDR3 - 1); level >= 0; level--) {
if ((bn = freeblks->fb_iblks[level]) == 0)
	continue;
if ((error = indir_trunc(&tip, fsbtodb(fs, bn)((bn) << (fs)->fs_fsbtodb), level,
    baselbns[level], &blocksreleased)) != 0)
	allerror = error;
ffs_blkfree(&tip, bn, fs->fs_bsize);
blocksreleased += nblocks;
}
/*
* All direct blocks or frags.
*/
for (i = (NDADDR12 - 1); i >= 0; i--) {
if ((bn = freeblks->fb_dblks[i]) == 0)
	continue;
bsize = blksize(fs, &tip, i)(((i) >= 12 || ((((&tip))->i_ump->um_fstype == 1
) ? ((&tip))->dinode_u.ffs1_din->di_size : ((&tip
))->dinode_u.ffs2_din->di_size) >= ((i) + 1) <<
 (fs)->fs_bshift) ? (u_int64_t)(fs)->fs_bsize : (((((((
(((&tip))->i_ump->um_fstype == 1) ? ((&tip))->
dinode_u.ffs1_din->di_size : ((&tip))->dinode_u.ffs2_din
->di_size)) & (fs)->fs_qbmask)) + (fs)->fs_qfmask
) & (fs)->fs_fmask)));
ffs_blkfree(&tip, bn, bsize);
blocksreleased += btodb(bsize)((bsize) >> 9);
}

2408#ifdef DIAGNOSTIC1
if (freeblks->fb_chkcnt != blocksreleased)
printf("handle_workitem_freeblocks: block count\n");
if (allerror)
softdep_error("handle_workitem_freeblks", allerror);
2413#endif /* DIAGNOSTIC */
WORKITEM_FREE(freeblks, D_FREEBLKS)softdep_freequeue_add((struct worklist *)freeblks);
2415}

2417/*
* Release blocks associated with the inode ip and stored in the indirect
* block dbn. If level is greater than SINGLE, the block is an indirect block
* and recursive calls to indirtrunc must be used to cleanse other indirect
* blocks.
*/
2423STATIC int
2424indir_trunc(struct inode *ip, daddr_t dbn, int level, daddr_t lbn,
  long *countp)
2426{
struct buf *bp;
int32_t *bap1 = NULL((void *)0);
int64_t nb, *bap2 = NULL((void *)0);
struct fs *fs;
struct worklist *wk;
struct indirdep *indirdep;
int i, lbnadd, nblocks, ufs1fmt;
int error, allerror = 0;

fs = ip->i_fsinode_u.fs;
lbnadd = 1;
for (i = level; i > 0; i--)
lbnadd *= NINDIR(fs)((fs)->fs_nindir);
/*
* Get buffer of block pointers to be freed. This routine is not
* called until the zero'ed inode has been written, so it is safe
* to free blocks as they are encountered. Because the inode has
* been zero'ed, calls to bmap on these blocks will fail. So, we
* have to use the on-disk address and the block device for the
* filesystem to look them up. If the file was deleted before its
* indirect blocks were all written to disk, the routine that set
* us up (deallocate_dependencies) will have arranged to leave
* a complete copy of the indirect block in memory for our use.
* Otherwise we have to read the blocks in from the disk.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if ((bp = incore(ip->i_devvpi_ump->um_devvp, dbn)) != NULL((void *)0) &&
   (wk = LIST_FIRST(&bp->b_dep)((&bp->b_dep)->lh_first)) != NULL((void *)0)) {
if (wk->wk_type != D_INDIRDEP5 ||
    (indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk)))->ir_savebp != bp ||
    (indirdep->ir_stateir_list.wk_state & GOINGAWAY0x0100) == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("indir_trunc: lost indirdep");
}
WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
WORKITEM_FREE(indirdep, D_INDIRDEP)softdep_freequeue_add((struct worklist *)indirdep);
if (LIST_FIRST(&bp->b_dep)((&bp->b_dep)->lh_first) != NULL((void *)0)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("indir_trunc: dangling dep");
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
} else {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
error = bread(ip->i_devvpi_ump->um_devvp, dbn, (int)fs->fs_bsize, &bp);
if (error)
	return (error);
}
/*
* Recursively free indirect blocks.
*/
if (ip->i_ump->um_fstype == UM_UFS11) {
ufs1fmt = 1;
bap1 = (int32_t *)bp->b_data;
} else {
ufs1fmt = 0;
bap2 = (int64_t *)bp->b_data;
}
nblocks = btodb(fs->fs_bsize)((fs->fs_bsize) >> 9);
for (i = NINDIR(fs)((fs)->fs_nindir) - 1; i >= 0; i--) {
if (ufs1fmt)
	nb = bap1[i];
else
	nb = bap2[i];
if (nb == 0)
	continue;
if (level != 0) {
	if ((error = indir_trunc(ip, fsbtodb(fs, nb)((nb) << (fs)->fs_fsbtodb),
	     level - 1, lbn + (i * lbnadd), countp)) != 0)
		allerror = error;
}
ffs_blkfree(ip, nb, fs->fs_bsize);
*countp += nblocks;
}
bp->b_flags |= B_INVAL0x00000800 | B_NOCACHE0x00001000;
brelse(bp);
return (allerror);
2503}

2505/*
* Free an allocindir.
* This routine must be called with splbio interrupts blocked.
*/
2509STATIC void
2510free_allocindir(struct allocindir *aip, struct inodedep *inodedep)
2511{
struct freefrag *freefrag;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

2516#ifdef DEBUG
if (lk.lkt_held == -1)
panic("free_allocindir: lock not held");
2519#endif
if ((aip->ai_stateai_list.wk_state & DEPCOMPLETE0x0008) == 0)
LIST_REMOVE(aip, ai_deps)do { if ((aip)->ai_deps.le_next != ((void *)0)) (aip)->
ai_deps.le_next->ai_deps.le_prev = (aip)->ai_deps.le_prev
; *(aip)->ai_deps.le_prev = (aip)->ai_deps.le_next; ((aip
)->ai_deps.le_prev) = ((void *)-1); ((aip)->ai_deps.le_next
) = ((void *)-1); } while (0);
if (aip->ai_stateai_list.wk_state & ONWORKLIST0x8000)
WORKLIST_REMOVE(&aip->ai_list)do { (&aip->ai_list)->wk_state &= ~0x8000; do {
 if ((&aip->ai_list)->wk_list.le_next != ((void *)0
)) (&aip->ai_list)->wk_list.le_next->wk_list.le_prev
 = (&aip->ai_list)->wk_list.le_prev; *(&aip->
ai_list)->wk_list.le_prev = (&aip->ai_list)->wk_list
.le_next; ((&aip->ai_list)->wk_list.le_prev) = ((void
 *)-1); ((&aip->ai_list)->wk_list.le_next) = ((void
 *)-1); } while (0); } while (0);
LIST_REMOVE(aip, ai_next)do { if ((aip)->ai_next.le_next != ((void *)0)) (aip)->
ai_next.le_next->ai_next.le_prev = (aip)->ai_next.le_prev
; *(aip)->ai_next.le_prev = (aip)->ai_next.le_next; ((aip
)->ai_next.le_prev) = ((void *)-1); ((aip)->ai_next.le_next
) = ((void *)-1); } while (0);
if ((freefrag = aip->ai_freefrag) != NULL((void *)0)) {
if (inodedep == NULL((void *)0))
	add_to_worklist(&freefrag->ff_list);
else
	WORKLIST_INSERT(&inodedep->id_bufwait,do { (&freefrag->ff_list)->wk_state |= 0x8000; do {
 if (((&freefrag->ff_list)->wk_list.le_next = (&
inodedep->id_bufwait)->lh_first) != ((void *)0)) (&
inodedep->id_bufwait)->lh_first->wk_list.le_prev = &
(&freefrag->ff_list)->wk_list.le_next; (&inodedep
->id_bufwait)->lh_first = (&freefrag->ff_list); (
&freefrag->ff_list)->wk_list.le_prev = &(&inodedep
->id_bufwait)->lh_first; } while (0); } while (0)
	    &freefrag->ff_list)do { (&freefrag->ff_list)->wk_state |= 0x8000; do {
 if (((&freefrag->ff_list)->wk_list.le_next = (&
inodedep->id_bufwait)->lh_first) != ((void *)0)) (&
inodedep->id_bufwait)->lh_first->wk_list.le_prev = &
(&freefrag->ff_list)->wk_list.le_next; (&inodedep
->id_bufwait)->lh_first = (&freefrag->ff_list); (
&freefrag->ff_list)->wk_list.le_prev = &(&inodedep
->id_bufwait)->lh_first; } while (0); } while (0);
}
WORKITEM_FREE(aip, D_ALLOCINDIR)softdep_freequeue_add((struct worklist *)aip);
2533}

2535/*
* Directory entry addition dependencies.
* 
* When adding a new directory entry, the inode (with its incremented link
* count) must be written to disk before the directory entry's pointer to it.
* Also, if the inode is newly allocated, the corresponding freemap must be
* updated (on disk) before the directory entry's pointer. These requirements
* are met via undo/redo on the directory entry's pointer, which consists
* simply of the inode number.
* 
* As directory entries are added and deleted, the free space within a
* directory block can become fragmented.  The ufs file system will compact
* a fragmented directory block to make space for a new entry. When this
* occurs, the offsets of previously added entries change. Any "diradd"
* dependency structures corresponding to these entries must be updated with
* the new offsets.
*/

2553/*
* This routine is called after the in-memory inode's link
* count has been incremented, but before the directory entry's
* pointer to the inode has been set.
*/
2558/* buffer containing directory block */
2559/* inode for directory */
2560/* offset of new entry in directory */
2561/* inode referenced by new directory entry */
2562/* non-NULL => contents of new mkdir */
2563/* entry is in a newly allocated block */
2564int 
2565softdep_setup_directory_add(struct buf *bp, struct inode *dp, off_t diroffset,
  long newinum, struct buf *newdirbp, int isnewblk)
2567{
int offset;		/* offset of new entry within directory block */
daddr_t lbn;		/* block in directory containing new entry */
struct fs *fs;
struct diradd *dap;
struct allocdirect *adp;
struct pagedep *pagedep;
struct inodedep *inodedep;
struct newdirblk *newdirblk = NULL((void *)0);
1
'newdirblk' initialized to a null pointer value→
struct mkdir *mkdir1, *mkdir2;


fs = dp->i_fsinode_u.fs;
lbn = lblkno(fs, diroffset)((diroffset) >> (fs)->fs_bshift);
offset = blkoff(fs, diroffset)((diroffset) & (fs)->fs_qbmask);
dap = pool_get(&diradd_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
dap->da_list.wk_type = D_DIRADD10;
dap->da_offset = offset;
dap->da_newinum = newinum;
dap->da_stateda_list.wk_state = ATTACHED0x0001;
if (isnewblk && lbn < NDADDR12 && fragoff(fs, diroffset)((diroffset) & (fs)->fs_qfmask) == 0) {
2
←
Assuming 'isnewblk' is not equal to 0→
3
←
Assuming 'lbn' is < NDADDR→
4
←
Assuming the condition is false→
5
←
Taking false branch→
newdirblk = pool_get(&newdirblk_pool, PR_WAITOK0x0001);
newdirblk->db_list.wk_type = D_NEWDIRBLK13;
newdirblk->db_statedb_list.wk_state = 0;
}
if (newdirbp == NULL((void *)0)) {
6
←
Assuming 'newdirbp' is equal to NULL→
7
←
Taking true branch→
dap->da_stateda_list.wk_state |= DEPCOMPLETE0x0008;
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
} else {
dap->da_stateda_list.wk_state |= MKDIR_BODY0x0020 | MKDIR_PARENT0x0010;
mkdir1 = pool_get(&mkdir_pool, PR_WAITOK0x0001);
mkdir1->md_list.wk_type = D_MKDIR11;
mkdir1->md_statemd_list.wk_state = MKDIR_BODY0x0020;
mkdir1->md_diradd = dap;
mkdir2 = pool_get(&mkdir_pool, PR_WAITOK0x0001);
mkdir2->md_list.wk_type = D_MKDIR11;
mkdir2->md_statemd_list.wk_state = MKDIR_PARENT0x0010;
mkdir2->md_diradd = dap;
/*
 * Dependency on "." and ".." being written to disk.
 */
mkdir1->md_buf = newdirbp;
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
LIST_INSERT_HEAD(&mkdirlisthd, mkdir1, md_mkdirs)do { if (((mkdir1)->md_mkdirs.le_next = (&mkdirlisthd)
->lh_first) != ((void *)0)) (&mkdirlisthd)->lh_first
->md_mkdirs.le_prev = &(mkdir1)->md_mkdirs.le_next;
 (&mkdirlisthd)->lh_first = (mkdir1); (mkdir1)->md_mkdirs
.le_prev = &(&mkdirlisthd)->lh_first; } while (0);
WORKLIST_INSERT(&newdirbp->b_dep, &mkdir1->md_list)do { (&mkdir1->md_list)->wk_state |= 0x8000; do { if
 (((&mkdir1->md_list)->wk_list.le_next = (&newdirbp
->b_dep)->lh_first) != ((void *)0)) (&newdirbp->
b_dep)->lh_first->wk_list.le_prev = &(&mkdir1->
md_list)->wk_list.le_next; (&newdirbp->b_dep)->lh_first
 = (&mkdir1->md_list); (&mkdir1->md_list)->wk_list
.le_prev = &(&newdirbp->b_dep)->lh_first; } while
 (0); } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
bdwrite(newdirbp);
/*
 * Dependency on link count increase for parent directory
 */
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(fs, dp->i_number, 0, &inodedep) == 0
    || (inodedep->id_stateid_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) {
	dap->da_stateda_list.wk_state &= ~MKDIR_PARENT0x0010;
	WORKITEM_FREE(mkdir2, D_MKDIR)softdep_freequeue_add((struct worklist *)mkdir2);
} else {
	LIST_INSERT_HEAD(&mkdirlisthd, mkdir2, md_mkdirs)do { if (((mkdir2)->md_mkdirs.le_next = (&mkdirlisthd)
->lh_first) != ((void *)0)) (&mkdirlisthd)->lh_first
->md_mkdirs.le_prev = &(mkdir2)->md_mkdirs.le_next;
 (&mkdirlisthd)->lh_first = (mkdir2); (mkdir2)->md_mkdirs
.le_prev = &(&mkdirlisthd)->lh_first; } while (0);
	WORKLIST_INSERT(&inodedep->id_bufwait,&mkdir2->md_list)do { (&mkdir2->md_list)->wk_state |= 0x8000; do { if
 (((&mkdir2->md_list)->wk_list.le_next = (&inodedep
->id_bufwait)->lh_first) != ((void *)0)) (&inodedep
->id_bufwait)->lh_first->wk_list.le_prev = &(&
mkdir2->md_list)->wk_list.le_next; (&inodedep->id_bufwait
)->lh_first = (&mkdir2->md_list); (&mkdir2->
md_list)->wk_list.le_prev = &(&inodedep->id_bufwait
)->lh_first; } while (0); } while (0);
}
}
/*
* Link into parent directory pagedep to await its being written.
*/
if (pagedep_lookup(dp, lbn, DEPALLOC0x0001, &pagedep) == 0)
8
←
Assuming the condition is false→
9
←
Taking false branch→
WORKLIST_INSERT(&bp->b_dep, &pagedep->pd_list)do { (&pagedep->pd_list)->wk_state |= 0x8000; do { if
 (((&pagedep->pd_list)->wk_list.le_next = (&bp->
b_dep)->lh_first) != ((void *)0)) (&bp->b_dep)->
lh_first->wk_list.le_prev = &(&pagedep->pd_list
)->wk_list.le_next; (&bp->b_dep)->lh_first = (&
pagedep->pd_list); (&pagedep->pd_list)->wk_list.
le_prev = &(&bp->b_dep)->lh_first; } while (0);
 } while (0);
dap->da_pagedepda_un.dau_pagedep = pagedep;
LIST_INSERT_HEAD(&pagedep->pd_diraddhd[DIRADDHASH(offset)], dap,do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_diraddhd
[(((offset) >> 2) % 6)])->lh_first) != ((void *)0)) (
&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->
lh_first->da_pdlist.le_prev = &(dap)->da_pdlist.le_next
; (&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])
->lh_first = (dap); (dap)->da_pdlist.le_prev = &(&
pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->lh_first
; } while (0)
10
←
Assuming the condition is false→
11
←
Taking false branch→
12
←
Loop condition is false.  Exiting loop→
   da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_diraddhd
[(((offset) >> 2) % 6)])->lh_first) != ((void *)0)) (
&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->
lh_first->da_pdlist.le_prev = &(dap)->da_pdlist.le_next
; (&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])
->lh_first = (dap); (dap)->da_pdlist.le_prev = &(&
pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->lh_first
; } while (0);
/*
* Link into its inodedep. Put it on the id_bufwait list if the inode
* is not yet written. If it is written, do the post-inode write
* processing to put it on the id_pendinghd list.
*/
(void) inodedep_lookup(fs, newinum, DEPALLOC0x0001, &inodedep);
if ((inodedep->id_stateid_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
13
←
Assuming the condition is true→
14
←
Taking true branch→
diradd_inode_written(dap, inodedep);
else
WORKLIST_INSERT(&inodedep->id_bufwait, &dap->da_list)do { (&dap->da_list)->wk_state |= 0x8000; do { if (
((&dap->da_list)->wk_list.le_next = (&inodedep->
id_bufwait)->lh_first) != ((void *)0)) (&inodedep->
id_bufwait)->lh_first->wk_list.le_prev = &(&dap
->da_list)->wk_list.le_next; (&inodedep->id_bufwait
)->lh_first = (&dap->da_list); (&dap->da_list
)->wk_list.le_prev = &(&inodedep->id_bufwait)->
lh_first; } while (0); } while (0);
if (isnewblk14.1
'isnewblk' is not equal to 0
) {
15
←
Taking true branch→
/*
 * Directories growing into indirect blocks are rare
 * enough and the frequency of new block allocation
 * in those cases even more rare, that we choose not
 * to bother tracking them. Rather we simply force the
 * new directory entry to disk.
 */
if (lbn15.1
'lbn' is < NDADDR
 >= NDADDR12) {
16
←
Taking false branch→
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	/*
	 * We only have a new allocation when at the
	 * beginning of a new block, not when we are
	 * expanding into an existing block.
	 */
	if (blkoff(fs, diroffset)((diroffset) & (fs)->fs_qbmask) == 0)
		return (1);
	return (0);
}
/*
 * We only have a new allocation when at the beginning
 * of a new fragment, not when we are expanding into an
 * existing fragment. Also, there is nothing to do if we
 * are already tracking this block.
 */
if (fragoff(fs, diroffset)((diroffset) & (fs)->fs_qfmask) != 0) {
17
←
Assuming the condition is false→
18
←
Taking false branch→
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	return (0);
}
	
if ((pagedep->pd_statepd_list.wk_state & NEWBLOCK0x0800) != 0) {
19
←
Assuming the condition is false→
20
←
Taking false branch→
	WORKITEM_FREE(newdirblk, D_NEWDIRBLK)softdep_freequeue_add((struct worklist *)newdirblk);
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	return (0);
}
/*
 * Find our associated allocdirect and have it track us.
 */
if (inodedep_lookup(fs, dp->i_number, 0, &inodedep) == 0)
21
←
Assuming the condition is false→
22
←
Taking false branch→
	panic("softdep_setup_directory_add: lost inodedep");
adp = TAILQ_LAST(&inodedep->id_newinoupdt, allocdirectlst)(*(((struct allocdirectlst *)((&inodedep->id_newinoupdt
)->tqh_last))->tqh_last));
if (adp == NULL((void *)0) || adp->ad_lbn != lbn) {
23
←
Assuming 'adp' is not equal to NULL→
24
←
Assuming 'lbn' is equal to field 'ad_lbn'→
25
←
Taking false branch→
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_setup_directory_add: lost entry");
}
pagedep->pd_statepd_list.wk_state |= NEWBLOCK0x0800;
newdirblk->db_pagedep = pagedep;
26
←
Access to field 'db_pagedep' results in a dereference of a null pointer (loaded from variable 'newdirblk')
WORKLIST_INSERT(&adp->ad_newdirblk, &newdirblk->db_list)do { (&newdirblk->db_list)->wk_state |= 0x8000; do {
 if (((&newdirblk->db_list)->wk_list.le_next = (&
adp->ad_newdirblk)->lh_first) != ((void *)0)) (&adp
->ad_newdirblk)->lh_first->wk_list.le_prev = &(&
newdirblk->db_list)->wk_list.le_next; (&adp->ad_newdirblk
)->lh_first = (&newdirblk->db_list); (&newdirblk
->db_list)->wk_list.le_prev = &(&adp->ad_newdirblk
)->lh_first; } while (0); } while (0);
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (0);
2696}

2698/*
* This procedure is called to change the offset of a directory
* entry when compacting a directory block which must be owned
* exclusively by the caller. Note that the actual entry movement
* must be done in this procedure to ensure that no I/O completions
* occur while the move is in progress.
*/
2705/* inode for directory */
2706/* address of dp->i_offset */
2707/* address of old directory location */
2708/* address of new directory location */
2709/* size of directory entry */
2710void 
2711softdep_change_directoryentry_offset(struct inode *dp, caddr_t base,
  caddr_t oldloc, caddr_t newloc, int entrysize)
2713{
int offset, oldoffset, newoffset;
struct pagedep *pagedep;
struct diradd *dap;
daddr_t lbn;

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
lbn = lblkno(dp->i_fs, dp->i_offset)((dp->i_offset) >> (dp->inode_u.fs)->fs_bshift
);
offset = blkoff(dp->i_fs, dp->i_offset)((dp->i_offset) & (dp->inode_u.fs)->fs_qbmask);
if (pagedep_lookup(dp, lbn, 0, &pagedep) == 0)
goto done;
oldoffset = offset + (oldloc - base);
newoffset = offset + (newloc - base);

LIST_FOREACH(dap, &pagedep->pd_diraddhd[DIRADDHASH(oldoffset)], da_pdlist)for((dap) = ((&pagedep->pd_diraddhd[(((oldoffset) >>
 2) % 6)])->lh_first); (dap)!= ((void *)0); (dap) = ((dap)
->da_pdlist.le_next)) {
if (dap->da_offset != oldoffset)
	continue;
dap->da_offset = newoffset;
if (DIRADDHASH(newoffset)(((newoffset) >> 2) % 6) == DIRADDHASH(oldoffset)(((oldoffset) >> 2) % 6))
	break;
LIST_REMOVE(dap, da_pdlist)do { if ((dap)->da_pdlist.le_next != ((void *)0)) (dap)->
da_pdlist.le_next->da_pdlist.le_prev = (dap)->da_pdlist
.le_prev; *(dap)->da_pdlist.le_prev = (dap)->da_pdlist.
le_next; ((dap)->da_pdlist.le_prev) = ((void *)-1); ((dap)
->da_pdlist.le_next) = ((void *)-1); } while (0);
LIST_INSERT_HEAD(&pagedep->pd_diraddhd[DIRADDHASH(newoffset)],do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_diraddhd
[(((newoffset) >> 2) % 6)])->lh_first) != ((void *)0
)) (&pagedep->pd_diraddhd[(((newoffset) >> 2) % 6
)])->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_diraddhd[(((newoffset) >>
 2) % 6)])->lh_first = (dap); (dap)->da_pdlist.le_prev =
 &(&pagedep->pd_diraddhd[(((newoffset) >> 2)
 % 6)])->lh_first; } while (0)
    dap, da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_diraddhd
[(((newoffset) >> 2) % 6)])->lh_first) != ((void *)0
)) (&pagedep->pd_diraddhd[(((newoffset) >> 2) % 6
)])->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_diraddhd[(((newoffset) >>
 2) % 6)])->lh_first = (dap); (dap)->da_pdlist.le_prev =
 &(&pagedep->pd_diraddhd[(((newoffset) >> 2)
 % 6)])->lh_first; } while (0);
break;
}
if (dap == NULL((void *)0)) {

LIST_FOREACH(dap, &pagedep->pd_pendinghd, da_pdlist)for((dap) = ((&pagedep->pd_pendinghd)->lh_first); (
dap)!= ((void *)0); (dap) = ((dap)->da_pdlist.le_next)) {
	if (dap->da_offset == oldoffset) {
		dap->da_offset = newoffset;
		break;
	}
}
}
2747done:
memmove(newloc, oldloc, entrysize)__builtin_memmove((newloc), (oldloc), (entrysize));
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
2750}

2752/*
* Free a diradd dependency structure. This routine must be called
* with splbio interrupts blocked.
*/
2756STATIC void
2757free_diradd(struct diradd *dap)
2758{
struct dirrem *dirrem;
struct pagedep *pagedep;
struct inodedep *inodedep;
struct mkdir *mkdir, *nextmd;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

2766#ifdef DEBUG
if (lk.lkt_held == -1)
panic("free_diradd: lock not held");
2769#endif
WORKLIST_REMOVE(&dap->da_list)do { (&dap->da_list)->wk_state &= ~0x8000; do {
 if ((&dap->da_list)->wk_list.le_next != ((void *)0
)) (&dap->da_list)->wk_list.le_next->wk_list.le_prev
 = (&dap->da_list)->wk_list.le_prev; *(&dap->
da_list)->wk_list.le_prev = (&dap->da_list)->wk_list
.le_next; ((&dap->da_list)->wk_list.le_prev) = ((void
 *)-1); ((&dap->da_list)->wk_list.le_next) = ((void
 *)-1); } while (0); } while (0);
LIST_REMOVE(dap, da_pdlist)do { if ((dap)->da_pdlist.le_next != ((void *)0)) (dap)->
da_pdlist.le_next->da_pdlist.le_prev = (dap)->da_pdlist
.le_prev; *(dap)->da_pdlist.le_prev = (dap)->da_pdlist.
le_next; ((dap)->da_pdlist.le_prev) = ((void *)-1); ((dap)
->da_pdlist.le_next) = ((void *)-1); } while (0);
if ((dap->da_stateda_list.wk_state & DIRCHG0x0080) == 0) {
pagedep = dap->da_pagedepda_un.dau_pagedep;
} else {
dirrem = dap->da_previousda_un.dau_previous;
pagedep = dirrem->dm_pagedepdm_un.dmu_pagedep;
dirrem->dm_dirinumdm_un.dmu_dirinum = pagedep->pd_ino;
add_to_worklist(&dirrem->dm_list);
}
if (inodedep_lookup(VFSTOUFS(pagedep->pd_mnt)((struct ufsmount *)((pagedep->pd_mnt)->mnt_data))->um_fsufsmount_u.fs, dap->da_newinum,
   0, &inodedep) != 0)
(void) free_inodedep(inodedep);
if ((dap->da_stateda_list.wk_state & (MKDIR_PARENT0x0010 | MKDIR_BODY0x0020)) != 0) {
for (mkdir = LIST_FIRST(&mkdirlisthd)((&mkdirlisthd)->lh_first); mkdir; mkdir = nextmd) {
	nextmd = LIST_NEXT(mkdir, md_mkdirs)((mkdir)->md_mkdirs.le_next);
	if (mkdir->md_diradd != dap)
		continue;
	dap->da_stateda_list.wk_state &= ~mkdir->md_statemd_list.wk_state;
	WORKLIST_REMOVE(&mkdir->md_list)do { (&mkdir->md_list)->wk_state &= ~0x8000; do
 { if ((&mkdir->md_list)->wk_list.le_next != ((void
 *)0)) (&mkdir->md_list)->wk_list.le_next->wk_list
.le_prev = (&mkdir->md_list)->wk_list.le_prev; *(&
mkdir->md_list)->wk_list.le_prev = (&mkdir->md_list
)->wk_list.le_next; ((&mkdir->md_list)->wk_list.
le_prev) = ((void *)-1); ((&mkdir->md_list)->wk_list
.le_next) = ((void *)-1); } while (0); } while (0);
	LIST_REMOVE(mkdir, md_mkdirs)do { if ((mkdir)->md_mkdirs.le_next != ((void *)0)) (mkdir
)->md_mkdirs.le_next->md_mkdirs.le_prev = (mkdir)->md_mkdirs
.le_prev; *(mkdir)->md_mkdirs.le_prev = (mkdir)->md_mkdirs
.le_next; ((mkdir)->md_mkdirs.le_prev) = ((void *)-1); ((mkdir
)->md_mkdirs.le_next) = ((void *)-1); } while (0);
	WORKITEM_FREE(mkdir, D_MKDIR)softdep_freequeue_add((struct worklist *)mkdir);
}
if ((dap->da_stateda_list.wk_state & (MKDIR_PARENT0x0010 | MKDIR_BODY0x0020)) != 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("free_diradd: unfound ref");
}
}
WORKITEM_FREE(dap, D_DIRADD)softdep_freequeue_add((struct worklist *)dap);
2799}

2801/*
* Directory entry removal dependencies.
* 
* When removing a directory entry, the entry's inode pointer must be
* zero'ed on disk before the corresponding inode's link count is decremented
* (possibly freeing the inode for re-use). This dependency is handled by
* updating the directory entry but delaying the inode count reduction until
* after the directory block has been written to disk. After this point, the
* inode count can be decremented whenever it is convenient.
*/

2812/*
* This routine should be called immediately after removing
* a directory entry.  The inode's link count should not be
* decremented by the calling procedure -- the soft updates
* code will do this task when it is safe.
*/
2818/* buffer containing directory block */
2819/* inode for the directory being modified */
2820/* inode for directory entry being removed */
2821/* indicates if doing RMDIR */
2822void 
2823softdep_setup_remove(struct buf *bp, struct inode *dp, struct inode *ip,
  int isrmdir)
2825{
struct dirrem *dirrem, *prevdirrem;

/*
* Allocate a new dirrem if appropriate and ACQUIRE_LOCK.
*/
dirrem = newdirrem(bp, dp, ip, isrmdir, &prevdirrem);

/*
* If the COMPLETE flag is clear, then there were no active
* entries and we want to roll back to a zeroed entry until
* the new inode is committed to disk. If the COMPLETE flag is
* set then we have deleted an entry that never made it to
* disk. If the entry we deleted resulted from a name change,
* then the old name still resides on disk. We cannot delete
* its inode (returned to us in prevdirrem) until the zeroed
* directory entry gets to disk. The new inode has never been
* referenced on the disk, so can be deleted immediately.
*/
if ((dirrem->dm_statedm_list.wk_state & COMPLETE0x0004) == 0) {
LIST_INSERT_HEAD(&dirrem->dm_pagedep->pd_dirremhd, dirrem,do { if (((dirrem)->dm_next.le_next = (&dirrem->dm_un
.dmu_pagedep->pd_dirremhd)->lh_first) != ((void *)0)) (
&dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first
->dm_next.le_prev = &(dirrem)->dm_next.le_next; (&
dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first = (
dirrem); (dirrem)->dm_next.le_prev = &(&dirrem->
dm_un.dmu_pagedep->pd_dirremhd)->lh_first; } while (0)
    dm_next)do { if (((dirrem)->dm_next.le_next = (&dirrem->dm_un
.dmu_pagedep->pd_dirremhd)->lh_first) != ((void *)0)) (
&dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first
->dm_next.le_prev = &(dirrem)->dm_next.le_next; (&
dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first = (
dirrem); (dirrem)->dm_next.le_prev = &(&dirrem->
dm_un.dmu_pagedep->pd_dirremhd)->lh_first; } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
} else {
if (prevdirrem != NULL((void *)0))
	LIST_INSERT_HEAD(&dirrem->dm_pagedep->pd_dirremhd,do { if (((prevdirrem)->dm_next.le_next = (&dirrem->
dm_un.dmu_pagedep->pd_dirremhd)->lh_first) != ((void *)
0)) (&dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first
->dm_next.le_prev = &(prevdirrem)->dm_next.le_next;
 (&dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first
 = (prevdirrem); (prevdirrem)->dm_next.le_prev = &(&
dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first; }
 while (0)
	    prevdirrem, dm_next)do { if (((prevdirrem)->dm_next.le_next = (&dirrem->
dm_un.dmu_pagedep->pd_dirremhd)->lh_first) != ((void *)
0)) (&dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first
->dm_next.le_prev = &(prevdirrem)->dm_next.le_next;
 (&dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first
 = (prevdirrem); (prevdirrem)->dm_next.le_prev = &(&
dirrem->dm_un.dmu_pagedep->pd_dirremhd)->lh_first; }
 while (0);
dirrem->dm_dirinumdm_un.dmu_dirinum = dirrem->dm_pagedepdm_un.dmu_pagedep->pd_ino;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
handle_workitem_remove(dirrem);
}
2856}

2858STATIC long num_dirrem;		/* number of dirrem allocated */
2859/*
* Allocate a new dirrem if appropriate and return it along with
* its associated pagedep. Called without a lock, returns with lock.
*/
2863/* buffer containing directory block */
2864/* inode for the directory being modified */
2865/* inode for directory entry being removed */
2866/* indicates if doing RMDIR */
2867/* previously referenced inode, if any */
2868STATIC struct dirrem *
2869newdirrem(struct buf *bp, struct inode *dp, struct inode *ip, int isrmdir,
  struct dirrem **prevdirremp)
2871{
int offset;
daddr_t lbn;
struct diradd *dap;
struct dirrem *dirrem;
struct pagedep *pagedep;

/*
* Whiteouts have no deletion dependencies.
*/
if (ip == NULL((void *)0))
panic("newdirrem: whiteout");
/*
* If we are over our limit, try to improve the situation.
* Limiting the number of dirrem structures will also limit
* the number of freefile and freeblks structures.
*/
if (num_dirrem > max_softdeps / 2)
(void) request_cleanup(FLUSH_REMOVE2, 0);
num_dirrem += 1;
dirrem = pool_get(&dirrem_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
dirrem->dm_list.wk_type = D_DIRREM12;
dirrem->dm_statedm_list.wk_state = isrmdir ? RMDIR0x0040 : 0;
dirrem->dm_mnt = ITOV(ip)((ip)->i_vnode)->v_mount;
dirrem->dm_oldinum = ip->i_number;
*prevdirremp = NULL((void *)0);

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
lbn = lblkno(dp->i_fs, dp->i_offset)((dp->i_offset) >> (dp->inode_u.fs)->fs_bshift
);
offset = blkoff(dp->i_fs, dp->i_offset)((dp->i_offset) & (dp->inode_u.fs)->fs_qbmask);
if (pagedep_lookup(dp, lbn, DEPALLOC0x0001, &pagedep) == 0)
WORKLIST_INSERT(&bp->b_dep, &pagedep->pd_list)do { (&pagedep->pd_list)->wk_state |= 0x8000; do { if
 (((&pagedep->pd_list)->wk_list.le_next = (&bp->
b_dep)->lh_first) != ((void *)0)) (&bp->b_dep)->
lh_first->wk_list.le_prev = &(&pagedep->pd_list
)->wk_list.le_next; (&bp->b_dep)->lh_first = (&
pagedep->pd_list); (&pagedep->pd_list)->wk_list.
le_prev = &(&bp->b_dep)->lh_first; } while (0);
 } while (0);
dirrem->dm_pagedepdm_un.dmu_pagedep = pagedep;
/*
* Check for a diradd dependency for the same directory entry.
* If present, then both dependencies become obsolete and can
* be de-allocated. Check for an entry on both the pd_dirraddhd
* list and the pd_pendinghd list.
*/

LIST_FOREACH(dap, &pagedep->pd_diraddhd[DIRADDHASH(offset)], da_pdlist)for((dap) = ((&pagedep->pd_diraddhd[(((offset) >>
 2) % 6)])->lh_first); (dap)!= ((void *)0); (dap) = ((dap)
->da_pdlist.le_next))
if (dap->da_offset == offset)
	break;
if (dap == NULL((void *)0)) {

LIST_FOREACH(dap, &pagedep->pd_pendinghd, da_pdlist)for((dap) = ((&pagedep->pd_pendinghd)->lh_first); (
dap)!= ((void *)0); (dap) = ((dap)->da_pdlist.le_next))
	if (dap->da_offset == offset)
		break;
if (dap == NULL((void *)0))
	return (dirrem);
}
/*
* Must be ATTACHED at this point.
*/
if ((dap->da_stateda_list.wk_state & ATTACHED0x0001) == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("newdirrem: not ATTACHED");
}
if (dap->da_newinum != ip->i_number) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("newdirrem: inum %u should be %u",
    ip->i_number, dap->da_newinum);
}
/*
* If we are deleting a changed name that never made it to disk,
* then return the dirrem describing the previous inode (which
* represents the inode currently referenced from this entry on disk).
*/
if ((dap->da_stateda_list.wk_state & DIRCHG0x0080) != 0) {
*prevdirremp = dap->da_previousda_un.dau_previous;
dap->da_stateda_list.wk_state &= ~DIRCHG0x0080;
dap->da_pagedepda_un.dau_pagedep = pagedep;
}
/*
* We are deleting an entry that never made it to disk.
* Mark it COMPLETE so we can delete its inode immediately.
*/
dirrem->dm_statedm_list.wk_state |= COMPLETE0x0004;
free_diradd(dap);
return (dirrem);
2951}

2953/*
* Directory entry change dependencies.
* 
* Changing an existing directory entry requires that an add operation
* be completed first followed by a deletion. The semantics for the addition
* are identical to the description of adding a new entry above except
* that the rollback is to the old inode number rather than zero. Once
* the addition dependency is completed, the removal is done as described
* in the removal routine above.
*/

2964/*
* This routine should be called immediately after changing
* a directory entry.  The inode's link count should not be
* decremented by the calling procedure -- the soft updates
* code will perform this task when it is safe.
*/
2970/* buffer containing directory block */
2971/* inode for the directory being modified */
2972/* inode for directory entry being removed */
2973/* new inode number for changed entry */
2974/* indicates if doing RMDIR */
2975void 
2976softdep_setup_directory_change(struct buf *bp, struct inode *dp,
  struct inode *ip, long newinum, int isrmdir)
2978{
int offset;
struct diradd *dap;
struct dirrem *dirrem, *prevdirrem;
struct pagedep *pagedep;
struct inodedep *inodedep;

offset = blkoff(dp->i_fs, dp->i_offset)((dp->i_offset) & (dp->inode_u.fs)->fs_qbmask);
dap = pool_get(&diradd_pool, PR_WAITOK0x0001 | PR_ZERO0x0008);
dap->da_list.wk_type = D_DIRADD10;
dap->da_stateda_list.wk_state = DIRCHG0x0080 | ATTACHED0x0001 | DEPCOMPLETE0x0008;
dap->da_offset = offset;
dap->da_newinum = newinum;

/*
* Allocate a new dirrem and ACQUIRE_LOCK.
*/
dirrem = newdirrem(bp, dp, ip, isrmdir, &prevdirrem);
pagedep = dirrem->dm_pagedepdm_un.dmu_pagedep;
/*
* The possible values for isrmdir:
*	0 - non-directory file rename
*	1 - directory rename within same directory
*   inum - directory rename to new directory of given inode number
* When renaming to a new directory, we are both deleting and
* creating a new directory entry, so the link count on the new
* directory should not change. Thus we do not need the followup
* dirrem which is usually done in handle_workitem_remove. We set
* the DIRCHG flag to tell handle_workitem_remove to skip the 
* followup dirrem.
*/
if (isrmdir > 1)
dirrem->dm_statedm_list.wk_state |= DIRCHG0x0080;

/*
* If the COMPLETE flag is clear, then there were no active
* entries and we want to roll back to the previous inode until
* the new inode is committed to disk. If the COMPLETE flag is
* set, then we have deleted an entry that never made it to disk.
* If the entry we deleted resulted from a name change, then the old
* inode reference still resides on disk. Any rollback that we do
* needs to be to that old inode (returned to us in prevdirrem). If
* the entry we deleted resulted from a create, then there is
* no entry on the disk, so we want to roll back to zero rather
* than the uncommitted inode. In either of the COMPLETE cases we
* want to immediately free the unwritten and unreferenced inode.
*/
if ((dirrem->dm_statedm_list.wk_state & COMPLETE0x0004) == 0) {
dap->da_previousda_un.dau_previous = dirrem;
} else {
if (prevdirrem != NULL((void *)0)) {
	dap->da_previousda_un.dau_previous = prevdirrem;
} else {
	dap->da_stateda_list.wk_state &= ~DIRCHG0x0080;
	dap->da_pagedepda_un.dau_pagedep = pagedep;
}
dirrem->dm_dirinumdm_un.dmu_dirinum = pagedep->pd_ino;
add_to_worklist(&dirrem->dm_list);
}
/*
* Link into its inodedep. Put it on the id_bufwait list if the inode
* is not yet written. If it is written, do the post-inode write
* processing to put it on the id_pendinghd list.
*/
if (inodedep_lookup(dp->i_fsinode_u.fs, newinum, DEPALLOC0x0001, &inodedep) == 0 ||
   (inodedep->id_stateid_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) {
dap->da_stateda_list.wk_state |= COMPLETE0x0004;
LIST_INSERT_HEAD(&pagedep->pd_pendinghd, dap, da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_pendinghd
)->lh_first) != ((void *)0)) (&pagedep->pd_pendinghd
)->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_pendinghd)->lh_first = (dap
); (dap)->da_pdlist.le_prev = &(&pagedep->pd_pendinghd
)->lh_first; } while (0);
WORKLIST_INSERT(&inodedep->id_pendinghd, &dap->da_list)do { (&dap->da_list)->wk_state |= 0x8000; do { if (
((&dap->da_list)->wk_list.le_next = (&inodedep->
id_pendinghd)->lh_first) != ((void *)0)) (&inodedep->
id_pendinghd)->lh_first->wk_list.le_prev = &(&dap
->da_list)->wk_list.le_next; (&inodedep->id_pendinghd
)->lh_first = (&dap->da_list); (&dap->da_list
)->wk_list.le_prev = &(&inodedep->id_pendinghd)
->lh_first; } while (0); } while (0);
} else {
LIST_INSERT_HEAD(&pagedep->pd_diraddhd[DIRADDHASH(offset)],do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_diraddhd
[(((offset) >> 2) % 6)])->lh_first) != ((void *)0)) (
&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->
lh_first->da_pdlist.le_prev = &(dap)->da_pdlist.le_next
; (&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])
->lh_first = (dap); (dap)->da_pdlist.le_prev = &(&
pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->lh_first
; } while (0)
    dap, da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_diraddhd
[(((offset) >> 2) % 6)])->lh_first) != ((void *)0)) (
&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->
lh_first->da_pdlist.le_prev = &(dap)->da_pdlist.le_next
; (&pagedep->pd_diraddhd[(((offset) >> 2) % 6)])
->lh_first = (dap); (dap)->da_pdlist.le_prev = &(&
pagedep->pd_diraddhd[(((offset) >> 2) % 6)])->lh_first
; } while (0);
WORKLIST_INSERT(&inodedep->id_bufwait, &dap->da_list)do { (&dap->da_list)->wk_state |= 0x8000; do { if (
((&dap->da_list)->wk_list.le_next = (&inodedep->
id_bufwait)->lh_first) != ((void *)0)) (&inodedep->
id_bufwait)->lh_first->wk_list.le_prev = &(&dap
->da_list)->wk_list.le_next; (&inodedep->id_bufwait
)->lh_first = (&dap->da_list); (&dap->da_list
)->wk_list.le_prev = &(&inodedep->id_bufwait)->
lh_first; } while (0); } while (0);
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
3053}

3055/*
* Called whenever the link count on an inode is changed.
* It creates an inode dependency so that the new reference(s)
* to the inode cannot be committed to disk until the updated
* inode has been written.
*/
3061/* the inode with the increased link count */
3062/* do background work or not */
3063void
3064softdep_change_linkcnt(struct inode *ip, int nodelay)
3065{
struct inodedep *inodedep;
int flags;

/*
* If requested, do not allow background work to happen.
*/
flags = DEPALLOC0x0001;
if (nodelay)
flags |= NODELAY0x0002;

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);

(void) inodedep_lookup(ip->i_fsinode_u.fs, ip->i_number, flags, &inodedep);
if (DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) < ip->i_effnlink) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("softdep_change_linkcnt: bad delta");
}

inodedep->id_nlinkdelta = DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) - ip->i_effnlink;

FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
3087}

3089/*
* This workitem decrements the inode's link count.
* If the link count reaches zero, the file is removed.
*/
3093STATIC void 
3094handle_workitem_remove(struct dirrem *dirrem)
3095{
struct proc *p = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc;	/* XXX */
struct inodedep *inodedep;
struct vnode *vp;
struct inode *ip;
ufsino_t oldinum;
int error;

if ((error = VFS_VGET(dirrem->dm_mnt, dirrem->dm_oldinum, &vp)(*(dirrem->dm_mnt)->mnt_op->vfs_vget)(dirrem->dm_mnt
, dirrem->dm_oldinum, &vp)) != 0) {
softdep_error("handle_workitem_remove: vget", error);
return;
}
ip = VTOI(vp)((struct inode *)(vp)->v_data);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if ((inodedep_lookup(ip->i_fsinode_u.fs, dirrem->dm_oldinum, 0, &inodedep)) 
   == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("handle_workitem_remove: lost inodedep");
}
/*
* Normal file deletion.
*/
if ((dirrem->dm_statedm_list.wk_state & RMDIR0x0040) == 0) {
DIP_ADD(ip, nlink, -1)do { if ((ip)->i_ump->um_fstype == 1) (ip)->dinode_u
.ffs1_din->di_nlink += (-1); else (ip)->dinode_u.ffs2_din
->di_nlink += (-1); } while (0);
ip->i_flag |= IN_CHANGE0x0002;
if (DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) < ip->i_effnlink) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("handle_workitem_remove: bad file delta");
}
inodedep->id_nlinkdelta = DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) - ip->i_effnlink;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
vput(vp);
num_dirrem -= 1;
WORKITEM_FREE(dirrem, D_DIRREM)softdep_freequeue_add((struct worklist *)dirrem);
return;
}
/*
* Directory deletion. Decrement reference count for both the
* just deleted parent directory entry and the reference for ".".
* Next truncate the directory to length zero. When the
* truncation completes, arrange to have the reference count on
* the parent decremented to account for the loss of "..".
*/
DIP_ADD(ip, nlink, -2)do { if ((ip)->i_ump->um_fstype == 1) (ip)->dinode_u
.ffs1_din->di_nlink += (-2); else (ip)->dinode_u.ffs2_din
->di_nlink += (-2); } while (0);
ip->i_flag |= IN_CHANGE0x0002;
if (DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) < ip->i_effnlink)
panic("handle_workitem_remove: bad dir delta");
inodedep->id_nlinkdelta = DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) - ip->i_effnlink;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
if ((error = UFS_TRUNCATE(ip, (off_t)0, 0, p->p_ucred)((ip)->i_vtbl->iv_truncate)((ip), ((off_t)0), (0), (p->
p_ucred))) != 0)
softdep_error("handle_workitem_remove: truncate", error);
/*
* Rename a directory to a new parent. Since, we are both deleting
* and creating a new directory entry, the link count on the new
* directory should not change. Thus we skip the followup dirrem.
*/
if (dirrem->dm_statedm_list.wk_state & DIRCHG0x0080) {
vput(vp);
num_dirrem -= 1;
WORKITEM_FREE(dirrem, D_DIRREM)softdep_freequeue_add((struct worklist *)dirrem);
return;
}
/*
* If the inodedep does not exist, then the zero'ed inode has
* been written to disk. If the allocated inode has never been
* written to disk, then the on-disk inode is zero'ed. In either
* case we can remove the file immediately.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
dirrem->dm_statedm_list.wk_state = 0;
oldinum = dirrem->dm_oldinum;
dirrem->dm_oldinum = dirrem->dm_dirinumdm_un.dmu_dirinum;
if (inodedep_lookup(ip->i_fsinode_u.fs, oldinum, 0, &inodedep) == 0 ||
   check_inode_unwritten(inodedep)) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
vput(vp);
handle_workitem_remove(dirrem);
return;
}
WORKLIST_INSERT(&inodedep->id_inowait, &dirrem->dm_list)do { (&dirrem->dm_list)->wk_state |= 0x8000; do { if
 (((&dirrem->dm_list)->wk_list.le_next = (&inodedep
->id_inowait)->lh_first) != ((void *)0)) (&inodedep
->id_inowait)->lh_first->wk_list.le_prev = &(&
dirrem->dm_list)->wk_list.le_next; (&inodedep->id_inowait
)->lh_first = (&dirrem->dm_list); (&dirrem->
dm_list)->wk_list.le_prev = &(&inodedep->id_inowait
)->lh_first; } while (0); } while (0);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
ip->i_flag |= IN_CHANGE0x0002;
UFS_UPDATE(VTOI(vp), 0)((((struct inode *)(vp)->v_data))->i_vtbl->iv_update
)((((struct inode *)(vp)->v_data)), (0));
vput(vp);
3179}

3181/*
* Inode de-allocation dependencies.
* 
* When an inode's link count is reduced to zero, it can be de-allocated. We
* found it convenient to postpone de-allocation until after the inode is
* written to disk with its new link count (zero).  At this point, all of the
* on-disk inode's block pointers are nullified and, with careful dependency
* list ordering, all dependencies related to the inode will be satisfied and
* the corresponding dependency structures de-allocated.  So, if/when the
* inode is reused, there will be no mixing of old dependencies with new
* ones.  This artificial dependency is set up by the block de-allocation
* procedure above (softdep_setup_freeblocks) and completed by the
* following procedure.
*/
3195STATIC void 
3196handle_workitem_freefile(struct freefile *freefile)
3197{
struct fs *fs;
struct vnode vp;
struct inode tip;
3201#ifdef DEBUG
struct inodedep *idp;
3203#endif
int error;

fs = VFSTOUFS(freefile->fx_mnt)((struct ufsmount *)((freefile->fx_mnt)->mnt_data))->um_fsufsmount_u.fs;
3207#ifdef DEBUG
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
error = inodedep_lookup(fs, freefile->fx_oldinum, 0, &idp);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
if (error)
panic("handle_workitem_freefile: inodedep survived");
3213#endif
tip.i_ump = VFSTOUFS(freefile->fx_mnt)((struct ufsmount *)((freefile->fx_mnt)->mnt_data));
tip.i_dev = freefile->fx_devvp->v_rdevv_un.vu_specinfo->si_rdev;
tip.i_fsinode_u.fs = fs;
tip.i_vnode = &vp;
vp.v_data = &tip;

if ((error = ffs_freefile(&tip, freefile->fx_oldinum, 
 freefile->fx_mode)) != 0) {
softdep_error("handle_workitem_freefile", error);
}
WORKITEM_FREE(freefile, D_FREEFILE)softdep_freequeue_add((struct worklist *)freefile);
3225}

3227/*
* Disk writes.
* 
* The dependency structures constructed above are most actively used when file
* system blocks are written to disk.  No constraints are placed on when a
* block can be written, but unsatisfied update dependencies are made safe by
* modifying (or replacing) the source memory for the duration of the disk
* write.  When the disk write completes, the memory block is again brought
* up-to-date.
*
* In-core inode structure reclamation.
* 
* Because there are a finite number of "in-core" inode structures, they are
* reused regularly.  By transferring all inode-related dependencies to the
* in-memory inode block and indexing them separately (via "inodedep"s), we
* can allow "in-core" inode structures to be reused at any time and avoid
* any increase in contention.
*
* Called just before entering the device driver to initiate a new disk I/O.
* The buffer must be locked, thus, no I/O completion operations can occur
* while we are manipulating its associated dependencies.
*/
3249/* structure describing disk write to occur */
3250void 
3251softdep_disk_io_initiation(struct buf *bp)
3252{
struct worklist *wk, *nextwk;
struct indirdep *indirdep;
struct inodedep *inodedep;
struct buf *sbp;

/*
* We only care about write operations. There should never
* be dependencies for reads.
*/
if (bp->b_flags & B_READ0x00008000)
panic("softdep_disk_io_initiation: read");

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);

/*
* Do any necessary pre-I/O processing.
*/
for (wk = LIST_FIRST(&bp->b_dep)((&bp->b_dep)->lh_first); wk; wk = nextwk) {
nextwk = LIST_NEXT(wk, wk_list)((wk)->wk_list.le_next);
switch (wk->wk_type) {

case D_PAGEDEP0:
	initiate_write_filepage(WK_PAGEDEP(wk)((struct pagedep *)(wk)), bp);
	continue;

case D_INODEDEP1:
	inodedep = WK_INODEDEP(wk)((struct inodedep *)(wk));
	if (inodedep->id_fs->fs_magic == FS_UFS1_MAGIC0x011954)
		initiate_write_inodeblock_ufs1(inodedep, bp);
3282#ifdef FFS21
	else
		initiate_write_inodeblock_ufs2(inodedep, bp);
3285#endif
	continue;

case D_INDIRDEP5:
	indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk));
	if (indirdep->ir_stateir_list.wk_state & GOINGAWAY0x0100)
		panic("disk_io_initiation: indirdep gone");
	/*
	 * If there are no remaining dependencies, this
	 * will be writing the real pointers, so the
	 * dependency can be freed.
	 */
	if (LIST_FIRST(&indirdep->ir_deplisthd)((&indirdep->ir_deplisthd)->lh_first) == NULL((void *)0)) {
		sbp = indirdep->ir_savebp;
		sbp->b_flags |= B_INVAL0x00000800 | B_NOCACHE0x00001000;
		/* inline expand WORKLIST_REMOVE(wk); */
		wk->wk_state &= ~ONWORKLIST0x8000;
		LIST_REMOVE(wk, wk_list)do { if ((wk)->wk_list.le_next != ((void *)0)) (wk)->wk_list
.le_next->wk_list.le_prev = (wk)->wk_list.le_prev; *(wk
)->wk_list.le_prev = (wk)->wk_list.le_next; ((wk)->wk_list
.le_prev) = ((void *)-1); ((wk)->wk_list.le_next) = ((void
 *)-1); } while (0);
		WORKITEM_FREE(indirdep, D_INDIRDEP)softdep_freequeue_add((struct worklist *)indirdep);
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		brelse(sbp);
		ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
		continue;
	}
	/*
	 * Replace up-to-date version with safe version.
	 */
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	indirdep->ir_saveddata = malloc(bp->b_bcount,
	    M_INDIRDEP83, M_WAITOK0x0001);
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	indirdep->ir_stateir_list.wk_state &= ~ATTACHED0x0001;
	indirdep->ir_stateir_list.wk_state |= UNDONE0x0002;
	memcpy(indirdep->ir_saveddata, bp->b_data, bp->b_bcount)__builtin_memcpy((indirdep->ir_saveddata), (bp->b_data)
, (bp->b_bcount));
	memcpy(bp->b_data, indirdep->ir_savebp->b_data,__builtin_memcpy((bp->b_data), (indirdep->ir_savebp->
b_data), (bp->b_bcount))
	    bp->b_bcount)__builtin_memcpy((bp->b_data), (indirdep->ir_savebp->
b_data), (bp->b_bcount));
	continue;

case D_MKDIR11:
case D_BMSAFEMAP3:
case D_ALLOCDIRECT4:
case D_ALLOCINDIR6:
	continue;

default:
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("handle_disk_io_initiation: Unexpected type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */
}
}

FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
3338}

3340/*
* Called from within the procedure above to deal with unsatisfied
* allocation dependencies in a directory. The buffer must be locked,
* thus, no I/O completion operations can occur while we are
* manipulating its associated dependencies.
*/
3346STATIC void
3347initiate_write_filepage(struct pagedep *pagedep, struct buf *bp)
3348{
struct diradd *dap;
struct direct *ep;
int i;

if (pagedep->pd_statepd_list.wk_state & IOSTARTED0x0200) {
/*
 * This can only happen if there is a driver that does not
 * understand chaining. Here biodone will reissue the call
 * to strategy for the incomplete buffers.
 */
printf("initiate_write_filepage: already started\n");
return;
}
pagedep->pd_statepd_list.wk_state |= IOSTARTED0x0200;
for (i = 0; i < DAHASHSZ6; i++) {
LIST_FOREACH(dap, &pagedep->pd_diraddhd[i], da_pdlist)for((dap) = ((&pagedep->pd_diraddhd[i])->lh_first);
 (dap)!= ((void *)0); (dap) = ((dap)->da_pdlist.le_next)) {
	ep = (struct direct *)
	    ((char *)bp->b_data + dap->da_offset);
	if (ep->d_ino != dap->da_newinum) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("%s: dir inum %u != new %u",
		    "initiate_write_filepage",
		    ep->d_ino, dap->da_newinum);
	}
	if (dap->da_stateda_list.wk_state & DIRCHG0x0080)
		ep->d_ino = dap->da_previousda_un.dau_previous->dm_oldinum;
	else
		ep->d_ino = 0;
	dap->da_stateda_list.wk_state &= ~ATTACHED0x0001;
	dap->da_stateda_list.wk_state |= UNDONE0x0002;
}
}
3381}

3383/*
* Called from within the procedure above to deal with unsatisfied
* allocation dependencies in an inodeblock. The buffer must be
* locked, thus, no I/O completion operations can occur while we
* are manipulating its associated dependencies.
*/
3389/* The inode block */
3390STATIC void 
3391initiate_write_inodeblock_ufs1(struct inodedep *inodedep, struct buf *bp)
3392{
struct allocdirect *adp, *lastadp;
struct ufs1_dinode *dp;
struct fs *fs;
3396#ifdef DIAGNOSTIC1
daddr_t prevlbn = 0;
int32_t d1, d2;
3399#endif
int i, deplist;

if (inodedep->id_stateid_list.wk_state & IOSTARTED0x0200) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("initiate_write_inodeblock: already started");
}
inodedep->id_stateid_list.wk_state |= IOSTARTED0x0200;
fs = inodedep->id_fs;
dp = (struct ufs1_dinode *)bp->b_data +
   ino_to_fsbo(fs, inodedep->id_ino)((inodedep->id_ino) % ((fs)->fs_inopb));
/*
* If the bitmap is not yet written, then the allocated
* inode cannot be written to disk.
*/
if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) == 0) {
if (inodedep->id_savedino1id_un.idu_savedino1 != NULL((void *)0)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("initiate_write_inodeblock: already doing I/O");
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
inodedep->id_savedino1id_un.idu_savedino1 = malloc(sizeof(struct ufs1_dinode),
    M_INODEDEP79, M_WAITOK0x0001);
inodedep->id_unsize = sizeof(struct ufs1_dinode);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
*inodedep->id_savedino1id_un.idu_savedino1 = *dp;
memset(dp, 0, sizeof(struct ufs1_dinode))__builtin_memset((dp), (0), (sizeof(struct ufs1_dinode)));
return;
}
/*
* If no dependencies, then there is nothing to roll back.
*/
inodedep->id_savedsize = dp->di_size;
if (TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) == NULL((void *)0))
return;
/*
* Set the dependencies to busy.
*/
for (deplist = 0, adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first); adp;
    adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next)) {
3439#ifdef DIAGNOSTIC1
if (deplist != 0 && prevlbn >= adp->ad_lbn) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_write_inodeblock: lbn order");
}
prevlbn = adp->ad_lbn;
if (adp->ad_lbn < NDADDR12 &&
    (d1 = dp->di_db[adp->ad_lbn]) != (d2 = adp->ad_newblkno)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("%s: direct pointer #%lld mismatch %d != %d",
	    "softdep_write_inodeblock", (long long)adp->ad_lbn,
	    d1, d2);
}
if (adp->ad_lbn >= NDADDR12 &&
    (d1 = dp->di_ib[adp->ad_lbn - NDADDR12]) !=
    (d2 = adp->ad_newblkno)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("%s: indirect pointer #%lld mismatch %d != %d",
	    "softdep_write_inodeblock", (long long)(adp->ad_lbn -
	    NDADDR12), d1, d2);
}
deplist |= 1 << adp->ad_lbn;
if ((adp->ad_statead_list.wk_state & ATTACHED0x0001) == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_write_inodeblock: Unknown state 0x%x",
	    adp->ad_statead_list.wk_state);
}
3466#endif /* DIAGNOSTIC */
adp->ad_statead_list.wk_state &= ~ATTACHED0x0001;
adp->ad_statead_list.wk_state |= UNDONE0x0002;
}
/*
* The on-disk inode cannot claim to be any larger than the last
* fragment that has been written. Otherwise, the on-disk inode
* might have fragments that were not the last block in the file
* which would corrupt the filesystem.
*/
for (lastadp = NULL((void *)0), adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first); adp;
    lastadp = adp, adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next)) {
if (adp->ad_lbn >= NDADDR12)
	break;
dp->di_db[adp->ad_lbn] = adp->ad_oldblkno;
/* keep going until hitting a rollback to a frag */
if (adp->ad_oldsize == 0 || adp->ad_oldsize == fs->fs_bsize)
	continue;
dp->di_size = fs->fs_bsize * adp->ad_lbn + adp->ad_oldsize;
for (i = adp->ad_lbn + 1; i < NDADDR12; i++) {
3486#ifdef DIAGNOSTIC1
	if (dp->di_db[i] != 0 && (deplist & (1 << i)) == 0) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("softdep_write_inodeblock: lost dep1");
	}
3491#endif /* DIAGNOSTIC */
	dp->di_db[i] = 0;
}
for (i = 0; i < NIADDR3; i++) {
3495#ifdef DIAGNOSTIC1
	if (dp->di_ib[i] != 0 &&
	    (deplist & ((1 << NDADDR12) << i)) == 0) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("softdep_write_inodeblock: lost dep2");
	}
3501#endif /* DIAGNOSTIC */
	dp->di_ib[i] = 0;
}
return;
}
/*
* If we have zero'ed out the last allocated block of the file,
* roll back the size to the last currently allocated block.
* We know that this last allocated block is a full-sized as
* we already checked for fragments in the loop above.
*/
if (lastadp != NULL((void *)0) &&
   dp->di_size <= (lastadp->ad_lbn + 1) * fs->fs_bsize) {
for (i = lastadp->ad_lbn; i >= 0; i--)
	if (dp->di_db[i] != 0)
		break;
dp->di_size = (i + 1) * fs->fs_bsize;
}
/*
* The only dependencies are for indirect blocks.
*
* The file size for indirect block additions is not guaranteed.
* Such a guarantee would be non-trivial to achieve. The conventional
* synchronous write implementation also does not make this guarantee.
* Fsck should catch and fix discrepancies. Arguably, the file size
* can be over-estimated without destroying integrity when the file
* moves into the indirect blocks (i.e., is large). If we want to
* postpone fsck, we are stuck with this argument.
*/
for (; adp; adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next))
dp->di_ib[adp->ad_lbn - NDADDR12] = 0;
3532}

3534#ifdef FFS21
3535/*
* Version of initiate_write_inodeblock that handles FFS2 dinodes.
*/
3538/* The inode block */
3539STATIC void
3540initiate_write_inodeblock_ufs2(struct inodedep *inodedep, struct buf *bp)
3541{
struct allocdirect *adp, *lastadp;
struct ufs2_dinode *dp;
struct fs *fs = inodedep->id_fs;
3545#ifdef DIAGNOSTIC1
daddr_t prevlbn = -1, d1, d2;
3547#endif
int deplist, i;

if (inodedep->id_stateid_list.wk_state & IOSTARTED0x0200)
panic("initiate_write_inodeblock_ufs2: already started");
inodedep->id_stateid_list.wk_state |= IOSTARTED0x0200;
fs = inodedep->id_fs;
dp = (struct ufs2_dinode *)bp->b_data +
   ino_to_fsbo(fs, inodedep->id_ino)((inodedep->id_ino) % ((fs)->fs_inopb));
/*
* If the bitmap is not yet written, then the allocated
* inode cannot be written to disk.
*/
if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) == 0) {
if (inodedep->id_savedino2id_un.idu_savedino2 != NULL((void *)0))
	panic("initiate_write_inodeblock_ufs2: I/O underway");
inodedep->id_savedino2id_un.idu_savedino2 = malloc(sizeof(struct ufs2_dinode),
    M_INODEDEP79, M_WAITOK0x0001);
inodedep->id_unsize = sizeof(struct ufs2_dinode);
*inodedep->id_savedino2id_un.idu_savedino2 = *dp;
memset(dp, 0, sizeof(struct ufs2_dinode))__builtin_memset((dp), (0), (sizeof(struct ufs2_dinode)));
return;
}
/*
* If no dependencies, then there is nothing to roll back.
*/
inodedep->id_savedsize = dp->di_size;
if (TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) == NULL((void *)0))
return;

3577#ifdef notyet
inodedep->id_savedextsize = dp->di_extsize;
if (TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) == NULL((void *)0) &&
   TAILQ_FIRST(&inodedep->id_extupdt)((&inodedep->id_extupdt)->tqh_first) == NULL((void *)0))
return;
/*
* Set the ext data dependencies to busy.
*/
for (deplist = 0, adp = TAILQ_FIRST(&inodedep->id_extupdt)((&inodedep->id_extupdt)->tqh_first); adp;
    adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next)) {
3587#ifdef DIAGNOSTIC1
if (deplist != 0 && prevlbn >= adp->ad_lbn) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_write_inodeblock: lbn order");
}
prevlbn = adp->ad_lbn;
if ((d1 = dp->di_extb[adp->ad_lbn]) !=
    (d2 = adp->ad_newblkno)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("%s: direct pointer #%lld mismatch %lld != %lld",
	    "softdep_write_inodeblock", (long long)adp->ad_lbn,
	    d1, d2);
}
deplist |= 1 << adp->ad_lbn;
if ((adp->ad_statead_list.wk_state & ATTACHED0x0001) == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_write_inodeblock: Unknown state 0x%x",
	    adp->ad_statead_list.wk_state);
}
3606#endif /* DIAGNOSTIC */
adp->ad_statead_list.wk_state &= ~ATTACHED0x0001;
adp->ad_statead_list.wk_state |= UNDONE0x0002;
}
/*
* The on-disk inode cannot claim to be any larger than the last
* fragment that has been written. Otherwise, the on-disk inode
* might have fragments that were not the last block in the ext
* data which would corrupt the filesystem.
*/
for (lastadp = NULL((void *)0), adp = TAILQ_FIRST(&inodedep->id_extupdt)((&inodedep->id_extupdt)->tqh_first); adp;
    lastadp = adp, adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next)) {
dp->di_extb[adp->ad_lbn] = adp->ad_oldblkno;
/* keep going until hitting a rollback to a frag */
if (adp->ad_oldsize == 0 || adp->ad_oldsize == fs->fs_bsize)
	continue;
dp->di_extsize = fs->fs_bsize * adp->ad_lbn + adp->ad_oldsize;
for (i = adp->ad_lbn + 1; i < NXADDR2; i++) {
3624#ifdef DIAGNOSTIC1
	if (dp->di_extb[i] != 0 && (deplist & (1 << i)) == 0) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("softdep_write_inodeblock: lost dep1");
	}
3629#endif /* DIAGNOSTIC */
	dp->di_extb[i] = 0;
}
lastadp = NULL((void *)0);
break;
}
/*
* If we have zero'ed out the last allocated block of the ext
* data, roll back the size to the last currently allocated block.
* We know that this last allocated block is a full-sized as
* we already checked for fragments in the loop above.
*/
if (lastadp != NULL((void *)0) &&
   dp->di_extsize <= (lastadp->ad_lbn + 1) * fs->fs_bsize) {
for (i = lastadp->ad_lbn; i >= 0; i--)
	if (dp->di_extb[i] != 0)
		break;
dp->di_extsize = (i + 1) * fs->fs_bsize;
}
3648#endif /* notyet */

/*
* Set the file data dependencies to busy.
*/
for (deplist = 0, adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first); adp;
    adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next)) {
3655#ifdef DIAGNOSTIC1
if (deplist != 0 && prevlbn >= adp->ad_lbn) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_write_inodeblock: lbn order");
}
prevlbn = adp->ad_lbn;
if (adp->ad_lbn < NDADDR12 &&
    (d1 = dp->di_db[adp->ad_lbn]) != (d2 = adp->ad_newblkno)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("%s: direct pointer #%lld mismatch %lld != %lld",
	    "softdep_write_inodeblock", (long long)adp->ad_lbn,
	    d1, d2);
}
if (adp->ad_lbn >= NDADDR12 &&
    (d1 = dp->di_ib[adp->ad_lbn - NDADDR12]) !=
    (d2 = adp->ad_newblkno)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("%s: indirect pointer #%lld mismatch %lld != %lld",
	    "softdep_write_inodeblock", (long long)(adp->ad_lbn -
	    NDADDR12), d1, d2);
}
deplist |= 1 << adp->ad_lbn;
if ((adp->ad_statead_list.wk_state & ATTACHED0x0001) == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_write_inodeblock: Unknown state 0x%x",
	    adp->ad_statead_list.wk_state);
}
3682#endif /* DIAGNOSTIC */
adp->ad_statead_list.wk_state &= ~ATTACHED0x0001;
adp->ad_statead_list.wk_state |= UNDONE0x0002;
}
/*
* The on-disk inode cannot claim to be any larger than the last
* fragment that has been written. Otherwise, the on-disk inode
* might have fragments that were not the last block in the file
* which would corrupt the filesystem.
*/
for (lastadp = NULL((void *)0), adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first); adp;
    lastadp = adp, adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next)) {
if (adp->ad_lbn >= NDADDR12)
	break;
dp->di_db[adp->ad_lbn] = adp->ad_oldblkno;
/* keep going until hitting a rollback to a frag */
if (adp->ad_oldsize == 0 || adp->ad_oldsize == fs->fs_bsize)
	continue;
dp->di_size = fs->fs_bsize * adp->ad_lbn + adp->ad_oldsize;
for (i = adp->ad_lbn + 1; i < NDADDR12; i++) {
3702#ifdef DIAGNOSTIC1
	if (dp->di_db[i] != 0 && (deplist & (1 << i)) == 0) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("softdep_write_inodeblock: lost dep2");
	}
3707#endif /* DIAGNOSTIC */
	dp->di_db[i] = 0;
}
for (i = 0; i < NIADDR3; i++) {
3711#ifdef DIAGNOSTIC1
	if (dp->di_ib[i] != 0 &&
	    (deplist & ((1 << NDADDR12) << i)) == 0) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("softdep_write_inodeblock: lost dep3");
	}
3717#endif /* DIAGNOSTIC */
	dp->di_ib[i] = 0;
}
return;
}
/*
* If we have zero'ed out the last allocated block of the file,
* roll back the size to the last currently allocated block.
* We know that this last allocated block is a full-sized as
* we already checked for fragments in the loop above.
*/
if (lastadp != NULL((void *)0) &&
   dp->di_size <= (lastadp->ad_lbn + 1) * fs->fs_bsize) {
for (i = lastadp->ad_lbn; i >= 0; i--)
	if (dp->di_db[i] != 0)
		break;
dp->di_size = (i + 1) * fs->fs_bsize;
}
/*
* The only dependencies are for indirect blocks.
*
* The file size for indirect block additions is not guaranteed.
* Such a guarantee would be non-trivial to achieve. The conventional
* synchronous write implementation also does not make this guarantee.
* Fsck should catch and fix discrepancies. Arguably, the file size
* can be over-estimated without destroying integrity when the file
* moves into the indirect blocks (i.e., is large). If we want to
* postpone fsck, we are stuck with this argument.
*/
for (; adp; adp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next))
dp->di_ib[adp->ad_lbn - NDADDR12] = 0;
3748}
3749#endif /* FFS2 */

3751/*
* This routine is called during the completion interrupt
* service routine for a disk write (from the procedure called
* by the device driver to inform the file system caches of
* a request completion).  It should be called early in this
* procedure, before the block is made available to other
* processes or other routines are called.
*/
3759/* describes the completed disk write */
3760void 
3761softdep_disk_write_complete(struct buf *bp)
3762{
struct worklist *wk;
struct workhead reattach;
struct newblk *newblk;
struct allocindir *aip;
struct allocdirect *adp;
struct indirdep *indirdep;
struct inodedep *inodedep;
struct bmsafemap *bmsafemap;

/*
* If an error occurred while doing the write, then the data
* has not hit the disk and the dependencies cannot be unrolled.
*/
if ((bp->b_flags & B_ERROR0x00000400) && !(bp->b_flags & B_INVAL0x00000800))
return;

3779#ifdef DEBUG
if (lk.lkt_held != -1)
panic("softdep_disk_write_complete: lock is held");
lk.lkt_held = -2;
3783#endif
LIST_INIT(&reattach)do { ((&reattach)->lh_first) = ((void *)0); } while (0
);
while ((wk = LIST_FIRST(&bp->b_dep)((&bp->b_dep)->lh_first)) != NULL((void *)0)) {
WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
switch (wk->wk_type) {

case D_PAGEDEP0:
	if (handle_written_filepage(WK_PAGEDEP(wk)((struct pagedep *)(wk)), bp))
		WORKLIST_INSERT(&reattach, wk)do { (wk)->wk_state |= 0x8000; do { if (((wk)->wk_list.
le_next = (&reattach)->lh_first) != ((void *)0)) (&
reattach)->lh_first->wk_list.le_prev = &(wk)->wk_list
.le_next; (&reattach)->lh_first = (wk); (wk)->wk_list
.le_prev = &(&reattach)->lh_first; } while (0); } while
 (0);
	continue;

case D_INODEDEP1:
	if (handle_written_inodeblock(WK_INODEDEP(wk)((struct inodedep *)(wk)), bp))
		WORKLIST_INSERT(&reattach, wk)do { (wk)->wk_state |= 0x8000; do { if (((wk)->wk_list.
le_next = (&reattach)->lh_first) != ((void *)0)) (&
reattach)->lh_first->wk_list.le_prev = &(wk)->wk_list
.le_next; (&reattach)->lh_first = (wk); (wk)->wk_list
.le_prev = &(&reattach)->lh_first; } while (0); } while
 (0);
	continue;

case D_BMSAFEMAP3:
	bmsafemap = WK_BMSAFEMAP(wk)((struct bmsafemap *)(wk));
	while ((newblk = LIST_FIRST(&bmsafemap->sm_newblkhd)((&bmsafemap->sm_newblkhd)->lh_first))) {
		newblk->nb_state |= DEPCOMPLETE0x0008;
		newblk->nb_bmsafemap = NULL((void *)0);
		LIST_REMOVE(newblk, nb_deps)do { if ((newblk)->nb_deps.le_next != ((void *)0)) (newblk
)->nb_deps.le_next->nb_deps.le_prev = (newblk)->nb_deps
.le_prev; *(newblk)->nb_deps.le_prev = (newblk)->nb_deps
.le_next; ((newblk)->nb_deps.le_prev) = ((void *)-1); ((newblk
)->nb_deps.le_next) = ((void *)-1); } while (0);
	}
	while ((adp =
	   LIST_FIRST(&bmsafemap->sm_allocdirecthd)((&bmsafemap->sm_allocdirecthd)->lh_first))) {
		adp->ad_statead_list.wk_state |= DEPCOMPLETE0x0008;
		adp->ad_buf = NULL((void *)0);
		LIST_REMOVE(adp, ad_deps)do { if ((adp)->ad_deps.le_next != ((void *)0)) (adp)->
ad_deps.le_next->ad_deps.le_prev = (adp)->ad_deps.le_prev
; *(adp)->ad_deps.le_prev = (adp)->ad_deps.le_next; ((adp
)->ad_deps.le_prev) = ((void *)-1); ((adp)->ad_deps.le_next
) = ((void *)-1); } while (0);
		handle_allocdirect_partdone(adp);
	}
	while ((aip =
	    LIST_FIRST(&bmsafemap->sm_allocindirhd)((&bmsafemap->sm_allocindirhd)->lh_first))) {
		aip->ai_stateai_list.wk_state |= DEPCOMPLETE0x0008;
		aip->ai_buf = NULL((void *)0);
		LIST_REMOVE(aip, ai_deps)do { if ((aip)->ai_deps.le_next != ((void *)0)) (aip)->
ai_deps.le_next->ai_deps.le_prev = (aip)->ai_deps.le_prev
; *(aip)->ai_deps.le_prev = (aip)->ai_deps.le_next; ((aip
)->ai_deps.le_prev) = ((void *)-1); ((aip)->ai_deps.le_next
) = ((void *)-1); } while (0);
		handle_allocindir_partdone(aip);
	}
	while ((inodedep =
	     LIST_FIRST(&bmsafemap->sm_inodedephd)((&bmsafemap->sm_inodedephd)->lh_first)) != NULL((void *)0)) {
		inodedep->id_stateid_list.wk_state |= DEPCOMPLETE0x0008;
		LIST_REMOVE(inodedep, id_deps)do { if ((inodedep)->id_deps.le_next != ((void *)0)) (inodedep
)->id_deps.le_next->id_deps.le_prev = (inodedep)->id_deps
.le_prev; *(inodedep)->id_deps.le_prev = (inodedep)->id_deps
.le_next; ((inodedep)->id_deps.le_prev) = ((void *)-1); ((
inodedep)->id_deps.le_next) = ((void *)-1); } while (0);
		inodedep->id_buf = NULL((void *)0);
	}
	WORKITEM_FREE(bmsafemap, D_BMSAFEMAP)softdep_freequeue_add((struct worklist *)bmsafemap);
	continue;

case D_MKDIR11:
	handle_written_mkdir(WK_MKDIR(wk)((struct mkdir *)(wk)), MKDIR_BODY0x0020);
	continue;

case D_ALLOCDIRECT4:
	adp = WK_ALLOCDIRECT(wk)((struct allocdirect *)(wk));
	adp->ad_statead_list.wk_state |= COMPLETE0x0004;
	handle_allocdirect_partdone(adp);
	continue;

case D_ALLOCINDIR6:
	aip = WK_ALLOCINDIR(wk)((struct allocindir *)(wk));
	aip->ai_stateai_list.wk_state |= COMPLETE0x0004;
	handle_allocindir_partdone(aip);
	continue;

case D_INDIRDEP5:
	indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk));
	if (indirdep->ir_stateir_list.wk_state & GOINGAWAY0x0100)
		panic("disk_write_complete: indirdep gone");
	memcpy(bp->b_data, indirdep->ir_saveddata, bp->b_bcount)__builtin_memcpy((bp->b_data), (indirdep->ir_saveddata)
, (bp->b_bcount));
	free(indirdep->ir_saveddata, M_INDIRDEP83, bp->b_bcount);
	indirdep->ir_saveddata = NULL((void *)0);
	indirdep->ir_stateir_list.wk_state &= ~UNDONE0x0002;
	indirdep->ir_stateir_list.wk_state |= ATTACHED0x0001;
	while ((aip = LIST_FIRST(&indirdep->ir_donehd)((&indirdep->ir_donehd)->lh_first))) {
		handle_allocindir_partdone(aip);
		if (aip == LIST_FIRST(&indirdep->ir_donehd)((&indirdep->ir_donehd)->lh_first))
			panic("disk_write_complete: not gone");
	}
	WORKLIST_INSERT(&reattach, wk)do { (wk)->wk_state |= 0x8000; do { if (((wk)->wk_list.
le_next = (&reattach)->lh_first) != ((void *)0)) (&
reattach)->lh_first->wk_list.le_prev = &(wk)->wk_list
.le_next; (&reattach)->lh_first = (wk); (wk)->wk_list
.le_prev = &(&reattach)->lh_first; } while (0); } while
 (0);
	if ((bp->b_flags & B_DELWRI0x00000080) == 0)
		stat_indir_blk_ptrs++;
	buf_dirty(bp);
	continue;

default:
	panic("handle_disk_write_complete: Unknown type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */
}
}
/*
* Reattach any requests that must be redone.
*/
while ((wk = LIST_FIRST(&reattach)((&reattach)->lh_first)) != NULL((void *)0)) {
WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
WORKLIST_INSERT(&bp->b_dep, wk)do { (wk)->wk_state |= 0x8000; do { if (((wk)->wk_list.
le_next = (&bp->b_dep)->lh_first) != ((void *)0)) (
&bp->b_dep)->lh_first->wk_list.le_prev = &(wk
)->wk_list.le_next; (&bp->b_dep)->lh_first = (wk
); (wk)->wk_list.le_prev = &(&bp->b_dep)->lh_first
; } while (0); } while (0);
}
3878#ifdef DEBUG
if (lk.lkt_held != -2)
panic("softdep_disk_write_complete: lock lost");
lk.lkt_held = -1;
3882#endif
3883}

3885/*
* Called from within softdep_disk_write_complete above. Note that
* this routine is always called from interrupt level with further
* splbio interrupts blocked.
*/
3890/* the completed allocdirect */
3891STATIC void 
3892handle_allocdirect_partdone(struct allocdirect *adp)
3893{
struct allocdirect *listadp;
struct inodedep *inodedep;
long bsize, delay;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if ((adp->ad_statead_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) != ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
return;
if (adp->ad_buf != NULL((void *)0))
panic("handle_allocdirect_partdone: dangling dep");

/*
* The on-disk inode cannot claim to be any larger than the last
* fragment that has been written. Otherwise, the on-disk inode
* might have fragments that were not the last block in the file
* which would corrupt the filesystem. Thus, we cannot free any
* allocdirects after one whose ad_oldblkno claims a fragment as
* these blocks must be rolled back to zero before writing the inode.
* We check the currently active set of allocdirects in id_inoupdt.
*/
inodedep = adp->ad_inodedep;
bsize = inodedep->id_fs->fs_bsize;
TAILQ_FOREACH(listadp, &inodedep->id_inoupdt, ad_next)for((listadp) = ((&inodedep->id_inoupdt)->tqh_first
); (listadp) != ((void *)0); (listadp) = ((listadp)->ad_next
.tqe_next)) {
/* found our block */
if (listadp == adp)
	break;
/* continue if ad_oldlbn is not a fragment */
if (listadp->ad_oldsize == 0 ||
    listadp->ad_oldsize == bsize)
	continue;
/* hit a fragment */
return;
}
/*
* If we have reached the end of the current list without
* finding the just finished dependency, then it must be
* on the future dependency list. Future dependencies cannot
* be freed until they are moved to the current list.
*/
if (listadp == NULL((void *)0)) {
3934#ifdef DEBUG
TAILQ_FOREACH(listadp, &inodedep->id_newinoupdt, ad_next)for((listadp) = ((&inodedep->id_newinoupdt)->tqh_first
); (listadp) != ((void *)0); (listadp) = ((listadp)->ad_next
.tqe_next))
	/* found our block */
	if (listadp == adp)
		break;
if (listadp == NULL((void *)0))
	panic("handle_allocdirect_partdone: lost dep");
3941#endif /* DEBUG */
return;
}
/*
* If we have found the just finished dependency, then free
* it along with anything that follows it that is complete.
* If the inode still has a bitmap dependency, then it has
* never been written to disk, hence the on-disk inode cannot
* reference the old fragment so we can free it without delay.
*/
delay = (inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008);
for (; adp; adp = listadp) {
listadp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next);
if ((adp->ad_statead_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) != ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
	return;
free_allocdirect(&inodedep->id_inoupdt, adp, delay);
}
3958}

3960/*
* Called from within softdep_disk_write_complete above. Note that
* this routine is always called from interrupt level with further
* splbio interrupts blocked.
*/
3965/* the completed allocindir */
3966STATIC void
3967handle_allocindir_partdone(struct allocindir *aip)
3968{
struct indirdep *indirdep;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if ((aip->ai_stateai_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) != ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
return;
if (aip->ai_buf != NULL((void *)0))
panic("handle_allocindir_partdone: dangling dependency");
indirdep = aip->ai_indirdep;
if (indirdep->ir_stateir_list.wk_state & UNDONE0x0002) {
LIST_REMOVE(aip, ai_next)do { if ((aip)->ai_next.le_next != ((void *)0)) (aip)->
ai_next.le_next->ai_next.le_prev = (aip)->ai_next.le_prev
; *(aip)->ai_next.le_prev = (aip)->ai_next.le_next; ((aip
)->ai_next.le_prev) = ((void *)-1); ((aip)->ai_next.le_next
) = ((void *)-1); } while (0);
LIST_INSERT_HEAD(&indirdep->ir_donehd, aip, ai_next)do { if (((aip)->ai_next.le_next = (&indirdep->ir_donehd
)->lh_first) != ((void *)0)) (&indirdep->ir_donehd)
->lh_first->ai_next.le_prev = &(aip)->ai_next.le_next
; (&indirdep->ir_donehd)->lh_first = (aip); (aip)->
ai_next.le_prev = &(&indirdep->ir_donehd)->lh_first
; } while (0);
return;
}
if (indirdep->ir_stateir_list.wk_state & UFS1FMT0x2000)
((int32_t *)indirdep->ir_savebp->b_data)[aip->ai_offset] =
    aip->ai_newblkno;
else
((int64_t *)indirdep->ir_savebp->b_data)[aip->ai_offset] =
    aip->ai_newblkno;
LIST_REMOVE(aip, ai_next)do { if ((aip)->ai_next.le_next != ((void *)0)) (aip)->
ai_next.le_next->ai_next.le_prev = (aip)->ai_next.le_prev
; *(aip)->ai_next.le_prev = (aip)->ai_next.le_next; ((aip
)->ai_next.le_prev) = ((void *)-1); ((aip)->ai_next.le_next
) = ((void *)-1); } while (0);
if (aip->ai_freefrag != NULL((void *)0))
add_to_worklist(&aip->ai_freefrag->ff_list);
WORKITEM_FREE(aip, D_ALLOCINDIR)softdep_freequeue_add((struct worklist *)aip);
3993}

3995/*
* Called from within softdep_disk_write_complete above to restore
* in-memory inode block contents to their most up-to-date state. Note
* that this routine is always called from interrupt level with further
* splbio interrupts blocked.
*/
4001/* buffer containing the inode block */
4002STATIC int 
4003handle_written_inodeblock(struct inodedep *inodedep, struct buf *bp)
4004{
struct worklist *wk, *filefree;
struct allocdirect *adp, *nextadp;
struct ufs1_dinode *dp1 = NULL((void *)0);
struct ufs2_dinode *dp2 = NULL((void *)0);
int hadchanges, fstype;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if ((inodedep->id_stateid_list.wk_state & IOSTARTED0x0200) == 0)
panic("handle_written_inodeblock: not started");
inodedep->id_stateid_list.wk_state &= ~IOSTARTED0x0200;

if (inodedep->id_fs->fs_magic == FS_UFS1_MAGIC0x011954) {
fstype = UM_UFS11;
dp1 = (struct ufs1_dinode *) bp->b_data +
    ino_to_fsbo(inodedep->id_fs, inodedep->id_ino)((inodedep->id_ino) % ((inodedep->id_fs)->fs_inopb));
} else {
fstype = UM_UFS22;
dp2 = (struct ufs2_dinode *) bp->b_data +
    ino_to_fsbo(inodedep->id_fs, inodedep->id_ino)((inodedep->id_ino) % ((inodedep->id_fs)->fs_inopb));
}

/*
* If we had to rollback the inode allocation because of
* bitmaps being incomplete, then simply restore it.
* Keep the block dirty so that it will not be reclaimed until
* all associated dependencies have been cleared and the
* corresponding updates written to disk.
*/
if (inodedep->id_savedino1id_un.idu_savedino1 != NULL((void *)0)) {
if (fstype == UM_UFS11)
	*dp1 = *inodedep->id_savedino1id_un.idu_savedino1;
else
	*dp2 = *inodedep->id_savedino2id_un.idu_savedino2;
free(inodedep->id_savedino1id_un.idu_savedino1, M_INODEDEP79, inodedep->id_unsize);
inodedep->id_savedino1id_un.idu_savedino1 = NULL((void *)0);
if ((bp->b_flags & B_DELWRI0x00000080) == 0)
	stat_inode_bitmap++;
buf_dirty(bp);
return (1);
}
inodedep->id_stateid_list.wk_state |= COMPLETE0x0004;
/*
* Roll forward anything that had to be rolled back before 
* the inode could be updated.
*/
hadchanges = 0;
for (adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first); adp; adp = nextadp) {
nextadp = TAILQ_NEXT(adp, ad_next)((adp)->ad_next.tqe_next);
if (adp->ad_statead_list.wk_state & ATTACHED0x0001)
	panic("handle_written_inodeblock: new entry");
if (fstype == UM_UFS11) {
	if (adp->ad_lbn < NDADDR12) {
		if (dp1->di_db[adp->ad_lbn] != adp->ad_oldblkno)
			 panic("%s: %s #%lld mismatch %d != "
			     "%lld",
			     "handle_written_inodeblock",
			     "direct pointer",
			     (long long)adp->ad_lbn,
			     dp1->di_db[adp->ad_lbn],
			     (long long)adp->ad_oldblkno);
		dp1->di_db[adp->ad_lbn] = adp->ad_newblkno;
	} else {
		if (dp1->di_ib[adp->ad_lbn - NDADDR12] != 0)
			panic("%s: %s #%lld allocated as %d",
			    "handle_written_inodeblock",
			    "indirect pointer",
			    (long long)(adp->ad_lbn - NDADDR12),
			    dp1->di_ib[adp->ad_lbn - NDADDR12]);
		dp1->di_ib[adp->ad_lbn - NDADDR12] =
		   adp->ad_newblkno;
	}
} else {
	if (adp->ad_lbn < NDADDR12) {
		if (dp2->di_db[adp->ad_lbn] != adp->ad_oldblkno)
			panic("%s: %s #%lld mismatch %lld != "
			    "%lld", "handle_written_inodeblock",
			    "direct pointer",
			    (long long)adp->ad_lbn,
			    dp2->di_db[adp->ad_lbn],
			    (long long)adp->ad_oldblkno);
		dp2->di_db[adp->ad_lbn] = adp->ad_newblkno;
	} else {
		if (dp2->di_ib[adp->ad_lbn - NDADDR12] != 0)
			panic("%s: %s #%lld allocated as %lld",
			    "handle_written_inodeblock",
			    "indirect pointer",
			    (long long)(adp->ad_lbn - NDADDR12),
			    dp2->di_ib[adp->ad_lbn - NDADDR12]);
		dp2->di_ib[adp->ad_lbn - NDADDR12] =
		    adp->ad_newblkno;
	}
}
adp->ad_statead_list.wk_state &= ~UNDONE0x0002;
adp->ad_statead_list.wk_state |= ATTACHED0x0001;
hadchanges = 1;
}
if (hadchanges && (bp->b_flags & B_DELWRI0x00000080) == 0)
stat_direct_blk_ptrs++;
/*
* Reset the file size to its most up-to-date value.
*/
if (inodedep->id_savedsize == -1)
panic("handle_written_inodeblock: bad size");

if (fstype == UM_UFS11) {
if (dp1->di_size != inodedep->id_savedsize) {
	dp1->di_size = inodedep->id_savedsize;
	hadchanges = 1;
}
} else {
if (dp2->di_size != inodedep->id_savedsize) {
	dp2->di_size = inodedep->id_savedsize;
	hadchanges = 1;
}
}
inodedep->id_savedsize = -1;
/*
* If there were any rollbacks in the inode block, then it must be
* marked dirty so that its will eventually get written back in
* its correct form.
*/
if (hadchanges)
buf_dirty(bp);
/*
* Process any allocdirects that completed during the update.
*/
if ((adp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first)) != NULL((void *)0))
handle_allocdirect_partdone(adp);
/*
* Process deallocations that were held pending until the
* inode had been written to disk. Freeing of the inode
* is delayed until after all blocks have been freed to
* avoid creation of new <vfsid, inum, lbn> triples
* before the old ones have been deleted.
*/
filefree = NULL((void *)0);
while ((wk = LIST_FIRST(&inodedep->id_bufwait)((&inodedep->id_bufwait)->lh_first)) != NULL((void *)0)) {
WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
switch (wk->wk_type) {

case D_FREEFILE9:
	/*
	 * We defer adding filefree to the worklist until
	 * all other additions have been made to ensure
	 * that it will be done after all the old blocks
	 * have been freed.
	 */
	if (filefree != NULL((void *)0))
		panic("handle_written_inodeblock: filefree");
	filefree = wk;
	continue;

case D_MKDIR11:
	handle_written_mkdir(WK_MKDIR(wk)((struct mkdir *)(wk)), MKDIR_PARENT0x0010);
	continue;

case D_DIRADD10:
	diradd_inode_written(WK_DIRADD(wk)((struct diradd *)(wk)), inodedep);
	continue;

case D_FREEBLKS8:
	wk->wk_state |= COMPLETE0x0004;
	if ((wk->wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) != ALLCOMPLETE(0x0001 | 0x0004 | 0x0008))
		continue;
	/* FALLTHROUGH */
case D_FREEFRAG7:
case D_DIRREM12:
	add_to_worklist(wk);
	continue;

case D_NEWDIRBLK13:
	free_newdirblk(WK_NEWDIRBLK(wk)((struct newdirblk *)(wk)));
	continue;

default:
	panic("handle_written_inodeblock: Unknown type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */
}
}
if (filefree != NULL((void *)0)) {
if (free_inodedep(inodedep) == 0)
	panic("handle_written_inodeblock: live inodedep");
add_to_worklist(filefree);
return (0);
}

/*
* If no outstanding dependencies, free it.
*/
if (free_inodedep(inodedep) ||
   TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) == NULL((void *)0))
return (0);
return (hadchanges);
4200}

4202/*
* Process a diradd entry after its dependent inode has been written.
* This routine must be called with splbio interrupts blocked.
*/
4206STATIC void
4207diradd_inode_written(struct diradd *dap, struct inodedep *inodedep)
4208{
struct pagedep *pagedep;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

dap->da_stateda_list.wk_state |= COMPLETE0x0004;
if ((dap->da_stateda_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) {
if (dap->da_stateda_list.wk_state & DIRCHG0x0080)
	pagedep = dap->da_previousda_un.dau_previous->dm_pagedepdm_un.dmu_pagedep;
else
	pagedep = dap->da_pagedepda_un.dau_pagedep;
LIST_REMOVE(dap, da_pdlist)do { if ((dap)->da_pdlist.le_next != ((void *)0)) (dap)->
da_pdlist.le_next->da_pdlist.le_prev = (dap)->da_pdlist
.le_prev; *(dap)->da_pdlist.le_prev = (dap)->da_pdlist.
le_next; ((dap)->da_pdlist.le_prev) = ((void *)-1); ((dap)
->da_pdlist.le_next) = ((void *)-1); } while (0);
LIST_INSERT_HEAD(&pagedep->pd_pendinghd, dap, da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_pendinghd
)->lh_first) != ((void *)0)) (&pagedep->pd_pendinghd
)->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_pendinghd)->lh_first = (dap
); (dap)->da_pdlist.le_prev = &(&pagedep->pd_pendinghd
)->lh_first; } while (0);
}
WORKLIST_INSERT(&inodedep->id_pendinghd, &dap->da_list)do { (&dap->da_list)->wk_state |= 0x8000; do { if (
((&dap->da_list)->wk_list.le_next = (&inodedep->
id_pendinghd)->lh_first) != ((void *)0)) (&inodedep->
id_pendinghd)->lh_first->wk_list.le_prev = &(&dap
->da_list)->wk_list.le_next; (&inodedep->id_pendinghd
)->lh_first = (&dap->da_list); (&dap->da_list
)->wk_list.le_prev = &(&inodedep->id_pendinghd)
->lh_first; } while (0); } while (0);
4223}

4225/*
* Handle the completion of a mkdir dependency.
*/
4228STATIC void
4229handle_written_mkdir(struct mkdir *mkdir, int type)
4230{
struct diradd *dap;
struct pagedep *pagedep;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if (mkdir->md_statemd_list.wk_state != type)
panic("handle_written_mkdir: bad type");
dap = mkdir->md_diradd;
dap->da_stateda_list.wk_state &= ~type;
if ((dap->da_stateda_list.wk_state & (MKDIR_PARENT0x0010 | MKDIR_BODY0x0020)) == 0)
dap->da_stateda_list.wk_state |= DEPCOMPLETE0x0008;
if ((dap->da_stateda_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) {
if (dap->da_stateda_list.wk_state & DIRCHG0x0080)
	pagedep = dap->da_previousda_un.dau_previous->dm_pagedepdm_un.dmu_pagedep;
else
	pagedep = dap->da_pagedepda_un.dau_pagedep;
LIST_REMOVE(dap, da_pdlist)do { if ((dap)->da_pdlist.le_next != ((void *)0)) (dap)->
da_pdlist.le_next->da_pdlist.le_prev = (dap)->da_pdlist
.le_prev; *(dap)->da_pdlist.le_prev = (dap)->da_pdlist.
le_next; ((dap)->da_pdlist.le_prev) = ((void *)-1); ((dap)
->da_pdlist.le_next) = ((void *)-1); } while (0);
LIST_INSERT_HEAD(&pagedep->pd_pendinghd, dap, da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_pendinghd
)->lh_first) != ((void *)0)) (&pagedep->pd_pendinghd
)->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_pendinghd)->lh_first = (dap
); (dap)->da_pdlist.le_prev = &(&pagedep->pd_pendinghd
)->lh_first; } while (0);
}
LIST_REMOVE(mkdir, md_mkdirs)do { if ((mkdir)->md_mkdirs.le_next != ((void *)0)) (mkdir
)->md_mkdirs.le_next->md_mkdirs.le_prev = (mkdir)->md_mkdirs
.le_prev; *(mkdir)->md_mkdirs.le_prev = (mkdir)->md_mkdirs
.le_next; ((mkdir)->md_mkdirs.le_prev) = ((void *)-1); ((mkdir
)->md_mkdirs.le_next) = ((void *)-1); } while (0);
WORKITEM_FREE(mkdir, D_MKDIR)softdep_freequeue_add((struct worklist *)mkdir);
4252}

4254/*
* Called from within softdep_disk_write_complete above.
* A write operation was just completed. Removed inodes can
* now be freed and associated block pointers may be committed.
* Note that this routine is always called from interrupt level
* with further splbio interrupts blocked.
*/
4261/* buffer containing the written page */
4262STATIC int 
4263handle_written_filepage(struct pagedep *pagedep, struct buf *bp)
4264{
struct dirrem *dirrem;
struct diradd *dap, *nextdap;
struct direct *ep;
int i, chgs;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if ((pagedep->pd_statepd_list.wk_state & IOSTARTED0x0200) == 0)
panic("handle_written_filepage: not started");
pagedep->pd_statepd_list.wk_state &= ~IOSTARTED0x0200;
/*
* Process any directory removals that have been committed.
*/
while ((dirrem = LIST_FIRST(&pagedep->pd_dirremhd)((&pagedep->pd_dirremhd)->lh_first)) != NULL((void *)0)) {
LIST_REMOVE(dirrem, dm_next)do { if ((dirrem)->dm_next.le_next != ((void *)0)) (dirrem
)->dm_next.le_next->dm_next.le_prev = (dirrem)->dm_next
.le_prev; *(dirrem)->dm_next.le_prev = (dirrem)->dm_next
.le_next; ((dirrem)->dm_next.le_prev) = ((void *)-1); ((dirrem
)->dm_next.le_next) = ((void *)-1); } while (0);
dirrem->dm_dirinumdm_un.dmu_dirinum = pagedep->pd_ino;
add_to_worklist(&dirrem->dm_list);
}
/*
* Free any directory additions that have been committed.
* If it is a newly allocated block, we have to wait until
* the on-disk directory inode claims the new block.
*/
if ((pagedep->pd_statepd_list.wk_state & NEWBLOCK0x0800) == 0)
while ((dap = LIST_FIRST(&pagedep->pd_pendinghd)((&pagedep->pd_pendinghd)->lh_first)) != NULL((void *)0))
	free_diradd(dap);
/*
* Uncommitted directory entries must be restored.
*/
for (chgs = 0, i = 0; i < DAHASHSZ6; i++) {
for (dap = LIST_FIRST(&pagedep->pd_diraddhd[i])((&pagedep->pd_diraddhd[i])->lh_first); dap;
     dap = nextdap) {
	nextdap = LIST_NEXT(dap, da_pdlist)((dap)->da_pdlist.le_next);
	if (dap->da_stateda_list.wk_state & ATTACHED0x0001)
		panic("handle_written_filepage: attached");
	ep = (struct direct *)
	    ((char *)bp->b_data + dap->da_offset);
	ep->d_ino = dap->da_newinum;
	dap->da_stateda_list.wk_state &= ~UNDONE0x0002;
	dap->da_stateda_list.wk_state |= ATTACHED0x0001;
	chgs = 1;
	/*
	 * If the inode referenced by the directory has
	 * been written out, then the dependency can be
	 * moved to the pending list.
	 */
	if ((dap->da_stateda_list.wk_state & ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) == ALLCOMPLETE(0x0001 | 0x0004 | 0x0008)) {
		LIST_REMOVE(dap, da_pdlist)do { if ((dap)->da_pdlist.le_next != ((void *)0)) (dap)->
da_pdlist.le_next->da_pdlist.le_prev = (dap)->da_pdlist
.le_prev; *(dap)->da_pdlist.le_prev = (dap)->da_pdlist.
le_next; ((dap)->da_pdlist.le_prev) = ((void *)-1); ((dap)
->da_pdlist.le_next) = ((void *)-1); } while (0);
		LIST_INSERT_HEAD(&pagedep->pd_pendinghd, dap,do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_pendinghd
)->lh_first) != ((void *)0)) (&pagedep->pd_pendinghd
)->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_pendinghd)->lh_first = (dap
); (dap)->da_pdlist.le_prev = &(&pagedep->pd_pendinghd
)->lh_first; } while (0)
		    da_pdlist)do { if (((dap)->da_pdlist.le_next = (&pagedep->pd_pendinghd
)->lh_first) != ((void *)0)) (&pagedep->pd_pendinghd
)->lh_first->da_pdlist.le_prev = &(dap)->da_pdlist
.le_next; (&pagedep->pd_pendinghd)->lh_first = (dap
); (dap)->da_pdlist.le_prev = &(&pagedep->pd_pendinghd
)->lh_first; } while (0);
	}
}
}
/*
* If there were any rollbacks in the directory, then it must be
* marked dirty so that its will eventually get written back in
* its correct form.
*/
if (chgs) {
if ((bp->b_flags & B_DELWRI0x00000080) == 0)
	stat_dir_entry++;
buf_dirty(bp);
return (1);
}
/*
* If we are not waiting for a new directory block to be
* claimed by its inode, then the pagedep will be freed.
* Otherwise it will remain to track any new entries on
* the page in case they are fsync'ed.
*/
if ((pagedep->pd_statepd_list.wk_state & NEWBLOCK0x0800) == 0) {
LIST_REMOVE(pagedep, pd_hash)do { if ((pagedep)->pd_hash.le_next != ((void *)0)) (pagedep
)->pd_hash.le_next->pd_hash.le_prev = (pagedep)->pd_hash
.le_prev; *(pagedep)->pd_hash.le_prev = (pagedep)->pd_hash
.le_next; ((pagedep)->pd_hash.le_prev) = ((void *)-1); ((pagedep
)->pd_hash.le_next) = ((void *)-1); } while (0);
WORKITEM_FREE(pagedep, D_PAGEDEP)softdep_freequeue_add((struct worklist *)pagedep);
}
return (0);
4340}

4342/*
* Writing back in-core inode structures.
* 
* The file system only accesses an inode's contents when it occupies an
* "in-core" inode structure.  These "in-core" structures are separate from
* the page frames used to cache inode blocks.  Only the latter are
* transferred to/from the disk.  So, when the updated contents of the
* "in-core" inode structure are copied to the corresponding in-memory inode
* block, the dependencies are also transferred.  The following procedure is
* called when copying a dirty "in-core" inode to a cached inode block.
*/

4354/*
* Called when an inode is loaded from disk. If the effective link count
* differed from the actual link count when it was last flushed, then we
* need to ensure that the correct effective link count is put back.
*/
4359/* the "in_core" copy of the inode */
4360void 
4361softdep_load_inodeblock(struct inode *ip)
4362{
struct inodedep *inodedep;

/*
* Check for alternate nlink count.
*/
ip->i_effnlink = DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(ip->i_fsinode_u.fs, ip->i_number, 0, &inodedep) == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return;
}
ip->i_effnlink -= inodedep->id_nlinkdelta;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
4376}

4378/*
* This routine is called just before the "in-core" inode
* information is to be copied to the in-memory inode block.
* Recall that an inode block contains several inodes. If
* the force flag is set, then the dependencies will be
* cleared so that the update can always be made. Note that
* the buffer is locked when this routine is called, so we
* will never be in the middle of writing the inode block 
* to disk.
*/
4388/* the "in_core" copy of the inode */
4389/* the buffer containing the inode block */
4390/* nonzero => update must be allowed */
4391void 
4392softdep_update_inodeblock(struct inode *ip, struct buf *bp, int waitfor)
4393{
struct inodedep *inodedep;
struct worklist *wk;
int error, gotit;

/*
* If the effective link count is not equal to the actual link
* count, then we must track the difference in an inodedep while
* the inode is (potentially) tossed out of the cache. Otherwise,
* if there is no existing inodedep, then there are no dependencies
* to track.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(ip->i_fsinode_u.fs, ip->i_number, 0, &inodedep) == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
if (ip->i_effnlink != DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink))
	panic("softdep_update_inodeblock: bad link count");
return;
}
if (inodedep->id_nlinkdelta != DIP(ip, nlink)(((ip)->i_ump->um_fstype == 1) ? (ip)->dinode_u.ffs1_din
->di_nlink : (ip)->dinode_u.ffs2_din->di_nlink) - ip->i_effnlink) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("softdep_update_inodeblock: bad delta");
}
/*
* Changes have been initiated. Anything depending on these
* changes cannot occur until this inode has been written.
*/
inodedep->id_stateid_list.wk_state &= ~COMPLETE0x0004;
if ((inodedep->id_stateid_list.wk_state & ONWORKLIST0x8000) == 0)
WORKLIST_INSERT(&bp->b_dep, &inodedep->id_list)do { (&inodedep->id_list)->wk_state |= 0x8000; do {
 if (((&inodedep->id_list)->wk_list.le_next = (&
bp->b_dep)->lh_first) != ((void *)0)) (&bp->b_dep
)->lh_first->wk_list.le_prev = &(&inodedep->
id_list)->wk_list.le_next; (&bp->b_dep)->lh_first
 = (&inodedep->id_list); (&inodedep->id_list)->
wk_list.le_prev = &(&bp->b_dep)->lh_first; } while
 (0); } while (0);
/*
* Any new dependencies associated with the incore inode must 
* now be moved to the list associated with the buffer holding
* the in-memory copy of the inode. Once merged process any
* allocdirects that are completed by the merger.
*/
merge_inode_lists(inodedep);
if (TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) != NULL((void *)0))
handle_allocdirect_partdone(TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first));
/*
* Now that the inode has been pushed into the buffer, the
* operations dependent on the inode being written to disk
* can be moved to the id_bufwait so that they will be
* processed when the buffer I/O completes.
*/
while ((wk = LIST_FIRST(&inodedep->id_inowait)((&inodedep->id_inowait)->lh_first)) != NULL((void *)0)) {
WORKLIST_REMOVE(wk)do { (wk)->wk_state &= ~0x8000; do { if ((wk)->wk_list
.le_next != ((void *)0)) (wk)->wk_list.le_next->wk_list
.le_prev = (wk)->wk_list.le_prev; *(wk)->wk_list.le_prev
 = (wk)->wk_list.le_next; ((wk)->wk_list.le_prev) = ((void
 *)-1); ((wk)->wk_list.le_next) = ((void *)-1); } while (0
); } while (0);
WORKLIST_INSERT(&inodedep->id_bufwait, wk)do { (wk)->wk_state |= 0x8000; do { if (((wk)->wk_list.
le_next = (&inodedep->id_bufwait)->lh_first) != ((void
 *)0)) (&inodedep->id_bufwait)->lh_first->wk_list
.le_prev = &(wk)->wk_list.le_next; (&inodedep->
id_bufwait)->lh_first = (wk); (wk)->wk_list.le_prev = &
(&inodedep->id_bufwait)->lh_first; } while (0); } while
 (0);
}
/*
* Newly allocated inodes cannot be written until the bitmap
* that allocates them have been written (indicated by
* DEPCOMPLETE being set in id_state). If we are doing a
* forced sync (e.g., an fsync on a file), we force the bitmap
* to be written so that the update can be done.
*/
do {
if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) != 0 || waitfor == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	return;
}
bp = inodedep->id_buf;
gotit = getdirtybuf(bp, MNT_WAIT1);
} while (gotit == -1);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
if (gotit && (error = bwrite(bp)) != 0)
softdep_error("softdep_update_inodeblock: bwrite", error);
if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) == 0)
panic("softdep_update_inodeblock: update failed");
4462}

4464/*
* Merge the new inode dependency list (id_newinoupdt) into the old
* inode dependency list (id_inoupdt). This routine must be called
* with splbio interrupts blocked.
*/
4469STATIC void
4470merge_inode_lists(struct inodedep *inodedep)
4471{
struct allocdirect *listadp, *newadp;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

newadp = TAILQ_FIRST(&inodedep->id_newinoupdt)((&inodedep->id_newinoupdt)->tqh_first);
for (listadp = TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first); listadp && newadp;) {
if (listadp->ad_lbn < newadp->ad_lbn) {
	listadp = TAILQ_NEXT(listadp, ad_next)((listadp)->ad_next.tqe_next);
	continue;
}
TAILQ_REMOVE(&inodedep->id_newinoupdt, newadp, ad_next)do { if (((newadp)->ad_next.tqe_next) != ((void *)0)) (newadp
)->ad_next.tqe_next->ad_next.tqe_prev = (newadp)->ad_next
.tqe_prev; else (&inodedep->id_newinoupdt)->tqh_last
 = (newadp)->ad_next.tqe_prev; *(newadp)->ad_next.tqe_prev
 = (newadp)->ad_next.tqe_next; ((newadp)->ad_next.tqe_prev
) = ((void *)-1); ((newadp)->ad_next.tqe_next) = ((void *)
-1); } while (0);
TAILQ_INSERT_BEFORE(listadp, newadp, ad_next)do { (newadp)->ad_next.tqe_prev = (listadp)->ad_next.tqe_prev
; (newadp)->ad_next.tqe_next = (listadp); *(listadp)->ad_next
.tqe_prev = (newadp); (listadp)->ad_next.tqe_prev = &(
newadp)->ad_next.tqe_next; } while (0);
if (listadp->ad_lbn == newadp->ad_lbn) {
	allocdirect_merge(&inodedep->id_inoupdt, newadp,
	    listadp);
	listadp = newadp;
}
newadp = TAILQ_FIRST(&inodedep->id_newinoupdt)((&inodedep->id_newinoupdt)->tqh_first);
}
TAILQ_CONCAT(&inodedep->id_inoupdt, &inodedep->id_newinoupdt, ad_next)do { if (!(((&inodedep->id_newinoupdt)->tqh_first) ==
 ((void *)0))) { *(&inodedep->id_inoupdt)->tqh_last
 = (&inodedep->id_newinoupdt)->tqh_first; (&inodedep
->id_newinoupdt)->tqh_first->ad_next.tqe_prev = (&
inodedep->id_inoupdt)->tqh_last; (&inodedep->id_inoupdt
)->tqh_last = (&inodedep->id_newinoupdt)->tqh_last
; do { ((&inodedep->id_newinoupdt))->tqh_first = ((
void *)0); ((&inodedep->id_newinoupdt))->tqh_last =
 &((&inodedep->id_newinoupdt))->tqh_first; } while
 (0); } } while (0);
4492}

4494/*
* If we are doing an fsync, then we must ensure that any directory
* entries for the inode have been written after the inode gets to disk.
*/
4498/* the "in_core" copy of the inode */
4499int
4500softdep_fsync(struct vnode *vp)
4501{
struct inodedep *inodedep;
struct pagedep *pagedep;
struct worklist *wk;
struct diradd *dap;
struct mount *mnt;
struct vnode *pvp;
struct inode *ip;
struct inode *pip;
struct buf *bp;
struct fs *fs;
struct proc *p = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc;		/* XXX */
int error, flushparent;
ufsino_t parentino;
daddr_t lbn;

ip = VTOI(vp)((struct inode *)(vp)->v_data);
fs = ip->i_fsinode_u.fs;
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(fs, ip->i_number, 0, &inodedep) == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (0);
}
if (LIST_FIRST(&inodedep->id_inowait)((&inodedep->id_inowait)->lh_first) != NULL((void *)0) ||
   LIST_FIRST(&inodedep->id_bufwait)((&inodedep->id_bufwait)->lh_first) != NULL((void *)0) ||
   TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first) != NULL((void *)0) ||
   TAILQ_FIRST(&inodedep->id_newinoupdt)((&inodedep->id_newinoupdt)->tqh_first) != NULL((void *)0)) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("softdep_fsync: pending ops");
}
for (error = 0, flushparent = 0; ; ) {
if ((wk = LIST_FIRST(&inodedep->id_pendinghd)((&inodedep->id_pendinghd)->lh_first)) == NULL((void *)0))
	break;
if (wk->wk_type != D_DIRADD10) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_fsync: Unexpected type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
}
dap = WK_DIRADD(wk)((struct diradd *)(wk));
/*
 * Flush our parent if this directory entry has a MKDIR_PARENT
 * dependency or is contained in a newly allocated block.
 */
if (dap->da_stateda_list.wk_state & DIRCHG0x0080)
	pagedep = dap->da_previousda_un.dau_previous->dm_pagedepdm_un.dmu_pagedep;
else
	pagedep = dap->da_pagedepda_un.dau_pagedep;
mnt = pagedep->pd_mnt;
parentino = pagedep->pd_ino;
lbn = pagedep->pd_lbn;
if ((dap->da_stateda_list.wk_state & (MKDIR_BODY0x0020 | COMPLETE0x0004)) != COMPLETE0x0004) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_fsync: dirty");
}
if ((dap->da_stateda_list.wk_state & MKDIR_PARENT0x0010) ||
    (pagedep->pd_statepd_list.wk_state & NEWBLOCK0x0800))
	flushparent = 1;
else
	flushparent = 0;
/*
 * If we are being fsync'ed as part of vgone'ing this vnode,
 * then we will not be able to release and recover the
 * vnode below, so we just have to give up on writing its
 * directory entry out. It will eventually be written, just
 * not now, but then the user was not asking to have it
 * written, so we are not breaking any promises.
 */
mtx_enter(&vnode_mtx);
if (vp->v_lflag & VXLOCK0x0100) {
	mtx_leave(&vnode_mtx);
	break;
}
mtx_leave(&vnode_mtx);
/*
 * We prevent deadlock by always fetching inodes from the
 * root, moving down the directory tree. Thus, when fetching
 * our parent directory, we must unlock ourselves before
 * requesting the lock on our parent. See the comment in
 * ufs_lookup for details on possible races.
 */
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
VOP_UNLOCK(vp);
error = VFS_VGET(mnt, parentino, &pvp)(*(mnt)->mnt_op->vfs_vget)(mnt, parentino, &pvp);
vn_lock(vp, LK_EXCLUSIVE0x0001UL | LK_RETRY0x2000UL);
if (error != 0)
	return (error);
/*
 * All MKDIR_PARENT dependencies and all the NEWBLOCK pagedeps
 * that are contained in direct blocks will be resolved by 
 * doing a UFS_UPDATE. Pagedeps contained in indirect blocks
 * may require a complete sync'ing of the directory. So, we
 * try the cheap and fast UFS_UPDATE first, and if that fails,
 * then we do the slower VOP_FSYNC of the directory.
 */
pip = VTOI(pvp)((struct inode *)(pvp)->v_data);
if (flushparent) {
	error = UFS_UPDATE(pip, 1)((pip)->i_vtbl->iv_update)((pip), (1));
	if (error) {
		vput(pvp);
		return (error);
	}
	if (pagedep->pd_statepd_list.wk_state & NEWBLOCK0x0800) {
		error = VOP_FSYNC(pvp, p->p_ucred, MNT_WAIT1, p);
		if (error) {
			vput(pvp);
			return (error);
		}
	}
}
/*
 * Flush directory page containing the inode's name.
 */
error = bread(pvp, lbn, fs->fs_bsize, &bp);
if (error == 0) {
	bp->b_bcount = blksize(fs, pip, lbn)(((lbn) >= 12 || ((((pip))->i_ump->um_fstype == 1) ?
 ((pip))->dinode_u.ffs1_din->di_size : ((pip))->dinode_u
.ffs2_din->di_size) >= ((lbn) + 1) << (fs)->fs_bshift
) ? (u_int64_t)(fs)->fs_bsize : ((((((((((pip))->i_ump->
um_fstype == 1) ? ((pip))->dinode_u.ffs1_din->di_size :
 ((pip))->dinode_u.ffs2_din->di_size)) & (fs)->fs_qbmask
)) + (fs)->fs_qfmask) & (fs)->fs_fmask)));
	error = bwrite(bp);
} else
	brelse(bp);
vput(pvp);
if (error != 0)
	return (error);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(fs, ip->i_number, 0, &inodedep) == 0)
	break;
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (0);
4628}

4630/*
* Flush all the dirty bitmaps associated with the block device
* before flushing the rest of the dirty blocks so as to reduce
* the number of dependencies that will have to be rolled back.
*/
4635void
4636softdep_fsync_mountdev(struct vnode *vp, int waitfor)
4637{
struct buf *bp, *nbp;
struct worklist *wk;

if (!vn_isdisk(vp, NULL((void *)0)))
panic("softdep_fsync_mountdev: vnode not a disk");
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
LIST_FOREACH_SAFE(bp, &vp->v_dirtyblkhd, b_vnbufs, nbp)for ((bp) = ((&vp->v_dirtyblkhd)->lh_first); (bp) &&
 ((nbp) = ((bp)->b_vnbufs.le_next), 1); (bp) = (nbp)) {
/* 
 * If it is already scheduled, skip to the next buffer.
 */
splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);
if (bp->b_flags & B_BUSY0x00000010)
	continue;

if ((bp->b_flags & B_DELWRI0x00000080) == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_fsync_mountdev: not dirty");
}
/*
 * We are only interested in bitmaps with outstanding
 * dependencies.
 */
if ((wk = LIST_FIRST(&bp->b_dep)((&bp->b_dep)->lh_first)) == NULL((void *)0) ||
    wk->wk_type != D_BMSAFEMAP3) {
	continue;
}
bremfreebufcache_take(bp);
buf_acquire(bp);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
(void) bawrite(bp);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
/*
 * Since we may have slept during the I/O, we need 
 * to start from a known point.
 */
nbp = LIST_FIRST(&vp->v_dirtyblkhd)((&vp->v_dirtyblkhd)->lh_first);
}
if (waitfor == MNT_WAIT1)
drain_output(vp, 1);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
4678}

4680/*
* This routine is called when we are trying to synchronously flush a
* file. This routine must eliminate any filesystem metadata dependencies
* so that the syncing routine can succeed by pushing the dirty blocks
* associated with the file. If any I/O errors occur, they are returned.
*/
4686int
4687softdep_sync_metadata(struct vop_fsync_args *ap)
4688{
struct vnode *vp = ap->a_vp;
struct pagedep *pagedep;
struct allocdirect *adp;
struct allocindir *aip;
struct buf *bp, *nbp;
struct worklist *wk;
int i, gotit, error, waitfor;

/*
* Check whether this vnode is involved in a filesystem
* that is doing soft dependency processing.
*/
if (!vn_isdisk(vp, NULL((void *)0))) {
if (!DOINGSOFTDEP(vp)((vp)->v_mount->mnt_flag & 0x04000000))
	return (0);
} else
if (vp->v_specmountpointv_un.vu_specinfo->si_mountpoint == NULL((void *)0) ||
    (vp->v_specmountpointv_un.vu_specinfo->si_mountpoint->mnt_flag & MNT_SOFTDEP0x04000000) == 0)
	return (0);
/*
* Ensure that any direct block dependencies have been cleared.
*/
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if ((error = flush_inodedep_deps(VTOI(vp)((struct inode *)(vp)->v_data)->i_fsinode_u.fs, VTOI(vp)((struct inode *)(vp)->v_data)->i_number))) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (error);
}
/*
* For most files, the only metadata dependencies are the
* cylinder group maps that allocate their inode or blocks.
* The block allocation dependencies can be found by traversing
* the dependency lists for any buffers that remain on their
* dirty buffer list. The inode allocation dependency will
* be resolved when the inode is updated with MNT_WAIT.
* This work is done in two passes. The first pass grabs most
* of the buffers and begins asynchronously writing them. The
* only way to wait for these asynchronous writes is to sleep
* on the filesystem vnode which may stay busy for a long time
* if the filesystem is active. So, instead, we make a second
* pass over the dependencies blocking on each write. In the
* usual case we will be blocking against a write that we
* initiated, so when it is done the dependency will have been
* resolved. Thus the second pass is expected to end quickly.
*/
waitfor = MNT_NOWAIT2;
4734top:
/*
* We must wait for any I/O in progress to finish so that
* all potential buffers on the dirty list will be visible.
*/
drain_output(vp, 1);
bp = LIST_FIRST(&vp->v_dirtyblkhd)((&vp->v_dirtyblkhd)->lh_first);
gotit = getdirtybuf(bp, MNT_WAIT1);
if (gotit == 0) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (0);
} else if (gotit == -1)
goto top;
4747loop:
/*
* As we hold the buffer locked, none of its dependencies
* will disappear.
*/
LIST_FOREACH(wk, &bp->b_dep, wk_list)for((wk) = ((&bp->b_dep)->lh_first); (wk)!= ((void *
)0); (wk) = ((wk)->wk_list.le_next)) {
switch (wk->wk_type) {

case D_ALLOCDIRECT4:
	adp = WK_ALLOCDIRECT(wk)((struct allocdirect *)(wk));
	if (adp->ad_statead_list.wk_state & DEPCOMPLETE0x0008)
		break;
	nbp = adp->ad_buf;
	gotit = getdirtybuf(nbp, waitfor);
	if (gotit == 0)
		break;
	else if (gotit == -1)
		goto loop;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (waitfor == MNT_NOWAIT2) {
		bawrite(nbp);
	} else if ((error = VOP_BWRITE(nbp)) != 0) {
		bawrite(bp);
		return (error);
	}
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	break;

case D_ALLOCINDIR6:
	aip = WK_ALLOCINDIR(wk)((struct allocindir *)(wk));
	if (aip->ai_stateai_list.wk_state & DEPCOMPLETE0x0008)
		break;
	nbp = aip->ai_buf;
	gotit = getdirtybuf(nbp, waitfor);
	if (gotit == 0)
		break;
	else if (gotit == -1)
		goto loop;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (waitfor == MNT_NOWAIT2) {
		bawrite(nbp);
	} else if ((error = VOP_BWRITE(nbp)) != 0) {
		bawrite(bp);
		return (error);
	}
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	break;

case D_INDIRDEP5:
restart:

	LIST_FOREACH(aip, &WK_INDIRDEP(wk)->ir_deplisthd, ai_next)for((aip) = ((&((struct indirdep *)(wk))->ir_deplisthd
)->lh_first); (aip)!= ((void *)0); (aip) = ((aip)->ai_next
.le_next)) {
		if (aip->ai_stateai_list.wk_state & DEPCOMPLETE0x0008)
			continue;
		nbp = aip->ai_buf;
		if (getdirtybuf(nbp, MNT_WAIT1) <= 0)
			goto restart;
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		if ((error = VOP_BWRITE(nbp)) != 0) {
			bawrite(bp);
			return (error);
		}
		ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
		goto restart;
	}
	break;

case D_INODEDEP1:
	if ((error = flush_inodedep_deps(WK_INODEDEP(wk)((struct inodedep *)(wk))->id_fs,
	    WK_INODEDEP(wk)((struct inodedep *)(wk))->id_ino)) != 0) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		bawrite(bp);
		return (error);
	}
	break;

case D_PAGEDEP0:
	/*
	 * We are trying to sync a directory that may
	 * have dependencies on both its own metadata
	 * and/or dependencies on the inodes of any
	 * recently allocated files. We walk its diradd
	 * lists pushing out the associated inode.
	 */
	pagedep = WK_PAGEDEP(wk)((struct pagedep *)(wk));
	for (i = 0; i < DAHASHSZ6; i++) {
		if (LIST_FIRST(&pagedep->pd_diraddhd[i])((&pagedep->pd_diraddhd[i])->lh_first) ==
		    NULL((void *)0))
			continue;
		if ((error =
		    flush_pagedep_deps(vp, pagedep->pd_mnt,
				&pagedep->pd_diraddhd[i]))) {
			FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
			bawrite(bp);
			return (error);
		}
	}
	break;

case D_MKDIR11:
	/*
	 * This case should never happen if the vnode has
	 * been properly sync'ed. However, if this function
	 * is used at a place where the vnode has not yet
	 * been sync'ed, this dependency can show up. So,
	 * rather than panic, just flush it.
	 */
	nbp = WK_MKDIR(wk)((struct mkdir *)(wk))->md_buf;
	KASSERT(bp != nbp)((bp != nbp) ? (void)0 : __assert("diagnostic ", "/usr/src/sys/ufs/ffs/ffs_softdep.c"
, 4855, "bp != nbp"));
	gotit = getdirtybuf(nbp, waitfor);
	if (gotit == 0)
		break;
	else if (gotit == -1)
		goto loop;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (waitfor == MNT_NOWAIT2) {
		bawrite(nbp);
	} else if ((error = VOP_BWRITE(nbp)) != 0) {
		bawrite(bp);
		return (error);
	}
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	break;

case D_BMSAFEMAP3:
	/*
	 * This case should never happen if the vnode has
	 * been properly sync'ed. However, if this function
	 * is used at a place where the vnode has not yet
	 * been sync'ed, this dependency can show up. So,
	 * rather than panic, just flush it.
	 */
	nbp = WK_BMSAFEMAP(wk)((struct bmsafemap *)(wk))->sm_buf;
	if (bp == nbp)
		break;
	gotit = getdirtybuf(nbp, waitfor);
	if (gotit == 0)
		break;
	else if (gotit == -1)
		goto loop;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (waitfor == MNT_NOWAIT2) {
		bawrite(nbp);
	} else if ((error = VOP_BWRITE(nbp)) != 0) {
		bawrite(bp);
		return (error);
	}
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	break;

default:
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_sync_metadata: Unknown type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */
}
}
do {
nbp = LIST_NEXT(bp, b_vnbufs)((bp)->b_vnbufs.le_next);
gotit = getdirtybuf(nbp, MNT_WAIT1);
} while (gotit == -1);
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
bawrite(bp);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (nbp != NULL((void *)0)) {
bp = nbp;
goto loop;
}
/*
* The brief unlock is to allow any pent up dependency
* processing to be done. Then proceed with the second pass.
*/
if (waitfor == MNT_NOWAIT2) {
waitfor = MNT_WAIT1;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
goto top;
}

/*
* If we have managed to get rid of all the dirty buffers,
* then we are done. For certain directories and block
* devices, we may need to do further work.
*
* We must wait for any I/O in progress to finish so that
* all potential buffers on the dirty list will be visible.
*/
drain_output(vp, 1);
if (LIST_EMPTY(&vp->v_dirtyblkhd)(((&vp->v_dirtyblkhd)->lh_first) == ((void *)0))) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (0);
}

FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
/*
* If we are trying to sync a block device, some of its buffers may
* contain metadata that cannot be written until the contents of some
* partially written files have been written to disk. The only easy
* way to accomplish this is to sync the entire filesystem (luckily
* this happens rarely).
*/
if (vn_isdisk(vp, NULL((void *)0)) &&
   vp->v_specmountpointv_un.vu_specinfo->si_mountpoint && !VOP_ISLOCKED(vp) &&
   (error = VFS_SYNC(vp->v_specmountpoint, MNT_WAIT, 0, ap->a_cred,(*(vp->v_un.vu_specinfo->si_mountpoint)->mnt_op->
vfs_sync)(vp->v_un.vu_specinfo->si_mountpoint, 1, 0, ap
->a_cred, ap->a_p)
    ap->a_p)(*(vp->v_un.vu_specinfo->si_mountpoint)->mnt_op->
vfs_sync)(vp->v_un.vu_specinfo->si_mountpoint, 1, 0, ap
->a_cred, ap->a_p)) != 0)
return (error);
return (0);
4954}

4956/*
* Flush the dependencies associated with an inodedep.
* Called with splbio blocked.
*/
4960STATIC int
4961flush_inodedep_deps(struct fs *fs, ufsino_t ino)
4962{
struct inodedep *inodedep;
struct allocdirect *adp;
int gotit, error, waitfor;
struct buf *bp;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

/*
* This work is done in two passes. The first pass grabs most
* of the buffers and begins asynchronously writing them. The
* only way to wait for these asynchronous writes is to sleep
* on the filesystem vnode which may stay busy for a long time
* if the filesystem is active. So, instead, we make a second
* pass over the dependencies blocking on each write. In the
* usual case we will be blocking against a write that we
* initiated, so when it is done the dependency will have been
* resolved. Thus the second pass is expected to end quickly.
* We give a brief window at the top of the loop to allow
* any pending I/O to complete.
*/
for (waitfor = MNT_NOWAIT2; ; ) {
retry_ino:
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
if (inodedep_lookup(fs, ino, 0, &inodedep) == 0)
	return (0);
TAILQ_FOREACH(adp, &inodedep->id_inoupdt, ad_next)for((adp) = ((&inodedep->id_inoupdt)->tqh_first); (
adp) != ((void *)0); (adp) = ((adp)->ad_next.tqe_next)) {
	if (adp->ad_statead_list.wk_state & DEPCOMPLETE0x0008)
		continue;
	bp = adp->ad_buf;
	gotit = getdirtybuf(bp, waitfor);
	if (gotit == 0) {
		if (waitfor == MNT_NOWAIT2)
			continue;
		break;
	} else if (gotit == -1)
		goto retry_ino;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (waitfor == MNT_NOWAIT2) {
		bawrite(bp);
	} else if ((error = VOP_BWRITE(bp)) != 0) {
		ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
		return (error);
	}
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	break;
}
if (adp != NULL((void *)0))
	continue;
retry_newino:
TAILQ_FOREACH(adp, &inodedep->id_newinoupdt, ad_next)for((adp) = ((&inodedep->id_newinoupdt)->tqh_first)
; (adp) != ((void *)0); (adp) = ((adp)->ad_next.tqe_next)) {
	if (adp->ad_statead_list.wk_state & DEPCOMPLETE0x0008)
		continue;
	bp = adp->ad_buf;
	gotit = getdirtybuf(bp, waitfor);
	if (gotit == 0) {
		if (waitfor == MNT_NOWAIT2)
			continue;
		break;
	} else if (gotit == -1)
		goto retry_newino;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (waitfor == MNT_NOWAIT2) {
		bawrite(bp);
	} else if ((error = VOP_BWRITE(bp)) != 0) {
		ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
		return (error);
	}
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	break;
}
if (adp != NULL((void *)0))
	continue;
/*
 * If pass2, we are done, otherwise do pass 2.
 */
if (waitfor == MNT_WAIT1)
	break;
waitfor = MNT_WAIT1;
}
/*
* Try freeing inodedep in case all dependencies have been removed.
*/
if (inodedep_lookup(fs, ino, 0, &inodedep) != 0)
(void) free_inodedep(inodedep);
return (0);
5049}

5051/*
* Eliminate a pagedep dependency by flushing out all its diradd dependencies.
* Called with splbio blocked.
*/
5055STATIC int
5056flush_pagedep_deps(struct vnode *pvp, struct mount *mp,
  struct diraddhd *diraddhdp)
5058{
struct proc *p = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc;	/* XXX */
struct worklist *wk;
struct inodedep *inodedep;
struct ufsmount *ump;
struct diradd *dap;
struct vnode *vp;
int gotit, error = 0;
struct buf *bp;
ufsino_t inum;

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

ump = VFSTOUFS(mp)((struct ufsmount *)((mp)->mnt_data));
while ((dap = LIST_FIRST(diraddhdp)((diraddhdp)->lh_first)) != NULL((void *)0)) {
/*
 * Flush ourselves if this directory entry
 * has a MKDIR_PARENT dependency.
 */
if (dap->da_stateda_list.wk_state & MKDIR_PARENT0x0010) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if ((error = UFS_UPDATE(VTOI(pvp), 1)((((struct inode *)(pvp)->v_data))->i_vtbl->iv_update
)((((struct inode *)(pvp)->v_data)), (1))))
		break;
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	/*
	 * If that cleared dependencies, go on to next.
	 */
	if (dap != LIST_FIRST(diraddhdp)((diraddhdp)->lh_first))
		continue;
	if (dap->da_stateda_list.wk_state & MKDIR_PARENT0x0010) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("flush_pagedep_deps: MKDIR_PARENT");
	}
}
/*
 * A newly allocated directory must have its "." and
 * ".." entries written out before its name can be
 * committed in its parent. We do not want or need
 * the full semantics of a synchronous VOP_FSYNC as
 * that may end up here again, once for each directory
 * level in the filesystem. Instead, we push the blocks
 * and wait for them to clear. We have to fsync twice
 * because the first call may choose to defer blocks
 * that still have dependencies, but deferral will
 * happen at most once.
 */
inum = dap->da_newinum;
if (dap->da_stateda_list.wk_state & MKDIR_BODY0x0020) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if ((error = VFS_VGET(mp, inum, &vp)(*(mp)->mnt_op->vfs_vget)(mp, inum, &vp)) != 0)
		break;
	if ((error=VOP_FSYNC(vp, p->p_ucred, MNT_NOWAIT2, p)) ||
	    (error=VOP_FSYNC(vp, p->p_ucred, MNT_NOWAIT2, p))) {
		vput(vp);
		break;
	}
	drain_output(vp, 0);
	/*
	 * If first block is still dirty with a D_MKDIR
	 * dependency then it needs to be written now.
	 */
	for (;;) {
		error = 0;
		ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
		bp = incore(vp, 0);
		if (bp == NULL((void *)0)) {
			FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
			break;
		}
		LIST_FOREACH(wk, &bp->b_dep, wk_list)for((wk) = ((&bp->b_dep)->lh_first); (wk)!= ((void *
)0); (wk) = ((wk)->wk_list.le_next))
			if (wk->wk_type == D_MKDIR11)
				break;
		if (wk) {
			gotit = getdirtybuf(bp, MNT_WAIT1);
			FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
			if (gotit == -1)
				continue;
			if (gotit && (error = bwrite(bp)) != 0)
				break;
		} else
			FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		break;
	}
	vput(vp);
	/* Flushing of first block failed */
	if (error)
		break;
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	/*
	 * If that cleared dependencies, go on to next.
	 */
	if (dap != LIST_FIRST(diraddhdp)((diraddhdp)->lh_first))
		continue;
	if (dap->da_stateda_list.wk_state & MKDIR_BODY0x0020) {
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
		panic("flush_pagedep_deps: MKDIR_BODY");
	}
}
/*
 * Flush the inode on which the directory entry depends.
 * Having accounted for MKDIR_PARENT and MKDIR_BODY above,
 * the only remaining dependency is that the updated inode
 * count must get pushed to disk. The inode has already
 * been pushed into its inode buffer (via VOP_UPDATE) at
 * the time of the reference count change. So we need only
 * locate that buffer, ensure that there will be no rollback
 * caused by a bitmap dependency, then write the inode buffer.
 */
if (inodedep_lookup(ump->um_fsufsmount_u.fs, inum, 0, &inodedep) == 0) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("flush_pagedep_deps: lost inode");
}
/*
 * If the inode still has bitmap dependencies,
 * push them to disk.
 */
retry:
if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) == 0) {
	bp = inodedep->id_buf;
	gotit = getdirtybuf(bp, MNT_WAIT1);
	if (gotit == -1)
		goto retry;
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if (gotit && (error = bwrite(bp)) != 0)
		break;
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
	if (dap != LIST_FIRST(diraddhdp)((diraddhdp)->lh_first))
		continue;
}
/*
 * If the inode is still sitting in a buffer waiting
 * to be written, push it to disk.
 */
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
if ((error = bread(ump->um_devvp,
    fsbtodb(ump->um_fs, ino_to_fsba(ump->um_fs, inum))((((daddr_t)(((((daddr_t)(ump->ufsmount_u.fs)->fs_fpg *
 (((inum) / (ump->ufsmount_u.fs)->fs_ipg))) + (ump->
ufsmount_u.fs)->fs_cgoffset * ((((inum) / (ump->ufsmount_u
.fs)->fs_ipg)) & ~((ump->ufsmount_u.fs)->fs_cgmask
))) + (ump->ufsmount_u.fs)->fs_iblkno) + ((((((inum) % (
ump->ufsmount_u.fs)->fs_ipg) / ((ump->ufsmount_u.fs)
->fs_inopb))) << ((ump->ufsmount_u.fs))->fs_fragshift
))))) << (ump->ufsmount_u.fs)->fs_fsbtodb),
    (int)ump->um_fsufsmount_u.fs->fs_bsize, &bp)) != 0) {
    	brelse(bp);
	break;
}
if ((error = bwrite(bp)) != 0)
	break;
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
/*
 * If we have failed to get rid of all the dependencies
 * then something is seriously wrong.
 */
if (dap == LIST_FIRST(diraddhdp)((diraddhdp)->lh_first)) {
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("flush_pagedep_deps: flush failed");
}
}
if (error)
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
return (error);
5213}

5215/*
* A large burst of file addition or deletion activity can drive the
* memory load excessively high. First attempt to slow things down
* using the techniques below. If that fails, this routine requests
* the offending operations to fall back to running synchronously
* until the memory load returns to a reasonable level.
*/
5222int
5223softdep_slowdown(struct vnode *vp)
5224{
int max_softdeps_hard;

max_softdeps_hard = max_softdeps * 11 / 10;
if (num_dirrem < max_softdeps_hard / 2 &&
   num_inodedep < max_softdeps_hard)
return (0);
stat_sync_limit_hit += 1;
return (1);
5233}

5235/*
* If memory utilization has gotten too high, deliberately slow things
* down and speed up the I/O processing.
*/
5239STATIC int
5240request_cleanup(int resource, int islocked)
5241{
struct proc *p = CURPROC({struct cpu_info *__ci; asm volatile("movq %%gs:%P1,%0" : "=r"
 (__ci) :"n" (__builtin_offsetof(struct cpu_info, ci_self)));
 __ci;})->ci_curproc;
int s;

/*
* We never hold up the filesystem syncer process.
*/
if (p == filesys_syncer || (p->p_flag & P_SOFTDEP0x10000000))
return (0);
/*
* First check to see if the work list has gotten backlogged.
* If it has, co-opt this process to help clean up two entries.
* Because this process may hold inodes locked, we cannot
* handle any remove requests that might block on a locked
* inode as that could lead to deadlock. We set P_SOFTDEP
* to avoid recursively processing the worklist.
*/
if (num_on_worklist > max_softdeps / 10) {
atomic_setbits_intx86_atomic_setbits_u32(&p->p_flag, P_SOFTDEP0x10000000);
if (islocked)
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
process_worklist_item(NULL((void *)0), NULL((void *)0), LK_NOWAIT0x0040UL);
process_worklist_item(NULL((void *)0), NULL((void *)0), LK_NOWAIT0x0040UL);
atomic_clearbits_intx86_atomic_clearbits_u32(&p->p_flag, P_SOFTDEP0x10000000);
stat_worklist_push += 2;
if (islocked)
	ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
return(1);
}
/*
* Next, we attempt to speed up the syncer process. If that
* is successful, then we allow the process to continue.
*/
if (speedup_syncer())
return(0);
/*
* If we are resource constrained on inode dependencies, try
* flushing some dirty inodes. Otherwise, we are constrained
* by file deletions, so try accelerating flushes of directories
* with removal dependencies. We would like to do the cleanup
* here, but we probably hold an inode locked at this point and 
* that might deadlock against one that we try to clean. So,
* the best that we can do is request the syncer daemon to do
* the cleanup for us.
*/
switch (resource) {

case FLUSH_INODES1:
stat_ino_limit_push += 1;
req_clear_inodedeps += 1;
stat_countp = &stat_ino_limit_hit;
break;

case FLUSH_REMOVE2:
stat_blk_limit_push += 1;
req_clear_remove += 1;
stat_countp = &stat_blk_limit_hit;
break;

default:
if (islocked)
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
panic("request_cleanup: unknown type");
}
/*
* Hopefully the syncer daemon will catch up and awaken us.
* We wait at most tickdelay before proceeding in any case.
*/
if (islocked == 0)
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
proc_waiting += 1;
if (!timeout_pending(&proc_waiting_timeout)((&proc_waiting_timeout)->to_flags & 0x02))
timeout_add(&proc_waiting_timeout, tickdelay > 2 ? tickdelay : 2);

s = FREE_LOCK_INTERLOCKED(&lk)((&lk)->lkt_spl);
tsleep_nsec(&proc_waiting, PPAUSE40, "softupdate", INFSLP0xffffffffffffffffULL);
ACQUIRE_LOCK_INTERLOCKED(&lk, s)(&lk)->lkt_spl = (s);
proc_waiting -= 1;
if (islocked == 0)
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return (1);
5322}

5324/*
* Awaken processes pausing in request_cleanup and clear proc_waiting
* to indicate that there is no longer a timer running.
*/
5328void
5329pause_timer(void *arg)
5330{

*stat_countp += 1;
wakeup_one(&proc_waiting)wakeup_n((&proc_waiting), 1);
if (proc_waiting > 0)
timeout_add(&proc_waiting_timeout, tickdelay > 2 ? tickdelay : 2);
5336}

5338/*
* Flush out a directory with at least one removal dependency in an effort to
* reduce the number of dirrem, freefile, and freeblks dependency structures.
*/
5342STATIC void
5343clear_remove(struct proc *p)
5344{
struct pagedep_hashhead *pagedephd;
struct pagedep *pagedep;
static int next = 0;
struct mount *mp;
struct vnode *vp;
int error, cnt;
ufsino_t ino;

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
for (cnt = 0; cnt <= pagedep_hash; cnt++) {
pagedephd = &pagedep_hashtbl[next++];
if (next > pagedep_hash)
	next = 0;
LIST_FOREACH(pagedep, pagedephd, pd_hash)for((pagedep) = ((pagedephd)->lh_first); (pagedep)!= ((void
 *)0); (pagedep) = ((pagedep)->pd_hash.le_next)) {
	if (LIST_FIRST(&pagedep->pd_dirremhd)((&pagedep->pd_dirremhd)->lh_first) == NULL((void *)0))
		continue;
	mp = pagedep->pd_mnt;
	ino = pagedep->pd_ino;
5363#if 0
	if (vn_start_write(NULL((void *)0), &mp, V_NOWAIT) != 0)
		continue;
5366#endif
	FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	if ((error = VFS_VGET(mp, ino, &vp)(*(mp)->mnt_op->vfs_vget)(mp, ino, &vp)) != 0) {
		softdep_error("clear_remove: vget", error);
5370#if 0
		vn_finished_write(mp);
5372#endif
		return;
	}
	if ((error = VOP_FSYNC(vp, p->p_ucred, MNT_NOWAIT2, p)))
		softdep_error("clear_remove: fsync", error);
	drain_output(vp, 0);
	vput(vp);
5379#if 0
	vn_finished_write(mp);
5381#endif
	return;
}
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
5386}

5388/*
* Clear out a block of dirty inodes in an effort to reduce
* the number of inodedep dependency structures.
*/
5392STATIC void
5393clear_inodedeps(struct proc *p)
5394{
struct inodedep_hashhead *inodedephd;
struct inodedep *inodedep = NULL((void *)0);
static int next = 0;
struct mount *mp;
struct vnode *vp;
struct fs *fs;
int error, cnt;
ufsino_t firstino, lastino, ino;

ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
/*
* Pick a random inode dependency to be cleared.
* We will then gather up all the inodes in its block 
* that have dependencies and flush them out.
*/
for (cnt = 0; cnt <= inodedep_hash; cnt++) {
inodedephd = &inodedep_hashtbl[next++];
if (next > inodedep_hash)
	next = 0;
if ((inodedep = LIST_FIRST(inodedephd)((inodedephd)->lh_first)) != NULL((void *)0))
	break;
}
if (inodedep == NULL((void *)0)) {
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return;
}
/*
* Ugly code to find mount point given pointer to superblock.
*/
fs = inodedep->id_fs;
TAILQ_FOREACH(mp, &mountlist, mnt_list)for((mp) = ((&mountlist)->tqh_first); (mp) != ((void *
)0); (mp) = ((mp)->mnt_list.tqe_next))
if ((mp->mnt_flag & MNT_SOFTDEP0x04000000) && fs == VFSTOUFS(mp)((struct ufsmount *)((mp)->mnt_data))->um_fsufsmount_u.fs)
	break;
/*
* Find the last inode in the block with dependencies.
*/
firstino = inodedep->id_ino & ~(INOPB(fs)((fs)->fs_inopb) - 1);
for (lastino = firstino + INOPB(fs)((fs)->fs_inopb) - 1; lastino > firstino; lastino--)
if (inodedep_lookup(fs, lastino, 0, &inodedep) != 0)
	break;
/*
* Asynchronously push all but the last inode with dependencies.
* Synchronously push the last inode with dependencies to ensure
* that the inode block gets written to free up the inodedeps.
*/
for (ino = firstino; ino <= lastino; ino++) {
if (inodedep_lookup(fs, ino, 0, &inodedep) == 0)
	continue;
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
5444#if 0
if (vn_start_write(NULL((void *)0), &mp, V_NOWAIT) != 0)
	continue;
5447#endif
if ((error = VFS_VGET(mp, ino, &vp)(*(mp)->mnt_op->vfs_vget)(mp, ino, &vp)) != 0) {
	softdep_error("clear_inodedeps: vget", error);
5450#if 0
	vn_finished_write(mp);
5452#endif
	return;
}
if (ino == lastino) {
	if ((error = VOP_FSYNC(vp, p->p_ucred, MNT_WAIT1, p)))
		softdep_error("clear_inodedeps: fsync1", error);
} else {
	if ((error = VOP_FSYNC(vp, p->p_ucred, MNT_NOWAIT2, p)))
		softdep_error("clear_inodedeps: fsync2", error);
	drain_output(vp, 0);
}
vput(vp);
5464#if 0
vn_finished_write(mp);
5466#endif
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
}
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
5470}

5472/*
* Function to determine if the buffer has outstanding dependencies
* that will cause a roll-back if the buffer is written. If wantcount
* is set, return number of dependencies, otherwise just yes or no.
*/
5477int
5478softdep_count_dependencies(struct buf *bp, int wantcount, int islocked)
5479{
struct worklist *wk;
struct inodedep *inodedep;
struct indirdep *indirdep;
struct allocindir *aip;
struct pagedep *pagedep;
struct diradd *dap;
int i, retval;

retval = 0;
if (!islocked)
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);
LIST_FOREACH(wk, &bp->b_dep, wk_list)for((wk) = ((&bp->b_dep)->lh_first); (wk)!= ((void *
)0); (wk) = ((wk)->wk_list.le_next)) {
switch (wk->wk_type) {

case D_INODEDEP1:
	inodedep = WK_INODEDEP(wk)((struct inodedep *)(wk));
	if ((inodedep->id_stateid_list.wk_state & DEPCOMPLETE0x0008) == 0) {
		/* bitmap allocation dependency */
		retval += 1;
		if (!wantcount)
			goto out;
	}
	if (TAILQ_FIRST(&inodedep->id_inoupdt)((&inodedep->id_inoupdt)->tqh_first)) {
		/* direct block pointer dependency */
		retval += 1;
		if (!wantcount)
			goto out;
	}
	continue;

case D_INDIRDEP5:
	indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk));

	LIST_FOREACH(aip, &indirdep->ir_deplisthd, ai_next)for((aip) = ((&indirdep->ir_deplisthd)->lh_first); (
aip)!= ((void *)0); (aip) = ((aip)->ai_next.le_next)) {
		/* indirect block pointer dependency */
		retval += 1;
		if (!wantcount)
			goto out;
	}
	continue;

case D_PAGEDEP0:
	pagedep = WK_PAGEDEP(wk)((struct pagedep *)(wk));
	for (i = 0; i < DAHASHSZ6; i++) {

		LIST_FOREACH(dap, &pagedep->pd_diraddhd[i], da_pdlist)for((dap) = ((&pagedep->pd_diraddhd[i])->lh_first);
 (dap)!= ((void *)0); (dap) = ((dap)->da_pdlist.le_next)) {
			/* directory entry dependency */
			retval += 1;
			if (!wantcount)
				goto out;
		}
	}
	continue;

case D_BMSAFEMAP3:
case D_ALLOCDIRECT4:
case D_ALLOCINDIR6:
case D_MKDIR11:
	/* never a dependency on these blocks */
	continue;

default:
	if (!islocked)
		FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
	panic("softdep_check_for_rollback: Unexpected type %s",
	    TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"));
	/* NOTREACHED */
}
}
5549out:
if (!islocked)
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
return retval;
5553}

5555/*
* Acquire exclusive access to a buffer.
* Must be called with splbio blocked.
* Returns:
* 1 if the buffer was acquired and is dirty;
* 0 if the buffer was clean, or we would have slept but had MN_NOWAIT;
* -1 if we slept and may try again (but not with this bp).
*/
5563STATIC int
5564getdirtybuf(struct buf *bp, int waitfor)
5565{
int s;

if (bp == NULL((void *)0))
return (0);

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

if (bp->b_flags & B_BUSY0x00000010) {
if (waitfor != MNT_WAIT1)
	return (0);
bp->b_flags |= B_WANTED0x00010000;
s = FREE_LOCK_INTERLOCKED(&lk)((&lk)->lkt_spl);
tsleep_nsec(bp, PRIBIO16+1, "sdsdty", INFSLP0xffffffffffffffffULL);
ACQUIRE_LOCK_INTERLOCKED(&lk, s)(&lk)->lkt_spl = (s);
return (-1);
}
if ((bp->b_flags & B_DELWRI0x00000080) == 0)
return (0);
bremfreebufcache_take(bp);
buf_acquire(bp);
return (1);
5587}

5589/*
* Wait for pending output on a vnode to complete.
* Must be called with vnode locked.
*/
5593STATIC void
5594drain_output(struct vnode *vp, int islocked)
5595{
int s;

if (!islocked)
ACQUIRE_LOCK(&lk)(&lk)->lkt_spl = splraise(0x3);

splassert(IPL_BIO)do { if (splassert_ctl > 0) { splassert_check(0x3, __func__
); } } while (0);

while (vp->v_numoutput) {
vp->v_bioflag |= VBIOWAIT0x0001;
s = FREE_LOCK_INTERLOCKED(&lk)((&lk)->lkt_spl);
tsleep_nsec(&vp->v_numoutput, PRIBIO16+1, "drain_output", INFSLP0xffffffffffffffffULL);
ACQUIRE_LOCK_INTERLOCKED(&lk, s)(&lk)->lkt_spl = (s);
}
if (!islocked)
FREE_LOCK(&lk)spllower((&lk)->lkt_spl);
5611}

5613/*
* Called whenever a buffer that is being invalidated or reallocated
* contains dependencies. This should only happen if an I/O error has
* occurred. The routine is called with the buffer locked.
*/ 
5618void
5619softdep_deallocate_dependencies(struct buf *bp)
5620{

if ((bp->b_flags & B_ERROR0x00000400) == 0)
panic("softdep_deallocate_dependencies: dangling deps");
softdep_error(bp->b_vp->v_mount->mnt_stat.f_mntonname, bp->b_error);
panic("softdep_deallocate_dependencies: unrecovered I/O error");
5626}

5628/*
* Function to handle asynchronous write errors in the filesystem.
*/
5631void
5632softdep_error(char *func, int error)
5633{

/* XXX should do something better! */
printf("%s: got error %d while accessing filesystem\n", func, error);
5637}

5639#ifdef DDB1
5640#include <machine/db_machdep.h>
5641#include <ddb/db_interface.h>
5642#include <ddb/db_output.h>

5644void
5645softdep_print(struct buf *bp, int full,
  int (*pr)(const char *, ...) __attribute__((__format__(__kprintf__,1,2))))
5647{
struct worklist *wk;

(*pr)("  deps:\n");
LIST_FOREACH(wk, &bp->b_dep, wk_list)for((wk) = ((&bp->b_dep)->lh_first); (wk)!= ((void *
)0); (wk) = ((wk)->wk_list.le_next))
worklist_print(wk, full, pr);
5653}

5655void
5656worklist_print(struct worklist *wk, int full,
  int (*pr)(const char *, ...) __attribute__((__format__(__kprintf__,1,2))))
5658{
struct pagedep *pagedep;
struct inodedep *inodedep;
struct newblk *newblk;
struct bmsafemap *bmsafemap;
struct allocdirect *adp;
struct indirdep *indirdep;
struct allocindir *aip;
struct freefrag *freefrag;
struct freeblks *freeblks;
struct freefile *freefile;
struct diradd *dap;
struct mkdir *mkdir;
struct dirrem *dirrem;
struct newdirblk *newdirblk;
char prefix[33];
int i;

for (prefix[i = 2 * MIN(16, full)(((16)<(full))?(16):(full))] = '\0'; i--; prefix[i] = ' ')
;

(*pr)("%s%s(%p) state %b\n%s", prefix, TYPENAME(wk->wk_type)((unsigned)(wk->wk_type) <= 13 ? softdep_typenames[wk->
wk_type] : "???"), wk,
   wk->wk_state, DEP_BITS"\020\01ATTACHED\02UNDONE\03COMPLETE\04DEPCOMPLETE" "\05MKDIR_PARENT\06MKDIR_BODY\07RMDIR\010DIRCHG\011GOINGAWAY"
 "\012IOSTARTED\013SPACECOUNTED\014NEWBLOCK\016UFS1FMT\020ONWORKLIST", prefix);
switch (wk->wk_type) {
case D_PAGEDEP0:
pagedep = WK_PAGEDEP(wk)((struct pagedep *)(wk));
(*pr)("mount %p ino %u lbn %lld\n", pagedep->pd_mnt,
    pagedep->pd_ino, (long long)pagedep->pd_lbn);
break;
case D_INODEDEP1:
inodedep = WK_INODEDEP(wk)((struct inodedep *)(wk));
(*pr)("fs %p ino %u nlinkdelta %u dino %p\n"
    "%s  bp %p savsz %lld\n", inodedep->id_fs,
    inodedep->id_ino, inodedep->id_nlinkdelta,
    inodedep->id_un.idu_savedino1,
    prefix, inodedep->id_buf, inodedep->id_savedsize);
break;
case D_NEWBLK2:
newblk = WK_NEWBLK(wk)((struct newblk *)(wk));
(*pr)("fs %p newblk %lld state %d bmsafemap %p\n",
    newblk->nb_fs, (long long)newblk->nb_newblkno,
    newblk->nb_state, newblk->nb_bmsafemap);
break;
case D_BMSAFEMAP3:
bmsafemap = WK_BMSAFEMAP(wk)((struct bmsafemap *)(wk));
(*pr)("buf %p\n", bmsafemap->sm_buf);
break;
case D_ALLOCDIRECT4:
adp = WK_ALLOCDIRECT(wk)((struct allocdirect *)(wk));
(*pr)("lbn %lld newlbk %lld oldblk %lld newsize %ld olsize "
    "%ld\n%s  bp %p inodedep %p freefrag %p\n",
    (long long)adp->ad_lbn, (long long)adp->ad_newblkno,
    (long long)adp->ad_oldblkno, adp->ad_newsize,
    adp->ad_oldsize,
    prefix, adp->ad_buf, adp->ad_inodedep, adp->ad_freefrag);
break;
case D_INDIRDEP5:
indirdep = WK_INDIRDEP(wk)((struct indirdep *)(wk));
(*pr)("savedata %p savebp %p\n", indirdep->ir_saveddata,
    indirdep->ir_savebp);
break;
case D_ALLOCINDIR6:
aip = WK_ALLOCINDIR(wk)((struct allocindir *)(wk));
(*pr)("off %d newblk %lld oldblk %lld freefrag %p\n"
    "%s  indirdep %p buf %p\n", aip->ai_offset,
    (long long)aip->ai_newblkno, (long long)aip->ai_oldblkno,
    aip->ai_freefrag, prefix, aip->ai_indirdep, aip->ai_buf);
break;
case D_FREEFRAG7:
freefrag = WK_FREEFRAG(wk)((struct freefrag *)(wk));
(*pr)("vnode %p mp %p blkno %lld fsize %ld ino %u\n",
    freefrag->ff_devvp, freefrag->ff_mnt,
    (long long)freefrag->ff_blkno, freefrag->ff_fragsize,
    freefrag->ff_inum);
break;
case D_FREEBLKS8:
freeblks = WK_FREEBLKS(wk)((struct freeblks *)(wk));
(*pr)("previno %u devvp %p mp %p oldsz %lld newsz %lld\n"
    "%s  chkcnt %d uid %d\n", freeblks->fb_previousinum,
    freeblks->fb_devvp, freeblks->fb_mnt, freeblks->fb_oldsize,
    freeblks->fb_newsize,
    prefix, freeblks->fb_chkcnt, freeblks->fb_uid);
break;
case D_FREEFILE9:
freefile = WK_FREEFILE(wk)((struct freefile *)(wk));
(*pr)("mode %x oldino %u vnode %p mp %p\n", freefile->fx_mode,
    freefile->fx_oldinum, freefile->fx_devvp, freefile->fx_mnt);
break;
case D_DIRADD10:
dap = WK_DIRADD(wk)((struct diradd *)(wk));
(*pr)("off %d ino %u da_un %p\n", dap->da_offset, 
    dap->da_newinum, dap->da_un.dau_previous);
break;
case D_MKDIR11:
mkdir = WK_MKDIR(wk)((struct mkdir *)(wk));
(*pr)("diradd %p bp %p\n", mkdir->md_diradd, mkdir->md_buf);
break;
case D_DIRREM12:
dirrem = WK_DIRREM(wk)((struct dirrem *)(wk));
(*pr)("mp %p ino %u dm_un %p\n", dirrem->dm_mnt, 
    dirrem->dm_oldinum, dirrem->dm_un.dmu_pagedep);
break;
case D_NEWDIRBLK13:
newdirblk = WK_NEWDIRBLK(wk)((struct newdirblk *)(wk));
(*pr)("pagedep %p\n", newdirblk->db_pagedep);
break;
}
5765}
5766#endif