1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * the terms of the Affero GNU General Public License as published by the |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
11 | * option) any later version. |
… | |
… | |
26 | #include <stdio.h> |
26 | #include <stdio.h> |
27 | #include <sys/types.h> |
27 | #include <sys/types.h> |
28 | #include <sys/uio.h> |
28 | #include <sys/uio.h> |
29 | #include <object.h> |
29 | #include <object.h> |
30 | #include <sproto.h> |
30 | #include <sproto.h> |
31 | #include <loader.h> |
|
|
32 | |
31 | |
33 | #include <bitset> |
32 | #include <bitset> |
34 | |
33 | |
35 | UUID UUID::cur; |
34 | UUID UUID::cur; |
36 | static uint64_t seq_next_save; |
35 | static uint64_t seq_next_save; |
37 | static const uint64 UUID_GAP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
38 | uint32_t mapspace::smellcount = 10000; |
37 | uint32_t mapspace::smellcount = 10000; |
39 | |
38 | |
40 | objectvec objects; |
39 | objectvec objects; |
41 | activevec actives; |
40 | activevec actives; |
|
|
41 | |
|
|
42 | freelist_item *object::freelist; |
|
|
43 | uint32_t object::object_count; |
|
|
44 | uint32_t object::free_count; |
|
|
45 | uint32_t object::create_count; |
|
|
46 | uint32_t object::destroy_count; |
42 | |
47 | |
43 | //+GPL |
48 | //+GPL |
44 | |
49 | |
45 | short freearr_x[SIZEOFFREE] = { |
50 | short freearr_x[SIZEOFFREE] = { |
46 | 0, |
51 | 0, |
… | |
… | |
66 | 9, 10, 13, 14, 17, 18, 21, 22, |
71 | 9, 10, 13, 14, 17, 18, 21, 22, |
67 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
72 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
68 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
73 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
69 | }; |
74 | }; |
70 | |
75 | |
|
|
76 | const char *wall_suffix[16] = { |
|
|
77 | "0", |
|
|
78 | "1_3", |
|
|
79 | "1_4", |
|
|
80 | "2_1_2", |
|
|
81 | "1_2", |
|
|
82 | "2_2_4", |
|
|
83 | "2_2_1", |
|
|
84 | "3_1", |
|
|
85 | "1_1", |
|
|
86 | "2_2_3", |
|
|
87 | "2_2_2", |
|
|
88 | "3_3", |
|
|
89 | "2_1_1", |
|
|
90 | "3_4", |
|
|
91 | "3_2", |
|
|
92 | "4" |
|
|
93 | }; |
|
|
94 | |
71 | static void |
95 | static void |
72 | write_uuid (uval64 skip, bool sync) |
96 | write_uuid (uval64 skip, bool sync) |
73 | { |
97 | { |
74 | CALL_BEGIN (2); |
98 | CALL_BEGIN (2); |
75 | CALL_ARG_SV (newSVval64 (skip)); |
99 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
77 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
101 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
78 | CALL_END; |
102 | CALL_END; |
79 | } |
103 | } |
80 | |
104 | |
81 | static void |
105 | static void |
82 | read_uuid (void) |
106 | read_uuid () |
83 | { |
107 | { |
84 | char filename[MAX_BUF]; |
108 | char filename[MAX_BUF]; |
85 | |
109 | |
86 | sprintf (filename, "%s/uuid", settings.localdir); |
110 | sprintf (filename, "%s/uuid", settings.localdir); |
87 | |
111 | |
… | |
… | |
101 | |
125 | |
102 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
126 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
103 | _exit (1); |
127 | _exit (1); |
104 | } |
128 | } |
105 | |
129 | |
106 | UUID::BUF buf; |
130 | char buf [UUID::MAX_LEN]; |
107 | buf[0] = 0; |
131 | buf[0] = 0; |
108 | fgets (buf, sizeof (buf), fp); |
132 | fgets (buf, sizeof (buf), fp); |
109 | |
133 | |
110 | if (!UUID::cur.parse (buf)) |
134 | if (!UUID::cur.parse (buf)) |
111 | { |
135 | { |
… | |
… | |
138 | |
162 | |
139 | void |
163 | void |
140 | UUID::init () |
164 | UUID::init () |
141 | { |
165 | { |
142 | read_uuid (); |
166 | read_uuid (); |
|
|
167 | } |
|
|
168 | |
|
|
169 | bool |
|
|
170 | UUID::parse (const char *s) |
|
|
171 | { |
|
|
172 | if (*s++ != '<' || *s++ != '1' || *s++ != '.') |
|
|
173 | return false; |
|
|
174 | |
|
|
175 | seq = 0; |
|
|
176 | |
|
|
177 | while (*s != '>') |
|
|
178 | { |
|
|
179 | if (*s < '0') |
|
|
180 | return false; |
|
|
181 | |
|
|
182 | // this gives nice branchless code with gcc |
|
|
183 | assert ('0' < 'a' && '0' == 48 && 'a' == 97); |
|
|
184 | int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15; |
|
|
185 | |
|
|
186 | seq = (seq << 4) | digit; |
|
|
187 | |
|
|
188 | ++s; |
|
|
189 | } |
|
|
190 | |
|
|
191 | return true; |
|
|
192 | } |
|
|
193 | |
|
|
194 | char * |
|
|
195 | UUID::append (char *buf) const |
|
|
196 | { |
|
|
197 | *buf++ = '<'; |
|
|
198 | *buf++ = '1'; |
|
|
199 | *buf++ = '.'; |
|
|
200 | |
|
|
201 | uint64_t seq = this->seq; |
|
|
202 | const int bits = 64; |
|
|
203 | char nz = 0; |
|
|
204 | static const char tohex [] = "0123456789abcdef"; |
|
|
205 | |
|
|
206 | // assert (len >= 3 + bits / 4 + 1 + 1); |
|
|
207 | for (int i = bits / 4; --i; ) |
|
|
208 | { |
|
|
209 | uint8_t digit = seq >> (bits - 4); |
|
|
210 | |
|
|
211 | *buf = tohex [digit]; |
|
|
212 | nz |= digit; |
|
|
213 | buf += nz ? 1 : 0; |
|
|
214 | seq <<= 4; |
|
|
215 | } |
|
|
216 | |
|
|
217 | // last digit is special - always emit |
|
|
218 | uint8_t digit = seq >> (bits - 4); |
|
|
219 | *buf++ = tohex [digit]; |
|
|
220 | |
|
|
221 | *buf++ = '>'; |
|
|
222 | |
|
|
223 | return buf; |
|
|
224 | } |
|
|
225 | |
|
|
226 | char * |
|
|
227 | UUID::c_str () const |
|
|
228 | { |
|
|
229 | static char buf [MAX_LEN]; |
|
|
230 | *append (buf) = 0; |
|
|
231 | return buf; |
143 | } |
232 | } |
144 | |
233 | |
145 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
234 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
146 | static bool |
235 | static bool |
147 | compare_ob_value_lists_one (const object *wants, const object *has) |
236 | compare_ob_value_lists_one (const object *wants, const object *has) |
148 | { |
237 | { |
149 | /* n-squared behaviour (see kv_get), but I'm hoping both |
238 | /* n-squared behaviour (see kv.get), but I'm hoping both |
150 | * objects with lists are rare, and lists stay short. If not, use a |
239 | * objects with lists are rare, and lists stay short. If not, use a |
151 | * different structure or at least keep the lists sorted... |
240 | * different structure or at least keep the lists sorted... |
152 | */ |
241 | */ |
153 | |
242 | |
154 | /* For each field in wants, */ |
243 | /* For each field in wants, */ |
155 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
244 | for (key_value *kv = wants->kv.first; kv; kv = kv->next) |
156 | if (has->kv_get (kv->key) != kv->value) |
245 | if (has->kv.get (kv->key) != kv->value) |
157 | return false; |
246 | return false; |
158 | |
247 | |
159 | /* If we get here, every field in wants has a matching field in has. */ |
248 | /* If we get here, every field in wants has a matching field in has. */ |
160 | return true; |
249 | return true; |
161 | } |
250 | } |
… | |
… | |
183 | * Improvements made with merge: Better checking on potion, and also |
272 | * Improvements made with merge: Better checking on potion, and also |
184 | * check weight |
273 | * check weight |
185 | */ |
274 | */ |
186 | bool object::can_merge_slow (object *ob1, object *ob2) |
275 | bool object::can_merge_slow (object *ob1, object *ob2) |
187 | { |
276 | { |
188 | /* A couple quicksanity checks */ |
277 | /* A couple quick sanity checks */ |
189 | if (ob1 == ob2 |
278 | if (ob1 == ob2 |
190 | || ob1->type != ob2->type |
279 | || ob1->type != ob2->type |
191 | || ob1->speed != ob2->speed |
|
|
192 | || ob1->value != ob2->value |
280 | || ob1->value != ob2->value |
193 | || ob1->name != ob2->name) |
281 | || ob1->name != ob2->name |
|
|
282 | || ob1->custom_name != ob2->custom_name |
|
|
283 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
194 | return 0; |
284 | return 0; |
195 | |
285 | |
196 | /* Do not merge objects if nrof would overflow, assume nrof |
286 | /* Do not merge objects if nrof would overflow, assume nrof |
197 | * is always 0 .. 2**31-1 */ |
287 | * is always 0 .. 2**31-1 */ |
198 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
288 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
… | |
… | |
202 | * This is to the comparison of the flags below will be OK. We |
292 | * This is to the comparison of the flags below will be OK. We |
203 | * just can't ignore the been applied or identified flags, as they |
293 | * just can't ignore the been applied or identified flags, as they |
204 | * are not equal - just if it has been identified, the been_applied |
294 | * are not equal - just if it has been identified, the been_applied |
205 | * flags lose any meaning. |
295 | * flags lose any meaning. |
206 | */ |
296 | */ |
207 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
297 | if (ob1->flag [FLAG_IDENTIFIED]) |
208 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
298 | ob1->set_flag (FLAG_BEEN_APPLIED); |
209 | |
299 | |
210 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
300 | if (ob2->flag [FLAG_IDENTIFIED]) |
211 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
301 | ob2->set_flag (FLAG_BEEN_APPLIED); |
212 | |
302 | |
213 | if (ob1->arch->archname != ob2->arch->archname |
303 | if (ob1->arch->archname != ob2->arch->archname |
214 | || ob1->name != ob2->name |
304 | || ob1->name != ob2->name |
215 | || ob1->title != ob2->title |
305 | || ob1->title != ob2->title |
216 | || ob1->msg != ob2->msg |
306 | || ob1->msg != ob2->msg |
… | |
… | |
219 | || ob1->magic != ob2->magic |
309 | || ob1->magic != ob2->magic |
220 | || ob1->slaying != ob2->slaying |
310 | || ob1->slaying != ob2->slaying |
221 | || ob1->skill != ob2->skill |
311 | || ob1->skill != ob2->skill |
222 | || ob1->value != ob2->value |
312 | || ob1->value != ob2->value |
223 | || ob1->animation_id != ob2->animation_id |
313 | || ob1->animation_id != ob2->animation_id |
224 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
314 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
225 | || ob1->client_type != ob2->client_type |
315 | || ob1->client_type != ob2->client_type |
226 | || ob1->materialname != ob2->materialname |
316 | || ob1->material != ob2->material |
227 | || ob1->lore != ob2->lore |
317 | || ob1->lore != ob2->lore |
228 | || ob1->subtype != ob2->subtype |
318 | || ob1->subtype != ob2->subtype |
229 | || ob1->move_type != ob2->move_type |
319 | || ob1->move_type != ob2->move_type |
230 | || ob1->move_block != ob2->move_block |
320 | || ob1->move_block != ob2->move_block |
231 | || ob1->move_allow != ob2->move_allow |
321 | || ob1->move_allow != ob2->move_allow |
232 | || ob1->move_on != ob2->move_on |
322 | || ob1->move_on != ob2->move_on |
233 | || ob1->move_off != ob2->move_off |
323 | || ob1->move_off != ob2->move_off |
234 | || ob1->move_slow != ob2->move_slow |
324 | || ob1->move_slow != ob2->move_slow |
235 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
325 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
236 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
326 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
237 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
327 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
238 | return 0; |
328 | return 0; |
239 | |
329 | |
240 | if ((ob1->flag ^ ob2->flag) |
330 | if ((ob1->flag ^ ob2->flag) |
… | |
… | |
265 | |
355 | |
266 | /* Don't merge objects that are applied. With the new 'body' code, |
356 | /* Don't merge objects that are applied. With the new 'body' code, |
267 | * it is possible for most any character to have more than one of |
357 | * it is possible for most any character to have more than one of |
268 | * some items equipped, and we don't want those to merge. |
358 | * some items equipped, and we don't want those to merge. |
269 | */ |
359 | */ |
270 | if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) |
360 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
271 | return 0; |
361 | return 0; |
272 | |
362 | |
273 | /* Note sure why the following is the case - either the object has to |
363 | /* Note sure why the following is the case - either the object has to |
274 | * be animated or have a very low speed. Is this an attempted monster |
364 | * be animated or have a very low speed. Is this an attempted monster |
275 | * check? |
365 | * check? |
276 | */ |
366 | */ |
277 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
367 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
278 | return 0; |
368 | return 0; |
279 | |
369 | |
280 | switch (ob1->type) |
370 | switch (ob1->type) |
281 | { |
371 | { |
282 | case SCROLL: |
372 | case SCROLL: |
283 | if (ob1->level != ob2->level) |
373 | if (ob1->level != ob2->level) |
284 | return 0; |
374 | return 0; |
285 | break; |
375 | break; |
286 | } |
376 | } |
287 | |
377 | |
288 | if (ob1->key_values || ob2->key_values) |
378 | if (!ob1->kv.empty () || !ob2->kv.empty ()) |
289 | { |
379 | { |
290 | /* At least one of these has key_values. */ |
380 | /* At least one of these has key_values. */ |
291 | if ((!ob1->key_values) != (!ob2->key_values)) |
381 | if (ob1->kv.empty () != ob2->kv.empty ()) |
292 | return 0; /* One has fields, but the other one doesn't. */ |
382 | return 0; /* One has fields, but the other one doesn't. */ |
293 | |
383 | |
294 | if (!compare_ob_value_lists (ob1, ob2)) |
384 | if (!compare_ob_value_lists (ob1, ob2)) |
295 | return 0; |
385 | return 0; |
296 | } |
386 | } |
… | |
… | |
356 | |
446 | |
357 | return 0; |
447 | return 0; |
358 | } |
448 | } |
359 | |
449 | |
360 | // adjust weight per container type ("of holding") |
450 | // adjust weight per container type ("of holding") |
361 | static sint32 |
451 | static uint32 |
362 | weight_adjust_for (object *op, sint32 weight) |
452 | weight_adjust_for (object *op, uint32 weight) |
363 | { |
453 | { |
364 | return op->type == CONTAINER |
454 | return op->type == CONTAINER |
365 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
455 | ? weight - weight * op->stats.Str / 100 |
366 | : weight; |
456 | : weight; |
367 | } |
457 | } |
368 | |
458 | |
369 | /* |
459 | /* |
370 | * adjust_weight(object, weight) adds the specified weight to an object, |
460 | * subtracts, then adds, the specified weight to an object, |
371 | * and also updates how much the environment(s) is/are carrying. |
461 | * and also updates how much the environment(s) is/are carrying. |
372 | */ |
462 | */ |
373 | static void |
463 | static void |
374 | adjust_weight (object *op, sint32 weight) |
464 | adjust_weight (object *op, sint32 sub, sint32 add) |
375 | { |
465 | { |
376 | while (op) |
466 | while (op) |
377 | { |
467 | { |
378 | // adjust by actual difference to account for rounding errors |
468 | sint32 ocarrying = op->carrying; |
379 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
380 | weight = weight_adjust_for (op, op->carrying) |
|
|
381 | - weight_adjust_for (op, op->carrying - weight); |
|
|
382 | |
469 | |
383 | if (!weight) |
470 | op->carrying -= weight_adjust_for (op, sub); |
384 | return; |
471 | op->carrying += weight_adjust_for (op, add); |
385 | |
|
|
386 | op->carrying += weight; |
|
|
387 | |
472 | |
388 | if (object *pl = op->visible_to ()) |
473 | if (object *pl = op->visible_to ()) |
389 | if (pl != op) // player is handled lazily |
474 | if (pl != op) // player is handled lazily |
390 | esrv_update_item (UPD_WEIGHT, pl, op); |
475 | esrv_update_item (UPD_WEIGHT, pl, op); |
391 | |
476 | |
|
|
477 | sub = ocarrying; |
|
|
478 | add = op->carrying; |
|
|
479 | |
392 | op = op->env; |
480 | op = op->env; |
393 | } |
481 | } |
394 | } |
482 | } |
395 | |
483 | |
396 | /* |
484 | /* |
… | |
… | |
403 | { |
491 | { |
404 | sint32 sum = 0; |
492 | sint32 sum = 0; |
405 | |
493 | |
406 | for (object *op = inv; op; op = op->below) |
494 | for (object *op = inv; op; op = op->below) |
407 | { |
495 | { |
408 | if (op->inv) |
|
|
409 | op->update_weight (); |
496 | op->update_weight (); |
410 | |
497 | |
411 | sum += op->total_weight (); |
498 | sum += weight_adjust_for (this, op->total_weight ()); |
412 | } |
499 | } |
413 | |
|
|
414 | sum = weight_adjust_for (this, sum); |
|
|
415 | |
500 | |
416 | if (sum != carrying) |
501 | if (sum != carrying) |
417 | { |
502 | { |
|
|
503 | if (carrying != sum && carrying)//D |
|
|
504 | LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n", |
|
|
505 | (long long)sum, (long long)carrying, debug_desc ()); |
|
|
506 | |
418 | carrying = sum; |
507 | carrying = sum; |
419 | |
508 | |
420 | if (object *pl = visible_to ()) |
509 | if (object *pl = visible_to ()) |
421 | if (pl != this) // player is handled lazily |
510 | if (pl != this) // player is handled lazily |
422 | esrv_update_item (UPD_WEIGHT, pl, this); |
511 | esrv_update_item (UPD_WEIGHT, pl, this); |
… | |
… | |
450 | object * |
539 | object * |
451 | find_object (tag_t i) |
540 | find_object (tag_t i) |
452 | { |
541 | { |
453 | for_all_objects (op) |
542 | for_all_objects (op) |
454 | if (op->count == i) |
543 | if (op->count == i) |
|
|
544 | return op; |
|
|
545 | |
|
|
546 | return 0; |
|
|
547 | } |
|
|
548 | |
|
|
549 | /* |
|
|
550 | * Returns the object which has the uuid equal to the argument. |
|
|
551 | * MOAR VERRRY slow. |
|
|
552 | */ |
|
|
553 | |
|
|
554 | object * |
|
|
555 | find_object_uuid (UUID i) |
|
|
556 | { |
|
|
557 | for_all_objects (op) |
|
|
558 | if (op->uuid == i) |
455 | return op; |
559 | return op; |
456 | |
560 | |
457 | return 0; |
561 | return 0; |
458 | } |
562 | } |
459 | |
563 | |
… | |
… | |
493 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
597 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
494 | return; |
598 | return; |
495 | } |
599 | } |
496 | |
600 | |
497 | this->owner = owner; |
601 | this->owner = owner; |
498 | } |
|
|
499 | |
|
|
500 | int |
|
|
501 | object::slottype () const |
|
|
502 | { |
|
|
503 | if (type == SKILL) |
|
|
504 | { |
|
|
505 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
506 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
507 | } |
|
|
508 | else |
|
|
509 | { |
|
|
510 | if (slot [body_combat].info) return slot_combat; |
|
|
511 | if (slot [body_range ].info) return slot_ranged; |
|
|
512 | } |
|
|
513 | |
|
|
514 | return slot_none; |
|
|
515 | } |
|
|
516 | |
|
|
517 | bool |
|
|
518 | object::change_weapon (object *ob) |
|
|
519 | { |
|
|
520 | if (current_weapon == ob) |
|
|
521 | return true; |
|
|
522 | |
|
|
523 | if (chosen_skill) |
|
|
524 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
525 | |
|
|
526 | current_weapon = ob; |
|
|
527 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
528 | |
|
|
529 | if (chosen_skill) |
|
|
530 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
531 | |
|
|
532 | update_stats (); |
|
|
533 | |
|
|
534 | if (ob) |
|
|
535 | { |
|
|
536 | // now check wether any body locations became invalid, in which case |
|
|
537 | // we cannot apply the weapon at the moment. |
|
|
538 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
539 | if (slot[i].used < 0) |
|
|
540 | { |
|
|
541 | current_weapon = chosen_skill = 0; |
|
|
542 | update_stats (); |
|
|
543 | |
|
|
544 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
545 | "You try to balance all your items at once, " |
|
|
546 | "but the %s is just too much for your body. " |
|
|
547 | "[You need to unapply some items first - use the 'body' command to see " |
|
|
548 | "how many items you cna wera on a specific body part.]", &ob->name); |
|
|
549 | return false; |
|
|
550 | } |
|
|
551 | |
|
|
552 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
553 | } |
|
|
554 | else |
|
|
555 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
556 | |
|
|
557 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
558 | { |
|
|
559 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
560 | &name, ob->debug_desc ()); |
|
|
561 | return false; |
|
|
562 | } |
|
|
563 | |
|
|
564 | return true; |
|
|
565 | } |
|
|
566 | |
|
|
567 | /* Zero the key_values on op, decrementing the shared-string |
|
|
568 | * refcounts and freeing the links. |
|
|
569 | */ |
|
|
570 | static void |
|
|
571 | free_key_values (object *op) |
|
|
572 | { |
|
|
573 | for (key_value *i = op->key_values; i; ) |
|
|
574 | { |
|
|
575 | key_value *next = i->next; |
|
|
576 | delete i; |
|
|
577 | |
|
|
578 | i = next; |
|
|
579 | } |
|
|
580 | |
|
|
581 | op->key_values = 0; |
|
|
582 | } |
602 | } |
583 | |
603 | |
584 | /* |
604 | /* |
585 | * copy_to first frees everything allocated by the dst object, |
605 | * copy_to first frees everything allocated by the dst object, |
586 | * and then copies the contents of itself into the second |
606 | * and then copies the contents of itself into the second |
… | |
… | |
592 | void |
612 | void |
593 | object::copy_to (object *dst) |
613 | object::copy_to (object *dst) |
594 | { |
614 | { |
595 | dst->remove (); |
615 | dst->remove (); |
596 | *(object_copy *)dst = *this; |
616 | *(object_copy *)dst = *this; |
|
|
617 | |
|
|
618 | // maybe move to object_copy? |
|
|
619 | dst->kv = kv; |
|
|
620 | |
597 | dst->flag [FLAG_REMOVED] = true; |
621 | dst->flag [FLAG_REMOVED] = true; |
598 | |
|
|
599 | /* Copy over key_values, if any. */ |
|
|
600 | if (key_values) |
|
|
601 | { |
|
|
602 | key_value *tail = 0; |
|
|
603 | dst->key_values = 0; |
|
|
604 | |
|
|
605 | for (key_value *i = key_values; i; i = i->next) |
|
|
606 | { |
|
|
607 | key_value *new_link = new key_value; |
|
|
608 | |
|
|
609 | new_link->next = 0; |
|
|
610 | new_link->key = i->key; |
|
|
611 | new_link->value = i->value; |
|
|
612 | |
|
|
613 | /* Try and be clever here, too. */ |
|
|
614 | if (!dst->key_values) |
|
|
615 | { |
|
|
616 | dst->key_values = new_link; |
|
|
617 | tail = new_link; |
|
|
618 | } |
|
|
619 | else |
|
|
620 | { |
|
|
621 | tail->next = new_link; |
|
|
622 | tail = new_link; |
|
|
623 | } |
|
|
624 | } |
|
|
625 | } |
|
|
626 | |
|
|
627 | if (speed < 0) |
|
|
628 | dst->speed_left -= rndm (); |
|
|
629 | |
|
|
630 | dst->activate (); |
622 | dst->activate (); |
631 | } |
623 | } |
632 | |
624 | |
633 | void |
625 | void |
634 | object::instantiate () |
626 | object::instantiate () |
635 | { |
627 | { |
636 | if (!uuid.seq) // HACK |
628 | if (!uuid.seq) // HACK |
637 | uuid = UUID::gen (); |
629 | uuid = UUID::gen (); |
638 | |
630 | |
|
|
631 | // TODO: unclean state changes, should not be done in copy_to AND instantiate |
|
|
632 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
633 | speed_left = - speed - rndm (); // TODO animation |
|
|
634 | else |
639 | speed_left = -0.1f; |
635 | speed_left = -1.; |
|
|
636 | |
640 | /* copy the body_info to the body_used - this is only really |
637 | /* copy the body_info to the body_used - this is only really |
641 | * need for monsters, but doesn't hurt to do it for everything. |
638 | * need for monsters, but doesn't hurt to do it for everything. |
642 | * by doing so, when a monster is created, it has good starting |
639 | * by doing so, when a monster is created, it has good starting |
643 | * values for the body_used info, so when items are created |
640 | * values for the body_used info, so when items are created |
644 | * for it, they can be properly equipped. |
641 | * for it, they can be properly equipped. |
… | |
… | |
652 | object * |
649 | object * |
653 | object::clone () |
650 | object::clone () |
654 | { |
651 | { |
655 | object *neu = create (); |
652 | object *neu = create (); |
656 | copy_to (neu); |
653 | copy_to (neu); |
|
|
654 | |
|
|
655 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
656 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
657 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
658 | |
657 | neu->map = map; // not copied by copy_to |
659 | neu->map = map; // not copied by copy_to |
658 | return neu; |
660 | return neu; |
659 | } |
661 | } |
660 | |
662 | |
661 | /* |
663 | /* |
… | |
… | |
664 | * be called to update the face variable, _and_ how it looks on the map. |
666 | * be called to update the face variable, _and_ how it looks on the map. |
665 | */ |
667 | */ |
666 | void |
668 | void |
667 | update_turn_face (object *op) |
669 | update_turn_face (object *op) |
668 | { |
670 | { |
669 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
671 | if (!op->flag [FLAG_IS_TURNABLE] || !op->arch) |
670 | return; |
672 | return; |
671 | |
673 | |
672 | SET_ANIMATION (op, op->direction); |
674 | SET_ANIMATION (op, op->direction); |
673 | update_object (op, UP_OBJ_FACE); |
675 | update_object (op, UP_OBJ_FACE); |
674 | } |
676 | } |
… | |
… | |
679 | * This function needs to be called whenever the speed of an object changes. |
681 | * This function needs to be called whenever the speed of an object changes. |
680 | */ |
682 | */ |
681 | void |
683 | void |
682 | object::set_speed (float speed) |
684 | object::set_speed (float speed) |
683 | { |
685 | { |
684 | if (flag [FLAG_FREED] && speed) |
|
|
685 | { |
|
|
686 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
687 | speed = 0; |
|
|
688 | } |
|
|
689 | |
|
|
690 | this->speed = speed; |
686 | this->speed = speed; |
691 | |
687 | |
692 | if (has_active_speed ()) |
688 | if (has_active_speed ()) |
693 | activate (); |
689 | activate (); |
694 | else |
690 | else |
… | |
… | |
744 | |
740 | |
745 | if (!(m.flags_ & P_UPTODATE)) |
741 | if (!(m.flags_ & P_UPTODATE)) |
746 | /* nop */; |
742 | /* nop */; |
747 | else if (action == UP_OBJ_INSERT) |
743 | else if (action == UP_OBJ_INSERT) |
748 | { |
744 | { |
|
|
745 | #if 0 |
749 | // this is likely overkill, TODO: revisit (schmorp) |
746 | // this is likely overkill, TODO: revisit (schmorp) |
750 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
747 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
751 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
748 | || (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC)) |
752 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
749 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
753 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
750 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
754 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
751 | || (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE)) |
755 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
752 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
756 | || (m.move_on | op->move_on ) != m.move_on |
753 | || (m.move_on | op->move_on ) != m.move_on |
757 | || (m.move_off | op->move_off ) != m.move_off |
754 | || (m.move_off | op->move_off ) != m.move_off |
758 | || (m.move_slow | op->move_slow) != m.move_slow |
755 | || (m.move_slow | op->move_slow) != m.move_slow |
759 | /* This isn't perfect, but I don't expect a lot of objects to |
756 | /* This isn't perfect, but I don't expect a lot of objects to |
760 | * have move_allow right now. |
757 | * have move_allow right now. |
761 | */ |
758 | */ |
762 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
759 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
763 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
|
|
764 | m.invalidate (); |
760 | m.invalidate (); |
|
|
761 | #else |
|
|
762 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
|
|
763 | m.invalidate (); |
|
|
764 | #endif |
765 | } |
765 | } |
766 | /* if the object is being removed, we can't make intelligent |
766 | /* if the object is being removed, we can't make intelligent |
767 | * decisions, because remove_ob can't really pass the object |
767 | * decisions, because remove_ob can't really pass the object |
768 | * that is being removed. |
768 | * that is being removed. |
769 | */ |
769 | */ |
… | |
… | |
778 | update_object (op->more, action); |
778 | update_object (op->more, action); |
779 | } |
779 | } |
780 | |
780 | |
781 | object::object () |
781 | object::object () |
782 | { |
782 | { |
783 | SET_FLAG (this, FLAG_REMOVED); |
783 | this->set_flag (FLAG_REMOVED); |
784 | |
784 | |
785 | //expmul = 1.0; declared const for the time being |
785 | //expmul = 1.0; declared const for the time being |
786 | face = blank_face; |
786 | face = blank_face; |
|
|
787 | material = MATERIAL_NULL; |
787 | } |
788 | } |
788 | |
789 | |
789 | object::~object () |
790 | object::~object () |
790 | { |
791 | { |
791 | unlink (); |
792 | unlink (); |
792 | |
793 | |
793 | free_key_values (this); |
794 | kv.clear (); |
794 | } |
795 | } |
795 | |
|
|
796 | static int object_count; |
|
|
797 | |
796 | |
798 | void object::link () |
797 | void object::link () |
799 | { |
798 | { |
800 | assert (!index);//D |
799 | assert (!index);//D |
801 | uuid = UUID::gen (); |
800 | uuid = UUID::gen (); |
802 | count = ++object_count; |
|
|
803 | |
801 | |
804 | refcnt_inc (); |
802 | refcnt_inc (); |
805 | objects.insert (this); |
803 | objects.insert (this); |
|
|
804 | |
|
|
805 | ++create_count; |
|
|
806 | |
806 | } |
807 | } |
807 | |
808 | |
808 | void object::unlink () |
809 | void object::unlink () |
809 | { |
810 | { |
810 | if (!index) |
811 | if (!index) |
811 | return; |
812 | return; |
|
|
813 | |
|
|
814 | ++destroy_count; |
812 | |
815 | |
813 | objects.erase (this); |
816 | objects.erase (this); |
814 | refcnt_dec (); |
817 | refcnt_dec (); |
815 | } |
818 | } |
816 | |
819 | |
… | |
… | |
921 | map->insert (op, x, y); |
924 | map->insert (op, x, y); |
922 | } |
925 | } |
923 | } |
926 | } |
924 | } |
927 | } |
925 | |
928 | |
|
|
929 | /* |
|
|
930 | * Remove and free all objects in the inventory of the given object. |
|
|
931 | * Unlike destroy_inv, this assumes the *this is destroyed as well |
|
|
932 | * well, so we can (and have to!) take shortcuts. |
|
|
933 | */ |
|
|
934 | void |
|
|
935 | object::destroy_inv_fast () |
|
|
936 | { |
|
|
937 | while (object *op = inv) |
|
|
938 | { |
|
|
939 | // remove from object the fast way |
|
|
940 | op->flag [FLAG_REMOVED] = true; |
|
|
941 | op->env = 0; |
|
|
942 | if ((inv = inv->below)) |
|
|
943 | inv->above = 0; |
|
|
944 | |
|
|
945 | // then destroy |
|
|
946 | op->destroy (); |
|
|
947 | } |
|
|
948 | } |
|
|
949 | |
|
|
950 | void |
|
|
951 | object::freelist_free (int count) |
|
|
952 | { |
|
|
953 | while (count-- && freelist) |
|
|
954 | { |
|
|
955 | freelist_item *next = freelist->next; |
|
|
956 | // count is being "destroyed" |
|
|
957 | |
|
|
958 | sfree ((char *)freelist, sizeof (object)); |
|
|
959 | |
|
|
960 | freelist = next; |
|
|
961 | --free_count; |
|
|
962 | } |
|
|
963 | } |
|
|
964 | |
|
|
965 | object * |
926 | object *object::create () |
966 | object::create () |
927 | { |
967 | { |
928 | object *op = new object; |
968 | object *op; |
|
|
969 | |
|
|
970 | if (freelist) |
|
|
971 | { |
|
|
972 | freelist_item li = *freelist; |
|
|
973 | memset (freelist, 0, sizeof (object)); |
|
|
974 | |
|
|
975 | op = new (freelist) object; |
|
|
976 | op->count = li.count; |
|
|
977 | |
|
|
978 | freelist = li.next; |
|
|
979 | --free_count; |
|
|
980 | } |
|
|
981 | else |
|
|
982 | { |
|
|
983 | void *ni = salloc0<char> (sizeof (object)); |
|
|
984 | |
|
|
985 | op = new(ni) object; |
|
|
986 | |
|
|
987 | op->count = ++object_count; |
|
|
988 | } |
|
|
989 | |
929 | op->link (); |
990 | op->link (); |
|
|
991 | |
930 | return op; |
992 | return op; |
931 | } |
993 | } |
932 | |
994 | |
|
|
995 | void |
|
|
996 | object::do_delete () |
|
|
997 | { |
|
|
998 | uint32_t count = this->count; |
|
|
999 | |
|
|
1000 | this->~object (); |
|
|
1001 | |
|
|
1002 | freelist_item *li = (freelist_item *)this; |
|
|
1003 | li->next = freelist; |
|
|
1004 | li->count = count; |
|
|
1005 | |
|
|
1006 | freelist = li; |
|
|
1007 | ++free_count; |
|
|
1008 | } |
|
|
1009 | |
933 | static struct freed_map : maptile |
1010 | static struct freed_map : maptile |
934 | { |
1011 | { |
935 | freed_map () |
1012 | freed_map () |
|
|
1013 | : maptile (3, 3) |
936 | { |
1014 | { |
937 | path = "<freed objects map>"; |
1015 | path = "<freed objects map>"; |
938 | name = "/internal/freed_objects_map"; |
1016 | name = "/internal/freed_objects_map"; |
939 | width = 3; |
|
|
940 | height = 3; |
|
|
941 | no_drop = 1; |
1017 | no_drop = 1; |
942 | no_reset = 1; |
1018 | no_reset = 1; |
943 | |
1019 | |
944 | alloc (); |
|
|
945 | in_memory = MAP_ACTIVE; |
1020 | in_memory = MAP_ACTIVE; |
946 | } |
1021 | } |
947 | |
1022 | |
948 | ~freed_map () |
1023 | ~freed_map () |
949 | { |
1024 | { |
… | |
… | |
1000 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1075 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1001 | head->destroy (); |
1076 | head->destroy (); |
1002 | return; |
1077 | return; |
1003 | } |
1078 | } |
1004 | |
1079 | |
1005 | destroy_inv (false); |
1080 | destroy_inv_fast (); |
1006 | |
1081 | |
1007 | if (is_head ()) |
1082 | if (is_head ()) |
1008 | if (sound_destroy) |
1083 | if (sound_destroy) |
1009 | play_sound (sound_destroy); |
1084 | play_sound (sound_destroy); |
1010 | else if (flag [FLAG_MONSTER]) |
1085 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1042 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1117 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1043 | if (object *pl = visible_to ()) |
1118 | if (object *pl = visible_to ()) |
1044 | esrv_del_item (pl->contr, count); |
1119 | esrv_del_item (pl->contr, count); |
1045 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1120 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1046 | |
1121 | |
1047 | adjust_weight (env, -total_weight ()); |
1122 | adjust_weight (env, total_weight (), 0); |
1048 | |
1123 | |
1049 | object *pl = in_player (); |
1124 | object *pl = in_player (); |
1050 | |
1125 | |
1051 | /* we set up values so that it could be inserted into |
1126 | /* we set up values so that it could be inserted into |
1052 | * the map, but we don't actually do that - it is up |
1127 | * the map, but we don't actually do that - it is up |
… | |
… | |
1062 | |
1137 | |
1063 | above = 0; |
1138 | above = 0; |
1064 | below = 0; |
1139 | below = 0; |
1065 | env = 0; |
1140 | env = 0; |
1066 | |
1141 | |
1067 | /* NO_FIX_PLAYER is set when a great many changes are being |
1142 | if (pl && pl->is_player ()) |
1068 | * made to players inventory. If set, avoiding the call |
|
|
1069 | * to save cpu time. |
|
|
1070 | */ |
1143 | { |
1071 | if (pl) |
1144 | if (expect_false (pl->contr->combat_ob == this)) |
1072 | if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) |
|
|
1073 | { |
1145 | { |
1074 | pl->update_stats (); |
1146 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1147 | pl->contr->combat_ob = 0; |
|
|
1148 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
|
|
1149 | } |
1075 | |
1150 | |
|
|
1151 | if (expect_false (pl->contr->ranged_ob == this)) |
|
|
1152 | { |
|
|
1153 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1154 | pl->contr->ranged_ob = 0; |
|
|
1155 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
|
|
1156 | } |
|
|
1157 | |
|
|
1158 | pl->contr->queue_stats_update (); |
|
|
1159 | |
1076 | if (glow_radius && pl->is_on_map ()) |
1160 | if (expect_false (glow_radius) && pl->is_on_map ()) |
1077 | update_all_los (pl->map, pl->x, pl->y); |
1161 | update_all_los (pl->map, pl->x, pl->y); |
1078 | } |
1162 | } |
1079 | } |
1163 | } |
1080 | else if (map) |
1164 | else if (map) |
1081 | { |
1165 | { |
1082 | map->dirty = true; |
1166 | map->dirty = true; |
1083 | mapspace &ms = this->ms (); |
1167 | mapspace &ms = this->ms (); |
… | |
… | |
1101 | else if (pl->container_ () == this) |
1185 | else if (pl->container_ () == this) |
1102 | { |
1186 | { |
1103 | // removing a container should close it |
1187 | // removing a container should close it |
1104 | close_container (); |
1188 | close_container (); |
1105 | } |
1189 | } |
1106 | |
1190 | else |
1107 | esrv_del_item (pl->contr, count); |
1191 | esrv_del_item (pl->contr, count); |
1108 | } |
1192 | } |
1109 | |
1193 | |
1110 | /* link the object above us */ |
1194 | /* link the object above us */ |
1111 | // re-link, make sure compiler can easily use cmove |
1195 | // re-link, make sure compiler can easily use cmove |
1112 | *(above ? &above->below : &ms.top) = below; |
1196 | *(above ? &above->below : &ms.top) = below; |
… | |
… | |
1203 | |
1287 | |
1204 | object *prev = this; |
1288 | object *prev = this; |
1205 | |
1289 | |
1206 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1290 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1207 | { |
1291 | { |
1208 | object *op = arch_to_object (at); |
1292 | object *op = at->instance (); |
1209 | |
1293 | |
1210 | op->name = name; |
1294 | op->name = name; |
1211 | op->name_pl = name_pl; |
1295 | op->name_pl = name_pl; |
1212 | op->title = title; |
1296 | op->title = title; |
1213 | |
1297 | |
… | |
… | |
1251 | * Passing 0 for flag gives proper default values, so flag really only needs |
1335 | * Passing 0 for flag gives proper default values, so flag really only needs |
1252 | * to be set if special handling is needed. |
1336 | * to be set if special handling is needed. |
1253 | * |
1337 | * |
1254 | * Return value: |
1338 | * Return value: |
1255 | * new object if 'op' was merged with other object |
1339 | * new object if 'op' was merged with other object |
1256 | * NULL if 'op' was destroyed |
1340 | * NULL if there was an error (destroyed, blocked etc.) |
1257 | * just 'op' otherwise |
1341 | * just 'op' otherwise |
1258 | */ |
1342 | */ |
1259 | object * |
1343 | object * |
1260 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1344 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1261 | { |
1345 | { |
1262 | op->remove (); |
1346 | op->remove (); |
1263 | |
1347 | |
1264 | if (m == &freed_map)//D TODO: remove soon |
1348 | if (m == &freed_map)//D TODO: remove soon |
1265 | {//D |
1349 | {//D |
1266 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1350 | LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D |
1267 | }//D |
1351 | }//D |
1268 | |
1352 | |
1269 | /* Ideally, the caller figures this out. However, it complicates a lot |
1353 | /* Ideally, the caller figures this out. However, it complicates a lot |
1270 | * of areas of callers (eg, anything that uses find_free_spot would now |
1354 | * of areas of callers (eg, anything that uses find_free_spot would now |
1271 | * need extra work |
1355 | * need extra work |
… | |
… | |
1298 | // from here :/ |
1382 | // from here :/ |
1299 | op->nrof += tmp->nrof; |
1383 | op->nrof += tmp->nrof; |
1300 | tmp->destroy (); |
1384 | tmp->destroy (); |
1301 | } |
1385 | } |
1302 | |
1386 | |
1303 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1387 | op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1304 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1388 | op->clr_flag (FLAG_INV_LOCKED); |
1305 | |
1389 | |
1306 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1390 | if (!op->flag [FLAG_ALIVE]) |
1307 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1391 | op->clr_flag (FLAG_NO_STEAL); |
1308 | |
1392 | |
1309 | if (flag & INS_BELOW_ORIGINATOR) |
1393 | if (flag & INS_BELOW_ORIGINATOR) |
1310 | { |
1394 | { |
1311 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1395 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1312 | { |
1396 | { |
… | |
… | |
1347 | * when lots of spells are cast in one area. Currently, it is presumed |
1431 | * when lots of spells are cast in one area. Currently, it is presumed |
1348 | * that flying non pickable objects are spell objects. |
1432 | * that flying non pickable objects are spell objects. |
1349 | */ |
1433 | */ |
1350 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1434 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1351 | { |
1435 | { |
1352 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1436 | if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR]) |
1353 | floor = tmp; |
1437 | floor = tmp; |
1354 | |
1438 | |
1355 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1439 | if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR]) |
1356 | { |
1440 | { |
1357 | /* We insert above top, so we want this object below this */ |
1441 | /* We insert above top, so we want this object below this */ |
1358 | top = tmp->below; |
1442 | top = tmp->below; |
1359 | break; |
1443 | break; |
1360 | } |
1444 | } |
… | |
… | |
1378 | && (op->face && !faces [op->face].visibility)) |
1462 | && (op->face && !faces [op->face].visibility)) |
1379 | { |
1463 | { |
1380 | object *last; |
1464 | object *last; |
1381 | |
1465 | |
1382 | for (last = top; last != floor; last = last->below) |
1466 | for (last = top; last != floor; last = last->below) |
1383 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1467 | if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT)) |
1384 | break; |
1468 | break; |
1385 | |
1469 | |
1386 | /* Check to see if we found the object that blocks view, |
1470 | /* Check to see if we found the object that blocks view, |
1387 | * and make sure we have a below pointer for it so that |
1471 | * and make sure we have a below pointer for it so that |
1388 | * we can get inserted below this one, which requires we |
1472 | * we can get inserted below this one, which requires we |
… | |
… | |
1461 | */ |
1545 | */ |
1462 | |
1546 | |
1463 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1547 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1464 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1548 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1465 | { |
1549 | { |
1466 | if (check_move_on (op, originator)) |
1550 | if (check_move_on (op, originator, flag)) |
1467 | return 0; |
1551 | return 0; |
1468 | |
1552 | |
1469 | /* If we are a multi part object, lets work our way through the check |
1553 | /* If we are a multi part object, let's work our way through the check |
1470 | * walk on's. |
1554 | * walk on's. |
1471 | */ |
1555 | */ |
1472 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1556 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1473 | if (check_move_on (tmp, originator)) |
1557 | if (check_move_on (tmp, originator, flag)) |
1474 | return 0; |
1558 | return 0; |
1475 | } |
1559 | } |
1476 | |
1560 | |
1477 | return op; |
1561 | return op; |
1478 | } |
1562 | } |
… | |
… | |
1488 | |
1572 | |
1489 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1573 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1490 | if (tmp->arch->archname == archname) /* same archetype */ |
1574 | if (tmp->arch->archname == archname) /* same archetype */ |
1491 | tmp->destroy (); |
1575 | tmp->destroy (); |
1492 | |
1576 | |
1493 | object *tmp = arch_to_object (archetype::find (archname)); |
1577 | object *tmp = archetype::find (archname)->instance (); |
1494 | |
1578 | |
1495 | tmp->x = op->x; |
1579 | tmp->x = op->x; |
1496 | tmp->y = op->y; |
1580 | tmp->y = op->y; |
1497 | |
1581 | |
1498 | insert_ob_in_map (tmp, op->map, op, 0); |
1582 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1503 | { |
1587 | { |
1504 | if (where->env) |
1588 | if (where->env) |
1505 | return where->env->insert (this); |
1589 | return where->env->insert (this); |
1506 | else |
1590 | else |
1507 | return where->map->insert (this, where->x, where->y, originator, flags); |
1591 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1592 | } |
|
|
1593 | |
|
|
1594 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1595 | bool |
|
|
1596 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1597 | { |
|
|
1598 | mapspace &ms = m->at (x, y); |
|
|
1599 | |
|
|
1600 | int items = ms.items (); |
|
|
1601 | |
|
|
1602 | if (!items // testing !items ensures we can drop at least one item |
|
|
1603 | || (items < m->max_items |
|
|
1604 | && ms.volume () < m->max_volume)) |
|
|
1605 | return true; |
|
|
1606 | |
|
|
1607 | if (originator && originator->is_player ()) |
|
|
1608 | originator->contr->failmsgf ( |
|
|
1609 | "No matter how hard you try, you just cannot put the %s here H<Try to remove some items from the floor first.>", |
|
|
1610 | query_name () |
|
|
1611 | ); |
|
|
1612 | |
|
|
1613 | return false; |
1508 | } |
1614 | } |
1509 | |
1615 | |
1510 | /* |
1616 | /* |
1511 | * decrease(object, number) decreases a specified number from |
1617 | * decrease(object, number) decreases a specified number from |
1512 | * the amount of an object. If the amount reaches 0, the object |
1618 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1522 | |
1628 | |
1523 | nr = min (nr, nrof); |
1629 | nr = min (nr, nrof); |
1524 | |
1630 | |
1525 | if (nrof > nr) |
1631 | if (nrof > nr) |
1526 | { |
1632 | { |
|
|
1633 | sint64 oweight = total_weight (); |
|
|
1634 | |
1527 | nrof -= nr; |
1635 | nrof -= nr; |
1528 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
|
|
1529 | |
1636 | |
1530 | if (object *pl = visible_to ()) |
1637 | if (object *pl = visible_to ()) |
1531 | esrv_update_item (UPD_NROF, pl, this); |
1638 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1639 | |
|
|
1640 | adjust_weight (env, oweight, total_weight ()); |
1532 | |
1641 | |
1533 | return true; |
1642 | return true; |
1534 | } |
1643 | } |
1535 | else |
1644 | else |
1536 | { |
1645 | { |
… | |
… | |
1611 | if (op->nrof) |
1720 | if (op->nrof) |
1612 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1721 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1613 | if (object::can_merge (tmp, op)) |
1722 | if (object::can_merge (tmp, op)) |
1614 | { |
1723 | { |
1615 | /* return the original object and remove inserted object |
1724 | /* return the original object and remove inserted object |
1616 | (client needs the original object) */ |
1725 | (client prefers the original object) */ |
|
|
1726 | |
|
|
1727 | // carring must be 0 for mergable objects |
|
|
1728 | sint64 oweight = tmp->weight * tmp->nrof; |
|
|
1729 | |
1617 | tmp->nrof += op->nrof; |
1730 | tmp->nrof += op->nrof; |
1618 | |
1731 | |
1619 | if (object *pl = tmp->visible_to ()) |
1732 | if (object *pl = tmp->visible_to ()) |
1620 | esrv_update_item (UPD_NROF, pl, tmp); |
1733 | esrv_update_item (UPD_NROF, pl, tmp); |
1621 | |
1734 | |
1622 | adjust_weight (this, op->total_weight ()); |
1735 | adjust_weight (this, oweight, tmp->weight * tmp->nrof); |
1623 | |
1736 | |
1624 | op->destroy (); |
1737 | op->destroy (); |
1625 | op = tmp; |
1738 | op = tmp; |
1626 | goto inserted; |
1739 | goto inserted; |
1627 | } |
1740 | } |
… | |
… | |
1643 | op->flag [FLAG_REMOVED] = 0; |
1756 | op->flag [FLAG_REMOVED] = 0; |
1644 | |
1757 | |
1645 | if (object *pl = op->visible_to ()) |
1758 | if (object *pl = op->visible_to ()) |
1646 | esrv_send_item (pl, op); |
1759 | esrv_send_item (pl, op); |
1647 | |
1760 | |
1648 | adjust_weight (this, op->total_weight ()); |
1761 | adjust_weight (this, 0, op->total_weight ()); |
1649 | |
1762 | |
1650 | inserted: |
1763 | inserted: |
1651 | /* reset the light list and los of the players on the map */ |
1764 | /* reset the light list and los of the players on the map */ |
1652 | if (op->glow_radius && is_on_map ()) |
1765 | if (op->glow_radius && is_on_map ()) |
1653 | { |
1766 | { |
1654 | update_stats (); |
1767 | update_stats (); |
1655 | update_all_los (map, x, y); |
1768 | update_all_los (map, x, y); |
1656 | } |
1769 | } |
1657 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1770 | else if (is_player ()) |
1658 | // if this is a player's inventory, update stats |
1771 | // if this is a player's inventory, update stats |
1659 | update_stats (); |
1772 | contr->queue_stats_update (); |
1660 | |
1773 | |
1661 | INVOKE_OBJECT (INSERT, this); |
1774 | INVOKE_OBJECT (INSERT, this); |
1662 | |
1775 | |
1663 | return op; |
1776 | return op; |
1664 | } |
1777 | } |
… | |
… | |
1682 | * MSW 2001-07-08: Check all objects on space, not just those below |
1795 | * MSW 2001-07-08: Check all objects on space, not just those below |
1683 | * object being inserted. insert_ob_in_map may not put new objects |
1796 | * object being inserted. insert_ob_in_map may not put new objects |
1684 | * on top. |
1797 | * on top. |
1685 | */ |
1798 | */ |
1686 | int |
1799 | int |
1687 | check_move_on (object *op, object *originator) |
1800 | check_move_on (object *op, object *originator, int flags) |
1688 | { |
1801 | { |
1689 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1802 | if (op->flag [FLAG_NO_APPLY]) |
1690 | return 0; |
1803 | return 0; |
1691 | |
1804 | |
1692 | object *tmp; |
1805 | object *tmp; |
1693 | maptile *m = op->map; |
1806 | maptile *m = op->map; |
1694 | int x = op->x, y = op->y; |
1807 | int x = op->x, y = op->y; |
… | |
… | |
1731 | * Second check makes sure that the movement types not being slowed |
1844 | * Second check makes sure that the movement types not being slowed |
1732 | * (~slow_move) is not blocked on this space - just because the |
1845 | * (~slow_move) is not blocked on this space - just because the |
1733 | * space doesn't slow down swimming (for example), if you can't actually |
1846 | * space doesn't slow down swimming (for example), if you can't actually |
1734 | * swim on that space, can't use it to avoid the penalty. |
1847 | * swim on that space, can't use it to avoid the penalty. |
1735 | */ |
1848 | */ |
1736 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1849 | if (!op->flag [FLAG_WIZPASS]) |
1737 | { |
1850 | { |
1738 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1851 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1739 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1852 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1740 | { |
1853 | { |
1741 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1854 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
… | |
… | |
1751 | |
1864 | |
1752 | /* Basically same logic as above, except now for actual apply. */ |
1865 | /* Basically same logic as above, except now for actual apply. */ |
1753 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1866 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1754 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1867 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1755 | { |
1868 | { |
|
|
1869 | if ((flags & INS_NO_AUTO_EXIT) |
|
|
1870 | && (tmp->type == EXIT || tmp->type == TELEPORTER |
|
|
1871 | || tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead |
|
|
1872 | continue; |
|
|
1873 | |
1756 | move_apply (tmp, op, originator); |
1874 | move_apply (tmp, op, originator); |
1757 | |
1875 | |
1758 | if (op->destroyed ()) |
1876 | if (op->destroyed ()) |
1759 | return 1; |
1877 | return 1; |
1760 | |
1878 | |
… | |
… | |
1872 | void |
1990 | void |
1873 | flag_inv (object *op, int flag) |
1991 | flag_inv (object *op, int flag) |
1874 | { |
1992 | { |
1875 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1993 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1876 | { |
1994 | { |
1877 | SET_FLAG (tmp, flag); |
1995 | tmp->set_flag (flag); |
1878 | flag_inv (tmp, flag); |
1996 | flag_inv (tmp, flag); |
1879 | } |
1997 | } |
1880 | } |
1998 | } |
1881 | |
1999 | |
1882 | /* |
2000 | /* |
… | |
… | |
1885 | void |
2003 | void |
1886 | unflag_inv (object *op, int flag) |
2004 | unflag_inv (object *op, int flag) |
1887 | { |
2005 | { |
1888 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2006 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1889 | { |
2007 | { |
1890 | CLEAR_FLAG (tmp, flag); |
2008 | tmp->clr_flag (flag); |
1891 | unflag_inv (tmp, flag); |
2009 | unflag_inv (tmp, flag); |
1892 | } |
2010 | } |
1893 | } |
2011 | } |
1894 | |
2012 | |
1895 | /* |
2013 | /* |
… | |
… | |
2085 | { |
2203 | { |
2086 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2204 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2087 | } |
2205 | } |
2088 | |
2206 | |
2089 | /* |
2207 | /* |
2090 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2208 | * find_dir_2(delta-x,delta-y) will return a direction value |
2091 | * an object which has subtracted the x and y coordinates of another |
2209 | * for running into direct [dx, dy]. |
2092 | * object, needs to travel toward it. |
2210 | * (the opposite of crossfire's find_dir_2!) |
2093 | */ |
2211 | */ |
2094 | int |
2212 | int |
2095 | find_dir_2 (int x, int y) |
2213 | find_dir_2 (int x, int y) |
2096 | { |
2214 | { |
|
|
2215 | #if 1 // new algorithm |
|
|
2216 | // this works by putting x, y into 16 sectors, which |
|
|
2217 | // are not equal sized, but are a better approximation |
|
|
2218 | // then the old algorithm, and then using a mapping |
|
|
2219 | // table to map it into a direction value. |
|
|
2220 | // basically, it maps these comparisons to each bit |
|
|
2221 | // bit #3: x < 0 |
|
|
2222 | // bit #2: y < 0 |
|
|
2223 | // bit #1: x > y |
|
|
2224 | // bit #0: x > 2y |
|
|
2225 | |
|
|
2226 | static const uint8 dir[16] = { |
|
|
2227 | 4, 5, 4, 3, |
|
|
2228 | 2, 1, 2, 3, |
|
|
2229 | 6, 5, 6, 7, |
|
|
2230 | 8, 1, 8, 7, |
|
|
2231 | }; |
|
|
2232 | int sector = 0; |
|
|
2233 | |
|
|
2234 | // this is a bit ugly, but more likely to result in branchless code |
|
|
2235 | sector |= x < 0 ? 8 : 0; |
|
|
2236 | x = x < 0 ? -x : x; // abs |
|
|
2237 | |
|
|
2238 | sector |= y < 0 ? 4 : 0; |
|
|
2239 | y = y < 0 ? -y : y; // abs |
|
|
2240 | |
|
|
2241 | if (x > y) |
|
|
2242 | { |
|
|
2243 | sector |= 2; |
|
|
2244 | |
|
|
2245 | if (x > y * 2) |
|
|
2246 | sector |= 1; |
|
|
2247 | } |
|
|
2248 | else |
|
|
2249 | { |
|
|
2250 | if (y > x * 2) |
|
|
2251 | sector |= 1; |
|
|
2252 | else if (!y) |
|
|
2253 | return 0; // x == 0 here |
|
|
2254 | } |
|
|
2255 | |
|
|
2256 | return dir [sector]; |
|
|
2257 | #else // old algorithm |
2097 | int q; |
2258 | int q; |
2098 | |
2259 | |
2099 | if (y) |
2260 | if (y) |
2100 | q = x * 100 / y; |
2261 | q = 128 * x / y; |
2101 | else if (x) |
2262 | else if (x) |
2102 | q = -300 * x; |
2263 | q = -512 * x; // to make it > 309 |
2103 | else |
2264 | else |
2104 | return 0; |
2265 | return 0; |
2105 | |
2266 | |
2106 | if (y > 0) |
2267 | if (y > 0) |
2107 | { |
2268 | { |
2108 | if (q < -242) |
2269 | if (q < -309) return 7; |
|
|
2270 | if (q < -52) return 6; |
|
|
2271 | if (q < 52) return 5; |
|
|
2272 | if (q < 309) return 4; |
|
|
2273 | |
2109 | return 3; |
2274 | return 3; |
2110 | if (q < -41) |
2275 | } |
2111 | return 2; |
2276 | else |
2112 | if (q < 41) |
2277 | { |
2113 | return 1; |
2278 | if (q < -309) return 3; |
2114 | if (q < 242) |
2279 | if (q < -52) return 2; |
2115 | return 8; |
2280 | if (q < 52) return 1; |
|
|
2281 | if (q < 309) return 8; |
|
|
2282 | |
2116 | return 7; |
2283 | return 7; |
2117 | } |
2284 | } |
2118 | |
2285 | #endif |
2119 | if (q < -242) |
|
|
2120 | return 7; |
|
|
2121 | if (q < -41) |
|
|
2122 | return 6; |
|
|
2123 | if (q < 41) |
|
|
2124 | return 5; |
|
|
2125 | if (q < 242) |
|
|
2126 | return 4; |
|
|
2127 | |
|
|
2128 | return 3; |
|
|
2129 | } |
2286 | } |
2130 | |
2287 | |
2131 | /* |
2288 | /* |
2132 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2289 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2133 | * between two directions (which are expected to be absolute (see absdir()) |
2290 | * between two directions (which are expected to be absolute (see absdir()) |
2134 | */ |
2291 | */ |
2135 | int |
2292 | int |
2136 | dirdiff (int dir1, int dir2) |
2293 | dirdiff (int dir1, int dir2) |
2137 | { |
2294 | { |
2138 | int d; |
|
|
2139 | |
|
|
2140 | d = abs (dir1 - dir2); |
2295 | int d = abs (dir1 - dir2); |
2141 | if (d > 4) |
|
|
2142 | d = 8 - d; |
|
|
2143 | |
2296 | |
2144 | return d; |
2297 | return d > 4 ? 8 - d : d; |
2145 | } |
2298 | } |
2146 | |
2299 | |
2147 | /* peterm: |
2300 | /* peterm: |
2148 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2301 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2149 | * Basically, this is a table of directions, and what directions |
2302 | * Basically, this is a table of directions, and what directions |
… | |
… | |
2255 | * Add a check so we can't pick up invisible objects (0.93.8) |
2408 | * Add a check so we can't pick up invisible objects (0.93.8) |
2256 | */ |
2409 | */ |
2257 | int |
2410 | int |
2258 | can_pick (const object *who, const object *item) |
2411 | can_pick (const object *who, const object *item) |
2259 | { |
2412 | { |
2260 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2413 | return /*who->flag [FLAG_WIZ]|| */ |
2261 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2414 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2262 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2415 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2263 | } |
2416 | } |
2264 | |
2417 | |
2265 | /* |
2418 | /* |
2266 | * create clone from object to another |
2419 | * create clone from object to another |
2267 | */ |
2420 | */ |
… | |
… | |
2299 | return tmp; |
2452 | return tmp; |
2300 | |
2453 | |
2301 | return 0; |
2454 | return 0; |
2302 | } |
2455 | } |
2303 | |
2456 | |
|
|
2457 | /* Zero the key_values on op, decrementing the shared-string |
|
|
2458 | * refcounts and freeing the links. |
|
|
2459 | */ |
|
|
2460 | void |
|
|
2461 | key_values::clear () |
|
|
2462 | { |
|
|
2463 | for (key_value *kvp = first; kvp; ) |
|
|
2464 | { |
|
|
2465 | key_value *next = kvp->next; |
|
|
2466 | delete kvp; |
|
|
2467 | kvp = next; |
|
|
2468 | } |
|
|
2469 | |
|
|
2470 | first = 0; |
|
|
2471 | } |
|
|
2472 | |
2304 | shstr_tmp |
2473 | shstr_tmp |
2305 | object::kv_get (shstr_tmp key) const |
2474 | key_values::get (shstr_tmp key) const |
2306 | { |
2475 | { |
2307 | for (key_value *kv = key_values; kv; kv = kv->next) |
2476 | for (key_value *kv = first; kv; kv = kv->next) |
2308 | if (kv->key == key) |
2477 | if (kv->key == key) |
2309 | return kv->value; |
2478 | return kv->value; |
2310 | |
2479 | |
2311 | return shstr (); |
2480 | return shstr (); |
2312 | } |
2481 | } |
2313 | |
2482 | |
2314 | void |
2483 | void |
|
|
2484 | key_values::add (shstr_tmp key, shstr_tmp value) |
|
|
2485 | { |
|
|
2486 | key_value *kv = new key_value; |
|
|
2487 | |
|
|
2488 | kv->next = first; |
|
|
2489 | kv->key = key; |
|
|
2490 | kv->value = value; |
|
|
2491 | |
|
|
2492 | first = kv; |
|
|
2493 | } |
|
|
2494 | |
|
|
2495 | void |
2315 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2496 | key_values::set (shstr_tmp key, shstr_tmp value) |
2316 | { |
2497 | { |
2317 | for (key_value *kv = key_values; kv; kv = kv->next) |
2498 | for (key_value *kv = first; kv; kv = kv->next) |
2318 | if (kv->key == key) |
2499 | if (kv->key == key) |
2319 | { |
2500 | { |
2320 | kv->value = value; |
2501 | kv->value = value; |
2321 | return; |
2502 | return; |
2322 | } |
2503 | } |
2323 | |
2504 | |
2324 | key_value *kv = new key_value; |
2505 | add (key, value); |
2325 | |
|
|
2326 | kv->next = key_values; |
|
|
2327 | kv->key = key; |
|
|
2328 | kv->value = value; |
|
|
2329 | |
|
|
2330 | key_values = kv; |
|
|
2331 | } |
2506 | } |
2332 | |
2507 | |
2333 | void |
2508 | void |
2334 | object::kv_del (shstr_tmp key) |
2509 | key_values::del (shstr_tmp key) |
2335 | { |
2510 | { |
2336 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2511 | for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next) |
2337 | if ((*kvp)->key == key) |
2512 | if ((*kvp)->key == key) |
2338 | { |
2513 | { |
2339 | key_value *kv = *kvp; |
2514 | key_value *kv = *kvp; |
2340 | *kvp = (*kvp)->next; |
2515 | *kvp = (*kvp)->next; |
2341 | delete kv; |
2516 | delete kv; |
2342 | return; |
2517 | return; |
2343 | } |
2518 | } |
|
|
2519 | } |
|
|
2520 | |
|
|
2521 | void |
|
|
2522 | key_values::reverse () |
|
|
2523 | { |
|
|
2524 | key_value *prev = 0; |
|
|
2525 | key_value *head = first; |
|
|
2526 | |
|
|
2527 | while (head) |
|
|
2528 | { |
|
|
2529 | key_value *node = head; |
|
|
2530 | head = head->next; |
|
|
2531 | node->next = prev; |
|
|
2532 | prev = node; |
|
|
2533 | } |
|
|
2534 | |
|
|
2535 | first = prev; |
|
|
2536 | } |
|
|
2537 | |
|
|
2538 | key_values & |
|
|
2539 | key_values::operator =(const key_values &kv) |
|
|
2540 | { |
|
|
2541 | clear (); |
|
|
2542 | |
|
|
2543 | for (key_value *kvp = kv.first; kvp; kvp = kvp->next) |
|
|
2544 | add (kvp->key, kvp->value); |
|
|
2545 | |
|
|
2546 | reverse (); |
2344 | } |
2547 | } |
2345 | |
2548 | |
2346 | object::depth_iterator::depth_iterator (object *container) |
2549 | object::depth_iterator::depth_iterator (object *container) |
2347 | : iterator_base (container) |
2550 | : iterator_base (container) |
2348 | { |
2551 | { |
… | |
… | |
2432 | { |
2635 | { |
2433 | return map ? map->region (x, y) |
2636 | return map ? map->region (x, y) |
2434 | : region::default_region (); |
2637 | : region::default_region (); |
2435 | } |
2638 | } |
2436 | |
2639 | |
2437 | const materialtype_t * |
|
|
2438 | object::dominant_material () const |
|
|
2439 | { |
|
|
2440 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2441 | return mt; |
|
|
2442 | |
|
|
2443 | return name_to_material (shstr_unknown); |
|
|
2444 | } |
|
|
2445 | |
|
|
2446 | void |
2640 | void |
2447 | object::open_container (object *new_container) |
2641 | object::open_container (object *new_container) |
2448 | { |
2642 | { |
2449 | if (container == new_container) |
2643 | if (container == new_container) |
2450 | return; |
2644 | return; |
… | |
… | |
2484 | // TODO: this does not seem to serve any purpose anymore? |
2678 | // TODO: this does not seem to serve any purpose anymore? |
2485 | #if 0 |
2679 | #if 0 |
2486 | // insert the "Close Container" object. |
2680 | // insert the "Close Container" object. |
2487 | if (archetype *closer = new_container->other_arch) |
2681 | if (archetype *closer = new_container->other_arch) |
2488 | { |
2682 | { |
2489 | object *closer = arch_to_object (new_container->other_arch); |
2683 | object *closer = new_container->other_arch->instance (); |
2490 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2684 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2491 | new_container->insert (closer); |
2685 | new_container->insert (closer); |
2492 | } |
2686 | } |
2493 | #endif |
2687 | #endif |
2494 | |
2688 | |
… | |
… | |
2537 | object::force_add (shstr_tmp name, int duration) |
2731 | object::force_add (shstr_tmp name, int duration) |
2538 | { |
2732 | { |
2539 | if (object *force = force_find (name)) |
2733 | if (object *force = force_find (name)) |
2540 | force->destroy (); |
2734 | force->destroy (); |
2541 | |
2735 | |
2542 | object *force = get_archetype (FORCE_NAME); |
2736 | object *force = archetype::get (FORCE_NAME); |
2543 | |
2737 | |
2544 | force->slaying = name; |
2738 | force->slaying = name; |
2545 | force->force_set_timer (duration); |
2739 | force->force_set_timer (duration); |
2546 | force->flag [FLAG_APPLIED] = true; |
2740 | force->flag [FLAG_APPLIED] = true; |
2547 | |
2741 | |
… | |
… | |
2600 | |
2794 | |
2601 | insert (force); |
2795 | insert (force); |
2602 | } |
2796 | } |
2603 | } |
2797 | } |
2604 | |
2798 | |
|
|
2799 | void object::change_move_type (MoveType mt) |
|
|
2800 | { |
|
|
2801 | if (move_type == mt) |
|
|
2802 | return; |
|
|
2803 | |
|
|
2804 | if (is_on_map ()) |
|
|
2805 | { |
|
|
2806 | // we are on the map, so handle move_on/off effects |
|
|
2807 | remove (); |
|
|
2808 | move_type = mt; |
|
|
2809 | map->insert (this, x, y, this); |
|
|
2810 | } |
|
|
2811 | else |
|
|
2812 | move_type = mt; |
|
|
2813 | } |
|
|
2814 | |
|
|
2815 | /* object should be a player. |
|
|
2816 | * we return the object the player has marked with the 'mark' command |
|
|
2817 | * below. If no match is found (or object has changed), we return |
|
|
2818 | * NULL. We leave it up to the calling function to print messages if |
|
|
2819 | * nothing is found. |
|
|
2820 | */ |
|
|
2821 | object * |
|
|
2822 | object::mark () const |
|
|
2823 | { |
|
|
2824 | if (contr && contr->mark && contr->mark->env == this) |
|
|
2825 | return contr->mark; |
|
|
2826 | else |
|
|
2827 | return 0; |
|
|
2828 | } |
|
|
2829 | |
|
|
2830 | // put marked object first in the inventory |
|
|
2831 | // this is used by identify-like spells so players can influence |
|
|
2832 | // the order a bit. |
|
|
2833 | void |
|
|
2834 | object::splay_marked () |
|
|
2835 | { |
|
|
2836 | if (object *marked = mark ()) |
|
|
2837 | splay (marked); |
|
|
2838 | } |
|
|
2839 | |