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.22 by root, Sun Sep 10 00:51:23 2006 UTC vs.
Revision 1.37 by root, Tue Sep 12 20:55:40 2006 UTC

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

Diff Legend

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