OLD | NEW |
1 /*- | 1 /*- |
2 * Copyright (c) 1990, 1993, 1994 | 2 * Copyright (c) 1990, 1993, 1994 |
3 * The Regents of the University of California. All rights reserved. | 3 * The Regents of the University of California. All rights reserved. |
4 * | 4 * |
5 * This code is derived from software contributed to Berkeley by | 5 * This code is derived from software contributed to Berkeley by |
6 * Margo Seltzer. | 6 * Margo Seltzer. |
7 * | 7 * |
8 * Redistribution and use in source and binary forms, with or without | 8 * Redistribution and use in source and binary forms, with or without |
9 * modification, are permitted provided that the following conditions | 9 * modification, are permitted provided that the following conditions |
10 * are met: | 10 * are met: |
11 * 1. Redistributions of source code must retain the above copyright | 11 * 1. Redistributions of source code must retain the above copyright |
12 * notice, this list of conditions and the following disclaimer. | 12 * notice, this list of conditions and the following disclaimer. |
13 * 2. Redistributions in binary form must reproduce the above copyright | 13 * 2. Redistributions in binary form must reproduce the above copyright |
14 * notice, this list of conditions and the following disclaimer in the | 14 * notice, this list of conditions and the following disclaimer in the |
15 * documentation and/or other materials provided with the distribution. | 15 * documentation and/or other materials provided with the distribution. |
16 * 3. ***REMOVED*** - see | 16 * 3. ***REMOVED*** - see |
17 * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change | 17 * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change |
18 * 4. Neither the name of the University nor the names of its contributors | 18 * 4. Neither the name of the University nor the names of its contributors |
19 * may be used to endorse or promote products derived from this software | 19 * may be used to endorse or promote products derived from this software |
20 * without specific prior written permission. | 20 * without specific prior written permission. |
21 * | 21 * |
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
(...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
66 * We prohibit entering a pair on a page unless there is also room to append | 66 * We prohibit entering a pair on a page unless there is also room to append |
67 * an overflow page. The reason for this it that you can get in a situation | 67 * an overflow page. The reason for this it that you can get in a situation |
68 * where a single key/data pair fits on a page, but you can't append an | 68 * where a single key/data pair fits on a page, but you can't append an |
69 * overflow page and later you'd have to split the key/data and handle like | 69 * overflow page and later you'd have to split the key/data and handle like |
70 * a big pair. | 70 * a big pair. |
71 * You might as well do this up front. | 71 * You might as well do this up front. |
72 */ | 72 */ |
73 #ifndef PAGE_H | 73 #ifndef PAGE_H |
74 #define PAGE_H | 74 #define PAGE_H |
75 | 75 |
76 #define»PAIRSIZE(K,D)» (2*sizeof(uint16) + (K)->size + (D)->size) | 76 #define PAIRSIZE(K, D) (2 * sizeof(uint16) + (K)->size + (D)->size) |
77 #define BIGOVERHEAD» (4*sizeof(uint16)) | 77 #define BIGOVERHEAD (4 * sizeof(uint16)) |
78 #define KEYSIZE(K)» (4*sizeof(uint16) + (K)->size); | 78 #define KEYSIZE(K) (4 * sizeof(uint16) + (K)->size); |
79 #define OVFLSIZE» (2*sizeof(uint16)) | 79 #define OVFLSIZE (2 * sizeof(uint16)) |
80 #define FREESPACE(P)» ((P)[(P)[0]+1]) | 80 #define FREESPACE(P) ((P)[(P)[0] + 1]) |
81 #define»OFFSET(P)» ((P)[(P)[0]+2]) | 81 #define OFFSET(P) ((P)[(P)[0] + 2]) |
82 #define PAIRFITS(P,K,D) \ | 82 #define PAIRFITS(P, K, D) \ |
83 » (((P)[2] >= REAL_KEY) && \ | 83 (((P)[2] >= REAL_KEY) && (PAIRSIZE((K), (D)) + OVFLSIZE) <= FREESPACE((P))) |
84 » (PAIRSIZE((K),(D)) + OVFLSIZE) <= FREESPACE((P))) | 84 #define PAGE_META(N) (((N) + 3) * sizeof(uint16)) |
85 #define PAGE_META(N)» (((N)+3) * sizeof(uint16)) | |
86 | 85 |
87 typedef struct { | 86 typedef struct { |
88 » BUFHEAD *newp; | 87 BUFHEAD *newp; |
89 » BUFHEAD *oldp; | 88 BUFHEAD *oldp; |
90 » BUFHEAD *nextp; | 89 BUFHEAD *nextp; |
91 » uint16 next_addr; | 90 uint16 next_addr; |
92 } SPLIT_RETURN; | 91 } SPLIT_RETURN; |
93 #endif | 92 #endif |
94 | |
OLD | NEW |