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.11 by root, Sun Sep 3 22:45:55 2006 UTC vs.
Revision 1.60 by root, Thu May 17 21:32:08 2007 UTC

1/* 1/*
2 * static char *rcsid_arch_c =
3 * "$Id: arch.C,v 1.11 2006/09/03 22:45:55 root Exp $";
4 */
5
6/*
7 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game
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>
35 32#include <tr1/unordered_map>
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 */
45 33
46/* The naming of these functions is really poor - they are all 34/* The naming of these functions is really poor - they are all
47 * pretty much named '.._arch_...', but they may more may not 35 * pretty much named '.._arch_...', but they may more may not
48 * return archetypes. Some make the arch_to_object call, and thus 36 * return archetypes. Some make the arch_to_object call, and thus
49 * return an object. Perhaps those should be called 'archob' functions 37 * return an object. Perhaps those should be called 'archob' functions
50 * to denote they return an object derived from the archetype. 38 * to denote they return an object derived from the archetype.
51 * MSW 2003-04-29 39 * MSW 2003-04-29
52 */ 40 */
41
42bool loading_arch; // ugly flag to object laoder etc. to suppress/request special processing
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);
55static std::vector<archetype *> archetypes;
53 56
54/** 57/**
55 * GROS - This function retrieves an archetype given the name that appears 58 * GROS - This function retrieves an archetype given the name that appears
56 * during the game (for example, "writing pen" instead of "stylus"). 59 * 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. 60 * It does not use the hashtable system, but browse the whole archlist each time.
… …
60 * Params: 63 * Params:
61 * - name: the name we're searching for (ex: "writing pen"); 64 * - name: the name we're searching for (ex: "writing pen");
62 * Return value: 65 * Return value:
63 * - the archetype found or null if nothing was found. 66 * - the archetype found or null if nothing was found.
64 */ 67 */
68archetype *
65archetype *find_archetype_by_object_name(const char *name) { 69find_archetype_by_object_name (const char *name)
66 archetype *at; 70{
71 shstr_cmp name_cmp (name);
67 72
68 if (name == NULL)
69 return (archetype *) NULL;
70
71 for(at = first_archetype;at!=NULL;at=at->next) { 73 for (archetype *at = first_archetype; at; at = at->next)
72 if (!strcmp(at->clone.name, name)) 74 if (at->clone.name == name_cmp)
73 return at; 75 return at;
74 } 76
75 return NULL; 77 return 0;
76} 78}
77 79
78/** 80/**
79 * This function retrieves an archetype by type and name that appears during 81 * 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() 82 * the game. It is basically the same as find_archetype_by_object_name()
81 * except that it considers only items of the given type. 83 * except that it considers only items of the given type.
82 */ 84 */
85archetype *
83archetype *find_archetype_by_object_type_name(int type, const char *name) { 86find_archetype_by_object_type_name (int type, const char *name)
84 archetype *at; 87{
88 shstr_cmp name_cmp (name);
85 89
86 if (name == NULL)
87 return NULL;
88
89 for (at = first_archetype; at != NULL; at = at->next) { 90 for (archetype *at = first_archetype; at; at = at->next)
90 if (at->clone.type == type && strcmp(at->clone.name, name) == 0) 91 if (at->clone.name == name_cmp && at->clone.type == type)
91 return at; 92 return at;
92 }
93 93
94 return NULL; 94 return 0;
95} 95}
96 96
97/* This is a lot like the above function. Instead, we are trying to match 97/* 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 98 * 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). 99 * against (eg, to only match against skills or only skill objects for example).
100 * If type is -1, ew don't match on type. 100 * If type is -1, ew don't match on type.
101 */ 101 */
102object *
102object *get_archetype_by_skill_name(const char *skill, int type) { 103get_archetype_by_skill_name (const char *skill, int type)
103 archetype *at; 104{
105 shstr_cmp skill_cmp (skill);
104 106
105 if (skill == NULL)
106 return NULL;
107
108 for(at = first_archetype;at!=NULL;at=at->next) { 107 for (archetype *at = first_archetype; at; at = at->next)
109 if ( ((type == -1) || (type == at->clone.type)) && 108 if (at->clone.skill == skill_cmp && (type == -1 || type == at->clone.type))
110 (!strcmp(at->clone.skill, skill)))
111 return arch_to_object(at); 109 return arch_to_object (at);
112 } 110
113 return NULL; 111 return 0;
114} 112}
115 113
116/* similiar to above - this returns the first archetype 114/* similiar to above - this returns the first archetype
117 * that matches both the type and subtype. type and subtype 115 * 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 116 * 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 117 * may not be very useful. This function is most useful when
120 * subtypes are known to be unique for a particular type 118 * subtypes are known to be unique for a particular type
121 * (eg, skills) 119 * (eg, skills)
122 */ 120 */
121archetype *
123archetype *get_archetype_by_type_subtype(int type, int subtype) { 122get_archetype_by_type_subtype (int type, int subtype)
124 archetype *at; 123{
125
126 for(at = first_archetype;at!=NULL;at=at->next) { 124 for (archetype *at = first_archetype; at; at = at->next)
127 if ( ((type == -1) || (type == at->clone.type)) && 125 if ((type == -1 || type == at->clone.type) && (subtype == -1 || subtype == at->clone.subtype))
128 (subtype == -1 || subtype == at->clone.subtype))
129 return at; 126 return at;
130 } 127
131 return NULL; 128 return 0;
132} 129}
133 130
134/** 131/**
135 * GROS - this returns a new object given the name that appears during the game 132 * GROS - this returns a new object given the name that appears during the game
136 * (for example, "writing pen" instead of "stylus"). 133 * (for example, "writing pen" instead of "stylus").
… …
141 * Note by MSW - it appears that it takes the full name and keeps 138 * 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 139 * 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, 140 * doesn't malloc it each time - not that this function is used much,
144 * but it otherwise had a big memory leak. 141 * but it otherwise had a big memory leak.
145 */ 142 */
143object *
146object *get_archetype_by_object_name(const char *name) { 144get_archetype_by_object_name (const char *name)
147 archetype *at; 145{
148 char tmpname[MAX_BUF]; 146 char tmpname[MAX_BUF];
149 int i; 147 int i;
150 148
151 strncpy(tmpname,name,MAX_BUF-1); 149 assign (tmpname, name);
152 tmpname[MAX_BUF-1] = 0; 150
153 for(i=strlen(tmpname); i>0; i--) { 151 for (i = strlen (tmpname); i > 0; i--)
152 {
154 tmpname[i] = 0; 153 tmpname[i] = 0;
154
155 at = find_archetype_by_object_name(tmpname); 155 if (archetype *at = find_archetype_by_object_name (tmpname))
156 if (at !=NULL)
157 {
158 return arch_to_object(at); 156 return arch_to_object (at);
159 }
160 } 157 }
158
161 return create_singularity(name); 159 return create_singularity (name);
162} 160}
163 161
164 /* This is a subset of the parse_id command. Basically, name can be 162 /* This is a subset of the parse_id command. Basically, name can be
165 * a string seperated lists of things to match, with certain keywords. 163 * a string seperated lists of things to match, with certain keywords.
166 * pl is the player (only needed to set count properly) 164 * pl is the player (only needed to set count properly)
… …
176 * player object.) 174 * player object.)
177 * If count is 1, make a quick check on the name. 175 * If count is 1, make a quick check on the name.
178 * IF count is >1, we need to make plural name. Return if match. 176 * IF count is >1, we need to make plural name. Return if match.
179 * Last, make a check on the full name. 177 * Last, make a check on the full name.
180 */ 178 */
179int
181int item_matched_string(object *pl, object *op, const char *name) 180item_matched_string (object *pl, object *op, const char *name)
182{ 181{
183 char *cp, local_name[MAX_BUF]; 182 char *cp, local_name[MAX_BUF];
184 int count,retval=0; 183 int count, retval = 0;
184
185 strcpy(local_name, name); /* strtok is destructive to name */ 185 assign (local_name, name); /* strtok is destructive to name */
186 186
187 for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { 187 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
188 while (cp[0]==' ') ++cp; /* get rid of spaces */ 188 {
189 while (cp[0] == ' ')
190 ++cp; /* get rid of spaces */
189 191
190 /* LOG(llevDebug,"Trying to match %s\n", cp);*/ 192 /* LOG(llevDebug,"Trying to match %s\n", cp); */
191 /* All is a very generic match - low match value */ 193 /* All is a very generic match - low match value */
192 if (!strcmp(cp,"all")) return 1; 194 if (!strcmp (cp, "all"))
195 return 1;
193 196
194 /* unpaid is a little more specific */ 197 /* unpaid is a little more specific */
195 if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; 198 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
196 if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) &&
197 (QUERY_FLAG(op,FLAG_CURSED) ||QUERY_FLAG(op,FLAG_DAMNED)))
198 return 2; 199 return 2;
200 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED)))
201 return 2;
199 202
200 if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) 203 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
201 return 2; 204 return 2;
202 205
203 /* Allow for things like '100 arrows' */ 206 /* Allow for things like '100 arrows' */
204 if ((count=atoi(cp))!=0) { 207 if ((count = atoi (cp)) != 0)
208 {
205 cp=strchr(cp, ' '); 209 cp = strchr (cp, ' ');
206 while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ 210 while (cp && cp[0] == ' ')
211 ++cp; /* get rid of spaces */
207 } 212 }
208 else { 213 else
214 {
209 if (pl->type==PLAYER) 215 if (pl->type == PLAYER)
210 count=pl->contr->count; 216 count = pl->contr->count;
211 else 217 else
212 count = 0; 218 count = 0;
213 } 219 }
214 220
215 if (!cp || cp[0]=='\0' || count<0) return 0; 221 if (!cp || cp[0] == '\0' || count < 0)
222 return 0;
216 223
217 224
218 /* The code here should go from highest retval to lowest. That 225 /* The code here should go from highest retval to lowest. That
219 * is because of the 'else' handling - we don't want to match on 226 * is because of the 'else' handling - we don't want to match on
220 * something and set a low retval, even though it may match a higher retcal 227 * something and set a low retval, even though it may match a higher retcal
221 * later. So keep it in descending order here, so we try for the best 228 * later. So keep it in descending order here, so we try for the best
222 * match first, and work downward. 229 * match first, and work downward.
223 */ 230 */
224 if (!strcasecmp(cp,query_name(op))) retval=20; 231 if (!strcasecmp (cp, query_name (op)))
232 retval = 20;
225 else if (!strcasecmp(cp,query_short_name(op))) retval=18; 233 else if (!strcasecmp (cp, query_short_name (op)))
226 else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; 234 retval = 18;
227 else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;
228 else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15;
229 else if (!strncasecmp(cp,query_base_name(op,0), 235 else if (!strcasecmp (cp, query_base_name (op, 0)))
230 strlen(cp))) retval=14; 236 retval = 16;
231 else if (!strncasecmp(cp,query_base_name(op,1), 237 else if (!strcasecmp (cp, query_base_name (op, 1)))
232 strlen(cp))) retval=14; 238 retval = 16;
233 239 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
240 retval = 15;
241 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp)))
242 retval = 14;
243 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp)))
244 retval = 14;
234 /* Do substring checks, so things like 'Str+1' will match. 245 /* Do substring checks, so things like 'Str+1' will match.
235 * retval of these should perhaps be lower - they are lower 246 * retval of these should perhaps be lower - they are lower
236 * then the specific strcasecmp aboves, but still higher than 247 * then the specific strcasecmp aboves, but still higher than
237 * some other match criteria. 248 * some other match criteria.
238 */ 249 */
239 else if (strstr(query_base_name(op,1), cp)) retval = 12; 250 else if (strstr (query_base_name (op, 1), cp))
251 retval = 12;
240 else if (strstr(query_base_name(op,0), cp)) retval = 12; 252 else if (strstr (query_base_name (op, 0), cp))
253 retval = 12;
241 else if (strstr(query_short_name(op), cp)) retval = 12; 254 else if (strstr (query_short_name (op), cp))
242 255 retval = 12;
243 /* Check against plural/non plural based on count. */ 256 /* Check against plural/non plural based on count. */
244 else if (count>1 && !strcasecmp(cp,op->name_pl)) { 257 else if (count > 1 && !strcasecmp (cp, op->name_pl))
245 retval=6; 258 retval = 6;
259 else if (count == 1 && !strcasecmp (op->name, cp))
260 retval = 6;
261 /* base name matched - not bad */
262 else if (strcasecmp (cp, op->name) == 0 && !count)
263 retval = 4;
264 /* Check for partial custom name, but give a real low priority */
265 else if (op->custom_name && strstr (op->custom_name, cp))
266 retval = 3;
267
268 if (retval)
269 {
270 if (pl->type == PLAYER)
271 pl->contr->count = count;
272
273 return retval;
246 } 274 }
247 else if (count==1 && !strcasecmp(op->name,cp)) { 275 }
248 retval=6; 276
277 return 0;
278}
279
280archetype::archetype ()
281{
282 clone.arch = this;
283
284 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
285 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
286}
287
288archetype::~archetype ()
289{
290 //TODO: nuke ->more's
291}
292
293static void
294unlink (archetype *at)
295{
296 if (at->head)
297 at = at->head;
298
299 // destroy this archetype's link, making singletons out of its parts
300 while (at)
301 {
302 archetype *more = at->more;
303 at->clone.destroy_inv ();
304 at->head = at->more = 0;
305 at = more;
306 }
307}
308
309// dire hack, need to rationalise
310void
311overwrite (archetype *at, object *op)
312{
313 at->clone = *op;
314 at->clone.arch = at;
315
316 at->clone.inv = op->inv; op->inv = 0;
317
318 op->destroy ();
319}
320
321archetype *
322archetype::read (object_thawer &f)
323{
324 assert (f.kw == KW_object);
325
326 loading_arch = true; // hack to tell parse_kv et al. to behave
327
328 typedef std::pair<archetype *, object *> part;
329 std::vector<part> parts;
330
331 coroapi::cede_to_tick_every (100);
332
333 for (;;)
334 {
335 object *op = object::create ();
336 archetype *at = get (f.get_str ());
337 f.get (op->name);
338 f.next ();
339
340#if 0
341 if (f.kw == KW_inherit)
342 {
343 if (archetype *at = find (f.get_str ()))
344 *op = at->clone;
345 else
346 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
347 &at->name, f.get_str ());
348
349 f.next ();
249 } 350 }
250 /* base name matched - not bad */ 351#endif
251 else if (strcasecmp(cp,op->name)==0 && !count) retval=4;
252 /* Check for partial custom name, but give a real low priority */
253 else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3;
254 352
255 if (retval) { 353 if (!op->parse_kv (f))
256 if (pl->type == PLAYER) 354 goto fail;
257 pl->contr->count=count; 355
258 return retval; 356 op->post_load_check ();
357
358 parts.push_back (std::make_pair (at, op));
359
360 if (f.kw != KW_more)
361 break;
362
363 f.next ();
364
365 if (f.kw != KW_object)
366 {
367 f.parse_error ("more object");
368 goto fail;
259 } 369 }
260 } 370 }
261 return 0;
262}
263 371
264/* 372 {
265 * Initialises the internal linked list of archetypes (read from file). 373 archetype *head = parts.front ().first;
266 * Then the global "empty_archetype" pointer is initialised.
267 * Then the blocksview[] array is initialised.
268 */
269 374
270void init_archetypes(void) { /* called from add_player() and edit() */ 375 // check that all archetypes belong to the same object or are heads
271 if(first_archetype!=NULL) /* Only do this once */ 376 for (auto (p, parts.begin ()); p != parts.end (); ++p)
377 {
378 archetype *at = p->first;
379
380 if (at->head != head && at->head)
381 {
382 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
383 goto fail;
384 }
385
386 if (at->next && at != head)
387 {
388 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
389 goto fail;
390 }
391 }
392
393 // sever chain of existing head object
394 for (archetype *more, *at = head; at; at = more)
395 {
396 more = at->more;
397
398 at->head = 0;
399 at->more = 0;
400 }
401
402 // replace/update head
403 overwrite (head, parts.front ().second);
404 head->tail_x = 0;
405 head->tail_y = 0;
406
407 // link into list of heads, if not already there
408 if (!head->linked)
409 {
410 head->linked = true;
411 head->next = first_archetype;
412 first_archetype = head;
413 }
414
415 // reassemble new chain
416 archetype *prev = head;
417 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
418 {
419 archetype *at = p->first;
420 overwrite (at, p->second);
421
422 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
423 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
424
425 at->head = head;
426 at->clone.head = &head->clone;
427 prev->more = at;
428 prev->clone.more = &at->clone;
429
430 prev = at;
431 }
432
433 loading_arch = false;
272 return; 434 return head;
273 arch_init = 1;
274 load_archetypes();
275 arch_init = 0;
276 empty_archetype=find_archetype("empty_archetype");
277/* init_blocksview();*/
278}
279
280/*
281 * Stores debug-information about how efficient the hashtable
282 * used for archetypes has been in the static errmsg array.
283 */
284
285void arch_info(object *op) {
286 sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp);
287 new_draw_info(NDI_BLACK, 0, op,errmsg);
288}
289
290/*
291 * Initialise the hashtable used by the archetypes.
292 */
293
294void clear_archetable(void) {
295 memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *));
296}
297
298/*
299 * An alternative way to init the hashtable which is slower, but _works_...
300 */
301
302void init_archetable(void) {
303 archetype *at;
304 LOG(llevDebug," Setting up archetable...\n");
305 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)
306 add_arch(at);
307 LOG(llevDebug,"done\n");
308}
309
310/*
311 * Dumps an archetype to debug-level output.
312 */
313
314void dump_arch(archetype *at) {
315 dump_object(&at->clone);
316}
317
318/*
319 * Dumps _all_ archetypes to debug-level output.
320 * If you run crossfire with debug, and enter DM-mode, you can trigger
321 * this with the O key.
322 */
323
324void dump_all_archetypes(void) {
325 archetype *at;
326 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) {
327 dump_arch(at);
328 fprintf(logfile, "%s\n", errmsg);
329 } 435 }
330}
331 436
332void free_all_archs(void) 437fail:
333{ 438 for (auto (p, parts.begin ()); p != parts.end (); ++p)
334 archetype *at, *next; 439 p->second->destroy (true);
335 int i=0,f=0;
336 440
337 for (at=first_archetype; at!=NULL; at=next) { 441 loading_arch = false;
338 if (at->more) next=at->more;
339 else next=at->next;
340
341 delete at;
342 i++;
343 }
344 LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f);
345}
346
347/*
348 * Allocates, initialises and returns the pointer to an archetype structure.
349 */
350// TODO: should become constructor
351archetype *get_archetype_struct(void) {
352 archetype *arch;
353
354 arch = new archetype;
355
356 clear_object (&arch->clone); /* to initial state other also */
357 CLEAR_FLAG (&arch->clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
358 SET_FLAG (&arch->clone, FLAG_REMOVED); /* doesn't copy these flags... */
359
360 return arch; 442 return 0;
361} 443}
362 444
363/* 445/*
364 * Reads/parses the archetype-file, and copies into a linked list 446 * Initialize global archtype pointers:
365 * of archetype-structures.
366 */ 447 */
367void first_arch_pass(object_thawer &fp) {
368 object *op;
369 archetype *at,*head=NULL,*last_more=NULL;
370 int i;
371
372 op=get_object();
373 op->arch=first_archetype=at=get_archetype_struct();
374
375 while((i=load_object(fp,op,0))) {
376 copy_object(op,&at->clone);
377 at->clone.speed_left= (float) (-0.1);
378 /* copy the body_info to the body_used - this is only really
379 * need for monsters, but doesn't hurt to do it for everything.
380 * by doing so, when a monster is created, it has good starting
381 * values for the body_used info, so when items are created
382 * for it, they can be properly equipped.
383 */
384 memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));
385
386 switch(i) {
387 case LL_NORMAL: /* A new archetype, just link it with the previous */
388 if(last_more!=NULL)
389 last_more->next=at;
390 if(head!=NULL)
391 head->next=at;
392 head=last_more=at;
393#if 0
394 if(!op->type)
395 LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
396#endif
397 at->tail_x = 0;
398 at->tail_y = 0;
399 break;
400
401 case LL_MORE: /* Another part of the previous archetype, link it correctly */
402
403 at->head=head;
404 at->clone.head = &head->clone;
405 if(last_more!=NULL) {
406 last_more->more=at;
407 last_more->clone.more = &at->clone;
408 }
409 last_more=at;
410
411 /* If this multipart image is still composed of individual small
412 * images, don't set the tail_.. values. We can't use them anyways,
413 * and setting these to zero makes the map sending to the client much
414 * easier as just looking at the head, we know what to do.
415 */
416 if (at->clone.face != head->clone.face) {
417 head->tail_x = 0;
418 head->tail_y = 0;
419 } else {
420 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
421 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
422 }
423 break;
424
425 }
426
427 at=get_archetype_struct();
428 clear_object(op);
429 op->arch=at;
430 }
431
432 delete at;
433 free_object(op);
434}
435
436/*
437 * Reads the archetype file once more, and links all pointers between
438 * archetypes.
439 */
440
441void second_arch_pass(object_thawer &thawer) {
442 char buf[MAX_BUF],*variable=buf,*argument,*cp;
443 archetype *at=NULL,*other;
444
445 while(fgets(buf,MAX_BUF,thawer)!=NULL) {
446 if(*buf=='#')
447 continue;
448 if((argument=strchr(buf,' '))!=NULL) {
449 *argument='\0',argument++;
450 cp = argument + strlen(argument)-1;
451 while (isspace(*cp)) {
452 *cp='\0';
453 cp--;
454 }
455 }
456 if(!strcmp("Object",variable)) {
457 if((at=find_archetype(argument))==NULL)
458 LOG(llevError,"Warning: failed to find arch %s\n",argument);
459 } else if(!strcmp("other_arch",variable)) {
460 if(at!=NULL&&at->clone.other_arch==NULL) {
461 if((other=find_archetype(argument))==NULL)
462 LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
463 else if(at!=NULL)
464 at->clone.other_arch=other;
465 }
466 } else if(!strcmp("randomitems",variable)) {
467 if(at!=NULL) {
468 treasurelist *tl=find_treasurelist(argument);
469 if(tl==NULL)
470 LOG(llevError,"Failed to link treasure to arch (%s): %s\n", &at->name, argument);
471 else
472 at->clone.randomitems=tl;
473 }
474 }
475 }
476}
477
478#ifdef DEBUG
479void check_generators(void) {
480 archetype *at;
481 for(at=first_archetype;at!=NULL;at=at->next)
482 if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
483 LOG(llevError,"Warning: %s is generator but lacks other_arch.\n", &at->name);
484}
485#endif
486
487/*
488 * First initialises the archtype hash-table (init_archetable()).
489 * Reads and parses the archetype file (with the first and second-pass
490 * functions).
491 * Then initialises treasures by calling load_treasures().
492 */
493
494void 448void
495load_archetypes (void) 449init_archetype_pointers ()
496{ 450{
497 char filename[MAX_BUF]; 451 ring_arch = archetype::find ("ring");
498 int comp; 452 amulet_arch = archetype::find ("amulet");
499#if TIME_ARCH_LOAD 453 staff_arch = archetype::find ("staff");
500 struct timeval tv1, tv2; 454 crown_arch = archetype::find ("crown");
501#endif 455 empty_archetype = archetype::find ("empty_archetype");
502
503 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
504 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
505
506 {
507 object_thawer thawer (filename);
508
509 clear_archetable ();
510 LOG (llevDebug, " arch-pass 1...\n");
511 first_arch_pass (thawer);
512 LOG (llevDebug, " done\n");
513
514 init_archetable ();
515 warn_archetypes = 1;
516 }
517
518 {
519 object_thawer thawer (filename);
520
521 LOG (llevDebug, " loading treasure...\n");
522 load_treasures ();
523 LOG (llevDebug, " done\n arch-pass 2...\n");
524 second_arch_pass (thawer);
525 LOG (llevDebug, " done\n");
526#ifdef DEBUG
527 check_generators ();
528#endif
529 }
530 LOG (llevDebug, " done\n");
531} 456}
532 457
533/* 458/*
534 * Creates and returns a new object which is a copy of the given archetype. 459 * Creates and returns a new object which is a copy of the given archetype.
535 * This function returns NULL on failure. 460 * This function returns NULL on failure.
536 */ 461 */
537 462object *
538object *arch_to_object(archetype *at) { 463arch_to_object (archetype *at)
539 object *op; 464{
540 if(at==NULL) { 465 if (!at)
541 if(warn_archetypes) 466 {
542 LOG(llevError,"Couldn't find archetype.\n"); 467 LOG (llevError, "Couldn't find archetype.\n");
543 return NULL; 468 return 0;
544 } 469 }
545 op=get_object(); 470
546 copy_object(&at->clone,op); 471 object *op = at->clone.clone ();
472 op->arch = at;
547 op->instantiate (); 473 op->instantiate ();
548 op->arch=at; 474
549 return op; 475 return op;
550} 476}
551 477
552/* 478/*
553 * Creates an object. This function is called by get_archetype() 479 * Creates an object. This function is called by get_archetype()
554 * if it fails to find the appropriate archetype. 480 * if it fails to find the appropriate archetype.
555 * Thus get_archetype() will be guaranteed to always return 481 * Thus get_archetype() will be guaranteed to always return
556 * an object, and never NULL. 482 * an object, and never NULL.
557 */ 483 */
558 484object *
559object *create_singularity(const char *name) { 485create_singularity (const char *name)
486{
560 object *op; 487 object *op;
561 char buf[MAX_BUF]; 488 char buf[MAX_BUF];
489
562 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 490 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
563 op = get_object(); 491 op = object::create ();
564 op->name = op->name_pl = buf; 492 op->name = op->name_pl = buf;
565 SET_FLAG(op,FLAG_NO_PICK); 493 SET_FLAG (op, FLAG_NO_PICK);
566 return op; 494 return op;
567} 495}
568 496
569/* 497/*
570 * Finds which archetype matches the given name, and returns a new 498 * Finds which archetype matches the given name, and returns a new
571 * object containing a copy of the archetype. 499 * object containing a copy of the archetype.
572 */ 500 */
573 501object *
574object *get_archetype(const char *name) { 502get_archetype (const char *name)
575 archetype *at; 503{
576 at = find_archetype(name); 504 archetype *at = archetype::find (name);
577 if (at == NULL) 505
506 if (!at)
578 return create_singularity(name); 507 return create_singularity (name);
508
579 return arch_to_object(at); 509 return arch_to_object (at);
580}
581
582/*
583 * Hash-function used by the arch-hashtable.
584 */
585
586unsigned long
587hasharch(const char *str, int tablesize)
588{
589 unsigned long hash = 0;
590 unsigned int i = 0;
591 const char *p;
592
593 /* use the one-at-a-time hash function, which supposedly is
594 * better than the djb2-like one used by perl5.005, but
595 * certainly is better then the bug used here before.
596 * see http://burtleburtle.net/bob/hash/doobs.html
597 */
598 for (p = str; i < MAXSTRING && *p; p++, i++)
599 {
600 hash += *p;
601 hash += hash << 10;
602 hash ^= hash >> 6;
603 }
604
605 hash += hash << 3;
606 hash ^= hash >> 11;
607 hash += hash << 15;
608
609 return hash % tablesize;
610} 510}
611 511
612/* 512/*
613 * Finds, using the hashtable, which archetype matches the given name. 513 * Finds, using the hashtable, which archetype matches the given name.
614 * returns a pointer to the found archetype, otherwise NULL. 514 * returns a pointer to the found archetype, otherwise NULL.
615 */ 515 */
616
617archetype *find_archetype(const char *name) {
618 archetype *at; 516archetype *
619 unsigned long index; 517archetype::find (const char *name)
620 518{
621 if (name == NULL) 519 if (!name)
622 return (archetype *) NULL;
623
624 index=hasharch(name, ARCHTABLE);
625 arch_search++;
626 for(;;) {
627 at = arch_table[index];
628 if (at==NULL) {
629 if(warn_archetypes)
630 LOG(llevError,"Couldn't find archetype %s\n",name);
631 return NULL; 520 return 0;
521
522 auto (i, ht.find (name));
523
524 if (i == ht.end ())
525 return 0;
526 else
527 return i->second;
528}
529
530archetype *
531archetype::get (const char *name)
532{
533 if (!name)
632 } 534 {
633 arch_cmp++; 535 LOG (llevError, "null archetype requested\n");
634 if (!strcmp((const char *)at->name,name)) 536 name = "(null)";
537 }
538
539 archetype *at = find (name);
540
541 if (!at)
542 {
543 archetypes.push_back (at = new archetype);
544 at->name = at->clone.name = at->clone.name_pl = name;
545 at->hash_add ();
546 }
547
635 return at; 548 return at;
636 if(++index>=ARCHTABLE)
637 index=0;
638 }
639} 549}
640 550
641/* 551/*
642 * Adds an archetype to the hashtable. 552 * Adds an archetype to the hashtable.
643 */ 553 */
554void
555archetype::hash_add ()
556{
557 ht.insert (std::make_pair (name, this));
558}
644 559
645static void add_arch(archetype *at) { 560void
646 int index=hasharch((const char *)at->name, ARCHTABLE),org_index=index; 561archetype::hash_del ()
647 for(;;) { 562{
648 if(arch_table[index]==NULL) { 563 ht.erase (name);
649 arch_table[index]=at;
650 return;
651 }
652 if(++index==ARCHTABLE)
653 index=0;
654 if(index==org_index)
655 fatal(ARCHTABLE_TOO_SMALL);
656 }
657} 564}
658 565
659/* 566/*
660 * Returns the first archetype using the given type. 567 * Returns the first archetype using the given type.
661 * Used in treasure-generation. 568 * Used in treasure-generation.
662 */ 569 */
663
664archetype *type_to_archetype(int type) {
665 archetype *at; 570archetype *
666 571type_to_archetype (int type)
572{
667 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 573 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
668 if(at->clone.type==type) 574 if (at->clone.type == type)
669 return at; 575 return at;
576
670 return NULL; 577 return 0;
671} 578}
672 579
673/* 580/*
674 * Returns a new object copied from the first archetype matching 581 * Returns a new object copied from the first archetype matching
675 * the given type. 582 * the given type.
676 * Used in treasure-generation. 583 * Used in treasure-generation.
677 */ 584 */
678 585object *
679object *clone_arch(int type) { 586clone_arch (int type)
587{
680 archetype *at; 588 archetype *at;
681 object *op=get_object();
682 589
683 if((at=type_to_archetype(type))==NULL) { 590 if ((at = type_to_archetype (type)) == NULL)
591 {
684 LOG(llevError,"Can't clone archetype %d\n",type); 592 LOG (llevError, "Can't clone archetype %d\n", type);
685 free_object(op);
686 return NULL; 593 return 0;
687 } 594 }
688 copy_object(&at->clone,op); 595
596 object *op = at->clone.clone ();
689 op->instantiate (); 597 op->instantiate ();
690 return op; 598 return op;
691} 599}
692 600
693/* 601/*
694 * member: make instance from class 602 * member: make instance from class
695 */ 603 */
696 604
605object *
697object *object_create_arch (archetype * at) 606object_create_arch (archetype *at)
698{ 607{
699 object *op, *prev = NULL, *head = NULL; 608 object *op, *prev = 0, *head = 0;
700 609
701 while (at) { 610 while (at)
611 {
702 op = arch_to_object (at); 612 op = arch_to_object (at);
703 op->x = at->clone.x; 613 op->x = at->clone.x;
704 op->y = at->clone.y; 614 op->y = at->clone.y;
615
705 if (head) 616 if (head)
706 op->head = head, prev->more = op; 617 op->head = head, prev->more = op;
618
707 if (!head) 619 if (!head)
708 head = op; 620 head = op;
621
709 prev = op; 622 prev = op;
710 at = at->more; 623 at = at->more;
711 } 624 }
625
712 return (head); 626 return (head);
713} 627}
714 628
715/*** end of arch.c ***/

Diff Legend

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