1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra 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 <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /** |
25 | /** |
… | |
… | |
37 | #include <sproto.h> |
38 | #include <sproto.h> |
38 | |
39 | |
39 | /** This is the maximum number of bytes we expect any one item to take up */ |
40 | /** This is the maximum number of bytes we expect any one item to take up */ |
40 | #define MAXITEMLEN 300 |
41 | #define MAXITEMLEN 300 |
41 | |
42 | |
42 | #if 0 |
|
|
43 | tag_t |
|
|
44 | client_container::tag () const |
|
|
45 | { |
|
|
46 | switch (type) |
|
|
47 | { |
|
|
48 | case CC_INVENTORY: |
|
|
49 | return ns->pl->count; |
|
|
50 | case CC_MAPSPACE: |
|
|
51 | return 0; |
|
|
52 | case CC_CONTAINER: |
|
|
53 | return env->count; |
|
|
54 | } |
|
|
55 | |
|
|
56 | abort (); |
|
|
57 | } |
|
|
58 | |
|
|
59 | void |
|
|
60 | client_container::clear () |
|
|
61 | { |
|
|
62 | switch (type) |
|
|
63 | { |
|
|
64 | case CC_INVENTORY: |
|
|
65 | abort (); |
|
|
66 | |
|
|
67 | case CC_MAPSPACE: |
|
|
68 | case CC_CONTAINER: |
|
|
69 | ns->send_packet_printf ("delinv %d", tag ()); |
|
|
70 | break; |
|
|
71 | } |
|
|
72 | |
|
|
73 | for (iterator i = begin (); i != end (); ++i) |
|
|
74 | i->op->seen_by = 0; |
|
|
75 | |
|
|
76 | vector< refitem, slice_allocator<refitem> >::clear (); |
|
|
77 | } |
|
|
78 | |
|
|
79 | inline iterator |
|
|
80 | client_container::merge_item (iterator i, object *op) |
|
|
81 | { |
|
|
82 | if (i != end () && i->op == op) |
|
|
83 | return ++i; |
|
|
84 | |
|
|
85 | if (op->seen_by) |
|
|
86 | return; // seen by another entity already |
|
|
87 | |
|
|
88 | op->seen_by = this; |
|
|
89 | |
|
|
90 | refitem ref; |
|
|
91 | ref.op = op; |
|
|
92 | |
|
|
93 | return insert (i, ref); |
|
|
94 | } |
|
|
95 | |
|
|
96 | void |
|
|
97 | client_container::update (int offset) |
|
|
98 | { |
|
|
99 | iterator i = begin (); |
|
|
100 | |
|
|
101 | switch (type) |
|
|
102 | { |
|
|
103 | case CC_INVENTORY: |
|
|
104 | case CC_CONTAINER: |
|
|
105 | { |
|
|
106 | object *env = type == CC_INVENTORY |
|
|
107 | ? ns->pl->ob |
|
|
108 | : this->env; |
|
|
109 | |
|
|
110 | // pass 1, erase all objects no longer in container |
|
|
111 | for (iterator j = begin (); j != end (); ++j) |
|
|
112 | if (j->op->env != env) |
|
|
113 | { |
|
|
114 | j->op->seen_by = 0; |
|
|
115 | erase (j); |
|
|
116 | } |
|
|
117 | |
|
|
118 | // pass 2 merge items |
|
|
119 | for (object *op = env->inv; op; op = op->below) |
|
|
120 | { |
|
|
121 | if (--offset < 0) |
|
|
122 | i = merge_item (i, op); |
|
|
123 | else if (offset < -FLOORBOX_PAGESIZE) |
|
|
124 | break; |
|
|
125 | } |
|
|
126 | } |
|
|
127 | break; |
|
|
128 | |
|
|
129 | case CC_MAPSPACE: |
|
|
130 | { |
|
|
131 | // pass 1, erase all objects no longer on space |
|
|
132 | for (iterator j = begin (); j != end (); ++j) |
|
|
133 | if (j->op->x != x || j->op->y != y || j->op->map != map) |
|
|
134 | { |
|
|
135 | j->op->seen_by = 0; |
|
|
136 | erase (j); |
|
|
137 | } |
|
|
138 | |
|
|
139 | // pass 2 merge items |
|
|
140 | for (object *op = GET_MAP_OB (map, x, y); op; op = op->above) |
|
|
141 | { |
|
|
142 | if (--offset < 0) |
|
|
143 | i = merge_item (i, op); |
|
|
144 | else if (offset < -FLOORBOX_PAGESIZE) |
|
|
145 | break; |
|
|
146 | } |
|
|
147 | } |
|
|
148 | break; |
|
|
149 | } |
|
|
150 | |
|
|
151 | // pass 3, erase all extra items |
|
|
152 | for (iterator j = i; j != end (); ++j) |
|
|
153 | j->op->seen_by = 0; |
|
|
154 | |
|
|
155 | if (i != end ()) |
|
|
156 | erase (i, end ()); |
|
|
157 | } |
|
|
158 | |
|
|
159 | void |
|
|
160 | client_container::set_mapspace (maptile *map, int x, int y) |
|
|
161 | { |
|
|
162 | if (type == CC_MAPSPACE |
|
|
163 | && this->map == map |
|
|
164 | && this->x == x |
|
|
165 | && this->y == y) |
|
|
166 | return; |
|
|
167 | |
|
|
168 | clear (); |
|
|
169 | |
|
|
170 | type = CC_MAPSPACE; |
|
|
171 | this->map = map; |
|
|
172 | this->x = x; |
|
|
173 | this->y = y; |
|
|
174 | } |
|
|
175 | |
|
|
176 | void |
|
|
177 | client_container::set_container (object *env) |
|
|
178 | { |
|
|
179 | } |
|
|
180 | #endif |
|
|
181 | |
|
|
182 | /******************************************************************************* |
43 | /******************************************************************************* |
183 | * |
44 | * |
184 | * Functions related to sending object data to the client. |
45 | * Functions related to sending object data to the client. |
185 | * |
46 | * |
186 | ******************************************************************************/ |
47 | ******************************************************************************/ |
187 | |
48 | |
188 | /** |
49 | /** |
189 | * This is a similar to query_name, but returns flags |
50 | * This is a similar to query_name, but returns flags |
190 | * to be sent to client. |
51 | * to be sent to client. |
191 | */ |
52 | */ |
192 | unsigned int |
53 | static unsigned int |
193 | query_flags (object *op) |
54 | query_flags (object *op) |
194 | { |
55 | { |
195 | unsigned int flags = 0; |
56 | unsigned int flags = 0; |
196 | |
57 | |
197 | if (QUERY_FLAG (op, FLAG_APPLIED)) |
58 | if (op->flag [FLAG_APPLIED]) |
198 | { |
|
|
199 | switch (op->type) |
59 | switch (op->type) |
200 | { |
60 | { |
201 | case BOW: |
61 | case BOW: |
202 | case WAND: |
62 | case WAND: |
203 | case ROD: |
63 | case ROD: |
204 | case HORN: |
64 | case HORN: |
205 | flags = a_readied; |
65 | flags = a_readied; |
206 | break; |
66 | break; |
207 | case WEAPON: |
67 | case WEAPON: |
208 | flags = a_wielded; |
68 | flags = a_wielded; |
209 | break; |
69 | break; |
210 | case SKILL: |
70 | case SKILL: |
211 | case ARMOUR: |
71 | case ARMOUR: |
212 | case HELMET: |
72 | case HELMET: |
213 | case SHIELD: |
73 | case SHIELD: |
214 | case RING: |
74 | case RING: |
215 | case BOOTS: |
75 | case BOOTS: |
216 | case GLOVES: |
76 | case GLOVES: |
217 | case AMULET: |
77 | case AMULET: |
218 | case GIRDLE: |
78 | case GIRDLE: |
219 | case BRACERS: |
79 | case BRACERS: |
220 | case CLOAK: |
80 | case CLOAK: |
221 | flags = a_worn; |
81 | flags = a_worn; |
222 | break; |
82 | break; |
223 | case CONTAINER: |
83 | case CONTAINER: |
224 | flags = a_active; |
84 | flags = a_active; |
225 | break; |
85 | break; |
226 | default: |
86 | default: |
227 | flags = a_applied; |
87 | flags = a_applied; |
228 | break; |
88 | break; |
229 | } |
89 | } |
230 | } |
|
|
231 | |
90 | |
232 | if (op->type == CONTAINER && ((op->env && op->env->container == op) || (!op->env && QUERY_FLAG (op, FLAG_APPLIED)))) |
91 | if (op->is_open_container ()) |
233 | flags |= F_OPEN; |
92 | flags |= F_OPEN; |
234 | |
93 | |
235 | if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) |
94 | if (op->flag [FLAG_KNOWN_CURSED]) |
236 | { |
95 | { |
237 | if (QUERY_FLAG (op, FLAG_DAMNED)) |
96 | if (op->flag [FLAG_DAMNED]) |
238 | flags |= F_DAMNED; |
97 | flags |= F_DAMNED; |
239 | else if (QUERY_FLAG (op, FLAG_CURSED)) |
98 | else if (op->flag [FLAG_CURSED]) |
240 | flags |= F_CURSED; |
99 | flags |= F_CURSED; |
241 | } |
100 | } |
242 | |
101 | |
243 | if (QUERY_FLAG (op, FLAG_KNOWN_MAGICAL) && !QUERY_FLAG (op, FLAG_IDENTIFIED)) |
102 | if (op->flag [FLAG_KNOWN_MAGICAL] && !op->flag [FLAG_IDENTIFIED]) |
244 | flags |= F_MAGIC; |
103 | flags |= F_MAGIC; |
245 | if (QUERY_FLAG (op, FLAG_UNPAID)) |
104 | if (op->flag [FLAG_UNPAID]) |
246 | flags |= F_UNPAID; |
105 | flags |= F_UNPAID; |
247 | if (QUERY_FLAG (op, FLAG_INV_LOCKED)) |
106 | if (op->flag [FLAG_INV_LOCKED]) |
248 | flags |= F_LOCKED; |
107 | flags |= F_LOCKED; |
249 | |
108 | |
250 | return flags; |
109 | return flags; |
251 | } |
110 | } |
252 | |
111 | |
… | |
… | |
255 | * animation of face to the client. |
114 | * animation of face to the client. |
256 | */ |
115 | */ |
257 | static void |
116 | static void |
258 | add_object_to_socklist (client &ns, packet &sl, object *head) |
117 | add_object_to_socklist (client &ns, packet &sl, object *head) |
259 | { |
118 | { |
260 | int flags, len, anim_speed; |
|
|
261 | char item_n[MAX_BUF]; |
|
|
262 | const char *item_p; |
|
|
263 | |
|
|
264 | flags = query_flags (head); |
119 | int flags = query_flags (head); |
265 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
120 | |
|
|
121 | if (head->flag [FLAG_NO_PICK]) |
266 | flags |= F_NOPICK; |
122 | flags |= F_NOPICK; |
267 | |
123 | |
268 | ns.send_face (head->face, -50); |
124 | ns.send_face (head->face, -50); |
269 | ns.flush_fx (); |
|
|
270 | |
125 | |
271 | if (QUERY_FLAG (head, FLAG_ANIMATE) && !ns.anims_sent[head->animation_id]) |
126 | if (head->flag [FLAG_ANIMATE] && !ns.anims_sent[head->animation_id]) |
272 | ns.send_animation (head->animation_id); |
127 | ns.send_animation (head->animation_id); |
273 | |
128 | |
274 | sl << uint32 (head->count) |
129 | sl << uint32 (head->count) |
275 | << uint32 (flags) |
130 | << uint32 (flags) |
276 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : WEIGHT (head)) |
131 | << uint32 (head->flag [FLAG_NO_PICK] ? -1 : head->client_weight ()) |
277 | << uint32 (head->face); |
132 | << uint32 (head->face); |
278 | |
133 | |
279 | if (!head->custom_name) |
134 | if (!head->custom_name) |
280 | { |
135 | { |
281 | strncpy (item_n, query_base_name (head, 0), 127); |
136 | const char *name; |
282 | item_n[127] = 0; |
137 | uint8 *len = sl.cur++; // patch up length later |
283 | len = strlen (item_n); |
138 | |
284 | item_p = query_base_name (head, 1); |
139 | name = query_base_name (head, 0); sl << data (name, min (127, strlen (name))); |
|
|
140 | sl << uint8 (0); |
|
|
141 | name = query_base_name (head, 1); sl << data (name, min (127, strlen (name))); |
|
|
142 | |
|
|
143 | *len = sl.cur - len - 1; |
285 | } |
144 | } |
286 | else |
145 | else |
287 | { |
146 | { |
288 | strncpy (item_n, head->custom_name, 127); |
147 | int len = min (head->custom_name.length (), 127); |
289 | item_n[127] = 0; |
|
|
290 | len = strlen (item_n); |
|
|
291 | item_p = head->custom_name; |
|
|
292 | } |
|
|
293 | |
148 | |
294 | strncpy (item_n + len + 1, item_p, 127); |
149 | sl << uint8 (len * 2 + 1) |
295 | item_n[254] = 0; |
150 | << data (head->custom_name, len) |
296 | len += strlen (item_n + 1 + len) + 1; |
151 | << uint8 (0) |
|
|
152 | << data (head->custom_name, len); |
|
|
153 | } |
297 | |
154 | |
298 | sl << data8 (item_n, len) |
|
|
299 | << uint16 (head->animation_id); |
155 | sl << uint16 (head->animation_id); |
300 | |
156 | |
301 | anim_speed = 0; |
157 | int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
302 | if (QUERY_FLAG (head, FLAG_ANIMATE)) |
158 | : head->anim_speed ? clamp (head->anim_speed, 1, 255) |
303 | { |
159 | : 1. / clamp (head->speed, 1./255., 1./1.); |
304 | if (head->anim_speed) |
|
|
305 | anim_speed = head->anim_speed; |
|
|
306 | else |
|
|
307 | { |
|
|
308 | if (fabs (head->speed) < 0.001) |
|
|
309 | anim_speed = 255; |
|
|
310 | else if (fabs (head->speed) >= 1.0) |
|
|
311 | anim_speed = 1; |
|
|
312 | else |
|
|
313 | anim_speed = (int) (1.0 / fabs (head->speed)); |
|
|
314 | } |
|
|
315 | |
|
|
316 | if (anim_speed > 255) |
|
|
317 | anim_speed = 255; |
|
|
318 | } |
|
|
319 | |
160 | |
320 | sl << uint8 (anim_speed) |
161 | sl << uint8 (anim_speed) |
321 | << uint32 (head->nrof); |
162 | << uint32 (head->nrof); |
322 | |
163 | |
323 | if (ns.itemcmd == 2) |
164 | if (ns.itemcmd == 2) |
324 | sl << uint16 (head->client_type); |
165 | sl << uint16 (head->client_type); |
325 | |
|
|
326 | SET_FLAG (head, FLAG_CLIENT_SENT); |
|
|
327 | } |
166 | } |
|
|
167 | |
|
|
168 | static faceidx |
|
|
169 | need_face_now (player *pl, const char *name) |
|
|
170 | { |
|
|
171 | faceidx face = face_find (name, empty_face); |
|
|
172 | |
|
|
173 | pl->ns->send_face (face, -50); |
|
|
174 | pl->ns->flush_fx (); |
|
|
175 | |
|
|
176 | return face; |
|
|
177 | } |
|
|
178 | |
|
|
179 | #define FINGER_UP "finger_up.x11" |
|
|
180 | #define FINGER_DOWN "finger_down.x11" |
328 | |
181 | |
329 | /** |
182 | /** |
330 | * Send the look window. Don't need to do animations here |
183 | * Send the look window. Don't need to do animations here |
331 | * This sends all the faces to the client, not just updates. This is |
184 | * This sends all the faces to the client, not just updates. This is |
332 | * because object ordering would otherwise be inconsistent. |
185 | * because object ordering would otherwise be inconsistent. |
333 | */ |
186 | */ |
334 | void |
187 | void |
335 | esrv_draw_look (player *pl) |
188 | esrv_draw_look (player *pl) |
336 | { |
189 | { |
337 | int got_one = 0, start_look = 0, end_look = 0; |
|
|
338 | |
|
|
339 | object *ob = pl->ob; |
190 | object *ob = pl->ob; |
340 | |
191 | |
341 | if (!pl->ns->update_look) |
192 | if (!pl->ns->update_look) |
342 | { |
193 | { |
343 | LOG (llevDebug, "esrv_draw_look called when update_look was not set (player %s)\n", &ob->name); |
194 | LOG (llevDebug, "esrv_draw_look called when update_look was not set (player %s)\n", &ob->name); |
344 | return; |
195 | return; |
345 | } |
196 | } |
346 | else |
197 | |
|
|
198 | pl->ns->send_packet ("delinv 0"); |
|
|
199 | |
|
|
200 | if (pl->run_on) |
|
|
201 | return; |
|
|
202 | |
347 | pl->ns->update_look = 0; |
203 | pl->ns->update_look = 0; |
348 | |
204 | |
349 | if (QUERY_FLAG (ob, FLAG_REMOVED) |
205 | if (ob->flag [FLAG_REMOVED] |
350 | || !ob->map |
206 | || !ob->map |
351 | || ob->map->in_memory != MAP_ACTIVE |
207 | || ob->map->in_memory != MAP_ACTIVE |
352 | || out_of_map (ob->map, ob->x, ob->y)) |
208 | || out_of_map (ob->map, ob->x, ob->y)) |
353 | return; |
209 | return; |
354 | |
210 | |
355 | pl->ns->send_packet ("delinv 0"); |
|
|
356 | |
|
|
357 | packet sl; |
211 | packet sl; |
358 | sl.printf ("item%d ", pl->ns->itemcmd); |
212 | sl.printf ("item%d ", pl->ns->itemcmd); |
359 | |
213 | |
360 | sl << uint32 (0); |
214 | sl << uint32 (0); |
361 | |
215 | |
362 | pl->ns->send_face (empty_face, -50); |
216 | int start_pos = pl->ns->look_position; |
363 | pl->ns->flush_fx (); |
217 | bool dirty = false; |
364 | |
218 | |
365 | if (pl->ns->look_position) |
219 | mapspace &ms = ob->ms (); |
|
|
220 | |
|
|
221 | // manage a ring buffer of the "last FLOORBOX_PAGESIZE" items and |
|
|
222 | // start from the top |
|
|
223 | object *items [FLOORBOX_PAGESIZE]; |
|
|
224 | int item_idx = 0, item_cnt = 0; |
|
|
225 | int pos = 0; |
|
|
226 | |
|
|
227 | // find our items by walking down |
|
|
228 | object *item = ms.top; |
|
|
229 | |
|
|
230 | for (; item && item_cnt < FLOORBOX_PAGESIZE; item = item->below) |
|
|
231 | { |
|
|
232 | if (!item->client_visible ()) |
|
|
233 | continue; |
|
|
234 | |
|
|
235 | if (++pos < start_pos) |
|
|
236 | continue; |
|
|
237 | |
|
|
238 | // record item |
|
|
239 | items [item_idx] = item; item_idx = item_idx < FLOORBOX_PAGESIZE ? item_idx + 1 : 0; |
|
|
240 | item_cnt++; |
|
|
241 | |
|
|
242 | // stop at first floor |
|
|
243 | if (item->flag [FLAG_IS_FLOOR]) |
|
|
244 | { |
|
|
245 | // we are finished, don't append "next group of items" |
|
|
246 | // by setting item to ms.bot it becomes zero which is checked after the while loop |
|
|
247 | item = ms.bot; |
|
|
248 | } |
366 | { |
249 | } |
367 | char buf[80]; |
|
|
368 | snprintf (buf, 80, "Apply this to see %d previous items", FLOORBOX_PAGESIZE); |
|
|
369 | |
250 | |
|
|
251 | // see if there are more if we cared - we ignore invisible objects |
|
|
252 | if (item) |
|
|
253 | { |
|
|
254 | /* What we basically do is make a 'fake' object - when the user applies it, |
|
|
255 | * we notice the special tag the object has, and act accordingly. |
|
|
256 | */ |
370 | sl << uint32 (0x80000000 | (pl->ns->look_position - FLOORBOX_PAGESIZE)) |
257 | sl << uint32 (0x80000000 | (start_pos + FLOORBOX_PAGESIZE)) |
371 | << uint32 (0) |
258 | << uint32 (0) |
372 | << sint32 (-1) |
259 | << uint32 ((uint32) - 1) |
373 | << uint32 (empty_face) |
260 | << uint32 (need_face_now (pl, FINGER_DOWN)) |
374 | << data8 (buf) |
261 | << data8 ("Apply this to see the items below") |
375 | << uint16 (0) |
262 | << uint16 (0) |
376 | << uint8 (0) |
263 | << uint8 (0) |
377 | << uint32 (0); |
264 | << uint32 (0); |
378 | |
265 | |
379 | if (pl->ns->itemcmd == 2) |
266 | if (pl->ns->itemcmd == 2) |
380 | sl << uint16 (0); |
267 | sl << uint16 (0); |
381 | } |
|
|
382 | |
268 | |
383 | object *tmp = ob->ms ().top; |
269 | dirty = true; |
384 | for (object *last = 0; tmp != last; tmp = tmp->below) |
|
|
385 | { |
270 | } |
386 | object *head; |
|
|
387 | |
271 | |
388 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !last) |
272 | // now send out all items in the ring buffer in reverse order |
|
|
273 | while (item_cnt) |
|
|
274 | { |
|
|
275 | --item_cnt; |
|
|
276 | item_idx = (item_idx ? item_idx : FLOORBOX_PAGESIZE) - 1; |
|
|
277 | object *item = items [item_idx]; |
|
|
278 | |
|
|
279 | add_object_to_socklist (*pl->ns, sl, item->head_ ()); |
|
|
280 | |
|
|
281 | dirty = true; |
|
|
282 | |
|
|
283 | // if packet got too large, send it and begin a new one |
|
|
284 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
389 | { |
285 | { |
390 | last = tmp->below; /* assumes double floor mode */ |
286 | pl->ns->flush_fx (); |
391 | if (last && QUERY_FLAG (last, FLAG_IS_FLOOR)) |
287 | pl->ns->send_packet (sl); |
392 | last = last->below; |
288 | |
|
|
289 | sl.reset (); |
|
|
290 | sl.printf ("item%d ", pl->ns->itemcmd); |
|
|
291 | sl << uint32 (0); |
|
|
292 | |
|
|
293 | dirty = false; |
393 | } |
294 | } |
394 | |
|
|
395 | if (tmp->client_visible ()) |
|
|
396 | { |
|
|
397 | if (++start_look < pl->ns->look_position) |
|
|
398 | continue; |
|
|
399 | |
|
|
400 | end_look++; |
|
|
401 | |
|
|
402 | if (end_look > FLOORBOX_PAGESIZE) |
|
|
403 | { |
|
|
404 | /* What we basically do is make a 'fake' object - when the user applies it, |
|
|
405 | * we notice the special tag the object has, and act accordingly. |
|
|
406 | */ |
|
|
407 | sl << uint32 (0x80000000 | (pl->ns->look_position + FLOORBOX_PAGESIZE)) |
|
|
408 | << uint32 (0) |
|
|
409 | << uint32 ((uint32) - 1) |
|
|
410 | << uint32 (empty_face) |
|
|
411 | << data8 ("Apply this to see next group of items") |
|
|
412 | << uint16 (0) |
|
|
413 | << uint8 (0) |
|
|
414 | << uint32 (0); |
|
|
415 | |
|
|
416 | if (pl->ns->itemcmd == 2) |
|
|
417 | sl << uint16 (0); |
|
|
418 | |
|
|
419 | break; |
|
|
420 | } |
|
|
421 | |
|
|
422 | if (tmp->head) |
|
|
423 | head = tmp->head; |
|
|
424 | else |
|
|
425 | head = tmp; |
|
|
426 | |
|
|
427 | add_object_to_socklist (*pl->ns, sl, head); |
|
|
428 | got_one++; |
|
|
429 | |
|
|
430 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
|
|
431 | { |
|
|
432 | pl->ns->send_packet (sl); |
|
|
433 | |
|
|
434 | sl.reset (); |
|
|
435 | sl.printf ("item%d ", pl->ns->itemcmd); |
|
|
436 | sl << uint32 (0); |
|
|
437 | got_one = 0; |
|
|
438 | } |
|
|
439 | } |
|
|
440 | } |
295 | } |
441 | |
296 | |
442 | if (got_one) |
297 | if (start_pos) |
|
|
298 | { |
|
|
299 | sl << uint32 (0x80000000 | (start_pos - FLOORBOX_PAGESIZE)) |
|
|
300 | << uint32 (0) |
|
|
301 | << sint32 (-1) |
|
|
302 | << uint32 (need_face_now (pl, FINGER_UP)) |
|
|
303 | << data8 ("Apply this to see the items higher up") |
|
|
304 | << uint16 (0) |
|
|
305 | << uint8 (0) |
|
|
306 | << uint32 (0); |
|
|
307 | |
|
|
308 | if (pl->ns->itemcmd == 2) |
|
|
309 | sl << uint16 (0); |
|
|
310 | |
|
|
311 | dirty = true; |
|
|
312 | } |
|
|
313 | |
|
|
314 | if (dirty) |
|
|
315 | { |
|
|
316 | pl->ns->flush_fx (); |
443 | pl->ns->send_packet (sl); |
317 | pl->ns->send_packet (sl); |
444 | |
318 | } |
445 | } |
319 | } |
446 | |
320 | |
447 | /** |
321 | /** |
448 | * Sends whole inventory. |
322 | * Sends whole inventory. |
449 | */ |
323 | */ |
… | |
… | |
481 | * items (especially with some of the bags out there) to |
355 | * items (especially with some of the bags out there) to |
482 | * overflow the buffer. IF so, send multiple item commands. |
356 | * overflow the buffer. IF so, send multiple item commands. |
483 | */ |
357 | */ |
484 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
358 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
485 | { |
359 | { |
|
|
360 | pl->contr->ns->flush_fx (); |
486 | pl->contr->ns->send_packet (sl); |
361 | pl->contr->ns->send_packet (sl); |
487 | |
362 | |
488 | sl.reset (); |
363 | sl.reset (); |
489 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
364 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
490 | sl << uint32 (op->count); |
365 | sl << uint32 (op->count); |
… | |
… | |
492 | } |
367 | } |
493 | } |
368 | } |
494 | } |
369 | } |
495 | |
370 | |
496 | if (got_one) |
371 | if (got_one) |
|
|
372 | { |
|
|
373 | pl->contr->ns->flush_fx (); |
497 | pl->contr->ns->send_packet (sl); |
374 | pl->contr->ns->send_packet (sl); |
|
|
375 | } |
498 | } |
376 | } |
499 | |
377 | |
500 | /** |
378 | /** |
501 | * Updates object *op for player *pl. |
379 | * Updates object *op for player *pl. |
502 | * |
380 | * |
… | |
… | |
506 | */ |
384 | */ |
507 | void |
385 | void |
508 | esrv_update_item (int flags, object *pl, object *op) |
386 | esrv_update_item (int flags, object *pl, object *op) |
509 | { |
387 | { |
510 | /* If we have a request to send the player item, skip a few checks. */ |
388 | /* If we have a request to send the player item, skip a few checks. */ |
511 | if (op != pl) |
|
|
512 | { |
|
|
513 | if (!op->client_visible ()) |
389 | if (op != pl && !op->client_visible ()) |
514 | return; |
390 | return; |
515 | /* we remove the check for op->env, because in theory, the object |
|
|
516 | * is hopefully in the same place, so the client should preserve |
|
|
517 | * order. |
|
|
518 | */ |
|
|
519 | } |
|
|
520 | |
391 | |
521 | client *ns = pl->contr->ns; |
392 | client *ns = pl->contr->ns; |
522 | if (!ns) |
393 | if (!ns) |
523 | return; |
394 | return; |
524 | |
395 | |
525 | if (!QUERY_FLAG (op, FLAG_CLIENT_SENT)) |
|
|
526 | { |
|
|
527 | /* FLAG_CLIENT_SENT is debug only. We are using it to see where |
|
|
528 | * this is happening - we can set a breakpoint here in the debugger |
|
|
529 | * and track back the call. |
|
|
530 | */ |
|
|
531 | LOG (llevDebug, "We have not sent item %s (%d)\n", &op->name, op->count); |
|
|
532 | } |
|
|
533 | |
|
|
534 | packet sl ("upditem"); |
396 | packet sl ("upditem"); |
535 | |
397 | |
536 | sl << uint8 (flags); |
398 | sl << uint8 (flags); |
537 | |
399 | |
538 | if (op->head) |
|
|
539 | op = op->head; |
400 | op = op->head_ (); |
540 | |
401 | |
541 | sl << uint32 (op->count); |
402 | sl << uint32 (op->count); |
542 | |
403 | |
543 | if (flags & UPD_LOCATION) |
404 | if (flags & UPD_LOCATION) |
544 | sl << uint32 (op->env ? op->env->count : 0); |
405 | sl << uint32 (op->env ? op->env->count : 0); |
… | |
… | |
546 | if (flags & UPD_FLAGS) |
407 | if (flags & UPD_FLAGS) |
547 | sl << uint32 (query_flags (op)); |
408 | sl << uint32 (query_flags (op)); |
548 | |
409 | |
549 | if (flags & UPD_WEIGHT) |
410 | if (flags & UPD_WEIGHT) |
550 | { |
411 | { |
551 | sint32 weight = WEIGHT (op); |
412 | sint32 weight = op->client_weight (); |
552 | |
413 | |
553 | sl << uint32 (QUERY_FLAG (op, FLAG_NO_PICK) ? -1 : weight); |
414 | if (op == pl) |
554 | |
|
|
555 | if (pl == op) |
|
|
556 | ns->last_weight = weight; |
415 | ns->last_weight = weight; |
|
|
416 | |
|
|
417 | sl << uint32 (weight); |
557 | } |
418 | } |
558 | |
419 | |
559 | if (flags & UPD_FACE) |
420 | if (flags & UPD_FACE) |
560 | { |
421 | { |
561 | ns->send_face (op->face, -50); |
422 | ns->send_face (op->face, -50); |
… | |
… | |
565 | |
426 | |
566 | if (flags & UPD_NAME) |
427 | if (flags & UPD_NAME) |
567 | { |
428 | { |
568 | int len; |
429 | int len; |
569 | const char *item_p; |
430 | const char *item_p; |
570 | char item_n[MAX_BUF]; |
431 | char item_n[127 * 2]; |
571 | |
432 | |
572 | if (!op->custom_name) |
433 | if (!op->custom_name) |
573 | { |
434 | { |
574 | strncpy (item_n, query_base_name (op, 0), 127); |
435 | len = assign (item_n, query_base_name (op, 0), 127); |
575 | item_n[127] = 0; |
|
|
576 | len = strlen (item_n); |
|
|
577 | item_p = query_base_name (op, 1); |
436 | item_p = query_base_name (op, 1); |
578 | } |
437 | } |
579 | else |
438 | else |
580 | { |
439 | { |
581 | strncpy (item_n, op->custom_name, 127); |
440 | len = assign (item_n, &op->custom_name, 127); |
582 | item_n[127] = 0; |
|
|
583 | len = strlen (item_n); |
|
|
584 | item_p = op->custom_name; |
441 | item_p = &op->custom_name; |
585 | } |
442 | } |
586 | |
443 | |
587 | strncpy (item_n + len + 1, item_p, 127); |
444 | len += assign (item_n + len, item_p, 127); |
588 | item_n[254] = 0; |
|
|
589 | len += strlen (item_n + 1 + len) + 1; |
|
|
590 | |
445 | |
591 | sl << data8 (item_n, len); |
446 | sl << data8 (item_n, len); |
592 | } |
447 | } |
593 | |
448 | |
594 | if (flags & UPD_ANIM) |
449 | if (flags & UPD_ANIM) |
… | |
… | |
596 | |
451 | |
597 | if (flags & UPD_ANIMSPEED) |
452 | if (flags & UPD_ANIMSPEED) |
598 | { |
453 | { |
599 | int anim_speed = 0; |
454 | int anim_speed = 0; |
600 | |
455 | |
601 | if (QUERY_FLAG (op, FLAG_ANIMATE)) |
456 | if (op->flag [FLAG_ANIMATE]) |
602 | { |
457 | { |
603 | if (op->anim_speed) |
458 | if (op->anim_speed) |
604 | anim_speed = op->anim_speed; |
459 | anim_speed = op->anim_speed; |
605 | else |
460 | else |
606 | { |
461 | { |
607 | if (fabs (op->speed) < 0.001) |
462 | if (op->speed < 0.001) |
608 | anim_speed = 255; |
463 | anim_speed = 255; |
609 | else if (fabs (op->speed) >= 1.0) |
464 | else if (op->speed >= 1.0) |
610 | anim_speed = 1; |
465 | anim_speed = 1; |
611 | else |
466 | else |
612 | anim_speed = (int) (1.0 / fabs (op->speed)); |
467 | anim_speed = 1. / op->speed; |
613 | } |
468 | } |
614 | |
469 | |
615 | if (anim_speed > 255) |
470 | if (anim_speed > 255) |
616 | anim_speed = 255; |
471 | anim_speed = 255; |
617 | } |
472 | } |
… | |
… | |
632 | esrv_send_item (object *pl, object *op) |
487 | esrv_send_item (object *pl, object *op) |
633 | { |
488 | { |
634 | if (!pl->contr->ns) |
489 | if (!pl->contr->ns) |
635 | return; |
490 | return; |
636 | |
491 | |
637 | /* If this is not the player object, do some more checks */ |
|
|
638 | if (op != pl) |
|
|
639 | { |
|
|
640 | /* We only send 'visibile' objects to the client */ |
492 | /* We only send 'visible' objects to the client, and sometimes the player */ |
641 | if (!op->client_visible ()) |
493 | if (!op->client_visible () && op->type != PLAYER) |
642 | return; |
494 | return; |
643 | |
|
|
644 | /* if the item is on the ground, mark that the look needs to |
|
|
645 | * be updated. |
|
|
646 | */ |
|
|
647 | if (!op->env) |
|
|
648 | { |
|
|
649 | pl->contr->ns->floorbox_update (); |
|
|
650 | return; |
|
|
651 | } |
|
|
652 | } |
|
|
653 | |
495 | |
654 | packet sl; |
496 | packet sl; |
655 | |
497 | |
656 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
498 | sl.printf ("item%d ", pl->contr->ns->itemcmd); |
657 | |
499 | |
658 | if (op->head) |
|
|
659 | op = op->head; |
500 | op = op->head_ (); |
660 | |
501 | |
661 | sl << uint32 (op->env ? op->env->count : 0); |
502 | sl << uint32 (op->env ? op->env->count : 0); |
662 | |
503 | |
663 | add_object_to_socklist (*pl->contr->ns, sl, op); |
504 | add_object_to_socklist (*pl->contr->ns, sl, op); |
664 | |
505 | |
|
|
506 | pl->contr->ns->flush_fx (); |
665 | pl->contr->ns->send_packet (sl); |
507 | pl->contr->ns->send_packet (sl); |
666 | SET_FLAG (op, FLAG_CLIENT_SENT); |
|
|
667 | } |
508 | } |
668 | |
509 | |
669 | /** |
510 | /** |
670 | * Tells the client to delete an item. |
511 | * Tells the client to delete an item. |
671 | */ |
512 | */ |
… | |
… | |
691 | |
532 | |
692 | /** |
533 | /** |
693 | * Takes a player and object count (tag) and returns the actual object |
534 | * Takes a player and object count (tag) and returns the actual object |
694 | * pointer, or null if it can't be found. |
535 | * pointer, or null if it can't be found. |
695 | */ |
536 | */ |
696 | object * |
537 | static object * |
697 | esrv_get_ob_from_count (object *pl, tag_t count) |
538 | esrv_get_ob_from_count (object *pl, tag_t count) |
698 | { |
539 | { |
699 | if (pl->count == count) |
540 | if (pl->count == count) |
700 | return pl; |
541 | return pl; |
701 | |
542 | |
702 | for (object *op = pl->inv; op; op = op->below) |
543 | for (object *op = pl->inv; op; op = op->below) |
703 | if (op->count == count) |
544 | if (op->count == count) |
704 | return op; |
545 | return op; |
705 | else if (op->type == CONTAINER && pl->container == op) |
546 | else if (op->type == CONTAINER && pl->container_ () == op) |
706 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
547 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
707 | if (tmp->count == count) |
548 | if (tmp->count == count) |
708 | return tmp; |
549 | return tmp; |
709 | |
550 | |
710 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
551 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
711 | if (op->head && op->head->count == count) |
552 | if (op->head && op->head->count == count) |
712 | return op; |
553 | return op; |
713 | else if (op->count == count) |
554 | else if (op->count == count) |
714 | return op; |
555 | return op; |
715 | else if (op->type == CONTAINER && pl->container == op) |
556 | else if (op->type == CONTAINER && pl->container_ () == op) |
716 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
557 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
717 | if (tmp->count == count) |
558 | if (tmp->count == count) |
718 | return tmp; |
559 | return tmp; |
719 | |
560 | |
720 | #if 0 |
561 | #if 0 |
… | |
… | |
730 | void |
571 | void |
731 | ExamineCmd (char *buf, int len, player *pl) |
572 | ExamineCmd (char *buf, int len, player *pl) |
732 | { |
573 | { |
733 | tag_t tag = atoi (buf); |
574 | tag_t tag = atoi (buf); |
734 | |
575 | |
735 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
|
|
736 | |
|
|
737 | if (!op) |
|
|
738 | { |
|
|
739 | LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
|
|
740 | return; |
|
|
741 | } |
|
|
742 | |
|
|
743 | examine (pl->ob, op); |
|
|
744 | } |
|
|
745 | |
|
|
746 | /** Client wants to examine some object. So lets do so. */ |
|
|
747 | void |
|
|
748 | ExCmd (char *buf, int len, player *pl) |
|
|
749 | { |
|
|
750 | tag_t tag = atoi (buf); |
|
|
751 | |
|
|
752 | if (object *op = esrv_get_ob_from_count (pl->ob, tag)) |
|
|
753 | { |
|
|
754 | std::string s = op->describe (pl->ob); |
|
|
755 | |
|
|
756 | packet sl ("ex"); |
|
|
757 | sl << ber32 (tag) << s.c_str (); |
|
|
758 | |
|
|
759 | pl->ns->send_packet (sl); |
|
|
760 | } |
|
|
761 | } |
|
|
762 | |
|
|
763 | /** Client wants to apply some object. Lets do so. */ |
|
|
764 | void |
|
|
765 | ApplyCmd (char *buf, int len, player *pl) |
|
|
766 | { |
|
|
767 | tag_t tag = atoi (buf); |
|
|
768 | |
|
|
769 | /* sort of a hack, but if the player saves and the player then manually |
|
|
770 | * applies a savebed (or otherwise tries to do stuff), we run into trouble. |
|
|
771 | */ |
|
|
772 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
773 | return; |
|
|
774 | |
|
|
775 | /* If the high bit is set, player applied a pseudo object. */ |
576 | /* If the high bit is set, player applied a pseudo object. */ |
776 | if (tag & 0x80000000) |
577 | if (tag & 0x80000000) |
777 | { |
578 | { |
778 | pl->ns->look_position = tag & 0x7fffffff; |
579 | pl->ns->look_position = tag & 0x7fffffff; |
779 | pl->ns->floorbox_update (); |
580 | pl->ns->floorbox_update (); |
… | |
… | |
782 | |
583 | |
783 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
584 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
784 | |
585 | |
785 | if (!op) |
586 | if (!op) |
786 | { |
587 | { |
|
|
588 | LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
|
|
589 | return; |
|
|
590 | } |
|
|
591 | |
|
|
592 | examine (pl->ob, op); |
|
|
593 | } |
|
|
594 | |
|
|
595 | /** Client wants to examine some object. So lets do so. */ |
|
|
596 | void |
|
|
597 | ExCmd (char *buf, int len, player *pl) |
|
|
598 | { |
|
|
599 | tag_t tag = atoi (buf); |
|
|
600 | |
|
|
601 | if (object *op = esrv_get_ob_from_count (pl->ob, tag)) |
|
|
602 | { |
|
|
603 | std::string s = op->describe (pl->ob); |
|
|
604 | |
|
|
605 | packet sl ("ex"); |
|
|
606 | sl << ber32 (tag) |
|
|
607 | << data (*pl->expand_cfpod (s.c_str ())); |
|
|
608 | |
|
|
609 | pl->ns->send_packet (sl); |
|
|
610 | } |
|
|
611 | } |
|
|
612 | |
|
|
613 | /** Client wants to apply some object. Lets do so. */ |
|
|
614 | void |
|
|
615 | ApplyCmd (char *buf, int len, player *pl) |
|
|
616 | { |
|
|
617 | tag_t tag = atoi (buf); |
|
|
618 | |
|
|
619 | /* If the high bit is set, player applied a pseudo object. */ |
|
|
620 | if (tag & 0x80000000) |
|
|
621 | { |
|
|
622 | pl->ns->look_position = tag & 0x7fffffff; |
|
|
623 | pl->ns->floorbox_update (); |
|
|
624 | return; |
|
|
625 | } |
|
|
626 | |
|
|
627 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
|
|
628 | |
|
|
629 | if (!op) |
|
|
630 | { |
787 | LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
631 | LOG (llevDebug, "Player '%s' tried to apply the unknown object (%d)\n", &pl->ob->name, tag); |
788 | return; |
632 | return; |
789 | } |
633 | } |
790 | |
634 | |
791 | player_apply (pl->ob, op, 0, 0); |
635 | pl->ob->apply (op, AP_TOGGLE); |
792 | } |
636 | } |
793 | |
637 | |
794 | /** Client wants to lock some object. Lets do so. */ |
638 | /** Client wants to lock some object. Lets do so. */ |
795 | void |
639 | void |
796 | LockItem (char *data, int len, player *pl) |
640 | LockItem (char *data, int len, player *pl) |
… | |
… | |
804 | pl->failmsg ("Could not find object to lock/unlock"); |
648 | pl->failmsg ("Could not find object to lock/unlock"); |
805 | return; |
649 | return; |
806 | } |
650 | } |
807 | |
651 | |
808 | if (!flag) |
652 | if (!flag) |
809 | CLEAR_FLAG (op, FLAG_INV_LOCKED); |
653 | op->clr_flag (FLAG_INV_LOCKED); |
810 | else |
654 | else |
811 | SET_FLAG (op, FLAG_INV_LOCKED); |
655 | op->set_flag (FLAG_INV_LOCKED); |
812 | |
656 | |
813 | esrv_update_item (UPD_FLAGS, pl->ob, op); |
657 | esrv_update_item (UPD_FLAGS, pl->ob, op); |
814 | } |
658 | } |
815 | |
659 | |
816 | /** Client wants to mark some object. Lets do so. */ |
660 | /** Client wants to mark some object. Lets do so. */ |
… | |
… | |
837 | * Tero.Haatanen@lut.fi ] |
681 | * Tero.Haatanen@lut.fi ] |
838 | */ |
682 | */ |
839 | static void |
683 | static void |
840 | look_at (player *pl, int dx, int dy) |
684 | look_at (player *pl, int dx, int dy) |
841 | { |
685 | { |
842 | dynbuf_text buf; |
686 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
843 | object *ob = pl->ob; |
687 | object *ob = pl->ob; |
844 | |
688 | |
845 | if (!pl->observe->map) |
689 | if (!pl->observe->map) |
846 | return; |
690 | return; |
|
|
691 | |
|
|
692 | bool wiz = ob->flag [FLAG_WIZ] || ob->flag [FLAG_WIZLOOK]; |
847 | |
693 | |
848 | mapxy pos (pl->observe); |
694 | mapxy pos (pl->observe); |
849 | pos.move (dx, dy); |
695 | pos.move (dx, dy); |
850 | |
696 | |
|
|
697 | if (wiz) |
|
|
698 | { |
851 | if (pos.normalise ()) |
699 | if (pos.normalise ()) |
|
|
700 | { |
|
|
701 | mapspace &ms = *pos; |
|
|
702 | ms.update (); |
|
|
703 | |
|
|
704 | buf.printf (" map: %s%+d%+d (%+d%+d)\n" |
|
|
705 | " smell %u/%u; flags %x; light %d; block %x; slow %x; on %x; off %x; items %d, volume %lld\n\n", |
|
|
706 | &pos.m->path, pos.x, pos.y, dx, dy, |
|
|
707 | (unsigned int)ms.smell, (unsigned int)mapspace::smellcount, ms.flags (), ms.light, |
|
|
708 | ms.move_block, ms.move_slow, ms.move_on, ms.move_off, (int)ms.items (), (long long)ms.volume () |
|
|
709 | ); |
|
|
710 | } |
|
|
711 | else |
|
|
712 | buf << "off-map\n\n"; |
|
|
713 | } |
|
|
714 | |
|
|
715 | int darkness = pl->blocked_los (dx, dy); |
|
|
716 | |
|
|
717 | if (darkness == LOS_BLOCKED) |
|
|
718 | buf << "You cannot see that place from your position. H<Something is in between or it is too far away.>"; |
|
|
719 | else if (darkness == LOS_MAX) |
|
|
720 | buf << "That place is too dark to see anything. H<Move nearer or find better lighting.>"; |
|
|
721 | else |
|
|
722 | { |
|
|
723 | if (pos.normalise ()) |
852 | for (object *tmp = pos->top; tmp; tmp = tmp->below) |
724 | for (object *tmp = pos->top; tmp; tmp = tmp->below) |
853 | { |
725 | { |
854 | if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
726 | if (tmp->invisible && !ob->flag [FLAG_WIZ]) |
855 | continue; |
727 | continue; |
856 | |
728 | |
857 | if (QUERY_FLAG (ob, FLAG_WIZ)) |
729 | if (wiz) |
858 | buf.printf ("- %s (%d).\n", query_name (tmp), tmp->count); |
730 | buf.printf (" - %s (%d) %s\n", query_name (tmp), tmp->count, tmp->uuid.c_str ()); |
859 | else |
731 | else |
860 | buf.printf ("- %s.\n", query_name (tmp)); |
732 | buf.printf (" - %s.\n", query_name (tmp)); |
861 | |
733 | |
862 | object *head = tmp->head_ (); |
734 | object *head = tmp->head_ (); |
863 | |
735 | |
864 | if (head->inv) |
736 | if (head->inv) |
865 | if ((head->type != CONTAINER && head->type != FLESH) |
737 | if ((head->type != CONTAINER && head->type != FLESH) |
866 | || QUERY_FLAG (ob, FLAG_WIZ)) |
738 | || ob->flag [FLAG_WIZ]) |
867 | buf << head->query_inventory (ob, " "); |
739 | buf << head->query_inventory (ob, " "); |
868 | |
740 | |
869 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !QUERY_FLAG (ob, FLAG_WIZ)) /* don't continue under the floor */ |
741 | if (tmp->flag [FLAG_IS_FLOOR] && !wiz) /* don't continue under the floor */ |
870 | break; |
742 | break; |
|
|
743 | } |
871 | } |
744 | } |
872 | |
745 | |
873 | if (buf.empty ()) |
746 | if (buf.empty ()) |
874 | pl->failmsg ("You see nothing there."); |
747 | buf << "You see nothing there."; |
875 | else |
748 | |
876 | pl->infobox (MSG_CHANNEL ("lookat"), buf); |
749 | pl->infobox (MSG_CHANNEL ("lookat"), buf); |
877 | } |
750 | } |
878 | |
751 | |
879 | /** Client wants to look at some object. Lets do so. */ |
752 | /** Client wants to look at some object. Lets do so. */ |
880 | void |
753 | void |
881 | LookAt (char *buf, int len, player *pl) |
754 | LookAt (char *buf, int len, player *pl) |
… | |
… | |
886 | if (!(cp = strchr (buf, ' '))) |
759 | if (!(cp = strchr (buf, ' '))) |
887 | return; |
760 | return; |
888 | |
761 | |
889 | int dy = atoi (cp); |
762 | int dy = atoi (cp); |
890 | |
763 | |
891 | if (player *opl = pl->observe->contr) |
|
|
892 | if (client *ns = opl->ns) |
|
|
893 | { |
|
|
894 | if (fabs (dx) > ns->mapx / 2 || fabs (dy) > ns->mapy / 2) |
|
|
895 | return; |
|
|
896 | |
|
|
897 | if (opl->blocked_los[dx + ns->mapx / 2][dy + ns->mapy / 2]) |
|
|
898 | return; |
|
|
899 | } |
|
|
900 | |
|
|
901 | look_at (pl, dx, dy); |
764 | look_at (pl, dx, dy); |
902 | } |
765 | } |
903 | |
766 | |
904 | /** Move an object to a new location */ |
767 | /** Move an object to a new location */ |
905 | void |
768 | void |
906 | esrv_move_object (object *pl, tag_t to, tag_t tag, long nrof) |
769 | esrv_move_object (object *pl, tag_t to, tag_t tag, long nrof) |
907 | { |
770 | { |
908 | object *op, *env; |
|
|
909 | |
|
|
910 | op = esrv_get_ob_from_count (pl, tag); |
771 | object *op = esrv_get_ob_from_count (pl, tag); |
911 | if (!op) |
772 | if (!op) |
912 | { |
773 | { |
913 | LOG (llevDebug, "Player '%s' tried to move an unknown object (%ld)\n", &pl->name, tag); |
774 | LOG (llevDebug, "Player '%s' tried to move an unknown object (%ld)\n", &pl->name, tag); |
914 | return; |
775 | return; |
915 | } |
776 | } |
… | |
… | |
920 | return; |
781 | return; |
921 | |
782 | |
922 | /* If it is an active container, then we should drop all objects |
783 | /* If it is an active container, then we should drop all objects |
923 | * in the container and not the container itself. |
784 | * in the container and not the container itself. |
924 | */ |
785 | */ |
925 | if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
786 | if (op->inv && op->flag [FLAG_APPLIED]) |
926 | { |
787 | { |
927 | object *current, *next; |
|
|
928 | |
|
|
929 | int cnt = MAX_ITEM_PER_DROP; |
788 | int cnt = MAX_ITEM_PER_ACTION; |
930 | |
789 | |
931 | for (current = op->inv; current != NULL; current = next) |
790 | for (object *current = op->inv; current && cnt--; ) |
932 | { |
791 | { |
933 | next = current->below; |
792 | object *next = current->below; |
934 | drop_object (pl, current, 0); |
793 | drop_object (pl, current, 0); |
935 | |
794 | current = next; |
936 | if (--cnt <= 0) break; |
|
|
937 | } |
795 | } |
938 | |
796 | |
939 | if (cnt <= 0) |
797 | if (cnt <= 0) |
940 | op->failmsg ("Only dropped some items, can't drop that many items at once."); |
798 | op->failmsg ("Only dropped some items, can't drop that many items at once."); |
941 | |
|
|
942 | esrv_update_item (UPD_WEIGHT, pl, op); |
|
|
943 | } |
799 | } |
944 | else |
800 | else |
945 | drop_object (pl, op, nrof); |
801 | drop_object (pl, op, nrof); |
946 | |
|
|
947 | update_after_inventory_change (pl); |
|
|
948 | |
802 | |
949 | return; |
803 | return; |
950 | } |
804 | } |
951 | else if (to == pl->count) |
805 | else if (to == pl->count) |
952 | { /* pick it up to the inventory */ |
806 | { /* pick it up to the inventory */ |
… | |
… | |
957 | pl->contr->count = nrof; |
811 | pl->contr->count = nrof; |
958 | pick_up (pl, op); |
812 | pick_up (pl, op); |
959 | return; |
813 | return; |
960 | } |
814 | } |
961 | |
815 | |
962 | env = esrv_get_ob_from_count (pl, to); |
816 | object *env = esrv_get_ob_from_count (pl, to); |
963 | if (!env) |
817 | if (!env) |
964 | { |
818 | { |
965 | LOG (llevDebug, "Player '%s' tried to move object to the unknown location (%d)\n", &pl->name, to); |
819 | LOG (llevDebug, "Player '%s' tried to move object to the unknown location (%d)\n", &pl->name, to); |
966 | return; |
820 | return; |
967 | } |
821 | } |
… | |
… | |
969 | /* put_object_in_sack presumes that necessary sanity checking |
823 | /* put_object_in_sack presumes that necessary sanity checking |
970 | * has already been done (eg, it can be picked up and fits in |
824 | * has already been done (eg, it can be picked up and fits in |
971 | * in a sack, so check for those things. We should also check |
825 | * in a sack, so check for those things. We should also check |
972 | * an make sure env is in fact a container for that matter. |
826 | * an make sure env is in fact a container for that matter. |
973 | */ |
827 | */ |
974 | if (env->type == CONTAINER && can_pick (pl, op) && sack_can_hold (pl, env, op, nrof)) |
828 | if (env->type == CONTAINER |
975 | { |
829 | && can_pick (pl, op) |
|
|
830 | && sack_can_hold (pl, env, op, nrof)) |
976 | put_object_in_sack (pl, env, op, nrof); |
831 | put_object_in_sack (pl, env, op, nrof); |
977 | update_after_inventory_change (pl); |
|
|
978 | } |
|
|
979 | } |
832 | } |
980 | |
833 | |