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