ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.4 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.16 by root, Sun Sep 10 16:00:23 2006 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines