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