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.26 by root, Tue Oct 16 05:34:24 2007 UTC

1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5 *
6 * Crossfire TRT 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 <crossfire@schmorp.de>
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 *>, true> HT;
16 36
17static HT ht; 37static HT ht;
18 38
19static const char * 39static const char *
20makevec (const char *s) 40makevec (const char *s)
21{ 41{
22 int
23 len = strlen (s); 42 int len = strlen (s);
24 43
25 const char * 44 shstr_alloc += sizeof (int) * 2 + len + 1;
26 v = (const char *) (2 + (int *) g_slice_alloc (sizeof (int) * 2 + len + 1)); 45 const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1));
27 46
28 shstr::length (v) = len; 47 shstr::length (v) = len;
29 shstr::refcnt (v) = 1; 48 shstr::refcnt (v) = 1;
30 49
31 memcpy ((char *) v, s, len + 1); 50 memcpy ((char *) v, s, len + 1);
32 51
33 return v; 52 return v;
34} 53}
35 54
55static const char *
56makenull ()
57{
58 const char *s = makevec ("(null)");
59 shstr::length (s) = 0;
60 return s;
61}
62
36const char *shstr::null = makevec ("<nil>"); 63const char *shstr::null = makenull ();
37 64
38const char * 65const char *
39shstr::find (const char *s) 66shstr::find (const char *s)
40{ 67{
41 if (!s) 68 if (!s)
42 return s; 69 return s;
43 70
44 HT::iterator i = ht.find (s); 71 auto (i, ht.find (s));
45 72
46 return i != ht.end ()? *i : 0; 73 return i != ht.end ()? *i : 0;
47} 74}
48 75
49const char * 76const char *
… …
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{
71return; //D
72//D currently disabled: some datastructures might still store them
73//D but their pointers will become invalidated
74 static const char *curpos; 98 static const char *curpos;
75 99
76 HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); 100 auto (i, curpos ? ht.find (curpos) : ht.begin ());
77 101
78 if (i == ht.end ()) 102 if (i == ht.end ())
79 i = ht.begin (); 103 i = ht.begin ();
80 104
81 // go through all strings roughly once every 4 minutes 105 // go through all strings roughly once every 4 minutes
… …
90 } 114 }
91 else if (!--n) 115 else if (!--n)
92 break; 116 break;
93 else if (!refcnt (*i)) 117 else if (!refcnt (*i))
94 { 118 {
95 HT::iterator o = i++; 119 auto (o, i++);
96 const char *s = *o; 120 const char *s = *o;
97 121
98 ht.erase (o); 122 ht.erase (o);
99 123
100 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 124 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
125 shstr_alloc -= sizeof (int) * 2 + length (s) + 1;
101 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); 126 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
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 def(str) const shstr shstr_ ## str (# str);
137# include "shstrinc.h"
138#undef def
139
110shstr skill_names[NUM_SKILLS]; 140shstr skill_names[NUM_SKILLS];
111
112// what weird misoptimisation is this again?
113const shstr undead_name ("undead");
114 141
115//TODO: this should of course not be here 142//TODO: this should of course not be here
116 143
117/* buf_overflow() - we don't want to exceed the buffer size of 144/* buf_overflow() - we don't want to exceed the buffer size of
118 * buf1 by adding on buf2! Returns true if overflow will occur. 145 * buf1 by adding on buf2! Returns true if overflow will occur.
119 */ 146 */
120
121int 147int
122buf_overflow (const char *buf1, const char *buf2, int bufsize) 148buf_overflow (const char *buf1, const char *buf2, int bufsize)
123{ 149{
124 int len1 = 0, len2 = 0; 150 int len1 = 0, len2 = 0;
125 151
126 if (buf1) 152 if (buf1)
127 len1 = strlen (buf1); 153 len1 = strlen (buf1);
154
128 if (buf2) 155 if (buf2)
129 len2 = strlen (buf2); 156 len2 = strlen (buf2);
157
130 if ((len1 + len2) >= bufsize) 158 if ((len1 + len2) >= bufsize)
131 return 1; 159 return 1;
160
132 return 0; 161 return 0;
133} 162}

Diff Legend

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