ec383244a478988a7516fa8dd9eb56d8304ca4d8
1 /* Include file cached obstack implementation.
2 Written by Fred Fish (fnf@cygnus.com)
3 Copyright 1995 Free Software Foundation, Inc.
5 This file is part of GDB.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
25 #define BCACHE_HASHLENGTH 12 /* Number of bits in hash value */
26 #define BCACHE_HASHSIZE (1 << BCACHE_HASHLENGTH)
27 #define BCACHE_MAXLENGTH 128
29 /* Note that the user data is stored in data[]. Since it can be any type,
30 it needs to have the same alignment as the most strict alignment of
31 any type on the host machine. So do it the same way obstack does. */
35 struct hashlink
*next
;
44 /* BCACHE_DATA is used to get the address of the cached data. */
46 #define BCACHE_DATA(p) ((p)->d.data)
48 /* BCACHE_DATA_ALIGNMENT is used to get the offset of the start of
49 cached data within the hashlink struct. This value, plus the
50 size of the cached data, is the amount of space to allocate for
51 a hashlink struct to hold the next pointer and the data. */
53 #define BCACHE_DATA_ALIGNMENT \
54 (((char *) BCACHE_DATA((struct hashlink*) 0) - (char *) 0))
59 struct hashlink
**indextable
[BCACHE_MAXLENGTH
];
68 bcache
PARAMS ((void *bytes
, int count
, struct bcache
* bcachep
));
71 print_bcache_statistics
PARAMS ((struct bcache
*, char *));