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

Diff Legend

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