ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/shstr.C
Revision: 1.32
Committed: Wed Dec 31 17:35:37 2008 UTC (15 years, 4 months ago) by root
Content type: text/plain
Branch: MAIN
Changes since 1.31: +7 -6 lines
Log Message: 
refactoring of shstr classe,s new shstr_tmp, lots of minor rewriting

File Contents

# User Rev Content
1 elmex 1.1 /*
2 root 1.28 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 root 1.23 *
4 root 1.29 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 root 1.23 *
6 root 1.28 * Deliantra is free software: you can redistribute it and/or modify
7 root 1.24 * 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 root 1.23 *
11 root 1.24 * 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 root 1.23 *
16 root 1.24 * 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 root 1.23 *
19 root 1.28 * The authors can be reached via e-mail to <support@deliantra.net>
20 root 1.22 */
21    
22     /*
23 root 1.3 * shstr.C
24 elmex 1.1 */
25    
26 root 1.3 #include <cstring>
27     #include <cstdlib>
28 root 1.10 #include <glib.h>
29 root 1.3 #include <tr1/unordered_set>
30 elmex 1.1
31 root 1.16 #include "global.h"
32 elmex 1.1
33 root 1.26 size_t shstr_alloc;
34    
35 root 1.31 typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT;
36 elmex 1.1
37 root 1.16 static HT ht;
38 root 1.29 static int next_gc;
39 elmex 1.1
40 root 1.13 static const char *
41     makevec (const char *s)
42 root 1.7 {
43 root 1.17 int len = strlen (s);
44 root 1.7
45 root 1.32 shstr_alloc += sizeof (unsigned int) * 2 + len + 1;
46     const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (unsigned int) * 2 + len + 1));
47 root 1.7
48     shstr::length (v) = len;
49     shstr::refcnt (v) = 1;
50    
51 root 1.13 memcpy ((char *) v, s, len + 1);
52 root 1.7
53 root 1.8 return v;
54 root 1.7 }
55    
56 root 1.17 static const char *
57     makenull ()
58     {
59     const char *s = makevec ("(null)");
60 root 1.32 shstr_tmp::length (s) = 0;
61     //shstr ::refcnt (s) = 0xffffffff; // useful for debugging
62 root 1.17 return s;
63     }
64    
65 root 1.32 const char *shstr_tmp::null = makenull ();
66 root 1.15
67 elmex 1.1 const char *
68 root 1.3 shstr::find (const char *s)
69     {
70 root 1.4 if (!s)
71     return s;
72    
73 root 1.21 auto (i, ht.find (s));
74 elmex 1.1
75 root 1.13 return i != ht.end ()? *i : 0;
76 elmex 1.1 }
77    
78     const char *
79 root 1.3 shstr::intern (const char *s)
80     {
81 root 1.4 if (!s)
82 root 1.7 return null;
83 elmex 1.1
84 root 1.4 if (const char *found = find (s))
85 root 1.5 {
86     ++refcnt (found);
87     return found;
88     }
89 elmex 1.1
90 root 1.29 --next_gc;
91 root 1.7 s = makevec (s);
92     ht.insert (s);
93     return s;
94 elmex 1.1 }
95    
96 root 1.5 // periodically test refcounts == 0 for a few strings
97     // this is the ONLY thing that erases stuff from ht. keep it that way.
98 elmex 1.1 void
99 root 1.3 shstr::gc ()
100     {
101 root 1.29 if (expect_true (next_gc > 0))
102     return;
103    
104 root 1.5 static const char *curpos;
105    
106 root 1.21 auto (i, curpos ? ht.find (curpos) : ht.begin ());
107 root 1.5
108     if (i == ht.end ())
109     i = ht.begin ();
110    
111 root 1.11 int n = ht.size () / 256 + 16;
112 root 1.29 next_gc += n >> 1;
113 root 1.6
114     for (;;)
115 root 1.5 {
116     if (i == ht.end ())
117     {
118     curpos = 0;
119     return;
120     }
121 root 1.6 else if (!--n)
122     break;
123     else if (!refcnt (*i))
124 root 1.5 {
125 root 1.21 auto (o, i++);
126 root 1.5 const char *s = *o;
127 root 1.13
128 root 1.5 ht.erase (o);
129    
130     //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
131 root 1.32 shstr_alloc -= sizeof (unsigned int) * 2 + length (s) + 1;
132     g_slice_free1 (sizeof (unsigned int) * 2 + length (s) + 1, -2 + (int *) s);
133 root 1.5 }
134     else
135     ++i;
136     }
137    
138     curpos = *i;
139 elmex 1.1 }
140    
141 root 1.30 const shstr shstr_null;
142    
143 root 1.25 // declare these here to get correct initialisation order
144     #define def(str) const shstr shstr_ ## str (# str);
145     # include "shstrinc.h"
146     #undef def
147    
148 root 1.16 shstr skill_names[NUM_SKILLS];
149    
150 root 1.5 //TODO: this should of course not be here
151 root 1.13
152 elmex 1.1 /* buf_overflow() - we don't want to exceed the buffer size of
153     * buf1 by adding on buf2! Returns true if overflow will occur.
154     */
155 root 1.13 int
156 elmex 1.1 buf_overflow (const char *buf1, const char *buf2, int bufsize)
157     {
158 root 1.13 int len1 = 0, len2 = 0;
159 elmex 1.1
160 root 1.13 if (buf1)
161     len1 = strlen (buf1);
162 root 1.26
163 root 1.13 if (buf2)
164     len2 = strlen (buf2);
165 root 1.26
166 root 1.13 if ((len1 + len2) >= bufsize)
167     return 1;
168 root 1.22
169 root 1.13 return 0;
170 elmex 1.1 }