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 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
25 | sub/add_weight will transcend the environment updating the carrying |
|
|
26 | variable. */ |
|
|
27 | #include <global.h> |
25 | #include <global.h> |
28 | #include <stdio.h> |
26 | #include <stdio.h> |
29 | #include <sys/types.h> |
27 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
28 | #include <sys/uio.h> |
31 | #include <object.h> |
29 | #include <object.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
30 | #include <sproto.h> |
34 | #include <loader.h> |
31 | #include <loader.h> |
35 | |
32 | |
36 | #include <bitset> |
33 | #include <bitset> |
37 | |
34 | |
38 | UUID UUID::cur; |
35 | UUID UUID::cur; |
|
|
36 | static uint64_t seq_next_save; |
39 | static const uint64 UUID_SKIP = 1<<19; |
37 | static const uint64 UUID_GAP = 1<<19; |
|
|
38 | uint32_t mapspace::smellcount = 10000; |
40 | |
39 | |
41 | objectvec objects; |
40 | objectvec objects; |
42 | activevec actives; |
41 | activevec actives; |
|
|
42 | |
|
|
43 | //+GPL |
43 | |
44 | |
44 | short freearr_x[SIZEOFFREE] = { |
45 | short freearr_x[SIZEOFFREE] = { |
45 | 0, |
46 | 0, |
46 | 0, 1, 1, 1, 0, -1, -1, -1, |
47 | 0, 1, 1, 1, 0, -1, -1, -1, |
47 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
48 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
… | |
… | |
51 | 0, |
52 | 0, |
52 | -1, -1, 0, 1, 1, 1, 0, -1, |
53 | -1, -1, 0, 1, 1, 1, 0, -1, |
53 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
54 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
54 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
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 |
55 | }; |
56 | }; |
56 | int maxfree[SIZEOFFREE] = { |
|
|
57 | 0, |
|
|
58 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
59 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
|
|
60 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
61 | }; |
|
|
62 | int freedir[SIZEOFFREE] = { |
57 | int freedir[SIZEOFFREE] = { |
63 | 0, |
58 | 0, |
64 | 1, 2, 3, 4, 5, 6, 7, 8, |
59 | 1, 2, 3, 4, 5, 6, 7, 8, |
65 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
60 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
66 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
61 | 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 | }; |
62 | }; |
68 | |
63 | |
|
|
64 | static int maxfree[SIZEOFFREE] = { |
|
|
65 | 0, |
|
|
66 | 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, |
|
|
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 |
|
|
69 | }; |
|
|
70 | |
69 | static void |
71 | static void |
70 | write_uuid (uval64 skip, bool sync) |
72 | write_uuid (uval64 skip, bool sync) |
71 | { |
73 | { |
72 | CALL_BEGIN (2); |
74 | CALL_BEGIN (2); |
73 | CALL_ARG_SV (newSVval64 (skip)); |
75 | CALL_ARG_SV (newSVval64 (skip)); |
… | |
… | |
81 | { |
83 | { |
82 | char filename[MAX_BUF]; |
84 | char filename[MAX_BUF]; |
83 | |
85 | |
84 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | sprintf (filename, "%s/uuid", settings.localdir); |
85 | |
87 | |
|
|
88 | seq_next_save = 0; |
|
|
89 | |
86 | FILE *fp; |
90 | FILE *fp; |
87 | |
91 | |
88 | if (!(fp = fopen (filename, "r"))) |
92 | if (!(fp = fopen (filename, "r"))) |
89 | { |
93 | { |
90 | if (errno == ENOENT) |
94 | if (errno == ENOENT) |
91 | { |
95 | { |
92 | LOG (llevInfo, "RESET uid to 1\n"); |
96 | LOG (llevInfo, "RESET uid to 1\n"); |
93 | UUID::cur.seq = 0; |
97 | UUID::cur.seq = 0; |
94 | write_uuid (UUID_SKIP, true); |
98 | write_uuid (UUID_GAP, true); |
95 | return; |
99 | return; |
96 | } |
100 | } |
97 | |
101 | |
98 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
102 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
99 | _exit (1); |
103 | _exit (1); |
… | |
… | |
109 | _exit (1); |
113 | _exit (1); |
110 | } |
114 | } |
111 | |
115 | |
112 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
116 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
113 | |
117 | |
114 | write_uuid (UUID_SKIP, true); |
118 | write_uuid (UUID_GAP, true); |
115 | fclose (fp); |
119 | fclose (fp); |
116 | } |
120 | } |
117 | |
121 | |
118 | UUID |
122 | UUID |
119 | UUID::gen () |
123 | UUID::gen () |
120 | { |
124 | { |
121 | UUID uid; |
125 | UUID uid; |
122 | |
126 | |
123 | uid.seq = ++cur.seq; |
127 | uid.seq = ++cur.seq; |
124 | |
128 | |
125 | if (expect_false (!(cur.seq & (UUID_SKIP - 1)))) |
129 | if (expect_false (cur.seq >= seq_next_save)) |
|
|
130 | { |
|
|
131 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
126 | write_uuid (UUID_SKIP, false); |
132 | write_uuid (UUID_GAP, false); |
|
|
133 | } |
|
|
134 | |
127 | |
135 | |
128 | return uid; |
136 | return uid; |
129 | } |
137 | } |
130 | |
138 | |
131 | void |
139 | void |
… | |
… | |
133 | { |
141 | { |
134 | read_uuid (); |
142 | read_uuid (); |
135 | } |
143 | } |
136 | |
144 | |
137 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
145 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
138 | static int |
146 | static bool |
139 | compare_ob_value_lists_one (const object *wants, const object *has) |
147 | compare_ob_value_lists_one (const object *wants, const object *has) |
140 | { |
148 | { |
141 | key_value *wants_field; |
|
|
142 | |
|
|
143 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
149 | /* n-squared behaviour (see kv_get), but I'm hoping both |
144 | * objects with lists are rare, and lists stay short. If not, use a |
150 | * objects with lists are rare, and lists stay short. If not, use a |
145 | * different structure or at least keep the lists sorted... |
151 | * different structure or at least keep the lists sorted... |
146 | */ |
152 | */ |
147 | |
153 | |
148 | /* For each field in wants, */ |
154 | /* For each field in wants, */ |
149 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
155 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
150 | { |
156 | if (has->kv_get (kv->key) != kv->value) |
151 | key_value *has_field; |
157 | return false; |
152 | |
|
|
153 | /* Look for a field in has with the same key. */ |
|
|
154 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
155 | |
|
|
156 | if (has_field == NULL) |
|
|
157 | { |
|
|
158 | /* No field with that name. */ |
|
|
159 | return FALSE; |
|
|
160 | } |
|
|
161 | |
|
|
162 | /* Found the matching field. */ |
|
|
163 | if (has_field->value != wants_field->value) |
|
|
164 | { |
|
|
165 | /* Values don't match, so this half of the comparison is false. */ |
|
|
166 | return FALSE; |
|
|
167 | } |
|
|
168 | |
|
|
169 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
170 | } |
|
|
171 | |
158 | |
172 | /* If we get here, every field in wants has a matching field in has. */ |
159 | /* If we get here, every field in wants has a matching field in has. */ |
173 | return TRUE; |
160 | return true; |
174 | } |
161 | } |
175 | |
162 | |
176 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
163 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
177 | static int |
164 | static bool |
178 | compare_ob_value_lists (const object *ob1, const object *ob2) |
165 | compare_ob_value_lists (const object *ob1, const object *ob2) |
179 | { |
166 | { |
180 | /* However, there may be fields in has which aren't partnered in wants, |
167 | /* However, there may be fields in has which aren't partnered in wants, |
181 | * so we need to run the comparison *twice*. :( |
168 | * so we need to run the comparison *twice*. :( |
182 | */ |
169 | */ |
183 | return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); |
170 | return compare_ob_value_lists_one (ob1, ob2) |
|
|
171 | && compare_ob_value_lists_one (ob2, ob1); |
184 | } |
172 | } |
185 | |
173 | |
186 | /* Function examines the 2 objects given to it, and returns true if |
174 | /* Function examines the 2 objects given to it, and returns true if |
187 | * they can be merged together. |
175 | * they can be merged together. |
188 | * |
176 | * |
… | |
… | |
203 | || ob1->speed != ob2->speed |
191 | || ob1->speed != ob2->speed |
204 | || ob1->value != ob2->value |
192 | || ob1->value != ob2->value |
205 | || ob1->name != ob2->name) |
193 | || ob1->name != ob2->name) |
206 | return 0; |
194 | return 0; |
207 | |
195 | |
208 | //TODO: this ain't working well, use nicer and correct overflow check |
|
|
209 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
196 | /* Do not merge objects if nrof would overflow, assume nrof |
210 | * value could not be stored in a sint32 (which unfortunately sometimes is |
197 | * is always 0 .. 2**31-1 */ |
211 | * used to store nrof). |
198 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
212 | */ |
|
|
213 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
|
|
214 | return 0; |
199 | return 0; |
215 | |
200 | |
216 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
201 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
217 | * This is to the comparison of the flags below will be OK. We |
202 | * This is to the comparison of the flags below will be OK. We |
218 | * just can't ignore the been applied or identified flags, as they |
203 | * just can't ignore the been applied or identified flags, as they |
219 | * are not equal - just if it has been identified, the been_applied |
204 | * are not equal - just if it has been identified, the been_applied |
220 | * flags lose any meaning. |
205 | * flags lose any meaning. |
221 | */ |
206 | */ |
222 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
207 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
223 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
208 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
224 | |
209 | |
225 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
210 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
226 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
211 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
227 | |
212 | |
228 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
213 | if (ob1->arch->archname != ob2->arch->archname |
229 | || ob1->arch != ob2->arch |
|
|
230 | || ob1->name != ob2->name |
214 | || ob1->name != ob2->name |
231 | || ob1->title != ob2->title |
215 | || ob1->title != ob2->title |
232 | || ob1->msg != ob2->msg |
216 | || ob1->msg != ob2->msg |
233 | || ob1->weight != ob2->weight |
217 | || ob1->weight != ob2->weight |
234 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
235 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
|
|
236 | || ob1->attacktype != ob2->attacktype |
218 | || ob1->attacktype != ob2->attacktype |
237 | || ob1->magic != ob2->magic |
219 | || ob1->magic != ob2->magic |
238 | || ob1->slaying != ob2->slaying |
220 | || ob1->slaying != ob2->slaying |
239 | || ob1->skill != ob2->skill |
221 | || ob1->skill != ob2->skill |
240 | || ob1->value != ob2->value |
222 | || ob1->value != ob2->value |
241 | || ob1->animation_id != ob2->animation_id |
223 | || ob1->animation_id != ob2->animation_id |
|
|
224 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
242 | || ob1->client_type != ob2->client_type |
225 | || ob1->client_type != ob2->client_type |
243 | || ob1->materialname != ob2->materialname |
226 | || ob1->materialname != ob2->materialname |
244 | || ob1->lore != ob2->lore |
227 | || ob1->lore != ob2->lore |
245 | || ob1->subtype != ob2->subtype |
228 | || ob1->subtype != ob2->subtype |
246 | || ob1->move_type != ob2->move_type |
229 | || ob1->move_type != ob2->move_type |
247 | || ob1->move_block != ob2->move_block |
230 | || ob1->move_block != ob2->move_block |
248 | || ob1->move_allow != ob2->move_allow |
231 | || ob1->move_allow != ob2->move_allow |
249 | || ob1->move_on != ob2->move_on |
232 | || ob1->move_on != ob2->move_on |
250 | || ob1->move_off != ob2->move_off |
233 | || ob1->move_off != ob2->move_off |
251 | || ob1->move_slow != ob2->move_slow |
234 | || ob1->move_slow != ob2->move_slow |
252 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
235 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
236 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
237 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
253 | return 0; |
238 | return 0; |
254 | |
239 | |
|
|
240 | if ((ob1->flag ^ ob2->flag) |
|
|
241 | .reset (FLAG_INV_LOCKED) |
|
|
242 | .reset (FLAG_REMOVED) |
|
|
243 | .any ()) |
|
|
244 | return 0; |
|
|
245 | |
255 | /* This is really a spellbook check - really, we should |
246 | /* This is really a spellbook check - we should in general |
256 | * check all objects in the inventory. |
247 | * not merge objects with real inventories, as splitting them |
|
|
248 | * is hard. |
257 | */ |
249 | */ |
258 | if (ob1->inv || ob2->inv) |
250 | if (ob1->inv || ob2->inv) |
259 | { |
251 | { |
260 | if (!(ob1->inv && ob2->inv)) |
252 | if (!(ob1->inv && ob2->inv)) |
261 | return 0; /* inventories differ in length */ |
253 | return 0; /* inventories differ in length */ |
262 | |
254 | |
263 | if (ob1->inv->below || ob2->inv->below) |
255 | if (ob1->inv->below || ob2->inv->below) |
264 | return 0; /* more than one object in inv */ |
256 | return 0; /* more than one object in inv */ |
265 | |
257 | |
266 | if (!object::can_merge (ob1->inv, ob2->inv)) |
258 | if (!object::can_merge (ob1->inv, ob2->inv)) |
267 | return 0; /* inventory objexts differ */ |
259 | return 0; /* inventory objects differ */ |
268 | |
260 | |
269 | /* inventory ok - still need to check rest of this object to see |
261 | /* inventory ok - still need to check rest of this object to see |
270 | * if it is valid. |
262 | * if it is valid. |
271 | */ |
263 | */ |
272 | } |
264 | } |
… | |
… | |
291 | if (ob1->level != ob2->level) |
283 | if (ob1->level != ob2->level) |
292 | return 0; |
284 | return 0; |
293 | break; |
285 | break; |
294 | } |
286 | } |
295 | |
287 | |
296 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
288 | if (ob1->key_values || ob2->key_values) |
297 | { |
289 | { |
298 | /* At least one of these has key_values. */ |
290 | /* At least one of these has key_values. */ |
299 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
291 | if ((!ob1->key_values) != (!ob2->key_values)) |
300 | /* One has fields, but the other one doesn't. */ |
292 | return 0; /* One has fields, but the other one doesn't. */ |
301 | return 0; |
293 | |
302 | else if (!compare_ob_value_lists (ob1, ob2)) |
294 | if (!compare_ob_value_lists (ob1, ob2)) |
303 | return 0; |
295 | return 0; |
304 | } |
296 | } |
305 | |
297 | |
306 | if (ob1->self || ob2->self) |
298 | if (ob1->self || ob2->self) |
307 | { |
299 | { |
… | |
… | |
313 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
305 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
314 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
306 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
315 | |
307 | |
316 | if (k1 != k2) |
308 | if (k1 != k2) |
317 | return 0; |
309 | return 0; |
|
|
310 | |
318 | else if (k1 == 0) |
311 | if (k1 == 0) |
319 | return 1; |
312 | return 1; |
|
|
313 | |
320 | else if (!cfperl_can_merge (ob1, ob2)) |
314 | if (!cfperl_can_merge (ob1, ob2)) |
321 | return 0; |
315 | return 0; |
322 | } |
316 | } |
323 | } |
317 | } |
324 | |
318 | |
325 | /* Everything passes, must be OK. */ |
319 | /* Everything passes, must be OK. */ |
326 | return 1; |
320 | return 1; |
327 | } |
321 | } |
328 | |
322 | |
|
|
323 | // find player who can see this object |
|
|
324 | object * |
|
|
325 | object::visible_to () const |
|
|
326 | { |
|
|
327 | if (client_visible () && !flag [FLAG_REMOVED]) |
|
|
328 | { |
|
|
329 | // see if we are in a container of sorts |
|
|
330 | if (env) |
|
|
331 | { |
|
|
332 | // the player inventory itself is always visible |
|
|
333 | if (env->is_player ()) |
|
|
334 | return env; |
|
|
335 | |
|
|
336 | // else a player could have our env open |
|
|
337 | object *envest = env->outer_env_or_self (); |
|
|
338 | |
|
|
339 | // the player itself is always on a map, so we will find him here |
|
|
340 | // even if our inv is in a player. |
|
|
341 | if (envest->is_on_map ()) |
|
|
342 | if (object *pl = envest->ms ().player ()) |
|
|
343 | if (pl->container_ () == env) |
|
|
344 | return pl; |
|
|
345 | } |
|
|
346 | else |
|
|
347 | { |
|
|
348 | // maybe there is a player standing on the same mapspace |
|
|
349 | // this will catch the case where "this" is a player |
|
|
350 | if (object *pl = ms ().player ()) |
|
|
351 | if ((pl->contr->ns && !pl->container_ () && !pl->contr->ns->update_look) |
|
|
352 | || pl->container_ () == this) |
|
|
353 | return pl; |
|
|
354 | } |
|
|
355 | } |
|
|
356 | |
|
|
357 | return 0; |
|
|
358 | } |
|
|
359 | |
|
|
360 | // adjust weight per container type ("of holding") |
|
|
361 | static sint32 |
|
|
362 | weight_adjust_for (object *op, sint32 weight) |
|
|
363 | { |
|
|
364 | return op->type == CONTAINER |
|
|
365 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
366 | : weight; |
|
|
367 | } |
|
|
368 | |
329 | /* |
369 | /* |
|
|
370 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
371 | * and also updates how much the environment(s) is/are carrying. |
|
|
372 | */ |
|
|
373 | static void |
|
|
374 | adjust_weight (object *op, sint32 weight) |
|
|
375 | { |
|
|
376 | while (op) |
|
|
377 | { |
|
|
378 | // adjust by actual difference to account for rounding errors |
|
|
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 | |
|
|
383 | if (!weight) |
|
|
384 | return; |
|
|
385 | |
|
|
386 | op->carrying += weight; |
|
|
387 | |
|
|
388 | if (object *pl = op->visible_to ()) |
|
|
389 | if (pl != op) // player is handled lazily |
|
|
390 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
391 | |
|
|
392 | op = op->env; |
|
|
393 | } |
|
|
394 | } |
|
|
395 | |
|
|
396 | /* |
330 | * sum_weight() is a recursive function which calculates the weight |
397 | * this is a recursive function which calculates the weight |
331 | * an object is carrying. It goes through in figures out how much |
398 | * an object is carrying. It goes through op and figures out how much |
332 | * containers are carrying, and sums it up. |
399 | * containers are carrying, and sums it up. |
333 | */ |
400 | */ |
334 | long |
401 | void |
335 | sum_weight (object *op) |
402 | object::update_weight () |
336 | { |
403 | { |
337 | long sum; |
404 | sint32 sum = 0; |
338 | object *inv; |
|
|
339 | |
405 | |
340 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
406 | for (object *op = inv; op; op = op->below) |
341 | { |
407 | { |
342 | if (inv->inv) |
408 | if (op->inv) |
343 | sum_weight (inv); |
409 | op->update_weight (); |
344 | |
410 | |
345 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
411 | sum += op->total_weight (); |
|
|
412 | } |
|
|
413 | |
|
|
414 | sum = weight_adjust_for (this, sum); |
|
|
415 | |
|
|
416 | if (sum != carrying) |
346 | } |
417 | { |
347 | |
|
|
348 | if (op->type == CONTAINER && op->stats.Str) |
|
|
349 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
350 | |
|
|
351 | if (op->carrying != sum) |
|
|
352 | op->carrying = sum; |
418 | carrying = sum; |
353 | |
419 | |
354 | return sum; |
420 | if (object *pl = visible_to ()) |
|
|
421 | if (pl != this) // player is handled lazily |
|
|
422 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
423 | } |
355 | } |
424 | } |
356 | |
425 | |
357 | /** |
426 | /* |
358 | * Return the outermost environment object for a given object. |
427 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
359 | */ |
|
|
360 | |
|
|
361 | object * |
|
|
362 | object_get_env_recursive (object *op) |
|
|
363 | { |
|
|
364 | while (op->env != NULL) |
|
|
365 | op = op->env; |
|
|
366 | return op; |
|
|
367 | } |
|
|
368 | |
|
|
369 | /* |
|
|
370 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
371 | * Some error messages. |
|
|
372 | * The result of the dump is stored in the static global errmsg array. |
|
|
373 | */ |
428 | */ |
374 | char * |
429 | char * |
375 | dump_object (object *op) |
430 | dump_object (object *op) |
376 | { |
431 | { |
377 | if (!op) |
432 | if (!op) |
… | |
… | |
380 | object_freezer freezer; |
435 | object_freezer freezer; |
381 | op->write (freezer); |
436 | op->write (freezer); |
382 | return freezer.as_string (); |
437 | return freezer.as_string (); |
383 | } |
438 | } |
384 | |
439 | |
385 | /* |
440 | char * |
386 | * get_nearest_part(multi-object, object 2) returns the part of the |
441 | object::as_string () |
387 | * multi-object 1 which is closest to the second object. |
|
|
388 | * If it's not a multi-object, it is returned. |
|
|
389 | */ |
|
|
390 | object * |
|
|
391 | get_nearest_part (object *op, const object *pl) |
|
|
392 | { |
442 | { |
393 | object *tmp, *closest; |
443 | return dump_object (this); |
394 | int last_dist, i; |
|
|
395 | |
|
|
396 | if (op->more == NULL) |
|
|
397 | return op; |
|
|
398 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
|
|
399 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
400 | closest = tmp, last_dist = i; |
|
|
401 | return closest; |
|
|
402 | } |
444 | } |
403 | |
445 | |
404 | /* |
446 | /* |
405 | * Returns the object which has the count-variable equal to the argument. |
447 | * Returns the object which has the count-variable equal to the argument. |
|
|
448 | * VERRRY slow. |
406 | */ |
449 | */ |
407 | object * |
450 | object * |
408 | find_object (tag_t i) |
451 | find_object (tag_t i) |
409 | { |
452 | { |
410 | for_all_objects (op) |
453 | for_all_objects (op) |
… | |
… | |
421 | */ |
464 | */ |
422 | object * |
465 | object * |
423 | find_object_name (const char *str) |
466 | find_object_name (const char *str) |
424 | { |
467 | { |
425 | shstr_cmp str_ (str); |
468 | shstr_cmp str_ (str); |
426 | object *op; |
|
|
427 | |
469 | |
|
|
470 | if (str_) |
428 | for_all_objects (op) |
471 | for_all_objects (op) |
429 | if (op->name == str_) |
472 | if (op->name == str_) |
430 | break; |
473 | return op; |
431 | |
474 | |
432 | return op; |
475 | return 0; |
433 | } |
476 | } |
434 | |
477 | |
435 | /* |
478 | /* |
436 | * Sets the owner and sets the skill and exp pointers to owner's current |
479 | * Sets the owner and sets the skill and exp pointers to owner's current |
437 | * skill and experience objects. |
480 | * skill and experience objects. |
… | |
… | |
499 | update_stats (); |
542 | update_stats (); |
500 | |
543 | |
501 | new_draw_info_format (NDI_UNIQUE, 0, this, |
544 | new_draw_info_format (NDI_UNIQUE, 0, this, |
502 | "You try to balance all your items at once, " |
545 | "You try to balance all your items at once, " |
503 | "but the %s is just too much for your body. " |
546 | "but the %s is just too much for your body. " |
504 | "[You need to unapply some items first.]", &ob->name); |
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); |
505 | return false; |
549 | return false; |
506 | } |
550 | } |
507 | |
551 | |
508 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
552 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
509 | } |
553 | } |
… | |
… | |
535 | } |
579 | } |
536 | |
580 | |
537 | op->key_values = 0; |
581 | op->key_values = 0; |
538 | } |
582 | } |
539 | |
583 | |
540 | object & |
584 | /* |
541 | object::operator =(const object &src) |
585 | * copy_to first frees everything allocated by the dst object, |
|
|
586 | * and then copies the contents of itself into the second |
|
|
587 | * object, allocating what needs to be allocated. Basically, any |
|
|
588 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
589 | * if the first object is freed, the pointers in the new object |
|
|
590 | * will point at garbage. |
|
|
591 | */ |
|
|
592 | void |
|
|
593 | object::copy_to (object *dst) |
542 | { |
594 | { |
543 | bool is_freed = flag [FLAG_FREED]; |
595 | dst->remove (); |
544 | bool is_removed = flag [FLAG_REMOVED]; |
|
|
545 | |
|
|
546 | *(object_copy *)this = src; |
596 | *(object_copy *)dst = *this; |
547 | |
|
|
548 | flag [FLAG_FREED] = is_freed; |
|
|
549 | flag [FLAG_REMOVED] = is_removed; |
597 | dst->flag [FLAG_REMOVED] = true; |
550 | |
598 | |
551 | /* Copy over key_values, if any. */ |
599 | /* Copy over key_values, if any. */ |
552 | if (src.key_values) |
600 | if (key_values) |
553 | { |
601 | { |
554 | key_value *tail = 0; |
602 | key_value *tail = 0; |
555 | key_values = 0; |
603 | dst->key_values = 0; |
556 | |
604 | |
557 | for (key_value *i = src.key_values; i; i = i->next) |
605 | for (key_value *i = key_values; i; i = i->next) |
558 | { |
606 | { |
559 | key_value *new_link = new key_value; |
607 | key_value *new_link = new key_value; |
560 | |
608 | |
561 | new_link->next = 0; |
609 | new_link->next = 0; |
562 | new_link->key = i->key; |
610 | new_link->key = i->key; |
563 | new_link->value = i->value; |
611 | new_link->value = i->value; |
564 | |
612 | |
565 | /* Try and be clever here, too. */ |
613 | /* Try and be clever here, too. */ |
566 | if (!key_values) |
614 | if (!dst->key_values) |
567 | { |
615 | { |
568 | key_values = new_link; |
616 | dst->key_values = new_link; |
569 | tail = new_link; |
617 | tail = new_link; |
570 | } |
618 | } |
571 | else |
619 | else |
572 | { |
620 | { |
573 | tail->next = new_link; |
621 | tail->next = new_link; |
574 | tail = new_link; |
622 | tail = new_link; |
575 | } |
623 | } |
576 | } |
624 | } |
577 | } |
625 | } |
578 | } |
|
|
579 | |
|
|
580 | /* |
|
|
581 | * copy_to first frees everything allocated by the dst object, |
|
|
582 | * and then copies the contents of itself into the second |
|
|
583 | * object, allocating what needs to be allocated. Basically, any |
|
|
584 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
585 | * if the first object is freed, the pointers in the new object |
|
|
586 | * will point at garbage. |
|
|
587 | */ |
|
|
588 | void |
|
|
589 | object::copy_to (object *dst) |
|
|
590 | { |
|
|
591 | *dst = *this; |
|
|
592 | |
626 | |
593 | if (speed < 0) |
627 | if (speed < 0) |
594 | dst->speed_left -= rndm (); |
628 | dst->speed_left -= rndm (); |
595 | |
629 | |
596 | dst->set_speed (dst->speed); |
630 | dst->activate (); |
597 | } |
631 | } |
598 | |
632 | |
599 | void |
633 | void |
600 | object::instantiate () |
634 | object::instantiate () |
601 | { |
635 | { |
… | |
… | |
618 | object * |
652 | object * |
619 | object::clone () |
653 | object::clone () |
620 | { |
654 | { |
621 | object *neu = create (); |
655 | object *neu = create (); |
622 | copy_to (neu); |
656 | copy_to (neu); |
|
|
657 | neu->map = map; // not copied by copy_to |
623 | return neu; |
658 | return neu; |
624 | } |
659 | } |
625 | |
660 | |
626 | /* |
661 | /* |
627 | * If an object with the IS_TURNABLE() flag needs to be turned due |
662 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
678 | * UP_OBJ_FACE: only the objects face has changed. |
713 | * UP_OBJ_FACE: only the objects face has changed. |
679 | */ |
714 | */ |
680 | void |
715 | void |
681 | update_object (object *op, int action) |
716 | update_object (object *op, int action) |
682 | { |
717 | { |
683 | if (op == NULL) |
718 | if (!op) |
684 | { |
719 | { |
685 | /* this should never happen */ |
720 | /* this should never happen */ |
686 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
721 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
687 | return; |
722 | return; |
688 | } |
723 | } |
689 | |
724 | |
690 | if (op->env) |
725 | if (!op->is_on_map ()) |
691 | { |
726 | { |
692 | /* Animation is currently handled by client, so nothing |
727 | /* Animation is currently handled by client, so nothing |
693 | * to do in this case. |
728 | * to do in this case. |
694 | */ |
729 | */ |
695 | return; |
730 | return; |
696 | } |
731 | } |
697 | |
|
|
698 | /* If the map is saving, don't do anything as everything is |
|
|
699 | * going to get freed anyways. |
|
|
700 | */ |
|
|
701 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
702 | return; |
|
|
703 | |
732 | |
704 | /* make sure the object is within map boundaries */ |
733 | /* make sure the object is within map boundaries */ |
705 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
734 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
706 | { |
735 | { |
707 | LOG (llevError, "update_object() called for object out of map!\n"); |
736 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
718 | else if (action == UP_OBJ_INSERT) |
747 | else if (action == UP_OBJ_INSERT) |
719 | { |
748 | { |
720 | // this is likely overkill, TODO: revisit (schmorp) |
749 | // this is likely overkill, TODO: revisit (schmorp) |
721 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
750 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
722 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
751 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
723 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
752 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
724 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
753 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
725 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
754 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
726 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
755 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
727 | || (m.move_on | op->move_on ) != m.move_on |
756 | || (m.move_on | op->move_on ) != m.move_on |
728 | || (m.move_off | op->move_off ) != m.move_off |
757 | || (m.move_off | op->move_off ) != m.move_off |
729 | || (m.move_slow | op->move_slow) != m.move_slow |
758 | || (m.move_slow | op->move_slow) != m.move_slow |
730 | /* This isn't perfect, but I don't expect a lot of objects to |
759 | /* This isn't perfect, but I don't expect a lot of objects to |
731 | * to have move_allow right now. |
760 | * have move_allow right now. |
732 | */ |
761 | */ |
733 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
762 | || ((m.move_block | op->move_block) & ~op->move_allow) != m.move_block |
734 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
763 | || 1) // the above is not strong enough a test to skip updating. los maybe? TODO (Schmorp) |
735 | m.flags_ = 0; |
764 | m.invalidate (); |
736 | } |
765 | } |
737 | /* if the object is being removed, we can't make intelligent |
766 | /* if the object is being removed, we can't make intelligent |
738 | * decisions, because remove_ob can't really pass the object |
767 | * decisions, because remove_ob can't really pass the object |
739 | * that is being removed. |
768 | * that is being removed. |
740 | */ |
769 | */ |
741 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
770 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
742 | m.flags_ = 0; |
771 | m.invalidate (); |
743 | else if (action == UP_OBJ_FACE) |
772 | else if (action == UP_OBJ_FACE) |
744 | /* Nothing to do for that case */ ; |
773 | /* Nothing to do for that case */ ; |
745 | else |
774 | else |
746 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
775 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
747 | |
776 | |
… | |
… | |
751 | |
780 | |
752 | object::object () |
781 | object::object () |
753 | { |
782 | { |
754 | SET_FLAG (this, FLAG_REMOVED); |
783 | SET_FLAG (this, FLAG_REMOVED); |
755 | |
784 | |
756 | expmul = 1.0; |
785 | //expmul = 1.0; declared const for the time being |
757 | face = blank_face; |
786 | face = blank_face; |
758 | } |
787 | } |
759 | |
788 | |
760 | object::~object () |
789 | object::~object () |
761 | { |
790 | { |
… | |
… | |
791 | /* If already on active list, don't do anything */ |
820 | /* If already on active list, don't do anything */ |
792 | if (active) |
821 | if (active) |
793 | return; |
822 | return; |
794 | |
823 | |
795 | if (has_active_speed ()) |
824 | if (has_active_speed ()) |
|
|
825 | { |
|
|
826 | if (flag [FLAG_FREED]) |
|
|
827 | LOG (llevError | logBacktrace, "BUG: tried to activate freed object %s\n", debug_desc ());//D |
|
|
828 | |
796 | actives.insert (this); |
829 | actives.insert (this); |
|
|
830 | } |
797 | } |
831 | } |
798 | |
832 | |
799 | void |
833 | void |
800 | object::activate_recursive () |
834 | object::activate_recursive () |
801 | { |
835 | { |
… | |
… | |
850 | object::destroy_inv (bool drop_to_ground) |
884 | object::destroy_inv (bool drop_to_ground) |
851 | { |
885 | { |
852 | // need to check first, because the checks below might segfault |
886 | // need to check first, because the checks below might segfault |
853 | // as we might be on an invalid mapspace and crossfire code |
887 | // as we might be on an invalid mapspace and crossfire code |
854 | // is too buggy to ensure that the inventory is empty. |
888 | // is too buggy to ensure that the inventory is empty. |
855 | // corollary: if you create arrows etc. with stuff in tis inventory, |
889 | // corollary: if you create arrows etc. with stuff in its inventory, |
856 | // cf will crash below with off-map x and y |
890 | // cf will crash below with off-map x and y |
857 | if (!inv) |
891 | if (!inv) |
858 | return; |
892 | return; |
859 | |
893 | |
860 | /* Only if the space blocks everything do we not process - |
894 | /* Only if the space blocks everything do we not process - |
861 | * if some form of movement is allowed, let objects |
895 | * if some form of movement is allowed, let objects |
862 | * drop on that space. |
896 | * drop on that space. |
863 | */ |
897 | */ |
864 | if (!drop_to_ground |
898 | if (!drop_to_ground |
865 | || !map |
899 | || !map |
866 | || map->in_memory != MAP_IN_MEMORY |
900 | || map->in_memory != MAP_ACTIVE |
867 | || map->nodrop |
901 | || map->no_drop |
868 | || ms ().move_block == MOVE_ALL) |
902 | || ms ().move_block == MOVE_ALL) |
869 | { |
903 | { |
870 | while (inv) |
904 | while (inv) |
871 | { |
|
|
872 | inv->destroy_inv (drop_to_ground); |
|
|
873 | inv->destroy (); |
905 | inv->destroy (); |
874 | } |
|
|
875 | } |
906 | } |
876 | else |
907 | else |
877 | { /* Put objects in inventory onto this space */ |
908 | { /* Put objects in inventory onto this space */ |
878 | while (inv) |
909 | while (inv) |
879 | { |
910 | { |
… | |
… | |
897 | object *op = new object; |
928 | object *op = new object; |
898 | op->link (); |
929 | op->link (); |
899 | return op; |
930 | return op; |
900 | } |
931 | } |
901 | |
932 | |
|
|
933 | static struct freed_map : maptile |
|
|
934 | { |
|
|
935 | freed_map () |
|
|
936 | { |
|
|
937 | path = "<freed objects map>"; |
|
|
938 | name = "/internal/freed_objects_map"; |
|
|
939 | width = 3; |
|
|
940 | height = 3; |
|
|
941 | no_drop = 1; |
|
|
942 | no_reset = 1; |
|
|
943 | |
|
|
944 | alloc (); |
|
|
945 | in_memory = MAP_ACTIVE; |
|
|
946 | } |
|
|
947 | |
|
|
948 | ~freed_map () |
|
|
949 | { |
|
|
950 | destroy (); |
|
|
951 | } |
|
|
952 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
953 | |
902 | void |
954 | void |
903 | object::do_destroy () |
955 | object::do_destroy () |
904 | { |
956 | { |
905 | attachable::do_destroy (); |
|
|
906 | |
|
|
907 | if (flag [FLAG_IS_LINKED]) |
957 | if (flag [FLAG_IS_LINKED]) |
908 | remove_button_link (this); |
958 | remove_link (); |
909 | |
959 | |
910 | if (flag [FLAG_FRIENDLY]) |
960 | if (flag [FLAG_FRIENDLY]) |
911 | remove_friendly_object (this); |
961 | remove_friendly_object (this); |
912 | |
962 | |
913 | if (!flag [FLAG_REMOVED]) |
|
|
914 | remove (); |
963 | remove (); |
915 | |
964 | |
916 | destroy_inv (true); |
965 | attachable::do_destroy (); |
917 | |
966 | |
918 | deactivate (); |
967 | deactivate (); |
919 | unlink (); |
968 | unlink (); |
920 | |
969 | |
921 | flag [FLAG_FREED] = 1; |
970 | flag [FLAG_FREED] = 1; |
922 | |
971 | |
923 | // hack to ensure that freed objects still have a valid map |
972 | // hack to ensure that freed objects still have a valid map |
924 | { |
|
|
925 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
926 | |
|
|
927 | if (!freed_map) |
|
|
928 | { |
|
|
929 | freed_map = new maptile; |
|
|
930 | |
|
|
931 | freed_map->path = "<freed objects map>"; |
|
|
932 | freed_map->name = "/internal/freed_objects_map"; |
|
|
933 | freed_map->width = 3; |
|
|
934 | freed_map->height = 3; |
|
|
935 | freed_map->nodrop = 1; |
|
|
936 | |
|
|
937 | freed_map->alloc (); |
|
|
938 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
939 | } |
|
|
940 | |
|
|
941 | map = freed_map; |
973 | map = &freed_map; |
942 | x = 1; |
974 | x = 1; |
943 | y = 1; |
975 | y = 1; |
944 | } |
|
|
945 | |
976 | |
946 | if (more) |
977 | if (more) |
947 | { |
978 | { |
948 | more->destroy (); |
979 | more->destroy (); |
949 | more = 0; |
980 | more = 0; |
… | |
… | |
957 | attacked_by = 0; |
988 | attacked_by = 0; |
958 | current_weapon = 0; |
989 | current_weapon = 0; |
959 | } |
990 | } |
960 | |
991 | |
961 | void |
992 | void |
962 | object::destroy (bool destroy_inventory) |
993 | object::destroy () |
963 | { |
994 | { |
964 | if (destroyed ()) |
995 | if (destroyed ()) |
965 | return; |
996 | return; |
966 | |
997 | |
967 | if (destroy_inventory) |
998 | if (!is_head () && !head->destroyed ()) |
|
|
999 | { |
|
|
1000 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
|
|
1001 | head->destroy (); |
|
|
1002 | return; |
|
|
1003 | } |
|
|
1004 | |
968 | destroy_inv (false); |
1005 | destroy_inv (false); |
969 | |
1006 | |
970 | if (is_head ()) |
1007 | if (is_head ()) |
971 | if (sound_destroy) |
1008 | if (sound_destroy) |
972 | play_sound (sound_destroy); |
1009 | play_sound (sound_destroy); |
973 | else if (flag [FLAG_MONSTER]) |
1010 | else if (flag [FLAG_MONSTER]) |
974 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
1011 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
975 | |
1012 | |
976 | attachable::destroy (); |
1013 | attachable::destroy (); |
977 | } |
|
|
978 | |
|
|
979 | /* |
|
|
980 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
981 | * weight of an object (and what is carried by it's environment(s)). |
|
|
982 | */ |
|
|
983 | void |
|
|
984 | sub_weight (object *op, signed long weight) |
|
|
985 | { |
|
|
986 | while (op != NULL) |
|
|
987 | { |
|
|
988 | if (op->type == CONTAINER) |
|
|
989 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
990 | |
|
|
991 | op->carrying -= weight; |
|
|
992 | op = op->env; |
|
|
993 | } |
|
|
994 | } |
1014 | } |
995 | |
1015 | |
996 | /* op->remove (): |
1016 | /* op->remove (): |
997 | * This function removes the object op from the linked list of objects |
1017 | * This function removes the object op from the linked list of objects |
998 | * which it is currently tied to. When this function is done, the |
1018 | * which it is currently tied to. When this function is done, the |
… | |
… | |
1001 | * the previous environment. |
1021 | * the previous environment. |
1002 | */ |
1022 | */ |
1003 | void |
1023 | void |
1004 | object::do_remove () |
1024 | object::do_remove () |
1005 | { |
1025 | { |
1006 | object *tmp, *last = 0; |
1026 | if (flag [FLAG_REMOVED]) |
1007 | object *otmp; |
|
|
1008 | |
|
|
1009 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
|
|
1010 | return; |
1027 | return; |
1011 | |
1028 | |
1012 | SET_FLAG (this, FLAG_REMOVED); |
|
|
1013 | INVOKE_OBJECT (REMOVE, this); |
1029 | INVOKE_OBJECT (REMOVE, this); |
|
|
1030 | |
|
|
1031 | flag [FLAG_REMOVED] = true; |
1014 | |
1032 | |
1015 | if (more) |
1033 | if (more) |
1016 | more->remove (); |
1034 | more->remove (); |
1017 | |
1035 | |
1018 | /* |
1036 | /* |
1019 | * In this case, the object to be removed is in someones |
1037 | * In this case, the object to be removed is in someones |
1020 | * inventory. |
1038 | * inventory. |
1021 | */ |
1039 | */ |
1022 | if (env) |
1040 | if (env) |
1023 | { |
1041 | { |
1024 | if (nrof) |
1042 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1025 | sub_weight (env, weight * nrof); |
1043 | if (object *pl = visible_to ()) |
1026 | else |
1044 | esrv_del_item (pl->contr, count); |
1027 | sub_weight (env, weight + carrying); |
1045 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
|
|
1046 | |
|
|
1047 | adjust_weight (env, -total_weight ()); |
|
|
1048 | |
|
|
1049 | object *pl = in_player (); |
|
|
1050 | |
|
|
1051 | /* we set up values so that it could be inserted into |
|
|
1052 | * the map, but we don't actually do that - it is up |
|
|
1053 | * to the caller to decide what we want to do. |
|
|
1054 | */ |
|
|
1055 | map = env->map; |
|
|
1056 | x = env->x; |
|
|
1057 | y = env->y; |
|
|
1058 | |
|
|
1059 | // make sure cmov optimisation is applicable |
|
|
1060 | *(above ? &above->below : &env->inv) = below; |
|
|
1061 | *(below ? &below->above : &above ) = above; // &above is just a dummy |
|
|
1062 | |
|
|
1063 | above = 0; |
|
|
1064 | below = 0; |
|
|
1065 | env = 0; |
1028 | |
1066 | |
1029 | /* NO_FIX_PLAYER is set when a great many changes are being |
1067 | /* NO_FIX_PLAYER is set when a great many changes are being |
1030 | * made to players inventory. If set, avoiding the call |
1068 | * made to players inventory. If set, avoiding the call |
1031 | * to save cpu time. |
1069 | * to save cpu time. |
1032 | */ |
1070 | */ |
1033 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1071 | if (pl) |
|
|
1072 | if (pl->is_player () && (glow_radius || !QUERY_FLAG (pl, FLAG_NO_FIX_PLAYER))) |
|
|
1073 | { |
1034 | otmp->update_stats (); |
1074 | pl->update_stats (); |
1035 | |
1075 | |
1036 | if (above) |
1076 | if (glow_radius && pl->is_on_map ()) |
1037 | above->below = below; |
1077 | update_all_los (pl->map, pl->x, pl->y); |
1038 | else |
1078 | } |
1039 | env->inv = below; |
|
|
1040 | |
|
|
1041 | if (below) |
|
|
1042 | below->above = above; |
|
|
1043 | |
|
|
1044 | /* we set up values so that it could be inserted into |
|
|
1045 | * the map, but we don't actually do that - it is up |
|
|
1046 | * to the caller to decide what we want to do. |
|
|
1047 | */ |
|
|
1048 | x = env->x, y = env->y; |
|
|
1049 | map = env->map; |
|
|
1050 | above = 0, below = 0; |
|
|
1051 | env = 0; |
|
|
1052 | } |
1079 | } |
1053 | else if (map) |
1080 | else if (map) |
1054 | { |
1081 | { |
1055 | if (type == PLAYER) |
|
|
1056 | { |
|
|
1057 | // leaving a spot always closes any open container on the ground |
|
|
1058 | if (container && !container->env) |
|
|
1059 | // this causes spurious floorbox updates, but it ensures |
|
|
1060 | // that the CLOSE event is being sent. |
|
|
1061 | close_container (); |
|
|
1062 | |
|
|
1063 | --map->players; |
|
|
1064 | map->touch (); |
|
|
1065 | } |
|
|
1066 | |
|
|
1067 | map->dirty = true; |
1082 | map->dirty = true; |
1068 | mapspace &ms = this->ms (); |
1083 | mapspace &ms = this->ms (); |
1069 | |
1084 | |
|
|
1085 | if (object *pl = ms.player ()) |
|
|
1086 | { |
|
|
1087 | if (is_player ()) |
|
|
1088 | { |
|
|
1089 | if (!flag [FLAG_WIZPASS]) |
|
|
1090 | ms.smell = ++mapspace::smellcount; // remember the smell of the player |
|
|
1091 | |
|
|
1092 | // leaving a spot always closes any open container on the ground |
|
|
1093 | if (container && !container->env) |
|
|
1094 | // this causes spurious floorbox updates, but it ensures |
|
|
1095 | // that the CLOSE event is being sent. |
|
|
1096 | close_container (); |
|
|
1097 | |
|
|
1098 | --map->players; |
|
|
1099 | map->touch (); |
|
|
1100 | } |
|
|
1101 | else if (pl->container_ () == this) |
|
|
1102 | { |
|
|
1103 | // removing a container should close it |
|
|
1104 | close_container (); |
|
|
1105 | } |
|
|
1106 | |
|
|
1107 | esrv_del_item (pl->contr, count); |
|
|
1108 | } |
|
|
1109 | |
1070 | /* link the object above us */ |
1110 | /* link the object above us */ |
1071 | if (above) |
1111 | // re-link, make sure compiler can easily use cmove |
1072 | above->below = below; |
1112 | *(above ? &above->below : &ms.top) = below; |
1073 | else |
1113 | *(below ? &below->above : &ms.bot) = above; |
1074 | ms.top = below; /* we were top, set new top */ |
|
|
1075 | |
|
|
1076 | /* Relink the object below us, if there is one */ |
|
|
1077 | if (below) |
|
|
1078 | below->above = above; |
|
|
1079 | else |
|
|
1080 | { |
|
|
1081 | /* Nothing below, which means we need to relink map object for this space |
|
|
1082 | * use translated coordinates in case some oddness with map tiling is |
|
|
1083 | * evident |
|
|
1084 | */ |
|
|
1085 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1086 | LOG (llevError, "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom? %s\n", debug_desc ()); |
|
|
1087 | |
|
|
1088 | ms.bot = above; /* goes on above it. */ |
|
|
1089 | } |
|
|
1090 | |
1114 | |
1091 | above = 0; |
1115 | above = 0; |
1092 | below = 0; |
1116 | below = 0; |
1093 | |
1117 | |
|
|
1118 | ms.invalidate (); |
|
|
1119 | |
1094 | if (map->in_memory == MAP_SAVING) |
1120 | if (map->in_memory == MAP_SAVING) |
1095 | return; |
1121 | return; |
1096 | |
1122 | |
1097 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1123 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1098 | |
1124 | |
1099 | if (object *pl = ms.player ()) |
1125 | if (object *pl = ms.player ()) |
1100 | { |
1126 | { |
1101 | if (pl->container == this) |
1127 | if (pl->container_ () == this) |
1102 | /* If a container that the player is currently using somehow gets |
1128 | /* If a container that the player is currently using somehow gets |
1103 | * removed (most likely destroyed), update the player view |
1129 | * removed (most likely destroyed), update the player view |
1104 | * appropriately. |
1130 | * appropriately. |
1105 | */ |
1131 | */ |
1106 | pl->close_container (); |
1132 | pl->close_container (); |
1107 | |
1133 | |
|
|
1134 | //TODO: the floorbox prev/next might need updating |
|
|
1135 | //esrv_del_item (pl->contr, count); |
|
|
1136 | //TODO: update floorbox to preserve ordering |
|
|
1137 | if (pl->contr->ns) |
1108 | pl->contr->ns->floorbox_update (); |
1138 | pl->contr->ns->floorbox_update (); |
1109 | } |
1139 | } |
1110 | |
1140 | |
|
|
1141 | if (check_walk_off) |
1111 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1142 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1112 | { |
1143 | { |
|
|
1144 | above = tmp->above; |
|
|
1145 | |
1113 | /* No point updating the players look faces if he is the object |
1146 | /* No point updating the players look faces if he is the object |
1114 | * being removed. |
1147 | * being removed. |
1115 | */ |
1148 | */ |
1116 | |
1149 | |
1117 | /* See if object moving off should effect something */ |
1150 | /* See if object moving off should effect something */ |
1118 | if (check_walk_off |
|
|
1119 | && ((move_type & tmp->move_off) |
1151 | if ((move_type & tmp->move_off) |
1120 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1152 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1121 | { |
|
|
1122 | move_apply (tmp, this, 0); |
1153 | move_apply (tmp, this, 0); |
1123 | |
|
|
1124 | if (destroyed ()) |
|
|
1125 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
|
|
1126 | } |
1154 | } |
1127 | |
1155 | |
1128 | last = tmp; |
1156 | if (affects_los ()) |
1129 | } |
|
|
1130 | |
|
|
1131 | /* last == NULL if there are no objects on this space */ |
|
|
1132 | //TODO: this makes little sense, why only update the topmost object? |
|
|
1133 | if (!last) |
|
|
1134 | map->at (x, y).flags_ = 0; |
|
|
1135 | else |
|
|
1136 | update_object (last, UP_OBJ_REMOVE); |
|
|
1137 | |
|
|
1138 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
|
|
1139 | update_all_los (map, x, y); |
1157 | update_all_los (map, x, y); |
1140 | } |
1158 | } |
1141 | } |
1159 | } |
1142 | |
1160 | |
1143 | /* |
1161 | /* |
… | |
… | |
1157 | if (!top) |
1175 | if (!top) |
1158 | for (top = op; top && top->above; top = top->above) |
1176 | for (top = op; top && top->above; top = top->above) |
1159 | ; |
1177 | ; |
1160 | |
1178 | |
1161 | for (; top; top = top->below) |
1179 | for (; top; top = top->below) |
1162 | { |
|
|
1163 | if (top == op) |
|
|
1164 | continue; |
|
|
1165 | |
|
|
1166 | if (object::can_merge (op, top)) |
1180 | if (object::can_merge (op, top)) |
1167 | { |
1181 | { |
1168 | top->nrof += op->nrof; |
1182 | top->nrof += op->nrof; |
1169 | |
1183 | |
1170 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1184 | if (object *pl = top->visible_to ()) |
1171 | op->weight = 0; /* Don't want any adjustements now */ |
1185 | esrv_update_item (UPD_NROF, pl, top); |
|
|
1186 | |
|
|
1187 | op->weight = 0; // cancel the addition above |
|
|
1188 | op->carrying = 0; // must be 0 already |
|
|
1189 | |
1172 | op->destroy (); |
1190 | op->destroy (); |
|
|
1191 | |
1173 | return top; |
1192 | return top; |
1174 | } |
1193 | } |
1175 | } |
|
|
1176 | |
1194 | |
1177 | return 0; |
1195 | return 0; |
1178 | } |
1196 | } |
1179 | |
1197 | |
1180 | void |
1198 | void |
… | |
… | |
1205 | * job preparing multi-part monsters. |
1223 | * job preparing multi-part monsters. |
1206 | */ |
1224 | */ |
1207 | object * |
1225 | object * |
1208 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1226 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1209 | { |
1227 | { |
|
|
1228 | op->remove (); |
|
|
1229 | |
1210 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1230 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1211 | { |
1231 | { |
1212 | tmp->x = x + tmp->arch->x; |
1232 | tmp->x = x + tmp->arch->x; |
1213 | tmp->y = y + tmp->arch->y; |
1233 | tmp->y = y + tmp->arch->y; |
1214 | } |
1234 | } |
… | |
… | |
1237 | * just 'op' otherwise |
1257 | * just 'op' otherwise |
1238 | */ |
1258 | */ |
1239 | object * |
1259 | object * |
1240 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1260 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1241 | { |
1261 | { |
1242 | assert (!op->flag [FLAG_FREED]); |
|
|
1243 | |
|
|
1244 | object *top, *floor = NULL; |
|
|
1245 | |
|
|
1246 | op->remove (); |
1262 | op->remove (); |
|
|
1263 | |
|
|
1264 | if (m == &freed_map)//D TODO: remove soon |
|
|
1265 | {//D |
|
|
1266 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
|
|
1267 | }//D |
1247 | |
1268 | |
1248 | /* Ideally, the caller figures this out. However, it complicates a lot |
1269 | /* Ideally, the caller figures this out. However, it complicates a lot |
1249 | * of areas of callers (eg, anything that uses find_free_spot would now |
1270 | * of areas of callers (eg, anything that uses find_free_spot would now |
1250 | * need extra work |
1271 | * need extra work |
1251 | */ |
1272 | */ |
|
|
1273 | maptile *newmap = m; |
1252 | if (!xy_normalise (m, op->x, op->y)) |
1274 | if (!xy_normalise (newmap, op->x, op->y)) |
1253 | { |
1275 | { |
1254 | op->destroy (); |
1276 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1255 | return 0; |
1277 | return 0; |
1256 | } |
1278 | } |
1257 | |
1279 | |
1258 | if (object *more = op->more) |
1280 | if (object *more = op->more) |
1259 | if (!insert_ob_in_map (more, m, originator, flag)) |
1281 | if (!insert_ob_in_map (more, m, originator, flag)) |
1260 | return 0; |
1282 | return 0; |
1261 | |
1283 | |
1262 | CLEAR_FLAG (op, FLAG_REMOVED); |
1284 | op->flag [FLAG_REMOVED] = false; |
1263 | |
1285 | op->env = 0; |
1264 | op->map = m; |
1286 | op->map = newmap; |
|
|
1287 | |
1265 | mapspace &ms = op->ms (); |
1288 | mapspace &ms = op->ms (); |
1266 | |
1289 | |
1267 | /* this has to be done after we translate the coordinates. |
1290 | /* this has to be done after we translate the coordinates. |
1268 | */ |
1291 | */ |
1269 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1292 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1270 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1293 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1271 | if (object::can_merge (op, tmp)) |
1294 | if (object::can_merge (op, tmp)) |
1272 | { |
1295 | { |
|
|
1296 | // TODO: we actually want to update tmp, not op, |
|
|
1297 | // but some caller surely breaks when we return tmp |
|
|
1298 | // from here :/ |
1273 | op->nrof += tmp->nrof; |
1299 | op->nrof += tmp->nrof; |
1274 | tmp->destroy (); |
1300 | tmp->destroy (); |
1275 | } |
1301 | } |
1276 | |
1302 | |
1277 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1303 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
… | |
… | |
1286 | { |
1312 | { |
1287 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1313 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1288 | abort (); |
1314 | abort (); |
1289 | } |
1315 | } |
1290 | |
1316 | |
|
|
1317 | if (!originator->is_on_map ()) |
|
|
1318 | { |
|
|
1319 | LOG (llevError, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
|
|
1320 | op->debug_desc (), originator->debug_desc ()); |
|
|
1321 | abort (); |
|
|
1322 | } |
|
|
1323 | |
1291 | op->above = originator; |
1324 | op->above = originator; |
1292 | op->below = originator->below; |
1325 | op->below = originator->below; |
1293 | |
|
|
1294 | if (op->below) |
|
|
1295 | op->below->above = op; |
|
|
1296 | else |
|
|
1297 | ms.bot = op; |
|
|
1298 | |
|
|
1299 | /* since *below* originator, no need to update top */ |
|
|
1300 | originator->below = op; |
1326 | originator->below = op; |
|
|
1327 | |
|
|
1328 | *(op->below ? &op->below->above : &ms.bot) = op; |
1301 | } |
1329 | } |
1302 | else |
1330 | else |
1303 | { |
1331 | { |
1304 | top = ms.bot; |
1332 | object *floor = 0; |
|
|
1333 | object *top = ms.top; |
1305 | |
1334 | |
1306 | /* If there are other objects, then */ |
1335 | /* If there are other objects, then */ |
1307 | if (top) |
1336 | if (top) |
1308 | { |
1337 | { |
1309 | object *last = 0; |
|
|
1310 | |
|
|
1311 | /* |
1338 | /* |
1312 | * If there are multiple objects on this space, we do some trickier handling. |
1339 | * If there are multiple objects on this space, we do some trickier handling. |
1313 | * We've already dealt with merging if appropriate. |
1340 | * We've already dealt with merging if appropriate. |
1314 | * Generally, we want to put the new object on top. But if |
1341 | * Generally, we want to put the new object on top. But if |
1315 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1342 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1318 | * once we get to them. This reduces the need to traverse over all of |
1345 | * once we get to them. This reduces the need to traverse over all of |
1319 | * them when adding another one - this saves quite a bit of cpu time |
1346 | * them when adding another one - this saves quite a bit of cpu time |
1320 | * when lots of spells are cast in one area. Currently, it is presumed |
1347 | * when lots of spells are cast in one area. Currently, it is presumed |
1321 | * that flying non pickable objects are spell objects. |
1348 | * that flying non pickable objects are spell objects. |
1322 | */ |
1349 | */ |
1323 | for (top = ms.bot; top; top = top->above) |
1350 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1324 | { |
1351 | { |
1325 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1352 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1326 | floor = top; |
1353 | floor = tmp; |
1327 | |
1354 | |
1328 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1355 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1329 | { |
1356 | { |
1330 | /* We insert above top, so we want this object below this */ |
1357 | /* We insert above top, so we want this object below this */ |
1331 | top = top->below; |
1358 | top = tmp->below; |
1332 | break; |
1359 | break; |
1333 | } |
1360 | } |
1334 | |
1361 | |
1335 | last = top; |
1362 | top = tmp; |
1336 | } |
1363 | } |
1337 | |
|
|
1338 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1339 | top = last; |
|
|
1340 | |
1364 | |
1341 | /* We let update_position deal with figuring out what the space |
1365 | /* We let update_position deal with figuring out what the space |
1342 | * looks like instead of lots of conditions here. |
1366 | * looks like instead of lots of conditions here. |
1343 | * makes things faster, and effectively the same result. |
1367 | * makes things faster, and effectively the same result. |
1344 | */ |
1368 | */ |
… | |
… | |
1351 | */ |
1375 | */ |
1352 | if (!(flag & INS_ON_TOP) |
1376 | if (!(flag & INS_ON_TOP) |
1353 | && ms.flags () & P_BLOCKSVIEW |
1377 | && ms.flags () & P_BLOCKSVIEW |
1354 | && (op->face && !faces [op->face].visibility)) |
1378 | && (op->face && !faces [op->face].visibility)) |
1355 | { |
1379 | { |
|
|
1380 | object *last; |
|
|
1381 | |
1356 | for (last = top; last != floor; last = last->below) |
1382 | for (last = top; last != floor; last = last->below) |
1357 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1383 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1358 | break; |
1384 | break; |
1359 | |
1385 | |
1360 | /* Check to see if we found the object that blocks view, |
1386 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1368 | } /* If objects on this space */ |
1394 | } /* If objects on this space */ |
1369 | |
1395 | |
1370 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1396 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1371 | top = floor; |
1397 | top = floor; |
1372 | |
1398 | |
1373 | /* Top is the object that our object (op) is going to get inserted above. |
1399 | // insert object above top, or bottom-most if top = 0 |
1374 | */ |
|
|
1375 | |
|
|
1376 | /* First object on this space */ |
|
|
1377 | if (!top) |
1400 | if (!top) |
1378 | { |
1401 | { |
|
|
1402 | op->below = 0; |
1379 | op->above = ms.bot; |
1403 | op->above = ms.bot; |
1380 | |
|
|
1381 | if (op->above) |
|
|
1382 | op->above->below = op; |
|
|
1383 | |
|
|
1384 | op->below = 0; |
|
|
1385 | ms.bot = op; |
1404 | ms.bot = op; |
|
|
1405 | |
|
|
1406 | *(op->above ? &op->above->below : &ms.top) = op; |
1386 | } |
1407 | } |
1387 | else |
1408 | else |
1388 | { /* get inserted into the stack above top */ |
1409 | { |
1389 | op->above = top->above; |
1410 | op->above = top->above; |
1390 | |
|
|
1391 | if (op->above) |
|
|
1392 | op->above->below = op; |
1411 | top->above = op; |
1393 | |
1412 | |
1394 | op->below = top; |
1413 | op->below = top; |
1395 | top->above = op; |
1414 | *(op->above ? &op->above->below : &ms.top) = op; |
1396 | } |
1415 | } |
|
|
1416 | } |
1397 | |
1417 | |
1398 | if (!op->above) |
1418 | if (op->is_player ()) |
1399 | ms.top = op; |
|
|
1400 | } /* else not INS_BELOW_ORIGINATOR */ |
|
|
1401 | |
|
|
1402 | if (op->type == PLAYER) |
|
|
1403 | { |
1419 | { |
1404 | op->contr->do_los = 1; |
1420 | op->contr->do_los = 1; |
1405 | ++op->map->players; |
1421 | ++op->map->players; |
1406 | op->map->touch (); |
1422 | op->map->touch (); |
1407 | } |
1423 | } |
1408 | |
1424 | |
1409 | op->map->dirty = true; |
1425 | op->map->dirty = true; |
1410 | |
1426 | |
1411 | if (object *pl = ms.player ()) |
1427 | if (object *pl = ms.player ()) |
|
|
1428 | //TODO: the floorbox prev/next might need updating |
|
|
1429 | //esrv_send_item (pl, op); |
|
|
1430 | //TODO: update floorbox to preserve ordering |
|
|
1431 | if (pl->contr->ns) |
1412 | pl->contr->ns->floorbox_update (); |
1432 | pl->contr->ns->floorbox_update (); |
1413 | |
1433 | |
1414 | /* If this object glows, it may affect lighting conditions that are |
1434 | /* If this object glows, it may affect lighting conditions that are |
1415 | * visible to others on this map. But update_all_los is really |
1435 | * visible to others on this map. But update_all_los is really |
1416 | * an inefficient way to do this, as it means los for all players |
1436 | * an inefficient way to do this, as it means los for all players |
1417 | * on the map will get recalculated. The players could very well |
1437 | * on the map will get recalculated. The players could very well |
1418 | * be far away from this change and not affected in any way - |
1438 | * be far away from this change and not affected in any way - |
1419 | * this should get redone to only look for players within range, |
1439 | * this should get redone to only look for players within range, |
1420 | * or just updating the P_UPTODATE for spaces within this area |
1440 | * or just updating the P_UPTODATE for spaces within this area |
1421 | * of effect may be sufficient. |
1441 | * of effect may be sufficient. |
1422 | */ |
1442 | */ |
1423 | if (op->map->darkness && (op->glow_radius != 0)) |
1443 | if (op->affects_los ()) |
|
|
1444 | { |
|
|
1445 | op->ms ().invalidate (); |
1424 | update_all_los (op->map, op->x, op->y); |
1446 | update_all_los (op->map, op->x, op->y); |
|
|
1447 | } |
1425 | |
1448 | |
1426 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1449 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1427 | update_object (op, UP_OBJ_INSERT); |
1450 | update_object (op, UP_OBJ_INSERT); |
1428 | |
1451 | |
1429 | INVOKE_OBJECT (INSERT, op); |
1452 | INVOKE_OBJECT (INSERT, op); |
… | |
… | |
1436 | * blocked() and wall() work properly), and these flags are updated by |
1459 | * blocked() and wall() work properly), and these flags are updated by |
1437 | * update_object(). |
1460 | * update_object(). |
1438 | */ |
1461 | */ |
1439 | |
1462 | |
1440 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1463 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1441 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1464 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1442 | { |
1465 | { |
1443 | if (check_move_on (op, originator)) |
1466 | if (check_move_on (op, originator)) |
1444 | return 0; |
1467 | return 0; |
1445 | |
1468 | |
1446 | /* If we are a multi part object, lets work our way through the check |
1469 | /* If we are a multi part object, lets work our way through the check |
… | |
… | |
1457 | /* this function inserts an object in the map, but if it |
1480 | /* this function inserts an object in the map, but if it |
1458 | * finds an object of its own type, it'll remove that one first. |
1481 | * finds an object of its own type, it'll remove that one first. |
1459 | * op is the object to insert it under: supplies x and the map. |
1482 | * op is the object to insert it under: supplies x and the map. |
1460 | */ |
1483 | */ |
1461 | void |
1484 | void |
1462 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1485 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1463 | { |
1486 | { |
1464 | object *tmp, *tmp1; |
|
|
1465 | |
|
|
1466 | /* first search for itself and remove any old instances */ |
1487 | /* first search for itself and remove any old instances */ |
1467 | |
1488 | |
1468 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1489 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1469 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1490 | if (tmp->arch->archname == archname) /* same archetype */ |
1470 | tmp->destroy (); |
1491 | tmp->destroy (); |
1471 | |
1492 | |
1472 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1493 | object *tmp = arch_to_object (archetype::find (archname)); |
1473 | |
1494 | |
1474 | tmp1->x = op->x; |
1495 | tmp->x = op->x; |
1475 | tmp1->y = op->y; |
1496 | tmp->y = op->y; |
|
|
1497 | |
1476 | insert_ob_in_map (tmp1, op->map, op, 0); |
1498 | insert_ob_in_map (tmp, op->map, op, 0); |
1477 | } |
1499 | } |
1478 | |
1500 | |
1479 | object * |
1501 | object * |
1480 | object::insert_at (object *where, object *originator, int flags) |
1502 | object::insert_at (object *where, object *originator, int flags) |
1481 | { |
1503 | { |
|
|
1504 | if (where->env) |
|
|
1505 | return where->env->insert (this); |
|
|
1506 | else |
1482 | return where->map->insert (this, where->x, where->y, originator, flags); |
1507 | return where->map->insert (this, where->x, where->y, originator, flags); |
1483 | } |
1508 | } |
1484 | |
1509 | |
1485 | /* |
1510 | /* |
1486 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1487 | * is returned contains nr objects, and the remaining parts contains |
|
|
1488 | * the rest (or is removed and freed if that number is 0). |
|
|
1489 | * On failure, NULL is returned, and the reason put into the |
|
|
1490 | * global static errmsg array. |
|
|
1491 | */ |
|
|
1492 | object * |
|
|
1493 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1494 | { |
|
|
1495 | object *newob; |
|
|
1496 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1497 | |
|
|
1498 | if (orig_ob->nrof < nr) |
|
|
1499 | { |
|
|
1500 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1501 | return NULL; |
|
|
1502 | } |
|
|
1503 | |
|
|
1504 | newob = object_create_clone (orig_ob); |
|
|
1505 | |
|
|
1506 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1507 | orig_ob->destroy (1); |
|
|
1508 | else if (!is_removed) |
|
|
1509 | { |
|
|
1510 | if (orig_ob->env != NULL) |
|
|
1511 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1512 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1513 | { |
|
|
1514 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1515 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1516 | return NULL; |
|
|
1517 | } |
|
|
1518 | } |
|
|
1519 | |
|
|
1520 | newob->nrof = nr; |
|
|
1521 | |
|
|
1522 | return newob; |
|
|
1523 | } |
|
|
1524 | |
|
|
1525 | /* |
|
|
1526 | * decrease_ob_nr(object, number) decreases a specified number from |
1511 | * decrease(object, number) decreases a specified number from |
1527 | * the amount of an object. If the amount reaches 0, the object |
1512 | * the amount of an object. If the amount reaches 0, the object |
1528 | * is subsequently removed and freed. |
1513 | * is subsequently removed and freed. |
1529 | * |
1514 | * |
1530 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1515 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1531 | */ |
1516 | */ |
|
|
1517 | bool |
|
|
1518 | object::decrease (sint32 nr) |
|
|
1519 | { |
|
|
1520 | if (!nr) |
|
|
1521 | return true; |
|
|
1522 | |
|
|
1523 | nr = min (nr, nrof); |
|
|
1524 | |
|
|
1525 | if (nrof > nr) |
|
|
1526 | { |
|
|
1527 | nrof -= nr; |
|
|
1528 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
|
|
1529 | |
|
|
1530 | if (object *pl = visible_to ()) |
|
|
1531 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1532 | |
|
|
1533 | return true; |
|
|
1534 | } |
|
|
1535 | else |
|
|
1536 | { |
|
|
1537 | destroy (); |
|
|
1538 | return false; |
|
|
1539 | } |
|
|
1540 | } |
|
|
1541 | |
|
|
1542 | /* |
|
|
1543 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1544 | * is returned contains nr objects, and the remaining parts contains |
|
|
1545 | * the rest (or is removed and returned if that number is 0). |
|
|
1546 | * On failure, NULL is returned. |
|
|
1547 | */ |
1532 | object * |
1548 | object * |
1533 | decrease_ob_nr (object *op, uint32 i) |
1549 | object::split (sint32 nr) |
1534 | { |
1550 | { |
1535 | object *tmp; |
1551 | int have = number_of (); |
1536 | |
1552 | |
1537 | if (i == 0) /* objects with op->nrof require this check */ |
1553 | if (have < nr) |
1538 | return op; |
1554 | return 0; |
1539 | |
1555 | else if (have == nr) |
1540 | if (i > op->nrof) |
|
|
1541 | i = op->nrof; |
|
|
1542 | |
|
|
1543 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1544 | op->nrof -= i; |
|
|
1545 | else if (op->env) |
|
|
1546 | { |
1556 | { |
1547 | /* is this object in the players inventory, or sub container |
|
|
1548 | * therein? |
|
|
1549 | */ |
|
|
1550 | tmp = op->in_player (); |
|
|
1551 | /* nope. Is this a container the player has opened? |
|
|
1552 | * If so, set tmp to that player. |
|
|
1553 | * IMO, searching through all the players will mostly |
|
|
1554 | * likely be quicker than following op->env to the map, |
|
|
1555 | * and then searching the map for a player. |
|
|
1556 | */ |
|
|
1557 | if (!tmp) |
|
|
1558 | for_all_players (pl) |
|
|
1559 | if (pl->ob->container == op->env) |
|
|
1560 | { |
|
|
1561 | tmp = pl->ob; |
|
|
1562 | break; |
|
|
1563 | } |
|
|
1564 | |
|
|
1565 | if (i < op->nrof) |
|
|
1566 | { |
|
|
1567 | sub_weight (op->env, op->weight * i); |
|
|
1568 | op->nrof -= i; |
|
|
1569 | if (tmp) |
|
|
1570 | esrv_send_item (tmp, op); |
|
|
1571 | } |
|
|
1572 | else |
|
|
1573 | { |
|
|
1574 | op->remove (); |
1557 | remove (); |
1575 | op->nrof = 0; |
1558 | return this; |
1576 | if (tmp) |
|
|
1577 | esrv_del_item (tmp->contr, op->count); |
|
|
1578 | } |
|
|
1579 | } |
1559 | } |
1580 | else |
1560 | else |
1581 | { |
1561 | { |
1582 | object *above = op->above; |
1562 | decrease (nr); |
1583 | |
1563 | |
1584 | if (i < op->nrof) |
1564 | object *op = deep_clone (); |
1585 | op->nrof -= i; |
1565 | op->nrof = nr; |
1586 | else |
|
|
1587 | { |
|
|
1588 | op->remove (); |
|
|
1589 | op->nrof = 0; |
|
|
1590 | } |
|
|
1591 | |
|
|
1592 | /* Since we just removed op, op->above is null */ |
|
|
1593 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1594 | if (tmp->type == PLAYER) |
|
|
1595 | { |
|
|
1596 | if (op->nrof) |
|
|
1597 | esrv_send_item (tmp, op); |
|
|
1598 | else |
|
|
1599 | esrv_del_item (tmp->contr, op->count); |
|
|
1600 | } |
|
|
1601 | } |
|
|
1602 | |
|
|
1603 | if (op->nrof) |
|
|
1604 | return op; |
1566 | return op; |
1605 | else |
|
|
1606 | { |
|
|
1607 | op->destroy (); |
|
|
1608 | return 0; |
|
|
1609 | } |
|
|
1610 | } |
|
|
1611 | |
|
|
1612 | /* |
|
|
1613 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1614 | * and also updates how much the environment(s) is/are carrying. |
|
|
1615 | */ |
|
|
1616 | void |
|
|
1617 | add_weight (object *op, signed long weight) |
|
|
1618 | { |
|
|
1619 | while (op != NULL) |
|
|
1620 | { |
|
|
1621 | if (op->type == CONTAINER) |
|
|
1622 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1623 | |
|
|
1624 | op->carrying += weight; |
|
|
1625 | op = op->env; |
|
|
1626 | } |
1567 | } |
1627 | } |
1568 | } |
1628 | |
1569 | |
1629 | object * |
1570 | object * |
1630 | insert_ob_in_ob (object *op, object *where) |
1571 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1655 | * be != op, if items are merged. -Tero |
1596 | * be != op, if items are merged. -Tero |
1656 | */ |
1597 | */ |
1657 | object * |
1598 | object * |
1658 | object::insert (object *op) |
1599 | object::insert (object *op) |
1659 | { |
1600 | { |
1660 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1661 | op->remove (); |
|
|
1662 | |
|
|
1663 | if (op->more) |
1601 | if (op->more) |
1664 | { |
1602 | { |
1665 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1603 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1666 | return op; |
1604 | return op; |
1667 | } |
1605 | } |
1668 | |
1606 | |
1669 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1607 | op->remove (); |
1670 | CLEAR_FLAG (op, FLAG_REMOVED); |
1608 | |
|
|
1609 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
1671 | |
1610 | |
1672 | if (op->nrof) |
1611 | if (op->nrof) |
1673 | { |
|
|
1674 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1612 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1675 | if (object::can_merge (tmp, op)) |
1613 | if (object::can_merge (tmp, op)) |
1676 | { |
1614 | { |
1677 | /* return the original object and remove inserted object |
1615 | /* return the original object and remove inserted object |
1678 | (client needs the original object) */ |
1616 | (client needs the original object) */ |
1679 | tmp->nrof += op->nrof; |
1617 | tmp->nrof += op->nrof; |
1680 | /* Weight handling gets pretty funky. Since we are adding to |
1618 | |
1681 | * tmp->nrof, we need to increase the weight. |
1619 | if (object *pl = tmp->visible_to ()) |
1682 | */ |
1620 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1621 | |
1683 | add_weight (this, op->weight * op->nrof); |
1622 | adjust_weight (this, op->total_weight ()); |
1684 | SET_FLAG (op, FLAG_REMOVED); |
1623 | |
1685 | op->destroy (); /* free the inserted object */ |
1624 | op->destroy (); |
1686 | op = tmp; |
1625 | op = tmp; |
1687 | op->remove (); /* and fix old object's links */ |
1626 | goto inserted; |
1688 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1689 | break; |
|
|
1690 | } |
1627 | } |
1691 | |
1628 | |
1692 | /* I assume combined objects have no inventory |
|
|
1693 | * We add the weight - this object could have just been removed |
|
|
1694 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1695 | * the weight, so we need to add it in again, since we actually do |
|
|
1696 | * the linking below |
|
|
1697 | */ |
|
|
1698 | add_weight (this, op->weight * op->nrof); |
|
|
1699 | } |
|
|
1700 | else |
|
|
1701 | add_weight (this, (op->weight + op->carrying)); |
|
|
1702 | |
|
|
1703 | if (object *otmp = this->in_player ()) |
|
|
1704 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1705 | otmp->update_stats (); |
|
|
1706 | |
|
|
1707 | op->owner = 0; // its his/hers now. period. |
1629 | op->owner = 0; // it's his/hers now. period. |
1708 | op->map = 0; |
1630 | op->map = 0; |
|
|
1631 | op->x = 0; |
|
|
1632 | op->y = 0; |
|
|
1633 | |
|
|
1634 | op->above = 0; |
|
|
1635 | op->below = inv; |
1709 | op->env = this; |
1636 | op->env = this; |
1710 | op->above = 0; |
|
|
1711 | op->below = 0; |
|
|
1712 | op->x = op->y = 0; |
|
|
1713 | |
1637 | |
|
|
1638 | if (inv) |
|
|
1639 | inv->above = op; |
|
|
1640 | |
|
|
1641 | inv = op; |
|
|
1642 | |
|
|
1643 | op->flag [FLAG_REMOVED] = 0; |
|
|
1644 | |
|
|
1645 | if (object *pl = op->visible_to ()) |
|
|
1646 | esrv_send_item (pl, op); |
|
|
1647 | |
|
|
1648 | adjust_weight (this, op->total_weight ()); |
|
|
1649 | |
|
|
1650 | inserted: |
1714 | /* reset the light list and los of the players on the map */ |
1651 | /* reset the light list and los of the players on the map */ |
1715 | if (op->glow_radius && map) |
1652 | if (op->glow_radius && is_on_map ()) |
1716 | { |
1653 | { |
1717 | #ifdef DEBUG_LIGHTS |
1654 | update_stats (); |
1718 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1719 | #endif /* DEBUG_LIGHTS */ |
|
|
1720 | if (map->darkness) |
|
|
1721 | update_all_los (map, x, y); |
1655 | update_all_los (map, x, y); |
1722 | } |
|
|
1723 | |
|
|
1724 | /* Client has no idea of ordering so lets not bother ordering it here. |
|
|
1725 | * It sure simplifies this function... |
|
|
1726 | */ |
|
|
1727 | if (!inv) |
|
|
1728 | inv = op; |
|
|
1729 | else |
|
|
1730 | { |
1656 | } |
1731 | op->below = inv; |
1657 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1732 | op->below->above = op; |
1658 | // if this is a player's inventory, update stats |
1733 | inv = op; |
1659 | update_stats (); |
1734 | } |
|
|
1735 | |
1660 | |
1736 | INVOKE_OBJECT (INSERT, this); |
1661 | INVOKE_OBJECT (INSERT, this); |
1737 | |
1662 | |
1738 | return op; |
1663 | return op; |
1739 | } |
1664 | } |
… | |
… | |
1759 | * on top. |
1684 | * on top. |
1760 | */ |
1685 | */ |
1761 | int |
1686 | int |
1762 | check_move_on (object *op, object *originator) |
1687 | check_move_on (object *op, object *originator) |
1763 | { |
1688 | { |
|
|
1689 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
|
|
1690 | return 0; |
|
|
1691 | |
1764 | object *tmp; |
1692 | object *tmp; |
1765 | maptile *m = op->map; |
1693 | maptile *m = op->map; |
1766 | int x = op->x, y = op->y; |
1694 | int x = op->x, y = op->y; |
1767 | |
1695 | |
1768 | MoveType move_on, move_slow, move_block; |
1696 | mapspace &ms = m->at (x, y); |
1769 | |
1697 | |
1770 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1698 | ms.update (); |
1771 | return 0; |
|
|
1772 | |
1699 | |
1773 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1700 | MoveType move_on = ms.move_on; |
1774 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1701 | MoveType move_slow = ms.move_slow; |
1775 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1702 | MoveType move_block = ms.move_block; |
1776 | |
1703 | |
1777 | /* if nothing on this space will slow op down or be applied, |
1704 | /* if nothing on this space will slow op down or be applied, |
1778 | * no need to do checking below. have to make sure move_type |
1705 | * no need to do checking below. have to make sure move_type |
1779 | * is set, as lots of objects don't have it set - we treat that |
1706 | * is set, as lots of objects don't have it set - we treat that |
1780 | * as walking. |
1707 | * as walking. |
… | |
… | |
1791 | return 0; |
1718 | return 0; |
1792 | |
1719 | |
1793 | /* The objects have to be checked from top to bottom. |
1720 | /* The objects have to be checked from top to bottom. |
1794 | * Hence, we first go to the top: |
1721 | * Hence, we first go to the top: |
1795 | */ |
1722 | */ |
1796 | |
1723 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1797 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1798 | { |
|
|
1799 | /* Trim the search when we find the first other spell effect |
|
|
1800 | * this helps performance so that if a space has 50 spell objects, |
|
|
1801 | * we don't need to check all of them. |
|
|
1802 | */ |
|
|
1803 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1804 | break; |
|
|
1805 | } |
1724 | { |
|
|
1725 | next = tmp->below; |
1806 | |
1726 | |
1807 | for (; tmp; tmp = tmp->below) |
|
|
1808 | { |
|
|
1809 | if (tmp == op) |
1727 | if (tmp == op) |
1810 | continue; /* Can't apply yourself */ |
1728 | continue; /* Can't apply yourself */ |
1811 | |
1729 | |
1812 | /* Check to see if one of the movement types should be slowed down. |
1730 | /* Check to see if one of the movement types should be slowed down. |
1813 | * Second check makes sure that the movement types not being slowed |
1731 | * Second check makes sure that the movement types not being slowed |
… | |
… | |
1818 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1736 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1819 | { |
1737 | { |
1820 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1738 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1821 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1739 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1822 | { |
1740 | { |
1823 | |
|
|
1824 | float |
|
|
1825 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1741 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1826 | |
1742 | |
1827 | if (op->type == PLAYER) |
1743 | if (op->is_player ()) |
1828 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1744 | if ((tmp->flag [FLAG_IS_HILLY ] && find_skill_by_number (op, SK_CLIMBING)) || |
1829 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1745 | (tmp->flag [FLAG_IS_WOODED] && find_skill_by_number (op, SK_WOODSMAN))) |
1830 | diff /= 4.0; |
1746 | diff /= 4.0; |
1831 | |
1747 | |
1832 | op->speed_left -= diff; |
1748 | op->speed_left -= diff; |
1833 | } |
1749 | } |
1834 | } |
1750 | } |
… | |
… | |
1867 | LOG (llevError, "Present_arch called outside map.\n"); |
1783 | LOG (llevError, "Present_arch called outside map.\n"); |
1868 | return NULL; |
1784 | return NULL; |
1869 | } |
1785 | } |
1870 | |
1786 | |
1871 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1787 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1872 | if (tmp->arch == at) |
1788 | if (tmp->arch->archname == at->archname) |
1873 | return tmp; |
1789 | return tmp; |
1874 | |
1790 | |
1875 | return NULL; |
1791 | return NULL; |
1876 | } |
1792 | } |
1877 | |
1793 | |
… | |
… | |
1941 | * The first matching object is returned, or NULL if none. |
1857 | * The first matching object is returned, or NULL if none. |
1942 | */ |
1858 | */ |
1943 | object * |
1859 | object * |
1944 | present_arch_in_ob (const archetype *at, const object *op) |
1860 | present_arch_in_ob (const archetype *at, const object *op) |
1945 | { |
1861 | { |
1946 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1862 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1947 | if (tmp->arch == at) |
1863 | if (tmp->arch->archname == at->archname) |
1948 | return tmp; |
1864 | return tmp; |
1949 | |
1865 | |
1950 | return NULL; |
1866 | return NULL; |
1951 | } |
1867 | } |
1952 | |
1868 | |
… | |
… | |
2040 | * head of the object should correspond for the entire object. |
1956 | * head of the object should correspond for the entire object. |
2041 | */ |
1957 | */ |
2042 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
1958 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2043 | continue; |
1959 | continue; |
2044 | |
1960 | |
2045 | if (ob->blocked (m, pos.x, pos.y)) |
1961 | if (ob->blocked (pos.m, pos.x, pos.y)) |
2046 | continue; |
1962 | continue; |
2047 | |
1963 | |
2048 | altern [index++] = i; |
1964 | altern [index++] = i; |
2049 | } |
1965 | } |
2050 | |
1966 | |
… | |
… | |
2118 | * there is capable of. |
2034 | * there is capable of. |
2119 | */ |
2035 | */ |
2120 | int |
2036 | int |
2121 | find_dir (maptile *m, int x, int y, object *exclude) |
2037 | find_dir (maptile *m, int x, int y, object *exclude) |
2122 | { |
2038 | { |
2123 | int i, max = SIZEOFFREE, mflags; |
2039 | int max = SIZEOFFREE, mflags; |
2124 | |
|
|
2125 | sint16 nx, ny; |
|
|
2126 | object *tmp; |
|
|
2127 | maptile *mp; |
|
|
2128 | |
|
|
2129 | MoveType blocked, move_type; |
2040 | MoveType move_type; |
2130 | |
2041 | |
2131 | if (exclude && exclude->head_ () != exclude) |
2042 | if (exclude && exclude->head_ () != exclude) |
2132 | { |
2043 | { |
2133 | exclude = exclude->head; |
2044 | exclude = exclude->head; |
2134 | move_type = exclude->move_type; |
2045 | move_type = exclude->move_type; |
… | |
… | |
2137 | { |
2048 | { |
2138 | /* If we don't have anything, presume it can use all movement types. */ |
2049 | /* If we don't have anything, presume it can use all movement types. */ |
2139 | move_type = MOVE_ALL; |
2050 | move_type = MOVE_ALL; |
2140 | } |
2051 | } |
2141 | |
2052 | |
2142 | for (i = 1; i < max; i++) |
2053 | for (int i = 1; i < max; i++) |
2143 | { |
2054 | { |
2144 | mp = m; |
2055 | mapxy pos (m, x, y); |
2145 | nx = x + freearr_x[i]; |
2056 | pos.move (i); |
2146 | ny = y + freearr_y[i]; |
|
|
2147 | |
2057 | |
2148 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2058 | if (!pos.normalise ()) |
2149 | |
|
|
2150 | if (mflags & P_OUT_OF_MAP) |
|
|
2151 | max = maxfree[i]; |
2059 | max = maxfree[i]; |
2152 | else |
2060 | else |
2153 | { |
2061 | { |
2154 | mapspace &ms = mp->at (nx, ny); |
2062 | mapspace &ms = *pos; |
2155 | |
2063 | |
2156 | blocked = ms.move_block; |
|
|
2157 | |
|
|
2158 | if ((move_type & blocked) == move_type) |
2064 | if ((move_type & ms.move_block) == move_type) |
2159 | max = maxfree[i]; |
2065 | max = maxfree [i]; |
2160 | else if (mflags & P_IS_ALIVE) |
2066 | else if (ms.flags () & P_IS_ALIVE) |
2161 | { |
2067 | { |
2162 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2068 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
2163 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2069 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2164 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2070 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2165 | break; |
|
|
2166 | |
|
|
2167 | if (tmp) |
|
|
2168 | return freedir[i]; |
2071 | return freedir [i]; |
2169 | } |
2072 | } |
2170 | } |
2073 | } |
2171 | } |
2074 | } |
2172 | |
2075 | |
2173 | return 0; |
2076 | return 0; |
… | |
… | |
2248 | * This basically means that if direction is 15, then it could either go |
2151 | * This basically means that if direction is 15, then it could either go |
2249 | * direction 4, 14, or 16 to get back to where we are. |
2152 | * direction 4, 14, or 16 to get back to where we are. |
2250 | * Moved from spell_util.c to object.c with the other related direction |
2153 | * Moved from spell_util.c to object.c with the other related direction |
2251 | * functions. |
2154 | * functions. |
2252 | */ |
2155 | */ |
2253 | int reduction_dir[SIZEOFFREE][3] = { |
2156 | static const int reduction_dir[SIZEOFFREE][3] = { |
2254 | {0, 0, 0}, /* 0 */ |
2157 | {0, 0, 0}, /* 0 */ |
2255 | {0, 0, 0}, /* 1 */ |
2158 | {0, 0, 0}, /* 1 */ |
2256 | {0, 0, 0}, /* 2 */ |
2159 | {0, 0, 0}, /* 2 */ |
2257 | {0, 0, 0}, /* 3 */ |
2160 | {0, 0, 0}, /* 3 */ |
2258 | {0, 0, 0}, /* 4 */ |
2161 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2354 | int |
2257 | int |
2355 | can_pick (const object *who, const object *item) |
2258 | can_pick (const object *who, const object *item) |
2356 | { |
2259 | { |
2357 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2260 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2358 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2261 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2359 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->type == PLAYER || item->weight < who->weight / 3)); |
2262 | !QUERY_FLAG (item, FLAG_ALIVE) && !item->invisible && (who->is_player () || item->weight < who->weight / 3)); |
2360 | } |
2263 | } |
2361 | |
2264 | |
2362 | /* |
2265 | /* |
2363 | * create clone from object to another |
2266 | * create clone from object to another |
2364 | */ |
2267 | */ |
2365 | object * |
2268 | object * |
2366 | object_create_clone (object *asrc) |
2269 | object::deep_clone () |
2367 | { |
2270 | { |
2368 | object *dst = 0, *tmp, *src, *prev, *item; |
2271 | assert (("deep_clone called on non-head object", is_head ())); |
2369 | |
2272 | |
2370 | if (!asrc) |
2273 | object *dst = clone (); |
2371 | return 0; |
|
|
2372 | |
2274 | |
2373 | src = asrc->head_ (); |
2275 | object *prev = dst; |
2374 | |
|
|
2375 | prev = 0; |
|
|
2376 | for (object *part = src; part; part = part->more) |
2276 | for (object *part = this->more; part; part = part->more) |
2377 | { |
2277 | { |
2378 | tmp = part->clone (); |
2278 | object *tmp = part->clone (); |
2379 | tmp->x -= src->x; |
|
|
2380 | tmp->y -= src->y; |
|
|
2381 | |
|
|
2382 | if (!part->head) |
|
|
2383 | { |
|
|
2384 | dst = tmp; |
|
|
2385 | tmp->head = 0; |
|
|
2386 | } |
|
|
2387 | else |
|
|
2388 | tmp->head = dst; |
2279 | tmp->head = dst; |
2389 | |
|
|
2390 | tmp->more = 0; |
|
|
2391 | |
|
|
2392 | if (prev) |
|
|
2393 | prev->more = tmp; |
2280 | prev->more = tmp; |
2394 | |
|
|
2395 | prev = tmp; |
2281 | prev = tmp; |
2396 | } |
2282 | } |
2397 | |
2283 | |
2398 | for (item = src->inv; item; item = item->below) |
2284 | for (object *item = inv; item; item = item->below) |
2399 | insert_ob_in_ob (object_create_clone (item), dst); |
2285 | insert_ob_in_ob (item->deep_clone (), dst); |
2400 | |
2286 | |
2401 | return dst; |
2287 | return dst; |
2402 | } |
2288 | } |
2403 | |
2289 | |
2404 | /* This returns the first object in who's inventory that |
2290 | /* This returns the first object in who's inventory that |
… | |
… | |
2413 | return tmp; |
2299 | return tmp; |
2414 | |
2300 | |
2415 | return 0; |
2301 | return 0; |
2416 | } |
2302 | } |
2417 | |
2303 | |
2418 | /* If ob has a field named key, return the link from the list, |
2304 | shstr_tmp |
2419 | * otherwise return NULL. |
2305 | object::kv_get (shstr_tmp key) const |
2420 | * |
|
|
2421 | * key must be a passed in shared string - otherwise, this won't |
|
|
2422 | * do the desired thing. |
|
|
2423 | */ |
|
|
2424 | key_value * |
|
|
2425 | get_ob_key_link (const object *ob, const char *key) |
|
|
2426 | { |
2306 | { |
2427 | for (key_value *link = ob->key_values; link; link = link->next) |
2307 | for (key_value *kv = key_values; kv; kv = kv->next) |
2428 | if (link->key == key) |
2308 | if (kv->key == key) |
2429 | return link; |
|
|
2430 | |
|
|
2431 | return 0; |
|
|
2432 | } |
|
|
2433 | |
|
|
2434 | /* |
|
|
2435 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2436 | * |
|
|
2437 | * The argument doesn't need to be a shared string. |
|
|
2438 | * |
|
|
2439 | * The returned string is shared. |
|
|
2440 | */ |
|
|
2441 | const char * |
|
|
2442 | get_ob_key_value (const object *op, const char *const key) |
|
|
2443 | { |
|
|
2444 | key_value *link; |
|
|
2445 | shstr_cmp canonical_key (key); |
|
|
2446 | |
|
|
2447 | if (!canonical_key) |
|
|
2448 | { |
|
|
2449 | /* 1. There being a field named key on any object |
|
|
2450 | * implies there'd be a shared string to find. |
|
|
2451 | * 2. Since there isn't, no object has this field. |
|
|
2452 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2453 | */ |
|
|
2454 | return 0; |
|
|
2455 | } |
|
|
2456 | |
|
|
2457 | /* This is copied from get_ob_key_link() above - |
|
|
2458 | * only 4 lines, and saves the function call overhead. |
|
|
2459 | */ |
|
|
2460 | for (link = op->key_values; link; link = link->next) |
|
|
2461 | if (link->key == canonical_key) |
|
|
2462 | return link->value; |
2309 | return kv->value; |
2463 | |
2310 | |
2464 | return 0; |
2311 | return shstr (); |
2465 | } |
2312 | } |
2466 | |
2313 | |
2467 | /* |
2314 | void |
2468 | * Updates the canonical_key in op to value. |
2315 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2469 | * |
|
|
2470 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2471 | * |
|
|
2472 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2473 | * keys. |
|
|
2474 | * |
|
|
2475 | * Returns TRUE on success. |
|
|
2476 | */ |
|
|
2477 | int |
|
|
2478 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2479 | { |
2316 | { |
2480 | key_value *field = NULL, *last = NULL; |
2317 | for (key_value *kv = key_values; kv; kv = kv->next) |
2481 | |
2318 | if (kv->key == key) |
2482 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2483 | { |
|
|
2484 | if (field->key != canonical_key) |
|
|
2485 | { |
2319 | { |
2486 | last = field; |
2320 | kv->value = value; |
2487 | continue; |
2321 | return; |
2488 | } |
2322 | } |
2489 | |
2323 | |
2490 | if (value) |
2324 | key_value *kv = new key_value; |
2491 | field->value = value; |
2325 | |
2492 | else |
2326 | kv->next = key_values; |
|
|
2327 | kv->key = key; |
|
|
2328 | kv->value = value; |
|
|
2329 | |
|
|
2330 | key_values = kv; |
|
|
2331 | } |
|
|
2332 | |
|
|
2333 | void |
|
|
2334 | object::kv_del (shstr_tmp key) |
|
|
2335 | { |
|
|
2336 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2337 | if ((*kvp)->key == key) |
2493 | { |
2338 | { |
2494 | /* Basically, if the archetype has this key set, |
2339 | key_value *kv = *kvp; |
2495 | * we need to store the null value so when we save |
2340 | *kvp = (*kvp)->next; |
2496 | * it, we save the empty value so that when we load, |
2341 | delete kv; |
2497 | * we get this value back again. |
2342 | return; |
2498 | */ |
|
|
2499 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2500 | field->value = 0; |
|
|
2501 | else |
|
|
2502 | { |
|
|
2503 | if (last) |
|
|
2504 | last->next = field->next; |
|
|
2505 | else |
|
|
2506 | op->key_values = field->next; |
|
|
2507 | |
|
|
2508 | delete field; |
|
|
2509 | } |
|
|
2510 | } |
2343 | } |
2511 | return TRUE; |
|
|
2512 | } |
|
|
2513 | /* IF we get here, key doesn't exist */ |
|
|
2514 | |
|
|
2515 | /* No field, we'll have to add it. */ |
|
|
2516 | |
|
|
2517 | if (!add_key) |
|
|
2518 | return FALSE; |
|
|
2519 | |
|
|
2520 | /* There isn't any good reason to store a null |
|
|
2521 | * value in the key/value list. If the archetype has |
|
|
2522 | * this key, then we should also have it, so shouldn't |
|
|
2523 | * be here. If user wants to store empty strings, |
|
|
2524 | * should pass in "" |
|
|
2525 | */ |
|
|
2526 | if (value == NULL) |
|
|
2527 | return TRUE; |
|
|
2528 | |
|
|
2529 | field = new key_value; |
|
|
2530 | |
|
|
2531 | field->key = canonical_key; |
|
|
2532 | field->value = value; |
|
|
2533 | /* Usual prepend-addition. */ |
|
|
2534 | field->next = op->key_values; |
|
|
2535 | op->key_values = field; |
|
|
2536 | |
|
|
2537 | return TRUE; |
|
|
2538 | } |
|
|
2539 | |
|
|
2540 | /* |
|
|
2541 | * Updates the key in op to value. |
|
|
2542 | * |
|
|
2543 | * If add_key is FALSE, this will only update existing keys, |
|
|
2544 | * and not add new ones. |
|
|
2545 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2546 | * |
|
|
2547 | * Returns TRUE on success. |
|
|
2548 | */ |
|
|
2549 | int |
|
|
2550 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2551 | { |
|
|
2552 | shstr key_ (key); |
|
|
2553 | |
|
|
2554 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2555 | } |
2344 | } |
2556 | |
2345 | |
2557 | object::depth_iterator::depth_iterator (object *container) |
2346 | object::depth_iterator::depth_iterator (object *container) |
2558 | : iterator_base (container) |
2347 | : iterator_base (container) |
2559 | { |
2348 | { |
… | |
… | |
2609 | { |
2398 | { |
2610 | char flagdesc[512]; |
2399 | char flagdesc[512]; |
2611 | char info2[256 * 4]; |
2400 | char info2[256 * 4]; |
2612 | char *p = info; |
2401 | char *p = info; |
2613 | |
2402 | |
2614 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2403 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}", |
2615 | count, |
2404 | count, |
2616 | uuid.c_str (), |
2405 | uuid.c_str (), |
2617 | &name, |
2406 | &name, |
2618 | title ? "\",title:\"" : "", |
2407 | title ? ",title:\"" : "", |
2619 | title ? (const char *)title : "", |
2408 | title ? (const char *)title : "", |
|
|
2409 | title ? "\"" : "", |
2620 | flag_desc (flagdesc, 512), type); |
2410 | flag_desc (flagdesc, 512), type); |
2621 | |
2411 | |
2622 | if (!this->flag[FLAG_REMOVED] && env) |
2412 | if (!flag[FLAG_REMOVED] && env) |
2623 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2413 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2624 | |
2414 | |
2625 | if (map) |
2415 | if (map) |
2626 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2416 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2627 | |
2417 | |
… | |
… | |
2657 | object::open_container (object *new_container) |
2447 | object::open_container (object *new_container) |
2658 | { |
2448 | { |
2659 | if (container == new_container) |
2449 | if (container == new_container) |
2660 | return; |
2450 | return; |
2661 | |
2451 | |
2662 | if (object *old_container = container) |
2452 | object *old_container = container; |
|
|
2453 | |
|
|
2454 | if (old_container) |
2663 | { |
2455 | { |
2664 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2456 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2665 | return; |
2457 | return; |
2666 | |
2458 | |
2667 | #if 0 |
2459 | #if 0 |
… | |
… | |
2669 | if (object *closer = old_container->inv) |
2461 | if (object *closer = old_container->inv) |
2670 | if (closer->type == CLOSE_CON) |
2462 | if (closer->type == CLOSE_CON) |
2671 | closer->destroy (); |
2463 | closer->destroy (); |
2672 | #endif |
2464 | #endif |
2673 | |
2465 | |
|
|
2466 | // make sure the container is available |
|
|
2467 | esrv_send_item (this, old_container); |
|
|
2468 | |
2674 | old_container->flag [FLAG_APPLIED] = 0; |
2469 | old_container->flag [FLAG_APPLIED] = false; |
2675 | container = 0; |
2470 | container = 0; |
2676 | |
2471 | |
|
|
2472 | // client needs item update to make it work, client bug requires this to be separate |
2677 | esrv_update_item (UPD_FLAGS, this, old_container); |
2473 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2474 | |
2678 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2475 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", old_container->query_name ()); |
2679 | play_sound (sound_find ("chest_close")); |
2476 | play_sound (sound_find ("chest_close")); |
2680 | } |
2477 | } |
2681 | |
2478 | |
2682 | if (new_container) |
2479 | if (new_container) |
2683 | { |
2480 | { |
… | |
… | |
2693 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2490 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2694 | new_container->insert (closer); |
2491 | new_container->insert (closer); |
2695 | } |
2492 | } |
2696 | #endif |
2493 | #endif |
2697 | |
2494 | |
2698 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2495 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", new_container->query_name ()); |
2699 | |
2496 | |
|
|
2497 | // make sure the container is available, client bug requires this to be separate |
|
|
2498 | esrv_send_item (this, new_container); |
|
|
2499 | |
2700 | new_container->flag [FLAG_APPLIED] = 1; |
2500 | new_container->flag [FLAG_APPLIED] = true; |
2701 | container = new_container; |
2501 | container = new_container; |
2702 | |
2502 | |
|
|
2503 | // client needs flag change |
2703 | esrv_update_item (UPD_FLAGS, this, new_container); |
2504 | esrv_update_item (UPD_FLAGS, this, new_container); |
2704 | esrv_send_inventory (this, new_container); |
2505 | esrv_send_inventory (this, new_container); |
2705 | play_sound (sound_find ("chest_open")); |
2506 | play_sound (sound_find ("chest_open")); |
2706 | } |
2507 | } |
|
|
2508 | // else if (!old_container->env && contr && contr->ns) |
|
|
2509 | // contr->ns->floorbox_reset (); |
2707 | } |
2510 | } |
2708 | |
2511 | |
2709 | object * |
2512 | object * |
2710 | object::force_find (const shstr name) |
2513 | object::force_find (shstr_tmp name) |
2711 | { |
2514 | { |
2712 | /* cycle through his inventory to look for the MARK we want to |
2515 | /* cycle through his inventory to look for the MARK we want to |
2713 | * place |
2516 | * place |
2714 | */ |
2517 | */ |
2715 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2518 | for (object *tmp = inv; tmp; tmp = tmp->below) |
… | |
… | |
2717 | return splay (tmp); |
2520 | return splay (tmp); |
2718 | |
2521 | |
2719 | return 0; |
2522 | return 0; |
2720 | } |
2523 | } |
2721 | |
2524 | |
|
|
2525 | //-GPL |
|
|
2526 | |
2722 | void |
2527 | void |
|
|
2528 | object::force_set_timer (int duration) |
|
|
2529 | { |
|
|
2530 | this->duration = 1; |
|
|
2531 | this->speed_left = -1.f; |
|
|
2532 | |
|
|
2533 | this->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2534 | } |
|
|
2535 | |
|
|
2536 | object * |
2723 | object::force_add (const shstr name, int duration) |
2537 | object::force_add (shstr_tmp name, int duration) |
2724 | { |
2538 | { |
2725 | if (object *force = force_find (name)) |
2539 | if (object *force = force_find (name)) |
2726 | force->destroy (); |
2540 | force->destroy (); |
2727 | |
2541 | |
2728 | object *force = get_archetype (FORCE_NAME); |
2542 | object *force = get_archetype (FORCE_NAME); |
2729 | |
2543 | |
2730 | force->slaying = name; |
2544 | force->slaying = name; |
2731 | force->stats.food = 1; |
2545 | force->force_set_timer (duration); |
2732 | force->speed_left = -1.f; |
|
|
2733 | |
|
|
2734 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2735 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2736 | force->flag [FLAG_APPLIED] = true; |
2546 | force->flag [FLAG_APPLIED] = true; |
2737 | |
2547 | |
2738 | insert (force); |
2548 | return insert (force); |
2739 | } |
2549 | } |
2740 | |
2550 | |
2741 | void |
2551 | void |
2742 | object::play_sound (faceidx sound) const |
2552 | object::play_sound (faceidx sound) const |
2743 | { |
2553 | { |
2744 | if (!sound) |
2554 | if (!sound) |
2745 | return; |
2555 | return; |
2746 | |
2556 | |
2747 | if (flag [FLAG_REMOVED]) |
2557 | if (is_on_map ()) |
|
|
2558 | map->play_sound (sound, x, y); |
|
|
2559 | else if (object *pl = in_player ()) |
|
|
2560 | pl->contr->play_sound (sound); |
|
|
2561 | } |
|
|
2562 | |
|
|
2563 | void |
|
|
2564 | object::say_msg (const char *msg) const |
|
|
2565 | { |
|
|
2566 | if (is_on_map ()) |
|
|
2567 | map->say_msg (msg, x, y); |
|
|
2568 | else if (object *pl = in_player ()) |
|
|
2569 | pl->contr->play_sound (sound); |
|
|
2570 | } |
|
|
2571 | |
|
|
2572 | void |
|
|
2573 | object::make_noise () |
|
|
2574 | { |
|
|
2575 | // we do not model noise in the map, so instead put |
|
|
2576 | // a temporary light into the noise source |
|
|
2577 | // could use the map instead, but that's less reliable for our |
|
|
2578 | // goal, which is to make invisibility a bit harder to exploit |
|
|
2579 | |
|
|
2580 | // currently only works sensibly for players |
|
|
2581 | if (!is_player ()) |
2748 | return; |
2582 | return; |
2749 | |
2583 | |
2750 | if (env) |
2584 | // find old force, or create new one |
2751 | { |
2585 | object *force = force_find (shstr_noise_force); |
2752 | if (object *pl = in_player ()) |
2586 | |
2753 | pl->contr->play_sound (sound); |
2587 | if (force) |
2754 | } |
2588 | force->speed_left = -1.f; // patch old speed up |
2755 | else |
2589 | else |
2756 | map->play_sound (sound, x, y); |
2590 | { |
2757 | } |
2591 | force = archetype::get (shstr_noise_force); |
2758 | |
2592 | |
|
|
2593 | force->slaying = shstr_noise_force; |
|
|
2594 | force->stats.food = 1; |
|
|
2595 | force->speed_left = -1.f; |
|
|
2596 | |
|
|
2597 | force->set_speed (1.f / 4.f); |
|
|
2598 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2599 | force->flag [FLAG_APPLIED] = true; |
|
|
2600 | |
|
|
2601 | insert (force); |
|
|
2602 | } |
|
|
2603 | } |
|
|
2604 | |