]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blame - gdb/bcache.h
import gdb-1999-07-07 post reformat
[thirdparty/binutils-gdb.git] / gdb / bcache.h
CommitLineData
c906108c
SS
1/* Include file cached obstack implementation.
2 Written by Fred Fish (fnf@cygnus.com)
3 Copyright 1995 Free Software Foundation, Inc.
4
c5aa993b 5 This file is part of GDB.
c906108c 6
c5aa993b
JM
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.
c906108c 11
c5aa993b
JM
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.
c906108c 16
c5aa993b
JM
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. */
c906108c
SS
21
22#ifndef BCACHE_H
23#define BCACHE_H 1
24
25#define BCACHE_HASHLENGTH 12 /* Number of bits in hash value */
26#define BCACHE_HASHSIZE (1 << BCACHE_HASHLENGTH)
27#define BCACHE_MAXLENGTH 128
28
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. */
32
c5aa993b
JM
33struct hashlink
34 {
35 struct hashlink *next;
36 union
37 {
38 char data[1];
39 double dummy;
40 }
41 d;
42 };
c906108c
SS
43
44/* BCACHE_DATA is used to get the address of the cached data. */
45
46#define BCACHE_DATA(p) ((p)->d.data)
47
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. */
52
53#define BCACHE_DATA_ALIGNMENT \
54 (((char *) BCACHE_DATA((struct hashlink*) 0) - (char *) 0))
55
c5aa993b
JM
56struct bcache
57 {
58 struct obstack cache;
59 struct hashlink **indextable[BCACHE_MAXLENGTH];
60 int cache_hits;
61 int cache_misses;
62 int cache_bytes;
63 int cache_savings;
64 int bcache_overflows;
65 };
c906108c
SS
66
67extern void *
c5aa993b 68 bcache PARAMS ((void *bytes, int count, struct bcache * bcachep));
c906108c 69
c906108c
SS
70extern void
71print_bcache_statistics PARAMS ((struct bcache *, char *));
72
c906108c 73#endif /* BCACHE_H */