2 /* Copyright (C) 1989, 1990, 1991, 1992 Free Software Foundation, Inc.
3 Written by James Clark (jjc@jclark.com)
5 This file is part of groff.
7 groff is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 groff is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License along
18 with groff; see the file COPYING. If not, write to the Free Software
19 Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
25 const char **symbol::table
= 0;
26 int symbol::table_used
= 0;
27 int symbol::table_size
= 0;
28 char *symbol::block
= 0;
29 int symbol::block_size
= 0;
31 const symbol NULL_SYMBOL
;
33 const int BLOCK_SIZE
= 1024;
34 // the table will increase in size as necessary
35 // the size will be chosen from the following array
36 // add some more if you want
37 // I think it unlikely that we'll need more than a million symbols
38 static const unsigned int table_sizes
[] = {
39 101, 503, 1009, 2003, 3001, 4001, 5003, 10007, 20011, 40009, 80021, 160001, 500009, 1000003, 0
41 const double FULL_MAX
= 0.3; // don't let the table get more than this full
43 static unsigned int hash_string(const char *p
)
45 // compute a hash code; this assumes 32-bit unsigned ints
46 // see p436 of Compilers by Aho, Sethi & Ullman
47 // give special treatment to two-character names
48 unsigned int hc
= 0, g
;
54 for (; *p
!= 0; p
++) {
57 if ((g
= (hc
& 0xf0000000)) == 0) {
67 symbol::symbol(const char *p
, int how
)
69 if (p
== 0 || *p
== 0) {
74 table_size
= table_sizes
[0];
75 table
= new char*[table_size
];
76 for (int i
= 0; i
< table_size
; i
++)
80 unsigned int hc
= hash_string(p
);
81 for (const char **pp
= table
+ hc
% table_size
;
83 (pp
== table
? pp
= table
+ table_size
- 1 : --pp
))
84 if (strcmp(p
, *pp
) == 0) {
88 if (how
== MUST_ALREADY_EXIST
) {
92 if (table_used
>= table_size
- 1 || table_used
>= table_size
*FULL_MAX
) {
93 const char **old_table
= table
;
94 unsigned int old_table_size
= table_size
;
95 for (int i
= 1; table_sizes
[i
] <= old_table_size
; i
++)
96 if (table_sizes
[i
] == 0)
97 fatal("too many symbols");
98 table_size
= table_sizes
[i
];
100 table
= new char*[table_size
];
101 for (i
= 0; i
< table_size
; i
++)
103 for (pp
= old_table
+ old_table_size
- 1;
106 symbol
temp(*pp
, 1); /* insert it into the new table */
109 for (pp
= table
+ hc
% table_size
;
111 (pp
== table
? pp
= table
+ table_size
- 1 : --pp
))
115 if (how
== DONT_STORE
) {
119 int len
= strlen(p
)+1;
120 if (block
== 0 || block_size
< len
) {
121 block_size
= len
> BLOCK_SIZE
? len
: BLOCK_SIZE
;
122 block
= new char [block_size
];
124 (void)strcpy(block
, p
);
131 symbol
concat(symbol s1
, symbol s2
)
133 char *buf
= new char [strlen(s1
.contents()) + strlen(s2
.contents()) + 1];
134 strcpy(buf
, s1
.contents());
135 strcat(buf
, s2
.contents());