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.2 by root, Sat Aug 26 08:44:04 2006 UTC vs.
Revision 1.18 by root, Tue Sep 12 20:55:40 2006 UTC

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

Diff Legend

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