Peter Wemm 439fea92c2 Use the same API as the example code. ... Allow the initial hash value to be passed in, as the examples do. Incrementally hash in the dvp->v_id (using the official api) rather than add it. This seems to help power-of-two predictable filename trees where the filenames repeat on a power-of-two cycle and the directory trees have power-of-two components in it. The simple add then mask was causing things like 12000+ entry collision chains while most other entries have between 0 and 3 entries each. This way seems to improve things.		2001-03-20 02:10:18 +00:00
..
bootp_subr.c
krpc_subr.c
krpc.h
nfs_bio.c
nfs_common.c
nfs_common.h
nfs_node.c
nfs_nqlease.c
nfs_serv.c
nfs_socket.c
nfs_srvcache.c
nfs_subs.c
nfs_syscalls.c
nfs_vfsops.c
nfs_vnops.c
nfs.h
nfsdiskless.h
nfsm_subs.h
nfsmount.h
nfsnode.h
nfsproto.h
nfsrtt.h
nfsrvcache.h
nfsv2.h
nqnfs.h
rpcv2.h
xdr_subs.h