Deleted Added
sdiff udiff text old ( 1541 ) new ( 1549 )
full compact
null_subr.c (1541) null_subr.c (1549)
1/*
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software donated to Berkeley by
6 * Jan-Simon Pendry.
7 *
8 * Redistribution and use in source and binary forms, with or without

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

68 struct null_node *ac_back;
69};
70
71static struct null_node_cache null_node_cache[NNULLNODECACHE];
72
73/*
74 * Initialise cache headers
75 */
1/*
2 * Copyright (c) 1992, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software donated to Berkeley by
6 * Jan-Simon Pendry.
7 *
8 * Redistribution and use in source and binary forms, with or without

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

68 struct null_node *ac_back;
69};
70
71static struct null_node_cache null_node_cache[NNULLNODECACHE];
72
73/*
74 * Initialise cache headers
75 */
76int
76nullfs_init()
77{
78 struct null_node_cache *ac;
79#ifdef NULLFS_DIAGNOSTIC
80 printf("nullfs_init\n"); /* printed during system boot */
81#endif
82
83 for (ac = null_node_cache; ac < null_node_cache + NNULLNODECACHE; ac++)
84 ac->ac_forw = ac->ac_back = (struct null_node *) ac;
77nullfs_init()
78{
79 struct null_node_cache *ac;
80#ifdef NULLFS_DIAGNOSTIC
81 printf("nullfs_init\n"); /* printed during system boot */
82#endif
83
84 for (ac = null_node_cache; ac < null_node_cache + NNULLNODECACHE; ac++)
85 ac->ac_forw = ac->ac_back = (struct null_node *) ac;
86 return (0);
85}
86
87/*
88 * Compute hash list for given lower vnode
89 */
90static struct null_node_cache *
91null_node_hash(lowervp)
92struct vnode *lowervp;

--- 201 unchanged lines hidden --- 		87}
88
89/*
90 * Compute hash list for given lower vnode
91 */
92static struct null_node_cache *
93null_node_hash(lowervp)
94struct vnode *lowervp;

--- 201 unchanged lines hidden ---