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