ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/common/arch.C
(Generate patch)

Comparing deliantra/server/common/arch.C (file contents):
Revision 1.3 by root, Sat Aug 26 23:36:28 2006 UTC vs.
Revision 1.52 by root, Tue Apr 17 10:06:32 2007 UTC

1/* 1/*
2 * static char *rcsid_arch_c =
3 * "$Id: arch.C,v 1.3 2006/08/26 23:36:28 root Exp $";
4 */
5
6/*
7 CrossFire, A Multiplayer game for X-windows 2 * CrossFire, A Multiplayer game for X-windows
8 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
9 Copyright (C) 2002 Mark Wedel & Crossfire Development Team 5 * Copyright (C) 2002 Mark Wedel & Crossfire Development Team
10 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (C) 1992 Frank Tore Johansen
11 7 *
12 This program is free software; you can redistribute it and/or modify 8 * This program is free software; you can redistribute it and/or modify
13 it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 2 of the License, or 10 * the Free Software Foundation; either version 2 of the License, or
15 (at your option) any later version. 11 * (at your option) any later version.
16 12 *
17 This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
18 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 GNU General Public License for more details. 16 * GNU General Public License for more details.
21 17 *
22 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
23 along with this program; if not, write to the Free Software 19 * along with this program; if not, write to the Free Software
24 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
25 21 *
26 The authors can be reached via e-mail at crossfire-devel@real-time.com 22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
27*/ 23 */
24
25#include <cassert>
28 26
29#include <global.h> 27#include <global.h>
30#include <arch.h>
31#include <funcpoint.h> 28#include <funcpoint.h>
32#include <loader.h> 29#include <loader.h>
33 30
34#include <cassert> 31#include <tr1/functional>
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;
74 }
75 return NULL; 75 return at;
76
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;
130 }
131 return NULL; 126 return at;
127
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
164 /* GROS - find_best_weapon_used_match and item_matched_string moved there */
165object *find_best_weapon_used_match(object *pl, const char *params)
166 {
167 object *tmp, *best=NULL;
168 int match_val=0,tmpmatch;
169
170 for (tmp=pl->inv; tmp; tmp=tmp->below) {
171 if (tmp->invisible) continue;
172 if ((tmpmatch=item_matched_string(pl, tmp, params))>match_val)
173 {
174 if ((QUERY_FLAG(tmp, FLAG_APPLIED))&&(tmp->type==WEAPON))
175 {
176 match_val=tmpmatch;
177 best=tmp;
178 };
179 }
180 }
181 return best;
182 }
183 161
184 /* 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
185 * a string seperated lists of things to match, with certain keywords. 163 * a string seperated lists of things to match, with certain keywords.
186 * pl is the player (only needed to set count properly) 164 * pl is the player (only needed to set count properly)
187 * op is the item we are trying to match. Calling function takes care 165 * op is the item we are trying to match. Calling function takes care
… …
196 * player object.) 174 * player object.)
197 * If count is 1, make a quick check on the name. 175 * If count is 1, make a quick check on the name.
198 * IF count is >1, we need to make plural name. Return if match. 176 * IF count is >1, we need to make plural name. Return if match.
199 * Last, make a check on the full name. 177 * Last, make a check on the full name.
200 */ 178 */
179int
201int item_matched_string(object *pl, object *op, const char *name) 180item_matched_string (object *pl, object *op, const char *name)
202{ 181{
203 char *cp, local_name[MAX_BUF]; 182 char *cp, local_name[MAX_BUF];
204 int count,retval=0; 183 int count, retval = 0;
184
205 strcpy(local_name, name); /* strtok is destructive to name */ 185 assign (local_name, name); /* strtok is destructive to name */
206 186
207 for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { 187 for (cp = strtok (local_name, ","); cp; cp = strtok (NULL, ","))
208 while (cp[0]==' ') ++cp; /* get rid of spaces */ 188 {
189 while (cp[0] == ' ')
190 ++cp; /* get rid of spaces */
209 191
210 /* LOG(llevDebug,"Trying to match %s\n", cp);*/ 192 /* LOG(llevDebug,"Trying to match %s\n", cp); */
211 /* All is a very generic match - low match value */ 193 /* All is a very generic match - low match value */
212 if (!strcmp(cp,"all")) return 1; 194 if (!strcmp (cp, "all"))
195 return 1;
213 196
214 /* unpaid is a little more specific */ 197 /* unpaid is a little more specific */
215 if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; 198 if (!strcmp (cp, "unpaid") && QUERY_FLAG (op, FLAG_UNPAID))
216 if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) &&
217 (QUERY_FLAG(op,FLAG_CURSED) ||QUERY_FLAG(op,FLAG_DAMNED)))
218 return 2; 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;
219 202
220 if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) 203 if (!strcmp (cp, "unlocked") && !QUERY_FLAG (op, FLAG_INV_LOCKED))
221 return 2; 204 return 2;
222 205
223 /* Allow for things like '100 arrows' */ 206 /* Allow for things like '100 arrows' */
224 if ((count=atoi(cp))!=0) { 207 if ((count = atoi (cp)) != 0)
208 {
225 cp=strchr(cp, ' '); 209 cp = strchr (cp, ' ');
226 while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ 210 while (cp && cp[0] == ' ')
227 } 211 ++cp; /* get rid of spaces */
228 else { 212 }
213 else
214 {
229 if (pl->type==PLAYER) 215 if (pl->type == PLAYER)
230 count=pl->contr->count; 216 count = pl->contr->count;
231 else 217 else
232 count = 0; 218 count = 0;
233 } 219 }
234 220
235 if (!cp || cp[0]=='\0' || count<0) return 0; 221 if (!cp || cp[0] == '\0' || count < 0)
222 return 0;
236 223
237 224
238 /* The code here should go from highest retval to lowest. That 225 /* The code here should go from highest retval to lowest. That
239 * is because of the 'else' handling - we don't want to match on 226 * is because of the 'else' handling - we don't want to match on
240 * something and set a low retval, even though it may match a higher retcal 227 * something and set a low retval, even though it may match a higher retcal
241 * later. So keep it in descending order here, so we try for the best 228 * later. So keep it in descending order here, so we try for the best
242 * match first, and work downward. 229 * match first, and work downward.
243 */ 230 */
244 if (!strcasecmp(cp,query_name(op))) retval=20; 231 if (!strcasecmp (cp, query_name (op)))
232 retval = 20;
245 else if (!strcasecmp(cp,query_short_name(op))) retval=18; 233 else if (!strcasecmp (cp, query_short_name (op)))
246 else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; 234 retval = 18;
247 else if (!strcasecmp(cp,query_base_name(op,1))) retval=16;
248 else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15;
249 else if (!strncasecmp(cp,query_base_name(op,0), 235 else if (!strcasecmp (cp, query_base_name (op, 0)))
250 strlen(cp))) retval=14; 236 retval = 16;
251 else if (!strncasecmp(cp,query_base_name(op,1), 237 else if (!strcasecmp (cp, query_base_name (op, 1)))
252 strlen(cp))) retval=14; 238 retval = 16;
253 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;
254 /* Do substring checks, so things like 'Str+1' will match. 245 /* Do substring checks, so things like 'Str+1' will match.
255 * retval of these should perhaps be lower - they are lower 246 * retval of these should perhaps be lower - they are lower
256 * then the specific strcasecmp aboves, but still higher than 247 * then the specific strcasecmp aboves, but still higher than
257 * some other match criteria. 248 * some other match criteria.
258 */ 249 */
259 else if (strstr(query_base_name(op,1), cp)) retval = 12; 250 else if (strstr (query_base_name (op, 1), cp))
251 retval = 12;
260 else if (strstr(query_base_name(op,0), cp)) retval = 12; 252 else if (strstr (query_base_name (op, 0), cp))
253 retval = 12;
261 else if (strstr(query_short_name(op), cp)) retval = 12; 254 else if (strstr (query_short_name (op), cp))
262 255 retval = 12;
263 /* Check against plural/non plural based on count. */ 256 /* Check against plural/non plural based on count. */
264 else if (count>1 && !strcasecmp(cp,op->name_pl)) { 257 else if (count > 1 && !strcasecmp (cp, op->name_pl))
265 retval=6; 258 retval = 6;
266 }
267 else if (count==1 && !strcasecmp(op->name,cp)) { 259 else if (count == 1 && !strcasecmp (op->name, cp))
268 retval=6; 260 retval = 6;
269 }
270 /* base name matched - not bad */ 261 /* base name matched - not bad */
271 else if (strcasecmp(cp,op->name)==0 && !count) retval=4; 262 else if (strcasecmp (cp, op->name) == 0 && !count)
263 retval = 4;
272 /* Check for partial custom name, but give a real low priority */ 264 /* Check for partial custom name, but give a real low priority */
273 else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3; 265 else if (op->custom_name && strstr (op->custom_name, cp))
266 retval = 3;
274 267
275 if (retval) { 268 if (retval)
269 {
276 if (pl->type == PLAYER) 270 if (pl->type == PLAYER)
277 pl->contr->count=count; 271 pl->contr->count = count;
272
278 return retval; 273 return retval;
279 } 274 }
280 } 275 }
276
281 return 0; 277 return 0;
282} 278}
283 279
284/* 280archetype::archetype ()
285 * Initialises the internal linked list of archetypes (read from file). 281{
286 * Then the global "empty_archetype" pointer is initialised. 282 clone.arch = this;
287 * Then the blocksview[] array is initialised.
288 */
289 283
290void init_archetypes(void) { /* called from add_player() and edit() */ 284 CLEAR_FLAG (&clone, FLAG_FREED); /* This shouldn't matter, since copy_to */
291 if(first_archetype!=NULL) /* Only do this once */ 285 SET_FLAG (&clone, FLAG_REMOVED); /* doesn't copy these flags... */
292 return;
293 arch_init = 1;
294 load_archetypes();
295 arch_init = 0;
296 empty_archetype=find_archetype("empty_archetype");
297/* init_blocksview();*/
298} 286}
299 287
300/* 288archetype::~archetype ()
301 * Stores debug-information about how efficient the hashtable 289{
302 * used for archetypes has been in the static errmsg array. 290 //TODO: nuke ->more's
303 */
304
305void arch_info(object *op) {
306 sprintf(errmsg,"%d searches and %d strcmp()'s",arch_search,arch_cmp);
307 new_draw_info(NDI_BLACK, 0, op,errmsg);
308} 291}
309 292
310/* 293static void
311 * Initialise the hashtable used by the archetypes. 294unlink (archetype *at)
312 */ 295{
296 if (at->head)
297 at = at->head;
313 298
314void clear_archetable(void) { 299 // destroy this archetype's link, making singletons out of its parts
315 memset((void *) arch_table,0,ARCHTABLE*sizeof(archetype *)); 300 while (at)
301 {
302 archetype *more = at->more;
303 at->clone.destroy_inv ();
304 at->head = at->more = 0;
305 at = more;
306 }
316} 307}
317 308
318/* 309// dire hack, need to rationalise
319 * An alternative way to init the hashtable which is slower, but _works_... 310void
320 */ 311overwrite (archetype *at, object *op)
312{
313 at->clone = *op;
314
315 at->clone.arch = at;
316 at->clone.inv = op->inv; op->inv = 0;
321 317
322void init_archetable(void) { 318 op->destroy ();
323 archetype *at;
324 LOG(llevDebug," Setting up archetable...\n");
325 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more)
326 add_arch(at);
327 LOG(llevDebug,"done\n");
328} 319}
329 320
330/* 321bool
331 * Dumps an archetype to debug-level output. 322archetype::load (object_thawer &f)
332 */ 323{
324 assert (f.kw == KW_object);
333 325
334void dump_arch(archetype *at) { 326 typedef std::pair<archetype *, object *> part;
335 dump_object(&at->clone); 327 std::vector<part> parts;
336}
337 328
338/* 329 coroapi::cede_to_tick_every (100);
339 * Dumps _all_ archetypes to debug-level output.
340 * If you run crossfire with debug, and enter DM-mode, you can trigger
341 * this with the O key.
342 */
343 330
344void dump_all_archetypes(void) { 331 for (;;)
345 archetype *at; 332 {
346 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) { 333 archetype *at = get (f.get_str ());
347 dump_arch(at); 334 object *op = object::create ();
348 fprintf(logfile, "%s\n", errmsg); 335
336 if (!op->parse_kv (f))
337 goto fail;
338
339 parts.push_back (std::make_pair (at, op));
340
341 if (f.kw != KW_more)
342 break;
343
344 f.next ();
345 assert (f.kw == KW_object);
346 }
347
348 {
349 archetype *head = parts.front ().first;
350
351 // check that all archetypes belong to the same object or are heads
352 for (auto (p, parts.begin ()); p != parts.end (); ++p)
353 {
354 archetype *at = p->first;
355
356 if (at->head != head && at->head)
357 {
358 LOG (llevError, "%s: unable to overwrite foreign non-head archetype with non-head archetype\n", &at->name);
359 goto fail;
360 }
361
362 if (at->next && at != head)
363 {
364 LOG (llevError, "%s: unable to overwrite foreign head archetype with non-head archetype\n", &at->name);
365 goto fail;
366 }
367 }
368
369 // sever chain of existing head object
370 for (archetype *more, *at = head; at; at = more)
371 {
372 more = at->more;
373
374 at->head = 0;
375 at->more = 0;
376 }
377
378 // replace/update head
379 overwrite (head, parts.front ().second);
380 head->tail_x = 0;
381 head->tail_y = 0;
382
383 // link into list of heads, if not already there
384 if (!head->linked)
385 {
386 head->linked = true;
387 head->next = first_archetype;
388 first_archetype = head;
389 }
390
391 // reassemble new chain
392 archetype *prev = head;
393 for (auto (p, parts.begin () + 1); p != parts.end (); ++p)
394 {
395 archetype *at = p->first;
396 overwrite (at, p->second);
397
398 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
399 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
400
401 at->head = head;
402 at->clone.head = &head->clone;
403 prev->more = at;
404 prev->clone.more = &at->clone;
405
406 prev = at;
407 }
349 } 408 }
350}
351 409
352void free_all_archs(void)
353{
354 archetype *at, *next;
355 int i=0,f=0;
356
357 for (at=first_archetype; at!=NULL; at=next) {
358 if (at->more) next=at->more;
359 else next=at->next;
360 if (at->name) free_string(at->name);
361 if (at->clone.name) free_string(at->clone.name);
362 if (at->clone.name_pl) free_string(at->clone.name_pl);
363 if (at->clone.title) free_string(at->clone.title);
364 if (at->clone.race) free_string(at->clone.race);
365 if (at->clone.slaying) free_string(at->clone.slaying);
366 if (at->clone.msg) free_string(at->clone.msg);
367 free(at);
368 i++;
369 }
370 LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f);
371}
372
373/*
374 * Allocates, initialises and returns the pointer to an archetype structure.
375 */
376
377archetype *get_archetype_struct(void) {
378 archetype *arch;
379
380 arch=(archetype *)CALLOC(1,sizeof(archetype));
381 if(arch==NULL)
382 fatal(OUT_OF_MEMORY);
383 arch->next=NULL;
384 arch->name=NULL;
385 arch->clone.other_arch=NULL;
386 arch->clone.name=NULL;
387 arch->clone.name_pl=NULL;
388 arch->clone.title=NULL;
389 arch->clone.race=NULL;
390 arch->clone.slaying=NULL;
391 arch->clone.msg=NULL;
392 clear_object(&arch->clone); /* to initial state other also */
393 CLEAR_FLAG((&arch->clone),FLAG_FREED); /* This shouldn't matter, since copy_object() */
394 SET_FLAG((&arch->clone), FLAG_REMOVED); /* doesn't copy these flags... */
395 arch->head=NULL;
396 arch->more=NULL;
397 return arch; 410 return true;
411
412fail:
413 for (auto (p, parts.begin ()); p != parts.end (); ++p)
414 p->second->destroy (true);
415
416 return false;
398} 417}
399 418
400/* 419/*
401 * Reads/parses the archetype-file, and copies into a linked list 420 * Reads/parses the archetype-file, and copies into a linked list
402 * of archetype-structures. 421 * of archetype-structures.
403 */ 422 */
404void first_arch_pass(FILE *fp) { 423static bool
405 object *op; 424load_archetypes (object_thawer &f)
406 archetype *at,*head=NULL,*last_more=NULL; 425{
407 int i,first=2; 426 for (;;)
408
409 op=get_object();
410 op->arch=first_archetype=at=get_archetype_struct();
411
412 while((i=load_object(fp,op,first,0))) {
413 first=0;
414 copy_object(op,&at->clone);
415 at->clone.speed_left= (float) (-0.1);
416 /* copy the body_info to the body_used - this is only really
417 * need for monsters, but doesn't hurt to do it for everything.
418 * by doing so, when a monster is created, it has good starting
419 * values for the body_used info, so when items are created
420 * for it, they can be properly equipped.
421 */
422 memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info));
423
424 switch(i) {
425 case LL_NORMAL: /* A new archetype, just link it with the previous */
426 if(last_more!=NULL)
427 last_more->next=at;
428 if(head!=NULL)
429 head->next=at;
430 head=last_more=at;
431#if 0
432 if(!op->type)
433 LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name);
434#endif
435 at->tail_x = 0;
436 at->tail_y = 0;
437 break;
438
439 case LL_MORE: /* Another part of the previous archetype, link it correctly */
440
441 at->head=head;
442 at->clone.head = &head->clone;
443 if(last_more!=NULL) {
444 last_more->more=at;
445 last_more->clone.more = &at->clone;
446 }
447 last_more=at;
448
449 /* If this multipart image is still composed of individual small
450 * images, don't set the tail_.. values. We can't use them anyways,
451 * and setting these to zero makes the map sending to the client much
452 * easier as just looking at the head, we know what to do.
453 */
454 if (at->clone.face != head->clone.face) {
455 head->tail_x = 0;
456 head->tail_y = 0;
457 } else {
458 if (at->clone.x > head->tail_x) head->tail_x = at->clone.x;
459 if (at->clone.y > head->tail_y) head->tail_y = at->clone.y;
460 }
461 break;
462
463 }
464
465 at=get_archetype_struct();
466 clear_object(op);
467 op->arch=at;
468 } 427 {
469 free(at); 428 switch (f.kw)
470 free_object(op); 429 {
471} 430 case KW_object:
431 loading_arch = true;
432 if (!archetype::load (f))
433 {
434 loading_arch = false;
435 return false;
436 }
472 437
473/* 438 loading_arch = false;
474 * Reads the archetype file once more, and links all pointers between
475 * archetypes.
476 */
477
478void second_arch_pass(FILE *fp) {
479 char buf[MAX_BUF],*variable=buf,*argument,*cp;
480 archetype *at=NULL,*other;
481
482 while(fgets(buf,MAX_BUF,fp)!=NULL) {
483 if(*buf=='#')
484 continue; 439 continue;
485 if((argument=strchr(buf,' '))!=NULL) { 440
486 *argument='\0',argument++; 441 case KW_EOF:
487 cp = argument + strlen(argument)-1; 442 return true;
488 while (isspace(*cp)) { 443
489 *cp='\0'; 444 default:
490 cp--; 445 if (!f.parse_error ("archetypes file"))
491 } 446 return false;
492 }
493 if(!strcmp("Object",variable)) {
494 if((at=find_archetype(argument))==NULL)
495 LOG(llevError,"Warning: failed to find arch %s\n",argument);
496 } else if(!strcmp("other_arch",variable)) {
497 if(at!=NULL&&at->clone.other_arch==NULL) {
498 if((other=find_archetype(argument))==NULL)
499 LOG(llevError,"Warning: failed to find other_arch %s\n",argument);
500 else if(at!=NULL)
501 at->clone.other_arch=other;
502 } 447 }
503 } else if(!strcmp("randomitems",variable)) { 448
504 if(at!=NULL) { 449 f.next ();
505 treasurelist *tl=find_treasurelist(argument);
506 if(tl==NULL)
507 LOG(llevError,"Failed to link treasure to arch (%s): %s\n",at->name, argument);
508 else
509 at->clone.randomitems=tl;
510 } 450 }
511 }
512 }
513} 451}
514
515#ifdef DEBUG
516void check_generators(void) {
517 archetype *at;
518 for(at=first_archetype;at!=NULL;at=at->next)
519 if(QUERY_FLAG(&at->clone,FLAG_GENERATOR)&&at->clone.other_arch==NULL)
520 LOG(llevError,"Warning: %s is generator but lacks other_arch.\n",
521 at->name);
522}
523#endif
524 452
525/* 453/*
526 * First initialises the archtype hash-table (init_archetable()). 454 * First initialises the archtype hash-table (init_archetable()).
527 * Reads and parses the archetype file (with the first and second-pass 455 * Reads and parses the archetype file (with the first and second-pass
528 * functions). 456 * functions).
529 * Then initialises treasures by calling load_treasures().
530 */ 457 */
458bool
459load_archetype_file (const char *filename)
460{
461 object_thawer f (filename);
531 462
532void load_archetypes(void) { 463 f.next ();
533 FILE *fp;
534 char filename[MAX_BUF];
535 int comp;
536#if TIME_ARCH_LOAD
537 struct timeval tv1,tv2;
538#endif
539 464
540 sprintf(filename,"%s/%s",settings.datadir,settings.archetypes); 465 if (!load_archetypes (f))
541 LOG(llevDebug,"Reading archetypes from %s...\n",filename); 466 return false;
542 if((fp=open_and_uncompress(filename,0,&comp))==NULL) {
543 LOG(llevError," Can't open archetype file.\n");
544 return;
545 }
546 clear_archetable();
547 LOG(llevDebug," arch-pass 1...\n");
548#if TIME_ARCH_LOAD
549 GETTIMEOFDAY(&tv1);
550#endif
551 first_arch_pass(fp);
552#if TIME_ARCH_LOAD
553 { int sec, usec;
554 GETTIMEOFDAY(&tv2);
555 sec = tv2.tv_sec - tv1.tv_sec;
556 usec = tv2.tv_usec - tv1.tv_usec;
557 if (usec<0) { usec +=1000000; sec--;}
558 LOG(llevDebug,"Load took %d.%06d seconds\n", sec, usec);
559 }
560#endif
561 467
562 LOG(llevDebug," done\n");
563 init_archetable();
564 warn_archetypes=1; 468 warn_archetypes = 1;
565 469
566 /* do a close and reopen instead of a rewind - necessary in case the 470 empty_archetype = archetype::find ("empty_archetype");
567 * file has been compressed. 471 if (!empty_archetype)
568 */ 472 return false;
569 close_and_delete(fp, comp);
570 fp=open_and_uncompress(filename,0,&comp);
571 473
572 LOG(llevDebug," loading treasure...\n"); 474 return true;
573 load_treasures();
574 LOG(llevDebug," done\n arch-pass 2...\n");
575 second_arch_pass(fp);
576 LOG(llevDebug," done\n");
577#ifdef DEBUG
578 check_generators();
579#endif
580 close_and_delete(fp, comp);
581 LOG(llevDebug," done\n");
582} 475}
583 476
584/* 477/*
585 * Creates and returns a new object which is a copy of the given archetype. 478 * Creates and returns a new object which is a copy of the given archetype.
586 * This function returns NULL on failure. 479 * This function returns NULL on failure.
587 */ 480 */
588 481object *
589object *arch_to_object(archetype *at) { 482arch_to_object (archetype *at)
590 object *op; 483{
591 if(at==NULL) { 484 if (!at)
485 {
592 if(warn_archetypes) 486 if (warn_archetypes)
593 LOG(llevError,"Couldn't find archetype.\n"); 487 LOG (llevError, "Couldn't find archetype.\n");
488
594 return NULL; 489 return NULL;
595 } 490 }
596 op=get_object(); 491
597 copy_object(&at->clone,op); 492 object *op = at->clone.clone ();
493 op->arch = at;
598 op->instantiate (); 494 op->instantiate ();
599 op->arch=at;
600 return op; 495 return op;
601} 496}
602 497
603/* 498/*
604 * Creates an object. This function is called by get_archetype() 499 * Creates an object. This function is called by get_archetype()
605 * if it fails to find the appropriate archetype. 500 * if it fails to find the appropriate archetype.
606 * Thus get_archetype() will be guaranteed to always return 501 * Thus get_archetype() will be guaranteed to always return
607 * an object, and never NULL. 502 * an object, and never NULL.
608 */ 503 */
609 504object *
610object *create_singularity(const char *name) { 505create_singularity (const char *name)
506{
611 object *op; 507 object *op;
612 char buf[MAX_BUF]; 508 char buf[MAX_BUF];
509
613 sprintf(buf,"%s (%s)",ARCH_SINGULARITY,name); 510 sprintf (buf, "%s (%s)", ARCH_SINGULARITY, name);
614 op = get_object(); 511 op = object::create ();
615 op->name = add_string(buf); 512 op->name = op->name_pl = buf;
616 op->name_pl = add_string(buf);
617 SET_FLAG(op,FLAG_NO_PICK); 513 SET_FLAG (op, FLAG_NO_PICK);
618 return op; 514 return op;
619} 515}
620 516
621/* 517/*
622 * Finds which archetype matches the given name, and returns a new 518 * Finds which archetype matches the given name, and returns a new
623 * object containing a copy of the archetype. 519 * object containing a copy of the archetype.
624 */ 520 */
625 521object *
626object *get_archetype(const char *name) { 522get_archetype (const char *name)
627 archetype *at; 523{
628 at = find_archetype(name); 524 archetype *at = archetype::find (name);
629 if (at == NULL) 525
526 if (!at)
630 return create_singularity(name); 527 return create_singularity (name);
528
631 return arch_to_object(at); 529 return arch_to_object (at);
632}
633
634/*
635 * Hash-function used by the arch-hashtable.
636 */
637
638unsigned long
639hasharch(const char *str, int tablesize) {
640 unsigned long hash = 0;
641 int i = 0;
642 const char *p;
643
644 /* use the one-at-a-time hash function, which supposedly is
645 * better than the djb2-like one used by perl5.005, but
646 * certainly is better then the bug used here before.
647 * see http://burtleburtle.net/bob/hash/doobs.html
648 */
649 for (p = str; i < MAXSTRING && *p; p++, i++) {
650 hash += *p;
651 hash += hash << 10;
652 hash ^= hash >> 6;
653 }
654 hash += hash << 3;
655 hash ^= hash >> 11;
656 hash += hash << 15;
657 return hash % tablesize;
658} 530}
659 531
660/* 532/*
661 * Finds, using the hashtable, which archetype matches the given name. 533 * Finds, using the hashtable, which archetype matches the given name.
662 * returns a pointer to the found archetype, otherwise NULL. 534 * returns a pointer to the found archetype, otherwise NULL.
663 */ 535 */
664
665archetype *find_archetype(const char *name) {
666 archetype *at; 536archetype *
667 unsigned long index; 537archetype::find (const char *name)
668 538{
669 if (name == NULL) 539 if (!name)
670 return (archetype *) NULL;
671
672 index=hasharch(name, ARCHTABLE);
673 arch_search++;
674 for(;;) {
675 at = arch_table[index];
676 if (at==NULL) {
677 if(warn_archetypes)
678 LOG(llevError,"Couldn't find archetype %s\n",name);
679 return NULL; 540 return 0;
541
542 auto (i, ht.find (name));
543
544 if (i == ht.end ())
545 return 0;
546 else
547 return i->second;
548}
549
550archetype *
551archetype::get (const char *name)
552{
553 archetype *at = find (name);
554
555 if (!at)
680 } 556 {
681 arch_cmp++; 557 archetypes.push_back (at = new archetype);
682 if (!strcmp(at->name,name)) 558 at->name = name;
559 at->hash_add ();
560 }
561
683 return at; 562 return at;
684 if(++index>=ARCHTABLE)
685 index=0;
686 }
687} 563}
688 564
689/* 565/*
690 * Adds an archetype to the hashtable. 566 * Adds an archetype to the hashtable.
691 */ 567 */
568void
569archetype::hash_add ()
570{
571 ht.insert (std::make_pair (name, this));
572}
692 573
693static void add_arch(archetype *at) { 574void
694 int index=hasharch(at->name, ARCHTABLE),org_index=index; 575archetype::hash_del ()
695 for(;;) { 576{
696 if(arch_table[index]==NULL) { 577 ht.erase (name);
697 arch_table[index]=at;
698 return;
699 }
700 if(++index==ARCHTABLE)
701 index=0;
702 if(index==org_index)
703 fatal(ARCHTABLE_TOO_SMALL);
704 }
705} 578}
706 579
707/* 580/*
708 * Returns the first archetype using the given type. 581 * Returns the first archetype using the given type.
709 * Used in treasure-generation. 582 * Used in treasure-generation.
710 */ 583 */
711
712archetype *type_to_archetype(int type) {
713 archetype *at; 584archetype *
714 585type_to_archetype (int type)
586{
715 for(at=first_archetype;at!=NULL;at=(at->more==NULL)?at->next:at->more) 587 for (archetype *at = first_archetype; at; at = at->more == 0 ? at->next : at->more)
716 if(at->clone.type==type) 588 if (at->clone.type == type)
717 return at; 589 return at;
590
718 return NULL; 591 return 0;
719} 592}
720 593
721/* 594/*
722 * Returns a new object copied from the first archetype matching 595 * Returns a new object copied from the first archetype matching
723 * the given type. 596 * the given type.
724 * Used in treasure-generation. 597 * Used in treasure-generation.
725 */ 598 */
726 599object *
727object *clone_arch(int type) { 600clone_arch (int type)
601{
728 archetype *at; 602 archetype *at;
729 object *op=get_object();
730 603
731 if((at=type_to_archetype(type))==NULL) { 604 if ((at = type_to_archetype (type)) == NULL)
605 {
732 LOG(llevError,"Can't clone archetype %d\n",type); 606 LOG (llevError, "Can't clone archetype %d\n", type);
733 free_object(op);
734 return NULL; 607 return 0;
735 } 608 }
736 copy_object(&at->clone,op); 609
610 object *op = at->clone.clone ();
737 op->instantiate (); 611 op->instantiate ();
738 return op; 612 return op;
739} 613}
740 614
741/* 615/*
742 * member: make instance from class 616 * member: make instance from class
743 */ 617 */
744 618
619object *
745object *object_create_arch (archetype * at) 620object_create_arch (archetype *at)
746{ 621{
747 object *op, *prev = NULL, *head = NULL; 622 object *op, *prev = 0, *head = 0;
748 623
749 while (at) { 624 while (at)
625 {
750 op = arch_to_object (at); 626 op = arch_to_object (at);
751 op->x = at->clone.x; 627 op->x = at->clone.x;
752 op->y = at->clone.y; 628 op->y = at->clone.y;
629
753 if (head) 630 if (head)
754 op->head = head, prev->more = op; 631 op->head = head, prev->more = op;
632
755 if (!head) 633 if (!head)
756 head = op; 634 head = op;
635
757 prev = op; 636 prev = op;
758 at = at->more; 637 at = at->more;
759 } 638 }
639
760 return (head); 640 return (head);
761} 641}
762 642
763/*** end of arch.c ***/

Diff Legend

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