1 | /* |
1 | /* |
2 | * CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation; either version 2 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
|
|
18 | * You should have received a copy of the GNU General Public License |
|
|
19 | * along with this program; if not, write to the Free Software |
|
|
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
|
|
21 | * |
17 | * |
|
|
18 | * You should have received a copy of the Affero GNU General Public License |
|
|
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
|
|
21 | * |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
23 | */ |
24 | |
24 | |
25 | #include <cassert> |
25 | #include <cassert> |
26 | |
26 | |
27 | #include <global.h> |
27 | #include <global.h> |
28 | #include <funcpoint.h> |
|
|
29 | #include <loader.h> |
|
|
30 | |
28 | |
31 | #include <tr1/functional> |
29 | #include <tr1/functional> |
32 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
33 | |
31 | |
34 | int arch_init; /* True if doing arch initialization */ |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
35 | |
33 | arch_ptr archetype::empty; |
36 | /* The naming of these functions is really poor - they are all |
|
|
37 | * pretty much named '.._arch_...', but they may more may not |
|
|
38 | * return archetypes. Some make the arch_to_object call, and thus |
|
|
39 | * return an object. Perhaps those should be called 'archob' functions |
|
|
40 | * to denote they return an object derived from the archetype. |
|
|
41 | * MSW 2003-04-29 |
|
|
42 | */ |
|
|
43 | |
34 | |
44 | // the hashtable |
35 | // the hashtable |
45 | typedef std::tr1::unordered_map |
36 | typedef std::tr1::unordered_map |
46 | < |
37 | < |
47 | const char *, |
38 | const char *, |
… | |
… | |
49 | str_hash, |
40 | str_hash, |
50 | str_equal, |
41 | str_equal, |
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
42 | slice_allocator< std::pair<const char *const, arch_ptr> > |
52 | > HT; |
43 | > HT; |
53 | |
44 | |
54 | static HT ht (5000); |
45 | static HT ht (10000); |
|
|
46 | archvec archetypes; |
|
|
47 | static unordered_vector<archetype *> allarch; |
|
|
48 | static int dirtycnt; |
|
|
49 | |
|
|
50 | // the vector of other_arch references to be resolved |
|
|
51 | static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref; |
|
|
52 | // the vector of loaded but not yet committed archetypes |
|
|
53 | static std::vector<archetype *> postponed_arch; |
|
|
54 | |
|
|
55 | //+GPL |
|
|
56 | |
|
|
57 | /* |
|
|
58 | * Creates an object. This function is called by archetype::get () |
|
|
59 | * if it fails to find the appropriate archetype. |
|
|
60 | * Thus archetype::get() will be guaranteed to always return |
|
|
61 | * an object, and never NULL. |
|
|
62 | */ |
|
|
63 | static object * |
|
|
64 | create_singularity (const char *name) |
|
|
65 | { |
|
|
66 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
|
|
67 | |
|
|
68 | if (!strcmp (name, "bug")) |
|
|
69 | abort (); |
|
|
70 | |
|
|
71 | object *op = archetype::get (shstr_bug); |
|
|
72 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
73 | |
|
|
74 | return op; |
|
|
75 | } |
55 | |
76 | |
56 | /** |
77 | /** |
57 | * GROS - This function retrieves an archetype given the name that appears |
78 | * GROS - This function retrieves an archetype given the name that appears |
58 | * during the game (for example, "writing pen" instead of "stylus"). |
79 | * during the game (for example, "writing pen" instead of "stylus"). |
59 | * It does not use the hashtable system, but browse the whole archlist each time. |
80 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
67 | archetype * |
88 | archetype * |
68 | find_archetype_by_object_name (const char *name) |
89 | find_archetype_by_object_name (const char *name) |
69 | { |
90 | { |
70 | shstr_cmp name_cmp (name); |
91 | shstr_cmp name_cmp (name); |
71 | |
92 | |
72 | for (archetype *at = first_archetype; at; at = at->next) |
93 | for_all_archetypes (at) |
73 | if (at->clone.name == name_cmp) |
94 | if (at->name == name_cmp) |
74 | return at; |
95 | return at; |
75 | |
96 | |
76 | return 0; |
97 | return 0; |
77 | } |
98 | } |
78 | |
99 | |
… | |
… | |
84 | archetype * |
105 | archetype * |
85 | find_archetype_by_object_type_name (int type, const char *name) |
106 | find_archetype_by_object_type_name (int type, const char *name) |
86 | { |
107 | { |
87 | shstr_cmp name_cmp (name); |
108 | shstr_cmp name_cmp (name); |
88 | |
109 | |
89 | for (archetype *at = first_archetype; at; at = at->next) |
110 | for_all_archetypes (at) |
90 | if (at->clone.name == name_cmp && at->clone.type == type) |
111 | if (at->name == name_cmp && at->type == type) |
91 | return at; |
112 | return at; |
92 | |
113 | |
93 | return 0; |
114 | return 0; |
94 | } |
115 | } |
95 | |
116 | |
… | |
… | |
101 | object * |
122 | object * |
102 | get_archetype_by_skill_name (const char *skill, int type) |
123 | get_archetype_by_skill_name (const char *skill, int type) |
103 | { |
124 | { |
104 | shstr_cmp skill_cmp (skill); |
125 | shstr_cmp skill_cmp (skill); |
105 | |
126 | |
106 | for (archetype *at = first_archetype; at; at = at->next) |
127 | for_all_archetypes (at) |
107 | if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type)) |
128 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
108 | return arch_to_object (at); |
129 | return at->instance (); |
109 | |
130 | |
110 | return 0; |
131 | return 0; |
111 | } |
132 | } |
112 | |
133 | |
113 | /* similiar to above - this returns the first archetype |
134 | /* similiar to above - this returns the first archetype |
… | |
… | |
118 | * (eg, skills) |
139 | * (eg, skills) |
119 | */ |
140 | */ |
120 | archetype * |
141 | archetype * |
121 | get_archetype_by_type_subtype (int type, int subtype) |
142 | get_archetype_by_type_subtype (int type, int subtype) |
122 | { |
143 | { |
123 | for (archetype *at = first_archetype; at; at = at->next) |
144 | for_all_archetypes (at) |
124 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
145 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
125 | return at; |
146 | return at; |
126 | |
147 | |
127 | return 0; |
148 | return 0; |
128 | } |
149 | } |
129 | |
150 | |
… | |
… | |
134 | * - name: The name we're searching for (ex: "writing pen"); |
155 | * - name: The name we're searching for (ex: "writing pen"); |
135 | * Return value: |
156 | * Return value: |
136 | * - a corresponding object if found; a singularity object if not found. |
157 | * - a corresponding object if found; a singularity object if not found. |
137 | * Note by MSW - it appears that it takes the full name and keeps |
158 | * Note by MSW - it appears that it takes the full name and keeps |
138 | * shortening it until it finds a match. I re-wrote this so that it |
159 | * shortening it until it finds a match. I re-wrote this so that it |
139 | * doesn't malloc it each time - not that this function is used much, |
160 | * doesn't allocate it each time - not that this function is used much, |
140 | * but it otherwise had a big memory leak. |
161 | * but it otherwise had a big memory leak. |
141 | */ |
162 | */ |
142 | object * |
163 | object * |
143 | get_archetype_by_object_name (const char *name) |
164 | get_archetype_by_object_name (const char *name) |
144 | { |
165 | { |
145 | char tmpname[MAX_BUF]; |
166 | char tmpname[MAX_BUF]; |
146 | int i; |
|
|
147 | |
167 | |
148 | assign (tmpname, name); |
168 | assign (tmpname, name); |
149 | |
169 | |
150 | for (i = strlen (tmpname); i > 0; i--) |
170 | for (int i = strlen (tmpname); i > 0; i--) |
151 | { |
171 | { |
152 | tmpname[i] = 0; |
172 | tmpname[i] = 0; |
153 | |
173 | |
154 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
174 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
155 | return arch_to_object (at); |
175 | return at->instance (); |
156 | } |
176 | } |
157 | |
177 | |
158 | return create_singularity (name); |
178 | return create_singularity (name); |
159 | } |
179 | } |
160 | |
180 | |
161 | /* This is a subset of the parse_id command. Basically, name can be |
181 | /* This is a subset of the parse_id command. Basically, name can be |
162 | * a string seperated lists of things to match, with certain keywords. |
182 | * a string seperated lists of things to match, with certain keywords. |
163 | * pl is the player (only needed to set count properly) |
183 | * pl is the player (only needed to set count properly) |
164 | * op is the item we are trying to match. Calling function takes care |
184 | * op is the item we are trying to match. Calling function takes care |
165 | * of what action might need to be done and if it is valid |
185 | * of what action might need to be done and if it is valid |
166 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
186 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
167 | * value means a better match. 0 means no match. |
187 | * value means a better match. 0 means no match. |
168 | * |
188 | * |
169 | * Brief outline of the procedure: |
189 | * Brief outline of the procedure: |
170 | * We take apart the name variable into the individual components. |
190 | * We take apart the name variable into the individual components. |
171 | * cases for 'all' and unpaid are pretty obvious. |
191 | * cases for 'all' and unpaid are pretty obvious. |
172 | * Next, we check for a count (either specified in name, or in the |
192 | * Next, we check for a count (either specified in name, or in the |
173 | * player object.) |
193 | * player object.) |
174 | * If count is 1, make a quick check on the name. |
194 | * If count is 1, make a quick check on the name. |
175 | * IF count is >1, we need to make plural name. Return if match. |
195 | * IF count is >1, we need to make plural name. Return if match. |
176 | * Last, make a check on the full name. |
196 | * Last, make a check on the full name. |
177 | */ |
197 | */ |
178 | int |
198 | int |
179 | item_matched_string (object *pl, object *op, const char *name) |
199 | item_matched_string (object *pl, object *op, const char *name) |
180 | { |
200 | { |
181 | char *cp, local_name[MAX_BUF]; |
201 | char *cp, local_name[MAX_BUF]; |
182 | int count, retval = 0; |
202 | int count, retval = 0; |
… | |
… | |
192 | /* All is a very generic match - low match value */ |
212 | /* All is a very generic match - low match value */ |
193 | if (!strcmp (cp, "all")) |
213 | if (!strcmp (cp, "all")) |
194 | return 1; |
214 | return 1; |
195 | |
215 | |
196 | /* unpaid is a little more specific */ |
216 | /* unpaid is a little more specific */ |
197 | if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) |
217 | if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID]) |
198 | return 2; |
218 | return 2; |
199 | if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) |
219 | |
|
|
220 | if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED])) |
200 | return 2; |
221 | return 2; |
201 | |
222 | |
202 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
223 | if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED]) |
203 | return 2; |
224 | return 2; |
204 | |
225 | |
205 | /* Allow for things like '100 arrows' */ |
226 | /* Allow for things like '100 arrows' */ |
206 | if ((count = atoi (cp)) != 0) |
227 | if ((count = atoi (cp)) != 0) |
207 | { |
228 | { |
… | |
… | |
225 | * is because of the 'else' handling - we don't want to match on |
246 | * is because of the 'else' handling - we don't want to match on |
226 | * something and set a low retval, even though it may match a higher retcal |
247 | * something and set a low retval, even though it may match a higher retcal |
227 | * later. So keep it in descending order here, so we try for the best |
248 | * later. So keep it in descending order here, so we try for the best |
228 | * match first, and work downward. |
249 | * match first, and work downward. |
229 | */ |
250 | */ |
|
|
251 | const char *qbn0, *qbn1, *qsn; // query base name/short name caches |
|
|
252 | |
230 | if (!strcasecmp (cp, query_name (op))) |
253 | if (!strcasecmp (cp, query_name (op))) |
231 | retval = 20; |
254 | retval = 20; |
232 | else if (!strcasecmp (cp, query_short_name (op))) |
255 | else if (!strcasecmp (cp, qsn = query_short_name (op))) |
233 | retval = 18; |
256 | retval = 18; |
234 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
257 | else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0))) |
235 | retval = 16; |
258 | retval = 16; |
236 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
259 | else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1))) |
237 | retval = 16; |
260 | retval = 16; |
238 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
261 | else if (op->custom_name && !strcasecmp (cp, op->custom_name)) |
239 | retval = 15; |
262 | retval = 15; |
240 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
263 | else if (!strncasecmp (cp, qbn0, strlen (cp))) |
241 | retval = 14; |
264 | retval = 14; |
242 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
265 | else if (!strncasecmp (cp, qbn1, strlen (cp))) |
243 | retval = 14; |
266 | retval = 14; |
244 | /* Do substring checks, so things like 'Str+1' will match. |
267 | /* Do substring checks, so things like 'Str+1' will match. |
245 | * retval of these should perhaps be lower - they are lower |
268 | * retval of these should perhaps be lower - they are lower |
246 | * then the specific strcasecmp aboves, but still higher than |
269 | * then the specific strcasecmp aboves, but still higher than |
247 | * some other match criteria. |
270 | * some other match criteria. |
248 | */ |
271 | */ |
249 | else if (strstr (query_base_name (op, 1), cp)) |
272 | else if (strstr (qbn1, cp)) |
250 | retval = 12; |
273 | retval = 12; |
251 | else if (strstr (query_base_name (op, 0), cp)) |
274 | else if (strstr (qbn0, cp)) |
252 | retval = 12; |
275 | retval = 12; |
253 | else if (strstr (query_short_name (op), cp)) |
276 | else if (strstr (qsn, cp)) |
254 | retval = 12; |
277 | retval = 12; |
255 | /* Check against plural/non plural based on count. */ |
278 | /* Check against plural/non plural based on count. */ |
256 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
279 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
257 | retval = 6; |
280 | retval = 6; |
258 | else if (count == 1 && !strcasecmp (op->name, cp)) |
281 | else if (count == 1 && !strcasecmp (op->name, cp)) |
259 | retval = 6; |
282 | retval = 6; |
260 | /* base name matched - not bad */ |
283 | /* base name matched - not bad */ |
261 | else if (strcasecmp (cp, op->name) == 0 && !count) |
284 | else if (strcasecmp (cp, op->name) == 0 && !count) |
262 | retval = 4; |
285 | retval = 4; |
263 | /* Check for partial custom name, but give a real low priority */ |
286 | /* Check for partial custom name, but give a real low priority */ |
264 | else if (op->custom_name && strstr (op->custom_name, cp)) |
287 | else if (op->custom_name.contains (cp)) |
265 | retval = 3; |
288 | retval = 3; |
266 | |
289 | |
267 | if (retval) |
290 | if (retval) |
268 | { |
291 | { |
269 | if (pl->type == PLAYER) |
292 | if (pl->type == PLAYER) |
… | |
… | |
274 | } |
297 | } |
275 | |
298 | |
276 | return 0; |
299 | return 0; |
277 | } |
300 | } |
278 | |
301 | |
279 | /* |
302 | //-GPL |
280 | * Initialises the internal linked list of archetypes (read from file). |
|
|
281 | * Then the global "empty_archetype" pointer is initialised. |
|
|
282 | * Then the blocksview[] array is initialised. |
|
|
283 | */ |
|
|
284 | |
303 | |
285 | void |
304 | void |
286 | init_archetypes (void) |
305 | archetype::do_delete () |
287 | { /* called from add_player() and edit() */ |
306 | { |
288 | if (first_archetype != NULL) /* Only do this once */ |
307 | delete this; |
289 | return; |
|
|
290 | |
|
|
291 | arch_init = 1; |
|
|
292 | load_archetypes (); |
|
|
293 | arch_init = 0; |
|
|
294 | empty_archetype = archetype::find ("empty_archetype"); |
|
|
295 | |
|
|
296 | /* init_blocksview();*/ |
|
|
297 | } |
308 | } |
298 | |
309 | |
299 | /* |
310 | archetype::archetype (const char *name) |
300 | * An alternative way to init the hashtable which is slower, but _works_... |
311 | { |
301 | */ |
312 | arch = this; |
|
|
313 | this->archname = this->name = this->name_pl = name; |
|
|
314 | } |
|
|
315 | |
|
|
316 | archetype::~archetype () |
|
|
317 | { |
|
|
318 | unlink (); |
|
|
319 | } |
|
|
320 | |
302 | void |
321 | void |
303 | init_archetable (void) |
322 | archetype::link () |
304 | { |
323 | { |
305 | LOG (llevDebug, " Setting up archetable...\n"); |
324 | if (!archetypes.contains (this)) |
306 | |
325 | { |
307 | for (archetype *at = first_archetype; at; at = at->next) |
326 | archetypes.insert (this); |
308 | for (archetype *bt = at; bt; bt = bt->more) |
327 | ht.insert (std::make_pair (archname, this)); |
309 | bt->hash_add (); |
328 | } |
310 | |
|
|
311 | LOG (llevDebug, "done\n"); |
|
|
312 | } |
329 | } |
313 | |
330 | |
314 | void |
331 | void |
315 | free_all_archs (void) |
332 | archetype::unlink () |
316 | { |
333 | { |
317 | archetype *at, *next; |
334 | if (archetypes.contains (this)) |
318 | int i = 0, f = 0; |
|
|
319 | |
|
|
320 | for (at = first_archetype; at; at = next) |
|
|
321 | { |
|
|
322 | if (at->more) |
|
|
323 | next = at->more; |
|
|
324 | else |
|
|
325 | next = at->next; |
|
|
326 | |
|
|
327 | delete |
|
|
328 | at; |
|
|
329 | |
|
|
330 | i++; |
|
|
331 | } |
335 | { |
332 | |
336 | archetypes.erase (this); |
333 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
337 | ht.erase (archname); |
334 | } |
|
|
335 | |
|
|
336 | archetype::archetype () |
|
|
337 | { |
|
|
338 | clone.arch = this; |
|
|
339 | |
|
|
340 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
|
|
341 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
342 | } |
|
|
343 | |
|
|
344 | archetype::~archetype () |
|
|
345 | { |
|
|
346 | //TODO: nuke ->more's |
|
|
347 | } |
|
|
348 | |
|
|
349 | archetype * |
|
|
350 | archetype::read (object_thawer &f) |
|
|
351 | { |
|
|
352 | assert (f.kw == KW_object); |
|
|
353 | |
|
|
354 | archetype *head = new archetype; |
|
|
355 | f.get (head->name); |
|
|
356 | |
|
|
357 | if (!head->clone.parse_kv (f)) |
|
|
358 | { |
338 | } |
359 | delete head; |
|
|
360 | return 0; |
|
|
361 | } |
|
|
362 | |
|
|
363 | for (archetype *prev = head; f.kw == KW_more; ) |
|
|
364 | { |
|
|
365 | f.next (); |
|
|
366 | |
|
|
367 | assert (f.kw == KW_object); |
|
|
368 | |
|
|
369 | archetype *more = new archetype; |
|
|
370 | f.get (more->name); |
|
|
371 | |
|
|
372 | if (!more->clone.parse_kv (f)) |
|
|
373 | { |
|
|
374 | delete head; |
|
|
375 | return 0; |
|
|
376 | } |
|
|
377 | |
|
|
378 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
|
|
379 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
|
|
380 | |
|
|
381 | more->head = head; |
|
|
382 | more->clone.head = &head->clone; |
|
|
383 | prev->more = more; |
|
|
384 | prev->clone.more = &more->clone; |
|
|
385 | |
|
|
386 | prev = more; |
|
|
387 | } |
|
|
388 | |
|
|
389 | head->next = first_archetype; |
|
|
390 | first_archetype = head; |
|
|
391 | |
|
|
392 | return head; |
|
|
393 | } |
|
|
394 | |
|
|
395 | /* |
|
|
396 | * Reads/parses the archetype-file, and copies into a linked list |
|
|
397 | * of archetype-structures. |
|
|
398 | */ |
|
|
399 | static bool |
|
|
400 | first_arch_pass (object_thawer &f) |
|
|
401 | { |
|
|
402 | for (;;) |
|
|
403 | { |
|
|
404 | switch (f.kw) |
|
|
405 | { |
|
|
406 | case KW_object: |
|
|
407 | if (!archetype::read (f)) |
|
|
408 | return false; |
|
|
409 | continue; |
|
|
410 | |
|
|
411 | case KW_EOF: |
|
|
412 | return true; |
|
|
413 | |
|
|
414 | default: |
|
|
415 | if (!f.parse_error ("archetypes file")) |
|
|
416 | return false; |
|
|
417 | } |
|
|
418 | |
|
|
419 | f.next (); |
|
|
420 | } |
|
|
421 | } |
|
|
422 | |
|
|
423 | /* |
|
|
424 | * Reads the archetype file once more, and links all pointers between |
|
|
425 | * archetypes. |
|
|
426 | */ |
|
|
427 | void |
|
|
428 | second_arch_pass (object_thawer & thawer) |
|
|
429 | { |
|
|
430 | char buf[MAX_BUF], *variable = buf, *argument, *cp; |
|
|
431 | archetype *at = NULL, *other; |
|
|
432 | |
|
|
433 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
434 | { |
|
|
435 | if (*buf == '#') |
|
|
436 | continue; |
|
|
437 | |
|
|
438 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
439 | { |
|
|
440 | *argument = '\0', argument++; |
|
|
441 | cp = argument + strlen (argument) - 1; |
|
|
442 | while (isspace (*cp)) |
|
|
443 | { |
|
|
444 | *cp = '\0'; |
|
|
445 | cp--; |
|
|
446 | } |
|
|
447 | } |
|
|
448 | |
|
|
449 | if (!strcmp ("object", variable)) |
|
|
450 | { |
|
|
451 | if ((at = archetype::find (argument)) == NULL) |
|
|
452 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
453 | } |
|
|
454 | else if (!strcmp ("other_arch", variable)) |
|
|
455 | { |
|
|
456 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
457 | { |
|
|
458 | if ((other = archetype::find (argument)) == NULL) |
|
|
459 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
|
|
460 | else if (at != NULL) |
|
|
461 | at->clone.other_arch = other; |
|
|
462 | } |
|
|
463 | } |
|
|
464 | else if (!strcmp ("randomitems", variable)) |
|
|
465 | { |
|
|
466 | if (at) |
|
|
467 | { |
|
|
468 | treasurelist *tl = find_treasurelist (argument); |
|
|
469 | |
|
|
470 | if (tl == NULL) |
|
|
471 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
|
|
472 | else |
|
|
473 | at->clone.randomitems = tl; |
|
|
474 | } |
|
|
475 | } |
|
|
476 | } |
|
|
477 | } |
|
|
478 | |
|
|
479 | /* |
|
|
480 | * First initialises the archtype hash-table (init_archetable()). |
|
|
481 | * Reads and parses the archetype file (with the first and second-pass |
|
|
482 | * functions). |
|
|
483 | * Then initialises treasures by calling load_treasures(). |
|
|
484 | */ |
|
|
485 | void |
|
|
486 | load_archetypes (void) |
|
|
487 | { |
|
|
488 | char filename[MAX_BUF]; |
|
|
489 | |
|
|
490 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
|
|
491 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
492 | |
|
|
493 | { |
|
|
494 | object_thawer f (filename); |
|
|
495 | |
|
|
496 | f.next (); |
|
|
497 | |
|
|
498 | LOG (llevDebug, " arch-pass 1...\n"); |
|
|
499 | if (!first_arch_pass (f)) |
|
|
500 | cleanup ("errors during first arch pass are fatal"); |
|
|
501 | LOG (llevDebug, " done\n"); |
|
|
502 | } |
|
|
503 | |
|
|
504 | init_archetable (); |
|
|
505 | warn_archetypes = 1; |
|
|
506 | |
|
|
507 | { |
|
|
508 | object_thawer f (filename); |
|
|
509 | |
|
|
510 | LOG (llevDebug, " loading treasure...\n"); |
|
|
511 | load_treasures (); |
|
|
512 | LOG (llevDebug, " done\n"); |
|
|
513 | LOG (llevDebug, " arch-pass 2...\n"); |
|
|
514 | second_arch_pass (f); |
|
|
515 | LOG (llevDebug, " done\n"); |
|
|
516 | } |
|
|
517 | LOG (llevDebug, " done\n"); |
|
|
518 | } |
|
|
519 | |
|
|
520 | /* |
|
|
521 | * Creates and returns a new object which is a copy of the given archetype. |
|
|
522 | * This function returns NULL on failure. |
|
|
523 | */ |
|
|
524 | object * |
|
|
525 | arch_to_object (archetype *at) |
|
|
526 | { |
|
|
527 | if (!at) |
|
|
528 | { |
|
|
529 | if (warn_archetypes) |
|
|
530 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
531 | |
|
|
532 | return NULL; |
|
|
533 | } |
|
|
534 | |
|
|
535 | object *op = at->clone.clone (); |
|
|
536 | op->arch = at; |
|
|
537 | op->instantiate (); |
|
|
538 | return op; |
|
|
539 | } |
|
|
540 | |
|
|
541 | /* |
|
|
542 | * Creates an object. This function is called by get_archetype() |
|
|
543 | * if it fails to find the appropriate archetype. |
|
|
544 | * Thus get_archetype() will be guaranteed to always return |
|
|
545 | * an object, and never NULL. |
|
|
546 | */ |
|
|
547 | object * |
|
|
548 | create_singularity (const char *name) |
|
|
549 | { |
|
|
550 | object *op; |
|
|
551 | char buf[MAX_BUF]; |
|
|
552 | |
|
|
553 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
|
|
554 | op = object::create (); |
|
|
555 | op->name = op->name_pl = buf; |
|
|
556 | SET_FLAG (op, FLAG_NO_PICK); |
|
|
557 | return op; |
|
|
558 | } |
|
|
559 | |
|
|
560 | /* |
|
|
561 | * Finds which archetype matches the given name, and returns a new |
|
|
562 | * object containing a copy of the archetype. |
|
|
563 | */ |
|
|
564 | object * |
|
|
565 | get_archetype (const char *name) |
|
|
566 | { |
|
|
567 | archetype *at = archetype::find (name); |
|
|
568 | |
|
|
569 | if (!at) |
|
|
570 | return create_singularity (name); |
|
|
571 | |
|
|
572 | return arch_to_object (at); |
|
|
573 | } |
|
|
574 | |
|
|
575 | /* |
|
|
576 | * Hash-function used by the arch-hashtable. |
|
|
577 | */ |
|
|
578 | |
|
|
579 | unsigned long |
|
|
580 | hasharch (const char *str, int tablesize) |
|
|
581 | { |
|
|
582 | unsigned long hash = 0; |
|
|
583 | unsigned int i = 0; |
|
|
584 | const char *p; |
|
|
585 | |
|
|
586 | /* use the one-at-a-time hash function, which supposedly is |
|
|
587 | * better than the djb2-like one used by perl5.005, but |
|
|
588 | * certainly is better then the bug used here before. |
|
|
589 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
590 | */ |
|
|
591 | for (p = str; i < MAXSTRING && *p; p++, i++) |
|
|
592 | { |
|
|
593 | hash += *p; |
|
|
594 | hash += hash << 10; |
|
|
595 | hash ^= hash >> 6; |
|
|
596 | } |
|
|
597 | |
|
|
598 | hash += hash << 3; |
|
|
599 | hash ^= hash >> 11; |
|
|
600 | hash += hash << 15; |
|
|
601 | |
|
|
602 | return hash % tablesize; |
|
|
603 | } |
339 | } |
604 | |
340 | |
605 | /* |
341 | /* |
606 | * Finds, using the hashtable, which archetype matches the given name. |
342 | * Finds, using the hashtable, which archetype matches the given name. |
607 | * returns a pointer to the found archetype, otherwise NULL. |
343 | * returns a pointer to the found archetype, otherwise NULL. |
… | |
… | |
610 | archetype::find (const char *name) |
346 | archetype::find (const char *name) |
611 | { |
347 | { |
612 | if (!name) |
348 | if (!name) |
613 | return 0; |
349 | return 0; |
614 | |
350 | |
615 | AUTODECL (i, ht.find (name)); |
351 | auto (i, ht.find (name)); |
616 | |
352 | |
617 | if (i == ht.end ()) |
353 | if (i == ht.end ()) |
618 | return 0; |
354 | return 0; |
619 | else |
355 | else |
620 | return i->second; |
356 | return i->second; |
621 | } |
357 | } |
622 | |
358 | |
|
|
359 | void |
|
|
360 | archetype::post_load_check () |
|
|
361 | { |
|
|
362 | assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL])); |
|
|
363 | |
|
|
364 | if (type == SKILL) |
|
|
365 | add_skill_archetype (this); |
|
|
366 | |
|
|
367 | object::post_load_check (); |
|
|
368 | } |
|
|
369 | |
|
|
370 | archetype * |
|
|
371 | archetype::read (object_thawer &f) |
|
|
372 | { |
|
|
373 | assert (f.kw == KW_object); |
|
|
374 | |
|
|
375 | std::vector<archetype *> parts; |
|
|
376 | |
|
|
377 | coroapi::cede_to_tick (); |
|
|
378 | |
|
|
379 | for (;;) |
|
|
380 | { |
|
|
381 | archetype *at = new archetype (f.get_str ()); |
|
|
382 | |
|
|
383 | f.next (); |
|
|
384 | |
|
|
385 | #if 0 |
|
|
386 | // implementing it here in the server does neither allow multiple inheritence |
|
|
387 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
388 | // and other resource files dynamically loaded (as opposed to being preprocessed). |
|
|
389 | // not that any of this is relevant as of yet... |
|
|
390 | if (f.kw == KW_inherit) |
|
|
391 | { |
|
|
392 | if (archetype *at = find (f.get_str ())) |
|
|
393 | *op = at->clone; |
|
|
394 | else |
|
|
395 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
|
|
396 | &at->archname, f.get_str ()); |
|
|
397 | |
|
|
398 | f.next (); |
|
|
399 | } |
|
|
400 | #endif |
|
|
401 | |
|
|
402 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
403 | bool parse_ok = at->parse_kv (f); |
|
|
404 | loading_arch = 0; |
|
|
405 | |
|
|
406 | if (!parse_ok) |
|
|
407 | goto fail; |
|
|
408 | |
|
|
409 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
410 | at->post_load_check (); |
|
|
411 | loading_arch = 0; |
|
|
412 | |
|
|
413 | parts.push_back (at); |
|
|
414 | |
|
|
415 | if (f.kw != KW_more) |
|
|
416 | break; |
|
|
417 | |
|
|
418 | f.next (); |
|
|
419 | |
|
|
420 | if (f.kw != KW_object) |
|
|
421 | { |
|
|
422 | f.parse_error ("more object"); |
|
|
423 | goto fail; |
|
|
424 | } |
|
|
425 | } |
|
|
426 | |
|
|
427 | { |
|
|
428 | auto (at, parts.begin ()); |
|
|
429 | |
|
|
430 | archetype *new_head = parts.front (); |
|
|
431 | archetype *old_head = find (new_head->archname); |
|
|
432 | |
|
|
433 | if (old_head && !old_head->is_head ()) |
|
|
434 | { |
|
|
435 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
436 | &new_head->archname, &old_head->archname); |
|
|
437 | goto fail; |
|
|
438 | } |
|
|
439 | |
|
|
440 | // check that all archetypes belong to the same old object or are new |
|
|
441 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
|
|
442 | { |
|
|
443 | archetype *new_part = *at; |
|
|
444 | archetype *old_part = find (new_part->archname); |
|
|
445 | |
|
|
446 | if (old_part && old_part->head_ () != old_head) |
|
|
447 | { |
|
|
448 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
|
|
449 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
|
|
450 | goto fail; |
|
|
451 | } |
|
|
452 | } |
|
|
453 | |
|
|
454 | // assemble new chain |
|
|
455 | new_head->max_x = new_head->x; |
|
|
456 | |
|
|
457 | archetype *less = new_head; |
|
|
458 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
|
|
459 | { |
|
|
460 | archetype *at = *p; |
|
|
461 | |
|
|
462 | // some flags get inherited from the head (probably a lot more) |
|
|
463 | // doing it here doesn't feel too cozy, but it allows code |
|
|
464 | // to ignore head checks for these flags, which saves time |
|
|
465 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
466 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
467 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
468 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
469 | |
|
|
470 | new_head->max_x = max (new_head->max_x, at->x); |
|
|
471 | |
|
|
472 | at->head = new_head; |
|
|
473 | less->more = at; |
|
|
474 | less = at; |
|
|
475 | } |
|
|
476 | |
|
|
477 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
|
|
478 | |
|
|
479 | return new_head; |
|
|
480 | } |
|
|
481 | |
|
|
482 | fail: |
|
|
483 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
484 | (*p)->destroy (); |
|
|
485 | |
|
|
486 | return 0; |
|
|
487 | } |
|
|
488 | |
|
|
489 | void |
|
|
490 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
|
|
491 | { |
|
|
492 | ref = 0; |
|
|
493 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
|
|
494 | } |
|
|
495 | |
|
|
496 | void |
|
|
497 | archetype::commit_load () |
|
|
498 | { |
|
|
499 | // unlink old archetypes and link in new ones */ |
|
|
500 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
|
|
501 | { |
|
|
502 | archetype *at = *p; |
|
|
503 | |
|
|
504 | if (archetype *old = find (at->archname)) |
|
|
505 | old->unlink (); |
|
|
506 | |
|
|
507 | allarch.push_back (at); |
|
|
508 | |
|
|
509 | at->link (); |
|
|
510 | ++dirtycnt; |
|
|
511 | } |
|
|
512 | |
|
|
513 | postponed_arch.clear (); |
|
|
514 | |
|
|
515 | // now resolve arch references |
|
|
516 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
|
|
517 | { |
|
|
518 | arch_ptr *ap = p->first; |
|
|
519 | archetype *at = find (p->second); |
|
|
520 | |
|
|
521 | if (!at) |
|
|
522 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
|
|
523 | |
|
|
524 | *ap = at; |
|
|
525 | } |
|
|
526 | |
|
|
527 | postponed_arch_ref.clear (); |
|
|
528 | |
|
|
529 | empty = find (shstr_empty_archetype); |
|
|
530 | } |
|
|
531 | |
|
|
532 | void |
|
|
533 | archetype::gc () |
|
|
534 | { |
|
|
535 | int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt)); |
|
|
536 | dirtycnt = max (0, dirtycnt - cnt); |
|
|
537 | |
|
|
538 | do |
|
|
539 | { |
|
|
540 | static int idx; |
|
|
541 | |
|
|
542 | if (idx >= allarch.size ()) |
|
|
543 | if (idx) |
|
|
544 | idx = 0; |
|
|
545 | else |
|
|
546 | return; |
|
|
547 | |
|
|
548 | archetype *at = allarch [idx]; |
|
|
549 | |
|
|
550 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
|
|
551 | ++idx; |
|
|
552 | else |
|
|
553 | { |
|
|
554 | //LOG (llevDebug, "garbage collect arch %s", &at->archname); |
|
|
555 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
|
|
556 | allarch.erase (idx); |
|
|
557 | |
|
|
558 | // break chain |
|
|
559 | for (object *op = at->head_ (); op; ) |
|
|
560 | { |
|
|
561 | object *next = op->more; |
|
|
562 | op->head = 0; |
|
|
563 | op->more = 0; |
|
|
564 | op = next; |
|
|
565 | } |
|
|
566 | |
|
|
567 | at->destroy (); |
|
|
568 | at->arch = 0; |
|
|
569 | } |
|
|
570 | } |
|
|
571 | while (--cnt); |
|
|
572 | } |
|
|
573 | |
|
|
574 | object * |
|
|
575 | archetype::instance () |
|
|
576 | { |
|
|
577 | object *op = clone (); |
|
|
578 | op->instantiate (); |
|
|
579 | return op; |
|
|
580 | } |
|
|
581 | |
|
|
582 | //+GPL |
|
|
583 | |
623 | /* |
584 | /* |
624 | * Adds an archetype to the hashtable. |
585 | * Finds which archetype matches the given name, and returns a new |
|
|
586 | * object containing a copy of the archetype. |
625 | */ |
587 | */ |
626 | void |
588 | object * |
627 | archetype::hash_add () |
589 | archetype::get (const char *name) |
628 | { |
590 | { |
629 | ht.insert (std::make_pair (name, this)); |
591 | archetype *at = find (name); |
630 | } |
|
|
631 | |
592 | |
632 | void |
593 | if (!at) |
633 | archetype::hash_del () |
594 | return create_singularity (name); |
634 | { |
595 | |
635 | ht.erase (name); |
596 | return at->instance (); |
636 | } |
597 | } |
637 | |
598 | |
638 | /* |
599 | /* |
639 | * Returns the first archetype using the given type. |
600 | * Returns the first archetype using the given type. |
640 | * Used in treasure-generation. |
601 | * Used in treasure-generation. |
641 | */ |
602 | */ |
642 | archetype * |
603 | static archetype * |
643 | type_to_archetype (int type) |
604 | type_to_archetype (int type) |
644 | { |
605 | { |
645 | archetype *at; |
606 | for_all_archetypes (at) |
646 | |
607 | if (at->type == type && at->head_ () != at) |
647 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
|
|
648 | if (at->clone.type == type) |
|
|
649 | return at; |
608 | return at; |
650 | |
609 | |
651 | return 0; |
610 | return 0; |
652 | } |
611 | } |
653 | |
612 | |
654 | /* |
613 | /* |
655 | * Returns a new object copied from the first archetype matching |
614 | * Returns a new object copied from the first archetype matching |
656 | * the given type. |
615 | * the given type. |
657 | * Used in treasure-generation. |
616 | * Used in treasure-generation. |
658 | */ |
617 | */ |
659 | |
|
|
660 | object * |
618 | object * |
661 | clone_arch (int type) |
619 | clone_arch (int type) |
662 | { |
620 | { |
663 | archetype *at; |
621 | archetype *at = type_to_archetype (type); |
664 | |
622 | |
665 | if ((at = type_to_archetype (type)) == NULL) |
623 | if (!at) |
666 | { |
624 | { |
667 | LOG (llevError, "Can't clone archetype %d\n", type); |
625 | LOG (llevError, "Can't clone archetype %d\n", type); |
668 | return 0; |
626 | return 0; |
669 | } |
627 | } |
670 | |
628 | |
671 | object *op = at->clone.clone (); |
629 | return at->instance (); |
672 | op->instantiate (); |
|
|
673 | return op; |
|
|
674 | } |
630 | } |
675 | |
631 | |
676 | /* |
632 | /* |
677 | * member: make instance from class |
633 | * member: make instance from class |
678 | */ |
634 | */ |
679 | |
|
|
680 | object * |
635 | object * |
681 | object_create_arch (archetype *at) |
636 | object_create_arch (archetype *at) |
682 | { |
637 | { |
683 | object *op, *prev = 0, *head = 0; |
638 | object *op, *prev = 0, *head = 0; |
684 | |
639 | |
685 | while (at) |
640 | while (at) |
686 | { |
641 | { |
687 | op = arch_to_object (at); |
642 | op = at->instance (); |
|
|
643 | |
688 | op->x = at->clone.x; |
644 | op->x = at->x; |
689 | op->y = at->clone.y; |
645 | op->y = at->y; |
690 | |
646 | |
691 | if (head) |
647 | if (head) |
692 | op->head = head, prev->more = op; |
648 | op->head = head, prev->more = op; |
693 | |
649 | |
694 | if (!head) |
650 | if (!head) |
695 | head = op; |
651 | head = op; |
696 | |
652 | |
697 | prev = op; |
653 | prev = op; |
698 | at = at->more; |
654 | at = (archetype *)at->more; |
699 | } |
655 | } |
700 | |
656 | |
701 | return (head); |
657 | return head; |
702 | } |
658 | } |
703 | |
659 | |
|
|
660 | //-GPL |
|
|
661 | |