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.26 by root, Tue Oct 16 05:34:24 2007 UTC vs.
Revision 1.50 by root, Wed Nov 16 23:41:59 2016 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * 5 *
6 * Crossfire TRT is free software: you can redistribute it and/or modify 6 * Deliantra is free software: you can redistribute it and/or modify it under
7 * it under the terms of the GNU General Public License as published by 7 * the terms of the Affero GNU General Public License as published by the
8 * the Free Software Foundation, either version 3 of the License, or 8 * Free Software Foundation, either version 3 of the License, or (at your
9 * (at your option) any later version. 9 * option) any later version.
10 * 10 *
11 * This program is distributed in the hope that it will be useful, 11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details. 14 * GNU General Public License for more details.
15 * 15 *
16 * You should have received a copy of the GNU General Public License 16 * You should have received a copy of the Affero GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>. 17 * and the GNU General Public License along with this program. If not, see
18 * <http://www.gnu.org/licenses/>.
18 * 19 *
19 * The authors can be reached via e-mail to <crossfire@schmorp.de> 20 * The authors can be reached via e-mail to <support@deliantra.net>
20 */ 21 */
21 22
22/* 23/*
23 * shstr.C 24 * shstr.C
24 */ 25 */
… …
30 31
31#include "global.h" 32#include "global.h"
32 33
33size_t shstr_alloc; 34size_t shstr_alloc;
34 35
35typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT; 36typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *> > HT;
36 37
37static HT ht; 38static HT ht;
39static int next_gc;
40
41#define NUM_INT 3
38 42
39static const char * 43static const char *
40makevec (const char *s) 44makevec (const char *s)
41{ 45{
42 int len = strlen (s); 46 int len = strlen (s);
47 int alloc = sizeof (uint32_t) * NUM_INT + len + 1;
43 48
44 shstr_alloc += sizeof (int) * 2 + len + 1; 49 shstr_alloc += alloc;
45 const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1)); 50 char *v = (char *)g_slice_alloc (alloc);
51 v += sizeof (uint32_t) * NUM_INT;
46 52
53 shstr::hash (v) = strhsh (s);
47 shstr::length (v) = len; 54 shstr::length (v) = len;
48 shstr::refcnt (v) = 1; 55 shstr::refcnt (v) = 1;
49 56
50 memcpy ((char *) v, s, len + 1); 57 memcpy (v, s, len + 1);
51 58
52 return v; 59 return v;
53} 60}
54 61
55static const char * 62shstr_vec<sizeof "(null)"> shstr_tmp::nullvec = { STRHSH_NULL, 0, 0xffffffff, "(null)" };
56makenull () 63
64bool
65shstr_tmp::contains (const char *substring) const
57{ 66{
58 const char *s = makevec ("(null)"); 67 //TODO: this is supposed to check for comma-seperation...
59 shstr::length (s) = 0; 68 return s != null ()
60 return s; 69 && substring
70 && strstr (s, substring);
61} 71}
62
63const char *shstr::null = makenull ();
64 72
65const char * 73const char *
66shstr::find (const char *s) 74shstr::find (const char *s)
67{ 75{
68 if (!s) 76 if (!s)
… …
75 83
76const char * 84const char *
77shstr::intern (const char *s) 85shstr::intern (const char *s)
78{ 86{
79 if (!s) 87 if (!s)
80 return null; 88 return null ();
81 89
82 if (const char *found = find (s)) 90 if (const char *found = find (s))
83 { 91 {
84 ++refcnt (found); 92 ++refcnt (found);
85 return found; 93 return found;
86 } 94 }
87 95
96 --next_gc;
88 s = makevec (s); 97 s = makevec (s);
89 ht.insert (s); 98 ht.insert (s);
90 return s; 99 return s;
91} 100}
92 101
93// periodically test refcounts == 0 for a few strings 102// periodically test refcounts == 0 for a few strings
94// this is the ONLY thing that erases stuff from ht. keep it that way. 103// this is the ONLY thing that erases stuff from ht. keep it that way.
95void 104void
96shstr::gc () 105shstr::gc ()
97{ 106{
107 if (expect_true (next_gc > 0))
108 return;
109
98 static const char *curpos; 110 static const char *curpos;
99 111
100 auto (i, curpos ? ht.find (curpos) : ht.begin ()); 112 auto (i, curpos ? ht.find (curpos) : ht.begin ());
101 113
102 if (i == ht.end ()) 114 if (i == ht.end ())
103 i = ht.begin (); 115 i = ht.begin ();
104 116
105 // go through all strings roughly once every 4 minutes
106 int n = ht.size () / 256 + 16; 117 int n = ht.size () / 256 + 16;
118 next_gc += n >> 1;
107 119
108 for (;;) 120 for (;;)
109 { 121 {
110 if (i == ht.end ()) 122 if (i == ht.end ())
111 { 123 {
… …
120 const char *s = *o; 132 const char *s = *o;
121 133
122 ht.erase (o); 134 ht.erase (o);
123 135
124 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 136 //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; 137 int alloc = sizeof (uint32_t) * NUM_INT + length (s) + 1;
126 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); 138 shstr_alloc -= alloc;
139 g_slice_free1 (alloc, (void *)(s - sizeof (uint32_t) * NUM_INT));
127 } 140 }
128 else 141 else
129 ++i; 142 ++i;
130 } 143 }
131 144
132 curpos = *i; 145 curpos = *i;
133} 146}
134 147
135// declare these here to get correct initialisation order 148// declare these here to get correct initialisation order
136#define def(str) const shstr shstr_ ## str (# str); 149#define def2(id,str) const shstr id (str);
150#define def(id) def2(shstr_ ## id, # id)
137# include "shstrinc.h" 151# include "shstrinc.h"
138#undef def 152#undef def
153#undef def2
139 154
140shstr skill_names[NUM_SKILLS]; 155materialtype_t material_null;
141 156
142//TODO: this should of course not be here 157struct freed_map freed_map;
143
144/* buf_overflow() - we don't want to exceed the buffer size of
145 * buf1 by adding on buf2! Returns true if overflow will occur.
146 */
147int
148buf_overflow (const char *buf1, const char *buf2, int bufsize)
149{
150 int len1 = 0, len2 = 0;
151
152 if (buf1)
153 len1 = strlen (buf1);
154
155 if (buf2)
156 len2 = strlen (buf2);
157
158 if ((len1 + len2) >= bufsize)
159 return 1;
160
161 return 0;
162}

Diff Legend

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