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.16 by root, Tue Sep 12 00:53:56 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 */
1 21
2/* 22/*
3 * shstr.C 23 * shstr.C
4 */ 24 */
5 25
6#include <cstring> 26#include <cstring>
7#include <cstdlib> 27#include <cstdlib>
8
9#include <glib.h> 28#include <glib.h>
10
11#include <tr1/unordered_set> 29#include <tr1/unordered_set>
12 30
13#include "global.h" 31#include "global.h"
14 32
33size_t shstr_alloc;
34
15typedef std::tr1::unordered_set<const char *, str_hash, str_equal> HT; 35typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT;
16 36
17static HT ht; 37static HT ht;
38static int next_gc;
18 39
19static const char * 40static const char *
20makevec (const char *s) 41makevec (const char *s)
21{ 42{
22 int
23 len = strlen (s); 43 int len = strlen (s);
44 int alloc = sizeof (uint32_t) * 2 + len + 1;
24 45
25 const char * 46 shstr_alloc += alloc;
26 v = (const char *) (2 + (int *) g_slice_alloc (sizeof (int) * 2 + len + 1)); 47 char *v = (char *)g_slice_alloc (alloc);
48 v += sizeof (uint32_t) * 2;
27 49
28 shstr::length (v) = len; 50 shstr::length (v) = len;
29 shstr::refcnt (v) = 1; 51 shstr::refcnt (v) = 1;
30 52
31 memcpy ((char *) v, s, len + 1); 53 memcpy (v, s, len + 1);
32 54
33 return v; 55 return v;
34} 56}
35 57
36const char *shstr::null = makevec ("<nil>"); 58shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { 0, 0xffffffff, "(null)" };
37 59
38const char * 60const char *
39shstr::find (const char *s) 61shstr::find (const char *s)
40{ 62{
41 if (!s) 63 if (!s)
42 return s; 64 return s;
43 65
44 HT::iterator i = ht.find (s); 66 auto (i, ht.find (s));
45 67
46 return i != ht.end ()? *i : 0; 68 return i != ht.end ()? *i : 0;
47} 69}
48 70
49const char * 71const char *
50shstr::intern (const char *s) 72shstr::intern (const char *s)
51{ 73{
52 if (!s) 74 if (!s)
53 return null; 75 return null ();
54 76
55 if (const char *found = find (s)) 77 if (const char *found = find (s))
56 { 78 {
57 ++refcnt (found); 79 ++refcnt (found);
58 return found; 80 return found;
59 } 81 }
60 82
83 --next_gc;
61 s = makevec (s); 84 s = makevec (s);
62 ht.insert (s); 85 ht.insert (s);
63 return s; 86 return s;
64} 87}
65 88
66// periodically test refcounts == 0 for a few strings 89// periodically test refcounts == 0 for a few strings
67// this is the ONLY thing that erases stuff from ht. keep it that way. 90// this is the ONLY thing that erases stuff from ht. keep it that way.
68void 91void
69shstr::gc () 92shstr::gc ()
70{ 93{
71return; //D 94 if (expect_true (next_gc > 0))
72//D currently disabled: some datastructures might still store them 95 return;
73//D but their pointers will become invalidated 96
74 static const char *curpos; 97 static const char *curpos;
75 98
76 HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); 99 auto (i, curpos ? ht.find (curpos) : ht.begin ());
77 100
78 if (i == ht.end ()) 101 if (i == ht.end ())
79 i = ht.begin (); 102 i = ht.begin ();
80 103
81 // go through all strings roughly once every 4 minutes
82 int n = ht.size () / 256 + 16; 104 int n = ht.size () / 256 + 16;
105 next_gc += n >> 1;
83 106
84 for (;;) 107 for (;;)
85 { 108 {
86 if (i == ht.end ()) 109 if (i == ht.end ())
87 { 110 {
… …
90 } 113 }
91 else if (!--n) 114 else if (!--n)
92 break; 115 break;
93 else if (!refcnt (*i)) 116 else if (!refcnt (*i))
94 { 117 {
95 HT::iterator o = i++; 118 auto (o, i++);
96 const char *s = *o; 119 const char *s = *o;
97 120
98 ht.erase (o); 121 ht.erase (o);
99 122
100 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 123 //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); 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));
102 } 127 }
103 else 128 else
104 ++i; 129 ++i;
105 } 130 }
106 131
107 curpos = *i; 132 curpos = *i;
108} 133}
109 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
110shstr skill_names[NUM_SKILLS]; 142shstr skill_names[NUM_SKILLS];
111
112// what weird misoptimisation is this again?
113const shstr undead_name ("undead");
114 143
115//TODO: this should of course not be here 144//TODO: this should of course not be here
116 145
117/* 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
118 * buf1 by adding on buf2! Returns true if overflow will occur. 147 * buf1 by adding on buf2! Returns true if overflow will occur.
119 */ 148 */
120
121int 149int
122buf_overflow (const char *buf1, const char *buf2, int bufsize) 150buf_overflow (const char *buf1, const char *buf2, int bufsize)
123{ 151{
124 int len1 = 0, len2 = 0; 152 int len1 = 0, len2 = 0;
125 153
126 if (buf1) 154 if (buf1)
127 len1 = strlen (buf1); 155 len1 = strlen (buf1);
156
128 if (buf2) 157 if (buf2)
129 len2 = strlen (buf2); 158 len2 = strlen (buf2);
159
130 if ((len1 + len2) >= bufsize) 160 if ((len1 + len2) >= bufsize)
131 return 1; 161 return 1;
162
132 return 0; 163 return 0;
133} 164}

Diff Legend

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