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 (©) 2017,2018 Marc Alexander Lehmann / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2005,2006,2007,2008,2009,2010,2011,2012,2013,2014,2015,2016 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
8 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * 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 |
10 | * 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 |
11 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * option) any later version. |
12 | * option) any later version. |
12 | * |
13 | * |
13 | * This program is distributed in the hope that it will be useful, |
14 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
17 | * GNU General Public License for more details. |
17 | * |
18 | * |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * You should have received a copy of the Affero GNU General Public License |
19 | * and the GNU General Public License along with this program. If not, see |
20 | * and the GNU General Public License along with this program. If not, see |
20 | * <http://www.gnu.org/licenses/>. |
21 | * <http://www.gnu.org/licenses/>. |
21 | * |
22 | * |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | * The authors can be reached via e-mail to <support@deliantra.net> |
23 | */ |
24 | */ |
24 | |
25 | |
25 | #include <global.h> |
26 | #include <global.h> |
26 | #include <stdio.h> |
27 | #include <stdio.h> |
27 | #include <sys/types.h> |
28 | #include <sys/types.h> |
28 | #include <sys/uio.h> |
29 | #include <sys/uio.h> |
29 | #include <object.h> |
30 | #include <object.h> |
30 | #include <sproto.h> |
31 | #include <sproto.h> |
31 | #include <loader.h> |
|
|
32 | |
32 | |
33 | #include <bitset> |
33 | #include <bitset> |
34 | |
34 | |
35 | UUID UUID::cur; |
35 | UUID UUID::cur; |
36 | static uint64_t seq_next_save; |
36 | static uint64_t seq_next_save; |
… | |
… | |
38 | uint32_t mapspace::smellcount = 10000; |
38 | uint32_t mapspace::smellcount = 10000; |
39 | |
39 | |
40 | objectvec objects; |
40 | objectvec objects; |
41 | activevec actives; |
41 | activevec actives; |
42 | |
42 | |
|
|
43 | freelist_item *object::freelist; |
|
|
44 | uint32_t object::object_count; |
|
|
45 | uint32_t object::free_count; |
|
|
46 | uint32_t object::create_count; |
|
|
47 | uint32_t object::destroy_count; |
|
|
48 | |
43 | //+GPL |
49 | //+GPL |
44 | |
50 | |
45 | short freearr_x[SIZEOFFREE] = { |
51 | int freearr_x[SIZEOFFREE] = { |
46 | 0, |
52 | 0, |
47 | 0, 1, 1, 1, 0, -1, -1, -1, |
53 | 0, 1, 1, 1, 0, -1, -1, -1, |
48 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
54 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
49 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
55 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
50 | }; |
56 | }; |
51 | short freearr_y[SIZEOFFREE] = { |
57 | int freearr_y[SIZEOFFREE] = { |
52 | 0, |
58 | 0, |
53 | -1, -1, 0, 1, 1, 1, 0, -1, |
59 | -1, -1, 0, 1, 1, 1, 0, -1, |
54 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
60 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
55 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
61 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
56 | }; |
|
|
57 | int maxfree[SIZEOFFREE] = { |
|
|
58 | 0, |
|
|
59 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
60 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
61 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
62 | }; |
62 | }; |
63 | int freedir[SIZEOFFREE] = { |
63 | int freedir[SIZEOFFREE] = { |
64 | 0, |
64 | 0, |
65 | 1, 2, 3, 4, 5, 6, 7, 8, |
65 | 1, 2, 3, 4, 5, 6, 7, 8, |
66 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
66 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
67 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
67 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
68 | }; |
68 | }; |
69 | |
69 | |
|
|
70 | static int maxfree[SIZEOFFREE] = { |
|
|
71 | 0, |
|
|
72 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
73 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
74 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
75 | }; |
|
|
76 | |
|
|
77 | const char *wall_suffix[16] = { |
|
|
78 | "0", |
|
|
79 | "1_3", |
|
|
80 | "1_4", |
|
|
81 | "2_1_2", |
|
|
82 | "1_2", |
|
|
83 | "2_2_4", |
|
|
84 | "2_2_1", |
|
|
85 | "3_1", |
|
|
86 | "1_1", |
|
|
87 | "2_2_3", |
|
|
88 | "2_2_2", |
|
|
89 | "3_3", |
|
|
90 | "2_1_1", |
|
|
91 | "3_4", |
|
|
92 | "3_2", |
|
|
93 | "4" |
|
|
94 | }; |
|
|
95 | |
70 | static void |
96 | static void |
71 | write_uuid (uval64 skip, bool sync) |
97 | write_uuid (uval64 skip, bool sync) |
72 | { |
98 | { |
73 | CALL_BEGIN (2); |
99 | CALL_BEGIN (2); |
74 | CALL_ARG_SV (newSVval64 (skip)); |
100 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
76 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
102 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
77 | CALL_END; |
103 | CALL_END; |
78 | } |
104 | } |
79 | |
105 | |
80 | static void |
106 | static void |
81 | read_uuid (void) |
107 | read_uuid () |
82 | { |
108 | { |
83 | char filename[MAX_BUF]; |
109 | char filename[MAX_BUF]; |
84 | |
110 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
111 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | |
112 | |
… | |
… | |
100 | |
126 | |
101 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
127 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
102 | _exit (1); |
128 | _exit (1); |
103 | } |
129 | } |
104 | |
130 | |
105 | UUID::BUF buf; |
131 | char buf [UUID::MAX_LEN]; |
106 | buf[0] = 0; |
132 | buf[0] = 0; |
107 | fgets (buf, sizeof (buf), fp); |
133 | fgets (buf, sizeof (buf), fp); |
108 | |
134 | |
109 | if (!UUID::cur.parse (buf)) |
135 | if (!UUID::cur.parse (buf)) |
110 | { |
136 | { |
… | |
… | |
137 | |
163 | |
138 | void |
164 | void |
139 | UUID::init () |
165 | UUID::init () |
140 | { |
166 | { |
141 | read_uuid (); |
167 | read_uuid (); |
|
|
168 | } |
|
|
169 | |
|
|
170 | bool |
|
|
171 | UUID::parse (const char *s) |
|
|
172 | { |
|
|
173 | if (*s++ != '<' || *s++ != '1' || *s++ != '.') |
|
|
174 | return false; |
|
|
175 | |
|
|
176 | seq = 0; |
|
|
177 | |
|
|
178 | while (*s != '>') |
|
|
179 | { |
|
|
180 | if (*s < '0') |
|
|
181 | return false; |
|
|
182 | |
|
|
183 | // this gives nice branchless code with gcc |
|
|
184 | assert ('0' < 'a' && '0' == 48 && 'a' == 97); |
|
|
185 | int digit = (*s + (*s & 0x40 ? 9 : 0)) & 15; |
|
|
186 | |
|
|
187 | seq = (seq << 4) | digit; |
|
|
188 | |
|
|
189 | ++s; |
|
|
190 | } |
|
|
191 | |
|
|
192 | return true; |
|
|
193 | } |
|
|
194 | |
|
|
195 | char * |
|
|
196 | UUID::append (char *buf) const |
|
|
197 | { |
|
|
198 | *buf++ = '<'; |
|
|
199 | *buf++ = '1'; |
|
|
200 | *buf++ = '.'; |
|
|
201 | |
|
|
202 | uint64_t seq = this->seq; |
|
|
203 | const int bits = 64; |
|
|
204 | char nz = 0; |
|
|
205 | static const char tohex [] = "0123456789abcdef"; |
|
|
206 | |
|
|
207 | // assert (len >= 3 + bits / 4 + 1 + 1); |
|
|
208 | for (int i = bits / 4; --i; ) |
|
|
209 | { |
|
|
210 | uint8_t digit = seq >> (bits - 4); |
|
|
211 | |
|
|
212 | *buf = tohex [digit]; |
|
|
213 | nz |= digit; |
|
|
214 | buf += nz ? 1 : 0; |
|
|
215 | seq <<= 4; |
|
|
216 | } |
|
|
217 | |
|
|
218 | // last digit is special - always emit |
|
|
219 | uint8_t digit = seq >> (bits - 4); |
|
|
220 | *buf++ = tohex [digit]; |
|
|
221 | |
|
|
222 | *buf++ = '>'; |
|
|
223 | |
|
|
224 | return buf; |
|
|
225 | } |
|
|
226 | |
|
|
227 | char * |
|
|
228 | UUID::c_str () const |
|
|
229 | { |
|
|
230 | static char buf [MAX_LEN]; |
|
|
231 | *append (buf) = 0; |
|
|
232 | return buf; |
142 | } |
233 | } |
143 | |
234 | |
144 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
235 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
145 | static bool |
236 | static bool |
146 | compare_ob_value_lists_one (const object *wants, const object *has) |
237 | compare_ob_value_lists_one (const object *wants, const object *has) |
147 | { |
238 | { |
148 | /* n-squared behaviour (see kv_get), but I'm hoping both |
239 | /* n-squared behaviour (see kv.get), but I'm hoping both |
149 | * objects with lists are rare, and lists stay short. If not, use a |
240 | * objects with lists are rare, and lists stay short. If not, use a |
150 | * different structure or at least keep the lists sorted... |
241 | * different structure or at least keep the lists sorted... |
151 | */ |
242 | */ |
152 | |
243 | |
153 | /* For each field in wants, */ |
244 | /* For each field in wants, */ |
154 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
245 | for (key_value *kv = wants->kv.first; kv; kv = kv->next) |
155 | if (has->kv_get (kv->key) != kv->value) |
246 | if (has->kv.get (kv->key) != kv->value) |
156 | return false; |
247 | return false; |
157 | |
248 | |
158 | /* If we get here, every field in wants has a matching field in has. */ |
249 | /* If we get here, every field in wants has a matching field in has. */ |
159 | return true; |
250 | return true; |
160 | } |
251 | } |
… | |
… | |
182 | * Improvements made with merge: Better checking on potion, and also |
273 | * Improvements made with merge: Better checking on potion, and also |
183 | * check weight |
274 | * check weight |
184 | */ |
275 | */ |
185 | bool object::can_merge_slow (object *ob1, object *ob2) |
276 | bool object::can_merge_slow (object *ob1, object *ob2) |
186 | { |
277 | { |
187 | /* A couple quicksanity checks */ |
278 | /* A couple quick sanity checks */ |
188 | if (ob1 == ob2 |
279 | if (ob1 == ob2 |
189 | || ob1->type != ob2->type |
280 | || ob1->type != ob2->type |
190 | || ob1->speed != ob2->speed |
|
|
191 | || ob1->value != ob2->value |
281 | || ob1->value != ob2->value |
192 | || ob1->name != ob2->name) |
282 | || ob1->name != ob2->name |
|
|
283 | || ob1->custom_name != ob2->custom_name |
|
|
284 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED) |
193 | return 0; |
285 | return 0; |
194 | |
286 | |
195 | /* Do not merge objects if nrof would overflow, assume nrof |
287 | /* Do not merge objects if nrof would overflow, assume nrof |
196 | * is always 0 .. 2**31-1 */ |
288 | * is always 0 .. 2**31-1 */ |
197 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
289 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
… | |
… | |
201 | * This is to the comparison of the flags below will be OK. We |
293 | * This is to the comparison of the flags below will be OK. We |
202 | * just can't ignore the been applied or identified flags, as they |
294 | * just can't ignore the been applied or identified flags, as they |
203 | * are not equal - just if it has been identified, the been_applied |
295 | * are not equal - just if it has been identified, the been_applied |
204 | * flags lose any meaning. |
296 | * flags lose any meaning. |
205 | */ |
297 | */ |
206 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
298 | if (ob1->flag [FLAG_IDENTIFIED]) |
207 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
299 | ob1->set_flag (FLAG_BEEN_APPLIED); |
208 | |
300 | |
209 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
301 | if (ob2->flag [FLAG_IDENTIFIED]) |
210 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
302 | ob2->set_flag (FLAG_BEEN_APPLIED); |
211 | |
303 | |
212 | if (ob1->arch->archname != ob2->arch->archname |
304 | if (ob1->arch->archname != ob2->arch->archname |
213 | || ob1->name != ob2->name |
305 | || ob1->name != ob2->name |
214 | || ob1->title != ob2->title |
306 | || ob1->title != ob2->title |
215 | || ob1->msg != ob2->msg |
307 | || ob1->msg != ob2->msg |
… | |
… | |
218 | || ob1->magic != ob2->magic |
310 | || ob1->magic != ob2->magic |
219 | || ob1->slaying != ob2->slaying |
311 | || ob1->slaying != ob2->slaying |
220 | || ob1->skill != ob2->skill |
312 | || ob1->skill != ob2->skill |
221 | || ob1->value != ob2->value |
313 | || ob1->value != ob2->value |
222 | || ob1->animation_id != ob2->animation_id |
314 | || ob1->animation_id != ob2->animation_id |
223 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
315 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependend on each other |
224 | || ob1->client_type != ob2->client_type |
316 | || ob1->client_type != ob2->client_type |
225 | || ob1->materialname != ob2->materialname |
317 | || ob1->material != ob2->material |
226 | || ob1->lore != ob2->lore |
318 | || ob1->lore != ob2->lore |
227 | || ob1->subtype != ob2->subtype |
319 | || ob1->subtype != ob2->subtype |
228 | || ob1->move_type != ob2->move_type |
320 | || ob1->move_type != ob2->move_type |
229 | || ob1->move_block != ob2->move_block |
321 | || ob1->move_block != ob2->move_block |
230 | || ob1->move_allow != ob2->move_allow |
322 | || ob1->move_allow != ob2->move_allow |
231 | || ob1->move_on != ob2->move_on |
323 | || ob1->move_on != ob2->move_on |
232 | || ob1->move_off != ob2->move_off |
324 | || ob1->move_off != ob2->move_off |
233 | || ob1->move_slow != ob2->move_slow |
325 | || ob1->move_slow != ob2->move_slow |
234 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
326 | || fabs (ob1->move_slow_penalty - ob2->move_slow_penalty) >= (1.f / 1024.f) |
235 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
327 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
236 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
328 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
237 | return 0; |
329 | return 0; |
238 | |
330 | |
239 | if ((ob1->flag ^ ob2->flag) |
331 | if ((ob1->flag ^ ob2->flag) |
… | |
… | |
260 | /* inventory ok - still need to check rest of this object to see |
352 | /* inventory ok - still need to check rest of this object to see |
261 | * if it is valid. |
353 | * if it is valid. |
262 | */ |
354 | */ |
263 | } |
355 | } |
264 | |
356 | |
265 | /* Don't merge objects that are applied. With the new 'body' code, |
357 | /* Don't merge objects that are applied. With the new 'body' code, |
266 | * it is possible for most any character to have more than one of |
358 | * it is possible for most any character to have more than one of |
267 | * some items equipped, and we don't want those to merge. |
359 | * some items equipped, and we don't want those to merge. |
268 | */ |
360 | */ |
269 | if (QUERY_FLAG (ob1, FLAG_APPLIED) || QUERY_FLAG (ob2, FLAG_APPLIED)) |
361 | if (ob1->flag [FLAG_APPLIED] || ob2->flag [FLAG_APPLIED]) |
270 | return 0; |
362 | return 0; |
271 | |
363 | |
272 | /* Note sure why the following is the case - either the object has to |
364 | /* Not sure why the following is the case - either the object has to |
273 | * be animated or have a very low speed. Is this an attempted monster |
365 | * be animated or have a very low speed. Is this an attempted monster |
274 | * check? |
366 | * check? |
275 | */ |
367 | */ |
276 | if (!QUERY_FLAG (ob1, FLAG_ANIMATE) && ob1->has_active_speed ()) |
368 | if (!ob1->flag [FLAG_ANIMATE] && ob1->has_active_speed ()) |
277 | return 0; |
369 | return 0; |
278 | |
370 | |
279 | switch (ob1->type) |
371 | switch (ob1->type) |
280 | { |
372 | { |
281 | case SCROLL: |
373 | case SCROLL: |
282 | if (ob1->level != ob2->level) |
374 | if (ob1->level != ob2->level) |
283 | return 0; |
375 | return 0; |
284 | break; |
376 | break; |
285 | } |
377 | } |
286 | |
378 | |
287 | if (ob1->key_values || ob2->key_values) |
379 | if (!ob1->kv.empty () || !ob2->kv.empty ()) |
288 | { |
380 | { |
289 | /* At least one of these has key_values. */ |
381 | /* At least one of these has key_values. */ |
290 | if ((!ob1->key_values) != (!ob2->key_values)) |
382 | if (ob1->kv.empty () != ob2->kv.empty ()) |
291 | return 0; /* One has fields, but the other one doesn't. */ |
383 | return 0; /* One has fields, but the other one doesn't. */ |
292 | |
384 | |
293 | if (!compare_ob_value_lists (ob1, ob2)) |
385 | if (!compare_ob_value_lists (ob1, ob2)) |
294 | return 0; |
386 | return 0; |
295 | } |
387 | } |
… | |
… | |
355 | |
447 | |
356 | return 0; |
448 | return 0; |
357 | } |
449 | } |
358 | |
450 | |
359 | // adjust weight per container type ("of holding") |
451 | // adjust weight per container type ("of holding") |
360 | static sint32 |
452 | static weight_t |
361 | weight_adjust_for (object *op, sint32 weight) |
453 | weight_adjust_for (object *op, weight_t weight) |
362 | { |
454 | { |
363 | return op->type == CONTAINER |
455 | if (op->type == CONTAINER) |
364 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
456 | weight -= weight * op->stats.Str / 100; |
365 | : weight; |
|
|
366 | } |
|
|
367 | |
457 | |
|
|
458 | return weight; |
|
|
459 | } |
|
|
460 | |
368 | /* |
461 | /* |
369 | * adjust_weight(object, weight) adds the specified weight to an object, |
462 | * subtracts, then adds, the specified weight to an object, |
370 | * and also updates how much the environment(s) is/are carrying. |
463 | * and also updates how much the environment(s) is/are carrying. |
371 | */ |
464 | */ |
372 | static void |
465 | static void |
373 | adjust_weight (object *op, sint32 weight) |
466 | adjust_weight (object *op, weight_t sub, weight_t add) |
374 | { |
467 | { |
375 | while (op) |
468 | while (op) |
376 | { |
469 | { |
377 | // adjust by actual difference to account for rounding errors |
470 | weight_t carrying = (weight_t)op->carrying |
378 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
471 | - weight_adjust_for (op, sub) |
379 | weight = weight_adjust_for (op, op->carrying) |
472 | + weight_adjust_for (op, add); |
380 | - weight_adjust_for (op, op->carrying - weight); |
|
|
381 | |
473 | |
382 | if (!weight) |
474 | sub = op->carrying; |
383 | return; |
|
|
384 | |
|
|
385 | op->carrying += weight; |
475 | op->carrying = carrying; |
|
|
476 | add = op->carrying; |
386 | |
477 | |
387 | if (object *pl = op->visible_to ()) |
478 | if (object *pl = op->visible_to ()) |
388 | if (pl != op) // player is handled lazily |
479 | if (pl != op) // player is handled lazily |
389 | esrv_update_item (UPD_WEIGHT, pl, op); |
480 | esrv_update_item (UPD_WEIGHT, pl, op); |
390 | |
481 | |
… | |
… | |
398 | * containers are carrying, and sums it up. |
489 | * containers are carrying, and sums it up. |
399 | */ |
490 | */ |
400 | void |
491 | void |
401 | object::update_weight () |
492 | object::update_weight () |
402 | { |
493 | { |
403 | sint32 sum = 0; |
494 | weight_t sum = 0; |
404 | |
495 | |
405 | for (object *op = inv; op; op = op->below) |
496 | for (object *op = inv; op; op = op->below) |
406 | { |
497 | { |
407 | if (op->inv) |
|
|
408 | op->update_weight (); |
498 | op->update_weight (); |
409 | |
499 | |
410 | sum += op->total_weight (); |
500 | sum += weight_adjust_for (this, op->total_weight ()); |
411 | } |
501 | } |
412 | |
|
|
413 | sum = weight_adjust_for (this, sum); |
|
|
414 | |
502 | |
415 | if (sum != carrying) |
503 | if (sum != carrying) |
416 | { |
504 | { |
|
|
505 | if (carrying != sum && carrying)//D |
|
|
506 | LOG (llevDebug, "updating carrying got %ld, expected %ld (%s)\n", |
|
|
507 | (long long)sum, (long long)carrying, debug_desc ()); |
|
|
508 | |
417 | carrying = sum; |
509 | carrying = sum; |
418 | |
510 | |
419 | if (object *pl = visible_to ()) |
511 | if (object *pl = visible_to ()) |
420 | if (pl != this) // player is handled lazily |
512 | if (pl != this) // player is handled lazily |
421 | esrv_update_item (UPD_WEIGHT, pl, this); |
513 | esrv_update_item (UPD_WEIGHT, pl, this); |
… | |
… | |
441 | { |
533 | { |
442 | return dump_object (this); |
534 | return dump_object (this); |
443 | } |
535 | } |
444 | |
536 | |
445 | /* |
537 | /* |
446 | * get_nearest_part(multi-object, object 2) returns the part of the |
|
|
447 | * multi-object 1 which is closest to the second object. |
|
|
448 | * If it's not a multi-object, it is returned. |
|
|
449 | */ |
|
|
450 | object * |
|
|
451 | get_nearest_part (object *op, const object *pl) |
|
|
452 | { |
|
|
453 | object *tmp, *closest; |
|
|
454 | int last_dist, i; |
|
|
455 | |
|
|
456 | if (!op->more) |
|
|
457 | return op; |
|
|
458 | |
|
|
459 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
460 | tmp; |
|
|
461 | tmp = tmp->more) |
|
|
462 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
463 | closest = tmp, last_dist = i; |
|
|
464 | |
|
|
465 | return closest; |
|
|
466 | } |
|
|
467 | |
|
|
468 | /* |
|
|
469 | * Returns the object which has the count-variable equal to the argument. |
538 | * Returns the object which has the count-variable equal to the argument. |
470 | * VERRRY slow. |
539 | * VERRRY slow. |
471 | */ |
540 | */ |
472 | object * |
541 | object * |
473 | find_object (tag_t i) |
542 | find_object (tag_t i) |
474 | { |
543 | { |
475 | for_all_objects (op) |
544 | for_all_objects (op) |
476 | if (op->count == i) |
545 | if (op->count == i) |
|
|
546 | return op; |
|
|
547 | |
|
|
548 | return 0; |
|
|
549 | } |
|
|
550 | |
|
|
551 | /* |
|
|
552 | * Returns the object which has the uuid equal to the argument. |
|
|
553 | * MOAR VERRRY slow. |
|
|
554 | */ |
|
|
555 | |
|
|
556 | object * |
|
|
557 | find_object_uuid (UUID i) |
|
|
558 | { |
|
|
559 | for_all_objects (op) |
|
|
560 | if (op->uuid == i) |
477 | return op; |
561 | return op; |
478 | |
562 | |
479 | return 0; |
563 | return 0; |
480 | } |
564 | } |
481 | |
565 | |
… | |
… | |
515 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
599 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
516 | return; |
600 | return; |
517 | } |
601 | } |
518 | |
602 | |
519 | this->owner = owner; |
603 | this->owner = owner; |
520 | } |
|
|
521 | |
|
|
522 | int |
|
|
523 | object::slottype () const |
|
|
524 | { |
|
|
525 | if (type == SKILL) |
|
|
526 | { |
|
|
527 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
528 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
529 | } |
|
|
530 | else |
|
|
531 | { |
|
|
532 | if (slot [body_combat].info) return slot_combat; |
|
|
533 | if (slot [body_range ].info) return slot_ranged; |
|
|
534 | } |
|
|
535 | |
|
|
536 | return slot_none; |
|
|
537 | } |
|
|
538 | |
|
|
539 | bool |
|
|
540 | object::change_weapon (object *ob) |
|
|
541 | { |
|
|
542 | if (current_weapon == ob) |
|
|
543 | return true; |
|
|
544 | |
|
|
545 | if (chosen_skill) |
|
|
546 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
547 | |
|
|
548 | current_weapon = ob; |
|
|
549 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
550 | |
|
|
551 | if (chosen_skill) |
|
|
552 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
553 | |
|
|
554 | update_stats (); |
|
|
555 | |
|
|
556 | if (ob) |
|
|
557 | { |
|
|
558 | // now check wether any body locations became invalid, in which case |
|
|
559 | // we cannot apply the weapon at the moment. |
|
|
560 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
561 | if (slot[i].used < 0) |
|
|
562 | { |
|
|
563 | current_weapon = chosen_skill = 0; |
|
|
564 | update_stats (); |
|
|
565 | |
|
|
566 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
567 | "You try to balance all your items at once, " |
|
|
568 | "but the %s is just too much for your body. " |
|
|
569 | "[You need to unapply some items first - use the 'body' command to see " |
|
|
570 | "how many items you cna wera on a specific body part.]", &ob->name); |
|
|
571 | return false; |
|
|
572 | } |
|
|
573 | |
|
|
574 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
575 | } |
|
|
576 | else |
|
|
577 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
578 | |
|
|
579 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
580 | { |
|
|
581 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
582 | &name, ob->debug_desc ()); |
|
|
583 | return false; |
|
|
584 | } |
|
|
585 | |
|
|
586 | return true; |
|
|
587 | } |
|
|
588 | |
|
|
589 | /* Zero the key_values on op, decrementing the shared-string |
|
|
590 | * refcounts and freeing the links. |
|
|
591 | */ |
|
|
592 | static void |
|
|
593 | free_key_values (object *op) |
|
|
594 | { |
|
|
595 | for (key_value *i = op->key_values; i; ) |
|
|
596 | { |
|
|
597 | key_value *next = i->next; |
|
|
598 | delete i; |
|
|
599 | |
|
|
600 | i = next; |
|
|
601 | } |
|
|
602 | |
|
|
603 | op->key_values = 0; |
|
|
604 | } |
604 | } |
605 | |
605 | |
606 | /* |
606 | /* |
607 | * copy_to first frees everything allocated by the dst object, |
607 | * copy_to first frees everything allocated by the dst object, |
608 | * and then copies the contents of itself into the second |
608 | * and then copies the contents of itself into the second |
… | |
… | |
614 | void |
614 | void |
615 | object::copy_to (object *dst) |
615 | object::copy_to (object *dst) |
616 | { |
616 | { |
617 | dst->remove (); |
617 | dst->remove (); |
618 | *(object_copy *)dst = *this; |
618 | *(object_copy *)dst = *this; |
|
|
619 | |
|
|
620 | // maybe move to object_copy? |
|
|
621 | dst->kv = kv; |
|
|
622 | |
619 | dst->flag [FLAG_REMOVED] = true; |
623 | dst->flag [FLAG_REMOVED] = true; |
620 | |
|
|
621 | /* Copy over key_values, if any. */ |
|
|
622 | if (key_values) |
|
|
623 | { |
|
|
624 | key_value *tail = 0; |
|
|
625 | dst->key_values = 0; |
|
|
626 | |
|
|
627 | for (key_value *i = key_values; i; i = i->next) |
|
|
628 | { |
|
|
629 | key_value *new_link = new key_value; |
|
|
630 | |
|
|
631 | new_link->next = 0; |
|
|
632 | new_link->key = i->key; |
|
|
633 | new_link->value = i->value; |
|
|
634 | |
|
|
635 | /* Try and be clever here, too. */ |
|
|
636 | if (!dst->key_values) |
|
|
637 | { |
|
|
638 | dst->key_values = new_link; |
|
|
639 | tail = new_link; |
|
|
640 | } |
|
|
641 | else |
|
|
642 | { |
|
|
643 | tail->next = new_link; |
|
|
644 | tail = new_link; |
|
|
645 | } |
|
|
646 | } |
|
|
647 | } |
|
|
648 | |
|
|
649 | if (speed < 0) |
|
|
650 | dst->speed_left -= rndm (); |
|
|
651 | |
|
|
652 | dst->activate (); |
624 | dst->activate (); |
653 | } |
625 | } |
654 | |
626 | |
655 | void |
627 | void |
656 | object::instantiate () |
628 | object::instantiate () |
657 | { |
629 | { |
658 | if (!uuid.seq) // HACK |
630 | if (!uuid.seq) // HACK |
659 | uuid = UUID::gen (); |
631 | uuid = UUID::gen (); |
660 | |
632 | |
|
|
633 | // TODO: unclean state changes, should not be done in copy_to AND instantiate |
|
|
634 | if (flag [FLAG_RANDOM_SPEED] && speed) |
|
|
635 | speed_left = - speed - rndm (); // TODO animation |
|
|
636 | else |
661 | speed_left = -0.1f; |
637 | speed_left = -1.; |
|
|
638 | |
662 | /* copy the body_info to the body_used - this is only really |
639 | /* copy the body_info to the body_used - this is only really |
663 | * need for monsters, but doesn't hurt to do it for everything. |
640 | * need for monsters, but doesn't hurt to do it for everything. |
664 | * by doing so, when a monster is created, it has good starting |
641 | * by doing so, when a monster is created, it has good starting |
665 | * values for the body_used info, so when items are created |
642 | * values for the body_used info, so when items are created |
666 | * for it, they can be properly equipped. |
643 | * for it, they can be properly equipped. |
667 | */ |
644 | */ |
668 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
645 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
669 | slot[i].used = slot[i].info; |
646 | slot[i].used = slot[i].info; |
670 | |
647 | |
671 | attachable::instantiate (); |
648 | attachable::instantiate (); |
672 | } |
649 | } |
673 | |
650 | |
674 | object * |
651 | object * |
675 | object::clone () |
652 | object::clone () |
676 | { |
653 | { |
677 | object *neu = create (); |
654 | object *neu = create (); |
678 | copy_to (neu); |
655 | copy_to (neu); |
|
|
656 | |
|
|
657 | // TODO: unclean state changes, should not be done in clone AND instantiate |
|
|
658 | if (neu->flag [FLAG_RANDOM_SPEED] && neu->speed) |
|
|
659 | neu->speed_left = - neu->speed - rndm (); // TODO animation |
|
|
660 | |
679 | neu->map = map; // not copied by copy_to |
661 | neu->map = map; // not copied by copy_to |
680 | return neu; |
662 | return neu; |
681 | } |
663 | } |
682 | |
664 | |
683 | /* |
665 | /* |
… | |
… | |
686 | * be called to update the face variable, _and_ how it looks on the map. |
668 | * be called to update the face variable, _and_ how it looks on the map. |
687 | */ |
669 | */ |
688 | void |
670 | void |
689 | update_turn_face (object *op) |
671 | update_turn_face (object *op) |
690 | { |
672 | { |
691 | if (!QUERY_FLAG (op, FLAG_IS_TURNABLE) || !op->arch) |
673 | if (!op->flag [FLAG_IS_TURNABLE] || !op->arch) |
692 | return; |
674 | return; |
693 | |
675 | |
694 | SET_ANIMATION (op, op->direction); |
676 | SET_ANIMATION (op, op->direction); |
695 | update_object (op, UP_OBJ_FACE); |
677 | update_object (op, UP_OBJ_FACE); |
696 | } |
678 | } |
… | |
… | |
701 | * This function needs to be called whenever the speed of an object changes. |
683 | * This function needs to be called whenever the speed of an object changes. |
702 | */ |
684 | */ |
703 | void |
685 | void |
704 | object::set_speed (float speed) |
686 | object::set_speed (float speed) |
705 | { |
687 | { |
706 | if (flag [FLAG_FREED] && speed) |
|
|
707 | { |
|
|
708 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
709 | speed = 0; |
|
|
710 | } |
|
|
711 | |
|
|
712 | this->speed = speed; |
688 | this->speed = speed; |
713 | |
689 | |
714 | if (has_active_speed ()) |
690 | if (has_active_speed ()) |
715 | activate (); |
691 | activate (); |
716 | else |
692 | else |
… | |
… | |
763 | } |
739 | } |
764 | |
740 | |
765 | mapspace &m = op->ms (); |
741 | mapspace &m = op->ms (); |
766 | |
742 | |
767 | if (!(m.flags_ & P_UPTODATE)) |
743 | if (!(m.flags_ & P_UPTODATE)) |
768 | /* nop */; |
744 | m.update_up (); // nothing to do except copy up |
769 | else if (action == UP_OBJ_INSERT) |
745 | else if (action == UP_OBJ_INSERT) |
770 | { |
746 | { |
|
|
747 | #if 0 |
771 | // this is likely overkill, TODO: revisit (schmorp) |
748 | // this is likely overkill, TODO: revisit (schmorp) |
772 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
749 | if ((op->flag [FLAG_BLOCKSVIEW] && !(m.flags_ & P_BLOCKSVIEW)) |
773 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
750 | || (op->flag [FLAG_NO_MAGIC] && !(m.flags_ & P_NO_MAGIC)) |
774 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
751 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
775 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
752 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
776 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
753 | || (op->flag [FLAG_ALIVE] && !(m.flags_ & P_IS_ALIVE)) |
777 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
754 | || (op->flag [FLAG_DAMNED] && !(m.flags_ & P_NO_CLERIC)) |
778 | || (m.move_on | op->move_on ) != m.move_on |
755 | || (m.move_on | op->move_on ) != m.move_on |
779 | || (m.move_off | op->move_off ) != m.move_off |
756 | || (m.move_off | op->move_off ) != m.move_off |
780 | || (m.move_slow | op->move_slow) != m.move_slow |
757 | || (m.move_slow | op->move_slow) != m.move_slow |
781 | /* This isn't perfect, but I don't expect a lot of objects to |
758 | /* This isn't perfect, but I don't expect a lot of objects to |
782 | * have move_allow right now. |
759 | * have move_allow right now. |
783 | */ |
760 | */ |
784 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
761 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
785 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
|
|
786 | m.invalidate (); |
762 | m.invalidate (); |
|
|
763 | #else |
|
|
764 | // the above is not strong enough a test to skip updating. los maybe? TODO (schmorp) |
|
|
765 | m.invalidate (); |
|
|
766 | #endif |
787 | } |
767 | } |
788 | /* if the object is being removed, we can't make intelligent |
768 | /* if the object is being removed, we can't make intelligent |
789 | * decisions, because remove_ob can't really pass the object |
769 | * decisions, because remove_ob can't really pass the object |
790 | * that is being removed. |
770 | * that is being removed. |
791 | */ |
771 | */ |
792 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
772 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
793 | m.invalidate (); |
773 | m.invalidate (); |
794 | else if (action == UP_OBJ_FACE) |
774 | else if (action == UP_OBJ_FACE) |
795 | /* Nothing to do for that case */ ; |
775 | m.update_up (); // nothing to do for that case, except copy up |
796 | else |
776 | else |
797 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
777 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
798 | |
778 | |
799 | if (op->more) |
779 | if (op->more) |
800 | update_object (op->more, action); |
780 | update_object (op->more, action); |
801 | } |
781 | } |
802 | |
782 | |
803 | object::object () |
783 | object::object () |
804 | { |
784 | { |
805 | SET_FLAG (this, FLAG_REMOVED); |
785 | this->set_flag (FLAG_REMOVED); |
806 | |
786 | |
807 | //expmul = 1.0; declared const for the time being |
787 | //expmul = 1.0; declared const for the time being |
808 | face = blank_face; |
788 | face = blank_face; |
|
|
789 | material = MATERIAL_NULL; |
809 | } |
790 | } |
810 | |
791 | |
811 | object::~object () |
792 | object::~object () |
812 | { |
793 | { |
813 | unlink (); |
794 | unlink (); |
814 | |
795 | |
815 | free_key_values (this); |
796 | kv.clear (); |
816 | } |
797 | } |
817 | |
|
|
818 | static int object_count; |
|
|
819 | |
798 | |
820 | void object::link () |
799 | void object::link () |
821 | { |
800 | { |
822 | assert (!index);//D |
801 | assert (!index);//D |
823 | uuid = UUID::gen (); |
802 | uuid = UUID::gen (); |
824 | count = ++object_count; |
|
|
825 | |
803 | |
826 | refcnt_inc (); |
804 | refcnt_inc (); |
827 | objects.insert (this); |
805 | objects.insert (this); |
|
|
806 | |
|
|
807 | ++create_count; |
|
|
808 | |
828 | } |
809 | } |
829 | |
810 | |
830 | void object::unlink () |
811 | void object::unlink () |
831 | { |
812 | { |
832 | if (!index) |
813 | if (!index) |
833 | return; |
814 | return; |
|
|
815 | |
|
|
816 | ++destroy_count; |
834 | |
817 | |
835 | objects.erase (this); |
818 | objects.erase (this); |
836 | refcnt_dec (); |
819 | refcnt_dec (); |
837 | } |
820 | } |
838 | |
821 | |
… | |
… | |
861 | op->activate_recursive (); |
844 | op->activate_recursive (); |
862 | } |
845 | } |
863 | |
846 | |
864 | /* This function removes object 'op' from the list of active |
847 | /* This function removes object 'op' from the list of active |
865 | * objects. |
848 | * objects. |
866 | * This should only be used for style maps or other such |
849 | * This should only be used for style maps or other such |
867 | * reference maps where you don't want an object that isn't |
850 | * reference maps where you don't want an object that isn't |
868 | * in play chewing up cpu time getting processed. |
851 | * in play chewing up cpu time getting processed. |
869 | * The reverse of this is to call update_ob_speed, which |
852 | * The reverse of this is to call update_ob_speed, which |
870 | * will do the right thing based on the speed of the object. |
853 | * will do the right thing based on the speed of the object. |
871 | */ |
854 | */ |
… | |
… | |
917 | * if some form of movement is allowed, let objects |
900 | * if some form of movement is allowed, let objects |
918 | * drop on that space. |
901 | * drop on that space. |
919 | */ |
902 | */ |
920 | if (!drop_to_ground |
903 | if (!drop_to_ground |
921 | || !map |
904 | || !map |
922 | || map->in_memory != MAP_ACTIVE |
905 | || !map->linkable () |
923 | || map->no_drop |
906 | || map->no_drop |
924 | || ms ().move_block == MOVE_ALL) |
907 | || ms ().move_block == MOVE_ALL) |
925 | { |
908 | { |
926 | while (inv) |
909 | while (inv) |
927 | inv->destroy (); |
910 | inv->destroy (); |
… | |
… | |
943 | map->insert (op, x, y); |
926 | map->insert (op, x, y); |
944 | } |
927 | } |
945 | } |
928 | } |
946 | } |
929 | } |
947 | |
930 | |
|
|
931 | /* |
|
|
932 | * Remove and free all objects in the inventory of the given object. |
|
|
933 | * Unlike destroy_inv, this assumes the *this is destroyed as well |
|
|
934 | * well, so we can (and have to!) take shortcuts. |
|
|
935 | */ |
|
|
936 | void |
|
|
937 | object::destroy_inv_fast () |
|
|
938 | { |
|
|
939 | while (object *op = inv) |
|
|
940 | { |
|
|
941 | // remove from object the fast way |
|
|
942 | op->flag [FLAG_REMOVED] = true; |
|
|
943 | op->env = 0; |
|
|
944 | if ((inv = inv->below)) |
|
|
945 | inv->above = 0; |
|
|
946 | |
|
|
947 | // then destroy |
|
|
948 | op->destroy (); |
|
|
949 | } |
|
|
950 | } |
|
|
951 | |
|
|
952 | void |
|
|
953 | object::freelist_free (int count) |
|
|
954 | { |
|
|
955 | while (count-- && freelist) |
|
|
956 | { |
|
|
957 | freelist_item *next = freelist->next; |
|
|
958 | // count is being "destroyed" |
|
|
959 | |
|
|
960 | sfree ((char *)freelist, sizeof (object)); |
|
|
961 | |
|
|
962 | freelist = next; |
|
|
963 | --free_count; |
|
|
964 | } |
|
|
965 | } |
|
|
966 | |
|
|
967 | object * |
948 | object *object::create () |
968 | object::create () |
949 | { |
969 | { |
950 | object *op = new object; |
970 | object *op; |
|
|
971 | |
|
|
972 | if (freelist) |
|
|
973 | { |
|
|
974 | freelist_item li = *freelist; |
|
|
975 | memset (freelist, 0, sizeof (object)); |
|
|
976 | |
|
|
977 | op = new (freelist) object; |
|
|
978 | op->count = li.count; |
|
|
979 | |
|
|
980 | freelist = li.next; |
|
|
981 | --free_count; |
|
|
982 | } |
|
|
983 | else |
|
|
984 | { |
|
|
985 | void *ni = salloc0<char> (sizeof (object)); |
|
|
986 | |
|
|
987 | op = new(ni) object; |
|
|
988 | |
|
|
989 | op->count = ++object_count; |
|
|
990 | } |
|
|
991 | |
951 | op->link (); |
992 | op->link (); |
|
|
993 | |
952 | return op; |
994 | return op; |
953 | } |
995 | } |
954 | |
996 | |
955 | static struct freed_map : maptile |
997 | void |
|
|
998 | object::do_delete () |
956 | { |
999 | { |
957 | freed_map () |
1000 | uint32_t count = this->count; |
958 | { |
|
|
959 | path = "<freed objects map>"; |
|
|
960 | name = "/internal/freed_objects_map"; |
|
|
961 | width = 3; |
|
|
962 | height = 3; |
|
|
963 | no_drop = 1; |
|
|
964 | no_reset = 1; |
|
|
965 | |
1001 | |
966 | alloc (); |
1002 | this->~object (); |
967 | in_memory = MAP_ACTIVE; |
|
|
968 | } |
|
|
969 | |
1003 | |
970 | ~freed_map () |
1004 | freelist_item *li = (freelist_item *)this; |
971 | { |
1005 | li->next = freelist; |
972 | destroy (); |
1006 | li->count = count; |
973 | } |
1007 | |
974 | } freed_map; // freed objects are moved here to avoid crashes |
1008 | freelist = li; |
|
|
1009 | ++free_count; |
|
|
1010 | } |
975 | |
1011 | |
976 | void |
1012 | void |
977 | object::do_destroy () |
1013 | object::do_destroy () |
978 | { |
1014 | { |
979 | if (flag [FLAG_IS_LINKED]) |
1015 | if (flag [FLAG_IS_LINKED]) |
… | |
… | |
1022 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1058 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
1023 | head->destroy (); |
1059 | head->destroy (); |
1024 | return; |
1060 | return; |
1025 | } |
1061 | } |
1026 | |
1062 | |
1027 | destroy_inv (false); |
1063 | destroy_inv_fast (); |
1028 | |
1064 | |
1029 | if (is_head ()) |
1065 | if (is_head ()) |
1030 | if (sound_destroy) |
1066 | if (sound_destroy) |
1031 | play_sound (sound_destroy); |
1067 | play_sound (sound_destroy); |
1032 | else if (flag [FLAG_MONSTER]) |
1068 | else if (flag [FLAG_MONSTER]) |
… | |
… | |
1053 | flag [FLAG_REMOVED] = true; |
1089 | flag [FLAG_REMOVED] = true; |
1054 | |
1090 | |
1055 | if (more) |
1091 | if (more) |
1056 | more->remove (); |
1092 | more->remove (); |
1057 | |
1093 | |
1058 | /* |
1094 | /* |
1059 | * In this case, the object to be removed is in someones |
1095 | * In this case, the object to be removed is in someones |
1060 | * inventory. |
1096 | * inventory. |
1061 | */ |
1097 | */ |
1062 | if (env) |
1098 | if (env) |
1063 | { |
1099 | { |
1064 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1100 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1065 | if (object *pl = visible_to ()) |
1101 | if (object *pl = visible_to ()) |
1066 | esrv_del_item (pl->contr, count); |
1102 | esrv_del_item (pl->contr, count); |
1067 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1103 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
1068 | |
1104 | |
1069 | adjust_weight (env, -total_weight ()); |
1105 | adjust_weight (env, total_weight (), 0); |
1070 | |
1106 | |
1071 | object *pl = in_player (); |
1107 | object *pl = in_player (); |
1072 | |
1108 | |
1073 | /* we set up values so that it could be inserted into |
1109 | /* we set up values so that it could be inserted into |
1074 | * the map, but we don't actually do that - it is up |
1110 | * the map, but we don't actually do that - it is up |
… | |
… | |
1084 | |
1120 | |
1085 | above = 0; |
1121 | above = 0; |
1086 | below = 0; |
1122 | below = 0; |
1087 | env = 0; |
1123 | env = 0; |
1088 | |
1124 | |
1089 | /* NO_FIX_PLAYER is set when a great many changes are being |
1125 | if (pl && pl->is_player ()) |
1090 | * made to players inventory. If set, avoiding the call |
|
|
1091 | * to save cpu time. |
|
|
1092 | */ |
1126 | { |
1093 | if (pl) |
1127 | if (expect_false (pl->contr->combat_ob == this)) |
1094 | if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) |
|
|
1095 | { |
1128 | { |
1096 | pl->update_stats (); |
1129 | pl->apply (pl->contr->combat_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1130 | pl->contr->combat_ob = 0; |
|
|
1131 | if (pl->contr->ranged_ob) pl->apply (pl->contr->ranged_ob); |
|
|
1132 | } |
1097 | |
1133 | |
|
|
1134 | if (expect_false (pl->contr->ranged_ob == this)) |
|
|
1135 | { |
|
|
1136 | pl->apply (pl->contr->ranged_ob, AP_UNAPPLY | AP_IGNORE_CURSE); |
|
|
1137 | pl->contr->ranged_ob = 0; |
|
|
1138 | if (pl->contr->combat_ob) pl->apply (pl->contr->combat_ob); |
|
|
1139 | } |
|
|
1140 | |
|
|
1141 | pl->contr->queue_stats_update (); |
|
|
1142 | |
1098 | if (glow_radius && pl->is_on_map ()) |
1143 | if (expect_false (glow_radius) && pl->is_on_map ()) |
1099 | update_all_los (pl->map, pl->x, pl->y); |
1144 | update_all_los (pl->map, pl->x, pl->y); |
1100 | } |
1145 | } |
1101 | } |
1146 | } |
1102 | else if (map) |
1147 | else if (map) |
1103 | { |
1148 | { |
1104 | map->dirty = true; |
1149 | map->dirty = true; |
1105 | mapspace &ms = this->ms (); |
1150 | mapspace &ms = this->ms (); |
… | |
… | |
1123 | else if (pl->container_ () == this) |
1168 | else if (pl->container_ () == this) |
1124 | { |
1169 | { |
1125 | // removing a container should close it |
1170 | // removing a container should close it |
1126 | close_container (); |
1171 | close_container (); |
1127 | } |
1172 | } |
1128 | |
1173 | else |
1129 | esrv_del_item (pl->contr, count); |
1174 | esrv_del_item (pl->contr, count); |
1130 | } |
1175 | } |
1131 | |
1176 | |
1132 | /* link the object above us */ |
1177 | /* link the object above us */ |
1133 | // re-link, make sure compiler can easily use cmove |
1178 | // re-link, make sure compiler can easily use cmove |
1134 | *(above ? &above->below : &ms.top) = below; |
1179 | *(above ? &above->below : &ms.top) = below; |
… | |
… | |
1136 | |
1181 | |
1137 | above = 0; |
1182 | above = 0; |
1138 | below = 0; |
1183 | below = 0; |
1139 | |
1184 | |
1140 | ms.invalidate (); |
1185 | ms.invalidate (); |
1141 | |
|
|
1142 | if (map->in_memory == MAP_SAVING) |
|
|
1143 | return; |
|
|
1144 | |
1186 | |
1145 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1187 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1146 | |
1188 | |
1147 | if (object *pl = ms.player ()) |
1189 | if (object *pl = ms.player ()) |
1148 | { |
1190 | { |
… | |
… | |
1225 | |
1267 | |
1226 | object *prev = this; |
1268 | object *prev = this; |
1227 | |
1269 | |
1228 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1270 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
1229 | { |
1271 | { |
1230 | object *op = arch_to_object (at); |
1272 | object *op = at->instance (); |
1231 | |
1273 | |
1232 | op->name = name; |
1274 | op->name = name; |
1233 | op->name_pl = name_pl; |
1275 | op->name_pl = name_pl; |
1234 | op->title = title; |
1276 | op->title = title; |
1235 | |
1277 | |
… | |
… | |
1273 | * Passing 0 for flag gives proper default values, so flag really only needs |
1315 | * Passing 0 for flag gives proper default values, so flag really only needs |
1274 | * to be set if special handling is needed. |
1316 | * to be set if special handling is needed. |
1275 | * |
1317 | * |
1276 | * Return value: |
1318 | * Return value: |
1277 | * new object if 'op' was merged with other object |
1319 | * new object if 'op' was merged with other object |
1278 | * NULL if 'op' was destroyed |
1320 | * NULL if there was an error (destroyed, blocked etc.) |
1279 | * just 'op' otherwise |
1321 | * just 'op' otherwise |
1280 | */ |
1322 | */ |
1281 | object * |
1323 | object * |
1282 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1324 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1283 | { |
1325 | { |
1284 | op->remove (); |
1326 | op->remove (); |
1285 | |
1327 | |
1286 | if (m == &freed_map)//D TODO: remove soon |
1328 | if (m == &freed_map)//D TODO: remove soon |
1287 | {//D |
1329 | {//D |
1288 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
1330 | LOG (llevError | logBacktrace, "tries to insert object on freed objects map: %s", op->debug_desc ());//D |
1289 | }//D |
1331 | }//D |
1290 | |
1332 | |
1291 | /* Ideally, the caller figures this out. However, it complicates a lot |
1333 | /* Ideally, the caller figures this out. However, it complicates a lot |
1292 | * of areas of callers (eg, anything that uses find_free_spot would now |
1334 | * of areas of callers (eg, anything that uses find_free_spot would now |
1293 | * need extra work |
1335 | * need extra work |
… | |
… | |
1320 | // from here :/ |
1362 | // from here :/ |
1321 | op->nrof += tmp->nrof; |
1363 | op->nrof += tmp->nrof; |
1322 | tmp->destroy (); |
1364 | tmp->destroy (); |
1323 | } |
1365 | } |
1324 | |
1366 | |
1325 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1367 | op->clr_flag (FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1326 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1368 | op->clr_flag (FLAG_INV_LOCKED); |
1327 | |
1369 | |
1328 | if (!QUERY_FLAG (op, FLAG_ALIVE)) |
1370 | if (!op->flag [FLAG_ALIVE]) |
1329 | CLEAR_FLAG (op, FLAG_NO_STEAL); |
1371 | op->clr_flag (FLAG_NO_STEAL); |
1330 | |
1372 | |
1331 | if (flag & INS_BELOW_ORIGINATOR) |
1373 | if (flag & INS_BELOW_ORIGINATOR) |
1332 | { |
1374 | { |
1333 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1375 | if (originator->map != op->map || originator->x != op->x || originator->y != op->y) |
1334 | { |
1376 | { |
… | |
… | |
1362 | * We've already dealt with merging if appropriate. |
1404 | * We've already dealt with merging if appropriate. |
1363 | * Generally, we want to put the new object on top. But if |
1405 | * Generally, we want to put the new object on top. But if |
1364 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1406 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1365 | * floor, we want to insert above that and no further. |
1407 | * floor, we want to insert above that and no further. |
1366 | * Also, if there are spell objects on this space, we stop processing |
1408 | * Also, if there are spell objects on this space, we stop processing |
1367 | * once we get to them. This reduces the need to traverse over all of |
1409 | * once we get to them. This reduces the need to traverse over all of |
1368 | * them when adding another one - this saves quite a bit of cpu time |
1410 | * them when adding another one - this saves quite a bit of cpu time |
1369 | * when lots of spells are cast in one area. Currently, it is presumed |
1411 | * when lots of spells are cast in one area. Currently, it is presumed |
1370 | * that flying non pickable objects are spell objects. |
1412 | * that flying non pickable objects are spell objects. |
1371 | */ |
1413 | */ |
1372 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1414 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1373 | { |
1415 | { |
1374 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1416 | if (tmp->flag [FLAG_IS_FLOOR] || tmp->flag [FLAG_OVERLAY_FLOOR]) |
1375 | floor = tmp; |
1417 | floor = tmp; |
1376 | |
1418 | |
1377 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1419 | if (tmp->flag [FLAG_NO_PICK] && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !tmp->flag [FLAG_IS_FLOOR]) |
1378 | { |
1420 | { |
1379 | /* We insert above top, so we want this object below this */ |
1421 | /* We insert above top, so we want this object below this */ |
1380 | top = tmp->below; |
1422 | top = tmp->below; |
1381 | break; |
1423 | break; |
1382 | } |
1424 | } |
… | |
… | |
1400 | && (op->face && !faces [op->face].visibility)) |
1442 | && (op->face && !faces [op->face].visibility)) |
1401 | { |
1443 | { |
1402 | object *last; |
1444 | object *last; |
1403 | |
1445 | |
1404 | for (last = top; last != floor; last = last->below) |
1446 | for (last = top; last != floor; last = last->below) |
1405 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1447 | if (last->flag [FLAG_BLOCKSVIEW] && (last->type != EXIT)) |
1406 | break; |
1448 | break; |
1407 | |
1449 | |
1408 | /* Check to see if we found the object that blocks view, |
1450 | /* Check to see if we found the object that blocks view, |
1409 | * and make sure we have a below pointer for it so that |
1451 | * and make sure we have a below pointer for it so that |
1410 | * we can get inserted below this one, which requires we |
1452 | * we can get inserted below this one, which requires we |
… | |
… | |
1483 | */ |
1525 | */ |
1484 | |
1526 | |
1485 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1527 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1486 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1528 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1487 | { |
1529 | { |
1488 | if (check_move_on (op, originator)) |
1530 | if (check_move_on (op, originator, flag)) |
1489 | return 0; |
1531 | return 0; |
1490 | |
1532 | |
1491 | /* If we are a multi part object, lets work our way through the check |
1533 | /* If we are a multi part object, let's work our way through the check |
1492 | * walk on's. |
1534 | * walk on's. |
1493 | */ |
1535 | */ |
1494 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1536 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1495 | if (check_move_on (tmp, originator)) |
1537 | if (check_move_on (tmp, originator, flag)) |
1496 | return 0; |
1538 | return 0; |
1497 | } |
1539 | } |
1498 | |
1540 | |
1499 | return op; |
1541 | return op; |
1500 | } |
1542 | } |
1501 | |
1543 | |
1502 | /* this function inserts an object in the map, but if it |
1544 | /* this function inserts an object in the map, but if it |
1503 | * finds an object of its own type, it'll remove that one first. |
1545 | * finds an object of its own type, it'll remove that one first. |
1504 | * op is the object to insert it under: supplies x and the map. |
1546 | * op is the object to insert it under: supplies x and the map. |
1505 | */ |
1547 | */ |
1506 | void |
1548 | void |
1507 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1549 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1508 | { |
1550 | { |
… | |
… | |
1510 | |
1552 | |
1511 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1553 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1512 | if (tmp->arch->archname == archname) /* same archetype */ |
1554 | if (tmp->arch->archname == archname) /* same archetype */ |
1513 | tmp->destroy (); |
1555 | tmp->destroy (); |
1514 | |
1556 | |
1515 | object *tmp = arch_to_object (archetype::find (archname)); |
1557 | object *tmp = archetype::find (archname)->instance (); |
1516 | |
1558 | |
1517 | tmp->x = op->x; |
1559 | tmp->x = op->x; |
1518 | tmp->y = op->y; |
1560 | tmp->y = op->y; |
1519 | |
1561 | |
1520 | insert_ob_in_map (tmp, op->map, op, 0); |
1562 | insert_ob_in_map (tmp, op->map, op, 0); |
… | |
… | |
1525 | { |
1567 | { |
1526 | if (where->env) |
1568 | if (where->env) |
1527 | return where->env->insert (this); |
1569 | return where->env->insert (this); |
1528 | else |
1570 | else |
1529 | return where->map->insert (this, where->x, where->y, originator, flags); |
1571 | return where->map->insert (this, where->x, where->y, originator, flags); |
|
|
1572 | } |
|
|
1573 | |
|
|
1574 | // check whether we can put this into the map, respect max_volume, max_items |
|
|
1575 | bool |
|
|
1576 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
|
|
1577 | { |
|
|
1578 | mapspace &ms = m->at (x, y); |
|
|
1579 | |
|
|
1580 | int items = ms.items (); |
|
|
1581 | |
|
|
1582 | if (!items // testing !items ensures we can drop at least one item |
|
|
1583 | || (items < m->max_items |
|
|
1584 | && ms.volume () < m->max_volume)) |
|
|
1585 | return true; |
|
|
1586 | |
|
|
1587 | if (originator) |
|
|
1588 | originator->failmsgf ( |
|
|
1589 | "No matter how hard you try, you just cannot put the %s here! H<Try to remove some items from the floor first.>", |
|
|
1590 | query_name () |
|
|
1591 | ); |
|
|
1592 | |
|
|
1593 | return false; |
1530 | } |
1594 | } |
1531 | |
1595 | |
1532 | /* |
1596 | /* |
1533 | * decrease(object, number) decreases a specified number from |
1597 | * decrease(object, number) decreases a specified number from |
1534 | * the amount of an object. If the amount reaches 0, the object |
1598 | * the amount of an object. If the amount reaches 0, the object |
… | |
… | |
1544 | |
1608 | |
1545 | nr = min (nr, nrof); |
1609 | nr = min (nr, nrof); |
1546 | |
1610 | |
1547 | if (nrof > nr) |
1611 | if (nrof > nr) |
1548 | { |
1612 | { |
|
|
1613 | weight_t oweight = total_weight (); |
|
|
1614 | |
1549 | nrof -= nr; |
1615 | nrof -= nr; |
1550 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
|
|
1551 | |
1616 | |
1552 | if (object *pl = visible_to ()) |
1617 | if (object *pl = visible_to ()) |
1553 | esrv_update_item (UPD_NROF, pl, this); |
1618 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1619 | |
|
|
1620 | adjust_weight (env, oweight, total_weight ()); |
1554 | |
1621 | |
1555 | return true; |
1622 | return true; |
1556 | } |
1623 | } |
1557 | else |
1624 | else |
1558 | { |
1625 | { |
… | |
… | |
1612 | /* |
1679 | /* |
1613 | * env->insert (op) |
1680 | * env->insert (op) |
1614 | * This function inserts the object op in the linked list |
1681 | * This function inserts the object op in the linked list |
1615 | * inside the object environment. |
1682 | * inside the object environment. |
1616 | * |
1683 | * |
1617 | * The function returns now pointer to inserted item, and return value can |
1684 | * The function returns now pointer to inserted item, and return value can |
1618 | * be != op, if items are merged. -Tero |
1685 | * be != op, if items are merged. -Tero |
1619 | */ |
1686 | */ |
1620 | object * |
1687 | object * |
1621 | object::insert (object *op) |
1688 | object::insert (object *op) |
1622 | { |
1689 | { |
… | |
… | |
1633 | if (op->nrof) |
1700 | if (op->nrof) |
1634 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1701 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1635 | if (object::can_merge (tmp, op)) |
1702 | if (object::can_merge (tmp, op)) |
1636 | { |
1703 | { |
1637 | /* return the original object and remove inserted object |
1704 | /* return the original object and remove inserted object |
1638 | (client needs the original object) */ |
1705 | (client prefers the original object) */ |
|
|
1706 | |
|
|
1707 | // carrying must be 0 for mergable objects |
|
|
1708 | weight_t oweight = weight_t (tmp->weight) * tmp->nrof; |
|
|
1709 | |
1639 | tmp->nrof += op->nrof; |
1710 | tmp->nrof += op->nrof; |
1640 | |
1711 | |
1641 | if (object *pl = tmp->visible_to ()) |
1712 | if (object *pl = tmp->visible_to ()) |
1642 | esrv_update_item (UPD_NROF, pl, tmp); |
1713 | esrv_update_item (UPD_NROF, pl, tmp); |
1643 | |
1714 | |
1644 | adjust_weight (this, op->total_weight ()); |
1715 | adjust_weight (this, oweight, weight_t (tmp->weight) * tmp->nrof); |
1645 | |
1716 | |
1646 | op->destroy (); |
1717 | op->destroy (); |
1647 | op = tmp; |
1718 | op = tmp; |
1648 | goto inserted; |
1719 | goto inserted; |
1649 | } |
1720 | } |
… | |
… | |
1665 | op->flag [FLAG_REMOVED] = 0; |
1736 | op->flag [FLAG_REMOVED] = 0; |
1666 | |
1737 | |
1667 | if (object *pl = op->visible_to ()) |
1738 | if (object *pl = op->visible_to ()) |
1668 | esrv_send_item (pl, op); |
1739 | esrv_send_item (pl, op); |
1669 | |
1740 | |
1670 | adjust_weight (this, op->total_weight ()); |
1741 | adjust_weight (this, 0, op->total_weight ()); |
1671 | |
1742 | |
1672 | inserted: |
1743 | inserted: |
1673 | /* reset the light list and los of the players on the map */ |
1744 | /* reset the light list and los of the players on the map */ |
1674 | if (op->glow_radius && is_on_map ()) |
1745 | if (op->glow_radius && is_on_map ()) |
1675 | { |
1746 | { |
1676 | update_stats (); |
1747 | update_stats (); |
1677 | update_all_los (map, x, y); |
1748 | update_all_los (map, x, y); |
1678 | } |
1749 | } |
1679 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1750 | else if (is_player ()) |
1680 | // if this is a player's inventory, update stats |
1751 | // if this is a player's inventory, update stats |
1681 | update_stats (); |
1752 | contr->queue_stats_update (); |
1682 | |
1753 | |
1683 | INVOKE_OBJECT (INSERT, this); |
1754 | INVOKE_OBJECT (INSERT, this); |
1684 | |
1755 | |
1685 | return op; |
1756 | return op; |
1686 | } |
1757 | } |
… | |
… | |
1704 | * MSW 2001-07-08: Check all objects on space, not just those below |
1775 | * MSW 2001-07-08: Check all objects on space, not just those below |
1705 | * object being inserted. insert_ob_in_map may not put new objects |
1776 | * object being inserted. insert_ob_in_map may not put new objects |
1706 | * on top. |
1777 | * on top. |
1707 | */ |
1778 | */ |
1708 | int |
1779 | int |
1709 | check_move_on (object *op, object *originator) |
1780 | check_move_on (object *op, object *originator, int flags) |
1710 | { |
1781 | { |
1711 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1782 | if (op->flag [FLAG_NO_APPLY]) |
1712 | return 0; |
1783 | return 0; |
1713 | |
1784 | |
1714 | object *tmp; |
1785 | object *tmp; |
1715 | maptile *m = op->map; |
1786 | maptile *m = op->map; |
1716 | int x = op->x, y = op->y; |
1787 | int x = op->x, y = op->y; |
… | |
… | |
1738 | */ |
1809 | */ |
1739 | if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1810 | if ((op->move_type & ~move_on & ~move_block) != 0 && (op->move_type & ~move_slow & ~move_block) != 0) |
1740 | return 0; |
1811 | return 0; |
1741 | |
1812 | |
1742 | /* The objects have to be checked from top to bottom. |
1813 | /* The objects have to be checked from top to bottom. |
1743 | * Hence, we first go to the top: |
1814 | * Hence, we first go to the top: |
1744 | */ |
1815 | */ |
1745 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1816 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1746 | { |
1817 | { |
1747 | next = tmp->below; |
1818 | next = tmp->below; |
1748 | |
1819 | |
… | |
… | |
1753 | * Second check makes sure that the movement types not being slowed |
1824 | * Second check makes sure that the movement types not being slowed |
1754 | * (~slow_move) is not blocked on this space - just because the |
1825 | * (~slow_move) is not blocked on this space - just because the |
1755 | * space doesn't slow down swimming (for example), if you can't actually |
1826 | * space doesn't slow down swimming (for example), if you can't actually |
1756 | * swim on that space, can't use it to avoid the penalty. |
1827 | * swim on that space, can't use it to avoid the penalty. |
1757 | */ |
1828 | */ |
1758 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1829 | if (!op->flag [FLAG_WIZPASS]) |
1759 | { |
1830 | { |
1760 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1831 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1761 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1832 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1762 | { |
1833 | { |
1763 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1834 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
… | |
… | |
1773 | |
1844 | |
1774 | /* Basically same logic as above, except now for actual apply. */ |
1845 | /* Basically same logic as above, except now for actual apply. */ |
1775 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1846 | if ((!op->move_type && tmp->move_on & MOVE_WALK) || |
1776 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1847 | ((op->move_type & tmp->move_on) && (op->move_type & ~tmp->move_on & ~tmp->move_block) == 0)) |
1777 | { |
1848 | { |
|
|
1849 | if ((flags & INS_NO_AUTO_EXIT) |
|
|
1850 | && (tmp->type == EXIT || tmp->type == TELEPORTER |
|
|
1851 | || tmp->type == HOLE || tmp->type == TRAPDOOR)) //TODO: temporary, fix exits instead |
|
|
1852 | continue; |
|
|
1853 | |
1778 | move_apply (tmp, op, originator); |
1854 | move_apply (tmp, op, originator); |
1779 | |
1855 | |
1780 | if (op->destroyed ()) |
1856 | if (op->destroyed ()) |
1781 | return 1; |
1857 | return 1; |
1782 | |
1858 | |
… | |
… | |
1894 | void |
1970 | void |
1895 | flag_inv (object *op, int flag) |
1971 | flag_inv (object *op, int flag) |
1896 | { |
1972 | { |
1897 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1973 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1898 | { |
1974 | { |
1899 | SET_FLAG (tmp, flag); |
1975 | tmp->set_flag (flag); |
1900 | flag_inv (tmp, flag); |
1976 | flag_inv (tmp, flag); |
1901 | } |
1977 | } |
1902 | } |
1978 | } |
1903 | |
1979 | |
1904 | /* |
1980 | /* |
… | |
… | |
1907 | void |
1983 | void |
1908 | unflag_inv (object *op, int flag) |
1984 | unflag_inv (object *op, int flag) |
1909 | { |
1985 | { |
1910 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1986 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1911 | { |
1987 | { |
1912 | CLEAR_FLAG (tmp, flag); |
1988 | tmp->clr_flag (flag); |
1913 | unflag_inv (tmp, flag); |
1989 | unflag_inv (tmp, flag); |
1914 | } |
1990 | } |
1915 | } |
1991 | } |
1916 | |
1992 | |
1917 | /* |
1993 | /* |
… | |
… | |
1927 | * inform the caller. However, insert_ob_in_map will update as |
2003 | * inform the caller. However, insert_ob_in_map will update as |
1928 | * necessary, so the caller shouldn't need to do any special work. |
2004 | * necessary, so the caller shouldn't need to do any special work. |
1929 | * Note - updated to take an object instead of archetype - this is necessary |
2005 | * Note - updated to take an object instead of archetype - this is necessary |
1930 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2006 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1931 | * to know if the space in question will block the object. We can't use |
2007 | * to know if the space in question will block the object. We can't use |
1932 | * the archetype because that isn't correct if the monster has been |
2008 | * the archetype because that isn't correct if the monster has been |
1933 | * customized, changed states, etc. |
2009 | * customized, changed states, etc. |
1934 | */ |
2010 | */ |
1935 | int |
2011 | int |
1936 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2012 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1937 | { |
2013 | { |
1938 | int altern[SIZEOFFREE]; |
2014 | int altern[SIZEOFFREE]; |
1939 | int index = 0, flag; |
2015 | int index = 0; |
1940 | |
2016 | |
1941 | for (int i = start; i < stop; i++) |
2017 | for (int i = start; i < stop; i++) |
1942 | { |
2018 | { |
1943 | mapxy pos (m, x, y); pos.move (i); |
2019 | mapxy pos (m, x, y); pos.move (i); |
1944 | |
2020 | |
… | |
… | |
1960 | continue; |
2036 | continue; |
1961 | } |
2037 | } |
1962 | |
2038 | |
1963 | /* Basically, if we find a wall on a space, we cut down the search size. |
2039 | /* Basically, if we find a wall on a space, we cut down the search size. |
1964 | * In this way, we won't return spaces that are on another side of a wall. |
2040 | * In this way, we won't return spaces that are on another side of a wall. |
1965 | * This mostly work, but it cuts down the search size in all directions - |
2041 | * This mostly work, but it cuts down the search size in all directions - |
1966 | * if the space being examined only has a wall to the north and empty |
2042 | * if the space being examined only has a wall to the north and empty |
1967 | * spaces in all the other directions, this will reduce the search space |
2043 | * spaces in all the other directions, this will reduce the search space |
1968 | * to only the spaces immediately surrounding the target area, and |
2044 | * to only the spaces immediately surrounding the target area, and |
1969 | * won't look 2 spaces south of the target space. |
2045 | * won't look 2 spaces south of the target space. |
1970 | */ |
2046 | */ |
… | |
… | |
2000 | */ |
2076 | */ |
2001 | int |
2077 | int |
2002 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2078 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2003 | { |
2079 | { |
2004 | for (int i = 0; i < SIZEOFFREE; i++) |
2080 | for (int i = 0; i < SIZEOFFREE; i++) |
2005 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2081 | if (!ob->blocked (m, x + DIRX (i), y + DIRY (i))) |
2006 | return i; |
2082 | return i; |
2007 | |
2083 | |
2008 | return -1; |
2084 | return -1; |
2009 | } |
2085 | } |
2010 | |
2086 | |
… | |
… | |
2021 | |
2097 | |
2022 | while (--end) |
2098 | while (--end) |
2023 | swap (arr [end], arr [rndm (end + 1)]); |
2099 | swap (arr [end], arr [rndm (end + 1)]); |
2024 | } |
2100 | } |
2025 | |
2101 | |
2026 | /* new function to make monster searching more efficient, and effective! |
2102 | /* new function to make monster searching more efficient, and effective! |
2027 | * This basically returns a randomized array (in the passed pointer) of |
2103 | * This basically returns a randomized array (in the passed pointer) of |
2028 | * the spaces to find monsters. In this way, it won't always look for |
2104 | * the spaces to find monsters. In this way, it won't always look for |
2029 | * monsters to the north first. However, the size of the array passed |
2105 | * monsters to the north first. However, the size of the array passed |
2030 | * covers all the spaces, so within that size, all the spaces within |
2106 | * covers all the spaces, so within that size, all the spaces within |
2031 | * the 3x3 area will be searched, just not in a predictable order. |
2107 | * the 3x3 area will be searched, just not in a predictable order. |
… | |
… | |
2056 | * there is capable of. |
2132 | * there is capable of. |
2057 | */ |
2133 | */ |
2058 | int |
2134 | int |
2059 | find_dir (maptile *m, int x, int y, object *exclude) |
2135 | find_dir (maptile *m, int x, int y, object *exclude) |
2060 | { |
2136 | { |
2061 | int max = SIZEOFFREE, mflags; |
2137 | int max = SIZEOFFREE; |
2062 | MoveType move_type; |
2138 | MoveType move_type; |
2063 | |
2139 | |
2064 | if (exclude && exclude->head_ () != exclude) |
2140 | if (exclude && exclude->head_ () != exclude) |
2065 | { |
2141 | { |
2066 | exclude = exclude->head; |
2142 | exclude = exclude->head; |
… | |
… | |
2107 | { |
2183 | { |
2108 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2184 | return (ob1->x - ob2->x) * (ob1->x - ob2->x) + (ob1->y - ob2->y) * (ob1->y - ob2->y); |
2109 | } |
2185 | } |
2110 | |
2186 | |
2111 | /* |
2187 | /* |
2112 | * find_dir_2(delta-x,delta-y) will return a direction in which |
2188 | * find_dir_2(delta-x,delta-y) will return a direction value |
2113 | * an object which has subtracted the x and y coordinates of another |
2189 | * for running into direct [dx, dy]. |
2114 | * object, needs to travel toward it. |
2190 | * (the opposite of crossfire's find_dir_2!) |
2115 | */ |
2191 | */ |
2116 | int |
2192 | int |
2117 | find_dir_2 (int x, int y) |
2193 | find_dir_2 (int x, int y) |
2118 | { |
2194 | { |
|
|
2195 | #if 1 // new algorithm |
|
|
2196 | // this works by putting x, y into 16 sectors, which |
|
|
2197 | // are not equal sized, but are a better approximation |
|
|
2198 | // then the old algorithm, and then using a mapping |
|
|
2199 | // table to map it into a direction value. |
|
|
2200 | // basically, it maps these comparisons to each bit |
|
|
2201 | // bit #3: x < 0 |
|
|
2202 | // bit #2: y < 0 |
|
|
2203 | // bit #1: x > y |
|
|
2204 | // bit #0: x > 2y |
|
|
2205 | |
|
|
2206 | static const uint8 dir[16] = { |
|
|
2207 | 4, 5, 4, 3, |
|
|
2208 | 2, 1, 2, 3, |
|
|
2209 | 6, 5, 6, 7, |
|
|
2210 | 8, 1, 8, 7, |
|
|
2211 | }; |
|
|
2212 | int sector = 0; |
|
|
2213 | |
|
|
2214 | // this is a bit ugly, but more likely to result in branchless code |
|
|
2215 | sector |= x < 0 ? 8 : 0; |
|
|
2216 | x = x < 0 ? -x : x; // abs |
|
|
2217 | |
|
|
2218 | sector |= y < 0 ? 4 : 0; |
|
|
2219 | y = y < 0 ? -y : y; // abs |
|
|
2220 | |
|
|
2221 | if (x > y) |
|
|
2222 | { |
|
|
2223 | sector |= 2; |
|
|
2224 | |
|
|
2225 | if (x > y * 2) |
|
|
2226 | sector |= 1; |
|
|
2227 | } |
|
|
2228 | else |
|
|
2229 | { |
|
|
2230 | if (y > x * 2) |
|
|
2231 | sector |= 1; |
|
|
2232 | else if (!y) |
|
|
2233 | return 0; // x == 0 here |
|
|
2234 | } |
|
|
2235 | |
|
|
2236 | return dir [sector]; |
|
|
2237 | #else // old algorithm |
2119 | int q; |
2238 | int q; |
2120 | |
2239 | |
2121 | if (y) |
2240 | if (y) |
2122 | q = x * 100 / y; |
2241 | q = 128 * x / y; |
2123 | else if (x) |
2242 | else if (x) |
2124 | q = -300 * x; |
2243 | q = -512 * x; // to make it > 309 |
2125 | else |
2244 | else |
2126 | return 0; |
2245 | return 0; |
2127 | |
2246 | |
2128 | if (y > 0) |
2247 | if (y > 0) |
2129 | { |
2248 | { |
2130 | if (q < -242) |
2249 | if (q < -309) return 7; |
|
|
2250 | if (q < -52) return 6; |
|
|
2251 | if (q < 52) return 5; |
|
|
2252 | if (q < 309) return 4; |
|
|
2253 | |
2131 | return 3; |
2254 | return 3; |
2132 | if (q < -41) |
2255 | } |
2133 | return 2; |
2256 | else |
2134 | if (q < 41) |
2257 | { |
2135 | return 1; |
2258 | if (q < -309) return 3; |
2136 | if (q < 242) |
2259 | if (q < -52) return 2; |
2137 | return 8; |
2260 | if (q < 52) return 1; |
|
|
2261 | if (q < 309) return 8; |
|
|
2262 | |
2138 | return 7; |
2263 | return 7; |
2139 | } |
2264 | } |
2140 | |
2265 | #endif |
2141 | if (q < -242) |
|
|
2142 | return 7; |
|
|
2143 | if (q < -41) |
|
|
2144 | return 6; |
|
|
2145 | if (q < 41) |
|
|
2146 | return 5; |
|
|
2147 | if (q < 242) |
|
|
2148 | return 4; |
|
|
2149 | |
|
|
2150 | return 3; |
|
|
2151 | } |
2266 | } |
2152 | |
2267 | |
2153 | /* |
2268 | /* |
2154 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2269 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2155 | * between two directions (which are expected to be absolute (see absdir()) |
2270 | * between two directions (which are expected to be absolute (see absdir()) |
2156 | */ |
2271 | */ |
2157 | int |
2272 | int |
2158 | dirdiff (int dir1, int dir2) |
2273 | dirdiff (int dir1, int dir2) |
2159 | { |
2274 | { |
2160 | int d; |
|
|
2161 | |
|
|
2162 | d = abs (dir1 - dir2); |
2275 | int d = abs (dir1 - dir2); |
2163 | if (d > 4) |
|
|
2164 | d = 8 - d; |
|
|
2165 | |
2276 | |
2166 | return d; |
2277 | return d > 4 ? 8 - d : d; |
2167 | } |
2278 | } |
2168 | |
2279 | |
2169 | /* peterm: |
2280 | /* peterm: |
2170 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2281 | * do LOS stuff for ball lightning. Go after the closest VISIBLE monster. |
2171 | * Basically, this is a table of directions, and what directions |
2282 | * Basically, this is a table of directions, and what directions |
… | |
… | |
2173 | * This basically means that if direction is 15, then it could either go |
2284 | * This basically means that if direction is 15, then it could either go |
2174 | * direction 4, 14, or 16 to get back to where we are. |
2285 | * direction 4, 14, or 16 to get back to where we are. |
2175 | * Moved from spell_util.c to object.c with the other related direction |
2286 | * Moved from spell_util.c to object.c with the other related direction |
2176 | * functions. |
2287 | * functions. |
2177 | */ |
2288 | */ |
2178 | const int reduction_dir[SIZEOFFREE][3] = { |
2289 | static const int reduction_dir[SIZEOFFREE][3] = { |
2179 | {0, 0, 0}, /* 0 */ |
2290 | {0, 0, 0}, /* 0 */ |
2180 | {0, 0, 0}, /* 1 */ |
2291 | {0, 0, 0}, /* 1 */ |
2181 | {0, 0, 0}, /* 2 */ |
2292 | {0, 0, 0}, /* 2 */ |
2182 | {0, 0, 0}, /* 3 */ |
2293 | {0, 0, 0}, /* 3 */ |
2183 | {0, 0, 0}, /* 4 */ |
2294 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2240 | int mflags; |
2351 | int mflags; |
2241 | |
2352 | |
2242 | if (dir < 0) |
2353 | if (dir < 0) |
2243 | return 0; /* exit condition: invalid direction */ |
2354 | return 0; /* exit condition: invalid direction */ |
2244 | |
2355 | |
2245 | dx = x + freearr_x[dir]; |
2356 | dx = x + DIRX (dir); |
2246 | dy = y + freearr_y[dir]; |
2357 | dy = y + DIRY (dir); |
2247 | |
2358 | |
2248 | mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2359 | mflags = get_map_flags (m, &m, dx, dy, &dx, &dy); |
2249 | |
2360 | |
2250 | /* This functional arguably was incorrect before - it was |
2361 | /* This functional arguably was incorrect before - it was |
2251 | * checking for P_WALL - that was basically seeing if |
2362 | * checking for P_WALL - that was basically seeing if |
… | |
… | |
2277 | * Add a check so we can't pick up invisible objects (0.93.8) |
2388 | * Add a check so we can't pick up invisible objects (0.93.8) |
2278 | */ |
2389 | */ |
2279 | int |
2390 | int |
2280 | can_pick (const object *who, const object *item) |
2391 | can_pick (const object *who, const object *item) |
2281 | { |
2392 | { |
2282 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2393 | return /*who->flag [FLAG_WIZ]|| */ |
2283 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2394 | (item->weight > 0 && !item->flag [FLAG_NO_PICK] && |
2284 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2395 | !item->flag [FLAG_ALIVE] && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2285 | } |
2396 | } |
|
|
2397 | |
|
|
2398 | //-GPL |
2286 | |
2399 | |
2287 | /* |
2400 | /* |
2288 | * create clone from object to another |
2401 | * create clone from object to another |
2289 | */ |
2402 | */ |
2290 | object * |
2403 | object * |
… | |
… | |
2321 | return tmp; |
2434 | return tmp; |
2322 | |
2435 | |
2323 | return 0; |
2436 | return 0; |
2324 | } |
2437 | } |
2325 | |
2438 | |
|
|
2439 | /* Zero the key_values on op, decrementing the shared-string |
|
|
2440 | * refcounts and freeing the links. |
|
|
2441 | */ |
|
|
2442 | void |
|
|
2443 | key_values::clear () |
|
|
2444 | { |
|
|
2445 | for (key_value *kvp = first; kvp; ) |
|
|
2446 | { |
|
|
2447 | key_value *next = kvp->next; |
|
|
2448 | delete kvp; |
|
|
2449 | kvp = next; |
|
|
2450 | } |
|
|
2451 | |
|
|
2452 | first = 0; |
|
|
2453 | } |
|
|
2454 | |
2326 | shstr_tmp |
2455 | shstr_tmp |
2327 | object::kv_get (shstr_tmp key) const |
2456 | key_values::get (shstr_tmp key) const |
2328 | { |
2457 | { |
2329 | for (key_value *kv = key_values; kv; kv = kv->next) |
2458 | for (key_value *kv = first; kv; kv = kv->next) |
2330 | if (kv->key == key) |
2459 | if (kv->key == key) |
2331 | return kv->value; |
2460 | return kv->value; |
2332 | |
2461 | |
2333 | return shstr (); |
2462 | return shstr (); |
2334 | } |
2463 | } |
2335 | |
2464 | |
2336 | void |
2465 | void |
|
|
2466 | key_values::add (shstr_tmp key, shstr_tmp value) |
|
|
2467 | { |
|
|
2468 | key_value *kv = new key_value; |
|
|
2469 | |
|
|
2470 | kv->next = first; |
|
|
2471 | kv->key = key; |
|
|
2472 | kv->value = value; |
|
|
2473 | |
|
|
2474 | first = kv; |
|
|
2475 | } |
|
|
2476 | |
|
|
2477 | void |
2337 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2478 | key_values::set (shstr_tmp key, shstr_tmp value) |
2338 | { |
2479 | { |
2339 | for (key_value *kv = key_values; kv; kv = kv->next) |
2480 | for (key_value *kv = first; kv; kv = kv->next) |
2340 | if (kv->key == key) |
2481 | if (kv->key == key) |
2341 | { |
2482 | { |
2342 | kv->value = value; |
2483 | kv->value = value; |
2343 | return; |
2484 | return; |
2344 | } |
2485 | } |
2345 | |
2486 | |
2346 | key_value *kv = new key_value; |
2487 | add (key, value); |
2347 | |
|
|
2348 | kv->next = key_values; |
|
|
2349 | kv->key = key; |
|
|
2350 | kv->value = value; |
|
|
2351 | |
|
|
2352 | key_values = kv; |
|
|
2353 | } |
2488 | } |
2354 | |
2489 | |
2355 | void |
2490 | void |
2356 | object::kv_del (shstr_tmp key) |
2491 | key_values::del (shstr_tmp key) |
2357 | { |
2492 | { |
2358 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
2493 | for (key_value **kvp = &first; *kvp; kvp = &(*kvp)->next) |
2359 | if ((*kvp)->key == key) |
2494 | if ((*kvp)->key == key) |
2360 | { |
2495 | { |
2361 | key_value *kv = *kvp; |
2496 | key_value *kv = *kvp; |
2362 | *kvp = (*kvp)->next; |
2497 | *kvp = (*kvp)->next; |
2363 | delete kv; |
2498 | delete kv; |
2364 | return; |
2499 | return; |
2365 | } |
2500 | } |
|
|
2501 | } |
|
|
2502 | |
|
|
2503 | void |
|
|
2504 | key_values::reverse () |
|
|
2505 | { |
|
|
2506 | key_value *prev = 0; |
|
|
2507 | key_value *head = first; |
|
|
2508 | |
|
|
2509 | while (head) |
|
|
2510 | { |
|
|
2511 | key_value *node = head; |
|
|
2512 | head = head->next; |
|
|
2513 | node->next = prev; |
|
|
2514 | prev = node; |
|
|
2515 | } |
|
|
2516 | |
|
|
2517 | first = prev; |
|
|
2518 | } |
|
|
2519 | |
|
|
2520 | key_values & |
|
|
2521 | key_values::operator =(const key_values &kv) |
|
|
2522 | { |
|
|
2523 | clear (); |
|
|
2524 | |
|
|
2525 | for (key_value *kvp = kv.first; kvp; kvp = kvp->next) |
|
|
2526 | add (kvp->key, kvp->value); |
|
|
2527 | |
|
|
2528 | reverse (); |
2366 | } |
2529 | } |
2367 | |
2530 | |
2368 | object::depth_iterator::depth_iterator (object *container) |
2531 | object::depth_iterator::depth_iterator (object *container) |
2369 | : iterator_base (container) |
2532 | : iterator_base (container) |
2370 | { |
2533 | { |
… | |
… | |
2454 | { |
2617 | { |
2455 | return map ? map->region (x, y) |
2618 | return map ? map->region (x, y) |
2456 | : region::default_region (); |
2619 | : region::default_region (); |
2457 | } |
2620 | } |
2458 | |
2621 | |
2459 | const materialtype_t * |
2622 | //+GPL |
2460 | object::dominant_material () const |
|
|
2461 | { |
|
|
2462 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2463 | return mt; |
|
|
2464 | |
|
|
2465 | return name_to_material (shstr_unknown); |
|
|
2466 | } |
|
|
2467 | |
2623 | |
2468 | void |
2624 | void |
2469 | object::open_container (object *new_container) |
2625 | object::open_container (object *new_container) |
2470 | { |
2626 | { |
2471 | if (container == new_container) |
2627 | if (container == new_container) |
… | |
… | |
2506 | // TODO: this does not seem to serve any purpose anymore? |
2662 | // TODO: this does not seem to serve any purpose anymore? |
2507 | #if 0 |
2663 | #if 0 |
2508 | // insert the "Close Container" object. |
2664 | // insert the "Close Container" object. |
2509 | if (archetype *closer = new_container->other_arch) |
2665 | if (archetype *closer = new_container->other_arch) |
2510 | { |
2666 | { |
2511 | object *closer = arch_to_object (new_container->other_arch); |
2667 | object *closer = new_container->other_arch->instance (); |
2512 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2668 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2513 | new_container->insert (closer); |
2669 | new_container->insert (closer); |
2514 | } |
2670 | } |
2515 | #endif |
2671 | #endif |
2516 | |
2672 | |
… | |
… | |
2529 | } |
2685 | } |
2530 | // else if (!old_container->env && contr && contr->ns) |
2686 | // else if (!old_container->env && contr && contr->ns) |
2531 | // contr->ns->floorbox_reset (); |
2687 | // contr->ns->floorbox_reset (); |
2532 | } |
2688 | } |
2533 | |
2689 | |
|
|
2690 | //-GPL |
|
|
2691 | |
|
|
2692 | // prefetch some flat area around the player |
|
|
2693 | static void |
|
|
2694 | prefetch_surrounding_area (object *op, maptile *map, int range) |
|
|
2695 | { |
|
|
2696 | for (maprect *rect = map->split_to_tiles (mapwalk_buf, |
|
|
2697 | op->x - range , op->y - range , |
|
|
2698 | op->x + range + 1, op->y + range + 1); |
|
|
2699 | rect->m; |
|
|
2700 | ++rect) |
|
|
2701 | { |
|
|
2702 | rect->m->touch (); |
|
|
2703 | rect->m->activate (); |
|
|
2704 | } |
|
|
2705 | } |
|
|
2706 | |
|
|
2707 | // prefetch a generous area around the player, also up and down |
|
|
2708 | void |
|
|
2709 | object::prefetch_surrounding_maps () |
|
|
2710 | { |
|
|
2711 | prefetch_surrounding_area (this, map, 40); |
|
|
2712 | |
|
|
2713 | if (maptile *m = map->tile_available (TILE_DOWN)) |
|
|
2714 | prefetch_surrounding_area (this, m, 20); |
|
|
2715 | |
|
|
2716 | if (maptile *m = map->tile_available (TILE_UP)) |
|
|
2717 | prefetch_surrounding_area (this, m, 20); |
|
|
2718 | } |
|
|
2719 | |
|
|
2720 | //+GPL |
|
|
2721 | |
2534 | object * |
2722 | object * |
2535 | object::force_find (shstr_tmp name) |
2723 | object::force_find (shstr_tmp name) |
2536 | { |
2724 | { |
2537 | /* cycle through his inventory to look for the MARK we want to |
2725 | /* cycle through his inventory to look for the MARK we want to |
2538 | * place |
2726 | * place |
2539 | */ |
2727 | */ |
2540 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2728 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2541 | if (tmp->type == FORCE && tmp->slaying == name) |
2729 | if (tmp->type == FORCE && tmp->slaying == name) |
2542 | return splay (tmp); |
2730 | return splay (tmp); |
2543 | |
2731 | |
2544 | return 0; |
2732 | return 0; |
2545 | } |
2733 | } |
2546 | |
2734 | |
2547 | //-GPL |
|
|
2548 | |
|
|
2549 | void |
2735 | void |
2550 | object::force_set_timer (int duration) |
2736 | object::force_set_timer (int duration) |
2551 | { |
2737 | { |
2552 | this->duration = 1; |
2738 | this->duration = 1; |
2553 | this->speed_left = -1.f; |
2739 | this->speed_left = -1.f; |
… | |
… | |
2559 | object::force_add (shstr_tmp name, int duration) |
2745 | object::force_add (shstr_tmp name, int duration) |
2560 | { |
2746 | { |
2561 | if (object *force = force_find (name)) |
2747 | if (object *force = force_find (name)) |
2562 | force->destroy (); |
2748 | force->destroy (); |
2563 | |
2749 | |
2564 | object *force = get_archetype (FORCE_NAME); |
2750 | object *force = archetype::get (FORCE_NAME); |
2565 | |
2751 | |
2566 | force->slaying = name; |
2752 | force->slaying = name; |
2567 | force->force_set_timer (duration); |
2753 | force->force_set_timer (duration); |
2568 | force->flag [FLAG_APPLIED] = true; |
2754 | force->flag [FLAG_APPLIED] = true; |
2569 | |
2755 | |
… | |
… | |
2622 | |
2808 | |
2623 | insert (force); |
2809 | insert (force); |
2624 | } |
2810 | } |
2625 | } |
2811 | } |
2626 | |
2812 | |
|
|
2813 | void object::change_move_type (MoveType mt) |
|
|
2814 | { |
|
|
2815 | if (move_type == mt) |
|
|
2816 | return; |
|
|
2817 | |
|
|
2818 | if (is_on_map ()) |
|
|
2819 | { |
|
|
2820 | // we are on the map, so handle move_on/off effects |
|
|
2821 | remove (); |
|
|
2822 | move_type = mt; |
|
|
2823 | map->insert (this, x, y, this); |
|
|
2824 | } |
|
|
2825 | else |
|
|
2826 | move_type = mt; |
|
|
2827 | } |
|
|
2828 | |
|
|
2829 | /* object should be a player. |
|
|
2830 | * we return the object the player has marked with the 'mark' command |
|
|
2831 | * below. If no match is found (or object has changed), we return |
|
|
2832 | * NULL. We leave it up to the calling function to print messages if |
|
|
2833 | * nothing is found. |
|
|
2834 | */ |
|
|
2835 | object * |
|
|
2836 | object::mark () const |
|
|
2837 | { |
|
|
2838 | if (contr && contr->mark && contr->mark->env == this) |
|
|
2839 | return contr->mark; |
|
|
2840 | else |
|
|
2841 | return 0; |
|
|
2842 | } |
|
|
2843 | |
|
|
2844 | // put marked object first in the inventory |
|
|
2845 | // this is used by identify-like spells so players can influence |
|
|
2846 | // the order a bit. |
|
|
2847 | void |
|
|
2848 | object::splay_marked () |
|
|
2849 | { |
|
|
2850 | if (object *marked = mark ()) |
|
|
2851 | splay (marked); |
|
|
2852 | } |
|
|
2853 | |