1 | |
|
|
2 | /* |
1 | /* |
3 | * static char *rcsid_arch_c = |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
4 | * "$Id: arch.C,v 1.16 2006/09/10 16:00:23 root Exp $"; |
3 | * |
5 | */ |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
6 | |
|
|
7 | /* |
|
|
8 | CrossFire, A Multiplayer game for X-windows |
|
|
9 | |
|
|
10 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
11 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
12 | |
7 | * |
13 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
14 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
15 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
16 | (at your option) any later version. |
11 | * (at your option) any later version. |
17 | |
12 | * |
18 | 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, |
19 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
20 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
21 | GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
22 | |
17 | * |
23 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License |
24 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
25 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
26 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
27 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
|
|
28 | */ |
22 | */ |
29 | |
23 | |
30 | #include <cassert> |
24 | #include <cassert> |
31 | |
25 | |
|
|
26 | #include <global.h> |
|
|
27 | #include <loader.h> |
|
|
28 | |
|
|
29 | #include <tr1/functional> |
32 | #include <tr1/unordered_map> |
30 | #include <tr1/unordered_map> |
33 | |
31 | |
34 | #include <global.h> |
32 | archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing |
35 | #include <arch.h> |
33 | arch_ptr archetype::empty; |
36 | #include <funcpoint.h> |
|
|
37 | #include <loader.h> |
|
|
38 | |
34 | |
39 | /* IF set, does a little timing on the archetype load. */ |
|
|
40 | #define TIME_ARCH_LOAD 0 |
|
|
41 | |
|
|
42 | static void add_arch (archetype *at); |
|
|
43 | |
|
|
44 | static archetype *arch_table[ARCHTABLE]; |
|
|
45 | int arch_cmp = 0; /* How many strcmp's */ |
|
|
46 | int arch_search = 0; /* How many searches */ |
|
|
47 | int arch_init; /* True if doing arch initialization */ |
|
|
48 | |
|
|
49 | /* The naming of these functions is really poor - they are all |
|
|
50 | * pretty much named '.._arch_...', but they may more may not |
|
|
51 | * return archetypes. Some make the arch_to_object call, and thus |
|
|
52 | * return an object. Perhaps those should be called 'archob' functions |
|
|
53 | * to denote they return an object derived from the archetype. |
|
|
54 | * MSW 2003-04-29 |
|
|
55 | */ |
|
|
56 | |
|
|
57 | #if USE_UNORDERED_MAP |
|
|
58 | // the hashtable |
35 | // the hashtable |
59 | typedef |
|
|
60 | std::tr1::unordered_map < |
36 | typedef std::tr1::unordered_map |
61 | size_t, archetype *> |
37 | < |
|
|
38 | const char *, |
|
|
39 | arch_ptr, |
|
|
40 | str_hash, |
|
|
41 | str_equal, |
|
|
42 | slice_allocator< std::pair<const char *const, arch_ptr> > |
62 | HT; |
43 | > HT; |
63 | |
44 | |
64 | static |
45 | static HT ht (10000); |
65 | HT |
46 | archvec archetypes; |
66 | ht; |
47 | static unordered_vector<archetype *> allarch; |
67 | #endif |
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; |
68 | |
54 | |
69 | /** |
55 | /** |
70 | * GROS - This function retrieves an archetype given the name that appears |
56 | * GROS - This function retrieves an archetype given the name that appears |
71 | * during the game (for example, "writing pen" instead of "stylus"). |
57 | * during the game (for example, "writing pen" instead of "stylus"). |
72 | * It does not use the hashtable system, but browse the whole archlist each time. |
58 | * It does not use the hashtable system, but browse the whole archlist each time. |
… | |
… | |
78 | * - the archetype found or null if nothing was found. |
64 | * - the archetype found or null if nothing was found. |
79 | */ |
65 | */ |
80 | archetype * |
66 | archetype * |
81 | find_archetype_by_object_name (const char *name) |
67 | find_archetype_by_object_name (const char *name) |
82 | { |
68 | { |
83 | archetype * |
69 | shstr_cmp name_cmp (name); |
84 | at; |
|
|
85 | |
70 | |
86 | if (name == NULL) |
71 | for_all_archetypes (at) |
87 | return (archetype *) NULL; |
72 | if (at->name == name_cmp) |
88 | |
|
|
89 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
90 | { |
|
|
91 | if (!strcmp (at->clone.name, name)) |
|
|
92 | return at; |
73 | return at; |
93 | } |
74 | |
94 | return NULL; |
75 | return 0; |
95 | } |
76 | } |
96 | |
77 | |
97 | /** |
78 | /** |
98 | * This function retrieves an archetype by type and name that appears during |
79 | * This function retrieves an archetype by type and name that appears during |
99 | * the game. It is basically the same as find_archetype_by_object_name() |
80 | * the game. It is basically the same as find_archetype_by_object_name() |
100 | * except that it considers only items of the given type. |
81 | * except that it considers only items of the given type. |
101 | */ |
82 | */ |
102 | archetype * |
83 | archetype * |
103 | find_archetype_by_object_type_name (int type, const char *name) |
84 | find_archetype_by_object_type_name (int type, const char *name) |
104 | { |
85 | { |
105 | archetype * |
86 | shstr_cmp name_cmp (name); |
106 | at; |
|
|
107 | |
87 | |
108 | if (name == NULL) |
88 | for_all_archetypes (at) |
109 | return NULL; |
89 | if (at->name == name_cmp && at->type == type) |
110 | |
|
|
111 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
112 | { |
|
|
113 | if (at->clone.type == type && strcmp (at->clone.name, name) == 0) |
|
|
114 | return at; |
90 | return at; |
115 | } |
|
|
116 | |
91 | |
117 | return NULL; |
92 | return 0; |
118 | } |
93 | } |
119 | |
94 | |
120 | /* This is a lot like the above function. Instead, we are trying to match |
95 | /* This is a lot like the above function. Instead, we are trying to match |
121 | * the arch->skill values. type is the type of object to match |
96 | * the arch->skill values. type is the type of object to match |
122 | * against (eg, to only match against skills or only skill objects for example). |
97 | * against (eg, to only match against skills or only skill objects for example). |
123 | * If type is -1, ew don't match on type. |
98 | * If type is -1, ew don't match on type. |
124 | */ |
99 | */ |
125 | object * |
100 | object * |
126 | get_archetype_by_skill_name (const char *skill, int type) |
101 | get_archetype_by_skill_name (const char *skill, int type) |
127 | { |
102 | { |
128 | archetype * |
103 | shstr_cmp skill_cmp (skill); |
129 | at; |
|
|
130 | |
104 | |
131 | if (skill == NULL) |
105 | for_all_archetypes (at) |
132 | return NULL; |
106 | if (at->skill == skill_cmp && (type == -1 || type == at->type)) |
|
|
107 | return at->instance (); |
133 | |
108 | |
134 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
135 | { |
|
|
136 | if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill))) |
|
|
137 | return arch_to_object (at); |
|
|
138 | } |
|
|
139 | return NULL; |
109 | return 0; |
140 | } |
110 | } |
141 | |
111 | |
142 | /* similiar to above - this returns the first archetype |
112 | /* similiar to above - this returns the first archetype |
143 | * that matches both the type and subtype. type and subtype |
113 | * that matches both the type and subtype. type and subtype |
144 | * can be -1 to say ignore, but in this case, the match it does |
114 | * can be -1 to say ignore, but in this case, the match it does |
… | |
… | |
147 | * (eg, skills) |
117 | * (eg, skills) |
148 | */ |
118 | */ |
149 | archetype * |
119 | archetype * |
150 | get_archetype_by_type_subtype (int type, int subtype) |
120 | get_archetype_by_type_subtype (int type, int subtype) |
151 | { |
121 | { |
152 | archetype * |
122 | for_all_archetypes (at) |
153 | at; |
|
|
154 | |
|
|
155 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
156 | { |
|
|
157 | if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) |
123 | if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype)) |
158 | return at; |
124 | return at; |
159 | } |
125 | |
160 | return NULL; |
126 | return 0; |
161 | } |
127 | } |
162 | |
128 | |
163 | /** |
129 | /** |
164 | * GROS - this returns a new object given the name that appears during the game |
130 | * GROS - this returns a new object given the name that appears during the game |
165 | * (for example, "writing pen" instead of "stylus"). |
131 | * (for example, "writing pen" instead of "stylus"). |
… | |
… | |
167 | * - name: The name we're searching for (ex: "writing pen"); |
133 | * - name: The name we're searching for (ex: "writing pen"); |
168 | * Return value: |
134 | * Return value: |
169 | * - a corresponding object if found; a singularity object if not found. |
135 | * - a corresponding object if found; a singularity object if not found. |
170 | * Note by MSW - it appears that it takes the full name and keeps |
136 | * Note by MSW - it appears that it takes the full name and keeps |
171 | * shortening it until it finds a match. I re-wrote this so that it |
137 | * shortening it until it finds a match. I re-wrote this so that it |
172 | * doesn't malloc it each time - not that this function is used much, |
138 | * doesn't allocate it each time - not that this function is used much, |
173 | * but it otherwise had a big memory leak. |
139 | * but it otherwise had a big memory leak. |
174 | */ |
140 | */ |
175 | object * |
141 | object * |
176 | get_archetype_by_object_name (const char *name) |
142 | get_archetype_by_object_name (const char *name) |
177 | { |
143 | { |
178 | archetype * |
|
|
179 | at; |
|
|
180 | char |
|
|
181 | tmpname[MAX_BUF]; |
144 | char tmpname[MAX_BUF]; |
182 | int |
145 | int i; |
183 | i; |
|
|
184 | |
146 | |
185 | strncpy (tmpname, name, MAX_BUF - 1); |
147 | assign (tmpname, name); |
186 | tmpname[MAX_BUF - 1] = 0; |
148 | |
187 | for (i = strlen (tmpname); i > 0; i--) |
149 | for (i = strlen (tmpname); i > 0; i--) |
188 | { |
150 | { |
189 | tmpname[i] = 0; |
151 | tmpname[i] = 0; |
|
|
152 | |
190 | at = find_archetype_by_object_name (tmpname); |
153 | if (archetype *at = find_archetype_by_object_name (tmpname)) |
191 | if (at != NULL) |
154 | return at->instance (); |
192 | { |
|
|
193 | return arch_to_object (at); |
|
|
194 | } |
|
|
195 | } |
155 | } |
|
|
156 | |
196 | return create_singularity (name); |
157 | return create_singularity (name); |
197 | } |
158 | } |
198 | |
159 | |
199 | /* This is a subset of the parse_id command. Basically, name can be |
160 | /* This is a subset of the parse_id command. Basically, name can be |
200 | * a string seperated lists of things to match, with certain keywords. |
161 | * a string seperated lists of things to match, with certain keywords. |
201 | * pl is the player (only needed to set count properly) |
162 | * pl is the player (only needed to set count properly) |
202 | * op is the item we are trying to match. Calling function takes care |
163 | * op is the item we are trying to match. Calling function takes care |
203 | * of what action might need to be done and if it is valid |
164 | * of what action might need to be done and if it is valid |
204 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
165 | * (pickup, drop, etc.) Return NONZERO if we have a match. A higher |
205 | * value means a better match. 0 means no match. |
166 | * value means a better match. 0 means no match. |
206 | * |
167 | * |
207 | * Brief outline of the procedure: |
168 | * Brief outline of the procedure: |
208 | * We take apart the name variable into the individual components. |
169 | * We take apart the name variable into the individual components. |
209 | * cases for 'all' and unpaid are pretty obvious. |
170 | * cases for 'all' and unpaid are pretty obvious. |
210 | * Next, we check for a count (either specified in name, or in the |
171 | * Next, we check for a count (either specified in name, or in the |
211 | * player object.) |
172 | * player object.) |
212 | * If count is 1, make a quick check on the name. |
173 | * If count is 1, make a quick check on the name. |
213 | * IF count is >1, we need to make plural name. Return if match. |
174 | * IF count is >1, we need to make plural name. Return if match. |
214 | * Last, make a check on the full name. |
175 | * Last, make a check on the full name. |
215 | */ |
176 | */ |
216 | int |
177 | int |
217 | item_matched_string (object *pl, object *op, const char *name) |
178 | item_matched_string (object *pl, object *op, const char *name) |
218 | { |
179 | { |
219 | char * |
|
|
220 | cp, |
|
|
221 | local_name[MAX_BUF]; |
180 | char *cp, local_name[MAX_BUF]; |
222 | int |
181 | int count, retval = 0; |
223 | count, |
|
|
224 | retval = 0; |
|
|
225 | |
182 | |
226 | strcpy (local_name, name); /* strtok is destructive to name */ |
183 | assign (local_name, name); /* strtok is destructive to name */ |
227 | |
184 | |
228 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
185 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
229 | { |
186 | { |
230 | while (cp[0] == ' ') |
187 | while (cp[0] == ' ') |
231 | ++cp; /* get rid of spaces */ |
188 | ++cp; /* get rid of spaces */ |
… | |
… | |
281 | retval = 15; |
238 | retval = 15; |
282 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
239 | else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) |
283 | retval = 14; |
240 | retval = 14; |
284 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
241 | else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) |
285 | retval = 14; |
242 | retval = 14; |
286 | |
|
|
287 | /* Do substring checks, so things like 'Str+1' will match. |
243 | /* Do substring checks, so things like 'Str+1' will match. |
288 | * retval of these should perhaps be lower - they are lower |
244 | * retval of these should perhaps be lower - they are lower |
289 | * then the specific strcasecmp aboves, but still higher than |
245 | * then the specific strcasecmp aboves, but still higher than |
290 | * some other match criteria. |
246 | * some other match criteria. |
291 | */ |
247 | */ |
… | |
… | |
293 | retval = 12; |
249 | retval = 12; |
294 | else if (strstr (query_base_name (op, 0), cp)) |
250 | else if (strstr (query_base_name (op, 0), cp)) |
295 | retval = 12; |
251 | retval = 12; |
296 | else if (strstr (query_short_name (op), cp)) |
252 | else if (strstr (query_short_name (op), cp)) |
297 | retval = 12; |
253 | retval = 12; |
298 | |
|
|
299 | /* Check against plural/non plural based on count. */ |
254 | /* Check against plural/non plural based on count. */ |
300 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
255 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
301 | { |
|
|
302 | retval = 6; |
256 | retval = 6; |
303 | } |
|
|
304 | else if (count == 1 && !strcasecmp (op->name, cp)) |
257 | else if (count == 1 && !strcasecmp (op->name, cp)) |
305 | { |
|
|
306 | retval = 6; |
258 | retval = 6; |
307 | } |
|
|
308 | /* base name matched - not bad */ |
259 | /* base name matched - not bad */ |
309 | else if (strcasecmp (cp, op->name) == 0 && !count) |
260 | else if (strcasecmp (cp, op->name) == 0 && !count) |
310 | retval = 4; |
261 | retval = 4; |
311 | /* Check for partial custom name, but give a real low priority */ |
262 | /* Check for partial custom name, but give a real low priority */ |
312 | else if (op->custom_name && strstr (op->custom_name, cp)) |
263 | else if (op->custom_name && strstr (op->custom_name, cp)) |
… | |
… | |
314 | |
265 | |
315 | if (retval) |
266 | if (retval) |
316 | { |
267 | { |
317 | if (pl->type == PLAYER) |
268 | if (pl->type == PLAYER) |
318 | pl->contr->count = count; |
269 | pl->contr->count = count; |
|
|
270 | |
319 | return retval; |
271 | return retval; |
320 | } |
272 | } |
321 | } |
273 | } |
|
|
274 | |
322 | return 0; |
275 | return 0; |
323 | } |
276 | } |
324 | |
277 | |
|
|
278 | archetype::archetype (const char *name) |
|
|
279 | { |
|
|
280 | arch = this; |
|
|
281 | this->archname = this->name = this->name_pl = name; |
|
|
282 | } |
|
|
283 | |
|
|
284 | archetype::~archetype () |
|
|
285 | { |
|
|
286 | unlink (); |
|
|
287 | } |
|
|
288 | |
|
|
289 | void |
|
|
290 | archetype::link () |
|
|
291 | { |
|
|
292 | if (!archetypes.contains (this)) |
|
|
293 | { |
|
|
294 | archetypes.insert (this); |
|
|
295 | ht.insert (std::make_pair (archname, this)); |
|
|
296 | } |
|
|
297 | } |
|
|
298 | |
|
|
299 | void |
|
|
300 | archetype::unlink () |
|
|
301 | { |
|
|
302 | if (archetypes.contains (this)) |
|
|
303 | { |
|
|
304 | archetypes.erase (this); |
|
|
305 | ht.erase (archname); |
|
|
306 | } |
|
|
307 | } |
|
|
308 | |
325 | /* |
309 | /* |
326 | * Initialises the internal linked list of archetypes (read from file). |
310 | * Finds, using the hashtable, which archetype matches the given name. |
327 | * Then the global "empty_archetype" pointer is initialised. |
311 | * returns a pointer to the found archetype, otherwise NULL. |
328 | * Then the blocksview[] array is initialised. |
|
|
329 | */ |
312 | */ |
|
|
313 | archetype * |
|
|
314 | archetype::find (const char *name) |
|
|
315 | { |
|
|
316 | if (!name) |
|
|
317 | return 0; |
|
|
318 | |
|
|
319 | auto (i, ht.find (name)); |
|
|
320 | |
|
|
321 | if (i == ht.end ()) |
|
|
322 | return 0; |
|
|
323 | else |
|
|
324 | return i->second; |
|
|
325 | } |
|
|
326 | |
|
|
327 | archetype * |
|
|
328 | archetype::read (object_thawer &f) |
|
|
329 | { |
|
|
330 | assert (f.kw == KW_object); |
|
|
331 | |
|
|
332 | std::vector<archetype *> parts; |
|
|
333 | |
|
|
334 | coroapi::cede_to_tick (); |
|
|
335 | |
|
|
336 | for (;;) |
|
|
337 | { |
|
|
338 | archetype *at = new archetype (f.get_str ()); |
|
|
339 | |
|
|
340 | f.next (); |
|
|
341 | |
|
|
342 | #if 0 |
|
|
343 | // implementing it here in the server does neither allow multiple inheritence |
|
|
344 | // nor does it cleanly "just override". it would allow use in map files, though, |
|
|
345 | // and other resource files dynamically laoded (as opposed to being preprocessed). |
|
|
346 | // not that any of this is relevant as of yet... |
|
|
347 | if (f.kw == KW_inherit) |
|
|
348 | { |
|
|
349 | if (archetype *at = find (f.get_str ())) |
|
|
350 | *op = at->clone; |
|
|
351 | else |
|
|
352 | LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n", |
|
|
353 | &at->archname, f.get_str ()); |
|
|
354 | |
|
|
355 | f.next (); |
|
|
356 | } |
|
|
357 | #endif |
|
|
358 | |
|
|
359 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
360 | bool parse_ok = at->parse_kv (f); |
|
|
361 | loading_arch = 0; |
|
|
362 | |
|
|
363 | if (!parse_ok) |
|
|
364 | goto fail; |
|
|
365 | |
|
|
366 | loading_arch = at; // hack to tell parse_kv et al. to behave |
|
|
367 | at->post_load_check (); |
|
|
368 | loading_arch = 0; |
|
|
369 | |
|
|
370 | parts.push_back (at); |
|
|
371 | |
|
|
372 | if (f.kw != KW_more) |
|
|
373 | break; |
|
|
374 | |
|
|
375 | f.next (); |
|
|
376 | |
|
|
377 | if (f.kw != KW_object) |
|
|
378 | { |
|
|
379 | f.parse_error ("more object"); |
|
|
380 | goto fail; |
|
|
381 | } |
|
|
382 | } |
|
|
383 | |
|
|
384 | { |
|
|
385 | auto (at, parts.begin ()); |
|
|
386 | |
|
|
387 | archetype *new_head = parts.front (); |
|
|
388 | archetype *old_head = find (new_head->archname); |
|
|
389 | |
|
|
390 | if (old_head && !old_head->is_head ()) |
|
|
391 | { |
|
|
392 | LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n", |
|
|
393 | &new_head->archname, &old_head->archname); |
|
|
394 | goto fail; |
|
|
395 | } |
|
|
396 | |
|
|
397 | // check that all archetypes belong to the same old object or are new |
|
|
398 | for (auto (at, parts.begin ()); at != parts.end (); ++at) |
|
|
399 | { |
|
|
400 | archetype *new_part = *at; |
|
|
401 | archetype *old_part = find (new_part->archname); |
|
|
402 | |
|
|
403 | if (old_part && old_part->head_ () != old_head) |
|
|
404 | { |
|
|
405 | LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n", |
|
|
406 | &new_part->archname, &((archetype *)old_part->head_ ())->archname); |
|
|
407 | goto fail; |
|
|
408 | } |
|
|
409 | } |
|
|
410 | |
|
|
411 | // assemble new chain |
|
|
412 | new_head->min_x = new_head->max_x = new_head->x; |
|
|
413 | new_head->min_y = new_head->max_y = new_head->y; |
|
|
414 | |
|
|
415 | archetype *less = new_head; |
|
|
416 | for (auto (p, parts.begin () + 1); p != parts.end (); ++p) |
|
|
417 | { |
|
|
418 | archetype *at = *p; |
|
|
419 | |
|
|
420 | // some flags get inherited from the head (probably a lot more) |
|
|
421 | // doing it here doesn't feel too cozy, but it allows code |
|
|
422 | // to ignore head checks for these flags, which saves time |
|
|
423 | at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE]; |
|
|
424 | at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK]; |
|
|
425 | at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER]; |
|
|
426 | at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR]; |
|
|
427 | |
|
|
428 | new_head->min_x = min (new_head->min_x, at->x); |
|
|
429 | new_head->min_y = min (new_head->min_y, at->y); |
|
|
430 | new_head->max_x = max (new_head->max_x, at->x); |
|
|
431 | new_head->max_y = max (new_head->max_y, at->y); |
|
|
432 | |
|
|
433 | at->head = new_head; |
|
|
434 | less->more = at; |
|
|
435 | less = at; |
|
|
436 | } |
|
|
437 | |
|
|
438 | postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ()); |
|
|
439 | |
|
|
440 | return new_head; |
|
|
441 | } |
|
|
442 | |
|
|
443 | fail: |
|
|
444 | for (auto (p, parts.begin ()); p != parts.end (); ++p) |
|
|
445 | (*p)->destroy (); |
|
|
446 | |
|
|
447 | return 0; |
|
|
448 | } |
330 | |
449 | |
331 | void |
450 | void |
332 | init_archetypes (void) |
451 | archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch) |
333 | { /* called from add_player() and edit() */ |
452 | { |
334 | if (first_archetype != NULL) /* Only do this once */ |
453 | ref = 0; |
335 | return; |
454 | postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch))); |
336 | arch_init = 1; |
|
|
337 | load_archetypes (); |
|
|
338 | arch_init = 0; |
|
|
339 | empty_archetype = find_archetype ("empty_archetype"); |
|
|
340 | |
|
|
341 | /* init_blocksview();*/ |
|
|
342 | } |
455 | } |
343 | |
|
|
344 | /* |
|
|
345 | * Stores debug-information about how efficient the hashtable |
|
|
346 | * used for archetypes has been in the static errmsg array. |
|
|
347 | */ |
|
|
348 | |
456 | |
349 | void |
457 | void |
350 | arch_info (object *op) |
458 | archetype::commit_load () |
351 | { |
459 | { |
352 | sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); |
460 | // unlink old archetypes and link in new ones */ |
353 | new_draw_info (NDI_BLACK, 0, op, errmsg); |
461 | for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p) |
354 | } |
462 | { |
|
|
463 | archetype *at = *p; |
355 | |
464 | |
356 | /* |
465 | if (archetype *old = find (at->archname)) |
357 | * Initialise the hashtable used by the archetypes. |
466 | old->unlink (); |
358 | */ |
467 | |
|
|
468 | allarch.push_back (at); |
|
|
469 | |
|
|
470 | at->link (); |
|
|
471 | ++dirtycnt; |
|
|
472 | } |
|
|
473 | |
|
|
474 | postponed_arch.clear (); |
|
|
475 | |
|
|
476 | // now resolve arch references |
|
|
477 | for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p) |
|
|
478 | { |
|
|
479 | arch_ptr *ap = p->first; |
|
|
480 | archetype *at = find (p->second); |
|
|
481 | |
|
|
482 | if (!at) |
|
|
483 | LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second); |
|
|
484 | |
|
|
485 | *ap = at; |
|
|
486 | } |
|
|
487 | |
|
|
488 | postponed_arch_ref.clear (); |
|
|
489 | |
|
|
490 | empty = find (shstr_empty_archetype); |
|
|
491 | } |
359 | |
492 | |
360 | void |
493 | void |
361 | clear_archetable (void) |
494 | archetype::gc () |
362 | { |
495 | { |
363 | memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); |
496 | int cnt = max (1, min (allarch.size () / 128, dirtycnt)); |
364 | } |
497 | dirtycnt = max (0, dirtycnt - cnt); |
365 | |
498 | |
366 | /* |
499 | do |
367 | * An alternative way to init the hashtable which is slower, but _works_... |
|
|
368 | */ |
|
|
369 | |
|
|
370 | void |
|
|
371 | init_archetable (void) |
|
|
372 | { |
|
|
373 | archetype * |
|
|
374 | at; |
|
|
375 | |
|
|
376 | LOG (llevDebug, " Setting up archetable...\n"); |
|
|
377 | |
|
|
378 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
|
|
379 | add_arch (at); |
|
|
380 | |
|
|
381 | LOG (llevDebug, "done\n"); |
|
|
382 | } |
|
|
383 | |
|
|
384 | /* |
|
|
385 | * Dumps an archetype to debug-level output. |
|
|
386 | */ |
|
|
387 | |
|
|
388 | void |
|
|
389 | dump_arch (archetype *at) |
|
|
390 | { |
|
|
391 | dump_object (&at->clone); |
|
|
392 | } |
|
|
393 | |
|
|
394 | /* |
|
|
395 | * Dumps _all_ archetypes to debug-level output. |
|
|
396 | * If you run crossfire with debug, and enter DM-mode, you can trigger |
|
|
397 | * this with the O key. |
|
|
398 | */ |
|
|
399 | |
|
|
400 | void |
|
|
401 | dump_all_archetypes (void) |
|
|
402 | { |
|
|
403 | archetype * |
|
|
404 | at; |
|
|
405 | |
|
|
406 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
|
|
407 | { |
|
|
408 | dump_arch (at); |
|
|
409 | fprintf (logfile, "%s\n", errmsg); |
|
|
410 | } |
500 | { |
411 | } |
501 | static int idx; |
412 | |
502 | |
413 | void |
503 | if (idx >= allarch.size ()) |
414 | free_all_archs (void) |
504 | if (idx) |
415 | { |
505 | idx = 0; |
416 | archetype * |
506 | else |
417 | at, * |
507 | return; |
418 | next; |
|
|
419 | int |
|
|
420 | i = 0, f = 0; |
|
|
421 | |
508 | |
422 | for (at = first_archetype; at != NULL; at = next) |
509 | archetype *at = allarch [idx]; |
423 | { |
510 | |
424 | if (at->more) |
511 | if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object |
425 | next = at->more; |
512 | ++idx; |
426 | else |
513 | else |
427 | next = at->next; |
|
|
428 | |
|
|
429 | delete |
|
|
430 | at; |
|
|
431 | |
|
|
432 | i++; |
|
|
433 | } |
|
|
434 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
|
|
435 | } |
|
|
436 | |
|
|
437 | archetype::archetype () |
|
|
438 | { |
|
|
439 | clear_object (&clone); /* to initial state other also */ |
|
|
440 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */ |
|
|
441 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
|
|
442 | } |
|
|
443 | |
|
|
444 | archetype::~archetype () |
|
|
445 | { |
|
|
446 | } |
|
|
447 | |
|
|
448 | /* |
|
|
449 | * Reads/parses the archetype-file, and copies into a linked list |
|
|
450 | * of archetype-structures. |
|
|
451 | */ |
|
|
452 | void |
|
|
453 | first_arch_pass (object_thawer & fp) |
|
|
454 | { |
|
|
455 | archetype * |
|
|
456 | at, * |
|
|
457 | head = NULL, *last_more = NULL; |
|
|
458 | |
|
|
459 | at->clone.arch = first_archetype = at = new archetype; |
|
|
460 | |
|
|
461 | while (int i = load_object (fp, &at->clone, 0)) |
|
|
462 | { |
|
|
463 | at->clone.speed_left = (float) (-0.1); |
|
|
464 | /* copy the body_info to the body_used - this is only really |
|
|
465 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
466 | * by doing so, when a monster is created, it has good starting |
|
|
467 | * values for the body_used info, so when items are created |
|
|
468 | * for it, they can be properly equipped. |
|
|
469 | */ |
|
|
470 | memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info)); |
|
|
471 | |
|
|
472 | switch (i) |
|
|
473 | { |
514 | { |
474 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
515 | LOG (llevDebug, "garbage collect arch %s", &at->archname); |
475 | if (last_more != NULL) |
516 | assert (at->arch == at); // verify that refcnt == 1 is truly valid |
476 | last_more->next = at; |
517 | allarch.erase (idx); |
477 | if (head != NULL) |
|
|
478 | head->next = at; |
|
|
479 | head = last_more = at; |
|
|
480 | #if 0 |
|
|
481 | if (!op->type) |
|
|
482 | LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
483 | #endif |
|
|
484 | at->tail_x = 0; |
|
|
485 | at->tail_y = 0; |
|
|
486 | break; |
|
|
487 | |
518 | |
488 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
519 | // break chain |
489 | |
520 | for (object *op = at->head_ (); op; ) |
490 | at->head = head; |
|
|
491 | at->clone.head = &head->clone; |
|
|
492 | if (last_more != NULL) |
|
|
493 | { |
521 | { |
|
|
522 | object *next = op->more; |
|
|
523 | op->head = 0; |
494 | last_more->more = at; |
524 | op->more = 0; |
495 | last_more->clone.more = &at->clone; |
525 | op = next; |
496 | } |
526 | } |
497 | last_more = at; |
|
|
498 | |
527 | |
499 | /* If this multipart image is still composed of individual small |
528 | at->destroy (); |
500 | * images, don't set the tail_.. values. We can't use them anyways, |
529 | at->arch = 0; |
501 | * and setting these to zero makes the map sending to the client much |
|
|
502 | * easier as just looking at the head, we know what to do. |
|
|
503 | */ |
|
|
504 | if (at->clone.face != head->clone.face) |
|
|
505 | { |
|
|
506 | head->tail_x = 0; |
|
|
507 | head->tail_y = 0; |
|
|
508 | } |
|
|
509 | else |
|
|
510 | { |
|
|
511 | if (at->clone.x > head->tail_x) |
|
|
512 | head->tail_x = at->clone.x; |
|
|
513 | if (at->clone.y > head->tail_y) |
|
|
514 | head->tail_y = at->clone.y; |
|
|
515 | } |
|
|
516 | break; |
|
|
517 | |
|
|
518 | } |
530 | } |
519 | |
|
|
520 | at = new archetype; |
|
|
521 | |
|
|
522 | at->clone.arch = at; |
|
|
523 | } |
|
|
524 | |
|
|
525 | delete at; |
|
|
526 | } |
|
|
527 | |
|
|
528 | /* |
|
|
529 | * Reads the archetype file once more, and links all pointers between |
|
|
530 | * archetypes. |
|
|
531 | */ |
|
|
532 | |
|
|
533 | void |
|
|
534 | second_arch_pass (object_thawer & thawer) |
|
|
535 | { |
|
|
536 | char |
|
|
537 | buf[MAX_BUF], * |
|
|
538 | variable = buf, *argument, *cp; |
|
|
539 | archetype * |
|
|
540 | at = NULL, *other; |
|
|
541 | |
|
|
542 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
543 | { |
531 | } |
544 | if (*buf == '#') |
532 | while (--cnt); |
545 | continue; |
|
|
546 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
547 | { |
|
|
548 | *argument = '\0', argument++; |
|
|
549 | cp = argument + strlen (argument) - 1; |
|
|
550 | while (isspace (*cp)) |
|
|
551 | { |
|
|
552 | *cp = '\0'; |
|
|
553 | cp--; |
|
|
554 | } |
|
|
555 | } |
|
|
556 | if (!strcmp ("Object", variable)) |
|
|
557 | { |
|
|
558 | if ((at = find_archetype (argument)) == NULL) |
|
|
559 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
560 | } |
|
|
561 | else if (!strcmp ("other_arch", variable)) |
|
|
562 | { |
|
|
563 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
564 | { |
|
|
565 | if ((other = find_archetype (argument)) == NULL) |
|
|
566 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
|
|
567 | else if (at != NULL) |
|
|
568 | at->clone.other_arch = other; |
|
|
569 | } |
|
|
570 | } |
|
|
571 | else if (!strcmp ("randomitems", variable)) |
|
|
572 | { |
|
|
573 | if (at != NULL) |
|
|
574 | { |
|
|
575 | treasurelist * |
|
|
576 | tl = find_treasurelist (argument); |
|
|
577 | |
|
|
578 | if (tl == NULL) |
|
|
579 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
|
|
580 | else |
|
|
581 | at->clone.randomitems = tl; |
|
|
582 | } |
|
|
583 | } |
|
|
584 | } |
|
|
585 | } |
533 | } |
586 | |
534 | |
587 | #ifdef DEBUG |
|
|
588 | void |
|
|
589 | check_generators (void) |
|
|
590 | { |
|
|
591 | archetype * |
|
|
592 | at; |
|
|
593 | |
|
|
594 | for (at = first_archetype; at != NULL; at = at->next) |
|
|
595 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
|
|
596 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
|
|
597 | } |
|
|
598 | #endif |
|
|
599 | |
|
|
600 | /* |
|
|
601 | * First initialises the archtype hash-table (init_archetable()). |
|
|
602 | * Reads and parses the archetype file (with the first and second-pass |
|
|
603 | * functions). |
|
|
604 | * Then initialises treasures by calling load_treasures(). |
|
|
605 | */ |
|
|
606 | |
|
|
607 | void |
|
|
608 | load_archetypes (void) |
|
|
609 | { |
|
|
610 | char |
|
|
611 | filename[MAX_BUF]; |
|
|
612 | |
|
|
613 | #if TIME_ARCH_LOAD |
|
|
614 | struct timeval |
|
|
615 | tv1, |
|
|
616 | tv2; |
|
|
617 | #endif |
|
|
618 | |
|
|
619 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
|
|
620 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
621 | |
|
|
622 | { |
|
|
623 | object_thawer |
|
|
624 | thawer (filename); |
|
|
625 | |
|
|
626 | clear_archetable (); |
|
|
627 | LOG (llevDebug, " arch-pass 1...\n"); |
|
|
628 | first_arch_pass (thawer); |
|
|
629 | LOG (llevDebug, " done\n"); |
|
|
630 | } |
|
|
631 | |
|
|
632 | init_archetable (); |
|
|
633 | warn_archetypes = 1; |
|
|
634 | |
|
|
635 | { |
|
|
636 | object_thawer |
|
|
637 | thawer (filename); |
|
|
638 | |
|
|
639 | LOG (llevDebug, " loading treasure...\n"); |
|
|
640 | load_treasures (); |
|
|
641 | LOG (llevDebug, " done\n arch-pass 2...\n"); |
|
|
642 | second_arch_pass (thawer); |
|
|
643 | LOG (llevDebug, " done\n"); |
|
|
644 | #ifdef DEBUG |
|
|
645 | check_generators (); |
|
|
646 | #endif |
|
|
647 | } |
|
|
648 | LOG (llevDebug, " done\n"); |
|
|
649 | } |
|
|
650 | |
|
|
651 | /* |
|
|
652 | * Creates and returns a new object which is a copy of the given archetype. |
|
|
653 | * This function returns NULL on failure. |
|
|
654 | */ |
|
|
655 | |
|
|
656 | object * |
|
|
657 | arch_to_object (archetype *at) |
|
|
658 | { |
|
|
659 | object * |
535 | object * |
660 | op; |
536 | archetype::instance () |
661 | |
537 | { |
662 | if (at == NULL) |
538 | object *op = clone (); |
663 | { |
|
|
664 | if (warn_archetypes) |
|
|
665 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
666 | |
|
|
667 | return NULL; |
|
|
668 | } |
|
|
669 | |
|
|
670 | op = get_object (); |
|
|
671 | copy_object (&at->clone, op); |
|
|
672 | op->arch = at; |
|
|
673 | op->instantiate (); |
539 | op->instantiate (); |
674 | return op; |
540 | return op; |
675 | } |
541 | } |
676 | |
542 | |
677 | /* |
543 | /* |
678 | * Creates an object. This function is called by get_archetype() |
544 | * Creates an object. This function is called by get_archetype() |
679 | * if it fails to find the appropriate archetype. |
545 | * if it fails to find the appropriate archetype. |
680 | * Thus get_archetype() will be guaranteed to always return |
546 | * Thus get_archetype() will be guaranteed to always return |
681 | * an object, and never NULL. |
547 | * an object, and never NULL. |
682 | */ |
548 | */ |
683 | |
|
|
684 | object * |
549 | object * |
685 | create_singularity (const char *name) |
550 | create_singularity (const char *name) |
686 | { |
551 | { |
687 | object * |
552 | LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name); |
688 | op; |
|
|
689 | char |
|
|
690 | buf[MAX_BUF]; |
|
|
691 | |
553 | |
692 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
554 | if (!strcmp (name, "bug")) |
693 | op = get_object (); |
555 | abort (); |
694 | op->name = op->name_pl = buf; |
556 | |
695 | SET_FLAG (op, FLAG_NO_PICK); |
557 | object *op = archetype::get (shstr_bug); |
|
|
558 | op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name); |
|
|
559 | |
696 | return op; |
560 | return op; |
697 | } |
561 | } |
698 | |
562 | |
699 | /* |
563 | /* |
700 | * Finds which archetype matches the given name, and returns a new |
564 | * Finds which archetype matches the given name, and returns a new |
701 | * object containing a copy of the archetype. |
565 | * object containing a copy of the archetype. |
702 | */ |
566 | */ |
703 | |
|
|
704 | object * |
567 | object * |
705 | get_archetype (const char *name) |
568 | get_archetype (const char *name) |
706 | { |
569 | { |
707 | archetype * |
570 | return archetype::get (name); |
708 | at; |
571 | } |
709 | |
572 | |
710 | at = find_archetype (name); |
573 | object * |
711 | if (at == NULL) |
574 | archetype::get (const char *name) |
|
|
575 | { |
|
|
576 | archetype *at = find (name); |
|
|
577 | |
|
|
578 | if (!at) |
712 | return create_singularity (name); |
579 | return create_singularity (name); |
713 | |
580 | |
714 | return arch_to_object (at); |
581 | return at->instance (); |
715 | } |
|
|
716 | |
|
|
717 | /* |
|
|
718 | * Hash-function used by the arch-hashtable. |
|
|
719 | */ |
|
|
720 | |
|
|
721 | unsigned long |
|
|
722 | hasharch (const char *str, int tablesize) |
|
|
723 | { |
|
|
724 | unsigned long |
|
|
725 | hash = 0; |
|
|
726 | unsigned int |
|
|
727 | i = 0; |
|
|
728 | const char * |
|
|
729 | p; |
|
|
730 | |
|
|
731 | /* use the one-at-a-time hash function, which supposedly is |
|
|
732 | * better than the djb2-like one used by perl5.005, but |
|
|
733 | * certainly is better then the bug used here before. |
|
|
734 | * see http://burtleburtle.net/bob/hash/doobs.html |
|
|
735 | */ |
|
|
736 | for (p = str; i < MAXSTRING && *p; p++, i++) |
|
|
737 | { |
|
|
738 | hash += *p; |
|
|
739 | hash += hash << 10; |
|
|
740 | hash ^= hash >> 6; |
|
|
741 | } |
|
|
742 | |
|
|
743 | hash += hash << 3; |
|
|
744 | hash ^= hash >> 11; |
|
|
745 | hash += hash << 15; |
|
|
746 | |
|
|
747 | return hash % tablesize; |
|
|
748 | } |
|
|
749 | |
|
|
750 | /* |
|
|
751 | * Finds, using the hashtable, which archetype matches the given name. |
|
|
752 | * returns a pointer to the found archetype, otherwise NULL. |
|
|
753 | */ |
|
|
754 | |
|
|
755 | archetype * |
|
|
756 | find_archetype (const char *name) |
|
|
757 | { |
|
|
758 | #if USE_UNORDERED_MAP |
|
|
759 | name = shstr::find (name); |
|
|
760 | |
|
|
761 | if (!name) |
|
|
762 | return 0; |
|
|
763 | |
|
|
764 | HT::const_iterator i = ht.find ((size_t) name); |
|
|
765 | |
|
|
766 | if (i == ht.end ()) |
|
|
767 | return 0; |
|
|
768 | else |
|
|
769 | return i->second; |
|
|
770 | #endif |
|
|
771 | |
|
|
772 | archetype * |
|
|
773 | at; |
|
|
774 | unsigned long |
|
|
775 | index; |
|
|
776 | |
|
|
777 | if (name == NULL) |
|
|
778 | return (archetype *) NULL; |
|
|
779 | |
|
|
780 | index = hasharch (name, ARCHTABLE); |
|
|
781 | arch_search++; |
|
|
782 | for (;;) |
|
|
783 | { |
|
|
784 | at = arch_table[index]; |
|
|
785 | if (at == NULL) |
|
|
786 | { |
|
|
787 | if (warn_archetypes) |
|
|
788 | LOG (llevError, "Couldn't find archetype %s\n", name); |
|
|
789 | return NULL; |
|
|
790 | } |
|
|
791 | arch_cmp++; |
|
|
792 | if (!strcmp ((const char *) at->name, name)) |
|
|
793 | return at; |
|
|
794 | if (++index >= ARCHTABLE) |
|
|
795 | index = 0; |
|
|
796 | } |
|
|
797 | } |
|
|
798 | |
|
|
799 | /* |
|
|
800 | * Adds an archetype to the hashtable. |
|
|
801 | */ |
|
|
802 | |
|
|
803 | static void |
|
|
804 | add_arch (archetype *at) |
|
|
805 | { |
|
|
806 | #if USE_UNORDERED_MAP |
|
|
807 | ht.insert (std::make_pair ((size_t) (const char *) at->name, at)); |
|
|
808 | #endif |
|
|
809 | |
|
|
810 | int |
|
|
811 | index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; |
|
|
812 | |
|
|
813 | for (;;) |
|
|
814 | { |
|
|
815 | if (arch_table[index] == NULL) |
|
|
816 | { |
|
|
817 | arch_table[index] = at; |
|
|
818 | return; |
|
|
819 | } |
|
|
820 | |
|
|
821 | if (++index == ARCHTABLE) |
|
|
822 | index = 0; |
|
|
823 | |
|
|
824 | if (index == org_index) |
|
|
825 | fatal (ARCHTABLE_TOO_SMALL); |
|
|
826 | } |
|
|
827 | } |
582 | } |
828 | |
583 | |
829 | /* |
584 | /* |
830 | * Returns the first archetype using the given type. |
585 | * Returns the first archetype using the given type. |
831 | * Used in treasure-generation. |
586 | * Used in treasure-generation. |
832 | */ |
587 | */ |
833 | |
|
|
834 | archetype * |
588 | archetype * |
835 | type_to_archetype (int type) |
589 | type_to_archetype (int type) |
836 | { |
590 | { |
837 | archetype * |
591 | for_all_archetypes (at) |
838 | at; |
592 | if (at->type == type && at->head_ () != at) |
839 | |
|
|
840 | for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more) |
|
|
841 | if (at->clone.type == type) |
|
|
842 | return at; |
593 | return at; |
|
|
594 | |
843 | return NULL; |
595 | return 0; |
844 | } |
596 | } |
845 | |
597 | |
846 | /* |
598 | /* |
847 | * Returns a new object copied from the first archetype matching |
599 | * Returns a new object copied from the first archetype matching |
848 | * the given type. |
600 | * the given type. |
849 | * Used in treasure-generation. |
601 | * Used in treasure-generation. |
850 | */ |
602 | */ |
851 | |
|
|
852 | object * |
603 | object * |
853 | clone_arch (int type) |
604 | clone_arch (int type) |
854 | { |
605 | { |
855 | archetype * |
606 | archetype *at = type_to_archetype (type); |
856 | at; |
|
|
857 | object * |
|
|
858 | op = get_object (); |
|
|
859 | |
607 | |
860 | if ((at = type_to_archetype (type)) == NULL) |
608 | if (!at) |
861 | { |
609 | { |
862 | LOG (llevError, "Can't clone archetype %d\n", type); |
610 | LOG (llevError, "Can't clone archetype %d\n", type); |
863 | free_object (op); |
|
|
864 | return NULL; |
611 | return 0; |
865 | } |
612 | } |
866 | copy_object (&at->clone, op); |
613 | |
867 | op->instantiate (); |
614 | return at->instance (); |
868 | return op; |
|
|
869 | } |
615 | } |
870 | |
616 | |
871 | /* |
617 | /* |
872 | * member: make instance from class |
618 | * member: make instance from class |
873 | */ |
619 | */ |
874 | |
|
|
875 | object * |
620 | object * |
876 | object_create_arch (archetype *at) |
621 | object_create_arch (archetype *at) |
877 | { |
622 | { |
878 | object * |
623 | object *op, *prev = 0, *head = 0; |
879 | op, * |
|
|
880 | prev = NULL, *head = NULL; |
|
|
881 | |
624 | |
882 | while (at) |
625 | while (at) |
883 | { |
626 | { |
884 | op = arch_to_object (at); |
627 | op = at->instance (); |
|
|
628 | |
885 | op->x = at->clone.x; |
629 | op->x = at->x; |
886 | op->y = at->clone.y; |
630 | op->y = at->y; |
|
|
631 | |
887 | if (head) |
632 | if (head) |
888 | op->head = head, prev->more = op; |
633 | op->head = head, prev->more = op; |
|
|
634 | |
889 | if (!head) |
635 | if (!head) |
890 | head = op; |
636 | head = op; |
|
|
637 | |
891 | prev = op; |
638 | prev = op; |
892 | at = at->more; |
639 | at = (archetype *)at->more; |
893 | } |
640 | } |
|
|
641 | |
894 | return (head); |
642 | return head; |
895 | } |
643 | } |
896 | |
644 | |
897 | /*** end of arch.c ***/ |
|
|