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