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