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

Comparing deliantra/server/common/object.C (file contents):
Revision 1.19 by root, Fri Sep 8 17:14:07 2006 UTC vs.
Revision 1.24 by root, Sun Sep 10 16:00:23 2006 UTC

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

Diff Legend

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