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.4 by root, Sun Aug 27 16:15:11 2006 UTC vs.
Revision 1.116 by root, Sat Nov 17 23:39:59 2018 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines