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