|
|
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 "global.h" |
31 | #include "global.h" |
| 14 | |
32 | |
| 15 | typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT; |
33 | typedef std::tr1::unordered_set <const char *, str_hash, str_equal, slice_allocator<const char *>, true> HT; |
| … | |
… | |
| 45 | shstr::find (const char *s) |
63 | shstr::find (const char *s) |
| 46 | { |
64 | { |
| 47 | if (!s) |
65 | if (!s) |
| 48 | return s; |
66 | return s; |
| 49 | |
67 | |
| 50 | HT::iterator i = ht.find (s); |
68 | auto (i, ht.find (s)); |
| 51 | |
69 | |
| 52 | return i != ht.end ()? *i : 0; |
70 | return i != ht.end ()? *i : 0; |
| 53 | } |
71 | } |
| 54 | |
72 | |
| 55 | const char * |
73 | const char * |
| … | |
… | |
| 72 | // periodically test refcounts == 0 for a few strings |
90 | // periodically test refcounts == 0 for a few strings |
| 73 | // 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. |
| 74 | void |
92 | void |
| 75 | shstr::gc () |
93 | shstr::gc () |
| 76 | { |
94 | { |
| 77 | return; //D |
|
|
| 78 | //D currently disabled: some datastructures might still store them |
|
|
| 79 | //D but their pointers will become invalidated |
|
|
| 80 | static const char *curpos; |
95 | static const char *curpos; |
| 81 | |
96 | |
| 82 | HT::iterator i = curpos ? ht.find (curpos) : ht.begin (); |
97 | auto (i, curpos ? ht.find (curpos) : ht.begin ()); |
| 83 | |
98 | |
| 84 | if (i == ht.end ()) |
99 | if (i == ht.end ()) |
| 85 | i = ht.begin (); |
100 | i = ht.begin (); |
| 86 | |
101 | |
| 87 | // go through all strings roughly once every 4 minutes |
102 | // go through all strings roughly once every 4 minutes |
| … | |
… | |
| 96 | } |
111 | } |
| 97 | else if (!--n) |
112 | else if (!--n) |
| 98 | break; |
113 | break; |
| 99 | else if (!refcnt (*i)) |
114 | else if (!refcnt (*i)) |
| 100 | { |
115 | { |
| 101 | HT::iterator o = i++; |
116 | auto (o, i++); |
| 102 | const char *s = *o; |
117 | const char *s = *o; |
| 103 | |
118 | |
| 104 | ht.erase (o); |
119 | ht.erase (o); |
| 105 | |
120 | |
| 106 | //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)); |
| … | |
… | |
| 121 | //TODO: this should of course not be here |
136 | //TODO: this should of course not be here |
| 122 | |
137 | |
| 123 | /* 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 |
| 124 | * buf1 by adding on buf2! Returns true if overflow will occur. |
139 | * buf1 by adding on buf2! Returns true if overflow will occur. |
| 125 | */ |
140 | */ |
| 126 | |
|
|
| 127 | int |
141 | int |
| 128 | buf_overflow (const char *buf1, const char *buf2, int bufsize) |
142 | buf_overflow (const char *buf1, const char *buf2, int bufsize) |
| 129 | { |
143 | { |
| 130 | int len1 = 0, len2 = 0; |
144 | int len1 = 0, len2 = 0; |
| 131 | |
145 | |
| … | |
… | |
| 133 | len1 = strlen (buf1); |
147 | len1 = strlen (buf1); |
| 134 | if (buf2) |
148 | if (buf2) |
| 135 | len2 = strlen (buf2); |
149 | len2 = strlen (buf2); |
| 136 | if ((len1 + len2) >= bufsize) |
150 | if ((len1 + len2) >= bufsize) |
| 137 | return 1; |
151 | return 1; |
|
|
152 | |
| 138 | return 0; |
153 | return 0; |
| 139 | } |
154 | } |
