security/nss/lib/dbm/include/mpool.h@6474c204b198 (annotated)
security/nss/lib/dbm/include/mpool.h
Wed, 31 Dec 2014 06:09:35 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Wed, 31 Dec 2014 06:09:35 +0100
- changeset 0
- 6474c204b198
- permissions
- -rw-r--r--
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
| michael@0 | 1 | /*- |
| michael@0 | 2 | * Copyright (c) 1991, 1993, 1994 |
| michael@0 | 3 | * The Regents of the University of California. All rights reserved. |
| michael@0 | 4 | * |
| michael@0 | 5 | * Redistribution and use in source and binary forms, with or without |
| michael@0 | 6 | * modification, are permitted provided that the following conditions |
| michael@0 | 7 | * are met: |
| michael@0 | 8 | * 1. Redistributions of source code must retain the above copyright |
| michael@0 | 9 | * notice, this list of conditions and the following disclaimer. |
| michael@0 | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
| michael@0 | 11 | * notice, this list of conditions and the following disclaimer in the |
| michael@0 | 12 | * documentation and/or other materials provided with the distribution. |
| michael@0 | 13 | * 3. ***REMOVED*** - see |
| michael@0 | 14 | * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change |
| michael@0 | 15 | * 4. Neither the name of the University nor the names of its contributors |
| michael@0 | 16 | * may be used to endorse or promote products derived from this software |
| michael@0 | 17 | * without specific prior written permission. |
| michael@0 | 18 | * |
| michael@0 | 19 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
| michael@0 | 20 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| michael@0 | 21 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| michael@0 | 22 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
| michael@0 | 23 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| michael@0 | 24 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| michael@0 | 25 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| michael@0 | 26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| michael@0 | 27 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| michael@0 | 28 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| michael@0 | 29 | * SUCH DAMAGE. |
| michael@0 | 30 | * |
| michael@0 | 31 | * @(#)mpool.h 8.2 (Berkeley) 7/14/94 |
| michael@0 | 32 | */ |
| michael@0 | 33 | |
| michael@0 | 34 | #include <sys/queue.h> |
| michael@0 | 35 | |
| michael@0 | 36 | /* |
| michael@0 | 37 | * The memory pool scheme is a simple one. Each in-memory page is referenced |
| michael@0 | 38 | * by a bucket which is threaded in up to two of three ways. All active pages |
| michael@0 | 39 | * are threaded on a hash chain (hashed by page number) and an lru chain. |
| michael@0 | 40 | * Inactive pages are threaded on a free chain. Each reference to a memory |
| michael@0 | 41 | * pool is handed an opaque MPOOL cookie which stores all of this information. |
| michael@0 | 42 | */ |
| michael@0 | 43 | #define HASHSIZE 128 |
| michael@0 | 44 | #define HASHKEY(pgno) ((pgno - 1) % HASHSIZE) |
| michael@0 | 45 | |
| michael@0 | 46 | /* The BKT structures are the elements of the queues. */ |
| michael@0 | 47 | typedef struct _bkt { |
| michael@0 | 48 | CIRCLEQ_ENTRY(_bkt) hq; /* hash queue */ |
| michael@0 | 49 | CIRCLEQ_ENTRY(_bkt) q; /* lru queue */ |
| michael@0 | 50 | void *page; /* page */ |
| michael@0 | 51 | pgno_t pgno; /* page number */ |
| michael@0 | 52 | |
| michael@0 | 53 | #define MPOOL_DIRTY 0x01 /* page needs to be written */ |
| michael@0 | 54 | #define MPOOL_PINNED 0x02 /* page is pinned into memory */ |
| michael@0 | 55 | uint8 flags; /* flags */ |
| michael@0 | 56 | } BKT; |
| michael@0 | 57 | |
| michael@0 | 58 | typedef struct MPOOL { |
| michael@0 | 59 | CIRCLEQ_HEAD(_lqh, _bkt) lqh; /* lru queue head */ |
| michael@0 | 60 | /* hash queue array */ |
| michael@0 | 61 | CIRCLEQ_HEAD(_hqh, _bkt) hqh[HASHSIZE]; |
| michael@0 | 62 | pgno_t curcache; /* current number of cached pages */ |
| michael@0 | 63 | pgno_t maxcache; /* max number of cached pages */ |
| michael@0 | 64 | pgno_t npages; /* number of pages in the file */ |
| michael@0 | 65 | uint32 pagesize; /* file page size */ |
| michael@0 | 66 | int fd; /* file descriptor */ |
| michael@0 | 67 | /* page in conversion routine */ |
| michael@0 | 68 | void (*pgin) (void *, pgno_t, void *); |
| michael@0 | 69 | /* page out conversion routine */ |
| michael@0 | 70 | void (*pgout) (void *, pgno_t, void *); |
| michael@0 | 71 | void *pgcookie; /* cookie for page in/out routines */ |
| michael@0 | 72 | #ifdef STATISTICS |
| michael@0 | 73 | uint32 cachehit; |
| michael@0 | 74 | uint32 cachemiss; |
| michael@0 | 75 | uint32 pagealloc; |
| michael@0 | 76 | uint32 pageflush; |
| michael@0 | 77 | uint32 pageget; |
| michael@0 | 78 | uint32 pagenew; |
| michael@0 | 79 | uint32 pageput; |
| michael@0 | 80 | uint32 pageread; |
| michael@0 | 81 | uint32 pagewrite; |
| michael@0 | 82 | #endif |
| michael@0 | 83 | } MPOOL; |
| michael@0 | 84 | |
| michael@0 | 85 | __BEGIN_DECLS |
| michael@0 | 86 | MPOOL *mpool_open (void *, int, pgno_t, pgno_t); |
| michael@0 | 87 | void mpool_filter (MPOOL *, void (*)(void *, pgno_t, void *), |
| michael@0 | 88 | void (*)(void *, pgno_t, void *), void *); |
| michael@0 | 89 | void *mpool_new (MPOOL *, pgno_t *); |
| michael@0 | 90 | void *mpool_get (MPOOL *, pgno_t, uint); |
| michael@0 | 91 | int mpool_put (MPOOL *, void *, uint); |
| michael@0 | 92 | int mpool_sync (MPOOL *); |
| michael@0 | 93 | int mpool_close (MPOOL *); |
| michael@0 | 94 | #ifdef STATISTICS |
| michael@0 | 95 | void mpool_stat (MPOOL *); |
| michael@0 | 96 | #endif |
| michael@0 | 97 | __END_DECLS |
