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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:00 2006 UTC vs.
Revision 1.23 by root, Sun Sep 10 14:54:02 2006 UTC

1/* 1/*
2 * static char *rcsid_object_c = 2 * static char *rcsid_object_c =
3 * "$Id: object.C,v 1.1 2006/08/13 17:16:00 elmex Exp $"; 3 * "$Id: object.C,v 1.23 2006/09/10 14:54:02 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
… …
37#endif /* win32 */ 37#endif /* win32 */
38#include <object.h> 38#include <object.h>
39#include <funcpoint.h> 39#include <funcpoint.h>
40#include <skills.h> 40#include <skills.h>
41#include <loader.h> 41#include <loader.h>
42#ifdef MEMORY_DEBUG
43int nroffreeobjects = 0;
44int nrofallocobjects = 0; 42int nrofallocobjects = 0;
45#undef OBJ_EXPAND
46#define OBJ_EXPAND 1
47#else
48object objarray[STARTMAX]; /* All objects, allocated this way at first */
49int nroffreeobjects = STARTMAX; /* How many OBs allocated and free (free) */
50int nrofallocobjects = STARTMAX; /* How many OBs allocated (free + used) */
51#endif
52 43
53object *objects; /* Pointer to the list of used objects */ 44object *objects; /* Pointer to the list of used objects */
54object *free_objects; /* Pointer to the list of unused objects */
55object *active_objects; /* List of active objects that need to be processed */ 45object *active_objects; /* List of active objects that need to be processed */
56
57void (*object_free_callback)(object *ob);
58 46
59short freearr_x[SIZEOFFREE]= 47short freearr_x[SIZEOFFREE]=
60 {0,0,1,1,1,0,-1,-1,-1,0,1,2,2,2,2,2,1,0,-1,-2,-2,-2,-2,-2,-1, 48 {0,0,1,1,1,0,-1,-1,-1,0,1,2,2,2,2,2,1,0,-1,-2,-2,-2,-2,-2,-1,
61 0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3,-3,-3,-3,-3,-2,-1}; 49 0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3,-3,-3,-3,-3,-2,-1};
62short freearr_y[SIZEOFFREE]= 50short freearr_y[SIZEOFFREE]=
… …
66 {0,9,10,13,14,17,18,21,22,25,26,27,30,31,32,33,36,37,39,39,42,43,44,45, 54 {0,9,10,13,14,17,18,21,22,25,26,27,30,31,32,33,36,37,39,39,42,43,44,45,
67 48,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49}; 55 48,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49,49};
68int freedir[SIZEOFFREE]= { 56int freedir[SIZEOFFREE]= {
69 0,1,2,3,4,5,6,7,8,1,2,2,2,3,4,4,4,5,6,6,6,7,8,8,8, 57 0,1,2,3,4,5,6,7,8,1,2,2,2,3,4,4,4,5,6,6,6,7,8,8,8,
70 1,2,2,2,2,2,3,4,4,4,4,4,5,6,6,6,6,6,7,8,8,8,8,8}; 58 1,2,2,2,2,2,3,4,4,4,4,4,5,6,6,6,6,6,7,8,8,8,8,8};
71
72 59
73/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 60/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
74static int compare_ob_value_lists_one(const object * wants, const object * has) { 61static int compare_ob_value_lists_one(const object * wants, const object * has) {
75 key_value * wants_field; 62 key_value * wants_field;
76 63
… …
123 * 110 *
124 * Improvements made with merge: Better checking on potion, and also 111 * Improvements made with merge: Better checking on potion, and also
125 * check weight 112 * check weight
126 */ 113 */
127 114
128int CAN_MERGE(object *ob1, object *ob2) { 115bool
129 116object::can_merge (object *ob1, object *ob2)
117{
130 /* A couple quicksanity checks */ 118 /* A couple quicksanity checks */
131 if ((ob1 == ob2) || (ob1->type != ob2->type)) return 0; 119 if ((ob1 == ob2) || (ob1->type != ob2->type))
120 return 0;
132 121
133 if (ob1->speed != ob2->speed) return 0; 122 if (ob1->speed != ob2->speed)
134 /* Note sure why the following is the case - either the object has to 123 return 0;
135 * be animated or have a very low speed. Is this an attempted monster 124
136 * check? 125 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that
126 * value could not be stored in a sint32 (which unfortunately sometimes is
127 * used to store nrof).
137 */ 128 */
138 if (!QUERY_FLAG(ob1,FLAG_ANIMATE) && FABS((ob1)->speed) > MIN_ACTIVE_SPEED) 129 if (ob1->nrof + ob2->nrof >= 1UL << 31)
130 return 0;
131
132 /* If the objects have been identified, set the BEEN_APPLIED flag.
133 * This is to the comparison of the flags below will be OK. We
134 * just can't ignore the been applied or identified flags, as they
135 * are not equal - just if it has been identified, the been_applied
136 * flags lose any meaning.
137 */
138 if (QUERY_FLAG (ob1, FLAG_IDENTIFIED))
139 SET_FLAG (ob1, FLAG_BEEN_APPLIED);
140
141 if (QUERY_FLAG (ob2, FLAG_IDENTIFIED))
142 SET_FLAG (ob2, FLAG_BEEN_APPLIED);
143
144
145 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
146 * being locked in inventory should prevent merging.
147 * 0x4 in flags3 is CLIENT_SENT
148 */
149 if ((ob1->arch != ob2->arch) ||
150 (ob1->flags[0] != ob2->flags[0]) ||
151 (ob1->flags[1] != ob2->flags[1]) ||
152 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~0x400000)) ||
153 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
154 (ob1->name != ob2->name) ||
155 (ob1->title != ob2->title) ||
156 (ob1->msg != ob2->msg) ||
157 (ob1->weight != ob2->weight) ||
158 (memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) != 0) ||
159 (memcmp (&ob1->stats, &ob2->stats, sizeof (ob1->stats)) != 0) ||
160 (ob1->attacktype != ob2->attacktype) ||
161 (ob1->magic != ob2->magic) ||
162 (ob1->slaying != ob2->slaying) ||
163 (ob1->skill != ob2->skill) ||
164 (ob1->value != ob2->value) ||
165 (ob1->animation_id != ob2->animation_id) ||
166 (ob1->client_type != ob2->client_type) ||
167 (ob1->materialname != ob2->materialname) ||
168 (ob1->lore != ob2->lore) ||
169 (ob1->subtype != ob2->subtype) ||
170 (ob1->move_type != ob2->move_type) ||
171 (ob1->move_block != ob2->move_block) ||
172 (ob1->move_allow != ob2->move_allow) ||
173 (ob1->move_on != ob2->move_on) ||
174 (ob1->move_off != ob2->move_off) ||
175 (ob1->move_slow != ob2->move_slow) ||
176 (ob1->move_slow_penalty != ob2->move_slow_penalty))
177 return 0;
178
179 /* This is really a spellbook check - really, we should
180 * check all objects in the inventory.
181 */
182 if (ob1->inv || ob2->inv)
183 {
184 /* if one object has inventory but the other doesn't, not equiv */
185 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
139 return 0; 186 return 0;
140 187
141 /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that 188 /* Now check to see if the two inventory objects could merge */
142 * value could not be stored in a sint32 (which unfortunately sometimes is 189 if (!CAN_MERGE (ob1->inv, ob2->inv))
143 * used to store nrof).
144 */
145 if (ob1->nrof+ob2->nrof >= 1UL<<31)
146 return 0; 190 return 0;
147 191
148 /* This is really a spellbook check - really, we should
149 * check all objects in the inventory.
150 */
151 if (ob1->inv || ob2->inv) {
152 /* if one object has inventory but the other doesn't, not equiv */
153 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) return 0;
154
155 /* Now check to see if the two inventory objects could merge */
156 if (!CAN_MERGE(ob1->inv, ob2->inv)) return 0;
157
158 /* inventory ok - still need to check rest of this object to see 192 /* inventory ok - still need to check rest of this object to see
159 * if it is valid. 193 * if it is valid.
160 */
161 }
162
163 /* If the objects have been identified, set the BEEN_APPLIED flag.
164 * This is to the comparison of the flags below will be OK. We
165 * just can't ignore the been applied or identified flags, as they
166 * are not equal - just if it has been identified, the been_applied
167 * flags lose any meaning.
168 */ 194 */
169 if (QUERY_FLAG(ob1, FLAG_IDENTIFIED)) 195 }
170 SET_FLAG(ob1, FLAG_BEEN_APPLIED);
171 196
172 if (QUERY_FLAG(ob2, FLAG_IDENTIFIED))
173 SET_FLAG(ob2, FLAG_BEEN_APPLIED);
174
175
176 /* the 0x400000 on flags2 is FLAG_INV_LOCK. I don't think something
177 * being locked in inventory should prevent merging.
178 * 0x4 in flags3 is CLIENT_SENT
179 */
180 if ((ob1->arch != ob2->arch) ||
181 (ob1->flags[0] != ob2->flags[0]) ||
182 (ob1->flags[1] != ob2->flags[1]) ||
183 ((ob1->flags[2] & ~0x400000) != (ob2->flags[2] & ~ 0x400000)) ||
184 ((ob1->flags[3] & ~0x4) != (ob2->flags[3] & ~0x4)) ||
185 (ob1->name != ob2->name) ||
186 (ob1->title != ob2->title) ||
187 (ob1->msg != ob2->msg) ||
188 (ob1->weight != ob2->weight) ||
189 (memcmp(&ob1->resist, &ob2->resist, sizeof(ob1->resist))!=0) ||
190 (memcmp(&ob1->stats, &ob2->stats, sizeof(ob1->stats))!=0) ||
191 (ob1->attacktype != ob2->attacktype) ||
192 (ob1->magic != ob2->magic) ||
193 (ob1->slaying != ob2->slaying) ||
194 (ob1->skill != ob2->skill) ||
195 (ob1->value != ob2->value) ||
196 (ob1->animation_id != ob2->animation_id) ||
197 (ob1->client_type != ob2->client_type) ||
198 (ob1->materialname != ob2->materialname) ||
199 (ob1->lore != ob2->lore) ||
200 (ob1->subtype != ob2->subtype) ||
201 (ob1->move_type != ob2->move_type) ||
202 (ob1->move_block != ob2->move_block) ||
203 (ob1->move_allow != ob2->move_allow) ||
204 (ob1->move_on != ob2->move_on) ||
205 (ob1->move_off != ob2->move_off) ||
206 (ob1->move_slow != ob2->move_slow) ||
207 (ob1->move_slow_penalty != ob2->move_slow_penalty)
208 )
209 return 0;
210
211 /* Don't merge objects that are applied. With the new 'body' code, 197 /* Don't merge objects that are applied. With the new 'body' code,
212 * it is possible for most any character to have more than one of 198 * it is possible for most any character to have more than one of
213 * some items equipped, and we don't want those to merge. 199 * some items equipped, and we don't want those to merge.
214 */ 200 */
215 if (QUERY_FLAG(ob1, FLAG_APPLIED) || QUERY_FLAG(ob2, FLAG_APPLIED)) 201 if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED))
202 return 0;
203
204 /* Note sure why the following is the case - either the object has to
205 * be animated or have a very low speed. Is this an attempted monster
206 * check?
207 */
208 if (!QUERY_FLAG (ob1, FLAG_ANIMATE)
209 && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
210 return 0;
211
212 switch (ob1->type)
213 {
214 case SCROLL:
215 if (ob1->level != ob2->level)
216 return 0; 216 return 0;
217
218 switch (ob1->type) {
219 case SCROLL:
220 if (ob1->level != ob2->level) return 0;
221 break; 217 break;
222
223 } 218 }
219
224 if (ob1->key_values != NULL || ob2->key_values != NULL) { 220 if (ob1->key_values != NULL || ob2->key_values != NULL)
221 {
225 /* At least one of these has key_values. */ 222 /* At least one of these has key_values. */
226 if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) { 223 if ((ob1->key_values == NULL) != (ob2->key_values == NULL))
227 /* One has fields, but the other one doesn't. */ 224 /* One has fields, but the other one doesn't. */
228 return 0; 225 return 0;
229 } else if (!compare_ob_value_lists(ob1, ob2)) { 226 else if (!compare_ob_value_lists (ob1, ob2))
230 return 0; 227 return 0;
231 } 228 }
229
230 //TODO: generate an event or call into perl for additional checks
231 if (ob1->self || ob2->self)
232 } 232 {
233 ob1->optimise ();
234 ob2->optimise ();
233 235
236 if (ob1->self || ob2->self)
237 return 0;
238 }
239
234 /* Everything passes, must be OK. */ 240 /* Everything passes, must be OK. */
235 return 1; 241 return 1;
236} 242}
237
238/* 243/*
239 * sum_weight() is a recursive function which calculates the weight 244 * sum_weight() is a recursive function which calculates the weight
240 * an object is carrying. It goes through in figures out how much 245 * an object is carrying. It goes through in figures out how much
241 * containers are carrying, and sums it up. 246 * containers are carrying, and sums it up.
242 */ 247 */
243signed long sum_weight(object *op) { 248signed long sum_weight(object *op) {
244 signed long sum; 249 signed long sum;
245 object *inv; 250 object *inv;
246 for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) { 251 for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) {
247 if (inv->inv) 252 if (inv->inv)
248 sum_weight(inv); 253 sum_weight(inv);
249 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 254 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
250 } 255 }
251 if (op->type == CONTAINER && op->stats.Str) 256 if (op->type == CONTAINER && op->stats.Str)
252 sum = (sum * (100 - op->stats.Str))/100; 257 sum = (sum * (100 - op->stats.Str))/100;
253 if(op->carrying != sum) 258 if(op->carrying != sum)
… …
272 */ 277 */
273 278
274object *is_player_inv (object *op) { 279object *is_player_inv (object *op) {
275 for (;op!=NULL&&op->type!=PLAYER; op=op->env) 280 for (;op!=NULL&&op->type!=PLAYER; op=op->env)
276 if (op->env==op) 281 if (op->env==op)
277 op->env = NULL; 282 op->env = NULL;
278 return op; 283 return op;
279} 284}
280 285
281/* 286/*
282 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 287 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
283 * Some error messages. 288 * Some error messages.
284 * The result of the dump is stored in the static global errmsg array. 289 * The result of the dump is stored in the static global errmsg array.
285 */ 290 */
286 291
287void dump_object2(object *op) { 292void dump_object2(object *op) {
293errmsg[0] = 0;
294return;
295 //TODO//D#d#
296#if 0
288 char *cp; 297 char *cp;
289/* object *tmp;*/ 298/* object *tmp;*/
290 299
291 if(op->arch!=NULL) { 300 if(op->arch!=NULL) {
292 strcat(errmsg,"arch "); 301 strcat(errmsg,"arch ");
293 strcat(errmsg,op->arch->name?op->arch->name:"(null)"); 302 strcat(errmsg,op->arch->name?op->arch->name:"(null)");
294 strcat(errmsg,"\n"); 303 strcat(errmsg,"\n");
295 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL) 304 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
296 strcat(errmsg,cp); 305 strcat(errmsg,cp);
297#if 0 306#if 0
298 /* Don't dump player diffs - they are too long, mostly meaningless, and 307 /* Don't dump player diffs - they are too long, mostly meaningless, and
299 * will overflow the buffer. 308 * will overflow the buffer.
300 * Changed so that we don't dump inventory either. This may 309 * Changed so that we don't dump inventory either. This may
301 * also overflow the buffer. 310 * also overflow the buffer.
… …
317 for (tmp=op->inv; tmp; tmp=tmp->below) 326 for (tmp=op->inv; tmp; tmp=tmp->below)
318 dump_object2(tmp); 327 dump_object2(tmp);
319#endif 328#endif
320 strcat(errmsg,"end\n"); 329 strcat(errmsg,"end\n");
321 } 330 }
331#endif
322} 332}
323 333
324/* 334/*
325 * Dumps an object. Returns output in the static global errmsg array. 335 * Dumps an object. Returns output in the static global errmsg array.
326 */ 336 */
… …
331 return; 341 return;
332 } 342 }
333 errmsg[0]='\0'; 343 errmsg[0]='\0';
334 dump_object2(op); 344 dump_object2(op);
335} 345}
336
337/* GROS - Dumps an object. Return the result into a string */
338/* Note that no checking is done for the validity of the target string, so */
339/* you need to be sure that you allocated enough space for it. */
340void dump_me(object *op, char *outstr)
341{
342 char *cp;
343
344 if(op==NULL)
345 {
346 strcpy(outstr,"[NULL pointer]");
347 return;
348 }
349 outstr[0]='\0';
350
351 if(op->arch!=NULL)
352 {
353 strcat(outstr,"arch ");
354 strcat(outstr,op->arch->name?op->arch->name:"(null)");
355 strcat(outstr,"\n");
356 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
357 strcat(outstr,cp);
358 strcat(outstr,"end\n");
359 }
360 else
361 {
362 strcat(outstr,"Object ");
363 if (op->name==NULL)
364 strcat(outstr, "(null)");
365 else
366 strcat(outstr,op->name);
367 strcat(outstr,"\n");
368 strcat(outstr,"end\n");
369 }
370}
371
372/*
373 * This is really verbose...Can be triggered by the P key while in DM mode.
374 * All objects are dumped to stderr (or alternate logfile, if in server-mode)
375 */
376 346
377void dump_all_objects(void) { 347void dump_all_objects(void) {
378 object *op; 348 object *op;
379 for(op=objects;op!=NULL;op=op->next) { 349 for(op=objects;op!=NULL;op=op->next) {
380 dump_object(op); 350 dump_object(op);
… …
416 * Used only by the patch command, but not all that useful. 386 * Used only by the patch command, but not all that useful.
417 * Enables features like "patch <name-of-other-player> food 999" 387 * Enables features like "patch <name-of-other-player> food 999"
418 */ 388 */
419 389
420object *find_object_name(const char *str) { 390object *find_object_name(const char *str) {
421 const char *name=add_string(str); 391 const char *name = shstr::find (str);
422 object *op; 392 object *op;
423 for(op=objects;op!=NULL;op=op->next) 393 for(op=objects;op!=NULL;op=op->next)
424 if(op->name==name) 394 if(&op->name == name)
425 break; 395 break;
426 free_string(name); 396
427 return op; 397 return op;
428} 398}
429 399
430void free_all_object_data(void) { 400void free_all_object_data ()
431#ifdef MEMORY_DEBUG 401{
432 object *op, *next; 402 LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
433
434 for (op=free_objects; op!=NULL; ) {
435 next=op->next;
436 free(op);
437 nrofallocobjects--;
438 nroffreeobjects--;
439 op=next;
440 }
441#endif
442 LOG(llevDebug,"%d allocated objects, %d free objects, STARMAX=%d\n",
443 nrofallocobjects, nroffreeobjects,STARTMAX);
444} 403}
445 404
446/* 405/*
447 * Returns the object which this object marks as being the owner. 406 * Returns the object which this object marks as being the owner.
448 * A id-scheme is used to avoid pointing to objects which have been 407 * A id-scheme is used to avoid pointing to objects which have been
… …
454 * anything - once an object is removed, it is basically dead anyways. 413 * anything - once an object is removed, it is basically dead anyways.
455 */ 414 */
456 415
457object *get_owner(object *op) { 416object *get_owner(object *op) {
458 if(op->owner==NULL) 417 if(op->owner==NULL)
459 return NULL; 418 return NULL;
460 419
461 if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) && 420 if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) &&
462 op->owner->count==op->ownercount) 421 op->owner->count==op->ownercount)
463 return op->owner; 422 return op->owner;
464 423
465 op->owner=NULL; 424 op->owner=NULL;
466 op->ownercount=0; 425 op->ownercount=0;
467 return NULL; 426 return NULL;
468} 427}
… …
470void clear_owner(object *op) 429void clear_owner(object *op)
471{ 430{
472 if (!op) return; 431 if (!op) return;
473 432
474 if (op->owner && op->ownercount == op->owner->count) 433 if (op->owner && op->ownercount == op->owner->count)
475 op->owner->refcount--; 434 op->owner->refcount--;
476 435
477 op->owner = NULL; 436 op->owner = NULL;
478 op->ownercount = 0; 437 op->ownercount = 0;
479} 438}
480 439
481
482
483/* 440/*
484 * Sets the owner and sets the skill and exp pointers to owner's current 441 * Sets the owner and sets the skill and exp pointers to owner's current
485 * skill and experience objects. 442 * skill and experience objects.
486 */ 443 */
487void set_owner (object *op, object *owner) 444void set_owner (object *op, object *owner)
488{ 445{
489 if(owner==NULL||op==NULL) 446 if(owner==NULL||op==NULL)
490 return; 447 return;
491 448
492 /* next line added to allow objects which own objects */ 449 /* next line added to allow objects which own objects */
493 /* Add a check for ownercounts in here, as I got into an endless loop 450 /* Add a check for ownercounts in here, as I got into an endless loop
494 * with the fireball owning a poison cloud which then owned the 451 * with the fireball owning a poison cloud which then owned the
495 * fireball. I believe that was caused by one of the objects getting 452 * fireball. I believe that was caused by one of the objects getting
496 * freed and then another object replacing it. Since the ownercounts 453 * freed and then another object replacing it. Since the ownercounts
497 * didn't match, this check is valid and I believe that cause is valid. 454 * didn't match, this check is valid and I believe that cause is valid.
498 */ 455 */
499 while (owner->owner && owner!=owner->owner && 456 while (owner->owner && owner!=owner->owner &&
500 owner->ownercount==owner->owner->count) owner=owner->owner; 457 owner->ownercount==owner->owner->count) owner=owner->owner;
501 458
502 /* IF the owner still has an owner, we did not resolve to a final owner. 459 /* IF the owner still has an owner, we did not resolve to a final owner.
503 * so lets not add to that. 460 * so lets not add to that.
504 */ 461 */
505 if (owner->owner) return; 462 if (owner->owner) return;
… …
523 */ 480 */
524void copy_owner (object *op, object *clone) 481void copy_owner (object *op, object *clone)
525{ 482{
526 object *owner = get_owner (clone); 483 object *owner = get_owner (clone);
527 if (owner == NULL) { 484 if (owner == NULL) {
528 /* players don't have owners - they own themselves. Update 485 /* players don't have owners - they own themselves. Update
529 * as appropriate. 486 * as appropriate.
530 */ 487 */
531 if (clone->type == PLAYER) owner=clone; 488 if (clone->type == PLAYER) owner=clone;
532 else return; 489 else return;
533 } 490 }
534 set_owner(op, owner); 491 set_owner(op, owner);
535 492
536}
537
538/*
539 * Resets vital variables in an object
540 */
541
542void reset_object(object *op) {
543
544 op->name = NULL;
545 op->name_pl = NULL;
546 op->title = NULL;
547 op->race = NULL;
548 op->slaying = NULL;
549 op->skill = NULL;
550 op->msg = NULL;
551 op->materialname = NULL;
552 op->lore = NULL;
553 op->current_weapon_script = NULL;
554 clear_object(op);
555} 493}
556 494
557/* Zero the key_values on op, decrementing the shared-string 495/* Zero the key_values on op, decrementing the shared-string
558 * refcounts and freeing the links. 496 * refcounts and freeing the links.
559 */ 497 */
560static void free_key_values(object * op) { 498static void free_key_values(object * op)
561 key_value * i; 499{
562 key_value * next = NULL; 500 for (key_value *i = op->key_values; i != 0; )
563 501 {
564 if (op->key_values == NULL) return; 502 key_value *next = i->next;
503 delete i;
504 i = next;
565 505 }
566 for (i = op->key_values; i != NULL; i = next) { 506
567 /* Store next *first*. */
568 next = i->next;
569
570 if (i->key) FREE_AND_CLEAR_STR(i->key);
571 if (i->value) FREE_AND_CLEAR_STR(i->value);
572 i->next = NULL;
573 free(i);
574 }
575
576 op->key_values = NULL; 507 op->key_values = 0;
577} 508}
578 509
510void object::clear ()
511{
512 attachable_base::clear ();
513
514 free_key_values (this);
515
516 name = 0;
517 name_pl = 0;
518 title = 0;
519 race = 0;
520 slaying = 0;
521 skill = 0;
522 msg = 0;
523 lore = 0;
524 custom_name = 0;
525 materialname = 0;
526
527 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
528
529 SET_FLAG (this, FLAG_REMOVED);
530}
531
532void object::clone (object *destination)
533{
534 *(object_copy *)destination = *this;
535 *(object_pod *)destination = *this;
536
537 if (self || cb)
538 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
539}
579 540
580/* 541/*
581 * clear_object() frees everything allocated by an object, and also 542 * clear_object() frees everything allocated by an object, and also
582 * clears all variables and flags to default settings. 543 * clears all variables and flags to default settings.
583 */ 544 */
584 545
585void clear_object(object *op) { 546void clear_object (object *op)
547{
548 op->clear ();
586 549
587 event *evt;
588 event *evt2;
589
590 /* redo this to be simpler/more efficient. Was also seeing
591 * crashes in the old code. Move this to the top - am
592 * seeing periodic crashes in this code, and would like to have
593 * as much info available as possible (eg, object name).
594 */
595 for (evt = op->events; evt; evt=evt2) {
596 evt2 = evt->next;
597
598 if (evt->hook != NULL) FREE_AND_CLEAR_STR(evt->hook);
599 if (evt->plugin != NULL) FREE_AND_CLEAR_STR(evt->plugin);
600 if (evt->options != NULL) FREE_AND_CLEAR_STR(evt->options);
601
602 free(evt);
603 }
604 op->events = NULL;
605
606 free_key_values(op);
607
608 /* the memset will clear all these values for us, but we need
609 * to reduce the refcount on them.
610 */
611 if (op->name!=NULL) FREE_AND_CLEAR_STR(op->name);
612 if (op->name_pl!=NULL) FREE_AND_CLEAR_STR(op->name_pl);
613 if (op->title != NULL) FREE_AND_CLEAR_STR(op->title);
614 if (op->race!=NULL) FREE_AND_CLEAR_STR(op->race);
615 if (op->slaying!=NULL) FREE_AND_CLEAR_STR(op->slaying);
616 if (op->skill!=NULL) FREE_AND_CLEAR_STR(op->skill);
617 if (op->msg!=NULL) FREE_AND_CLEAR_STR(op->msg);
618 if (op->lore!=NULL) FREE_AND_CLEAR_STR(op->lore);
619 if (op->materialname!= NULL) FREE_AND_CLEAR_STR(op->materialname);
620
621
622 memset((void*)op, 0, sizeof (object_special));
623 /* Below here, we clear things that are not done by the memset,
624 * or set default values that are not zero.
625 */
626 /* This is more or less true */
627 SET_FLAG(op, FLAG_REMOVED);
628
629
630 op->contr = NULL; 550 op->contr = NULL;
631 op->below=NULL; 551 op->below = NULL;
632 op->above=NULL; 552 op->above = NULL;
633 op->inv=NULL; 553 op->inv = NULL;
634 op->events=NULL;
635 op->container=NULL; 554 op->container=NULL;
636 op->env=NULL; 555 op->env=NULL;
637 op->more=NULL; 556 op->more=NULL;
638 op->head=NULL; 557 op->head=NULL;
639 op->map=NULL; 558 op->map=NULL;
640 op->refcount=0; 559 op->refcount=0;
641 op->active_next = NULL; 560 op->active_next = NULL;
642 op->active_prev = NULL; 561 op->active_prev = NULL;
643 /* What is not cleared is next, prev, and count */ 562 /* What is not cleared is next, prev, and count */
644 563
645 op->expmul=1.0; 564 op->expmul = 1.0;
646 op->face = blank_face; 565 op->face = blank_face;
647 op->attacked_by_count = (tag_t) -1; 566 op->attacked_by_count = -1;
567
648 if (settings.casting_time) 568 if (settings.casting_time)
649 op->casting_time = -1; 569 op->casting_time = -1;
650
651} 570}
652 571
653/* 572/*
654 * copy object first frees everything allocated by the second object, 573 * copy object first frees everything allocated by the second object,
655 * and then copies the contends of the first object into the second 574 * and then copies the contends of the first object into the second
… …
657 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 576 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
658 * if the first object is freed, the pointers in the new object 577 * if the first object is freed, the pointers in the new object
659 * will point at garbage. 578 * will point at garbage.
660 */ 579 */
661 580
662void copy_object(object *op2, object *op) { 581void copy_object (object *op2, object *op)
663 int is_freed=QUERY_FLAG(op,FLAG_FREED),is_removed=QUERY_FLAG(op,FLAG_REMOVED); 582{
664 event *evt, *evt2, *evt_new; 583 bool is_freed = QUERY_FLAG (op, FLAG_FREED);
584 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
665 585
666 /* Decrement the refcounts, but don't bother zeroing the fields; 586 op2->clone (op);
667 they'll be overwritten by memcpy. */
668 if(op->name!=NULL) free_string(op->name);
669 if(op->name_pl!=NULL) free_string(op->name_pl);
670 if(op->title!=NULL) free_string(op->title);
671 if(op->race!=NULL) free_string(op->race);
672 if(op->slaying!=NULL) free_string(op->slaying);
673 if(op->skill!=NULL) free_string(op->skill);
674 if(op->msg!=NULL) free_string(op->msg);
675 if(op->lore!=NULL) free_string(op->lore);
676 if(op->materialname != NULL) free_string(op->materialname);
677 if(op->custom_name != NULL) free_string(op->custom_name);
678 587
679 /* Basically, same code as from clear_object() */
680 for (evt = op->events; evt; evt=evt2) {
681 evt2 = evt->next;
682
683 if (evt->hook != NULL) FREE_AND_CLEAR_STR(evt->hook);
684 if (evt->plugin != NULL) FREE_AND_CLEAR_STR(evt->plugin);
685 if (evt->options != NULL) FREE_AND_CLEAR_STR(evt->options);
686
687 free(evt);
688 }
689 op->events = NULL;
690
691 free_key_values(op);
692
693 *(object_special *)op = *(object_special *)op2;
694
695 if(is_freed) SET_FLAG(op,FLAG_FREED); 588 if (is_freed) SET_FLAG (op, FLAG_FREED);
696 if(is_removed) SET_FLAG(op,FLAG_REMOVED); 589 if (is_removed) SET_FLAG (op, FLAG_REMOVED);
697 if(op->name!=NULL) add_refcount(op->name);
698 if(op->name_pl!=NULL) add_refcount(op->name_pl);
699 if(op->title!=NULL) add_refcount(op->title);
700 if(op->race!=NULL) add_refcount(op->race);
701 if(op->slaying!=NULL) add_refcount(op->slaying);
702 if(op->skill!=NULL) add_refcount(op->skill);
703 if(op->lore!=NULL) add_refcount(op->lore);
704 if(op->msg!=NULL) add_refcount(op->msg);
705 if(op->custom_name!=NULL) add_refcount(op->custom_name);
706 if (op->materialname != NULL) add_refcount(op->materialname);
707 590
708 if((op2->speed<0) && !editor) 591 if (op2->speed < 0)
709 op->speed_left=op2->speed_left-RANDOM()%200/100.0; 592 op->speed_left = op2->speed_left - RANDOM() % 200 / 100.0;
710 593
711 /* Copy over event information */
712 evt2 = NULL;
713 for (evt = op2->events; evt; evt=evt->next) {
714 evt_new = (event *) malloc(sizeof(event));
715 memcpy(evt_new, evt, sizeof(event));
716 if (evt_new->hook) add_refcount(evt_new->hook);
717 if (evt_new->plugin) add_refcount(evt_new->plugin);
718 if (evt_new->options) add_refcount(evt_new->options);
719 evt_new->next = NULL;
720
721 /* Try to be a little clever here, and store away the
722 * last event we copied, so that its simpler to update the
723 * pointer.
724 */
725 if (evt2)
726 evt2->next = evt_new;
727 else
728 op->events = evt_new;
729
730 evt2 = evt_new;
731 }
732 /* Copy over key_values, if any. */ 594 /* Copy over key_values, if any. */
733 if (op2->key_values != NULL) { 595 if (op2->key_values)
734 key_value * tail = NULL; 596 {
597 key_value *tail = 0;
735 key_value * i; 598 key_value *i;
736 599
737 op->key_values = NULL; 600 op->key_values = 0;
738 601
739 for (i = op2->key_values; i != NULL; i = i->next) { 602 for (i = op2->key_values; i; i = i->next)
740 key_value * new_link = (key_value *) malloc(sizeof(key_value)); 603 {
604 key_value *new_link = new key_value;
741 605
742 new_link->next = NULL; 606 new_link->next = 0;
743 new_link->key = add_refcount(i->key); 607 new_link->key = i->key;
744 if (i->value) 608 new_link->value = i->value;
745 new_link->value = add_refcount(i->value);
746 else
747 new_link->value = NULL;
748 609
749 /* Try and be clever here, too. */ 610 /* Try and be clever here, too. */
750 if (op->key_values == NULL) { 611 if (!op->key_values)
612 {
751 op->key_values = new_link; 613 op->key_values = new_link;
752 tail = new_link; 614 tail = new_link;
753 } else { 615 }
754 tail->next = new_link; 616 else
755 tail = new_link; 617 {
618 tail->next = new_link;
619 tail = new_link;
620 }
621 }
756 } 622 }
757 } 623
758 }
759
760 update_ob_speed(op); 624 update_ob_speed (op);
761}
762
763/*
764 * expand_objects() allocates more objects for the list of unused objects.
765 * It is called from get_object() if the unused list is empty.
766 */
767
768void expand_objects(void) {
769 int i;
770 object *obj;
771 obj = (object *) CALLOC(OBJ_EXPAND,sizeof(object));
772
773 if(obj==NULL)
774 fatal(OUT_OF_MEMORY);
775 free_objects=obj;
776 obj[0].prev=NULL;
777 obj[0].next= &obj[1],
778 SET_FLAG(&(obj[0]), FLAG_REMOVED);
779 SET_FLAG(&(obj[0]), FLAG_FREED);
780
781 for(i=1;i<OBJ_EXPAND-1;i++) {
782 obj[i].next= &obj[i+1],
783 obj[i].prev= &obj[i-1],
784 SET_FLAG(&(obj[i]), FLAG_REMOVED);
785 SET_FLAG(&(obj[i]), FLAG_FREED);
786 }
787 obj[OBJ_EXPAND-1].prev= &obj[OBJ_EXPAND-2],
788 obj[OBJ_EXPAND-1].next=NULL,
789 SET_FLAG(&(obj[OBJ_EXPAND-1]), FLAG_REMOVED);
790 SET_FLAG(&(obj[OBJ_EXPAND-1]), FLAG_FREED);
791
792 nrofallocobjects += OBJ_EXPAND;
793 nroffreeobjects += OBJ_EXPAND;
794}
795
796/*
797 * get_object() grabs an object from the list of unused objects, makes
798 * sure it is initialised, and returns it.
799 * If there are no free objects, expand_objects() is called to get more.
800 */
801
802object *get_object(void) {
803 object *op;
804
805 if(free_objects==NULL) {
806 expand_objects();
807 }
808 op=free_objects;
809#ifdef MEMORY_DEBUG
810 /* The idea is hopefully by doing a realloc, the memory
811 * debugging program will now use the current stack trace to
812 * report leaks.
813 */
814 op = realloc(op, sizeof(object));
815 SET_FLAG(op, FLAG_REMOVED);
816 SET_FLAG(op, FLAG_FREED);
817#endif
818
819 if(!QUERY_FLAG(op,FLAG_FREED)) {
820 LOG(llevError,"Fatal: Getting busy object.\n");
821 }
822 free_objects=op->next;
823 if(free_objects!=NULL)
824 free_objects->prev=NULL;
825 op->count= ++ob_count;
826 op->name=NULL;
827 op->name_pl=NULL;
828 op->title=NULL;
829 op->race=NULL;
830 op->slaying=NULL;
831 op->skill = NULL;
832 op->lore=NULL;
833 op->msg=NULL;
834 op->materialname=NULL;
835 op->next=objects;
836 op->prev=NULL;
837 op->active_next = NULL;
838 op->active_prev = NULL;
839 if(objects!=NULL)
840 objects->prev=op;
841 objects=op;
842 clear_object(op);
843 SET_FLAG(op,FLAG_REMOVED);
844 nroffreeobjects--;
845 return op;
846} 625}
847 626
848/* 627/*
849 * If an object with the IS_TURNABLE() flag needs to be turned due 628 * If an object with the IS_TURNABLE() flag needs to be turned due
850 * to the closest player being on the other side, this function can 629 * to the closest player being on the other side, this function can
851 * be called to update the face variable, _and_ how it looks on the map. 630 * be called to update the face variable, _and_ how it looks on the map.
852 */ 631 */
853 632
854void update_turn_face(object *op) { 633void update_turn_face(object *op) {
855 if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL) 634 if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL)
856 return; 635 return;
857 SET_ANIMATION(op, op->direction); 636 SET_ANIMATION(op, op->direction);
858 update_object(op,UP_OBJ_FACE); 637 update_object(op,UP_OBJ_FACE);
859} 638}
860 639
861/* 640/*
… …
870 /* No reason putting the archetypes objects on the speed list, 649 /* No reason putting the archetypes objects on the speed list,
871 * since they never really need to be updated. 650 * since they never really need to be updated.
872 */ 651 */
873 652
874 if (QUERY_FLAG(op, FLAG_FREED) && op->speed) { 653 if (QUERY_FLAG(op, FLAG_FREED) && op->speed) {
875 LOG(llevError,"Object %s is freed but has speed.\n", op->name); 654 LOG(llevError,"Object %s is freed but has speed.\n", &op->name);
876#ifdef MANY_CORES 655#ifdef MANY_CORES
877 abort(); 656 abort();
878#else 657#else
879 op->speed = 0; 658 op->speed = 0;
880#endif 659#endif
881 } 660 }
882 if (arch_init) { 661 if (arch_init) {
883 return; 662 return;
884 } 663 }
885 if (FABS(op->speed)>MIN_ACTIVE_SPEED) { 664 if (FABS(op->speed)>MIN_ACTIVE_SPEED) {
886 /* If already on active list, don't do anything */ 665 /* If already on active list, don't do anything */
887 if (op->active_next || op->active_prev || op==active_objects) 666 if (op->active_next || op->active_prev || op==active_objects)
888 return; 667 return;
889 668
890 /* process_events() expects us to insert the object at the beginning 669 /* process_events() expects us to insert the object at the beginning
891 * of the list. */ 670 * of the list. */
892 op->active_next = active_objects; 671 op->active_next = active_objects;
893 if (op->active_next!=NULL) 672 if (op->active_next!=NULL)
894 op->active_next->active_prev = op; 673 op->active_next->active_prev = op;
895 active_objects = op; 674 active_objects = op;
896 } 675 }
897 else { 676 else {
898 /* If not on the active list, nothing needs to be done */ 677 /* If not on the active list, nothing needs to be done */
899 if (!op->active_next && !op->active_prev && op!=active_objects) 678 if (!op->active_next && !op->active_prev && op!=active_objects)
900 return; 679 return;
901 680
902 if (op->active_prev==NULL) { 681 if (op->active_prev==NULL) {
903 active_objects = op->active_next; 682 active_objects = op->active_next;
904 if (op->active_next!=NULL) 683 if (op->active_next!=NULL)
905 op->active_next->active_prev = NULL; 684 op->active_next->active_prev = NULL;
906 } 685 }
907 else { 686 else {
908 op->active_prev->active_next = op->active_next; 687 op->active_prev->active_next = op->active_next;
909 if (op->active_next) 688 if (op->active_next)
910 op->active_next->active_prev = op->active_prev; 689 op->active_next->active_prev = op->active_prev;
911 } 690 }
912 op->active_next = NULL; 691 op->active_next = NULL;
913 op->active_prev = NULL; 692 op->active_prev = NULL;
914 } 693 }
915} 694}
916 695
917/* This function removes object 'op' from the list of active 696/* This function removes object 'op' from the list of active
918 * objects. 697 * objects.
… …
924 */ 703 */
925void remove_from_active_list(object *op) 704void remove_from_active_list(object *op)
926{ 705{
927 /* If not on the active list, nothing needs to be done */ 706 /* If not on the active list, nothing needs to be done */
928 if (!op->active_next && !op->active_prev && op!=active_objects) 707 if (!op->active_next && !op->active_prev && op!=active_objects)
929 return; 708 return;
930 709
931 if (op->active_prev==NULL) { 710 if (op->active_prev==NULL) {
932 active_objects = op->active_next; 711 active_objects = op->active_next;
933 if (op->active_next!=NULL) 712 if (op->active_next!=NULL)
934 op->active_next->active_prev = NULL; 713 op->active_next->active_prev = NULL;
935 } 714 }
936 else { 715 else {
937 op->active_prev->active_next = op->active_next; 716 op->active_prev->active_next = op->active_next;
938 if (op->active_next) 717 if (op->active_next)
939 op->active_next->active_prev = op->active_prev; 718 op->active_next->active_prev = op->active_prev;
940 } 719 }
941 op->active_next = NULL; 720 op->active_next = NULL;
942 op->active_prev = NULL; 721 op->active_prev = NULL;
943} 722}
944 723
… …
964 * UP_OBJ_FACE: only the objects face has changed. 743 * UP_OBJ_FACE: only the objects face has changed.
965 */ 744 */
966 745
967void update_object(object *op, int action) { 746void update_object(object *op, int action) {
968 int update_now=0, flags; 747 int update_now=0, flags;
969 MoveType move_on, move_off, move_block, move_slow; 748 MoveType move_on, move_off, move_block, move_slow;
970 749
971 if (op == NULL) { 750 if (op == NULL) {
972 /* this should never happen */ 751 /* this should never happen */
973 LOG(llevDebug,"update_object() called for NULL object.\n"); 752 LOG(llevDebug,"update_object() called for NULL object.\n");
974 return; 753 return;
975 } 754 }
976 755
977 if(op->env!=NULL) { 756 if(op->env!=NULL) {
978 /* Animation is currently handled by client, so nothing 757 /* Animation is currently handled by client, so nothing
979 * to do in this case. 758 * to do in this case.
980 */ 759 */
981 return; 760 return;
982 } 761 }
983 762
984 /* If the map is saving, don't do anything as everything is 763 /* If the map is saving, don't do anything as everything is
985 * going to get freed anyways. 764 * going to get freed anyways.
986 */ 765 */
987 if (!op->map || op->map->in_memory == MAP_SAVING) return; 766 if (!op->map || op->map->in_memory == MAP_SAVING) return;
988 767
989 /* make sure the object is within map boundaries */ 768 /* make sure the object is within map boundaries */
990 if (op->x < 0 || op->x >= MAP_WIDTH(op->map) || 769 if (op->x < 0 || op->x >= MAP_WIDTH(op->map) ||
991 op->y < 0 || op->y >= MAP_HEIGHT(op->map)) { 770 op->y < 0 || op->y >= MAP_HEIGHT(op->map)) {
992 LOG(llevError,"update_object() called for object out of map!\n"); 771 LOG(llevError,"update_object() called for object out of map!\n");
993#ifdef MANY_CORES 772#ifdef MANY_CORES
994 abort(); 773 abort();
995#endif 774#endif
996 return; 775 return;
997 } 776 }
998 777
999 flags = GET_MAP_FLAGS(op->map, op->x, op->y); 778 flags = GET_MAP_FLAGS(op->map, op->x, op->y);
1000 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE); 779 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE);
1001 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y); 780 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);
… …
1014 update_now=1; 793 update_now=1;
1015 794
1016 if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) 795 if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
1017 update_now=1; 796 update_now=1;
1018 797
798 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
799 update_now=1;
800
1019 if ((move_on | op->move_on) != move_on) update_now=1; 801 if ((move_on | op->move_on) != move_on) update_now=1;
802
1020 if ((move_off | op->move_off) != move_off) update_now=1; 803 if ((move_off | op->move_off) != move_off) update_now=1;
804
1021 /* This isn't perfect, but I don't expect a lot of objects to 805 /* This isn't perfect, but I don't expect a lot of objects to
1022 * to have move_allow right now. 806 * to have move_allow right now.
1023 */ 807 */
1024 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 808 if (((move_block | op->move_block) & ~op->move_allow) != move_block)
1025 update_now=1; 809 update_now=1;
810
1026 if ((move_slow | op->move_slow) != move_slow) update_now=1; 811 if ((move_slow | op->move_slow) != move_slow)
812 update_now=1;
1027 } 813 }
1028 /* if the object is being removed, we can't make intelligent 814 /* if the object is being removed, we can't make intelligent
1029 * decisions, because remove_ob can't really pass the object 815 * decisions, because remove_ob can't really pass the object
1030 * that is being removed. 816 * that is being removed.
1031 */ 817 */
1032 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) { 818 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) {
1033 update_now=1; 819 update_now=1;
1034 } else if (action == UP_OBJ_FACE) { 820 } else if (action == UP_OBJ_FACE) {
1035 /* Nothing to do for that case */ 821 /* Nothing to do for that case */
1036 } 822 }
1037 else { 823 else {
1038 LOG(llevError,"update_object called with invalid action: %d\n", action); 824 LOG(llevError,"update_object called with invalid action: %d\n", action);
1039 } 825 }
1040 826
1041 if (update_now) { 827 if (update_now) {
1042 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); 828 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
1043 update_position(op->map, op->x, op->y); 829 update_position(op->map, op->x, op->y);
1044 } 830 }
1045 831
1046 if(op->more!=NULL) 832 if(op->more!=NULL)
1047 update_object(op->more, action); 833 update_object(op->more, action);
1048} 834}
1049 835
836static std::vector<object *> mortals;
837
838void object::free_mortals ()
839{
840 for (std::vector<object *>::iterator i = mortals.begin (); i != mortals.end (); ++i)
841 delete *i;
842
843 mortals.clear ();
844}
845
846object::object ()
847{
848 SET_FLAG (this, FLAG_REMOVED);
849
850 expmul = 1.0;
851 face = blank_face;
852 attacked_by_count = -1;
853}
854
855object::~object ()
856{
857 free_key_values (this);
858}
859
860void
861object::link ()
862{
863 count = ++ob_count;
864
865 prev = 0;
866 next = objects;
867
868 if (objects)
869 objects->prev = this;
870
871 objects = this;
872}
873
874void
875object::unlink ()
876{
877 count = 0;
878
879 /* Remove this object from the list of used objects */
880 if (prev) prev->next = next;
881 if (next) next->prev = prev;
882 if (this == objects) objects = next;
883}
884
885object *object::create ()
886{
887 object *op = new object;
888 op->link ();
889 return op;
890}
1050 891
1051/* 892/*
1052 * free_object() frees everything allocated by an object, removes 893 * free_object() frees everything allocated by an object, removes
1053 * it from the list of used objects, and puts it on the list of 894 * it from the list of used objects, and puts it on the list of
1054 * free objects. The IS_FREED() flag is set in the object. 895 * free objects. The IS_FREED() flag is set in the object.
… …
1056 * this function to succeed. 897 * this function to succeed.
1057 * 898 *
1058 * If free_inventory is set, free inventory as well. Else drop items in 899 * If free_inventory is set, free inventory as well. Else drop items in
1059 * inventory to the ground. 900 * inventory to the ground.
1060 */ 901 */
1061 902void
1062void free_object(object *ob) { 903object::free (bool free_inventory)
1063 free_object2(ob, 0); 904{
1064}
1065void free_object2(object *ob, int free_inventory) {
1066 object *tmp,*op;
1067
1068 if (object_free_callback)
1069 object_free_callback (ob);
1070
1071 if (!QUERY_FLAG(ob,FLAG_REMOVED)) { 905 if (!QUERY_FLAG (this, FLAG_REMOVED))
906 {
1072 LOG(llevDebug,"Free object called with non removed object\n"); 907 LOG (llevDebug, "Free object called with non removed object\n");
1073 dump_object(ob); 908 dump_object (this);
1074#ifdef MANY_CORES 909#ifdef MANY_CORES
1075 abort(); 910 abort ();
1076#endif 911#endif
1077 } 912 }
913
1078 if(QUERY_FLAG(ob,FLAG_FRIENDLY)) { 914 if (QUERY_FLAG (this, FLAG_FRIENDLY))
915 {
1079 LOG(llevMonster,"Warning: tried to free friendly object.\n"); 916 LOG (llevMonster, "Warning: tried to free friendly object.\n");
1080 remove_friendly_object(ob); 917 remove_friendly_object (this);
1081 } 918 }
919
1082 if(QUERY_FLAG(ob,FLAG_FREED)) { 920 if (QUERY_FLAG (this, FLAG_FREED))
1083 dump_object(ob); 921 {
922 dump_object (this);
1084 LOG(llevError,"Trying to free freed object.\n%s\n",errmsg); 923 LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
1085 return; 924 return;
925 }
926
927 if (more)
1086 } 928 {
1087 if(ob->more!=NULL) { 929 more->free (free_inventory);
1088 free_object2(ob->more, free_inventory); 930 more = 0;
1089 ob->more=NULL; 931 }
932
933 if (inv)
1090 } 934 {
1091 if (ob->inv) {
1092 /* Only if the space blocks everything do we not process - 935 /* Only if the space blocks everything do we not process -
1093 * if some form of movemnt is allowed, let objects 936 * if some form of movement is allowed, let objects
1094 * drop on that space. 937 * drop on that space.
1095 */ 938 */
1096 if (free_inventory || ob->map==NULL || ob->map->in_memory!=MAP_IN_MEMORY || 939 if (free_inventory || !map
940 || map->in_memory != MAP_IN_MEMORY
1097 (GET_MAP_MOVE_BLOCK(ob->map, ob->x, ob->y) == MOVE_ALL)) 941 || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))
1098 { 942 {
1099 op=ob->inv; 943 object *op = inv;
1100 while(op!=NULL) { 944
1101 tmp=op->below; 945 while (op)
946 {
947 object *tmp = op->below;
1102 remove_ob(op); 948 remove_ob (op);
1103 free_object2(op, free_inventory); 949 op->free (free_inventory);
1104 op=tmp; 950 op = tmp;
1105 } 951 }
1106 } 952 }
953 else
1107 else { /* Put objects in inventory onto this space */ 954 { /* Put objects in inventory onto this space */
1108 op=ob->inv; 955 object *op = inv;
1109 while(op!=NULL) { 956
1110 tmp=op->below; 957 while (op)
958 {
959 object *tmp = op->below;
1111 remove_ob(op); 960 remove_ob (op);
1112 if(QUERY_FLAG(op,FLAG_STARTEQUIP)||QUERY_FLAG(op,FLAG_NO_DROP) || 961
962 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
963 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE
1113 op->type==RUNE || op->type==TRAP || QUERY_FLAG(op,FLAG_IS_A_TEMPLATE)) 964 || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
1114 free_object(op); 965 free_object (op);
1115 else { 966 else
967 {
1116 op->x=ob->x; 968 op->x = x;
1117 op->y=ob->y; 969 op->y = y;
1118 insert_ob_in_map(op,ob->map,NULL,0); /* Insert in same map as the envir */ 970 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
1119 } 971 }
1120 op=tmp; 972
973 op = tmp;
1121 } 974 }
1122 } 975 }
1123 } 976 }
977
1124 /* Remove object from the active list */ 978 /* Remove object from the active list */
1125 ob->speed = 0; 979 speed = 0;
1126 update_ob_speed(ob); 980 update_ob_speed (this);
1127 981
982 unlink ();
983
1128 SET_FLAG(ob, FLAG_FREED); 984 SET_FLAG (this, FLAG_FREED);
1129 ob->count = 0;
1130 985
1131 /* Remove this object from the list of used objects */ 986 mortals.push_back (this);
1132 if(ob->prev==NULL) {
1133 objects=ob->next;
1134 if(objects!=NULL)
1135 objects->prev=NULL;
1136 }
1137 else {
1138 ob->prev->next=ob->next;
1139 if(ob->next!=NULL)
1140 ob->next->prev=ob->prev;
1141 }
1142
1143 if(ob->name!=NULL) FREE_AND_CLEAR_STR(ob->name);
1144 if(ob->name_pl!=NULL) FREE_AND_CLEAR_STR(ob->name_pl);
1145 if(ob->title!=NULL) FREE_AND_CLEAR_STR(ob->title);
1146 if(ob->race!=NULL) FREE_AND_CLEAR_STR(ob->race);
1147 if(ob->slaying!=NULL) FREE_AND_CLEAR_STR(ob->slaying);
1148 if(ob->skill!=NULL) FREE_AND_CLEAR_STR(ob->skill);
1149 if(ob->lore!=NULL) FREE_AND_CLEAR_STR(ob->lore);
1150 if(ob->msg!=NULL) FREE_AND_CLEAR_STR(ob->msg);
1151 if(ob->materialname!=NULL) FREE_AND_CLEAR_STR(ob->materialname);
1152
1153
1154 /* Why aren't events freed? */
1155 free_key_values(ob);
1156
1157#if 0 /* MEMORY_DEBUG*/
1158 /* This is a nice idea. Unfortunately, a lot of the code in crossfire
1159 * presumes the freed_object will stick around for at least a little
1160 * bit
1161 */
1162 /* this is necessary so that memory debugging programs will
1163 * be able to accurately report source of malloc. If we recycle
1164 * objects, then some other area may be doing the get_object
1165 * and not freeing it, but the original one that malloc'd the
1166 * object will get the blame.
1167 */
1168 free(ob);
1169#else
1170
1171 /* Now link it with the free_objects list: */
1172 ob->prev=NULL;
1173 ob->next=free_objects;
1174 if(free_objects!=NULL)
1175 free_objects->prev=ob;
1176 free_objects=ob;
1177 nroffreeobjects++;
1178#endif
1179}
1180
1181/*
1182 * count_free() returns the number of objects on the list of free objects.
1183 */
1184
1185int count_free(void) {
1186 int i=0;
1187 object *tmp=free_objects;
1188 while(tmp!=NULL)
1189 tmp=tmp->next, i++;
1190 return i;
1191}
1192
1193/*
1194 * count_used() returns the number of objects on the list of used objects.
1195 */
1196
1197int count_used(void) {
1198 int i=0;
1199 object *tmp=objects;
1200 while(tmp!=NULL)
1201 tmp=tmp->next, i++;
1202 return i;
1203}
1204
1205/*
1206 * count_active() returns the number of objects on the list of active objects.
1207 */
1208
1209int count_active(void) {
1210 int i=0;
1211 object *tmp=active_objects;
1212 while(tmp!=NULL)
1213 tmp=tmp->active_next, i++;
1214 return i;
1215} 987}
1216 988
1217/* 989/*
1218 * sub_weight() recursively (outwards) subtracts a number from the 990 * sub_weight() recursively (outwards) subtracts a number from the
1219 * weight of an object (and what is carried by it's environment(s)). 991 * weight of an object (and what is carried by it's environment(s)).
… …
1246 mapstruct *m; 1018 mapstruct *m;
1247 sint16 x,y; 1019 sint16 x,y;
1248 1020
1249 1021
1250 if(QUERY_FLAG(op,FLAG_REMOVED)) { 1022 if(QUERY_FLAG(op,FLAG_REMOVED)) {
1251 dump_object(op); 1023 dump_object(op);
1252 LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg); 1024 LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);
1253 1025
1254 /* Changed it to always dump core in this case. As has been learned 1026 /* Changed it to always dump core in this case. As has been learned
1255 * in the past, trying to recover from errors almost always 1027 * in the past, trying to recover from errors almost always
1256 * make things worse, and this is a real error here - something 1028 * make things worse, and this is a real error here - something
1257 * that should not happen. 1029 * that should not happen.
1258 * Yes, if this was a mission critical app, trying to do something 1030 * Yes, if this was a mission critical app, trying to do something
1259 * to recover may make sense, but that is because failure of the app 1031 * to recover may make sense, but that is because failure of the app
1260 * may have other disastrous problems. Cf runs out of a script 1032 * may have other disastrous problems. Cf runs out of a script
1261 * so is easily enough restarted without any real problems. 1033 * so is easily enough restarted without any real problems.
1262 * MSW 2001-07-01 1034 * MSW 2001-07-01
1263 */ 1035 */
1264 abort(); 1036 abort();
1265 } 1037 }
1266 if(op->more!=NULL) 1038 if(op->more!=NULL)
1267 remove_ob(op->more); 1039 remove_ob(op->more);
1268 1040
1269 SET_FLAG(op, FLAG_REMOVED); 1041 SET_FLAG(op, FLAG_REMOVED);
1270 1042
1271 /* 1043 /*
1272 * In this case, the object to be removed is in someones 1044 * In this case, the object to be removed is in someones
1273 * inventory. 1045 * inventory.
1274 */ 1046 */
1275 if(op->env!=NULL) { 1047 if(op->env!=NULL) {
1276 if(op->nrof) 1048 if(op->nrof)
1277 sub_weight(op->env, op->weight*op->nrof); 1049 sub_weight(op->env, op->weight*op->nrof);
1278 else 1050 else
1279 sub_weight(op->env, op->weight+op->carrying); 1051 sub_weight(op->env, op->weight+op->carrying);
1280 1052
1281 /* NO_FIX_PLAYER is set when a great many changes are being 1053 /* NO_FIX_PLAYER is set when a great many changes are being
1282 * made to players inventory. If set, avoiding the call 1054 * made to players inventory. If set, avoiding the call
1283 * to save cpu time. 1055 * to save cpu time.
1284 */ 1056 */
1285 if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr && 1057 if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr &&
1286 !QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER)) 1058 !QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))
1287 fix_player(otmp); 1059 fix_player(otmp);
1288 1060
1289 if(op->above!=NULL) 1061 if(op->above!=NULL)
1290 op->above->below=op->below; 1062 op->above->below=op->below;
1291 else 1063 else
1292 op->env->inv=op->below; 1064 op->env->inv=op->below;
1293 1065
1294 if(op->below!=NULL) 1066 if(op->below!=NULL)
1295 op->below->above=op->above; 1067 op->below->above=op->above;
1296 1068
1297 /* we set up values so that it could be inserted into 1069 /* we set up values so that it could be inserted into
1298 * the map, but we don't actually do that - it is up 1070 * the map, but we don't actually do that - it is up
1299 * to the caller to decide what we want to do. 1071 * to the caller to decide what we want to do.
1300 */ 1072 */
1301 op->x=op->env->x,op->y=op->env->y; 1073 op->x=op->env->x,op->y=op->env->y;
1302 op->ox=op->x,op->oy=op->y;
1303 op->map=op->env->map; 1074 op->map=op->env->map;
1304 op->above=NULL,op->below=NULL; 1075 op->above=NULL,op->below=NULL;
1305 op->env=NULL; 1076 op->env=NULL;
1306 return; 1077 return;
1307 } 1078 }
1308 1079
1309 /* If we get here, we are removing it from a map */ 1080 /* If we get here, we are removing it from a map */
1310 if (op->map == NULL) return; 1081 if (op->map == NULL) return;
1311 1082
1312 x = op->x; 1083 x = op->x;
1313 y = op->y; 1084 y = op->y;
1314 m = get_map_from_coord(op->map, &x, &y); 1085 m = get_map_from_coord(op->map, &x, &y);
1315 1086
1316 if (!m) { 1087 if (!m) {
1317 LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n", 1088 LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1318 op->map->path, op->x, op->y); 1089 op->map->path, op->x, op->y);
1319 /* in old days, we used to set x and y to 0 and continue. 1090 /* in old days, we used to set x and y to 0 and continue.
1320 * it seems if we get into this case, something is probablye 1091 * it seems if we get into this case, something is probablye
1321 * screwed up and should be fixed. 1092 * screwed up and should be fixed.
1322 */ 1093 */
1323 abort(); 1094 abort();
1324 } 1095 }
1325 if (op->map != m) { 1096 if (op->map != m) {
1326 LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n", 1097 LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1327 op->map->path, m->path, op->x, op->y, x, y); 1098 op->map->path, m->path, op->x, op->y, x, y);
1328 } 1099 }
1329 1100
1330 /* Re did the following section of code - it looks like it had 1101 /* Re did the following section of code - it looks like it had
1331 * lots of logic for things we no longer care about 1102 * lots of logic for things we no longer care about
1332 */ 1103 */
1333 1104
1334 /* link the object above us */ 1105 /* link the object above us */
1335 if (op->above) 1106 if (op->above)
1336 op->above->below=op->below; 1107 op->above->below=op->below;
1337 else 1108 else
1338 SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */ 1109 SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */
1339 1110
1340 /* Relink the object below us, if there is one */ 1111 /* Relink the object below us, if there is one */
1341 if(op->below) { 1112 if(op->below) {
1342 op->below->above=op->above; 1113 op->below->above=op->above;
1343 } else { 1114 } else {
1344 /* Nothing below, which means we need to relink map object for this space 1115 /* Nothing below, which means we need to relink map object for this space
1345 * use translated coordinates in case some oddness with map tiling is 1116 * use translated coordinates in case some oddness with map tiling is
1346 * evident 1117 * evident
1347 */ 1118 */
1348 if(GET_MAP_OB(m,x,y)!=op) { 1119 if(GET_MAP_OB(m,x,y)!=op) {
1349 dump_object(op); 1120 dump_object(op);
1350 LOG(llevError,"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg); 1121 LOG(llevError,"remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", errmsg);
1351 dump_object(GET_MAP_OB(m,x,y)); 1122 dump_object(GET_MAP_OB(m,x,y));
1352 LOG(llevError,"%s\n",errmsg); 1123 LOG(llevError,"%s\n",errmsg);
1353 } 1124 }
1354 SET_MAP_OB(m,x,y,op->above); /* goes on above it. */ 1125 SET_MAP_OB(m,x,y,op->above); /* goes on above it. */
1355 } 1126 }
1356 op->above=NULL; 1127 op->above=NULL;
1357 op->below=NULL; 1128 op->below=NULL;
1358 1129
1359 if (op->map->in_memory == MAP_SAVING) 1130 if (op->map->in_memory == MAP_SAVING)
1360 return; 1131 return;
1361 1132
1362 tag = op->count; 1133 tag = op->count;
1363 check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY); 1134 check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY);
1364 for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) { 1135 for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) {
1365 /* No point updating the players look faces if he is the object 1136 /* No point updating the players look faces if he is the object
1366 * being removed. 1137 * being removed.
1367 */ 1138 */
1368 1139
1369 if(tmp->type==PLAYER && tmp!=op) { 1140 if(tmp->type==PLAYER && tmp!=op) {
1370 /* If a container that the player is currently using somehow gets 1141 /* If a container that the player is currently using somehow gets
1371 * removed (most likely destroyed), update the player view 1142 * removed (most likely destroyed), update the player view
1372 * appropriately. 1143 * appropriately.
1373 */ 1144 */
1374 if (tmp->container==op) { 1145 if (tmp->container==op) {
1375 CLEAR_FLAG(op, FLAG_APPLIED); 1146 CLEAR_FLAG(op, FLAG_APPLIED);
1376 tmp->container=NULL; 1147 tmp->container=NULL;
1377 } 1148 }
1378 tmp->contr->socket.update_look=1; 1149 tmp->contr->socket.update_look=1;
1379 } 1150 }
1380 /* See if player moving off should effect something */ 1151 /* See if player moving off should effect something */
1381 if (check_walk_off && ((op->move_type & tmp->move_off) && 1152 if (check_walk_off && ((op->move_type & tmp->move_off) &&
1382 (op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) { 1153 (op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) {
1383 1154
1384 move_apply(tmp, op, NULL); 1155 move_apply(tmp, op, NULL);
1385 if (was_destroyed (op, tag)) { 1156 if (was_destroyed (op, tag)) {
1386 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " 1157 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed "
1387 "leaving object\n", tmp->name, tmp->arch->name); 1158 "leaving object\n", &tmp->name, &tmp->arch->name);
1388 } 1159 }
1389 } 1160 }
1390 1161
1391 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1162 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1392 1163
1393 if(tmp->above == tmp) 1164 if(tmp->above == tmp)
1394 tmp->above = NULL; 1165 tmp->above = NULL;
1395 last=tmp; 1166 last=tmp;
1396 } 1167 }
1397 /* last == NULL of there are no objects on this space */ 1168 /* last == NULL of there are no objects on this space */
1398 if (last==NULL) { 1169 if (last==NULL) {
1399 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, 1170 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1400 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures 1171 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1401 * those out anyways, and if there are any flags set right now, they won't 1172 * those out anyways, and if there are any flags set right now, they won't
1402 * be correct anyways. 1173 * be correct anyways.
1403 */ 1174 */
1404 SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE); 1175 SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE);
1405 update_position(op->map, op->x, op->y); 1176 update_position(op->map, op->x, op->y);
1406 } 1177 }
1407 else 1178 else
1408 update_object(last, UP_OBJ_REMOVE); 1179 update_object(last, UP_OBJ_REMOVE);
1409 1180
1410 if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0)) 1181 if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0))
1411 update_all_los(op->map, op->x, op->y); 1182 update_all_los(op->map, op->x, op->y);
1412 1183
1413} 1184}
1414 1185
1415/* 1186/*
1416 * merge_ob(op,top): 1187 * merge_ob(op,top):
… …
1482{ 1253{
1483 object *tmp, *top, *floor=NULL; 1254 object *tmp, *top, *floor=NULL;
1484 sint16 x,y; 1255 sint16 x,y;
1485 1256
1486 if (QUERY_FLAG (op, FLAG_FREED)) { 1257 if (QUERY_FLAG (op, FLAG_FREED)) {
1487 LOG (llevError, "Trying to insert freed object!\n"); 1258 LOG (llevError, "Trying to insert freed object!\n");
1488 return NULL; 1259 return NULL;
1489 } 1260 }
1490 if(m==NULL) { 1261 if(m==NULL) {
1491 dump_object(op); 1262 dump_object(op);
1492 LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg); 1263 LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);
1493 return op; 1264 return op;
1494 } 1265 }
1495 if(out_of_map(m,op->x,op->y)) { 1266 if(out_of_map(m,op->x,op->y)) {
1496 dump_object(op); 1267 dump_object(op);
1497 LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg); 1268 LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);
1498#ifdef MANY_CORES 1269#ifdef MANY_CORES
1499 /* Better to catch this here, as otherwise the next use of this object 1270 /* Better to catch this here, as otherwise the next use of this object
1500 * is likely to cause a crash. Better to find out where it is getting 1271 * is likely to cause a crash. Better to find out where it is getting
1501 * improperly inserted. 1272 * improperly inserted.
1502 */ 1273 */
1503 abort(); 1274 abort();
1504#endif 1275#endif
1505 return op; 1276 return op;
1506 } 1277 }
1507 if(!QUERY_FLAG(op,FLAG_REMOVED)) { 1278 if(!QUERY_FLAG(op,FLAG_REMOVED)) {
1508 dump_object(op); 1279 dump_object(op);
1509 LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg); 1280 LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);
1510 return op; 1281 return op;
1511 } 1282 }
1512 if(op->more!=NULL) { 1283 if(op->more!=NULL) {
1513 /* The part may be on a different map. */ 1284 /* The part may be on a different map. */
1514 1285
1515 object *more = op->more; 1286 object *more = op->more;
1516 1287
1517 /* We really need the caller to normalize coordinates - if 1288 /* We really need the caller to normalize coordinates - if
1518 * we set the map, that doesn't work if the location is within 1289 * we set the map, that doesn't work if the location is within
1519 * a map and this is straddling an edge. So only if coordinate 1290 * a map and this is straddling an edge. So only if coordinate
1520 * is clear wrong do we normalize it. 1291 * is clear wrong do we normalize it.
1521 */ 1292 */
1522 if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) { 1293 if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {
1523 /* Debugging information so you can see the last coordinates this object had */
1524 more->ox = more->x;
1525 more->oy = more->y;
1526 more->map = get_map_from_coord(m, &more->x, &more->y); 1294 more->map = get_map_from_coord(m, &more->x, &more->y);
1527 } else if (!more->map) { 1295 } else if (!more->map) {
1528 /* For backwards compatibility - when not dealing with tiled maps, 1296 /* For backwards compatibility - when not dealing with tiled maps,
1529 * more->map should always point to the parent. 1297 * more->map should always point to the parent.
1530 */ 1298 */
1531 more->map = m; 1299 more->map = m;
1532 } 1300 }
1533 1301
1534 if (insert_ob_in_map(more, more->map, originator, flag) == NULL) { 1302 if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {
1535 if ( ! op->head) 1303 if ( ! op->head)
1536 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); 1304 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1537 return NULL; 1305 return NULL;
1538 } 1306 }
1539 } 1307 }
1540 CLEAR_FLAG(op,FLAG_REMOVED); 1308 CLEAR_FLAG(op,FLAG_REMOVED);
1541
1542 /* Debugging information so you can see the last coordinates this object had */
1543 op->ox=op->x;
1544 op->oy=op->y;
1545 1309
1546 /* Ideally, the caller figures this out. However, it complicates a lot 1310 /* Ideally, the caller figures this out. However, it complicates a lot
1547 * of areas of callers (eg, anything that uses find_free_spot would now 1311 * of areas of callers (eg, anything that uses find_free_spot would now
1548 * need extra work 1312 * need extra work
1549 */ 1313 */
… …
1552 y = op->y; 1316 y = op->y;
1553 1317
1554 /* this has to be done after we translate the coordinates. 1318 /* this has to be done after we translate the coordinates.
1555 */ 1319 */
1556 if(op->nrof && !(flag & INS_NO_MERGE)) { 1320 if(op->nrof && !(flag & INS_NO_MERGE)) {
1557 for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above) 1321 for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)
1558 if (CAN_MERGE(op,tmp)) { 1322 if (CAN_MERGE(op,tmp)) {
1559 op->nrof+=tmp->nrof; 1323 op->nrof+=tmp->nrof;
1560 remove_ob(tmp); 1324 remove_ob(tmp);
1561 free_object(tmp); 1325 free_object(tmp);
1562 } 1326 }
1563 } 1327 }
1564 1328
1565 CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ 1329 CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1566 CLEAR_FLAG(op, FLAG_INV_LOCKED); 1330 CLEAR_FLAG(op, FLAG_INV_LOCKED);
1567 if (!QUERY_FLAG(op, FLAG_ALIVE)) 1331 if (!QUERY_FLAG(op, FLAG_ALIVE))
1568 CLEAR_FLAG(op, FLAG_NO_STEAL); 1332 CLEAR_FLAG(op, FLAG_NO_STEAL);
1569 1333
1570 if (flag & INS_BELOW_ORIGINATOR) { 1334 if (flag & INS_BELOW_ORIGINATOR) {
1571 if (originator->map != op->map || originator->x != op->x || 1335 if (originator->map != op->map || originator->x != op->x ||
1572 originator->y != op->y) { 1336 originator->y != op->y) {
1573 LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); 1337 LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1574 abort(); 1338 abort();
1575 } 1339 }
1576 op->above = originator; 1340 op->above = originator;
1577 op->below = originator->below; 1341 op->below = originator->below;
1578 if (op->below) op->below->above = op; 1342 if (op->below) op->below->above = op;
1579 else SET_MAP_OB(op->map, op->x, op->y, op); 1343 else SET_MAP_OB(op->map, op->x, op->y, op);
1580 /* since *below* originator, no need to update top */ 1344 /* since *below* originator, no need to update top */
1581 originator->below = op; 1345 originator->below = op;
1582 } else { 1346 } else {
1583 /* If there are other objects, then */ 1347 /* If there are other objects, then */
1584 if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) { 1348 if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {
1585 object *last=NULL; 1349 object *last=NULL;
1586 /* 1350 /*
1587 * If there are multiple objects on this space, we do some trickier handling. 1351 * If there are multiple objects on this space, we do some trickier handling.
1588 * We've already dealt with merging if appropriate. 1352 * We've already dealt with merging if appropriate.
1589 * Generally, we want to put the new object on top. But if 1353 * Generally, we want to put the new object on top. But if
1590 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last 1354 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1591 * floor, we want to insert above that and no further. 1355 * floor, we want to insert above that and no further.
1592 * Also, if there are spell objects on this space, we stop processing 1356 * Also, if there are spell objects on this space, we stop processing
1593 * once we get to them. This reduces the need to traverse over all of 1357 * once we get to them. This reduces the need to traverse over all of
1594 * them when adding another one - this saves quite a bit of cpu time 1358 * them when adding another one - this saves quite a bit of cpu time
1595 * when lots of spells are cast in one area. Currently, it is presumed 1359 * when lots of spells are cast in one area. Currently, it is presumed
1596 * that flying non pickable objects are spell objects. 1360 * that flying non pickable objects are spell objects.
1597 */ 1361 */
1598 1362
1599 while (top != NULL) { 1363 while (top != NULL) {
1600 if (QUERY_FLAG(top, FLAG_IS_FLOOR) || 1364 if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||
1601 QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top; 1365 QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;
1602 if (QUERY_FLAG(top, FLAG_NO_PICK) 1366 if (QUERY_FLAG(top, FLAG_NO_PICK)
1603 && (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH)) 1367 && (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))
1604 && !QUERY_FLAG(top, FLAG_IS_FLOOR)) 1368 && !QUERY_FLAG(top, FLAG_IS_FLOOR))
1605 { 1369 {
1606 /* We insert above top, so we want this object below this */ 1370 /* We insert above top, so we want this object below this */
1607 top=top->below; 1371 top=top->below;
1608 break; 1372 break;
1609 } 1373 }
1610 last = top; 1374 last = top;
1611 top = top->above; 1375 top = top->above;
1612 } 1376 }
1613 /* Don't want top to be NULL, so set it to the last valid object */ 1377 /* Don't want top to be NULL, so set it to the last valid object */
1614 top = last; 1378 top = last;
1615 1379
1616 /* We let update_position deal with figuring out what the space 1380 /* We let update_position deal with figuring out what the space
1617 * looks like instead of lots of conditions here. 1381 * looks like instead of lots of conditions here.
1618 * makes things faster, and effectively the same result. 1382 * makes things faster, and effectively the same result.
1619 */ 1383 */
1620 1384
1621 /* Have object 'fall below' other objects that block view. 1385 /* Have object 'fall below' other objects that block view.
1622 * Unless those objects are exits, type 66 1386 * Unless those objects are exits, type 66
1623 * If INS_ON_TOP is used, don't do this processing 1387 * If INS_ON_TOP is used, don't do this processing
1624 * Need to find the object that in fact blocks view, otherwise 1388 * Need to find the object that in fact blocks view, otherwise
1625 * stacking is a bit odd. 1389 * stacking is a bit odd.
1626 */ 1390 */
1627 if (!(flag & INS_ON_TOP) && 1391 if (!(flag & INS_ON_TOP) &&
1628 (get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && 1392 (get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&
1629 (op->face && !op->face->visibility)) { 1393 (op->face && !op->face->visibility)) {
1630 for (last=top; last != floor; last=last->below) 1394 for (last=top; last != floor; last=last->below)
1631 if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break; 1395 if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;
1632 /* Check to see if we found the object that blocks view, 1396 /* Check to see if we found the object that blocks view,
1633 * and make sure we have a below pointer for it so that 1397 * and make sure we have a below pointer for it so that
1634 * we can get inserted below this one, which requires we 1398 * we can get inserted below this one, which requires we
1635 * set top to the object below us. 1399 * set top to the object below us.
1636 */ 1400 */
1637 if (last && last->below && last != floor) top=last->below; 1401 if (last && last->below && last != floor) top=last->below;
1638 } 1402 }
1639 } /* If objects on this space */ 1403 } /* If objects on this space */
1640 if (flag & INS_MAP_LOAD) 1404 if (flag & INS_MAP_LOAD)
1641 top = GET_MAP_TOP(op->map,op->x,op->y); 1405 top = GET_MAP_TOP(op->map,op->x,op->y);
1642 if (flag & INS_ABOVE_FLOOR_ONLY) top = floor; 1406 if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;
1643 1407
1644 /* Top is the object that our object (op) is going to get inserted above. 1408 /* Top is the object that our object (op) is going to get inserted above.
1645 */ 1409 */
1646 1410
1647 /* First object on this space */ 1411 /* First object on this space */
1648 if (!top) { 1412 if (!top) {
1649 op->above = GET_MAP_OB(op->map, op->x, op->y); 1413 op->above = GET_MAP_OB(op->map, op->x, op->y);
1650 if (op->above) op->above->below = op; 1414 if (op->above) op->above->below = op;
1651 op->below = NULL; 1415 op->below = NULL;
1652 SET_MAP_OB(op->map, op->x, op->y, op); 1416 SET_MAP_OB(op->map, op->x, op->y, op);
1653 } else { /* get inserted into the stack above top */ 1417 } else { /* get inserted into the stack above top */
1654 op->above = top->above; 1418 op->above = top->above;
1655 if (op->above) op->above->below = op; 1419 if (op->above) op->above->below = op;
1656 op->below = top; 1420 op->below = top;
1657 top->above = op; 1421 top->above = op;
1658 } 1422 }
1659 if (op->above==NULL) 1423 if (op->above==NULL)
1660 SET_MAP_TOP(op->map,op->x, op->y, op); 1424 SET_MAP_TOP(op->map,op->x, op->y, op);
1661 } /* else not INS_BELOW_ORIGINATOR */ 1425 } /* else not INS_BELOW_ORIGINATOR */
1662 1426
1663 if(op->type==PLAYER) 1427 if(op->type==PLAYER)
1664 op->contr->do_los=1; 1428 op->contr->do_los=1;
1665 1429
1666 /* If we have a floor, we know the player, if any, will be above 1430 /* If we have a floor, we know the player, if any, will be above
1667 * it, so save a few ticks and start from there. 1431 * it, so save a few ticks and start from there.
1668 */ 1432 */
1669 if (!(flag & INS_MAP_LOAD)) 1433 if (!(flag & INS_MAP_LOAD))
1670 for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) { 1434 for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {
1671 if (tmp->type == PLAYER) 1435 if (tmp->type == PLAYER)
1672 tmp->contr->socket.update_look=1; 1436 tmp->contr->socket.update_look=1;
1673 } 1437 }
1674 1438
1675 /* If this object glows, it may affect lighting conditions that are 1439 /* If this object glows, it may affect lighting conditions that are
1676 * visible to others on this map. But update_all_los is really 1440 * visible to others on this map. But update_all_los is really
1677 * an inefficient way to do this, as it means los for all players 1441 * an inefficient way to do this, as it means los for all players
1678 * on the map will get recalculated. The players could very well 1442 * on the map will get recalculated. The players could very well
… …
1680 * this should get redone to only look for players within range, 1444 * this should get redone to only look for players within range,
1681 * or just updating the P_NEED_UPDATE for spaces within this area 1445 * or just updating the P_NEED_UPDATE for spaces within this area
1682 * of effect may be sufficient. 1446 * of effect may be sufficient.
1683 */ 1447 */
1684 if(MAP_DARKNESS(op->map) && (op->glow_radius != 0)) 1448 if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))
1685 update_all_los(op->map, op->x, op->y); 1449 update_all_los(op->map, op->x, op->y);
1686 1450
1687 1451
1688 /* updates flags (blocked, alive, no magic, etc) for this map space */ 1452 /* updates flags (blocked, alive, no magic, etc) for this map space */
1689 update_object(op,UP_OBJ_INSERT); 1453 update_object(op,UP_OBJ_INSERT);
1690 1454
… …
1700 1464
1701 /* if this is not the head or flag has been passed, don't check walk on status */ 1465 /* if this is not the head or flag has been passed, don't check walk on status */
1702 1466
1703 if (!(flag & INS_NO_WALK_ON) && !op->head) { 1467 if (!(flag & INS_NO_WALK_ON) && !op->head) {
1704 if (check_move_on(op, originator)) 1468 if (check_move_on(op, originator))
1705 return NULL; 1469 return NULL;
1706 1470
1707 /* If we are a multi part object, lets work our way through the check 1471 /* If we are a multi part object, lets work our way through the check
1708 * walk on's. 1472 * walk on's.
1709 */ 1473 */
1710 for (tmp=op->more; tmp!=NULL; tmp=tmp->more) 1474 for (tmp=op->more; tmp!=NULL; tmp=tmp->more)
1711 if (check_move_on (tmp, originator)) 1475 if (check_move_on (tmp, originator))
1712 return NULL; 1476 return NULL;
1713 } 1477 }
1714 return op; 1478 return op;
1715} 1479}
1716 1480
1717/* this function inserts an object in the map, but if it 1481/* this function inserts an object in the map, but if it
… …
1723 object *tmp1; 1487 object *tmp1;
1724 1488
1725 /* first search for itself and remove any old instances */ 1489 /* first search for itself and remove any old instances */
1726 1490
1727 for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) { 1491 for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) {
1728 if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ { 1492 if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ {
1729 remove_ob(tmp); 1493 remove_ob(tmp);
1730 free_object(tmp); 1494 free_object(tmp);
1731 } 1495 }
1732 } 1496 }
1733 1497
1734 tmp1=arch_to_object(find_archetype(arch_string)); 1498 tmp1=arch_to_object(find_archetype(arch_string));
1735 1499
1736 1500
… …
1749object *get_split_ob(object *orig_ob, uint32 nr) { 1513object *get_split_ob(object *orig_ob, uint32 nr) {
1750 object *newob; 1514 object *newob;
1751 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1515 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1752 1516
1753 if(orig_ob->nrof<nr) { 1517 if(orig_ob->nrof<nr) {
1754 sprintf(errmsg,"There are only %d %ss.", 1518 sprintf(errmsg,"There are only %d %ss.",
1755 orig_ob->nrof?orig_ob->nrof:1, orig_ob->name); 1519 orig_ob->nrof?orig_ob->nrof:1, &orig_ob->name);
1756 return NULL; 1520 return NULL;
1757 } 1521 }
1758 newob = object_create_clone(orig_ob); 1522 newob = object_create_clone(orig_ob);
1759 if((orig_ob->nrof-=nr)<1) { 1523 if((orig_ob->nrof-=nr)<1) {
1760 if ( ! is_removed) 1524 if ( ! is_removed)
1761 remove_ob(orig_ob); 1525 remove_ob(orig_ob);
1762 free_object2(orig_ob, 1); 1526 free_object2(orig_ob, 1);
1763 } 1527 }
1764 else if ( ! is_removed) { 1528 else if ( ! is_removed) {
1765 if(orig_ob->env!=NULL) 1529 if(orig_ob->env!=NULL)
1766 sub_weight (orig_ob->env,orig_ob->weight*nr); 1530 sub_weight (orig_ob->env,orig_ob->weight*nr);
1767 if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) { 1531 if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) {
1768 strcpy(errmsg, "Tried to split object whose map is not in memory."); 1532 strcpy(errmsg, "Tried to split object whose map is not in memory.");
1769 LOG(llevDebug, 1533 LOG(llevDebug,
1770 "Error, Tried to split object whose map is not in memory.\n"); 1534 "Error, Tried to split object whose map is not in memory.\n");
1771 return NULL; 1535 return NULL;
1772 } 1536 }
1773 } 1537 }
1774 newob->nrof=nr; 1538 newob->nrof=nr;
1775 1539
1776 return newob; 1540 return newob;
1777} 1541}
… …
1799 { 1563 {
1800 op->nrof -= i; 1564 op->nrof -= i;
1801 } 1565 }
1802 else if (op->env != NULL) 1566 else if (op->env != NULL)
1803 { 1567 {
1804 /* is this object in the players inventory, or sub container 1568 /* is this object in the players inventory, or sub container
1805 * therein? 1569 * therein?
1806 */ 1570 */
1807 tmp = is_player_inv (op->env); 1571 tmp = is_player_inv (op->env);
1808 /* nope. Is this a container the player has opened? 1572 /* nope. Is this a container the player has opened?
1809 * If so, set tmp to that player. 1573 * If so, set tmp to that player.
1810 * IMO, searching through all the players will mostly 1574 * IMO, searching through all the players will mostly
1811 * likely be quicker than following op->env to the map, 1575 * likely be quicker than following op->env to the map,
1812 * and then searching the map for a player. 1576 * and then searching the map for a player.
1813 */ 1577 */
1814 if (!tmp) { 1578 if (!tmp) {
1815 for (pl=first_player; pl; pl=pl->next) 1579 for (pl=first_player; pl; pl=pl->next)
1816 if (pl->ob->container == op->env) break; 1580 if (pl->ob->container == op->env) break;
1817 if (pl) tmp=pl->ob; 1581 if (pl) tmp=pl->ob;
1818 else tmp=NULL; 1582 else tmp=NULL;
1819 } 1583 }
1820 1584
1821 if (i < op->nrof) { 1585 if (i < op->nrof) {
1822 sub_weight (op->env, op->weight * i); 1586 sub_weight (op->env, op->weight * i);
1823 op->nrof -= i; 1587 op->nrof -= i;
1824 if (tmp) { 1588 if (tmp) {
… …
1832 } 1596 }
1833 } 1597 }
1834 } 1598 }
1835 else 1599 else
1836 { 1600 {
1837 object *above = op->above; 1601 object *above = op->above;
1838 1602
1839 if (i < op->nrof) { 1603 if (i < op->nrof) {
1840 op->nrof -= i; 1604 op->nrof -= i;
1841 } else { 1605 } else {
1842 remove_ob (op); 1606 remove_ob (op);
1843 op->nrof = 0; 1607 op->nrof = 0;
1844 } 1608 }
1845 /* Since we just removed op, op->above is null */ 1609 /* Since we just removed op, op->above is null */
1846 for (tmp = above; tmp != NULL; tmp = tmp->above) 1610 for (tmp = above; tmp != NULL; tmp = tmp->above)
1847 if (tmp->type == PLAYER) { 1611 if (tmp->type == PLAYER) {
1848 if (op->nrof) 1612 if (op->nrof)
1849 esrv_send_item(tmp, op); 1613 esrv_send_item(tmp, op);
1850 else 1614 else
… …
1902 LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg); 1666 LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg);
1903 return op; 1667 return op;
1904 } 1668 }
1905 if (where->head) { 1669 if (where->head) {
1906 LOG(llevDebug, 1670 LOG(llevDebug,
1907 "Warning: Tried to insert object wrong part of multipart object.\n"); 1671 "Warning: Tried to insert object wrong part of multipart object.\n");
1908 where = where->head; 1672 where = where->head;
1909 } 1673 }
1910 if (op->more) { 1674 if (op->more) {
1911 LOG(llevError, "Tried to insert multipart object %s (%d)\n", 1675 LOG(llevError, "Tried to insert multipart object %s (%d)\n",
1912 op->name, op->count); 1676 &op->name, op->count);
1913 return op; 1677 return op;
1914 } 1678 }
1915 CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL); 1679 CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL);
1916 CLEAR_FLAG(op, FLAG_REMOVED); 1680 CLEAR_FLAG(op, FLAG_REMOVED);
1917 if(op->nrof) { 1681 if(op->nrof) {
1918 for(tmp=where->inv;tmp!=NULL;tmp=tmp->below) 1682 for(tmp=where->inv;tmp!=NULL;tmp=tmp->below)
1919 if ( CAN_MERGE(tmp,op) ) { 1683 if ( CAN_MERGE(tmp,op) ) {
1920 /* return the original object and remove inserted object 1684 /* return the original object and remove inserted object
1921 (client needs the original object) */ 1685 (client needs the original object) */
1922 tmp->nrof += op->nrof; 1686 tmp->nrof += op->nrof;
1923 /* Weight handling gets pretty funky. Since we are adding to 1687 /* Weight handling gets pretty funky. Since we are adding to
1924 * tmp->nrof, we need to increase the weight. 1688 * tmp->nrof, we need to increase the weight.
1925 */ 1689 */
1926 add_weight (where, op->weight*op->nrof); 1690 add_weight (where, op->weight*op->nrof);
1927 SET_FLAG(op, FLAG_REMOVED); 1691 SET_FLAG(op, FLAG_REMOVED);
1928 free_object(op); /* free the inserted object */ 1692 free_object(op); /* free the inserted object */
1929 op = tmp; 1693 op = tmp;
1930 remove_ob (op); /* and fix old object's links */ 1694 remove_ob (op); /* and fix old object's links */
1931 CLEAR_FLAG(op, FLAG_REMOVED); 1695 CLEAR_FLAG(op, FLAG_REMOVED);
1932 break; 1696 break;
1933 } 1697 }
1934 1698
1935 /* I assume combined objects have no inventory 1699 /* I assume combined objects have no inventory
1936 * We add the weight - this object could have just been removed 1700 * We add the weight - this object could have just been removed
1937 * (if it was possible to merge). calling remove_ob will subtract 1701 * (if it was possible to merge). calling remove_ob will subtract
… …
1951 op->map=NULL; 1715 op->map=NULL;
1952 op->env=where; 1716 op->env=where;
1953 op->above=NULL; 1717 op->above=NULL;
1954 op->below=NULL; 1718 op->below=NULL;
1955 op->x=0,op->y=0; 1719 op->x=0,op->y=0;
1956 op->ox=0,op->oy=0;
1957 1720
1958 /* reset the light list and los of the players on the map */ 1721 /* reset the light list and los of the players on the map */
1959 if((op->glow_radius!=0)&&where->map) 1722 if((op->glow_radius!=0)&&where->map)
1960 { 1723 {
1961#ifdef DEBUG_LIGHTS 1724#ifdef DEBUG_LIGHTS
1962 LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", 1725 LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n",
1963 op->name); 1726 op->name);
1964#endif /* DEBUG_LIGHTS */ 1727#endif /* DEBUG_LIGHTS */
1965 if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y); 1728 if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y);
1966 } 1729 }
1967 1730
1968 /* Client has no idea of ordering so lets not bother ordering it here. 1731 /* Client has no idea of ordering so lets not bother ordering it here.
… …
2003{ 1766{
2004 object *tmp; 1767 object *tmp;
2005 tag_t tag; 1768 tag_t tag;
2006 mapstruct *m=op->map; 1769 mapstruct *m=op->map;
2007 int x=op->x, y=op->y; 1770 int x=op->x, y=op->y;
2008 MoveType move_on, move_slow, move_block; 1771 MoveType move_on, move_slow, move_block;
2009 1772
2010 if(QUERY_FLAG(op,FLAG_NO_APPLY)) 1773 if(QUERY_FLAG(op,FLAG_NO_APPLY))
2011 return 0; 1774 return 0;
2012 1775
2013 tag = op->count; 1776 tag = op->count;
2014 1777
2015 move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y); 1778 move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y);
2016 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y); 1779 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y);
… …
2020 * no need to do checking below. have to make sure move_type 1783 * no need to do checking below. have to make sure move_type
2021 * is set, as lots of objects don't have it set - we treat that 1784 * is set, as lots of objects don't have it set - we treat that
2022 * as walking. 1785 * as walking.
2023 */ 1786 */
2024 if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow)) 1787 if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))
2025 return 0; 1788 return 0;
2026 1789
2027 /* This is basically inverse logic of that below - basically, 1790 /* This is basically inverse logic of that below - basically,
2028 * if the object can avoid the move on or slow move, they do so, 1791 * if the object can avoid the move on or slow move, they do so,
2029 * but can't do it if the alternate movement they are using is 1792 * but can't do it if the alternate movement they are using is
2030 * blocked. Logic on this seems confusing, but does seem correct. 1793 * blocked. Logic on this seems confusing, but does seem correct.
2031 */ 1794 */
2032 if ((op->move_type & ~move_on & ~move_block) != 0 && 1795 if ((op->move_type & ~move_on & ~move_block) != 0 &&
2033 (op->move_type & ~move_slow & ~move_block) != 0) return 0; 1796 (op->move_type & ~move_slow & ~move_block) != 0) return 0;
2034 1797
2035 /* The objects have to be checked from top to bottom. 1798 /* The objects have to be checked from top to bottom.
2036 * Hence, we first go to the top: 1799 * Hence, we first go to the top:
2037 */ 1800 */
2038 1801
2039 for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL && 1802 for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL &&
2040 tmp->above!=NULL; tmp=tmp->above) { 1803 tmp->above!=NULL; tmp=tmp->above) {
2041 /* Trim the search when we find the first other spell effect 1804 /* Trim the search when we find the first other spell effect
2042 * this helps performance so that if a space has 50 spell objects, 1805 * this helps performance so that if a space has 50 spell objects,
2043 * we don't need to check all of them. 1806 * we don't need to check all of them.
2044 */ 1807 */
2045 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break; 1808 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break;
2046 } 1809 }
2047 for(;tmp!=NULL; tmp=tmp->below) { 1810 for(;tmp!=NULL; tmp=tmp->below) {
2048 if (tmp == op) continue; /* Can't apply yourself */ 1811 if (tmp == op) continue; /* Can't apply yourself */
2049 1812
2050 /* Check to see if one of the movement types should be slowed down. 1813 /* Check to see if one of the movement types should be slowed down.
2051 * Second check makes sure that the movement types not being slowed 1814 * Second check makes sure that the movement types not being slowed
2052 * (~slow_move) is not blocked on this space - just because the 1815 * (~slow_move) is not blocked on this space - just because the
2053 * space doesn't slow down swimming (for example), if you can't actually 1816 * space doesn't slow down swimming (for example), if you can't actually
2054 * swim on that space, can't use it to avoid the penalty. 1817 * swim on that space, can't use it to avoid the penalty.
2055 */ 1818 */
2056 if (!QUERY_FLAG(op, FLAG_WIZPASS)) { 1819 if (!QUERY_FLAG(op, FLAG_WIZPASS)) {
2057 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1820 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
2058 ((op->move_type & tmp->move_slow) && 1821 ((op->move_type & tmp->move_slow) &&
2059 (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) { 1822 (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) {
2060 1823
2061 float diff; 1824 float diff;
2062 1825
2063 diff = tmp->move_slow_penalty*FABS(op->speed); 1826 diff = tmp->move_slow_penalty*FABS(op->speed);
2064 if (op->type == PLAYER) { 1827 if (op->type == PLAYER) {
2065 if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) || 1828 if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) ||
2066 (QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) { 1829 (QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) {
2067 diff /= 4.0; 1830 diff /= 4.0;
2068 } 1831 }
2069 } 1832 }
2070 op->speed_left -= diff; 1833 op->speed_left -= diff;
2071 } 1834 }
2072 } 1835 }
2073 1836
2074 /* Basically same logic as above, except now for actual apply. */ 1837 /* Basically same logic as above, except now for actual apply. */
2075 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1838 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
2076 ((op->move_type & tmp->move_on) && 1839 ((op->move_type & tmp->move_on) &&
2077 (op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) { 1840 (op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) {
2078 1841
2079 move_apply(tmp, op, originator); 1842 move_apply(tmp, op, originator);
2080 if (was_destroyed (op, tag)) 1843 if (was_destroyed (op, tag))
2081 return 1; 1844 return 1;
2082 1845
2083 /* what the person/creature stepped onto has moved the object 1846 /* what the person/creature stepped onto has moved the object
2084 * someplace new. Don't process any further - if we did, 1847 * someplace new. Don't process any further - if we did,
2085 * have a feeling strange problems would result. 1848 * have a feeling strange problems would result.
2086 */ 1849 */
2087 if (op->map != m || op->x != x || op->y != y) return 0; 1850 if (op->map != m || op->x != x || op->y != y) return 0;
2088 } 1851 }
2089 } 1852 }
2090 return 0; 1853 return 0;
2091} 1854}
2092 1855
2093/* 1856/*
… …
2157 1920
2158object *present_in_ob_by_name(int type, const char *str, const object *op) { 1921object *present_in_ob_by_name(int type, const char *str, const object *op) {
2159 object *tmp; 1922 object *tmp;
2160 1923
2161 for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) { 1924 for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) {
2162 if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name))) 1925 if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name)))
2163 return tmp; 1926 return tmp;
2164 } 1927 }
2165 return NULL; 1928 return NULL;
2166} 1929}
2167 1930
2168/* 1931/*
… …
2238int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) { 2001int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) {
2239 int i,index=0, flag; 2002 int i,index=0, flag;
2240 static int altern[SIZEOFFREE]; 2003 static int altern[SIZEOFFREE];
2241 2004
2242 for(i=start;i<stop;i++) { 2005 for(i=start;i<stop;i++) {
2243 flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]); 2006 flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]);
2244 if(!flag) 2007 if(!flag)
2245 altern[index++]=i; 2008 altern[index++]=i;
2246 2009
2247 /* Basically, if we find a wall on a space, we cut down the search size. 2010 /* Basically, if we find a wall on a space, we cut down the search size.
2248 * In this way, we won't return spaces that are on another side of a wall. 2011 * In this way, we won't return spaces that are on another side of a wall.
2249 * This mostly work, but it cuts down the search size in all directions - 2012 * This mostly work, but it cuts down the search size in all directions -
2250 * if the space being examined only has a wall to the north and empty 2013 * if the space being examined only has a wall to the north and empty
2251 * spaces in all the other directions, this will reduce the search space 2014 * spaces in all the other directions, this will reduce the search space
2252 * to only the spaces immediately surrounding the target area, and 2015 * to only the spaces immediately surrounding the target area, and
2253 * won't look 2 spaces south of the target space. 2016 * won't look 2 spaces south of the target space.
2254 */ 2017 */
2255 else if ((flag & AB_NO_PASS) && maxfree[i]<stop) 2018 else if ((flag & AB_NO_PASS) && maxfree[i]<stop)
2256 stop=maxfree[i]; 2019 stop=maxfree[i];
2257 } 2020 }
2258 if(!index) return -1; 2021 if(!index) return -1;
2259 return altern[RANDOM()%index]; 2022 return altern[RANDOM()%index];
2260} 2023}
2261 2024
… …
2267 */ 2030 */
2268 2031
2269int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) { 2032int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) {
2270 int i; 2033 int i;
2271 for(i=0;i<SIZEOFFREE;i++) { 2034 for(i=0;i<SIZEOFFREE;i++) {
2272 if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i])) 2035 if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]))
2273 return i; 2036 return i;
2274 } 2037 }
2275 return -1; 2038 return -1;
2276} 2039}
2277 2040
2278/* 2041/*
… …
2284 int i, j, tmp, len; 2047 int i, j, tmp, len;
2285 2048
2286 len = end-begin; 2049 len = end-begin;
2287 for(i = begin; i < end; i++) 2050 for(i = begin; i < end; i++)
2288 { 2051 {
2289 j = begin+RANDOM()%len; 2052 j = begin+RANDOM()%len;
2290 2053
2291 tmp = arr[i]; 2054 tmp = arr[i];
2292 arr[i] = arr[j]; 2055 arr[i] = arr[j];
2293 arr[j] = tmp; 2056 arr[j] = tmp;
2294 } 2057 }
2295} 2058}
2296 2059
2297/* new function to make monster searching more efficient, and effective! 2060/* new function to make monster searching more efficient, and effective!
2298 * This basically returns a randomized array (in the passed pointer) of 2061 * This basically returns a randomized array (in the passed pointer) of
… …
2305{ 2068{
2306 int i; 2069 int i;
2307 2070
2308 for(i = 0; i < SIZEOFFREE; i++) 2071 for(i = 0; i < SIZEOFFREE; i++)
2309 { 2072 {
2310 search_arr[i] = i; 2073 search_arr[i] = i;
2311 } 2074 }
2312 2075
2313 permute(search_arr, 1, SIZEOFFREE1+1); 2076 permute(search_arr, 1, SIZEOFFREE1+1);
2314 permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1); 2077 permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1);
2315 permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE); 2078 permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE);
… …
2331int find_dir(mapstruct *m, int x, int y, object *exclude) { 2094int find_dir(mapstruct *m, int x, int y, object *exclude) {
2332 int i,max=SIZEOFFREE, mflags; 2095 int i,max=SIZEOFFREE, mflags;
2333 sint16 nx, ny; 2096 sint16 nx, ny;
2334 object *tmp; 2097 object *tmp;
2335 mapstruct *mp; 2098 mapstruct *mp;
2336 MoveType blocked, move_type; 2099 MoveType blocked, move_type;
2337 2100
2338 if (exclude && exclude->head) { 2101 if (exclude && exclude->head) {
2339 exclude = exclude->head; 2102 exclude = exclude->head;
2340 move_type = exclude->move_type; 2103 move_type = exclude->move_type;
2341 } else { 2104 } else {
2342 /* If we don't have anything, presume it can use all movement types. */ 2105 /* If we don't have anything, presume it can use all movement types. */
2343 move_type=MOVE_ALL; 2106 move_type=MOVE_ALL;
2344 } 2107 }
2345 2108
2346 for(i=1;i<max;i++) { 2109 for(i=1;i<max;i++) {
2347 mp = m; 2110 mp = m;
2348 nx = x + freearr_x[i]; 2111 nx = x + freearr_x[i];
2349 ny = y + freearr_y[i]; 2112 ny = y + freearr_y[i];
2350 2113
2351 mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny); 2114 mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny);
2352 if (mflags & P_OUT_OF_MAP) { 2115 if (mflags & P_OUT_OF_MAP) {
2353 max = maxfree[i]; 2116 max = maxfree[i];
2354 } else { 2117 } else {
2355 blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny); 2118 blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny);
2356 2119
2357 if ((move_type & blocked) == move_type) { 2120 if ((move_type & blocked) == move_type) {
2358 max=maxfree[i]; 2121 max=maxfree[i];
2359 } else if (mflags & P_IS_ALIVE) { 2122 } else if (mflags & P_IS_ALIVE) {
2360 for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) { 2123 for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) {
2361 if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) && 2124 if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) &&
2362 (tmp != exclude ||(tmp->head && tmp->head != exclude))) { 2125 (tmp != exclude ||(tmp->head && tmp->head != exclude))) {
2363 break; 2126 break;
2364 } 2127 }
2365 } 2128 }
2366 if(tmp) { 2129 if(tmp) {
2367 return freedir[i]; 2130 return freedir[i];
2368 } 2131 }
2369 } 2132 }
2370 } 2133 }
2371 } 2134 }
2372 return 0; 2135 return 0;
2373} 2136}
2374 2137
2375/* 2138/*
… …
2539 if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0; 2302 if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0;
2540 2303
2541 /* yes, can see. */ 2304 /* yes, can see. */
2542 if(dir < 9) return 1; 2305 if(dir < 9) return 1;
2543 return can_see_monsterP(m, x, y, reduction_dir[dir][0]) | 2306 return can_see_monsterP(m, x, y, reduction_dir[dir][0]) |
2544 can_see_monsterP(m,x,y, reduction_dir[dir][1]) | 2307 can_see_monsterP(m,x,y, reduction_dir[dir][1]) |
2545 can_see_monsterP(m,x,y, reduction_dir[dir][2]); 2308 can_see_monsterP(m,x,y, reduction_dir[dir][2]);
2546} 2309}
2547 2310
2548 2311
2549 2312
2550/* 2313/*
2551 * can_pick(picker, item): finds out if an object is possible to be 2314 * can_pick(picker, item): finds out if an object is possible to be
2552 * picked up by the picker. Returnes 1 if it can be 2315 * picked up by the picker. Returnes 1 if it can be
2553 * picked up, otherwise 0. 2316 * picked up, otherwise 0.
2554 * 2317 *
… …
2559 */ 2322 */
2560 2323
2561int can_pick(const object *who, const object *item) { 2324int can_pick(const object *who, const object *item) {
2562 return /*QUERY_FLAG(who,FLAG_WIZ)||*/ 2325 return /*QUERY_FLAG(who,FLAG_WIZ)||*/
2563 (item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&& 2326 (item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&&
2564 !QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible && 2327 !QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible &&
2565 (who->type==PLAYER||item->weight<who->weight/3)); 2328 (who->type==PLAYER||item->weight<who->weight/3));
2566} 2329}
2567 2330
2568 2331
2569/* 2332/*
… …
2594 prev->more = tmp; 2357 prev->more = tmp;
2595 prev = tmp; 2358 prev = tmp;
2596 } 2359 }
2597 /*** copy inventory ***/ 2360 /*** copy inventory ***/
2598 for(item = src->inv; item; item = item->below) { 2361 for(item = src->inv; item; item = item->below) {
2599 (void) insert_ob_in_ob(object_create_clone(item),dst); 2362 (void) insert_ob_in_ob(object_create_clone(item),dst);
2600 } 2363 }
2601 2364
2602 return dst; 2365 return dst;
2603} 2366}
2604 2367
… …
2618/* Also remember that multiparts objects are not supported for now. */ 2381/* Also remember that multiparts objects are not supported for now. */
2619 2382
2620object* load_object_str(const char *obstr) 2383object* load_object_str(const char *obstr)
2621{ 2384{
2622 object *op; 2385 object *op;
2623 FILE *tempfile;
2624 char filename[MAX_BUF]; 2386 char filename[MAX_BUF];
2625 sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir); 2387 sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir);
2388
2626 tempfile=fopen(filename,"w"); 2389 FILE *tempfile=fopen(filename,"w");
2627 if (tempfile == NULL) 2390 if (tempfile == NULL)
2628 { 2391 {
2629 LOG(llevError,"Error - Unable to access load object temp file\n"); 2392 LOG(llevError,"Error - Unable to access load object temp file\n");
2630 return NULL; 2393 return NULL;
2631 }; 2394 };
2632 fprintf(tempfile,obstr); 2395 fprintf(tempfile,obstr);
2633 fclose(tempfile); 2396 fclose(tempfile);
2634 2397
2635 op=get_object(); 2398 op=get_object();
2636 2399
2637 tempfile=fopen(filename,"r"); 2400 object_thawer thawer (filename);
2638 if (tempfile == NULL) 2401
2639 { 2402 if (thawer)
2640 LOG(llevError,"Error - Unable to read object temp file\n"); 2403 load_object(thawer,op,0);
2641 return NULL; 2404
2642 };
2643 load_object(tempfile,op,LO_NEWFILE,0);
2644 LOG(llevDebug," load str completed, object=%s\n",op->name); 2405 LOG(llevDebug," load str completed, object=%s\n", &op->name);
2645 CLEAR_FLAG(op,FLAG_REMOVED); 2406 CLEAR_FLAG(op,FLAG_REMOVED);
2646 fclose(tempfile); 2407
2647 return op; 2408 return op;
2648} 2409}
2649 2410
2650/* This returns the first object in who's inventory that 2411/* This returns the first object in who's inventory that
2651 * has the same type and subtype match. 2412 * has the same type and subtype match.
… …
2654object *find_obj_by_type_subtype(const object *who, int type, int subtype) 2415object *find_obj_by_type_subtype(const object *who, int type, int subtype)
2655{ 2416{
2656 object *tmp; 2417 object *tmp;
2657 2418
2658 for (tmp=who->inv; tmp; tmp=tmp->below) 2419 for (tmp=who->inv; tmp; tmp=tmp->below)
2659 if (tmp->type == type && tmp->subtype == subtype) return tmp; 2420 if (tmp->type == type && tmp->subtype == subtype) return tmp;
2660 2421
2661 return NULL; 2422 return NULL;
2662} 2423}
2663 2424
2664/* If ob has a field named key, return the link from the list, 2425/* If ob has a field named key, return the link from the list,
… …
2688 */ 2449 */
2689const char * get_ob_key_value(const object * op, const char * const key) { 2450const char * get_ob_key_value(const object * op, const char * const key) {
2690 key_value * link; 2451 key_value * link;
2691 const char * canonical_key; 2452 const char * canonical_key;
2692 2453
2693 canonical_key = find_string(key); 2454 canonical_key = shstr::find (key);
2694 2455
2695 if (canonical_key == NULL) { 2456 if (canonical_key == NULL) {
2696 /* 1. There being a field named key on any object 2457 /* 1. There being a field named key on any object
2697 * implies there'd be a shared string to find. 2458 * implies there'd be a shared string to find.
2698 * 2. Since there isn't, no object has this field. 2459 * 2. Since there isn't, no object has this field.
… …
2721 * Unless add_key is TRUE, it won't add fields, only change the value of existing 2482 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2722 * keys. 2483 * keys.
2723 * 2484 *
2724 * Returns TRUE on success. 2485 * Returns TRUE on success.
2725 */ 2486 */
2726int set_ob_key_value_s(object * op, const char * canonical_key, const char * value, int add_key) { 2487int set_ob_key_value_s(object * op, const shstr &canonical_key, const char * value, int add_key) {
2727 key_value * field = NULL, *last=NULL; 2488 key_value * field = NULL, *last=NULL;
2728 2489
2729 for (field=op->key_values; field != NULL; field=field->next) { 2490 for (field=op->key_values; field != NULL; field=field->next) {
2730 if (field->key != canonical_key) { 2491 if (field->key != canonical_key) {
2731 last = field; 2492 last = field;
2732 continue; 2493 continue;
2733 } 2494 }
2734 2495
2735 if (field->value) FREE_AND_CLEAR_STR(field->value); 2496 if (value)
2736 if (value) 2497 field->value = value;
2737 field->value = add_string(value); 2498 else {
2738 else {
2739 /* Basically, if the archetype has this key set, 2499 /* Basically, if the archetype has this key set,
2740 * we need to store the null value so when we save 2500 * we need to store the null value so when we save
2741 * it, we save the empty value so that when we load, 2501 * it, we save the empty value so that when we load,
2742 * we get this value back again. 2502 * we get this value back again.
2743 */ 2503 */
2744 if (get_ob_key_link(&op->arch->clone, canonical_key)) 2504 if (get_ob_key_link (&op->arch->clone, canonical_key))
2745 field->value = NULL; 2505 field->value = 0;
2746 else { 2506 else
2747 /* Delete this link */ 2507 {
2748 if (field->key) FREE_AND_CLEAR_STR(field->key);
2749 if (field->value) FREE_AND_CLEAR_STR(field->value);
2750 if (last) last->next = field->next; 2508 if (last) last->next = field->next;
2751 else op->key_values = field->next; 2509 else op->key_values = field->next;
2752 free(field); 2510
2753 } 2511 delete field;
2754 } 2512 }
2513 }
2755 return TRUE; 2514 return TRUE;
2756 } 2515 }
2757 /* IF we get here, key doesn't exist */ 2516 /* IF we get here, key doesn't exist */
2758 2517
2759 /* No field, we'll have to add it. */ 2518 /* No field, we'll have to add it. */
… …
2767 * be here. If user wants to store empty strings, 2526 * be here. If user wants to store empty strings,
2768 * should pass in "" 2527 * should pass in ""
2769 */ 2528 */
2770 if (value == NULL) return TRUE; 2529 if (value == NULL) return TRUE;
2771 2530
2772 field = (key_value *) malloc(sizeof(key_value)); 2531 field = new key_value;
2773 2532
2774 field->key = add_refcount(canonical_key); 2533 field->key = canonical_key;
2775 field->value = add_string(value); 2534 field->value = value;
2776 /* Usual prepend-addition. */ 2535 /* Usual prepend-addition. */
2777 field->next = op->key_values; 2536 field->next = op->key_values;
2778 op->key_values = field; 2537 op->key_values = field;
2779 2538
2780 return TRUE; 2539 return TRUE;
… …
2787 * and not add new ones. 2546 * and not add new ones.
2788 * In general, should be little reason FALSE is ever passed in for add_key 2547 * In general, should be little reason FALSE is ever passed in for add_key
2789 * 2548 *
2790 * Returns TRUE on success. 2549 * Returns TRUE on success.
2791 */ 2550 */
2792int set_ob_key_value(object * op, const char * key, const char * value, int add_key) { 2551int set_ob_key_value(object * op, const char *key, const char * value, int add_key)
2793 const char * canonical_key = NULL; 2552{
2794 int floating_ref = FALSE; 2553 shstr key_ (key);
2795 int ret;
2796
2797 /* HACK This mess is to make sure set_ob_value() passes a shared string
2798 * to get_ob_key_link(), without leaving a leaked refcount.
2799 */
2800
2801 canonical_key = find_string(key);
2802 if (canonical_key == NULL) {
2803 canonical_key = add_string(key);
2804 floating_ref = TRUE;
2805 }
2806
2807 ret = set_ob_key_value_s(op, canonical_key, value, add_key); 2554 return set_ob_key_value_s (op, key_, value, add_key);
2808
2809 if (floating_ref) {
2810 free_string(canonical_key);
2811 }
2812
2813 return ret;
2814} 2555}

Diff Legend

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