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.3 by root, Sat Aug 26 23:36:28 2006 UTC vs.
Revision 1.45 by root, Fri Apr 13 07:26:29 2007 UTC

1/* 1/*
2 * static char *rcsid_arch_c =
3 * "$Id: arch.C,v 1.3 2006/08/26 23:36:28 root Exp $";
4 */
5
6/*
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
39static void add_arch(archetype *at);
40
41static archetype *arch_table[ARCHTABLE];
42int arch_cmp=0; /* How many strcmp's */
43int arch_search=0; /* How many searches */
44int arch_init; /* True if doing arch initialization */ 34int 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
45typedef 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
54static 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 */
67archetype *
65archetype *find_archetype_by_object_name(const char *name) { 68find_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 */
84archetype *
83archetype *find_archetype_by_object_type_name(int type, const char *name) { 85find_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 */
101object *
102object *get_archetype_by_skill_name(const char *skill, int type) { 102get_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 */
120archetype *
123archetype *get_archetype_by_type_subtype(int type, int subtype) { 121get_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 */
142object *
146object *get_archetype_by_object_name(const char *name) { 143get_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 */
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 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 */
178int
201int item_matched_string(object *pl, object *op, const char *name) 179item_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
290void init_archetypes(void) { /* called from add_player() and edit() */ 285void
286init_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
305void 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
314void 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 302void
322void init_archetable(void) { 303init_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/* 314void
331 * Dumps an archetype to debug-level output.
332 */
333
334void 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
344void 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
352void free_all_archs(void) 315free_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/* 336archetype::archetype ()
374 * Allocates, initialises and returns the pointer to an archetype structure. 337{
375 */ 338 clone.arch = this;
376 339
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 */
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
344archetype::~archetype ()
345{
346 //TODO: nuke ->more's
347}
348
349archetype *
350archetype::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 if (more->clone.x > head->tail_x) head->tail_x = more->clone.x;
379 if (more->clone.y > head->tail_y) head->tail_y = more->clone.y;
380
381 more->head = head;
382 more->clone.head = &head->clone;
383 prev->more = more;
384 prev->clone.more = &more->clone;
385
386 prev = more;
387 }
388
389 head->next = first_archetype;
390 first_archetype = head;
391
397 return arch; 392 return head;
398} 393}
399 394
400/* 395/*
401 * Reads/parses the archetype-file, and copies into a linked list 396 * Reads/parses the archetype-file, and copies into a linked list
402 * of archetype-structures. 397 * of archetype-structures.
403 */ 398 */
404void first_arch_pass(FILE *fp) { 399static bool
405 object *op; 400first_arch_pass (object_thawer &f)
406 archetype *at,*head=NULL,*last_more=NULL; 401{
407 int i,first=2; 402 for (;;)
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 } 403 {
469 free(at); 404 switch (f.kw)
470 free_object(op); 405 {
406 case KW_object:
407 if (!archetype::read (f))
408 return false;
409 continue;
410
411 case KW_EOF:
412 return true;
413
414 default:
415 if (!f.parse_error ("archetypes file"))
416 return false;
417 }
418
419 f.next ();
420 }
471} 421}
472 422
473/* 423/*
474 * Reads the archetype file once more, and links all pointers between 424 * Reads the archetype file once more, and links all pointers between
475 * archetypes. 425 * archetypes.
476 */ 426 */
477 427void
478void second_arch_pass(FILE *fp) { 428second_arch_pass (object_thawer & thawer)
429{
479 char buf[MAX_BUF],*variable=buf,*argument,*cp; 430 char buf[MAX_BUF], *variable = buf, *argument, *cp;
480 archetype *at=NULL,*other; 431 archetype *at = NULL, *other;
481 432
482 while(fgets(buf,MAX_BUF,fp)!=NULL) { 433 while (fgets (buf, MAX_BUF, thawer) != NULL)
434 {
483 if(*buf=='#') 435 if (*buf == '#')
484 continue; 436 continue;
437
485 if((argument=strchr(buf,' '))!=NULL) { 438 if ((argument = strchr (buf, ' ')) != NULL)
439 {
486 *argument='\0',argument++; 440 *argument = '\0', argument++;
487 cp = argument + strlen(argument)-1; 441 cp = argument + strlen (argument) - 1;
488 while (isspace(*cp)) { 442 while (isspace (*cp))
489 *cp='\0'; 443 {
490 cp--; 444 *cp = '\0';
491 } 445 cp--;
492 } 446 }
447 }
448
493 if(!strcmp("Object",variable)) { 449 if (!strcmp ("object", variable))
450 {
494 if((at=find_archetype(argument))==NULL) 451 if ((at = archetype::find (argument)) == NULL)
495 LOG(llevError,"Warning: failed to find arch %s\n",argument); 452 LOG (llevError, "Warning: failed to find arch %s\n", argument);
453 }
496 } else if(!strcmp("other_arch",variable)) { 454 else if (!strcmp ("other_arch", variable))
455 {
497 if(at!=NULL&&at->clone.other_arch==NULL) { 456 if (at != NULL && at->clone.other_arch == NULL)
457 {
498 if((other=find_archetype(argument))==NULL) 458 if ((other = archetype::find (argument)) == NULL)
499 LOG(llevError,"Warning: failed to find other_arch %s\n",argument); 459 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
500 else if(at!=NULL) 460 else if (at != NULL)
501 at->clone.other_arch=other; 461 at->clone.other_arch = other;
462 }
502 } 463 }
503 } else if(!strcmp("randomitems",variable)) { 464 else if (!strcmp ("randomitems", variable))
504 if(at!=NULL) { 465 {
466 if (at)
467 {
505 treasurelist *tl=find_treasurelist(argument); 468 treasurelist *tl = find_treasurelist (argument);
469
506 if(tl==NULL) 470 if (tl == NULL)
507 LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument); 471 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
508 else 472 else
509 at->clone.randomitems=tl; 473 at->clone.randomitems = tl;
474 }
510 } 475 }
511 }
512 } 476 }
513} 477}
514
515#ifdef DEBUG
516void check_generators(void) {
517 archetype *at;
518 for(at=first_archetype;at!=NULL;at=at->next)
519 if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
520 LOG(llevError,"Warning: %s is generator but lacks other_arch.\n",
521 at->name);
522}
523#endif
524 478
525/* 479/*
526 * First initialises the archtype hash-table (init_archetable()). 480 * First initialises the archtype hash-table (init_archetable()).
527 * Reads and parses the archetype file (with the first and second-pass 481 * Reads and parses the archetype file (with the first and second-pass
528 * functions). 482 * functions).
529 * Then initialises treasures by calling load_treasures(). 483 * Then initialises treasures by calling load_treasures().
530 */ 484 */
531 485void
532void load_archetypes(void) { 486load_archetypes (void)
533 FILE *fp; 487{
534 char filename[MAX_BUF]; 488 char filename[MAX_BUF];
535 int comp;
536#if TIME_ARCH_LOAD
537 struct timeval tv1,tv2;
538#endif
539 489
540 sprintf(filename,"%s/%s",settings.datadir,settings.archetypes); 490 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
541 LOG(llevDebug,"Reading archetypes from %s...\n",filename); 491 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
542 if((fp=open_and_uncompress(filename,0,&comp))==NULL) { 492
543 LOG(llevError," Can't open archetype file.\n"); 493 {
544 return; 494 object_thawer f (filename);
545 } 495
546 clear_archetable(); 496 f.next ();
497
547 LOG(llevDebug," arch-pass 1...\n"); 498 LOG (llevDebug, " arch-pass 1...\n");
548#if TIME_ARCH_LOAD
549 GETTIMEOFDAY(&tv1);
550#endif
551 first_arch_pass(fp); 499 if (!first_arch_pass (f))
552#if TIME_ARCH_LOAD 500 cleanup ("errors during first arch pass are fatal");
553 { int sec, usec;
554 GETTIMEOFDAY(&tv2);
555 sec = tv2.tv_sec - tv1.tv_sec;
556 usec = tv2.tv_usec - tv1.tv_usec;
557 if (usec<0) { usec +=1000000; sec--;}
558 LOG(llevDebug,"Load took %d.%06d seconds\n", sec, usec);
559 }
560#endif
561
562 LOG(llevDebug," done\n"); 501 LOG (llevDebug, " done\n");
502 }
503
563 init_archetable(); 504 init_archetable ();
564 warn_archetypes=1; 505 warn_archetypes = 1;
565 506
566 /* do a close and reopen instead of a rewind - necessary in case the 507 {
567 * file has been compressed. 508 object_thawer f (filename);
568 */
569 close_and_delete(fp, comp);
570 fp=open_and_uncompress(filename,0,&comp);
571 509
572 LOG(llevDebug," loading treasure...\n"); 510 LOG (llevDebug, " loading treasure...\n");
573 load_treasures(); 511 load_treasures ();
512 LOG (llevDebug, " done\n");
574 LOG(llevDebug," done\n arch-pass 2...\n"); 513 LOG (llevDebug, " arch-pass 2...\n");
575 second_arch_pass(fp); 514 second_arch_pass (f);
515 LOG (llevDebug, " done\n");
516 }
576 LOG(llevDebug," done\n"); 517 LOG (llevDebug, " done\n");
577#ifdef DEBUG
578 check_generators();
579#endif
580 close_and_delete(fp, comp);
581 LOG(llevDebug," done\n");
582} 518}
583 519
584/* 520/*
585 * Creates and returns a new object which is a copy of the given archetype. 521 * Creates and returns a new object which is a copy of the given archetype.
586 * This function returns NULL on failure. 522 * This function returns NULL on failure.
587 */ 523 */
588 524object *
589object *arch_to_object(archetype *at) { 525arch_to_object (archetype *at)
590 object *op; 526{
591 if(at==NULL) { 527 if (!at)
528 {
592 if(warn_archetypes) 529 if (warn_archetypes)
593 LOG(llevError,"Couldn't find archetype.\n"); 530 LOG (llevError, "Couldn't find archetype.\n");
531
594 return NULL; 532 return NULL;
595 } 533 }
596 op=get_object(); 534
597 copy_object(&at->clone,op); 535 object *op = at->clone.clone ();
536 op->arch = at;
598 op->instantiate (); 537 op->instantiate ();
599 op->arch=at;
600 return op; 538 return op;
601} 539}
602 540
603/* 541/*
604 * Creates an object. This function is called by get_archetype() 542 * Creates an object. This function is called by get_archetype()
605 * if it fails to find the appropriate archetype. 543 * if it fails to find the appropriate archetype.
606 * Thus get_archetype() will be guaranteed to always return 544 * Thus get_archetype() will be guaranteed to always return
607 * an object, and never NULL. 545 * an object, and never NULL.
608 */ 546 */
609 547object *
610object *create_singularity(const char *name) { 548create_singularity (const char *name)
549{
611 object *op; 550 object *op;
612 char buf[MAX_BUF]; 551 char buf[MAX_BUF];
552
613 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 553 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
614 op = get_object(); 554 op = object::create ();
615 op->name = add_string(buf); 555 op->name = op->name_pl = buf;
616 op->name_pl = add_string(buf);
617 SET_FLAG(op,FLAG_NO_PICK); 556 SET_FLAG (op, FLAG_NO_PICK);
618 return op; 557 return op;
619} 558}
620 559
621/* 560/*
622 * Finds which archetype matches the given name, and returns a new 561 * Finds which archetype matches the given name, and returns a new
623 * object containing a copy of the archetype. 562 * object containing a copy of the archetype.
624 */ 563 */
625 564object *
626object *get_archetype(const char *name) { 565get_archetype (const char *name)
627 archetype *at; 566{
628 at = find_archetype(name); 567 archetype *at = archetype::find (name);
629 if (at == NULL) 568
569 if (!at)
630 return create_singularity(name); 570 return create_singularity (name);
571
631 return arch_to_object(at); 572 return arch_to_object (at);
632} 573}
633 574
634/* 575/*
635 * Hash-function used by the arch-hashtable. 576 * Hash-function used by the arch-hashtable.
636 */ 577 */
637 578
638unsigned long 579unsigned long
639hasharch(const char *str, int tablesize) { 580hasharch (const char *str, int tablesize)
581{
640 unsigned long hash = 0; 582 unsigned long hash = 0;
641 int i = 0; 583 unsigned int i = 0;
642 const char *p; 584 const char *p;
643 585
644 /* use the one-at-a-time hash function, which supposedly is 586 /* use the one-at-a-time hash function, which supposedly is
645 * better than the djb2-like one used by perl5.005, but 587 * better than the djb2-like one used by perl5.005, but
646 * certainly is better then the bug used here before. 588 * certainly is better then the bug used here before.
647 * see http://burtleburtle.net/bob/hash/doobs.html 589 * see http://burtleburtle.net/bob/hash/doobs.html
648 */ 590 */
649 for (p = str; i < MAXSTRING && *p; p++, i++) { 591 for (p = str; i < MAXSTRING && *p; p++, i++)
592 {
650 hash += *p; 593 hash += *p;
651 hash += hash << 10; 594 hash += hash << 10;
652 hash ^= hash >> 6; 595 hash ^= hash >> 6;
653 } 596 }
597
654 hash += hash << 3; 598 hash += hash << 3;
655 hash ^= hash >> 11; 599 hash ^= hash >> 11;
656 hash += hash << 15; 600 hash += hash << 15;
601
657 return hash % tablesize; 602 return hash % tablesize;
658} 603}
659 604
660/* 605/*
661 * Finds, using the hashtable, which archetype matches the given name. 606 * Finds, using the hashtable, which archetype matches the given name.
662 * returns a pointer to the found archetype, otherwise NULL. 607 * returns a pointer to the found archetype, otherwise NULL.
663 */ 608 */
664
665archetype *find_archetype(const char *name) {
666 archetype *at; 609archetype *
667 unsigned long index; 610archetype::find (const char *name)
668 611{
669 if (name == NULL) 612 if (!name)
670 return (archetype *) NULL;
671
672 index=hasharch(name, ARCHTABLE);
673 arch_search++;
674 for(;;) {
675 at = arch_table[index];
676 if (at==NULL) {
677 if(warn_archetypes)
678 LOG(llevError,"Couldn't find archetype %s\n",name);
679 return NULL;
680 }
681 arch_cmp++;
682 if (!strcmp(at->name,name))
683 return at; 613 return 0;
684 if(++index>=ARCHTABLE) 614
685 index=0; 615 AUTODECL (i, ht.find (name));
686 } 616
617 if (i == ht.end ())
618 return 0;
619 else
620 return i->second;
687} 621}
688 622
689/* 623/*
690 * Adds an archetype to the hashtable. 624 * Adds an archetype to the hashtable.
691 */ 625 */
626void
627archetype::hash_add ()
628{
629 ht.insert (std::make_pair (name, this));
630}
692 631
693static void add_arch(archetype *at) { 632void
694 int index=hasharch(at->name, ARCHTABLE),org_index=index; 633archetype::hash_del ()
695 for(;;) { 634{
696 if(arch_table[index]==NULL) { 635 ht.erase (name);
697 arch_table[index]=at;
698 return;
699 }
700 if(++index==ARCHTABLE)
701 index=0;
702 if(index==org_index)
703 fatal(ARCHTABLE_TOO_SMALL);
704 }
705} 636}
706 637
707/* 638/*
708 * Returns the first archetype using the given type. 639 * Returns the first archetype using the given type.
709 * Used in treasure-generation. 640 * Used in treasure-generation.
710 */ 641 */
711 642archetype *
712archetype *type_to_archetype(int type) { 643type_to_archetype (int type)
644{
713 archetype *at; 645 archetype *at;
714 646
715 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 647 for (at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
716 if(at->clone.type==type) 648 if (at->clone.type == type)
717 return at; 649 return at;
650
718 return NULL; 651 return 0;
719} 652}
720 653
721/* 654/*
722 * Returns a new object copied from the first archetype matching 655 * Returns a new object copied from the first archetype matching
723 * the given type. 656 * the given type.
724 * Used in treasure-generation. 657 * Used in treasure-generation.
725 */ 658 */
726 659
660object *
727object *clone_arch(int type) { 661clone_arch (int type)
662{
728 archetype *at; 663 archetype *at;
729 object *op=get_object();
730 664
731 if((at=type_to_archetype(type))==NULL) { 665 if ((at = type_to_archetype (type)) == NULL)
666 {
732 LOG(llevError,"Can't clone archetype %d\n",type); 667 LOG (llevError, "Can't clone archetype %d\n", type);
733 free_object(op);
734 return NULL; 668 return 0;
735 } 669 }
736 copy_object(&at->clone,op); 670
671 object *op = at->clone.clone ();
737 op->instantiate (); 672 op->instantiate ();
738 return op; 673 return op;
739} 674}
740 675
741/* 676/*
742 * member: make instance from class 677 * member: make instance from class
743 */ 678 */
744 679
680object *
745object *object_create_arch (archetype * at) 681object_create_arch (archetype *at)
746{ 682{
747 object *op, *prev = NULL, *head = NULL; 683 object *op, *prev = 0, *head = 0;
748 684
749 while (at) { 685 while (at)
686 {
750 op = arch_to_object (at); 687 op = arch_to_object (at);
751 op->x = at->clone.x; 688 op->x = at->clone.x;
752 op->y = at->clone.y; 689 op->y = at->clone.y;
690
753 if (head) 691 if (head)
754 op->head = head, prev->more = op; 692 op->head = head, prev->more = op;
693
755 if (!head) 694 if (!head)
756 head = op; 695 head = op;
696
757 prev = op; 697 prev = op;
758 at = at->more; 698 at = at->more;
759 } 699 }
700
760 return (head); 701 return (head);
761} 702}
762 703
763/*** end of arch.c ***/

Diff Legend

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