1 | /* |
1 | /* |
2 | * static char *rcsid_arch_c = |
|
|
3 | * "$Id: arch.C,v 1.5 2006/08/28 14:05:23 root Exp $"; |
|
|
4 | */ |
|
|
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
2 | * CrossFire, A Multiplayer game for X-windows |
8 | |
3 | * |
|
|
4 | * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
9 | Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
5 | * Copyright (C) 2002 Mark Wedel & Crossfire Development Team |
10 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (C) 1992 Frank Tore Johansen |
11 | |
7 | * |
12 | This program is free software; you can redistribute it and/or modify |
8 | * This program is free software; you can redistribute it and/or modify |
13 | it under the terms of the GNU General Public License as published by |
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 2 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, write to the Free Software |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
25 | |
21 | * |
26 | The authors can be reached via e-mail at crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail at <crossfire@schmorp.de> |
27 | */ |
23 | */ |
|
|
24 | |
|
|
25 | #include <cassert> |
28 | |
26 | |
29 | #include <global.h> |
27 | #include <global.h> |
30 | #include <arch.h> |
|
|
31 | #include <funcpoint.h> |
28 | #include <funcpoint.h> |
32 | #include <loader.h> |
29 | #include <loader.h> |
33 | |
30 | |
34 | #include <cassert> |
31 | #include <tr1/functional> |
|
|
32 | #include <tr1/unordered_map> |
35 | |
33 | |
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 */ |
34 | int arch_init; /* True if doing arch initialization */ |
45 | |
35 | |
46 | /* The naming of these functions is really poor - they are all |
36 | /* The naming of these functions is really poor - they are all |
47 | * pretty much named '.._arch_...', but they may more may not |
37 | * pretty much named '.._arch_...', but they may more may not |
48 | * return archetypes. Some make the arch_to_object call, and thus |
38 | * return archetypes. Some make the arch_to_object call, and thus |
49 | * return an object. Perhaps those should be called 'archob' functions |
39 | * return an object. Perhaps those should be called 'archob' functions |
50 | * to denote they return an object derived from the archetype. |
40 | * to denote they return an object derived from the archetype. |
51 | * MSW 2003-04-29 |
41 | * MSW 2003-04-29 |
52 | */ |
42 | */ |
|
|
43 | |
|
|
44 | // the hashtable |
|
|
45 | typedef std::tr1::unordered_map |
|
|
46 | < |
|
|
47 | const char *, |
|
|
48 | arch_ptr, |
|
|
49 | str_hash, |
|
|
50 | str_equal, |
|
|
51 | slice_allocator< std::pair<const char *const, arch_ptr> > |
|
|
52 | > HT; |
|
|
53 | |
|
|
54 | static HT ht (5000); |
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) |
|
|
69 | return (archetype *) NULL; |
|
|
70 | |
|
|
71 | for(at = first_archetype;at!=NULL;at=at->next) { |
72 | for (archetype *at = first_archetype; at; at = at->next) |
72 | if (!strcmp(at->clone.name, name)) |
73 | if (at->clone.name == name_cmp) |
73 | return at; |
|
|
74 | } |
|
|
75 | return NULL; |
74 | return at; |
|
|
75 | |
|
|
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) |
|
|
87 | return NULL; |
|
|
88 | |
|
|
89 | for (at = first_archetype; at != NULL; at = at->next) { |
89 | for (archetype *at = first_archetype; at; at = at->next) |
90 | if (at->clone.type == type && strcmp(at->clone.name, name) == 0) |
90 | if (at->clone.name == name_cmp && at->clone.type == type) |
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 | return NULL; |
|
|
107 | |
|
|
108 | for(at = first_archetype;at!=NULL;at=at->next) { |
106 | for (archetype *at = first_archetype; at; at = at->next) |
109 | if ( ((type == -1) || (type == at->clone.type)) && |
107 | if (at->clone.skill == skill_cmp && (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 | |
|
|
126 | for(at = first_archetype;at!=NULL;at=at->next) { |
123 | for (archetype *at = first_archetype; at; at = at->next) |
127 | if ( ((type == -1) || (type == at->clone.type)) && |
124 | if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype)) |
128 | (subtype == -1 || subtype == at->clone.subtype)) |
|
|
129 | return at; |
|
|
130 | } |
|
|
131 | return NULL; |
125 | return at; |
|
|
126 | |
|
|
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) |
|
|
157 | { |
|
|
158 | return arch_to_object(at); |
155 | return arch_to_object (at); |
159 | } |
|
|
160 | } |
156 | } |
|
|
157 | |
161 | return create_singularity(name); |
158 | return create_singularity (name); |
162 | } |
159 | } |
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 | |
160 | |
184 | /* This is a subset of the parse_id command. Basically, name can be |
161 | /* 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. |
162 | * a string seperated lists of things to match, with certain keywords. |
186 | * pl is the player (only needed to set count properly) |
163 | * pl is the player (only needed to set count properly) |
187 | * op is the item we are trying to match. Calling function takes care |
164 | * op is the item we are trying to match. Calling function takes care |
… | |
… | |
196 | * player object.) |
173 | * player object.) |
197 | * If count is 1, make a quick check on the name. |
174 | * 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. |
175 | * IF count is >1, we need to make plural name. Return if match. |
199 | * Last, make a check on the full name. |
176 | * Last, make a check on the full name. |
200 | */ |
177 | */ |
|
|
178 | int |
201 | int item_matched_string(object *pl, object *op, const char *name) |
179 | item_matched_string (object *pl, object *op, const char *name) |
202 | { |
180 | { |
203 | char *cp, local_name[MAX_BUF]; |
181 | char *cp, local_name[MAX_BUF]; |
204 | int count,retval=0; |
182 | int count, retval = 0; |
|
|
183 | |
205 | strcpy(local_name, name); /* strtok is destructive to name */ |
184 | assign (local_name, name); /* strtok is destructive to name */ |
206 | |
185 | |
207 | for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { |
186 | for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) |
208 | while (cp[0]==' ') ++cp; /* get rid of spaces */ |
187 | { |
|
|
188 | while (cp[0] == ' ') |
|
|
189 | ++cp; /* get rid of spaces */ |
209 | |
190 | |
210 | /* LOG(llevDebug,"Trying to match %s\n", cp);*/ |
191 | /* LOG(llevDebug,"Trying to match %s\n", cp); */ |
211 | /* All is a very generic match - low match value */ |
192 | /* All is a very generic match - low match value */ |
212 | if (!strcmp(cp,"all")) return 1; |
193 | if (!strcmp (cp, "all")) |
|
|
194 | return 1; |
213 | |
195 | |
214 | /* unpaid is a little more specific */ |
196 | /* unpaid is a little more specific */ |
215 | if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; |
197 | 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; |
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; |
219 | |
201 | |
220 | if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) |
202 | if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) |
221 | return 2; |
203 | return 2; |
222 | |
204 | |
223 | /* Allow for things like '100 arrows' */ |
205 | /* Allow for things like '100 arrows' */ |
224 | if ((count=atoi(cp))!=0) { |
206 | if ((count = atoi (cp)) != 0) |
|
|
207 | { |
225 | cp=strchr(cp, ' '); |
208 | cp = strchr (cp, ' '); |
226 | while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ |
209 | while (cp && cp[0] == ' ') |
227 | } |
210 | ++cp; /* get rid of spaces */ |
228 | else { |
211 | } |
|
|
212 | else |
|
|
213 | { |
229 | if (pl->type==PLAYER) |
214 | if (pl->type == PLAYER) |
230 | count=pl->contr->count; |
215 | count = pl->contr->count; |
231 | else |
216 | else |
232 | count = 0; |
217 | count = 0; |
233 | } |
218 | } |
234 | |
219 | |
235 | if (!cp || cp[0]=='\0' || count<0) return 0; |
220 | if (!cp || cp[0] == '\0' || count < 0) |
|
|
221 | return 0; |
236 | |
222 | |
237 | |
223 | |
238 | /* The code here should go from highest retval to lowest. That |
224 | /* 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 |
225 | * 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 |
226 | * 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 |
227 | * later. So keep it in descending order here, so we try for the best |
242 | * match first, and work downward. |
228 | * match first, and work downward. |
243 | */ |
229 | */ |
244 | if (!strcasecmp(cp,query_name(op))) retval=20; |
230 | if (!strcasecmp (cp, query_name (op))) |
|
|
231 | retval = 20; |
245 | else if (!strcasecmp(cp,query_short_name(op))) retval=18; |
232 | else if (!strcasecmp (cp, query_short_name (op))) |
246 | else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; |
233 | 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), |
234 | else if (!strcasecmp (cp, query_base_name (op, 0))) |
250 | strlen(cp))) retval=14; |
235 | retval = 16; |
251 | else if (!strncasecmp(cp,query_base_name(op,1), |
236 | else if (!strcasecmp (cp, query_base_name (op, 1))) |
252 | strlen(cp))) retval=14; |
237 | retval = 16; |
253 | |
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; |
254 | /* Do substring checks, so things like 'Str+1' will match. |
244 | /* Do substring checks, so things like 'Str+1' will match. |
255 | * retval of these should perhaps be lower - they are lower |
245 | * retval of these should perhaps be lower - they are lower |
256 | * then the specific strcasecmp aboves, but still higher than |
246 | * then the specific strcasecmp aboves, but still higher than |
257 | * some other match criteria. |
247 | * some other match criteria. |
258 | */ |
248 | */ |
259 | else if (strstr(query_base_name(op,1), cp)) retval = 12; |
249 | else if (strstr (query_base_name (op, 1), cp)) |
|
|
250 | retval = 12; |
260 | else if (strstr(query_base_name(op,0), cp)) retval = 12; |
251 | else if (strstr (query_base_name (op, 0), cp)) |
|
|
252 | retval = 12; |
261 | else if (strstr(query_short_name(op), cp)) retval = 12; |
253 | else if (strstr (query_short_name (op), cp)) |
262 | |
254 | retval = 12; |
263 | /* Check against plural/non plural based on count. */ |
255 | /* Check against plural/non plural based on count. */ |
264 | else if (count>1 && !strcasecmp(cp,op->name_pl)) { |
256 | else if (count > 1 && !strcasecmp (cp, op->name_pl)) |
265 | retval=6; |
257 | retval = 6; |
266 | } |
|
|
267 | else if (count==1 && !strcasecmp(op->name,cp)) { |
258 | else if (count == 1 && !strcasecmp (op->name, cp)) |
268 | retval=6; |
259 | retval = 6; |
269 | } |
|
|
270 | /* base name matched - not bad */ |
260 | /* base name matched - not bad */ |
271 | else if (strcasecmp(cp,op->name)==0 && !count) retval=4; |
261 | else if (strcasecmp (cp, op->name) == 0 && !count) |
|
|
262 | retval = 4; |
272 | /* Check for partial custom name, but give a real low priority */ |
263 | /* Check for partial custom name, but give a real low priority */ |
273 | else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3; |
264 | else if (op->custom_name && strstr (op->custom_name, cp)) |
|
|
265 | retval = 3; |
274 | |
266 | |
275 | if (retval) { |
267 | if (retval) |
|
|
268 | { |
276 | if (pl->type == PLAYER) |
269 | if (pl->type == PLAYER) |
277 | pl->contr->count=count; |
270 | pl->contr->count = count; |
|
|
271 | |
278 | return retval; |
272 | return retval; |
279 | } |
273 | } |
280 | } |
274 | } |
|
|
275 | |
281 | return 0; |
276 | return 0; |
282 | } |
277 | } |
283 | |
278 | |
284 | /* |
279 | /* |
285 | * Initialises the internal linked list of archetypes (read from file). |
280 | * Initialises the internal linked list of archetypes (read from file). |
286 | * Then the global "empty_archetype" pointer is initialised. |
281 | * Then the global "empty_archetype" pointer is initialised. |
287 | * Then the blocksview[] array is initialised. |
282 | * Then the blocksview[] array is initialised. |
288 | */ |
283 | */ |
289 | |
284 | |
290 | void init_archetypes(void) { /* called from add_player() and edit() */ |
285 | void |
|
|
286 | init_archetypes (void) |
|
|
287 | { /* called from add_player() and edit() */ |
291 | if(first_archetype!=NULL) /* Only do this once */ |
288 | if (first_archetype != NULL) /* Only do this once */ |
292 | return; |
289 | return; |
|
|
290 | |
293 | arch_init = 1; |
291 | arch_init = 1; |
294 | load_archetypes(); |
292 | load_archetypes (); |
295 | arch_init = 0; |
293 | arch_init = 0; |
296 | empty_archetype=find_archetype("empty_archetype"); |
294 | empty_archetype = archetype::find ("empty_archetype"); |
|
|
295 | |
297 | /* init_blocksview();*/ |
296 | /* init_blocksview();*/ |
298 | } |
297 | } |
299 | |
298 | |
300 | /* |
299 | /* |
301 | * Stores debug-information about how efficient the hashtable |
|
|
302 | * used for archetypes has been in the static errmsg array. |
|
|
303 | */ |
|
|
304 | |
|
|
305 | void arch_info(object *op) { |
|
|
306 | sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp); |
|
|
307 | new_draw_info(NDI_BLACK, 0, op,errmsg); |
|
|
308 | } |
|
|
309 | |
|
|
310 | /* |
|
|
311 | * Initialise the hashtable used by the archetypes. |
|
|
312 | */ |
|
|
313 | |
|
|
314 | void clear_archetable(void) { |
|
|
315 | memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *)); |
|
|
316 | } |
|
|
317 | |
|
|
318 | /* |
|
|
319 | * An alternative way to init the hashtable which is slower, but _works_... |
300 | * An alternative way to init the hashtable which is slower, but _works_... |
320 | */ |
301 | */ |
321 | |
302 | void |
322 | void init_archetable(void) { |
303 | init_archetable (void) |
323 | archetype *at; |
304 | { |
324 | LOG(llevDebug," Setting up archetable...\n"); |
305 | LOG (llevDebug, " Setting up archetable...\n"); |
325 | for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) |
306 | |
326 | add_arch(at); |
307 | for (archetype *at = first_archetype; at; at = at->next) |
|
|
308 | for (archetype *bt = at; bt; bt = bt->more) |
|
|
309 | bt->hash_add (); |
|
|
310 | |
327 | LOG(llevDebug,"done\n"); |
311 | LOG (llevDebug, "done\n"); |
328 | } |
312 | } |
329 | |
313 | |
330 | /* |
314 | void |
331 | * Dumps an archetype to debug-level output. |
|
|
332 | */ |
|
|
333 | |
|
|
334 | void dump_arch(archetype *at) { |
|
|
335 | dump_object(&at->clone); |
|
|
336 | } |
|
|
337 | |
|
|
338 | /* |
|
|
339 | * Dumps _all_ archetypes to debug-level output. |
|
|
340 | * If you run crossfire with debug, and enter DM-mode, you can trigger |
|
|
341 | * this with the O key. |
|
|
342 | */ |
|
|
343 | |
|
|
344 | void dump_all_archetypes(void) { |
|
|
345 | archetype *at; |
|
|
346 | for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) { |
|
|
347 | dump_arch(at); |
|
|
348 | fprintf(logfile, "%s\n", errmsg); |
|
|
349 | } |
|
|
350 | } |
|
|
351 | |
|
|
352 | void free_all_archs(void) |
315 | free_all_archs (void) |
353 | { |
316 | { |
354 | archetype *at, *next; |
317 | archetype *at, *next; |
355 | int i=0,f=0; |
318 | int i = 0, f = 0; |
356 | |
319 | |
357 | for (at=first_archetype; at!=NULL; at=next) { |
320 | for (at = first_archetype; at; 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 | } |
321 | { |
|
|
322 | if (at->more) |
|
|
323 | next = at->more; |
|
|
324 | else |
|
|
325 | next = at->next; |
|
|
326 | |
|
|
327 | delete |
|
|
328 | at; |
|
|
329 | |
|
|
330 | i++; |
|
|
331 | } |
|
|
332 | |
370 | LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f); |
333 | LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f); |
371 | } |
334 | } |
372 | |
335 | |
373 | /* |
336 | archetype::archetype () |
374 | * Allocates, initialises and returns the pointer to an archetype structure. |
337 | { |
375 | */ |
338 | clone.arch = this; |
376 | |
339 | |
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 */ |
|
|
393 | CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */ |
340 | CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */ |
394 | SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */ |
341 | SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */ |
395 | arch->head=NULL; |
342 | } |
396 | arch->more=NULL; |
343 | |
|
|
344 | archetype::~archetype () |
|
|
345 | { |
|
|
346 | //TODO: nuke ->more's |
|
|
347 | } |
|
|
348 | |
|
|
349 | archetype * |
|
|
350 | archetype::read (object_thawer &f) |
|
|
351 | { |
|
|
352 | assert (f.kw == KW_object); |
|
|
353 | |
|
|
354 | archetype *head = new archetype; |
|
|
355 | f.get (head->name); |
|
|
356 | |
|
|
357 | if (!head->clone.parse_kv (f)) |
|
|
358 | { |
|
|
359 | delete head; |
|
|
360 | return 0; |
|
|
361 | } |
|
|
362 | |
|
|
363 | for (archetype *prev = head; f.kw == KW_more; ) |
|
|
364 | { |
|
|
365 | f.next (); |
|
|
366 | |
|
|
367 | assert (f.kw == KW_object); |
|
|
368 | |
|
|
369 | archetype *more = new archetype; |
|
|
370 | f.get (more->name); |
|
|
371 | |
|
|
372 | if (!more->clone.parse_kv (f)) |
|
|
373 | { |
|
|
374 | delete head; |
|
|
375 | return 0; |
|
|
376 | } |
|
|
377 | |
|
|
378 | assert (("pippijn sagt es gibt keine tiles mehr", head->clone.face == more->clone.face)); |
|
|
379 | |
|
|
380 | if (more->clone.x > head->tail_x) head->tail_x = more->clone.x; |
|
|
381 | if (more->clone.y > head->tail_y) head->tail_y = more->clone.y; |
|
|
382 | |
|
|
383 | more->head = head; |
|
|
384 | more->clone.head = &head->clone; |
|
|
385 | prev->more = more; |
|
|
386 | prev->clone.more = &more->clone; |
|
|
387 | |
|
|
388 | prev = more; |
|
|
389 | } |
|
|
390 | |
|
|
391 | head->next = first_archetype; |
|
|
392 | first_archetype = head; |
|
|
393 | |
397 | return arch; |
394 | return head; |
398 | } |
395 | } |
399 | |
396 | |
400 | /* |
397 | /* |
401 | * Reads/parses the archetype-file, and copies into a linked list |
398 | * Reads/parses the archetype-file, and copies into a linked list |
402 | * of archetype-structures. |
399 | * of archetype-structures. |
403 | */ |
400 | */ |
|
|
401 | static bool |
404 | void first_arch_pass(object_thawer &fp) { |
402 | first_arch_pass (object_thawer &f) |
405 | object *op; |
403 | { |
406 | archetype *at,*head=NULL,*last_more=NULL; |
404 | for (;;) |
407 | int i,first=2; |
|
|
408 | |
|
|
409 | op=get_object(); |
|
|
410 | op->arch=first_archetype=at=get_archetype_struct(); |
|
|
411 | |
|
|
412 | while((i=load_object(fp,op,first,0))) { |
|
|
413 | first=0; |
|
|
414 | copy_object(op,&at->clone); |
|
|
415 | at->clone.speed_left= (float) (-0.1); |
|
|
416 | /* copy the body_info to the body_used - this is only really |
|
|
417 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
418 | * by doing so, when a monster is created, it has good starting |
|
|
419 | * values for the body_used info, so when items are created |
|
|
420 | * for it, they can be properly equipped. |
|
|
421 | */ |
|
|
422 | memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info)); |
|
|
423 | |
|
|
424 | switch(i) { |
|
|
425 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
|
|
426 | if(last_more!=NULL) |
|
|
427 | last_more->next=at; |
|
|
428 | if(head!=NULL) |
|
|
429 | head->next=at; |
|
|
430 | head=last_more=at; |
|
|
431 | #if 0 |
|
|
432 | if(!op->type) |
|
|
433 | LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name); |
|
|
434 | #endif |
|
|
435 | at->tail_x = 0; |
|
|
436 | at->tail_y = 0; |
|
|
437 | break; |
|
|
438 | |
|
|
439 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
|
|
440 | |
|
|
441 | at->head=head; |
|
|
442 | at->clone.head = &head->clone; |
|
|
443 | if(last_more!=NULL) { |
|
|
444 | last_more->more=at; |
|
|
445 | last_more->clone.more = &at->clone; |
|
|
446 | } |
|
|
447 | last_more=at; |
|
|
448 | |
|
|
449 | /* If this multipart image is still composed of individual small |
|
|
450 | * 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 |
|
|
452 | * easier as just looking at the head, we know what to do. |
|
|
453 | */ |
|
|
454 | if (at->clone.face != head->clone.face) { |
|
|
455 | head->tail_x = 0; |
|
|
456 | head->tail_y = 0; |
|
|
457 | } else { |
|
|
458 | if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; |
|
|
459 | if (at->clone.y > head->tail_y) head->tail_y = at->clone.y; |
|
|
460 | } |
|
|
461 | break; |
|
|
462 | |
|
|
463 | } |
|
|
464 | |
|
|
465 | at=get_archetype_struct(); |
|
|
466 | clear_object(op); |
|
|
467 | op->arch=at; |
|
|
468 | } |
405 | { |
469 | free(at); |
406 | switch (f.kw) |
470 | free_object(op); |
407 | { |
|
|
408 | case KW_object: |
|
|
409 | if (!archetype::read (f)) |
|
|
410 | return false; |
|
|
411 | continue; |
|
|
412 | |
|
|
413 | case KW_EOF: |
|
|
414 | return true; |
|
|
415 | |
|
|
416 | default: |
|
|
417 | if (!f.parse_error ("archetypes file")) |
|
|
418 | return false; |
|
|
419 | } |
|
|
420 | |
|
|
421 | f.next (); |
|
|
422 | } |
471 | } |
423 | } |
472 | |
424 | |
473 | /* |
425 | /* |
474 | * Reads the archetype file once more, and links all pointers between |
426 | * Reads the archetype file once more, and links all pointers between |
475 | * archetypes. |
427 | * archetypes. |
476 | */ |
428 | */ |
477 | |
429 | void |
478 | void second_arch_pass(FILE *fp) { |
430 | second_arch_pass (object_thawer & thawer) |
|
|
431 | { |
479 | char buf[MAX_BUF],*variable=buf,*argument,*cp; |
432 | char buf[MAX_BUF], *variable = buf, *argument, *cp; |
480 | archetype *at=NULL,*other; |
433 | archetype *at = NULL, *other; |
481 | |
434 | |
482 | while(fgets(buf,MAX_BUF,fp)!=NULL) { |
435 | while (fgets (buf, MAX_BUF, thawer) != NULL) |
|
|
436 | { |
483 | if(*buf=='#') |
437 | if (*buf == '#') |
484 | continue; |
438 | continue; |
|
|
439 | |
485 | if((argument=strchr(buf,' '))!=NULL) { |
440 | if ((argument = strchr (buf, ' ')) != NULL) |
|
|
441 | { |
486 | *argument='\0',argument++; |
442 | *argument = '\0', argument++; |
487 | cp = argument + strlen(argument)-1; |
443 | cp = argument + strlen (argument) - 1; |
488 | while (isspace(*cp)) { |
444 | while (isspace (*cp)) |
489 | *cp='\0'; |
445 | { |
490 | cp--; |
446 | *cp = '\0'; |
491 | } |
447 | cp--; |
492 | } |
448 | } |
|
|
449 | } |
|
|
450 | |
493 | if(!strcmp("Object",variable)) { |
451 | if (!strcmp ("object", variable)) |
|
|
452 | { |
494 | if((at=find_archetype(argument))==NULL) |
453 | if ((at = archetype::find (argument)) == NULL) |
495 | LOG(llevError,"Warning: failed to find arch %s\n",argument); |
454 | LOG (llevError, "Warning: failed to find arch %s\n", argument); |
|
|
455 | } |
496 | } else if(!strcmp("other_arch",variable)) { |
456 | else if (!strcmp ("other_arch", variable)) |
|
|
457 | { |
497 | if(at!=NULL&&at->clone.other_arch==NULL) { |
458 | if (at != NULL && at->clone.other_arch == NULL) |
|
|
459 | { |
498 | if((other=find_archetype(argument))==NULL) |
460 | if ((other = archetype::find (argument)) == NULL) |
499 | LOG(llevError,"Warning: failed to find other_arch %s\n",argument); |
461 | LOG (llevError, "Warning: failed to find other_arch %s\n", argument); |
500 | else if(at!=NULL) |
462 | else if (at != NULL) |
501 | at->clone.other_arch=other; |
463 | at->clone.other_arch = other; |
|
|
464 | } |
502 | } |
465 | } |
503 | } else if(!strcmp("randomitems",variable)) { |
466 | else if (!strcmp ("randomitems", variable)) |
504 | if(at!=NULL) { |
467 | { |
|
|
468 | if (at) |
|
|
469 | { |
505 | treasurelist *tl=find_treasurelist(argument); |
470 | treasurelist *tl = find_treasurelist (argument); |
|
|
471 | |
506 | if(tl==NULL) |
472 | if (tl == NULL) |
507 | LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument); |
473 | LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument); |
508 | else |
474 | else |
509 | at->clone.randomitems=tl; |
475 | at->clone.randomitems = tl; |
|
|
476 | } |
510 | } |
477 | } |
511 | } |
|
|
512 | } |
478 | } |
513 | } |
479 | } |
514 | |
480 | |
515 | #ifdef DEBUG |
481 | #ifdef DEBUG |
|
|
482 | void |
516 | void check_generators(void) { |
483 | check_generators (void) |
|
|
484 | { |
517 | archetype *at; |
485 | archetype *at; |
|
|
486 | |
518 | for(at=first_archetype;at!=NULL;at=at->next) |
487 | for (at = first_archetype; at != NULL; at = at->next) |
519 | if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL) |
488 | if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL) |
520 | LOG(llevError,"Warning: %s is generator but lacks other_arch.\n", |
489 | LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name); |
521 | at->name); |
|
|
522 | } |
490 | } |
523 | #endif |
491 | #endif |
524 | |
492 | |
525 | /* |
493 | /* |
526 | * First initialises the archtype hash-table (init_archetable()). |
494 | * First initialises the archtype hash-table (init_archetable()). |
527 | * Reads and parses the archetype file (with the first and second-pass |
495 | * Reads and parses the archetype file (with the first and second-pass |
528 | * functions). |
496 | * functions). |
529 | * Then initialises treasures by calling load_treasures(). |
497 | * Then initialises treasures by calling load_treasures(). |
530 | */ |
498 | */ |
531 | |
499 | |
|
|
500 | void |
532 | void load_archetypes(void) { |
501 | load_archetypes (void) |
533 | FILE *fp; |
502 | { |
534 | char filename[MAX_BUF]; |
503 | char filename[MAX_BUF]; |
535 | int comp; |
504 | |
536 | #if TIME_ARCH_LOAD |
505 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
537 | struct timeval tv1,tv2; |
506 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
|
|
507 | |
|
|
508 | { |
|
|
509 | object_thawer f (filename); |
|
|
510 | |
|
|
511 | f.next (); |
|
|
512 | |
|
|
513 | LOG (llevDebug, " arch-pass 1...\n"); |
|
|
514 | if (!first_arch_pass (f)) |
|
|
515 | cleanup ("errors during first arch pass are fatal"); |
|
|
516 | LOG (llevDebug, " done\n"); |
|
|
517 | } |
|
|
518 | |
|
|
519 | init_archetable (); |
|
|
520 | warn_archetypes = 1; |
|
|
521 | |
|
|
522 | { |
|
|
523 | object_thawer f (filename); |
|
|
524 | |
|
|
525 | LOG (llevDebug, " loading treasure...\n"); |
|
|
526 | load_treasures (); |
|
|
527 | LOG (llevDebug, " done\n"); |
|
|
528 | LOG (llevDebug, " arch-pass 2...\n"); |
|
|
529 | second_arch_pass (f); |
|
|
530 | LOG (llevDebug, " done\n"); |
|
|
531 | #ifdef DEBUG |
|
|
532 | check_generators (); |
538 | #endif |
533 | #endif |
539 | |
|
|
540 | sprintf(filename,"%s/%s",settings.datadir,settings.archetypes); |
|
|
541 | LOG(llevDebug,"Reading archetypes from %s...\n",filename); |
|
|
542 | if((fp=open_and_uncompress(filename,0,&comp))==NULL) { |
|
|
543 | LOG(llevError," Can't open archetype file.\n"); |
|
|
544 | return; |
|
|
545 | } |
534 | } |
546 | clear_archetable(); |
|
|
547 | LOG(llevDebug," arch-pass 1...\n"); |
|
|
548 | #if TIME_ARCH_LOAD |
|
|
549 | GETTIMEOFDAY(&tv1); |
|
|
550 | #endif |
|
|
551 | { |
|
|
552 | object_thawer thawer (fp); |
|
|
553 | first_arch_pass (thawer); |
|
|
554 | } |
|
|
555 | #if TIME_ARCH_LOAD |
|
|
556 | { int sec, usec; |
|
|
557 | GETTIMEOFDAY(&tv2); |
|
|
558 | sec = tv2.tv_sec - tv1.tv_sec; |
|
|
559 | usec = tv2.tv_usec - tv1.tv_usec; |
|
|
560 | if (usec<0) { usec +=1000000; sec--;} |
|
|
561 | LOG(llevDebug,"Load took %d.%06d seconds\n", sec, usec); |
|
|
562 | } |
|
|
563 | #endif |
|
|
564 | |
|
|
565 | LOG(llevDebug," done\n"); |
535 | LOG (llevDebug, " done\n"); |
566 | init_archetable(); |
|
|
567 | warn_archetypes=1; |
|
|
568 | |
|
|
569 | /* do a close and reopen instead of a rewind - necessary in case the |
|
|
570 | * file has been compressed. |
|
|
571 | */ |
|
|
572 | close_and_delete(fp, comp); |
|
|
573 | fp=open_and_uncompress(filename,0,&comp); |
|
|
574 | |
|
|
575 | LOG(llevDebug," loading treasure...\n"); |
|
|
576 | load_treasures(); |
|
|
577 | LOG(llevDebug," done\n arch-pass 2...\n"); |
|
|
578 | second_arch_pass(fp); |
|
|
579 | LOG(llevDebug," done\n"); |
|
|
580 | #ifdef DEBUG |
|
|
581 | check_generators(); |
|
|
582 | #endif |
|
|
583 | close_and_delete(fp, comp); |
|
|
584 | LOG(llevDebug," done\n"); |
|
|
585 | } |
536 | } |
586 | |
537 | |
587 | /* |
538 | /* |
588 | * Creates and returns a new object which is a copy of the given archetype. |
539 | * Creates and returns a new object which is a copy of the given archetype. |
589 | * This function returns NULL on failure. |
540 | * This function returns NULL on failure. |
590 | */ |
541 | */ |
591 | |
542 | object * |
592 | object *arch_to_object(archetype *at) { |
543 | arch_to_object (archetype *at) |
593 | object *op; |
544 | { |
594 | if(at==NULL) { |
545 | if (!at) |
|
|
546 | { |
595 | if(warn_archetypes) |
547 | if (warn_archetypes) |
596 | LOG(llevError,"Couldn't find archetype.\n"); |
548 | LOG (llevError, "Couldn't find archetype.\n"); |
|
|
549 | |
597 | return NULL; |
550 | return NULL; |
598 | } |
551 | } |
599 | op=get_object(); |
552 | |
600 | copy_object(&at->clone,op); |
553 | object *op = at->clone.clone (); |
|
|
554 | op->arch = at; |
601 | op->instantiate (); |
555 | op->instantiate (); |
602 | op->arch=at; |
|
|
603 | return op; |
556 | return op; |
604 | } |
557 | } |
605 | |
558 | |
606 | /* |
559 | /* |
607 | * Creates an object. This function is called by get_archetype() |
560 | * Creates an object. This function is called by get_archetype() |
608 | * if it fails to find the appropriate archetype. |
561 | * if it fails to find the appropriate archetype. |
609 | * Thus get_archetype() will be guaranteed to always return |
562 | * Thus get_archetype() will be guaranteed to always return |
610 | * an object, and never NULL. |
563 | * an object, and never NULL. |
611 | */ |
564 | */ |
612 | |
565 | object * |
613 | object *create_singularity(const char *name) { |
566 | create_singularity (const char *name) |
|
|
567 | { |
614 | object *op; |
568 | object *op; |
615 | char buf[MAX_BUF]; |
569 | char buf[MAX_BUF]; |
|
|
570 | |
616 | sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); |
571 | sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name); |
617 | op = get_object(); |
572 | op = object::create (); |
618 | op->name = add_string(buf); |
573 | op->name = op->name_pl = buf; |
619 | op->name_pl = add_string(buf); |
|
|
620 | SET_FLAG(op,FLAG_NO_PICK); |
574 | SET_FLAG (op, FLAG_NO_PICK); |
621 | return op; |
575 | return op; |
622 | } |
576 | } |
623 | |
577 | |
624 | /* |
578 | /* |
625 | * Finds which archetype matches the given name, and returns a new |
579 | * Finds which archetype matches the given name, and returns a new |
626 | * object containing a copy of the archetype. |
580 | * object containing a copy of the archetype. |
627 | */ |
581 | */ |
628 | |
582 | object * |
629 | object *get_archetype(const char *name) { |
583 | get_archetype (const char *name) |
630 | archetype *at; |
584 | { |
631 | at = find_archetype(name); |
585 | archetype *at = archetype::find (name); |
632 | if (at == NULL) |
586 | |
|
|
587 | if (!at) |
633 | return create_singularity(name); |
588 | return create_singularity (name); |
|
|
589 | |
634 | return arch_to_object(at); |
590 | return arch_to_object (at); |
635 | } |
591 | } |
636 | |
592 | |
637 | /* |
593 | /* |
638 | * Hash-function used by the arch-hashtable. |
594 | * Hash-function used by the arch-hashtable. |
639 | */ |
595 | */ |
640 | |
596 | |
641 | unsigned long |
597 | unsigned long |
642 | hasharch(const char *str, int tablesize) { |
598 | hasharch (const char *str, int tablesize) |
|
|
599 | { |
643 | unsigned long hash = 0; |
600 | unsigned long hash = 0; |
644 | int i = 0; |
601 | unsigned int i = 0; |
645 | const char *p; |
602 | const char *p; |
646 | |
603 | |
647 | /* use the one-at-a-time hash function, which supposedly is |
604 | /* use the one-at-a-time hash function, which supposedly is |
648 | * better than the djb2-like one used by perl5.005, but |
605 | * better than the djb2-like one used by perl5.005, but |
649 | * certainly is better then the bug used here before. |
606 | * certainly is better then the bug used here before. |
650 | * see http://burtleburtle.net/bob/hash/doobs.html |
607 | * see http://burtleburtle.net/bob/hash/doobs.html |
651 | */ |
608 | */ |
652 | for (p = str; i < MAXSTRING && *p; p++, i++) { |
609 | for (p = str; i < MAXSTRING && *p; p++, i++) |
|
|
610 | { |
653 | hash += *p; |
611 | hash += *p; |
654 | hash += hash << 10; |
612 | hash += hash << 10; |
655 | hash ^= hash >> 6; |
613 | hash ^= hash >> 6; |
656 | } |
614 | } |
|
|
615 | |
657 | hash += hash << 3; |
616 | hash += hash << 3; |
658 | hash ^= hash >> 11; |
617 | hash ^= hash >> 11; |
659 | hash += hash << 15; |
618 | hash += hash << 15; |
|
|
619 | |
660 | return hash % tablesize; |
620 | return hash % tablesize; |
661 | } |
621 | } |
662 | |
622 | |
663 | /* |
623 | /* |
664 | * Finds, using the hashtable, which archetype matches the given name. |
624 | * Finds, using the hashtable, which archetype matches the given name. |
665 | * returns a pointer to the found archetype, otherwise NULL. |
625 | * returns a pointer to the found archetype, otherwise NULL. |
666 | */ |
626 | */ |
667 | |
|
|
668 | archetype *find_archetype(const char *name) { |
|
|
669 | archetype *at; |
627 | archetype * |
670 | unsigned long index; |
628 | archetype::find (const char *name) |
671 | |
629 | { |
672 | if (name == NULL) |
630 | if (!name) |
673 | return (archetype *) NULL; |
|
|
674 | |
|
|
675 | index=hasharch(name, ARCHTABLE); |
|
|
676 | arch_search++; |
|
|
677 | for(;;) { |
|
|
678 | at = arch_table[index]; |
|
|
679 | if (at==NULL) { |
|
|
680 | if(warn_archetypes) |
|
|
681 | LOG(llevError,"Couldn't find archetype %s\n",name); |
|
|
682 | return NULL; |
|
|
683 | } |
|
|
684 | arch_cmp++; |
|
|
685 | if (!strcmp(at->name,name)) |
|
|
686 | return at; |
631 | return 0; |
687 | if(++index>=ARCHTABLE) |
632 | |
688 | index=0; |
633 | AUTODECL (i, ht.find (name)); |
689 | } |
634 | |
|
|
635 | if (i == ht.end ()) |
|
|
636 | return 0; |
|
|
637 | else |
|
|
638 | return i->second; |
690 | } |
639 | } |
691 | |
640 | |
692 | /* |
641 | /* |
693 | * Adds an archetype to the hashtable. |
642 | * Adds an archetype to the hashtable. |
694 | */ |
643 | */ |
|
|
644 | void |
|
|
645 | archetype::hash_add () |
|
|
646 | { |
|
|
647 | ht.insert (std::make_pair (name, this)); |
|
|
648 | } |
695 | |
649 | |
696 | static void add_arch(archetype *at) { |
650 | void |
697 | int index=hasharch(at->name, ARCHTABLE),org_index=index; |
651 | archetype::hash_del () |
698 | for(;;) { |
652 | { |
699 | if(arch_table[index]==NULL) { |
653 | ht.erase (name); |
700 | arch_table[index]=at; |
|
|
701 | return; |
|
|
702 | } |
|
|
703 | if(++index==ARCHTABLE) |
|
|
704 | index=0; |
|
|
705 | if(index==org_index) |
|
|
706 | fatal(ARCHTABLE_TOO_SMALL); |
|
|
707 | } |
|
|
708 | } |
654 | } |
709 | |
655 | |
710 | /* |
656 | /* |
711 | * Returns the first archetype using the given type. |
657 | * Returns the first archetype using the given type. |
712 | * Used in treasure-generation. |
658 | * Used in treasure-generation. |
713 | */ |
659 | */ |
714 | |
660 | archetype * |
715 | archetype *type_to_archetype(int type) { |
661 | type_to_archetype (int type) |
|
|
662 | { |
716 | archetype *at; |
663 | archetype *at; |
717 | |
664 | |
718 | for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) |
665 | for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more) |
719 | if(at->clone.type==type) |
666 | if (at->clone.type == type) |
720 | return at; |
667 | return at; |
|
|
668 | |
721 | return NULL; |
669 | return 0; |
722 | } |
670 | } |
723 | |
671 | |
724 | /* |
672 | /* |
725 | * Returns a new object copied from the first archetype matching |
673 | * Returns a new object copied from the first archetype matching |
726 | * the given type. |
674 | * the given type. |
727 | * Used in treasure-generation. |
675 | * Used in treasure-generation. |
728 | */ |
676 | */ |
729 | |
677 | |
|
|
678 | object * |
730 | object *clone_arch(int type) { |
679 | clone_arch (int type) |
|
|
680 | { |
731 | archetype *at; |
681 | archetype *at; |
732 | object *op=get_object(); |
|
|
733 | |
682 | |
734 | if((at=type_to_archetype(type))==NULL) { |
683 | if ((at = type_to_archetype (type)) == NULL) |
|
|
684 | { |
735 | LOG(llevError,"Can't clone archetype %d\n",type); |
685 | LOG (llevError, "Can't clone archetype %d\n", type); |
736 | free_object(op); |
|
|
737 | return NULL; |
686 | return 0; |
738 | } |
687 | } |
739 | copy_object(&at->clone,op); |
688 | |
|
|
689 | object *op = at->clone.clone (); |
740 | op->instantiate (); |
690 | op->instantiate (); |
741 | return op; |
691 | return op; |
742 | } |
692 | } |
743 | |
693 | |
744 | /* |
694 | /* |
745 | * member: make instance from class |
695 | * member: make instance from class |
746 | */ |
696 | */ |
747 | |
697 | |
|
|
698 | object * |
748 | object *object_create_arch (archetype * at) |
699 | object_create_arch (archetype *at) |
749 | { |
700 | { |
750 | object *op, *prev = NULL, *head = NULL; |
701 | object *op, *prev = 0, *head = 0; |
751 | |
702 | |
752 | while (at) { |
703 | while (at) |
|
|
704 | { |
753 | op = arch_to_object (at); |
705 | op = arch_to_object (at); |
754 | op->x = at->clone.x; |
706 | op->x = at->clone.x; |
755 | op->y = at->clone.y; |
707 | op->y = at->clone.y; |
|
|
708 | |
756 | if (head) |
709 | if (head) |
757 | op->head = head, prev->more = op; |
710 | op->head = head, prev->more = op; |
|
|
711 | |
758 | if (!head) |
712 | if (!head) |
759 | head = op; |
713 | head = op; |
|
|
714 | |
760 | prev = op; |
715 | prev = op; |
761 | at = at->more; |
716 | at = at->more; |
762 | } |
717 | } |
|
|
718 | |
763 | return (head); |
719 | return (head); |
764 | } |
720 | } |
765 | |
721 | |
766 | /*** end of arch.c ***/ |
|
|