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.13 by root, Sun Sep 10 16:00:23 2006 UTC vs.
Revision 1.43 by root, Fri Mar 26 01:04:44 2010 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 *
6 * Deliantra is free software: you can redistribute it and/or modify it under
7 * the terms of the Affero GNU General Public License as published by the
8 * Free Software Foundation, either version 3 of the License, or (at your
9 * 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 Affero GNU General Public License
17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
19 *
20 * The authors can be reached via e-mail to <support@deliantra.net>
21 */
1 22
2/* 23/*
3 * shstr.C 24 * shstr.C
4 */ 25 */
5 26
6#include <cstring> 27#include <cstring>
7#include <cstdlib> 28#include <cstdlib>
8
9#include <glib.h> 29#include <glib.h>
10
11#include <tr1/unordered_set> 30#include <tr1/unordered_set>
12 31
13#include "shstr.h"
14#include "util.h" 32#include "global.h"
15 33
16typedef 34size_t shstr_alloc;
17std::tr1::unordered_set < const char *,
18 str_hash,
19 str_equal >
20 HT;
21 35
36typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT;
37
22static HT 38static HT ht;
23 ht; 39static int next_gc;
40
41#define NUM_INT 3
24 42
25static const char * 43static const char *
26makevec (const char *s) 44makevec (const char *s)
27{ 45{
28 int
29 len = strlen (s); 46 int len = strlen (s);
47 int alloc = sizeof (uint32_t) * NUM_INT + len + 1;
30 48
31 const char * 49 shstr_alloc += alloc;
32 v = (const char *) (2 + (int *) g_slice_alloc (sizeof (int) * 2 + len + 1)); 50 char *v = (char *)g_slice_alloc (alloc);
51 v += sizeof (uint32_t) * NUM_INT;
33 52
53 shstr::hash (v) = strhsh (s);
34 shstr::length (v) = len; 54 shstr::length (v) = len;
35 shstr::refcnt (v) = 1; 55 shstr::refcnt (v) = 1;
36 56
37 memcpy ((char *) v, s, len + 1); 57 memcpy (v, s, len + 1);
38 58
39 return v; 59 return v;
40} 60}
41 61
42const char * 62shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { STRHSH_NULL, 0, 0xffffffff, "(null)" };
43 shstr::null = makevec ("<nil>");
44
45// what weird misoptimisation is this again?
46const shstr undead_name ("undead");
47 63
48const char * 64const char *
49shstr::find (const char *s) 65shstr::find (const char *s)
50{ 66{
51 if (!s) 67 if (!s)
52 return s; 68 return s;
53 69
54 HT::iterator i = ht.find (s); 70 auto (i, ht.find (s));
55 71
56 return i != ht.end ()? *i : 0; 72 return i != ht.end ()? *i : 0;
57} 73}
58 74
59const char * 75const char *
60shstr::intern (const char *s) 76shstr::intern (const char *s)
61{ 77{
62 if (!s) 78 if (!s)
63 return null; 79 return null ();
64 80
65 if (const char *found = find (s)) 81 if (const char *found = find (s))
66 { 82 {
67 ++refcnt (found); 83 ++refcnt (found);
68 return found; 84 return found;
69 } 85 }
70 86
87 --next_gc;
71 s = makevec (s); 88 s = makevec (s);
72 ht.insert (s); 89 ht.insert (s);
73 return s; 90 return s;
74} 91}
75 92
76// periodically test refcounts == 0 for a few strings 93// periodically test refcounts == 0 for a few strings
77// this is the ONLY thing that erases stuff from ht. keep it that way. 94// this is the ONLY thing that erases stuff from ht. keep it that way.
78void 95void
79shstr::gc () 96shstr::gc ()
80{ 97{
98 if (expect_true (next_gc > 0))
99 return;
100
81 static const char *curpos; 101 static const char *curpos;
82 102
83 HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); 103 auto (i, curpos ? ht.find (curpos) : ht.begin ());
84 104
85 if (i == ht.end ()) 105 if (i == ht.end ())
86 i = ht.begin (); 106 i = ht.begin ();
87 107
88 // go through all strings roughly once every 4 minutes
89 int n = ht.size () / 256 + 16; 108 int n = ht.size () / 256 + 16;
109 next_gc += n >> 1;
90 110
91 for (;;) 111 for (;;)
92 { 112 {
93 if (i == ht.end ()) 113 if (i == ht.end ())
94 { 114 {
… …
97 } 117 }
98 else if (!--n) 118 else if (!--n)
99 break; 119 break;
100 else if (!refcnt (*i)) 120 else if (!refcnt (*i))
101 { 121 {
102 HT::iterator o = i++; 122 auto (o, i++);
103 const char *s = *o; 123 const char *s = *o;
104 124
105 ht.erase (o); 125 ht.erase (o);
106 126
107 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 127 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
108 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); 128 int alloc = sizeof (uint32_t) * NUM_INT + length (s) + 1;
129 shstr_alloc -= alloc;
130 g_slice_free1 (alloc, (void *)(s - sizeof (uint32_t) * NUM_INT));
109 } 131 }
110 else 132 else
111 ++i; 133 ++i;
112 } 134 }
113 135
114 curpos = *i; 136 curpos = *i;
115} 137}
116 138
117//TODO: this should of course not be here 139// declare these here to get correct initialisation order
140#define def2(id,str) const shstr id (str);
141#define def(id) def2(shstr_ ## id, # id)
142# include "shstrinc.h"
143#undef def
144#undef def2
118 145
119/* buf_overflow() - we don't want to exceed the buffer size of 146shstr skill_names[NUM_SKILLS];
120 * buf1 by adding on buf2! Returns true if overflow will occur. 147materialtype_t material_null;
121 */
122 148
123int
124buf_overflow (const char *buf1, const char *buf2, int bufsize)
125{
126 int len1 = 0, len2 = 0;
127
128 if (buf1)
129 len1 = strlen (buf1);
130 if (buf2)
131 len2 = strlen (buf2);
132 if ((len1 + len2) >= bufsize)
133 return 1;
134 return 0;
135}

Diff Legend

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