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.17 by root, Tue Sep 12 19:20:06 2006 UTC vs.
Revision 1.109 by root, Sat Dec 31 06:18:00 2011 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2002 Mark Wedel & Crossfire Development Team
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23 24
24#include <cassert> 25#include <cassert>
25 26
27#include <global.h>
28
29#include <tr1/functional>
26#include <tr1/unordered_map> 30#include <tr1/unordered_map>
27 31
28#include <global.h> 32archetype *loading_arch; // ugly flag to object loader etc. to suppress/request special processing
29#include <arch.h> 33arch_ptr archetype::empty;
30#include <funcpoint.h>
31#include <loader.h>
32 34
33/* IF set, does a little timing on the archetype load. */
34#define TIME_ARCH_LOAD 0
35
36static void add_arch (archetype *at);
37
38static archetype *arch_table[ARCHTABLE];
39int arch_cmp = 0; /* How many strcmp's */
40int arch_search = 0; /* How many searches */
41int arch_init; /* True if doing arch initialization */
42
43/* The naming of these functions is really poor - they are all
44 * pretty much named '.._arch_...', but they may more may not
45 * return archetypes. Some make the arch_to_object call, and thus
46 * return an object. Perhaps those should be called 'archob' functions
47 * to denote they return an object derived from the archetype.
48 * MSW 2003-04-29
49 */
50
51#if USE_UNORDERED_MAP
52// the hashtable 35// the hashtable
53typedef
54 std::tr1::unordered_map < 36typedef std::tr1::unordered_map
55size_t, archetype *> 37 <
38 const char *,
39 arch_ptr,
40 str_hash,
41 str_equal,
42 slice_allocator< std::pair<const char *const, arch_ptr> >
56 HT; 43 > HT;
57 44
58static 45static HT ht (10000);
59 HT 46archvec archetypes;
60 ht; 47static unordered_vector<archetype *> allarch;
61#endif 48static int dirtycnt;
49
50// the vector of other_arch references to be resolved
51static std::vector< std::pair<arch_ptr *, shstr> > postponed_arch_ref;
52// the vector of loaded but not yet committed archetypes
53static std::vector<archetype *> postponed_arch;
54
55//+GPL
56
57/*
58 * Creates an object. This function is called by archetype::get ()
59 * if it fails to find the appropriate archetype.
60 * Thus archetype::get() will be guaranteed to always return
61 * an object, and never NULL.
62 */
63static object *
64create_singularity (const char *name)
65{
66 LOG (llevError | logBacktrace, "FATAL: creating singularity for '%s'.\n", name);
67
68 if (!strcmp (name, "bug"))
69 abort ();
70
71 object *op = archetype::get (shstr_bug);
72 op->name = op->name_pl = format ("bug, please report (missing archetype %s)", name);
73
74 return op;
75}
62 76
63/** 77/**
64 * GROS - This function retrieves an archetype given the name that appears 78 * GROS - This function retrieves an archetype given the name that appears
65 * during the game (for example, "writing pen" instead of "stylus"). 79 * during the game (for example, "writing pen" instead of "stylus").
66 * It does not use the hashtable system, but browse the whole archlist each time. 80 * It does not use the hashtable system, but browse the whole archlist each time.
72 * - the archetype found or null if nothing was found. 86 * - the archetype found or null if nothing was found.
73 */ 87 */
74archetype * 88archetype *
75find_archetype_by_object_name (const char *name) 89find_archetype_by_object_name (const char *name)
76{ 90{
77 archetype * 91 shstr_cmp name_cmp (name);
78 at;
79 92
80 if (name == NULL) 93 for_all_archetypes (at)
81 return (archetype *) NULL; 94 if (at->name == name_cmp)
82
83 for (at = first_archetype; at != NULL; at = at->next)
84 {
85 if (!strcmp (at->clone.name, name))
86 return at; 95 return at;
87 } 96
88 return NULL; 97 return 0;
89} 98}
90 99
91/** 100/**
92 * This function retrieves an archetype by type and name that appears during 101 * This function retrieves an archetype by type and name that appears during
93 * the game. It is basically the same as find_archetype_by_object_name() 102 * the game. It is basically the same as find_archetype_by_object_name()
94 * except that it considers only items of the given type. 103 * except that it considers only items of the given type.
95 */ 104 */
96archetype * 105archetype *
97find_archetype_by_object_type_name (int type, const char *name) 106find_archetype_by_object_type_name (int type, const char *name)
98{ 107{
99 archetype * 108 shstr_cmp name_cmp (name);
100 at;
101 109
102 if (name == NULL) 110 for_all_archetypes (at)
103 return NULL; 111 if (at->name == name_cmp && at->type == type)
104
105 for (at = first_archetype; at != NULL; at = at->next)
106 {
107 if (at->clone.type == type && strcmp (at->clone.name, name) == 0)
108 return at; 112 return at;
109 }
110 113
111 return NULL; 114 return 0;
112} 115}
113 116
114/* This is a lot like the above function. Instead, we are trying to match 117/* This is a lot like the above function. Instead, we are trying to match
115 * the arch->skill values. type is the type of object to match 118 * the arch->skill values. type is the type of object to match
116 * against (eg, to only match against skills or only skill objects for example). 119 * against (eg, to only match against skills or only skill objects for example).
117 * If type is -1, ew don't match on type. 120 * If type is -1, ew don't match on type.
118 */ 121 */
119object * 122object *
120get_archetype_by_skill_name (const char *skill, int type) 123get_archetype_by_skill_name (const char *skill, int type)
121{ 124{
122 archetype * 125 shstr_cmp skill_cmp (skill);
123 at;
124 126
125 if (skill == NULL) 127 for_all_archetypes (at)
126 return NULL; 128 if (at->skill == skill_cmp && (type == -1 || type == at->type))
129 return at->instance ();
127 130
128 for (at = first_archetype; at != NULL; at = at->next)
129 {
130 if (((type == -1) || (type == at->clone.type)) && (!strcmp (at->clone.skill, skill)))
131 return arch_to_object (at);
132 }
133 return NULL; 131 return 0;
134} 132}
135 133
136/* similiar to above - this returns the first archetype 134/* similiar to above - this returns the first archetype
137 * that matches both the type and subtype. type and subtype 135 * that matches both the type and subtype. type and subtype
138 * can be -1 to say ignore, but in this case, the match it does 136 * can be -1 to say ignore, but in this case, the match it does
141 * (eg, skills) 139 * (eg, skills)
142 */ 140 */
143archetype * 141archetype *
144get_archetype_by_type_subtype (int type, int subtype) 142get_archetype_by_type_subtype (int type, int subtype)
145{ 143{
146 archetype * 144 for_all_archetypes (at)
147 at;
148
149 for (at = first_archetype; at != NULL; at = at->next)
150 {
151 if (((type == -1) || (type == at->clone.type)) && (subtype == -1 || subtype == at->clone.subtype)) 145 if ((type == -1 || type == at->type) && (subtype == -1 || subtype == at->subtype))
152 return at; 146 return at;
153 } 147
154 return NULL; 148 return 0;
155} 149}
156 150
157/** 151/**
158 * GROS - this returns a new object given the name that appears during the game 152 * GROS - this returns a new object given the name that appears during the game
159 * (for example, "writing pen" instead of "stylus"). 153 * (for example, "writing pen" instead of "stylus").
161 * - name: The name we're searching for (ex: "writing pen"); 155 * - name: The name we're searching for (ex: "writing pen");
162 * Return value: 156 * Return value:
163 * - a corresponding object if found; a singularity object if not found. 157 * - a corresponding object if found; a singularity object if not found.
164 * Note by MSW - it appears that it takes the full name and keeps 158 * Note by MSW - it appears that it takes the full name and keeps
165 * shortening it until it finds a match. I re-wrote this so that it 159 * shortening it until it finds a match. I re-wrote this so that it
166 * doesn't malloc it each time - not that this function is used much, 160 * doesn't allocate it each time - not that this function is used much,
167 * but it otherwise had a big memory leak. 161 * but it otherwise had a big memory leak.
168 */ 162 */
169object * 163object *
170get_archetype_by_object_name (const char *name) 164get_archetype_by_object_name (const char *name)
171{ 165{
172 archetype *at;
173 char tmpname[MAX_BUF]; 166 char tmpname[MAX_BUF];
174 int i;
175 167
176 assign (tmpname, name); 168 assign (tmpname, name);
177 169
178 for (i = strlen (tmpname); i > 0; i--) 170 for (int i = strlen (tmpname); i > 0; i--)
179 { 171 {
180 tmpname[i] = 0; 172 tmpname[i] = 0;
173
181 at = find_archetype_by_object_name (tmpname); 174 if (archetype *at = find_archetype_by_object_name (tmpname))
182 175 return at->instance ();
183 if (at != NULL)
184 {
185 return arch_to_object (at);
186 }
187 } 176 }
188 177
189 return create_singularity (name); 178 return create_singularity (name);
190} 179}
191 180
192 /* This is a subset of the parse_id command. Basically, name can be 181/* This is a subset of the parse_id command. Basically, name can be
193 * a string seperated lists of things to match, with certain keywords. 182 * a string seperated lists of things to match, with certain keywords.
194 * pl is the player (only needed to set count properly) 183 * pl is the player (only needed to set count properly)
195 * op is the item we are trying to match. Calling function takes care 184 * op is the item we are trying to match. Calling function takes care
196 * of what action might need to be done and if it is valid 185 * of what action might need to be done and if it is valid
197 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher 186 * (pickup, drop, etc.) Return NONZERO if we have a match. A higher
198 * value means a better match. 0 means no match. 187 * value means a better match. 0 means no match.
199 * 188 *
200 * Brief outline of the procedure: 189 * Brief outline of the procedure:
201 * We take apart the name variable into the individual components. 190 * We take apart the name variable into the individual components.
202 * cases for 'all' and unpaid are pretty obvious. 191 * cases for 'all' and unpaid are pretty obvious.
203 * Next, we check for a count (either specified in name, or in the 192 * Next, we check for a count (either specified in name, or in the
204 * player object.) 193 * player object.)
205 * If count is 1, make a quick check on the name. 194 * If count is 1, make a quick check on the name.
206 * IF count is >1, we need to make plural name. Return if match. 195 * IF count is >1, we need to make plural name. Return if match.
207 * Last, make a check on the full name. 196 * Last, make a check on the full name.
208 */ 197 */
209int 198int
210item_matched_string (object *pl, object *op, const char *name) 199item_matched_string (object *pl, object *op, const char *name)
211{ 200{
212 char *
213 cp,
214 local_name[MAX_BUF]; 201 char *cp, local_name[MAX_BUF];
215 int 202 int count, retval = 0;
216 count,
217 retval = 0;
218 203
219 strcpy (local_name, name); /* strtok is destructive to name */ 204 assign (local_name, name); /* strtok is destructive to name */
220 205
221 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ",")) 206 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
222 { 207 {
223 while (cp[0] == ' ') 208 while (cp[0] == ' ')
224 ++cp; /* get rid of spaces */ 209 ++cp; /* get rid of spaces */
227 /* All is a very generic match - low match value */ 212 /* All is a very generic match - low match value */
228 if (!strcmp (cp, "all")) 213 if (!strcmp (cp, "all"))
229 return 1; 214 return 1;
230 215
231 /* unpaid is a little more specific */ 216 /* unpaid is a little more specific */
232 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID)) 217 if (!strcmp (cp, "unpaid") && op->flag [FLAG_UNPAID])
233 return 2; 218 return 2;
234 if (!strcmp (cp, "cursed") && QUERY_FLAG (op, FLAG_KNOWN_CURSED) && (QUERY_FLAG (op, FLAG_CURSED) || QUERY_FLAG (op, FLAG_DAMNED))) 219
220 if (!strcmp (cp, "cursed") && op->flag [FLAG_KNOWN_CURSED] && (op->flag [FLAG_CURSED] || op->flag [FLAG_DAMNED]))
235 return 2; 221 return 2;
236 222
237 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED)) 223 if (!strcmp (cp, "unlocked") && !op->flag [FLAG_INV_LOCKED])
238 return 2; 224 return 2;
239 225
240 /* Allow for things like '100 arrows' */ 226 /* Allow for things like '100 arrows' */
241 if ((count = atoi (cp)) != 0) 227 if ((count = atoi (cp)) != 0)
242 { 228 {
260 * is because of the 'else' handling - we don't want to match on 246 * is because of the 'else' handling - we don't want to match on
261 * something and set a low retval, even though it may match a higher retcal 247 * something and set a low retval, even though it may match a higher retcal
262 * later. So keep it in descending order here, so we try for the best 248 * later. So keep it in descending order here, so we try for the best
263 * match first, and work downward. 249 * match first, and work downward.
264 */ 250 */
251 const char *qbn0, *qbn1, *qsn; // query base name/short name caches
252
265 if (!strcasecmp (cp, query_name (op))) 253 if (!strcasecmp (cp, query_name (op)))
266 retval = 20; 254 retval = 20;
267 else if (!strcasecmp (cp, query_short_name (op))) 255 else if (!strcasecmp (cp, qsn = query_short_name (op)))
268 retval = 18; 256 retval = 18;
269 else if (!strcasecmp (cp, query_base_name (op, 0))) 257 else if (!strcasecmp (cp, qbn0 = query_base_name (op, 0)))
270 retval = 16; 258 retval = 16;
271 else if (!strcasecmp (cp, query_base_name (op, 1))) 259 else if (!strcasecmp (cp, qbn1 = query_base_name (op, 1)))
272 retval = 16; 260 retval = 16;
273 else if (op->custom_name && !strcasecmp (cp, op->custom_name)) 261 else if (op->custom_name && !strcasecmp (cp, op->custom_name))
274 retval = 15; 262 retval = 15;
275 else if (!strncasecmp (cp, query_base_name (op, 0), strlen (cp))) 263 else if (!strncasecmp (cp, qbn0, strlen (cp)))
276 retval = 14; 264 retval = 14;
277 else if (!strncasecmp (cp, query_base_name (op, 1), strlen (cp))) 265 else if (!strncasecmp (cp, qbn1, strlen (cp)))
278 retval = 14; 266 retval = 14;
279
280 /* Do substring checks, so things like 'Str+1' will match. 267 /* Do substring checks, so things like 'Str+1' will match.
281 * retval of these should perhaps be lower - they are lower 268 * retval of these should perhaps be lower - they are lower
282 * then the specific strcasecmp aboves, but still higher than 269 * then the specific strcasecmp aboves, but still higher than
283 * some other match criteria. 270 * some other match criteria.
284 */ 271 */
285 else if (strstr (query_base_name (op, 1), cp)) 272 else if (strstr (qbn1, cp))
286 retval = 12; 273 retval = 12;
287 else if (strstr (query_base_name (op, 0), cp)) 274 else if (strstr (qbn0, cp))
288 retval = 12; 275 retval = 12;
289 else if (strstr (query_short_name (op), cp)) 276 else if (strstr (qsn, cp))
290 retval = 12; 277 retval = 12;
291
292 /* Check against plural/non plural based on count. */ 278 /* Check against plural/non plural based on count. */
293 else if (count > 1 && !strcasecmp (cp, op->name_pl)) 279 else if (count > 1 && !strcasecmp (cp, op->name_pl))
294 {
295 retval = 6; 280 retval = 6;
296 }
297 else if (count == 1 && !strcasecmp (op->name, cp)) 281 else if (count == 1 && !strcasecmp (op->name, cp))
298 {
299 retval = 6; 282 retval = 6;
300 }
301 /* base name matched - not bad */ 283 /* base name matched - not bad */
302 else if (strcasecmp (cp, op->name) == 0 && !count) 284 else if (strcasecmp (cp, op->name) == 0 && !count)
303 retval = 4; 285 retval = 4;
304 /* Check for partial custom name, but give a real low priority */ 286 /* Check for partial custom name, but give a real low priority */
305 else if (op->custom_name && strstr (op->custom_name, cp)) 287 else if (op->custom_name.contains (cp))
306 retval = 3; 288 retval = 3;
307 289
308 if (retval) 290 if (retval)
309 { 291 {
310 if (pl->type == PLAYER) 292 if (pl->type == PLAYER)
311 pl->contr->count = count; 293 pl->contr->count = count;
294
312 return retval; 295 return retval;
313 } 296 }
314 } 297 }
298
315 return 0; 299 return 0;
316} 300}
317 301
318/* 302//-GPL
319 * Initialises the internal linked list of archetypes (read from file).
320 * Then the global "empty_archetype" pointer is initialised.
321 * Then the blocksview[] array is initialised.
322 */
323 303
324void 304void
325init_archetypes (void) 305archetype::do_delete ()
326{ /* called from add_player() and edit() */ 306{
327 if (first_archetype != NULL) /* Only do this once */ 307 delete this;
328 return;
329 arch_init = 1;
330 load_archetypes ();
331 arch_init = 0;
332 empty_archetype = find_archetype ("empty_archetype");
333
334/* init_blocksview();*/
335} 308}
336 309
337/* 310archetype::archetype (const char *name)
338 * Stores debug-information about how efficient the hashtable 311{
339 * used for archetypes has been in the static errmsg array. 312 arch = this;
340 */ 313 this->archname = this->name = this->name_pl = name;
314}
315
316archetype::~archetype ()
317{
318 unlink ();
319}
341 320
342void 321void
343arch_info (object *op) 322archetype::link ()
344{ 323{
345 sprintf (errmsg, "%d searches and %d strcmp()'s", arch_search, arch_cmp); 324 if (!archetypes.contains (this))
346 new_draw_info (NDI_BLACK, 0, op, errmsg); 325 {
326 archetypes.insert (this);
327 ht.insert (std::make_pair (archname, this));
328 }
347} 329}
348
349/*
350 * Initialise the hashtable used by the archetypes.
351 */
352 330
353void 331void
354clear_archetable (void) 332archetype::unlink ()
355{ 333{
356 memset ((void *) arch_table, 0, ARCHTABLE * sizeof (archetype *)); 334 if (archetypes.contains (this))
357}
358
359/*
360 * An alternative way to init the hashtable which is slower, but _works_...
361 */
362
363void
364init_archetable (void)
365{
366 archetype *
367 at;
368
369 LOG (llevDebug, " Setting up archetable...\n");
370
371 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
372 add_arch (at);
373
374 LOG (llevDebug, "done\n");
375}
376
377/*
378 * Dumps an archetype to debug-level output.
379 */
380
381void
382dump_arch (archetype *at)
383{
384 dump_object (&at->clone);
385}
386
387/*
388 * Dumps _all_ archetypes to debug-level output.
389 * If you run crossfire with debug, and enter DM-mode, you can trigger
390 * this with the O key.
391 */
392
393void
394dump_all_archetypes (void)
395{
396 archetype *
397 at;
398
399 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
400 {
401 dump_arch (at);
402 fprintf (logfile, "%s\n", errmsg);
403 } 335 {
404} 336 archetypes.erase (this);
405 337 ht.erase (archname);
406void
407free_all_archs (void)
408{
409 archetype *
410 at, *
411 next;
412 int
413 i = 0, f = 0;
414
415 for (at = first_archetype; at != NULL; at = next)
416 { 338 }
417 if (at->more)
418 next = at->more;
419 else
420 next = at->next;
421
422 delete
423 at;
424
425 i++;
426 }
427 LOG (llevDebug, "Freed %d archetypes, %d faces\n", i, f);
428}
429
430archetype::archetype ()
431{
432 clear_object (&clone); /* to initial state other also */
433 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_object() */
434 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
435}
436
437archetype::~archetype ()
438{
439}
440
441/*
442 * Reads/parses the archetype-file, and copies into a linked list
443 * of archetype-structures.
444 */
445void
446first_arch_pass (object_thawer & fp)
447{
448 archetype *
449 at, *
450 head = NULL, *last_more = NULL;
451
452 at->clone.arch = first_archetype = at = new archetype;
453
454 while (int i = load_object (fp, &at->clone, 0))
455 {
456 at->clone.speed_left = (float) (-0.1);
457 /* copy the body_info to the body_used - this is only really
458 * need for monsters, but doesn't hurt to do it for everything.
459 * by doing so, when a monster is created, it has good starting
460 * values for the body_used info, so when items are created
461 * for it, they can be properly equipped.
462 */
463 memcpy (&at->clone.body_used, &at->clone.body_info, sizeof (at->clone.body_info));
464
465 switch (i)
466 {
467 case LL_NORMAL: /* A new archetype, just link it with the previous */
468 if (last_more != NULL)
469 last_more->next = at;
470 if (head != NULL)
471 head->next = at;
472 head = last_more = at;
473#if 0
474 if (!op->type)
475 LOG (llevDebug, " WARNING: Archetype %s has no type info!\n", op->arch->name);
476#endif
477 at->tail_x = 0;
478 at->tail_y = 0;
479 break;
480
481 case LL_MORE: /* Another part of the previous archetype, link it correctly */
482
483 at->head = head;
484 at->clone.head = &head->clone;
485 if (last_more != NULL)
486 {
487 last_more->more = at;
488 last_more->clone.more = &at->clone;
489 }
490 last_more = at;
491
492 /* If this multipart image is still composed of individual small
493 * images, don't set the tail_.. values. We can't use them anyways,
494 * and setting these to zero makes the map sending to the client much
495 * easier as just looking at the head, we know what to do.
496 */
497 if (at->clone.face != head->clone.face)
498 {
499 head->tail_x = 0;
500 head->tail_y = 0;
501 }
502 else
503 {
504 if (at->clone.x > head->tail_x)
505 head->tail_x = at->clone.x;
506 if (at->clone.y > head->tail_y)
507 head->tail_y = at->clone.y;
508 }
509 break;
510
511 }
512
513 at = new archetype;
514
515 at->clone.arch = at;
516 }
517
518 delete at;
519}
520
521/*
522 * Reads the archetype file once more, and links all pointers between
523 * archetypes.
524 */
525
526void
527second_arch_pass (object_thawer & thawer)
528{
529 char
530 buf[MAX_BUF], *
531 variable = buf, *argument, *cp;
532 archetype *
533 at = NULL, *other;
534
535 while (fgets (buf, MAX_BUF, thawer) != NULL)
536 {
537 if (*buf == '#')
538 continue;
539 if ((argument = strchr (buf, ' ')) != NULL)
540 {
541 *argument = '\0', argument++;
542 cp = argument + strlen (argument) - 1;
543 while (isspace (*cp))
544 {
545 *cp = '\0';
546 cp--;
547 }
548 }
549 if (!strcmp ("Object", variable))
550 {
551 if ((at = find_archetype (argument)) == NULL)
552 LOG (llevError, "Warning: failed to find arch %s\n", argument);
553 }
554 else if (!strcmp ("other_arch", variable))
555 {
556 if (at != NULL && at->clone.other_arch == NULL)
557 {
558 if ((other = find_archetype (argument)) == NULL)
559 LOG (llevError, "Warning: failed to find other_arch %s\n", argument);
560 else if (at != NULL)
561 at->clone.other_arch = other;
562 }
563 }
564 else if (!strcmp ("randomitems", variable))
565 {
566 if (at != NULL)
567 {
568 treasurelist *
569 tl = find_treasurelist (argument);
570
571 if (tl == NULL)
572 LOG (llevError, "Failed to link treasure to arch (%s): %s\n", &at->name, argument);
573 else
574 at->clone.randomitems = tl;
575 }
576 }
577 }
578}
579
580#ifdef DEBUG
581void
582check_generators (void)
583{
584 archetype *
585 at;
586
587 for (at = first_archetype; at != NULL; at = at->next)
588 if (QUERY_FLAG (&at->clone, FLAG_GENERATOR) && at->clone.other_arch == NULL)
589 LOG (llevError, "Warning: %s is generator but lacks other_arch.\n", &at->name);
590}
591#endif
592
593/*
594 * First initialises the archtype hash-table (init_archetable()).
595 * Reads and parses the archetype file (with the first and second-pass
596 * functions).
597 * Then initialises treasures by calling load_treasures().
598 */
599
600void
601load_archetypes (void)
602{
603 char
604 filename[MAX_BUF];
605
606#if TIME_ARCH_LOAD
607 struct timeval
608 tv1,
609 tv2;
610#endif
611
612 sprintf (filename, "%s/%s", settings.datadir, settings.archetypes);
613 LOG (llevDebug, "Reading archetypes from %s:\n", filename);
614
615 {
616 object_thawer
617 thawer (filename);
618
619 clear_archetable ();
620 LOG (llevDebug, " arch-pass 1...\n");
621 first_arch_pass (thawer);
622 LOG (llevDebug, " done\n");
623 }
624
625 init_archetable ();
626 warn_archetypes = 1;
627
628 {
629 object_thawer
630 thawer (filename);
631
632 LOG (llevDebug, " loading treasure...\n");
633 load_treasures ();
634 LOG (llevDebug, " done\n arch-pass 2...\n");
635 second_arch_pass (thawer);
636 LOG (llevDebug, " done\n");
637#ifdef DEBUG
638 check_generators ();
639#endif
640 }
641 LOG (llevDebug, " done\n");
642}
643
644/*
645 * Creates and returns a new object which is a copy of the given archetype.
646 * This function returns NULL on failure.
647 */
648
649object *
650arch_to_object (archetype *at)
651{
652 object *
653 op;
654
655 if (at == NULL)
656 {
657 if (warn_archetypes)
658 LOG (llevError, "Couldn't find archetype.\n");
659
660 return NULL;
661 }
662
663 op = get_object ();
664 copy_object (&at->clone, op);
665 op->arch = at;
666 op->instantiate ();
667 return op;
668}
669
670/*
671 * Creates an object. This function is called by get_archetype()
672 * if it fails to find the appropriate archetype.
673 * Thus get_archetype() will be guaranteed to always return
674 * an object, and never NULL.
675 */
676
677object *
678create_singularity (const char *name)
679{
680 object *
681 op;
682 char
683 buf[MAX_BUF];
684
685 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
686 op = get_object ();
687 op->name = op->name_pl = buf;
688 SET_FLAG (op, FLAG_NO_PICK);
689 return op;
690}
691
692/*
693 * Finds which archetype matches the given name, and returns a new
694 * object containing a copy of the archetype.
695 */
696
697object *
698get_archetype (const char *name)
699{
700 archetype *
701 at;
702
703 at = find_archetype (name);
704 if (at == NULL)
705 return create_singularity (name);
706
707 return arch_to_object (at);
708}
709
710/*
711 * Hash-function used by the arch-hashtable.
712 */
713
714unsigned long
715hasharch (const char *str, int tablesize)
716{
717 unsigned long
718 hash = 0;
719 unsigned int
720 i = 0;
721 const char *
722 p;
723
724 /* use the one-at-a-time hash function, which supposedly is
725 * better than the djb2-like one used by perl5.005, but
726 * certainly is better then the bug used here before.
727 * see http://burtleburtle.net/bob/hash/doobs.html
728 */
729 for (p = str; i < MAXSTRING && *p; p++, i++)
730 {
731 hash += *p;
732 hash += hash << 10;
733 hash ^= hash >> 6;
734 }
735
736 hash += hash << 3;
737 hash ^= hash >> 11;
738 hash += hash << 15;
739
740 return hash % tablesize;
741} 339}
742 340
743/* 341/*
744 * Finds, using the hashtable, which archetype matches the given name. 342 * Finds, using the hashtable, which archetype matches the given name.
745 * returns a pointer to the found archetype, otherwise NULL. 343 * returns a pointer to the found archetype, otherwise NULL.
746 */ 344 */
747
748archetype * 345archetype *
749find_archetype (const char *name) 346archetype::find (const char *name)
750{ 347{
751#if USE_UNORDERED_MAP
752 name = shstr::find (name);
753
754 if (!name) 348 if (!name)
755 return 0; 349 return 0;
756 350
757 HT::const_iterator i = ht.find ((size_t) name); 351 auto (i, ht.find (name));
758 352
759 if (i == ht.end ()) 353 if (i == ht.end ())
760 return 0; 354 return 0;
761 else 355 else
762 return i->second; 356 return i->second;
357}
358
359void
360archetype::post_load_check ()
361{
362 assert (("obj_original MUST NOT be set for archetypes", !flag [FLAG_OBJ_ORIGINAL]));
363
364 if (type == SKILL)
365 add_skill_archetype (this);
366
367 object::post_load_check ();
368}
369
370archetype *
371archetype::read (object_thawer &f)
372{
373 assert (f.kw == KW_object);
374
375 std::vector<archetype *> parts;
376
377 coroapi::cede_to_tick ();
378
379 for (;;)
380 {
381 archetype *at = new archetype (f.get_str ());
382
383 f.next ();
384
385#if 0
386 // implementing it here in the server does neither allow multiple inheritence
387 // nor does it cleanly "just override". it would allow use in map files, though,
388 // and other resource files dynamically loaded (as opposed to being preprocessed).
389 // not that any of this is relevant as of yet...
390 if (f.kw == KW_inherit)
391 {
392 if (archetype *at = find (f.get_str ()))
393 *op = at->clone;
394 else
395 LOG (llevError, "archetype '%s' tries to inherit from non-existent archetype '%s'.\n",
396 &at->archname, f.get_str ());
397
398 f.next ();
399 }
763#endif 400#endif
764 401
765 archetype * 402 loading_arch = at; // hack to tell parse_kv et al. to behave
766 at; 403 bool parse_ok = at->parse_kv (f);
767 unsigned long 404 loading_arch = 0;
768 index;
769 405
770 if (name == NULL) 406 if (!parse_ok)
771 return (archetype *) NULL; 407 goto fail;
772 408
773 index = hasharch (name, ARCHTABLE); 409 loading_arch = at; // hack to tell parse_kv et al. to behave
774 arch_search++; 410 at->post_load_check ();
775 for (;;) 411 loading_arch = 0;
776 { 412
777 at = arch_table[index]; 413 parts.push_back (at);
778 if (at == NULL) 414
415 if (f.kw != KW_more)
416 break;
417
418 f.next ();
419
420 if (f.kw != KW_object)
779 { 421 {
780 if (warn_archetypes) 422 f.parse_error ("more object");
781 LOG (llevError, "Couldn't find archetype %s\n", name); 423 goto fail;
782 return NULL;
783 } 424 }
784 arch_cmp++; 425 }
785 if (!strcmp ((const char *) at->name, name)) 426
786 return at; 427 {
787 if (++index >= ARCHTABLE) 428 auto (at, parts.begin ());
429
430 archetype *new_head = parts.front ();
431 archetype *old_head = find (new_head->archname);
432
433 if (old_head && !old_head->is_head ())
434 {
435 LOG (llevError, "%s: unable to overwrite non-head archetype '%s' with head archetype, skipping.\n",
436 &new_head->archname, &old_head->archname);
437 goto fail;
438 }
439
440 // check that all archetypes belong to the same old object or are new
441 for (auto (at, parts.begin ()); at != parts.end (); ++at)
442 {
443 archetype *new_part = *at;
444 archetype *old_part = find (new_part->archname);
445
446 if (old_part && old_part->head_ () != old_head)
447 {
448 LOG (llevError, "%s: unable to overwrite archetype '%s' with archetype of different object, skipping.\n",
449 &new_part->archname, &((archetype *)old_part->head_ ())->archname);
450 goto fail;
451 }
452 }
453
454 // assemble new chain
455 new_head->max_x = new_head->x;
456
457 archetype *less = new_head;
458 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
459 {
460 archetype *at = *p;
461
462 // some flags get inherited from the head (probably a lot more)
463 // doing it here doesn't feel too cozy, but it allows code
464 // to ignore head checks for these flags, which saves time
465 at->flag [FLAG_ALIVE] = new_head->flag [FLAG_ALIVE];
466 at->flag [FLAG_NO_PICK] = new_head->flag [FLAG_NO_PICK];
467 at->flag [FLAG_MONSTER] = new_head->flag [FLAG_MONSTER];
468 at->flag [FLAG_IS_FLOOR] = new_head->flag [FLAG_IS_FLOOR];
469
470 new_head->max_x = max (new_head->max_x, at->x);
471
472 at->head = new_head;
473 less->more = at;
474 less = at;
475 }
476
477 postponed_arch.insert (postponed_arch.end (), parts.begin (), parts.end ());
478
479 return new_head;
480 }
481
482fail:
483 for (auto (p, parts.begin ()); p != parts.end (); ++p)
484 (*p)->destroy ();
485
486 return 0;
487}
488
489void
490archetype::postpone_arch_ref (arch_ptr &ref, const_utf8_string other_arch)
491{
492 ref = 0;
493 postponed_arch_ref.push_back (std::pair<arch_ptr *, shstr>(&ref, shstr (other_arch)));
494}
495
496void
497archetype::commit_load ()
498{
499 // unlink old archetypes and link in new ones */
500 for (auto (p, postponed_arch.begin ()); p != postponed_arch.end (); ++p)
501 {
502 archetype *at = *p;
503
504 if (archetype *old = find (at->archname))
505 old->unlink ();
506
507 allarch.push_back (at);
508
509 at->link ();
510 ++dirtycnt;
511 }
512
513 postponed_arch.clear ();
514
515 // now resolve arch references
516 for (auto (p, postponed_arch_ref.begin ()); p != postponed_arch_ref.end (); ++p)
517 {
518 arch_ptr *ap = p->first;
519 archetype *at = find (p->second);
520
521 if (!at)
522 LOG (llevError, "unable to resolve postponed arch reference to '%s'", &p->second);
523
524 *ap = at;
525 }
526
527 postponed_arch_ref.clear ();
528
529 empty = find (shstr_empty_archetype);
530}
531
532void
533archetype::gc ()
534{
535 int cnt = max (1, min<int> (allarch.size () / 128, dirtycnt));
536 dirtycnt = max (0, dirtycnt - cnt);
537
538 do
539 {
540 static int idx;
541
542 if (idx >= allarch.size ())
543 if (idx)
788 index = 0; 544 idx = 0;
545 else
546 return;
547
548 archetype *at = allarch [idx];
549
550 if (at->refcnt_cnt () > 1) // all arches have ONE refcount from their object
551 ++idx;
552 else
553 {
554 //LOG (llevDebug, "garbage collect arch %s", &at->archname);
555 assert (at->arch == at); // verify that refcnt == 1 is truly valid
556 allarch.erase (idx);
557
558 // break chain
559 for (object *op = at->head_ (); op; )
560 {
561 object *next = op->more;
562 op->head = 0;
563 op->more = 0;
564 op = next;
565 }
566
567 at->destroy ();
568 at->arch = 0;
569 }
789 } 570 }
571 while (--cnt);
790} 572}
573
574object *
575archetype::instance ()
576{
577 object *op = clone ();
578 op->instantiate ();
579 return op;
580}
581
582//+GPL
791 583
792/* 584/*
793 * Adds an archetype to the hashtable. 585 * Finds which archetype matches the given name, and returns a new
586 * object containing a copy of the archetype.
794 */ 587 */
795 588object *
796static void 589archetype::get (const char *name)
797add_arch (archetype *at)
798{ 590{
799#if USE_UNORDERED_MAP 591 archetype *at = find (name);
800 ht.insert (std::make_pair ((size_t) (const char *) at->name, at));
801#endif
802 592
803 int 593 if (!at)
804 index = hasharch ((const char *) at->name, ARCHTABLE), org_index = index; 594 return create_singularity (name);
805 595
806 for (;;) 596 return at->instance ();
807 {
808 if (arch_table[index] == NULL)
809 {
810 arch_table[index] = at;
811 return;
812 }
813
814 if (++index == ARCHTABLE)
815 index = 0;
816
817 if (index == org_index)
818 fatal (ARCHTABLE_TOO_SMALL);
819 }
820} 597}
821 598
822/* 599/*
823 * Returns the first archetype using the given type. 600 * Returns the first archetype using the given type.
824 * Used in treasure-generation. 601 * Used in treasure-generation.
825 */ 602 */
826
827archetype * 603static archetype *
828type_to_archetype (int type) 604type_to_archetype (int type)
829{ 605{
830 archetype * 606 for_all_archetypes (at)
831 at; 607 if (at->type == type && at->head_ () != at)
832
833 for (at = first_archetype; at != NULL; at = (at->more == NULL) ? at->next : at->more)
834 if (at->clone.type == type)
835 return at; 608 return at;
609
836 return NULL; 610 return 0;
837} 611}
838 612
839/* 613/*
840 * Returns a new object copied from the first archetype matching 614 * Returns a new object copied from the first archetype matching
841 * the given type. 615 * the given type.
842 * Used in treasure-generation. 616 * Used in treasure-generation.
843 */ 617 */
844
845object * 618object *
846clone_arch (int type) 619clone_arch (int type)
847{ 620{
848 archetype * 621 archetype *at = type_to_archetype (type);
849 at;
850 object *
851 op = get_object ();
852 622
853 if ((at = type_to_archetype (type)) == NULL) 623 if (!at)
854 { 624 {
855 LOG (llevError, "Can't clone archetype %d\n", type); 625 LOG (llevError, "Can't clone archetype %d\n", type);
856 free_object (op);
857 return NULL; 626 return 0;
858 } 627 }
859 copy_object (&at->clone, op); 628
860 op->instantiate (); 629 return at->instance ();
861 return op;
862} 630}
863 631
864/* 632/*
865 * member: make instance from class 633 * member: make instance from class
866 */ 634 */
867
868object * 635object *
869object_create_arch (archetype *at) 636object_create_arch (archetype *at)
870{ 637{
871 object * 638 object *op, *prev = 0, *head = 0;
872 op, *
873 prev = NULL, *head = NULL;
874 639
875 while (at) 640 while (at)
876 { 641 {
877 op = arch_to_object (at); 642 op = at->instance ();
643
878 op->x = at->clone.x; 644 op->x = at->x;
879 op->y = at->clone.y; 645 op->y = at->y;
646
880 if (head) 647 if (head)
881 op->head = head, prev->more = op; 648 op->head = head, prev->more = op;
649
882 if (!head) 650 if (!head)
883 head = op; 651 head = op;
652
884 prev = op; 653 prev = op;
885 at = at->more; 654 at = (archetype *)at->more;
886 } 655 }
656
887 return (head); 657 return head;
888} 658}
889 659
890/*** end of arch.c ***/ 660//-GPL
661

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines