1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
8 | * Deliantra is free software: you can redistribute it and/or modify |
9 | * under the terms of the GNU General Public License as published by the Free |
9 | * it under the terms of the GNU General Public License as published by |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
10 | * the Free Software Foundation, either version 3 of the License, or |
11 | * 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, but |
13 | * This program is distributed in the hope that it will be useful, |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * 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 along |
18 | * You should have received a copy of the GNU General Public License |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
|
|
21 | * |
20 | * |
22 | * The authors can be reached via e-mail to <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 |
191 | /* Do not merge objects if nrof would overflow. First part checks |
209 | /* Do not merge objects if nrof would overflow. We use 1UL<<31 since that |
192 | * for unsigned overflow (2c), second part checks whether the result |
210 | * value could not be stored in a sint32 (which unfortunately sometimes is |
193 | * would fit into a 32 bit signed int, which is often used to hold |
211 | * used to store nrof). |
194 | * nrof values. |
212 | */ |
195 | */ |
213 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
196 | if (~ob1->nrof < ob2->nrof || ob1->nrof + ob2->nrof > (1UL << 31)) |
214 | return 0; |
197 | return 0; |
215 | |
198 | |
216 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
199 | /* 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 |
200 | * 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 |
201 | * 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 |
202 | * are not equal - just if it has been identified, the been_applied |
220 | * flags lose any meaning. |
203 | * flags lose any meaning. |
221 | */ |
204 | */ |
222 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
205 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
223 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
206 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
224 | |
207 | |
225 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
208 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
226 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
209 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
227 | |
210 | |
228 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
211 | if (ob1->arch->archname != ob2->arch->archname |
229 | || ob1->arch != ob2->arch |
|
|
230 | || ob1->name != ob2->name |
212 | || ob1->name != ob2->name |
231 | || ob1->title != ob2->title |
213 | || ob1->title != ob2->title |
232 | || ob1->msg != ob2->msg |
214 | || ob1->msg != ob2->msg |
233 | || ob1->weight != ob2->weight |
215 | || 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 |
216 | || ob1->attacktype != ob2->attacktype |
237 | || ob1->magic != ob2->magic |
217 | || ob1->magic != ob2->magic |
238 | || ob1->slaying != ob2->slaying |
218 | || ob1->slaying != ob2->slaying |
239 | || ob1->skill != ob2->skill |
219 | || ob1->skill != ob2->skill |
240 | || ob1->value != ob2->value |
220 | || ob1->value != ob2->value |
241 | || ob1->animation_id != ob2->animation_id |
221 | || ob1->animation_id != ob2->animation_id |
|
|
222 | || (ob1->face != ob2->face && !ob1->animation_id) // face and animation are dependent on each other |
242 | || ob1->client_type != ob2->client_type |
223 | || ob1->client_type != ob2->client_type |
243 | || ob1->materialname != ob2->materialname |
224 | || ob1->materialname != ob2->materialname |
244 | || ob1->lore != ob2->lore |
225 | || ob1->lore != ob2->lore |
245 | || ob1->subtype != ob2->subtype |
226 | || ob1->subtype != ob2->subtype |
246 | || ob1->move_type != ob2->move_type |
227 | || ob1->move_type != ob2->move_type |
247 | || ob1->move_block != ob2->move_block |
228 | || ob1->move_block != ob2->move_block |
248 | || ob1->move_allow != ob2->move_allow |
229 | || ob1->move_allow != ob2->move_allow |
249 | || ob1->move_on != ob2->move_on |
230 | || ob1->move_on != ob2->move_on |
250 | || ob1->move_off != ob2->move_off |
231 | || ob1->move_off != ob2->move_off |
251 | || ob1->move_slow != ob2->move_slow |
232 | || ob1->move_slow != ob2->move_slow |
252 | || ob1->move_slow_penalty != ob2->move_slow_penalty) |
233 | || ob1->move_slow_penalty != ob2->move_slow_penalty |
|
|
234 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
235 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats))) |
253 | return 0; |
236 | return 0; |
254 | |
237 | |
|
|
238 | if ((ob1->flag ^ ob2->flag) |
|
|
239 | .reset (FLAG_INV_LOCKED) |
|
|
240 | .reset (FLAG_CLIENT_SENT) |
|
|
241 | .reset (FLAG_REMOVED) |
|
|
242 | .any ()) |
|
|
243 | return 0; |
|
|
244 | |
255 | /* This is really a spellbook check - really, we should |
245 | /* This is really a spellbook check - we should in general |
256 | * check all objects in the inventory. |
246 | * not merge objects with real inventories, as splitting them |
|
|
247 | * is hard. |
257 | */ |
248 | */ |
258 | if (ob1->inv || ob2->inv) |
249 | if (ob1->inv || ob2->inv) |
259 | { |
250 | { |
260 | /* if one object has inventory but the other doesn't, not equiv */ |
251 | if (!(ob1->inv && ob2->inv)) |
261 | if ((ob1->inv && !ob2->inv) || (ob2->inv && !ob1->inv)) |
252 | return 0; /* inventories differ in length */ |
262 | return 0; |
|
|
263 | |
253 | |
264 | /* Now check to see if the two inventory objects could merge */ |
254 | if (ob1->inv->below || ob2->inv->below) |
|
|
255 | return 0; /* more than one object in inv */ |
|
|
256 | |
265 | if (!object::can_merge (ob1->inv, ob2->inv)) |
257 | if (!object::can_merge (ob1->inv, ob2->inv)) |
266 | return 0; |
258 | return 0; /* inventory objects differ */ |
267 | |
259 | |
268 | /* inventory ok - still need to check rest of this object to see |
260 | /* inventory ok - still need to check rest of this object to see |
269 | * if it is valid. |
261 | * if it is valid. |
270 | */ |
262 | */ |
271 | } |
263 | } |
… | |
… | |
290 | if (ob1->level != ob2->level) |
282 | if (ob1->level != ob2->level) |
291 | return 0; |
283 | return 0; |
292 | break; |
284 | break; |
293 | } |
285 | } |
294 | |
286 | |
295 | if (ob1->key_values != NULL || ob2->key_values != NULL) |
287 | if (ob1->key_values || ob2->key_values) |
296 | { |
288 | { |
297 | /* At least one of these has key_values. */ |
289 | /* At least one of these has key_values. */ |
298 | if ((ob1->key_values == NULL) != (ob2->key_values == NULL)) |
290 | if ((!ob1->key_values) != (!ob2->key_values)) |
299 | /* One has fields, but the other one doesn't. */ |
291 | return 0; /* One has fields, but the other one doesn't. */ |
|
|
292 | |
|
|
293 | if (!compare_ob_value_lists (ob1, ob2)) |
300 | return 0; |
294 | return 0; |
301 | else if (!compare_ob_value_lists (ob1, ob2)) |
|
|
302 | return 0; |
|
|
303 | } |
295 | } |
304 | |
296 | |
305 | //TODO: generate an event or call into perl for additional checks |
|
|
306 | if (ob1->self || ob2->self) |
297 | if (ob1->self || ob2->self) |
307 | { |
298 | { |
308 | ob1->optimise (); |
299 | ob1->optimise (); |
309 | ob2->optimise (); |
300 | ob2->optimise (); |
310 | |
301 | |
311 | if (ob1->self || ob2->self) |
302 | if (ob1->self || ob2->self) |
|
|
303 | { |
|
|
304 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
|
|
305 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
|
|
306 | |
|
|
307 | if (k1 != k2) |
312 | return 0; |
308 | return 0; |
|
|
309 | |
|
|
310 | if (k1 == 0) |
|
|
311 | return 1; |
|
|
312 | |
|
|
313 | if (!cfperl_can_merge (ob1, ob2)) |
|
|
314 | return 0; |
|
|
315 | } |
313 | } |
316 | } |
314 | |
317 | |
315 | /* Everything passes, must be OK. */ |
318 | /* Everything passes, must be OK. */ |
316 | return 1; |
319 | return 1; |
317 | } |
320 | } |
318 | |
321 | |
|
|
322 | // find player who can see this object |
|
|
323 | object * |
|
|
324 | object::visible_to () const |
|
|
325 | { |
|
|
326 | if (client_visible () && !flag [FLAG_REMOVED]) |
|
|
327 | { |
|
|
328 | // see if we are in a container of sorts |
|
|
329 | if (env) |
|
|
330 | { |
|
|
331 | // the player inventory itself is always visible |
|
|
332 | if (env->type == PLAYER) |
|
|
333 | return env; |
|
|
334 | |
|
|
335 | // else a player could have our env open |
|
|
336 | object *envest = env->outer_env (); |
|
|
337 | |
|
|
338 | // the player itself is always on a map, so we will find him here |
|
|
339 | // even if our inv is in a player. |
|
|
340 | if (envest->is_on_map ()) |
|
|
341 | if (object *pl = envest->ms ().player ()) |
|
|
342 | if (pl->container == env) |
|
|
343 | return pl; |
|
|
344 | } |
|
|
345 | else |
|
|
346 | { |
|
|
347 | // maybe there is a player standing on the same mapspace |
|
|
348 | // this will catch the case where "this" is a player |
|
|
349 | if (object *pl = ms ().player ()) |
|
|
350 | if ((!pl->container && pl->contr->ns && !pl->contr->ns->update_look) |
|
|
351 | || this == pl->container) |
|
|
352 | return pl; |
|
|
353 | } |
|
|
354 | } |
|
|
355 | |
|
|
356 | return 0; |
|
|
357 | } |
|
|
358 | |
|
|
359 | // adjust weight per container type ("of holding") |
|
|
360 | static sint32 |
|
|
361 | weight_adjust_for (object *op, sint32 weight) |
|
|
362 | { |
|
|
363 | return op->type == CONTAINER |
|
|
364 | ? lerp (weight, 0, 100, 0, 100 - op->stats.Str) |
|
|
365 | : weight; |
|
|
366 | } |
|
|
367 | |
319 | /* |
368 | /* |
|
|
369 | * adjust_weight(object, weight) adds the specified weight to an object, |
|
|
370 | * and also updates how much the environment(s) is/are carrying. |
|
|
371 | */ |
|
|
372 | static void |
|
|
373 | adjust_weight (object *op, sint32 weight) |
|
|
374 | { |
|
|
375 | while (op) |
|
|
376 | { |
|
|
377 | // adjust by actual difference to account for rounding errors |
|
|
378 | // i.e. (w2 - w1) / f != w2 / f - w1 / f and the latter is correct |
|
|
379 | weight = weight_adjust_for (op, op->carrying) |
|
|
380 | - weight_adjust_for (op, op->carrying - weight); |
|
|
381 | |
|
|
382 | if (!weight) |
|
|
383 | return; |
|
|
384 | |
|
|
385 | op->carrying += weight; |
|
|
386 | |
|
|
387 | if (object *pl = op->visible_to ()) |
|
|
388 | if (pl != op) // player is handled lazily |
|
|
389 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
390 | |
|
|
391 | op = op->env; |
|
|
392 | } |
|
|
393 | } |
|
|
394 | |
|
|
395 | /* |
320 | * sum_weight() is a recursive function which calculates the weight |
396 | * this is a recursive function which calculates the weight |
321 | * an object is carrying. It goes through in figures out how much |
397 | * an object is carrying. It goes through op and figures out how much |
322 | * containers are carrying, and sums it up. |
398 | * containers are carrying, and sums it up. |
323 | */ |
399 | */ |
324 | long |
400 | void |
325 | sum_weight (object *op) |
401 | object::update_weight () |
326 | { |
402 | { |
327 | long sum; |
403 | sint32 sum = 0; |
328 | object *inv; |
|
|
329 | |
404 | |
330 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
405 | for (object *op = inv; op; op = op->below) |
331 | { |
406 | { |
332 | if (inv->inv) |
407 | if (op->inv) |
333 | sum_weight (inv); |
408 | op->update_weight (); |
334 | |
409 | |
335 | sum += inv->carrying + inv->weight * (inv->nrof ? inv->nrof : 1); |
410 | sum += op->total_weight (); |
|
|
411 | } |
|
|
412 | |
|
|
413 | sum = weight_adjust_for (this, sum); |
|
|
414 | |
|
|
415 | if (sum != carrying) |
336 | } |
416 | { |
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; |
417 | carrying = sum; |
343 | |
418 | |
344 | return sum; |
419 | if (object *pl = visible_to ()) |
|
|
420 | if (pl != this) // player is handled lazily |
|
|
421 | esrv_update_item (UPD_WEIGHT, pl, this); |
|
|
422 | } |
345 | } |
423 | } |
346 | |
424 | |
347 | /** |
425 | /* |
348 | * Return the outermost environment object for a given object. |
426 | * 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 | */ |
427 | */ |
364 | char * |
428 | char * |
365 | dump_object (object *op) |
429 | dump_object (object *op) |
366 | { |
430 | { |
367 | if (!op) |
431 | if (!op) |
… | |
… | |
375 | /* |
439 | /* |
376 | * get_nearest_part(multi-object, object 2) returns the part of the |
440 | * get_nearest_part(multi-object, object 2) returns the part of the |
377 | * multi-object 1 which is closest to the second object. |
441 | * multi-object 1 which is closest to the second object. |
378 | * If it's not a multi-object, it is returned. |
442 | * If it's not a multi-object, it is returned. |
379 | */ |
443 | */ |
380 | |
|
|
381 | object * |
444 | object * |
382 | get_nearest_part (object *op, const object *pl) |
445 | get_nearest_part (object *op, const object *pl) |
383 | { |
446 | { |
384 | object *tmp, *closest; |
447 | object *tmp, *closest; |
385 | int last_dist, i; |
448 | int last_dist, i; |
386 | |
449 | |
387 | if (op->more == NULL) |
450 | if (!op->more) |
388 | return op; |
451 | return op; |
|
|
452 | |
389 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
453 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; |
|
|
454 | tmp; |
|
|
455 | tmp = tmp->more) |
390 | if ((i = distance (tmp, pl)) < last_dist) |
456 | if ((i = distance (tmp, pl)) < last_dist) |
391 | closest = tmp, last_dist = i; |
457 | closest = tmp, last_dist = i; |
|
|
458 | |
392 | return closest; |
459 | return closest; |
393 | } |
460 | } |
394 | |
461 | |
395 | /* |
462 | /* |
396 | * Returns the object which has the count-variable equal to the argument. |
463 | * Returns the object which has the count-variable equal to the argument. |
|
|
464 | * VERRRY slow. |
397 | */ |
465 | */ |
398 | object * |
466 | object * |
399 | find_object (tag_t i) |
467 | find_object (tag_t i) |
400 | { |
468 | { |
401 | for_all_objects (op) |
469 | for_all_objects (op) |
… | |
… | |
412 | */ |
480 | */ |
413 | object * |
481 | object * |
414 | find_object_name (const char *str) |
482 | find_object_name (const char *str) |
415 | { |
483 | { |
416 | shstr_cmp str_ (str); |
484 | shstr_cmp str_ (str); |
417 | object *op; |
|
|
418 | |
485 | |
|
|
486 | if (str_) |
419 | for_all_objects (op) |
487 | for_all_objects (op) |
420 | if (op->name == str_) |
488 | if (op->name == str_) |
421 | break; |
489 | return op; |
422 | |
490 | |
423 | return op; |
491 | return 0; |
424 | } |
|
|
425 | |
|
|
426 | void |
|
|
427 | free_all_object_data () |
|
|
428 | { |
|
|
429 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
430 | } |
492 | } |
431 | |
493 | |
432 | /* |
494 | /* |
433 | * Sets the owner and sets the skill and exp pointers to owner's current |
495 | * Sets the owner and sets the skill and exp pointers to owner's current |
434 | * skill and experience objects. |
496 | * skill and experience objects. |
|
|
497 | * ACTUALLY NO! investigate! TODO |
435 | */ |
498 | */ |
436 | void |
499 | void |
437 | object::set_owner (object *owner) |
500 | object::set_owner (object *owner) |
438 | { |
501 | { |
|
|
502 | // allow objects which own objects |
439 | if (!owner) |
503 | 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) |
504 | while (owner->owner) |
450 | owner = owner->owner; |
505 | owner = owner->owner; |
|
|
506 | |
|
|
507 | if (flag [FLAG_FREED]) |
|
|
508 | { |
|
|
509 | LOG (llevError | logBacktrace, "tried to set owner of %s to %s\n", debug_desc (), owner->debug_desc ()); |
|
|
510 | return; |
|
|
511 | } |
451 | |
512 | |
452 | this->owner = owner; |
513 | this->owner = owner; |
453 | } |
514 | } |
454 | |
515 | |
455 | int |
516 | int |
… | |
… | |
533 | } |
594 | } |
534 | |
595 | |
535 | op->key_values = 0; |
596 | op->key_values = 0; |
536 | } |
597 | } |
537 | |
598 | |
538 | object & |
599 | /* |
539 | object::operator =(const object &src) |
600 | * copy_to first frees everything allocated by the dst object, |
|
|
601 | * and then copies the contents of itself into the second |
|
|
602 | * object, allocating what needs to be allocated. Basically, any |
|
|
603 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
604 | * if the first object is freed, the pointers in the new object |
|
|
605 | * will point at garbage. |
|
|
606 | */ |
|
|
607 | void |
|
|
608 | object::copy_to (object *dst) |
540 | { |
609 | { |
541 | bool is_freed = flag [FLAG_FREED]; |
610 | dst->remove (); |
542 | bool is_removed = flag [FLAG_REMOVED]; |
|
|
543 | |
|
|
544 | *(object_copy *)this = src; |
611 | *(object_copy *)dst = *this; |
545 | |
|
|
546 | flag [FLAG_FREED] = is_freed; |
|
|
547 | flag [FLAG_REMOVED] = is_removed; |
612 | dst->flag [FLAG_REMOVED] = true; |
548 | |
613 | |
549 | /* Copy over key_values, if any. */ |
614 | /* Copy over key_values, if any. */ |
550 | if (src.key_values) |
615 | if (key_values) |
551 | { |
616 | { |
552 | key_value *tail = 0; |
617 | key_value *tail = 0; |
553 | key_values = 0; |
618 | dst->key_values = 0; |
554 | |
619 | |
555 | for (key_value *i = src.key_values; i; i = i->next) |
620 | for (key_value *i = key_values; i; i = i->next) |
556 | { |
621 | { |
557 | key_value *new_link = new key_value; |
622 | key_value *new_link = new key_value; |
558 | |
623 | |
559 | new_link->next = 0; |
624 | new_link->next = 0; |
560 | new_link->key = i->key; |
625 | new_link->key = i->key; |
561 | new_link->value = i->value; |
626 | new_link->value = i->value; |
562 | |
627 | |
563 | /* Try and be clever here, too. */ |
628 | /* Try and be clever here, too. */ |
564 | if (!key_values) |
629 | if (!dst->key_values) |
565 | { |
630 | { |
566 | key_values = new_link; |
631 | dst->key_values = new_link; |
567 | tail = new_link; |
632 | tail = new_link; |
568 | } |
633 | } |
569 | else |
634 | else |
570 | { |
635 | { |
571 | tail->next = new_link; |
636 | tail->next = new_link; |
572 | tail = new_link; |
637 | tail = new_link; |
573 | } |
638 | } |
574 | } |
639 | } |
575 | } |
640 | } |
576 | } |
|
|
577 | |
|
|
578 | /* |
|
|
579 | * copy_to first frees everything allocated by the dst object, |
|
|
580 | * and then copies the contents of itself into the second |
|
|
581 | * object, allocating what needs to be allocated. Basically, any |
|
|
582 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
583 | * if the first object is freed, the pointers in the new object |
|
|
584 | * will point at garbage. |
|
|
585 | */ |
|
|
586 | void |
|
|
587 | object::copy_to (object *dst) |
|
|
588 | { |
|
|
589 | *dst = *this; |
|
|
590 | |
641 | |
591 | if (speed < 0) |
642 | if (speed < 0) |
592 | dst->speed_left = speed_left - rndm (); |
643 | dst->speed_left -= rndm (); |
593 | |
644 | |
594 | dst->set_speed (dst->speed); |
645 | dst->set_speed (dst->speed); |
595 | } |
646 | } |
596 | |
647 | |
597 | void |
648 | void |
598 | object::instantiate () |
649 | object::instantiate () |
599 | { |
650 | { |
600 | if (!uuid.seq) // HACK |
651 | if (!uuid.seq) // HACK |
601 | uuid = gen_uuid (); |
652 | uuid = UUID::gen (); |
602 | |
653 | |
603 | speed_left = -0.1f; |
654 | speed_left = -0.1f; |
604 | /* copy the body_info to the body_used - this is only really |
655 | /* copy the body_info to the body_used - this is only really |
605 | * need for monsters, but doesn't hurt to do it for everything. |
656 | * need for monsters, but doesn't hurt to do it for everything. |
606 | * by doing so, when a monster is created, it has good starting |
657 | * by doing so, when a monster is created, it has good starting |
… | |
… | |
616 | object * |
667 | object * |
617 | object::clone () |
668 | object::clone () |
618 | { |
669 | { |
619 | object *neu = create (); |
670 | object *neu = create (); |
620 | copy_to (neu); |
671 | copy_to (neu); |
|
|
672 | neu->map = map; // not copied by copy_to |
621 | return neu; |
673 | return neu; |
622 | } |
674 | } |
623 | |
675 | |
624 | /* |
676 | /* |
625 | * If an object with the IS_TURNABLE() flag needs to be turned due |
677 | * If an object with the IS_TURNABLE() flag needs to be turned due |
… | |
… | |
676 | * UP_OBJ_FACE: only the objects face has changed. |
728 | * UP_OBJ_FACE: only the objects face has changed. |
677 | */ |
729 | */ |
678 | void |
730 | void |
679 | update_object (object *op, int action) |
731 | update_object (object *op, int action) |
680 | { |
732 | { |
681 | if (op == NULL) |
733 | if (!op) |
682 | { |
734 | { |
683 | /* this should never happen */ |
735 | /* this should never happen */ |
684 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
736 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
685 | return; |
737 | return; |
686 | } |
738 | } |
687 | |
739 | |
688 | if (op->env) |
740 | if (!op->is_on_map ()) |
689 | { |
741 | { |
690 | /* Animation is currently handled by client, so nothing |
742 | /* Animation is currently handled by client, so nothing |
691 | * to do in this case. |
743 | * to do in this case. |
692 | */ |
744 | */ |
693 | return; |
745 | return; |
694 | } |
746 | } |
695 | |
|
|
696 | /* If the map is saving, don't do anything as everything is |
|
|
697 | * going to get freed anyways. |
|
|
698 | */ |
|
|
699 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
700 | return; |
|
|
701 | |
747 | |
702 | /* make sure the object is within map boundaries */ |
748 | /* make sure the object is within map boundaries */ |
703 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
749 | if (op->x < 0 || op->x >= op->map->width || op->y < 0 || op->y >= op->map->height) |
704 | { |
750 | { |
705 | LOG (llevError, "update_object() called for object out of map!\n"); |
751 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
765 | static int object_count; |
811 | static int object_count; |
766 | |
812 | |
767 | void object::link () |
813 | void object::link () |
768 | { |
814 | { |
769 | assert (!index);//D |
815 | assert (!index);//D |
770 | uuid = gen_uuid (); |
816 | uuid = UUID::gen (); |
771 | count = ++object_count; |
817 | count = ++object_count; |
772 | |
818 | |
773 | refcnt_inc (); |
819 | refcnt_inc (); |
774 | objects.insert (this); |
820 | objects.insert (this); |
775 | } |
821 | } |
… | |
… | |
848 | object::destroy_inv (bool drop_to_ground) |
894 | object::destroy_inv (bool drop_to_ground) |
849 | { |
895 | { |
850 | // need to check first, because the checks below might segfault |
896 | // need to check first, because the checks below might segfault |
851 | // as we might be on an invalid mapspace and crossfire code |
897 | // as we might be on an invalid mapspace and crossfire code |
852 | // is too buggy to ensure that the inventory is empty. |
898 | // is too buggy to ensure that the inventory is empty. |
853 | // corollary: if you create arrows etc. with stuff in tis inventory, |
899 | // corollary: if you create arrows etc. with stuff in its inventory, |
854 | // cf will crash below with off-map x and y |
900 | // cf will crash below with off-map x and y |
855 | if (!inv) |
901 | if (!inv) |
856 | return; |
902 | return; |
857 | |
903 | |
858 | /* Only if the space blocks everything do we not process - |
904 | /* Only if the space blocks everything do we not process - |
859 | * if some form of movement is allowed, let objects |
905 | * if some form of movement is allowed, let objects |
860 | * drop on that space. |
906 | * drop on that space. |
861 | */ |
907 | */ |
862 | if (!drop_to_ground |
908 | if (!drop_to_ground |
863 | || !map |
909 | || !map |
864 | || map->in_memory != MAP_IN_MEMORY |
910 | || map->in_memory != MAP_ACTIVE |
865 | || map->nodrop |
911 | || map->no_drop |
866 | || ms ().move_block == MOVE_ALL) |
912 | || ms ().move_block == MOVE_ALL) |
867 | { |
913 | { |
868 | while (inv) |
914 | while (inv) |
869 | { |
|
|
870 | inv->destroy_inv (drop_to_ground); |
|
|
871 | inv->destroy (); |
915 | inv->destroy (true); |
872 | } |
|
|
873 | } |
916 | } |
874 | else |
917 | else |
875 | { /* Put objects in inventory onto this space */ |
918 | { /* Put objects in inventory onto this space */ |
876 | while (inv) |
919 | while (inv) |
877 | { |
920 | { |
… | |
… | |
881 | || op->flag [FLAG_NO_DROP] |
924 | || op->flag [FLAG_NO_DROP] |
882 | || op->type == RUNE |
925 | || op->type == RUNE |
883 | || op->type == TRAP |
926 | || op->type == TRAP |
884 | || op->flag [FLAG_IS_A_TEMPLATE] |
927 | || op->flag [FLAG_IS_A_TEMPLATE] |
885 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
928 | || op->flag [FLAG_DESTROY_ON_DEATH]) |
886 | op->destroy (); |
929 | op->destroy (true); |
887 | else |
930 | else |
888 | map->insert (op, x, y); |
931 | map->insert (op, x, y); |
889 | } |
932 | } |
890 | } |
933 | } |
891 | } |
934 | } |
… | |
… | |
895 | object *op = new object; |
938 | object *op = new object; |
896 | op->link (); |
939 | op->link (); |
897 | return op; |
940 | return op; |
898 | } |
941 | } |
899 | |
942 | |
|
|
943 | static struct freed_map : maptile |
|
|
944 | { |
|
|
945 | freed_map () |
|
|
946 | { |
|
|
947 | path = "<freed objects map>"; |
|
|
948 | name = "/internal/freed_objects_map"; |
|
|
949 | width = 3; |
|
|
950 | height = 3; |
|
|
951 | no_drop = 1; |
|
|
952 | no_reset = 1; |
|
|
953 | |
|
|
954 | alloc (); |
|
|
955 | in_memory = MAP_ACTIVE; |
|
|
956 | } |
|
|
957 | |
|
|
958 | ~freed_map () |
|
|
959 | { |
|
|
960 | destroy (); |
|
|
961 | } |
|
|
962 | } freed_map; // freed objects are moved here to avoid crashes |
|
|
963 | |
900 | void |
964 | void |
901 | object::do_destroy () |
965 | object::do_destroy () |
902 | { |
966 | { |
903 | attachable::do_destroy (); |
|
|
904 | |
|
|
905 | if (flag [FLAG_IS_LINKED]) |
967 | if (flag [FLAG_IS_LINKED]) |
906 | remove_button_link (this); |
968 | remove_button_link (this); |
907 | |
969 | |
908 | if (flag [FLAG_FRIENDLY]) |
970 | if (flag [FLAG_FRIENDLY]) |
909 | remove_friendly_object (this); |
971 | remove_friendly_object (this); |
910 | |
972 | |
911 | if (!flag [FLAG_REMOVED]) |
|
|
912 | remove (); |
973 | remove (); |
913 | |
974 | |
914 | destroy_inv (true); |
975 | attachable::do_destroy (); |
915 | |
976 | |
916 | deactivate (); |
977 | deactivate (); |
917 | unlink (); |
978 | unlink (); |
918 | |
979 | |
919 | flag [FLAG_FREED] = 1; |
980 | flag [FLAG_FREED] = 1; |
920 | |
981 | |
921 | // hack to ensure that freed objects still have a valid map |
982 | // hack to ensure that freed objects still have a valid map |
922 | { |
|
|
923 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
924 | |
|
|
925 | if (!freed_map) |
|
|
926 | { |
|
|
927 | freed_map = new maptile; |
|
|
928 | |
|
|
929 | freed_map->name = "/internal/freed_objects_map"; |
|
|
930 | freed_map->width = 3; |
|
|
931 | freed_map->height = 3; |
|
|
932 | |
|
|
933 | freed_map->alloc (); |
|
|
934 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
935 | } |
|
|
936 | |
|
|
937 | map = freed_map; |
983 | map = &freed_map; |
938 | x = 1; |
984 | x = 1; |
939 | y = 1; |
985 | y = 1; |
940 | } |
|
|
941 | |
|
|
942 | head = 0; |
|
|
943 | |
986 | |
944 | if (more) |
987 | if (more) |
945 | { |
988 | { |
946 | more->destroy (); |
989 | more->destroy (); |
947 | more = 0; |
990 | more = 0; |
948 | } |
991 | } |
949 | |
992 | |
|
|
993 | head = 0; |
|
|
994 | |
950 | // clear those pointers that likely might have circular references to us |
995 | // clear those pointers that likely might cause circular references |
951 | owner = 0; |
996 | owner = 0; |
952 | enemy = 0; |
997 | enemy = 0; |
953 | attacked_by = 0; |
998 | attacked_by = 0; |
|
|
999 | current_weapon = 0; |
954 | } |
1000 | } |
955 | |
1001 | |
956 | void |
1002 | void |
957 | object::destroy (bool destroy_inventory) |
1003 | object::destroy (bool destroy_inventory) |
958 | { |
1004 | { |
959 | if (destroyed ()) |
1005 | if (destroyed ()) |
960 | return; |
1006 | return; |
961 | |
1007 | |
|
|
1008 | if (!is_head () && !head->destroyed ()) |
|
|
1009 | { |
|
|
1010 | LOG (llevError | logBacktrace, "tried to destroy the tail of an object"); |
|
|
1011 | head->destroy (destroy_inventory); |
|
|
1012 | return; |
|
|
1013 | } |
|
|
1014 | |
962 | if (destroy_inventory) |
1015 | destroy_inv (!destroy_inventory); |
963 | destroy_inv (false); |
1016 | |
|
|
1017 | if (is_head ()) |
|
|
1018 | if (sound_destroy) |
|
|
1019 | play_sound (sound_destroy); |
|
|
1020 | else if (flag [FLAG_MONSTER]) |
|
|
1021 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
964 | |
1022 | |
965 | attachable::destroy (); |
1023 | attachable::destroy (); |
966 | } |
|
|
967 | |
|
|
968 | /* |
|
|
969 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
970 | * weight of an object (and what is carried by it's environment(s)). |
|
|
971 | */ |
|
|
972 | void |
|
|
973 | sub_weight (object *op, signed long weight) |
|
|
974 | { |
|
|
975 | while (op != NULL) |
|
|
976 | { |
|
|
977 | if (op->type == CONTAINER) |
|
|
978 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
979 | |
|
|
980 | op->carrying -= weight; |
|
|
981 | op = op->env; |
|
|
982 | } |
|
|
983 | } |
1024 | } |
984 | |
1025 | |
985 | /* op->remove (): |
1026 | /* op->remove (): |
986 | * This function removes the object op from the linked list of objects |
1027 | * This function removes the object op from the linked list of objects |
987 | * which it is currently tied to. When this function is done, the |
1028 | * which it is currently tied to. When this function is done, the |
… | |
… | |
993 | object::do_remove () |
1034 | object::do_remove () |
994 | { |
1035 | { |
995 | object *tmp, *last = 0; |
1036 | object *tmp, *last = 0; |
996 | object *otmp; |
1037 | object *otmp; |
997 | |
1038 | |
998 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
1039 | if (flag [FLAG_REMOVED]) |
999 | return; |
1040 | return; |
1000 | |
1041 | |
1001 | SET_FLAG (this, FLAG_REMOVED); |
|
|
1002 | INVOKE_OBJECT (REMOVE, this); |
1042 | INVOKE_OBJECT (REMOVE, this); |
|
|
1043 | |
|
|
1044 | flag [FLAG_REMOVED] = true; |
1003 | |
1045 | |
1004 | if (more) |
1046 | if (more) |
1005 | more->remove (); |
1047 | more->remove (); |
1006 | |
1048 | |
1007 | /* |
1049 | /* |
1008 | * In this case, the object to be removed is in someones |
1050 | * In this case, the object to be removed is in someones |
1009 | * inventory. |
1051 | * inventory. |
1010 | */ |
1052 | */ |
1011 | if (env) |
1053 | if (env) |
1012 | { |
1054 | { |
1013 | if (nrof) |
1055 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1014 | sub_weight (env, weight * nrof); |
1056 | if (object *pl = visible_to ()) |
1015 | else |
1057 | esrv_del_item (pl->contr, count); |
1016 | sub_weight (env, weight + carrying); |
1058 | flag [FLAG_REMOVED] = true; // hack around the issue of visible_to checking flag_removed |
|
|
1059 | |
|
|
1060 | adjust_weight (env, -total_weight ()); |
|
|
1061 | |
|
|
1062 | /* we set up values so that it could be inserted into |
|
|
1063 | * the map, but we don't actually do that - it is up |
|
|
1064 | * to the caller to decide what we want to do. |
|
|
1065 | */ |
|
|
1066 | map = env->map; |
|
|
1067 | x = env->x; |
|
|
1068 | y = env->y; |
|
|
1069 | |
|
|
1070 | // make sure cmov optimisation is applicable |
|
|
1071 | *(above ? &above->below : &env->inv) = below; |
|
|
1072 | *(below ? &below->above : &above ) = above; // &above is just a dummy |
|
|
1073 | |
|
|
1074 | above = 0; |
|
|
1075 | below = 0; |
|
|
1076 | env = 0; |
1017 | |
1077 | |
1018 | /* NO_FIX_PLAYER is set when a great many changes are being |
1078 | /* NO_FIX_PLAYER is set when a great many changes are being |
1019 | * made to players inventory. If set, avoiding the call |
1079 | * made to players inventory. If set, avoiding the call |
1020 | * to save cpu time. |
1080 | * to save cpu time. |
1021 | */ |
1081 | */ |
1022 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1082 | if ((otmp = in_player ()) && otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
1023 | otmp->update_stats (); |
1083 | otmp->update_stats (); |
1024 | |
|
|
1025 | if (above) |
|
|
1026 | above->below = below; |
|
|
1027 | else |
|
|
1028 | env->inv = below; |
|
|
1029 | |
|
|
1030 | if (below) |
|
|
1031 | below->above = above; |
|
|
1032 | |
|
|
1033 | /* we set up values so that it could be inserted into |
|
|
1034 | * the map, but we don't actually do that - it is up |
|
|
1035 | * to the caller to decide what we want to do. |
|
|
1036 | */ |
|
|
1037 | x = env->x, y = env->y; |
|
|
1038 | map = env->map; |
|
|
1039 | above = 0, below = 0; |
|
|
1040 | env = 0; |
|
|
1041 | } |
1084 | } |
1042 | else if (map) |
1085 | else if (map) |
1043 | { |
1086 | { |
1044 | if (type == PLAYER) |
|
|
1045 | { |
|
|
1046 | // leaving a spot always closes any open container on the ground |
|
|
1047 | if (container && !container->env) |
|
|
1048 | // this causes spurious floorbox updates, but it ensures |
|
|
1049 | // that the CLOSE event is being sent. |
|
|
1050 | close_container (); |
|
|
1051 | |
|
|
1052 | --map->players; |
|
|
1053 | map->touch (); |
|
|
1054 | } |
|
|
1055 | |
|
|
1056 | map->dirty = true; |
1087 | map->dirty = true; |
1057 | mapspace &ms = this->ms (); |
1088 | mapspace &ms = this->ms (); |
1058 | |
1089 | |
|
|
1090 | if (object *pl = ms.player ()) |
|
|
1091 | { |
|
|
1092 | if (type == PLAYER) // this == pl(!) |
|
|
1093 | { |
|
|
1094 | // leaving a spot always closes any open container on the ground |
|
|
1095 | if (container && !container->env) |
|
|
1096 | // this causes spurious floorbox updates, but it ensures |
|
|
1097 | // that the CLOSE event is being sent. |
|
|
1098 | close_container (); |
|
|
1099 | |
|
|
1100 | --map->players; |
|
|
1101 | map->touch (); |
|
|
1102 | } |
|
|
1103 | else if (pl->container == this) |
|
|
1104 | { |
|
|
1105 | // removing a container should close it |
|
|
1106 | close_container (); |
|
|
1107 | } |
|
|
1108 | |
|
|
1109 | esrv_del_item (pl->contr, count); |
|
|
1110 | } |
|
|
1111 | |
1059 | /* link the object above us */ |
1112 | /* link the object above us */ |
1060 | if (above) |
1113 | // re-link, make sure compiler can easily use cmove |
1061 | above->below = below; |
1114 | *(above ? &above->below : &ms.top) = below; |
1062 | else |
1115 | *(below ? &below->above : &ms.bot) = above; |
1063 | ms.top = below; /* we were top, set new top */ |
|
|
1064 | |
|
|
1065 | /* Relink the object below us, if there is one */ |
|
|
1066 | if (below) |
|
|
1067 | below->above = above; |
|
|
1068 | else |
|
|
1069 | { |
|
|
1070 | /* Nothing below, which means we need to relink map object for this space |
|
|
1071 | * use translated coordinates in case some oddness with map tiling is |
|
|
1072 | * evident |
|
|
1073 | */ |
|
|
1074 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1075 | 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 ()); |
|
|
1076 | |
|
|
1077 | ms.bot = above; /* goes on above it. */ |
|
|
1078 | } |
|
|
1079 | |
1116 | |
1080 | above = 0; |
1117 | above = 0; |
1081 | below = 0; |
1118 | below = 0; |
1082 | |
1119 | |
1083 | if (map->in_memory == MAP_SAVING) |
1120 | if (map->in_memory == MAP_SAVING) |
1084 | return; |
1121 | return; |
1085 | |
1122 | |
1086 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1123 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
|
|
1124 | |
|
|
1125 | if (object *pl = ms.player ()) |
|
|
1126 | { |
|
|
1127 | if (pl->container == this) |
|
|
1128 | /* If a container that the player is currently using somehow gets |
|
|
1129 | * removed (most likely destroyed), update the player view |
|
|
1130 | * appropriately. |
|
|
1131 | */ |
|
|
1132 | pl->close_container (); |
|
|
1133 | |
|
|
1134 | //TODO: the floorbox prev/next might need updating |
|
|
1135 | //esrv_del_item (pl->contr, count); |
|
|
1136 | //TODO: update floorbox to preserve ordering |
|
|
1137 | if (pl->contr->ns) |
|
|
1138 | pl->contr->ns->floorbox_update (); |
|
|
1139 | } |
1087 | |
1140 | |
1088 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1141 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1089 | { |
1142 | { |
1090 | /* No point updating the players look faces if he is the object |
1143 | /* No point updating the players look faces if he is the object |
1091 | * being removed. |
1144 | * being removed. |
1092 | */ |
1145 | */ |
1093 | |
|
|
1094 | if (tmp->type == PLAYER && tmp != this) |
|
|
1095 | { |
|
|
1096 | /* If a container that the player is currently using somehow gets |
|
|
1097 | * removed (most likely destroyed), update the player view |
|
|
1098 | * appropriately. |
|
|
1099 | */ |
|
|
1100 | if (tmp->container == this) |
|
|
1101 | { |
|
|
1102 | flag [FLAG_APPLIED] = 0; |
|
|
1103 | tmp->container = 0; |
|
|
1104 | } |
|
|
1105 | |
|
|
1106 | if (tmp->contr->ns) |
|
|
1107 | tmp->contr->ns->floorbox_update (); |
|
|
1108 | } |
|
|
1109 | |
1146 | |
1110 | /* See if object moving off should effect something */ |
1147 | /* See if object moving off should effect something */ |
1111 | if (check_walk_off |
1148 | if (check_walk_off |
1112 | && ((move_type & tmp->move_off) |
1149 | && ((move_type & tmp->move_off) |
1113 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1150 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
… | |
… | |
1116 | |
1153 | |
1117 | if (destroyed ()) |
1154 | if (destroyed ()) |
1118 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1155 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
1119 | } |
1156 | } |
1120 | |
1157 | |
1121 | /* Eneq(@csd.uu.se): Fixed this to skip tmp->above=tmp */ |
|
|
1122 | //TODO: why is this horrible hacka fix? get rid of this code=bug! (schmorp) |
|
|
1123 | if (tmp->above == tmp) |
|
|
1124 | tmp->above = 0; |
|
|
1125 | |
|
|
1126 | last = tmp; |
1158 | last = tmp; |
1127 | } |
1159 | } |
1128 | |
1160 | |
1129 | /* last == NULL if there are no objects on this space */ |
1161 | /* last == NULL if there are no objects on this space */ |
1130 | //TODO: this makes little sense, why only update the topmost object? |
1162 | //TODO: this makes little sense, why only update the topmost object? |
… | |
… | |
1150 | merge_ob (object *op, object *top) |
1182 | merge_ob (object *op, object *top) |
1151 | { |
1183 | { |
1152 | if (!op->nrof) |
1184 | if (!op->nrof) |
1153 | return 0; |
1185 | return 0; |
1154 | |
1186 | |
1155 | if (top) |
1187 | if (!top) |
1156 | for (top = op; top && top->above; top = top->above) |
1188 | for (top = op; top && top->above; top = top->above) |
1157 | ; |
1189 | ; |
1158 | |
1190 | |
1159 | for (; top; top = top->below) |
1191 | for (; top; top = top->below) |
1160 | { |
|
|
1161 | if (top == op) |
|
|
1162 | continue; |
|
|
1163 | |
|
|
1164 | if (object::can_merge (op, top)) |
1192 | if (object::can_merge (op, top)) |
1165 | { |
1193 | { |
1166 | top->nrof += op->nrof; |
1194 | top->nrof += op->nrof; |
1167 | |
1195 | |
1168 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1196 | if (object *pl = top->visible_to ()) |
1169 | op->weight = 0; /* Don't want any adjustements now */ |
1197 | esrv_update_item (UPD_NROF, pl, top); |
|
|
1198 | |
|
|
1199 | op->weight = 0; // cancel the addition above |
|
|
1200 | op->carrying = 0; // must be 0 already |
|
|
1201 | |
1170 | op->destroy (); |
1202 | op->destroy (1); |
|
|
1203 | |
1171 | return top; |
1204 | return top; |
1172 | } |
1205 | } |
1173 | } |
|
|
1174 | |
1206 | |
1175 | return 0; |
1207 | return 0; |
1176 | } |
1208 | } |
1177 | |
1209 | |
1178 | void |
1210 | void |
… | |
… | |
1203 | * job preparing multi-part monsters. |
1235 | * job preparing multi-part monsters. |
1204 | */ |
1236 | */ |
1205 | object * |
1237 | object * |
1206 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1238 | insert_ob_in_map_at (object *op, maptile *m, object *originator, int flag, int x, int y) |
1207 | { |
1239 | { |
|
|
1240 | op->remove (); |
|
|
1241 | |
1208 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1242 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1209 | { |
1243 | { |
1210 | tmp->x = x + tmp->arch->x; |
1244 | tmp->x = x + tmp->arch->x; |
1211 | tmp->y = y + tmp->arch->y; |
1245 | tmp->y = y + tmp->arch->y; |
1212 | } |
1246 | } |
… | |
… | |
1235 | * just 'op' otherwise |
1269 | * just 'op' otherwise |
1236 | */ |
1270 | */ |
1237 | object * |
1271 | object * |
1238 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1272 | insert_ob_in_map (object *op, maptile *m, object *originator, int flag) |
1239 | { |
1273 | { |
1240 | assert (!op->flag [FLAG_FREED]); |
1274 | if (op->is_on_map ()) |
1241 | |
|
|
1242 | object *top, *floor = NULL; |
|
|
1243 | |
|
|
1244 | op->remove (); |
|
|
1245 | |
|
|
1246 | #if 0 |
|
|
1247 | if (!m->active != !op->active) |
|
|
1248 | if (m->active) |
|
|
1249 | op->activate_recursive (); |
|
|
1250 | else |
|
|
1251 | op->deactivate_recursive (); |
|
|
1252 | #endif |
|
|
1253 | |
|
|
1254 | if (out_of_map (m, op->x, op->y)) |
|
|
1255 | { |
1275 | { |
1256 | LOG (llevError, "Trying to insert object outside the map.\n%s\n", op->debug_desc ()); |
1276 | LOG (llevError, "insert_ob_in_map called for object already on map"); |
1257 | #ifdef MANY_CORES |
|
|
1258 | /* Better to catch this here, as otherwise the next use of this object |
|
|
1259 | * is likely to cause a crash. Better to find out where it is getting |
|
|
1260 | * improperly inserted. |
|
|
1261 | */ |
|
|
1262 | abort (); |
1277 | abort (); |
1263 | #endif |
1278 | } |
1264 | return op; |
1279 | |
|
|
1280 | if (op->env) |
1265 | } |
1281 | { |
|
|
1282 | LOG (llevError, "insert_ob_in_map called for object in an inventory (proceeding)"); |
|
|
1283 | op->remove (); |
|
|
1284 | } |
1266 | |
1285 | |
1267 | if (object *more = op->more) |
1286 | if (op->face && !face_info (op->face))//D TODO: remove soon |
1268 | if (!insert_ob_in_map (more, m, originator, flag)) |
1287 | {//D |
1269 | return 0; |
1288 | LOG (llevError | logBacktrace, "op->face out of bounds: %s", op->debug_desc ());//D |
1270 | |
1289 | op->face = 1;//D |
1271 | CLEAR_FLAG (op, FLAG_REMOVED); |
1290 | }//D |
1272 | |
1291 | |
1273 | /* Ideally, the caller figures this out. However, it complicates a lot |
1292 | /* Ideally, the caller figures this out. However, it complicates a lot |
1274 | * of areas of callers (eg, anything that uses find_free_spot would now |
1293 | * of areas of callers (eg, anything that uses find_free_spot would now |
1275 | * need extra work |
1294 | * need extra work |
1276 | */ |
1295 | */ |
1277 | if (!xy_normalise (m, op->x, op->y)) |
1296 | if (!xy_normalise (m, op->x, op->y)) |
|
|
1297 | { |
|
|
1298 | op->head_ ()->destroy (1);// remove head_ once all tail object destroyers found |
1278 | return 0; |
1299 | return 0; |
|
|
1300 | } |
|
|
1301 | |
|
|
1302 | if (object *more = op->more) |
|
|
1303 | if (!insert_ob_in_map (more, m, originator, flag)) |
|
|
1304 | return 0; |
|
|
1305 | |
|
|
1306 | CLEAR_FLAG (op, FLAG_REMOVED); |
1279 | |
1307 | |
1280 | op->map = m; |
1308 | op->map = m; |
1281 | mapspace &ms = op->ms (); |
1309 | mapspace &ms = op->ms (); |
1282 | |
1310 | |
1283 | /* this has to be done after we translate the coordinates. |
1311 | /* this has to be done after we translate the coordinates. |
1284 | */ |
1312 | */ |
1285 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1313 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1286 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1314 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1287 | if (object::can_merge (op, tmp)) |
1315 | if (object::can_merge (op, tmp)) |
1288 | { |
1316 | { |
|
|
1317 | // TODO: we actually want to update tmp, not op, |
|
|
1318 | // but some caller surely breaks when we return tmp |
|
|
1319 | // from here :/ |
1289 | op->nrof += tmp->nrof; |
1320 | op->nrof += tmp->nrof; |
1290 | tmp->destroy (); |
1321 | tmp->destroy (1); |
1291 | } |
1322 | } |
1292 | |
1323 | |
1293 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1324 | CLEAR_FLAG (op, FLAG_APPLIED); /* hack for fixing F_APPLIED in items of dead people */ |
1294 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1325 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
1295 | |
1326 | |
… | |
… | |
1302 | { |
1333 | { |
1303 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1334 | LOG (llevError, "insert_ob_in_map called with INS_BELOW_ORIGINATOR when originator not on same space!\n"); |
1304 | abort (); |
1335 | abort (); |
1305 | } |
1336 | } |
1306 | |
1337 | |
|
|
1338 | if (!originator->is_on_map ()) |
|
|
1339 | LOG (llevDebug | logBacktrace, "insert_ob_in_map(%s) called with INS_BELOW_ORIGINATOR when originator '%s' not on map", |
|
|
1340 | op->debug_desc (), originator->debug_desc ()); |
|
|
1341 | |
1307 | op->above = originator; |
1342 | op->above = originator; |
1308 | op->below = originator->below; |
1343 | op->below = originator->below; |
1309 | |
|
|
1310 | if (op->below) |
|
|
1311 | op->below->above = op; |
|
|
1312 | else |
|
|
1313 | ms.bot = op; |
|
|
1314 | |
|
|
1315 | /* since *below* originator, no need to update top */ |
|
|
1316 | originator->below = op; |
1344 | originator->below = op; |
|
|
1345 | |
|
|
1346 | *(op->below ? &op->below->above : &ms.bot) = op; |
1317 | } |
1347 | } |
1318 | else |
1348 | else |
1319 | { |
1349 | { |
1320 | top = ms.bot; |
1350 | object *floor = 0; |
|
|
1351 | object *top = ms.top; |
1321 | |
1352 | |
1322 | /* If there are other objects, then */ |
1353 | /* If there are other objects, then */ |
1323 | if ((!(flag & INS_MAP_LOAD)) && top) |
1354 | if (top) |
1324 | { |
1355 | { |
1325 | object *last = 0; |
|
|
1326 | |
|
|
1327 | /* |
1356 | /* |
1328 | * If there are multiple objects on this space, we do some trickier handling. |
1357 | * If there are multiple objects on this space, we do some trickier handling. |
1329 | * We've already dealt with merging if appropriate. |
1358 | * We've already dealt with merging if appropriate. |
1330 | * Generally, we want to put the new object on top. But if |
1359 | * Generally, we want to put the new object on top. But if |
1331 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1360 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1334 | * once we get to them. This reduces the need to traverse over all of |
1363 | * once we get to them. This reduces the need to traverse over all of |
1335 | * them when adding another one - this saves quite a bit of cpu time |
1364 | * them when adding another one - this saves quite a bit of cpu time |
1336 | * when lots of spells are cast in one area. Currently, it is presumed |
1365 | * when lots of spells are cast in one area. Currently, it is presumed |
1337 | * that flying non pickable objects are spell objects. |
1366 | * that flying non pickable objects are spell objects. |
1338 | */ |
1367 | */ |
1339 | for (top = ms.bot; top; top = top->above) |
1368 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1340 | { |
1369 | { |
1341 | if (QUERY_FLAG (top, FLAG_IS_FLOOR) || QUERY_FLAG (top, FLAG_OVERLAY_FLOOR)) |
1370 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) || QUERY_FLAG (tmp, FLAG_OVERLAY_FLOOR)) |
1342 | floor = top; |
1371 | floor = tmp; |
1343 | |
1372 | |
1344 | if (QUERY_FLAG (top, FLAG_NO_PICK) && (top->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (top, FLAG_IS_FLOOR)) |
1373 | if (QUERY_FLAG (tmp, FLAG_NO_PICK) && (tmp->move_type & (MOVE_FLY_LOW | MOVE_FLY_HIGH)) && !QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
1345 | { |
1374 | { |
1346 | /* We insert above top, so we want this object below this */ |
1375 | /* We insert above top, so we want this object below this */ |
1347 | top = top->below; |
1376 | top = tmp->below; |
1348 | break; |
1377 | break; |
1349 | } |
1378 | } |
1350 | |
1379 | |
1351 | last = top; |
1380 | top = tmp; |
1352 | } |
1381 | } |
1353 | |
|
|
1354 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1355 | top = last; |
|
|
1356 | |
1382 | |
1357 | /* We let update_position deal with figuring out what the space |
1383 | /* We let update_position deal with figuring out what the space |
1358 | * looks like instead of lots of conditions here. |
1384 | * looks like instead of lots of conditions here. |
1359 | * makes things faster, and effectively the same result. |
1385 | * makes things faster, and effectively the same result. |
1360 | */ |
1386 | */ |
… | |
… | |
1367 | */ |
1393 | */ |
1368 | if (!(flag & INS_ON_TOP) |
1394 | if (!(flag & INS_ON_TOP) |
1369 | && ms.flags () & P_BLOCKSVIEW |
1395 | && ms.flags () & P_BLOCKSVIEW |
1370 | && (op->face && !faces [op->face].visibility)) |
1396 | && (op->face && !faces [op->face].visibility)) |
1371 | { |
1397 | { |
|
|
1398 | object *last; |
|
|
1399 | |
1372 | for (last = top; last != floor; last = last->below) |
1400 | for (last = top; last != floor; last = last->below) |
1373 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1401 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1374 | break; |
1402 | break; |
1375 | |
1403 | |
1376 | /* Check to see if we found the object that blocks view, |
1404 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1381 | if (last && last->below && last != floor) |
1409 | if (last && last->below && last != floor) |
1382 | top = last->below; |
1410 | top = last->below; |
1383 | } |
1411 | } |
1384 | } /* If objects on this space */ |
1412 | } /* If objects on this space */ |
1385 | |
1413 | |
1386 | if (flag & INS_MAP_LOAD) |
|
|
1387 | top = ms.top; |
|
|
1388 | |
|
|
1389 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1414 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1390 | top = floor; |
1415 | top = floor; |
1391 | |
1416 | |
1392 | /* Top is the object that our object (op) is going to get inserted above. |
1417 | // insert object above top, or bottom-most if top = 0 |
1393 | */ |
|
|
1394 | |
|
|
1395 | /* First object on this space */ |
|
|
1396 | if (!top) |
1418 | if (!top) |
1397 | { |
1419 | { |
|
|
1420 | op->below = 0; |
1398 | op->above = ms.bot; |
1421 | op->above = ms.bot; |
1399 | |
|
|
1400 | if (op->above) |
|
|
1401 | op->above->below = op; |
|
|
1402 | |
|
|
1403 | op->below = 0; |
|
|
1404 | ms.bot = op; |
1422 | ms.bot = op; |
|
|
1423 | |
|
|
1424 | *(op->above ? &op->above->below : &ms.top) = op; |
1405 | } |
1425 | } |
1406 | else |
1426 | else |
1407 | { /* get inserted into the stack above top */ |
1427 | { |
1408 | op->above = top->above; |
1428 | op->above = top->above; |
1409 | |
|
|
1410 | if (op->above) |
|
|
1411 | op->above->below = op; |
1429 | top->above = op; |
1412 | |
1430 | |
1413 | op->below = top; |
1431 | op->below = top; |
1414 | top->above = op; |
1432 | *(op->above ? &op->above->below : &ms.top) = op; |
1415 | } |
1433 | } |
1416 | |
1434 | } |
1417 | if (!op->above) |
|
|
1418 | ms.top = op; |
|
|
1419 | } /* else not INS_BELOW_ORIGINATOR */ |
|
|
1420 | |
1435 | |
1421 | if (op->type == PLAYER) |
1436 | if (op->type == PLAYER) |
1422 | { |
1437 | { |
1423 | op->contr->do_los = 1; |
1438 | op->contr->do_los = 1; |
1424 | ++op->map->players; |
1439 | ++op->map->players; |
1425 | op->map->touch (); |
1440 | op->map->touch (); |
1426 | } |
1441 | } |
1427 | |
1442 | |
1428 | op->map->dirty = true; |
1443 | op->map->dirty = true; |
1429 | |
1444 | |
1430 | /* If we have a floor, we know the player, if any, will be above |
|
|
1431 | * it, so save a few ticks and start from there. |
|
|
1432 | */ |
|
|
1433 | if (!(flag & INS_MAP_LOAD)) |
|
|
1434 | if (object *pl = ms.player ()) |
1445 | if (object *pl = ms.player ()) |
|
|
1446 | //TODO: the floorbox prev/next might need updating |
|
|
1447 | //esrv_send_item (pl, op); |
|
|
1448 | //TODO: update floorbox to preserve ordering |
1435 | if (pl->contr->ns) |
1449 | if (pl->contr->ns) |
1436 | pl->contr->ns->floorbox_update (); |
1450 | pl->contr->ns->floorbox_update (); |
1437 | |
1451 | |
1438 | /* If this object glows, it may affect lighting conditions that are |
1452 | /* If this object glows, it may affect lighting conditions that are |
1439 | * visible to others on this map. But update_all_los is really |
1453 | * visible to others on this map. But update_all_los is really |
1440 | * an inefficient way to do this, as it means los for all players |
1454 | * an inefficient way to do this, as it means los for all players |
1441 | * on the map will get recalculated. The players could very well |
1455 | * on the map will get recalculated. The players could very well |
… | |
… | |
1483 | * op is the object to insert it under: supplies x and the map. |
1497 | * op is the object to insert it under: supplies x and the map. |
1484 | */ |
1498 | */ |
1485 | void |
1499 | void |
1486 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1500 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1487 | { |
1501 | { |
1488 | object *tmp, *tmp1; |
|
|
1489 | |
|
|
1490 | /* first search for itself and remove any old instances */ |
1502 | /* first search for itself and remove any old instances */ |
1491 | |
1503 | |
1492 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1504 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1493 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1505 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1494 | tmp->destroy (); |
1506 | tmp->destroy (1); |
1495 | |
1507 | |
1496 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1508 | object *tmp = arch_to_object (archetype::find (arch_string)); |
1497 | |
1509 | |
1498 | tmp1->x = op->x; |
1510 | tmp->x = op->x; |
1499 | tmp1->y = op->y; |
1511 | tmp->y = op->y; |
|
|
1512 | |
1500 | insert_ob_in_map (tmp1, op->map, op, 0); |
1513 | insert_ob_in_map (tmp, op->map, op, 0); |
1501 | } |
1514 | } |
1502 | |
1515 | |
1503 | object * |
1516 | object * |
1504 | object::insert_at (object *where, object *originator, int flags) |
1517 | object::insert_at (object *where, object *originator, int flags) |
1505 | { |
1518 | { |
|
|
1519 | if (where->env) |
|
|
1520 | return where->env->insert (this); |
|
|
1521 | else |
1506 | return where->map->insert (this, where->x, where->y, originator, flags); |
1522 | return where->map->insert (this, where->x, where->y, originator, flags); |
1507 | } |
1523 | } |
1508 | |
1524 | |
1509 | /* |
1525 | /* |
1510 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
|
|
1511 | * is returned contains nr objects, and the remaining parts contains |
|
|
1512 | * the rest (or is removed and freed if that number is 0). |
|
|
1513 | * On failure, NULL is returned, and the reason put into the |
|
|
1514 | * global static errmsg array. |
|
|
1515 | */ |
|
|
1516 | object * |
|
|
1517 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1518 | { |
|
|
1519 | object *newob; |
|
|
1520 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1521 | |
|
|
1522 | if (orig_ob->nrof < nr) |
|
|
1523 | { |
|
|
1524 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1525 | return NULL; |
|
|
1526 | } |
|
|
1527 | |
|
|
1528 | newob = object_create_clone (orig_ob); |
|
|
1529 | |
|
|
1530 | if ((orig_ob->nrof -= nr) < 1) |
|
|
1531 | orig_ob->destroy (1); |
|
|
1532 | else if (!is_removed) |
|
|
1533 | { |
|
|
1534 | if (orig_ob->env != NULL) |
|
|
1535 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1536 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1537 | { |
|
|
1538 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1539 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1540 | return NULL; |
|
|
1541 | } |
|
|
1542 | } |
|
|
1543 | |
|
|
1544 | newob->nrof = nr; |
|
|
1545 | |
|
|
1546 | return newob; |
|
|
1547 | } |
|
|
1548 | |
|
|
1549 | /* |
|
|
1550 | * decrease_ob_nr(object, number) decreases a specified number from |
1526 | * decrease(object, number) decreases a specified number from |
1551 | * the amount of an object. If the amount reaches 0, the object |
1527 | * the amount of an object. If the amount reaches 0, the object |
1552 | * is subsequently removed and freed. |
1528 | * is subsequently removed and freed. |
1553 | * |
1529 | * |
1554 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1530 | * Return value: 'op' if something is left, NULL if the amount reached 0 |
1555 | */ |
1531 | */ |
|
|
1532 | bool |
|
|
1533 | object::decrease (sint32 nr) |
|
|
1534 | { |
|
|
1535 | if (!nr) |
|
|
1536 | return true; |
|
|
1537 | |
|
|
1538 | nr = min (nr, nrof); |
|
|
1539 | |
|
|
1540 | nrof -= nr; |
|
|
1541 | |
|
|
1542 | if (nrof) |
|
|
1543 | { |
|
|
1544 | adjust_weight (env, -weight * max (1, nr)); // carrying == 0 |
|
|
1545 | |
|
|
1546 | if (object *pl = visible_to ()) |
|
|
1547 | esrv_update_item (UPD_NROF, pl, this); |
|
|
1548 | |
|
|
1549 | return true; |
|
|
1550 | } |
|
|
1551 | else |
|
|
1552 | { |
|
|
1553 | destroy (); |
|
|
1554 | return false; |
|
|
1555 | } |
|
|
1556 | } |
|
|
1557 | |
|
|
1558 | /* |
|
|
1559 | * split(ob,nr) splits up ob into two parts. The part which |
|
|
1560 | * is returned contains nr objects, and the remaining parts contains |
|
|
1561 | * the rest (or is removed and returned if that number is 0). |
|
|
1562 | * On failure, NULL is returned. |
|
|
1563 | */ |
1556 | object * |
1564 | object * |
1557 | decrease_ob_nr (object *op, uint32 i) |
1565 | object::split (sint32 nr) |
1558 | { |
1566 | { |
1559 | object *tmp; |
1567 | int have = number_of (); |
1560 | |
1568 | |
1561 | if (i == 0) /* objects with op->nrof require this check */ |
1569 | if (have < nr) |
1562 | return op; |
1570 | return 0; |
1563 | |
1571 | else if (have == nr) |
1564 | if (i > op->nrof) |
|
|
1565 | i = op->nrof; |
|
|
1566 | |
|
|
1567 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1568 | op->nrof -= i; |
|
|
1569 | else if (op->env) |
|
|
1570 | { |
1572 | { |
1571 | /* is this object in the players inventory, or sub container |
|
|
1572 | * therein? |
|
|
1573 | */ |
|
|
1574 | tmp = op->in_player (); |
|
|
1575 | /* nope. Is this a container the player has opened? |
|
|
1576 | * If so, set tmp to that player. |
|
|
1577 | * IMO, searching through all the players will mostly |
|
|
1578 | * likely be quicker than following op->env to the map, |
|
|
1579 | * and then searching the map for a player. |
|
|
1580 | */ |
|
|
1581 | if (!tmp) |
|
|
1582 | for_all_players (pl) |
|
|
1583 | if (pl->ob->container == op->env) |
|
|
1584 | { |
|
|
1585 | tmp = pl->ob; |
|
|
1586 | break; |
|
|
1587 | } |
|
|
1588 | |
|
|
1589 | if (i < op->nrof) |
|
|
1590 | { |
|
|
1591 | sub_weight (op->env, op->weight * i); |
|
|
1592 | op->nrof -= i; |
|
|
1593 | if (tmp) |
|
|
1594 | esrv_send_item (tmp, op); |
|
|
1595 | } |
|
|
1596 | else |
|
|
1597 | { |
|
|
1598 | op->remove (); |
1573 | remove (); |
1599 | op->nrof = 0; |
1574 | return this; |
1600 | if (tmp) |
|
|
1601 | esrv_del_item (tmp->contr, op->count); |
|
|
1602 | } |
|
|
1603 | } |
1575 | } |
1604 | else |
1576 | else |
1605 | { |
1577 | { |
1606 | object *above = op->above; |
1578 | decrease (nr); |
1607 | |
1579 | |
1608 | if (i < op->nrof) |
1580 | object *op = deep_clone (); |
1609 | op->nrof -= i; |
1581 | op->nrof = nr; |
1610 | else |
|
|
1611 | { |
|
|
1612 | op->remove (); |
|
|
1613 | op->nrof = 0; |
|
|
1614 | } |
|
|
1615 | |
|
|
1616 | /* Since we just removed op, op->above is null */ |
|
|
1617 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1618 | if (tmp->type == PLAYER) |
|
|
1619 | { |
|
|
1620 | if (op->nrof) |
|
|
1621 | esrv_send_item (tmp, op); |
|
|
1622 | else |
|
|
1623 | esrv_del_item (tmp->contr, op->count); |
|
|
1624 | } |
|
|
1625 | } |
|
|
1626 | |
|
|
1627 | if (op->nrof) |
|
|
1628 | return op; |
1582 | return op; |
1629 | else |
|
|
1630 | { |
|
|
1631 | op->destroy (); |
|
|
1632 | return 0; |
|
|
1633 | } |
|
|
1634 | } |
|
|
1635 | |
|
|
1636 | /* |
|
|
1637 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1638 | * and also updates how much the environment(s) is/are carrying. |
|
|
1639 | */ |
|
|
1640 | void |
|
|
1641 | add_weight (object *op, signed long weight) |
|
|
1642 | { |
|
|
1643 | while (op != NULL) |
|
|
1644 | { |
|
|
1645 | if (op->type == CONTAINER) |
|
|
1646 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1647 | |
|
|
1648 | op->carrying += weight; |
|
|
1649 | op = op->env; |
|
|
1650 | } |
1583 | } |
1651 | } |
1584 | } |
1652 | |
1585 | |
1653 | object * |
1586 | object * |
1654 | insert_ob_in_ob (object *op, object *where) |
1587 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1679 | * be != op, if items are merged. -Tero |
1612 | * be != op, if items are merged. -Tero |
1680 | */ |
1613 | */ |
1681 | object * |
1614 | object * |
1682 | object::insert (object *op) |
1615 | object::insert (object *op) |
1683 | { |
1616 | { |
1684 | object *tmp, *otmp; |
|
|
1685 | |
|
|
1686 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1687 | op->remove (); |
|
|
1688 | |
|
|
1689 | if (op->more) |
1617 | if (op->more) |
1690 | { |
1618 | { |
1691 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1619 | LOG (llevError, "Tried to insert multipart object %s (%d)\n", &op->name, op->count); |
1692 | return op; |
1620 | return op; |
1693 | } |
1621 | } |
1694 | |
1622 | |
1695 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1623 | op->remove (); |
1696 | CLEAR_FLAG (op, FLAG_REMOVED); |
1624 | |
|
|
1625 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
|
|
1626 | |
1697 | if (op->nrof) |
1627 | if (op->nrof) |
1698 | { |
|
|
1699 | for (tmp = inv; tmp != NULL; tmp = tmp->below) |
1628 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1700 | if (object::can_merge (tmp, op)) |
1629 | if (object::can_merge (tmp, op)) |
1701 | { |
1630 | { |
1702 | /* return the original object and remove inserted object |
1631 | /* return the original object and remove inserted object |
1703 | (client needs the original object) */ |
1632 | (client needs the original object) */ |
1704 | tmp->nrof += op->nrof; |
1633 | tmp->nrof += op->nrof; |
1705 | /* Weight handling gets pretty funky. Since we are adding to |
1634 | |
1706 | * tmp->nrof, we need to increase the weight. |
1635 | if (object *pl = tmp->visible_to ()) |
1707 | */ |
1636 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1637 | |
1708 | add_weight (this, op->weight * op->nrof); |
1638 | adjust_weight (this, op->total_weight ()); |
1709 | SET_FLAG (op, FLAG_REMOVED); |
1639 | |
1710 | op->destroy (); /* free the inserted object */ |
1640 | op->destroy (1); |
1711 | op = tmp; |
1641 | op = tmp; |
1712 | op->remove (); /* and fix old object's links */ |
1642 | goto inserted; |
1713 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1714 | break; |
|
|
1715 | } |
1643 | } |
1716 | |
1644 | |
1717 | /* I assume combined objects have no inventory |
1645 | op->owner = 0; // it's his/hers now. period. |
1718 | * We add the weight - this object could have just been removed |
|
|
1719 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1720 | * the weight, so we need to add it in again, since we actually do |
|
|
1721 | * the linking below |
|
|
1722 | */ |
|
|
1723 | add_weight (this, op->weight * op->nrof); |
|
|
1724 | } |
|
|
1725 | else |
|
|
1726 | add_weight (this, (op->weight + op->carrying)); |
|
|
1727 | |
|
|
1728 | otmp = this->in_player (); |
|
|
1729 | if (otmp && otmp->contr) |
|
|
1730 | if (!QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1731 | otmp->update_stats (); |
|
|
1732 | |
|
|
1733 | op->map = 0; |
1646 | op->map = 0; |
1734 | op->env = this; |
1647 | op->x = 0; |
|
|
1648 | op->y = 0; |
|
|
1649 | |
1735 | op->above = 0; |
1650 | op->above = 0; |
1736 | op->below = 0; |
1651 | op->below = inv; |
1737 | op->x = 0, op->y = 0; |
1652 | op->env = this; |
1738 | |
1653 | |
|
|
1654 | if (inv) |
|
|
1655 | inv->above = op; |
|
|
1656 | |
|
|
1657 | inv = op; |
|
|
1658 | |
|
|
1659 | op->flag [FLAG_REMOVED] = 0; |
|
|
1660 | |
|
|
1661 | if (object *pl = op->visible_to ()) |
|
|
1662 | esrv_send_item (pl, op); |
|
|
1663 | |
|
|
1664 | adjust_weight (this, op->total_weight ()); |
|
|
1665 | |
|
|
1666 | inserted: |
1739 | /* reset the light list and los of the players on the map */ |
1667 | /* reset the light list and los of the players on the map */ |
1740 | if ((op->glow_radius != 0) && map) |
1668 | if (op->glow_radius && map && map->darkness) |
1741 | { |
|
|
1742 | #ifdef DEBUG_LIGHTS |
|
|
1743 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1744 | #endif /* DEBUG_LIGHTS */ |
|
|
1745 | if (map->darkness) |
|
|
1746 | update_all_los (map, x, y); |
1669 | update_all_los (map, x, y); |
1747 | } |
|
|
1748 | |
1670 | |
1749 | /* Client has no idea of ordering so lets not bother ordering it here. |
1671 | // if this is a player's inventory, update stats |
1750 | * It sure simplifies this function... |
1672 | if (type == PLAYER && !flag [FLAG_NO_FIX_PLAYER]) |
1751 | */ |
1673 | update_stats (); |
1752 | if (!inv) |
|
|
1753 | inv = op; |
|
|
1754 | else |
|
|
1755 | { |
|
|
1756 | op->below = inv; |
|
|
1757 | op->below->above = op; |
|
|
1758 | inv = op; |
|
|
1759 | } |
|
|
1760 | |
1674 | |
1761 | INVOKE_OBJECT (INSERT, this); |
1675 | INVOKE_OBJECT (INSERT, this); |
1762 | |
1676 | |
1763 | return op; |
1677 | return op; |
1764 | } |
1678 | } |
… | |
… | |
1892 | LOG (llevError, "Present_arch called outside map.\n"); |
1806 | LOG (llevError, "Present_arch called outside map.\n"); |
1893 | return NULL; |
1807 | return NULL; |
1894 | } |
1808 | } |
1895 | |
1809 | |
1896 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1810 | for (object *tmp = m->at (x, y).bot; tmp; tmp = tmp->above) |
1897 | if (tmp->arch == at) |
1811 | if (tmp->arch->archname == at->archname) |
1898 | return tmp; |
1812 | return tmp; |
1899 | |
1813 | |
1900 | return NULL; |
1814 | return NULL; |
1901 | } |
1815 | } |
1902 | |
1816 | |
… | |
… | |
1966 | * The first matching object is returned, or NULL if none. |
1880 | * The first matching object is returned, or NULL if none. |
1967 | */ |
1881 | */ |
1968 | object * |
1882 | object * |
1969 | present_arch_in_ob (const archetype *at, const object *op) |
1883 | present_arch_in_ob (const archetype *at, const object *op) |
1970 | { |
1884 | { |
1971 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1885 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1972 | if (tmp->arch == at) |
1886 | if (tmp->arch->archname == at->archname) |
1973 | return tmp; |
1887 | return tmp; |
1974 | |
1888 | |
1975 | return NULL; |
1889 | return NULL; |
1976 | } |
1890 | } |
1977 | |
1891 | |
… | |
… | |
1979 | * activate recursively a flag on an object inventory |
1893 | * activate recursively a flag on an object inventory |
1980 | */ |
1894 | */ |
1981 | void |
1895 | void |
1982 | flag_inv (object *op, int flag) |
1896 | flag_inv (object *op, int flag) |
1983 | { |
1897 | { |
1984 | if (op->inv) |
|
|
1985 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1898 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1986 | { |
1899 | { |
1987 | SET_FLAG (tmp, flag); |
1900 | SET_FLAG (tmp, flag); |
1988 | flag_inv (tmp, flag); |
1901 | flag_inv (tmp, flag); |
1989 | } |
1902 | } |
1990 | } |
1903 | } |
1991 | |
1904 | |
1992 | /* |
1905 | /* |
1993 | * deactivate recursively a flag on an object inventory |
1906 | * deactivate recursively a flag on an object inventory |
1994 | */ |
1907 | */ |
1995 | void |
1908 | void |
1996 | unflag_inv (object *op, int flag) |
1909 | unflag_inv (object *op, int flag) |
1997 | { |
1910 | { |
1998 | if (op->inv) |
|
|
1999 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1911 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
2000 | { |
1912 | { |
2001 | CLEAR_FLAG (tmp, flag); |
1913 | CLEAR_FLAG (tmp, flag); |
2002 | unflag_inv (tmp, flag); |
1914 | unflag_inv (tmp, flag); |
2003 | } |
1915 | } |
2004 | } |
1916 | } |
2005 | |
1917 | |
2006 | /* |
1918 | /* |
2007 | * find_free_spot(object, map, x, y, start, stop) will search for |
1919 | * find_free_spot(object, map, x, y, start, stop) will search for |
2008 | * a spot at the given map and coordinates which will be able to contain |
1920 | * a spot at the given map and coordinates which will be able to contain |
… | |
… | |
2010 | * to search (see the freearr_x/y[] definition). |
1922 | * to search (see the freearr_x/y[] definition). |
2011 | * It returns a random choice among the alternatives found. |
1923 | * It returns a random choice among the alternatives found. |
2012 | * start and stop are where to start relative to the free_arr array (1,9 |
1924 | * start and stop are where to start relative to the free_arr array (1,9 |
2013 | * does all 4 immediate directions). This returns the index into the |
1925 | * does all 4 immediate directions). This returns the index into the |
2014 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
1926 | * array of the free spot, -1 if no spot available (dir 0 = x,y) |
2015 | * Note - this only checks to see if there is space for the head of the |
|
|
2016 | * object - if it is a multispace object, this should be called for all |
|
|
2017 | * pieces. |
|
|
2018 | * Note2: This function does correctly handle tiled maps, but does not |
1927 | * Note: This function does correctly handle tiled maps, but does not |
2019 | * inform the caller. However, insert_ob_in_map will update as |
1928 | * inform the caller. However, insert_ob_in_map will update as |
2020 | * necessary, so the caller shouldn't need to do any special work. |
1929 | * necessary, so the caller shouldn't need to do any special work. |
2021 | * Note - updated to take an object instead of archetype - this is necessary |
1930 | * Note - updated to take an object instead of archetype - this is necessary |
2022 | * because arch_blocked (now ob_blocked) needs to know the movement type |
1931 | * because arch_blocked (now ob_blocked) needs to know the movement type |
2023 | * to know if the space in question will block the object. We can't use |
1932 | * to know if the space in question will block the object. We can't use |
… | |
… | |
2025 | * customized, changed states, etc. |
1934 | * customized, changed states, etc. |
2026 | */ |
1935 | */ |
2027 | int |
1936 | int |
2028 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
1937 | find_free_spot (const object *ob, maptile *m, int x, int y, int start, int stop) |
2029 | { |
1938 | { |
|
|
1939 | int altern[SIZEOFFREE]; |
2030 | int index = 0, flag; |
1940 | int index = 0, flag; |
2031 | int altern[SIZEOFFREE]; |
|
|
2032 | |
1941 | |
2033 | for (int i = start; i < stop; i++) |
1942 | for (int i = start; i < stop; i++) |
2034 | { |
1943 | { |
2035 | flag = ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i]); |
1944 | mapxy pos (m, x, y); pos.move (i); |
2036 | if (!flag) |
1945 | |
|
|
1946 | if (!pos.normalise ()) |
|
|
1947 | continue; |
|
|
1948 | |
|
|
1949 | mapspace &ms = *pos; |
|
|
1950 | |
|
|
1951 | if (ms.flags () & P_IS_ALIVE) |
|
|
1952 | continue; |
|
|
1953 | |
|
|
1954 | /* However, often |
|
|
1955 | * ob doesn't have any move type (when used to place exits) |
|
|
1956 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
|
|
1957 | */ |
|
|
1958 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
|
|
1959 | { |
2037 | altern [index++] = i; |
1960 | altern [index++] = i; |
|
|
1961 | continue; |
|
|
1962 | } |
2038 | |
1963 | |
2039 | /* Basically, if we find a wall on a space, we cut down the search size. |
1964 | /* Basically, if we find a wall on a space, we cut down the search size. |
2040 | * In this way, we won't return spaces that are on another side of a wall. |
1965 | * In this way, we won't return spaces that are on another side of a wall. |
2041 | * This mostly work, but it cuts down the search size in all directions - |
1966 | * This mostly work, but it cuts down the search size in all directions - |
2042 | * if the space being examined only has a wall to the north and empty |
1967 | * if the space being examined only has a wall to the north and empty |
2043 | * spaces in all the other directions, this will reduce the search space |
1968 | * spaces in all the other directions, this will reduce the search space |
2044 | * to only the spaces immediately surrounding the target area, and |
1969 | * to only the spaces immediately surrounding the target area, and |
2045 | * won't look 2 spaces south of the target space. |
1970 | * won't look 2 spaces south of the target space. |
2046 | */ |
1971 | */ |
2047 | else if ((flag & P_NO_PASS) && maxfree[i] < stop) |
1972 | if (ms.move_block == MOVE_ALL && maxfree[i] < stop) |
|
|
1973 | { |
2048 | stop = maxfree[i]; |
1974 | stop = maxfree[i]; |
|
|
1975 | continue; |
|
|
1976 | } |
|
|
1977 | |
|
|
1978 | /* Note it is intentional that we check ob - the movement type of the |
|
|
1979 | * head of the object should correspond for the entire object. |
|
|
1980 | */ |
|
|
1981 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
|
|
1982 | continue; |
|
|
1983 | |
|
|
1984 | if (ob->blocked (m, pos.x, pos.y)) |
|
|
1985 | continue; |
|
|
1986 | |
|
|
1987 | altern [index++] = i; |
2049 | } |
1988 | } |
2050 | |
1989 | |
2051 | if (!index) |
1990 | if (!index) |
2052 | return -1; |
1991 | return -1; |
2053 | |
1992 | |
… | |
… | |
2062 | */ |
2001 | */ |
2063 | int |
2002 | int |
2064 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2003 | find_first_free_spot (const object *ob, maptile *m, int x, int y) |
2065 | { |
2004 | { |
2066 | for (int i = 0; i < SIZEOFFREE; i++) |
2005 | for (int i = 0; i < SIZEOFFREE; i++) |
2067 | if (!ob_blocked (ob, m, x + freearr_x[i], y + freearr_y[i])) |
2006 | if (!ob->blocked (m, x + freearr_x[i], y + freearr_y[i])) |
2068 | return i; |
2007 | return i; |
2069 | |
2008 | |
2070 | return -1; |
2009 | return -1; |
2071 | } |
2010 | } |
2072 | |
2011 | |
… | |
… | |
2349 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2288 | * Cf 0.91.3 - don't let WIZ's pick up anything - will likely cause |
2350 | * core dumps if they do. |
2289 | * core dumps if they do. |
2351 | * |
2290 | * |
2352 | * Add a check so we can't pick up invisible objects (0.93.8) |
2291 | * Add a check so we can't pick up invisible objects (0.93.8) |
2353 | */ |
2292 | */ |
2354 | |
|
|
2355 | int |
2293 | int |
2356 | can_pick (const object *who, const object *item) |
2294 | can_pick (const object *who, const object *item) |
2357 | { |
2295 | { |
2358 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2296 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2359 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2297 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
… | |
… | |
2362 | |
2300 | |
2363 | /* |
2301 | /* |
2364 | * create clone from object to another |
2302 | * create clone from object to another |
2365 | */ |
2303 | */ |
2366 | object * |
2304 | object * |
2367 | object_create_clone (object *asrc) |
2305 | object::deep_clone () |
2368 | { |
2306 | { |
2369 | object *dst = 0, *tmp, *src, *prev, *item; |
2307 | assert (("deep_clone called on non-head object", is_head ())); |
2370 | |
2308 | |
2371 | if (!asrc) |
2309 | object *dst = clone (); |
2372 | return 0; |
|
|
2373 | |
2310 | |
2374 | src = asrc->head_ (); |
2311 | object *prev = dst; |
2375 | |
|
|
2376 | prev = 0; |
|
|
2377 | for (object *part = src; part; part = part->more) |
2312 | for (object *part = this->more; part; part = part->more) |
2378 | { |
2313 | { |
2379 | tmp = part->clone (); |
2314 | object *tmp = part->clone (); |
2380 | tmp->x -= src->x; |
|
|
2381 | tmp->y -= src->y; |
|
|
2382 | |
|
|
2383 | if (!part->head) |
|
|
2384 | { |
|
|
2385 | dst = tmp; |
|
|
2386 | tmp->head = 0; |
|
|
2387 | } |
|
|
2388 | else |
|
|
2389 | tmp->head = dst; |
2315 | tmp->head = dst; |
2390 | |
|
|
2391 | tmp->more = 0; |
|
|
2392 | |
|
|
2393 | if (prev) |
|
|
2394 | prev->more = tmp; |
2316 | prev->more = tmp; |
2395 | |
|
|
2396 | prev = tmp; |
2317 | prev = tmp; |
2397 | } |
2318 | } |
2398 | |
2319 | |
2399 | for (item = src->inv; item; item = item->below) |
2320 | for (object *item = inv; item; item = item->below) |
2400 | insert_ob_in_ob (object_create_clone (item), dst); |
2321 | insert_ob_in_ob (item->deep_clone (), dst); |
2401 | |
2322 | |
2402 | return dst; |
2323 | return dst; |
2403 | } |
2324 | } |
2404 | |
2325 | |
2405 | /* This returns the first object in who's inventory that |
2326 | /* This returns the first object in who's inventory that |
… | |
… | |
2414 | return tmp; |
2335 | return tmp; |
2415 | |
2336 | |
2416 | return 0; |
2337 | return 0; |
2417 | } |
2338 | } |
2418 | |
2339 | |
2419 | /* If ob has a field named key, return the link from the list, |
2340 | const shstr & |
2420 | * otherwise return NULL. |
2341 | object::kv_get (const shstr &key) const |
2421 | * |
|
|
2422 | * key must be a passed in shared string - otherwise, this won't |
|
|
2423 | * do the desired thing. |
|
|
2424 | */ |
|
|
2425 | key_value * |
|
|
2426 | get_ob_key_link (const object *ob, const char *key) |
|
|
2427 | { |
2342 | { |
2428 | for (key_value *link = ob->key_values; link; link = link->next) |
2343 | for (key_value *kv = key_values; kv; kv = kv->next) |
2429 | if (link->key == key) |
2344 | if (kv->key == key) |
2430 | return link; |
|
|
2431 | |
|
|
2432 | return 0; |
|
|
2433 | } |
|
|
2434 | |
|
|
2435 | /* |
|
|
2436 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2437 | * |
|
|
2438 | * The argument doesn't need to be a shared string. |
|
|
2439 | * |
|
|
2440 | * The returned string is shared. |
|
|
2441 | */ |
|
|
2442 | const char * |
|
|
2443 | get_ob_key_value (const object *op, const char *const key) |
|
|
2444 | { |
|
|
2445 | key_value *link; |
|
|
2446 | shstr_cmp canonical_key (key); |
|
|
2447 | |
|
|
2448 | if (!canonical_key) |
|
|
2449 | { |
|
|
2450 | /* 1. There being a field named key on any object |
|
|
2451 | * implies there'd be a shared string to find. |
|
|
2452 | * 2. Since there isn't, no object has this field. |
|
|
2453 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2454 | */ |
|
|
2455 | return 0; |
|
|
2456 | } |
|
|
2457 | |
|
|
2458 | /* This is copied from get_ob_key_link() above - |
|
|
2459 | * only 4 lines, and saves the function call overhead. |
|
|
2460 | */ |
|
|
2461 | for (link = op->key_values; link; link = link->next) |
|
|
2462 | if (link->key == canonical_key) |
|
|
2463 | return link->value; |
2345 | return kv->value; |
2464 | |
2346 | |
2465 | return 0; |
2347 | return shstr_null; |
2466 | } |
2348 | } |
2467 | |
2349 | |
2468 | /* |
2350 | void |
2469 | * Updates the canonical_key in op to value. |
2351 | object::kv_set (const shstr &key, const shstr &value) |
2470 | * |
|
|
2471 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2472 | * |
|
|
2473 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2474 | * keys. |
|
|
2475 | * |
|
|
2476 | * Returns TRUE on success. |
|
|
2477 | */ |
|
|
2478 | int |
|
|
2479 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2480 | { |
2352 | { |
2481 | key_value *field = NULL, *last = NULL; |
2353 | for (key_value *kv = key_values; kv; kv = kv->next) |
2482 | |
2354 | if (kv->key == key) |
2483 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2484 | { |
|
|
2485 | if (field->key != canonical_key) |
|
|
2486 | { |
2355 | { |
2487 | last = field; |
2356 | kv->value = value; |
2488 | continue; |
2357 | return; |
2489 | } |
2358 | } |
2490 | |
2359 | |
2491 | if (value) |
2360 | key_value *kv = new key_value; |
2492 | field->value = value; |
2361 | |
2493 | else |
2362 | kv->next = key_values; |
|
|
2363 | kv->key = key; |
|
|
2364 | kv->value = value; |
|
|
2365 | |
|
|
2366 | key_values = kv; |
|
|
2367 | } |
|
|
2368 | |
|
|
2369 | void |
|
|
2370 | object::kv_del (const shstr &key) |
|
|
2371 | { |
|
|
2372 | for (key_value **kvp = &key_values; *kvp; kvp = &(*kvp)->next) |
|
|
2373 | if ((*kvp)->key == key) |
2494 | { |
2374 | { |
2495 | /* Basically, if the archetype has this key set, |
2375 | key_value *kv = *kvp; |
2496 | * we need to store the null value so when we save |
2376 | *kvp = (*kvp)->next; |
2497 | * it, we save the empty value so that when we load, |
2377 | delete kv; |
2498 | * we get this value back again. |
2378 | return; |
2499 | */ |
|
|
2500 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2501 | field->value = 0; |
|
|
2502 | else |
|
|
2503 | { |
|
|
2504 | if (last) |
|
|
2505 | last->next = field->next; |
|
|
2506 | else |
|
|
2507 | op->key_values = field->next; |
|
|
2508 | |
|
|
2509 | delete field; |
|
|
2510 | } |
|
|
2511 | } |
2379 | } |
2512 | return TRUE; |
|
|
2513 | } |
|
|
2514 | /* IF we get here, key doesn't exist */ |
|
|
2515 | |
|
|
2516 | /* No field, we'll have to add it. */ |
|
|
2517 | |
|
|
2518 | if (!add_key) |
|
|
2519 | return FALSE; |
|
|
2520 | |
|
|
2521 | /* There isn't any good reason to store a null |
|
|
2522 | * value in the key/value list. If the archetype has |
|
|
2523 | * this key, then we should also have it, so shouldn't |
|
|
2524 | * be here. If user wants to store empty strings, |
|
|
2525 | * should pass in "" |
|
|
2526 | */ |
|
|
2527 | if (value == NULL) |
|
|
2528 | return TRUE; |
|
|
2529 | |
|
|
2530 | field = new key_value; |
|
|
2531 | |
|
|
2532 | field->key = canonical_key; |
|
|
2533 | field->value = value; |
|
|
2534 | /* Usual prepend-addition. */ |
|
|
2535 | field->next = op->key_values; |
|
|
2536 | op->key_values = field; |
|
|
2537 | |
|
|
2538 | return TRUE; |
|
|
2539 | } |
|
|
2540 | |
|
|
2541 | /* |
|
|
2542 | * Updates the key in op to value. |
|
|
2543 | * |
|
|
2544 | * If add_key is FALSE, this will only update existing keys, |
|
|
2545 | * and not add new ones. |
|
|
2546 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2547 | * |
|
|
2548 | * Returns TRUE on success. |
|
|
2549 | */ |
|
|
2550 | int |
|
|
2551 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2552 | { |
|
|
2553 | shstr key_ (key); |
|
|
2554 | |
|
|
2555 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2556 | } |
2380 | } |
2557 | |
2381 | |
2558 | object::depth_iterator::depth_iterator (object *container) |
2382 | object::depth_iterator::depth_iterator (object *container) |
2559 | : iterator_base (container) |
2383 | : iterator_base (container) |
2560 | { |
2384 | { |
… | |
… | |
2573 | item = item->inv; |
2397 | item = item->inv; |
2574 | } |
2398 | } |
2575 | else |
2399 | else |
2576 | item = item->env; |
2400 | item = item->env; |
2577 | } |
2401 | } |
2578 | |
|
|
2579 | |
2402 | |
2580 | const char * |
2403 | const char * |
2581 | object::flag_desc (char *desc, int len) const |
2404 | object::flag_desc (char *desc, int len) const |
2582 | { |
2405 | { |
2583 | char *p = desc; |
2406 | char *p = desc; |
… | |
… | |
2611 | { |
2434 | { |
2612 | char flagdesc[512]; |
2435 | char flagdesc[512]; |
2613 | char info2[256 * 4]; |
2436 | char info2[256 * 4]; |
2614 | char *p = info; |
2437 | char *p = info; |
2615 | |
2438 | |
2616 | p += snprintf (p, 512, "{cnt:%d,uuid:<1.%" PRIx64 ">,name:\"%s\"%s%s,flags:[%s],type:%d}", |
2439 | p += snprintf (p, 512, "{cnt:%d,uuid:%s,name:\"%s\"%s%s%s,flags:[%s],type:%d}", |
2617 | count, uuid.seq, |
2440 | count, |
|
|
2441 | uuid.c_str (), |
2618 | &name, |
2442 | &name, |
2619 | title ? "\",title:\"" : "", |
2443 | title ? ",title:\"" : "", |
2620 | title ? (const char *)title : "", |
2444 | title ? (const char *)title : "", |
|
|
2445 | title ? "\"" : "", |
2621 | flag_desc (flagdesc, 512), type); |
2446 | flag_desc (flagdesc, 512), type); |
2622 | |
2447 | |
2623 | if (env) |
2448 | if (!flag[FLAG_REMOVED] && env) |
2624 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2449 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2625 | |
2450 | |
2626 | if (map) |
2451 | if (map) |
2627 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2452 | p += snprintf (p, 256, "(on %s@%d+%d)", &map->path, x, y); |
2628 | |
2453 | |
… | |
… | |
2646 | } |
2471 | } |
2647 | |
2472 | |
2648 | const materialtype_t * |
2473 | const materialtype_t * |
2649 | object::dominant_material () const |
2474 | object::dominant_material () const |
2650 | { |
2475 | { |
2651 | if (materialtype_t *mat = name_to_material (materialname)) |
2476 | if (materialtype_t *mt = name_to_material (materialname)) |
2652 | return mat; |
2477 | return mt; |
2653 | |
2478 | |
2654 | // omfg this is slow, this has to be temporary :) |
|
|
2655 | shstr unknown ("unknown"); |
|
|
2656 | |
|
|
2657 | return name_to_material (unknown); |
2479 | return name_to_material (shstr_unknown); |
2658 | } |
2480 | } |
2659 | |
2481 | |
2660 | void |
2482 | void |
2661 | object::open_container (object *new_container) |
2483 | object::open_container (object *new_container) |
2662 | { |
2484 | { |
2663 | if (container == new_container) |
2485 | if (container == new_container) |
2664 | return; |
2486 | return; |
2665 | |
2487 | |
2666 | if (object *old_container = container) |
2488 | object *old_container = container; |
|
|
2489 | |
|
|
2490 | if (old_container) |
2667 | { |
2491 | { |
2668 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2492 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2669 | return; |
2493 | return; |
2670 | |
2494 | |
2671 | #if 0 |
2495 | #if 0 |
… | |
… | |
2673 | if (object *closer = old_container->inv) |
2497 | if (object *closer = old_container->inv) |
2674 | if (closer->type == CLOSE_CON) |
2498 | if (closer->type == CLOSE_CON) |
2675 | closer->destroy (); |
2499 | closer->destroy (); |
2676 | #endif |
2500 | #endif |
2677 | |
2501 | |
|
|
2502 | // make sure the container is available |
|
|
2503 | esrv_send_item (this, old_container); |
|
|
2504 | |
2678 | old_container->flag [FLAG_APPLIED] = 0; |
2505 | old_container->flag [FLAG_APPLIED] = false; |
2679 | container = 0; |
2506 | container = 0; |
2680 | |
2507 | |
|
|
2508 | // client needs item update to make it work, client bug requires this to be separate |
2681 | esrv_update_item (UPD_FLAGS, this, old_container); |
2509 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2510 | |
2682 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
2511 | new_draw_info_format (NDI_UNIQUE, 0, this, "You close %s.", query_name (old_container)); |
|
|
2512 | play_sound (sound_find ("chest_close")); |
2683 | } |
2513 | } |
2684 | |
2514 | |
2685 | if (new_container) |
2515 | if (new_container) |
2686 | { |
2516 | { |
2687 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
2517 | if (INVOKE_OBJECT (OPEN, new_container, ARG_OBJECT (this))) |
… | |
… | |
2698 | } |
2528 | } |
2699 | #endif |
2529 | #endif |
2700 | |
2530 | |
2701 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2531 | new_draw_info_format (NDI_UNIQUE, 0, this, "You open %s.", query_name (new_container)); |
2702 | |
2532 | |
|
|
2533 | // make sure the container is available, client bug requires this to be separate |
|
|
2534 | esrv_send_item (this, new_container); |
|
|
2535 | |
2703 | new_container->flag [FLAG_APPLIED] = 1; |
2536 | new_container->flag [FLAG_APPLIED] = true; |
2704 | container = new_container; |
2537 | container = new_container; |
2705 | |
2538 | |
|
|
2539 | // client needs flag change |
2706 | esrv_update_item (UPD_FLAGS, this, new_container); |
2540 | esrv_update_item (UPD_FLAGS, this, new_container); |
2707 | esrv_send_inventory (this, new_container); |
2541 | esrv_send_inventory (this, new_container); |
|
|
2542 | play_sound (sound_find ("chest_open")); |
|
|
2543 | } |
|
|
2544 | // else if (!old_container->env && contr && contr->ns) |
|
|
2545 | // contr->ns->floorbox_reset (); |
|
|
2546 | } |
|
|
2547 | |
|
|
2548 | object * |
|
|
2549 | object::force_find (const shstr name) |
|
|
2550 | { |
|
|
2551 | /* cycle through his inventory to look for the MARK we want to |
|
|
2552 | * place |
|
|
2553 | */ |
|
|
2554 | for (object *tmp = inv; tmp; tmp = tmp->below) |
|
|
2555 | if (tmp->type == FORCE && tmp->slaying == name) |
|
|
2556 | return splay (tmp); |
|
|
2557 | |
|
|
2558 | return 0; |
|
|
2559 | } |
|
|
2560 | |
|
|
2561 | void |
|
|
2562 | object::force_add (const shstr name, int duration) |
|
|
2563 | { |
|
|
2564 | if (object *force = force_find (name)) |
|
|
2565 | force->destroy (); |
|
|
2566 | |
|
|
2567 | object *force = get_archetype (FORCE_NAME); |
|
|
2568 | |
|
|
2569 | force->slaying = name; |
|
|
2570 | force->stats.food = 1; |
|
|
2571 | force->speed_left = -1.f; |
|
|
2572 | |
|
|
2573 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2574 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2575 | force->flag [FLAG_APPLIED] = true; |
|
|
2576 | |
|
|
2577 | insert (force); |
|
|
2578 | } |
|
|
2579 | |
|
|
2580 | void |
|
|
2581 | object::play_sound (faceidx sound) |
|
|
2582 | { |
|
|
2583 | if (!sound) |
|
|
2584 | return; |
|
|
2585 | |
|
|
2586 | if (flag [FLAG_REMOVED]) |
|
|
2587 | return; |
|
|
2588 | |
|
|
2589 | if (env) |
2708 | } |
2590 | { |
|
|
2591 | if (object *pl = in_player ()) |
|
|
2592 | pl->contr->play_sound (sound); |
|
|
2593 | } |
|
|
2594 | else |
|
|
2595 | map->play_sound (sound, x, y); |
2709 | } |
2596 | } |
2710 | |
2597 | |
2711 | |
|
|