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.38 by root, Wed Sep 13 01:09:24 2006 UTC vs.
Revision 1.161 by root, Wed Jun 13 21:09:39 2007 UTC

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

Diff Legend

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