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