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.18 by root, Tue Sep 12 20:55:40 2006 UTC vs.
Revision 1.31 by root, Tue Jul 29 02:00:55 2008 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, slice_allocator<const char *>, true> 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 len = strlen (s); 43 int len = strlen (s);
23 44
45 shstr_alloc += sizeof (int) * 2 + len + 1;
24 const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1)); 46 const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1));
25 47
26 shstr::length (v) = len; 48 shstr::length (v) = len;
27 shstr::refcnt (v) = 1; 49 shstr::refcnt (v) = 1;
28 50
… …
45shstr::find (const char *s) 67shstr::find (const char *s)
46{ 68{
47 if (!s) 69 if (!s)
48 return s; 70 return s;
49 71
50 HT::iterator i = ht.find (s); 72 auto (i, ht.find (s));
51 73
52 return i != ht.end ()? *i : 0; 74 return i != ht.end ()? *i : 0;
53} 75}
54 76
55const char * 77const char *
… …
62 { 84 {
63 ++refcnt (found); 85 ++refcnt (found);
64 return found; 86 return found;
65 } 87 }
66 88
89 --next_gc;
67 s = makevec (s); 90 s = makevec (s);
68 ht.insert (s); 91 ht.insert (s);
69 return s; 92 return s;
70} 93}
71 94
72// periodically test refcounts == 0 for a few strings 95// periodically test refcounts == 0 for a few strings
73// this is the ONLY thing that erases stuff from ht. keep it that way. 96// this is the ONLY thing that erases stuff from ht. keep it that way.
74void 97void
75shstr::gc () 98shstr::gc ()
76{ 99{
77return; //D 100 if (expect_true (next_gc > 0))
78//D currently disabled: some datastructures might still store them 101 return;
79//D but their pointers will become invalidated 102
80 static const char *curpos; 103 static const char *curpos;
81 104
82 HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); 105 auto (i, curpos ? ht.find (curpos) : ht.begin ());
83 106
84 if (i == ht.end ()) 107 if (i == ht.end ())
85 i = ht.begin (); 108 i = ht.begin ();
86 109
87 // go through all strings roughly once every 4 minutes
88 int n = ht.size () / 256 + 16; 110 int n = ht.size () / 256 + 16;
111 next_gc += n >> 1;
89 112
90 for (;;) 113 for (;;)
91 { 114 {
92 if (i == ht.end ()) 115 if (i == ht.end ())
93 { 116 {
… …
96 } 119 }
97 else if (!--n) 120 else if (!--n)
98 break; 121 break;
99 else if (!refcnt (*i)) 122 else if (!refcnt (*i))
100 { 123 {
101 HT::iterator o = i++; 124 auto (o, i++);
102 const char *s = *o; 125 const char *s = *o;
103 126
104 ht.erase (o); 127 ht.erase (o);
105 128
106 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 129 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
130 shstr_alloc -= sizeof (int) * 2 + length (s) + 1;
107 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); 131 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
108 } 132 }
109 else 133 else
110 ++i; 134 ++i;
111 } 135 }
112 136
113 curpos = *i; 137 curpos = *i;
114} 138}
115 139
140const shstr shstr_null;
141
142// declare these here to get correct initialisation order
143#define def(str) const shstr shstr_ ## str (# str);
144# include "shstrinc.h"
145#undef def
146
116shstr skill_names[NUM_SKILLS]; 147shstr skill_names[NUM_SKILLS];
117
118// what weird misoptimisation is this again?
119const shstr undead_name ("undead");
120 148
121//TODO: this should of course not be here 149//TODO: this should of course not be here
122 150
123/* buf_overflow() - we don't want to exceed the buffer size of 151/* buf_overflow() - we don't want to exceed the buffer size of
124 * buf1 by adding on buf2! Returns true if overflow will occur. 152 * buf1 by adding on buf2! Returns true if overflow will occur.
125 */ 153 */
126
127int 154int
128buf_overflow (const char *buf1, const char *buf2, int bufsize) 155buf_overflow (const char *buf1, const char *buf2, int bufsize)
129{ 156{
130 int len1 = 0, len2 = 0; 157 int len1 = 0, len2 = 0;
131 158
132 if (buf1) 159 if (buf1)
133 len1 = strlen (buf1); 160 len1 = strlen (buf1);
161
134 if (buf2) 162 if (buf2)
135 len2 = strlen (buf2); 163 len2 = strlen (buf2);
164
136 if ((len1 + len2) >= bufsize) 165 if ((len1 + len2) >= bufsize)
137 return 1; 166 return 1;
167
138 return 0; 168 return 0;
139} 169}

Diff Legend

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