1 | /* |
1 | /* |
2 | * static char *rcsid_arch_c = |
2 | * static char *rcsid_arch_c = |
3 | * "$Id: arch.C,v 1.2 2006/08/26 08:44:04 root Exp $"; |
3 | * "$Id: arch.C,v 1.9 2006/08/30 11:02:15 root Exp $"; |
4 | */ |
4 | */ |
5 | |
5 | |
6 | /* |
6 | /* |
7 | CrossFire, A Multiplayer game for X-windows |
7 | CrossFire, A Multiplayer game for X-windows |
8 | |
8 | |
… | |
… | |
28 | |
28 | |
29 | #include <global.h> |
29 | #include <global.h> |
30 | #include <arch.h> |
30 | #include <arch.h> |
31 | #include <funcpoint.h> |
31 | #include <funcpoint.h> |
32 | #include <loader.h> |
32 | #include <loader.h> |
|
|
33 | |
|
|
34 | #include <cassert> |
33 | |
35 | |
34 | /* IF set, does a little timing on the archetype load. */ |
36 | /* IF set, does a little timing on the archetype load. */ |
35 | #define TIME_ARCH_LOAD 0 |
37 | #define TIME_ARCH_LOAD 0 |
36 | |
38 | |
37 | static void add_arch(archetype *at); |
39 | static void add_arch(archetype *at); |
… | |
… | |
62 | */ |
64 | */ |
63 | archetype *find_archetype_by_object_name(const char *name) { |
65 | archetype *find_archetype_by_object_name(const char *name) { |
64 | archetype *at; |
66 | archetype *at; |
65 | |
67 | |
66 | if (name == NULL) |
68 | if (name == NULL) |
67 | return (archetype *) NULL; |
69 | return (archetype *) NULL; |
68 | |
70 | |
69 | for(at = first_archetype;at!=NULL;at=at->next) { |
71 | for(at = first_archetype;at!=NULL;at=at->next) { |
70 | if (!strcmp(at->clone.name, name)) |
72 | if (!strcmp(at->clone.name, name)) |
71 | return at; |
73 | return at; |
72 | } |
74 | } |
73 | return NULL; |
75 | return NULL; |
74 | } |
76 | } |
75 | |
77 | |
76 | /** |
78 | /** |
… | |
… | |
99 | */ |
101 | */ |
100 | object *get_archetype_by_skill_name(const char *skill, int type) { |
102 | object *get_archetype_by_skill_name(const char *skill, int type) { |
101 | archetype *at; |
103 | archetype *at; |
102 | |
104 | |
103 | if (skill == NULL) |
105 | if (skill == NULL) |
104 | return NULL; |
106 | return NULL; |
105 | |
107 | |
106 | for(at = first_archetype;at!=NULL;at=at->next) { |
108 | for(at = first_archetype;at!=NULL;at=at->next) { |
107 | if ( ((type == -1) || (type == at->clone.type)) && |
109 | if ( ((type == -1) || (type == at->clone.type)) && |
108 | (!strcmp(at->clone.skill, skill))) |
110 | (!strcmp(at->clone.skill, skill))) |
109 | return arch_to_object(at); |
111 | return arch_to_object(at); |
110 | } |
112 | } |
111 | return NULL; |
113 | return NULL; |
112 | } |
114 | } |
113 | |
115 | |
114 | /* similiar to above - this returns the first archetype |
116 | /* similiar to above - this returns the first archetype |
… | |
… | |
120 | */ |
122 | */ |
121 | archetype *get_archetype_by_type_subtype(int type, int subtype) { |
123 | archetype *get_archetype_by_type_subtype(int type, int subtype) { |
122 | archetype *at; |
124 | archetype *at; |
123 | |
125 | |
124 | for(at = first_archetype;at!=NULL;at=at->next) { |
126 | for(at = first_archetype;at!=NULL;at=at->next) { |
125 | if ( ((type == -1) || (type == at->clone.type)) && |
127 | if ( ((type == -1) || (type == at->clone.type)) && |
126 | (subtype == -1 || subtype == at->clone.subtype)) |
128 | (subtype == -1 || subtype == at->clone.subtype)) |
127 | return at; |
129 | return at; |
128 | } |
130 | } |
129 | return NULL; |
131 | return NULL; |
130 | } |
132 | } |
131 | |
133 | |
132 | /** |
134 | /** |
… | |
… | |
147 | int i; |
149 | int i; |
148 | |
150 | |
149 | strncpy(tmpname,name,MAX_BUF-1); |
151 | strncpy(tmpname,name,MAX_BUF-1); |
150 | tmpname[MAX_BUF-1] = 0; |
152 | tmpname[MAX_BUF-1] = 0; |
151 | for(i=strlen(tmpname); i>0; i--) { |
153 | for(i=strlen(tmpname); i>0; i--) { |
152 | tmpname[i] = 0; |
154 | tmpname[i] = 0; |
153 | at = find_archetype_by_object_name(tmpname); |
155 | at = find_archetype_by_object_name(tmpname); |
154 | if (at !=NULL) |
156 | if (at !=NULL) |
155 | { |
157 | { |
156 | return arch_to_object(at); |
158 | return arch_to_object(at); |
157 | } |
159 | } |
158 | } |
160 | } |
159 | return create_singularity(name); |
161 | return create_singularity(name); |
160 | } |
162 | } |
161 | |
|
|
162 | /* GROS - find_best_weapon_used_match and item_matched_string moved there */ |
|
|
163 | object *find_best_weapon_used_match(object *pl, const char *params) |
|
|
164 | { |
|
|
165 | object *tmp, *best=NULL; |
|
|
166 | int match_val=0,tmpmatch; |
|
|
167 | |
|
|
168 | for (tmp=pl->inv; tmp; tmp=tmp->below) { |
|
|
169 | if (tmp->invisible) continue; |
|
|
170 | if ((tmpmatch=item_matched_string(pl, tmp, params))>match_val) |
|
|
171 | { |
|
|
172 | if ((QUERY_FLAG(tmp, FLAG_APPLIED))&&(tmp->type==WEAPON)) |
|
|
173 | { |
|
|
174 | match_val=tmpmatch; |
|
|
175 | best=tmp; |
|
|
176 | }; |
|
|
177 | } |
|
|
178 | } |
|
|
179 | return best; |
|
|
180 | } |
|
|
181 | |
163 | |
182 | /* This is a subset of the parse_id command. Basically, name can be |
164 | /* This is a subset of the parse_id command. Basically, name can be |
183 | * a string seperated lists of things to match, with certain keywords. |
165 | * a string seperated lists of things to match, with certain keywords. |
184 | * pl is the player (only needed to set count properly) |
166 | * pl is the player (only needed to set count properly) |
185 | * op is the item we are trying to match. Calling function takes care |
167 | * op is the item we are trying to match. Calling function takes care |
… | |
… | |
201 | char *cp, local_name[MAX_BUF]; |
183 | char *cp, local_name[MAX_BUF]; |
202 | int count,retval=0; |
184 | int count,retval=0; |
203 | strcpy(local_name, name); /* strtok is destructive to name */ |
185 | strcpy(local_name, name); /* strtok is destructive to name */ |
204 | |
186 | |
205 | for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { |
187 | for (cp=strtok(local_name,","); cp; cp=strtok(NULL,",")) { |
206 | while (cp[0]==' ') ++cp; /* get rid of spaces */ |
188 | while (cp[0]==' ') ++cp; /* get rid of spaces */ |
207 | |
189 | |
208 | /* LOG(llevDebug,"Trying to match %s\n", cp);*/ |
190 | /* LOG(llevDebug,"Trying to match %s\n", cp);*/ |
209 | /* All is a very generic match - low match value */ |
191 | /* All is a very generic match - low match value */ |
210 | if (!strcmp(cp,"all")) return 1; |
192 | if (!strcmp(cp,"all")) return 1; |
211 | |
193 | |
212 | /* unpaid is a little more specific */ |
194 | /* unpaid is a little more specific */ |
213 | if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; |
195 | if (!strcmp(cp,"unpaid") && QUERY_FLAG(op,FLAG_UNPAID)) return 2; |
214 | if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) && |
196 | if (!strcmp(cp,"cursed") && QUERY_FLAG(op,FLAG_KNOWN_CURSED) && |
215 | (QUERY_FLAG(op,FLAG_CURSED) ||QUERY_FLAG(op,FLAG_DAMNED))) |
197 | (QUERY_FLAG(op,FLAG_CURSED) ||QUERY_FLAG(op,FLAG_DAMNED))) |
216 | return 2; |
198 | return 2; |
217 | |
199 | |
218 | if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) |
200 | if (!strcmp(cp,"unlocked") && !QUERY_FLAG(op, FLAG_INV_LOCKED)) |
219 | return 2; |
201 | return 2; |
220 | |
202 | |
221 | /* Allow for things like '100 arrows' */ |
203 | /* Allow for things like '100 arrows' */ |
222 | if ((count=atoi(cp))!=0) { |
204 | if ((count=atoi(cp))!=0) { |
223 | cp=strchr(cp, ' '); |
205 | cp=strchr(cp, ' '); |
224 | while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ |
206 | while (cp && cp[0]==' ') ++cp; /* get rid of spaces */ |
225 | } |
207 | } |
226 | else { |
208 | else { |
227 | if (pl->type==PLAYER) |
209 | if (pl->type==PLAYER) |
228 | count=pl->contr->count; |
210 | count=pl->contr->count; |
229 | else |
211 | else |
230 | count = 0; |
212 | count = 0; |
231 | } |
213 | } |
232 | |
214 | |
233 | if (!cp || cp[0]=='\0' || count<0) return 0; |
215 | if (!cp || cp[0]=='\0' || count<0) return 0; |
234 | |
216 | |
235 | |
217 | |
236 | /* The code here should go from highest retval to lowest. That |
218 | /* The code here should go from highest retval to lowest. That |
237 | * is because of the 'else' handling - we don't want to match on |
219 | * is because of the 'else' handling - we don't want to match on |
238 | * something and set a low retval, even though it may match a higher retcal |
220 | * something and set a low retval, even though it may match a higher retcal |
239 | * later. So keep it in descending order here, so we try for the best |
221 | * later. So keep it in descending order here, so we try for the best |
240 | * match first, and work downward. |
222 | * match first, and work downward. |
241 | */ |
223 | */ |
242 | if (!strcasecmp(cp,query_name(op))) retval=20; |
224 | if (!strcasecmp(cp,query_name(op))) retval=20; |
243 | else if (!strcasecmp(cp,query_short_name(op))) retval=18; |
225 | else if (!strcasecmp(cp,query_short_name(op))) retval=18; |
244 | else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; |
226 | else if (!strcasecmp(cp,query_base_name(op,0))) retval=16; |
245 | else if (!strcasecmp(cp,query_base_name(op,1))) retval=16; |
227 | else if (!strcasecmp(cp,query_base_name(op,1))) retval=16; |
246 | else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15; |
228 | else if (op->custom_name && !strcasecmp(cp,op->custom_name)) retval=15; |
247 | else if (!strncasecmp(cp,query_base_name(op,0), |
229 | else if (!strncasecmp(cp,query_base_name(op,0), |
248 | strlen(cp))) retval=14; |
230 | strlen(cp))) retval=14; |
249 | else if (!strncasecmp(cp,query_base_name(op,1), |
231 | else if (!strncasecmp(cp,query_base_name(op,1), |
250 | strlen(cp))) retval=14; |
232 | strlen(cp))) retval=14; |
251 | |
233 | |
252 | /* Do substring checks, so things like 'Str+1' will match. |
234 | /* Do substring checks, so things like 'Str+1' will match. |
253 | * retval of these should perhaps be lower - they are lower |
235 | * retval of these should perhaps be lower - they are lower |
254 | * then the specific strcasecmp aboves, but still higher than |
236 | * then the specific strcasecmp aboves, but still higher than |
255 | * some other match criteria. |
237 | * some other match criteria. |
256 | */ |
238 | */ |
257 | else if (strstr(query_base_name(op,1), cp)) retval = 12; |
239 | else if (strstr(query_base_name(op,1), cp)) retval = 12; |
258 | else if (strstr(query_base_name(op,0), cp)) retval = 12; |
240 | else if (strstr(query_base_name(op,0), cp)) retval = 12; |
259 | else if (strstr(query_short_name(op), cp)) retval = 12; |
241 | else if (strstr(query_short_name(op), cp)) retval = 12; |
260 | |
242 | |
261 | /* Check against plural/non plural based on count. */ |
243 | /* Check against plural/non plural based on count. */ |
262 | else if (count>1 && !strcasecmp(cp,op->name_pl)) { |
244 | else if (count>1 && !strcasecmp(cp,op->name_pl)) { |
263 | retval=6; |
245 | retval=6; |
264 | } |
246 | } |
265 | else if (count==1 && !strcasecmp(op->name,cp)) { |
247 | else if (count==1 && !strcasecmp(op->name,cp)) { |
266 | retval=6; |
248 | retval=6; |
267 | } |
249 | } |
268 | /* base name matched - not bad */ |
250 | /* base name matched - not bad */ |
269 | else if (strcasecmp(cp,op->name)==0 && !count) retval=4; |
251 | else if (strcasecmp(cp,op->name)==0 && !count) retval=4; |
270 | /* Check for partial custom name, but give a real low priority */ |
252 | /* Check for partial custom name, but give a real low priority */ |
271 | else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3; |
253 | else if (op->custom_name && strstr(op->custom_name, cp)) retval = 3; |
272 | |
254 | |
273 | if (retval) { |
255 | if (retval) { |
274 | if (pl->type == PLAYER) |
256 | if (pl->type == PLAYER) |
275 | pl->contr->count=count; |
257 | pl->contr->count=count; |
276 | return retval; |
258 | return retval; |
277 | } |
259 | } |
278 | } |
260 | } |
279 | return 0; |
261 | return 0; |
280 | } |
262 | } |
281 | |
263 | |
282 | /* |
264 | /* |
… | |
… | |
351 | { |
333 | { |
352 | archetype *at, *next; |
334 | archetype *at, *next; |
353 | int i=0,f=0; |
335 | int i=0,f=0; |
354 | |
336 | |
355 | for (at=first_archetype; at!=NULL; at=next) { |
337 | for (at=first_archetype; at!=NULL; at=next) { |
356 | if (at->more) next=at->more; |
338 | if (at->more) next=at->more; |
357 | else next=at->next; |
339 | else next=at->next; |
358 | if (at->name) free_string(at->name); |
340 | if (at->name) free_string(at->name); |
359 | if (at->clone.name) free_string(at->clone.name); |
341 | if (at->clone.name) free_string(at->clone.name); |
360 | if (at->clone.name_pl) free_string(at->clone.name_pl); |
342 | if (at->clone.name_pl) free_string(at->clone.name_pl); |
361 | if (at->clone.title) free_string(at->clone.title); |
343 | if (at->clone.title) free_string(at->clone.title); |
362 | if (at->clone.race) free_string(at->clone.race); |
344 | if (at->clone.race) free_string(at->clone.race); |
363 | if (at->clone.slaying) free_string(at->clone.slaying); |
345 | if (at->clone.slaying) free_string(at->clone.slaying); |
364 | if (at->clone.msg) free_string(at->clone.msg); |
346 | if (at->clone.msg) free_string(at->clone.msg); |
365 | free(at); |
347 | free(at); |
366 | i++; |
348 | i++; |
367 | } |
349 | } |
368 | LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f); |
350 | LOG(llevDebug,"Freed %d archetypes, %d faces\n", i, f); |
369 | } |
351 | } |
370 | |
352 | |
371 | /* |
353 | /* |
… | |
… | |
397 | |
379 | |
398 | /* |
380 | /* |
399 | * Reads/parses the archetype-file, and copies into a linked list |
381 | * Reads/parses the archetype-file, and copies into a linked list |
400 | * of archetype-structures. |
382 | * of archetype-structures. |
401 | */ |
383 | */ |
402 | void first_arch_pass(FILE *fp) { |
384 | void first_arch_pass(object_thawer &fp) { |
403 | object *op; |
385 | object *op; |
404 | archetype *at,*head=NULL,*last_more=NULL; |
386 | archetype *at,*head=NULL,*last_more=NULL; |
405 | int i,first=2; |
387 | int i,first=2; |
406 | |
388 | |
407 | op=get_object(); |
389 | op=get_object(); |
408 | op->arch=first_archetype=at=get_archetype_struct(); |
390 | op->arch=first_archetype=at=get_archetype_struct(); |
409 | |
391 | |
410 | while((i=load_object(fp,op,first,0))) { |
392 | while((i=load_object(fp,op,first,0))) { |
411 | first=0; |
393 | first=0; |
412 | copy_object(op,&at->clone); |
394 | copy_object(op,&at->clone); |
413 | at->clone.speed_left= (float) (-0.1); |
395 | at->clone.speed_left= (float) (-0.1); |
414 | /* copy the body_info to the body_used - this is only really |
396 | /* copy the body_info to the body_used - this is only really |
415 | * need for monsters, but doesn't hurt to do it for everything. |
397 | * need for monsters, but doesn't hurt to do it for everything. |
416 | * by doing so, when a monster is created, it has good starting |
398 | * by doing so, when a monster is created, it has good starting |
417 | * values for the body_used info, so when items are created |
399 | * values for the body_used info, so when items are created |
418 | * for it, they can be properly equipped. |
400 | * for it, they can be properly equipped. |
419 | */ |
401 | */ |
420 | memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info)); |
402 | memcpy(&at->clone.body_used, &op->body_info, sizeof(op->body_info)); |
421 | |
403 | |
422 | switch(i) { |
404 | switch(i) { |
423 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
405 | case LL_NORMAL: /* A new archetype, just link it with the previous */ |
424 | if(last_more!=NULL) |
406 | if(last_more!=NULL) |
425 | last_more->next=at; |
407 | last_more->next=at; |
426 | if(head!=NULL) |
408 | if(head!=NULL) |
427 | head->next=at; |
409 | head->next=at; |
428 | head=last_more=at; |
410 | head=last_more=at; |
429 | #if 0 |
411 | #if 0 |
430 | if(!op->type) |
412 | if(!op->type) |
431 | LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name); |
413 | LOG(llevDebug," WARNING: Archetype %s has no type info!\n", op->arch->name); |
432 | #endif |
414 | #endif |
433 | at->tail_x = 0; |
415 | at->tail_x = 0; |
434 | at->tail_y = 0; |
416 | at->tail_y = 0; |
435 | break; |
417 | break; |
436 | |
418 | |
437 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
419 | case LL_MORE: /* Another part of the previous archetype, link it correctly */ |
438 | |
420 | |
439 | at->head=head; |
421 | at->head=head; |
440 | at->clone.head = &head->clone; |
422 | at->clone.head = &head->clone; |
441 | if(last_more!=NULL) { |
423 | if(last_more!=NULL) { |
442 | last_more->more=at; |
424 | last_more->more=at; |
443 | last_more->clone.more = &at->clone; |
425 | last_more->clone.more = &at->clone; |
444 | } |
426 | } |
445 | last_more=at; |
427 | last_more=at; |
446 | |
428 | |
447 | /* If this multipart image is still composed of individual small |
429 | /* If this multipart image is still composed of individual small |
448 | * images, don't set the tail_.. values. We can't use them anyways, |
430 | * images, don't set the tail_.. values. We can't use them anyways, |
449 | * and setting these to zero makes the map sending to the client much |
431 | * and setting these to zero makes the map sending to the client much |
450 | * easier as just looking at the head, we know what to do. |
432 | * easier as just looking at the head, we know what to do. |
451 | */ |
433 | */ |
452 | if (at->clone.face != head->clone.face) { |
434 | if (at->clone.face != head->clone.face) { |
453 | head->tail_x = 0; |
435 | head->tail_x = 0; |
454 | head->tail_y = 0; |
436 | head->tail_y = 0; |
455 | } else { |
437 | } else { |
456 | if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; |
438 | if (at->clone.x > head->tail_x) head->tail_x = at->clone.x; |
457 | if (at->clone.y > head->tail_y) head->tail_y = at->clone.y; |
439 | if (at->clone.y > head->tail_y) head->tail_y = at->clone.y; |
458 | } |
440 | } |
459 | break; |
441 | break; |
460 | |
442 | |
461 | } |
443 | } |
462 | |
444 | |
463 | at=get_archetype_struct(); |
445 | at=get_archetype_struct(); |
464 | clear_object(op); |
446 | clear_object(op); |
465 | op->arch=at; |
447 | op->arch=at; |
466 | } |
448 | } |
467 | free(at); |
449 | free(at); |
468 | free_object(op); |
450 | free_object(op); |
469 | } |
451 | } |
470 | |
452 | |
471 | /* |
453 | /* |
472 | * Reads the archetype file once more, and links all pointers between |
454 | * Reads the archetype file once more, and links all pointers between |
473 | * archetypes. |
455 | * archetypes. |
474 | */ |
456 | */ |
475 | |
457 | |
476 | void second_arch_pass(FILE *fp) { |
458 | void second_arch_pass(object_thawer &thawer) { |
477 | char buf[MAX_BUF],*variable=buf,*argument,*cp; |
459 | char buf[MAX_BUF],*variable=buf,*argument,*cp; |
478 | archetype *at=NULL,*other; |
460 | archetype *at=NULL,*other; |
479 | |
461 | |
480 | while(fgets(buf,MAX_BUF,fp)!=NULL) { |
462 | while(fgets(buf,MAX_BUF,thawer)!=NULL) { |
481 | if(*buf=='#') |
463 | if(*buf=='#') |
482 | continue; |
464 | continue; |
483 | if((argument=strchr(buf,' '))!=NULL) { |
465 | if((argument=strchr(buf,' '))!=NULL) { |
484 | *argument='\0',argument++; |
466 | *argument='\0',argument++; |
485 | cp = argument + strlen(argument)-1; |
467 | cp = argument + strlen(argument)-1; |
486 | while (isspace(*cp)) { |
468 | while (isspace(*cp)) { |
487 | *cp='\0'; |
469 | *cp='\0'; |
488 | cp--; |
470 | cp--; |
489 | } |
471 | } |
490 | } |
472 | } |
491 | if(!strcmp("Object",variable)) { |
473 | if(!strcmp("Object",variable)) { |
492 | if((at=find_archetype(argument))==NULL) |
474 | if((at=find_archetype(argument))==NULL) |
493 | LOG(llevError,"Warning: failed to find arch %s\n",argument); |
475 | LOG(llevError,"Warning: failed to find arch %s\n",argument); |
494 | } else if(!strcmp("other_arch",variable)) { |
476 | } else if(!strcmp("other_arch",variable)) { |
… | |
… | |
525 | * Reads and parses the archetype file (with the first and second-pass |
507 | * Reads and parses the archetype file (with the first and second-pass |
526 | * functions). |
508 | * functions). |
527 | * Then initialises treasures by calling load_treasures(). |
509 | * Then initialises treasures by calling load_treasures(). |
528 | */ |
510 | */ |
529 | |
511 | |
|
|
512 | void |
530 | void load_archetypes(void) { |
513 | load_archetypes (void) |
531 | FILE *fp; |
514 | { |
532 | char filename[MAX_BUF]; |
515 | char filename[MAX_BUF]; |
533 | int comp; |
516 | int comp; |
534 | #if TIME_ARCH_LOAD |
517 | #if TIME_ARCH_LOAD |
535 | struct timeval tv1,tv2; |
518 | struct timeval tv1, tv2; |
536 | #endif |
519 | #endif |
537 | |
520 | |
538 | sprintf(filename,"%s/%s",settings.datadir,settings.archetypes); |
521 | sprintf (filename, "%s/%s", settings.datadir, settings.archetypes); |
539 | LOG(llevDebug,"Reading archetypes from %s...\n",filename); |
522 | LOG (llevDebug, "Reading archetypes from %s:\n", filename); |
540 | if((fp=open_and_uncompress(filename,0,&comp))==NULL) { |
523 | |
541 | LOG(llevError," Can't open archetype file.\n"); |
524 | { |
542 | return; |
525 | object_thawer thawer (filename); |
543 | } |
526 | |
544 | clear_archetable(); |
527 | clear_archetable (); |
545 | LOG(llevDebug," arch-pass 1...\n"); |
528 | LOG (llevDebug, " arch-pass 1...\n"); |
546 | #if TIME_ARCH_LOAD |
529 | first_arch_pass (thawer); |
547 | GETTIMEOFDAY(&tv1); |
530 | LOG (llevDebug, " done\n"); |
|
|
531 | |
|
|
532 | init_archetable (); |
|
|
533 | warn_archetypes = 1; |
|
|
534 | } |
|
|
535 | |
|
|
536 | { |
|
|
537 | object_thawer thawer (filename); |
|
|
538 | |
|
|
539 | LOG (llevDebug, " loading treasure...\n"); |
|
|
540 | load_treasures (); |
|
|
541 | LOG (llevDebug, " done\n arch-pass 2...\n"); |
|
|
542 | second_arch_pass (thawer); |
|
|
543 | LOG (llevDebug, " done\n"); |
|
|
544 | #ifdef DEBUG |
|
|
545 | check_generators (); |
548 | #endif |
546 | #endif |
549 | first_arch_pass(fp); |
547 | } |
550 | #if TIME_ARCH_LOAD |
|
|
551 | { int sec, usec; |
|
|
552 | GETTIMEOFDAY(&tv2); |
|
|
553 | sec = tv2.tv_sec - tv1.tv_sec; |
|
|
554 | usec = tv2.tv_usec - tv1.tv_usec; |
|
|
555 | if (usec<0) { usec +=1000000; sec--;} |
|
|
556 | LOG(llevDebug,"Load took %d.%06d seconds\n", sec, usec); |
|
|
557 | } |
|
|
558 | #endif |
|
|
559 | |
|
|
560 | LOG(llevDebug," done\n"); |
548 | LOG (llevDebug, " done\n"); |
561 | init_archetable(); |
|
|
562 | warn_archetypes=1; |
|
|
563 | |
|
|
564 | /* do a close and reopen instead of a rewind - necessary in case the |
|
|
565 | * file has been compressed. |
|
|
566 | */ |
|
|
567 | close_and_delete(fp, comp); |
|
|
568 | fp=open_and_uncompress(filename,0,&comp); |
|
|
569 | |
|
|
570 | LOG(llevDebug," loading treasure...\n"); |
|
|
571 | load_treasures(); |
|
|
572 | LOG(llevDebug," done\n arch-pass 2...\n"); |
|
|
573 | second_arch_pass(fp); |
|
|
574 | LOG(llevDebug," done\n"); |
|
|
575 | #ifdef DEBUG |
|
|
576 | check_generators(); |
|
|
577 | #endif |
|
|
578 | close_and_delete(fp, comp); |
|
|
579 | LOG(llevDebug," done\n"); |
|
|
580 | } |
549 | } |
581 | |
550 | |
582 | /* |
551 | /* |
583 | * Creates and returns a new object which is a copy of the given archetype. |
552 | * Creates and returns a new object which is a copy of the given archetype. |
584 | * This function returns NULL on failure. |
553 | * This function returns NULL on failure. |
… | |
… | |
730 | LOG(llevError,"Can't clone archetype %d\n",type); |
699 | LOG(llevError,"Can't clone archetype %d\n",type); |
731 | free_object(op); |
700 | free_object(op); |
732 | return NULL; |
701 | return NULL; |
733 | } |
702 | } |
734 | copy_object(&at->clone,op); |
703 | copy_object(&at->clone,op); |
|
|
704 | op->instantiate (); |
735 | return op; |
705 | return op; |
736 | } |
706 | } |
737 | |
707 | |
738 | /* |
708 | /* |
739 | * member: make instance from class |
709 | * member: make instance from class |