1*8fd5b250Sreinoud /* $NetBSD: dirhash.h,v 1.6 2013/07/07 19:31:26 reinoud Exp $ */ 2fec4bb5bSreinoud 3fec4bb5bSreinoud /* 4fec4bb5bSreinoud * Copyright (c) 2008 Reinoud Zandijk 5fec4bb5bSreinoud * All rights reserved. 6fec4bb5bSreinoud * 7fec4bb5bSreinoud * Redistribution and use in source and binary forms, with or without 8fec4bb5bSreinoud * modification, are permitted provided that the following conditions 9fec4bb5bSreinoud * are met: 10fec4bb5bSreinoud * 1. Redistributions of source code must retain the above copyright 11fec4bb5bSreinoud * notice, this list of conditions and the following disclaimer. 12fec4bb5bSreinoud * 2. Redistributions in binary form must reproduce the above copyright 13fec4bb5bSreinoud * notice, this list of conditions and the following disclaimer in the 14fec4bb5bSreinoud * documentation and/or other materials provided with the distribution. 15fec4bb5bSreinoud * 16fec4bb5bSreinoud * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 17fec4bb5bSreinoud * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 18fec4bb5bSreinoud * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 19fec4bb5bSreinoud * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 20fec4bb5bSreinoud * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 21fec4bb5bSreinoud * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 22fec4bb5bSreinoud * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 23fec4bb5bSreinoud * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 24fec4bb5bSreinoud * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 25fec4bb5bSreinoud * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 26fec4bb5bSreinoud */ 27fec4bb5bSreinoud 2837d31bebSreinoud #ifndef _SYS_DIRHASH_H_ 2937d31bebSreinoud #define _SYS_DIRHASH_H_ 3037d31bebSreinoud 31fec4bb5bSreinoud #include <sys/queue.h> 32fec4bb5bSreinoud #include <sys/dirent.h> 33fec4bb5bSreinoud 34fec4bb5bSreinoud #ifndef DIRHASH_SIZE 35fec4bb5bSreinoud #define DIRHASH_SIZE (1024*1024) 36fec4bb5bSreinoud #endif 37fec4bb5bSreinoud 38fec4bb5bSreinoud #define DIRHASH_HASHBITS 5 39fec4bb5bSreinoud #define DIRHASH_HASHSIZE (1 << DIRHASH_HASHBITS) 40fec4bb5bSreinoud #define DIRHASH_HASHMASK (DIRHASH_HASHSIZE - 1) 41fec4bb5bSreinoud 42fec4bb5bSreinoud /* dirent's d_namlen is to avoid useless costly fid->dirent translations */ 43fec4bb5bSreinoud struct dirhash_entry { 44fec4bb5bSreinoud uint32_t hashvalue; 45fec4bb5bSreinoud uint64_t offset; 46fec4bb5bSreinoud uint32_t d_namlen; 47fec4bb5bSreinoud uint32_t entry_size; 48fec4bb5bSreinoud LIST_ENTRY(dirhash_entry) next; 49fec4bb5bSreinoud }; 50fec4bb5bSreinoud 51fec4bb5bSreinoud struct dirhash { 52fec4bb5bSreinoud uint32_t flags; 53fec4bb5bSreinoud uint32_t size; /* in bytes */ 54fec4bb5bSreinoud uint32_t refcnt; 55*8fd5b250Sreinoud uint32_t num_files; 56fec4bb5bSreinoud LIST_HEAD(, dirhash_entry) entries[DIRHASH_HASHSIZE]; 57fec4bb5bSreinoud LIST_HEAD(, dirhash_entry) free_entries; 58fec4bb5bSreinoud TAILQ_ENTRY(dirhash) next; 59fec4bb5bSreinoud }; 60fec4bb5bSreinoud 61fec4bb5bSreinoud #define DIRH_PURGED 0x0001 /* dirhash has been purged */ 62fec4bb5bSreinoud #define DIRH_COMPLETE 0x0002 /* dirhash is complete */ 63fec4bb5bSreinoud #define DIRH_BROKEN 0x0004 /* dirhash is broken on readin */ 647cd3ce23Sreinoud #define DIRH_COMPACTABLE 0x0008 /* free space can be compacted */ 657cd3ce23Sreinoud #define DIRH_FLAGBITS "\10\1PURGED\2COMPLETE\3BROKEN\4COMPACTABLE" 66fec4bb5bSreinoud 67fec4bb5bSreinoud void dirhash_init(void); 68fec4bb5bSreinoud /* void dirhash_finish(void); */ 69fec4bb5bSreinoud 701a7b9dccSrmind void dirhash_purge(struct dirhash **); 711a7b9dccSrmind void dirhash_purge_entries(struct dirhash *); 721a7b9dccSrmind void dirhash_get(struct dirhash **); 731a7b9dccSrmind void dirhash_put(struct dirhash *); 741a7b9dccSrmind void dirhash_enter(struct dirhash *, struct dirent *, uint64_t, 751a7b9dccSrmind uint32_t, int); 761a7b9dccSrmind void dirhash_enter_freed(struct dirhash *, uint64_t, uint32_t); 771a7b9dccSrmind void dirhash_remove(struct dirhash *, struct dirent *dirent, 781a7b9dccSrmind uint64_t, uint32_t); 791a7b9dccSrmind int dirhash_lookup(struct dirhash *, const char *, int, 801a7b9dccSrmind struct dirhash_entry **); 811a7b9dccSrmind int dirhash_lookup_freed(struct dirhash *, uint32_t, 821a7b9dccSrmind struct dirhash_entry **); 83*8fd5b250Sreinoud bool dirhash_dir_isempty(struct dirhash *dirh); 84fec4bb5bSreinoud 8537d31bebSreinoud #endif /* _SYS_DIRHASH_H_ */ 86