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