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