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.10 by root, Sun Sep 3 00:18:39 2006 UTC vs.
Revision 1.63 by root, Mon Jun 4 13:04:00 2007 UTC

1/* 1/*
2 * static char *rcsid_arch_c = 2 * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game.
3 * "$Id: arch.C,v 1.10 2006/09/03 00:18:39 root Exp $"; 3 *
4 */ 4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team
5
6/*
7 CrossFire, A Multiplayer game for X-windows
8
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
11 7 *
12 This program is free software; you can redistribute it and/or modify 8 * Crossfire TRT is free software; you can redistribute it and/or modify it
13 it under the terms of the GNU General Public License as published by 9 * under the terms of the GNU General Public License as published by the Free
14 the Free Software Foundation; either version 2 of the License, or 10 * Software Foundation; either version 2 of the License, or (at your option)
15 (at your option) any later version. 11 * 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, but
18 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
20 GNU General Public License for more details. 16 * 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 along
23 along with this program; if not, write to the Free Software 19 * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Franklin Street, Fifth Floor, Boston, MA 02110-1301 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 to <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);
55archvec 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) 73 for_all_archetypes (at)
69 return (archetype *) NULL; 74 if (at->archname == name_cmp)
70
71 for(at = first_archetype;at!=NULL;at=at->next) {
72 if (!strcmp(at->clone.name, name))
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) 90 for_all_archetypes (at)
87 return NULL; 91 if (at->archname == name_cmp && at->type == type)
88
89 for (at = first_archetype; at != NULL; at = at->next) {
90 if (at->clone.type == type && strcmp(at->clone.name, name) == 0)
91 return at; 92 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) 107 for_all_archetypes (at)
106 return NULL; 108 if (at->skill == skill_cmp && (type == -1 || type == at->type))
107
108 for(at = first_archetype;at!=NULL;at=at->next) {
109 if ( ((type == -1) || (type == at->clone.type)) &&
110 (!strcmp(at->clone.skill, skill)))
111 return arch_to_object(at); 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 124 for_all_archetypes (at)
126 for(at = first_archetype;at!=NULL;at=at->next) { 125 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
127 if ( ((type == -1) || (type == at->clone.type)) &&
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 (const char *name)
281{
282 stub = true;
283 arch = this;
284 this->archname = this->name = this->name_pl = name;
285}
286
287archetype::~archetype ()
288{
289 unlink ();
290}
291
292void
293archetype::link ()
294{
295 ht.insert (std::make_pair (archname, this));
296
297 if (!archetypes.contains (this))
298 archetypes.insert (this);
299}
300
301void
302archetype::unlink ()
303{
304 ht.erase (archname);
305
306 if (archetypes.contains (this))
307 archetypes.erase (this);
308}
309
310/*
311 * Finds, using the hashtable, which archetype matches the given name.
312 * returns a pointer to the found archetype, otherwise NULL.
313 */
314archetype *
315archetype::find (const char *name)
316{
317 if (!name)
318 return 0;
319
320 auto (i, ht.find (name));
321
322 if (i == ht.end ())
323 return 0;
324 else
325 return i->second;
326}
327
328archetype *
329archetype::get (const char *name)
330{
331 if (!name)
332 {
333 LOG (llevError, "null archetype requested\n");
334 name = "(null)";
335 }
336
337 archetype *at = find (name);
338
339 if (loading_arch && at && !at->stub)
340 {
341 at->unlink ();
342 at = 0;
343 }
344
345 if (!at || (!at->stub && loading_arch))
346 {
347 at = new archetype (name);
348 at->link ();
349 }
350
351 return at;
352}
353
354archetype *
355archetype::read (object_thawer &f)
356{
357 assert (f.kw == KW_object);
358
359 loading_arch = true; // hack to tell parse_kv et al. to behave
360
361 std::vector<archetype *> parts;
362
363 coroapi::cede_to_tick_every (10);
364
365 for (;;)
366 {
367 // the archetype might have been referenced earlier
368 // so try to find an existing stub archetype first
369 archetype *at = find (f.get_str ());
370
371 if (!at || !at->stub)
372 at = new archetype (f.get_str ());
373
374 f.next ();
375
376#if 0
377 // implementing it here in the server does neither allow multiple inheritence
378 // nor does it cleanly "just override". it would allow use in map files, though,
379 // and other resource files dynamically laoded (as opposed to being preprocessed).
380 // not that any of this is relevant as of yet...
381 if (f.kw == KW_inherit)
382 {
383 if (archetype *at = find (f.get_str ()))
384 *op = at->clone;
385 else
386 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
387 &at->archname, f.get_str ());
388
389 f.next ();
249 } 390 }
250 /* base name matched - not bad */ 391#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 392
255 if (retval) { 393 if (!at->parse_kv (f))
256 if (pl->type == PLAYER) 394 goto fail;
257 pl->contr->count=count; 395
258 return retval; 396 at->post_load_check ();
397
398 parts.push_back (at);
399
400 if (f.kw != KW_more)
401 break;
402
403 f.next ();
404
405 if (f.kw != KW_object)
406 {
407 f.parse_error ("more object");
408 goto fail;
259 } 409 }
260 } 410 }
261 return 0;
262}
263 411
264/* 412 loading_arch = false;
265 * Initialises the internal linked list of archetypes (read from file).
266 * Then the global "empty_archetype" pointer is initialised.
267 * Then the blocksview[] array is initialised.
268 */
269 413
270void init_archetypes(void) { /* called from add_player() and edit() */ 414 {
271 if(first_archetype!=NULL) /* Only do this once */ 415 auto (at, parts.begin ());
272 return;
273 arch_init = 1;
274 load_archetypes();
275 arch_init = 0;
276 empty_archetype=find_archetype("empty_archetype");
277/* init_blocksview();*/
278}
279 416
280/* 417 archetype *new_head = parts.front ();
281 * Stores debug-information about how efficient the hashtable 418 archetype *old_head = find (new_head->archname);
282 * used for archetypes has been in the static errmsg array.
283 */
284 419
285void arch_info(object *op) { 420 for (auto (at, parts.begin ()); at != parts.end (); ++at)
286 sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp); 421 fprintf (stderr, "%d: %s\n", at - parts.begin(), &(*at)->archname);//D
287 new_draw_info(NDI_BLACK, 0, op,errmsg);
288}
289 422
290/* 423 // check that all archetypes belong to the same old object or are new
291 * Initialise the hashtable used by the archetypes. 424 for (auto (at, parts.begin ()); at != parts.end (); ++at)
292 */ 425 {
426 archetype *new_part = *at;
427 archetype *old_part = find (new_part->archname);
293 428
294void clear_archetable(void) { 429 if (old_part && old_part->head_ () != old_head)
295 memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *)); 430 {
296} 431 fprintf (stderr, "nhn %s\n", &new_head->archname);//D
432 fprintf (stderr, "old_head %p,%p new_head %p,%p ph %p\n", old_head, old_part, new_head, new_part, old_part->head_());
433 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
434 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
435 goto fail;
436 }
437 }
297 438
298/* 439 fprintf (stderr, "oh %p %s\n", old_head, &new_head->archname);//D
299 * An alternative way to init the hashtable which is slower, but _works_...
300 */
301 440
302void init_archetable(void) { 441 // deactivate existing archetype
442 for (archetype *at = old_head; at; at = (archetype *)at->more)
443 at->unlink ();
444
445 // reassemble new chain
446 new_head->min_x = new_head->max_x = new_head->x;
447 new_head->min_y = new_head->max_y = new_head->y;
448
449 archetype *less = new_head;
303 archetype *at; 450 archetype *head = 0;
304 LOG(llevDebug," Setting up archetable...\n"); 451 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
305 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 452 {
306 add_arch(at); 453 archetype *at = *p;
307 LOG(llevDebug,"done\n");
308}
309 454
310/* 455 if (at->x < new_head->min_x) new_head->min_x = at->x;
311 * Dumps an archetype to debug-level output. 456 if (at->y < new_head->min_y) new_head->min_y = at->y;
312 */ 457 if (at->x > new_head->max_x) new_head->max_x = at->x;
458 if (at->y > new_head->max_y) new_head->max_y = at->y;
313 459
314void dump_arch(archetype *at) { 460 at->head = head; head = new_head;
315 dump_object(&at->clone); 461 less->more = at; less = at;
316} 462 }
317 463
318/* 464 // now activate it
319 * Dumps _all_ archetypes to debug-level output. 465 for (auto (p, parts.begin ()); p != parts.end (); ++p)
320 * If you run crossfire with debug, and enter DM-mode, you can trigger 466 {
321 * this with the O key. 467 archetype *at = *p;
322 */ 468 at->stub = false;
469 at->link ();
470 }
323 471
324void dump_all_archetypes(void) { 472 return new_head;
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 } 473 }
330}
331 474
332void free_all_archs(void) 475fail:
333{ 476 for (auto (p, parts.begin ()); p != parts.end (); ++p)
334 archetype *at, *next; 477 (*p)->destroy (true);
335 int i=0,f=0;
336 478
337 for (at=first_archetype; at!=NULL; at=next) { 479 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; 480 return 0;
361} 481}
362 482
363/* 483/*
364 * Reads/parses the archetype-file, and copies into a linked list 484 * Initialize global archtype pointers:
365 * of archetype-structures.
366 */ 485 */
367void first_arch_pass(object_thawer &fp) {
368 object *op;
369 archetype *at,*head=NULL,*last_more=NULL;
370 int i,first=2;
371
372 op=get_object();
373 op->arch=first_archetype=at=get_archetype_struct();
374
375 while((i=load_object(fp,op,first,0))) {
376 first=0;
377 copy_object(op,&at->clone);
378 at->clone.speed_left= (float) (-0.1);
379 /* copy the body_info to the body_used - this is only really
380 * need for monsters, but doesn't hurt to do it for everything.
381 * by doing so, when a monster is created, it has good starting
382 * values for the body_used info, so when items are created
383 * for it, they can be properly equipped.
384 */
385 memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));
386
387 switch(i) {
388 case LL_NORMAL: /* A new archetype, just link it with the previous */
389 if(last_more!=NULL)
390 last_more->next=at;
391 if(head!=NULL)
392 head->next=at;
393 head=last_more=at;
394#if 0
395 if(!op->type)
396 LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
397#endif
398 at->tail_x = 0;
399 at->tail_y = 0;
400 break;
401
402 case LL_MORE: /* Another part of the previous archetype, link it correctly */
403
404 at->head=head;
405 at->clone.head = &head->clone;
406 if(last_more!=NULL) {
407 last_more->more=at;
408 last_more->clone.more = &at->clone;
409 }
410 last_more=at;
411
412 /* If this multipart image is still composed of individual small
413 * images, don't set the tail_.. values. We can't use them anyways,
414 * and setting these to zero makes the map sending to the client much
415 * easier as just looking at the head, we know what to do.
416 */
417 if (at->clone.face != head->clone.face) {
418 head->tail_x = 0;
419 head->tail_y = 0;
420 } else {
421 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
422 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
423 }
424 break;
425
426 }
427
428 at=get_archetype_struct();
429 clear_object(op);
430 op->arch=at;
431 }
432
433 delete at;
434 free_object(op);
435}
436
437/*
438 * Reads the archetype file once more, and links all pointers between
439 * archetypes.
440 */
441
442void second_arch_pass(object_thawer &thawer) {
443 char buf[MAX_BUF],*variable=buf,*argument,*cp;
444 archetype *at=NULL,*other;
445
446 while(fgets(buf,MAX_BUF,thawer)!=NULL) {
447 if(*buf=='#')
448 continue;
449 if((argument=strchr(buf,' '))!=NULL) {
450 *argument='\0',argument++;
451 cp = argument + strlen(argument)-1;
452 while (isspace(*cp)) {
453 *cp='\0';
454 cp--;
455 }
456 }
457 if(!strcmp("Object",variable)) {
458 if((at=find_archetype(argument))==NULL)
459 LOG(llevError,"Warning: failed to find arch %s\n",argument);
460 } else if(!strcmp("other_arch",variable)) {
461 if(at!=NULL&&at->clone.other_arch==NULL) {
462 if((other=find_archetype(argument))==NULL)
463 LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
464 else if(at!=NULL)
465 at->clone.other_arch=other;
466 }
467 } else if(!strcmp("randomitems",variable)) {
468 if(at!=NULL) {
469 treasurelist *tl=find_treasurelist(argument);
470 if(tl==NULL)
471 LOG(llevError,"Failed to link treasure to arch (%s): %s\n", &at->name, argument);
472 else
473 at->clone.randomitems=tl;
474 }
475 }
476 }
477}
478
479#ifdef DEBUG
480void check_generators(void) {
481 archetype *at;
482 for(at=first_archetype;at!=NULL;at=at->next)
483 if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
484 LOG(llevError,"Warning: %s is generator but lacks other_arch.\n", &at->name);
485}
486#endif
487
488/*
489 * First initialises the archtype hash-table (init_archetable()).
490 * Reads and parses the archetype file (with the first and second-pass
491 * functions).
492 * Then initialises treasures by calling load_treasures().
493 */
494
495void 486void
496load_archetypes (void) 487init_archetype_pointers ()
497{ 488{
498 char filename[MAX_BUF]; 489 ring_arch = archetype::find ("ring");
499 int comp; 490 amulet_arch = archetype::find ("amulet");
500#if TIME_ARCH_LOAD 491 staff_arch = archetype::find ("staff");
501 struct timeval tv1, tv2; 492 crown_arch = archetype::find ("crown");
502#endif 493 empty_archetype = archetype::find ("empty_archetype");
503
504 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
505 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
506
507 {
508 object_thawer thawer (filename);
509
510 clear_archetable ();
511 LOG (llevDebug, " arch-pass 1...\n");
512 first_arch_pass (thawer);
513 LOG (llevDebug, " done\n");
514
515 init_archetable ();
516 warn_archetypes = 1;
517 }
518
519 {
520 object_thawer thawer (filename);
521
522 LOG (llevDebug, " loading treasure...\n");
523 load_treasures ();
524 LOG (llevDebug, " done\n arch-pass 2...\n");
525 second_arch_pass (thawer);
526 LOG (llevDebug, " done\n");
527#ifdef DEBUG
528 check_generators ();
529#endif
530 }
531 LOG (llevDebug, " done\n");
532} 494}
533 495
534/* 496/*
535 * Creates and returns a new object which is a copy of the given archetype. 497 * Creates and returns a new object which is a copy of the given archetype.
536 * This function returns NULL on failure. 498 * This function returns NULL on failure.
537 */ 499 */
538 500object *
539object *arch_to_object(archetype *at) { 501arch_to_object (archetype *at)
540 object *op; 502{
541 if(at==NULL) { 503 if (!at)
542 if(warn_archetypes) 504 {
543 LOG(llevError,"Couldn't find archetype.\n"); 505 LOG (llevError, "Couldn't find archetype.\n");
544 return NULL; 506 return 0;
545 } 507 }
546 op=get_object(); 508
547 copy_object(&at->clone,op); 509 object *op = at->clone ();
510 op->arch = at;
548 op->instantiate (); 511 op->instantiate ();
549 op->arch=at; 512
550 return op; 513 return op;
551} 514}
552 515
553/* 516/*
554 * Creates an object. This function is called by get_archetype() 517 * Creates an object. This function is called by get_archetype()
555 * if it fails to find the appropriate archetype. 518 * if it fails to find the appropriate archetype.
556 * Thus get_archetype() will be guaranteed to always return 519 * Thus get_archetype() will be guaranteed to always return
557 * an object, and never NULL. 520 * an object, and never NULL.
558 */ 521 */
559 522object *
560object *create_singularity(const char *name) { 523create_singularity (const char *name)
524{
561 object *op; 525 object *op;
562 char buf[MAX_BUF]; 526 char buf[MAX_BUF];
527
563 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 528 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
564 op = get_object(); 529 op = object::create ();
565 op->name = op->name_pl = buf; 530 op->name = op->name_pl = buf;
566 SET_FLAG(op,FLAG_NO_PICK); 531 SET_FLAG (op, FLAG_NO_PICK);
567 return op; 532 return op;
568} 533}
569 534
570/* 535/*
571 * Finds which archetype matches the given name, and returns a new 536 * Finds which archetype matches the given name, and returns a new
572 * object containing a copy of the archetype. 537 * object containing a copy of the archetype.
573 */ 538 */
574 539object *
575object *get_archetype(const char *name) { 540get_archetype (const char *name)
576 archetype *at; 541{
577 at = find_archetype(name); 542 archetype *at = archetype::find (name);
578 if (at == NULL) 543
544 if (!at)
579 return create_singularity(name); 545 return create_singularity (name);
546
580 return arch_to_object(at); 547 return arch_to_object (at);
581}
582
583/*
584 * Hash-function used by the arch-hashtable.
585 */
586
587unsigned long
588hasharch(const char *str, int tablesize)
589{
590 unsigned long hash = 0;
591 unsigned int i = 0;
592 const char *p;
593
594 /* use the one-at-a-time hash function, which supposedly is
595 * better than the djb2-like one used by perl5.005, but
596 * certainly is better then the bug used here before.
597 * see http://burtleburtle.net/bob/hash/doobs.html
598 */
599 for (p = str; i < MAXSTRING && *p; p++, i++)
600 {
601 hash += *p;
602 hash += hash << 10;
603 hash ^= hash >> 6;
604 }
605
606 hash += hash << 3;
607 hash ^= hash >> 11;
608 hash += hash << 15;
609
610 return hash % tablesize;
611}
612
613/*
614 * Finds, using the hashtable, which archetype matches the given name.
615 * returns a pointer to the found archetype, otherwise NULL.
616 */
617
618archetype *find_archetype(const char *name) {
619 archetype *at;
620 unsigned long index;
621
622 if (name == NULL)
623 return (archetype *) NULL;
624
625 index=hasharch(name, ARCHTABLE);
626 arch_search++;
627 for(;;) {
628 at = arch_table[index];
629 if (at==NULL) {
630 if(warn_archetypes)
631 LOG(llevError,"Couldn't find archetype %s\n",name);
632 return NULL;
633 }
634 arch_cmp++;
635 if (!strcmp((const char *)at->name,name))
636 return at;
637 if(++index>=ARCHTABLE)
638 index=0;
639 }
640}
641
642/*
643 * Adds an archetype to the hashtable.
644 */
645
646static void add_arch(archetype *at) {
647 int index=hasharch((const char *)at->name, ARCHTABLE),org_index=index;
648 for(;;) {
649 if(arch_table[index]==NULL) {
650 arch_table[index]=at;
651 return;
652 }
653 if(++index==ARCHTABLE)
654 index=0;
655 if(index==org_index)
656 fatal(ARCHTABLE_TOO_SMALL);
657 }
658} 548}
659 549
660/* 550/*
661 * Returns the first archetype using the given type. 551 * Returns the first archetype using the given type.
662 * Used in treasure-generation. 552 * Used in treasure-generation.
663 */ 553 */
664
665archetype *type_to_archetype(int type) {
666 archetype *at; 554archetype *
667 555type_to_archetype (int type)
668 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 556{
669 if(at->clone.type==type) 557 for_all_archetypes (at)
558 if (at->type == type && at->head_ () != at)
670 return at; 559 return at;
560
671 return NULL; 561 return 0;
672} 562}
673 563
674/* 564/*
675 * Returns a new object copied from the first archetype matching 565 * Returns a new object copied from the first archetype matching
676 * the given type. 566 * the given type.
677 * Used in treasure-generation. 567 * Used in treasure-generation.
678 */ 568 */
679 569object *
680object *clone_arch(int type) { 570clone_arch (int type)
571{
681 archetype *at; 572 archetype *at;
682 object *op=get_object();
683 573
684 if((at=type_to_archetype(type))==NULL) { 574 if ((at = type_to_archetype (type)) == NULL)
575 {
685 LOG(llevError,"Can't clone archetype %d\n",type); 576 LOG (llevError, "Can't clone archetype %d\n", type);
686 free_object(op);
687 return NULL; 577 return 0;
688 } 578 }
689 copy_object(&at->clone,op); 579
580 object *op = at->clone ();
690 op->instantiate (); 581 op->instantiate ();
691 return op; 582 return op;
692} 583}
693 584
694/* 585/*
695 * member: make instance from class 586 * member: make instance from class
696 */ 587 */
697 588object *
698object *object_create_arch (archetype * at) 589object_create_arch (archetype *at)
699{ 590{
700 object *op, *prev = NULL, *head = NULL; 591 object *op, *prev = 0, *head = 0;
701 592
702 while (at) { 593 while (at)
594 {
703 op = arch_to_object (at); 595 op = arch_to_object (at);
596
704 op->x = at->clone.x; 597 op->x = at->x;
705 op->y = at->clone.y; 598 op->y = at->y;
599
706 if (head) 600 if (head)
707 op->head = head, prev->more = op; 601 op->head = head, prev->more = op;
602
708 if (!head) 603 if (!head)
709 head = op; 604 head = op;
605
710 prev = op; 606 prev = op;
711 at = at->more; 607 at = (archetype *)at->more;
712 } 608 }
609
713 return (head); 610 return head;
714} 611}
715 612
716/*** end of arch.c ***/

Diff Legend

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