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.10 by root, Tue Sep 5 19:18:04 2006 UTC vs.
Revision 1.24 by root, Sun Jul 1 05:00:18 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 */
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 "shstr.h"
13#include "util.h" 31#include "global.h"
14 32
15typedef std::tr1::unordered_set<const char *, str_hash, str_equal> HT; 33typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT;
16 34
17static HT ht; 35static HT ht;
18 36
19static const char *makevec (const char *s) 37static const char *
38makevec (const char *s)
20{ 39{
21 int len = strlen (s); 40 int len = strlen (s);
22 41
23 const char *v = (const char *)(2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1)); 42 const char *v = (const char *) (2 + (int *)g_slice_alloc (sizeof (int) * 2 + len + 1));
24 43
25 shstr::length (v) = len; 44 shstr::length (v) = len;
26 shstr::refcnt (v) = 1; 45 shstr::refcnt (v) = 1;
27 46
28 memcpy ((char *)v, s, len + 1); 47 memcpy ((char *) v, s, len + 1);
29 48
30 return v; 49 return v;
31} 50}
32 51
52static const char *
53makenull ()
54{
33const char *shstr::null = makevec ("<nil>"); 55 const char *s = makevec ("(null)");
56 shstr::length (s) = 0;
57 return s;
58}
34 59
35// what weird misoptimisation is this again? 60const char *shstr::null = makenull ();
36const shstr undead_name ("undead");
37 61
38const char * 62const char *
39shstr::find (const char *s) 63shstr::find (const char *s)
40{ 64{
41 if (!s) 65 if (!s)
42 return s; 66 return s;
43 67
44 HT::iterator i = ht.find (s); 68 auto (i, ht.find (s));
45 69
46 return i != ht.end () 70 return i != ht.end ()? *i : 0;
47 ? *i
48 : 0;
49} 71}
50 72
51const char * 73const char *
52shstr::intern (const char *s) 74shstr::intern (const char *s)
53{ 75{
… …
70void 92void
71shstr::gc () 93shstr::gc ()
72{ 94{
73 static const char *curpos; 95 static const char *curpos;
74 96
75 HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); 97 auto (i, curpos ? ht.find (curpos) : ht.begin ());
76 98
77 if (i == ht.end ()) 99 if (i == ht.end ())
78 i = ht.begin (); 100 i = ht.begin ();
79 101
80 // go through all strings roughly once every 4 minutes 102 // go through all strings roughly once every 4 minutes
81 int n = ht.size () / 256 + 16000; 103 int n = ht.size () / 256 + 16;
82 104
83 for (;;) 105 for (;;)
84 { 106 {
85 if (i == ht.end ()) 107 if (i == ht.end ())
86 { 108 {
… …
89 } 111 }
90 else if (!--n) 112 else if (!--n)
91 break; 113 break;
92 else if (!refcnt (*i)) 114 else if (!refcnt (*i))
93 { 115 {
94 HT::iterator o = i++; 116 auto (o, i++);
95 const char *s = *o; 117 const char *s = *o;
118
96 ht.erase (o); 119 ht.erase (o);
97 120
98 int len = length (s);
99
100 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s)); 121 //printf ("GC %4d %3d %d >%s<%d\n", (int)ht.size (), n, shstr::refcnt (s), s, shstr::length (s));
101 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *)s); 122 g_slice_free1 (sizeof (int) * 2 + length (s) + 1, -2 + (int *) s);
102 } 123 }
103 else 124 else
104 ++i; 125 ++i;
105 } 126 }
106 127
107 curpos = *i; 128 curpos = *i;
108} 129}
109 130
131shstr skill_names[NUM_SKILLS];
132
133// what weird misoptimisation is this again?
134const shstr undead_name ("undead");
135
110//TODO: this should of course not be here 136//TODO: this should of course not be here
137
111/* buf_overflow() - we don't want to exceed the buffer size of 138/* buf_overflow() - we don't want to exceed the buffer size of
112 * buf1 by adding on buf2! Returns true if overflow will occur. 139 * buf1 by adding on buf2! Returns true if overflow will occur.
113 */ 140 */
114
115int 141int
116buf_overflow (const char *buf1, const char *buf2, int bufsize) 142buf_overflow (const char *buf1, const char *buf2, int bufsize)
117{ 143{
118 int len1 = 0, len2 = 0; 144 int len1 = 0, len2 = 0;
119 145
120 if (buf1) 146 if (buf1)
121 len1 = strlen (buf1); 147 len1 = strlen (buf1);
122 if (buf2) 148 if (buf2)
123 len2 = strlen (buf2); 149 len2 = strlen (buf2);
124 if ((len1 + len2) >= bufsize) 150 if ((len1 + len2) >= bufsize)
125 return 1;
126 return 0; 151 return 1;
152
153 return 0;
127} 154}
128

Diff Legend

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