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