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