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.20 by root, Thu Sep 14 18:13:01 2006 UTC vs.
Revision 1.28 by root, Thu Nov 8 19:43:23 2007 UTC

1/*
2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 *
6 * Deliantra 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 <support@deliantra.net>
20 */
21
1/* 22/*
2 * shstr.C 23 * shstr.C
3 */ 24 */
4 25
5#include <cstring> 26#include <cstring>
6#include <cstdlib> 27#include <cstdlib>
7
8#include <glib.h> 28#include <glib.h>
9
10#include <tr1/unordered_set> 29#include <tr1/unordered_set>
11 30
12#include "global.h" 31#include "global.h"
32
33size_t shstr_alloc;
13 34
14typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT; 35typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT;
15 36
16static HT ht; 37static HT ht;
17 38
18static const char * 39static const char *
19makevec (const char *s) 40makevec (const char *s)
20{ 41{
21 int len = strlen (s); 42 int len = strlen (s);
22 43
44 shstr_alloc += sizeof (int) * 2 + len + 1;
23 const char *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));
24 46
25 shstr::length (v) = len; 47 shstr::length (v) = len;
26 shstr::refcnt (v) = 1; 48 shstr::refcnt (v) = 1;
27 49
… …
44shstr::find (const char *s) 66shstr::find (const char *s)
45{ 67{
46 if (!s) 68 if (!s)
47 return s; 69 return s;
48 70
49 AUTODECL (i, ht.find (s)); 71 auto (i, ht.find (s));
50 72
51 return i != ht.end ()? *i : 0; 73 return i != ht.end ()? *i : 0;
52} 74}
53 75
54const char * 76const char *
… …
73void 95void
74shstr::gc () 96shstr::gc ()
75{ 97{
76 static const char *curpos; 98 static const char *curpos;
77 99
78 AUTODECL (i, curpos ? ht.find (curpos) : ht.begin ()); 100 auto (i, curpos ? ht.find (curpos) : ht.begin ());
79 101
80 if (i == ht.end ()) 102 if (i == ht.end ())
81 i = ht.begin (); 103 i = ht.begin ();
82 104
83 // go through all strings roughly once every 4 minutes
84 int n = ht.size () / 256 + 16; 105 int n = ht.size () / 256 + 16;
85 106
86 for (;;) 107 for (;;)
87 { 108 {
88 if (i == ht.end ()) 109 if (i == ht.end ())
… …
92 } 113 }
93 else if (!--n) 114 else if (!--n)
94 break; 115 break;
95 else if (!refcnt (*i)) 116 else if (!refcnt (*i))
96 { 117 {
97 AUTODECL (o, i++); 118 auto (o, i++);
98 const char *s = *o; 119 const char *s = *o;
99 120
100 ht.erase (o); 121 ht.erase (o);
101 122
102 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 123 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
124 shstr_alloc -= sizeof (int) * 2 + length (s) + 1;
103 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s); 125 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
104 } 126 }
105 else 127 else
106 ++i; 128 ++i;
107 } 129 }
108 130
109 curpos = *i; 131 curpos = *i;
110} 132}
111 133
134// declare these here to get correct initialisation order
135#define def(str) const shstr shstr_ ## str (# str);
136# include "shstrinc.h"
137#undef def
138
112shstr skill_names[NUM_SKILLS]; 139shstr skill_names[NUM_SKILLS];
113
114// what weird misoptimisation is this again?
115const shstr undead_name ("undead");
116 140
117//TODO: this should of course not be here 141//TODO: this should of course not be here
118 142
119/* buf_overflow() - we don't want to exceed the buffer size of 143/* buf_overflow() - we don't want to exceed the buffer size of
120 * buf1 by adding on buf2! Returns true if overflow will occur. 144 * buf1 by adding on buf2! Returns true if overflow will occur.
121 */ 145 */
122
123int 146int
124buf_overflow (const char *buf1, const char *buf2, int bufsize) 147buf_overflow (const char *buf1, const char *buf2, int bufsize)
125{ 148{
126 int len1 = 0, len2 = 0; 149 int len1 = 0, len2 = 0;
127 150
128 if (buf1) 151 if (buf1)
129 len1 = strlen (buf1); 152 len1 = strlen (buf1);
153
130 if (buf2) 154 if (buf2)
131 len2 = strlen (buf2); 155 len2 = strlen (buf2);
156
132 if ((len1 + len2) >= bufsize) 157 if ((len1 + len2) >= bufsize)
133 return 1; 158 return 1;
159
134 return 0; 160 return 0;
135} 161}

Diff Legend

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