1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008,2009 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT is free software: you can redistribute it and/or modify |
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 3 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, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Eneq(@csd.uu.se): Added weight-modifiers in environment of objects. |
|
|
25 | sub/add_weight will transcend the environment updating the carrying |
|
|
26 | variable. */ |
|
|
27 | #include <global.h> |
25 | #include <global.h> |
28 | #include <stdio.h> |
26 | #include <stdio.h> |
29 | #include <sys/types.h> |
27 | #include <sys/types.h> |
30 | #include <sys/uio.h> |
28 | #include <sys/uio.h> |
31 | #include <object.h> |
29 | #include <object.h> |
32 | #include <funcpoint.h> |
|
|
33 | #include <sproto.h> |
30 | #include <sproto.h> |
34 | #include <loader.h> |
31 | #include <loader.h> |
35 | |
32 | |
36 | #include <bitset> |
33 | #include <bitset> |
37 | |
34 | |
38 | int nrofallocobjects = 0; |
35 | UUID UUID::cur; |
39 | static UUID uuid; |
36 | static uint64_t seq_next_save; |
40 | const uint64 UUID_SKIP = 1<<19; |
37 | static const uint64 UUID_GAP = 1<<19; |
|
|
38 | uint32_t mapspace::smellcount = 10000; |
41 | |
39 | |
42 | objectvec objects; |
40 | objectvec objects; |
43 | activevec actives; |
41 | activevec actives; |
44 | |
42 | |
45 | short freearr_x[SIZEOFFREE] = { 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, -2, -2, -2, -1, |
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, |
46 | 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3, -3, -3, -3, -3, -2, -1 |
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 |
47 | }; |
50 | }; |
48 | short freearr_y[SIZEOFFREE] = { 0, -1, -1, 0, 1, 1, 1, 0, -1, -2, -2, -2, -1, 0, 1, 2, 2, 2, 2, 2, 1, 0, -1, -2, -2, |
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, |
49 | -3, -3, -3, -3, -2, -1, 0, 1, 2, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0, -1, -2, -3, -3, -3 |
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 |
50 | }; |
|
|
51 | int maxfree[SIZEOFFREE] = { 0, 9, 10, 13, 14, 17, 18, 21, 22, 25, 26, 27, 30, 31, 32, 33, 36, 37, 39, 39, 42, 43, 44, 45, |
|
|
52 | 48, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49 |
|
|
53 | }; |
56 | }; |
54 | int freedir[SIZEOFFREE] = { |
57 | int freedir[SIZEOFFREE] = { |
55 | 0, 1, 2, 3, 4, 5, 6, 7, 8, 1, 2, 2, 2, 3, 4, 4, 4, 5, 6, 6, 6, 7, 8, 8, 8, |
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, |
56 | 1, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8 |
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 |
57 | }; |
62 | }; |
58 | |
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 | |
59 | static void |
71 | static void |
60 | write_uuid (void) |
72 | write_uuid (uval64 skip, bool sync) |
61 | { |
73 | { |
62 | char filename1[MAX_BUF], filename2[MAX_BUF]; |
74 | CALL_BEGIN (2); |
63 | |
75 | CALL_ARG_SV (newSVval64 (skip)); |
64 | sprintf (filename1, "%s/uuid", settings.localdir); |
76 | CALL_ARG_SV (boolSV (sync)); |
65 | sprintf (filename2, "%s/uuid~", settings.localdir); |
77 | CALL_CALL ("cf::write_uuid", G_DISCARD); |
66 | |
78 | CALL_END; |
67 | FILE *fp; |
|
|
68 | |
|
|
69 | if (!(fp = fopen (filename2, "w"))) |
|
|
70 | { |
|
|
71 | LOG (llevError, "ERROR: cannot open %s for writing, unable to write UUID!\n", filename2); |
|
|
72 | return; |
|
|
73 | } |
|
|
74 | |
|
|
75 | fprintf (fp, "<1,%llx>\n", (unsigned long long)uuid.seq + UUID_SKIP * 2); |
|
|
76 | fclose (fp); |
|
|
77 | rename (filename2, filename1); |
|
|
78 | } |
79 | } |
79 | |
80 | |
80 | static void |
81 | static void |
81 | read_uuid (void) |
82 | read_uuid (void) |
82 | { |
83 | { |
83 | char filename[MAX_BUF]; |
84 | char filename[MAX_BUF]; |
84 | |
85 | |
85 | sprintf (filename, "%s/uuid", settings.localdir); |
86 | sprintf (filename, "%s/uuid", settings.localdir); |
|
|
87 | |
|
|
88 | seq_next_save = 0; |
86 | |
89 | |
87 | FILE *fp; |
90 | FILE *fp; |
88 | |
91 | |
89 | if (!(fp = fopen (filename, "r"))) |
92 | if (!(fp = fopen (filename, "r"))) |
90 | { |
93 | { |
91 | if (errno == ENOENT) |
94 | if (errno == ENOENT) |
92 | { |
95 | { |
93 | LOG (llevInfo, "RESET uid to 1\n"); |
96 | LOG (llevInfo, "RESET uid to 1\n"); |
94 | uuid.seq = 0; |
97 | UUID::cur.seq = 0; |
95 | write_uuid (); |
98 | write_uuid (UUID_GAP, true); |
96 | return; |
99 | return; |
97 | } |
100 | } |
98 | |
101 | |
99 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
102 | LOG (llevError, "FATAL: cannot open %s for reading!\n", filename); |
100 | _exit (1); |
103 | _exit (1); |
101 | } |
104 | } |
102 | |
105 | |
103 | int version; |
106 | char buf [UUID::MAX_LEN]; |
104 | unsigned long long uid; |
107 | buf[0] = 0; |
105 | if (2 != fscanf (fp, "<%d,%llx>\n", &version, &uid) || version != 1) |
108 | fgets (buf, sizeof (buf), fp); |
|
|
109 | |
|
|
110 | if (!UUID::cur.parse (buf)) |
106 | { |
111 | { |
107 | LOG (llevError, "FATAL: error reading uid from %s!\n", filename); |
112 | LOG (llevError, "FATAL: error reading uid from %s (%s)!\n", filename, buf); |
108 | _exit (1); |
113 | _exit (1); |
109 | } |
114 | } |
110 | |
115 | |
111 | uuid.seq = uid; |
116 | LOG (llevDebug, "read UUID: %s\n", UUID::cur.c_str ()); |
112 | write_uuid (); |
117 | |
113 | LOG (llevDebug, "read UID: %" PRId64 "\n", uid); |
118 | write_uuid (UUID_GAP, true); |
114 | fclose (fp); |
119 | fclose (fp); |
115 | } |
120 | } |
116 | |
121 | |
117 | UUID |
122 | UUID |
118 | gen_uuid () |
123 | UUID::gen () |
119 | { |
124 | { |
120 | UUID uid; |
125 | UUID uid; |
121 | |
126 | |
122 | uid.seq = ++uuid.seq; |
127 | uid.seq = ++cur.seq; |
123 | |
128 | |
124 | if (!(uuid.seq & (UUID_SKIP - 1))) |
129 | if (expect_false (cur.seq >= seq_next_save)) |
125 | write_uuid (); |
130 | { |
|
|
131 | seq_next_save = UUID::cur.seq + (UUID_GAP >> 1); |
|
|
132 | write_uuid (UUID_GAP, false); |
|
|
133 | } |
|
|
134 | |
126 | |
135 | |
127 | return uid; |
136 | return uid; |
128 | } |
137 | } |
129 | |
138 | |
130 | void |
139 | void |
131 | init_uuid () |
140 | UUID::init () |
132 | { |
141 | { |
133 | read_uuid (); |
142 | read_uuid (); |
134 | } |
143 | } |
135 | |
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 | |
136 | /* 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. */ |
137 | static int |
211 | static bool |
138 | compare_ob_value_lists_one (const object *wants, const object *has) |
212 | compare_ob_value_lists_one (const object *wants, const object *has) |
139 | { |
213 | { |
140 | key_value *wants_field; |
|
|
141 | |
|
|
142 | /* 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 |
143 | * 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 |
144 | * different structure or at least keep the lists sorted... |
216 | * different structure or at least keep the lists sorted... |
145 | */ |
217 | */ |
146 | |
218 | |
147 | /* For each field in wants, */ |
219 | /* For each field in wants, */ |
148 | 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) |
149 | { |
221 | if (has->kv_get (kv->key) != kv->value) |
150 | key_value *has_field; |
222 | return false; |
151 | |
|
|
152 | /* Look for a field in has with the same key. */ |
|
|
153 | has_field = get_ob_key_link (has, wants_field->key); |
|
|
154 | |
|
|
155 | if (has_field == NULL) |
|
|
156 | { |
|
|
157 | /* No field with that name. */ |
|
|
158 | return FALSE; |
|
|
159 | } |
|
|
160 | |
|
|
161 | /* Found the matching field. */ |
|
|
162 | if (has_field->value != wants_field->value) |
|
|
163 | { |
|
|
164 | /* Values don't match, so this half of the comparison is false. */ |
|
|
165 | return FALSE; |
|
|
166 | } |
|
|
167 | |
|
|
168 | /* If we get here, we found a match. Now for the next field in wants. */ |
|
|
169 | } |
|
|
170 | |
223 | |
171 | /* 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. */ |
172 | return TRUE; |
225 | return true; |
173 | } |
226 | } |
174 | |
227 | |
175 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
228 | /* Returns TRUE if ob1 has the same key_values as ob2. */ |
176 | static int |
229 | static bool |
177 | compare_ob_value_lists (const object *ob1, const object *ob2) |
230 | compare_ob_value_lists (const object *ob1, const object *ob2) |
178 | { |
231 | { |
179 | /* 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, |
180 | * so we need to run the comparison *twice*. :( |
233 | * so we need to run the comparison *twice*. :( |
181 | */ |
234 | */ |
182 | 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); |
183 | } |
237 | } |
184 | |
238 | |
185 | /* 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 |
186 | * they can be merged together. |
240 | * they can be merged together. |
187 | * |
241 | * |
… | |
… | |
197 | bool object::can_merge_slow (object *ob1, object *ob2) |
251 | bool object::can_merge_slow (object *ob1, object *ob2) |
198 | { |
252 | { |
199 | /* A couple quicksanity checks */ |
253 | /* A couple quicksanity checks */ |
200 | if (ob1 == ob2 |
254 | if (ob1 == ob2 |
201 | || ob1->type != ob2->type |
255 | || ob1->type != ob2->type |
202 | || ob1->speed != ob2->speed |
256 | || fabs (ob1->speed - ob2->speed) >= MIN_ACTIVE_SPEED |
203 | || ob1->value != ob2->value |
257 | || ob1->value != ob2->value |
204 | || ob1->name != ob2->name) |
258 | || ob1->name != ob2->name) |
205 | return 0; |
259 | return 0; |
206 | |
260 | |
207 | //TODO: this ain't working well, use nicer and correct overflow check |
|
|
208 | /* 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 |
209 | * value could not be stored in a sint32 (which unfortunately sometimes is |
262 | * is always 0 .. 2**31-1 */ |
210 | * used to store nrof). |
263 | if (ob1->nrof > 0x7fffffff - ob2->nrof) |
211 | */ |
|
|
212 | if (ob1->nrof + ob2->nrof >= 1UL << 31) |
|
|
213 | return 0; |
264 | return 0; |
214 | |
265 | |
215 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
266 | /* If the objects have been identified, set the BEEN_APPLIED flag. |
216 | * This is to the comparison of the flags below will be OK. We |
267 | * This is to the comparison of the flags below will be OK. We |
217 | * just can't ignore the been applied or identified flags, as they |
268 | * just can't ignore the been applied or identified flags, as they |
218 | * are not equal - just if it has been identified, the been_applied |
269 | * are not equal - just if it has been identified, the been_applied |
219 | * flags lose any meaning. |
270 | * flags lose any meaning. |
220 | */ |
271 | */ |
221 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
272 | if (QUERY_FLAG (ob1, FLAG_IDENTIFIED)) |
222 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
273 | SET_FLAG (ob1, FLAG_BEEN_APPLIED); |
223 | |
274 | |
224 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
275 | if (QUERY_FLAG (ob2, FLAG_IDENTIFIED)) |
225 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
276 | SET_FLAG (ob2, FLAG_BEEN_APPLIED); |
226 | |
277 | |
227 | if ((ob1->flag ^ ob2->flag).reset (FLAG_INV_LOCKED).reset (FLAG_CLIENT_SENT).any () |
278 | if (ob1->arch->archname != ob2->arch->archname |
228 | || ob1->arch != ob2->arch |
|
|
229 | || ob1->name != ob2->name |
279 | || ob1->name != ob2->name |
230 | || ob1->title != ob2->title |
280 | || ob1->title != ob2->title |
231 | || ob1->msg != ob2->msg |
281 | || ob1->msg != ob2->msg |
232 | || ob1->weight != ob2->weight |
282 | || ob1->weight != ob2->weight |
233 | || memcmp (&ob1->resist, &ob2->resist, sizeof (ob1->resist)) |
|
|
234 | || memcmp (&ob1->stats , &ob2->stats , sizeof (ob1->stats) ) |
|
|
235 | || ob1->attacktype != ob2->attacktype |
283 | || ob1->attacktype != ob2->attacktype |
236 | || ob1->magic != ob2->magic |
284 | || ob1->magic != ob2->magic |
237 | || ob1->slaying != ob2->slaying |
285 | || ob1->slaying != ob2->slaying |
238 | || ob1->skill != ob2->skill |
286 | || ob1->skill != ob2->skill |
239 | || ob1->value != ob2->value |
287 | || ob1->value != ob2->value |
240 | || 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 |
241 | || ob1->client_type != ob2->client_type |
290 | || ob1->client_type != ob2->client_type |
242 | || ob1->materialname != ob2->materialname |
291 | || ob1->material != ob2->material |
243 | || ob1->lore != ob2->lore |
292 | || ob1->lore != ob2->lore |
244 | || ob1->subtype != ob2->subtype |
293 | || ob1->subtype != ob2->subtype |
245 | || ob1->move_type != ob2->move_type |
294 | || ob1->move_type != ob2->move_type |
246 | || ob1->move_block != ob2->move_block |
295 | || ob1->move_block != ob2->move_block |
247 | || ob1->move_allow != ob2->move_allow |
296 | || ob1->move_allow != ob2->move_allow |
248 | || ob1->move_on != ob2->move_on |
297 | || ob1->move_on != ob2->move_on |
249 | || ob1->move_off != ob2->move_off |
298 | || ob1->move_off != ob2->move_off |
250 | || ob1->move_slow != ob2->move_slow |
299 | || ob1->move_slow != ob2->move_slow |
251 | || 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))) |
252 | return 0; |
303 | return 0; |
253 | |
304 | |
|
|
305 | if ((ob1->flag ^ ob2->flag) |
|
|
306 | .reset (FLAG_INV_LOCKED) |
|
|
307 | .reset (FLAG_REMOVED) |
|
|
308 | .any ()) |
|
|
309 | return 0; |
|
|
310 | |
254 | /* This is really a spellbook check - really, we should |
311 | /* This is really a spellbook check - we should in general |
255 | * check all objects in the inventory. |
312 | * not merge objects with real inventories, as splitting them |
|
|
313 | * is hard. |
256 | */ |
314 | */ |
257 | if (ob1->inv || ob2->inv) |
315 | if (ob1->inv || ob2->inv) |
258 | { |
316 | { |
259 | if (!(ob1->inv && ob2->inv)) |
317 | if (!(ob1->inv && ob2->inv)) |
260 | return 0; /* inventories differ in length */ |
318 | return 0; /* inventories differ in length */ |
261 | |
319 | |
262 | if (ob1->inv->below || ob2->inv->below) |
320 | if (ob1->inv->below || ob2->inv->below) |
263 | return 0; /* more than one object in inv */ |
321 | return 0; /* more than one object in inv */ |
264 | |
322 | |
265 | if (!object::can_merge (ob1->inv, ob2->inv)) |
323 | if (!object::can_merge (ob1->inv, ob2->inv)) |
266 | return 0; /* inventory objexts differ */ |
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. */ |
300 | return 0; |
358 | |
301 | else if (!compare_ob_value_lists (ob1, ob2)) |
359 | if (!compare_ob_value_lists (ob1, ob2)) |
302 | return 0; |
360 | return 0; |
303 | } |
361 | } |
304 | |
362 | |
305 | if (ob1->self || ob2->self) |
363 | if (ob1->self || ob2->self) |
306 | { |
364 | { |
… | |
… | |
312 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
370 | int k1 = ob1->self ? HvTOTALKEYS (ob1->self) : 0; |
313 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
371 | int k2 = ob2->self ? HvTOTALKEYS (ob2->self) : 0; |
314 | |
372 | |
315 | if (k1 != k2) |
373 | if (k1 != k2) |
316 | return 0; |
374 | return 0; |
|
|
375 | |
317 | else if (k1 == 0) |
376 | if (k1 == 0) |
318 | return 1; |
377 | return 1; |
|
|
378 | |
319 | else if (!cfperl_can_merge (ob1, ob2)) |
379 | if (!cfperl_can_merge (ob1, ob2)) |
320 | return 0; |
380 | return 0; |
321 | } |
381 | } |
322 | } |
382 | } |
323 | |
383 | |
324 | /* Everything passes, must be OK. */ |
384 | /* Everything passes, must be OK. */ |
325 | return 1; |
385 | return 1; |
326 | } |
386 | } |
327 | |
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 | |
328 | /* |
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 | /* |
329 | * sum_weight() is a recursive function which calculates the weight |
462 | * this is a recursive function which calculates the weight |
330 | * 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 |
331 | * containers are carrying, and sums it up. |
464 | * containers are carrying, and sums it up. |
332 | */ |
465 | */ |
333 | long |
466 | void |
334 | sum_weight (object *op) |
467 | object::update_weight () |
335 | { |
468 | { |
336 | long sum; |
469 | sint32 sum = 0; |
337 | object *inv; |
|
|
338 | |
470 | |
339 | for (sum = 0, inv = op->inv; inv; inv = inv->below) |
471 | for (object *op = inv; op; op = op->below) |
340 | { |
472 | { |
341 | if (inv->inv) |
473 | if (op->inv) |
342 | sum_weight (inv); |
474 | op->update_weight (); |
343 | |
475 | |
344 | 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) |
345 | } |
482 | { |
346 | |
|
|
347 | if (op->type == CONTAINER && op->stats.Str) |
|
|
348 | sum = (sum * (100 - op->stats.Str)) / 100; |
|
|
349 | |
|
|
350 | if (op->carrying != sum) |
|
|
351 | op->carrying = sum; |
483 | carrying = sum; |
352 | |
484 | |
353 | 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 | } |
354 | } |
489 | } |
355 | |
490 | |
356 | /** |
491 | /* |
357 | * Return the outermost environment object for a given object. |
492 | * Used by: Server DM commands: dumpbelow, dump. Some error messages. |
358 | */ |
|
|
359 | |
|
|
360 | object * |
|
|
361 | object_get_env_recursive (object *op) |
|
|
362 | { |
|
|
363 | while (op->env != NULL) |
|
|
364 | op = op->env; |
|
|
365 | return op; |
|
|
366 | } |
|
|
367 | |
|
|
368 | /* |
|
|
369 | * Used by: Crossedit: dump. Server DM commands: dumpbelow, dump. |
|
|
370 | * Some error messages. |
|
|
371 | * The result of the dump is stored in the static global errmsg array. |
|
|
372 | */ |
493 | */ |
373 | char * |
494 | char * |
374 | dump_object (object *op) |
495 | dump_object (object *op) |
375 | { |
496 | { |
376 | if (!op) |
497 | if (!op) |
… | |
… | |
379 | object_freezer freezer; |
500 | object_freezer freezer; |
380 | op->write (freezer); |
501 | op->write (freezer); |
381 | return freezer.as_string (); |
502 | return freezer.as_string (); |
382 | } |
503 | } |
383 | |
504 | |
384 | /* |
505 | char * |
385 | * get_nearest_part(multi-object, object 2) returns the part of the |
506 | object::as_string () |
386 | * multi-object 1 which is closest to the second object. |
|
|
387 | * If it's not a multi-object, it is returned. |
|
|
388 | */ |
|
|
389 | object * |
|
|
390 | get_nearest_part (object *op, const object *pl) |
|
|
391 | { |
507 | { |
392 | object *tmp, *closest; |
508 | return dump_object (this); |
393 | int last_dist, i; |
|
|
394 | |
|
|
395 | if (op->more == NULL) |
|
|
396 | return op; |
|
|
397 | for (last_dist = distance (op, pl), closest = op, tmp = op->more; tmp != NULL; tmp = tmp->more) |
|
|
398 | if ((i = distance (tmp, pl)) < last_dist) |
|
|
399 | closest = tmp, last_dist = i; |
|
|
400 | return closest; |
|
|
401 | } |
509 | } |
402 | |
510 | |
403 | /* |
511 | /* |
404 | * 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. |
405 | */ |
514 | */ |
406 | object * |
515 | object * |
407 | find_object (tag_t i) |
516 | find_object (tag_t i) |
408 | { |
517 | { |
409 | for_all_objects (op) |
518 | for_all_objects (op) |
… | |
… | |
420 | */ |
529 | */ |
421 | object * |
530 | object * |
422 | find_object_name (const char *str) |
531 | find_object_name (const char *str) |
423 | { |
532 | { |
424 | shstr_cmp str_ (str); |
533 | shstr_cmp str_ (str); |
425 | object *op; |
|
|
426 | |
534 | |
|
|
535 | if (str_) |
427 | for_all_objects (op) |
536 | for_all_objects (op) |
428 | if (op->name == str_) |
537 | if (op->name == str_) |
429 | break; |
538 | return op; |
430 | |
539 | |
431 | return op; |
540 | return 0; |
432 | } |
|
|
433 | |
|
|
434 | void |
|
|
435 | free_all_object_data () |
|
|
436 | { |
|
|
437 | LOG (llevDebug, "%d allocated objects\n", nrofallocobjects); |
|
|
438 | } |
541 | } |
439 | |
542 | |
440 | /* |
543 | /* |
441 | * 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 |
442 | * skill and experience objects. |
545 | * skill and experience objects. |
… | |
… | |
447 | { |
550 | { |
448 | // allow objects which own objects |
551 | // allow objects which own objects |
449 | if (owner) |
552 | if (owner) |
450 | while (owner->owner) |
553 | while (owner->owner) |
451 | 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 | } |
452 | |
561 | |
453 | this->owner = owner; |
562 | this->owner = owner; |
454 | } |
563 | } |
455 | |
564 | |
456 | int |
565 | int |
… | |
… | |
498 | update_stats (); |
607 | update_stats (); |
499 | |
608 | |
500 | new_draw_info_format (NDI_UNIQUE, 0, this, |
609 | new_draw_info_format (NDI_UNIQUE, 0, this, |
501 | "You try to balance all your items at once, " |
610 | "You try to balance all your items at once, " |
502 | "but the %s is just too much for your body. " |
611 | "but the %s is just too much for your body. " |
503 | "[You need to unapply some items first.]", &ob->name); |
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); |
504 | return false; |
614 | return false; |
505 | } |
615 | } |
506 | |
616 | |
507 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
617 | //new_draw_info_format (NDI_UNIQUE, 0, this, "You switch to your %s.", &ob->name); |
508 | } |
618 | } |
… | |
… | |
534 | } |
644 | } |
535 | |
645 | |
536 | op->key_values = 0; |
646 | op->key_values = 0; |
537 | } |
647 | } |
538 | |
648 | |
539 | object & |
649 | /* |
540 | 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) |
541 | { |
659 | { |
542 | bool is_freed = flag [FLAG_FREED]; |
660 | dst->remove (); |
543 | bool is_removed = flag [FLAG_REMOVED]; |
|
|
544 | |
|
|
545 | *(object_copy *)this = src; |
661 | *(object_copy *)dst = *this; |
546 | |
|
|
547 | flag [FLAG_FREED] = is_freed; |
|
|
548 | flag [FLAG_REMOVED] = is_removed; |
662 | dst->flag [FLAG_REMOVED] = true; |
549 | |
663 | |
550 | /* Copy over key_values, if any. */ |
664 | /* Copy over key_values, if any. */ |
551 | if (src.key_values) |
665 | if (key_values) |
552 | { |
666 | { |
553 | key_value *tail = 0; |
667 | key_value *tail = 0; |
554 | key_values = 0; |
668 | dst->key_values = 0; |
555 | |
669 | |
556 | for (key_value *i = src.key_values; i; i = i->next) |
670 | for (key_value *i = key_values; i; i = i->next) |
557 | { |
671 | { |
558 | key_value *new_link = new key_value; |
672 | key_value *new_link = new key_value; |
559 | |
673 | |
560 | new_link->next = 0; |
674 | new_link->next = 0; |
561 | new_link->key = i->key; |
675 | new_link->key = i->key; |
562 | new_link->value = i->value; |
676 | new_link->value = i->value; |
563 | |
677 | |
564 | /* Try and be clever here, too. */ |
678 | /* Try and be clever here, too. */ |
565 | if (!key_values) |
679 | if (!dst->key_values) |
566 | { |
680 | { |
567 | key_values = new_link; |
681 | dst->key_values = new_link; |
568 | tail = new_link; |
682 | tail = new_link; |
569 | } |
683 | } |
570 | else |
684 | else |
571 | { |
685 | { |
572 | tail->next = new_link; |
686 | tail->next = new_link; |
573 | tail = new_link; |
687 | tail = new_link; |
574 | } |
688 | } |
575 | } |
689 | } |
576 | } |
690 | } |
577 | } |
|
|
578 | |
|
|
579 | /* |
|
|
580 | * copy_to first frees everything allocated by the dst object, |
|
|
581 | * and then copies the contents of itself into the second |
|
|
582 | * object, allocating what needs to be allocated. Basically, any |
|
|
583 | * data that is malloc'd needs to be re-malloc/copied. Otherwise, |
|
|
584 | * if the first object is freed, the pointers in the new object |
|
|
585 | * will point at garbage. |
|
|
586 | */ |
|
|
587 | void |
|
|
588 | object::copy_to (object *dst) |
|
|
589 | { |
|
|
590 | *dst = *this; |
|
|
591 | |
691 | |
592 | if (speed < 0) |
692 | if (speed < 0) |
593 | dst->speed_left -= rndm (); |
693 | dst->speed_left -= rndm (); |
594 | |
694 | |
595 | dst->set_speed (dst->speed); |
695 | dst->activate (); |
596 | } |
696 | } |
597 | |
697 | |
598 | void |
698 | void |
599 | object::instantiate () |
699 | object::instantiate () |
600 | { |
700 | { |
601 | if (!uuid.seq) // HACK |
701 | if (!uuid.seq) // HACK |
602 | uuid = gen_uuid (); |
702 | uuid = UUID::gen (); |
603 | |
703 | |
604 | speed_left = -0.1f; |
704 | speed_left = -0.1f; |
605 | /* 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 |
606 | * 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. |
607 | * 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 |
… | |
… | |
617 | object * |
717 | object * |
618 | object::clone () |
718 | object::clone () |
619 | { |
719 | { |
620 | object *neu = create (); |
720 | object *neu = create (); |
621 | copy_to (neu); |
721 | copy_to (neu); |
|
|
722 | neu->map = map; // not copied by copy_to |
622 | return neu; |
723 | return neu; |
623 | } |
724 | } |
624 | |
725 | |
625 | /* |
726 | /* |
626 | * 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 |
… | |
… | |
643 | * 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. |
644 | */ |
745 | */ |
645 | void |
746 | void |
646 | object::set_speed (float speed) |
747 | object::set_speed (float speed) |
647 | { |
748 | { |
648 | if (flag [FLAG_FREED] && speed) |
|
|
649 | { |
|
|
650 | LOG (llevError, "Object %s is freed but has speed.\n", &name); |
|
|
651 | speed = 0; |
|
|
652 | } |
|
|
653 | |
|
|
654 | this->speed = speed; |
749 | this->speed = speed; |
655 | |
750 | |
656 | if (has_active_speed ()) |
751 | if (has_active_speed ()) |
657 | activate (); |
752 | activate (); |
658 | else |
753 | else |
… | |
… | |
677 | * UP_OBJ_FACE: only the objects face has changed. |
772 | * UP_OBJ_FACE: only the objects face has changed. |
678 | */ |
773 | */ |
679 | void |
774 | void |
680 | update_object (object *op, int action) |
775 | update_object (object *op, int action) |
681 | { |
776 | { |
682 | if (op == NULL) |
777 | if (!op) |
683 | { |
778 | { |
684 | /* this should never happen */ |
779 | /* this should never happen */ |
685 | LOG (llevDebug, "update_object() called for NULL object.\n"); |
780 | LOG (llevError | logBacktrace, "update_object() called for NULL object.\n"); |
686 | return; |
781 | return; |
687 | } |
782 | } |
688 | |
783 | |
689 | if (op->env) |
784 | if (!op->is_on_map ()) |
690 | { |
785 | { |
691 | /* Animation is currently handled by client, so nothing |
786 | /* Animation is currently handled by client, so nothing |
692 | * to do in this case. |
787 | * to do in this case. |
693 | */ |
788 | */ |
694 | return; |
789 | return; |
695 | } |
790 | } |
696 | |
|
|
697 | /* If the map is saving, don't do anything as everything is |
|
|
698 | * going to get freed anyways. |
|
|
699 | */ |
|
|
700 | if (!op->map || op->map->in_memory == MAP_SAVING) |
|
|
701 | return; |
|
|
702 | |
791 | |
703 | /* make sure the object is within map boundaries */ |
792 | /* make sure the object is within map boundaries */ |
704 | 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) |
705 | { |
794 | { |
706 | LOG (llevError, "update_object() called for object out of map!\n"); |
795 | LOG (llevError, "update_object() called for object out of map!\n"); |
… | |
… | |
714 | |
803 | |
715 | if (!(m.flags_ & P_UPTODATE)) |
804 | if (!(m.flags_ & P_UPTODATE)) |
716 | /* nop */; |
805 | /* nop */; |
717 | else if (action == UP_OBJ_INSERT) |
806 | else if (action == UP_OBJ_INSERT) |
718 | { |
807 | { |
|
|
808 | #if 0 |
719 | // this is likely overkill, TODO: revisit (schmorp) |
809 | // this is likely overkill, TODO: revisit (schmorp) |
720 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
810 | if ((QUERY_FLAG (op, FLAG_BLOCKSVIEW) && !(m.flags_ & P_BLOCKSVIEW)) |
721 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
811 | || (QUERY_FLAG (op, FLAG_NO_MAGIC) && !(m.flags_ & P_NO_MAGIC)) |
722 | || (op->type == PLAYER && !(m.flags_ & P_PLAYER)) |
812 | || (op->is_player () && !(m.flags_ & P_PLAYER)) |
723 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
813 | || (op->type == SAFE_GROUND && !(m.flags_ & P_SAFE)) |
724 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
814 | || (QUERY_FLAG (op, FLAG_ALIVE) && !(m.flags_ & P_IS_ALIVE)) |
725 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
815 | || (QUERY_FLAG (op, FLAG_DAMNED) && !(m.flags_ & P_NO_CLERIC)) |
726 | || (m.move_on | op->move_on ) != m.move_on |
816 | || (m.move_on | op->move_on ) != m.move_on |
727 | || (m.move_off | op->move_off ) != m.move_off |
817 | || (m.move_off | op->move_off ) != m.move_off |
728 | || (m.move_slow | op->move_slow) != m.move_slow |
818 | || (m.move_slow | op->move_slow) != m.move_slow |
729 | /* 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 |
730 | * to have move_allow right now. |
820 | * have move_allow right now. |
731 | */ |
821 | */ |
732 | || ((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 |
733 | || 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) |
734 | m.flags_ = 0; |
826 | m.invalidate (); |
|
|
827 | #endif |
735 | } |
828 | } |
736 | /* if the object is being removed, we can't make intelligent |
829 | /* if the object is being removed, we can't make intelligent |
737 | * decisions, because remove_ob can't really pass the object |
830 | * decisions, because remove_ob can't really pass the object |
738 | * that is being removed. |
831 | * that is being removed. |
739 | */ |
832 | */ |
740 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
833 | else if (action == UP_OBJ_CHANGE || action == UP_OBJ_REMOVE) |
741 | m.flags_ = 0; |
834 | m.invalidate (); |
742 | else if (action == UP_OBJ_FACE) |
835 | else if (action == UP_OBJ_FACE) |
743 | /* Nothing to do for that case */ ; |
836 | /* Nothing to do for that case */ ; |
744 | else |
837 | else |
745 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
838 | LOG (llevError, "update_object called with invalid action: %d\n", action); |
746 | |
839 | |
… | |
… | |
750 | |
843 | |
751 | object::object () |
844 | object::object () |
752 | { |
845 | { |
753 | SET_FLAG (this, FLAG_REMOVED); |
846 | SET_FLAG (this, FLAG_REMOVED); |
754 | |
847 | |
755 | expmul = 1.0; |
848 | //expmul = 1.0; declared const for the time being |
756 | face = blank_face; |
849 | face = blank_face; |
|
|
850 | material = MATERIAL_NULL; |
757 | } |
851 | } |
758 | |
852 | |
759 | object::~object () |
853 | object::~object () |
760 | { |
854 | { |
761 | unlink (); |
855 | unlink (); |
… | |
… | |
766 | static int object_count; |
860 | static int object_count; |
767 | |
861 | |
768 | void object::link () |
862 | void object::link () |
769 | { |
863 | { |
770 | assert (!index);//D |
864 | assert (!index);//D |
771 | uuid = gen_uuid (); |
865 | uuid = UUID::gen (); |
772 | count = ++object_count; |
866 | count = ++object_count; |
773 | |
867 | |
774 | refcnt_inc (); |
868 | refcnt_inc (); |
775 | objects.insert (this); |
869 | objects.insert (this); |
776 | } |
870 | } |
… | |
… | |
790 | /* If already on active list, don't do anything */ |
884 | /* If already on active list, don't do anything */ |
791 | if (active) |
885 | if (active) |
792 | return; |
886 | return; |
793 | |
887 | |
794 | 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 | |
795 | actives.insert (this); |
893 | actives.insert (this); |
|
|
894 | } |
796 | } |
895 | } |
797 | |
896 | |
798 | void |
897 | void |
799 | object::activate_recursive () |
898 | object::activate_recursive () |
800 | { |
899 | { |
… | |
… | |
849 | object::destroy_inv (bool drop_to_ground) |
948 | object::destroy_inv (bool drop_to_ground) |
850 | { |
949 | { |
851 | // need to check first, because the checks below might segfault |
950 | // need to check first, because the checks below might segfault |
852 | // as we might be on an invalid mapspace and crossfire code |
951 | // as we might be on an invalid mapspace and crossfire code |
853 | // is too buggy to ensure that the inventory is empty. |
952 | // is too buggy to ensure that the inventory is empty. |
854 | // corollary: if you create arrows etc. with stuff in tis inventory, |
953 | // corollary: if you create arrows etc. with stuff in its inventory, |
855 | // cf will crash below with off-map x and y |
954 | // cf will crash below with off-map x and y |
856 | if (!inv) |
955 | if (!inv) |
857 | return; |
956 | return; |
858 | |
957 | |
859 | /* Only if the space blocks everything do we not process - |
958 | /* Only if the space blocks everything do we not process - |
860 | * if some form of movement is allowed, let objects |
959 | * if some form of movement is allowed, let objects |
861 | * drop on that space. |
960 | * drop on that space. |
862 | */ |
961 | */ |
863 | if (!drop_to_ground |
962 | if (!drop_to_ground |
864 | || !map |
963 | || !map |
865 | || map->in_memory != MAP_IN_MEMORY |
964 | || map->in_memory != MAP_ACTIVE |
866 | || map->nodrop |
965 | || map->no_drop |
867 | || ms ().move_block == MOVE_ALL) |
966 | || ms ().move_block == MOVE_ALL) |
868 | { |
967 | { |
869 | while (inv) |
968 | while (inv) |
870 | { |
|
|
871 | inv->destroy_inv (drop_to_ground); |
|
|
872 | inv->destroy (); |
969 | inv->destroy (); |
873 | } |
|
|
874 | } |
970 | } |
875 | else |
971 | else |
876 | { /* Put objects in inventory onto this space */ |
972 | { /* Put objects in inventory onto this space */ |
877 | while (inv) |
973 | while (inv) |
878 | { |
974 | { |
… | |
… | |
896 | object *op = new object; |
992 | object *op = new object; |
897 | op->link (); |
993 | op->link (); |
898 | return op; |
994 | return op; |
899 | } |
995 | } |
900 | |
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 | |
901 | void |
1018 | void |
902 | object::do_destroy () |
1019 | object::do_destroy () |
903 | { |
1020 | { |
904 | attachable::do_destroy (); |
|
|
905 | |
|
|
906 | if (flag [FLAG_IS_LINKED]) |
1021 | if (flag [FLAG_IS_LINKED]) |
907 | remove_button_link (this); |
1022 | remove_link (); |
908 | |
1023 | |
909 | if (flag [FLAG_FRIENDLY]) |
1024 | if (flag [FLAG_FRIENDLY]) |
910 | remove_friendly_object (this); |
1025 | remove_friendly_object (this); |
911 | |
1026 | |
912 | if (!flag [FLAG_REMOVED]) |
|
|
913 | remove (); |
1027 | remove (); |
914 | |
1028 | |
915 | destroy_inv (true); |
1029 | attachable::do_destroy (); |
916 | |
1030 | |
917 | deactivate (); |
1031 | deactivate (); |
918 | unlink (); |
1032 | unlink (); |
919 | |
1033 | |
920 | flag [FLAG_FREED] = 1; |
1034 | flag [FLAG_FREED] = 1; |
921 | |
1035 | |
922 | // hack to ensure that freed objects still have a valid map |
1036 | // hack to ensure that freed objects still have a valid map |
923 | { |
|
|
924 | static maptile *freed_map; // freed objects are moved here to avoid crashes |
|
|
925 | |
|
|
926 | if (!freed_map) |
|
|
927 | { |
|
|
928 | freed_map = new maptile; |
|
|
929 | |
|
|
930 | freed_map->path = "<freed objects map>"; |
|
|
931 | freed_map->name = "/internal/freed_objects_map"; |
|
|
932 | freed_map->width = 3; |
|
|
933 | freed_map->height = 3; |
|
|
934 | |
|
|
935 | freed_map->alloc (); |
|
|
936 | freed_map->in_memory = MAP_IN_MEMORY; |
|
|
937 | } |
|
|
938 | |
|
|
939 | map = freed_map; |
1037 | map = &freed_map; |
940 | x = 1; |
1038 | x = 1; |
941 | y = 1; |
1039 | y = 1; |
942 | } |
|
|
943 | |
1040 | |
944 | if (more) |
1041 | if (more) |
945 | { |
1042 | { |
946 | more->destroy (); |
1043 | more->destroy (); |
947 | more = 0; |
1044 | more = 0; |
… | |
… | |
955 | attacked_by = 0; |
1052 | attacked_by = 0; |
956 | current_weapon = 0; |
1053 | current_weapon = 0; |
957 | } |
1054 | } |
958 | |
1055 | |
959 | void |
1056 | void |
960 | object::destroy (bool destroy_inventory) |
1057 | object::destroy () |
961 | { |
1058 | { |
962 | if (destroyed ()) |
1059 | if (destroyed ()) |
963 | return; |
1060 | return; |
964 | |
1061 | |
965 | 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 | |
966 | destroy_inv (false); |
1069 | destroy_inv (false); |
967 | |
1070 | |
968 | if (is_head ()) |
1071 | if (is_head ()) |
969 | if (sound_destroy) |
1072 | if (sound_destroy) |
970 | play_sound (sound_destroy); |
1073 | play_sound (sound_destroy); |
971 | else if (flag [FLAG_MONSTER]) |
1074 | else if (flag [FLAG_MONSTER]) |
972 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
1075 | play_sound (sound_find ("monster_destroy")); // quick hack, too lazy to create a generic mechanism |
973 | |
1076 | |
974 | attachable::destroy (); |
1077 | attachable::destroy (); |
975 | } |
|
|
976 | |
|
|
977 | /* |
|
|
978 | * sub_weight() recursively (outwards) subtracts a number from the |
|
|
979 | * weight of an object (and what is carried by it's environment(s)). |
|
|
980 | */ |
|
|
981 | void |
|
|
982 | sub_weight (object *op, signed long weight) |
|
|
983 | { |
|
|
984 | while (op != NULL) |
|
|
985 | { |
|
|
986 | if (op->type == CONTAINER) |
|
|
987 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
988 | |
|
|
989 | op->carrying -= weight; |
|
|
990 | op = op->env; |
|
|
991 | } |
|
|
992 | } |
1078 | } |
993 | |
1079 | |
994 | /* op->remove (): |
1080 | /* op->remove (): |
995 | * 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 |
996 | * 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 |
… | |
… | |
999 | * the previous environment. |
1085 | * the previous environment. |
1000 | */ |
1086 | */ |
1001 | void |
1087 | void |
1002 | object::do_remove () |
1088 | object::do_remove () |
1003 | { |
1089 | { |
1004 | object *tmp, *last = 0; |
1090 | if (flag [FLAG_REMOVED]) |
1005 | object *otmp; |
|
|
1006 | |
|
|
1007 | if (QUERY_FLAG (this, FLAG_REMOVED)) |
|
|
1008 | return; |
1091 | return; |
1009 | |
1092 | |
1010 | SET_FLAG (this, FLAG_REMOVED); |
|
|
1011 | INVOKE_OBJECT (REMOVE, this); |
1093 | INVOKE_OBJECT (REMOVE, this); |
|
|
1094 | |
|
|
1095 | flag [FLAG_REMOVED] = true; |
1012 | |
1096 | |
1013 | if (more) |
1097 | if (more) |
1014 | more->remove (); |
1098 | more->remove (); |
1015 | |
1099 | |
1016 | /* |
1100 | /* |
1017 | * In this case, the object to be removed is in someones |
1101 | * In this case, the object to be removed is in someones |
1018 | * inventory. |
1102 | * inventory. |
1019 | */ |
1103 | */ |
1020 | if (env) |
1104 | if (env) |
1021 | { |
1105 | { |
1022 | if (nrof) |
1106 | flag [FLAG_REMOVED] = false; // hack around the issue of visible_to checking flag_removed |
1023 | sub_weight (env, weight * nrof); |
1107 | if (object *pl = visible_to ()) |
1024 | else |
1108 | esrv_del_item (pl->contr, count); |
1025 | 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; |
1026 | |
1130 | |
1027 | /* 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 |
1028 | * made to players inventory. If set, avoiding the call |
1132 | * made to players inventory. If set, avoiding the call |
1029 | * to save cpu time. |
1133 | * to save cpu time. |
1030 | */ |
1134 | */ |
1031 | 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 | { |
1032 | otmp->update_stats (); |
1138 | pl->update_stats (); |
1033 | |
1139 | |
1034 | if (above) |
1140 | if (glow_radius && pl->is_on_map ()) |
1035 | above->below = below; |
1141 | update_all_los (pl->map, pl->x, pl->y); |
1036 | else |
1142 | } |
1037 | env->inv = below; |
|
|
1038 | |
|
|
1039 | if (below) |
|
|
1040 | below->above = above; |
|
|
1041 | |
|
|
1042 | /* we set up values so that it could be inserted into |
|
|
1043 | * the map, but we don't actually do that - it is up |
|
|
1044 | * to the caller to decide what we want to do. |
|
|
1045 | */ |
|
|
1046 | x = env->x, y = env->y; |
|
|
1047 | map = env->map; |
|
|
1048 | above = 0, below = 0; |
|
|
1049 | env = 0; |
|
|
1050 | } |
1143 | } |
1051 | else if (map) |
1144 | else if (map) |
1052 | { |
1145 | { |
1053 | if (type == PLAYER) |
|
|
1054 | { |
|
|
1055 | // leaving a spot always closes any open container on the ground |
|
|
1056 | if (container && !container->env) |
|
|
1057 | // this causes spurious floorbox updates, but it ensures |
|
|
1058 | // that the CLOSE event is being sent. |
|
|
1059 | close_container (); |
|
|
1060 | |
|
|
1061 | --map->players; |
|
|
1062 | map->touch (); |
|
|
1063 | } |
|
|
1064 | |
|
|
1065 | map->dirty = true; |
1146 | map->dirty = true; |
1066 | mapspace &ms = this->ms (); |
1147 | mapspace &ms = this->ms (); |
1067 | |
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 | |
1068 | /* link the object above us */ |
1174 | /* link the object above us */ |
1069 | if (above) |
1175 | // re-link, make sure compiler can easily use cmove |
1070 | above->below = below; |
1176 | *(above ? &above->below : &ms.top) = below; |
1071 | else |
1177 | *(below ? &below->above : &ms.bot) = above; |
1072 | ms.top = below; /* we were top, set new top */ |
|
|
1073 | |
|
|
1074 | /* Relink the object below us, if there is one */ |
|
|
1075 | if (below) |
|
|
1076 | below->above = above; |
|
|
1077 | else |
|
|
1078 | { |
|
|
1079 | /* Nothing below, which means we need to relink map object for this space |
|
|
1080 | * use translated coordinates in case some oddness with map tiling is |
|
|
1081 | * evident |
|
|
1082 | */ |
|
|
1083 | if (GET_MAP_OB (map, x, y) != this) |
|
|
1084 | 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 ()); |
|
|
1085 | |
|
|
1086 | ms.bot = above; /* goes on above it. */ |
|
|
1087 | } |
|
|
1088 | |
1178 | |
1089 | above = 0; |
1179 | above = 0; |
1090 | below = 0; |
1180 | below = 0; |
1091 | |
1181 | |
|
|
1182 | ms.invalidate (); |
|
|
1183 | |
1092 | if (map->in_memory == MAP_SAVING) |
1184 | if (map->in_memory == MAP_SAVING) |
1093 | return; |
1185 | return; |
1094 | |
1186 | |
1095 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1187 | int check_walk_off = !flag [FLAG_NO_APPLY]; |
1096 | |
1188 | |
1097 | if (object *pl = ms.player ()) |
1189 | if (object *pl = ms.player ()) |
1098 | { |
1190 | { |
1099 | if (pl->container == this) |
1191 | if (pl->container_ () == this) |
1100 | /* If a container that the player is currently using somehow gets |
1192 | /* If a container that the player is currently using somehow gets |
1101 | * removed (most likely destroyed), update the player view |
1193 | * removed (most likely destroyed), update the player view |
1102 | * appropriately. |
1194 | * appropriately. |
1103 | */ |
1195 | */ |
1104 | pl->close_container (); |
1196 | pl->close_container (); |
1105 | |
1197 | |
|
|
1198 | //TODO: the floorbox prev/next might need updating |
|
|
1199 | //esrv_del_item (pl->contr, count); |
|
|
1200 | //TODO: update floorbox to preserve ordering |
|
|
1201 | if (pl->contr->ns) |
1106 | pl->contr->ns->floorbox_update (); |
1202 | pl->contr->ns->floorbox_update (); |
1107 | } |
1203 | } |
1108 | |
1204 | |
|
|
1205 | if (check_walk_off) |
1109 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
1206 | for (object *above, *tmp = ms.bot; tmp; tmp = above) |
1110 | { |
1207 | { |
|
|
1208 | above = tmp->above; |
|
|
1209 | |
1111 | /* No point updating the players look faces if he is the object |
1210 | /* No point updating the players look faces if he is the object |
1112 | * being removed. |
1211 | * being removed. |
1113 | */ |
1212 | */ |
1114 | |
1213 | |
1115 | /* See if object moving off should effect something */ |
1214 | /* See if object moving off should effect something */ |
1116 | if (check_walk_off |
|
|
1117 | && ((move_type & tmp->move_off) |
1215 | if ((move_type & tmp->move_off) |
1118 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0)) |
1216 | && (move_type & ~tmp->move_off & ~tmp->move_block) == 0) |
1119 | { |
|
|
1120 | move_apply (tmp, this, 0); |
1217 | move_apply (tmp, this, 0); |
1121 | |
|
|
1122 | if (destroyed ()) |
|
|
1123 | LOG (llevError, "BUG: remove_ob(): name %s, destroyed leaving object\n", tmp->debug_desc ()); |
|
|
1124 | } |
1218 | } |
1125 | |
1219 | |
1126 | last = tmp; |
1220 | if (affects_los ()) |
1127 | } |
|
|
1128 | |
|
|
1129 | /* last == NULL if there are no objects on this space */ |
|
|
1130 | //TODO: this makes little sense, why only update the topmost object? |
|
|
1131 | if (!last) |
|
|
1132 | map->at (x, y).flags_ = 0; |
|
|
1133 | else |
|
|
1134 | update_object (last, UP_OBJ_REMOVE); |
|
|
1135 | |
|
|
1136 | if (flag [FLAG_BLOCKSVIEW] || glow_radius) |
|
|
1137 | update_all_los (map, x, y); |
1221 | update_all_los (map, x, y); |
1138 | } |
1222 | } |
1139 | } |
1223 | } |
1140 | |
1224 | |
1141 | /* |
1225 | /* |
… | |
… | |
1155 | if (!top) |
1239 | if (!top) |
1156 | for (top = op; top && top->above; top = top->above) |
1240 | for (top = op; top && top->above; top = top->above) |
1157 | ; |
1241 | ; |
1158 | |
1242 | |
1159 | for (; top; top = top->below) |
1243 | for (; top; top = top->below) |
1160 | { |
|
|
1161 | if (top == op) |
|
|
1162 | continue; |
|
|
1163 | |
|
|
1164 | if (object::can_merge (op, top)) |
1244 | if (object::can_merge (op, top)) |
1165 | { |
1245 | { |
1166 | top->nrof += op->nrof; |
1246 | top->nrof += op->nrof; |
1167 | |
1247 | |
1168 | /* CLEAR_FLAG(top,FLAG_STARTEQUIP);*/ |
1248 | if (object *pl = top->visible_to ()) |
1169 | 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 | |
1170 | op->destroy (); |
1254 | op->destroy (); |
|
|
1255 | |
1171 | return top; |
1256 | return top; |
1172 | } |
1257 | } |
1173 | } |
|
|
1174 | |
1258 | |
1175 | return 0; |
1259 | return 0; |
1176 | } |
1260 | } |
1177 | |
1261 | |
1178 | void |
1262 | void |
… | |
… | |
1203 | * job preparing multi-part monsters. |
1287 | * job preparing multi-part monsters. |
1204 | */ |
1288 | */ |
1205 | object * |
1289 | object * |
1206 | 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) |
1207 | { |
1291 | { |
|
|
1292 | op->remove (); |
|
|
1293 | |
1208 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1294 | for (object *tmp = op->head_ (); tmp; tmp = tmp->more) |
1209 | { |
1295 | { |
1210 | tmp->x = x + tmp->arch->x; |
1296 | tmp->x = x + tmp->arch->x; |
1211 | tmp->y = y + tmp->arch->y; |
1297 | tmp->y = y + tmp->arch->y; |
1212 | } |
1298 | } |
… | |
… | |
1235 | * just 'op' otherwise |
1321 | * just 'op' otherwise |
1236 | */ |
1322 | */ |
1237 | object * |
1323 | object * |
1238 | 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) |
1239 | { |
1325 | { |
1240 | assert (!op->flag [FLAG_FREED]); |
|
|
1241 | |
|
|
1242 | object *top, *floor = NULL; |
|
|
1243 | |
|
|
1244 | op->remove (); |
1326 | op->remove (); |
|
|
1327 | |
|
|
1328 | if (m == &freed_map)//D TODO: remove soon |
|
|
1329 | {//D |
|
|
1330 | LOG (llevError | logBacktrace, "tries to insret object on freed objects map: %s", op->debug_desc ());//D |
|
|
1331 | }//D |
1245 | |
1332 | |
1246 | /* Ideally, the caller figures this out. However, it complicates a lot |
1333 | /* Ideally, the caller figures this out. However, it complicates a lot |
1247 | * 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 |
1248 | * need extra work |
1335 | * need extra work |
1249 | */ |
1336 | */ |
|
|
1337 | maptile *newmap = m; |
1250 | if (!xy_normalise (m, op->x, op->y)) |
1338 | if (!xy_normalise (newmap, op->x, op->y)) |
1251 | { |
1339 | { |
1252 | op->destroy (); |
1340 | op->head_ ()->destroy ();// remove head_ once all tail object destroyers found |
1253 | return 0; |
1341 | return 0; |
1254 | } |
1342 | } |
1255 | |
1343 | |
1256 | if (object *more = op->more) |
1344 | if (object *more = op->more) |
1257 | if (!insert_ob_in_map (more, m, originator, flag)) |
1345 | if (!insert_ob_in_map (more, m, originator, flag)) |
1258 | return 0; |
1346 | return 0; |
1259 | |
1347 | |
1260 | CLEAR_FLAG (op, FLAG_REMOVED); |
1348 | op->flag [FLAG_REMOVED] = false; |
1261 | |
1349 | op->env = 0; |
1262 | op->map = m; |
1350 | op->map = newmap; |
|
|
1351 | |
1263 | mapspace &ms = op->ms (); |
1352 | mapspace &ms = op->ms (); |
1264 | |
1353 | |
1265 | /* this has to be done after we translate the coordinates. |
1354 | /* this has to be done after we translate the coordinates. |
1266 | */ |
1355 | */ |
1267 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1356 | if (op->nrof && !(flag & INS_NO_MERGE)) |
1268 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1357 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1269 | if (object::can_merge (op, tmp)) |
1358 | if (object::can_merge (op, tmp)) |
1270 | { |
1359 | { |
|
|
1360 | // TODO: we actually want to update tmp, not op, |
|
|
1361 | // but some caller surely breaks when we return tmp |
|
|
1362 | // from here :/ |
1271 | op->nrof += tmp->nrof; |
1363 | op->nrof += tmp->nrof; |
1272 | tmp->destroy (); |
1364 | tmp->destroy (); |
1273 | } |
1365 | } |
1274 | |
1366 | |
1275 | 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 */ |
… | |
… | |
1284 | { |
1376 | { |
1285 | 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"); |
1286 | abort (); |
1378 | abort (); |
1287 | } |
1379 | } |
1288 | |
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 | |
1289 | op->above = originator; |
1388 | op->above = originator; |
1290 | op->below = originator->below; |
1389 | op->below = originator->below; |
1291 | |
|
|
1292 | if (op->below) |
|
|
1293 | op->below->above = op; |
|
|
1294 | else |
|
|
1295 | ms.bot = op; |
|
|
1296 | |
|
|
1297 | /* since *below* originator, no need to update top */ |
|
|
1298 | originator->below = op; |
1390 | originator->below = op; |
|
|
1391 | |
|
|
1392 | *(op->below ? &op->below->above : &ms.bot) = op; |
1299 | } |
1393 | } |
1300 | else |
1394 | else |
1301 | { |
1395 | { |
1302 | top = ms.bot; |
1396 | object *floor = 0; |
|
|
1397 | object *top = ms.top; |
1303 | |
1398 | |
1304 | /* If there are other objects, then */ |
1399 | /* If there are other objects, then */ |
1305 | if (top) |
1400 | if (top) |
1306 | { |
1401 | { |
1307 | object *last = 0; |
|
|
1308 | |
|
|
1309 | /* |
1402 | /* |
1310 | * 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. |
1311 | * We've already dealt with merging if appropriate. |
1404 | * We've already dealt with merging if appropriate. |
1312 | * 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 |
1313 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
1406 | * flag contains INS_ABOVE_FLOOR_ONLY, once we find the last |
… | |
… | |
1316 | * 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 |
1317 | * 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 |
1318 | * 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 |
1319 | * that flying non pickable objects are spell objects. |
1412 | * that flying non pickable objects are spell objects. |
1320 | */ |
1413 | */ |
1321 | for (top = ms.bot; top; top = top->above) |
1414 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
1322 | { |
1415 | { |
1323 | 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)) |
1324 | floor = top; |
1417 | floor = tmp; |
1325 | |
1418 | |
1326 | 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)) |
1327 | { |
1420 | { |
1328 | /* We insert above top, so we want this object below this */ |
1421 | /* We insert above top, so we want this object below this */ |
1329 | top = top->below; |
1422 | top = tmp->below; |
1330 | break; |
1423 | break; |
1331 | } |
1424 | } |
1332 | |
1425 | |
1333 | last = top; |
1426 | top = tmp; |
1334 | } |
1427 | } |
1335 | |
|
|
1336 | /* Don't want top to be NULL, so set it to the last valid object */ |
|
|
1337 | top = last; |
|
|
1338 | |
1428 | |
1339 | /* We let update_position deal with figuring out what the space |
1429 | /* We let update_position deal with figuring out what the space |
1340 | * looks like instead of lots of conditions here. |
1430 | * looks like instead of lots of conditions here. |
1341 | * makes things faster, and effectively the same result. |
1431 | * makes things faster, and effectively the same result. |
1342 | */ |
1432 | */ |
… | |
… | |
1349 | */ |
1439 | */ |
1350 | if (!(flag & INS_ON_TOP) |
1440 | if (!(flag & INS_ON_TOP) |
1351 | && ms.flags () & P_BLOCKSVIEW |
1441 | && ms.flags () & P_BLOCKSVIEW |
1352 | && (op->face && !faces [op->face].visibility)) |
1442 | && (op->face && !faces [op->face].visibility)) |
1353 | { |
1443 | { |
|
|
1444 | object *last; |
|
|
1445 | |
1354 | for (last = top; last != floor; last = last->below) |
1446 | for (last = top; last != floor; last = last->below) |
1355 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1447 | if (QUERY_FLAG (last, FLAG_BLOCKSVIEW) && (last->type != EXIT)) |
1356 | break; |
1448 | break; |
1357 | |
1449 | |
1358 | /* Check to see if we found the object that blocks view, |
1450 | /* Check to see if we found the object that blocks view, |
… | |
… | |
1366 | } /* If objects on this space */ |
1458 | } /* If objects on this space */ |
1367 | |
1459 | |
1368 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1460 | if (flag & INS_ABOVE_FLOOR_ONLY) |
1369 | top = floor; |
1461 | top = floor; |
1370 | |
1462 | |
1371 | /* 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 |
1372 | */ |
|
|
1373 | |
|
|
1374 | /* First object on this space */ |
|
|
1375 | if (!top) |
1464 | if (!top) |
1376 | { |
1465 | { |
|
|
1466 | op->below = 0; |
1377 | op->above = ms.bot; |
1467 | op->above = ms.bot; |
1378 | |
|
|
1379 | if (op->above) |
|
|
1380 | op->above->below = op; |
|
|
1381 | |
|
|
1382 | op->below = 0; |
|
|
1383 | ms.bot = op; |
1468 | ms.bot = op; |
|
|
1469 | |
|
|
1470 | *(op->above ? &op->above->below : &ms.top) = op; |
1384 | } |
1471 | } |
1385 | else |
1472 | else |
1386 | { /* get inserted into the stack above top */ |
1473 | { |
1387 | op->above = top->above; |
1474 | op->above = top->above; |
1388 | |
|
|
1389 | if (op->above) |
|
|
1390 | op->above->below = op; |
1475 | top->above = op; |
1391 | |
1476 | |
1392 | op->below = top; |
1477 | op->below = top; |
1393 | top->above = op; |
1478 | *(op->above ? &op->above->below : &ms.top) = op; |
1394 | } |
1479 | } |
|
|
1480 | } |
1395 | |
1481 | |
1396 | if (!op->above) |
1482 | if (op->is_player ()) |
1397 | ms.top = op; |
|
|
1398 | } /* else not INS_BELOW_ORIGINATOR */ |
|
|
1399 | |
|
|
1400 | if (op->type == PLAYER) |
|
|
1401 | { |
1483 | { |
1402 | op->contr->do_los = 1; |
1484 | op->contr->do_los = 1; |
1403 | ++op->map->players; |
1485 | ++op->map->players; |
1404 | op->map->touch (); |
1486 | op->map->touch (); |
1405 | } |
1487 | } |
1406 | |
1488 | |
1407 | op->map->dirty = true; |
1489 | op->map->dirty = true; |
1408 | |
1490 | |
1409 | 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 |
|
|
1495 | if (pl->contr->ns) |
1410 | pl->contr->ns->floorbox_update (); |
1496 | pl->contr->ns->floorbox_update (); |
1411 | |
1497 | |
1412 | /* If this object glows, it may affect lighting conditions that are |
1498 | /* If this object glows, it may affect lighting conditions that are |
1413 | * 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 |
1414 | * 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 |
1415 | * on the map will get recalculated. The players could very well |
1501 | * on the map will get recalculated. The players could very well |
1416 | * 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 - |
1417 | * this should get redone to only look for players within range, |
1503 | * this should get redone to only look for players within range, |
1418 | * or just updating the P_UPTODATE for spaces within this area |
1504 | * or just updating the P_UPTODATE for spaces within this area |
1419 | * of effect may be sufficient. |
1505 | * of effect may be sufficient. |
1420 | */ |
1506 | */ |
1421 | if (op->map->darkness && (op->glow_radius != 0)) |
1507 | if (op->affects_los ()) |
|
|
1508 | { |
|
|
1509 | op->ms ().invalidate (); |
1422 | update_all_los (op->map, op->x, op->y); |
1510 | update_all_los (op->map, op->x, op->y); |
|
|
1511 | } |
1423 | |
1512 | |
1424 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1513 | /* updates flags (blocked, alive, no magic, etc) for this map space */ |
1425 | update_object (op, UP_OBJ_INSERT); |
1514 | update_object (op, UP_OBJ_INSERT); |
1426 | |
1515 | |
1427 | INVOKE_OBJECT (INSERT, op); |
1516 | INVOKE_OBJECT (INSERT, op); |
… | |
… | |
1434 | * blocked() and wall() work properly), and these flags are updated by |
1523 | * blocked() and wall() work properly), and these flags are updated by |
1435 | * update_object(). |
1524 | * update_object(). |
1436 | */ |
1525 | */ |
1437 | |
1526 | |
1438 | /* 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 */ |
1439 | if (!(flag & INS_NO_WALK_ON) && op->head_ () == op) |
1528 | if (!(flag & INS_NO_WALK_ON) && op->is_head ()) |
1440 | { |
1529 | { |
1441 | if (check_move_on (op, originator)) |
1530 | if (check_move_on (op, originator)) |
1442 | return 0; |
1531 | return 0; |
1443 | |
1532 | |
1444 | /* 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 |
… | |
… | |
1455 | /* this function inserts an object in the map, but if it |
1544 | /* this function inserts an object in the map, but if it |
1456 | * 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. |
1457 | * 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. |
1458 | */ |
1547 | */ |
1459 | void |
1548 | void |
1460 | replace_insert_ob_in_map (const char *arch_string, object *op) |
1549 | replace_insert_ob_in_map (shstr_tmp archname, object *op) |
1461 | { |
1550 | { |
1462 | object *tmp, *tmp1; |
|
|
1463 | |
|
|
1464 | /* first search for itself and remove any old instances */ |
1551 | /* first search for itself and remove any old instances */ |
1465 | |
1552 | |
1466 | for (tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1553 | for (object *tmp = op->ms ().bot; tmp; tmp = tmp->above) |
1467 | if (!strcmp (tmp->arch->archname, arch_string)) /* same archetype */ |
1554 | if (tmp->arch->archname == archname) /* same archetype */ |
1468 | tmp->destroy (); |
1555 | tmp->destroy (); |
1469 | |
1556 | |
1470 | tmp1 = arch_to_object (archetype::find (arch_string)); |
1557 | object *tmp = arch_to_object (archetype::find (archname)); |
1471 | |
1558 | |
1472 | tmp1->x = op->x; |
1559 | tmp->x = op->x; |
1473 | tmp1->y = op->y; |
1560 | tmp->y = op->y; |
|
|
1561 | |
1474 | insert_ob_in_map (tmp1, op->map, op, 0); |
1562 | insert_ob_in_map (tmp, op->map, op, 0); |
1475 | } |
1563 | } |
1476 | |
1564 | |
1477 | object * |
1565 | object * |
1478 | object::insert_at (object *where, object *originator, int flags) |
1566 | object::insert_at (object *where, object *originator, int flags) |
1479 | { |
1567 | { |
|
|
1568 | if (where->env) |
|
|
1569 | return where->env->insert (this); |
|
|
1570 | else |
1480 | return where->map->insert (this, where->x, where->y, originator, flags); |
1571 | return where->map->insert (this, where->x, where->y, originator, flags); |
1481 | } |
1572 | } |
1482 | |
1573 | |
1483 | /* |
1574 | // check whether we can put this into the map, respect max_volume, max_items |
1484 | * get_split_ob(ob,nr) splits up ob into two parts. The part which |
1575 | bool |
1485 | * is returned contains nr objects, and the remaining parts contains |
1576 | object::can_drop_at (maptile *m, int x, int y, object *originator) |
1486 | * the rest (or is removed and freed if that number is 0). |
|
|
1487 | * On failure, NULL is returned, and the reason put into the |
|
|
1488 | * global static errmsg array. |
|
|
1489 | */ |
|
|
1490 | object * |
|
|
1491 | get_split_ob (object *orig_ob, uint32 nr) |
|
|
1492 | { |
1577 | { |
1493 | object *newob; |
1578 | mapspace &ms = m->at (x, y); |
1494 | int is_removed = (QUERY_FLAG (orig_ob, FLAG_REMOVED) != 0); |
|
|
1495 | |
1579 | |
1496 | if (orig_ob->nrof < nr) |
1580 | int items = ms.items (); |
1497 | { |
|
|
1498 | sprintf (errmsg, "There are only %d %ss.", orig_ob->nrof ? orig_ob->nrof : 1, &orig_ob->name); |
|
|
1499 | return NULL; |
|
|
1500 | } |
|
|
1501 | |
1581 | |
1502 | 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; |
1503 | |
1586 | |
1504 | if ((orig_ob->nrof -= nr) < 1) |
1587 | if (originator && originator->is_player ()) |
1505 | orig_ob->destroy (1); |
1588 | originator->contr->failmsg (format ( |
1506 | 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.>", |
1507 | { |
1590 | query_name () |
1508 | if (orig_ob->env != NULL) |
1591 | )); |
1509 | sub_weight (orig_ob->env, orig_ob->weight * nr); |
|
|
1510 | if (orig_ob->env == NULL && orig_ob->map->in_memory != MAP_IN_MEMORY) |
|
|
1511 | { |
|
|
1512 | strcpy (errmsg, "Tried to split object whose map is not in memory."); |
|
|
1513 | LOG (llevDebug, "Error, Tried to split object whose map is not in memory.\n"); |
|
|
1514 | return NULL; |
|
|
1515 | } |
|
|
1516 | } |
|
|
1517 | |
1592 | |
1518 | newob->nrof = nr; |
1593 | return false; |
1519 | |
|
|
1520 | return newob; |
|
|
1521 | } |
1594 | } |
1522 | |
1595 | |
1523 | /* |
1596 | /* |
1524 | * decrease_ob_nr(object, number) decreases a specified number from |
1597 | * decrease(object, number) decreases a specified number from |
1525 | * 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 |
1526 | * is subsequently removed and freed. |
1599 | * is subsequently removed and freed. |
1527 | * |
1600 | * |
1528 | * 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 |
1529 | */ |
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 | */ |
1530 | object * |
1634 | object * |
1531 | decrease_ob_nr (object *op, uint32 i) |
1635 | object::split (sint32 nr) |
1532 | { |
1636 | { |
1533 | object *tmp; |
1637 | int have = number_of (); |
1534 | |
1638 | |
1535 | if (i == 0) /* objects with op->nrof require this check */ |
1639 | if (have < nr) |
1536 | return op; |
1640 | return 0; |
1537 | |
1641 | else if (have == nr) |
1538 | if (i > op->nrof) |
|
|
1539 | i = op->nrof; |
|
|
1540 | |
|
|
1541 | if (QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1542 | op->nrof -= i; |
|
|
1543 | else if (op->env) |
|
|
1544 | { |
1642 | { |
1545 | /* is this object in the players inventory, or sub container |
|
|
1546 | * therein? |
|
|
1547 | */ |
|
|
1548 | tmp = op->in_player (); |
|
|
1549 | /* nope. Is this a container the player has opened? |
|
|
1550 | * If so, set tmp to that player. |
|
|
1551 | * IMO, searching through all the players will mostly |
|
|
1552 | * likely be quicker than following op->env to the map, |
|
|
1553 | * and then searching the map for a player. |
|
|
1554 | */ |
|
|
1555 | if (!tmp) |
|
|
1556 | for_all_players (pl) |
|
|
1557 | if (pl->ob->container == op->env) |
|
|
1558 | { |
|
|
1559 | tmp = pl->ob; |
|
|
1560 | break; |
|
|
1561 | } |
|
|
1562 | |
|
|
1563 | if (i < op->nrof) |
|
|
1564 | { |
|
|
1565 | sub_weight (op->env, op->weight * i); |
|
|
1566 | op->nrof -= i; |
|
|
1567 | if (tmp) |
|
|
1568 | esrv_send_item (tmp, op); |
|
|
1569 | } |
|
|
1570 | else |
|
|
1571 | { |
|
|
1572 | op->remove (); |
1643 | remove (); |
1573 | op->nrof = 0; |
1644 | return this; |
1574 | if (tmp) |
|
|
1575 | esrv_del_item (tmp->contr, op->count); |
|
|
1576 | } |
|
|
1577 | } |
1645 | } |
1578 | else |
1646 | else |
1579 | { |
1647 | { |
1580 | object *above = op->above; |
1648 | decrease (nr); |
1581 | |
1649 | |
1582 | if (i < op->nrof) |
1650 | object *op = deep_clone (); |
1583 | op->nrof -= i; |
1651 | op->nrof = nr; |
1584 | else |
|
|
1585 | { |
|
|
1586 | op->remove (); |
|
|
1587 | op->nrof = 0; |
|
|
1588 | } |
|
|
1589 | |
|
|
1590 | /* Since we just removed op, op->above is null */ |
|
|
1591 | for (tmp = above; tmp; tmp = tmp->above) |
|
|
1592 | if (tmp->type == PLAYER) |
|
|
1593 | { |
|
|
1594 | if (op->nrof) |
|
|
1595 | esrv_send_item (tmp, op); |
|
|
1596 | else |
|
|
1597 | esrv_del_item (tmp->contr, op->count); |
|
|
1598 | } |
|
|
1599 | } |
|
|
1600 | |
|
|
1601 | if (op->nrof) |
|
|
1602 | return op; |
1652 | return op; |
1603 | else |
|
|
1604 | { |
|
|
1605 | op->destroy (); |
|
|
1606 | return 0; |
|
|
1607 | } |
|
|
1608 | } |
|
|
1609 | |
|
|
1610 | /* |
|
|
1611 | * add_weight(object, weight) adds the specified weight to an object, |
|
|
1612 | * and also updates how much the environment(s) is/are carrying. |
|
|
1613 | */ |
|
|
1614 | void |
|
|
1615 | add_weight (object *op, signed long weight) |
|
|
1616 | { |
|
|
1617 | while (op != NULL) |
|
|
1618 | { |
|
|
1619 | if (op->type == CONTAINER) |
|
|
1620 | weight = (signed long) (weight * (100 - op->stats.Str) / 100); |
|
|
1621 | |
|
|
1622 | op->carrying += weight; |
|
|
1623 | op = op->env; |
|
|
1624 | } |
1653 | } |
1625 | } |
1654 | } |
1626 | |
1655 | |
1627 | object * |
1656 | object * |
1628 | insert_ob_in_ob (object *op, object *where) |
1657 | insert_ob_in_ob (object *op, object *where) |
… | |
… | |
1653 | * be != op, if items are merged. -Tero |
1682 | * be != op, if items are merged. -Tero |
1654 | */ |
1683 | */ |
1655 | object * |
1684 | object * |
1656 | object::insert (object *op) |
1685 | object::insert (object *op) |
1657 | { |
1686 | { |
1658 | if (!QUERY_FLAG (op, FLAG_REMOVED)) |
|
|
1659 | op->remove (); |
|
|
1660 | |
|
|
1661 | if (op->more) |
1687 | if (op->more) |
1662 | { |
1688 | { |
1663 | 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); |
1664 | return op; |
1690 | return op; |
1665 | } |
1691 | } |
1666 | |
1692 | |
1667 | CLEAR_FLAG (op, FLAG_OBJ_ORIGINAL); |
1693 | op->remove (); |
1668 | CLEAR_FLAG (op, FLAG_REMOVED); |
1694 | |
|
|
1695 | op->flag [FLAG_OBJ_ORIGINAL] = 0; |
1669 | |
1696 | |
1670 | if (op->nrof) |
1697 | if (op->nrof) |
1671 | { |
|
|
1672 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1698 | for (object *tmp = inv; tmp; tmp = tmp->below) |
1673 | if (object::can_merge (tmp, op)) |
1699 | if (object::can_merge (tmp, op)) |
1674 | { |
1700 | { |
1675 | /* return the original object and remove inserted object |
1701 | /* return the original object and remove inserted object |
1676 | (client needs the original object) */ |
1702 | (client needs the original object) */ |
1677 | tmp->nrof += op->nrof; |
1703 | tmp->nrof += op->nrof; |
1678 | /* Weight handling gets pretty funky. Since we are adding to |
1704 | |
1679 | * tmp->nrof, we need to increase the weight. |
1705 | if (object *pl = tmp->visible_to ()) |
1680 | */ |
1706 | esrv_update_item (UPD_NROF, pl, tmp); |
|
|
1707 | |
1681 | add_weight (this, op->weight * op->nrof); |
1708 | adjust_weight (this, op->total_weight ()); |
1682 | SET_FLAG (op, FLAG_REMOVED); |
1709 | |
1683 | op->destroy (); /* free the inserted object */ |
1710 | op->destroy (); |
1684 | op = tmp; |
1711 | op = tmp; |
1685 | op->remove (); /* and fix old object's links */ |
1712 | goto inserted; |
1686 | CLEAR_FLAG (op, FLAG_REMOVED); |
|
|
1687 | break; |
|
|
1688 | } |
1713 | } |
1689 | |
1714 | |
1690 | /* I assume combined objects have no inventory |
|
|
1691 | * We add the weight - this object could have just been removed |
|
|
1692 | * (if it was possible to merge). calling remove_ob will subtract |
|
|
1693 | * the weight, so we need to add it in again, since we actually do |
|
|
1694 | * the linking below |
|
|
1695 | */ |
|
|
1696 | add_weight (this, op->weight * op->nrof); |
|
|
1697 | } |
|
|
1698 | else |
|
|
1699 | add_weight (this, (op->weight + op->carrying)); |
|
|
1700 | |
|
|
1701 | if (object *otmp = this->in_player ()) |
|
|
1702 | if (otmp->contr && !QUERY_FLAG (otmp, FLAG_NO_FIX_PLAYER)) |
|
|
1703 | otmp->update_stats (); |
|
|
1704 | |
|
|
1705 | op->owner = 0; // its his/hers now. period. |
1715 | op->owner = 0; // it's his/hers now. period. |
1706 | op->map = 0; |
1716 | op->map = 0; |
|
|
1717 | op->x = 0; |
|
|
1718 | op->y = 0; |
|
|
1719 | |
|
|
1720 | op->above = 0; |
|
|
1721 | op->below = inv; |
1707 | op->env = this; |
1722 | op->env = this; |
1708 | op->above = 0; |
|
|
1709 | op->below = 0; |
|
|
1710 | op->x = op->y = 0; |
|
|
1711 | |
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: |
1712 | /* 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 */ |
1713 | if (op->glow_radius && map) |
1738 | if (op->glow_radius && is_on_map ()) |
1714 | { |
1739 | { |
1715 | #ifdef DEBUG_LIGHTS |
1740 | update_stats (); |
1716 | LOG (llevDebug, " insert_ob_in_ob(): got %s to insert in map/op\n", op->name); |
|
|
1717 | #endif /* DEBUG_LIGHTS */ |
|
|
1718 | if (map->darkness) |
|
|
1719 | update_all_los (map, x, y); |
1741 | update_all_los (map, x, y); |
1720 | } |
|
|
1721 | |
|
|
1722 | /* Client has no idea of ordering so lets not bother ordering it here. |
|
|
1723 | * It sure simplifies this function... |
|
|
1724 | */ |
|
|
1725 | if (!inv) |
|
|
1726 | inv = op; |
|
|
1727 | else |
|
|
1728 | { |
1742 | } |
1729 | op->below = inv; |
1743 | else if (is_player () && !flag [FLAG_NO_FIX_PLAYER]) |
1730 | op->below->above = op; |
1744 | // if this is a player's inventory, update stats |
1731 | inv = op; |
1745 | update_stats (); |
1732 | } |
|
|
1733 | |
1746 | |
1734 | INVOKE_OBJECT (INSERT, this); |
1747 | INVOKE_OBJECT (INSERT, this); |
1735 | |
1748 | |
1736 | return op; |
1749 | return op; |
1737 | } |
1750 | } |
… | |
… | |
1757 | * on top. |
1770 | * on top. |
1758 | */ |
1771 | */ |
1759 | int |
1772 | int |
1760 | check_move_on (object *op, object *originator) |
1773 | check_move_on (object *op, object *originator) |
1761 | { |
1774 | { |
|
|
1775 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
|
|
1776 | return 0; |
|
|
1777 | |
1762 | object *tmp; |
1778 | object *tmp; |
1763 | maptile *m = op->map; |
1779 | maptile *m = op->map; |
1764 | int x = op->x, y = op->y; |
1780 | int x = op->x, y = op->y; |
1765 | |
1781 | |
1766 | MoveType move_on, move_slow, move_block; |
1782 | mapspace &ms = m->at (x, y); |
1767 | |
1783 | |
1768 | if (QUERY_FLAG (op, FLAG_NO_APPLY)) |
1784 | ms.update (); |
1769 | return 0; |
|
|
1770 | |
1785 | |
1771 | move_on = GET_MAP_MOVE_ON (op->map, op->x, op->y); |
1786 | MoveType move_on = ms.move_on; |
1772 | move_slow = GET_MAP_MOVE_SLOW (op->map, op->x, op->y); |
1787 | MoveType move_slow = ms.move_slow; |
1773 | move_block = GET_MAP_MOVE_BLOCK (op->map, op->x, op->y); |
1788 | MoveType move_block = ms.move_block; |
1774 | |
1789 | |
1775 | /* 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, |
1776 | * 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 |
1777 | * 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 |
1778 | * as walking. |
1793 | * as walking. |
… | |
… | |
1789 | return 0; |
1804 | return 0; |
1790 | |
1805 | |
1791 | /* The objects have to be checked from top to bottom. |
1806 | /* The objects have to be checked from top to bottom. |
1792 | * Hence, we first go to the top: |
1807 | * Hence, we first go to the top: |
1793 | */ |
1808 | */ |
1794 | |
1809 | for (object *next, *tmp = ms.top; tmp; tmp = next) |
1795 | for (tmp = op->ms ().bot; tmp && tmp->above; tmp = tmp->above) |
|
|
1796 | { |
|
|
1797 | /* Trim the search when we find the first other spell effect |
|
|
1798 | * this helps performance so that if a space has 50 spell objects, |
|
|
1799 | * we don't need to check all of them. |
|
|
1800 | */ |
|
|
1801 | if ((tmp->move_type & MOVE_FLY_LOW) && QUERY_FLAG (tmp, FLAG_NO_PICK)) |
|
|
1802 | break; |
|
|
1803 | } |
1810 | { |
|
|
1811 | next = tmp->below; |
1804 | |
1812 | |
1805 | for (; tmp; tmp = tmp->below) |
|
|
1806 | { |
|
|
1807 | if (tmp == op) |
1813 | if (tmp == op) |
1808 | continue; /* Can't apply yourself */ |
1814 | continue; /* Can't apply yourself */ |
1809 | |
1815 | |
1810 | /* 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. |
1811 | * Second check makes sure that the movement types not being slowed |
1817 | * Second check makes sure that the movement types not being slowed |
… | |
… | |
1816 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1822 | if (!QUERY_FLAG (op, FLAG_WIZPASS)) |
1817 | { |
1823 | { |
1818 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1824 | if ((!op->move_type && tmp->move_slow & MOVE_WALK) || |
1819 | ((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)) |
1820 | { |
1826 | { |
1821 | |
|
|
1822 | float |
|
|
1823 | diff = tmp->move_slow_penalty * fabs (op->speed); |
1827 | float diff = tmp->move_slow_penalty * fabs (op->speed); |
1824 | |
1828 | |
1825 | if (op->type == PLAYER) |
1829 | if (op->is_player ()) |
1826 | 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)) || |
1827 | (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))) |
1828 | diff /= 4.0; |
1832 | diff /= 4.0; |
1829 | |
1833 | |
1830 | op->speed_left -= diff; |
1834 | op->speed_left -= diff; |
1831 | } |
1835 | } |
1832 | } |
1836 | } |
… | |
… | |
1865 | LOG (llevError, "Present_arch called outside map.\n"); |
1869 | LOG (llevError, "Present_arch called outside map.\n"); |
1866 | return NULL; |
1870 | return NULL; |
1867 | } |
1871 | } |
1868 | |
1872 | |
1869 | 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) |
1870 | if (tmp->arch == at) |
1874 | if (tmp->arch->archname == at->archname) |
1871 | return tmp; |
1875 | return tmp; |
1872 | |
1876 | |
1873 | return NULL; |
1877 | return NULL; |
1874 | } |
1878 | } |
1875 | |
1879 | |
… | |
… | |
1939 | * The first matching object is returned, or NULL if none. |
1943 | * The first matching object is returned, or NULL if none. |
1940 | */ |
1944 | */ |
1941 | object * |
1945 | object * |
1942 | present_arch_in_ob (const archetype *at, const object *op) |
1946 | present_arch_in_ob (const archetype *at, const object *op) |
1943 | { |
1947 | { |
1944 | for (object *tmp = op->inv; tmp != NULL; tmp = tmp->below) |
1948 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
1945 | if (tmp->arch == at) |
1949 | if (tmp->arch->archname == at->archname) |
1946 | return tmp; |
1950 | return tmp; |
1947 | |
1951 | |
1948 | return NULL; |
1952 | return NULL; |
1949 | } |
1953 | } |
1950 | |
1954 | |
… | |
… | |
2012 | |
2016 | |
2013 | /* However, often |
2017 | /* However, often |
2014 | * ob doesn't have any move type (when used to place exits) |
2018 | * ob doesn't have any move type (when used to place exits) |
2015 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
2019 | * so the AND operation in OB_TYPE_MOVE_BLOCK doesn't work. |
2016 | */ |
2020 | */ |
2017 | if (ob->move_type == 0 && ms.move_block != MOVE_ALL) |
2021 | if (ob && ob->move_type == 0 && ms.move_block != MOVE_ALL) |
2018 | { |
2022 | { |
2019 | altern [index++] = i; |
2023 | altern [index++] = i; |
2020 | continue; |
2024 | continue; |
2021 | } |
2025 | } |
2022 | |
2026 | |
… | |
… | |
2038 | * head of the object should correspond for the entire object. |
2042 | * head of the object should correspond for the entire object. |
2039 | */ |
2043 | */ |
2040 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2044 | if (OB_TYPE_MOVE_BLOCK (ob, ms.move_block)) |
2041 | continue; |
2045 | continue; |
2042 | |
2046 | |
2043 | if (ob->blocked (m, pos.x, pos.y)) |
2047 | if (ob->blocked (pos.m, pos.x, pos.y)) |
2044 | continue; |
2048 | continue; |
2045 | |
2049 | |
2046 | altern [index++] = i; |
2050 | altern [index++] = i; |
2047 | } |
2051 | } |
2048 | |
2052 | |
… | |
… | |
2116 | * there is capable of. |
2120 | * there is capable of. |
2117 | */ |
2121 | */ |
2118 | int |
2122 | int |
2119 | find_dir (maptile *m, int x, int y, object *exclude) |
2123 | find_dir (maptile *m, int x, int y, object *exclude) |
2120 | { |
2124 | { |
2121 | int i, max = SIZEOFFREE, mflags; |
2125 | int max = SIZEOFFREE, mflags; |
2122 | |
|
|
2123 | sint16 nx, ny; |
|
|
2124 | object *tmp; |
|
|
2125 | maptile *mp; |
|
|
2126 | |
|
|
2127 | MoveType blocked, move_type; |
2126 | MoveType move_type; |
2128 | |
2127 | |
2129 | if (exclude && exclude->head_ () != exclude) |
2128 | if (exclude && exclude->head_ () != exclude) |
2130 | { |
2129 | { |
2131 | exclude = exclude->head; |
2130 | exclude = exclude->head; |
2132 | move_type = exclude->move_type; |
2131 | move_type = exclude->move_type; |
… | |
… | |
2135 | { |
2134 | { |
2136 | /* 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. */ |
2137 | move_type = MOVE_ALL; |
2136 | move_type = MOVE_ALL; |
2138 | } |
2137 | } |
2139 | |
2138 | |
2140 | for (i = 1; i < max; i++) |
2139 | for (int i = 1; i < max; i++) |
2141 | { |
2140 | { |
2142 | mp = m; |
2141 | mapxy pos (m, x, y); |
2143 | nx = x + freearr_x[i]; |
2142 | pos.move (i); |
2144 | ny = y + freearr_y[i]; |
|
|
2145 | |
2143 | |
2146 | mflags = get_map_flags (m, &mp, nx, ny, &nx, &ny); |
2144 | if (!pos.normalise ()) |
2147 | |
|
|
2148 | if (mflags & P_OUT_OF_MAP) |
|
|
2149 | max = maxfree[i]; |
2145 | max = maxfree[i]; |
2150 | else |
2146 | else |
2151 | { |
2147 | { |
2152 | mapspace &ms = mp->at (nx, ny); |
2148 | mapspace &ms = *pos; |
2153 | |
2149 | |
2154 | blocked = ms.move_block; |
|
|
2155 | |
|
|
2156 | if ((move_type & blocked) == move_type) |
2150 | if ((move_type & ms.move_block) == move_type) |
2157 | max = maxfree[i]; |
2151 | max = maxfree [i]; |
2158 | else if (mflags & P_IS_ALIVE) |
2152 | else if (ms.flags () & P_IS_ALIVE) |
2159 | { |
2153 | { |
2160 | for (tmp = ms.bot; tmp; tmp = tmp->above) |
2154 | for (object *tmp = ms.bot; tmp; tmp = tmp->above) |
2161 | if ((tmp->flag [FLAG_MONSTER] || tmp->type == PLAYER) |
2155 | if ((tmp->flag [FLAG_MONSTER] || tmp->is_player ()) |
2162 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2156 | && (tmp != exclude || (tmp->head_ () != tmp && tmp->head_ () != exclude))) |
2163 | break; |
|
|
2164 | |
|
|
2165 | if (tmp) |
|
|
2166 | return freedir[i]; |
2157 | return freedir [i]; |
2167 | } |
2158 | } |
2168 | } |
2159 | } |
2169 | } |
2160 | } |
2170 | |
2161 | |
2171 | return 0; |
2162 | return 0; |
… | |
… | |
2246 | * 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 |
2247 | * 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. |
2248 | * 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 |
2249 | * functions. |
2240 | * functions. |
2250 | */ |
2241 | */ |
2251 | int reduction_dir[SIZEOFFREE][3] = { |
2242 | static const int reduction_dir[SIZEOFFREE][3] = { |
2252 | {0, 0, 0}, /* 0 */ |
2243 | {0, 0, 0}, /* 0 */ |
2253 | {0, 0, 0}, /* 1 */ |
2244 | {0, 0, 0}, /* 1 */ |
2254 | {0, 0, 0}, /* 2 */ |
2245 | {0, 0, 0}, /* 2 */ |
2255 | {0, 0, 0}, /* 3 */ |
2246 | {0, 0, 0}, /* 3 */ |
2256 | {0, 0, 0}, /* 4 */ |
2247 | {0, 0, 0}, /* 4 */ |
… | |
… | |
2352 | int |
2343 | int |
2353 | can_pick (const object *who, const object *item) |
2344 | can_pick (const object *who, const object *item) |
2354 | { |
2345 | { |
2355 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2346 | return /*QUERY_FLAG(who,FLAG_WIZ)|| */ |
2356 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2347 | (item->weight > 0 && !QUERY_FLAG (item, FLAG_NO_PICK) && |
2357 | !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)); |
2358 | } |
2349 | } |
2359 | |
2350 | |
2360 | /* |
2351 | /* |
2361 | * create clone from object to another |
2352 | * create clone from object to another |
2362 | */ |
2353 | */ |
2363 | object * |
2354 | object * |
2364 | object_create_clone (object *asrc) |
2355 | object::deep_clone () |
2365 | { |
2356 | { |
2366 | object *dst = 0, *tmp, *src, *prev, *item; |
2357 | assert (("deep_clone called on non-head object", is_head ())); |
2367 | |
2358 | |
2368 | if (!asrc) |
2359 | object *dst = clone (); |
2369 | return 0; |
|
|
2370 | |
2360 | |
2371 | src = asrc->head_ (); |
2361 | object *prev = dst; |
2372 | |
|
|
2373 | prev = 0; |
|
|
2374 | for (object *part = src; part; part = part->more) |
2362 | for (object *part = this->more; part; part = part->more) |
2375 | { |
2363 | { |
2376 | tmp = part->clone (); |
2364 | object *tmp = part->clone (); |
2377 | tmp->x -= src->x; |
|
|
2378 | tmp->y -= src->y; |
|
|
2379 | |
|
|
2380 | if (!part->head) |
|
|
2381 | { |
|
|
2382 | dst = tmp; |
|
|
2383 | tmp->head = 0; |
|
|
2384 | } |
|
|
2385 | else |
|
|
2386 | tmp->head = dst; |
2365 | tmp->head = dst; |
2387 | |
|
|
2388 | tmp->more = 0; |
|
|
2389 | |
|
|
2390 | if (prev) |
|
|
2391 | prev->more = tmp; |
2366 | prev->more = tmp; |
2392 | |
|
|
2393 | prev = tmp; |
2367 | prev = tmp; |
2394 | } |
2368 | } |
2395 | |
2369 | |
2396 | for (item = src->inv; item; item = item->below) |
2370 | for (object *item = inv; item; item = item->below) |
2397 | insert_ob_in_ob (object_create_clone (item), dst); |
2371 | insert_ob_in_ob (item->deep_clone (), dst); |
2398 | |
2372 | |
2399 | return dst; |
2373 | return dst; |
2400 | } |
2374 | } |
2401 | |
2375 | |
2402 | /* This returns the first object in who's inventory that |
2376 | /* This returns the first object in who's inventory that |
… | |
… | |
2411 | return tmp; |
2385 | return tmp; |
2412 | |
2386 | |
2413 | return 0; |
2387 | return 0; |
2414 | } |
2388 | } |
2415 | |
2389 | |
2416 | /* If ob has a field named key, return the link from the list, |
2390 | shstr_tmp |
2417 | * otherwise return NULL. |
2391 | object::kv_get (shstr_tmp key) const |
2418 | * |
|
|
2419 | * key must be a passed in shared string - otherwise, this won't |
|
|
2420 | * do the desired thing. |
|
|
2421 | */ |
|
|
2422 | key_value * |
|
|
2423 | get_ob_key_link (const object *ob, const char *key) |
|
|
2424 | { |
2392 | { |
2425 | for (key_value *link = ob->key_values; link; link = link->next) |
2393 | for (key_value *kv = key_values; kv; kv = kv->next) |
2426 | if (link->key == key) |
2394 | if (kv->key == key) |
2427 | return link; |
|
|
2428 | |
|
|
2429 | return 0; |
|
|
2430 | } |
|
|
2431 | |
|
|
2432 | /* |
|
|
2433 | * Returns the value of op has an extra_field for key, or NULL. |
|
|
2434 | * |
|
|
2435 | * The argument doesn't need to be a shared string. |
|
|
2436 | * |
|
|
2437 | * The returned string is shared. |
|
|
2438 | */ |
|
|
2439 | const char * |
|
|
2440 | get_ob_key_value (const object *op, const char *const key) |
|
|
2441 | { |
|
|
2442 | key_value *link; |
|
|
2443 | shstr_cmp canonical_key (key); |
|
|
2444 | |
|
|
2445 | if (!canonical_key) |
|
|
2446 | { |
|
|
2447 | /* 1. There being a field named key on any object |
|
|
2448 | * implies there'd be a shared string to find. |
|
|
2449 | * 2. Since there isn't, no object has this field. |
|
|
2450 | * 3. Therefore, *this* object doesn't have this field. |
|
|
2451 | */ |
|
|
2452 | return 0; |
|
|
2453 | } |
|
|
2454 | |
|
|
2455 | /* This is copied from get_ob_key_link() above - |
|
|
2456 | * only 4 lines, and saves the function call overhead. |
|
|
2457 | */ |
|
|
2458 | for (link = op->key_values; link; link = link->next) |
|
|
2459 | if (link->key == canonical_key) |
|
|
2460 | return link->value; |
2395 | return kv->value; |
2461 | |
2396 | |
2462 | return 0; |
2397 | return shstr (); |
2463 | } |
2398 | } |
2464 | |
2399 | |
2465 | /* |
2400 | void |
2466 | * Updates the canonical_key in op to value. |
2401 | object::kv_set (shstr_tmp key, shstr_tmp value) |
2467 | * |
|
|
2468 | * canonical_key is a shared string (value doesn't have to be). |
|
|
2469 | * |
|
|
2470 | * Unless add_key is TRUE, it won't add fields, only change the value of existing |
|
|
2471 | * keys. |
|
|
2472 | * |
|
|
2473 | * Returns TRUE on success. |
|
|
2474 | */ |
|
|
2475 | int |
|
|
2476 | set_ob_key_value_s (object *op, const shstr & canonical_key, const char *value, int add_key) |
|
|
2477 | { |
2402 | { |
2478 | key_value *field = NULL, *last = NULL; |
2403 | for (key_value *kv = key_values; kv; kv = kv->next) |
2479 | |
2404 | if (kv->key == key) |
2480 | for (field = op->key_values; field != NULL; field = field->next) |
|
|
2481 | { |
|
|
2482 | if (field->key != canonical_key) |
|
|
2483 | { |
2405 | { |
2484 | last = field; |
2406 | kv->value = value; |
2485 | continue; |
2407 | return; |
2486 | } |
2408 | } |
2487 | |
2409 | |
2488 | if (value) |
2410 | key_value *kv = new key_value; |
2489 | field->value = value; |
2411 | |
2490 | 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) |
2491 | { |
2424 | { |
2492 | /* Basically, if the archetype has this key set, |
2425 | key_value *kv = *kvp; |
2493 | * we need to store the null value so when we save |
2426 | *kvp = (*kvp)->next; |
2494 | * it, we save the empty value so that when we load, |
2427 | delete kv; |
2495 | * we get this value back again. |
2428 | return; |
2496 | */ |
|
|
2497 | if (get_ob_key_link (op->arch, canonical_key)) |
|
|
2498 | field->value = 0; |
|
|
2499 | else |
|
|
2500 | { |
|
|
2501 | if (last) |
|
|
2502 | last->next = field->next; |
|
|
2503 | else |
|
|
2504 | op->key_values = field->next; |
|
|
2505 | |
|
|
2506 | delete field; |
|
|
2507 | } |
|
|
2508 | } |
2429 | } |
2509 | return TRUE; |
|
|
2510 | } |
|
|
2511 | /* IF we get here, key doesn't exist */ |
|
|
2512 | |
|
|
2513 | /* No field, we'll have to add it. */ |
|
|
2514 | |
|
|
2515 | if (!add_key) |
|
|
2516 | return FALSE; |
|
|
2517 | |
|
|
2518 | /* There isn't any good reason to store a null |
|
|
2519 | * value in the key/value list. If the archetype has |
|
|
2520 | * this key, then we should also have it, so shouldn't |
|
|
2521 | * be here. If user wants to store empty strings, |
|
|
2522 | * should pass in "" |
|
|
2523 | */ |
|
|
2524 | if (value == NULL) |
|
|
2525 | return TRUE; |
|
|
2526 | |
|
|
2527 | field = new key_value; |
|
|
2528 | |
|
|
2529 | field->key = canonical_key; |
|
|
2530 | field->value = value; |
|
|
2531 | /* Usual prepend-addition. */ |
|
|
2532 | field->next = op->key_values; |
|
|
2533 | op->key_values = field; |
|
|
2534 | |
|
|
2535 | return TRUE; |
|
|
2536 | } |
|
|
2537 | |
|
|
2538 | /* |
|
|
2539 | * Updates the key in op to value. |
|
|
2540 | * |
|
|
2541 | * If add_key is FALSE, this will only update existing keys, |
|
|
2542 | * and not add new ones. |
|
|
2543 | * In general, should be little reason FALSE is ever passed in for add_key |
|
|
2544 | * |
|
|
2545 | * Returns TRUE on success. |
|
|
2546 | */ |
|
|
2547 | int |
|
|
2548 | set_ob_key_value (object *op, const char *key, const char *value, int add_key) |
|
|
2549 | { |
|
|
2550 | shstr key_ (key); |
|
|
2551 | |
|
|
2552 | return set_ob_key_value_s (op, key_, value, add_key); |
|
|
2553 | } |
2430 | } |
2554 | |
2431 | |
2555 | object::depth_iterator::depth_iterator (object *container) |
2432 | object::depth_iterator::depth_iterator (object *container) |
2556 | : iterator_base (container) |
2433 | : iterator_base (container) |
2557 | { |
2434 | { |
… | |
… | |
2607 | { |
2484 | { |
2608 | char flagdesc[512]; |
2485 | char flagdesc[512]; |
2609 | char info2[256 * 4]; |
2486 | char info2[256 * 4]; |
2610 | char *p = info; |
2487 | char *p = info; |
2611 | |
2488 | |
2612 | 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}", |
2613 | count, uuid.seq, |
2490 | count, |
|
|
2491 | uuid.c_str (), |
2614 | &name, |
2492 | &name, |
2615 | title ? "\",title:\"" : "", |
2493 | title ? ",title:\"" : "", |
2616 | title ? (const char *)title : "", |
2494 | title ? (const char *)title : "", |
|
|
2495 | title ? "\"" : "", |
2617 | flag_desc (flagdesc, 512), type); |
2496 | flag_desc (flagdesc, 512), type); |
2618 | |
2497 | |
2619 | if (!this->flag[FLAG_REMOVED] && env) |
2498 | if (!flag[FLAG_REMOVED] && env) |
2620 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2499 | p += snprintf (p, 256, "(in %s)", env->debug_desc (info2)); |
2621 | |
2500 | |
2622 | if (map) |
2501 | if (map) |
2623 | 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); |
2624 | |
2503 | |
… | |
… | |
2639 | { |
2518 | { |
2640 | return map ? map->region (x, y) |
2519 | return map ? map->region (x, y) |
2641 | : region::default_region (); |
2520 | : region::default_region (); |
2642 | } |
2521 | } |
2643 | |
2522 | |
2644 | const materialtype_t * |
|
|
2645 | object::dominant_material () const |
|
|
2646 | { |
|
|
2647 | if (materialtype_t *mt = name_to_material (materialname)) |
|
|
2648 | return mt; |
|
|
2649 | |
|
|
2650 | return name_to_material (shstr_unknown); |
|
|
2651 | } |
|
|
2652 | |
|
|
2653 | void |
2523 | void |
2654 | object::open_container (object *new_container) |
2524 | object::open_container (object *new_container) |
2655 | { |
2525 | { |
2656 | if (container == new_container) |
2526 | if (container == new_container) |
2657 | return; |
2527 | return; |
2658 | |
2528 | |
2659 | if (object *old_container = container) |
2529 | object *old_container = container; |
|
|
2530 | |
|
|
2531 | if (old_container) |
2660 | { |
2532 | { |
2661 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2533 | if (INVOKE_OBJECT (CLOSE, old_container, ARG_OBJECT (this))) |
2662 | return; |
2534 | return; |
2663 | |
2535 | |
2664 | #if 0 |
2536 | #if 0 |
… | |
… | |
2666 | if (object *closer = old_container->inv) |
2538 | if (object *closer = old_container->inv) |
2667 | if (closer->type == CLOSE_CON) |
2539 | if (closer->type == CLOSE_CON) |
2668 | closer->destroy (); |
2540 | closer->destroy (); |
2669 | #endif |
2541 | #endif |
2670 | |
2542 | |
|
|
2543 | // make sure the container is available |
|
|
2544 | esrv_send_item (this, old_container); |
|
|
2545 | |
2671 | old_container->flag [FLAG_APPLIED] = 0; |
2546 | old_container->flag [FLAG_APPLIED] = false; |
2672 | container = 0; |
2547 | container = 0; |
2673 | |
2548 | |
|
|
2549 | // client needs item update to make it work, client bug requires this to be separate |
2674 | esrv_update_item (UPD_FLAGS, this, old_container); |
2550 | esrv_update_item (UPD_FLAGS, this, old_container); |
|
|
2551 | |
2675 | 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 ()); |
2676 | play_sound (sound_find ("chest_close")); |
2553 | play_sound (sound_find ("chest_close")); |
2677 | } |
2554 | } |
2678 | |
2555 | |
2679 | if (new_container) |
2556 | if (new_container) |
2680 | { |
2557 | { |
… | |
… | |
2690 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2567 | closer->flag [FLAG_NO_MAP_SAVE] = 1; |
2691 | new_container->insert (closer); |
2568 | new_container->insert (closer); |
2692 | } |
2569 | } |
2693 | #endif |
2570 | #endif |
2694 | |
2571 | |
2695 | 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 ()); |
2696 | |
2573 | |
|
|
2574 | // make sure the container is available, client bug requires this to be separate |
|
|
2575 | esrv_send_item (this, new_container); |
|
|
2576 | |
2697 | new_container->flag [FLAG_APPLIED] = 1; |
2577 | new_container->flag [FLAG_APPLIED] = true; |
2698 | container = new_container; |
2578 | container = new_container; |
2699 | |
2579 | |
|
|
2580 | // client needs flag change |
2700 | esrv_update_item (UPD_FLAGS, this, new_container); |
2581 | esrv_update_item (UPD_FLAGS, this, new_container); |
2701 | esrv_send_inventory (this, new_container); |
2582 | esrv_send_inventory (this, new_container); |
2702 | play_sound (sound_find ("chest_open")); |
2583 | play_sound (sound_find ("chest_open")); |
2703 | } |
2584 | } |
|
|
2585 | // else if (!old_container->env && contr && contr->ns) |
|
|
2586 | // contr->ns->floorbox_reset (); |
2704 | } |
2587 | } |
2705 | |
2588 | |
2706 | object * |
2589 | object * |
2707 | object::force_find (const shstr name) |
2590 | object::force_find (shstr_tmp name) |
2708 | { |
2591 | { |
2709 | /* cycle through his inventory to look for the MARK we want to |
2592 | /* cycle through his inventory to look for the MARK we want to |
2710 | * place |
2593 | * place |
2711 | */ |
2594 | */ |
2712 | for (object *tmp = inv; tmp; tmp = tmp->below) |
2595 | for (object *tmp = inv; tmp; tmp = tmp->below) |
… | |
… | |
2714 | return splay (tmp); |
2597 | return splay (tmp); |
2715 | |
2598 | |
2716 | return 0; |
2599 | return 0; |
2717 | } |
2600 | } |
2718 | |
2601 | |
|
|
2602 | //-GPL |
|
|
2603 | |
2719 | void |
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 * |
2720 | object::force_add (const shstr name, int duration) |
2614 | object::force_add (shstr_tmp name, int duration) |
2721 | { |
2615 | { |
2722 | if (object *force = force_find (name)) |
2616 | if (object *force = force_find (name)) |
2723 | force->destroy (); |
2617 | force->destroy (); |
2724 | |
2618 | |
2725 | object *force = get_archetype (FORCE_NAME); |
2619 | object *force = get_archetype (FORCE_NAME); |
2726 | |
2620 | |
2727 | force->slaying = name; |
2621 | force->slaying = name; |
2728 | force->stats.food = 1; |
2622 | force->force_set_timer (duration); |
2729 | force->speed_left = -1.f; |
|
|
2730 | |
|
|
2731 | force->set_speed (duration ? 1.f / duration : 0.f); |
|
|
2732 | force->flag [FLAG_IS_USED_UP] = true; |
|
|
2733 | force->flag [FLAG_APPLIED] = true; |
2623 | force->flag [FLAG_APPLIED] = true; |
2734 | |
2624 | |
2735 | insert (force); |
2625 | return insert (force); |
2736 | } |
2626 | } |
2737 | |
2627 | |
2738 | void |
2628 | void |
2739 | object::play_sound (faceidx sound) const |
2629 | object::play_sound (faceidx sound) const |
2740 | { |
2630 | { |
2741 | if (!sound) |
2631 | if (!sound) |
2742 | return; |
2632 | return; |
2743 | |
2633 | |
2744 | if (flag [FLAG_REMOVED]) |
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 ()) |
2745 | return; |
2659 | return; |
2746 | |
2660 | |
2747 | if (env) |
2661 | // find old force, or create new one |
2748 | { |
2662 | object *force = force_find (shstr_noise_force); |
2749 | if (object *pl = in_player ()) |
2663 | |
2750 | pl->contr->play_sound (sound); |
2664 | if (force) |
2751 | } |
2665 | force->speed_left = -1.f; // patch old speed up |
2752 | else |
2666 | else |
2753 | map->play_sound (sound, x, y); |
2667 | { |
2754 | } |
2668 | force = archetype::get (shstr_noise_force); |
2755 | |
2669 | |
|
|
2670 | force->slaying = shstr_noise_force; |
|
|
2671 | force->stats.food = 1; |
|
|
2672 | force->speed_left = -1.f; |
|
|
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 | |