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.19 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.30 by root, Mon Sep 11 20:28:37 2006 UTC

1/*
2 * static char *rcsid_object_c =
3 * "$Id: object.C,v 1.19 2006/09/08 17:14:07 root Exp $";
4 */
5 1
6/* 2/*
7 CrossFire, A Multiplayer game for X-windows 3 CrossFire, A Multiplayer game for X-windows
8 4
9 Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
… …
28 24
29/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. 25/* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects.
30 sub/add_weight will transcend the environment updating the carrying 26 sub/add_weight will transcend the environment updating the carrying
31 variable. */ 27 variable. */
32#include <global.h> 28#include <global.h>
33#ifndef WIN32 /* ---win32 exclude headers */
34#include <stdio.h> 29#include <stdio.h>
35#include <sys/types.h> 30#include <sys/types.h>
36#include <sys/uio.h> 31#include <sys/uio.h>
37#endif /* win32 */
38#include <object.h> 32#include <object.h>
39#include <funcpoint.h> 33#include <funcpoint.h>
40#include <skills.h> 34#include <skills.h>
41#include <loader.h> 35#include <loader.h>
36
42int nrofallocobjects = 0; 37int nrofallocobjects = 0;
43 38
44object *objects; /* Pointer to the list of used objects */ 39object *objects; /* Pointer to the list of used objects */
45object *active_objects; /* List of active objects that need to be processed */ 40object *active_objects; /* List of active objects that need to be processed */
46 41
47short freearr_x[SIZEOFFREE]= 42short freearr_x[SIZEOFFREE] = { 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,
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}; 43 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1
50short freearr_y[SIZEOFFREE]= 44};
51 {0,-1,-1,0,1,1,1,0,-1,-2,-2,-2,-1,0,1,2,2,2,2,2,1,0,-1,-2,-2, 45short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2,
52 -3,-3,-3,-3,-2,-1,0,1,2,3,3,3,3,3,3,3,2,1,0,-1,-2,-3,-3,-3}; 46 -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3
53int maxfree[SIZEOFFREE]= 47};
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, 48int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45,
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}; 49 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
50};
56int freedir[SIZEOFFREE]= { 51int freedir[SIZEOFFREE] = {
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, 52 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,
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}; 53 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8
59 54};
60 55
61/* Returns TRUE if every key_values in wants has a partner with the same value in has. */ 56/* Returns TRUE if every key_values in wants has a partner with the same value in has. */
57static int
62static int compare_ob_value_lists_one(const object * wants, const object * has) { 58compare_ob_value_lists_one (const object *wants, const object *has)
59{
63 key_value * wants_field; 60 key_value *wants_field;
64 61
65 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both 62 /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both
66 * objects with lists are rare, and lists stay short. If not, use a 63 * objects with lists are rare, and lists stay short. If not, use a
67 * different structure or at least keep the lists sorted... 64 * different structure or at least keep the lists sorted...
68 */ 65 */
69 66
70 /* For each field in wants, */ 67 /* For each field in wants, */
71 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next) { 68 for (wants_field = wants->key_values; wants_field != NULL; wants_field = wants_field->next)
69 {
72 key_value * has_field; 70 key_value *has_field;
73 71
74 /* Look for a field in has with the same key. */ 72 /* Look for a field in has with the same key. */
75 has_field = get_ob_key_link(has, wants_field->key); 73 has_field = get_ob_key_link (has, wants_field->key);
74
75 if (has_field == NULL)
76 76 {
77 if (has_field == NULL) {
78 /* No field with that name. */ 77 /* No field with that name. */
79 return FALSE; 78 return FALSE;
80 }
81 79 }
80
82 /* Found the matching field. */ 81 /* Found the matching field. */
83 if (has_field->value != wants_field->value) { 82 if (has_field->value != wants_field->value)
83 {
84 /* Values don't match, so this half of the comparison is false. */ 84 /* Values don't match, so this half of the comparison is false. */
85 return FALSE; 85 return FALSE;
86 } 86 }
87 87
88 /* If we get here, we found a match. Now for the next field in wants. */ 88 /* If we get here, we found a match. Now for the next field in wants. */
89 }
90 89 }
90
91 /* If we get here, every field in wants has a matching field in has. */ 91 /* If we get here, every field in wants has a matching field in has. */
92 return TRUE; 92 return TRUE;
93} 93}
94 94
95/* Returns TRUE if ob1 has the same key_values as ob2. */ 95/* Returns TRUE if ob1 has the same key_values as ob2. */
96static int
96static int compare_ob_value_lists(const object * ob1, const object * ob2) { 97compare_ob_value_lists (const object *ob1, const object *ob2)
98{
97 /* However, there may be fields in has which aren't partnered in wants, 99 /* However, there may be fields in has which aren't partnered in wants,
98 * so we need to run the comparison *twice*. :( 100 * so we need to run the comparison *twice*. :(
99 */ 101 */
100 return compare_ob_value_lists_one(ob1, ob2) && compare_ob_value_lists_one(ob2, ob1); 102 return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1);
101} 103}
102 104
103/* Function examines the 2 objects given to it, and returns true if 105/* Function examines the 2 objects given to it, and returns true if
104 * they can be merged together. 106 * they can be merged together.
105 * 107 *
… …
111 * 113 *
112 * Improvements made with merge: Better checking on potion, and also 114 * Improvements made with merge: Better checking on potion, and also
113 * check weight 115 * check weight
114 */ 116 */
115 117
116bool
117object::can_merge (object *ob1, object *ob2) 118bool object::can_merge (object *ob1, object *ob2)
118{ 119{
119 /* A couple quicksanity checks */ 120 /* A couple quicksanity checks */
120 if ((ob1 == ob2) || (ob1->type != ob2->type)) 121 if ((ob1 == ob2) || (ob1->type != ob2->type))
121 return 0; 122 return 0;
122 123
… …
170 (ob1->subtype != ob2->subtype) || 171 (ob1->subtype != ob2->subtype) ||
171 (ob1->move_type != ob2->move_type) || 172 (ob1->move_type != ob2->move_type) ||
172 (ob1->move_block != ob2->move_block) || 173 (ob1->move_block != ob2->move_block) ||
173 (ob1->move_allow != ob2->move_allow) || 174 (ob1->move_allow != ob2->move_allow) ||
174 (ob1->move_on != ob2->move_on) || 175 (ob1->move_on != ob2->move_on) ||
175 (ob1->move_off != ob2->move_off) || 176 (ob1->move_off != ob2->move_off) || (ob1->move_slow != ob2->move_slow) || (ob1->move_slow_penalty != ob2->move_slow_penalty))
176 (ob1->move_slow != ob2->move_slow) ||
177 (ob1->move_slow_penalty != ob2->move_slow_penalty))
178 return 0; 177 return 0;
179 178
180 /* This is really a spellbook check - really, we should 179 /* This is really a spellbook check - really, we should
181 * check all objects in the inventory. 180 * check all objects in the inventory.
182 */ 181 */
183 if (ob1->inv || ob2->inv) 182 if (ob1->inv || ob2->inv)
184 { 183 {
185 /* if one object has inventory but the other doesn't, not equiv */ 184 /* if one object has inventory but the other doesn't, not equiv */
186 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) 185 if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv))
187 return 0; 186 return 0;
188 187
189 /* Now check to see if the two inventory objects could merge */ 188 /* Now check to see if the two inventory objects could merge */
190 if (!CAN_MERGE (ob1->inv, ob2->inv)) 189 if (!CAN_MERGE (ob1->inv, ob2->inv))
191 return 0; 190 return 0;
192 191
193 /* 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
194 * if it is valid. 193 * if it is valid.
195 */ 194 */
196 } 195 }
… …
204 203
205 /* Note sure why the following is the case - either the object has to 204 /* Note sure why the following is the case - either the object has to
206 * be animated or have a very low speed. Is this an attempted monster 205 * be animated or have a very low speed. Is this an attempted monster
207 * check? 206 * check?
208 */ 207 */
209 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) 208 if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
210 && FABS ((ob1)->speed) > MIN_ACTIVE_SPEED)
211 return 0; 209 return 0;
212 210
213 switch (ob1->type) 211 switch (ob1->type)
214 { 212 {
215 case SCROLL: 213 case SCROLL:
216 if (ob1->level != ob2->level) 214 if (ob1->level != ob2->level)
217 return 0; 215 return 0;
218 break; 216 break;
219 } 217 }
220 218
221 if (ob1->key_values != NULL || ob2->key_values != NULL) 219 if (ob1->key_values != NULL || ob2->key_values != NULL)
222 { 220 {
223 /* At least one of these has key_values. */ 221 /* At least one of these has key_values. */
224 if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) 222 if ((ob1->key_values == NULL) != (ob2->key_values == NULL))
225 /* One has fields, but the other one doesn't. */ 223 /* One has fields, but the other one doesn't. */
226 return 0; 224 return 0;
227 else if (!compare_ob_value_lists (ob1, ob2)) 225 else if (!compare_ob_value_lists (ob1, ob2))
228 return 0; 226 return 0;
229 } 227 }
230 228
231 //TODO: generate an event or call into perl for additional checks 229 //TODO: generate an event or call into perl for additional checks
232 if (ob1->self || ob2->self) 230 if (ob1->self || ob2->self)
233 { 231 {
234 ob1->optimise (); 232 ob1->optimise ();
235 ob2->optimise (); 233 ob2->optimise ();
236 234
237 if (ob1->self || ob2->self) 235 if (ob1->self || ob2->self)
238 return 0; 236 return 0;
239 } 237 }
240 238
241 /* Everything passes, must be OK. */ 239 /* Everything passes, must be OK. */
242 return 1; 240 return 1;
243} 241}
242
244/* 243/*
245 * sum_weight() is a recursive function which calculates the weight 244 * sum_weight() is a recursive function which calculates the weight
246 * 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
247 * containers are carrying, and sums it up. 246 * containers are carrying, and sums it up.
248 */ 247 */
249signed long sum_weight(object *op) { 248long
249sum_weight (object *op)
250{
250 signed long sum; 251 long sum;
251 object *inv; 252 object *inv;
253
252 for(sum = 0, inv = op->inv; inv != NULL; inv = inv->below) { 254 for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below)
255 {
253 if (inv->inv) 256 if (inv->inv)
254 sum_weight(inv); 257 sum_weight (inv);
255 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); 258 sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1);
256 } 259 }
257 if (op->type == CONTAINER && op->stats.Str) 260 if (op->type == CONTAINER && op->stats.Str)
258 sum = (sum * (100 - op->stats.Str))/100; 261 sum = (sum * (100 - op->stats.Str)) / 100;
259 if(op->carrying != sum) 262 if (op->carrying != sum)
260 op->carrying = sum; 263 op->carrying = sum;
261 return sum; 264 return sum;
262} 265}
263 266
264/** 267/**
265 * Return the outermost environment object for a given object. 268 * Return the outermost environment object for a given object.
266 */ 269 */
267 270
271object *
268object *object_get_env_recursive (object *op) { 272object_get_env_recursive (object *op)
273{
269 while (op->env != NULL) 274 while (op->env != NULL)
270 op = op->env; 275 op = op->env;
271 return op; 276 return op;
272} 277}
273 278
274/* 279/*
275 * Eneq(@csd.uu.se): Since we can have items buried in a character we need 280 * Eneq(@csd.uu.se): Since we can have items buried in a character we need
276 * a better check. We basically keeping traversing up until we can't 281 * a better check. We basically keeping traversing up until we can't
277 * or find a player. 282 * or find a player.
278 */ 283 */
279 284
285object *
280object *is_player_inv (object *op) { 286is_player_inv (object *op)
287{
281 for (;op!=NULL&&op->type!=PLAYER; op=op->env) 288 for (; op != NULL && op->type != PLAYER; op = op->env)
282 if (op->env==op) 289 if (op->env == op)
283 op->env = NULL; 290 op->env = NULL;
284 return op; 291 return op;
285} 292}
286 293
287/* 294/*
288 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. 295 * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump.
289 * Some error messages. 296 * Some error messages.
290 * The result of the dump is stored in the static global errmsg array. 297 * The result of the dump is stored in the static global errmsg array.
291 */ 298 */
292 299
300void
293void dump_object2(object *op) { 301dump_object2 (object *op)
302{
294errmsg[0] = 0; 303 errmsg[0] = 0;
295return; 304 return;
296 //TODO//D#d# 305 //TODO//D#d#
297#if 0 306#if 0
298 char *cp; 307 char *cp;
308
299/* object *tmp;*/ 309/* object *tmp;*/
300 310
301 if(op->arch!=NULL) { 311 if (op->arch != NULL)
312 {
302 strcat(errmsg,"arch "); 313 strcat (errmsg, "arch ");
303 strcat(errmsg,op->arch->name?op->arch->name:"(null)"); 314 strcat (errmsg, op->arch->name ? op->arch->name : "(null)");
304 strcat(errmsg,"\n"); 315 strcat (errmsg, "\n");
305 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL) 316 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
306 strcat(errmsg,cp); 317 strcat (errmsg, cp);
307#if 0 318# if 0
308 /* Don't dump player diffs - they are too long, mostly meaningless, and 319 /* Don't dump player diffs - they are too long, mostly meaningless, and
309 * will overflow the buffer. 320 * will overflow the buffer.
310 * Changed so that we don't dump inventory either. This may 321 * Changed so that we don't dump inventory either. This may
311 * also overflow the buffer. 322 * also overflow the buffer.
312 */ 323 */
313 if(op->type!=PLAYER && (cp=get_ob_diff(op,&empty_archetype->clone))!=NULL) 324 if (op->type != PLAYER && (cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
314 strcat(errmsg,cp); 325 strcat (errmsg, cp);
315 for (tmp=op->inv; tmp; tmp=tmp->below) 326 for (tmp = op->inv; tmp; tmp = tmp->below)
316 dump_object2(tmp); 327 dump_object2 (tmp);
328# endif
329 strcat (errmsg, "end\n");
330 }
331 else
332 {
333 strcat (errmsg, "Object ");
334 if (op->name == NULL)
335 strcat (errmsg, "(null)");
336 else
337 strcat (errmsg, op->name);
338 strcat (errmsg, "\n");
339# if 0
340 if ((cp = get_ob_diff (op, &empty_archetype->clone)) != NULL)
341 strcat (errmsg, cp);
342 for (tmp = op->inv; tmp; tmp = tmp->below)
343 dump_object2 (tmp);
344# endif
345 strcat (errmsg, "end\n");
346 }
317#endif 347#endif
318 strcat(errmsg,"end\n");
319 } else {
320 strcat(errmsg,"Object ");
321 if (op->name==NULL) strcat(errmsg, "(null)");
322 else strcat(errmsg,op->name);
323 strcat(errmsg,"\n");
324#if 0
325 if((cp=get_ob_diff(op,&empty_archetype->clone))!=NULL)
326 strcat(errmsg,cp);
327 for (tmp=op->inv; tmp; tmp=tmp->below)
328 dump_object2(tmp);
329#endif
330 strcat(errmsg,"end\n");
331 }
332#endif
333} 348}
334 349
335/* 350/*
336 * Dumps an object. Returns output in the static global errmsg array. 351 * Dumps an object. Returns output in the static global errmsg array.
337 */ 352 */
338 353
354void
339void dump_object(object *op) { 355dump_object (object *op)
356{
340 if(op==NULL) { 357 if (op == NULL)
358 {
341 strcpy(errmsg,"[NULL pointer]"); 359 strcpy (errmsg, "[NULL pointer]");
342 return; 360 return;
343 } 361 }
344 errmsg[0]='\0'; 362 errmsg[0] = '\0';
345 dump_object2(op); 363 dump_object2 (op);
346} 364}
347 365
366void
348void dump_all_objects(void) { 367dump_all_objects (void)
368{
349 object *op; 369 object *op;
370
350 for(op=objects;op!=NULL;op=op->next) { 371 for (op = objects; op != NULL; op = op->next)
372 {
351 dump_object(op); 373 dump_object (op);
352 fprintf(logfile, "Object %d\n:%s\n", op->count, errmsg); 374 fprintf (logfile, "Object %d\n:%s\n", op->count, errmsg);
353 } 375 }
354} 376}
355 377
356/* 378/*
357 * get_nearest_part(multi-object, object 2) returns the part of the 379 * get_nearest_part(multi-object, object 2) returns the part of the
358 * multi-object 1 which is closest to the second object. 380 * multi-object 1 which is closest to the second object.
359 * If it's not a multi-object, it is returned. 381 * If it's not a multi-object, it is returned.
360 */ 382 */
361 383
384object *
362object *get_nearest_part(object *op, const object *pl) { 385get_nearest_part (object *op, const object *pl)
386{
363 object *tmp,*closest; 387 object *tmp, *closest;
364 int last_dist,i; 388 int last_dist, i;
389
365 if(op->more==NULL) 390 if (op->more == NULL)
366 return op; 391 return op;
367 for(last_dist=distance(op,pl),closest=op,tmp=op->more;tmp!=NULL;tmp=tmp->more) 392 for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more)
368 if((i=distance(tmp,pl))<last_dist) 393 if ((i = distance (tmp, pl)) < last_dist)
369 closest=tmp,last_dist=i; 394 closest = tmp, last_dist = i;
370 return closest; 395 return closest;
371} 396}
372 397
373/* 398/*
374 * Returns the object which has the count-variable equal to the argument. 399 * Returns the object which has the count-variable equal to the argument.
375 */ 400 */
376 401
402object *
377object *find_object(tag_t i) { 403find_object (tag_t i)
404{
378 object *op; 405 object *op;
406
379 for(op=objects;op!=NULL;op=op->next) 407 for (op = objects; op != NULL; op = op->next)
380 if(op->count==i) 408 if (op->count == i)
381 break; 409 break;
382 return op; 410 return op;
383} 411}
384 412
385/* 413/*
386 * Returns the first object which has a name equal to the argument. 414 * Returns the first object which has a name equal to the argument.
387 * Used only by the patch command, but not all that useful. 415 * Used only by the patch command, but not all that useful.
388 * Enables features like "patch <name-of-other-player> food 999" 416 * Enables features like "patch <name-of-other-player> food 999"
389 */ 417 */
390 418
419object *
391object *find_object_name(const char *str) { 420find_object_name (const char *str)
421{
392 const char *name = shstr::find (str); 422 const char *name = shstr::find (str);
393 object *op; 423 object *op;
424
394 for(op=objects;op!=NULL;op=op->next) 425 for (op = objects; op != NULL; op = op->next)
395 if(&op->name == name) 426 if (&op->name == name)
396 break; 427 break;
397 428
398 return op; 429 return op;
399} 430}
400 431
432void
401void free_all_object_data () 433free_all_object_data ()
402{ 434{
403 LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); 435 LOG (llevDebug, "%d allocated objects\n", nrofallocobjects);
404} 436}
405 437
406/* 438/*
… …
411 * Changed 2004-02-12 - if the player is setting at the play again 443 * Changed 2004-02-12 - if the player is setting at the play again
412 * prompt, he is removed, and we don't want to treat him as an owner of 444 * prompt, he is removed, and we don't want to treat him as an owner of
413 * anything, so check removed flag. I don't expect that this should break 445 * anything, so check removed flag. I don't expect that this should break
414 * anything - once an object is removed, it is basically dead anyways. 446 * anything - once an object is removed, it is basically dead anyways.
415 */ 447 */
416 448object *
417object *get_owner(object *op) { 449object::get_owner ()
418 if(op->owner==NULL)
419 return NULL;
420
421 if (!QUERY_FLAG(op->owner,FLAG_FREED) && !QUERY_FLAG(op->owner, FLAG_REMOVED) &&
422 op->owner->count==op->ownercount)
423 return op->owner;
424
425 op->owner=NULL;
426 op->ownercount=0;
427 return NULL;
428}
429
430void clear_owner(object *op)
431{ 450{
432 if (!op) return; 451 if (!owner
433 452 || QUERY_FLAG (owner, FLAG_FREED)
434 if (op->owner && op->ownercount == op->owner->count) 453 || QUERY_FLAG (owner, FLAG_REMOVED))
435 op->owner->refcount--;
436
437 op->owner = NULL;
438 op->ownercount = 0; 454 owner = 0;
455
456 return owner;
439} 457}
440 458
441/* 459/*
442 * Sets the owner and sets the skill and exp pointers to owner's current 460 * Sets the owner and sets the skill and exp pointers to owner's current
443 * skill and experience objects. 461 * skill and experience objects.
444 */ 462 */
445void set_owner (object *op, object *owner) 463void
464object::set_owner (object *owner)
446{ 465{
447 if(owner==NULL||op==NULL) 466 if (!owner)
448 return; 467 return;
449 468
450 /* next line added to allow objects which own objects */ 469 /* next line added to allow objects which own objects */
451 /* Add a check for ownercounts in here, as I got into an endless loop 470 /* Add a check for ownercounts in here, as I got into an endless loop
452 * with the fireball owning a poison cloud which then owned the 471 * with the fireball owning a poison cloud which then owned the
453 * fireball. I believe that was caused by one of the objects getting 472 * fireball. I believe that was caused by one of the objects getting
454 * freed and then another object replacing it. Since the ownercounts 473 * freed and then another object replacing it. Since the ownercounts
455 * didn't match, this check is valid and I believe that cause is valid. 474 * didn't match, this check is valid and I believe that cause is valid.
456 */ 475 */
457 while (owner->owner && owner!=owner->owner && 476 while (owner->owner)
458 owner->ownercount==owner->owner->count) owner=owner->owner; 477 owner = owner->owner;
459 478
460 /* IF the owner still has an owner, we did not resolve to a final owner.
461 * so lets not add to that.
462 */
463 if (owner->owner) return;
464
465 op->owner=owner; 479 this->owner = owner;
466
467 op->ownercount=owner->count;
468 owner->refcount++;
469
470}
471
472/* Set the owner to clone's current owner and set the skill and experience
473 * objects to clone's objects (typically those objects that where the owner's
474 * current skill and experience objects at the time when clone's owner was
475 * set - not the owner's current skill and experience objects).
476 *
477 * Use this function if player created an object (e.g. fire bullet, swarm
478 * spell), and this object creates further objects whose kills should be
479 * accounted for the player's original skill, even if player has changed
480 * skills meanwhile.
481 */
482void copy_owner (object *op, object *clone)
483{
484 object *owner = get_owner (clone);
485 if (owner == NULL) {
486 /* players don't have owners - they own themselves. Update
487 * as appropriate.
488 */
489 if (clone->type == PLAYER) owner=clone;
490 else return;
491 }
492 set_owner(op, owner);
493
494} 480}
495 481
496/* Zero the key_values on op, decrementing the shared-string 482/* Zero the key_values on op, decrementing the shared-string
497 * refcounts and freeing the links. 483 * refcounts and freeing the links.
498 */ 484 */
485static void
499static void free_key_values(object * op) 486free_key_values (object *op)
500{ 487{
501 for (key_value *i = op->key_values; i != 0; ) 488 for (key_value *i = op->key_values; i != 0;)
502 { 489 {
503 key_value *next = i->next; 490 key_value *next = i->next;
504 delete i; 491 delete i;
492
505 i = next; 493 i = next;
506 } 494 }
507 495
508 op->key_values = 0; 496 op->key_values = 0;
509} 497}
510 498
511void object::clear () 499void object::clear ()
512{ 500{
513 attachable_base::clear (); 501 attachable_base::clear ();
514 502
515 free_key_values (this); 503 free_key_values (this);
516 504
517 name = 0; 505 owner = 0;
506 name = 0;
518 name_pl = 0; 507 name_pl = 0;
519 title = 0; 508 title = 0;
520 race = 0; 509 race = 0;
521 slaying = 0; 510 slaying = 0;
522 skill = 0; 511 skill = 0;
523 msg = 0; 512 msg = 0;
524 lore = 0; 513 lore = 0;
525 custom_name = 0; 514 custom_name = 0;
526 materialname = 0; 515 materialname = 0;
516 contr = 0;
517 below = 0;
518 above = 0;
519 inv = 0;
520 container = 0;
521 env = 0;
522 more = 0;
523 head = 0;
524 map = 0;
525 active_next = 0;
526 active_prev = 0;
527 527
528 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod)); 528 memset (static_cast<object_pod *>(this), 0, sizeof (object_pod));
529 529
530 SET_FLAG (this, FLAG_REMOVED); 530 SET_FLAG (this, FLAG_REMOVED);
531
532 /* What is not cleared is next, prev, and count */
533
534 expmul = 1.0;
535 face = blank_face;
536 attacked_by_count = -1;
537
538 if (settings.casting_time)
539 casting_time = -1;
531} 540}
532 541
533void object::clone (object *destination) 542void object::clone (object *destination)
534{ 543{
535 *(object_copy *)destination = *(object_copy *)this; 544 *(object_copy *)destination = *this;
536 *(object_pod *)destination = *(object_pod *)this; 545 *(object_pod *)destination = *this;
537 546
538 if (self || cb) 547 if (self || cb)
539 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination)); 548 INVOKE_OBJECT (CLONE, this, ARG_OBJECT (destination));
540}
541
542/*
543 * clear_object() frees everything allocated by an object, and also
544 * clears all variables and flags to default settings.
545 */
546
547void clear_object (object *op)
548{
549 op->clear ();
550
551 op->contr = NULL;
552 op->below = NULL;
553 op->above = NULL;
554 op->inv = NULL;
555 op->container=NULL;
556 op->env=NULL;
557 op->more=NULL;
558 op->head=NULL;
559 op->map=NULL;
560 op->refcount=0;
561 op->active_next = NULL;
562 op->active_prev = NULL;
563 /* What is not cleared is next, prev, and count */
564
565 op->expmul = 1.0;
566 op->face = blank_face;
567 op->attacked_by_count = -1;
568
569 if (settings.casting_time)
570 op->casting_time = -1;
571} 549}
572 550
573/* 551/*
574 * copy object first frees everything allocated by the second object, 552 * copy object first frees everything allocated by the second object,
575 * and then copies the contends of the first object into the second 553 * and then copies the contends of the first object into the second
576 * object, allocating what needs to be allocated. Basically, any 554 * object, allocating what needs to be allocated. Basically, any
577 * data that is malloc'd needs to be re-malloc/copied. Otherwise, 555 * data that is malloc'd needs to be re-malloc/copied. Otherwise,
578 * if the first object is freed, the pointers in the new object 556 * if the first object is freed, the pointers in the new object
579 * will point at garbage. 557 * will point at garbage.
580 */ 558 */
581 559void
582void copy_object (object *op2, object *op) 560copy_object (object *op2, object *op)
583{ 561{
584 bool is_freed = QUERY_FLAG (op, FLAG_FREED); 562 bool is_freed = QUERY_FLAG (op, FLAG_FREED);
585 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED); 563 bool is_removed = QUERY_FLAG (op, FLAG_REMOVED);
586 564
587 op2->clone (op); 565 op2->clone (op);
588 566
567 if (is_freed)
589 if (is_freed) SET_FLAG (op, FLAG_FREED); 568 SET_FLAG (op, FLAG_FREED);
569 if (is_removed)
590 if (is_removed) SET_FLAG (op, FLAG_REMOVED); 570 SET_FLAG (op, FLAG_REMOVED);
591 571
592 if (op2->speed < 0) 572 if (op2->speed < 0)
593 op->speed_left = op2->speed_left - RANDOM() % 200 / 100.0; 573 op->speed_left = op2->speed_left - RANDOM () % 200 / 100.0;
594 574
595 /* Copy over key_values, if any. */ 575 /* Copy over key_values, if any. */
596 if (op2->key_values != NULL) 576 if (op2->key_values)
597 { 577 {
598 key_value *tail = NULL; 578 key_value *tail = 0;
599 key_value *i; 579 key_value *i;
600 580
601 op->key_values = NULL; 581 op->key_values = 0;
602 582
603 for (i = op2->key_values; i != NULL; i = i->next) 583 for (i = op2->key_values; i; i = i->next)
604 { 584 {
605 key_value *new_link = new key_value; 585 key_value *new_link = new key_value;
606 586
607 new_link->next = NULL; 587 new_link->next = 0;
608 new_link->key = i->key; 588 new_link->key = i->key;
609 new_link->value = i->value; 589 new_link->value = i->value;
610 590
611 /* Try and be clever here, too. */ 591 /* Try and be clever here, too. */
612 if (op->key_values == NULL) 592 if (!op->key_values)
613 { 593 {
614 op->key_values = new_link; 594 op->key_values = new_link;
615 tail = new_link; 595 tail = new_link;
616 } 596 }
617 else 597 else
… …
623 } 603 }
624 604
625 update_ob_speed (op); 605 update_ob_speed (op);
626} 606}
627 607
628object::object ()
629{
630 count = ++ob_count;
631
632 next = objects;
633
634 if (objects)
635 objects->prev = this;
636
637 objects = this;
638
639 SET_FLAG (this, FLAG_REMOVED);
640
641 expmul = 1.0;
642 face = blank_face;
643 attacked_by_count = -1;
644}
645
646object::~object ()
647{
648}
649
650/* 608/*
651 * If an object with the IS_TURNABLE() flag needs to be turned due 609 * If an object with the IS_TURNABLE() flag needs to be turned due
652 * to the closest player being on the other side, this function can 610 * to the closest player being on the other side, this function can
653 * be called to update the face variable, _and_ how it looks on the map. 611 * be called to update the face variable, _and_ how it looks on the map.
654 */ 612 */
655 613
614void
656void update_turn_face(object *op) { 615update_turn_face (object *op)
616{
657 if(!QUERY_FLAG(op,FLAG_IS_TURNABLE)||op->arch==NULL) 617 if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || op->arch == NULL)
658 return; 618 return;
659 SET_ANIMATION(op, op->direction); 619 SET_ANIMATION (op, op->direction);
660 update_object(op,UP_OBJ_FACE); 620 update_object (op, UP_OBJ_FACE);
661} 621}
662 622
663/* 623/*
664 * Updates the speed of an object. If the speed changes from 0 to another 624 * Updates the speed of an object. If the speed changes from 0 to another
665 * value, or vice versa, then add/remove the object from the active list. 625 * value, or vice versa, then add/remove the object from the active list.
666 * This function needs to be called whenever the speed of an object changes. 626 * This function needs to be called whenever the speed of an object changes.
667 */ 627 */
668 628
629void
669void update_ob_speed(object *op) { 630update_ob_speed (object *op)
631{
670 extern int arch_init; 632 extern int arch_init;
671 633
672 /* No reason putting the archetypes objects on the speed list, 634 /* No reason putting the archetypes objects on the speed list,
673 * since they never really need to be updated. 635 * since they never really need to be updated.
674 */ 636 */
675 637
676 if (QUERY_FLAG(op, FLAG_FREED) && op->speed) { 638 if (QUERY_FLAG (op, FLAG_FREED) && op->speed)
639 {
677 LOG(llevError,"Object %s is freed but has speed.\n", &op->name); 640 LOG (llevError, "Object %s is freed but has speed.\n", &op->name);
678#ifdef MANY_CORES 641#ifdef MANY_CORES
679 abort(); 642 abort ();
680#else 643#else
681 op->speed = 0; 644 op->speed = 0;
682#endif 645#endif
683 } 646 }
684 if (arch_init) { 647 if (arch_init)
648 {
649 return;
650 }
651 if (FABS (op->speed) > MIN_ACTIVE_SPEED)
652 {
653 /* If already on active list, don't do anything */
654 if (op->active_next || op->active_prev || op == active_objects)
685 return; 655 return;
686 }
687 if (FABS(op->speed)>MIN_ACTIVE_SPEED) {
688 /* If already on active list, don't do anything */
689 if (op->active_next || op->active_prev || op==active_objects)
690 return;
691 656
692 /* process_events() expects us to insert the object at the beginning 657 /* process_events() expects us to insert the object at the beginning
693 * of the list. */ 658 * of the list. */
694 op->active_next = active_objects; 659 op->active_next = active_objects;
695 if (op->active_next!=NULL) 660 if (op->active_next != NULL)
696 op->active_next->active_prev = op; 661 op->active_next->active_prev = op;
697 active_objects = op; 662 active_objects = op;
663 }
664 else
698 } 665 {
699 else {
700 /* If not on the active list, nothing needs to be done */ 666 /* If not on the active list, nothing needs to be done */
701 if (!op->active_next && !op->active_prev && op!=active_objects) 667 if (!op->active_next && !op->active_prev && op != active_objects)
702 return; 668 return;
703 669
704 if (op->active_prev==NULL) { 670 if (op->active_prev == NULL)
671 {
705 active_objects = op->active_next; 672 active_objects = op->active_next;
706 if (op->active_next!=NULL) 673 if (op->active_next != NULL)
707 op->active_next->active_prev = NULL; 674 op->active_next->active_prev = NULL;
675 }
676 else
708 } 677 {
709 else {
710 op->active_prev->active_next = op->active_next; 678 op->active_prev->active_next = op->active_next;
711 if (op->active_next) 679 if (op->active_next)
712 op->active_next->active_prev = op->active_prev; 680 op->active_next->active_prev = op->active_prev;
713 } 681 }
714 op->active_next = NULL; 682 op->active_next = NULL;
715 op->active_prev = NULL; 683 op->active_prev = NULL;
716 } 684 }
717} 685}
718 686
719/* This function removes object 'op' from the list of active 687/* This function removes object 'op' from the list of active
720 * objects. 688 * objects.
… …
722 * reference maps where you don't want an object that isn't 690 * reference maps where you don't want an object that isn't
723 * in play chewing up cpu time getting processed. 691 * in play chewing up cpu time getting processed.
724 * The reverse of this is to call update_ob_speed, which 692 * The reverse of this is to call update_ob_speed, which
725 * will do the right thing based on the speed of the object. 693 * will do the right thing based on the speed of the object.
726 */ 694 */
695void
727void remove_from_active_list(object *op) 696remove_from_active_list (object *op)
728{ 697{
729 /* If not on the active list, nothing needs to be done */ 698 /* If not on the active list, nothing needs to be done */
730 if (!op->active_next && !op->active_prev && op!=active_objects) 699 if (!op->active_next && !op->active_prev && op != active_objects)
731 return; 700 return;
732 701
733 if (op->active_prev==NULL) { 702 if (op->active_prev == NULL)
703 {
734 active_objects = op->active_next; 704 active_objects = op->active_next;
735 if (op->active_next!=NULL) 705 if (op->active_next != NULL)
736 op->active_next->active_prev = NULL; 706 op->active_next->active_prev = NULL;
707 }
708 else
737 } 709 {
738 else {
739 op->active_prev->active_next = op->active_next; 710 op->active_prev->active_next = op->active_next;
740 if (op->active_next) 711 if (op->active_next)
741 op->active_next->active_prev = op->active_prev; 712 op->active_next->active_prev = op->active_prev;
742 } 713 }
743 op->active_next = NULL; 714 op->active_next = NULL;
744 op->active_prev = NULL; 715 op->active_prev = NULL;
745} 716}
746 717
747/* 718/*
748 * update_object() updates the array which represents the map. 719 * update_object() updates the array which represents the map.
749 * It takes into account invisible objects (and represent squares covered 720 * It takes into account invisible objects (and represent squares covered
… …
764 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update 735 * UP_OBJ_CHANGE: object has somehow changed. In this case, we always update
765 * as that is easier than trying to look at what may have changed. 736 * as that is easier than trying to look at what may have changed.
766 * UP_OBJ_FACE: only the objects face has changed. 737 * UP_OBJ_FACE: only the objects face has changed.
767 */ 738 */
768 739
740void
769void update_object(object *op, int action) { 741update_object (object *op, int action)
742{
770 int update_now=0, flags; 743 int update_now = 0, flags;
771 MoveType move_on, move_off, move_block, move_slow; 744 MoveType move_on, move_off, move_block, move_slow;
772 745
773 if (op == NULL) { 746 if (op == NULL)
747 {
774 /* this should never happen */ 748 /* this should never happen */
775 LOG(llevDebug,"update_object() called for NULL object.\n"); 749 LOG (llevDebug, "update_object() called for NULL object.\n");
776 return; 750 return;
777 }
778 751 }
752
779 if(op->env!=NULL) { 753 if (op->env != NULL)
754 {
780 /* Animation is currently handled by client, so nothing 755 /* Animation is currently handled by client, so nothing
781 * to do in this case. 756 * to do in this case.
782 */ 757 */
783 return; 758 return;
784 } 759 }
785 760
786 /* If the map is saving, don't do anything as everything is 761 /* If the map is saving, don't do anything as everything is
787 * going to get freed anyways. 762 * going to get freed anyways.
788 */ 763 */
789 if (!op->map || op->map->in_memory == MAP_SAVING) return; 764 if (!op->map || op->map->in_memory == MAP_SAVING)
790 765 return;
766
791 /* make sure the object is within map boundaries */ 767 /* make sure the object is within map boundaries */
792 if (op->x < 0 || op->x >= MAP_WIDTH(op->map) || 768 if (op->x < 0 || op->x >= MAP_WIDTH (op->map) || op->y < 0 || op->y >= MAP_HEIGHT (op->map))
793 op->y < 0 || op->y >= MAP_HEIGHT(op->map)) { 769 {
794 LOG(llevError,"update_object() called for object out of map!\n"); 770 LOG (llevError, "update_object() called for object out of map!\n");
795#ifdef MANY_CORES 771#ifdef MANY_CORES
796 abort(); 772 abort ();
797#endif 773#endif
798 return; 774 return;
799 }
800 775 }
776
801 flags = GET_MAP_FLAGS(op->map, op->x, op->y); 777 flags = GET_MAP_FLAGS (op->map, op->x, op->y);
802 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NEED_UPDATE); 778 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NEED_UPDATE);
803 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y); 779 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
804 move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y); 780 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
805 move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y); 781 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
806 move_off = GET_MAP_MOVE_OFF(op->map, op->x, op->y); 782 move_off = GET_MAP_MOVE_OFF (op->map, op->x, op->y);
807 783
808 if (action == UP_OBJ_INSERT) { 784 if (action == UP_OBJ_INSERT)
785 {
809 if (QUERY_FLAG(op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW)) 786 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(flags & P_BLOCKSVIEW))
810 update_now=1; 787 update_now = 1;
811 788
812 if (QUERY_FLAG(op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC)) 789 if (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(flags & P_NO_MAGIC))
813 update_now=1; 790 update_now = 1;
814 791
815 if (QUERY_FLAG(op, FLAG_DAMNED) && !(flags & P_NO_CLERIC)) 792 if (QUERY_FLAG (op, FLAG_DAMNED) && !(flags & P_NO_CLERIC))
816 update_now=1; 793 update_now = 1;
817 794
818 if (QUERY_FLAG(op, FLAG_ALIVE) && !(flags & P_IS_ALIVE)) 795 if (QUERY_FLAG (op, FLAG_ALIVE) && !(flags & P_IS_ALIVE))
819 update_now=1; 796 update_now = 1;
820 797
798 if (op->type == SAFE_GROUND && !(flags & P_SAFE))
799 update_now = 1;
800
821 if ((move_on | op->move_on) != move_on) update_now=1; 801 if ((move_on | op->move_on) != move_on)
802 update_now = 1;
803
822 if ((move_off | op->move_off) != move_off) update_now=1; 804 if ((move_off | op->move_off) != move_off)
805 update_now = 1;
806
823 /* This isn't perfect, but I don't expect a lot of objects to 807 /* This isn't perfect, but I don't expect a lot of objects to
824 * to have move_allow right now. 808 * to have move_allow right now.
825 */ 809 */
826 if (((move_block | op->move_block) & ~op->move_allow) != move_block) 810 if (((move_block | op->move_block) & ~op->move_allow) != move_block)
827 update_now=1; 811 update_now = 1;
812
828 if ((move_slow | op->move_slow) != move_slow) update_now=1; 813 if ((move_slow | op->move_slow) != move_slow)
814 update_now = 1;
829 } 815 }
830 /* if the object is being removed, we can't make intelligent 816 /* if the object is being removed, we can't make intelligent
831 * decisions, because remove_ob can't really pass the object 817 * decisions, because remove_ob can't really pass the object
832 * that is being removed. 818 * that is being removed.
833 */ 819 */
834 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) { 820 else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE)
835 update_now=1; 821 update_now = 1;
836 } else if (action == UP_OBJ_FACE) { 822 else if (action == UP_OBJ_FACE)
837 /* Nothing to do for that case */ 823 /* Nothing to do for that case */ ;
838 }
839 else { 824 else
840 LOG(llevError,"update_object called with invalid action: %d\n", action); 825 LOG (llevError, "update_object called with invalid action: %d\n", action);
841 }
842 826
843 if (update_now) { 827 if (update_now)
828 {
844 SET_MAP_FLAGS(op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE); 829 SET_MAP_FLAGS (op->map, op->x, op->y, flags | P_NO_ERROR | P_NEED_UPDATE);
845 update_position(op->map, op->x, op->y); 830 update_position (op->map, op->x, op->y);
846 } 831 }
847 832
848 if(op->more!=NULL) 833 if (op->more != NULL)
849 update_object(op->more, action); 834 update_object (op->more, action);
850} 835}
851 836
837static unordered_vector<object *> mortals;
838static std::vector<object *> freed;
839
840void object::free_mortals ()
841{
842 for (unordered_vector<object *>::iterator i = mortals.begin (); i != mortals.end ();)
843 if ((*i)->refcnt)
844 ++i; // further delay freeing
845 else
846 {
847 freed.push_back (*i);//D
848 //delete *i;
849 mortals.erase (i);
850 }
851
852 if (mortals.size())//D
853 LOG (llevDebug, "%d objects in mortal queue\n", mortals.size());//D
854}
855
856object::object ()
857{
858 SET_FLAG (this, FLAG_REMOVED);
859
860 expmul = 1.0;
861 face = blank_face;
862 attacked_by_count = -1;
863}
864
865object::~object ()
866{
867 free_key_values (this);
868}
869
870void object::link ()
871{
872 count = ++ob_count;
873
874 prev = 0;
875 next = objects;
876
877 if (objects)
878 objects->prev = this;
879
880 objects = this;
881}
882
883void object::unlink ()
884{
885 count = 0;
886
887 /* Remove this object from the list of used objects */
888 if (prev)
889 {
890 prev->next = next;
891 prev = 0;
892 }
893
894 if (next)
895 {
896 next->prev = prev;
897 next = 0;
898 }
899
900 if (this == objects)
901 objects = next;
902}
903
904object *object::create ()
905{
906 object *
907 op;
908
909 if (freed.empty ())
910 op = new object;
911 else
912 {
913 // highly annoying, but the only way to get it stable right now
914 op = freed.back ();
915 freed.pop_back ();
916 op->~object ();
917 new ((void *) op) object;
918 }
919
920 op->link ();
921 return op;
922}
852 923
853/* 924/*
854 * free_object() frees everything allocated by an object, removes 925 * free_object() frees everything allocated by an object, removes
855 * it from the list of used objects, and puts it on the list of 926 * it from the list of used objects, and puts it on the list of
856 * free objects. The IS_FREED() flag is set in the object. 927 * free objects. The IS_FREED() flag is set in the object.
… …
858 * this function to succeed. 929 * this function to succeed.
859 * 930 *
860 * If free_inventory is set, free inventory as well. Else drop items in 931 * If free_inventory is set, free inventory as well. Else drop items in
861 * inventory to the ground. 932 * inventory to the ground.
862 */ 933 */
863 934void object::free (bool free_inventory)
864void
865free_object (object * ob)
866{ 935{
867 free_object2 (ob, 0); 936 if (QUERY_FLAG (this, FLAG_FREED))
868} 937 return;
869 938
870void
871free_object2 (object * ob, int free_inventory)
872{
873 object *tmp, *op;
874
875 if (!QUERY_FLAG (ob, FLAG_REMOVED)) 939 if (!QUERY_FLAG (this, FLAG_REMOVED))
876 { 940 remove_ob (this);
877 LOG (llevDebug, "Free object called with non removed object\n");
878 dump_object (ob);
879#ifdef MANY_CORES
880 abort ();
881#endif
882 }
883 941
884 if (QUERY_FLAG (ob, FLAG_FRIENDLY)) 942 if (QUERY_FLAG (this, FLAG_FRIENDLY))
885 {
886 LOG (llevMonster, "Warning: tried to free friendly object.\n");
887 remove_friendly_object (ob); 943 remove_friendly_object (this);
944
945 SET_FLAG (this, FLAG_FREED);
946
947 if (more)
888 } 948 {
889 949 more->free (free_inventory);
890 if (QUERY_FLAG (ob, FLAG_FREED)) 950 more = 0;
891 { 951 }
892 dump_object (ob);
893 LOG (llevError, "Trying to free freed object.\n%s\n", errmsg);
894 return;
895 }
896 952
897 if (ob->more != NULL)
898 {
899 free_object2 (ob->more, free_inventory);
900 ob->more = NULL;
901 }
902
903 if (ob->inv) 953 if (inv)
904 { 954 {
905 /* Only if the space blocks everything do we not process - 955 /* Only if the space blocks everything do we not process -
906 * if some form of movement is allowed, let objects 956 * if some form of movement is allowed, let objects
907 * drop on that space. 957 * drop on that space.
908 */ 958 */
909 if (free_inventory || ob->map == NULL 959 if (free_inventory || !map || map->in_memory != MAP_IN_MEMORY || (GET_MAP_MOVE_BLOCK (map, x, y) == MOVE_ALL))
910 || ob->map->in_memory != MAP_IN_MEMORY 960 {
911 || (GET_MAP_MOVE_BLOCK (ob->map, ob->x, ob->y) == MOVE_ALL)) 961 object *op = inv;
912 {
913 op = ob->inv;
914 962
915 while (op != NULL) 963 while (op)
916 { 964 {
917 tmp = op->below; 965 object *tmp = op->below;
918 remove_ob (op); 966 op->free (free_inventory);
919 free_object2 (op, free_inventory);
920 op = tmp; 967 op = tmp;
921 } 968 }
922 } 969 }
923 else 970 else
924 { /* Put objects in inventory onto this space */ 971 { /* Put objects in inventory onto this space */
925 op = ob->inv; 972 object *op = inv;
926 973
927 while (op != NULL) 974 while (op)
928 { 975 {
929 tmp = op->below; 976 object *tmp = op->below;
977
930 remove_ob (op); 978 remove_ob (op);
931 979
932 if (QUERY_FLAG (op, FLAG_STARTEQUIP) 980 if (QUERY_FLAG (op, FLAG_STARTEQUIP)
933 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE 981 || QUERY_FLAG (op, FLAG_NO_DROP) || op->type == RUNE || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE))
934 || op->type == TRAP || QUERY_FLAG (op, FLAG_IS_A_TEMPLATE)) 982 free_object (op);
935 free_object (op); 983 else
936 else 984 {
937 { 985 op->x = x;
938 op->x = ob->x; 986 op->y = y;
939 op->y = ob->y;
940 insert_ob_in_map (op, ob->map, NULL, 0); /* Insert in same map as the envir */ 987 insert_ob_in_map (op, map, 0, 0); /* Insert in same map as the envir */
941 } 988 }
942 989
943 op = tmp; 990 op = tmp;
991 }
992 }
944 } 993 }
945 } 994
946 } 995 owner = 0;
947 996
948 /* Remove object from the active list */ 997 /* Remove object from the active list */
949 ob->speed = 0; 998 speed = 0;
950 update_ob_speed (ob); 999 update_ob_speed (this);
951 1000
952 SET_FLAG (ob, FLAG_FREED); 1001 unlink ();
953 ob->count = 0;
954 1002
955 /* Remove this object from the list of used objects */ 1003 mortals.push_back (this);
956 if (ob->prev == NULL)
957 {
958 objects = ob->next;
959
960 if (objects != NULL)
961 objects->prev = NULL;
962 }
963 else
964 {
965 ob->prev->next = ob->next;
966
967 if (ob->next != NULL)
968 ob->next->prev = ob->prev;
969 }
970
971 free_key_values (ob);
972
973 /* Now link it with the free_objects list: */
974 ob->prev = 0;
975 ob->next = 0;
976
977 delete ob;
978} 1004}
979 1005
980/* 1006/*
981 * sub_weight() recursively (outwards) subtracts a number from the 1007 * sub_weight() recursively (outwards) subtracts a number from the
982 * weight of an object (and what is carried by it's environment(s)). 1008 * weight of an object (and what is carried by it's environment(s)).
983 */ 1009 */
984 1010
1011void
985void sub_weight (object *op, signed long weight) { 1012sub_weight (object *op, signed long weight)
1013{
986 while (op != NULL) { 1014 while (op != NULL)
1015 {
987 if (op->type == CONTAINER) { 1016 if (op->type == CONTAINER)
1017 {
988 weight=(signed long)(weight*(100-op->stats.Str)/100); 1018 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
989 } 1019 }
990 op->carrying-=weight; 1020 op->carrying -= weight;
991 op = op->env; 1021 op = op->env;
992 } 1022 }
993} 1023}
994 1024
995/* remove_ob(op): 1025/* remove_ob(op):
996 * This function removes the object op from the linked list of objects 1026 * This function removes the object op from the linked list of objects
997 * which it is currently tied to. When this function is done, the 1027 * which it is currently tied to. When this function is done, the
… …
999 * environment, the x and y coordinates will be updated to 1029 * environment, the x and y coordinates will be updated to
1000 * the previous environment. 1030 * the previous environment.
1001 * Beware: This function is called from the editor as well! 1031 * Beware: This function is called from the editor as well!
1002 */ 1032 */
1003 1033
1034void
1004void remove_ob(object *op) { 1035remove_ob (object *op)
1005 object *tmp,*last=NULL; 1036{
1006 object *otmp; 1037 object *
1007 tag_t tag; 1038 tmp, *
1039 last = NULL;
1040 object *
1041 otmp;
1042
1043 tag_t
1044 tag;
1045 int
1008 int check_walk_off; 1046 check_walk_off;
1009 mapstruct *m; 1047 mapstruct *
1010 sint16 x,y;
1011 1048 m;
1012 1049
1050 sint16
1051 x,
1052 y;
1053
1013 if(QUERY_FLAG(op,FLAG_REMOVED)) { 1054 if (QUERY_FLAG (op, FLAG_REMOVED))
1014 dump_object(op); 1055 return;
1015 LOG(llevError,"Trying to remove removed object.\n%s\n",errmsg);
1016 1056
1017 /* Changed it to always dump core in this case. As has been learned
1018 * in the past, trying to recover from errors almost always
1019 * make things worse, and this is a real error here - something
1020 * that should not happen.
1021 * Yes, if this was a mission critical app, trying to do something
1022 * to recover may make sense, but that is because failure of the app
1023 * may have other disastrous problems. Cf runs out of a script
1024 * so is easily enough restarted without any real problems.
1025 * MSW 2001-07-01
1026 */
1027 abort();
1028 }
1029 if(op->more!=NULL)
1030 remove_ob(op->more);
1031
1032 SET_FLAG(op, FLAG_REMOVED); 1057 SET_FLAG (op, FLAG_REMOVED);
1033 1058
1059 if (op->more != NULL)
1060 remove_ob (op->more);
1061
1034 /* 1062 /*
1035 * In this case, the object to be removed is in someones 1063 * In this case, the object to be removed is in someones
1036 * inventory. 1064 * inventory.
1037 */ 1065 */
1038 if(op->env!=NULL) { 1066 if (op->env != NULL)
1067 {
1039 if(op->nrof) 1068 if (op->nrof)
1040 sub_weight(op->env, op->weight*op->nrof); 1069 sub_weight (op->env, op->weight * op->nrof);
1041 else 1070 else
1042 sub_weight(op->env, op->weight+op->carrying); 1071 sub_weight (op->env, op->weight + op->carrying);
1043 1072
1044 /* NO_FIX_PLAYER is set when a great many changes are being 1073 /* NO_FIX_PLAYER is set when a great many changes are being
1045 * made to players inventory. If set, avoiding the call 1074 * made to players inventory. If set, avoiding the call
1046 * to save cpu time. 1075 * to save cpu time.
1047 */ 1076 */
1048 if ((otmp=is_player_inv(op->env))!=NULL && otmp->contr && 1077 if ((otmp = is_player_inv (op->env)) != NULL && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1049 !QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER))
1050 fix_player(otmp); 1078 fix_player (otmp);
1051 1079
1052 if(op->above!=NULL) 1080 if (op->above != NULL)
1053 op->above->below=op->below; 1081 op->above->below = op->below;
1054 else 1082 else
1055 op->env->inv=op->below; 1083 op->env->inv = op->below;
1056 1084
1057 if(op->below!=NULL) 1085 if (op->below != NULL)
1058 op->below->above=op->above; 1086 op->below->above = op->above;
1059 1087
1060 /* we set up values so that it could be inserted into 1088 /* we set up values so that it could be inserted into
1061 * the map, but we don't actually do that - it is up 1089 * the map, but we don't actually do that - it is up
1062 * to the caller to decide what we want to do. 1090 * to the caller to decide what we want to do.
1063 */ 1091 */
1064 op->x=op->env->x,op->y=op->env->y; 1092 op->x = op->env->x, op->y = op->env->y;
1065 op->map=op->env->map; 1093 op->map = op->env->map;
1066 op->above=NULL,op->below=NULL; 1094 op->above = NULL, op->below = NULL;
1067 op->env=NULL; 1095 op->env = NULL;
1096 }
1097 else if (op->map)
1098 {
1099 x = op->x;
1100 y = op->y;
1101 m = get_map_from_coord (op->map, &x, &y);
1102
1103 if (!m)
1104 {
1105 LOG (llevError, "remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1106 op->map->path, op->x, op->y);
1107 /* in old days, we used to set x and y to 0 and continue.
1108 * it seems if we get into this case, something is probablye
1109 * screwed up and should be fixed.
1110 */
1111 abort ();
1112 }
1113
1114 if (op->map != m)
1115 LOG (llevDebug, "remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1116 op->map->path, m->path, op->x, op->y, x, y);
1117
1118 /* Re did the following section of code - it looks like it had
1119 * lots of logic for things we no longer care about
1120 */
1121
1122 /* link the object above us */
1123 if (op->above)
1124 op->above->below = op->below;
1125 else
1126 SET_MAP_TOP (m, x, y, op->below); /* we were top, set new top */
1127
1128 /* Relink the object below us, if there is one */
1129 if (op->below)
1130 op->below->above = op->above;
1131 else
1132 {
1133 /* Nothing below, which means we need to relink map object for this space
1134 * use translated coordinates in case some oddness with map tiling is
1135 * evident
1136 */
1137 if (GET_MAP_OB (m, x, y) != op)
1138 {
1139 dump_object (op);
1140 LOG (llevError,
1141 "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);
1142 dump_object (GET_MAP_OB (m, x, y));
1143 LOG (llevError, "%s\n", errmsg);
1144 }
1145
1146 SET_MAP_OB (m, x, y, op->above); /* goes on above it. */
1147 }
1148
1149 op->above = 0;
1150 op->below = 0;
1151
1152 if (op->map->in_memory == MAP_SAVING)
1068 return; 1153 return;
1069 }
1070 1154
1071 /* If we get here, we are removing it from a map */
1072 if (op->map == NULL) return;
1073
1074 x = op->x;
1075 y = op->y;
1076 m = get_map_from_coord(op->map, &x, &y);
1077
1078 if (!m) {
1079 LOG(llevError,"remove_ob called when object was on map but appears to not be within valid coordinates? %s (%d,%d)\n",
1080 op->map->path, op->x, op->y);
1081 /* in old days, we used to set x and y to 0 and continue.
1082 * it seems if we get into this case, something is probablye
1083 * screwed up and should be fixed.
1084 */
1085 abort();
1086 }
1087 if (op->map != m) {
1088 LOG(llevDebug,"remove_ob: Object not really on map it claimed to be on? %s != %s, %d,%d != %d,%d\n",
1089 op->map->path, m->path, op->x, op->y, x, y);
1090 }
1091
1092 /* Re did the following section of code - it looks like it had
1093 * lots of logic for things we no longer care about
1094 */
1095
1096 /* link the object above us */
1097 if (op->above)
1098 op->above->below=op->below;
1099 else
1100 SET_MAP_TOP(m,x,y,op->below); /* we were top, set new top */
1101
1102 /* Relink the object below us, if there is one */
1103 if(op->below) {
1104 op->below->above=op->above;
1105 } else {
1106 /* Nothing below, which means we need to relink map object for this space
1107 * use translated coordinates in case some oddness with map tiling is
1108 * evident
1109 */
1110 if(GET_MAP_OB(m,x,y)!=op) {
1111 dump_object(op);
1112 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);
1113 dump_object(GET_MAP_OB(m,x,y));
1114 LOG(llevError,"%s\n",errmsg);
1115 }
1116 SET_MAP_OB(m,x,y,op->above); /* goes on above it. */
1117 }
1118 op->above=NULL;
1119 op->below=NULL;
1120
1121 if (op->map->in_memory == MAP_SAVING)
1122 return;
1123
1124 tag = op->count; 1155 tag = op->count;
1125 check_walk_off = ! QUERY_FLAG (op, FLAG_NO_APPLY); 1156 check_walk_off = !QUERY_FLAG (op, FLAG_NO_APPLY);
1157
1126 for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) { 1158 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1159 {
1127 /* No point updating the players look faces if he is the object 1160 /* No point updating the players look faces if he is the object
1128 * being removed. 1161 * being removed.
1129 */ 1162 */
1130 1163
1131 if(tmp->type==PLAYER && tmp!=op) { 1164 if (tmp->type == PLAYER && tmp != op)
1165 {
1132 /* If a container that the player is currently using somehow gets 1166 /* If a container that the player is currently using somehow gets
1133 * removed (most likely destroyed), update the player view 1167 * removed (most likely destroyed), update the player view
1134 * appropriately. 1168 * appropriately.
1135 */ 1169 */
1136 if (tmp->container==op) { 1170 if (tmp->container == op)
1171 {
1137 CLEAR_FLAG(op, FLAG_APPLIED); 1172 CLEAR_FLAG (op, FLAG_APPLIED);
1138 tmp->container=NULL; 1173 tmp->container = NULL;
1174 }
1175
1176 tmp->contr->socket.update_look = 1;
1139 } 1177 }
1140 tmp->contr->socket.update_look=1; 1178
1141 }
1142 /* See if player moving off should effect something */ 1179 /* See if player moving off should effect something */
1143 if (check_walk_off && ((op->move_type & tmp->move_off) && 1180 if (check_walk_off && ((op->move_type & tmp->move_off) && (op->move_type & ~tmp->move_off & ~tmp->move_block) == 0))
1144 (op->move_type & ~tmp->move_off & ~tmp->move_block)==0)) { 1181 {
1145
1146 move_apply(tmp, op, NULL); 1182 move_apply (tmp, op, NULL);
1183
1147 if (was_destroyed (op, tag)) { 1184 if (was_destroyed (op, tag))
1185 {
1148 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " 1186 LOG (llevError, "BUG: remove_ob(): name %s, archname %s destroyed " "leaving object\n", &tmp->name, &tmp->arch->name);
1149 "leaving object\n", &tmp->name, &tmp->arch->name); 1187 }
1150 } 1188 }
1151 }
1152 1189
1153 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ 1190 /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */
1154 1191
1155 if(tmp->above == tmp) 1192 if (tmp->above == tmp)
1156 tmp->above = NULL; 1193 tmp->above = NULL;
1194
1157 last=tmp; 1195 last = tmp;
1158 } 1196 }
1197
1159 /* last == NULL of there are no objects on this space */ 1198 /* last == NULL of there are no objects on this space */
1160 if (last==NULL) { 1199 if (last == NULL)
1200 {
1161 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory, 1201 /* set P_NEED_UPDATE, otherwise update_position will complain. In theory,
1162 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures 1202 * we could preserve the flags (GET_MAP_FLAGS), but update_position figures
1163 * those out anyways, and if there are any flags set right now, they won't 1203 * those out anyways, and if there are any flags set right now, they won't
1164 * be correct anyways. 1204 * be correct anyways.
1165 */ 1205 */
1166 SET_MAP_FLAGS(op->map, op->x, op->y, P_NEED_UPDATE); 1206 SET_MAP_FLAGS (op->map, op->x, op->y, P_NEED_UPDATE);
1167 update_position(op->map, op->x, op->y); 1207 update_position (op->map, op->x, op->y);
1168 } 1208 }
1169 else 1209 else
1170 update_object(last, UP_OBJ_REMOVE); 1210 update_object (last, UP_OBJ_REMOVE);
1171 1211
1172 if(QUERY_FLAG(op,FLAG_BLOCKSVIEW)|| (op->glow_radius != 0)) 1212 if (QUERY_FLAG (op, FLAG_BLOCKSVIEW) || (op->glow_radius != 0))
1173 update_all_los(op->map, op->x, op->y); 1213 update_all_los (op->map, op->x, op->y);
1174 1214 }
1175} 1215}
1176 1216
1177/* 1217/*
1178 * merge_ob(op,top): 1218 * merge_ob(op,top):
1179 * 1219 *
… …
1181 * merges op to the first matching object. 1221 * merges op to the first matching object.
1182 * If top is NULL, it is calculated. 1222 * If top is NULL, it is calculated.
1183 * Returns pointer to object if it succeded in the merge, otherwise NULL 1223 * Returns pointer to object if it succeded in the merge, otherwise NULL
1184 */ 1224 */
1185 1225
1226object *
1186object *merge_ob(object *op, object *top) { 1227merge_ob (object *op, object *top)
1228{
1187 if(!op->nrof) 1229 if (!op->nrof)
1188 return 0; 1230 return 0;
1231
1189 if(top==NULL) 1232 if (top == NULL)
1190 for(top=op;top!=NULL&&top->above!=NULL;top=top->above); 1233 for (top = op; top != NULL && top->above != NULL; top = top->above);
1234
1191 for(;top!=NULL;top=top->below) { 1235 for (; top != NULL; top = top->below)
1236 {
1192 if(top==op) 1237 if (top == op)
1193 continue; 1238 continue;
1194 if (CAN_MERGE(op,top)) 1239 if (CAN_MERGE (op, top))
1195 { 1240 {
1196 top->nrof+=op->nrof; 1241 top->nrof += op->nrof;
1242
1197/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ 1243/* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/
1198 op->weight = 0; /* Don't want any adjustements now */ 1244 op->weight = 0; /* Don't want any adjustements now */
1199 remove_ob(op); 1245 remove_ob (op);
1200 free_object(op); 1246 free_object (op);
1201 return top; 1247 return top;
1202 } 1248 }
1203 } 1249 }
1250
1204 return NULL; 1251 return NULL;
1205} 1252}
1206 1253
1207/* 1254/*
1208 * same as insert_ob_in_map except it handle separate coordinates and do a clean 1255 * same as insert_ob_in_map except it handle separate coordinates and do a clean
1209 * job preparing multi-part monsters 1256 * job preparing multi-part monsters
1210 */ 1257 */
1258object *
1211object *insert_ob_in_map_at(object *op, mapstruct *m, object *originator, int flag, int x, int y){ 1259insert_ob_in_map_at (object *op, mapstruct *m, object *originator, int flag, int x, int y)
1260{
1212 object* tmp; 1261 object *tmp;
1262
1213 if (op->head) 1263 if (op->head)
1214 op=op->head; 1264 op = op->head;
1265
1215 for (tmp=op;tmp;tmp=tmp->more){ 1266 for (tmp = op; tmp; tmp = tmp->more)
1267 {
1216 tmp->x=x+tmp->arch->clone.x; 1268 tmp->x = x + tmp->arch->clone.x;
1217 tmp->y=y+tmp->arch->clone.y; 1269 tmp->y = y + tmp->arch->clone.y;
1218 } 1270 }
1271
1219 return insert_ob_in_map (op, m, originator, flag); 1272 return insert_ob_in_map (op, m, originator, flag);
1220} 1273}
1221 1274
1222/* 1275/*
1223 * insert_ob_in_map (op, map, originator, flag): 1276 * insert_ob_in_map (op, map, originator, flag):
1224 * This function inserts the object in the two-way linked list 1277 * This function inserts the object in the two-way linked list
… …
1238 * new object if 'op' was merged with other object 1291 * new object if 'op' was merged with other object
1239 * NULL if 'op' was destroyed 1292 * NULL if 'op' was destroyed
1240 * just 'op' otherwise 1293 * just 'op' otherwise
1241 */ 1294 */
1242 1295
1296object *
1243object *insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag) 1297insert_ob_in_map (object *op, mapstruct *m, object *originator, int flag)
1244{ 1298{
1245 object *tmp, *top, *floor=NULL; 1299 object *tmp, *top, *floor = NULL;
1246 sint16 x,y; 1300 sint16 x, y;
1247 1301
1248 if (QUERY_FLAG (op, FLAG_FREED)) { 1302 if (QUERY_FLAG (op, FLAG_FREED))
1303 {
1249 LOG (llevError, "Trying to insert freed object!\n"); 1304 LOG (llevError, "Trying to insert freed object!\n");
1305 return NULL;
1306 }
1307
1308 if (m == NULL)
1309 {
1310 dump_object (op);
1311 LOG (llevError, "Trying to insert in null-map!\n%s\n", errmsg);
1312 return op;
1313 }
1314
1315 if (out_of_map (m, op->x, op->y))
1316 {
1317 dump_object (op);
1318 LOG (llevError, "Trying to insert object outside the map.\n%s\n", errmsg);
1319#ifdef MANY_CORES
1320 /* Better to catch this here, as otherwise the next use of this object
1321 * is likely to cause a crash. Better to find out where it is getting
1322 * improperly inserted.
1323 */
1324 abort ();
1325#endif
1326 return op;
1327 }
1328
1329 if (!QUERY_FLAG (op, FLAG_REMOVED))
1330 {
1331 dump_object (op);
1332 LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", errmsg);
1333 return op;
1334 }
1335
1336 if (op->more != NULL)
1337 {
1338 /* The part may be on a different map. */
1339
1340 object *more = op->more;
1341
1342 /* We really need the caller to normalize coordinates - if
1343 * we set the map, that doesn't work if the location is within
1344 * a map and this is straddling an edge. So only if coordinate
1345 * is clear wrong do we normalize it.
1346 */
1347 if (OUT_OF_REAL_MAP (more->map, more->x, more->y))
1348 more->map = get_map_from_coord (m, &more->x, &more->y);
1349 else if (!more->map)
1350 {
1351 /* For backwards compatibility - when not dealing with tiled maps,
1352 * more->map should always point to the parent.
1353 */
1354 more->map = m;
1355 }
1356
1357 if (insert_ob_in_map (more, more->map, originator, flag) == NULL)
1358 {
1359 if (!op->head)
1360 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1361
1362 return NULL;
1363 }
1364 }
1365
1366 CLEAR_FLAG (op, FLAG_REMOVED);
1367
1368 /* Ideally, the caller figures this out. However, it complicates a lot
1369 * of areas of callers (eg, anything that uses find_free_spot would now
1370 * need extra work
1371 */
1372 op->map = get_map_from_coord (m, &op->x, &op->y);
1373 x = op->x;
1374 y = op->y;
1375
1376 /* this has to be done after we translate the coordinates.
1377 */
1378 if (op->nrof && !(flag & INS_NO_MERGE))
1379 for (tmp = GET_MAP_OB (op->map, x, y); tmp != NULL; tmp = tmp->above)
1380 if (CAN_MERGE (op, tmp))
1381 {
1382 op->nrof += tmp->nrof;
1383 remove_ob (tmp);
1384 free_object (tmp);
1385 }
1386
1387 CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1388 CLEAR_FLAG (op, FLAG_INV_LOCKED);
1389
1390 if (!QUERY_FLAG (op, FLAG_ALIVE))
1391 CLEAR_FLAG (op, FLAG_NO_STEAL);
1392
1393 if (flag & INS_BELOW_ORIGINATOR)
1394 {
1395 if (originator->map != op->map || originator->x != op->x || originator->y != op->y)
1396 {
1397 LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1398 abort ();
1399 }
1400
1401 op->above = originator;
1402 op->below = originator->below;
1403
1404 if (op->below)
1405 op->below->above = op;
1406 else
1407 SET_MAP_OB (op->map, op->x, op->y, op);
1408
1409 /* since *below* originator, no need to update top */
1410 originator->below = op;
1411 }
1412 else
1413 {
1414 /* If there are other objects, then */
1415 if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL))
1416 {
1417 object *last = NULL;
1418
1419 /*
1420 * If there are multiple objects on this space, we do some trickier handling.
1421 * We've already dealt with merging if appropriate.
1422 * Generally, we want to put the new object on top. But if
1423 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1424 * floor, we want to insert above that and no further.
1425 * Also, if there are spell objects on this space, we stop processing
1426 * once we get to them. This reduces the need to traverse over all of
1427 * them when adding another one - this saves quite a bit of cpu time
1428 * when lots of spells are cast in one area. Currently, it is presumed
1429 * that flying non pickable objects are spell objects.
1430 */
1431
1432 while (top != NULL)
1433 {
1434 if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR))
1435 floor = top;
1436
1437 if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR))
1438 {
1439 /* We insert above top, so we want this object below this */
1440 top = top->below;
1441 break;
1442 }
1443
1444 last = top;
1445 top = top->above;
1446 }
1447
1448 /* Don't want top to be NULL, so set it to the last valid object */
1449 top = last;
1450
1451 /* We let update_position deal with figuring out what the space
1452 * looks like instead of lots of conditions here.
1453 * makes things faster, and effectively the same result.
1454 */
1455
1456 /* Have object 'fall below' other objects that block view.
1457 * Unless those objects are exits, type 66
1458 * If INS_ON_TOP is used, don't do this processing
1459 * Need to find the object that in fact blocks view, otherwise
1460 * stacking is a bit odd.
1461 */
1462 if (!(flag & INS_ON_TOP) &&
1463 (get_map_flags (op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) && (op->face && !op->face->visibility))
1464 {
1465 for (last = top; last != floor; last = last->below)
1466 if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT))
1467 break;
1468 /* Check to see if we found the object that blocks view,
1469 * and make sure we have a below pointer for it so that
1470 * we can get inserted below this one, which requires we
1471 * set top to the object below us.
1472 */
1473 if (last && last->below && last != floor)
1474 top = last->below;
1475 }
1476 } /* If objects on this space */
1477
1478 if (flag & INS_MAP_LOAD)
1479 top = GET_MAP_TOP (op->map, op->x, op->y);
1480
1481 if (flag & INS_ABOVE_FLOOR_ONLY)
1482 top = floor;
1483
1484 /* Top is the object that our object (op) is going to get inserted above.
1485 */
1486
1487 /* First object on this space */
1488 if (!top)
1489 {
1490 op->above = GET_MAP_OB (op->map, op->x, op->y);
1491
1492 if (op->above)
1493 op->above->below = op;
1494
1495 op->below = NULL;
1496 SET_MAP_OB (op->map, op->x, op->y, op);
1497 }
1498 else
1499 { /* get inserted into the stack above top */
1500 op->above = top->above;
1501
1502 if (op->above)
1503 op->above->below = op;
1504
1505 op->below = top;
1506 top->above = op;
1507 }
1508
1509 if (op->above == NULL)
1510 SET_MAP_TOP (op->map, op->x, op->y, op);
1511 } /* else not INS_BELOW_ORIGINATOR */
1512
1513 if (op->type == PLAYER)
1514 op->contr->do_los = 1;
1515
1516 /* If we have a floor, we know the player, if any, will be above
1517 * it, so save a few ticks and start from there.
1518 */
1519 if (!(flag & INS_MAP_LOAD))
1520 for (tmp = floor ? floor : GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1521 if (tmp->type == PLAYER)
1522 tmp->contr->socket.update_look = 1;
1523
1524 /* If this object glows, it may affect lighting conditions that are
1525 * visible to others on this map. But update_all_los is really
1526 * an inefficient way to do this, as it means los for all players
1527 * on the map will get recalculated. The players could very well
1528 * be far away from this change and not affected in any way -
1529 * this should get redone to only look for players within range,
1530 * or just updating the P_NEED_UPDATE for spaces within this area
1531 * of effect may be sufficient.
1532 */
1533 if (MAP_DARKNESS (op->map) && (op->glow_radius != 0))
1534 update_all_los (op->map, op->x, op->y);
1535
1536 /* updates flags (blocked, alive, no magic, etc) for this map space */
1537 update_object (op, UP_OBJ_INSERT);
1538
1539 /* Don't know if moving this to the end will break anything. However,
1540 * we want to have update_look set above before calling this.
1541 *
1542 * check_move_on() must be after this because code called from
1543 * check_move_on() depends on correct map flags (so functions like
1544 * blocked() and wall() work properly), and these flags are updated by
1545 * update_object().
1546 */
1547
1548 /* if this is not the head or flag has been passed, don't check walk on status */
1549 if (!(flag & INS_NO_WALK_ON) && !op->head)
1550 {
1551 if (check_move_on (op, originator))
1250 return NULL; 1552 return NULL;
1251 }
1252 if(m==NULL) {
1253 dump_object(op);
1254 LOG(llevError,"Trying to insert in null-map!\n%s\n",errmsg);
1255 return op;
1256 }
1257 if(out_of_map(m,op->x,op->y)) {
1258 dump_object(op);
1259 LOG(llevError,"Trying to insert object outside the map.\n%s\n", errmsg);
1260#ifdef MANY_CORES
1261 /* Better to catch this here, as otherwise the next use of this object
1262 * is likely to cause a crash. Better to find out where it is getting
1263 * improperly inserted.
1264 */
1265 abort();
1266#endif
1267 return op;
1268 }
1269 if(!QUERY_FLAG(op,FLAG_REMOVED)) {
1270 dump_object(op);
1271 LOG(llevError,"Trying to insert (map) inserted object.\n%s\n", errmsg);
1272 return op;
1273 }
1274 if(op->more!=NULL) {
1275 /* The part may be on a different map. */
1276 1553
1277 object *more = op->more;
1278
1279 /* We really need the caller to normalize coordinates - if
1280 * we set the map, that doesn't work if the location is within
1281 * a map and this is straddling an edge. So only if coordinate
1282 * is clear wrong do we normalize it.
1283 */
1284 if (OUT_OF_REAL_MAP(more->map, more->x, more->y)) {
1285 more->map = get_map_from_coord(m, &more->x, &more->y);
1286 } else if (!more->map) {
1287 /* For backwards compatibility - when not dealing with tiled maps,
1288 * more->map should always point to the parent.
1289 */
1290 more->map = m;
1291 }
1292
1293 if (insert_ob_in_map(more, more->map, originator, flag) == NULL) {
1294 if ( ! op->head)
1295 LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n");
1296 return NULL;
1297 }
1298 }
1299 CLEAR_FLAG(op,FLAG_REMOVED);
1300
1301 /* Ideally, the caller figures this out. However, it complicates a lot
1302 * of areas of callers (eg, anything that uses find_free_spot would now
1303 * need extra work
1304 */
1305 op->map=get_map_from_coord(m, &op->x, &op->y);
1306 x = op->x;
1307 y = op->y;
1308
1309 /* this has to be done after we translate the coordinates.
1310 */
1311 if(op->nrof && !(flag & INS_NO_MERGE)) {
1312 for(tmp=GET_MAP_OB(op->map,x,y);tmp!=NULL;tmp=tmp->above)
1313 if (CAN_MERGE(op,tmp)) {
1314 op->nrof+=tmp->nrof;
1315 remove_ob(tmp);
1316 free_object(tmp);
1317 }
1318 }
1319
1320 CLEAR_FLAG(op,FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */
1321 CLEAR_FLAG(op, FLAG_INV_LOCKED);
1322 if (!QUERY_FLAG(op, FLAG_ALIVE))
1323 CLEAR_FLAG(op, FLAG_NO_STEAL);
1324
1325 if (flag & INS_BELOW_ORIGINATOR) {
1326 if (originator->map != op->map || originator->x != op->x ||
1327 originator->y != op->y) {
1328 LOG(llevError,"insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n");
1329 abort();
1330 }
1331 op->above = originator;
1332 op->below = originator->below;
1333 if (op->below) op->below->above = op;
1334 else SET_MAP_OB(op->map, op->x, op->y, op);
1335 /* since *below* originator, no need to update top */
1336 originator->below = op;
1337 } else {
1338 /* If there are other objects, then */
1339 if((! (flag & INS_MAP_LOAD)) && ((top=GET_MAP_OB(op->map,op->x,op->y))!=NULL)) {
1340 object *last=NULL;
1341 /*
1342 * If there are multiple objects on this space, we do some trickier handling.
1343 * We've already dealt with merging if appropriate.
1344 * Generally, we want to put the new object on top. But if
1345 * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last
1346 * floor, we want to insert above that and no further.
1347 * Also, if there are spell objects on this space, we stop processing
1348 * once we get to them. This reduces the need to traverse over all of
1349 * them when adding another one - this saves quite a bit of cpu time
1350 * when lots of spells are cast in one area. Currently, it is presumed
1351 * that flying non pickable objects are spell objects.
1352 */
1353
1354 while (top != NULL) {
1355 if (QUERY_FLAG(top, FLAG_IS_FLOOR) ||
1356 QUERY_FLAG(top, FLAG_OVERLAY_FLOOR)) floor = top;
1357 if (QUERY_FLAG(top, FLAG_NO_PICK)
1358 && (top->move_type & (MOVE_FLY_LOW |MOVE_FLY_HIGH))
1359 && !QUERY_FLAG(top, FLAG_IS_FLOOR))
1360 {
1361 /* We insert above top, so we want this object below this */
1362 top=top->below;
1363 break;
1364 }
1365 last = top;
1366 top = top->above;
1367 }
1368 /* Don't want top to be NULL, so set it to the last valid object */
1369 top = last;
1370
1371 /* We let update_position deal with figuring out what the space
1372 * looks like instead of lots of conditions here.
1373 * makes things faster, and effectively the same result.
1374 */
1375
1376 /* Have object 'fall below' other objects that block view.
1377 * Unless those objects are exits, type 66
1378 * If INS_ON_TOP is used, don't do this processing
1379 * Need to find the object that in fact blocks view, otherwise
1380 * stacking is a bit odd.
1381 */
1382 if (!(flag & INS_ON_TOP) &&
1383 (get_map_flags(op->map, NULL, op->x, op->y, NULL, NULL) & P_BLOCKSVIEW) &&
1384 (op->face && !op->face->visibility)) {
1385 for (last=top; last != floor; last=last->below)
1386 if (QUERY_FLAG(last, FLAG_BLOCKSVIEW)&&(last->type != EXIT)) break;
1387 /* Check to see if we found the object that blocks view,
1388 * and make sure we have a below pointer for it so that
1389 * we can get inserted below this one, which requires we
1390 * set top to the object below us.
1391 */
1392 if (last && last->below && last != floor) top=last->below;
1393 }
1394 } /* If objects on this space */
1395 if (flag & INS_MAP_LOAD)
1396 top = GET_MAP_TOP(op->map,op->x,op->y);
1397 if (flag & INS_ABOVE_FLOOR_ONLY) top = floor;
1398
1399 /* Top is the object that our object (op) is going to get inserted above.
1400 */
1401
1402 /* First object on this space */
1403 if (!top) {
1404 op->above = GET_MAP_OB(op->map, op->x, op->y);
1405 if (op->above) op->above->below = op;
1406 op->below = NULL;
1407 SET_MAP_OB(op->map, op->x, op->y, op);
1408 } else { /* get inserted into the stack above top */
1409 op->above = top->above;
1410 if (op->above) op->above->below = op;
1411 op->below = top;
1412 top->above = op;
1413 }
1414 if (op->above==NULL)
1415 SET_MAP_TOP(op->map,op->x, op->y, op);
1416 } /* else not INS_BELOW_ORIGINATOR */
1417
1418 if(op->type==PLAYER)
1419 op->contr->do_los=1;
1420
1421 /* If we have a floor, we know the player, if any, will be above
1422 * it, so save a few ticks and start from there.
1423 */
1424 if (!(flag & INS_MAP_LOAD))
1425 for(tmp=floor?floor:GET_MAP_OB(op->map,op->x,op->y);tmp!=NULL;tmp=tmp->above) {
1426 if (tmp->type == PLAYER)
1427 tmp->contr->socket.update_look=1;
1428 }
1429
1430 /* If this object glows, it may affect lighting conditions that are
1431 * visible to others on this map. But update_all_los is really
1432 * an inefficient way to do this, as it means los for all players
1433 * on the map will get recalculated. The players could very well
1434 * be far away from this change and not affected in any way -
1435 * this should get redone to only look for players within range,
1436 * or just updating the P_NEED_UPDATE for spaces within this area
1437 * of effect may be sufficient.
1438 */
1439 if(MAP_DARKNESS(op->map) && (op->glow_radius != 0))
1440 update_all_los(op->map, op->x, op->y);
1441
1442
1443 /* updates flags (blocked, alive, no magic, etc) for this map space */
1444 update_object(op,UP_OBJ_INSERT);
1445
1446
1447 /* Don't know if moving this to the end will break anything. However,
1448 * we want to have update_look set above before calling this.
1449 *
1450 * check_move_on() must be after this because code called from
1451 * check_move_on() depends on correct map flags (so functions like
1452 * blocked() and wall() work properly), and these flags are updated by
1453 * update_object().
1454 */
1455
1456 /* if this is not the head or flag has been passed, don't check walk on status */
1457
1458 if (!(flag & INS_NO_WALK_ON) && !op->head) {
1459 if (check_move_on(op, originator))
1460 return NULL;
1461
1462 /* If we are a multi part object, lets work our way through the check 1554 /* If we are a multi part object, lets work our way through the check
1463 * walk on's. 1555 * walk on's.
1464 */ 1556 */
1465 for (tmp=op->more; tmp!=NULL; tmp=tmp->more) 1557 for (tmp = op->more; tmp != NULL; tmp = tmp->more)
1466 if (check_move_on (tmp, originator)) 1558 if (check_move_on (tmp, originator))
1467 return NULL; 1559 return NULL;
1468 } 1560 }
1561
1469 return op; 1562 return op;
1470} 1563}
1471 1564
1472/* this function inserts an object in the map, but if it 1565/* this function inserts an object in the map, but if it
1473 * finds an object of its own type, it'll remove that one first. 1566 * finds an object of its own type, it'll remove that one first.
1474 * op is the object to insert it under: supplies x and the map. 1567 * op is the object to insert it under: supplies x and the map.
1475 */ 1568 */
1569void
1476void replace_insert_ob_in_map(const char *arch_string, object *op) { 1570replace_insert_ob_in_map (const char *arch_string, object *op)
1571{
1477 object *tmp; 1572 object *
1478 object *tmp1; 1573 tmp;
1574 object *
1575 tmp1;
1479 1576
1480 /* first search for itself and remove any old instances */ 1577 /* first search for itself and remove any old instances */
1481 1578
1482 for(tmp=GET_MAP_OB(op->map,op->x,op->y); tmp!=NULL; tmp=tmp->above) { 1579 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL; tmp = tmp->above)
1580 {
1483 if(!strcmp(tmp->arch->name,arch_string)) /* same archetype */ { 1581 if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */
1582 {
1484 remove_ob(tmp); 1583 remove_ob (tmp);
1485 free_object(tmp); 1584 free_object (tmp);
1486 } 1585 }
1487 } 1586 }
1488 1587
1489 tmp1=arch_to_object(find_archetype(arch_string)); 1588 tmp1 = arch_to_object (find_archetype (arch_string));
1490 1589
1491 1590 tmp1->x = op->x;
1492 tmp1->x = op->x; tmp1->y = op->y; 1591 tmp1->y = op->y;
1493 insert_ob_in_map(tmp1,op->map,op,0); 1592 insert_ob_in_map (tmp1, op->map, op, 0);
1494} 1593}
1495 1594
1496/* 1595/*
1497 * get_split_ob(ob,nr) splits up ob into two parts. The part which 1596 * get_split_ob(ob,nr) splits up ob into two parts. The part which
1498 * is returned contains nr objects, and the remaining parts contains 1597 * is returned contains nr objects, and the remaining parts contains
1499 * the rest (or is removed and freed if that number is 0). 1598 * the rest (or is removed and freed if that number is 0).
1500 * On failure, NULL is returned, and the reason put into the 1599 * On failure, NULL is returned, and the reason put into the
1501 * global static errmsg array. 1600 * global static errmsg array.
1502 */ 1601 */
1503 1602
1603object *
1504object *get_split_ob(object *orig_ob, uint32 nr) { 1604get_split_ob (object *orig_ob, uint32 nr)
1505 object *newob; 1605{
1606 object *
1607 newob;
1608 int
1506 int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); 1609 is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0);
1507 1610
1508 if(orig_ob->nrof<nr) { 1611 if (orig_ob->nrof < nr)
1509 sprintf(errmsg,"There are only %d %ss.", 1612 {
1510 orig_ob->nrof?orig_ob->nrof:1, &orig_ob->name); 1613 sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name);
1511 return NULL; 1614 return NULL;
1512 } 1615 }
1616
1513 newob = object_create_clone(orig_ob); 1617 newob = object_create_clone (orig_ob);
1618
1514 if((orig_ob->nrof-=nr)<1) { 1619 if ((orig_ob->nrof -= nr) < 1)
1620 {
1515 if ( ! is_removed) 1621 if (!is_removed)
1516 remove_ob(orig_ob); 1622 remove_ob (orig_ob);
1517 free_object2(orig_ob, 1); 1623 free_object2 (orig_ob, 1);
1518 } 1624 }
1519 else if ( ! is_removed) { 1625 else if (!is_removed)
1626 {
1520 if(orig_ob->env!=NULL) 1627 if (orig_ob->env != NULL)
1521 sub_weight (orig_ob->env,orig_ob->weight*nr); 1628 sub_weight (orig_ob->env, orig_ob->weight * nr);
1522 if (orig_ob->env == NULL && orig_ob->map->in_memory!=MAP_IN_MEMORY) { 1629 if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY)
1630 {
1523 strcpy(errmsg, "Tried to split object whose map is not in memory."); 1631 strcpy (errmsg, "Tried to split object whose map is not in memory.");
1524 LOG(llevDebug,
1525 "Error, Tried to split object whose map is not in memory.\n"); 1632 LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n");
1526 return NULL; 1633 return NULL;
1527 } 1634 }
1528 } 1635 }
1636
1529 newob->nrof=nr; 1637 newob->nrof = nr;
1530 1638
1531 return newob; 1639 return newob;
1532} 1640}
1533 1641
1534/* 1642/*
1535 * decrease_ob_nr(object, number) decreases a specified number from 1643 * decrease_ob_nr(object, number) decreases a specified number from
1536 * the amount of an object. If the amount reaches 0, the object 1644 * the amount of an object. If the amount reaches 0, the object
1537 * is subsequently removed and freed. 1645 * is subsequently removed and freed.
1538 * 1646 *
1539 * Return value: 'op' if something is left, NULL if the amount reached 0 1647 * Return value: 'op' if something is left, NULL if the amount reached 0
1540 */ 1648 */
1541 1649
1650object *
1542object *decrease_ob_nr (object *op, uint32 i) 1651decrease_ob_nr (object *op, uint32 i)
1543{ 1652{
1544 object *tmp; 1653 object *tmp;
1545 player *pl; 1654 player *pl;
1546 1655
1547 if (i == 0) /* objects with op->nrof require this check */ 1656 if (i == 0) /* objects with op->nrof require this check */
1548 return op; 1657 return op;
1549 1658
1550 if (i > op->nrof) 1659 if (i > op->nrof)
1551 i = op->nrof; 1660 i = op->nrof;
1552 1661
1553 if (QUERY_FLAG (op, FLAG_REMOVED)) 1662 if (QUERY_FLAG (op, FLAG_REMOVED))
1663 op->nrof -= i;
1664 else if (op->env != NULL)
1665 {
1666 /* is this object in the players inventory, or sub container
1667 * therein?
1668 */
1669 tmp = is_player_inv (op->env);
1670 /* nope. Is this a container the player has opened?
1671 * If so, set tmp to that player.
1672 * IMO, searching through all the players will mostly
1673 * likely be quicker than following op->env to the map,
1674 * and then searching the map for a player.
1675 */
1676 if (!tmp)
1677 {
1678 for (pl = first_player; pl; pl = pl->next)
1679 if (pl->ob->container == op->env)
1680 break;
1681 if (pl)
1682 tmp = pl->ob;
1683 else
1684 tmp = NULL;
1685 }
1686
1687 if (i < op->nrof)
1688 {
1689 sub_weight (op->env, op->weight * i);
1690 op->nrof -= i;
1691 if (tmp)
1692 {
1693 esrv_send_item (tmp, op);
1694 }
1695 }
1696 else
1697 {
1698 remove_ob (op);
1699 op->nrof = 0;
1700 if (tmp)
1701 {
1702 esrv_del_item (tmp->contr, op->count);
1703 }
1704 }
1554 { 1705 }
1706 else
1707 {
1708 object *above = op->above;
1709
1710 if (i < op->nrof)
1555 op->nrof -= i; 1711 op->nrof -= i;
1556 } 1712 else
1557 else if (op->env != NULL)
1558 {
1559 /* is this object in the players inventory, or sub container
1560 * therein?
1561 */
1562 tmp = is_player_inv (op->env);
1563 /* nope. Is this a container the player has opened?
1564 * If so, set tmp to that player.
1565 * IMO, searching through all the players will mostly
1566 * likely be quicker than following op->env to the map,
1567 * and then searching the map for a player.
1568 */
1569 if (!tmp) {
1570 for (pl=first_player; pl; pl=pl->next)
1571 if (pl->ob->container == op->env) break;
1572 if (pl) tmp=pl->ob;
1573 else tmp=NULL;
1574 } 1713 {
1575
1576 if (i < op->nrof) {
1577 sub_weight (op->env, op->weight * i);
1578 op->nrof -= i;
1579 if (tmp) {
1580 esrv_send_item(tmp, op);
1581 }
1582 } else {
1583 remove_ob (op); 1714 remove_ob (op);
1584 op->nrof = 0; 1715 op->nrof = 0;
1585 if (tmp) {
1586 esrv_del_item(tmp->contr, op->count);
1587 } 1716 }
1588 }
1589 }
1590 else
1591 {
1592 object *above = op->above;
1593 1717
1594 if (i < op->nrof) {
1595 op->nrof -= i;
1596 } else {
1597 remove_ob (op);
1598 op->nrof = 0;
1599 }
1600 /* Since we just removed op, op->above is null */ 1718 /* Since we just removed op, op->above is null */
1601 for (tmp = above; tmp != NULL; tmp = tmp->above) 1719 for (tmp = above; tmp != NULL; tmp = tmp->above)
1602 if (tmp->type == PLAYER) { 1720 if (tmp->type == PLAYER)
1721 {
1603 if (op->nrof) 1722 if (op->nrof)
1604 esrv_send_item(tmp, op); 1723 esrv_send_item (tmp, op);
1605 else 1724 else
1606 esrv_del_item(tmp->contr, op->count); 1725 esrv_del_item (tmp->contr, op->count);
1607 } 1726 }
1608 } 1727 }
1609 1728
1610 if (op->nrof) { 1729 if (op->nrof)
1611 return op; 1730 return op;
1612 } else { 1731 else
1732 {
1613 free_object (op); 1733 free_object (op);
1614 return NULL; 1734 return NULL;
1615 } 1735 }
1616} 1736}
1617 1737
1618/* 1738/*
1619 * add_weight(object, weight) adds the specified weight to an object, 1739 * add_weight(object, weight) adds the specified weight to an object,
1620 * and also updates how much the environment(s) is/are carrying. 1740 * and also updates how much the environment(s) is/are carrying.
1621 */ 1741 */
1622 1742
1743void
1623void add_weight (object *op, signed long weight) { 1744add_weight (object *op, signed long weight)
1745{
1624 while (op!=NULL) { 1746 while (op != NULL)
1747 {
1625 if (op->type == CONTAINER) { 1748 if (op->type == CONTAINER)
1626 weight=(signed long)(weight*(100-op->stats.Str)/100); 1749 weight = (signed long) (weight * (100 - op->stats.Str) / 100);
1627 } 1750
1628 op->carrying+=weight; 1751 op->carrying += weight;
1629 op=op->env; 1752 op = op->env;
1630 } 1753 }
1631} 1754}
1632 1755
1633/* 1756/*
1634 * insert_ob_in_ob(op,environment): 1757 * insert_ob_in_ob(op,environment):
1635 * This function inserts the object op in the linked list 1758 * This function inserts the object op in the linked list
… …
1642 * 1765 *
1643 * The function returns now pointer to inserted item, and return value can 1766 * The function returns now pointer to inserted item, and return value can
1644 * be != op, if items are merged. -Tero 1767 * be != op, if items are merged. -Tero
1645 */ 1768 */
1646 1769
1770object *
1647object *insert_ob_in_ob(object *op,object *where) { 1771insert_ob_in_ob (object *op, object *where)
1648 object *tmp, *otmp; 1772{
1773 object *
1774 tmp, *
1775 otmp;
1649 1776
1650 if(!QUERY_FLAG(op,FLAG_REMOVED)) { 1777 if (!QUERY_FLAG (op, FLAG_REMOVED))
1778 {
1651 dump_object(op); 1779 dump_object (op);
1652 LOG(llevError,"Trying to insert (ob) inserted object.\n%s\n", errmsg); 1780 LOG (llevError, "Trying to insert (ob) inserted object.\n%s\n", errmsg);
1653 return op; 1781 return op;
1654 } 1782 }
1783
1655 if(where==NULL) { 1784 if (where == NULL)
1785 {
1656 dump_object(op); 1786 dump_object (op);
1657 LOG(llevError,"Trying to put object in NULL.\n%s\n", errmsg); 1787 LOG (llevError, "Trying to put object in NULL.\n%s\n", errmsg);
1658 return op; 1788 return op;
1659 } 1789 }
1790
1660 if (where->head) { 1791 if (where->head)
1661 LOG(llevDebug, 1792 {
1662 "Warning: Tried to insert object wrong part of multipart object.\n"); 1793 LOG (llevDebug, "Warning: Tried to insert object wrong part of multipart object.\n");
1663 where = where->head; 1794 where = where->head;
1664 } 1795 }
1796
1665 if (op->more) { 1797 if (op->more)
1798 {
1666 LOG(llevError, "Tried to insert multipart object %s (%d)\n", 1799 LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count);
1667 &op->name, op->count);
1668 return op; 1800 return op;
1669 } 1801 }
1802
1670 CLEAR_FLAG(op, FLAG_OBJ_ORIGINAL); 1803 CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL);
1671 CLEAR_FLAG(op, FLAG_REMOVED); 1804 CLEAR_FLAG (op, FLAG_REMOVED);
1672 if(op->nrof) { 1805 if (op->nrof)
1806 {
1673 for(tmp=where->inv;tmp!=NULL;tmp=tmp->below) 1807 for (tmp = where->inv; tmp != NULL; tmp = tmp->below)
1674 if ( CAN_MERGE(tmp,op) ) { 1808 if (CAN_MERGE (tmp, op))
1809 {
1675 /* return the original object and remove inserted object 1810 /* return the original object and remove inserted object
1676 (client needs the original object) */ 1811 (client needs the original object) */
1677 tmp->nrof += op->nrof; 1812 tmp->nrof += op->nrof;
1678 /* Weight handling gets pretty funky. Since we are adding to 1813 /* Weight handling gets pretty funky. Since we are adding to
1679 * tmp->nrof, we need to increase the weight. 1814 * tmp->nrof, we need to increase the weight.
1680 */ 1815 */
1681 add_weight (where, op->weight*op->nrof); 1816 add_weight (where, op->weight * op->nrof);
1682 SET_FLAG(op, FLAG_REMOVED); 1817 SET_FLAG (op, FLAG_REMOVED);
1683 free_object(op); /* free the inserted object */ 1818 free_object (op); /* free the inserted object */
1684 op = tmp; 1819 op = tmp;
1685 remove_ob (op); /* and fix old object's links */ 1820 remove_ob (op); /* and fix old object's links */
1686 CLEAR_FLAG(op, FLAG_REMOVED); 1821 CLEAR_FLAG (op, FLAG_REMOVED);
1687 break; 1822 break;
1688 } 1823 }
1689 1824
1690 /* I assume combined objects have no inventory 1825 /* I assume combined objects have no inventory
1691 * We add the weight - this object could have just been removed 1826 * We add the weight - this object could have just been removed
1692 * (if it was possible to merge). calling remove_ob will subtract 1827 * (if it was possible to merge). calling remove_ob will subtract
1693 * the weight, so we need to add it in again, since we actually do 1828 * the weight, so we need to add it in again, since we actually do
1694 * the linking below 1829 * the linking below
1695 */ 1830 */
1696 add_weight (where, op->weight*op->nrof); 1831 add_weight (where, op->weight * op->nrof);
1832 }
1697 } else 1833 else
1698 add_weight (where, (op->weight+op->carrying)); 1834 add_weight (where, (op->weight + op->carrying));
1699 1835
1700 otmp=is_player_inv(where); 1836 otmp = is_player_inv (where);
1701 if (otmp&&otmp->contr!=NULL) { 1837 if (otmp && otmp->contr != NULL)
1838 {
1702 if (!QUERY_FLAG(otmp,FLAG_NO_FIX_PLAYER)) 1839 if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER))
1703 fix_player(otmp); 1840 fix_player (otmp);
1704 } 1841 }
1705 1842
1706 op->map=NULL; 1843 op->map = NULL;
1707 op->env=where; 1844 op->env = where;
1708 op->above=NULL; 1845 op->above = NULL;
1709 op->below=NULL; 1846 op->below = NULL;
1710 op->x=0,op->y=0; 1847 op->x = 0, op->y = 0;
1711 1848
1712 /* reset the light list and los of the players on the map */ 1849 /* reset the light list and los of the players on the map */
1713 if((op->glow_radius!=0)&&where->map) 1850 if ((op->glow_radius != 0) && where->map)
1714 { 1851 {
1715#ifdef DEBUG_LIGHTS 1852#ifdef DEBUG_LIGHTS
1716 LOG(llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", 1853 LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name);
1717 op->name);
1718#endif /* DEBUG_LIGHTS */ 1854#endif /* DEBUG_LIGHTS */
1855 if (MAP_DARKNESS (where->map))
1719 if (MAP_DARKNESS(where->map)) update_all_los(where->map, where->x, where->y); 1856 update_all_los (where->map, where->x, where->y);
1720 } 1857 }
1721 1858
1722 /* Client has no idea of ordering so lets not bother ordering it here. 1859 /* Client has no idea of ordering so lets not bother ordering it here.
1723 * It sure simplifies this function... 1860 * It sure simplifies this function...
1724 */ 1861 */
1725 if (where->inv==NULL) 1862 if (where->inv == NULL)
1726 where->inv=op; 1863 where->inv = op;
1727 else { 1864 else
1865 {
1728 op->below = where->inv; 1866 op->below = where->inv;
1729 op->below->above = op; 1867 op->below->above = op;
1730 where->inv = op; 1868 where->inv = op;
1731 } 1869 }
1732 return op; 1870 return op;
1733} 1871}
1734 1872
1735/* 1873/*
1736 * Checks if any objects has a move_type that matches objects 1874 * Checks if any objects has a move_type that matches objects
… …
1751 * MSW 2001-07-08: Check all objects on space, not just those below 1889 * MSW 2001-07-08: Check all objects on space, not just those below
1752 * object being inserted. insert_ob_in_map may not put new objects 1890 * object being inserted. insert_ob_in_map may not put new objects
1753 * on top. 1891 * on top.
1754 */ 1892 */
1755 1893
1894int
1756int check_move_on (object *op, object *originator) 1895check_move_on (object *op, object *originator)
1757{ 1896{
1758 object *tmp; 1897 object *
1759 tag_t tag; 1898 tmp;
1760 mapstruct *m=op->map; 1899 tag_t
1900 tag;
1901 mapstruct *
1902 m = op->map;
1903 int
1761 int x=op->x, y=op->y; 1904 x = op->x, y = op->y;
1762 MoveType move_on, move_slow, move_block;
1763 1905
1906 MoveType
1907 move_on,
1908 move_slow,
1909 move_block;
1910
1764 if(QUERY_FLAG(op,FLAG_NO_APPLY)) 1911 if (QUERY_FLAG (op, FLAG_NO_APPLY))
1765 return 0; 1912 return 0;
1766 1913
1767 tag = op->count; 1914 tag = op->count;
1768 1915
1769 move_on = GET_MAP_MOVE_ON(op->map, op->x, op->y); 1916 move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y);
1770 move_slow = GET_MAP_MOVE_SLOW(op->map, op->x, op->y); 1917 move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y);
1771 move_block = GET_MAP_MOVE_BLOCK(op->map, op->x, op->y); 1918 move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y);
1772 1919
1773 /* if nothing on this space will slow op down or be applied, 1920 /* if nothing on this space will slow op down or be applied,
1774 * no need to do checking below. have to make sure move_type 1921 * no need to do checking below. have to make sure move_type
1775 * is set, as lots of objects don't have it set - we treat that 1922 * is set, as lots of objects don't have it set - we treat that
1776 * as walking. 1923 * as walking.
1777 */ 1924 */
1778 if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow)) 1925 if (op->move_type && !(op->move_type & move_on) && !(op->move_type & move_slow))
1779 return 0; 1926 return 0;
1780 1927
1781 /* This is basically inverse logic of that below - basically, 1928 /* This is basically inverse logic of that below - basically,
1782 * if the object can avoid the move on or slow move, they do so, 1929 * if the object can avoid the move on or slow move, they do so,
1783 * but can't do it if the alternate movement they are using is 1930 * but can't do it if the alternate movement they are using is
1784 * blocked. Logic on this seems confusing, but does seem correct. 1931 * blocked. Logic on this seems confusing, but does seem correct.
1785 */ 1932 */
1786 if ((op->move_type & ~move_on & ~move_block) != 0 && 1933 if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0)
1787 (op->move_type & ~move_slow & ~move_block) != 0) return 0; 1934 return 0;
1788 1935
1789 /* The objects have to be checked from top to bottom. 1936 /* The objects have to be checked from top to bottom.
1790 * Hence, we first go to the top: 1937 * Hence, we first go to the top:
1791 */ 1938 */
1792 1939
1793 for (tmp=GET_MAP_OB(op->map, op->x, op->y); tmp!=NULL && 1940 for (tmp = GET_MAP_OB (op->map, op->x, op->y); tmp != NULL && tmp->above != NULL; tmp = tmp->above)
1794 tmp->above!=NULL; tmp=tmp->above) { 1941 {
1795 /* Trim the search when we find the first other spell effect 1942 /* Trim the search when we find the first other spell effect
1796 * this helps performance so that if a space has 50 spell objects, 1943 * this helps performance so that if a space has 50 spell objects,
1797 * we don't need to check all of them. 1944 * we don't need to check all of them.
1798 */ 1945 */
1799 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG(tmp, FLAG_NO_PICK)) break; 1946 if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK))
1947 break;
1948 }
1949
1950 for (; tmp; tmp = tmp->below)
1800 } 1951 {
1801 for(;tmp!=NULL; tmp=tmp->below) { 1952 if (tmp == op)
1802 if (tmp == op) continue; /* Can't apply yourself */ 1953 continue; /* Can't apply yourself */
1803 1954
1804 /* Check to see if one of the movement types should be slowed down. 1955 /* Check to see if one of the movement types should be slowed down.
1805 * Second check makes sure that the movement types not being slowed 1956 * Second check makes sure that the movement types not being slowed
1806 * (~slow_move) is not blocked on this space - just because the 1957 * (~slow_move) is not blocked on this space - just because the
1807 * space doesn't slow down swimming (for example), if you can't actually 1958 * space doesn't slow down swimming (for example), if you can't actually
1808 * swim on that space, can't use it to avoid the penalty. 1959 * swim on that space, can't use it to avoid the penalty.
1809 */ 1960 */
1810 if (!QUERY_FLAG(op, FLAG_WIZPASS)) { 1961 if (!QUERY_FLAG (op, FLAG_WIZPASS))
1962 {
1811 if ((!op->move_type && tmp->move_slow & MOVE_WALK) || 1963 if ((!op->move_type && tmp->move_slow & MOVE_WALK) ||
1812 ((op->move_type & tmp->move_slow) &&
1813 (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) { 1964 ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0))
1965 {
1814 1966
1815 float diff; 1967 float
1816
1817 diff = tmp->move_slow_penalty*FABS(op->speed); 1968 diff = tmp->move_slow_penalty * FABS (op->speed);
1969
1818 if (op->type == PLAYER) { 1970 if (op->type == PLAYER)
1819 if ((QUERY_FLAG(tmp, FLAG_IS_HILLY) && find_skill_by_number(op, SK_CLIMBING)) || 1971 if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) ||
1820 (QUERY_FLAG(tmp, FLAG_IS_WOODED) && find_skill_by_number(op, SK_WOODSMAN))) { 1972 (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN)))
1821 diff /= 4.0; 1973 diff /= 4.0;
1822 } 1974
1823 }
1824 op->speed_left -= diff; 1975 op->speed_left -= diff;
1825 } 1976 }
1826 } 1977 }
1827 1978
1828 /* Basically same logic as above, except now for actual apply. */ 1979 /* Basically same logic as above, except now for actual apply. */
1829 if ((!op->move_type && tmp->move_on & MOVE_WALK) || 1980 if ((!op->move_type && tmp->move_on & MOVE_WALK) ||
1830 ((op->move_type & tmp->move_on) &&
1831 (op->move_type & ~tmp->move_on & ~tmp->move_block)==0)) { 1981 ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0))
1832 1982 {
1833 move_apply(tmp, op, originator); 1983 move_apply (tmp, op, originator);
1984
1834 if (was_destroyed (op, tag)) 1985 if (was_destroyed (op, tag))
1835 return 1; 1986 return 1;
1836 1987
1837 /* what the person/creature stepped onto has moved the object 1988 /* what the person/creature stepped onto has moved the object
1838 * someplace new. Don't process any further - if we did, 1989 * someplace new. Don't process any further - if we did,
1839 * have a feeling strange problems would result. 1990 * have a feeling strange problems would result.
1840 */ 1991 */
1841 if (op->map != m || op->x != x || op->y != y) return 0; 1992 if (op->map != m || op->x != x || op->y != y)
1993 return 0;
1842 } 1994 }
1843 } 1995 }
1996
1844 return 0; 1997 return 0;
1845} 1998}
1846 1999
1847/* 2000/*
1848 * present_arch(arch, map, x, y) searches for any objects with 2001 * present_arch(arch, map, x, y) searches for any objects with
1849 * a matching archetype at the given map and coordinates. 2002 * a matching archetype at the given map and coordinates.
1850 * The first matching object is returned, or NULL if none. 2003 * The first matching object is returned, or NULL if none.
1851 */ 2004 */
1852 2005
2006object *
1853object *present_arch(const archetype *at, mapstruct *m, int x, int y) { 2007present_arch (const archetype *at, mapstruct *m, int x, int y)
2008{
1854 object *tmp; 2009 object *
2010 tmp;
2011
1855 if(m==NULL || out_of_map(m,x,y)) { 2012 if (m == NULL || out_of_map (m, x, y))
2013 {
1856 LOG(llevError,"Present_arch called outside map.\n"); 2014 LOG (llevError, "Present_arch called outside map.\n");
1857 return NULL; 2015 return NULL;
1858 } 2016 }
1859 for(tmp=GET_MAP_OB(m,x,y); tmp != NULL; tmp = tmp->above) 2017 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1860 if(tmp->arch == at) 2018 if (tmp->arch == at)
1861 return tmp; 2019 return tmp;
1862 return NULL; 2020 return NULL;
1863} 2021}
1864 2022
1865/* 2023/*
1866 * present(type, map, x, y) searches for any objects with 2024 * present(type, map, x, y) searches for any objects with
1867 * a matching type variable at the given map and coordinates. 2025 * a matching type variable at the given map and coordinates.
1868 * The first matching object is returned, or NULL if none. 2026 * The first matching object is returned, or NULL if none.
1869 */ 2027 */
1870 2028
2029object *
1871object *present(unsigned char type,mapstruct *m, int x,int y) { 2030present (unsigned char type, mapstruct *m, int x, int y)
2031{
1872 object *tmp; 2032 object *
2033 tmp;
2034
1873 if(out_of_map(m,x,y)) { 2035 if (out_of_map (m, x, y))
2036 {
1874 LOG(llevError,"Present called outside map.\n"); 2037 LOG (llevError, "Present called outside map.\n");
1875 return NULL; 2038 return NULL;
1876 } 2039 }
1877 for(tmp=GET_MAP_OB(m,x,y);tmp!=NULL;tmp=tmp->above) 2040 for (tmp = GET_MAP_OB (m, x, y); tmp != NULL; tmp = tmp->above)
1878 if(tmp->type==type) 2041 if (tmp->type == type)
1879 return tmp; 2042 return tmp;
1880 return NULL; 2043 return NULL;
1881} 2044}
1882 2045
1883/* 2046/*
1884 * present_in_ob(type, object) searches for any objects with 2047 * present_in_ob(type, object) searches for any objects with
1885 * a matching type variable in the inventory of the given object. 2048 * a matching type variable in the inventory of the given object.
1886 * The first matching object is returned, or NULL if none. 2049 * The first matching object is returned, or NULL if none.
1887 */ 2050 */
1888 2051
2052object *
1889object *present_in_ob(unsigned char type, const object *op) { 2053present_in_ob (unsigned char type, const object *op)
2054{
1890 object *tmp; 2055 object *
2056 tmp;
2057
1891 for(tmp=op->inv;tmp!=NULL;tmp=tmp->below) 2058 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
1892 if(tmp->type==type) 2059 if (tmp->type == type)
1893 return tmp; 2060 return tmp;
1894 return NULL; 2061 return NULL;
1895} 2062}
1896 2063
1897/* 2064/*
… …
1907 * the object name, not the archetype name. this is so that the 2074 * the object name, not the archetype name. this is so that the
1908 * spell code can use one object type (force), but change it's name 2075 * spell code can use one object type (force), but change it's name
1909 * to be unique. 2076 * to be unique.
1910 */ 2077 */
1911 2078
2079object *
1912object *present_in_ob_by_name(int type, const char *str, const object *op) { 2080present_in_ob_by_name (int type, const char *str, const object *op)
2081{
1913 object *tmp; 2082 object *
2083 tmp;
1914 2084
1915 for(tmp=op->inv; tmp!=NULL; tmp=tmp->below) { 2085 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2086 {
1916 if ((type==-1 || tmp->type==type) && (!strcmp(str, tmp->name))) 2087 if ((type == -1 || tmp->type == type) && (!strcmp (str, tmp->name)))
1917 return tmp; 2088 return tmp;
1918 } 2089 }
1919 return NULL; 2090 return NULL;
1920} 2091}
1921 2092
1922/* 2093/*
1923 * present_arch_in_ob(archetype, object) searches for any objects with 2094 * present_arch_in_ob(archetype, object) searches for any objects with
1924 * a matching archetype in the inventory of the given object. 2095 * a matching archetype in the inventory of the given object.
1925 * The first matching object is returned, or NULL if none. 2096 * The first matching object is returned, or NULL if none.
1926 */ 2097 */
1927 2098
2099object *
1928object *present_arch_in_ob(const archetype *at, const object *op) { 2100present_arch_in_ob (const archetype *at, const object *op)
2101{
1929 object *tmp; 2102 object *
2103 tmp;
2104
1930 for(tmp=op->inv;tmp!=NULL;tmp=tmp->below) 2105 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
1931 if( tmp->arch == at) 2106 if (tmp->arch == at)
1932 return tmp; 2107 return tmp;
1933 return NULL; 2108 return NULL;
1934} 2109}
1935 2110
1936/* 2111/*
1937 * activate recursively a flag on an object inventory 2112 * activate recursively a flag on an object inventory
1938 */ 2113 */
2114void
1939void flag_inv(object*op, int flag){ 2115flag_inv (object *op, int flag)
2116{
1940 object *tmp; 2117 object *
2118 tmp;
2119
1941 if(op->inv) 2120 if (op->inv)
1942 for(tmp = op->inv; tmp != NULL; tmp = tmp->below){ 2121 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2122 {
1943 SET_FLAG(tmp, flag); 2123 SET_FLAG (tmp, flag);
1944 flag_inv(tmp,flag); 2124 flag_inv (tmp, flag);
1945 } 2125 }
1946}/* 2126} /*
1947 * desactivate recursively a flag on an object inventory 2127 * desactivate recursively a flag on an object inventory
1948 */ 2128 */
2129void
1949void unflag_inv(object*op, int flag){ 2130unflag_inv (object *op, int flag)
2131{
1950 object *tmp; 2132 object *
2133 tmp;
2134
1951 if(op->inv) 2135 if (op->inv)
1952 for(tmp = op->inv; tmp != NULL; tmp = tmp->below){ 2136 for (tmp = op->inv; tmp != NULL; tmp = tmp->below)
2137 {
1953 CLEAR_FLAG(tmp, flag); 2138 CLEAR_FLAG (tmp, flag);
1954 unflag_inv(tmp,flag); 2139 unflag_inv (tmp, flag);
1955 } 2140 }
1956} 2141}
1957 2142
1958/* 2143/*
1959 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in 2144 * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in
1960 * all it's inventory (recursively). 2145 * all it's inventory (recursively).
1961 * If checksums are used, a player will get set_cheat called for 2146 * If checksums are used, a player will get set_cheat called for
1962 * him/her-self and all object carried by a call to this function. 2147 * him/her-self and all object carried by a call to this function.
1963 */ 2148 */
1964 2149
2150void
1965void set_cheat(object *op) { 2151set_cheat (object *op)
2152{
1966 SET_FLAG(op, FLAG_WAS_WIZ); 2153 SET_FLAG (op, FLAG_WAS_WIZ);
1967 flag_inv(op, FLAG_WAS_WIZ); 2154 flag_inv (op, FLAG_WAS_WIZ);
1968} 2155}
1969 2156
1970/* 2157/*
1971 * find_free_spot(object, map, x, y, start, stop) will search for 2158 * find_free_spot(object, map, x, y, start, stop) will search for
1972 * a spot at the given map and coordinates which will be able to contain 2159 * a spot at the given map and coordinates which will be able to contain
… …
1987 * to know if the space in question will block the object. We can't use 2174 * to know if the space in question will block the object. We can't use
1988 * the archetype because that isn't correct if the monster has been 2175 * the archetype because that isn't correct if the monster has been
1989 * customized, changed states, etc. 2176 * customized, changed states, etc.
1990 */ 2177 */
1991 2178
2179int
1992int find_free_spot(const object *ob, mapstruct *m,int x,int y,int start,int stop) { 2180find_free_spot (const object *ob, mapstruct *m, int x, int y, int start, int stop)
2181{
2182 int
2183 i,
1993 int i,index=0, flag; 2184 index = 0, flag;
2185 static int
1994 static int altern[SIZEOFFREE]; 2186 altern[SIZEOFFREE];
1995 2187
1996 for(i=start;i<stop;i++) { 2188 for (i = start; i < stop; i++)
2189 {
1997 flag = ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i]); 2190 flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]);
1998 if(!flag) 2191 if (!flag)
1999 altern[index++]=i; 2192 altern[index++] = i;
2000 2193
2001 /* Basically, if we find a wall on a space, we cut down the search size. 2194 /* Basically, if we find a wall on a space, we cut down the search size.
2002 * In this way, we won't return spaces that are on another side of a wall. 2195 * In this way, we won't return spaces that are on another side of a wall.
2003 * This mostly work, but it cuts down the search size in all directions - 2196 * This mostly work, but it cuts down the search size in all directions -
2004 * if the space being examined only has a wall to the north and empty 2197 * if the space being examined only has a wall to the north and empty
2005 * spaces in all the other directions, this will reduce the search space 2198 * spaces in all the other directions, this will reduce the search space
2006 * to only the spaces immediately surrounding the target area, and 2199 * to only the spaces immediately surrounding the target area, and
2007 * won't look 2 spaces south of the target space. 2200 * won't look 2 spaces south of the target space.
2008 */ 2201 */
2009 else if ((flag & AB_NO_PASS) && maxfree[i]<stop) 2202 else if ((flag & AB_NO_PASS) && maxfree[i] < stop)
2010 stop=maxfree[i]; 2203 stop = maxfree[i];
2011 } 2204 }
2012 if(!index) return -1; 2205 if (!index)
2206 return -1;
2013 return altern[RANDOM()%index]; 2207 return altern[RANDOM () % index];
2014} 2208}
2015 2209
2016/* 2210/*
2017 * find_first_free_spot(archetype, mapstruct, x, y) works like 2211 * find_first_free_spot(archetype, mapstruct, x, y) works like
2018 * find_free_spot(), but it will search max number of squares. 2212 * find_free_spot(), but it will search max number of squares.
2019 * But it will return the first available spot, not a random choice. 2213 * But it will return the first available spot, not a random choice.
2020 * Changed 0.93.2: Have it return -1 if there is no free spot available. 2214 * Changed 0.93.2: Have it return -1 if there is no free spot available.
2021 */ 2215 */
2022 2216
2217int
2023int find_first_free_spot(const object *ob, mapstruct *m,int x,int y) { 2218find_first_free_spot (const object *ob, mapstruct *m, int x, int y)
2219{
2220 int
2024 int i; 2221 i;
2222
2025 for(i=0;i<SIZEOFFREE;i++) { 2223 for (i = 0; i < SIZEOFFREE; i++)
2224 {
2026 if(!ob_blocked(ob,m,x+freearr_x[i],y+freearr_y[i])) 2225 if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]))
2027 return i; 2226 return i;
2028 } 2227 }
2029 return -1; 2228 return -1;
2030} 2229}
2031 2230
2032/* 2231/*
2033 * The function permute(arr, begin, end) randomly reorders the array 2232 * The function permute(arr, begin, end) randomly reorders the array
2034 * arr[begin..end-1]. 2233 * arr[begin..end-1].
2035 */ 2234 */
2235static void
2036static void permute(int *arr, int begin, int end) 2236permute (int *arr, int begin, int end)
2037{ 2237{
2038 int i, j, tmp, len; 2238 int
2239 i,
2240 j,
2241 tmp,
2242 len;
2039 2243
2040 len = end-begin; 2244 len = end - begin;
2041 for(i = begin; i < end; i++) 2245 for (i = begin; i < end; i++)
2042 { 2246 {
2043 j = begin+RANDOM()%len; 2247 j = begin + RANDOM () % len;
2044 2248
2045 tmp = arr[i]; 2249 tmp = arr[i];
2046 arr[i] = arr[j]; 2250 arr[i] = arr[j];
2047 arr[j] = tmp; 2251 arr[j] = tmp;
2048 } 2252 }
2049} 2253}
2050 2254
2051/* new function to make monster searching more efficient, and effective! 2255/* new function to make monster searching more efficient, and effective!
2052 * This basically returns a randomized array (in the passed pointer) of 2256 * This basically returns a randomized array (in the passed pointer) of
2053 * the spaces to find monsters. In this way, it won't always look for 2257 * the spaces to find monsters. In this way, it won't always look for
2054 * monsters to the north first. However, the size of the array passed 2258 * monsters to the north first. However, the size of the array passed
2055 * covers all the spaces, so within that size, all the spaces within 2259 * covers all the spaces, so within that size, all the spaces within
2056 * the 3x3 area will be searched, just not in a predictable order. 2260 * the 3x3 area will be searched, just not in a predictable order.
2057 */ 2261 */
2262void
2058void get_search_arr(int *search_arr) 2263get_search_arr (int *search_arr)
2059{ 2264{
2265 int
2060 int i; 2266 i;
2061 2267
2062 for(i = 0; i < SIZEOFFREE; i++) 2268 for (i = 0; i < SIZEOFFREE; i++)
2063 { 2269 {
2064 search_arr[i] = i; 2270 search_arr[i] = i;
2065 } 2271 }
2066 2272
2067 permute(search_arr, 1, SIZEOFFREE1+1); 2273 permute (search_arr, 1, SIZEOFFREE1 + 1);
2068 permute(search_arr, SIZEOFFREE1+1, SIZEOFFREE2+1); 2274 permute (search_arr, SIZEOFFREE1 + 1, SIZEOFFREE2 + 1);
2069 permute(search_arr, SIZEOFFREE2+1, SIZEOFFREE); 2275 permute (search_arr, SIZEOFFREE2 + 1, SIZEOFFREE);
2070} 2276}
2071 2277
2072/* 2278/*
2073 * find_dir(map, x, y, exclude) will search some close squares in the 2279 * find_dir(map, x, y, exclude) will search some close squares in the
2074 * given map at the given coordinates for live objects. 2280 * given map at the given coordinates for live objects.
… …
2080 * is actually want is going to try and move there. We need this info 2286 * is actually want is going to try and move there. We need this info
2081 * because we have to know what movement the thing looking to move 2287 * because we have to know what movement the thing looking to move
2082 * there is capable of. 2288 * there is capable of.
2083 */ 2289 */
2084 2290
2291int
2085int find_dir(mapstruct *m, int x, int y, object *exclude) { 2292find_dir (mapstruct *m, int x, int y, object *exclude)
2293{
2294 int
2295 i,
2086 int i,max=SIZEOFFREE, mflags; 2296 max = SIZEOFFREE, mflags;
2297
2087 sint16 nx, ny; 2298 sint16 nx, ny;
2088 object *tmp; 2299 object *
2300 tmp;
2089 mapstruct *mp; 2301 mapstruct *
2302 mp;
2303
2090 MoveType blocked, move_type; 2304 MoveType blocked, move_type;
2091 2305
2092 if (exclude && exclude->head) { 2306 if (exclude && exclude->head)
2307 {
2093 exclude = exclude->head; 2308 exclude = exclude->head;
2094 move_type = exclude->move_type; 2309 move_type = exclude->move_type;
2095 } else { 2310 }
2311 else
2312 {
2096 /* If we don't have anything, presume it can use all movement types. */ 2313 /* If we don't have anything, presume it can use all movement types. */
2097 move_type=MOVE_ALL; 2314 move_type = MOVE_ALL;
2315 }
2316
2317 for (i = 1; i < max; i++)
2098 } 2318 {
2099
2100 for(i=1;i<max;i++) {
2101 mp = m; 2319 mp = m;
2102 nx = x + freearr_x[i]; 2320 nx = x + freearr_x[i];
2103 ny = y + freearr_y[i]; 2321 ny = y + freearr_y[i];
2104 2322
2105 mflags = get_map_flags(m, &mp, nx, ny, &nx, &ny); 2323 mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny);
2106 if (mflags & P_OUT_OF_MAP) { 2324 if (mflags & P_OUT_OF_MAP)
2325 {
2107 max = maxfree[i]; 2326 max = maxfree[i];
2327 }
2108 } else { 2328 else
2329 {
2109 blocked = GET_MAP_MOVE_BLOCK(mp, nx, ny); 2330 blocked = GET_MAP_MOVE_BLOCK (mp, nx, ny);
2110 2331
2111 if ((move_type & blocked) == move_type) { 2332 if ((move_type & blocked) == move_type)
2333 {
2112 max=maxfree[i]; 2334 max = maxfree[i];
2335 }
2113 } else if (mflags & P_IS_ALIVE) { 2336 else if (mflags & P_IS_ALIVE)
2337 {
2114 for (tmp=GET_MAP_OB(mp,nx,ny); tmp!= NULL; tmp=tmp->above) { 2338 for (tmp = GET_MAP_OB (mp, nx, ny); tmp != NULL; tmp = tmp->above)
2115 if ((QUERY_FLAG(tmp,FLAG_MONSTER) || tmp->type==PLAYER) && 2339 {
2116 (tmp != exclude ||(tmp->head && tmp->head != exclude))) { 2340 if ((QUERY_FLAG (tmp, FLAG_MONSTER) || tmp->type == PLAYER) && (tmp != exclude || (tmp->head && tmp->head != exclude)))
2341 {
2117 break; 2342 break;
2118 } 2343 }
2119 } 2344 }
2120 if(tmp) { 2345 if (tmp)
2346 {
2121 return freedir[i]; 2347 return freedir[i];
2122 } 2348 }
2123 } 2349 }
2124 } 2350 }
2125 } 2351 }
2126 return 0; 2352 return 0;
2127} 2353}
2128 2354
2129/* 2355/*
2130 * distance(object 1, object 2) will return the square of the 2356 * distance(object 1, object 2) will return the square of the
2131 * distance between the two given objects. 2357 * distance between the two given objects.
2132 */ 2358 */
2133 2359
2360int
2134int distance(const object *ob1, const object *ob2) { 2361distance (const object *ob1, const object *ob2)
2362{
2135 int i; 2363 int
2136 i= (ob1->x - ob2->x)*(ob1->x - ob2->x)+ 2364 i;
2137 (ob1->y - ob2->y)*(ob1->y - ob2->y); 2365
2366 i = (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y);
2138 return i; 2367 return i;
2139} 2368}
2140 2369
2141/* 2370/*
2142 * find_dir_2(delta-x,delta-y) will return a direction in which 2371 * find_dir_2(delta-x,delta-y) will return a direction in which
2143 * an object which has subtracted the x and y coordinates of another 2372 * an object which has subtracted the x and y coordinates of another
2144 * object, needs to travel toward it. 2373 * object, needs to travel toward it.
2145 */ 2374 */
2146 2375
2376int
2147int find_dir_2(int x, int y) { 2377find_dir_2 (int x, int y)
2378{
2148 int q; 2379 int
2380 q;
2149 2381
2150 if(y) 2382 if (y)
2151 q=x*100/y; 2383 q = x * 100 / y;
2152 else if (x) 2384 else if (x)
2153 q= -300*x; 2385 q = -300 * x;
2154 else 2386 else
2155 return 0; 2387 return 0;
2156 2388
2157 if(y>0) { 2389 if (y > 0)
2390 {
2158 if(q < -242) 2391 if (q < -242)
2159 return 3 ; 2392 return 3;
2160 if (q < -41) 2393 if (q < -41)
2161 return 2 ; 2394 return 2;
2162 if (q < 41) 2395 if (q < 41)
2163 return 1 ; 2396 return 1;
2164 if (q < 242) 2397 if (q < 242)
2165 return 8 ; 2398 return 8;
2166 return 7 ; 2399 return 7;
2167 } 2400 }
2168 2401
2169 if (q < -242) 2402 if (q < -242)
2170 return 7 ; 2403 return 7;
2171 if (q < -41) 2404 if (q < -41)
2172 return 6 ; 2405 return 6;
2173 if (q < 41) 2406 if (q < 41)
2174 return 5 ; 2407 return 5;
2175 if (q < 242) 2408 if (q < 242)
2176 return 4 ; 2409 return 4;
2177 2410
2178 return 3 ; 2411 return 3;
2179} 2412}
2180 2413
2181/* 2414/*
2182 * absdir(int): Returns a number between 1 and 8, which represent 2415 * absdir(int): Returns a number between 1 and 8, which represent
2183 * the "absolute" direction of a number (it actually takes care of 2416 * the "absolute" direction of a number (it actually takes care of
2184 * "overflow" in previous calculations of a direction). 2417 * "overflow" in previous calculations of a direction).
2185 */ 2418 */
2186 2419
2420int
2187int absdir(int d) { 2421absdir (int d)
2188 while(d<1) d+=8; 2422{
2189 while(d>8) d-=8; 2423 while (d < 1)
2424 d += 8;
2425 while (d > 8)
2426 d -= 8;
2190 return d; 2427 return d;
2191} 2428}
2192 2429
2193/* 2430/*
2194 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is 2431 * dirdiff(dir1, dir2) returns how many 45-degrees differences there is
2195 * between two directions (which are expected to be absolute (see absdir()) 2432 * between two directions (which are expected to be absolute (see absdir())
2196 */ 2433 */
2197 2434
2435int
2198int dirdiff(int dir1, int dir2) { 2436dirdiff (int dir1, int dir2)
2437{
2199 int d; 2438 int
2439 d;
2440
2200 d = abs(dir1 - dir2); 2441 d = abs (dir1 - dir2);
2201 if(d>4) 2442 if (d > 4)
2202 d = 8 - d; 2443 d = 8 - d;
2203 return d; 2444 return d;
2204} 2445}
2205 2446
2206/* peterm: 2447/* peterm:
… …
2211 * direction 4, 14, or 16 to get back to where we are. 2452 * direction 4, 14, or 16 to get back to where we are.
2212 * Moved from spell_util.c to object.c with the other related direction 2453 * Moved from spell_util.c to object.c with the other related direction
2213 * functions. 2454 * functions.
2214 */ 2455 */
2215 2456
2457int
2216int reduction_dir[SIZEOFFREE][3] = { 2458 reduction_dir[SIZEOFFREE][3] = {
2217 {0,0,0}, /* 0 */ 2459 {0, 0, 0}, /* 0 */
2218 {0,0,0}, /* 1 */ 2460 {0, 0, 0}, /* 1 */
2219 {0,0,0}, /* 2 */ 2461 {0, 0, 0}, /* 2 */
2220 {0,0,0}, /* 3 */ 2462 {0, 0, 0}, /* 3 */
2221 {0,0,0}, /* 4 */ 2463 {0, 0, 0}, /* 4 */
2222 {0,0,0}, /* 5 */ 2464 {0, 0, 0}, /* 5 */
2223 {0,0,0}, /* 6 */ 2465 {0, 0, 0}, /* 6 */
2224 {0,0,0}, /* 7 */ 2466 {0, 0, 0}, /* 7 */
2225 {0,0,0}, /* 8 */ 2467 {0, 0, 0}, /* 8 */
2226 {8,1,2}, /* 9 */ 2468 {8, 1, 2}, /* 9 */
2227 {1,2,-1}, /* 10 */ 2469 {1, 2, -1}, /* 10 */
2228 {2,10,12}, /* 11 */ 2470 {2, 10, 12}, /* 11 */
2229 {2,3,-1}, /* 12 */ 2471 {2, 3, -1}, /* 12 */
2230 {2,3,4}, /* 13 */ 2472 {2, 3, 4}, /* 13 */
2231 {3,4,-1}, /* 14 */ 2473 {3, 4, -1}, /* 14 */
2232 {4,14,16}, /* 15 */ 2474 {4, 14, 16}, /* 15 */
2233 {5,4,-1}, /* 16 */ 2475 {5, 4, -1}, /* 16 */
2234 {4,5,6}, /* 17 */ 2476 {4, 5, 6}, /* 17 */
2235 {6,5,-1}, /* 18 */ 2477 {6, 5, -1}, /* 18 */
2236 {6,20,18}, /* 19 */ 2478 {6, 20, 18}, /* 19 */
2237 {7,6,-1}, /* 20 */ 2479 {7, 6, -1}, /* 20 */
2238 {6,7,8}, /* 21 */ 2480 {6, 7, 8}, /* 21 */
2239 {7,8,-1}, /* 22 */ 2481 {7, 8, -1}, /* 22 */
2240 {8,22,24}, /* 23 */ 2482 {8, 22, 24}, /* 23 */
2241 {8,1,-1}, /* 24 */ 2483 {8, 1, -1}, /* 24 */
2242 {24,9,10}, /* 25 */ 2484 {24, 9, 10}, /* 25 */
2243 {9,10,-1}, /* 26 */ 2485 {9, 10, -1}, /* 26 */
2244 {10,11,-1}, /* 27 */ 2486 {10, 11, -1}, /* 27 */
2245 {27,11,29}, /* 28 */ 2487 {27, 11, 29}, /* 28 */
2246 {11,12,-1}, /* 29 */ 2488 {11, 12, -1}, /* 29 */
2247 {12,13,-1}, /* 30 */ 2489 {12, 13, -1}, /* 30 */
2248 {12,13,14}, /* 31 */ 2490 {12, 13, 14}, /* 31 */
2249 {13,14,-1}, /* 32 */ 2491 {13, 14, -1}, /* 32 */
2250 {14,15,-1}, /* 33 */ 2492 {14, 15, -1}, /* 33 */
2251 {33,15,35}, /* 34 */ 2493 {33, 15, 35}, /* 34 */
2252 {16,15,-1}, /* 35 */ 2494 {16, 15, -1}, /* 35 */
2253 {17,16,-1}, /* 36 */ 2495 {17, 16, -1}, /* 36 */
2254 {18,17,16}, /* 37 */ 2496 {18, 17, 16}, /* 37 */
2255 {18,17,-1}, /* 38 */ 2497 {18, 17, -1}, /* 38 */
2256 {18,19,-1}, /* 39 */ 2498 {18, 19, -1}, /* 39 */
2257 {41,19,39}, /* 40 */ 2499 {41, 19, 39}, /* 40 */
2258 {19,20,-1}, /* 41 */ 2500 {19, 20, -1}, /* 41 */
2259 {20,21,-1}, /* 42 */ 2501 {20, 21, -1}, /* 42 */
2260 {20,21,22}, /* 43 */ 2502 {20, 21, 22}, /* 43 */
2261 {21,22,-1}, /* 44 */ 2503 {21, 22, -1}, /* 44 */
2262 {23,22,-1}, /* 45 */ 2504 {23, 22, -1}, /* 45 */
2263 {45,47,23}, /* 46 */ 2505 {45, 47, 23}, /* 46 */
2264 {23,24,-1}, /* 47 */ 2506 {23, 24, -1}, /* 47 */
2265 {24,9,-1}}; /* 48 */ 2507 {24, 9, -1}
2508}; /* 48 */
2266 2509
2267/* Recursive routine to step back and see if we can 2510/* Recursive routine to step back and see if we can
2268 * find a path to that monster that we found. If not, 2511 * find a path to that monster that we found. If not,
2269 * we don't bother going toward it. Returns 1 if we 2512 * we don't bother going toward it. Returns 1 if we
2270 * can see a direct way to get it 2513 * can see a direct way to get it
2271 * Modified to be map tile aware -.MSW 2514 * Modified to be map tile aware -.MSW
2272 */ 2515 */
2273
2274 2516
2517
2518int
2275int can_see_monsterP(mapstruct *m, int x, int y,int dir) { 2519can_see_monsterP (mapstruct *m, int x, int y, int dir)
2520{
2276 sint16 dx, dy; 2521 sint16 dx, dy;
2522 int
2277 int mflags; 2523 mflags;
2278 2524
2525 if (dir < 0)
2279 if(dir<0) return 0; /* exit condition: invalid direction */ 2526 return 0; /* exit condition: invalid direction */
2280 2527
2281 dx = x + freearr_x[dir]; 2528 dx = x + freearr_x[dir];
2282 dy = y + freearr_y[dir]; 2529 dy = y + freearr_y[dir];
2283 2530
2284 mflags = get_map_flags(m, &m, dx, dy, &dx, &dy); 2531 mflags = get_map_flags (m, &m, dx, dy, &dx, &dy);
2285 2532
2286 /* This functional arguably was incorrect before - it was 2533 /* This functional arguably was incorrect before - it was
2287 * checking for P_WALL - that was basically seeing if 2534 * checking for P_WALL - that was basically seeing if
2288 * we could move to the monster - this is being more 2535 * we could move to the monster - this is being more
2289 * literal on if we can see it. To know if we can actually 2536 * literal on if we can see it. To know if we can actually
2290 * move to the monster, we'd need the monster passed in or 2537 * move to the monster, we'd need the monster passed in or
2291 * at least its move type. 2538 * at least its move type.
2292 */ 2539 */
2293 if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW)) return 0; 2540 if (mflags & (P_OUT_OF_MAP | P_BLOCKSVIEW))
2541 return 0;
2294 2542
2295 /* yes, can see. */ 2543 /* yes, can see. */
2296 if(dir < 9) return 1; 2544 if (dir < 9)
2545 return 1;
2297 return can_see_monsterP(m, x, y, reduction_dir[dir][0]) | 2546 return can_see_monsterP (m, x, y, reduction_dir[dir][0]) |
2298 can_see_monsterP(m,x,y, reduction_dir[dir][1]) | 2547 can_see_monsterP (m, x, y, reduction_dir[dir][1]) | can_see_monsterP (m, x, y, reduction_dir[dir][2]);
2299 can_see_monsterP(m,x,y, reduction_dir[dir][2]);
2300} 2548}
2301 2549
2302 2550
2303 2551
2304/* 2552/*
2305 * can_pick(picker, item): finds out if an object is possible to be 2553 * can_pick(picker, item): finds out if an object is possible to be
2306 * picked up by the picker. Returnes 1 if it can be 2554 * picked up by the picker. Returnes 1 if it can be
2307 * picked up, otherwise 0. 2555 * picked up, otherwise 0.
2308 * 2556 *
… …
2310 * core dumps if they do. 2558 * core dumps if they do.
2311 * 2559 *
2312 * Add a check so we can't pick up invisible objects (0.93.8) 2560 * Add a check so we can't pick up invisible objects (0.93.8)
2313 */ 2561 */
2314 2562
2563int
2315int can_pick(const object *who, const object *item) { 2564can_pick (const object *who, const object *item)
2565{
2316 return /*QUERY_FLAG(who,FLAG_WIZ)||*/ 2566 return /*QUERY_FLAG(who,FLAG_WIZ)|| */
2317 (item->weight>0&&!QUERY_FLAG(item,FLAG_NO_PICK)&& 2567 (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) &&
2318 !QUERY_FLAG(item,FLAG_ALIVE)&&!item->invisible && 2568 !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3));
2319 (who->type==PLAYER||item->weight<who->weight/3));
2320} 2569}
2321 2570
2322 2571
2323/* 2572/*
2324 * create clone from object to another 2573 * create clone from object to another
2325 */ 2574 */
2575object *
2326object *object_create_clone (object *asrc) { 2576object_create_clone (object *asrc)
2577{
2578 object *
2327 object *dst = NULL,*tmp,*src,*part,*prev, *item; 2579 dst = NULL, *tmp, *src, *part, *prev, *item;
2328 2580
2581 if (!asrc)
2329 if(!asrc) return NULL; 2582 return NULL;
2330 src = asrc; 2583 src = asrc;
2331 if(src->head) 2584 if (src->head)
2332 src = src->head; 2585 src = src->head;
2333 2586
2334 prev = NULL; 2587 prev = NULL;
2335 for(part = src; part; part = part->more) { 2588 for (part = src; part; part = part->more)
2589 {
2336 tmp = get_object(); 2590 tmp = get_object ();
2337 copy_object(part,tmp); 2591 copy_object (part, tmp);
2338 tmp->x -= src->x; 2592 tmp->x -= src->x;
2339 tmp->y -= src->y; 2593 tmp->y -= src->y;
2340 if(!part->head) { 2594 if (!part->head)
2595 {
2341 dst = tmp; 2596 dst = tmp;
2342 tmp->head = NULL; 2597 tmp->head = NULL;
2598 }
2343 } else { 2599 else
2600 {
2344 tmp->head = dst; 2601 tmp->head = dst;
2345 } 2602 }
2346 tmp->more = NULL; 2603 tmp->more = NULL;
2347 if(prev) 2604 if (prev)
2348 prev->more = tmp; 2605 prev->more = tmp;
2349 prev = tmp; 2606 prev = tmp;
2350 } 2607 }
2608
2351 /*** copy inventory ***/ 2609 /*** copy inventory ***/
2352 for(item = src->inv; item; item = item->below) { 2610 for (item = src->inv; item; item = item->below)
2611 {
2353 (void) insert_ob_in_ob(object_create_clone(item),dst); 2612 (void) insert_ob_in_ob (object_create_clone (item), dst);
2354 } 2613 }
2355 2614
2356 return dst; 2615 return dst;
2357} 2616}
2358 2617
2359/* return true if the object was destroyed, 0 otherwise */ 2618/* return true if the object was destroyed, 0 otherwise */
2619int
2360int was_destroyed (const object *op, tag_t old_tag) 2620was_destroyed (const object *op, tag_t old_tag)
2361{ 2621{
2362 /* checking for FLAG_FREED isn't necessary, but makes this function more 2622 /* checking for FLAG_FREED isn't necessary, but makes this function more
2363 * robust */ 2623 * robust */
2364 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED); 2624 return op->count != old_tag || QUERY_FLAG (op, FLAG_FREED);
2365} 2625}
2366 2626
2367/* GROS - Creates an object using a string representing its content. */ 2627/* GROS - Creates an object using a string representing its content. */
2628
2368/* Basically, we save the content of the string to a temp file, then call */ 2629/* Basically, we save the content of the string to a temp file, then call */
2630
2369/* load_object on it. I admit it is a highly inefficient way to make things, */ 2631/* load_object on it. I admit it is a highly inefficient way to make things, */
2632
2370/* but it was simple to make and allows reusing the load_object function. */ 2633/* but it was simple to make and allows reusing the load_object function. */
2634
2371/* Remember not to use load_object_str in a time-critical situation. */ 2635/* Remember not to use load_object_str in a time-critical situation. */
2636
2372/* Also remember that multiparts objects are not supported for now. */ 2637/* Also remember that multiparts objects are not supported for now. */
2373 2638
2639object *
2374object* load_object_str(const char *obstr) 2640load_object_str (const char *obstr)
2375{ 2641{
2376 object *op; 2642 object *
2643 op;
2644 char
2377 char filename[MAX_BUF]; 2645 filename[MAX_BUF];
2646
2378 sprintf(filename,"%s/cfloadobstr2044",settings.tmpdir); 2647 sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir);
2379 2648
2649 FILE *
2380 FILE *tempfile=fopen(filename,"w"); 2650 tempfile = fopen (filename, "w");
2651
2381 if (tempfile == NULL) 2652 if (tempfile == NULL)
2382 { 2653 {
2383 LOG(llevError,"Error - Unable to access load object temp file\n"); 2654 LOG (llevError, "Error - Unable to access load object temp file\n");
2384 return NULL; 2655 return NULL;
2385 }; 2656 };
2386 fprintf(tempfile,obstr); 2657 fprintf (tempfile, obstr);
2387 fclose(tempfile); 2658 fclose (tempfile);
2388 2659
2389 op=get_object(); 2660 op = get_object ();
2390 2661
2391 object_thawer thawer (filename); 2662 object_thawer thawer (filename);
2392 2663
2393 if (thawer) 2664 if (thawer)
2394 load_object(thawer,op,0); 2665 load_object (thawer, op, 0);
2395 2666
2396 LOG(llevDebug," load str completed, object=%s\n", &op->name); 2667 LOG (llevDebug, " load str completed, object=%s\n", &op->name);
2397 CLEAR_FLAG(op,FLAG_REMOVED); 2668 CLEAR_FLAG (op, FLAG_REMOVED);
2398 2669
2399 return op; 2670 return op;
2400} 2671}
2401 2672
2402/* This returns the first object in who's inventory that 2673/* This returns the first object in who's inventory that
2403 * has the same type and subtype match. 2674 * has the same type and subtype match.
2404 * returns NULL if no match. 2675 * returns NULL if no match.
2405 */ 2676 */
2677object *
2406object *find_obj_by_type_subtype(const object *who, int type, int subtype) 2678find_obj_by_type_subtype (const object *who, int type, int subtype)
2407{ 2679{
2408 object *tmp; 2680 object *
2681 tmp;
2409 2682
2410 for (tmp=who->inv; tmp; tmp=tmp->below) 2683 for (tmp = who->inv; tmp; tmp = tmp->below)
2411 if (tmp->type == type && tmp->subtype == subtype) return tmp; 2684 if (tmp->type == type && tmp->subtype == subtype)
2685 return tmp;
2412 2686
2413 return NULL; 2687 return NULL;
2414} 2688}
2415 2689
2416/* If ob has a field named key, return the link from the list, 2690/* If ob has a field named key, return the link from the list,
2417 * otherwise return NULL. 2691 * otherwise return NULL.
2418 * 2692 *
2419 * key must be a passed in shared string - otherwise, this won't 2693 * key must be a passed in shared string - otherwise, this won't
2420 * do the desired thing. 2694 * do the desired thing.
2421 */ 2695 */
2696key_value *
2422key_value * get_ob_key_link(const object * ob, const char * key) { 2697get_ob_key_link (const object *ob, const char *key)
2698{
2423 key_value * link; 2699 key_value *
2424 2700 link;
2701
2425 for (link = ob->key_values; link != NULL; link = link->next) { 2702 for (link = ob->key_values; link != NULL; link = link->next)
2703 {
2426 if (link->key == key) { 2704 if (link->key == key)
2705 {
2427 return link; 2706 return link;
2428 } 2707 }
2429 }
2430 2708 }
2709
2431 return NULL; 2710 return NULL;
2432} 2711}
2433 2712
2434/* 2713/*
2435 * Returns the value of op has an extra_field for key, or NULL. 2714 * Returns the value of op has an extra_field for key, or NULL.
2436 * 2715 *
2437 * The argument doesn't need to be a shared string. 2716 * The argument doesn't need to be a shared string.
2438 * 2717 *
2439 * The returned string is shared. 2718 * The returned string is shared.
2440 */ 2719 */
2720const char *
2441const char * get_ob_key_value(const object * op, const char * const key) { 2721get_ob_key_value (const object *op, const char *const key)
2722{
2442 key_value * link; 2723 key_value *
2443 const char * canonical_key; 2724 link;
2444 2725 const char *
2726 canonical_key;
2727
2445 canonical_key = shstr::find (key); 2728 canonical_key = shstr::find (key);
2446 2729
2447 if (canonical_key == NULL) { 2730 if (canonical_key == NULL)
2731 {
2448 /* 1. There being a field named key on any object 2732 /* 1. There being a field named key on any object
2449 * implies there'd be a shared string to find. 2733 * implies there'd be a shared string to find.
2450 * 2. Since there isn't, no object has this field. 2734 * 2. Since there isn't, no object has this field.
2451 * 3. Therefore, *this* object doesn't have this field. 2735 * 3. Therefore, *this* object doesn't have this field.
2452 */ 2736 */
2453 return NULL; 2737 return NULL;
2454 } 2738 }
2455 2739
2456 /* This is copied from get_ob_key_link() above - 2740 /* This is copied from get_ob_key_link() above -
2457 * only 4 lines, and saves the function call overhead. 2741 * only 4 lines, and saves the function call overhead.
2458 */ 2742 */
2459 for (link = op->key_values; link != NULL; link = link->next) { 2743 for (link = op->key_values; link != NULL; link = link->next)
2744 {
2460 if (link->key == canonical_key) { 2745 if (link->key == canonical_key)
2746 {
2461 return link->value; 2747 return link->value;
2462 } 2748 }
2463 } 2749 }
2464 return NULL; 2750 return NULL;
2465} 2751}
2466 2752
2467 2753
2468/* 2754/*
2469 * Updates the canonical_key in op to value. 2755 * Updates the canonical_key in op to value.
… …
2473 * Unless add_key is TRUE, it won't add fields, only change the value of existing 2759 * Unless add_key is TRUE, it won't add fields, only change the value of existing
2474 * keys. 2760 * keys.
2475 * 2761 *
2476 * Returns TRUE on success. 2762 * Returns TRUE on success.
2477 */ 2763 */
2764int
2478int set_ob_key_value_s(object * op, const shstr &canonical_key, const char * value, int add_key) { 2765set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key)
2766{
2767 key_value *
2479 key_value * field = NULL, *last=NULL; 2768 field = NULL, *last = NULL;
2480 2769
2481 for (field=op->key_values; field != NULL; field=field->next) { 2770 for (field = op->key_values; field != NULL; field = field->next)
2771 {
2482 if (field->key != canonical_key) { 2772 if (field->key != canonical_key)
2773 {
2483 last = field; 2774 last = field;
2484 continue; 2775 continue;
2485 } 2776 }
2486 2777
2487 if (value) 2778 if (value)
2488 field->value = value; 2779 field->value = value;
2489 else { 2780 else
2781 {
2490 /* Basically, if the archetype has this key set, 2782 /* Basically, if the archetype has this key set,
2491 * we need to store the null value so when we save 2783 * we need to store the null value so when we save
2492 * it, we save the empty value so that when we load, 2784 * it, we save the empty value so that when we load,
2493 * we get this value back again. 2785 * we get this value back again.
2494 */ 2786 */
2495 if (get_ob_key_link (&op->arch->clone, canonical_key)) 2787 if (get_ob_key_link (&op->arch->clone, canonical_key))
2496 field->value = 0; 2788 field->value = 0;
2789 else
2790 {
2791 if (last)
2792 last->next = field->next;
2497 else 2793 else
2498 {
2499 if (last) last->next = field->next;
2500 else op->key_values = field->next; 2794 op->key_values = field->next;
2501 2795
2502 delete field; 2796 delete field;
2503 } 2797 }
2504 } 2798 }
2505 return TRUE; 2799 return TRUE;
2506 } 2800 }
2507 /* IF we get here, key doesn't exist */ 2801 /* IF we get here, key doesn't exist */
2508 2802
2509 /* No field, we'll have to add it. */ 2803 /* No field, we'll have to add it. */
2804
2805 if (!add_key)
2510 2806 {
2511 if (!add_key) {
2512 return FALSE; 2807 return FALSE;
2513 } 2808 }
2514 /* There isn't any good reason to store a null 2809 /* There isn't any good reason to store a null
2515 * value in the key/value list. If the archetype has 2810 * value in the key/value list. If the archetype has
2516 * this key, then we should also have it, so shouldn't 2811 * this key, then we should also have it, so shouldn't
2517 * be here. If user wants to store empty strings, 2812 * be here. If user wants to store empty strings,
2518 * should pass in "" 2813 * should pass in ""
2519 */ 2814 */
2520 if (value == NULL) return TRUE; 2815 if (value == NULL)
2521
2522 field = new key_value;
2523
2524 field->key = canonical_key;
2525 field->value = value;
2526 /* Usual prepend-addition. */
2527 field->next = op->key_values;
2528 op->key_values = field;
2529
2530 return TRUE; 2816 return TRUE;
2817
2818 field = new key_value;
2819
2820 field->key = canonical_key;
2821 field->value = value;
2822 /* Usual prepend-addition. */
2823 field->next = op->key_values;
2824 op->key_values = field;
2825
2826 return TRUE;
2531} 2827}
2532 2828
2533/* 2829/*
2534 * Updates the key in op to value. 2830 * Updates the key in op to value.
2535 * 2831 *
… …
2537 * and not add new ones. 2833 * and not add new ones.
2538 * In general, should be little reason FALSE is ever passed in for add_key 2834 * In general, should be little reason FALSE is ever passed in for add_key
2539 * 2835 *
2540 * Returns TRUE on success. 2836 * Returns TRUE on success.
2541 */ 2837 */
2838int
2542int set_ob_key_value(object * op, const char *key, const char * value, int add_key) 2839set_ob_key_value (object *op, const char *key, const char *value, int add_key)
2543{ 2840{
2544 shstr key_ (key); 2841 shstr key_ (key);
2842
2545 return set_ob_key_value_s (op, key_, value, add_key); 2843 return set_ob_key_value_s (op, key_, value, add_key);
2546} 2844}

Diff Legend

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