| hash.h (138433) | hash.h (138435) |
|---|---|
| 1/* 2 * Copyright (c) 1988, 1989, 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * Copyright (c) 1988, 1989 by Adam de Boor 5 * Copyright (c) 1989 by Berkeley Softworks 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by --- 23 unchanged lines hidden (view full) --- 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * @(#)hash.h 8.1 (Berkeley) 6/6/93 | 1/* 2 * Copyright (c) 1988, 1989, 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * Copyright (c) 1988, 1989 by Adam de Boor 5 * Copyright (c) 1989 by Berkeley Softworks 6 * All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by --- 23 unchanged lines hidden (view full) --- 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 * 39 * @(#)hash.h 8.1 (Berkeley) 6/6/93 |
| 40 * $FreeBSD: head/usr.bin/make/hash.h 138433 2004-12-06 08:51:34Z harti $ | 40 * $FreeBSD: head/usr.bin/make/hash.h 138435 2004-12-06 08:56:30Z harti $ |
| 41 */ 42 43/* hash.h -- 44 * 45 * This file contains definitions used by the hash module, 46 * which maintains hash tables. 47 */ 48 --- 43 unchanged lines hidden (view full) --- 92 93/* 94 * Hash_Size(n) returns the number of words in an object of n bytes 95 */ 96#define Hash_Size(n) (((n) + sizeof(int) - 1) / sizeof(int)) 97 98void Hash_InitTable(Hash_Table *, int); 99void Hash_DeleteTable(Hash_Table *); | 41 */ 42 43/* hash.h -- 44 * 45 * This file contains definitions used by the hash module, 46 * which maintains hash tables. 47 */ 48 --- 43 unchanged lines hidden (view full) --- 92 93/* 94 * Hash_Size(n) returns the number of words in an object of n bytes 95 */ 96#define Hash_Size(n) (((n) + sizeof(int) - 1) / sizeof(int)) 97 98void Hash_InitTable(Hash_Table *, int); 99void Hash_DeleteTable(Hash_Table *); |
| 100Hash_Entry *Hash_FindEntry(Hash_Table *, char *); 101Hash_Entry *Hash_CreateEntry(Hash_Table *, char *, Boolean *); | 100Hash_Entry *Hash_FindEntry(const Hash_Table *, const char *); 101Hash_Entry *Hash_CreateEntry(Hash_Table *, const char *, Boolean *); |
| 102void Hash_DeleteEntry(Hash_Table *, Hash_Entry *); 103Hash_Entry *Hash_EnumFirst(Hash_Table *, Hash_Search *); 104Hash_Entry *Hash_EnumNext(Hash_Search *); 105 106#endif /* _HASH */ | 102void Hash_DeleteEntry(Hash_Table *, Hash_Entry *); 103Hash_Entry *Hash_EnumFirst(Hash_Table *, Hash_Search *); 104Hash_Entry *Hash_EnumNext(Hash_Search *); 105 106#endif /* _HASH */ |