… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 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 | /** |
… | |
… | |
36 | #include <object.h> |
37 | #include <object.h> |
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 | #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 | |
42 | |
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 | * |
… | |
… | |
225 | default: |
86 | default: |
226 | flags = a_applied; |
87 | flags = a_applied; |
227 | break; |
88 | break; |
228 | } |
89 | } |
229 | |
90 | |
230 | if (op->type == CONTAINER && ((op->env && op->env->container == op) || (!op->env && QUERY_FLAG (op, FLAG_APPLIED)))) |
91 | if (op->is_open_container ()) |
231 | flags |= F_OPEN; |
92 | flags |= F_OPEN; |
232 | |
93 | |
233 | if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) |
94 | if (QUERY_FLAG (op, FLAG_KNOWN_CURSED)) |
234 | { |
95 | { |
235 | if (QUERY_FLAG (op, FLAG_DAMNED)) |
96 | if (QUERY_FLAG (op, FLAG_DAMNED)) |
… | |
… | |
253 | * animation of face to the client. |
114 | * animation of face to the client. |
254 | */ |
115 | */ |
255 | static void |
116 | static void |
256 | add_object_to_socklist (client &ns, packet &sl, object *head) |
117 | add_object_to_socklist (client &ns, packet &sl, object *head) |
257 | { |
118 | { |
258 | int flags, len, anim_speed; |
|
|
259 | char item_n[MAX_BUF]; |
|
|
260 | const char *item_p; |
|
|
261 | |
|
|
262 | flags = query_flags (head); |
119 | int flags = query_flags (head); |
|
|
120 | |
263 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
121 | if (QUERY_FLAG (head, FLAG_NO_PICK)) |
264 | flags |= F_NOPICK; |
122 | flags |= F_NOPICK; |
265 | |
123 | |
266 | ns.send_face (head->face, -50); |
124 | ns.send_face (head->face, -50); |
267 | ns.flush_fx (); |
125 | ns.flush_fx (); |
… | |
… | |
274 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) |
132 | << uint32 (QUERY_FLAG (head, FLAG_NO_PICK) ? -1 : head->client_weight ()) |
275 | << uint32 (head->face); |
133 | << uint32 (head->face); |
276 | |
134 | |
277 | if (!head->custom_name) |
135 | if (!head->custom_name) |
278 | { |
136 | { |
279 | strncpy (item_n, query_base_name (head, 0), 127); |
137 | const char *name; |
280 | item_n[127] = 0; |
138 | uint8 *len = sl.cur++; // patch up length later |
281 | len = strlen (item_n); |
139 | |
282 | item_p = query_base_name (head, 1); |
140 | name = query_base_name (head, 0); sl << data (name, min (127, strlen (name))); |
|
|
141 | sl << uint8 (0); |
|
|
142 | name = query_base_name (head, 1); sl << data (name, min (127, strlen (name))); |
|
|
143 | |
|
|
144 | *len = sl.cur - len - 1; |
283 | } |
145 | } |
284 | else |
146 | else |
285 | { |
147 | { |
286 | strncpy (item_n, head->custom_name, 127); |
148 | int len = min (head->custom_name.length (), 127); |
287 | item_n[127] = 0; |
|
|
288 | len = strlen (item_n); |
|
|
289 | item_p = head->custom_name; |
|
|
290 | } |
|
|
291 | |
149 | |
292 | strncpy (item_n + len + 1, item_p, 127); |
150 | sl << uint8 (len * 2 + 1) |
293 | item_n[254] = 0; |
151 | << data (head->custom_name, len) |
294 | len += strlen (item_n + 1 + len) + 1; |
152 | << uint8 (0) |
|
|
153 | << data (head->custom_name, len); |
|
|
154 | } |
295 | |
155 | |
296 | sl << data8 (item_n, len) |
|
|
297 | << uint16 (head->animation_id); |
156 | sl << uint16 (head->animation_id); |
298 | |
157 | |
299 | anim_speed = 0; |
158 | int anim_speed = !head->flag [FLAG_ANIMATE] ? 0 |
300 | if (QUERY_FLAG (head, FLAG_ANIMATE)) |
159 | : head->anim_speed ? clamp (head->anim_speed, 1, 255) |
301 | { |
160 | : 1. / clamp (fabs (head->speed), 1./255., 1./1.); |
302 | if (head->anim_speed) |
|
|
303 | anim_speed = head->anim_speed; |
|
|
304 | else |
|
|
305 | { |
|
|
306 | if (fabs (head->speed) < 0.001) |
|
|
307 | anim_speed = 255; |
|
|
308 | else if (fabs (head->speed) >= 1.0) |
|
|
309 | anim_speed = 1; |
|
|
310 | else |
|
|
311 | anim_speed = (int) (1.0 / fabs (head->speed)); |
|
|
312 | } |
|
|
313 | |
|
|
314 | if (anim_speed > 255) |
|
|
315 | anim_speed = 255; |
|
|
316 | } |
|
|
317 | |
161 | |
318 | sl << uint8 (anim_speed) |
162 | sl << uint8 (anim_speed) |
319 | << uint32 (head->nrof); |
163 | << uint32 (head->nrof); |
320 | |
164 | |
321 | if (ns.itemcmd == 2) |
165 | if (ns.itemcmd == 2) |
322 | sl << uint16 (head->client_type); |
166 | sl << uint16 (head->client_type); |
323 | |
|
|
324 | SET_FLAG (head, FLAG_CLIENT_SENT); |
|
|
325 | } |
167 | } |
|
|
168 | |
|
|
169 | static faceidx |
|
|
170 | need_face_now (player *pl, const char *name) |
|
|
171 | { |
|
|
172 | faceidx face = face_find (name, empty_face); |
|
|
173 | |
|
|
174 | pl->ns->send_face (face, -50); |
|
|
175 | pl->ns->flush_fx (); |
|
|
176 | |
|
|
177 | return face; |
|
|
178 | } |
|
|
179 | |
|
|
180 | #define FINGER_UP "finger_up.x11" |
|
|
181 | #define FINGER_DOWN "finger_down.x11" |
326 | |
182 | |
327 | /** |
183 | /** |
328 | * Send the look window. Don't need to do animations here |
184 | * Send the look window. Don't need to do animations here |
329 | * This sends all the faces to the client, not just updates. This is |
185 | * This sends all the faces to the client, not just updates. This is |
330 | * because object ordering would otherwise be inconsistent. |
186 | * because object ordering would otherwise be inconsistent. |
331 | */ |
187 | */ |
332 | void |
188 | void |
333 | esrv_draw_look (player *pl) |
189 | esrv_draw_look (player *pl) |
334 | { |
190 | { |
335 | int got_one = 0, start_look = 0, end_look = 0; |
|
|
336 | |
|
|
337 | object *ob = pl->ob; |
191 | object *ob = pl->ob; |
338 | |
192 | |
339 | if (!pl->ns->update_look) |
193 | if (!pl->ns->update_look) |
340 | { |
194 | { |
341 | LOG (llevDebug, "esrv_draw_look called when update_look was not set (player %s)\n", &ob->name); |
195 | LOG (llevDebug, "esrv_draw_look called when update_look was not set (player %s)\n", &ob->name); |
… | |
… | |
355 | packet sl; |
209 | packet sl; |
356 | sl.printf ("item%d ", pl->ns->itemcmd); |
210 | sl.printf ("item%d ", pl->ns->itemcmd); |
357 | |
211 | |
358 | sl << uint32 (0); |
212 | sl << uint32 (0); |
359 | |
213 | |
360 | pl->ns->send_face (empty_face, -50); |
214 | int start_pos = pl->ns->look_position; |
361 | pl->ns->flush_fx (); |
215 | bool dirty = false; |
362 | |
216 | |
363 | if (pl->ns->look_position) |
217 | mapspace &ms = ob->ms (); |
|
|
218 | |
|
|
219 | // manage a ring buffer of the "last FLOORBOX_PAGESIZE" items and |
|
|
220 | // start from the top |
|
|
221 | object *items [FLOORBOX_PAGESIZE]; |
|
|
222 | int item_idx = 0, item_cnt = 0; |
|
|
223 | int pos = 0; |
|
|
224 | |
|
|
225 | // find our items by walking down |
|
|
226 | object *item = ms.top; |
|
|
227 | |
|
|
228 | for (; item && item_cnt < FLOORBOX_PAGESIZE; item = item->below) |
|
|
229 | { |
|
|
230 | if (!item->client_visible ()) |
|
|
231 | continue; |
|
|
232 | |
|
|
233 | if (++pos < start_pos) |
|
|
234 | continue; |
|
|
235 | |
|
|
236 | // record item |
|
|
237 | items [item_idx] = item; item_idx = item_idx < FLOORBOX_PAGESIZE ? item_idx + 1 : 0; |
|
|
238 | item_cnt++; |
|
|
239 | |
|
|
240 | // stop at first floor |
|
|
241 | if (item->flag [FLAG_IS_FLOOR]) |
|
|
242 | { |
|
|
243 | // we are finished, don't append "next group of items" |
|
|
244 | // by setting item to ms.bot it becomes zero which is checked after the while loop |
|
|
245 | item = ms.bot; |
|
|
246 | } |
364 | { |
247 | } |
365 | char buf[80]; |
|
|
366 | snprintf (buf, 80, "Apply this to see %d previous items", FLOORBOX_PAGESIZE); |
|
|
367 | |
248 | |
|
|
249 | // see if there are more if we cared - we ignore invisible objects |
|
|
250 | if (item) |
|
|
251 | { |
|
|
252 | /* What we basically do is make a 'fake' object - when the user applies it, |
|
|
253 | * we notice the special tag the object has, and act accordingly. |
|
|
254 | */ |
368 | sl << uint32 (0x80000000 | (pl->ns->look_position - FLOORBOX_PAGESIZE)) |
255 | sl << uint32 (0x80000000 | (start_pos + FLOORBOX_PAGESIZE)) |
369 | << uint32 (0) |
256 | << uint32 (0) |
370 | << sint32 (-1) |
257 | << uint32 ((uint32) - 1) |
371 | << uint32 (empty_face) |
258 | << uint32 (need_face_now (pl, FINGER_DOWN)) |
372 | << data8 (buf) |
259 | << data8 ("Apply this to see the items below") |
373 | << uint16 (0) |
260 | << uint16 (0) |
374 | << uint8 (0) |
261 | << uint8 (0) |
375 | << uint32 (0); |
262 | << uint32 (0); |
376 | |
263 | |
377 | if (pl->ns->itemcmd == 2) |
264 | if (pl->ns->itemcmd == 2) |
378 | sl << uint16 (0); |
265 | sl << uint16 (0); |
379 | } |
|
|
380 | |
266 | |
381 | object *tmp = ob->ms ().top; |
267 | dirty = true; |
382 | for (object *last = 0; tmp != last; tmp = tmp->below) |
|
|
383 | { |
268 | } |
384 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !last) |
269 | |
|
|
270 | // now send out all items in the ring buffer in reverse order |
|
|
271 | while (item_cnt) |
|
|
272 | { |
|
|
273 | --item_cnt; |
|
|
274 | item_idx = (item_idx ? item_idx : FLOORBOX_PAGESIZE) - 1; |
|
|
275 | object *item = items [item_idx]; |
|
|
276 | |
|
|
277 | add_object_to_socklist (*pl->ns, sl, item->head_ ()); |
|
|
278 | |
|
|
279 | dirty = true; |
|
|
280 | |
|
|
281 | // if packet got too large, send it and begin a new one |
|
|
282 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
385 | { |
283 | { |
386 | last = tmp->below; /* assumes double floor mode */ |
284 | pl->ns->send_packet (sl); |
387 | if (last && QUERY_FLAG (last, FLAG_IS_FLOOR)) |
285 | |
388 | last = last->below; |
286 | sl.reset (); |
|
|
287 | sl.printf ("item%d ", pl->ns->itemcmd); |
|
|
288 | sl << uint32 (0); |
|
|
289 | |
|
|
290 | dirty = false; |
389 | } |
291 | } |
390 | |
|
|
391 | if (tmp->client_visible ()) |
|
|
392 | { |
|
|
393 | if (++start_look < pl->ns->look_position) |
|
|
394 | continue; |
|
|
395 | |
|
|
396 | end_look++; |
|
|
397 | |
|
|
398 | if (end_look > FLOORBOX_PAGESIZE) |
|
|
399 | { |
|
|
400 | /* What we basically do is make a 'fake' object - when the user applies it, |
|
|
401 | * we notice the special tag the object has, and act accordingly. |
|
|
402 | */ |
|
|
403 | sl << uint32 (0x80000000 | (pl->ns->look_position + FLOORBOX_PAGESIZE)) |
|
|
404 | << uint32 (0) |
|
|
405 | << uint32 ((uint32) - 1) |
|
|
406 | << uint32 (empty_face) |
|
|
407 | << data8 ("Apply this to see next group of items") |
|
|
408 | << uint16 (0) |
|
|
409 | << uint8 (0) |
|
|
410 | << uint32 (0); |
|
|
411 | |
|
|
412 | if (pl->ns->itemcmd == 2) |
|
|
413 | sl << uint16 (0); |
|
|
414 | |
|
|
415 | break; |
|
|
416 | } |
|
|
417 | |
|
|
418 | add_object_to_socklist (*pl->ns, sl, tmp->head_ ()); |
|
|
419 | got_one++; |
|
|
420 | |
|
|
421 | if (sl.length () > MAXSOCKBUF - MAXITEMLEN) |
|
|
422 | { |
|
|
423 | pl->ns->send_packet (sl); |
|
|
424 | |
|
|
425 | sl.reset (); |
|
|
426 | sl.printf ("item%d ", pl->ns->itemcmd); |
|
|
427 | sl << uint32 (0); |
|
|
428 | got_one = 0; |
|
|
429 | } |
|
|
430 | } |
|
|
431 | } |
292 | } |
432 | |
293 | |
433 | if (got_one) |
294 | if (start_pos) |
|
|
295 | { |
|
|
296 | sl << uint32 (0x80000000 | (start_pos - FLOORBOX_PAGESIZE)) |
|
|
297 | << uint32 (0) |
|
|
298 | << sint32 (-1) |
|
|
299 | << uint32 (need_face_now (pl, FINGER_UP)) |
|
|
300 | << data8 ("Apply this to see the items higher up") |
|
|
301 | << uint16 (0) |
|
|
302 | << uint8 (0) |
|
|
303 | << uint32 (0); |
|
|
304 | |
|
|
305 | if (pl->ns->itemcmd == 2) |
|
|
306 | sl << uint16 (0); |
|
|
307 | |
|
|
308 | dirty = true; |
|
|
309 | } |
|
|
310 | |
|
|
311 | if (dirty) |
434 | pl->ns->send_packet (sl); |
312 | pl->ns->send_packet (sl); |
435 | |
|
|
436 | } |
313 | } |
437 | |
314 | |
438 | /** |
315 | /** |
439 | * Sends whole inventory. |
316 | * Sends whole inventory. |
440 | */ |
317 | */ |
… | |
… | |
504 | |
381 | |
505 | client *ns = pl->contr->ns; |
382 | client *ns = pl->contr->ns; |
506 | if (!ns) |
383 | if (!ns) |
507 | return; |
384 | return; |
508 | |
385 | |
509 | if (!QUERY_FLAG (op, FLAG_CLIENT_SENT)) |
|
|
510 | { |
|
|
511 | /* FLAG_CLIENT_SENT is debug only. We are using it to see where |
|
|
512 | * this is happening - we can set a breakpoint here in the debugger |
|
|
513 | * and track back the call. |
|
|
514 | */ |
|
|
515 | LOG (llevDebug, "We have not sent item %s (%d)\n", &op->name, op->count); |
|
|
516 | } |
|
|
517 | |
|
|
518 | packet sl ("upditem"); |
386 | packet sl ("upditem"); |
519 | |
387 | |
520 | sl << uint8 (flags); |
388 | sl << uint8 (flags); |
521 | |
389 | |
522 | op = op->head_ (); |
390 | op = op->head_ (); |
… | |
… | |
529 | if (flags & UPD_FLAGS) |
397 | if (flags & UPD_FLAGS) |
530 | sl << uint32 (query_flags (op)); |
398 | sl << uint32 (query_flags (op)); |
531 | |
399 | |
532 | if (flags & UPD_WEIGHT) |
400 | if (flags & UPD_WEIGHT) |
533 | { |
401 | { |
534 | sint32 weight = op->flag [FLAG_NO_PICK] ? -1 : op->client_weight (); |
402 | sint32 weight = op->client_weight (); |
535 | |
403 | |
536 | if (op) |
404 | if (op == pl) |
537 | ns->last_weight = weight; |
405 | ns->last_weight = weight; |
538 | |
406 | |
539 | sl << uint32 (weight); |
407 | sl << uint32 (weight); |
540 | } |
408 | } |
541 | |
409 | |
… | |
… | |
548 | |
416 | |
549 | if (flags & UPD_NAME) |
417 | if (flags & UPD_NAME) |
550 | { |
418 | { |
551 | int len; |
419 | int len; |
552 | const char *item_p; |
420 | const char *item_p; |
553 | char item_n[MAX_BUF]; |
421 | char item_n[127 * 2]; |
554 | |
422 | |
555 | if (!op->custom_name) |
423 | if (!op->custom_name) |
556 | { |
424 | { |
557 | strncpy (item_n, query_base_name (op, 0), 127); |
425 | len = assign (item_n, query_base_name (op, 0), 127); |
558 | item_n[127] = 0; |
|
|
559 | len = strlen (item_n); |
|
|
560 | item_p = query_base_name (op, 1); |
426 | item_p = query_base_name (op, 1); |
561 | } |
427 | } |
562 | else |
428 | else |
563 | { |
429 | { |
564 | strncpy (item_n, op->custom_name, 127); |
430 | len = assign (item_n, &op->custom_name, 127); |
565 | item_n[127] = 0; |
|
|
566 | len = strlen (item_n); |
|
|
567 | item_p = op->custom_name; |
431 | item_p = &op->custom_name; |
568 | } |
432 | } |
569 | |
433 | |
570 | strncpy (item_n + len + 1, item_p, 127); |
434 | len += assign (item_n + len, item_p, 127); |
571 | item_n[254] = 0; |
|
|
572 | len += strlen (item_n + 1 + len) + 1; |
|
|
573 | |
435 | |
574 | sl << data8 (item_n, len); |
436 | sl << data8 (item_n, len); |
575 | } |
437 | } |
576 | |
438 | |
577 | if (flags & UPD_ANIM) |
439 | if (flags & UPD_ANIM) |
… | |
… | |
630 | sl << uint32 (op->env ? op->env->count : 0); |
492 | sl << uint32 (op->env ? op->env->count : 0); |
631 | |
493 | |
632 | add_object_to_socklist (*pl->contr->ns, sl, op); |
494 | add_object_to_socklist (*pl->contr->ns, sl, op); |
633 | |
495 | |
634 | pl->contr->ns->send_packet (sl); |
496 | pl->contr->ns->send_packet (sl); |
635 | SET_FLAG (op, FLAG_CLIENT_SENT); |
|
|
636 | } |
497 | } |
637 | |
498 | |
638 | /** |
499 | /** |
639 | * Tells the client to delete an item. |
500 | * Tells the client to delete an item. |
640 | */ |
501 | */ |
… | |
… | |
669 | return pl; |
530 | return pl; |
670 | |
531 | |
671 | for (object *op = pl->inv; op; op = op->below) |
532 | for (object *op = pl->inv; op; op = op->below) |
672 | if (op->count == count) |
533 | if (op->count == count) |
673 | return op; |
534 | return op; |
674 | else if (op->type == CONTAINER && pl->container == op) |
535 | else if (op->type == CONTAINER && pl->container_ () == op) |
675 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
536 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
676 | if (tmp->count == count) |
537 | if (tmp->count == count) |
677 | return tmp; |
538 | return tmp; |
678 | |
539 | |
679 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
540 | for (object *op = GET_MAP_OB (pl->map, pl->x, pl->y); op; op = op->above) |
680 | if (op->head && op->head->count == count) |
541 | if (op->head && op->head->count == count) |
681 | return op; |
542 | return op; |
682 | else if (op->count == count) |
543 | else if (op->count == count) |
683 | return op; |
544 | return op; |
684 | else if (op->type == CONTAINER && pl->container == op) |
545 | else if (op->type == CONTAINER && pl->container_ () == op) |
685 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
546 | for (object *tmp = op->inv; tmp; tmp = tmp->below) |
686 | if (tmp->count == count) |
547 | if (tmp->count == count) |
687 | return tmp; |
548 | return tmp; |
688 | |
549 | |
689 | #if 0 |
550 | #if 0 |
… | |
… | |
699 | void |
560 | void |
700 | ExamineCmd (char *buf, int len, player *pl) |
561 | ExamineCmd (char *buf, int len, player *pl) |
701 | { |
562 | { |
702 | tag_t tag = atoi (buf); |
563 | tag_t tag = atoi (buf); |
703 | |
564 | |
|
|
565 | /* If the high bit is set, player applied a pseudo object. */ |
|
|
566 | if (tag & 0x80000000) |
|
|
567 | { |
|
|
568 | pl->ns->look_position = tag & 0x7fffffff; |
|
|
569 | pl->ns->floorbox_update (); |
|
|
570 | return; |
|
|
571 | } |
|
|
572 | |
704 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
573 | object *op = esrv_get_ob_from_count (pl->ob, tag); |
705 | |
574 | |
706 | if (!op) |
575 | if (!op) |
707 | { |
576 | { |
708 | LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
577 | LOG (llevDebug, "Player '%s' tried to examine the unknown object (%ld)\n", &pl->ob->name, tag); |
… | |
… | |
721 | if (object *op = esrv_get_ob_from_count (pl->ob, tag)) |
590 | if (object *op = esrv_get_ob_from_count (pl->ob, tag)) |
722 | { |
591 | { |
723 | std::string s = op->describe (pl->ob); |
592 | std::string s = op->describe (pl->ob); |
724 | |
593 | |
725 | packet sl ("ex"); |
594 | packet sl ("ex"); |
726 | sl << ber32 (tag) << s.c_str (); |
595 | sl << ber32 (tag) |
|
|
596 | << data (*pl->expand_cfpod (s.c_str ())); |
727 | |
597 | |
728 | pl->ns->send_packet (sl); |
598 | pl->ns->send_packet (sl); |
729 | } |
599 | } |
730 | } |
600 | } |
731 | |
601 | |
732 | /** Client wants to apply some object. Lets do so. */ |
602 | /** Client wants to apply some object. Lets do so. */ |
733 | void |
603 | void |
734 | ApplyCmd (char *buf, int len, player *pl) |
604 | ApplyCmd (char *buf, int len, player *pl) |
735 | { |
605 | { |
736 | tag_t tag = atoi (buf); |
606 | tag_t tag = atoi (buf); |
737 | |
|
|
738 | /* sort of a hack, but if the player saves and the player then manually |
|
|
739 | * applies a savebed (or otherwise tries to do stuff), we run into trouble. |
|
|
740 | */ |
|
|
741 | if (QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
742 | return; |
|
|
743 | |
607 | |
744 | /* If the high bit is set, player applied a pseudo object. */ |
608 | /* If the high bit is set, player applied a pseudo object. */ |
745 | if (tag & 0x80000000) |
609 | if (tag & 0x80000000) |
746 | { |
610 | { |
747 | pl->ns->look_position = tag & 0x7fffffff; |
611 | pl->ns->look_position = tag & 0x7fffffff; |
… | |
… | |
806 | * Tero.Haatanen@lut.fi ] |
670 | * Tero.Haatanen@lut.fi ] |
807 | */ |
671 | */ |
808 | static void |
672 | static void |
809 | look_at (player *pl, int dx, int dy) |
673 | look_at (player *pl, int dx, int dy) |
810 | { |
674 | { |
811 | dynbuf_text buf; |
675 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
812 | object *ob = pl->ob; |
676 | object *ob = pl->ob; |
813 | |
677 | |
814 | if (!pl->observe->map) |
678 | if (!pl->observe->map) |
815 | return; |
679 | return; |
816 | |
680 | |
|
|
681 | bool wiz = ob->flag [FLAG_WIZ] || ob->flag [FLAG_WIZLOOK]; |
|
|
682 | |
817 | mapxy pos (pl->observe); |
683 | mapxy pos (pl->observe); |
818 | pos.move (dx, dy); |
684 | pos.move (dx, dy); |
819 | |
685 | |
|
|
686 | if (wiz) |
|
|
687 | { |
820 | if (pos.normalise ()) |
688 | if (pos.normalise ()) |
|
|
689 | { |
|
|
690 | mapspace &ms = *pos; |
|
|
691 | ms.update (); |
|
|
692 | |
|
|
693 | buf.printf (" map: %s%+d%+d (%+d%+d)\n" |
|
|
694 | " smell %u/%u; flags %x; light %d; block %x; slow %x; on %x; off %x; volume %lld\n\n", |
|
|
695 | &pos.m->path, pos.x, pos.y, dx, dy, |
|
|
696 | (unsigned int)ms.smell, (unsigned int)mapspace::smellcount, ms.flags (), ms.light, |
|
|
697 | ms.move_block, ms.move_slow, ms.move_on, ms.move_off, (long long)ms.volume () |
|
|
698 | ); |
|
|
699 | } |
|
|
700 | else |
|
|
701 | buf << "off-map\n\n"; |
|
|
702 | } |
|
|
703 | |
|
|
704 | int darkness = pl->blocked_los (dx, dy); |
|
|
705 | |
|
|
706 | if (darkness == LOS_BLOCKED) |
|
|
707 | buf << "You cannot see that place from your position. H<Something is in between or it is too far away.>"; |
|
|
708 | else if (darkness == LOS_MAX) |
|
|
709 | buf << "That place is too dark to see anything. H<Move nearer or find better lighting.>"; |
|
|
710 | else |
|
|
711 | { |
|
|
712 | if (pos.normalise ()) |
821 | for (object *tmp = pos->top; tmp; tmp = tmp->below) |
713 | for (object *tmp = pos->top; tmp; tmp = tmp->below) |
822 | { |
714 | { |
823 | if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
715 | if (tmp->invisible && !QUERY_FLAG (ob, FLAG_WIZ)) |
824 | continue; |
716 | continue; |
825 | |
717 | |
826 | if (QUERY_FLAG (ob, FLAG_WIZ)) |
718 | if (wiz) |
827 | buf.printf ("- %s (%d).\n", query_name (tmp), tmp->count); |
719 | buf.printf (" - %s (%d).\n", query_name (tmp), tmp->count); |
828 | else |
720 | else |
829 | buf.printf ("- %s.\n", query_name (tmp)); |
721 | buf.printf (" - %s.\n", query_name (tmp)); |
830 | |
722 | |
831 | object *head = tmp->head_ (); |
723 | object *head = tmp->head_ (); |
832 | |
724 | |
833 | if (head->inv) |
725 | if (head->inv) |
834 | if ((head->type != CONTAINER && head->type != FLESH) |
726 | if ((head->type != CONTAINER && head->type != FLESH) |
835 | || QUERY_FLAG (ob, FLAG_WIZ)) |
727 | || QUERY_FLAG (ob, FLAG_WIZ)) |
836 | buf << head->query_inventory (ob, " "); |
728 | buf << head->query_inventory (ob, " "); |
837 | |
729 | |
838 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !QUERY_FLAG (ob, FLAG_WIZ)) /* don't continue under the floor */ |
730 | if (QUERY_FLAG (tmp, FLAG_IS_FLOOR) && !wiz) /* don't continue under the floor */ |
839 | break; |
731 | break; |
|
|
732 | } |
840 | } |
733 | } |
841 | |
734 | |
842 | if (buf.empty ()) |
735 | if (buf.empty ()) |
843 | pl->failmsg ("You see nothing there."); |
736 | buf << "You see nothing there."; |
844 | else |
737 | |
845 | pl->infobox (MSG_CHANNEL ("lookat"), buf); |
738 | pl->infobox (MSG_CHANNEL ("lookat"), buf); |
846 | } |
739 | } |
847 | |
740 | |
848 | /** Client wants to look at some object. Lets do so. */ |
741 | /** Client wants to look at some object. Lets do so. */ |
849 | void |
742 | void |
850 | LookAt (char *buf, int len, player *pl) |
743 | LookAt (char *buf, int len, player *pl) |
… | |
… | |
855 | if (!(cp = strchr (buf, ' '))) |
748 | if (!(cp = strchr (buf, ' '))) |
856 | return; |
749 | return; |
857 | |
750 | |
858 | int dy = atoi (cp); |
751 | int dy = atoi (cp); |
859 | |
752 | |
860 | if (player *opl = pl->observe->contr) |
|
|
861 | if (client *ns = opl->ns) |
|
|
862 | { |
|
|
863 | if (fabs (dx) > ns->mapx / 2 || fabs (dy) > ns->mapy / 2) |
|
|
864 | return; |
|
|
865 | |
|
|
866 | if (opl->blocked_los[dx + ns->mapx / 2][dy + ns->mapy / 2]) |
|
|
867 | return; |
|
|
868 | } |
|
|
869 | |
|
|
870 | look_at (pl, dx, dy); |
753 | look_at (pl, dx, dy); |
871 | } |
754 | } |
872 | |
755 | |
873 | /** Move an object to a new location */ |
756 | /** Move an object to a new location */ |
874 | void |
757 | void |
875 | esrv_move_object (object *pl, tag_t to, tag_t tag, long nrof) |
758 | esrv_move_object (object *pl, tag_t to, tag_t tag, long nrof) |
876 | { |
759 | { |
877 | object *op, *env; |
|
|
878 | |
|
|
879 | op = esrv_get_ob_from_count (pl, tag); |
760 | object *op = esrv_get_ob_from_count (pl, tag); |
880 | if (!op) |
761 | if (!op) |
881 | { |
762 | { |
882 | LOG (llevDebug, "Player '%s' tried to move an unknown object (%ld)\n", &pl->name, tag); |
763 | LOG (llevDebug, "Player '%s' tried to move an unknown object (%ld)\n", &pl->name, tag); |
883 | return; |
764 | return; |
884 | } |
765 | } |
… | |
… | |
893 | */ |
774 | */ |
894 | if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
775 | if (op->inv && QUERY_FLAG (op, FLAG_APPLIED)) |
895 | { |
776 | { |
896 | int cnt = MAX_ITEM_PER_DROP; |
777 | int cnt = MAX_ITEM_PER_DROP; |
897 | |
778 | |
898 | for (object *current = op->inv; current; ) |
779 | for (object *current = op->inv; current && cnt--; ) |
899 | { |
780 | { |
900 | object *next = current->below; |
781 | object *next = current->below; |
901 | |
|
|
902 | drop_object (pl, current, 0); |
782 | drop_object (pl, current, 0); |
903 | |
|
|
904 | if (--cnt <= 0) break; |
|
|
905 | |
|
|
906 | current = next; |
783 | current = next; |
907 | } |
784 | } |
908 | |
785 | |
909 | if (cnt <= 0) |
786 | if (cnt <= 0) |
910 | op->failmsg ("Only dropped some items, can't drop that many items at once."); |
787 | op->failmsg ("Only dropped some items, can't drop that many items at once."); |
… | |
… | |
923 | pl->contr->count = nrof; |
800 | pl->contr->count = nrof; |
924 | pick_up (pl, op); |
801 | pick_up (pl, op); |
925 | return; |
802 | return; |
926 | } |
803 | } |
927 | |
804 | |
928 | env = esrv_get_ob_from_count (pl, to); |
805 | object *env = esrv_get_ob_from_count (pl, to); |
929 | if (!env) |
806 | if (!env) |
930 | { |
807 | { |
931 | LOG (llevDebug, "Player '%s' tried to move object to the unknown location (%d)\n", &pl->name, to); |
808 | LOG (llevDebug, "Player '%s' tried to move object to the unknown location (%d)\n", &pl->name, to); |
932 | return; |
809 | return; |
933 | } |
810 | } |