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,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel |
5 | * Copyright (©) 2001 Mark Wedel |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 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 | */ |
|
|
24 | |
|
|
25 | //+GPL |
23 | |
26 | |
24 | /** |
27 | /** |
25 | * \file |
28 | * \file |
26 | * Client handling. |
29 | * Client handling. |
27 | * |
30 | * |
… | |
… | |
41 | |
44 | |
42 | #include <global.h> |
45 | #include <global.h> |
43 | #include <sproto.h> |
46 | #include <sproto.h> |
44 | |
47 | |
45 | #include <living.h> |
48 | #include <living.h> |
46 | #include <commands.h> |
|
|
47 | |
49 | |
48 | /* This block is basically taken from socket.c - I assume if it works there, |
50 | /* This block is basically taken from socket.c - I assume if it works there, |
49 | * it should work here. |
51 | * it should work here. |
50 | */ |
52 | */ |
51 | #include <sys/types.h> |
53 | #include <sys/types.h> |
… | |
… | |
63 | * This table translates the attack numbers as used within the |
65 | * This table translates the attack numbers as used within the |
64 | * program to the value we use when sending STATS command to the |
66 | * program to the value we use when sending STATS command to the |
65 | * client. If a value is -1, then we don't send that to the |
67 | * client. If a value is -1, then we don't send that to the |
66 | * client. |
68 | * client. |
67 | */ |
69 | */ |
68 | short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
70 | static short atnr_cs_stat[NROFATTACKS] = |
69 | CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
71 | { |
70 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
72 | CS_STAT_RES_PHYS, |
71 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
73 | CS_STAT_RES_MAG, |
72 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
74 | CS_STAT_RES_FIRE, |
73 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
75 | CS_STAT_RES_ELEC, |
74 | CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
76 | CS_STAT_RES_COLD, |
75 | CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
77 | CS_STAT_RES_CONF, |
76 | -1 /* Chaos */ , -1 /* Counterspell */ , |
78 | CS_STAT_RES_ACID, |
77 | -1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
79 | CS_STAT_RES_DRAIN, |
|
|
80 | -1 /* weaponmagic */, |
|
|
81 | CS_STAT_RES_GHOSTHIT, |
|
|
82 | CS_STAT_RES_POISON, |
|
|
83 | CS_STAT_RES_SLOW, |
|
|
84 | CS_STAT_RES_PARA, |
|
|
85 | CS_STAT_TURN_UNDEAD, |
|
|
86 | CS_STAT_RES_FEAR, |
|
|
87 | -1 /* Cancellation */, |
|
|
88 | CS_STAT_RES_DEPLETE, |
|
|
89 | CS_STAT_RES_DEATH, |
|
|
90 | -1 /* Chaos */, |
|
|
91 | -1 /* Counterspell */, |
|
|
92 | -1 /* Godpower */, |
|
|
93 | CS_STAT_RES_HOLYWORD, |
78 | CS_STAT_RES_BLIND, |
94 | CS_STAT_RES_BLIND, |
79 | -1, /* Internal */ |
95 | -1, /* Internal */ |
80 | -1, /* life stealing */ |
96 | -1, /* life stealing */ |
81 | -1 /* Disease - not fully done yet */ |
97 | -1 /* Disease - not fully done yet */ |
82 | }; |
98 | }; |
… | |
… | |
98 | */ |
114 | */ |
99 | mx = ns->mapx; |
115 | mx = ns->mapx; |
100 | my = ns->mapy; |
116 | my = ns->mapy; |
101 | |
117 | |
102 | /* the x and y here are coordinates for the new map, i.e. if we moved |
118 | /* the x and y here are coordinates for the new map, i.e. if we moved |
103 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
119 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
104 | * if the destination x or y coordinate is outside the viewable |
120 | * if the destination x or y coordinate is outside the viewable |
105 | * area, we clear the values - otherwise, the old values |
121 | * area, we clear the values - otherwise, the old values |
106 | * are preserved, and the check_head thinks it needs to clear them. |
122 | * are preserved, and the check_head thinks it needs to clear them. |
107 | */ |
123 | */ |
108 | for (x = 0; x < mx; x++) |
124 | for (x = 0; x < mx; x++) |
109 | { |
|
|
110 | for (y = 0; y < my; y++) |
125 | for (y = 0; y < my; y++) |
111 | { |
|
|
112 | if (x >= ns->mapx || y >= ns->mapy) |
126 | if (x >= ns->mapx || y >= ns->mapy) |
113 | /* clear cells outside the viewable area */ |
127 | /* clear cells outside the viewable area */ |
114 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
128 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
115 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
129 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
116 | /* clear newly visible tiles within the viewable area */ |
130 | /* clear newly visible tiles within the viewable area */ |
117 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
131 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
118 | else |
132 | else |
119 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
133 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
120 | } |
|
|
121 | } |
|
|
122 | |
134 | |
123 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
135 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
124 | |
136 | |
125 | /* Make sure that the next "map1" command will be sent (even if it is |
137 | /* Make sure that the next "map1" command will be sent (even if it is |
126 | * empty). |
138 | * empty). |
… | |
… | |
129 | } |
141 | } |
130 | |
142 | |
131 | static void |
143 | static void |
132 | clear_map (player *pl) |
144 | clear_map (player *pl) |
133 | { |
145 | { |
|
|
146 | pl->ns->mapinfo_queue_clear (); |
|
|
147 | |
134 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
148 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
135 | |
149 | |
136 | pl->ns->force_newmap = false; |
150 | pl->ns->force_newmap = false; |
137 | |
151 | |
138 | if (pl->ns->newmapcmd == 1) |
152 | if (pl->ns->newmapcmd == 1) |
139 | pl->ns->send_packet ("newmap"); |
153 | pl->ns->send_packet ("newmap"); |
140 | |
154 | |
141 | pl->ns->floorbox_reset (); |
155 | pl->ns->floorbox_reset (); |
|
|
156 | } |
|
|
157 | |
|
|
158 | static void |
|
|
159 | send_map_info (player *pl) |
|
|
160 | { |
|
|
161 | client &socket = *pl->ns; |
|
|
162 | object *ob = pl->viewpoint; |
|
|
163 | |
|
|
164 | if (socket.mapinfocmd) |
|
|
165 | { |
|
|
166 | if (ob->map && ob->map->path[0]) |
|
|
167 | { |
|
|
168 | int flags = 0; |
|
|
169 | |
|
|
170 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
171 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
172 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
173 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
174 | |
|
|
175 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
176 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
177 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
178 | } |
|
|
179 | else |
|
|
180 | socket.send_packet ("mapinfo current"); |
|
|
181 | } |
142 | } |
182 | } |
143 | |
183 | |
144 | /** check for map/region change and send new map data */ |
184 | /** check for map/region change and send new map data */ |
145 | static void |
185 | static void |
146 | check_map_change (player *pl) |
186 | check_map_change (player *pl) |
147 | { |
187 | { |
148 | client &socket = *pl->ns; |
188 | client &socket = *pl->ns; |
149 | object *ob = pl->observe; |
189 | object *ob = pl->viewpoint; |
|
|
190 | |
|
|
191 | region *reg = ob->region (); |
|
|
192 | if (socket.current_region != reg) |
|
|
193 | { |
|
|
194 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
195 | socket.current_region = reg; |
|
|
196 | } |
|
|
197 | |
|
|
198 | // first try to aovid a full newmap on tiled map scrolls |
|
|
199 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
200 | { |
|
|
201 | rv_vector rv; |
|
|
202 | |
|
|
203 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
204 | |
|
|
205 | // manhattan distance is very handy here |
|
|
206 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
207 | { |
|
|
208 | socket.current_map = ob->map; |
|
|
209 | socket.current_x = ob->x; |
|
|
210 | socket.current_y = ob->y; |
|
|
211 | |
|
|
212 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
213 | socket.floorbox_reset (); |
|
|
214 | send_map_info (pl); |
|
|
215 | } |
|
|
216 | } |
150 | |
217 | |
151 | if (socket.current_map != ob->map || socket.force_newmap) |
218 | if (socket.current_map != ob->map || socket.force_newmap) |
152 | { |
219 | { |
153 | clear_map (pl); |
220 | clear_map (pl); |
154 | socket.current_map = ob->map; |
221 | socket.current_map = ob->map; |
155 | |
222 | send_map_info (pl); |
156 | if (socket.mapinfocmd) |
|
|
157 | { |
|
|
158 | if (ob->map && ob->map->path[0]) |
|
|
159 | { |
|
|
160 | int flags = 0; |
|
|
161 | |
|
|
162 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
163 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
164 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
165 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
166 | |
|
|
167 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
168 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
169 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
170 | } |
|
|
171 | else |
|
|
172 | socket.send_packet ("mapinfo current"); |
|
|
173 | } |
|
|
174 | } |
223 | } |
175 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
224 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
176 | { |
225 | { |
177 | int dx = ob->x - socket.current_x; |
226 | int dx = ob->x - socket.current_x; |
178 | int dy = ob->y - socket.current_y; |
227 | int dy = ob->y - socket.current_y; |
179 | |
228 | |
180 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
|
|
181 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
|
|
182 | else |
|
|
183 | { |
|
|
184 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
229 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
185 | socket.floorbox_reset (); |
230 | socket.floorbox_reset (); |
186 | } |
|
|
187 | } |
231 | } |
188 | |
232 | |
189 | socket.current_x = ob->x; |
233 | socket.current_x = ob->x; |
190 | socket.current_y = ob->y; |
234 | socket.current_y = ob->y; |
|
|
235 | } |
191 | |
236 | |
192 | region *reg = ob->region (); |
237 | /** |
193 | if (socket.current_region != reg) |
238 | * This sends the skill number to name mapping. We ignore |
194 | { |
239 | * the params - we always send the same info no matter what. |
195 | socket.current_region = reg; |
240 | */ |
196 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
241 | static void |
|
|
242 | send_skill_info (client *ns, char *params) |
|
|
243 | { |
|
|
244 | packet sl; |
|
|
245 | sl << "replyinfo skill_info\n"; |
|
|
246 | |
|
|
247 | for (int i = 0; i < skillvec.size (); ++i) |
|
|
248 | sl.printf ("%d:%s\n", CS_STAT_SKILLINFO + i, &skillvec [i]->name); |
|
|
249 | |
|
|
250 | if (sl.length () > MAXSOCKBUF) |
197 | } |
251 | { |
|
|
252 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
|
|
253 | fatal (0); |
|
|
254 | } |
|
|
255 | |
|
|
256 | ns->send_packet (sl); |
|
|
257 | } |
|
|
258 | |
|
|
259 | /** |
|
|
260 | * This sends the spell path to name mapping. We ignore |
|
|
261 | * the params - we always send the same info no matter what. |
|
|
262 | */ |
|
|
263 | static void |
|
|
264 | send_spell_paths (client * ns, char *params) |
|
|
265 | { |
|
|
266 | packet sl; |
|
|
267 | |
|
|
268 | sl << "replyinfo spell_paths\n"; |
|
|
269 | |
|
|
270 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
271 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
272 | |
|
|
273 | if (sl.length () > MAXSOCKBUF) |
|
|
274 | { |
|
|
275 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
276 | fatal (0); |
|
|
277 | } |
|
|
278 | |
|
|
279 | ns->send_packet (sl); |
198 | } |
280 | } |
199 | |
281 | |
200 | /** |
282 | /** |
201 | * RequestInfo is sort of a meta command. There is some specific |
283 | * RequestInfo is sort of a meta command. There is some specific |
202 | * request of information, but we call other functions to provide |
284 | * request of information, but we call other functions to provide |
… | |
… | |
215 | { |
297 | { |
216 | *params++ = 0; |
298 | *params++ = 0; |
217 | break; |
299 | break; |
218 | } |
300 | } |
219 | |
301 | |
220 | if (!strcmp (buf, "image_info")) |
|
|
221 | send_image_info (ns, params); |
|
|
222 | else if (!strcmp (buf, "image_sums")) |
|
|
223 | send_image_sums (ns, params); |
|
|
224 | else if (!strcmp (buf, "skill_info")) |
302 | if (!strcmp (buf, "skill_info")) |
225 | send_skill_info (ns, params); |
303 | send_skill_info (ns, params); |
226 | else if (!strcmp (buf, "spell_paths")) |
304 | else if (!strcmp (buf, "spell_paths")) |
227 | send_spell_paths (ns, params); |
305 | send_spell_paths (ns, params); |
228 | else |
306 | else |
229 | { |
307 | { |
… | |
… | |
245 | ExtiCmd (char *buf, int len, client *ns) |
323 | ExtiCmd (char *buf, int len, client *ns) |
246 | { |
324 | { |
247 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
325 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
248 | } |
326 | } |
249 | |
327 | |
|
|
328 | //-GPL |
|
|
329 | |
|
|
330 | void |
|
|
331 | client::mapinfo_queue_clear () |
|
|
332 | { |
|
|
333 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
|
|
334 | free (*i); |
|
|
335 | |
|
|
336 | mapinfo_queue.clear (); |
|
|
337 | } |
|
|
338 | |
|
|
339 | bool |
|
|
340 | client::mapinfo_try (char *buf) |
|
|
341 | { |
|
|
342 | char *token = buf; |
|
|
343 | buf += strlen (buf) + 9; |
|
|
344 | |
|
|
345 | // initial map and its origin |
|
|
346 | maptile *map = pl->viewpoint->map; |
|
|
347 | int mapx = pl->ns->mapx / 2 - pl->viewpoint->x; |
|
|
348 | int mapy = pl->ns->mapy / 2 - pl->viewpoint->y; |
|
|
349 | int max_distance = 8; // limit maximum path length to something generous |
|
|
350 | |
|
|
351 | while (*buf && map && max_distance) |
|
|
352 | { |
|
|
353 | int dir = *buf++ - '1'; |
|
|
354 | |
|
|
355 | if (dir >= 0 && dir <= 3) |
|
|
356 | { |
|
|
357 | if (!map->tile_path [dir]) |
|
|
358 | map = 0; |
|
|
359 | else if (map->tile_available (dir, false)) |
|
|
360 | { |
|
|
361 | maptile *neigh = map->tile_map [dir]; |
|
|
362 | |
|
|
363 | switch (dir) |
|
|
364 | { |
|
|
365 | case 0: mapy -= neigh->height; break; |
|
|
366 | case 2: mapy += map ->height; break; |
|
|
367 | case 3: mapx -= neigh->width ; break; |
|
|
368 | case 1: mapx += map ->width ; break; |
|
|
369 | } |
|
|
370 | |
|
|
371 | map = neigh; |
|
|
372 | --max_distance; |
|
|
373 | } |
|
|
374 | else |
|
|
375 | return 0; |
|
|
376 | } |
|
|
377 | else |
|
|
378 | max_distance = 0; |
|
|
379 | } |
|
|
380 | |
|
|
381 | if (!max_distance) |
|
|
382 | send_packet_printf ("mapinfo %s error", token); |
|
|
383 | else if (!map || !map->path) |
|
|
384 | send_packet_printf ("mapinfo %s nomap", token); |
|
|
385 | else |
|
|
386 | { |
|
|
387 | int flags = 0; |
|
|
388 | |
|
|
389 | if (map->tile_path[0]) flags |= 1; |
|
|
390 | if (map->tile_path[1]) flags |= 2; |
|
|
391 | if (map->tile_path[2]) flags |= 4; |
|
|
392 | if (map->tile_path[3]) flags |= 8; |
|
|
393 | |
|
|
394 | send_packet_printf ("mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
395 | } |
|
|
396 | |
|
|
397 | return 1; |
|
|
398 | } |
|
|
399 | |
|
|
400 | void |
|
|
401 | client::mapinfo_queue_run () |
|
|
402 | { |
|
|
403 | if (mapinfo_queue.empty () || !pl) |
|
|
404 | return; |
|
|
405 | |
|
|
406 | for (int i = 0; i < mapinfo_queue.size (); ++i) |
|
|
407 | if (mapinfo_try (mapinfo_queue [i])) |
|
|
408 | { |
|
|
409 | free (mapinfo_queue [i]); |
|
|
410 | mapinfo_queue.erase (i); |
|
|
411 | } |
|
|
412 | else |
|
|
413 | ++i; |
|
|
414 | } |
|
|
415 | |
250 | void |
416 | void |
251 | MapInfoCmd (char *buf, int len, player *pl) |
417 | MapInfoCmd (char *buf, int len, player *pl) |
252 | { |
418 | { |
253 | // <mapinfo tag spatial tile-path |
419 | // <mapinfo tag spatial tile-path |
254 | // >mapinfo tag spatial flags x y w h hash |
420 | // >mapinfo tag spatial flags x y w h hash |
255 | |
421 | |
256 | char bigbuf[MAX_BUF], *token; |
|
|
257 | |
|
|
258 | token = buf; |
422 | char *token = buf; |
259 | // copy token |
423 | |
260 | if (!(buf = strchr (buf, ' '))) |
424 | if (!(buf = strchr (buf, ' '))) |
261 | return; |
425 | return; |
262 | |
426 | |
263 | *buf++ = 0; |
|
|
264 | |
|
|
265 | if (!strncmp (buf, "spatial ", 8)) |
427 | if (!strncmp (buf, " spatial ", 9)) |
266 | { |
428 | { |
267 | buf += 8; |
429 | char *copy = strdup (token); |
|
|
430 | copy [buf - token] = 0; |
268 | |
431 | |
269 | // initial map and its origin |
432 | #if 0 |
270 | maptile *map = pl->ob->map; |
433 | // this makes only sense when we flush the buffer immediately |
271 | sint16 dx, dy; |
434 | if (pl->ns->mapinfo_try (copy)) |
272 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
435 | free (copy); |
273 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
|
|
274 | int max_distance = 8; // limit maximum path length to something generous |
|
|
275 | |
|
|
276 | while (*buf && map && max_distance) |
|
|
277 | { |
|
|
278 | int dir = *buf++; |
|
|
279 | |
|
|
280 | switch (dir) |
|
|
281 | { |
|
|
282 | case '1': |
|
|
283 | dx = 0; |
|
|
284 | dy = -1; |
|
|
285 | map = map->xy_find (dx, dy); |
|
|
286 | map && (mapy -= map->height); |
|
|
287 | break; |
|
|
288 | case '2': |
|
|
289 | mapx += map->width; |
|
|
290 | dx = map->width; |
|
|
291 | dy = 0; |
|
|
292 | map = map->xy_find (dx, dy); |
|
|
293 | break; |
|
|
294 | case '3': |
|
|
295 | mapy += map->height; |
|
|
296 | dx = 0; |
|
|
297 | dy = map->height; |
|
|
298 | map = map->xy_find (dx, dy); |
|
|
299 | break; |
|
|
300 | case '4': |
|
|
301 | dx = -1; |
|
|
302 | dy = 0; |
|
|
303 | map = map->xy_find (dx, dy); |
|
|
304 | map && (mapx -= map->width); |
|
|
305 | break; |
|
|
306 | } |
|
|
307 | |
|
|
308 | --max_distance; |
|
|
309 | } |
|
|
310 | |
|
|
311 | if (!max_distance) |
|
|
312 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
|
|
313 | else if (map && map->path[0]) |
|
|
314 | { |
|
|
315 | int flags = 0; |
|
|
316 | |
|
|
317 | if (map->tile_path[0]) flags |= 1; |
|
|
318 | if (map->tile_path[1]) flags |= 2; |
|
|
319 | if (map->tile_path[2]) flags |= 4; |
|
|
320 | if (map->tile_path[3]) flags |= 8; |
|
|
321 | |
|
|
322 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
|
|
323 | } |
|
|
324 | else |
436 | else |
325 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
437 | #endif |
|
|
438 | pl->ns->mapinfo_queue.push_back (copy); |
326 | } |
439 | } |
327 | else |
440 | else |
328 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
441 | pl->ns->send_packet_printf ("mapinfo %s unsupported", token); |
329 | |
|
|
330 | pl->ns->send_packet (bigbuf); |
|
|
331 | } |
442 | } |
332 | |
443 | |
333 | /** This is the Setup cmd */ |
444 | /** This is the Setup cmd */ |
334 | void |
445 | void |
335 | SetUp (char *buf, int len, client * ns) |
446 | SetUp (char *buf, int len, client * ns) |
… | |
… | |
347 | AddMeCmd (char *buf, int len, client *ns) |
458 | AddMeCmd (char *buf, int len, client *ns) |
348 | { |
459 | { |
349 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
460 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
350 | } |
461 | } |
351 | |
462 | |
352 | /** Reply to ExtendedInfos command */ |
463 | //+GPL |
353 | void |
|
|
354 | ToggleExtendedInfos (char *buf, int len, client * ns) |
|
|
355 | { |
|
|
356 | char cmdback[MAX_BUF]; |
|
|
357 | char command[50]; |
|
|
358 | int info, nextinfo; |
|
|
359 | |
|
|
360 | cmdback[0] = '\0'; |
|
|
361 | nextinfo = 0; |
|
|
362 | |
|
|
363 | while (1) |
|
|
364 | { |
|
|
365 | /* 1. Extract an info */ |
|
|
366 | info = nextinfo; |
|
|
367 | |
|
|
368 | while ((info < len) && (buf[info] == ' ')) |
|
|
369 | info++; |
|
|
370 | |
|
|
371 | if (info >= len) |
|
|
372 | break; |
|
|
373 | |
|
|
374 | nextinfo = info + 1; |
|
|
375 | |
|
|
376 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
377 | nextinfo++; |
|
|
378 | |
|
|
379 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
380 | continue; |
|
|
381 | |
|
|
382 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
383 | |
|
|
384 | /* 2. Interpret info */ |
|
|
385 | if (!strcmp ("smooth", command)) |
|
|
386 | /* Toggle smoothing */ |
|
|
387 | ns->EMI_smooth = !ns->EMI_smooth; |
|
|
388 | else |
|
|
389 | /*bad value */; |
|
|
390 | |
|
|
391 | /*3. Next info */ |
|
|
392 | } |
|
|
393 | |
|
|
394 | strcpy (cmdback, "ExtendedInfoSet"); |
|
|
395 | |
|
|
396 | if (ns->EMI_smooth) |
|
|
397 | { |
|
|
398 | strcat (cmdback, " "); |
|
|
399 | strcat (cmdback, "smoothing"); |
|
|
400 | } |
|
|
401 | |
|
|
402 | ns->send_packet (cmdback); |
|
|
403 | } |
|
|
404 | |
|
|
405 | /* |
|
|
406 | #define MSG_TYPE_BOOK 1 |
|
|
407 | #define MSG_TYPE_CARD 2 |
|
|
408 | #define MSG_TYPE_PAPER 3 |
|
|
409 | #define MSG_TYPE_SIGN 4 |
|
|
410 | #define MSG_TYPE_MONUMENT 5 |
|
|
411 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
|
|
412 | |
|
|
413 | /** Reply to ExtendedInfos command */ |
|
|
414 | void |
|
|
415 | ToggleExtendedText (char *buf, int len, client * ns) |
|
|
416 | { |
|
|
417 | char cmdback[MAX_BUF]; |
|
|
418 | char temp[10]; |
|
|
419 | char command[50]; |
|
|
420 | int info, nextinfo, i, flag; |
|
|
421 | |
|
|
422 | cmdback[0] = '\0'; |
|
|
423 | |
|
|
424 | nextinfo = 0; |
|
|
425 | while (1) |
|
|
426 | { |
|
|
427 | /* 1. Extract an info */ |
|
|
428 | info = nextinfo; |
|
|
429 | |
|
|
430 | while ((info < len) && (buf[info] == ' ')) |
|
|
431 | info++; |
|
|
432 | |
|
|
433 | if (info >= len) |
|
|
434 | break; |
|
|
435 | |
|
|
436 | nextinfo = info + 1; |
|
|
437 | |
|
|
438 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
439 | nextinfo++; |
|
|
440 | |
|
|
441 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
442 | continue; |
|
|
443 | |
|
|
444 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
445 | command[nextinfo - info] = '\0'; |
|
|
446 | /* 2. Interpret info */ |
|
|
447 | i = sscanf (command, "%d", &flag); |
|
|
448 | |
|
|
449 | if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
|
|
450 | ns->supported_readables |= (1 << flag); |
|
|
451 | /*3. Next info */ |
|
|
452 | } |
|
|
453 | |
|
|
454 | /* Send resulting state */ |
|
|
455 | strcpy (cmdback, "ExtendedTextSet"); |
|
|
456 | |
|
|
457 | for (i = 0; i <= MSG_TYPE_LAST; i++) |
|
|
458 | if (ns->supported_readables & (1 << i)) |
|
|
459 | { |
|
|
460 | strcat (cmdback, " "); |
|
|
461 | snprintf (temp, sizeof (temp), "%d", i); |
|
|
462 | strcat (cmdback, temp); |
|
|
463 | } |
|
|
464 | |
|
|
465 | ns->send_packet (cmdback); |
|
|
466 | } |
|
|
467 | |
464 | |
468 | /** |
465 | /** |
469 | * This handles the general commands from the client (ie, north, fire, cast, |
466 | * This handles the general commands from the client (ie, north, fire, cast, |
470 | * etc.) |
467 | * etc.) |
471 | */ |
468 | */ |
… | |
… | |
484 | return; |
481 | return; |
485 | |
482 | |
486 | buf++; |
483 | buf++; |
487 | } |
484 | } |
488 | |
485 | |
489 | execute_newserver_command (pl->ob, (char *) buf); |
486 | execute_newserver_command (pl->ob, (char *)buf); |
490 | |
487 | |
491 | /* Perhaps something better should be done with a left over count. |
488 | /* Perhaps something better should be done with a left over count. |
492 | * Cleaning up the input should probably be done first - all actions |
489 | * Cleaning up the input should probably be done first - all actions |
493 | * for the command that issued the count should be done before any other |
490 | * for the command that issued the count should be done before any other |
494 | * commands. |
491 | * commands. |
… | |
… | |
528 | * commands. |
525 | * commands. |
529 | */ |
526 | */ |
530 | pl->count = 0; |
527 | pl->count = 0; |
531 | |
528 | |
532 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
529 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
533 | int time = fabs (pl->ob->speed) < 0.001 |
530 | int time = pl->ob->has_active_speed () |
534 | ? time = MAX_TIME * 100 |
|
|
535 | : time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
531 | ? (int) (MAX_TIME / pl->ob->speed) |
|
|
532 | : MAX_TIME * 100; |
536 | |
533 | |
537 | /* Send confirmation of command execution now */ |
534 | /* Send confirmation of command execution now */ |
538 | packet sl ("comc"); |
535 | packet sl ("comc"); |
539 | sl << uint16 (cmdid) << uint32 (time); |
536 | sl << uint16 (cmdid) << uint32 (time); |
540 | pl->ns->send_packet (sl); |
537 | pl->ns->send_packet (sl); |
… | |
… | |
582 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
579 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
583 | } |
580 | } |
584 | } |
581 | } |
585 | |
582 | |
586 | /** |
583 | /** |
587 | * Client tells its version. If there is a mismatch, we close the |
584 | * Client tells its version info. |
588 | * socket. In real life, all we should care about is the client having |
|
|
589 | * something older than the server. If we assume the client will be |
|
|
590 | * backwards compatible, having it be a later version should not be a |
|
|
591 | * problem. |
|
|
592 | */ |
585 | */ |
593 | void |
586 | void |
594 | VersionCmd (char *buf, int len, client * ns) |
587 | VersionCmd (char *buf, int len, client *ns) |
595 | { |
588 | { |
596 | if (!buf) |
589 | INVOKE_CLIENT (VERSION, ns, ARG_DATA (buf, len)); |
597 | { |
|
|
598 | LOG (llevError, "CS: received corrupted version command\n"); |
|
|
599 | return; |
|
|
600 | } |
|
|
601 | |
|
|
602 | ns->cs_version = atoi (buf); |
|
|
603 | ns->sc_version = ns->cs_version; |
|
|
604 | |
|
|
605 | LOG (llevDebug, "connection from client <%s>\n", buf); |
|
|
606 | |
|
|
607 | //TODO: should log here just for statistics |
|
|
608 | |
|
|
609 | //if (VERSION_CS != ns->cs_version) |
|
|
610 | // unchecked; |
|
|
611 | |
|
|
612 | char *cp = strchr (buf + 1, ' '); |
|
|
613 | if (!cp) |
|
|
614 | return; |
|
|
615 | |
|
|
616 | ns->sc_version = atoi (cp); |
|
|
617 | |
|
|
618 | //if (VERSION_SC != ns->sc_version) |
|
|
619 | // unchecked; |
|
|
620 | |
|
|
621 | cp = strchr (cp + 1, ' '); |
|
|
622 | |
|
|
623 | if (cp) |
|
|
624 | { |
|
|
625 | ns->version = cp + 1; |
|
|
626 | |
|
|
627 | if (ns->sc_version < 1026) |
|
|
628 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
|
|
629 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
|
|
630 | } |
|
|
631 | } |
590 | } |
632 | |
591 | |
633 | /** sound related functions. */ |
592 | /** sound related functions. */ |
634 | void |
593 | void |
635 | SetSound (char *buf, int len, client * ns) |
594 | SetSound (char *buf, int len, client * ns) |
… | |
… | |
653 | * syntax is: move (to) (tag) (nrof) |
612 | * syntax is: move (to) (tag) (nrof) |
654 | */ |
613 | */ |
655 | void |
614 | void |
656 | MoveCmd (char *buf, int len, player *pl) |
615 | MoveCmd (char *buf, int len, player *pl) |
657 | { |
616 | { |
658 | int vals[3], i; |
617 | int to, tag, nrof; |
659 | |
618 | |
660 | /* A little funky here. We only cycle for 2 records, because |
619 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
661 | * we obviously are not going to find a space after the third |
|
|
662 | * record. Perhaps we should just replace this with a |
|
|
663 | * sscanf? |
|
|
664 | */ |
|
|
665 | for (i = 0; i < 2; i++) |
|
|
666 | { |
620 | { |
667 | vals[i] = atoi (buf); |
|
|
668 | |
|
|
669 | if (!(buf = strchr (buf, ' '))) |
|
|
670 | { |
|
|
671 | LOG (llevError, "Incomplete move command: %s\n", buf); |
621 | LOG (llevError, "Incomplete move command: %s\n", buf); |
672 | return; |
622 | return; |
673 | } |
|
|
674 | |
|
|
675 | buf++; |
|
|
676 | } |
623 | } |
677 | |
624 | |
678 | vals[2] = atoi (buf); |
625 | esrv_move_object (pl->ob, to, tag, nrof); |
679 | |
|
|
680 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
681 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
682 | } |
626 | } |
683 | |
627 | |
684 | /****************************************************************************** |
628 | /****************************************************************************** |
685 | * |
629 | * |
686 | * Start of commands the server sends to the client. |
630 | * Start of commands the server sends to the client. |
… | |
… | |
701 | * Get player's current range attack in obuf. |
645 | * Get player's current range attack in obuf. |
702 | */ |
646 | */ |
703 | static void |
647 | static void |
704 | rangetostring (player *pl, char *obuf) |
648 | rangetostring (player *pl, char *obuf) |
705 | { |
649 | { |
706 | dynbuf_text buf; |
650 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
|
|
651 | |
|
|
652 | #if 0 |
|
|
653 | // print ranged/chosen_skill etc. objects every call |
|
|
654 | printf ("%s %s => %s (%s)\n", |
|
|
655 | pl->ranged_ob ? &pl->ranged_ob->name : "-", |
|
|
656 | pl->combat_ob ? &pl->combat_ob->name : "-", |
|
|
657 | pl->ob->current_weapon ? &pl->ob->current_weapon->name : "-", |
|
|
658 | pl->ob->chosen_skill ? &pl->ob->chosen_skill->name : "-" |
|
|
659 | ); |
|
|
660 | #endif |
707 | |
661 | |
708 | if (pl->ranged_ob) |
662 | if (pl->ranged_ob) |
709 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
663 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
710 | |
664 | |
711 | if (pl->combat_ob) |
665 | if (pl->combat_ob) |
… | |
… | |
757 | * commands for now. |
711 | * commands for now. |
758 | */ |
712 | */ |
759 | void |
713 | void |
760 | esrv_update_stats (player *pl) |
714 | esrv_update_stats (player *pl) |
761 | { |
715 | { |
762 | char buf[MAX_BUF]; |
|
|
763 | uint16 flags; |
|
|
764 | |
|
|
765 | client *ns = pl->ns; |
716 | client *ns = pl->ns; |
766 | if (!ns) |
717 | if (!ns) |
767 | return; |
718 | return; |
768 | |
719 | |
769 | object *ob = pl->observe; |
720 | object *ob = pl->observe; |
… | |
… | |
786 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
737 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
787 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
738 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
788 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
739 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
789 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
740 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
790 | |
741 | |
791 | for (int s = 0; s < NUM_SKILLS; s++) |
742 | for (int s = 0; s < CS_NUM_SKILLS; s++) |
792 | if (object *skill = opl->last_skill_ob[s]) |
743 | if (object *skill = opl->last_skill_ob [s]) |
793 | if (skill->stats.exp != ns->last_skill_exp [s]) |
744 | if (skill->stats.exp != ns->last_skill_exp [s]) |
794 | { |
745 | { |
795 | ns->last_skill_exp [s] = skill->stats.exp; |
746 | ns->last_skill_exp [s] = skill->stats.exp; |
796 | |
747 | |
797 | /* Always send along the level if exp changes. This is only |
748 | /* Always send along the level if exp changes. This is only |
798 | * 1 extra byte, but keeps processing simpler. |
749 | * 1 extra byte, but keeps processing simpler. |
799 | */ |
750 | */ |
800 | sl << uint8 (s + CS_STAT_SKILLINFO) |
751 | sl << uint8 (CS_STAT_SKILLINFO + s) |
801 | << uint8 (skill->level) |
752 | << uint8 (skill->level) |
802 | << uint64 (skill->stats.exp); |
753 | << uint64 (skill->stats.exp); |
803 | } |
754 | } |
804 | |
755 | |
805 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
756 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
806 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
757 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
807 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
758 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
808 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
759 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
809 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
760 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
810 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK); |
761 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f / TICK); |
811 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
762 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
812 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); |
763 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f / TICK); |
813 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
764 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
814 | |
765 | |
815 | flags = 0; |
766 | int flags = (opl->fire_on ? SF_FIREON : 0) |
816 | |
767 | | (opl->run_on ? SF_RUNON : 0); |
817 | if (opl->fire_on) |
|
|
818 | flags |= SF_FIREON; |
|
|
819 | |
|
|
820 | if (opl->run_on) |
|
|
821 | flags |= SF_RUNON; |
|
|
822 | |
768 | |
823 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
769 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
824 | |
770 | |
825 | if (ns->sc_version < 1025) |
|
|
826 | { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
|
|
827 | else |
|
|
828 | for (int i = 0; i < NROFATTACKS; i++) |
771 | for (int i = 0; i < NROFATTACKS; i++) |
829 | { |
|
|
830 | /* Skip ones we won't send */ |
772 | /* Skip ones we won't send */ |
831 | if (atnr_cs_stat[i] == -1) |
773 | if (atnr_cs_stat[i] >= 0) |
832 | continue; |
|
|
833 | |
|
|
834 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
774 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
835 | } |
|
|
836 | |
775 | |
837 | if (pl->ns->monitor_spells) |
776 | if (pl->ns->monitor_spells) |
838 | { |
777 | { |
839 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
778 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
840 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
779 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
841 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
780 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
842 | } |
781 | } |
843 | |
782 | |
|
|
783 | char buf[MAX_BUF]; |
844 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
784 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
845 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
785 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
846 | set_title (ob, buf); |
786 | set_title (ob, buf); |
847 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
787 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
848 | |
788 | |
… | |
… | |
853 | |
793 | |
854 | /** |
794 | /** |
855 | * Tells the client that here is a player it should start using. |
795 | * Tells the client that here is a player it should start using. |
856 | */ |
796 | */ |
857 | void |
797 | void |
858 | esrv_new_player (player *pl, uint32 weight) |
798 | esrv_new_player (player *pl) |
859 | { |
799 | { |
|
|
800 | sint32 weight = pl->ob->client_weight (); |
|
|
801 | |
860 | packet sl ("player"); |
802 | packet sl ("player"); |
861 | |
803 | |
862 | sl << uint32 (pl->ob->count) |
804 | sl << uint32 (pl->ob->count) |
863 | << uint32 (weight) |
805 | << uint32 (weight) |
864 | << uint32 (pl->ob->face) |
806 | << uint32 (pl->ob->face) |
865 | << data8 (pl->ob->name); |
807 | << data8 (pl->ob->name); |
866 | |
808 | |
867 | pl->ns->last_weight = weight; |
809 | pl->ns->last_weight = weight; |
868 | pl->ns->send_packet (sl); |
810 | pl->ns->send_packet (sl); |
869 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
870 | } |
811 | } |
871 | |
812 | |
872 | /****************************************************************************** |
813 | /****************************************************************************** |
873 | * |
814 | * |
874 | * Start of map related commands. |
815 | * Start of map related commands. |
… | |
… | |
931 | |
872 | |
932 | if (!ns.faces_sent[face_num]) |
873 | if (!ns.faces_sent[face_num]) |
933 | if (ob) |
874 | if (ob) |
934 | ns.send_faces (ob); |
875 | ns.send_faces (ob); |
935 | else |
876 | else |
936 | ns.send_face (face_num); |
877 | ns.send_face (face_num, 10); |
937 | |
878 | |
938 | sl << uint16 (face_num); |
879 | sl << uint16 (face_num); |
939 | return 1; |
880 | return 1; |
940 | } |
881 | } |
941 | |
882 | |
942 | /* Nothing changed */ |
883 | /* Nothing changed */ |
943 | return 0; |
884 | return 0; |
944 | } |
885 | } |
945 | |
886 | |
946 | /** |
887 | //-GPL |
947 | * Returns the size of a data for a map square as returned by |
|
|
948 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
|
|
949 | * available. |
|
|
950 | */ |
|
|
951 | int |
|
|
952 | getExtendedMapInfoSize (client * ns) |
|
|
953 | { |
|
|
954 | int result = 0; |
|
|
955 | |
|
|
956 | if (ns->ext_mapinfos) |
|
|
957 | { |
|
|
958 | if (ns->EMI_smooth) |
|
|
959 | result += 1; /*One byte for smoothlevel */ |
|
|
960 | } |
|
|
961 | |
|
|
962 | return result; |
|
|
963 | } |
|
|
964 | |
888 | |
965 | // prefetch (and touch) all maps within a specific distancd |
889 | // prefetch (and touch) all maps within a specific distancd |
966 | static void |
890 | static void |
967 | prefetch_surrounding_maps (maptile *map, int distance) |
891 | prefetch_surrounding_maps (maptile *map, int distance) |
968 | { |
892 | { |
969 | map->last_access = runtime; |
893 | map->touch (); |
970 | |
894 | |
971 | if (--distance) |
895 | if (--distance) |
972 | for (int dir = 4; --dir; ) |
896 | for (int dir = 4; dir--; ) |
973 | if (const shstr &path = map->tile_path [dir]) |
897 | if (const shstr &path = map->tile_path [dir]) |
974 | if (maptile *&neigh = map->tile_map [dir]) |
898 | if (maptile *&neigh = map->tile_map [dir]) |
975 | prefetch_surrounding_maps (neigh, distance); |
899 | prefetch_surrounding_maps (neigh, distance); |
976 | else |
900 | else |
977 | neigh = maptile::find_async (path, map); |
901 | neigh = maptile::find_async (path, map); |
… | |
… | |
982 | prefetch_surrounding_maps (object *op) |
906 | prefetch_surrounding_maps (object *op) |
983 | { |
907 | { |
984 | prefetch_surrounding_maps (op->map, 3); |
908 | prefetch_surrounding_maps (op->map, 3); |
985 | } |
909 | } |
986 | |
910 | |
|
|
911 | //+GPL |
|
|
912 | |
987 | /** |
913 | /** |
988 | * Draws client map. |
914 | * Draws client map. |
989 | */ |
915 | */ |
990 | void |
916 | void |
991 | draw_client_map (player *pl) |
917 | draw_client_map (player *pl) |
992 | { |
918 | { |
993 | object *ob = pl->observe; |
919 | object *ob = pl->viewpoint; |
994 | if (!ob->active) |
920 | if (!pl->observe->active) |
995 | return; |
921 | return; |
996 | |
|
|
997 | maptile *plmap = ob->map; |
|
|
998 | |
922 | |
999 | /* If player is just joining the game, he isn't here yet, so the map |
923 | /* If player is just joining the game, he isn't here yet, so the map |
1000 | * can get swapped out. If so, don't try to send them a map. All will |
924 | * can get swapped out. If so, don't try to send them a map. All will |
1001 | * be OK once they really log in. |
925 | * be OK once they really log in. |
1002 | */ |
926 | */ |
1003 | if (!plmap || plmap->in_memory != MAP_IN_MEMORY) |
927 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
1004 | return; |
928 | return; |
1005 | |
929 | |
1006 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
|
|
1007 | int estartlen, eoldlen; |
930 | int startlen, oldlen; |
1008 | uint8 eentrysize; |
|
|
1009 | uint16 ewhatstart, ewhatflag; |
|
|
1010 | uint8 extendedinfos; |
|
|
1011 | |
931 | |
1012 | check_map_change (pl); |
932 | check_map_change (pl); |
1013 | prefetch_surrounding_maps (pl->ob); |
933 | prefetch_surrounding_maps (pl->ob); |
1014 | |
934 | |
1015 | /* do LOS after calls to update_position */ |
935 | /* do LOS after calls to update_position */ |
1016 | if (ob != pl->ob) |
936 | /* unfortunately, we need to udpate los when observing, currently */ |
1017 | clear_los (pl); |
937 | if (pl->do_los || pl->viewpoint != pl->ob) |
1018 | else if (pl->do_los) |
|
|
1019 | { |
938 | { |
1020 | update_los (ob); |
|
|
1021 | pl->do_los = 0; |
939 | pl->do_los = 0; |
|
|
940 | pl->update_los (); |
1022 | } |
941 | } |
1023 | |
942 | |
1024 | /** |
943 | /** |
1025 | * This function uses the new map1 protocol command to send the map |
944 | * This function uses the new map1 protocol command to send the map |
1026 | * to the client. It is necessary because the old map command supports |
945 | * to the client. It is necessary because the old map command supports |
… | |
… | |
1045 | */ |
964 | */ |
1046 | |
965 | |
1047 | client &socket = *pl->ns; |
966 | client &socket = *pl->ns; |
1048 | |
967 | |
1049 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
968 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1050 | packet esl; |
|
|
1051 | |
969 | |
1052 | startlen = sl.length (); |
970 | startlen = sl.length (); |
1053 | |
971 | |
1054 | /*Extendedmapinfo structure initialisation */ |
972 | int hx = socket.mapx / 2; |
1055 | if (socket.ext_mapinfos) |
973 | int hy = socket.mapy / 2; |
1056 | { |
|
|
1057 | extendedinfos = EMI_NOREDRAW; |
|
|
1058 | |
974 | |
1059 | if (socket.EMI_smooth) |
975 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
1060 | extendedinfos |= EMI_SMOOTH; |
976 | int ax = dx + hx; |
|
|
977 | int ay = dy + hy; |
1061 | |
978 | |
1062 | ewhatstart = esl.length (); |
979 | int mask = (ax << 10) | (ay << 4); |
1063 | ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
980 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1064 | could need to be taken away */ |
|
|
1065 | eentrysize = getExtendedMapInfoSize (&socket); |
|
|
1066 | esl << "mapextended " |
|
|
1067 | << uint8 (extendedinfos) |
|
|
1068 | << uint8 (eentrysize); |
|
|
1069 | |
981 | |
1070 | estartlen = esl.length (); |
982 | /* If the coordinates are not valid, or it is too dark to see, |
1071 | } |
983 | * we tell the client as such |
1072 | |
|
|
1073 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1074 | * locations. |
|
|
1075 | */ |
984 | */ |
1076 | ay = 0; |
985 | if (!m) |
1077 | |
|
|
1078 | /* We could do this logic as conditionals in the if statement, |
|
|
1079 | * but that started to get a bit messy to look at. |
|
|
1080 | */ |
|
|
1081 | max_x = ob->x + (socket.mapx + 1) / 2; |
|
|
1082 | max_y = ob->y + (socket.mapy + 1) / 2; |
|
|
1083 | |
|
|
1084 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
|
|
1085 | { |
986 | { |
1086 | sint16 nx, ny; |
987 | /* space is out of map. Update space and clear values |
1087 | maptile *m = 0; |
988 | * if this hasn't already been done. If the space is out |
1088 | |
989 | * of the map, it shouldn't have a head. |
1089 | ax = 0; |
990 | */ |
1090 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
991 | if (lastcell.count != -1) |
1091 | { |
992 | { |
1092 | // check to see if we can simply go one right quickly |
993 | sl << uint16 (mask); |
|
|
994 | map_clearcell (&lastcell, -1); |
1093 | ++nx; |
995 | } |
1094 | if (m && nx >= m->width) |
996 | |
|
|
997 | continue; |
|
|
998 | } |
|
|
999 | |
|
|
1000 | int d = pl->blocked_los_uc (dx, dy); |
|
|
1001 | |
|
|
1002 | if (d > 3) |
|
|
1003 | { |
|
|
1004 | /* This block deals with spaces that are not visible for whatever |
|
|
1005 | * reason. Still may need to send the head for this space. |
|
|
1006 | */ |
|
|
1007 | if (lastcell.count != -1 |
|
|
1008 | || lastcell.faces[0] |
|
|
1009 | || lastcell.faces[1] |
|
|
1010 | || lastcell.faces[2] |
|
|
1011 | || lastcell.stat_hp |
|
|
1012 | || lastcell.flags |
|
|
1013 | || lastcell.player) |
|
|
1014 | sl << uint16 (mask); |
|
|
1015 | |
|
|
1016 | /* properly clear a previously sent big face */ |
|
|
1017 | map_clearcell (&lastcell, -1); |
|
|
1018 | } |
|
|
1019 | else |
|
|
1020 | { |
|
|
1021 | /* In this block, the space is visible. |
|
|
1022 | */ |
|
|
1023 | |
|
|
1024 | /* Rather than try to figure out what everything that we might |
|
|
1025 | * need to send is, then form the packet after that, |
|
|
1026 | * we presume that we will in fact form a packet, and update |
|
|
1027 | * the bits by what we do actually send. If we send nothing, |
|
|
1028 | * we just back out sl.length () to the old value, and no harm |
|
|
1029 | * is done. |
|
|
1030 | * I think this is simpler than doing a bunch of checks to see |
|
|
1031 | * what if anything we need to send, setting the bits, then |
|
|
1032 | * doing those checks again to add the real data. |
|
|
1033 | */ |
|
|
1034 | oldlen = sl.length (); |
|
|
1035 | |
|
|
1036 | sl << uint16 (mask); |
|
|
1037 | |
|
|
1038 | unsigned char dummy; |
|
|
1039 | unsigned char *last_ext = &dummy; |
|
|
1040 | |
|
|
1041 | /* Darkness changed */ |
|
|
1042 | if (lastcell.count != d) |
|
|
1043 | { |
1095 | m = 0; |
1044 | mask |= 0x8; |
1096 | |
1045 | |
1097 | if (!m) |
1046 | *last_ext |= 0x80; |
|
|
1047 | last_ext = &sl[sl.length ()]; |
|
|
1048 | sl << uint8 (d); |
|
|
1049 | } |
|
|
1050 | |
|
|
1051 | lastcell.count = d; |
|
|
1052 | |
|
|
1053 | mapspace &ms = m->at (nx, ny); |
|
|
1054 | ms.update (); |
|
|
1055 | |
|
|
1056 | // extmap handling |
|
|
1057 | uint8 stat_hp = 0; |
|
|
1058 | uint8 stat_width = 0; |
|
|
1059 | uint8 flags = 0; |
|
|
1060 | tag_t player = 0; |
|
|
1061 | |
|
|
1062 | // send hp information, if applicable |
|
|
1063 | if (object *op = ms.faces_obj [0]) |
|
|
1064 | if (op->is_head () && !op->invisible) |
1098 | { |
1065 | { |
1099 | nx = x; ny = y; m = plmap; |
1066 | if (op->stats.maxhp > op->stats.hp |
1100 | |
1067 | && op->stats.maxhp > 0 |
1101 | if (!xy_normalise (m, nx, ny)) |
1068 | && (op->type == PLAYER |
|
|
1069 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1070 | || op->flag [FLAG_MONSTER] |
|
|
1071 | || op->flag [FLAG_ALIVE] |
|
|
1072 | || op->flag [FLAG_GENERATOR])) |
1102 | m = 0; |
1073 | { |
|
|
1074 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1075 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1076 | } |
|
|
1077 | |
|
|
1078 | if (expect_false (op->has_dialogue ())) |
|
|
1079 | flags |= 1; |
|
|
1080 | |
|
|
1081 | if (expect_false (op->type == PLAYER)) |
|
|
1082 | player = op == ob ? pl->ob->count |
|
|
1083 | : op == pl->ob ? ob->count |
|
|
1084 | : op->count; |
1103 | } |
1085 | } |
1104 | |
1086 | |
1105 | int emask, mask; |
1087 | if (expect_false (lastcell.stat_hp != stat_hp)) |
1106 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1107 | |
|
|
1108 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
|
|
1109 | |
|
|
1110 | /* If the coordinates are not valid, or it is too dark to see, |
|
|
1111 | * we tell the client as such |
|
|
1112 | */ |
|
|
1113 | if (!m) |
|
|
1114 | { |
1088 | { |
1115 | /* space is out of map. Update space and clear values |
1089 | lastcell.stat_hp = stat_hp; |
1116 | * if this hasn't already been done. If the space is out |
1090 | |
1117 | * of the map, it shouldn't have a head |
1091 | mask |= 0x8; |
1118 | */ |
1092 | *last_ext |= 0x80; |
1119 | if (lastcell.count != -1) |
1093 | last_ext = &sl[sl.length ()]; |
|
|
1094 | |
|
|
1095 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1096 | |
|
|
1097 | if (stat_width > 1) |
1120 | { |
1098 | { |
1121 | sl << uint16 (mask); |
|
|
1122 | map_clearcell (&lastcell, -1); |
|
|
1123 | } |
|
|
1124 | |
|
|
1125 | continue; |
|
|
1126 | } |
|
|
1127 | |
|
|
1128 | m->touch (); |
|
|
1129 | |
|
|
1130 | int d = pl->blocked_los[ax][ay]; |
|
|
1131 | |
|
|
1132 | if (d > 3) |
|
|
1133 | { |
|
|
1134 | |
|
|
1135 | int need_send = 0, count; |
|
|
1136 | |
|
|
1137 | /* This block deals with spaces that are not visible for whatever |
|
|
1138 | * reason. Still may need to send the head for this space. |
|
|
1139 | */ |
|
|
1140 | |
|
|
1141 | oldlen = sl.length (); |
|
|
1142 | |
|
|
1143 | sl << uint16 (mask); |
|
|
1144 | |
|
|
1145 | if (lastcell.count != -1) |
|
|
1146 | need_send = 1; |
|
|
1147 | |
|
|
1148 | count = -1; |
|
|
1149 | |
|
|
1150 | /* properly clear a previously sent big face */ |
|
|
1151 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
|
|
1152 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
|
|
1153 | need_send = 1; |
|
|
1154 | |
|
|
1155 | map_clearcell (&lastcell, count); |
|
|
1156 | |
|
|
1157 | if ((mask & 0xf) || need_send) |
|
|
1158 | sl[oldlen + 1] = mask & 0xff; |
|
|
1159 | else |
|
|
1160 | sl.reset (oldlen); |
|
|
1161 | } |
|
|
1162 | else |
|
|
1163 | { |
|
|
1164 | /* In this block, the space is visible. |
|
|
1165 | */ |
|
|
1166 | |
|
|
1167 | /* Rather than try to figure out what everything that we might |
|
|
1168 | * need to send is, then form the packet after that, |
|
|
1169 | * we presume that we will in fact form a packet, and update |
|
|
1170 | * the bits by what we do actually send. If we send nothing, |
|
|
1171 | * we just back out sl.length () to the old value, and no harm |
|
|
1172 | * is done. |
|
|
1173 | * I think this is simpler than doing a bunch of checks to see |
|
|
1174 | * what if anything we need to send, setting the bits, then |
|
|
1175 | * doing those checks again to add the real data. |
|
|
1176 | */ |
|
|
1177 | oldlen = sl.length (); |
|
|
1178 | eoldlen = esl.length (); |
|
|
1179 | |
|
|
1180 | sl << uint16 (mask); |
|
|
1181 | |
|
|
1182 | unsigned char dummy; |
|
|
1183 | unsigned char *last_ext = &dummy; |
|
|
1184 | |
|
|
1185 | /* Darkness changed */ |
|
|
1186 | if (lastcell.count != d && socket.darkness) |
|
|
1187 | { |
|
|
1188 | mask |= 0x8; |
|
|
1189 | |
|
|
1190 | if (socket.extmap) |
|
|
1191 | { |
|
|
1192 | *last_ext |= 0x80; |
1099 | *last_ext |= 0x80; |
1193 | last_ext = &sl[sl.length ()]; |
1100 | last_ext = &sl[sl.length ()]; |
1194 | sl << uint8 (d); |
1101 | |
1195 | } |
1102 | sl << uint8 (6) << uint8 (stat_width); |
1196 | else |
|
|
1197 | sl << uint8 (255 - 64 * d); |
|
|
1198 | } |
1103 | } |
|
|
1104 | } |
1199 | |
1105 | |
1200 | lastcell.count = d; |
1106 | if (expect_false (lastcell.player != player)) |
1201 | |
|
|
1202 | mapspace &ms = m->at (nx, ny); |
|
|
1203 | ms.update (); |
|
|
1204 | |
|
|
1205 | if (socket.extmap) |
|
|
1206 | { |
1107 | { |
1207 | uint8 stat_hp = 0; |
1108 | lastcell.player = player; |
1208 | uint8 stat_width = 0; |
|
|
1209 | uint8 flags = 0; |
|
|
1210 | tag_t player = 0; |
|
|
1211 | |
1109 | |
1212 | // send hp information, if applicable |
|
|
1213 | if (object *op = ms.faces_obj [0]) |
|
|
1214 | { |
|
|
1215 | if (op->head || op->invisible) |
|
|
1216 | ; // do not show |
|
|
1217 | else if (op->type == PLAYER |
|
|
1218 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1219 | { |
|
|
1220 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
|
|
1221 | { |
|
|
1222 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1223 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1224 | } |
|
|
1225 | } |
|
|
1226 | |
|
|
1227 | if (op->msg && op->msg[0] == '@') |
|
|
1228 | flags |= 1; |
|
|
1229 | |
|
|
1230 | if (op->type == PLAYER && op != ob) |
|
|
1231 | player = op->count; |
|
|
1232 | } |
|
|
1233 | |
|
|
1234 | if (lastcell.stat_hp != stat_hp) |
|
|
1235 | { |
|
|
1236 | lastcell.stat_hp = stat_hp; |
|
|
1237 | |
|
|
1238 | mask |= 0x8; |
1110 | mask |= 0x8; |
1239 | *last_ext |= 0x80; |
1111 | *last_ext |= 0x80; |
1240 | last_ext = &sl[sl.length ()]; |
1112 | last_ext = &sl[sl.length ()]; |
1241 | |
1113 | |
1242 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1243 | |
|
|
1244 | if (stat_width > 1) |
|
|
1245 | { |
|
|
1246 | *last_ext |= 0x80; |
|
|
1247 | last_ext = &sl[sl.length ()]; |
|
|
1248 | |
|
|
1249 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1250 | } |
|
|
1251 | } |
|
|
1252 | |
|
|
1253 | if (lastcell.player != player) |
|
|
1254 | { |
|
|
1255 | lastcell.player = player; |
|
|
1256 | |
|
|
1257 | mask |= 0x8; |
|
|
1258 | *last_ext |= 0x80; |
|
|
1259 | last_ext = &sl[sl.length ()]; |
|
|
1260 | |
|
|
1261 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1114 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1262 | } |
1115 | } |
1263 | |
1116 | |
1264 | if (lastcell.flags != flags) |
1117 | if (expect_false (lastcell.flags != flags)) |
1265 | { |
1118 | { |
1266 | lastcell.flags = flags; |
1119 | lastcell.flags = flags; |
1267 | |
1120 | |
1268 | mask |= 0x8; |
1121 | mask |= 0x8; |
1269 | *last_ext |= 0x80; |
1122 | *last_ext |= 0x80; |
1270 | last_ext = &sl[sl.length ()]; |
1123 | last_ext = &sl[sl.length ()]; |
1271 | |
1124 | |
1272 | sl << uint8 (8) << uint8 (flags); |
1125 | sl << uint8 (8) << uint8 (flags); |
1273 | } |
|
|
1274 | } |
1126 | } |
1275 | |
1127 | |
|
|
1128 | // faces |
|
|
1129 | |
1276 | /* Floor face */ |
1130 | /* Floor face */ |
1277 | if (update_space (sl, socket, ms, lastcell, 2)) |
1131 | if (update_space (sl, socket, ms, lastcell, 2)) |
1278 | mask |= 0x4; |
1132 | mask |= 0x4; |
1279 | |
1133 | |
1280 | /* Middle face */ |
1134 | /* Middle face */ |
1281 | if (update_space (sl, socket, ms, lastcell, 1)) |
1135 | if (update_space (sl, socket, ms, lastcell, 1)) |
1282 | mask |= 0x2; |
1136 | mask |= 0x2; |
1283 | |
1137 | |
|
|
1138 | if (expect_false (ob->invisible) |
|
|
1139 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
1284 | if (ms.player () == ob |
1140 | && ms.player () == ob) |
1285 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
|
|
1286 | { |
1141 | { |
1287 | // force player to be visible to himself if invisible |
1142 | // force player to be visible to himself if invisible |
1288 | if (lastcell.faces[0] != ob->face) |
1143 | if (lastcell.faces[0] != ob->face) |
1289 | { |
1144 | { |
1290 | lastcell.faces[0] = ob->face; |
1145 | lastcell.faces[0] = ob->face; |
1291 | |
1146 | |
1292 | mask |= 0x1; |
|
|
1293 | sl << uint16 (ob->face); |
|
|
1294 | |
|
|
1295 | socket.send_faces (ob); |
|
|
1296 | } |
|
|
1297 | } |
|
|
1298 | /* Top face */ |
|
|
1299 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1300 | mask |= 0x1; |
1147 | mask |= 0x1; |
|
|
1148 | sl << uint16 (ob->face); |
1301 | |
1149 | |
|
|
1150 | socket.send_faces (ob); |
|
|
1151 | } |
|
|
1152 | } |
|
|
1153 | /* Top face */ |
|
|
1154 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1155 | mask |= 0x1; |
|
|
1156 | |
1302 | /* Check to see if we are in fact sending anything for this |
1157 | /* Check to see if we are in fact sending anything for this |
1303 | * space by checking the mask. If so, update the mask. |
1158 | * space by checking the mask. If so, update the mask. |
1304 | * if not, reset the len to that from before adding the mask |
1159 | * if not, reset the len to that from before adding the mask |
1305 | * value, so we don't send those bits. |
1160 | * value, so we don't send those bits. |
1306 | */ |
1161 | */ |
1307 | if (mask & 0xf) |
1162 | if (mask & 0xf) |
1308 | sl[oldlen + 1] = mask & 0xff; |
1163 | sl[oldlen + 1] = mask & 0xff; |
1309 | else |
1164 | else |
1310 | sl.reset (oldlen); |
1165 | sl.reset (oldlen); |
1311 | |
|
|
1312 | if (socket.ext_mapinfos) |
|
|
1313 | esl << uint16 (emask); |
|
|
1314 | |
|
|
1315 | if (socket.EMI_smooth) |
|
|
1316 | { |
|
|
1317 | for (int layer = 2+1; layer--; ) |
|
|
1318 | { |
|
|
1319 | object *ob = ms.faces_obj [layer]; |
|
|
1320 | |
|
|
1321 | // If there is no object for this space, or if the face for the object |
|
|
1322 | // is the blank face, set the smoothlevel to zero. |
|
|
1323 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
|
|
1324 | |
|
|
1325 | // We've gotten what face we want to use for the object. Now see if |
|
|
1326 | // if it has changed since we last sent it to the client. |
|
|
1327 | if (lastcell.smooth[layer] != smoothlevel) |
|
|
1328 | { |
|
|
1329 | lastcell.smooth[layer] = smoothlevel; |
|
|
1330 | esl << uint8 (smoothlevel); |
|
|
1331 | emask |= 1 << layer; |
|
|
1332 | } |
|
|
1333 | } |
|
|
1334 | |
|
|
1335 | if (emask & 0xf) |
|
|
1336 | esl[eoldlen + 1] = emask & 0xff; |
|
|
1337 | else |
|
|
1338 | esl.reset (eoldlen); |
|
|
1339 | } |
|
|
1340 | } /* else this is a viewable space */ |
1166 | } /* else this is a viewable space */ |
1341 | } /* for x loop */ |
1167 | ordered_mapwalk_end |
1342 | } /* for y loop */ |
|
|
1343 | |
1168 | |
1344 | socket.flush_fx (); |
1169 | socket.flush_fx (); |
1345 | |
|
|
1346 | /* Verify that we in fact do need to send this */ |
|
|
1347 | if (socket.ext_mapinfos) |
|
|
1348 | { |
|
|
1349 | if (!(sl.length () > startlen || socket.sent_scroll)) |
|
|
1350 | { |
|
|
1351 | /* No map data will follow, so don't say the client |
|
|
1352 | * it doesn't need draw! |
|
|
1353 | */ |
|
|
1354 | ewhatflag &= ~EMI_NOREDRAW; |
|
|
1355 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
|
|
1356 | } |
|
|
1357 | |
|
|
1358 | if (esl.length () > estartlen) |
|
|
1359 | socket.send_packet (esl); |
|
|
1360 | } |
|
|
1361 | |
1170 | |
1362 | if (sl.length () > startlen || socket.sent_scroll) |
1171 | if (sl.length () > startlen || socket.sent_scroll) |
1363 | { |
1172 | { |
1364 | socket.send_packet (sl); |
1173 | socket.send_packet (sl); |
1365 | socket.sent_scroll = 0; |
1174 | socket.sent_scroll = 0; |
1366 | } |
1175 | } |
1367 | } |
1176 | } |
1368 | |
1177 | |
1369 | /*****************************************************************************/ |
|
|
1370 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
|
|
1371 | /* a player. Of course, the client need to know the command to be able to */ |
|
|
1372 | /* manage it ! */ |
|
|
1373 | /*****************************************************************************/ |
|
|
1374 | void |
|
|
1375 | send_plugin_custom_message (object *pl, char *buf) |
|
|
1376 | { |
|
|
1377 | pl->contr->ns->send_packet (buf); |
|
|
1378 | } |
|
|
1379 | |
|
|
1380 | /** |
|
|
1381 | * This sends the skill number to name mapping. We ignore |
|
|
1382 | * the params - we always send the same info no matter what. |
|
|
1383 | */ |
|
|
1384 | void |
|
|
1385 | send_skill_info (client *ns, char *params) |
|
|
1386 | { |
|
|
1387 | packet sl; |
|
|
1388 | sl << "replyinfo skill_info\n"; |
|
|
1389 | |
|
|
1390 | for (int i = 1; i < NUM_SKILLS; i++) |
|
|
1391 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
|
|
1392 | |
|
|
1393 | if (sl.length () >= MAXSOCKBUF) |
|
|
1394 | { |
|
|
1395 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
|
|
1396 | fatal (0); |
|
|
1397 | } |
|
|
1398 | |
|
|
1399 | ns->send_packet (sl); |
|
|
1400 | } |
|
|
1401 | |
|
|
1402 | /** |
|
|
1403 | * This sends the spell path to name mapping. We ignore |
|
|
1404 | * the params - we always send the same info no matter what. |
|
|
1405 | */ |
|
|
1406 | void |
|
|
1407 | send_spell_paths (client * ns, char *params) |
|
|
1408 | { |
|
|
1409 | packet sl; |
|
|
1410 | |
|
|
1411 | sl << "replyinfo spell_paths\n"; |
|
|
1412 | |
|
|
1413 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
1414 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
1415 | |
|
|
1416 | if (sl.length () >= MAXSOCKBUF) |
|
|
1417 | { |
|
|
1418 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
1419 | fatal (0); |
|
|
1420 | } |
|
|
1421 | |
|
|
1422 | ns->send_packet (sl); |
|
|
1423 | } |
|
|
1424 | |
|
|
1425 | /** |
1178 | /** |
1426 | * This looks for any spells the player may have that have changed their stats. |
1179 | * This looks for any spells the player may have that have changed their stats. |
1427 | * it then sends an updspell packet for each spell that has changed in this way |
1180 | * it then sends an updspell packet for each spell that has changed in this way |
1428 | */ |
1181 | */ |
1429 | void |
1182 | void |
1430 | esrv_update_spells (player *pl) |
1183 | esrv_update_spells (player *pl) |
1431 | { |
1184 | { |
1432 | if (!pl->ns) |
1185 | if (!pl->ns) |
1433 | return; |
1186 | return; |
1434 | |
1187 | |
|
|
1188 | pl->ns->update_spells = false; |
|
|
1189 | |
1435 | if (!pl->ns->monitor_spells) |
1190 | if (!pl->ns->monitor_spells) |
1436 | return; |
1191 | return; |
1437 | |
1192 | |
1438 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1193 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
1439 | { |
|
|
1440 | if (spell->type == SPELL) |
1194 | if (spell->type == SPELL) |
1441 | { |
1195 | { |
1442 | int flags = 0; |
1196 | int flags = 0; |
|
|
1197 | int val; |
1443 | |
1198 | |
1444 | /* check if we need to update it */ |
1199 | /* check if we need to update it */ |
1445 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1200 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
|
|
1201 | if (spell->cached_sp != val) |
1446 | { |
1202 | { |
1447 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1203 | spell->cached_sp = val; |
1448 | flags |= UPD_SP_MANA; |
1204 | flags |= UPD_SP_MANA; |
1449 | } |
1205 | } |
1450 | |
1206 | |
1451 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1207 | val = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
|
|
1208 | if (spell->cached_grace != val) |
1452 | { |
1209 | { |
1453 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1210 | spell->cached_grace = val; |
1454 | flags |= UPD_SP_GRACE; |
1211 | flags |= UPD_SP_GRACE; |
1455 | } |
1212 | } |
1456 | |
1213 | |
1457 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1214 | val = casting_level (pl->ob, spell); |
|
|
1215 | if (spell->cached_eat != val) |
1458 | { |
1216 | { |
1459 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1217 | spell->cached_eat = val; |
1460 | flags |= UPD_SP_DAMAGE; |
1218 | flags |= UPD_SP_LEVEL; |
1461 | } |
1219 | } |
1462 | |
1220 | |
1463 | if (flags) |
1221 | if (flags) |
1464 | { |
1222 | { |
1465 | packet sl; |
1223 | packet sl; |
1466 | |
1224 | |
1467 | sl << "updspell " |
1225 | sl << "updspell " |
1468 | << uint8 (flags) |
1226 | << uint8 (flags) |
1469 | << uint32 (spell->count); |
1227 | << uint32 (spell->count); |
1470 | |
1228 | |
1471 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1229 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1472 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1230 | if (flags & UPD_SP_GRACE) sl << uint16 (spell->cached_grace); |
1473 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1231 | if (flags & UPD_SP_LEVEL) sl << uint16 (spell->cached_eat); |
1474 | |
1232 | |
1475 | pl->ns->send_packet (sl); |
1233 | pl->ns->send_packet (sl); |
1476 | } |
1234 | } |
1477 | } |
1235 | } |
1478 | } |
|
|
1479 | } |
1236 | } |
1480 | |
1237 | |
1481 | void |
1238 | void |
1482 | esrv_remove_spell (player *pl, object *spell) |
1239 | esrv_remove_spell (player *pl, object *spell) |
1483 | { |
1240 | { |
… | |
… | |
1508 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1265 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1509 | return; |
1266 | return; |
1510 | } |
1267 | } |
1511 | |
1268 | |
1512 | /* store costs and damage in the object struct, to compare to later */ |
1269 | /* store costs and damage in the object struct, to compare to later */ |
1513 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1270 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1514 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1271 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1515 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1272 | spell->cached_eat = casting_level (pl->ob, spell); |
1516 | |
1273 | |
1517 | /* figure out which skill it uses, if it uses one */ |
1274 | /* figure out which skill it uses, if it uses one */ |
1518 | if (spell->skill) |
1275 | if (spell->skill) |
1519 | { |
1276 | if (object *tmp = pl->find_skill (spell->skill)) |
1520 | for (i = 1; i < NUM_SKILLS; i++) |
1277 | skill = CS_STAT_SKILLINFO + SKILL_INDEX (tmp); |
1521 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1522 | { |
|
|
1523 | skill = i + CS_STAT_SKILLINFO; |
|
|
1524 | break; |
|
|
1525 | } |
|
|
1526 | } |
|
|
1527 | |
1278 | |
1528 | // spells better have a face |
1279 | // spells better have a face |
1529 | if (!spell->face) |
1280 | if (!spell->face) |
1530 | { |
1281 | { |
1531 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1282 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1532 | spell->face = face_find ("burnout.x11", blank_face); |
1283 | spell->face = face_find ("burnout.x11", blank_face); |
1533 | } |
1284 | } |
|
|
1285 | |
|
|
1286 | pl->ns->send_face (spell->face); |
1534 | |
1287 | |
1535 | /* send the current values */ |
1288 | /* send the current values */ |
1536 | sl << uint32 (spell->count) |
1289 | sl << uint32 (spell->count) |
1537 | << uint16 (spell->level) |
1290 | << uint16 (spell->level) |
1538 | << uint16 (spell->casting_time) |
1291 | << uint16 (spell->casting_time) |
1539 | << uint16 (spell->last_sp) |
1292 | << uint16 (spell->cached_sp) |
1540 | << uint16 (spell->last_grace) |
1293 | << uint16 (spell->cached_grace) |
1541 | << uint16 (spell->last_eat) |
1294 | << uint16 (spell->cached_eat) |
1542 | << uint8 (skill) |
1295 | << uint8 (skill) |
1543 | << uint32 (spell->path_attuned) |
1296 | << uint32 (spell->path_attuned) |
1544 | << uint32 (spell->face) |
1297 | << uint32 (spell->face) |
1545 | << data8 (spell->name) |
1298 | << data8 (spell->name) |
1546 | << data16 (spell->msg); |
1299 | << data16 (spell->msg); |
… | |
… | |
1574 | * bytes and 3 strings (because that is the spec) so we need to |
1327 | * bytes and 3 strings (because that is the spec) so we need to |
1575 | * check that the length of those 3 strings, plus the 23 bytes, |
1328 | * check that the length of those 3 strings, plus the 23 bytes, |
1576 | * won't take us over the length limit for the socket, if it does, |
1329 | * won't take us over the length limit for the socket, if it does, |
1577 | * we need to send what we already have, and restart packet formation |
1330 | * we need to send what we already have, and restart packet formation |
1578 | */ |
1331 | */ |
|
|
1332 | if (spell->type != SPELL) |
|
|
1333 | continue; |
|
|
1334 | |
1579 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1335 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1580 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1336 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1581 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1337 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1582 | * like it will fix this |
1338 | * like it will fix this |
1583 | */ |
1339 | */ |
1584 | if (spell->type != SPELL) |
|
|
1585 | continue; |
|
|
1586 | |
|
|
1587 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1340 | if (sl.length () > (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
1588 | { |
1341 | { |
|
|
1342 | pl->ns->flush_fx (); |
1589 | pl->ns->send_packet (sl); |
1343 | pl->ns->send_packet (sl); |
1590 | |
1344 | |
1591 | sl.reset (); |
1345 | sl.reset (); |
1592 | sl << "addspell "; |
1346 | sl << "addspell "; |
1593 | } |
1347 | } |
… | |
… | |
1601 | return; |
1355 | return; |
1602 | } |
1356 | } |
1603 | else |
1357 | else |
1604 | append_spell (pl, sl, spell); |
1358 | append_spell (pl, sl, spell); |
1605 | |
1359 | |
1606 | if (sl.length () >= MAXSOCKBUF) |
1360 | if (sl.length () > MAXSOCKBUF) |
1607 | { |
1361 | { |
1608 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1362 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
1609 | fatal (0); |
1363 | fatal (0); |
1610 | } |
1364 | } |
1611 | |
1365 | |
1612 | /* finally, we can send the packet */ |
1366 | /* finally, we can send the packet */ |
|
|
1367 | pl->ns->flush_fx (); |
1613 | pl->ns->send_packet (sl); |
1368 | pl->ns->send_packet (sl); |
1614 | } |
1369 | } |
1615 | |
1370 | |
|
|
1371 | //-GPL |
|
|
1372 | |