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

Diff Legend

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