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