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.10 by root, Tue Sep 5 19:18:04 2006 UTC vs.
Revision 1.42 by root, Tue Nov 10 04:38:45 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 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 */
22
1/* 23/*
2 * shstr.C 24 * shstr.C
3 */ 25 */
4 26
5#include <cstring> 27#include <cstring>
6#include <cstdlib> 28#include <cstdlib>
7
8#include <glib.h> 29#include <glib.h>
9
10#include <tr1/unordered_set> 30#include <tr1/unordered_set>
11 31
12#include "shstr.h"
13#include "util.h" 32#include "global.h"
14 33
34size_t shstr_alloc;
35
15typedef std::tr1::unordered_set<const char *, str_hash, str_equal> HT; 36typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT;
16 37
17static HT ht; 38static HT ht;
39static int next_gc;
18 40
19static const char *makevec (const char *s) 41#define NUM_INT 3
42
43static const char *
44makevec (const char *s)
20{ 45{
21 int len = strlen (s); 46 int len = strlen (s);
47 int alloc = sizeof (uint32_t) * NUM_INT + len + 1;
22 48
23 const char *v = (const char *)(2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1)); 49 shstr_alloc += alloc;
50 char *v = (char *)g_slice_alloc (alloc);
51 v += sizeof (uint32_t) * NUM_INT;
24 52
53 shstr::hash (v) = strhsh (s);
25 shstr::length (v) = len; 54 shstr::length (v) = len;
26 shstr::refcnt (v) = 1; 55 shstr::refcnt (v) = 1;
27 56
28 memcpy ((char *)v, s, len + 1); 57 memcpy (v, s, len + 1);
29 58
30 return v; 59 return v;
31} 60}
32 61
33const char *shstr::null = makevec ("<nil>"); 62shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { STRHSH_NULL, 0, 0xffffffff, "(null)" };
34
35// what weird misoptimisation is this again?
36const shstr undead_name ("undead");
37 63
38const char * 64const char *
39shstr::find (const char *s) 65shstr::find (const char *s)
40{ 66{
41 if (!s) 67 if (!s)
42 return s; 68 return s;
43 69
44 HT::iterator i = ht.find (s); 70 auto (i, ht.find (s));
45 71
46 return i != ht.end () 72 return i != ht.end ()? *i : 0;
47 ? *i
48 : 0;
49} 73}
50 74
51const char * 75const char *
52shstr::intern (const char *s) 76shstr::intern (const char *s)
53{ 77{
54 if (!s) 78 if (!s)
55 return null; 79 return null ();
56 80
57 if (const char *found = find (s)) 81 if (const char *found = find (s))
58 { 82 {
59 ++refcnt (found); 83 ++refcnt (found);
60 return found; 84 return found;
61 } 85 }
62 86
87 --next_gc;
63 s = makevec (s); 88 s = makevec (s);
64 ht.insert (s); 89 ht.insert (s);
65 return s; 90 return s;
66} 91}
67 92
68// periodically test refcounts == 0 for a few strings 93// periodically test refcounts == 0 for a few strings
69// 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.
70void 95void
71shstr::gc () 96shstr::gc ()
72{ 97{
98 if (expect_true (next_gc > 0))
99 return;
100
73 static const char *curpos; 101 static const char *curpos;
74 102
75 HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); 103 auto (i, curpos ? ht.find (curpos) : ht.begin ());
76 104
77 if (i == ht.end ()) 105 if (i == ht.end ())
78 i = ht.begin (); 106 i = ht.begin ();
79 107
80 // go through all strings roughly once every 4 minutes
81 int n = ht.size () / 256 + 16000; 108 int n = ht.size () / 256 + 16;
109 next_gc += n >> 1;
82 110
83 for (;;) 111 for (;;)
84 { 112 {
85 if (i == ht.end ()) 113 if (i == ht.end ())
86 { 114 {
… …
89 } 117 }
90 else if (!--n) 118 else if (!--n)
91 break; 119 break;
92 else if (!refcnt (*i)) 120 else if (!refcnt (*i))
93 { 121 {
94 HT::iterator o = i++; 122 auto (o, i++);
95 const char *s = *o; 123 const char *s = *o;
124
96 ht.erase (o); 125 ht.erase (o);
97 126
98 int len = length (s);
99
100 //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));
101 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));
102 } 131 }
103 else 132 else
104 ++i; 133 ++i;
105 } 134 }
106 135
107 curpos = *i; 136 curpos = *i;
108} 137}
109 138
110//TODO: this should of course not be here 139// declare these here to get correct initialisation order
111/* buf_overflow() - we don't want to exceed the buffer size of 140#define def2(id,str) const shstr id (str);
112 * buf1 by adding on buf2! Returns true if overflow will occur. 141#define def(id) def2(shstr_ ## id, # id)
113 */ 142# include "shstrinc.h"
143#undef def
144#undef def2
114 145
115int 146shstr skill_names[NUM_SKILLS];
116buf_overflow (const char *buf1, const char *buf2, int bufsize) 147materialtype_t material_null;
117{
118 int len1 = 0, len2 = 0;
119 148
120 if (buf1)
121 len1 = strlen (buf1);
122 if (buf2)
123 len2 = strlen (buf2);
124 if ((len1 + len2) >= bufsize)
125 return 1;
126 return 0;
127}
128

Diff Legend

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