ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/shstr.C
(Generate patch)

Comparing deliantra/server/common/shstr.C (file contents):
Revision 1.3 by root, Sun Sep 3 00:18:40 2006 UTC vs.
Revision 1.38 by root, Thu Jan 1 21:15:12 2009 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 *
6 * Deliantra is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 *
19 * The authors can be reached via e-mail to <support@deliantra.net>
20 */
21
1/* 22/*
2 * shstr.C 23 * shstr.C
3 */ 24 */
4 25
5#include <cstring> 26#include <cstring>
6#include <cstdlib> 27#include <cstdlib>
7 28#include <glib.h>
8#include <tr1/unordered_set> 29#include <tr1/unordered_set>
9 30
10#include "shstr.h" 31#include "global.h"
11 32
12struct hash 33size_t shstr_alloc;
13{
14 std::size_t operator ()(const char *s) const
15 {
16 unsigned long hash = 0;
17 unsigned int i = 0;
18 34
19 /* use the one-at-a-time hash function, which supposedly is
20 * better than the djb2-like one used by perl5.005, but
21 * certainly is better then the bug used here before.
22 * see http://burtleburtle.net/bob/hash/doobs.html
23 */
24 while (*s)
25 {
26 hash += *s++;
27 hash += hash << 10;
28 hash ^= hash >> 6;
29 }
30
31 hash += hash << 3;
32 hash ^= hash >> 11;
33 hash += hash << 15;
34
35 return hash;
36 }
37};
38
39struct equal
40{
41 bool operator ()(const char *a, const char *b) const
42 {
43 return !strcmp (a, b);
44 }
45};
46
47typedef std::tr1::unordered_set<const char *, hash, equal> HT; 35typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT;
48 36
49static HT ht; 37static HT ht;
38static int next_gc;
39
40static const char *
41makevec (const char *s)
42{
43 int len = strlen (s);
44 int alloc = sizeof (uint32_t) * 2 + len + 1;
45
46 shstr_alloc += alloc;
47 char *v = (char *)g_slice_alloc (alloc);
48 v += sizeof (uint32_t) * 2;
49
50 shstr::length (v) = len;
51 shstr::refcnt (v) = 1;
52
53 memcpy (v, s, len + 1);
54
55 return v;
56}
57
58shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { 0, 0xffffffff, "(null)" };
50 59
51const char * 60const char *
52shstr::find (const char *s) 61shstr::find (const char *s)
53{ 62{
54 HT::iterator i = ht.find (s); 63 if (!s)
64 return s;
55 65
66 auto (i, ht.find (s));
67
56 return i != ht.end () 68 return i != ht.end ()? *i : 0;
57 ? (char *)*i
58 : 0;
59} 69}
60 70
61const char * 71const char *
62shstr::intern (const char *s) 72shstr::intern (const char *s)
63{ 73{
64 HT::iterator i = ht.find (s); 74 if (!s)
75 return null ();
65 76
66 if (i != ht.end ()) 77 if (const char *found = find (s))
67 return (char *)*i; 78 {
79 ++refcnt (found);
80 return found;
81 }
68 82
69 int len = strlen (s); 83 --next_gc;
70 84 s = makevec (s);
71 int *v = (int *)malloc (sizeof (int) * 2 + len + 1);
72
73 v [0] = len;
74 v [1] = 0;
75
76 v += 2;
77
78 memcpy (v, s, len + 1);
79
80 ht.insert ((char *)v); 85 ht.insert (s);
81 86 return s;
82 return (char *)v;
83} 87}
84 88
85// TODO: periodically test refcounts == 0 for a few strings (e.g. one hash bucket, 89// periodically test refcounts == 0 for a few strings
86// exploiting the fatc that iterators stay valid for unordered_set). 90// this is the ONLY thing that erases stuff from ht. keep it that way.
87void 91void
88shstr::gc () 92shstr::gc ()
89{ 93{
94 if (expect_true (next_gc > 0))
95 return;
96
97 static const char *curpos;
98
99 auto (i, curpos ? ht.find (curpos) : ht.begin ());
100
101 if (i == ht.end ())
102 i = ht.begin ();
103
104 int n = ht.size () / 256 + 16;
105 next_gc += n >> 1;
106
107 for (;;)
108 {
109 if (i == ht.end ())
110 {
111 curpos = 0;
112 return;
113 }
114 else if (!--n)
115 break;
116 else if (!refcnt (*i))
117 {
118 auto (o, i++);
119 const char *s = *o;
120
121 ht.erase (o);
122
123 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
124 int alloc = sizeof (uint32_t) * 2 + length (s) + 1;
125 shstr_alloc -= alloc;
126 g_slice_free1 (alloc, (void *)(s - sizeof (uint32_t) * 2));
127 }
128 else
129 ++i;
130 }
131
132 curpos = *i;
90} 133}
134
135// declare these here to get correct initialisation order
136#define def2(id,str) const shstr id (str);
137#define def(id) def2(shstr_ ## id, # id)
138# include "shstrinc.h"
139#undef def
140#undef def2
141
142shstr skill_names[NUM_SKILLS];
143
144//TODO: this should of course not be here
91 145
92/* buf_overflow() - we don't want to exceed the buffer size of 146/* buf_overflow() - we don't want to exceed the buffer size of
93 * buf1 by adding on buf2! Returns true if overflow will occur. 147 * buf1 by adding on buf2! Returns true if overflow will occur.
94 */ 148 */
95
96int 149int
97buf_overflow (const char *buf1, const char *buf2, int bufsize) 150buf_overflow (const char *buf1, const char *buf2, int bufsize)
98{ 151{
99 int len1 = 0, len2 = 0; 152 int len1 = 0, len2 = 0;
100 153
101 if (buf1) 154 if (buf1)
102 len1 = strlen (buf1); 155 len1 = strlen (buf1);
156
103 if (buf2) 157 if (buf2)
104 len2 = strlen (buf2); 158 len2 = strlen (buf2);
159
105 if ((len1 + len2) >= bufsize) 160 if ((len1 + len2) >= bufsize)
106 return 1;
107 return 0; 161 return 1;
162
163 return 0;
108} 164}
109

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines