2 * Copyright (c) 1990 The Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid
[] = "@(#)buf.c 5.7 (Berkeley) 3/12/91";
39 #endif /* LIBC_SCCS and not lint */
41 /******************************************************************************
46 Contains buffer management
57 ******************************************************************************/
58 #include <sys/param.h>
69 static BUFHEAD
*newbuf();
71 /* Unlink B from its place in the lru */
72 #define BUF_REMOVE(B) \
74 B->prev->next = B->next; \
75 B->next->prev = B->prev; \
78 /* Insert B after P */
79 #define BUF_INSERT(B,P) \
87 #define MRU hashp->bufhead.next
88 #define LRU hashp->bufhead.prev
90 #define MRU_INSERT(B) BUF_INSERT(B,(&hashp->bufhead))
91 #define LRU_INSERT(B) BUF_INSERT(B,LRU)
94 We are looking for a buffer with address "addr".
95 If prev_bp is NULL, then address is a bucket index.
96 If prev_bp is not NULL, then it points to the page previous
97 to an overflow page that we are trying to find.
99 CAVEAT: The buffer header accessed via prev_bp's ovfl field
100 may no longer be valid. Therefore, you must always verify that
101 its address matches the address you are seeking.
104 __get_buf ( addr
, prev_bp
, newpage
)
107 int newpage
; /* If prev_bp is set, indicates that this is
108 a new overflow page */
110 register int segment_ndx
;
111 register BUFHEAD
*bp
;
112 register unsigned is_disk
= 0;
113 register unsigned is_disk_mask
= 0;
118 if ( !bp
|| (bp
->addr
!= addr
) ) bp
= NULL
;
119 if ( !newpage
) is_disk
= BUF_DISK
;
122 /* Grab buffer out of directory */
123 segment_ndx
= addr
& ( hashp
->SGSIZE
- 1 );
126 * valid segment ensured by __call_hash()
128 segp
= hashp
->dir
[addr
>> hashp
->SSHIFT
];
130 assert(segp
!= NULL
);
132 bp
= PTROF(segp
[segment_ndx
]);
133 is_disk_mask
= ISDISK(segp
[segment_ndx
]);
134 is_disk
= is_disk_mask
|| !hashp
->new_file
;
138 bp
= newbuf ( addr
, prev_bp
);
139 if ( !bp
|| __get_page ( bp
->page
, addr
, !prev_bp
, is_disk
, 0 )) {
143 segp
[segment_ndx
] = (BUFHEAD
*)((unsigned)bp
| is_disk_mask
);
153 We need a buffer for this page. Either allocate one, or
154 evict a resident one (if we have as many buffers as we're
155 allowed) and put this one in.
157 If newbuf finds an error (returning NULL), it also sets errno
160 newbuf ( addr
, prev_bp
)
164 register BUFHEAD
*bp
; /* The buffer we're going to use */
165 register BUFHEAD
*xbp
; /* Temp pointer */
166 register BUFHEAD
*next_xbp
;
175 If LRU buffer is pinned, the buffer pool is too small.
176 We need to allocate more buffers
178 if ( hashp
->nbufs
|| (bp
->flags
& BUF_PIN
) ) {
179 /* Allocate a new one */
180 bp
= (BUFHEAD
*)malloc ( sizeof (struct _bufhead
) );
181 if ( !bp
|| !(bp
->page
= (char *)malloc ( hashp
->BSIZE
)) ) {
186 /* Kick someone out */
189 If this is an overflow page with addr 0, it's already
190 been flushed back in an overflow chain and initialized
192 if ( (bp
->addr
!= 0) || (bp
->flags
& BUF_BUCKET
) ) {
194 Set oaddr before __put_page so that you get it
195 before bytes are swapped
197 shortp
= (u_short
*)bp
->page
;
199 oaddr
= shortp
[shortp
[0]-1];
201 if ( (bp
->flags
& BUF_MOD
) &&
202 __put_page(bp
->page
, bp
->addr
, (int)IS_BUCKET(bp
->flags
), 0) ) {
206 Update the pointer to this page (i.e. invalidate it).
208 If this is a new file (i.e. we created it at open time),
209 make sure that we mark pages which have been written to
210 disk so we retrieve them from disk later, rather than
211 allocating new pages.
214 if ( IS_BUCKET(bp
->flags
)) {
215 segment_ndx
= bp
->addr
& ( hashp
->SGSIZE
- 1 );
217 segp
= hashp
->dir
[bp
->addr
>> hashp
->SSHIFT
];
219 assert(segp
!= NULL
);
221 if ( hashp
->new_file
&&
222 ((bp
->flags
& BUF_MOD
) || ISDISK(segp
[segment_ndx
])) ) {
223 segp
[segment_ndx
] = (BUFHEAD
*)BUF_DISK
;
224 } else segp
[segment_ndx
] = NULL
;
228 Since overflow pages can only be access by means of
229 their bucket, free overflow pages associated with this
232 for ( xbp
= bp
; xbp
->ovfl
; ) {
234 next_xbp
= xbp
->ovfl
;
238 /* Check that ovfl pointer is up date */
239 if ( IS_BUCKET(xbp
->flags
) || (oaddr
!= xbp
->addr
) ) break;
241 shortp
= (u_short
*)xbp
->page
;
243 oaddr
= shortp
[shortp
[0]-1]; /* set before __put_page */
245 if ( (xbp
->flags
& BUF_MOD
) &&
246 __put_page ( xbp
->page
, xbp
->addr
, 0, 0 ) ) {
257 /* Now assign this buffer */
260 fprintf ( stderr
, "NEWBUF1: %d->ovfl was %d is now %d\n", bp
->addr
,
261 (bp
->ovfl
?bp
->ovfl
->addr
:0), 0);
266 If prev_bp is set, this is an overflow page, hook it in to the
267 buffer overflow links
270 fprintf ( stderr
, "NEWBUF2: %d->ovfl was %d is now %d\n", prev_bp
->addr
,
271 (prev_bp
->ovfl
?bp
->ovfl
->addr
:0),
276 } else bp
->flags
= BUF_BUCKET
;
282 __buf_init ( nbytes
)
286 BUFHEAD
*bfp
= &(hashp
->bufhead
);
288 npages
= (nbytes
+ hashp
->BSIZE
- 1) >> hashp
->BSHIFT
;
289 npages
= MAX ( npages
, MIN_BUFFERS
);
291 hashp
->nbufs
= npages
;
295 This space is calloc'd so these are already null
305 __buf_free ( do_free
, to_disk
)
311 /* Need to make sure that buffer manager has been initialized */
316 for ( bp
= LRU
; bp
!= &hashp
->bufhead
; ) {
317 /* Check that the buffer is valid */
318 if ( bp
->addr
|| IS_BUCKET(bp
->flags
) ) {
319 if ( to_disk
&& (bp
->flags
& BUF_MOD
) &&
320 __put_page (bp
->page
, bp
->addr
, IS_BUCKET(bp
->flags
), 0 )) {
325 /* Check if we are freeing stuff */
327 if ( bp
->page
) free ( bp
->page
);
331 } else bp
= bp
->prev
;