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.8 by root, Wed Aug 30 06:06:26 2006 UTC vs.
Revision 1.58 by root, Sat Apr 21 11:55:36 2007 UTC

1/* 1/*
2 * static char *rcsid_arch_c =
3 * "$Id: arch.C,v 1.8 2006/08/30 06:06:26 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>
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 parts.push_back (std::make_pair (at, op));
357
358 if (f.kw != KW_more)
359 break;
360
361 f.next ();
362
363 if (f.kw != KW_object)
364 {
365 f.parse_error ("more object");
366 goto fail;
259 } 367 }
260 } 368 }
261 return 0;
262}
263 369
264/* 370 {
265 * Initialises the internal linked list of archetypes (read from file). 371 archetype *head = parts.front ().first;
266 * Then the global "empty_archetype" pointer is initialised.
267 * Then the blocksview[] array is initialised.
268 */
269 372
270void init_archetypes(void) { /* called from add_player() and edit() */ 373 // check that all archetypes belong to the same object or are heads
271 if(first_archetype!=NULL) /* Only do this once */ 374 for (auto (p, parts.begin ()); p != parts.end (); ++p)
375 {
376 archetype *at = p->first;
377
378 if (at->head != head && at->head)
379 {
380 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
381 goto fail;
382 }
383
384 if (at->next && at != head)
385 {
386 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
387 goto fail;
388 }
389 }
390
391 // sever chain of existing head object
392 for (archetype *more, *at = head; at; at = more)
393 {
394 more = at->more;
395
396 at->head = 0;
397 at->more = 0;
398 }
399
400 // replace/update head
401 overwrite (head, parts.front ().second);
402 head->tail_x = 0;
403 head->tail_y = 0;
404
405 // link into list of heads, if not already there
406 if (!head->linked)
407 {
408 head->linked = true;
409 head->next = first_archetype;
410 first_archetype = head;
411 }
412
413 // reassemble new chain
414 archetype *prev = head;
415 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
416 {
417 archetype *at = p->first;
418 overwrite (at, p->second);
419
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 at->head = head;
424 at->clone.head = &head->clone;
425 prev->more = at;
426 prev->clone.more = &at->clone;
427
428 prev = at;
429 }
430
431 loading_arch = false;
272 return; 432 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 } 433 }
330}
331 434
332void free_all_archs(void) 435fail:
333{ 436 for (auto (p, parts.begin ()); p != parts.end (); ++p)
334 archetype *at, *next; 437 p->second->destroy (true);
335 int i=0,f=0;
336 438
337 for (at=first_archetype; at!=NULL; at=next) { 439 loading_arch = false;
338 if (at->more) next=at->more;
339 else next=at->next;
340 if (at->name) free_string(at->name);
341 if (at->clone.name) free_string(at->clone.name);
342 if (at->clone.name_pl) free_string(at->clone.name_pl);
343 if (at->clone.title) free_string(at->clone.title);
344 if (at->clone.race) free_string(at->clone.race);
345 if (at->clone.slaying) free_string(at->clone.slaying);
346 if (at->clone.msg) free_string(at->clone.msg);
347 free(at);
348 i++;
349 }
350 LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f);
351}
352
353/*
354 * Allocates, initialises and returns the pointer to an archetype structure.
355 */
356
357archetype *get_archetype_struct(void) {
358 archetype *arch;
359
360 arch=(archetype *)CALLOC(1,sizeof(archetype));
361 if(arch==NULL)
362 fatal(OUT_OF_MEMORY);
363 arch->next=NULL;
364 arch->name=NULL;
365 arch->clone.other_arch=NULL;
366 arch->clone.name=NULL;
367 arch->clone.name_pl=NULL;
368 arch->clone.title=NULL;
369 arch->clone.race=NULL;
370 arch->clone.slaying=NULL;
371 arch->clone.msg=NULL;
372 clear_object(&arch->clone); /* to initial state other also */
373 CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */
374 SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */
375 arch->head=NULL;
376 arch->more=NULL;
377 return arch; 440 return 0;
378} 441}
379 442
380/* 443/*
381 * Reads/parses the archetype-file, and copies into a linked list 444 * Initialize global archtype pointers:
382 * of archetype-structures.
383 */ 445 */
384void first_arch_pass(object_thawer &fp) {
385 object *op;
386 archetype *at,*head=NULL,*last_more=NULL;
387 int i,first=2;
388
389 op=get_object();
390 op->arch=first_archetype=at=get_archetype_struct();
391
392 while((i=load_object(fp,op,first,0))) {
393 first=0;
394 copy_object(op,&at->clone);
395 at->clone.speed_left= (float) (-0.1);
396 /* copy the body_info to the body_used - this is only really
397 * need for monsters, but doesn't hurt to do it for everything.
398 * by doing so, when a monster is created, it has good starting
399 * values for the body_used info, so when items are created
400 * for it, they can be properly equipped.
401 */
402 memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));
403
404 switch(i) {
405 case LL_NORMAL: /* A new archetype, just link it with the previous */
406 if(last_more!=NULL)
407 last_more->next=at;
408 if(head!=NULL)
409 head->next=at;
410 head=last_more=at;
411#if 0
412 if(!op->type)
413 LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
414#endif
415 at->tail_x = 0;
416 at->tail_y = 0;
417 break;
418
419 case LL_MORE: /* Another part of the previous archetype, link it correctly */
420
421 at->head=head;
422 at->clone.head = &head->clone;
423 if(last_more!=NULL) {
424 last_more->more=at;
425 last_more->clone.more = &at->clone;
426 }
427 last_more=at;
428
429 /* If this multipart image is still composed of individual small
430 * images, don't set the tail_.. values. We can't use them anyways,
431 * and setting these to zero makes the map sending to the client much
432 * easier as just looking at the head, we know what to do.
433 */
434 if (at->clone.face != head->clone.face) {
435 head->tail_x = 0;
436 head->tail_y = 0;
437 } else {
438 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
439 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
440 }
441 break;
442
443 }
444
445 at=get_archetype_struct();
446 clear_object(op);
447 op->arch=at;
448 }
449 free(at);
450 free_object(op);
451}
452
453/*
454 * Reads the archetype file once more, and links all pointers between
455 * archetypes.
456 */
457
458void second_arch_pass(FILE *fp) {
459 char buf[MAX_BUF],*variable=buf,*argument,*cp;
460 archetype *at=NULL,*other;
461
462 while(fgets(buf,MAX_BUF,fp)!=NULL) {
463 if(*buf=='#')
464 continue;
465 if((argument=strchr(buf,' '))!=NULL) {
466 *argument='\0',argument++;
467 cp = argument + strlen(argument)-1;
468 while (isspace(*cp)) {
469 *cp='\0';
470 cp--;
471 }
472 }
473 if(!strcmp("Object",variable)) {
474 if((at=find_archetype(argument))==NULL)
475 LOG(llevError,"Warning: failed to find arch %s\n",argument);
476 } else if(!strcmp("other_arch",variable)) {
477 if(at!=NULL&&at->clone.other_arch==NULL) {
478 if((other=find_archetype(argument))==NULL)
479 LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
480 else if(at!=NULL)
481 at->clone.other_arch=other;
482 }
483 } else if(!strcmp("randomitems",variable)) {
484 if(at!=NULL) {
485 treasurelist *tl=find_treasurelist(argument);
486 if(tl==NULL)
487 LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument);
488 else
489 at->clone.randomitems=tl;
490 }
491 }
492 }
493}
494
495#ifdef DEBUG
496void check_generators(void) {
497 archetype *at;
498 for(at=first_archetype;at!=NULL;at=at->next)
499 if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
500 LOG(llevError,"Warning: %s is generator but lacks other_arch.\n",
501 at->name);
502}
503#endif
504
505/*
506 * First initialises the archtype hash-table (init_archetable()).
507 * Reads and parses the archetype file (with the first and second-pass
508 * functions).
509 * Then initialises treasures by calling load_treasures().
510 */
511
512void 446void
513load_archetypes (void) 447init_archetype_pointers ()
514{ 448{
515 char filename[MAX_BUF]; 449 ring_arch = archetype::find ("ring");
516 int comp; 450 amulet_arch = archetype::find ("amulet");
517#if TIME_ARCH_LOAD 451 staff_arch = archetype::find ("staff");
518 struct timeval tv1, tv2; 452 crown_arch = archetype::find ("crown");
519#endif 453 empty_archetype = archetype::find ("empty_archetype");
520
521 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
522 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
523
524 {
525 object_thawer thawer (filename);
526
527 clear_archetable ();
528 LOG (llevDebug, " arch-pass 1...\n");
529 first_arch_pass (thawer);
530 LOG (llevDebug, " done\n");
531
532 init_archetable ();
533 warn_archetypes = 1;
534 }
535
536 {
537 object_thawer thawer (filename);
538
539 LOG (llevDebug, " loading treasure...\n");
540 load_treasures ();
541 LOG (llevDebug, " done\n arch-pass 2...\n");
542 second_arch_pass (thawer);
543 LOG (llevDebug, " done\n");
544#ifdef DEBUG
545 check_generators ();
546#endif
547 }
548 LOG (llevDebug, " done\n");
549} 454}
550 455
551/* 456/*
552 * Creates and returns a new object which is a copy of the given archetype. 457 * Creates and returns a new object which is a copy of the given archetype.
553 * This function returns NULL on failure. 458 * This function returns NULL on failure.
554 */ 459 */
555 460object *
556object *arch_to_object(archetype *at) { 461arch_to_object (archetype *at)
557 object *op; 462{
558 if(at==NULL) { 463 if (!at)
559 if(warn_archetypes) 464 {
560 LOG(llevError,"Couldn't find archetype.\n"); 465 LOG (llevError, "Couldn't find archetype.\n");
561 return NULL; 466 return 0;
562 } 467 }
563 op=get_object(); 468
564 copy_object(&at->clone,op); 469 object *op = at->clone.clone ();
470 op->arch = at;
565 op->instantiate (); 471 op->instantiate ();
566 op->arch=at; 472
567 return op; 473 return op;
568} 474}
569 475
570/* 476/*
571 * Creates an object. This function is called by get_archetype() 477 * Creates an object. This function is called by get_archetype()
572 * if it fails to find the appropriate archetype. 478 * if it fails to find the appropriate archetype.
573 * Thus get_archetype() will be guaranteed to always return 479 * Thus get_archetype() will be guaranteed to always return
574 * an object, and never NULL. 480 * an object, and never NULL.
575 */ 481 */
576 482object *
577object *create_singularity(const char *name) { 483create_singularity (const char *name)
484{
578 object *op; 485 object *op;
579 char buf[MAX_BUF]; 486 char buf[MAX_BUF];
487
580 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 488 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
581 op = get_object(); 489 op = object::create ();
582 op->name = add_string(buf); 490 op->name = op->name_pl = buf;
583 op->name_pl = add_string(buf);
584 SET_FLAG(op,FLAG_NO_PICK); 491 SET_FLAG (op, FLAG_NO_PICK);
585 return op; 492 return op;
586} 493}
587 494
588/* 495/*
589 * Finds which archetype matches the given name, and returns a new 496 * Finds which archetype matches the given name, and returns a new
590 * object containing a copy of the archetype. 497 * object containing a copy of the archetype.
591 */ 498 */
592 499object *
593object *get_archetype(const char *name) { 500get_archetype (const char *name)
594 archetype *at; 501{
595 at = find_archetype(name); 502 archetype *at = archetype::find (name);
596 if (at == NULL) 503
504 if (!at)
597 return create_singularity(name); 505 return create_singularity (name);
506
598 return arch_to_object(at); 507 return arch_to_object (at);
599}
600
601/*
602 * Hash-function used by the arch-hashtable.
603 */
604
605unsigned long
606hasharch(const char *str, int tablesize) {
607 unsigned long hash = 0;
608 int i = 0;
609 const char *p;
610
611 /* use the one-at-a-time hash function, which supposedly is
612 * better than the djb2-like one used by perl5.005, but
613 * certainly is better then the bug used here before.
614 * see http://burtleburtle.net/bob/hash/doobs.html
615 */
616 for (p = str; i < MAXSTRING && *p; p++, i++) {
617 hash += *p;
618 hash += hash << 10;
619 hash ^= hash >> 6;
620 }
621 hash += hash << 3;
622 hash ^= hash >> 11;
623 hash += hash << 15;
624 return hash % tablesize;
625} 508}
626 509
627/* 510/*
628 * Finds, using the hashtable, which archetype matches the given name. 511 * Finds, using the hashtable, which archetype matches the given name.
629 * returns a pointer to the found archetype, otherwise NULL. 512 * returns a pointer to the found archetype, otherwise NULL.
630 */ 513 */
631
632archetype *find_archetype(const char *name) {
633 archetype *at; 514archetype *
634 unsigned long index; 515archetype::find (const char *name)
635 516{
636 if (name == NULL) 517 if (!name)
637 return (archetype *) NULL;
638
639 index=hasharch(name, ARCHTABLE);
640 arch_search++;
641 for(;;) {
642 at = arch_table[index];
643 if (at==NULL) {
644 if(warn_archetypes)
645 LOG(llevError,"Couldn't find archetype %s\n",name);
646 return NULL; 518 return 0;
519
520 auto (i, ht.find (name));
521
522 if (i == ht.end ())
523 return 0;
524 else
525 return i->second;
526}
527
528archetype *
529archetype::get (const char *name)
530{
531 if (!name)
647 } 532 {
648 arch_cmp++; 533 LOG (llevError, "null archetype requested\n");
649 if (!strcmp(at->name,name)) 534 name = "(null)";
535 }
536
537 archetype *at = find (name);
538
539 if (!at)
540 {
541 archetypes.push_back (at = new archetype);
542 at->name = at->clone.name = at->clone.name_pl = name;
543 at->hash_add ();
544 }
545
650 return at; 546 return at;
651 if(++index>=ARCHTABLE)
652 index=0;
653 }
654} 547}
655 548
656/* 549/*
657 * Adds an archetype to the hashtable. 550 * Adds an archetype to the hashtable.
658 */ 551 */
552void
553archetype::hash_add ()
554{
555 ht.insert (std::make_pair (name, this));
556}
659 557
660static void add_arch(archetype *at) { 558void
661 int index=hasharch(at->name, ARCHTABLE),org_index=index; 559archetype::hash_del ()
662 for(;;) { 560{
663 if(arch_table[index]==NULL) { 561 ht.erase (name);
664 arch_table[index]=at;
665 return;
666 }
667 if(++index==ARCHTABLE)
668 index=0;
669 if(index==org_index)
670 fatal(ARCHTABLE_TOO_SMALL);
671 }
672} 562}
673 563
674/* 564/*
675 * Returns the first archetype using the given type. 565 * Returns the first archetype using the given type.
676 * Used in treasure-generation. 566 * Used in treasure-generation.
677 */ 567 */
678
679archetype *type_to_archetype(int type) {
680 archetype *at; 568archetype *
681 569type_to_archetype (int type)
570{
682 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 571 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
683 if(at->clone.type==type) 572 if (at->clone.type == type)
684 return at; 573 return at;
574
685 return NULL; 575 return 0;
686} 576}
687 577
688/* 578/*
689 * Returns a new object copied from the first archetype matching 579 * Returns a new object copied from the first archetype matching
690 * the given type. 580 * the given type.
691 * Used in treasure-generation. 581 * Used in treasure-generation.
692 */ 582 */
693 583object *
694object *clone_arch(int type) { 584clone_arch (int type)
585{
695 archetype *at; 586 archetype *at;
696 object *op=get_object();
697 587
698 if((at=type_to_archetype(type))==NULL) { 588 if ((at = type_to_archetype (type)) == NULL)
589 {
699 LOG(llevError,"Can't clone archetype %d\n",type); 590 LOG (llevError, "Can't clone archetype %d\n", type);
700 free_object(op);
701 return NULL; 591 return 0;
702 } 592 }
703 copy_object(&at->clone,op); 593
594 object *op = at->clone.clone ();
704 op->instantiate (); 595 op->instantiate ();
705 return op; 596 return op;
706} 597}
707 598
708/* 599/*
709 * member: make instance from class 600 * member: make instance from class
710 */ 601 */
711 602
603object *
712object *object_create_arch (archetype * at) 604object_create_arch (archetype *at)
713{ 605{
714 object *op, *prev = NULL, *head = NULL; 606 object *op, *prev = 0, *head = 0;
715 607
716 while (at) { 608 while (at)
609 {
717 op = arch_to_object (at); 610 op = arch_to_object (at);
718 op->x = at->clone.x; 611 op->x = at->clone.x;
719 op->y = at->clone.y; 612 op->y = at->clone.y;
613
720 if (head) 614 if (head)
721 op->head = head, prev->more = op; 615 op->head = head, prev->more = op;
616
722 if (!head) 617 if (!head)
723 head = op; 618 head = op;
619
724 prev = op; 620 prev = op;
725 at = at->more; 621 at = at->more;
726 } 622 }
623
727 return (head); 624 return (head);
728} 625}
729 626
730/*** end of arch.c ***/

Diff Legend

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