1 | /* |
1 | /* |
2 | CrossFire, A Multiplayer game for X-windows |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | |
3 | * |
4 | Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | Copyright (C) 2001 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | |
7 | * |
8 | This program is free software; you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
10 | the Free Software Foundation; either version 2 of the License, or |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | (at your option) any later version. |
11 | * (at your 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 GNU General Public License |
19 | along with this program; if not, write to the Free Software |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * |
21 | |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | The authors can be reached via e-mail at <crossfire@schmorp.de> |
|
|
23 | */ |
22 | */ |
24 | |
23 | |
25 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
26 | sub/add_weight will transcend the environment updating the carrying |
|
|
27 | variable. */ |
|
|
28 | #include <global.h> |
24 | #include <global.h> |
29 | #include <stdio.h> |
25 | #include <stdio.h> |
30 | #include <sys/types.h> |
26 | #include <sys/types.h> |
31 | #include <sys/uio.h> |
27 | #include <sys/uio.h> |
32 | #include <object.h> |
28 | #include <object.h> |
33 | #include <funcpoint.h> |
29 | #include <sproto.h> |
34 | #include <loader.h> |
30 | #include <loader.h> |
35 | |
31 | |
36 | #include <bitset> |
32 | #include <bitset> |
37 | |
33 | |
38 | int nrofallocobjects = 0; |
34 | UUID UUID::cur; |
39 | static UUID uuid; |
35 | static uint64_t seq_next_save; |
40 | const uint64 UUID_SKIP = 1<<19; |
36 | static const uint64 UUID_GAP = 1<<19; |
41 | |
37 | |
42 | objectvec objects; |
38 | objectvec objects; |
43 | activevec actives; |
39 | activevec actives; |
44 | |
40 | |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
41 | short freearr_x[SIZEOFFREE] = { |
|
|
42 | 0, |
|
|
43 | 0, 1, 1, 1, 0, -1, -1, -1, |
|
|
44 | 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
45 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
47 | }; |
46 | }; |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
47 | short freearr_y[SIZEOFFREE] = { |
|
|
48 | 0, |
|
|
49 | -1, -1, 0, 1, 1, 1, 0, -1, |
|
|
50 | -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
49 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
51 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
50 | }; |
52 | }; |
51 | int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, |
53 | int maxfree[SIZEOFFREE] = { |
|
|
54 | 0, |
|
|
55 | 9, 10, 13, 14, 17, 18, 21, 22, |
|
|
56 | 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, 48, |
52 | 48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
57 | 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
53 | }; |
58 | }; |
54 | int freedir[SIZEOFFREE] = { |
59 | int freedir[SIZEOFFREE] = { |
55 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
60 | 0, |
|
|
61 | 1, 2, 3, 4, 5, 6, 7, 8, |
|
|
62 | 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
56 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
63 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
57 | }; |
64 | }; |
58 | |
65 | |
59 | static void |
66 | static void |
60 | write_uuid (void) |
67 | write_uuid (uval64 skip, bool sync) |
61 | { |
68 | { |
62 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
69 | CALL_BEGIN (2); |
63 | |
70 | CALL_ARG_SV (newSVval64 (skip)); |
64 | sprintf (filename1, "%s/uuid", settings.localdir); |
71 | CALL_ARG_SV (boolSV (sync)); |
65 | sprintf (filename2, "%s/uuid~", settings.localdir); |
72 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
66 | |
73 | CALL_END; |
67 | FILE *fp; |
|
|
68 | |
|
|
69 | if (!(fp = fopen (filename2, "w"))) |
|
|
70 | { |
|
|
71 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
72 | return; |
|
|
73 | } |
|
|
74 | |
|
|
75 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
76 | fclose (fp); |
|
|
77 | rename (filename2, filename1); |
|
|
78 | } |
74 | } |
79 | |
75 | |
80 | static void |
76 | static void |
81 | read_uuid (void) |
77 | read_uuid (void) |
82 | { |
78 | { |
83 | char filename[MAX_BUF]; |
79 | char filename[MAX_BUF]; |
84 | |
80 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
81 | sprintf (filename, "%s/uuid", settings.localdir); |
|
|
82 | |
|
|
83 | seq_next_save = 0; |
86 | |
84 | |
87 | FILE *fp; |
85 | FILE *fp; |
88 | |
86 | |
89 | if (!(fp = fopen (filename, "r"))) |
87 | if (!(fp = fopen (filename, "r"))) |
90 | { |
88 | { |
91 | if (errno == ENOENT) |
89 | if (errno == ENOENT) |
92 | { |
90 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
91 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
92 | UUID::cur.seq = 0; |
95 | write_uuid (); |
93 | write_uuid (UUID_GAP, true); |
96 | return; |
94 | return; |
97 | } |
95 | } |
98 | |
96 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
97 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
100 | _exit (1); |
98 | _exit (1); |
101 | } |
99 | } |
102 | |
100 | |
103 | int version; |
101 | UUID::BUF buf; |
104 | unsigned long long uid; |
102 | buf[0] = 0; |
105 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
103 | fgets (buf, sizeof (buf), fp); |
|
|
104 | |
|
|
105 | if (!UUID::cur.parse (buf)) |
106 | { |
106 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
107 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 | _exit (1); |
108 | _exit (1); |
109 | } |
109 | } |
110 | |
110 | |
111 | uuid.seq = uid; |
111 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 | write_uuid (); |
112 | |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
113 | write_uuid (UUID_GAP, true); |
114 | fclose (fp); |
114 | fclose (fp); |
115 | } |
115 | } |
116 | |
116 | |
117 | UUID |
117 | UUID |
118 | gen_uuid () |
118 | UUID::gen () |
119 | { |
119 | { |
120 | UUID uid; |
120 | UUID uid; |
121 | |
121 | |
122 | uid.seq = ++uuid.seq; |
122 | uid.seq = ++cur.seq; |
123 | |
123 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
124 | if (expect_false (cur.seq >= seq_next_save)) |
125 | write_uuid (); |
125 | { |
|
|
126 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
127 | write_uuid (UUID_GAP, false); |
|
|
128 | } |
|
|
129 | |
126 | |
130 | |
127 | return uid; |
131 | return uid; |
128 | } |
132 | } |
129 | |
133 | |
130 | void |
134 | void |
131 | init_uuid () |
135 | UUID::init () |
132 | { |
136 | { |
133 | read_uuid (); |
137 | read_uuid (); |
134 | } |
138 | } |
135 | |
139 | |
136 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
140 | /* Returns TRUE if every key_values in wants has a partner with the same value in has. */ |
137 | static int |
141 | static bool |
138 | compare_ob_value_lists_one (const object *wants, const object *has) |
142 | compare_ob_value_lists_one (const object *wants, const object *has) |
139 | { |
143 | { |
140 | key_value *wants_field; |
|
|
141 | |
|
|
142 | /* n-squared behaviour (see get_ob_key_link()), but I'm hoping both |
144 | /* n-squared behaviour (see kv_get), but I'm hoping both |
143 | * objects with lists are rare, and lists stay short. If not, use a |
145 | * objects with lists are rare, and lists stay short. If not, use a |
144 | * different structure or at least keep the lists sorted... |
146 | * different structure or at least keep the lists sorted... |
145 | */ |
147 | */ |
146 | |
148 | |
147 | /* For each field in wants, */ |
149 | /* For each field in wants, */ |
148 | for (wants_field = wants->key_values; wants_field; wants_field = wants_field->next) |
150 | for (key_value *kv = wants->key_values; kv; kv = kv->next) |
149 | { |
151 | if (has->kv_get (kv->key) != kv->value) |
150 | key_value *has_field; |
152 | return false; |
151 | |
|
|
152 | /* Look for a field in has with the same key. */ |
|
|
153 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
154 | |
|
|
155 | if (has_field == NULL) |
|
|
156 | { |
|
|
157 | /* No field with that name. */ |
|
|
158 | return FALSE; |
|
|
159 | } |
|
|
160 | |
|
|
161 | /* Found the matching field. */ |
|
|
162 | if (has_field->value != wants_field->value) |
|
|
163 | { |
|
|
164 | /* Values don't match, so this half of the comparison is false. */ |
|
|
165 | return FALSE; |
|
|
166 | } |
|
|
167 | |
|
|
168 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
169 | } |
|
|
170 | |
153 | |
171 | /* If we get here, every field in wants has a matching field in has. */ |
154 | /* If we get here, every field in wants has a matching field in has. */ |
172 | return TRUE; |
155 | return true; |
173 | } |
156 | } |
174 | |
157 | |
175 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
158 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
176 | static int |
159 | static bool |
177 | compare_ob_value_lists (const object *ob1, const object *ob2) |
160 | compare_ob_value_lists (const object *ob1, const object *ob2) |
178 | { |
161 | { |
179 | /* However, there may be fields in has which aren't partnered in wants, |
162 | /* However, there may be fields in has which aren't partnered in wants, |
180 | * so we need to run the comparison *twice*. :( |
163 | * so we need to run the comparison *twice*. :( |
181 | */ |
164 | */ |
182 | return compare_ob_value_lists_one (ob1, ob2) && compare_ob_value_lists_one (ob2, ob1); |
165 | return compare_ob_value_lists_one (ob1, ob2) |
|
|
166 | && compare_ob_value_lists_one (ob2, ob1); |
183 | } |
167 | } |
184 | |
168 | |
185 | /* Function examines the 2 objects given to it, and returns true if |
169 | /* Function examines the 2 objects given to it, and returns true if |
186 | * they can be merged together. |
170 | * they can be merged together. |
187 | * |
171 | * |
… | |
… | |
202 | || ob1->speed != ob2->speed |
186 | || ob1->speed != ob2->speed |
203 | || ob1->value != ob2->value |
187 | || ob1->value != ob2->value |
204 | || ob1->name != ob2->name) |
188 | || ob1->name != ob2->name) |
205 | return 0; |
189 | return 0; |
206 | |
190 | |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
191 | /* Do not merge objects if nrof would overflow. First part checks |
208 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
192 | * for unsigned overflow (2c), second part checks whether the result |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
193 | * would fit into a 32 bit signed int, which is often used to hold |
210 | * used to store nrof). |
194 | * nrof values. |
211 | */ |
195 | */ |
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
196 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
213 | return 0; |
197 | return 0; |
214 | |
198 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
199 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
216 | * This is to the comparison of the flags below will be OK. We |
200 | * This is to the comparison of the flags below will be OK. We |
217 | * just can't ignore the been applied or identified flags, as they |
201 | * just can't ignore the been applied or identified flags, as they |
218 | * are not equal - just if it has been identified, the been_applied |
202 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
203 | * flags lose any meaning. |
220 | */ |
204 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
205 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
206 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
223 | |
207 | |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
208 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
209 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
226 | |
210 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
211 | if (ob1->arch->name != ob2->arch->name |
228 | || ob1->arch != ob2->arch |
|
|
229 | || ob1->name != ob2->name |
212 | || ob1->name != ob2->name |
230 | || ob1->title != ob2->title |
213 | || ob1->title != ob2->title |
231 | || ob1->msg != ob2->msg |
214 | || ob1->msg != ob2->msg |
232 | || ob1->weight != ob2->weight |
215 | || ob1->weight != ob2->weight |
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
|
|
235 | || ob1->attacktype != ob2->attacktype |
216 | || ob1->attacktype != ob2->attacktype |
236 | || ob1->magic != ob2->magic |
217 | || ob1->magic != ob2->magic |
237 | || ob1->slaying != ob2->slaying |
218 | || ob1->slaying != ob2->slaying |
238 | || ob1->skill != ob2->skill |
219 | || ob1->skill != ob2->skill |
239 | || ob1->value != ob2->value |
220 | || ob1->value != ob2->value |
… | |
… | |
246 | || ob1->move_block != ob2->move_block |
227 | || ob1->move_block != ob2->move_block |
247 | || ob1->move_allow != ob2->move_allow |
228 | || ob1->move_allow != ob2->move_allow |
248 | || ob1->move_on != ob2->move_on |
229 | || ob1->move_on != ob2->move_on |
249 | || ob1->move_off != ob2->move_off |
230 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
231 | || ob1->move_slow != ob2->move_slow |
251 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
232 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
252 | return 0; |
235 | return 0; |
253 | |
236 | |
|
|
237 | if ((ob1->flag ^ ob2->flag) |
|
|
238 | .reset (FLAG_INV_LOCKED) |
|
|
239 | .reset (FLAG_CLIENT_SENT) |
|
|
240 | .reset (FLAG_REMOVED) |
|
|
241 | .any ()) |
|
|
242 | return 0; |
|
|
243 | |
254 | /* This is really a spellbook check - really, we should |
244 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
245 | * not merge objects with real inventories, as splitting them |
|
|
246 | * is hard. |
256 | */ |
247 | */ |
257 | if (ob1->inv || ob2->inv) |
248 | if (ob1->inv || ob2->inv) |
258 | { |
249 | { |
259 | /* if one object has inventory but the other doesn't, not equiv */ |
250 | if (!(ob1->inv && ob2->inv)) |
260 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
251 | return 0; /* inventories differ in length */ |
261 | return 0; |
|
|
262 | |
252 | |
263 | /* Now check to see if the two inventory objects could merge */ |
253 | if (ob1->inv->below || ob2->inv->below) |
|
|
254 | return 0; /* more than one object in inv */ |
|
|
255 | |
264 | if (!object::can_merge (ob1->inv, ob2->inv)) |
256 | if (!object::can_merge (ob1->inv, ob2->inv)) |
265 | return 0; |
257 | return 0; /* inventory objects differ */ |
266 | |
258 | |
267 | /* inventory ok - still need to check rest of this object to see |
259 | /* inventory ok - still need to check rest of this object to see |
268 | * if it is valid. |
260 | * if it is valid. |
269 | */ |
261 | */ |
270 | } |
262 | } |
… | |
… | |
289 | if (ob1->level != ob2->level) |
281 | if (ob1->level != ob2->level) |
290 | return 0; |
282 | return 0; |
291 | break; |
283 | break; |
292 | } |
284 | } |
293 | |
285 | |
294 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
286 | if (ob1->key_values || ob2->key_values) |
295 | { |
287 | { |
296 | /* At least one of these has key_values. */ |
288 | /* At least one of these has key_values. */ |
297 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
289 | if ((!ob1->key_values) != (!ob2->key_values)) |
298 | /* One has fields, but the other one doesn't. */ |
290 | return 0; /* One has fields, but the other one doesn't. */ |
|
|
291 | |
|
|
292 | if (!compare_ob_value_lists (ob1, ob2)) |
299 | return 0; |
293 | return 0; |
300 | else if (!compare_ob_value_lists (ob1, ob2)) |
|
|
301 | return 0; |
|
|
302 | } |
294 | } |
303 | |
295 | |
304 | //TODO: generate an event or call into perl for additional checks |
|
|
305 | if (ob1->self || ob2->self) |
296 | if (ob1->self || ob2->self) |
306 | { |
297 | { |
307 | ob1->optimise (); |
298 | ob1->optimise (); |
308 | ob2->optimise (); |
299 | ob2->optimise (); |
309 | |
300 | |
310 | if (ob1->self || ob2->self) |
301 | if (ob1->self || ob2->self) |
|
|
302 | { |
|
|
303 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
304 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
305 | |
|
|
306 | if (k1 != k2) |
311 | return 0; |
307 | return 0; |
|
|
308 | |
|
|
309 | if (k1 == 0) |
|
|
310 | return 1; |
|
|
311 | |
|
|
312 | if (!cfperl_can_merge (ob1, ob2)) |
|
|
313 | return 0; |
|
|
314 | } |
312 | } |
315 | } |
313 | |
316 | |
314 | /* Everything passes, must be OK. */ |
317 | /* Everything passes, must be OK. */ |
315 | return 1; |
318 | return 1; |
316 | } |
319 | } |
317 | |
320 | |
|
|
321 | // find player who can see this object |
|
|
322 | object * |
|
|
323 | object::visible_to () const |
|
|
324 | { |
|
|
325 | if (client_visible () && !flag [FLAG_REMOVED]) |
|
|
326 | { |
|
|
327 | // see if we are in a container of sorts |
|
|
328 | if (env) |
|
|
329 | { |
|
|
330 | // the player inventory itself is always visible |
|
|
331 | if (env->type == PLAYER) |
|
|
332 | return env; |
|
|
333 | |
|
|
334 | // else a player could have our env open |
|
|
335 | object *envest = env->outer_env (); |
|
|
336 | |
|
|
337 | // the player itself is always on a map, so we will find him here |
|
|
338 | // even if our inv is in a player. |
|
|
339 | if (envest->is_on_map ()) |
|
|
340 | if (object *pl = envest->ms ().player ()) |
|
|
341 | if (pl->container == env) |
|
|
342 | return pl; |
|
|
343 | } |
|
|
344 | else |
|
|
345 | { |
|
|
346 | // maybe there is a player standing on the same mapspace |
|
|
347 | // this will catch the case where "this" is a player |
|
|
348 | if (object *pl = ms ().player ()) |
|
|
349 | if (!pl->container || this == pl->container) |
|
|
350 | return pl; |
|
|
351 | } |
|
|
352 | } |
|
|
353 | |
|
|
354 | return 0; |
|
|
355 | } |
|
|
356 | |
|
|
357 | // adjust weight per container type ("of holding") |
|
|
358 | static sint32 |
|
|
359 | weight_adjust (object *op, sint32 weight) |
|
|
360 | { |
|
|
361 | return op->type == CONTAINER |
|
|
362 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
363 | : weight; |
|
|
364 | } |
|
|
365 | |
318 | /* |
366 | /* |
|
|
367 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
368 | * and also updates how much the environment(s) is/are carrying. |
|
|
369 | */ |
|
|
370 | static void |
|
|
371 | adjust_weight (object *op, sint32 weight) |
|
|
372 | { |
|
|
373 | while (op) |
|
|
374 | { |
|
|
375 | weight = weight_adjust (op, weight); |
|
|
376 | |
|
|
377 | if (!weight) |
|
|
378 | return; |
|
|
379 | |
|
|
380 | op->carrying += weight; |
|
|
381 | |
|
|
382 | if (object *pl = op->visible_to ()) |
|
|
383 | if (pl != op) // player is handled lazily |
|
|
384 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
385 | |
|
|
386 | op = op->env; |
|
|
387 | } |
|
|
388 | } |
|
|
389 | |
|
|
390 | /* |
319 | * sum_weight() is a recursive function which calculates the weight |
391 | * this is a recursive function which calculates the weight |
320 | * an object is carrying. It goes through in figures out how much |
392 | * an object is carrying. It goes through op and figures out how much |
321 | * containers are carrying, and sums it up. |
393 | * containers are carrying, and sums it up. |
322 | */ |
394 | */ |
323 | long |
395 | void |
324 | sum_weight (object *op) |
396 | object::update_weight () |
325 | { |
397 | { |
326 | long sum; |
398 | sint32 sum = 0; |
327 | object *inv; |
|
|
328 | |
399 | |
329 | for (sum = 0, inv = op->inv; inv != NULL; inv = inv->below) |
400 | for (object *op = inv; op; op = op->below) |
330 | { |
401 | { |
331 | if (inv->inv) |
402 | if (op->inv) |
332 | sum_weight (inv); |
403 | op->update_weight (); |
333 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
404 | |
|
|
405 | sum += op->total_weight (); |
|
|
406 | } |
|
|
407 | |
|
|
408 | sum = weight_adjust (this, sum); |
|
|
409 | |
|
|
410 | if (sum != carrying) |
334 | } |
411 | { |
335 | |
|
|
336 | if (op->type == CONTAINER && op->stats.Str) |
|
|
337 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
338 | |
|
|
339 | if (op->carrying != sum) |
|
|
340 | op->carrying = sum; |
412 | carrying = sum; |
341 | |
413 | |
342 | return sum; |
414 | if (object *pl = visible_to ()) |
|
|
415 | if (pl != this) // player is handled lazily |
|
|
416 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
417 | } |
343 | } |
418 | } |
344 | |
419 | |
345 | /** |
420 | /* |
346 | * Return the outermost environment object for a given object. |
421 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
347 | */ |
422 | */ |
348 | |
|
|
349 | object * |
|
|
350 | object_get_env_recursive (object *op) |
|
|
351 | { |
|
|
352 | while (op->env != NULL) |
|
|
353 | op = op->env; |
|
|
354 | return op; |
|
|
355 | } |
|
|
356 | |
|
|
357 | /* |
|
|
358 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
359 | * Some error messages. |
|
|
360 | * The result of the dump is stored in the static global errmsg array. |
|
|
361 | */ |
|
|
362 | |
|
|
363 | char * |
423 | char * |
364 | dump_object (object *op) |
424 | dump_object (object *op) |
365 | { |
425 | { |
366 | if (!op) |
426 | if (!op) |
367 | return strdup ("[NULLOBJ]"); |
427 | return strdup ("[NULLOBJ]"); |
368 | |
428 | |
369 | object_freezer freezer; |
429 | object_freezer freezer; |
370 | save_object (freezer, op, 1); |
430 | op->write (freezer); |
371 | return freezer.as_string (); |
431 | return freezer.as_string (); |
372 | } |
432 | } |
373 | |
433 | |
374 | /* |
434 | /* |
375 | * get_nearest_part(multi-object, object 2) returns the part of the |
435 | * get_nearest_part(multi-object, object 2) returns the part of the |
376 | * multi-object 1 which is closest to the second object. |
436 | * multi-object 1 which is closest to the second object. |
377 | * If it's not a multi-object, it is returned. |
437 | * If it's not a multi-object, it is returned. |
378 | */ |
438 | */ |
379 | |
|
|
380 | object * |
439 | object * |
381 | get_nearest_part (object *op, const object *pl) |
440 | get_nearest_part (object *op, const object *pl) |
382 | { |
441 | { |
383 | object *tmp, *closest; |
442 | object *tmp, *closest; |
384 | int last_dist, i; |
443 | int last_dist, i; |
385 | |
444 | |
386 | if (op->more == NULL) |
445 | if (!op->more) |
387 | return op; |
446 | return op; |
|
|
447 | |
388 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
448 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
449 | tmp; |
|
|
450 | tmp = tmp->more) |
389 | if ((i = distance (tmp, pl)) < last_dist) |
451 | if ((i = distance (tmp, pl)) < last_dist) |
390 | closest = tmp, last_dist = i; |
452 | closest = tmp, last_dist = i; |
|
|
453 | |
391 | return closest; |
454 | return closest; |
392 | } |
455 | } |
393 | |
456 | |
394 | /* |
457 | /* |
395 | * Returns the object which has the count-variable equal to the argument. |
458 | * Returns the object which has the count-variable equal to the argument. |
|
|
459 | * VERRRY slow. |
396 | */ |
460 | */ |
397 | object * |
461 | object * |
398 | find_object (tag_t i) |
462 | find_object (tag_t i) |
399 | { |
463 | { |
400 | for_all_objects (op) |
464 | for_all_objects (op) |
… | |
… | |
420 | break; |
484 | break; |
421 | |
485 | |
422 | return op; |
486 | return op; |
423 | } |
487 | } |
424 | |
488 | |
425 | void |
|
|
426 | free_all_object_data () |
|
|
427 | { |
|
|
428 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
429 | } |
|
|
430 | |
|
|
431 | /* |
489 | /* |
432 | * Sets the owner and sets the skill and exp pointers to owner's current |
490 | * Sets the owner and sets the skill and exp pointers to owner's current |
433 | * skill and experience objects. |
491 | * skill and experience objects. |
|
|
492 | * ACTUALLY NO! investigate! TODO |
434 | */ |
493 | */ |
435 | void |
494 | void |
436 | object::set_owner (object *owner) |
495 | object::set_owner (object *owner) |
437 | { |
496 | { |
|
|
497 | // allow objects which own objects |
438 | if (!owner) |
498 | if (owner) |
439 | return; |
|
|
440 | |
|
|
441 | /* next line added to allow objects which own objects */ |
|
|
442 | /* Add a check for ownercounts in here, as I got into an endless loop |
|
|
443 | * with the fireball owning a poison cloud which then owned the |
|
|
444 | * fireball. I believe that was caused by one of the objects getting |
|
|
445 | * freed and then another object replacing it. Since the ownercounts |
|
|
446 | * didn't match, this check is valid and I believe that cause is valid. |
|
|
447 | */ |
|
|
448 | while (owner->owner) |
499 | while (owner->owner) |
449 | owner = owner->owner; |
500 | owner = owner->owner; |
|
|
501 | |
|
|
502 | if (flag [FLAG_FREED]) |
|
|
503 | { |
|
|
504 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
505 | return; |
|
|
506 | } |
450 | |
507 | |
451 | this->owner = owner; |
508 | this->owner = owner; |
|
|
509 | } |
|
|
510 | |
|
|
511 | int |
|
|
512 | object::slottype () const |
|
|
513 | { |
|
|
514 | if (type == SKILL) |
|
|
515 | { |
|
|
516 | if (IS_COMBAT_SKILL (subtype)) return slot_combat; |
|
|
517 | if (IS_RANGED_SKILL (subtype)) return slot_ranged; |
|
|
518 | } |
|
|
519 | else |
|
|
520 | { |
|
|
521 | if (slot [body_combat].info) return slot_combat; |
|
|
522 | if (slot [body_range ].info) return slot_ranged; |
|
|
523 | } |
|
|
524 | |
|
|
525 | return slot_none; |
|
|
526 | } |
|
|
527 | |
|
|
528 | bool |
|
|
529 | object::change_weapon (object *ob) |
|
|
530 | { |
|
|
531 | if (current_weapon == ob) |
|
|
532 | return true; |
|
|
533 | |
|
|
534 | if (chosen_skill) |
|
|
535 | chosen_skill->flag [FLAG_APPLIED] = false; |
|
|
536 | |
|
|
537 | current_weapon = ob; |
|
|
538 | chosen_skill = !ob || ob->type == SKILL ? ob : find_skill_by_name (this, ob->skill); |
|
|
539 | |
|
|
540 | if (chosen_skill) |
|
|
541 | chosen_skill->flag [FLAG_APPLIED] = true; |
|
|
542 | |
|
|
543 | update_stats (); |
|
|
544 | |
|
|
545 | if (ob) |
|
|
546 | { |
|
|
547 | // now check wether any body locations became invalid, in which case |
|
|
548 | // we cannot apply the weapon at the moment. |
|
|
549 | for (int i = 0; i < NUM_BODY_LOCATIONS; ++i) |
|
|
550 | if (slot[i].used < 0) |
|
|
551 | { |
|
|
552 | current_weapon = chosen_skill = 0; |
|
|
553 | update_stats (); |
|
|
554 | |
|
|
555 | new_draw_info_format (NDI_UNIQUE, 0, this, |
|
|
556 | "You try to balance all your items at once, " |
|
|
557 | "but the %s is just too much for your body. " |
|
|
558 | "[You need to unapply some items first.]", &ob->name); |
|
|
559 | return false; |
|
|
560 | } |
|
|
561 | |
|
|
562 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
|
|
563 | } |
|
|
564 | else |
|
|
565 | ;//new_draw_info_format (NDI_UNIQUE, 0, this, "You unwield your weapons."); |
|
|
566 | |
|
|
567 | if (ob && !ob->flag [FLAG_APPLIED] && ob->type != SPELL) |
|
|
568 | { |
|
|
569 | LOG (llevError | logBacktrace, "%s changed to unapplied weapon %s", |
|
|
570 | &name, ob->debug_desc ()); |
|
|
571 | return false; |
|
|
572 | } |
|
|
573 | |
|
|
574 | return true; |
452 | } |
575 | } |
453 | |
576 | |
454 | /* Zero the key_values on op, decrementing the shared-string |
577 | /* Zero the key_values on op, decrementing the shared-string |
455 | * refcounts and freeing the links. |
578 | * refcounts and freeing the links. |
456 | */ |
579 | */ |
457 | static void |
580 | static void |
458 | free_key_values (object *op) |
581 | free_key_values (object *op) |
459 | { |
582 | { |
460 | for (key_value *i = op->key_values; i != 0;) |
583 | for (key_value *i = op->key_values; i; ) |
461 | { |
584 | { |
462 | key_value *next = i->next; |
585 | key_value *next = i->next; |
463 | delete i; |
586 | delete i; |
464 | |
587 | |
465 | i = next; |
588 | i = next; |
… | |
… | |
477 | * will point at garbage. |
600 | * will point at garbage. |
478 | */ |
601 | */ |
479 | void |
602 | void |
480 | object::copy_to (object *dst) |
603 | object::copy_to (object *dst) |
481 | { |
604 | { |
482 | bool is_freed = QUERY_FLAG (dst, FLAG_FREED); |
605 | dst->remove (); |
483 | bool is_removed = QUERY_FLAG (dst, FLAG_REMOVED); |
|
|
484 | |
|
|
485 | *(object_copy *)dst = *this; |
606 | *(object_copy *)dst = *this; |
486 | |
607 | dst->flag [FLAG_REMOVED] = true; |
487 | if (is_freed) |
|
|
488 | SET_FLAG (dst, FLAG_FREED); |
|
|
489 | |
|
|
490 | if (is_removed) |
|
|
491 | SET_FLAG (dst, FLAG_REMOVED); |
|
|
492 | |
|
|
493 | if (speed < 0) |
|
|
494 | dst->speed_left = speed_left - RANDOM () % 200 / 100.0; |
|
|
495 | |
608 | |
496 | /* Copy over key_values, if any. */ |
609 | /* Copy over key_values, if any. */ |
497 | if (key_values) |
610 | if (key_values) |
498 | { |
611 | { |
499 | key_value *tail = 0; |
612 | key_value *tail = 0; |
500 | key_value *i; |
|
|
501 | |
|
|
502 | dst->key_values = 0; |
613 | dst->key_values = 0; |
503 | |
614 | |
504 | for (i = key_values; i; i = i->next) |
615 | for (key_value *i = key_values; i; i = i->next) |
505 | { |
616 | { |
506 | key_value *new_link = new key_value; |
617 | key_value *new_link = new key_value; |
507 | |
618 | |
508 | new_link->next = 0; |
619 | new_link->next = 0; |
509 | new_link->key = i->key; |
620 | new_link->key = i->key; |
510 | new_link->value = i->value; |
621 | new_link->value = i->value; |
511 | |
622 | |
512 | /* Try and be clever here, too. */ |
623 | /* Try and be clever here, too. */ |
513 | if (!dst->key_values) |
624 | if (!dst->key_values) |
514 | { |
625 | { |
… | |
… | |
521 | tail = new_link; |
632 | tail = new_link; |
522 | } |
633 | } |
523 | } |
634 | } |
524 | } |
635 | } |
525 | |
636 | |
|
|
637 | if (speed < 0) |
|
|
638 | dst->speed_left -= rndm (); |
|
|
639 | |
526 | dst->set_speed (dst->speed); |
640 | dst->set_speed (dst->speed); |
|
|
641 | } |
|
|
642 | |
|
|
643 | void |
|
|
644 | object::instantiate () |
|
|
645 | { |
|
|
646 | if (!uuid.seq) // HACK |
|
|
647 | uuid = UUID::gen (); |
|
|
648 | |
|
|
649 | speed_left = -0.1f; |
|
|
650 | /* copy the body_info to the body_used - this is only really |
|
|
651 | * need for monsters, but doesn't hurt to do it for everything. |
|
|
652 | * by doing so, when a monster is created, it has good starting |
|
|
653 | * values for the body_used info, so when items are created |
|
|
654 | * for it, they can be properly equipped. |
|
|
655 | */ |
|
|
656 | for (int i = NUM_BODY_LOCATIONS; i--; ) |
|
|
657 | slot[i].used = slot[i].info; |
|
|
658 | |
|
|
659 | attachable::instantiate (); |
527 | } |
660 | } |
528 | |
661 | |
529 | object * |
662 | object * |
530 | object::clone () |
663 | object::clone () |
531 | { |
664 | { |
532 | object *neu = create (); |
665 | object *neu = create (); |
533 | copy_to (neu); |
666 | copy_to (neu); |
|
|
667 | neu->map = map; // not copied by copy_to |
534 | return neu; |
668 | return neu; |
535 | } |
669 | } |
536 | |
670 | |
537 | /* |
671 | /* |
538 | * If an object with the IS_TURNABLE() flag needs to be turned due |
672 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
589 | * UP_OBJ_FACE: only the objects face has changed. |
723 | * UP_OBJ_FACE: only the objects face has changed. |
590 | */ |
724 | */ |
591 | void |
725 | void |
592 | update_object (object *op, int action) |
726 | update_object (object *op, int action) |
593 | { |
727 | { |
594 | MoveType move_on, move_off, move_block, move_slow; |
728 | if (!op) |
595 | |
|
|
596 | if (op == NULL) |
|
|
597 | { |
729 | { |
598 | /* this should never happen */ |
730 | /* this should never happen */ |
599 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
731 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
600 | return; |
732 | return; |
601 | } |
733 | } |
602 | |
734 | |
603 | if (op->env) |
735 | if (!op->is_on_map ()) |
604 | { |
736 | { |
605 | /* Animation is currently handled by client, so nothing |
737 | /* Animation is currently handled by client, so nothing |
606 | * to do in this case. |
738 | * to do in this case. |
607 | */ |
739 | */ |
608 | return; |
740 | return; |
609 | } |
741 | } |
610 | |
|
|
611 | /* If the map is saving, don't do anything as everything is |
|
|
612 | * going to get freed anyways. |
|
|
613 | */ |
|
|
614 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
615 | return; |
|
|
616 | |
742 | |
617 | /* make sure the object is within map boundaries */ |
743 | /* make sure the object is within map boundaries */ |
618 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
744 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
619 | { |
745 | { |
620 | LOG (llevError, "update_object() called for object out of map!\n"); |
746 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
670 | face = blank_face; |
796 | face = blank_face; |
671 | } |
797 | } |
672 | |
798 | |
673 | object::~object () |
799 | object::~object () |
674 | { |
800 | { |
|
|
801 | unlink (); |
|
|
802 | |
675 | free_key_values (this); |
803 | free_key_values (this); |
676 | } |
804 | } |
677 | |
805 | |
678 | static int object_count; |
806 | static int object_count; |
679 | |
807 | |
680 | void object::link () |
808 | void object::link () |
681 | { |
809 | { |
682 | assert (!index);//D |
810 | assert (!index);//D |
683 | uuid = gen_uuid (); |
811 | uuid = UUID::gen (); |
684 | count = ++object_count; |
812 | count = ++object_count; |
685 | |
813 | |
686 | refcnt_inc (); |
814 | refcnt_inc (); |
687 | objects.insert (this); |
815 | objects.insert (this); |
688 | } |
816 | } |
689 | |
817 | |
690 | void object::unlink () |
818 | void object::unlink () |
691 | { |
819 | { |
692 | assert (index);//D |
820 | if (!index) |
|
|
821 | return; |
|
|
822 | |
693 | objects.erase (this); |
823 | objects.erase (this); |
694 | refcnt_dec (); |
824 | refcnt_dec (); |
695 | } |
825 | } |
696 | |
826 | |
697 | void |
827 | void |
… | |
… | |
759 | object::destroy_inv (bool drop_to_ground) |
889 | object::destroy_inv (bool drop_to_ground) |
760 | { |
890 | { |
761 | // need to check first, because the checks below might segfault |
891 | // need to check first, because the checks below might segfault |
762 | // as we might be on an invalid mapspace and crossfire code |
892 | // as we might be on an invalid mapspace and crossfire code |
763 | // is too buggy to ensure that the inventory is empty. |
893 | // is too buggy to ensure that the inventory is empty. |
764 | // corollary: if you create arrows etc. with stuff in tis inventory, |
894 | // corollary: if you create arrows etc. with stuff in its inventory, |
765 | // cf will crash below with off-map x and y |
895 | // cf will crash below with off-map x and y |
766 | if (!inv) |
896 | if (!inv) |
767 | return; |
897 | return; |
768 | |
898 | |
769 | /* Only if the space blocks everything do we not process - |
899 | /* Only if the space blocks everything do we not process - |
770 | * if some form of movement is allowed, let objects |
900 | * if some form of movement is allowed, let objects |
771 | * drop on that space. |
901 | * drop on that space. |
772 | */ |
902 | */ |
773 | if (!drop_to_ground |
903 | if (!drop_to_ground |
774 | || !map |
904 | || !map |
775 | || map->in_memory != MAP_IN_MEMORY |
905 | || map->in_memory != MAP_ACTIVE |
|
|
906 | || map->nodrop |
776 | || ms ().move_block == MOVE_ALL) |
907 | || ms ().move_block == MOVE_ALL) |
777 | { |
908 | { |
778 | while (inv) |
909 | while (inv) |
779 | { |
910 | { |
780 | inv->destroy_inv (drop_to_ground); |
911 | inv->destroy_inv (false); |
781 | inv->destroy (); |
912 | inv->destroy (); |
782 | } |
913 | } |
783 | } |
914 | } |
784 | else |
915 | else |
785 | { /* Put objects in inventory onto this space */ |
916 | { /* Put objects in inventory onto this space */ |
… | |
… | |
791 | || op->flag [FLAG_NO_DROP] |
922 | || op->flag [FLAG_NO_DROP] |
792 | || op->type == RUNE |
923 | || op->type == RUNE |
793 | || op->type == TRAP |
924 | || op->type == TRAP |
794 | || op->flag [FLAG_IS_A_TEMPLATE] |
925 | || op->flag [FLAG_IS_A_TEMPLATE] |
795 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
926 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
796 | op->destroy (); |
927 | op->destroy (true); |
797 | else |
928 | else |
798 | map->insert (op, x, y); |
929 | map->insert (op, x, y); |
799 | } |
930 | } |
800 | } |
931 | } |
801 | } |
932 | } |
… | |
… | |
805 | object *op = new object; |
936 | object *op = new object; |
806 | op->link (); |
937 | op->link (); |
807 | return op; |
938 | return op; |
808 | } |
939 | } |
809 | |
940 | |
|
|
941 | static struct freed_map : maptile |
|
|
942 | { |
|
|
943 | freed_map () |
|
|
944 | { |
|
|
945 | path = "<freed objects map>"; |
|
|
946 | name = "/internal/freed_objects_map"; |
|
|
947 | width = 3; |
|
|
948 | height = 3; |
|
|
949 | nodrop = 1; |
|
|
950 | |
|
|
951 | alloc (); |
|
|
952 | in_memory = MAP_ACTIVE; |
|
|
953 | } |
|
|
954 | |
|
|
955 | ~freed_map () |
|
|
956 | { |
|
|
957 | destroy (); |
|
|
958 | } |
|
|
959 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
960 | |
810 | void |
961 | void |
811 | object::do_destroy () |
962 | object::do_destroy () |
812 | { |
963 | { |
813 | attachable::do_destroy (); |
|
|
814 | |
|
|
815 | if (flag [FLAG_IS_LINKED]) |
964 | if (flag [FLAG_IS_LINKED]) |
816 | remove_button_link (this); |
965 | remove_button_link (this); |
817 | |
966 | |
818 | if (flag [FLAG_FRIENDLY]) |
967 | if (flag [FLAG_FRIENDLY]) |
819 | remove_friendly_object (this); |
968 | remove_friendly_object (this); |
820 | |
969 | |
821 | if (!flag [FLAG_REMOVED]) |
|
|
822 | remove (); |
970 | remove (); |
823 | |
971 | |
824 | destroy_inv (true); |
972 | attachable::do_destroy (); |
825 | |
973 | |
826 | deactivate (); |
974 | deactivate (); |
827 | unlink (); |
975 | unlink (); |
828 | |
976 | |
829 | flag [FLAG_FREED] = 1; |
977 | flag [FLAG_FREED] = 1; |
830 | |
978 | |
831 | // hack to ensure that freed objects still have a valid map |
979 | // hack to ensure that freed objects still have a valid map |
832 | { |
|
|
833 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
834 | |
|
|
835 | if (!freed_map) |
|
|
836 | { |
|
|
837 | freed_map = new maptile; |
|
|
838 | |
|
|
839 | freed_map->name = "/internal/freed_objects_map"; |
|
|
840 | freed_map->width = 3; |
|
|
841 | freed_map->height = 3; |
|
|
842 | |
|
|
843 | freed_map->alloc (); |
|
|
844 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
845 | } |
|
|
846 | |
|
|
847 | map = freed_map; |
980 | map = &freed_map; |
848 | x = 1; |
981 | x = 1; |
849 | y = 1; |
982 | y = 1; |
850 | } |
|
|
851 | |
|
|
852 | head = 0; |
|
|
853 | |
983 | |
854 | if (more) |
984 | if (more) |
855 | { |
985 | { |
856 | more->destroy (); |
986 | more->destroy (); |
857 | more = 0; |
987 | more = 0; |
858 | } |
988 | } |
859 | |
989 | |
|
|
990 | head = 0; |
|
|
991 | |
860 | // clear those pointers that likely might have circular references to us |
992 | // clear those pointers that likely might cause circular references |
861 | owner = 0; |
993 | owner = 0; |
862 | enemy = 0; |
994 | enemy = 0; |
863 | attacked_by = 0; |
995 | attacked_by = 0; |
|
|
996 | current_weapon = 0; |
864 | } |
997 | } |
865 | |
998 | |
866 | void |
999 | void |
867 | object::destroy (bool destroy_inventory) |
1000 | object::destroy (bool destroy_inventory) |
868 | { |
1001 | { |
869 | if (destroyed ()) |
1002 | if (destroyed ()) |
870 | return; |
1003 | return; |
871 | |
1004 | |
|
|
1005 | if (!is_head () && !head->destroyed ()) |
|
|
1006 | { |
|
|
1007 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
|
|
1008 | head->destroy (destroy_inventory); |
|
|
1009 | return; |
|
|
1010 | } |
|
|
1011 | |
872 | if (destroy_inventory) |
1012 | destroy_inv (!destroy_inventory); |
873 | destroy_inv (false); |
1013 | |
|
|
1014 | if (is_head ()) |
|
|
1015 | if (sound_destroy) |
|
|
1016 | play_sound (sound_destroy); |
|
|
1017 | else if (flag [FLAG_MONSTER]) |
|
|
1018 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
874 | |
1019 | |
875 | attachable::destroy (); |
1020 | attachable::destroy (); |
876 | } |
|
|
877 | |
|
|
878 | /* |
|
|
879 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
880 | * weight of an object (and what is carried by it's environment(s)). |
|
|
881 | */ |
|
|
882 | void |
|
|
883 | sub_weight (object *op, signed long weight) |
|
|
884 | { |
|
|
885 | while (op != NULL) |
|
|
886 | { |
|
|
887 | if (op->type == CONTAINER) |
|
|
888 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
889 | |
|
|
890 | op->carrying -= weight; |
|
|
891 | op = op->env; |
|
|
892 | } |
|
|
893 | } |
1021 | } |
894 | |
1022 | |
895 | /* op->remove (): |
1023 | /* op->remove (): |
896 | * This function removes the object op from the linked list of objects |
1024 | * This function removes the object op from the linked list of objects |
897 | * which it is currently tied to. When this function is done, the |
1025 | * which it is currently tied to. When this function is done, the |
898 | * object will have no environment. If the object previously had an |
1026 | * object will have no environment. If the object previously had an |
899 | * environment, the x and y coordinates will be updated to |
1027 | * environment, the x and y coordinates will be updated to |
900 | * the previous environment. |
1028 | * the previous environment. |
901 | * Beware: This function is called from the editor as well! |
|
|
902 | */ |
1029 | */ |
903 | void |
1030 | void |
904 | object::remove () |
1031 | object::do_remove () |
905 | { |
1032 | { |
906 | object *tmp, *last = 0; |
1033 | object *tmp, *last = 0; |
907 | object *otmp; |
1034 | object *otmp; |
908 | |
1035 | |
909 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1036 | if (flag [FLAG_REMOVED]) |
910 | return; |
1037 | return; |
911 | |
1038 | |
912 | SET_FLAG (this, FLAG_REMOVED); |
|
|
913 | INVOKE_OBJECT (REMOVE, this); |
1039 | INVOKE_OBJECT (REMOVE, this); |
|
|
1040 | |
|
|
1041 | flag [FLAG_REMOVED] = true; |
914 | |
1042 | |
915 | if (more) |
1043 | if (more) |
916 | more->remove (); |
1044 | more->remove (); |
917 | |
1045 | |
918 | /* |
1046 | /* |
919 | * In this case, the object to be removed is in someones |
1047 | * In this case, the object to be removed is in someones |
920 | * inventory. |
1048 | * inventory. |
921 | */ |
1049 | */ |
922 | if (env) |
1050 | if (env) |
923 | { |
1051 | { |
|
|
1052 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
|
|
1053 | if (object *pl = visible_to ()) |
|
|
1054 | esrv_del_item (pl->contr, count); |
|
|
1055 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
|
|
1056 | |
|
|
1057 | adjust_weight (env, -total_weight ()); |
|
|
1058 | |
|
|
1059 | *(above ? &above->below : &env->inv) = below; |
|
|
1060 | |
924 | if (nrof) |
1061 | if (below) |
925 | sub_weight (env, weight * nrof); |
1062 | below->above = above; |
926 | else |
1063 | |
927 | sub_weight (env, weight + carrying); |
1064 | /* we set up values so that it could be inserted into |
|
|
1065 | * the map, but we don't actually do that - it is up |
|
|
1066 | * to the caller to decide what we want to do. |
|
|
1067 | */ |
|
|
1068 | map = env->map; |
|
|
1069 | x = env->x; |
|
|
1070 | y = env->y; |
|
|
1071 | above = 0; |
|
|
1072 | below = 0; |
|
|
1073 | env = 0; |
928 | |
1074 | |
929 | /* NO_FIX_PLAYER is set when a great many changes are being |
1075 | /* NO_FIX_PLAYER is set when a great many changes are being |
930 | * made to players inventory. If set, avoiding the call |
1076 | * made to players inventory. If set, avoiding the call |
931 | * to save cpu time. |
1077 | * to save cpu time. |
932 | */ |
1078 | */ |
933 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1079 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
934 | otmp->update_stats (); |
1080 | otmp->update_stats (); |
935 | |
|
|
936 | if (above) |
|
|
937 | above->below = below; |
|
|
938 | else |
|
|
939 | env->inv = below; |
|
|
940 | |
|
|
941 | if (below) |
|
|
942 | below->above = above; |
|
|
943 | |
|
|
944 | /* we set up values so that it could be inserted into |
|
|
945 | * the map, but we don't actually do that - it is up |
|
|
946 | * to the caller to decide what we want to do. |
|
|
947 | */ |
|
|
948 | x = env->x, y = env->y; |
|
|
949 | map = env->map; |
|
|
950 | above = 0, below = 0; |
|
|
951 | env = 0; |
|
|
952 | } |
1081 | } |
953 | else if (map) |
1082 | else if (map) |
954 | { |
1083 | { |
955 | if (type == PLAYER) |
1084 | map->dirty = true; |
|
|
1085 | mapspace &ms = this->ms (); |
|
|
1086 | |
|
|
1087 | if (object *pl = ms.player ()) |
956 | { |
1088 | { |
|
|
1089 | if (type == PLAYER) // this == pl(!) |
|
|
1090 | { |
|
|
1091 | // leaving a spot always closes any open container on the ground |
|
|
1092 | if (container && !container->env) |
|
|
1093 | // this causes spurious floorbox updates, but it ensures |
|
|
1094 | // that the CLOSE event is being sent. |
|
|
1095 | close_container (); |
|
|
1096 | |
957 | --map->players; |
1097 | --map->players; |
958 | map->touch (); |
1098 | map->touch (); |
|
|
1099 | } |
|
|
1100 | else if (pl->container == this) |
|
|
1101 | { |
|
|
1102 | // removing a container should close it |
|
|
1103 | close_container (); |
|
|
1104 | } |
|
|
1105 | |
|
|
1106 | esrv_del_item (pl->contr, count); |
959 | } |
1107 | } |
960 | |
|
|
961 | map->dirty = true; |
|
|
962 | |
1108 | |
963 | /* link the object above us */ |
1109 | /* link the object above us */ |
964 | if (above) |
1110 | if (above) |
965 | above->below = below; |
1111 | above->below = below; |
966 | else |
1112 | else |
967 | map->at (x, y).top = below; /* we were top, set new top */ |
1113 | ms.top = below; /* we were top, set new top */ |
968 | |
1114 | |
969 | /* Relink the object below us, if there is one */ |
1115 | /* Relink the object below us, if there is one */ |
970 | if (below) |
1116 | if (below) |
971 | below->above = above; |
1117 | below->above = above; |
972 | else |
1118 | else |
… | |
… | |
974 | /* Nothing below, which means we need to relink map object for this space |
1120 | /* Nothing below, which means we need to relink map object for this space |
975 | * use translated coordinates in case some oddness with map tiling is |
1121 | * use translated coordinates in case some oddness with map tiling is |
976 | * evident |
1122 | * evident |
977 | */ |
1123 | */ |
978 | if (GET_MAP_OB (map, x, y) != this) |
1124 | if (GET_MAP_OB (map, x, y) != this) |
979 | { |
|
|
980 | char *dump = dump_object (this); |
|
|
981 | LOG (llevError, |
|
|
982 | "remove_ob: GET_MAP_OB does not return object to be removed even though it appears to be on the bottom?\n%s\n", dump); |
1125 | 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 ()); |
983 | free (dump); |
|
|
984 | dump = dump_object (GET_MAP_OB (map, x, y)); |
|
|
985 | LOG (llevError, "%s\n", dump); |
|
|
986 | free (dump); |
|
|
987 | } |
|
|
988 | |
1126 | |
989 | map->at (x, y).bot = above; /* goes on above it. */ |
1127 | ms.bot = above; /* goes on above it. */ |
990 | } |
1128 | } |
991 | |
1129 | |
992 | above = 0; |
1130 | above = 0; |
993 | below = 0; |
1131 | below = 0; |
994 | |
1132 | |
995 | if (map->in_memory == MAP_SAVING) |
1133 | if (map->in_memory == MAP_SAVING) |
996 | return; |
1134 | return; |
997 | |
1135 | |
998 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1136 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
999 | |
1137 | |
|
|
1138 | if (object *pl = ms.player ()) |
|
|
1139 | { |
|
|
1140 | if (pl->container == this) |
|
|
1141 | /* If a container that the player is currently using somehow gets |
|
|
1142 | * removed (most likely destroyed), update the player view |
|
|
1143 | * appropriately. |
|
|
1144 | */ |
|
|
1145 | pl->close_container (); |
|
|
1146 | |
|
|
1147 | //TODO: the floorbox prev/next might need updating |
|
|
1148 | //esrv_del_item (pl->contr, count); |
|
|
1149 | //TODO: update floorbox to preserve ordering |
|
|
1150 | if (pl->contr->ns) |
|
|
1151 | pl->contr->ns->floorbox_update (); |
|
|
1152 | } |
|
|
1153 | |
1000 | for (tmp = map->at (x, y).bot; tmp; tmp = tmp->above) |
1154 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1001 | { |
1155 | { |
1002 | /* No point updating the players look faces if he is the object |
1156 | /* No point updating the players look faces if he is the object |
1003 | * being removed. |
1157 | * being removed. |
1004 | */ |
1158 | */ |
1005 | |
|
|
1006 | if (tmp->type == PLAYER && tmp != this) |
|
|
1007 | { |
|
|
1008 | /* If a container that the player is currently using somehow gets |
|
|
1009 | * removed (most likely destroyed), update the player view |
|
|
1010 | * appropriately. |
|
|
1011 | */ |
|
|
1012 | if (tmp->container == this) |
|
|
1013 | { |
|
|
1014 | flag [FLAG_APPLIED] = 0; |
|
|
1015 | tmp->container = 0; |
|
|
1016 | } |
|
|
1017 | |
|
|
1018 | if (tmp->contr->ns) |
|
|
1019 | tmp->contr->ns->floorbox_update (); |
|
|
1020 | } |
|
|
1021 | |
1159 | |
1022 | /* See if object moving off should effect something */ |
1160 | /* See if object moving off should effect something */ |
1023 | if (check_walk_off |
1161 | if (check_walk_off |
1024 | && ((move_type & tmp->move_off) |
1162 | && ((move_type & tmp->move_off) |
1025 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1163 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1028 | |
1166 | |
1029 | if (destroyed ()) |
1167 | if (destroyed ()) |
1030 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1168 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1031 | } |
1169 | } |
1032 | |
1170 | |
1033 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1034 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1035 | if (tmp->above == tmp) |
|
|
1036 | tmp->above = 0; |
|
|
1037 | |
|
|
1038 | last = tmp; |
1171 | last = tmp; |
1039 | } |
1172 | } |
1040 | |
1173 | |
1041 | /* last == NULL if there are no objects on this space */ |
1174 | /* last == NULL if there are no objects on this space */ |
1042 | //TODO: this makes little sense, why only update the topmost object? |
1175 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1062 | merge_ob (object *op, object *top) |
1195 | merge_ob (object *op, object *top) |
1063 | { |
1196 | { |
1064 | if (!op->nrof) |
1197 | if (!op->nrof) |
1065 | return 0; |
1198 | return 0; |
1066 | |
1199 | |
1067 | if (top) |
1200 | if (!top) |
1068 | for (top = op; top && top->above; top = top->above) |
1201 | for (top = op; top && top->above; top = top->above) |
1069 | ; |
1202 | ; |
1070 | |
1203 | |
1071 | for (; top; top = top->below) |
1204 | for (; top; top = top->below) |
1072 | { |
|
|
1073 | if (top == op) |
|
|
1074 | continue; |
|
|
1075 | |
|
|
1076 | if (object::can_merge (op, top)) |
1205 | if (object::can_merge (op, top)) |
1077 | { |
1206 | { |
1078 | top->nrof += op->nrof; |
1207 | top->nrof += op->nrof; |
1079 | |
1208 | |
1080 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1209 | if (object *pl = top->visible_to ()) |
1081 | op->weight = 0; /* Don't want any adjustements now */ |
1210 | esrv_update_item (UPD_NROF, pl, top); |
|
|
1211 | |
|
|
1212 | op->weight = 0; // cancel the addition above |
|
|
1213 | op->carrying = 0; // must be 0 already |
|
|
1214 | |
1082 | op->destroy (); |
1215 | op->destroy (1); |
|
|
1216 | |
1083 | return top; |
1217 | return top; |
1084 | } |
1218 | } |
1085 | } |
|
|
1086 | |
1219 | |
1087 | return 0; |
1220 | return 0; |
1088 | } |
1221 | } |
1089 | |
1222 | |
|
|
1223 | void |
|
|
1224 | object::expand_tail () |
|
|
1225 | { |
|
|
1226 | if (more) |
|
|
1227 | return; |
|
|
1228 | |
|
|
1229 | object *prev = this; |
|
|
1230 | |
|
|
1231 | for (archetype *at = (archetype *)arch->more; at; at = (archetype *)at->more) |
|
|
1232 | { |
|
|
1233 | object *op = arch_to_object (at); |
|
|
1234 | |
|
|
1235 | op->name = name; |
|
|
1236 | op->name_pl = name_pl; |
|
|
1237 | op->title = title; |
|
|
1238 | |
|
|
1239 | op->head = this; |
|
|
1240 | prev->more = op; |
|
|
1241 | |
|
|
1242 | prev = op; |
|
|
1243 | } |
|
|
1244 | } |
|
|
1245 | |
1090 | /* |
1246 | /* |
1091 | * same as insert_ob_in_map except it handle separate coordinates and do a clean |
1247 | * same as insert_ob_in_map except it handles separate coordinates and does a clean |
1092 | * job preparing multi-part monsters |
1248 | * job preparing multi-part monsters. |
1093 | */ |
1249 | */ |
1094 | object * |
1250 | object * |
1095 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1251 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1096 | { |
1252 | { |
1097 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1253 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1098 | { |
1254 | { |
1099 | tmp->x = x + tmp->arch->clone.x; |
1255 | tmp->x = x + tmp->arch->x; |
1100 | tmp->y = y + tmp->arch->clone.y; |
1256 | tmp->y = y + tmp->arch->y; |
1101 | } |
1257 | } |
1102 | |
1258 | |
1103 | return insert_ob_in_map (op, m, originator, flag); |
1259 | return insert_ob_in_map (op, m, originator, flag); |
1104 | } |
1260 | } |
1105 | |
1261 | |
… | |
… | |
1124 | * just 'op' otherwise |
1280 | * just 'op' otherwise |
1125 | */ |
1281 | */ |
1126 | object * |
1282 | object * |
1127 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1283 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1128 | { |
1284 | { |
1129 | object *tmp, *top, *floor = NULL; |
1285 | assert (!op->flag [FLAG_FREED]); |
1130 | sint16 x, y; |
|
|
1131 | |
1286 | |
1132 | if (QUERY_FLAG (op, FLAG_FREED)) |
1287 | op->remove (); |
1133 | { |
|
|
1134 | LOG (llevError, "Trying to insert freed object!\n"); |
|
|
1135 | return NULL; |
|
|
1136 | } |
|
|
1137 | |
|
|
1138 | if (!m) |
|
|
1139 | { |
|
|
1140 | char *dump = dump_object (op); |
|
|
1141 | LOG (llevError, "Trying to insert in null-map!\n%s\n", dump); |
|
|
1142 | free (dump); |
|
|
1143 | return op; |
|
|
1144 | } |
|
|
1145 | |
|
|
1146 | if (out_of_map (m, op->x, op->y)) |
|
|
1147 | { |
|
|
1148 | char *dump = dump_object (op); |
|
|
1149 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", dump); |
|
|
1150 | #ifdef MANY_CORES |
|
|
1151 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1152 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1153 | * improperly inserted. |
|
|
1154 | */ |
|
|
1155 | abort (); |
|
|
1156 | #endif |
|
|
1157 | free (dump); |
|
|
1158 | return op; |
|
|
1159 | } |
|
|
1160 | |
|
|
1161 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1162 | { |
|
|
1163 | char *dump = dump_object (op); |
|
|
1164 | LOG (llevError, "Trying to insert (map) inserted object.\n%s\n", dump); |
|
|
1165 | free (dump); |
|
|
1166 | return op; |
|
|
1167 | } |
|
|
1168 | |
|
|
1169 | if (op->more) |
|
|
1170 | { |
|
|
1171 | /* The part may be on a different map. */ |
|
|
1172 | |
|
|
1173 | object *more = op->more; |
|
|
1174 | |
|
|
1175 | /* We really need the caller to normalise coordinates - if |
|
|
1176 | * we set the map, that doesn't work if the location is within |
|
|
1177 | * a map and this is straddling an edge. So only if coordinate |
|
|
1178 | * is clear wrong do we normalise it. |
|
|
1179 | */ |
|
|
1180 | if (OUT_OF_REAL_MAP (more->map, more->x, more->y)) |
|
|
1181 | more->map = get_map_from_coord (m, &more->x, &more->y); |
|
|
1182 | else if (!more->map) |
|
|
1183 | { |
|
|
1184 | /* For backwards compatibility - when not dealing with tiled maps, |
|
|
1185 | * more->map should always point to the parent. |
|
|
1186 | */ |
|
|
1187 | more->map = m; |
|
|
1188 | } |
|
|
1189 | |
|
|
1190 | if (insert_ob_in_map (more, more->map, originator, flag) == NULL) |
|
|
1191 | { |
|
|
1192 | if (!op->head) |
|
|
1193 | LOG (llevError, "BUG: insert_ob_in_map(): inserting op->more killed op\n"); |
|
|
1194 | |
|
|
1195 | return 0; |
|
|
1196 | } |
|
|
1197 | } |
|
|
1198 | |
|
|
1199 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1200 | |
1288 | |
1201 | /* Ideally, the caller figures this out. However, it complicates a lot |
1289 | /* Ideally, the caller figures this out. However, it complicates a lot |
1202 | * of areas of callers (eg, anything that uses find_free_spot would now |
1290 | * of areas of callers (eg, anything that uses find_free_spot would now |
1203 | * need extra work |
1291 | * need extra work |
1204 | */ |
1292 | */ |
1205 | op->map = get_map_from_coord (m, &op->x, &op->y); |
1293 | if (!xy_normalise (m, op->x, op->y)) |
1206 | x = op->x; |
1294 | { |
1207 | y = op->y; |
1295 | op->destroy (1); |
|
|
1296 | return 0; |
|
|
1297 | } |
|
|
1298 | |
|
|
1299 | if (object *more = op->more) |
|
|
1300 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1301 | return 0; |
|
|
1302 | |
|
|
1303 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1304 | |
|
|
1305 | op->map = m; |
|
|
1306 | mapspace &ms = op->ms (); |
1208 | |
1307 | |
1209 | /* this has to be done after we translate the coordinates. |
1308 | /* this has to be done after we translate the coordinates. |
1210 | */ |
1309 | */ |
1211 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1310 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1212 | for (tmp = GET_MAP_OB (op->map, x, y); tmp; tmp = tmp->above) |
1311 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1213 | if (object::can_merge (op, tmp)) |
1312 | if (object::can_merge (op, tmp)) |
1214 | { |
1313 | { |
|
|
1314 | // TODO: we atcually want to update tmp, not op, |
|
|
1315 | // but some caller surely breaks when we return tmp |
|
|
1316 | // from here :/ |
1215 | op->nrof += tmp->nrof; |
1317 | op->nrof += tmp->nrof; |
1216 | tmp->destroy (); |
1318 | tmp->destroy (1); |
1217 | } |
1319 | } |
1218 | |
1320 | |
1219 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1321 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1220 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1322 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1221 | |
1323 | |
… | |
… | |
1234 | op->below = originator->below; |
1336 | op->below = originator->below; |
1235 | |
1337 | |
1236 | if (op->below) |
1338 | if (op->below) |
1237 | op->below->above = op; |
1339 | op->below->above = op; |
1238 | else |
1340 | else |
1239 | op->ms ().bot = op; |
1341 | ms.bot = op; |
1240 | |
1342 | |
1241 | /* since *below* originator, no need to update top */ |
1343 | /* since *below* originator, no need to update top */ |
1242 | originator->below = op; |
1344 | originator->below = op; |
1243 | } |
1345 | } |
1244 | else |
1346 | else |
1245 | { |
1347 | { |
|
|
1348 | object *top, *floor = NULL; |
|
|
1349 | |
|
|
1350 | top = ms.bot; |
|
|
1351 | |
1246 | /* If there are other objects, then */ |
1352 | /* If there are other objects, then */ |
1247 | if ((!(flag & INS_MAP_LOAD)) && ((top = GET_MAP_OB (op->map, op->x, op->y)) != NULL)) |
1353 | if (top) |
1248 | { |
1354 | { |
1249 | object *last = 0; |
1355 | object *last = 0; |
1250 | |
1356 | |
1251 | /* |
1357 | /* |
1252 | * If there are multiple objects on this space, we do some trickier handling. |
1358 | * If there are multiple objects on this space, we do some trickier handling. |
… | |
… | |
1258 | * once we get to them. This reduces the need to traverse over all of |
1364 | * once we get to them. This reduces the need to traverse over all of |
1259 | * them when adding another one - this saves quite a bit of cpu time |
1365 | * them when adding another one - this saves quite a bit of cpu time |
1260 | * when lots of spells are cast in one area. Currently, it is presumed |
1366 | * when lots of spells are cast in one area. Currently, it is presumed |
1261 | * that flying non pickable objects are spell objects. |
1367 | * that flying non pickable objects are spell objects. |
1262 | */ |
1368 | */ |
1263 | while (top) |
1369 | for (top = ms.bot; top; top = top->above) |
1264 | { |
1370 | { |
1265 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1371 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1266 | floor = top; |
1372 | floor = top; |
1267 | |
1373 | |
1268 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1374 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
… | |
… | |
1271 | top = top->below; |
1377 | top = top->below; |
1272 | break; |
1378 | break; |
1273 | } |
1379 | } |
1274 | |
1380 | |
1275 | last = top; |
1381 | last = top; |
1276 | top = top->above; |
|
|
1277 | } |
1382 | } |
1278 | |
1383 | |
1279 | /* Don't want top to be NULL, so set it to the last valid object */ |
1384 | /* Don't want top to be NULL, so set it to the last valid object */ |
1280 | top = last; |
1385 | top = last; |
1281 | |
1386 | |
… | |
… | |
1283 | * looks like instead of lots of conditions here. |
1388 | * looks like instead of lots of conditions here. |
1284 | * makes things faster, and effectively the same result. |
1389 | * makes things faster, and effectively the same result. |
1285 | */ |
1390 | */ |
1286 | |
1391 | |
1287 | /* Have object 'fall below' other objects that block view. |
1392 | /* Have object 'fall below' other objects that block view. |
1288 | * Unless those objects are exits, type 66 |
1393 | * Unless those objects are exits. |
1289 | * If INS_ON_TOP is used, don't do this processing |
1394 | * If INS_ON_TOP is used, don't do this processing |
1290 | * Need to find the object that in fact blocks view, otherwise |
1395 | * Need to find the object that in fact blocks view, otherwise |
1291 | * stacking is a bit odd. |
1396 | * stacking is a bit odd. |
1292 | */ |
1397 | */ |
1293 | if (!(flag & INS_ON_TOP) && |
1398 | if (!(flag & INS_ON_TOP) |
1294 | (get_map_flags (op->map, 0, op->x, op->y, 0, 0) & P_BLOCKSVIEW) && (op->face && !op->face->visibility)) |
1399 | && ms.flags () & P_BLOCKSVIEW |
|
|
1400 | && (op->face && !faces [op->face].visibility)) |
1295 | { |
1401 | { |
1296 | for (last = top; last != floor; last = last->below) |
1402 | for (last = top; last != floor; last = last->below) |
1297 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1403 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1298 | break; |
1404 | break; |
|
|
1405 | |
1299 | /* Check to see if we found the object that blocks view, |
1406 | /* Check to see if we found the object that blocks view, |
1300 | * and make sure we have a below pointer for it so that |
1407 | * and make sure we have a below pointer for it so that |
1301 | * we can get inserted below this one, which requires we |
1408 | * we can get inserted below this one, which requires we |
1302 | * set top to the object below us. |
1409 | * set top to the object below us. |
1303 | */ |
1410 | */ |
1304 | if (last && last->below && last != floor) |
1411 | if (last && last->below && last != floor) |
1305 | top = last->below; |
1412 | top = last->below; |
1306 | } |
1413 | } |
1307 | } /* If objects on this space */ |
1414 | } /* If objects on this space */ |
1308 | |
1415 | |
1309 | if (flag & INS_MAP_LOAD) |
|
|
1310 | top = GET_MAP_TOP (op->map, op->x, op->y); |
|
|
1311 | |
|
|
1312 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1416 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1313 | top = floor; |
1417 | top = floor; |
1314 | |
1418 | |
1315 | /* Top is the object that our object (op) is going to get inserted above. |
1419 | /* Top is the object that our object (op) is going to get inserted above. |
1316 | */ |
1420 | */ |
1317 | |
1421 | |
1318 | /* First object on this space */ |
1422 | /* First object on this space */ |
1319 | if (!top) |
1423 | if (!top) |
1320 | { |
1424 | { |
1321 | op->above = GET_MAP_OB (op->map, op->x, op->y); |
1425 | op->above = ms.bot; |
1322 | |
1426 | |
1323 | if (op->above) |
1427 | if (op->above) |
1324 | op->above->below = op; |
1428 | op->above->below = op; |
1325 | |
1429 | |
1326 | op->below = 0; |
1430 | op->below = 0; |
1327 | op->ms ().bot = op; |
1431 | ms.bot = op; |
1328 | } |
1432 | } |
1329 | else |
1433 | else |
1330 | { /* get inserted into the stack above top */ |
1434 | { /* get inserted into the stack above top */ |
1331 | op->above = top->above; |
1435 | op->above = top->above; |
1332 | |
1436 | |
… | |
… | |
1336 | op->below = top; |
1440 | op->below = top; |
1337 | top->above = op; |
1441 | top->above = op; |
1338 | } |
1442 | } |
1339 | |
1443 | |
1340 | if (!op->above) |
1444 | if (!op->above) |
1341 | op->ms ().top = op; |
1445 | ms.top = op; |
1342 | } /* else not INS_BELOW_ORIGINATOR */ |
1446 | } /* else not INS_BELOW_ORIGINATOR */ |
1343 | |
1447 | |
1344 | if (op->type == PLAYER) |
1448 | if (op->type == PLAYER) |
1345 | { |
1449 | { |
1346 | op->contr->do_los = 1; |
1450 | op->contr->do_los = 1; |
… | |
… | |
1348 | op->map->touch (); |
1452 | op->map->touch (); |
1349 | } |
1453 | } |
1350 | |
1454 | |
1351 | op->map->dirty = true; |
1455 | op->map->dirty = true; |
1352 | |
1456 | |
1353 | /* If we have a floor, we know the player, if any, will be above |
|
|
1354 | * it, so save a few ticks and start from there. |
|
|
1355 | */ |
|
|
1356 | if (!(flag & INS_MAP_LOAD)) |
|
|
1357 | if (object *pl = op->ms ().player ()) |
1457 | if (object *pl = ms.player ()) |
|
|
1458 | //TODO: the floorbox prev/next might need updating |
|
|
1459 | //esrv_send_item (pl, op); |
|
|
1460 | //TODO: update floorbox to preserve ordering |
1358 | if (pl->contr->ns) |
1461 | if (pl->contr->ns) |
1359 | pl->contr->ns->floorbox_update (); |
1462 | pl->contr->ns->floorbox_update (); |
1360 | |
1463 | |
1361 | /* If this object glows, it may affect lighting conditions that are |
1464 | /* If this object glows, it may affect lighting conditions that are |
1362 | * visible to others on this map. But update_all_los is really |
1465 | * visible to others on this map. But update_all_los is really |
1363 | * an inefficient way to do this, as it means los for all players |
1466 | * an inefficient way to do this, as it means los for all players |
1364 | * on the map will get recalculated. The players could very well |
1467 | * on the map will get recalculated. The players could very well |
… | |
… | |
1383 | * blocked() and wall() work properly), and these flags are updated by |
1486 | * blocked() and wall() work properly), and these flags are updated by |
1384 | * update_object(). |
1487 | * update_object(). |
1385 | */ |
1488 | */ |
1386 | |
1489 | |
1387 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1490 | /* if this is not the head or flag has been passed, don't check walk on status */ |
1388 | if (!(flag & INS_NO_WALK_ON) && !op->head) |
1491 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1389 | { |
1492 | { |
1390 | if (check_move_on (op, originator)) |
1493 | if (check_move_on (op, originator)) |
1391 | return 0; |
1494 | return 0; |
1392 | |
1495 | |
1393 | /* If we are a multi part object, lets work our way through the check |
1496 | /* If we are a multi part object, lets work our way through the check |
1394 | * walk on's. |
1497 | * walk on's. |
1395 | */ |
1498 | */ |
1396 | for (tmp = op->more; tmp != NULL; tmp = tmp->more) |
1499 | for (object *tmp = op->more; tmp; tmp = tmp->more) |
1397 | if (check_move_on (tmp, originator)) |
1500 | if (check_move_on (tmp, originator)) |
1398 | return 0; |
1501 | return 0; |
1399 | } |
1502 | } |
1400 | |
1503 | |
1401 | return op; |
1504 | return op; |
… | |
… | |
1406 | * op is the object to insert it under: supplies x and the map. |
1509 | * op is the object to insert it under: supplies x and the map. |
1407 | */ |
1510 | */ |
1408 | void |
1511 | void |
1409 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1512 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1410 | { |
1513 | { |
1411 | object *tmp, *tmp1; |
|
|
1412 | |
|
|
1413 | /* first search for itself and remove any old instances */ |
1514 | /* first search for itself and remove any old instances */ |
1414 | |
1515 | |
1415 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1516 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1416 | if (!strcmp (tmp->arch->name, arch_string)) /* same archetype */ |
1517 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1417 | tmp->destroy (); |
1518 | tmp->destroy (1); |
1418 | |
1519 | |
1419 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1520 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1420 | |
1521 | |
1421 | tmp1->x = op->x; |
1522 | tmp->x = op->x; |
1422 | tmp1->y = op->y; |
1523 | tmp->y = op->y; |
|
|
1524 | |
1423 | insert_ob_in_map (tmp1, op->map, op, 0); |
1525 | insert_ob_in_map (tmp, op->map, op, 0); |
1424 | } |
1526 | } |
1425 | |
1527 | |
1426 | object * |
1528 | object * |
1427 | object::insert_at (object *where, object *originator, int flags) |
1529 | object::insert_at (object *where, object *originator, int flags) |
1428 | { |
1530 | { |
|
|
1531 | if (where->env) |
|
|
1532 | return where->env->insert (this); |
|
|
1533 | else |
1429 | where->map->insert (this, where->x, where->y, originator, flags); |
1534 | return where->map->insert (this, where->x, where->y, originator, flags); |
1430 | } |
1535 | } |
1431 | |
1536 | |
1432 | /* |
1537 | /* |
1433 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1434 | * is returned contains nr objects, and the remaining parts contains |
|
|
1435 | * the rest (or is removed and freed if that number is 0). |
|
|
1436 | * On failure, NULL is returned, and the reason put into the |
|
|
1437 | * global static errmsg array. |
|
|
1438 | */ |
|
|
1439 | object * |
|
|
1440 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1441 | { |
|
|
1442 | object *newob; |
|
|
1443 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1444 | |
|
|
1445 | if (orig_ob->nrof < nr) |
|
|
1446 | { |
|
|
1447 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1448 | return NULL; |
|
|
1449 | } |
|
|
1450 | |
|
|
1451 | newob = object_create_clone (orig_ob); |
|
|
1452 | |
|
|
1453 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1454 | orig_ob->destroy (1); |
|
|
1455 | else if (!is_removed) |
|
|
1456 | { |
|
|
1457 | if (orig_ob->env != NULL) |
|
|
1458 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1459 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1460 | { |
|
|
1461 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1462 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1463 | return NULL; |
|
|
1464 | } |
|
|
1465 | } |
|
|
1466 | |
|
|
1467 | newob->nrof = nr; |
|
|
1468 | |
|
|
1469 | return newob; |
|
|
1470 | } |
|
|
1471 | |
|
|
1472 | /* |
|
|
1473 | * decrease_ob_nr(object, number) decreases a specified number from |
1538 | * decrease(object, number) decreases a specified number from |
1474 | * the amount of an object. If the amount reaches 0, the object |
1539 | * the amount of an object. If the amount reaches 0, the object |
1475 | * is subsequently removed and freed. |
1540 | * is subsequently removed and freed. |
1476 | * |
1541 | * |
1477 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1542 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1478 | */ |
1543 | */ |
|
|
1544 | bool |
|
|
1545 | object::decrease (sint32 nr) |
|
|
1546 | { |
|
|
1547 | if (!nr) |
|
|
1548 | return true; |
1479 | |
1549 | |
|
|
1550 | nr = min (nr, nrof); |
|
|
1551 | |
|
|
1552 | nrof -= nr; |
|
|
1553 | |
|
|
1554 | if (nrof) |
|
|
1555 | { |
|
|
1556 | adjust_weight (env, -weight * nr); // carrying == 0 |
|
|
1557 | |
|
|
1558 | if (object *pl = visible_to ()) |
|
|
1559 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1560 | |
|
|
1561 | return true; |
|
|
1562 | } |
|
|
1563 | else |
|
|
1564 | { |
|
|
1565 | destroy (1); |
|
|
1566 | return false; |
|
|
1567 | } |
|
|
1568 | } |
|
|
1569 | |
|
|
1570 | /* |
|
|
1571 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1572 | * is returned contains nr objects, and the remaining parts contains |
|
|
1573 | * the rest (or is removed and returned if that number is 0). |
|
|
1574 | * On failure, NULL is returned. |
|
|
1575 | */ |
1480 | object * |
1576 | object * |
1481 | decrease_ob_nr (object *op, uint32 i) |
1577 | object::split (sint32 nr) |
1482 | { |
1578 | { |
1483 | object *tmp; |
1579 | int have = number_of (); |
1484 | |
1580 | |
1485 | if (i == 0) /* objects with op->nrof require this check */ |
1581 | if (have < nr) |
1486 | return op; |
1582 | return 0; |
1487 | |
1583 | else if (have == nr) |
1488 | if (i > op->nrof) |
|
|
1489 | i = op->nrof; |
|
|
1490 | |
|
|
1491 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1492 | op->nrof -= i; |
|
|
1493 | else if (op->env) |
|
|
1494 | { |
1584 | { |
1495 | /* is this object in the players inventory, or sub container |
|
|
1496 | * therein? |
|
|
1497 | */ |
|
|
1498 | tmp = op->in_player (); |
|
|
1499 | /* nope. Is this a container the player has opened? |
|
|
1500 | * If so, set tmp to that player. |
|
|
1501 | * IMO, searching through all the players will mostly |
|
|
1502 | * likely be quicker than following op->env to the map, |
|
|
1503 | * and then searching the map for a player. |
|
|
1504 | */ |
|
|
1505 | if (!tmp) |
|
|
1506 | for_all_players (pl) |
|
|
1507 | if (pl->ob->container == op->env) |
|
|
1508 | { |
|
|
1509 | tmp = pl->ob; |
|
|
1510 | break; |
|
|
1511 | } |
|
|
1512 | |
|
|
1513 | if (i < op->nrof) |
|
|
1514 | { |
|
|
1515 | sub_weight (op->env, op->weight * i); |
|
|
1516 | op->nrof -= i; |
|
|
1517 | if (tmp) |
|
|
1518 | esrv_send_item (tmp, op); |
|
|
1519 | } |
|
|
1520 | else |
|
|
1521 | { |
|
|
1522 | op->remove (); |
1585 | remove (); |
1523 | op->nrof = 0; |
1586 | return this; |
1524 | if (tmp) |
|
|
1525 | esrv_del_item (tmp->contr, op->count); |
|
|
1526 | } |
|
|
1527 | } |
1587 | } |
1528 | else |
1588 | else |
1529 | { |
1589 | { |
1530 | object *above = op->above; |
1590 | decrease (nr); |
1531 | |
1591 | |
1532 | if (i < op->nrof) |
1592 | object *op = deep_clone (); |
1533 | op->nrof -= i; |
1593 | op->nrof = nr; |
1534 | else |
|
|
1535 | { |
|
|
1536 | op->remove (); |
|
|
1537 | op->nrof = 0; |
|
|
1538 | } |
|
|
1539 | |
|
|
1540 | /* Since we just removed op, op->above is null */ |
|
|
1541 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1542 | if (tmp->type == PLAYER) |
|
|
1543 | { |
|
|
1544 | if (op->nrof) |
|
|
1545 | esrv_send_item (tmp, op); |
|
|
1546 | else |
|
|
1547 | esrv_del_item (tmp->contr, op->count); |
|
|
1548 | } |
|
|
1549 | } |
|
|
1550 | |
|
|
1551 | if (op->nrof) |
|
|
1552 | return op; |
1594 | return op; |
1553 | else |
|
|
1554 | { |
|
|
1555 | op->destroy (); |
|
|
1556 | return 0; |
|
|
1557 | } |
|
|
1558 | } |
|
|
1559 | |
|
|
1560 | /* |
|
|
1561 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1562 | * and also updates how much the environment(s) is/are carrying. |
|
|
1563 | */ |
|
|
1564 | |
|
|
1565 | void |
|
|
1566 | add_weight (object *op, signed long weight) |
|
|
1567 | { |
|
|
1568 | while (op != NULL) |
|
|
1569 | { |
|
|
1570 | if (op->type == CONTAINER) |
|
|
1571 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1572 | |
|
|
1573 | op->carrying += weight; |
|
|
1574 | op = op->env; |
|
|
1575 | } |
1595 | } |
1576 | } |
1596 | } |
1577 | |
1597 | |
1578 | object * |
1598 | object * |
1579 | insert_ob_in_ob (object *op, object *where) |
1599 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1584 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1604 | LOG (llevError, "Trying to put object in NULL.\n%s\n", dump); |
1585 | free (dump); |
1605 | free (dump); |
1586 | return op; |
1606 | return op; |
1587 | } |
1607 | } |
1588 | |
1608 | |
1589 | if (where->head) |
1609 | if (where->head_ () != where) |
1590 | { |
1610 | { |
1591 | LOG (llevDebug, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1611 | LOG (llevError | logBacktrace, "Warning: Tried to insert object into wrong part of multipart object.\n"); |
1592 | where = where->head; |
1612 | where = where->head; |
1593 | } |
1613 | } |
1594 | |
1614 | |
1595 | return where->insert (op); |
1615 | return where->insert (op); |
1596 | } |
1616 | } |
… | |
… | |
1601 | * inside the object environment. |
1621 | * inside the object environment. |
1602 | * |
1622 | * |
1603 | * The function returns now pointer to inserted item, and return value can |
1623 | * The function returns now pointer to inserted item, and return value can |
1604 | * be != op, if items are merged. -Tero |
1624 | * be != op, if items are merged. -Tero |
1605 | */ |
1625 | */ |
1606 | |
|
|
1607 | object * |
1626 | object * |
1608 | object::insert (object *op) |
1627 | object::insert (object *op) |
1609 | { |
1628 | { |
1610 | object *tmp, *otmp; |
|
|
1611 | |
|
|
1612 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1613 | op->remove (); |
|
|
1614 | |
|
|
1615 | if (op->more) |
1629 | if (op->more) |
1616 | { |
1630 | { |
1617 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1631 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1618 | return op; |
1632 | return op; |
1619 | } |
1633 | } |
1620 | |
1634 | |
1621 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1635 | op->remove (); |
1622 | CLEAR_FLAG (op, FLAG_REMOVED); |
1636 | |
|
|
1637 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
|
|
1638 | |
1623 | if (op->nrof) |
1639 | if (op->nrof) |
1624 | { |
|
|
1625 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1640 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1626 | if (object::can_merge (tmp, op)) |
1641 | if (object::can_merge (tmp, op)) |
1627 | { |
1642 | { |
1628 | /* return the original object and remove inserted object |
1643 | /* return the original object and remove inserted object |
1629 | (client needs the original object) */ |
1644 | (client needs the original object) */ |
1630 | tmp->nrof += op->nrof; |
1645 | tmp->nrof += op->nrof; |
1631 | /* Weight handling gets pretty funky. Since we are adding to |
1646 | |
1632 | * tmp->nrof, we need to increase the weight. |
1647 | if (object *pl = tmp->visible_to ()) |
1633 | */ |
1648 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1649 | |
1634 | add_weight (this, op->weight * op->nrof); |
1650 | adjust_weight (this, op->total_weight ()); |
1635 | SET_FLAG (op, FLAG_REMOVED); |
1651 | |
1636 | op->destroy (); /* free the inserted object */ |
1652 | op->destroy (1); |
1637 | op = tmp; |
1653 | op = tmp; |
1638 | op->remove (); /* and fix old object's links */ |
1654 | goto inserted; |
1639 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1640 | break; |
|
|
1641 | } |
1655 | } |
1642 | |
1656 | |
1643 | /* I assume combined objects have no inventory |
1657 | op->owner = 0; // it's his/hers now. period. |
1644 | * We add the weight - this object could have just been removed |
|
|
1645 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1646 | * the weight, so we need to add it in again, since we actually do |
|
|
1647 | * the linking below |
|
|
1648 | */ |
|
|
1649 | add_weight (this, op->weight * op->nrof); |
|
|
1650 | } |
|
|
1651 | else |
|
|
1652 | add_weight (this, (op->weight + op->carrying)); |
|
|
1653 | |
|
|
1654 | otmp = this->in_player (); |
|
|
1655 | if (otmp && otmp->contr) |
|
|
1656 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1657 | otmp->update_stats (); |
|
|
1658 | |
|
|
1659 | op->map = 0; |
1658 | op->map = 0; |
1660 | op->env = this; |
1659 | op->x = 0; |
|
|
1660 | op->y = 0; |
|
|
1661 | |
1661 | op->above = 0; |
1662 | op->above = 0; |
1662 | op->below = 0; |
1663 | op->below = inv; |
1663 | op->x = 0, op->y = 0; |
1664 | op->env = this; |
1664 | |
1665 | |
|
|
1666 | if (inv) |
|
|
1667 | inv->above = op; |
|
|
1668 | |
|
|
1669 | inv = op; |
|
|
1670 | |
|
|
1671 | op->flag [FLAG_REMOVED] = 0; |
|
|
1672 | |
|
|
1673 | if (object *pl = op->visible_to ()) |
|
|
1674 | esrv_send_item (pl, op); |
|
|
1675 | |
|
|
1676 | adjust_weight (this, op->total_weight ()); |
|
|
1677 | |
|
|
1678 | inserted: |
1665 | /* reset the light list and los of the players on the map */ |
1679 | /* reset the light list and los of the players on the map */ |
1666 | if ((op->glow_radius != 0) && map) |
1680 | if (op->glow_radius && map && map->darkness) |
1667 | { |
|
|
1668 | #ifdef DEBUG_LIGHTS |
|
|
1669 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1670 | #endif /* DEBUG_LIGHTS */ |
|
|
1671 | if (map->darkness) |
|
|
1672 | update_all_los (map, x, y); |
1681 | update_all_los (map, x, y); |
1673 | } |
|
|
1674 | |
1682 | |
1675 | /* Client has no idea of ordering so lets not bother ordering it here. |
1683 | // if this is a player's inventory, update stats |
1676 | * It sure simplifies this function... |
1684 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1677 | */ |
1685 | update_stats (); |
1678 | if (!inv) |
|
|
1679 | inv = op; |
|
|
1680 | else |
|
|
1681 | { |
|
|
1682 | op->below = inv; |
|
|
1683 | op->below->above = op; |
|
|
1684 | inv = op; |
|
|
1685 | } |
|
|
1686 | |
1686 | |
1687 | INVOKE_OBJECT (INSERT, this); |
1687 | INVOKE_OBJECT (INSERT, this); |
1688 | |
1688 | |
1689 | return op; |
1689 | return op; |
1690 | } |
1690 | } |
… | |
… | |
1771 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1771 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1772 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1772 | ((op->move_type & tmp->move_slow) && (op->move_type & ~tmp->move_slow & ~tmp->move_block) == 0)) |
1773 | { |
1773 | { |
1774 | |
1774 | |
1775 | float |
1775 | float |
1776 | diff = tmp->move_slow_penalty * FABS (op->speed); |
1776 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1777 | |
1777 | |
1778 | if (op->type == PLAYER) |
1778 | if (op->type == PLAYER) |
1779 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1779 | if ((QUERY_FLAG (tmp, FLAG_IS_HILLY) && find_skill_by_number (op, SK_CLIMBING)) || |
1780 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1780 | (QUERY_FLAG (tmp, FLAG_IS_WOODED) && find_skill_by_number (op, SK_WOODSMAN))) |
1781 | diff /= 4.0; |
1781 | diff /= 4.0; |
… | |
… | |
1818 | LOG (llevError, "Present_arch called outside map.\n"); |
1818 | LOG (llevError, "Present_arch called outside map.\n"); |
1819 | return NULL; |
1819 | return NULL; |
1820 | } |
1820 | } |
1821 | |
1821 | |
1822 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1822 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1823 | if (tmp->arch == at) |
1823 | if (tmp->arch->archname == at->archname) |
1824 | return tmp; |
1824 | return tmp; |
1825 | |
1825 | |
1826 | return NULL; |
1826 | return NULL; |
1827 | } |
1827 | } |
1828 | |
1828 | |
… | |
… | |
1892 | * The first matching object is returned, or NULL if none. |
1892 | * The first matching object is returned, or NULL if none. |
1893 | */ |
1893 | */ |
1894 | object * |
1894 | object * |
1895 | present_arch_in_ob (const archetype *at, const object *op) |
1895 | present_arch_in_ob (const archetype *at, const object *op) |
1896 | { |
1896 | { |
1897 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1897 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1898 | if (tmp->arch == at) |
1898 | if (tmp->arch->archname == at->archname) |
1899 | return tmp; |
1899 | return tmp; |
1900 | |
1900 | |
1901 | return NULL; |
1901 | return NULL; |
1902 | } |
1902 | } |
1903 | |
1903 | |
… | |
… | |
1905 | * activate recursively a flag on an object inventory |
1905 | * activate recursively a flag on an object inventory |
1906 | */ |
1906 | */ |
1907 | void |
1907 | void |
1908 | flag_inv (object *op, int flag) |
1908 | flag_inv (object *op, int flag) |
1909 | { |
1909 | { |
1910 | if (op->inv) |
|
|
1911 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1910 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1912 | { |
1911 | { |
1913 | SET_FLAG (tmp, flag); |
1912 | SET_FLAG (tmp, flag); |
1914 | flag_inv (tmp, flag); |
1913 | flag_inv (tmp, flag); |
1915 | } |
1914 | } |
1916 | } |
1915 | } |
1917 | |
1916 | |
1918 | /* |
1917 | /* |
1919 | * deactivate recursively a flag on an object inventory |
1918 | * deactivate recursively a flag on an object inventory |
1920 | */ |
1919 | */ |
1921 | void |
1920 | void |
1922 | unflag_inv (object *op, int flag) |
1921 | unflag_inv (object *op, int flag) |
1923 | { |
1922 | { |
1924 | if (op->inv) |
|
|
1925 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1923 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1926 | { |
1924 | { |
1927 | CLEAR_FLAG (tmp, flag); |
1925 | CLEAR_FLAG (tmp, flag); |
1928 | unflag_inv (tmp, flag); |
1926 | unflag_inv (tmp, flag); |
1929 | } |
1927 | } |
1930 | } |
|
|
1931 | |
|
|
1932 | /* |
|
|
1933 | * set_cheat(object) sets the cheat flag (WAS_WIZ) in the object and in |
|
|
1934 | * all it's inventory (recursively). |
|
|
1935 | * If checksums are used, a player will get set_cheat called for |
|
|
1936 | * him/her-self and all object carried by a call to this function. |
|
|
1937 | */ |
|
|
1938 | void |
|
|
1939 | set_cheat (object *op) |
|
|
1940 | { |
|
|
1941 | SET_FLAG (op, FLAG_WAS_WIZ); |
|
|
1942 | flag_inv (op, FLAG_WAS_WIZ); |
|
|
1943 | } |
1928 | } |
1944 | |
1929 | |
1945 | /* |
1930 | /* |
1946 | * find_free_spot(object, map, x, y, start, stop) will search for |
1931 | * find_free_spot(object, map, x, y, start, stop) will search for |
1947 | * a spot at the given map and coordinates which will be able to contain |
1932 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
1949 | * to search (see the freearr_x/y[] definition). |
1934 | * to search (see the freearr_x/y[] definition). |
1950 | * It returns a random choice among the alternatives found. |
1935 | * It returns a random choice among the alternatives found. |
1951 | * start and stop are where to start relative to the free_arr array (1,9 |
1936 | * start and stop are where to start relative to the free_arr array (1,9 |
1952 | * does all 4 immediate directions). This returns the index into the |
1937 | * does all 4 immediate directions). This returns the index into the |
1953 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1938 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1954 | * Note - this only checks to see if there is space for the head of the |
|
|
1955 | * object - if it is a multispace object, this should be called for all |
|
|
1956 | * pieces. |
|
|
1957 | * Note2: This function does correctly handle tiled maps, but does not |
1939 | * Note: This function does correctly handle tiled maps, but does not |
1958 | * inform the caller. However, insert_ob_in_map will update as |
1940 | * inform the caller. However, insert_ob_in_map will update as |
1959 | * necessary, so the caller shouldn't need to do any special work. |
1941 | * necessary, so the caller shouldn't need to do any special work. |
1960 | * Note - updated to take an object instead of archetype - this is necessary |
1942 | * Note - updated to take an object instead of archetype - this is necessary |
1961 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1943 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1962 | * to know if the space in question will block the object. We can't use |
1944 | * to know if the space in question will block the object. We can't use |
… | |
… | |
1964 | * customized, changed states, etc. |
1946 | * customized, changed states, etc. |
1965 | */ |
1947 | */ |
1966 | int |
1948 | int |
1967 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1949 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1968 | { |
1950 | { |
|
|
1951 | int altern[SIZEOFFREE]; |
1969 | int index = 0, flag; |
1952 | int index = 0, flag; |
1970 | int altern[SIZEOFFREE]; |
|
|
1971 | |
1953 | |
1972 | for (int i = start; i < stop; i++) |
1954 | for (int i = start; i < stop; i++) |
1973 | { |
1955 | { |
1974 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1956 | mapxy pos (m, x, y); pos.move (i); |
1975 | if (!flag) |
1957 | |
|
|
1958 | if (!pos.normalise ()) |
|
|
1959 | continue; |
|
|
1960 | |
|
|
1961 | mapspace &ms = *pos; |
|
|
1962 | |
|
|
1963 | if (ms.flags () & P_IS_ALIVE) |
|
|
1964 | continue; |
|
|
1965 | |
|
|
1966 | /* However, often |
|
|
1967 | * ob doesn't have any move type (when used to place exits) |
|
|
1968 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
1969 | */ |
|
|
1970 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
1971 | { |
1976 | altern [index++] = i; |
1972 | altern [index++] = i; |
|
|
1973 | continue; |
|
|
1974 | } |
1977 | |
1975 | |
1978 | /* Basically, if we find a wall on a space, we cut down the search size. |
1976 | /* Basically, if we find a wall on a space, we cut down the search size. |
1979 | * In this way, we won't return spaces that are on another side of a wall. |
1977 | * In this way, we won't return spaces that are on another side of a wall. |
1980 | * This mostly work, but it cuts down the search size in all directions - |
1978 | * This mostly work, but it cuts down the search size in all directions - |
1981 | * if the space being examined only has a wall to the north and empty |
1979 | * if the space being examined only has a wall to the north and empty |
1982 | * spaces in all the other directions, this will reduce the search space |
1980 | * spaces in all the other directions, this will reduce the search space |
1983 | * to only the spaces immediately surrounding the target area, and |
1981 | * to only the spaces immediately surrounding the target area, and |
1984 | * won't look 2 spaces south of the target space. |
1982 | * won't look 2 spaces south of the target space. |
1985 | */ |
1983 | */ |
1986 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
1984 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
1985 | { |
1987 | stop = maxfree[i]; |
1986 | stop = maxfree[i]; |
|
|
1987 | continue; |
|
|
1988 | } |
|
|
1989 | |
|
|
1990 | /* Note it is intentional that we check ob - the movement type of the |
|
|
1991 | * head of the object should correspond for the entire object. |
|
|
1992 | */ |
|
|
1993 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
1994 | continue; |
|
|
1995 | |
|
|
1996 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
1997 | continue; |
|
|
1998 | |
|
|
1999 | altern [index++] = i; |
1988 | } |
2000 | } |
1989 | |
2001 | |
1990 | if (!index) |
2002 | if (!index) |
1991 | return -1; |
2003 | return -1; |
1992 | |
2004 | |
1993 | return altern[RANDOM () % index]; |
2005 | return altern [rndm (index)]; |
1994 | } |
2006 | } |
1995 | |
2007 | |
1996 | /* |
2008 | /* |
1997 | * find_first_free_spot(archetype, maptile, x, y) works like |
2009 | * find_first_free_spot(archetype, maptile, x, y) works like |
1998 | * find_free_spot(), but it will search max number of squares. |
2010 | * find_free_spot(), but it will search max number of squares. |
… | |
… | |
2001 | */ |
2013 | */ |
2002 | int |
2014 | int |
2003 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2015 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2004 | { |
2016 | { |
2005 | for (int i = 0; i < SIZEOFFREE; i++) |
2017 | for (int i = 0; i < SIZEOFFREE; i++) |
2006 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2018 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2007 | return i; |
2019 | return i; |
2008 | |
2020 | |
2009 | return -1; |
2021 | return -1; |
2010 | } |
2022 | } |
2011 | |
2023 | |
… | |
… | |
2019 | { |
2031 | { |
2020 | arr += begin; |
2032 | arr += begin; |
2021 | end -= begin; |
2033 | end -= begin; |
2022 | |
2034 | |
2023 | while (--end) |
2035 | while (--end) |
2024 | swap (arr [end], arr [RANDOM () % (end + 1)]); |
2036 | swap (arr [end], arr [rndm (end + 1)]); |
2025 | } |
2037 | } |
2026 | |
2038 | |
2027 | /* new function to make monster searching more efficient, and effective! |
2039 | /* new function to make monster searching more efficient, and effective! |
2028 | * This basically returns a randomized array (in the passed pointer) of |
2040 | * This basically returns a randomized array (in the passed pointer) of |
2029 | * the spaces to find monsters. In this way, it won't always look for |
2041 | * the spaces to find monsters. In this way, it won't always look for |
… | |
… | |
2065 | object *tmp; |
2077 | object *tmp; |
2066 | maptile *mp; |
2078 | maptile *mp; |
2067 | |
2079 | |
2068 | MoveType blocked, move_type; |
2080 | MoveType blocked, move_type; |
2069 | |
2081 | |
2070 | if (exclude && exclude->head) |
2082 | if (exclude && exclude->head_ () != exclude) |
2071 | { |
2083 | { |
2072 | exclude = exclude->head; |
2084 | exclude = exclude->head; |
2073 | move_type = exclude->move_type; |
2085 | move_type = exclude->move_type; |
2074 | } |
2086 | } |
2075 | else |
2087 | else |
… | |
… | |
2098 | max = maxfree[i]; |
2110 | max = maxfree[i]; |
2099 | else if (mflags & P_IS_ALIVE) |
2111 | else if (mflags & P_IS_ALIVE) |
2100 | { |
2112 | { |
2101 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2113 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2102 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2114 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2103 | && (tmp != exclude || (tmp->head && tmp->head != exclude))) |
2115 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2104 | break; |
2116 | break; |
2105 | |
2117 | |
2106 | if (tmp) |
2118 | if (tmp) |
2107 | return freedir[i]; |
2119 | return freedir[i]; |
2108 | } |
2120 | } |
… | |
… | |
2163 | |
2175 | |
2164 | return 3; |
2176 | return 3; |
2165 | } |
2177 | } |
2166 | |
2178 | |
2167 | /* |
2179 | /* |
2168 | * absdir(int): Returns a number between 1 and 8, which represent |
|
|
2169 | * the "absolute" direction of a number (it actually takes care of |
|
|
2170 | * "overflow" in previous calculations of a direction). |
|
|
2171 | */ |
|
|
2172 | |
|
|
2173 | int |
|
|
2174 | absdir (int d) |
|
|
2175 | { |
|
|
2176 | while (d < 1) |
|
|
2177 | d += 8; |
|
|
2178 | |
|
|
2179 | while (d > 8) |
|
|
2180 | d -= 8; |
|
|
2181 | |
|
|
2182 | return d; |
|
|
2183 | } |
|
|
2184 | |
|
|
2185 | /* |
|
|
2186 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2180 | * dirdiff(dir1, dir2) returns how many 45-degrees differences there is |
2187 | * between two directions (which are expected to be absolute (see absdir()) |
2181 | * between two directions (which are expected to be absolute (see absdir()) |
2188 | */ |
2182 | */ |
2189 | |
|
|
2190 | int |
2183 | int |
2191 | dirdiff (int dir1, int dir2) |
2184 | dirdiff (int dir1, int dir2) |
2192 | { |
2185 | { |
2193 | int d; |
2186 | int d; |
2194 | |
2187 | |
… | |
… | |
2307 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2300 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2308 | * core dumps if they do. |
2301 | * core dumps if they do. |
2309 | * |
2302 | * |
2310 | * Add a check so we can't pick up invisible objects (0.93.8) |
2303 | * Add a check so we can't pick up invisible objects (0.93.8) |
2311 | */ |
2304 | */ |
2312 | |
|
|
2313 | int |
2305 | int |
2314 | can_pick (const object *who, const object *item) |
2306 | can_pick (const object *who, const object *item) |
2315 | { |
2307 | { |
2316 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2308 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2317 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2309 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2320 | |
2312 | |
2321 | /* |
2313 | /* |
2322 | * create clone from object to another |
2314 | * create clone from object to another |
2323 | */ |
2315 | */ |
2324 | object * |
2316 | object * |
2325 | object_create_clone (object *asrc) |
2317 | object::deep_clone () |
2326 | { |
2318 | { |
2327 | object *dst = 0, *tmp, *src, *part, *prev, *item; |
2319 | assert (("deep_clone called on non-head object", is_head ())); |
2328 | |
2320 | |
2329 | if (!asrc) |
2321 | object *dst = clone (); |
2330 | return 0; |
|
|
2331 | |
2322 | |
2332 | src = asrc; |
2323 | object *prev = dst; |
2333 | if (src->head) |
|
|
2334 | src = src->head; |
|
|
2335 | |
|
|
2336 | prev = 0; |
|
|
2337 | for (part = src; part; part = part->more) |
2324 | for (object *part = this->more; part; part = part->more) |
2338 | { |
2325 | { |
2339 | tmp = part->clone (); |
2326 | object *tmp = part->clone (); |
2340 | tmp->x -= src->x; |
|
|
2341 | tmp->y -= src->y; |
|
|
2342 | |
|
|
2343 | if (!part->head) |
|
|
2344 | { |
|
|
2345 | dst = tmp; |
|
|
2346 | tmp->head = 0; |
|
|
2347 | } |
|
|
2348 | else |
|
|
2349 | tmp->head = dst; |
2327 | tmp->head = dst; |
2350 | |
|
|
2351 | tmp->more = 0; |
|
|
2352 | |
|
|
2353 | if (prev) |
|
|
2354 | prev->more = tmp; |
2328 | prev->more = tmp; |
2355 | |
|
|
2356 | prev = tmp; |
2329 | prev = tmp; |
2357 | } |
2330 | } |
2358 | |
2331 | |
2359 | for (item = src->inv; item; item = item->below) |
2332 | for (object *item = inv; item; item = item->below) |
2360 | insert_ob_in_ob (object_create_clone (item), dst); |
2333 | insert_ob_in_ob (item->deep_clone (), dst); |
2361 | |
2334 | |
2362 | return dst; |
2335 | return dst; |
2363 | } |
|
|
2364 | |
|
|
2365 | /* GROS - Creates an object using a string representing its content. */ |
|
|
2366 | /* Basically, we save the content of the string to a temp file, then call */ |
|
|
2367 | /* load_object on it. I admit it is a highly inefficient way to make things, */ |
|
|
2368 | /* but it was simple to make and allows reusing the load_object function. */ |
|
|
2369 | /* Remember not to use load_object_str in a time-critical situation. */ |
|
|
2370 | /* Also remember that multiparts objects are not supported for now. */ |
|
|
2371 | object * |
|
|
2372 | load_object_str (const char *obstr) |
|
|
2373 | { |
|
|
2374 | object *op; |
|
|
2375 | char filename[MAX_BUF]; |
|
|
2376 | |
|
|
2377 | sprintf (filename, "%s/cfloadobstr2044", settings.tmpdir); |
|
|
2378 | |
|
|
2379 | FILE *tempfile = fopen (filename, "w"); |
|
|
2380 | |
|
|
2381 | if (tempfile == NULL) |
|
|
2382 | { |
|
|
2383 | LOG (llevError, "Error - Unable to access load object temp file\n"); |
|
|
2384 | return NULL; |
|
|
2385 | } |
|
|
2386 | |
|
|
2387 | fprintf (tempfile, obstr); |
|
|
2388 | fclose (tempfile); |
|
|
2389 | |
|
|
2390 | op = object::create (); |
|
|
2391 | |
|
|
2392 | object_thawer thawer (filename); |
|
|
2393 | |
|
|
2394 | if (thawer) |
|
|
2395 | load_object (thawer, op, 0); |
|
|
2396 | |
|
|
2397 | LOG (llevDebug, " load str completed, object=%s\n", &op->name); |
|
|
2398 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
2399 | |
|
|
2400 | return op; |
|
|
2401 | } |
2336 | } |
2402 | |
2337 | |
2403 | /* This returns the first object in who's inventory that |
2338 | /* This returns the first object in who's inventory that |
2404 | * has the same type and subtype match. |
2339 | * has the same type and subtype match. |
2405 | * returns NULL if no match. |
2340 | * returns NULL if no match. |
… | |
… | |
2412 | return tmp; |
2347 | return tmp; |
2413 | |
2348 | |
2414 | return 0; |
2349 | return 0; |
2415 | } |
2350 | } |
2416 | |
2351 | |
2417 | /* If ob has a field named key, return the link from the list, |
2352 | const shstr & |
2418 | * otherwise return NULL. |
2353 | object::kv_get (const shstr &key) const |
2419 | * |
|
|
2420 | * key must be a passed in shared string - otherwise, this won't |
|
|
2421 | * do the desired thing. |
|
|
2422 | */ |
|
|
2423 | key_value * |
|
|
2424 | get_ob_key_link (const object *ob, const char *key) |
|
|
2425 | { |
2354 | { |
2426 | for (key_value *link = ob->key_values; link; link = link->next) |
2355 | for (key_value *kv = key_values; kv; kv = kv->next) |
2427 | if (link->key == key) |
2356 | if (kv->key == key) |
2428 | return link; |
|
|
2429 | |
|
|
2430 | return 0; |
|
|
2431 | } |
|
|
2432 | |
|
|
2433 | /* |
|
|
2434 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2435 | * |
|
|
2436 | * The argument doesn't need to be a shared string. |
|
|
2437 | * |
|
|
2438 | * The returned string is shared. |
|
|
2439 | */ |
|
|
2440 | const char * |
|
|
2441 | get_ob_key_value (const object *op, const char *const key) |
|
|
2442 | { |
|
|
2443 | key_value *link; |
|
|
2444 | shstr_cmp canonical_key (key); |
|
|
2445 | |
|
|
2446 | if (!canonical_key) |
|
|
2447 | { |
|
|
2448 | /* 1. There being a field named key on any object |
|
|
2449 | * implies there'd be a shared string to find. |
|
|
2450 | * 2. Since there isn't, no object has this field. |
|
|
2451 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2452 | */ |
|
|
2453 | return 0; |
|
|
2454 | } |
|
|
2455 | |
|
|
2456 | /* This is copied from get_ob_key_link() above - |
|
|
2457 | * only 4 lines, and saves the function call overhead. |
|
|
2458 | */ |
|
|
2459 | for (link = op->key_values; link; link = link->next) |
|
|
2460 | if (link->key == canonical_key) |
|
|
2461 | return link->value; |
2357 | return kv->value; |
2462 | |
2358 | |
2463 | return 0; |
2359 | return shstr_null; |
2464 | } |
2360 | } |
2465 | |
2361 | |
2466 | |
2362 | void |
2467 | /* |
2363 | object::kv_set (const shstr &key, const shstr &value) |
2468 | * Updates the canonical_key in op to 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 | { |
2364 | { |
2480 | key_value *field = NULL, *last = NULL; |
2365 | for (key_value *kv = key_values; kv; kv = kv->next) |
2481 | |
2366 | if (kv->key == key) |
2482 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2483 | { |
|
|
2484 | if (field->key != canonical_key) |
|
|
2485 | { |
2367 | { |
2486 | last = field; |
2368 | kv->value = value; |
2487 | continue; |
2369 | return; |
2488 | } |
2370 | } |
2489 | |
2371 | |
2490 | if (value) |
2372 | key_value *kv = new key_value; |
2491 | field->value = value; |
2373 | |
2492 | else |
2374 | kv->next = key_values; |
|
|
2375 | kv->key = key; |
|
|
2376 | kv->value = value; |
|
|
2377 | |
|
|
2378 | key_values = kv; |
|
|
2379 | } |
|
|
2380 | |
|
|
2381 | void |
|
|
2382 | object::kv_del (const shstr &key) |
|
|
2383 | { |
|
|
2384 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2385 | if ((*kvp)->key == key) |
2493 | { |
2386 | { |
2494 | /* Basically, if the archetype has this key set, |
2387 | key_value *kv = *kvp; |
2495 | * we need to store the null value so when we save |
2388 | *kvp = (*kvp)->next; |
2496 | * it, we save the empty value so that when we load, |
2389 | delete kv; |
2497 | * we get this value back again. |
2390 | return; |
2498 | */ |
|
|
2499 | if (get_ob_key_link (&op->arch->clone, 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 | } |
2391 | } |
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 | } |
2392 | } |
2556 | |
2393 | |
2557 | object::depth_iterator::depth_iterator (object *container) |
2394 | object::depth_iterator::depth_iterator (object *container) |
2558 | : iterator_base (container) |
2395 | : iterator_base (container) |
2559 | { |
2396 | { |
… | |
… | |
2572 | item = item->inv; |
2409 | item = item->inv; |
2573 | } |
2410 | } |
2574 | else |
2411 | else |
2575 | item = item->env; |
2412 | item = item->env; |
2576 | } |
2413 | } |
2577 | |
|
|
2578 | |
2414 | |
2579 | const char * |
2415 | const char * |
2580 | object::flag_desc (char *desc, int len) const |
2416 | object::flag_desc (char *desc, int len) const |
2581 | { |
2417 | { |
2582 | char *p = desc; |
2418 | char *p = desc; |
… | |
… | |
2610 | { |
2446 | { |
2611 | char flagdesc[512]; |
2447 | char flagdesc[512]; |
2612 | char info2[256 * 4]; |
2448 | char info2[256 * 4]; |
2613 | char *p = info; |
2449 | char *p = info; |
2614 | |
2450 | |
2615 | p += snprintf (p, 512, "{cnt:%d,uuid:<1,%" PRIx64 ">,name:\"%s%s%s\",flags:[%s],type:%d}", |
2451 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2616 | count, uuid.seq, |
2452 | count, |
|
|
2453 | uuid.c_str (), |
2617 | &name, |
2454 | &name, |
2618 | title ? "\",title:" : "", |
2455 | title ? "\",title:\"" : "", |
2619 | title ? (const char *)title : "", |
2456 | title ? (const char *)title : "", |
2620 | flag_desc (flagdesc, 512), type); |
2457 | flag_desc (flagdesc, 512), type); |
2621 | |
2458 | |
2622 | if (env) |
2459 | if (!flag[FLAG_REMOVED] && env) |
2623 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2460 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2624 | |
2461 | |
2625 | if (map) |
2462 | if (map) |
2626 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2463 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2627 | |
2464 | |
… | |
… | |
2629 | } |
2466 | } |
2630 | |
2467 | |
2631 | const char * |
2468 | const char * |
2632 | object::debug_desc () const |
2469 | object::debug_desc () const |
2633 | { |
2470 | { |
2634 | static char info[256 * 4]; |
2471 | static char info[3][256 * 4]; |
|
|
2472 | static int info_idx; |
|
|
2473 | |
2635 | return debug_desc (info); |
2474 | return debug_desc (info [++info_idx % 3]); |
2636 | } |
2475 | } |
2637 | |
2476 | |
2638 | const char * |
2477 | struct region * |
2639 | object::debug_desc2 () const |
2478 | object::region () const |
2640 | { |
2479 | { |
2641 | static char info[256 * 4]; |
2480 | return map ? map->region (x, y) |
2642 | return debug_desc (info); |
2481 | : region::default_region (); |
2643 | } |
2482 | } |
2644 | |
2483 | |
|
|
2484 | const materialtype_t * |
|
|
2485 | object::dominant_material () const |
|
|
2486 | { |
|
|
2487 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2488 | return mt; |
|
|
2489 | |
|
|
2490 | return name_to_material (shstr_unknown); |
|
|
2491 | } |
|
|
2492 | |
|
|
2493 | void |
|
|
2494 | object::open_container (object *new_container) |
|
|
2495 | { |
|
|
2496 | if (container == new_container) |
|
|
2497 | return; |
|
|
2498 | |
|
|
2499 | object *old_container = container; |
|
|
2500 | |
|
|
2501 | if (old_container) |
|
|
2502 | { |
|
|
2503 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
|
|
2504 | return; |
|
|
2505 | |
|
|
2506 | #if 0 |
|
|
2507 | // remove the "Close old_container" object. |
|
|
2508 | if (object *closer = old_container->inv) |
|
|
2509 | if (closer->type == CLOSE_CON) |
|
|
2510 | closer->destroy (); |
|
|
2511 | #endif |
|
|
2512 | |
|
|
2513 | // make sure the container is available |
|
|
2514 | esrv_send_item (this, old_container); |
|
|
2515 | |
|
|
2516 | old_container->flag [FLAG_APPLIED] = false; |
|
|
2517 | container = 0; |
|
|
2518 | |
|
|
2519 | // client needs item update to make it work, client bug requires this to be separate |
|
|
2520 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2521 | |
|
|
2522 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2523 | play_sound (sound_find ("chest_close")); |
|
|
2524 | } |
|
|
2525 | |
|
|
2526 | if (new_container) |
|
|
2527 | { |
|
|
2528 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
|
|
2529 | return; |
|
|
2530 | |
|
|
2531 | // TODO: this does not seem to serve any purpose anymore? |
|
|
2532 | #if 0 |
|
|
2533 | // insert the "Close Container" object. |
|
|
2534 | if (archetype *closer = new_container->other_arch) |
|
|
2535 | { |
|
|
2536 | object *closer = arch_to_object (new_container->other_arch); |
|
|
2537 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
|
|
2538 | new_container->insert (closer); |
|
|
2539 | } |
|
|
2540 | #endif |
|
|
2541 | |
|
|
2542 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
|
|
2543 | |
|
|
2544 | // make sure the container is available, client bug requires this to be separate |
|
|
2545 | esrv_send_item (this, new_container); |
|
|
2546 | |
|
|
2547 | new_container->flag [FLAG_APPLIED] = true; |
|
|
2548 | container = new_container; |
|
|
2549 | |
|
|
2550 | // client needs flag change |
|
|
2551 | esrv_update_item (UPD_FLAGS, this, new_container); |
|
|
2552 | esrv_send_inventory (this, new_container); |
|
|
2553 | play_sound (sound_find ("chest_open")); |
|
|
2554 | } |
|
|
2555 | // else if (!old_container->env && contr && contr->ns) |
|
|
2556 | // contr->ns->floorbox_reset (); |
|
|
2557 | } |
|
|
2558 | |
|
|
2559 | object * |
|
|
2560 | object::force_find (const shstr name) |
|
|
2561 | { |
|
|
2562 | /* cycle through his inventory to look for the MARK we want to |
|
|
2563 | * place |
|
|
2564 | */ |
|
|
2565 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2566 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2567 | return splay (tmp); |
|
|
2568 | |
|
|
2569 | return 0; |
|
|
2570 | } |
|
|
2571 | |
|
|
2572 | void |
|
|
2573 | object::force_add (const shstr name, int duration) |
|
|
2574 | { |
|
|
2575 | if (object *force = force_find (name)) |
|
|
2576 | force->destroy (); |
|
|
2577 | |
|
|
2578 | object *force = get_archetype (FORCE_NAME); |
|
|
2579 | |
|
|
2580 | force->slaying = name; |
|
|
2581 | force->stats.food = 1; |
|
|
2582 | force->speed_left = -1.f; |
|
|
2583 | |
|
|
2584 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2585 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2586 | force->flag [FLAG_APPLIED] = true; |
|
|
2587 | |
|
|
2588 | insert (force); |
|
|
2589 | } |
|
|
2590 | |
|
|
2591 | void |
|
|
2592 | object::play_sound (faceidx sound) |
|
|
2593 | { |
|
|
2594 | if (!sound) |
|
|
2595 | return; |
|
|
2596 | |
|
|
2597 | if (flag [FLAG_REMOVED]) |
|
|
2598 | return; |
|
|
2599 | |
|
|
2600 | if (env) |
|
|
2601 | { |
|
|
2602 | if (object *pl = in_player ()) |
|
|
2603 | pl->contr->play_sound (sound); |
|
|
2604 | } |
|
|
2605 | else |
|
|
2606 | map->play_sound (sound, x, y); |
|
|
2607 | } |
|
|
2608 | |