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.18 by root, Tue Sep 12 20:55:40 2006 UTC vs.
Revision 1.51 by root, Fri Nov 18 04:44:13 2016 UTC

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

Diff Legend

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