|
|
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 | */ |
1 | |
21 | |
2 | /* |
22 | /* |
3 | * shstr.C |
23 | * shstr.C |
4 | */ |
24 | */ |
5 | |
25 | |
6 | #include <cstring> |
26 | #include <cstring> |
7 | #include <cstdlib> |
27 | #include <cstdlib> |
8 | |
|
|
9 | #include <glib.h> |
28 | #include <glib.h> |
10 | |
|
|
11 | #include <tr1/unordered_set> |
29 | #include <tr1/unordered_set> |
12 | |
30 | |
13 | #include "shstr.h" |
|
|
14 | #include "util.h" |
31 | #include "global.h" |
15 | |
32 | |
16 | typedef |
33 | typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT; |
17 | std::tr1::unordered_set < const char *, |
|
|
18 | str_hash, |
|
|
19 | str_equal > |
|
|
20 | HT; |
|
|
21 | |
34 | |
22 | static HT |
35 | static HT ht; |
23 | ht; |
|
|
24 | |
36 | |
25 | static const char * |
37 | static const char * |
26 | makevec (const char *s) |
38 | makevec (const char *s) |
27 | { |
39 | { |
28 | int |
|
|
29 | len = strlen (s); |
40 | int len = strlen (s); |
30 | |
41 | |
31 | const char * |
|
|
32 | 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)); |
33 | |
43 | |
34 | shstr::length (v) = len; |
44 | shstr::length (v) = len; |
35 | shstr::refcnt (v) = 1; |
45 | shstr::refcnt (v) = 1; |
36 | |
46 | |
37 | memcpy ((char *) v, s, len + 1); |
47 | memcpy ((char *) v, s, len + 1); |
38 | |
48 | |
39 | return v; |
49 | return v; |
40 | } |
50 | } |
41 | |
51 | |
42 | const char * |
52 | static const char * |
43 | shstr::null = makevec ("<nil>"); |
53 | makenull () |
|
|
54 | { |
|
|
55 | const char *s = makevec ("(null)"); |
|
|
56 | shstr::length (s) = 0; |
|
|
57 | return s; |
|
|
58 | } |
44 | |
59 | |
45 | // what weird misoptimisation is this again? |
60 | const char *shstr::null = makenull (); |
46 | const shstr undead_name ("undead"); |
|
|
47 | |
61 | |
48 | const char * |
62 | const char * |
49 | shstr::find (const char *s) |
63 | shstr::find (const char *s) |
50 | { |
64 | { |
51 | if (!s) |
65 | if (!s) |
52 | return s; |
66 | return s; |
53 | |
67 | |
54 | HT::iterator i = ht.find (s); |
68 | auto (i, ht.find (s)); |
55 | |
69 | |
56 | return i != ht.end ()? *i : 0; |
70 | return i != ht.end ()? *i : 0; |
57 | } |
71 | } |
58 | |
72 | |
59 | const char * |
73 | const char * |
… | |
… | |
76 | // periodically test refcounts == 0 for a few strings |
90 | // periodically test refcounts == 0 for a few strings |
77 | // this is the ONLY thing that erases stuff from ht. keep it that way. |
91 | // this is the ONLY thing that erases stuff from ht. keep it that way. |
78 | void |
92 | void |
79 | shstr::gc () |
93 | shstr::gc () |
80 | { |
94 | { |
81 | return; //D |
|
|
82 | //D currently disabled: some datastructures might still store them |
|
|
83 | //D but their pointers will become invalidated |
|
|
84 | static const char *curpos; |
95 | static const char *curpos; |
85 | |
96 | |
86 | HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); |
97 | auto (i, curpos ? ht.find (curpos) : ht.begin ()); |
87 | |
98 | |
88 | if (i == ht.end ()) |
99 | if (i == ht.end ()) |
89 | i = ht.begin (); |
100 | i = ht.begin (); |
90 | |
101 | |
91 | // go through all strings roughly once every 4 minutes |
102 | // go through all strings roughly once every 4 minutes |
… | |
… | |
100 | } |
111 | } |
101 | else if (!--n) |
112 | else if (!--n) |
102 | break; |
113 | break; |
103 | else if (!refcnt (*i)) |
114 | else if (!refcnt (*i)) |
104 | { |
115 | { |
105 | HT::iterator o = i++; |
116 | auto (o, i++); |
106 | const char *s = *o; |
117 | const char *s = *o; |
107 | |
118 | |
108 | ht.erase (o); |
119 | ht.erase (o); |
109 | |
120 | |
110 | //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)); |
… | |
… | |
115 | } |
126 | } |
116 | |
127 | |
117 | curpos = *i; |
128 | curpos = *i; |
118 | } |
129 | } |
119 | |
130 | |
|
|
131 | shstr skill_names[NUM_SKILLS]; |
|
|
132 | |
|
|
133 | // what weird misoptimisation is this again? |
|
|
134 | const shstr undead_name ("undead"); |
|
|
135 | |
120 | //TODO: this should of course not be here |
136 | //TODO: this should of course not be here |
121 | |
137 | |
122 | /* 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 |
123 | * buf1 by adding on buf2! Returns true if overflow will occur. |
139 | * buf1 by adding on buf2! Returns true if overflow will occur. |
124 | */ |
140 | */ |
125 | |
|
|
126 | int |
141 | int |
127 | buf_overflow (const char *buf1, const char *buf2, int bufsize) |
142 | buf_overflow (const char *buf1, const char *buf2, int bufsize) |
128 | { |
143 | { |
129 | int len1 = 0, len2 = 0; |
144 | int len1 = 0, len2 = 0; |
130 | |
145 | |
… | |
… | |
132 | len1 = strlen (buf1); |
147 | len1 = strlen (buf1); |
133 | if (buf2) |
148 | if (buf2) |
134 | len2 = strlen (buf2); |
149 | len2 = strlen (buf2); |
135 | if ((len1 + len2) >= bufsize) |
150 | if ((len1 + len2) >= bufsize) |
136 | return 1; |
151 | return 1; |
|
|
152 | |
137 | return 0; |
153 | return 0; |
138 | } |
154 | } |