1 | /* |
1 | /* |
2 | * static char *rcsid_init_c = |
2 | * This file is part of Crossfire TRT, the Multiplayer Online Role Playing Game. |
3 | * "$Id: request.C,v 1.2 2006/08/17 20:23:32 root Exp $"; |
3 | * |
4 | */ |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
5 | |
|
|
6 | /* |
|
|
7 | CrossFire, A Multiplayer game for X-windows |
|
|
8 | |
|
|
9 | Copyright (C) 2001 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
10 | Copyright (C) 1992 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
11 | |
7 | * |
12 | This program is free software; you can redistribute it and/or modify |
8 | * Crossfire TRT is free software; you can redistribute it and/or modify it |
13 | it under the terms of the GNU General Public License as published by |
9 | * under the terms of the GNU General Public License as published by the Free |
14 | the Free Software Foundation; either version 2 of the License, or |
10 | * Software Foundation; either version 2 of the License, or (at your option) |
15 | (at your option) any later version. |
11 | * any later version. |
16 | |
12 | * |
17 | 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, but |
18 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
19 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
20 | GNU General Public License for more details. |
16 | * for more details. |
21 | |
17 | * |
22 | You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the GNU General Public License along |
23 | along with this program; if not, write to the Free Software |
19 | * with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
24 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 | * Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
25 | |
21 | * |
26 | The author can be reached via e-mail to crossfire-devel@real-time.com |
22 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
27 | */ |
23 | */ |
28 | |
24 | |
29 | /** |
25 | /** |
30 | * \file |
26 | * \file |
31 | * Client handling. |
27 | * Client handling. |
32 | * |
28 | * |
… | |
… | |
40 | * have the prototype of (char *data, int datalen, int client_num). This |
36 | * have the prototype of (char *data, int datalen, int client_num). This |
41 | * way, we can use one dispatch table. |
37 | * way, we can use one dispatch table. |
42 | * |
38 | * |
43 | * esrv_map_new starts updating the map |
39 | * esrv_map_new starts updating the map |
44 | * |
40 | * |
45 | * esrv_map_setbelow allows filling in all of the faces for the map. |
|
|
46 | * if a face has not already been sent to the client, it is sent now. |
|
|
47 | * |
|
|
48 | * mapcellchanged, compactlayer, compactstack, perform the map compressing |
|
|
49 | * operations |
|
|
50 | * |
|
|
51 | * esrv_map_doneredraw finishes the map update, and ships across the |
|
|
52 | * map updates. |
|
|
53 | * |
|
|
54 | * esrv_map_scroll tells the client to scroll the map, and does similarily |
|
|
55 | * for the locally cached copy. |
|
|
56 | */ |
41 | */ |
57 | |
42 | |
58 | #include <global.h> |
43 | #include <global.h> |
59 | #include <sproto.h> |
44 | #include <sproto.h> |
60 | |
45 | |
61 | #include <newclient.h> |
|
|
62 | #include <newserver.h> |
|
|
63 | #include <living.h> |
46 | #include <living.h> |
64 | #include <commands.h> |
47 | #include <commands.h> |
65 | |
48 | |
66 | /* This block is basically taken from socket.c - I assume if it works there, |
49 | /* This block is basically taken from socket.c - I assume if it works there, |
67 | * it should work here. |
50 | * it should work here. |
68 | */ |
51 | */ |
69 | #ifndef WIN32 /* ---win32 exclude unix headers */ |
|
|
70 | #include <sys/types.h> |
52 | #include <sys/types.h> |
71 | #include <sys/time.h> |
53 | #include <sys/time.h> |
72 | #include <sys/socket.h> |
54 | #include <sys/socket.h> |
73 | #include <netinet/in.h> |
55 | #include <netinet/in.h> |
74 | #include <netdb.h> |
56 | #include <netdb.h> |
75 | #endif /* win32 */ |
|
|
76 | |
57 | |
77 | #ifdef HAVE_UNISTD_H |
|
|
78 | #include <unistd.h> |
58 | #include <unistd.h> |
79 | #endif |
|
|
80 | |
|
|
81 | #ifdef HAVE_SYS_TIME_H |
|
|
82 | #include <sys/time.h> |
59 | #include <sys/time.h> |
83 | #endif |
|
|
84 | |
60 | |
85 | #include "sounds.h" |
61 | #include "sounds.h" |
86 | |
62 | |
87 | /** |
63 | /** |
88 | * This table translates the attack numbers as used within the |
64 | * This table translates the attack numbers as used within the |
89 | * program to the value we use when sending STATS command to the |
65 | * program to the value we use when sending STATS command to the |
90 | * client. If a value is -1, then we don't send that to the |
66 | * client. If a value is -1, then we don't send that to the |
91 | * client. |
67 | * client. |
92 | */ |
68 | */ |
93 | short atnr_cs_stat[NROFATTACKS] = {CS_STAT_RES_PHYS, |
69 | short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
94 | CS_STAT_RES_MAG,CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
70 | CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
95 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
71 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
96 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */, |
72 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
97 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
73 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
98 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
74 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
99 | CS_STAT_RES_FEAR, -1 /* Cancellation */, |
75 | CS_STAT_RES_FEAR, -1 /* Cancellation */ , |
100 | CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
76 | CS_STAT_RES_DEPLETE, CS_STAT_RES_DEATH, |
101 | -1 /* Chaos */, -1 /* Counterspell */, |
77 | -1 /* Chaos */ , -1 /* Counterspell */ , |
102 | -1 /* Godpower */, CS_STAT_RES_HOLYWORD, |
78 | -1 /* Godpower */ , CS_STAT_RES_HOLYWORD, |
103 | CS_STAT_RES_BLIND, |
79 | CS_STAT_RES_BLIND, |
104 | -1, /* Internal */ |
80 | -1, /* Internal */ |
105 | -1, /* life stealing */ |
81 | -1, /* life stealing */ |
106 | -1 /* Disease - not fully done yet */ |
82 | -1 /* Disease - not fully done yet */ |
107 | }; |
83 | }; |
108 | |
84 | |
109 | static void |
85 | static void |
110 | socket_map_scroll (NewSocket *ns, int dx, int dy) |
86 | socket_map_scroll (client *ns, int dx, int dy) |
111 | { |
87 | { |
112 | struct Map newmap; |
88 | struct Map newmap; |
113 | int x,y, mx, my; |
89 | int x, y, mx, my; |
114 | |
90 | |
115 | { |
|
|
116 | char buf[MAXSOCKBUF]; |
|
|
117 | |
|
|
118 | sprintf(buf,"map_scroll %d %d", dx, dy); |
91 | ns->send_packet_printf ("map_scroll %d %d", dx, dy); |
119 | Write_String_To_Socket(ns, buf, strlen (buf)); |
|
|
120 | } |
|
|
121 | |
92 | |
122 | /* If we are using the Map1aCmd, we may in fact send |
93 | /* If we are using the Map1aCmd, we may in fact send |
123 | * head information that is outside the viewable map. |
94 | * head information that is outside the viewable map. |
124 | * So set the mx,my to the max value we want to |
95 | * So set the mx,my to the max value we want to |
125 | * look for. Removed code to do so - it caused extra |
96 | * look for. Removed code to do so - it caused extra |
126 | * complexities for the client, and probably doesn't make |
97 | * complexities for the client, and probably doesn't make |
127 | * that much difference in bandwidth. |
98 | * that much difference in bandwidth. |
128 | */ |
99 | */ |
129 | mx = ns->mapx; |
100 | mx = ns->mapx; |
130 | my = ns->mapy; |
101 | my = ns->mapy; |
131 | |
102 | |
132 | if (ns->mapmode == Map1aCmd) { |
|
|
133 | mx += MAX_HEAD_OFFSET; |
|
|
134 | my += MAX_HEAD_OFFSET; |
|
|
135 | } |
|
|
136 | |
|
|
137 | /* the x and y here are coordinates for the new map, i.e. if we moved |
103 | /* the x and y here are coordinates for the new map, i.e. if we moved |
138 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
104 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
139 | * if the destination x or y coordinate is outside the viewable |
105 | * if the destination x or y coordinate is outside the viewable |
140 | * area, we clear the values - otherwise, the old values |
106 | * area, we clear the values - otherwise, the old values |
141 | * are preserved, and the check_head thinks it needs to clear them. |
107 | * are preserved, and the check_head thinks it needs to clear them. |
142 | */ |
108 | */ |
143 | for(x=0; x<mx; x++) { |
109 | for (x = 0; x < mx; x++) |
144 | for(y=0; y<my; y++) { |
110 | { |
|
|
111 | for (y = 0; y < my; y++) |
|
|
112 | { |
145 | if(x >= ns->mapx || y >= ns->mapy) { |
113 | if (x >= ns->mapx || y >= ns->mapy) |
146 | /* clear cells outside the viewable area */ |
114 | /* clear cells outside the viewable area */ |
147 | memset(&newmap.cells[x][y], 0, sizeof(struct MapCell)); |
115 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
148 | } |
|
|
149 | else if ((x+dx) < 0 || (x+dx) >= ns->mapx || (y+dy) < 0 || (y + dy) >= ns->mapy) { |
116 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
150 | /* clear newly visible tiles within the viewable area */ |
117 | /* clear newly visible tiles within the viewable area */ |
151 | memset(&(newmap.cells[x][y]), 0, sizeof(struct MapCell)); |
118 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
|
|
119 | else |
|
|
120 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
|
|
121 | } |
152 | } |
122 | } |
153 | else { |
|
|
154 | memcpy(&(newmap.cells[x][y]), |
|
|
155 | &(ns->lastmap.cells[x+dx][y+dy]),sizeof(struct MapCell)); |
|
|
156 | } |
|
|
157 | } |
|
|
158 | } |
|
|
159 | |
123 | |
160 | memcpy(&(ns->lastmap), &newmap,sizeof(struct Map)); |
124 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
161 | |
125 | |
162 | /* Make sure that the next "map1" command will be sent (even if it is |
126 | /* Make sure that the next "map1" command will be sent (even if it is |
163 | * empty). |
127 | * empty). |
164 | */ |
128 | */ |
165 | ns->sent_scroll = 1; |
129 | ns->sent_scroll = 1; |
166 | } |
130 | } |
167 | |
131 | |
|
|
132 | static void |
|
|
133 | clear_map (player *pl) |
|
|
134 | { |
|
|
135 | memset (&pl->ns->lastmap, 0, sizeof (pl->ns->lastmap)); |
|
|
136 | |
|
|
137 | pl->ns->force_newmap = false; |
|
|
138 | |
|
|
139 | if (pl->ns->newmapcmd == 1) |
|
|
140 | pl->ns->send_packet ("newmap"); |
|
|
141 | |
|
|
142 | pl->ns->floorbox_reset (); |
|
|
143 | } |
|
|
144 | |
168 | /** check for map change and send new map data */ |
145 | /** check for map/region change and send new map data */ |
169 | static void |
146 | static void |
170 | check_map_change (player *pl) |
147 | check_map_change (player *pl) |
171 | { |
148 | { |
172 | NewSocket &socket = pl->socket; |
149 | client &socket = *pl->ns; |
173 | object *ob = pl->ob; |
150 | object *ob = pl->observe; |
174 | char buf[MAX_BUF]; /* eauugggh */ |
|
|
175 | |
151 | |
176 | if (socket.current_map != ob->map) |
152 | if (socket.current_map != ob->map || socket.force_newmap) |
177 | { |
153 | { |
|
|
154 | clear_map (pl); |
178 | socket.current_map = ob->map; |
155 | socket.current_map = ob->map; |
179 | memset (&socket.lastmap, 0, sizeof(socket.lastmap)); |
|
|
180 | |
|
|
181 | if (socket.newmapcmd == 1) |
|
|
182 | Write_String_To_Socket (&socket, "newmap", 6); |
|
|
183 | |
|
|
184 | socket.update_look = 1; |
|
|
185 | socket.look_position =0; |
|
|
186 | |
156 | |
187 | if (socket.mapinfocmd) |
157 | if (socket.mapinfocmd) |
188 | { |
158 | { |
189 | if (ob->map && ob->map->path [0]) |
159 | if (ob->map && ob->map->path[0]) |
190 | { |
160 | { |
191 | int flags = 0; |
161 | int flags = 0; |
192 | |
162 | |
193 | if (ob->map->tile_path [0]) flags |= 1; |
163 | if (ob->map->tile_path[0]) flags |= 1; |
194 | if (ob->map->tile_path [1]) flags |= 2; |
164 | if (ob->map->tile_path[1]) flags |= 2; |
195 | if (ob->map->tile_path [2]) flags |= 4; |
165 | if (ob->map->tile_path[2]) flags |= 4; |
196 | if (ob->map->tile_path [3]) flags |= 8; |
166 | if (ob->map->tile_path[3]) flags |= 8; |
197 | |
167 | |
198 | snprintf (buf, MAX_BUF, "mapinfo - spatial %d %d %d %d %d %s", |
168 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
199 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
169 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
200 | ob->map->width, ob->map->height, ob->map->path); |
170 | ob->map->width, ob->map->height, &ob->map->path); |
201 | } |
171 | } |
202 | else |
172 | else |
203 | snprintf (buf, MAX_BUF, "mapinfo current"); |
173 | socket.send_packet ("mapinfo current"); |
204 | |
|
|
205 | Write_String_To_Socket (&socket, buf, strlen (buf)); |
|
|
206 | } |
174 | } |
207 | } |
175 | } |
208 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
176 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
209 | { |
177 | { |
|
|
178 | int dx = ob->x - socket.current_x; |
|
|
179 | int dy = ob->y - socket.current_y; |
|
|
180 | |
|
|
181 | if (socket.buggy_mapscroll && (abs (dx) > 8 || abs (dy) > 8)) |
|
|
182 | clear_map (pl); // current (<= 1.9.1) clients have unchecked buffer overflows |
|
|
183 | else |
|
|
184 | { |
210 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
185 | socket_map_scroll (&socket, ob->x - socket.current_x, ob->y - socket.current_y); |
211 | socket.update_look = 1; |
186 | socket.floorbox_reset (); |
212 | socket.look_position = 0; |
187 | } |
213 | } |
188 | } |
214 | |
189 | |
215 | socket.current_x = ob->x; |
190 | socket.current_x = ob->x; |
216 | socket.current_y = ob->y; |
191 | socket.current_y = ob->y; |
217 | } |
|
|
218 | |
192 | |
|
|
193 | region *reg = ob->region (); |
|
|
194 | if (socket.current_region != reg) |
|
|
195 | { |
|
|
196 | socket.current_region = reg; |
|
|
197 | socket.send_packet_printf ("drawinfo 0 You are now %s.\n(use whereami for more details)", ®->longname); |
|
|
198 | } |
|
|
199 | } |
|
|
200 | |
|
|
201 | /** |
|
|
202 | * RequestInfo is sort of a meta command. There is some specific |
|
|
203 | * request of information, but we call other functions to provide |
|
|
204 | * that information. |
|
|
205 | */ |
|
|
206 | void |
|
|
207 | RequestInfo (char *buf, int len, client * ns) |
|
|
208 | { |
|
|
209 | char *params = NULL, *cp; |
|
|
210 | |
|
|
211 | /* No match */ |
|
|
212 | char bigbuf[MAX_BUF]; |
|
|
213 | int slen; |
|
|
214 | |
|
|
215 | /* Set up replyinfo before we modify any of the buffers - this is used |
|
|
216 | * if we don't find a match. |
|
|
217 | */ |
|
|
218 | strcpy (bigbuf, "replyinfo "); |
|
|
219 | slen = strlen (bigbuf); |
|
|
220 | safe_strcat (bigbuf, buf, &slen, MAX_BUF); |
|
|
221 | |
|
|
222 | /* find the first space, make it null, and update the |
|
|
223 | * params pointer. |
|
|
224 | */ |
|
|
225 | for (cp = buf; *cp != '\0'; cp++) |
|
|
226 | if (*cp == ' ') |
|
|
227 | { |
|
|
228 | *cp = '\0'; |
|
|
229 | params = cp + 1; |
|
|
230 | break; |
|
|
231 | } |
|
|
232 | |
|
|
233 | if (!strcmp (buf, "image_info")) |
|
|
234 | send_image_info (ns, params); |
|
|
235 | else if (!strcmp (buf, "image_sums")) |
|
|
236 | send_image_sums (ns, params); |
|
|
237 | else if (!strcmp (buf, "skill_info")) |
|
|
238 | send_skill_info (ns, params); |
|
|
239 | else if (!strcmp (buf, "spell_paths")) |
|
|
240 | send_spell_paths (ns, params); |
|
|
241 | else |
|
|
242 | ns->send_packet (bigbuf, len); |
|
|
243 | } |
|
|
244 | |
|
|
245 | void |
219 | void ExtCmd (char *buf, int len, player *pl) |
246 | ExtCmd (char *buf, int len, player *pl) |
220 | { |
247 | { |
221 | execute_global_event (EVENT_EXTCMD, pl, buf, len); |
248 | INVOKE_PLAYER (EXTCMD, pl, ARG_DATA (buf, len)); |
222 | } |
249 | } |
223 | |
250 | |
|
|
251 | void |
|
|
252 | ExtiCmd (char *buf, int len, client *ns) |
|
|
253 | { |
|
|
254 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
|
|
255 | } |
|
|
256 | |
|
|
257 | void |
224 | void MapInfoCmd (char *buf, int len, player *pl) |
258 | MapInfoCmd (char *buf, int len, player *pl) |
225 | { |
259 | { |
226 | // <mapinfo tag spatial tile-path |
260 | // <mapinfo tag spatial tile-path |
227 | // >mapinfo tag spatial flags x y w h hash |
261 | // >mapinfo tag spatial flags x y w h hash |
228 | |
262 | |
229 | char bigbuf[MAX_BUF], *cp, *token; |
263 | char bigbuf[MAX_BUF], *token; |
230 | |
264 | |
231 | token = buf; |
265 | token = buf; |
232 | // copy token |
266 | // copy token |
233 | if (!(buf = strchr (buf, ' '))) |
267 | if (!(buf = strchr (buf, ' '))) |
234 | return; |
268 | return; |
… | |
… | |
238 | if (!strncmp (buf, "spatial ", 8)) |
272 | if (!strncmp (buf, "spatial ", 8)) |
239 | { |
273 | { |
240 | buf += 8; |
274 | buf += 8; |
241 | |
275 | |
242 | // initial map and its origin |
276 | // initial map and its origin |
243 | mapstruct *map = pl->ob->map; |
277 | maptile *map = pl->ob->map; |
244 | sint16 dx, dy; |
278 | sint16 dx, dy; |
245 | int mapx = pl->socket.mapx / 2 - pl->ob->x; |
279 | int mapx = pl->ns->mapx / 2 - pl->ob->x; |
246 | int mapy = pl->socket.mapy / 2 - pl->ob->y; |
280 | int mapy = pl->ns->mapy / 2 - pl->ob->y; |
247 | int max_distance = 8; // limit maximum path length to something generous |
281 | int max_distance = 8; // limit maximum path length to something generous |
248 | |
282 | |
249 | while (*buf && map && max_distance) |
283 | while (*buf && map && max_distance) |
250 | { |
284 | { |
251 | int dir = *buf++; |
285 | int dir = *buf++; |
252 | |
286 | |
253 | switch (dir) |
287 | switch (dir) |
254 | { |
288 | { |
255 | case '1': |
289 | case '1': |
256 | dx = 0; dy = -1; map = get_map_from_coord (map, &dx, &dy); |
290 | dx = 0; |
|
|
291 | dy = -1; |
|
|
292 | map = map->xy_find (dx, dy); |
257 | map && (mapy -= map->height); |
293 | map && (mapy -= map->height); |
258 | break; |
294 | break; |
259 | case '2': |
295 | case '2': |
260 | mapx += map->width; |
296 | mapx += map->width; |
261 | dx = map->width; dy = 0; map = get_map_from_coord (map, &dx, &dy); |
297 | dx = map->width; |
|
|
298 | dy = 0; |
|
|
299 | map = map->xy_find (dx, dy); |
262 | break; |
300 | break; |
263 | case '3': |
301 | case '3': |
264 | mapy += map->height; |
302 | mapy += map->height; |
265 | dx = 0; dy = map->height; map = get_map_from_coord (map, &dx, &dy); |
303 | dx = 0; |
|
|
304 | dy = map->height; |
|
|
305 | map = map->xy_find (dx, dy); |
266 | break; |
306 | break; |
267 | case '4': |
307 | case '4': |
268 | dx = -1; dy = 0; map = get_map_from_coord (map, &dx, &dy); |
308 | dx = -1; |
|
|
309 | dy = 0; |
|
|
310 | map = map->xy_find (dx, dy); |
269 | map && (mapx -= map->width); |
311 | map && (mapx -= map->width); |
270 | break; |
312 | break; |
271 | } |
313 | } |
272 | |
314 | |
273 | --max_distance; |
315 | --max_distance; |
274 | } |
316 | } |
275 | |
317 | |
276 | if (!max_distance) |
318 | if (!max_distance) |
277 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
319 | snprintf (bigbuf, MAX_BUF, "mapinfo %s error", token); |
278 | else if (map && map->path [0]) |
320 | else if (map && map->path[0]) |
279 | { |
321 | { |
280 | int flags = 0; |
322 | int flags = 0; |
281 | |
323 | |
282 | if (map->tile_path [0]) flags |= 1; |
324 | if (map->tile_path[0]) flags |= 1; |
283 | if (map->tile_path [1]) flags |= 2; |
325 | if (map->tile_path[1]) flags |= 2; |
284 | if (map->tile_path [2]) flags |= 4; |
326 | if (map->tile_path[2]) flags |= 4; |
285 | if (map->tile_path [3]) flags |= 8; |
327 | if (map->tile_path[3]) flags |= 8; |
286 | |
328 | |
287 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", |
329 | snprintf (bigbuf, MAX_BUF, "mapinfo %s spatial %d %d %d %d %d %s", token, flags, mapx, mapy, map->width, map->height, &map->path); |
288 | token, flags, mapx, mapy, |
|
|
289 | map->width, map->height, map->path); |
|
|
290 | } |
330 | } |
291 | else |
331 | else |
292 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
332 | snprintf (bigbuf, MAX_BUF, "mapinfo %s nomap", token); |
293 | } |
333 | } |
294 | else |
334 | else |
295 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
335 | snprintf (bigbuf, MAX_BUF, "mapinfo %s unsupported", token); |
296 | |
|
|
297 | Write_String_To_Socket (&pl->socket, bigbuf, strlen (bigbuf)); |
|
|
298 | } |
|
|
299 | |
336 | |
300 | /** This is the Setup cmd - easy first implementation */ |
337 | pl->ns->send_packet (bigbuf); |
|
|
338 | } |
|
|
339 | |
|
|
340 | /** This is the Setup cmd */ |
|
|
341 | void |
301 | void SetUp(char *buf, int len, NewSocket *ns) |
342 | SetUp (char *buf, int len, client * ns) |
302 | { |
343 | { |
303 | int s, slen; |
344 | INVOKE_CLIENT (SETUP, ns, ARG_DATA (buf, len)); |
304 | char *cmd, *param, cmdback[HUGE_BUF]; |
|
|
305 | |
|
|
306 | /* run through the cmds of setup |
|
|
307 | * syntax is setup <cmdname1> <parameter> <cmdname2> <parameter> ... |
|
|
308 | * |
|
|
309 | * we send the status of the cmd back, or a FALSE is the cmd is the server unknown |
|
|
310 | * The client then must sort this out |
|
|
311 | */ |
|
|
312 | |
|
|
313 | LOG(llevInfo,"Get SetupCmd:: %s\n", buf); |
|
|
314 | strcpy(cmdback,"setup"); |
|
|
315 | for(s=0;s<len; ) { |
|
|
316 | |
|
|
317 | cmd = &buf[s]; |
|
|
318 | |
|
|
319 | /* find the next space, and put a null there */ |
|
|
320 | for(;buf[s] && buf[s] != ' ';s++) ; |
|
|
321 | buf[s++]=0; |
|
|
322 | while (buf[s] == ' ') s++; |
|
|
323 | |
|
|
324 | if(s>=len) |
|
|
325 | break; |
|
|
326 | |
|
|
327 | param = &buf[s]; |
|
|
328 | |
|
|
329 | for(;buf[s] && buf[s] != ' ';s++) ; |
|
|
330 | buf[s++]=0; |
|
|
331 | while (buf[s] == ' ') s++; |
|
|
332 | |
|
|
333 | slen = strlen(cmdback); |
|
|
334 | safe_strcat(cmdback, " ", &slen, HUGE_BUF); |
|
|
335 | safe_strcat(cmdback, cmd, &slen, HUGE_BUF); |
|
|
336 | safe_strcat(cmdback, " ", &slen, HUGE_BUF); |
|
|
337 | |
|
|
338 | if (!strcmp(cmd,"sound")) { |
|
|
339 | ns->sound = atoi(param); |
|
|
340 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
341 | } |
|
|
342 | else if (!strcmp(cmd,"exp64")) { |
|
|
343 | ns->exp64 = atoi(param); |
|
|
344 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
345 | } else if (!strcmp(cmd, "spellmon")) { |
|
|
346 | ns->monitor_spells = atoi(param); |
|
|
347 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
348 | } else if (!strcmp(cmd,"darkness")) { |
|
|
349 | ns->darkness = atoi(param); |
|
|
350 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
351 | } else if (!strcmp(cmd,"map1cmd")) { |
|
|
352 | if (atoi(param)) ns->mapmode = Map1Cmd; |
|
|
353 | /* if beyond this size, need to use map1cmd no matter what */ |
|
|
354 | if (ns->mapx>11 || ns->mapy>11) ns->mapmode = Map1Cmd; |
|
|
355 | safe_strcat(cmdback, ns->mapmode == Map1Cmd?"1":"0", &slen, HUGE_BUF); |
|
|
356 | } else if (!strcmp(cmd,"map1acmd")) { |
|
|
357 | if (atoi(param)) ns->mapmode = Map1aCmd; |
|
|
358 | /* if beyond this size, need to use map1acmd no matter what */ |
|
|
359 | if (ns->mapx>11 || ns->mapy>11) ns->mapmode = Map1aCmd; |
|
|
360 | safe_strcat(cmdback, ns->mapmode == Map1aCmd?"1":"0", &slen, HUGE_BUF); |
|
|
361 | } else if (!strcmp(cmd,"newmapcmd")) { |
|
|
362 | ns->newmapcmd= atoi(param); |
|
|
363 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
364 | // } else if (!strcmp(cmd,"plugincmd")) { |
|
|
365 | // ns->plugincmd = atoi(param); |
|
|
366 | // safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
367 | } else if (!strcmp(cmd,"mapinfocmd")) { |
|
|
368 | ns->mapinfocmd = atoi(param); |
|
|
369 | safe_strcat(cmdback, "1", &slen, HUGE_BUF); |
|
|
370 | } else if (!strcmp(cmd,"extcmd")) { |
|
|
371 | ns->extcmd = atoi(param); |
|
|
372 | safe_strcat(cmdback, "1", &slen, HUGE_BUF); |
|
|
373 | } else if (!strcmp(cmd,"facecache")) { |
|
|
374 | ns->facecache = atoi(param); |
|
|
375 | safe_strcat(cmdback, param, &slen, HUGE_BUF); |
|
|
376 | } else if (!strcmp(cmd,"faceset")) { |
|
|
377 | char tmpbuf[20]; |
|
|
378 | int q = atoi(param); |
|
|
379 | |
|
|
380 | if (is_valid_faceset(q)) |
|
|
381 | ns->faceset=q; |
|
|
382 | sprintf(tmpbuf,"%d", ns->faceset); |
|
|
383 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
384 | /* if the client is using faceset, it knows about image2 command */ |
|
|
385 | ns->image2=1; |
|
|
386 | } else if (!strcmp(cmd,"itemcmd")) { |
|
|
387 | /* Version of the item protocol command to use. Currently, |
|
|
388 | * only supported versions are 1 and 2. Using a numeric |
|
|
389 | * value will make it very easy to extend this in the future. |
|
|
390 | */ |
|
|
391 | char tmpbuf[20]; |
|
|
392 | int q = atoi(param); |
|
|
393 | if (q<1 || q>2) { |
|
|
394 | strcpy(tmpbuf,"FALSE"); |
|
|
395 | } else { |
|
|
396 | ns->itemcmd = q; |
|
|
397 | sprintf(tmpbuf,"%d", ns->itemcmd); |
|
|
398 | } |
|
|
399 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
400 | } else if (!strcmp(cmd,"mapsize")) { |
|
|
401 | int x, y=0; |
|
|
402 | char tmpbuf[MAX_BUF], *cp; |
|
|
403 | |
|
|
404 | x = atoi(param); |
|
|
405 | for (cp = param; *cp!=0; cp++) |
|
|
406 | if (*cp == 'x' || *cp == 'X') { |
|
|
407 | y = atoi(cp+1); |
|
|
408 | break; |
|
|
409 | } |
|
|
410 | if (x < 9 || y < 9 || x>MAP_CLIENT_X || y > MAP_CLIENT_Y) { |
|
|
411 | sprintf(tmpbuf," %dx%d", MAP_CLIENT_X, MAP_CLIENT_Y); |
|
|
412 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
413 | } else { |
|
|
414 | ns->mapx = x; |
|
|
415 | ns->mapy = y; |
|
|
416 | /* better to send back what we are really using and not the |
|
|
417 | * param as given to us in case it gets parsed differently. |
|
|
418 | */ |
|
|
419 | sprintf(tmpbuf,"%dx%d", x,y); |
|
|
420 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
421 | /* If beyond this size and still using orig map command, need to |
|
|
422 | * go to map1cmd. |
|
|
423 | */ |
|
|
424 | if ((x>11 || y>11) && ns->mapmode == Map0Cmd) ns->mapmode = Map1Cmd; |
|
|
425 | } |
|
|
426 | } else if (!strcmp(cmd,"extendedMapInfos")) { |
|
|
427 | /* Added by tchize |
|
|
428 | * prepare to use the mapextended command |
|
|
429 | */ |
|
|
430 | char tmpbuf[20]; |
|
|
431 | ns->ext_mapinfos = (atoi(param)); |
|
|
432 | sprintf(tmpbuf,"%d", ns->ext_mapinfos); |
|
|
433 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
434 | } else if (!strcmp(cmd,"extendedTextInfos")) { |
|
|
435 | /* Added by tchize |
|
|
436 | * prepare to use the extended text commands |
|
|
437 | * Client toggle this to non zero to get exttext |
|
|
438 | */ |
|
|
439 | char tmpbuf[20]; |
|
|
440 | |
|
|
441 | ns->has_readable_type = (atoi(param)); |
|
|
442 | sprintf(tmpbuf,"%d", ns->has_readable_type); |
|
|
443 | safe_strcat(cmdback, tmpbuf, &slen, HUGE_BUF); |
|
|
444 | } else { |
|
|
445 | /* Didn't get a setup command we understood - |
|
|
446 | * report a failure to the client. |
|
|
447 | */ |
|
|
448 | safe_strcat(cmdback, "FALSE", &slen, HUGE_BUF); |
|
|
449 | } |
|
|
450 | } /* for processing all the setup commands */ |
|
|
451 | LOG(llevInfo,"SendBack SetupCmd:: %s\n", cmdback); |
|
|
452 | Write_String_To_Socket(ns, cmdback, strlen(cmdback)); |
|
|
453 | } |
345 | } |
454 | |
346 | |
455 | /** |
347 | /** |
456 | * The client has requested to be added to the game. |
348 | * The client has requested to be added to the game. |
457 | * This is what takes care of it. We tell the client how things worked out. |
349 | * This is what takes care of it. We tell the client how things worked out. |
458 | * I am not sure if this file is the best place for this function. however, |
350 | * I am not sure if this file is the best place for this function. however, |
459 | * it either has to be here or init_sockets needs to be exported. |
351 | * it either has to be here or init_sockets needs to be exported. |
460 | */ |
352 | */ |
|
|
353 | void |
461 | void AddMeCmd(char *buf, int len, NewSocket *ns) |
354 | AddMeCmd (char *buf, int len, client *ns) |
462 | { |
355 | { |
463 | Settings oldsettings; |
356 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
464 | oldsettings=settings; |
|
|
465 | if (ns->status != Ns_Add || add_player(ns)) { |
|
|
466 | Write_String_To_Socket(ns, "addme_failed",12); |
|
|
467 | } else { |
|
|
468 | /* Basically, the add_player copies the socket structure into |
|
|
469 | * the player structure, so this one (which is from init_sockets) |
|
|
470 | * is not needed anymore. The write below should still work, as the |
|
|
471 | * stuff in ns is still relevant. |
|
|
472 | */ |
|
|
473 | Write_String_To_Socket(ns, "addme_success",13); |
|
|
474 | socket_info.nconns--; |
|
|
475 | ns->status = Ns_Avail; |
|
|
476 | } |
|
|
477 | settings=oldsettings; |
|
|
478 | } |
357 | } |
479 | |
358 | |
480 | /** Reply to ExtendedInfos command */ |
359 | /** Reply to ExtendedInfos command */ |
|
|
360 | void |
481 | void ToggleExtendedInfos (char *buf, int len, NewSocket *ns){ |
361 | ToggleExtendedInfos (char *buf, int len, client * ns) |
|
|
362 | { |
482 | char cmdback[MAX_BUF]; |
363 | char cmdback[MAX_BUF]; |
483 | char command[50]; |
364 | char command[50]; |
484 | int info,nextinfo; |
365 | int info, nextinfo; |
|
|
366 | |
485 | cmdback[0]='\0'; |
367 | cmdback[0] = '\0'; |
486 | nextinfo=0; |
368 | nextinfo = 0; |
|
|
369 | |
487 | while (1){ |
370 | while (1) |
|
|
371 | { |
488 | /* 1. Extract an info*/ |
372 | /* 1. Extract an info */ |
489 | info=nextinfo; |
373 | info = nextinfo; |
|
|
374 | |
490 | while ( (info<len) && (buf[info]==' ') ) info++; |
375 | while ((info < len) && (buf[info] == ' ')) |
|
|
376 | info++; |
|
|
377 | |
491 | if (info>=len) |
378 | if (info >= len) |
492 | break; |
379 | break; |
|
|
380 | |
493 | nextinfo=info+1; |
381 | nextinfo = info + 1; |
|
|
382 | |
494 | while ( (nextinfo<len) && (buf[nextinfo]!=' ') ) |
383 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
495 | nextinfo++; |
384 | nextinfo++; |
|
|
385 | |
496 | if (nextinfo-info>=49) /*Erroneous info asked*/ |
386 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
497 | continue; |
387 | continue; |
|
|
388 | |
498 | strncpy (command,&(buf[info]),nextinfo-info); |
389 | strncpy (command, &(buf[info]), nextinfo - info); |
499 | command[nextinfo-info]='\0'; |
390 | |
500 | /* 2. Interpret info*/ |
391 | /* 2. Interpret info */ |
501 | if (!strcmp("smooth",command)){ |
392 | if (!strcmp ("smooth", command)) |
502 | /* Toggle smoothing*/ |
393 | /* Toggle smoothing */ |
503 | ns->EMI_smooth=!ns->EMI_smooth; |
394 | ns->EMI_smooth = !ns->EMI_smooth; |
504 | }else{ |
395 | else |
505 | /*bad value*/ |
396 | /*bad value */; |
506 | } |
397 | |
507 | /*3. Next info*/ |
398 | /*3. Next info */ |
508 | } |
399 | } |
|
|
400 | |
509 | strcpy (cmdback,"ExtendedInfoSet"); |
401 | strcpy (cmdback, "ExtendedInfoSet"); |
|
|
402 | |
510 | if (ns->EMI_smooth){ |
403 | if (ns->EMI_smooth) |
|
|
404 | { |
511 | strcat (cmdback," "); |
405 | strcat (cmdback, " "); |
512 | strcat (cmdback,"smoothing"); |
406 | strcat (cmdback, "smoothing"); |
513 | } |
407 | } |
514 | Write_String_To_Socket(ns, cmdback,strlen(cmdback)); |
408 | |
|
|
409 | ns->send_packet (cmdback); |
515 | } |
410 | } |
|
|
411 | |
516 | /* |
412 | /* |
517 | #define MSG_TYPE_BOOK 1 |
413 | #define MSG_TYPE_BOOK 1 |
518 | #define MSG_TYPE_CARD 2 |
414 | #define MSG_TYPE_CARD 2 |
519 | #define MSG_TYPE_PAPER 3 |
415 | #define MSG_TYPE_PAPER 3 |
520 | #define MSG_TYPE_SIGN 4 |
416 | #define MSG_TYPE_SIGN 4 |
521 | #define MSG_TYPE_MONUMENT 5 |
417 | #define MSG_TYPE_MONUMENT 5 |
522 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
418 | #define MSG_TYPE_SCRIPTED_DIALOG 6*/ |
|
|
419 | |
523 | /** Reply to ExtendedInfos command */ |
420 | /** Reply to ExtendedInfos command */ |
|
|
421 | void |
524 | void ToggleExtendedText (char *buf, int len, NewSocket *ns){ |
422 | ToggleExtendedText (char *buf, int len, client * ns) |
|
|
423 | { |
525 | char cmdback[MAX_BUF]; |
424 | char cmdback[MAX_BUF]; |
526 | char temp[10]; |
425 | char temp[10]; |
527 | char command[50]; |
426 | char command[50]; |
528 | int info,nextinfo,i,flag; |
427 | int info, nextinfo, i, flag; |
|
|
428 | |
529 | cmdback[0]='\0'; |
429 | cmdback[0] = '\0'; |
|
|
430 | |
530 | nextinfo=0; |
431 | nextinfo = 0; |
531 | while (1){ |
432 | while (1) |
|
|
433 | { |
532 | /* 1. Extract an info*/ |
434 | /* 1. Extract an info */ |
533 | info=nextinfo; |
435 | info = nextinfo; |
|
|
436 | |
534 | while ( (info<len) && (buf[info]==' ') ) info++; |
437 | while ((info < len) && (buf[info] == ' ')) |
|
|
438 | info++; |
|
|
439 | |
535 | if (info>=len) |
440 | if (info >= len) |
536 | break; |
441 | break; |
|
|
442 | |
537 | nextinfo=info+1; |
443 | nextinfo = info + 1; |
|
|
444 | |
538 | while ( (nextinfo<len) && (buf[nextinfo]!=' ') ) |
445 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
539 | nextinfo++; |
446 | nextinfo++; |
|
|
447 | |
540 | if (nextinfo-info>=49) /*Erroneous info asked*/ |
448 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
541 | continue; |
449 | continue; |
|
|
450 | |
542 | strncpy (command,&(buf[info]),nextinfo-info); |
451 | strncpy (command, &(buf[info]), nextinfo - info); |
543 | command[nextinfo-info]='\0'; |
452 | command[nextinfo - info] = '\0'; |
544 | /* 2. Interpret info*/ |
453 | /* 2. Interpret info */ |
545 | i = sscanf(command,"%d",&flag); |
454 | i = sscanf (command, "%d", &flag); |
|
|
455 | |
546 | if ( (i==1) && (flag>0) && (flag<=MSG_TYPE_LAST)) |
456 | if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
547 | ns->supported_readables|=(1<<flag); |
457 | ns->supported_readables |= (1 << flag); |
548 | /*3. Next info*/ |
458 | /*3. Next info */ |
549 | } |
459 | } |
|
|
460 | |
550 | /* Send resulting state */ |
461 | /* Send resulting state */ |
551 | strcpy (cmdback,"ExtendedTextSet"); |
462 | strcpy (cmdback, "ExtendedTextSet"); |
|
|
463 | |
552 | for (i=0;i<=MSG_TYPE_LAST;i++) |
464 | for (i = 0; i <= MSG_TYPE_LAST; i++) |
553 | if (ns->supported_readables &(1<<i)){ |
465 | if (ns->supported_readables & (1 << i)) |
|
|
466 | { |
554 | strcat (cmdback," "); |
467 | strcat (cmdback, " "); |
555 | snprintf(temp,sizeof(temp),"%d",i); |
468 | snprintf (temp, sizeof (temp), "%d", i); |
556 | strcat (cmdback,temp); |
469 | strcat (cmdback, temp); |
557 | } |
470 | } |
558 | Write_String_To_Socket(ns, cmdback,strlen(cmdback)); |
|
|
559 | } |
|
|
560 | |
471 | |
561 | /** |
472 | ns->send_packet (cmdback); |
562 | * A lot like the old AskSmooth (in fact, now called by AskSmooth). |
|
|
563 | * Basically, it makes no sense to wait for the client to request a |
|
|
564 | * a piece of data from us that we know the client wants. So |
|
|
565 | * if we know the client wants it, might as well push it to the |
|
|
566 | * client. |
|
|
567 | */ |
|
|
568 | static void SendSmooth(NewSocket *ns, uint16 face) { |
|
|
569 | uint16 smoothface; |
|
|
570 | unsigned char reply[MAX_BUF]; |
|
|
571 | SockList sl; |
|
|
572 | |
|
|
573 | /* If we can't find a face, return and set it so we won't try to send this |
|
|
574 | * again. |
|
|
575 | */ |
|
|
576 | if ((!FindSmooth (face, &smoothface)) && |
|
|
577 | (!FindSmooth ( smooth_face->number, &smoothface))) { |
|
|
578 | |
|
|
579 | LOG(llevError,"could not findsmooth for %d. Neither default (%s)\n",face,smooth_face->name); |
|
|
580 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
|
|
581 | return; |
|
|
582 | } |
|
|
583 | |
|
|
584 | if (!(ns->faces_sent[smoothface] & NS_FACESENT_FACE)) |
|
|
585 | esrv_send_face(ns, smoothface, 0); |
|
|
586 | |
|
|
587 | ns->faces_sent[face] |= NS_FACESENT_SMOOTH; |
|
|
588 | |
|
|
589 | sl.buf=reply; |
|
|
590 | strcpy((char*)sl.buf,"smooth "); |
|
|
591 | sl.len=strlen((char*)sl.buf); |
|
|
592 | SockList_AddShort(&sl, face); |
|
|
593 | SockList_AddShort(&sl, smoothface); |
|
|
594 | Send_With_Handling(ns, &sl); |
|
|
595 | } |
473 | } |
596 | |
474 | |
597 | /** |
475 | /** |
|
|
476 | * client requested an image. send it rate-limited |
|
|
477 | * before flushing. |
|
|
478 | */ |
|
|
479 | void |
|
|
480 | AskFaceCmd (char *buf, int len, client *ns) |
|
|
481 | { |
|
|
482 | ns->askface.push_back (atoi (buf)); |
|
|
483 | } |
|
|
484 | |
|
|
485 | /** |
598 | * Tells client the picture it has to use |
486 | * Tells client the picture it has to use |
599 | * to smooth a picture number given as argument. |
487 | * to smooth a picture number given as argument. |
600 | */ |
488 | */ |
|
|
489 | void |
601 | void AskSmooth (char *buf, int len, NewSocket *ns){ |
490 | AskSmooth (char *buf, int len, client *ns) |
602 | uint16 facenbr; |
491 | { |
603 | |
492 | ns->send_face (atoi (buf)); |
604 | facenbr=atoi (buf); |
493 | ns->flush_fx (); |
605 | SendSmooth(ns, facenbr); |
|
|
606 | } |
494 | } |
607 | |
|
|
608 | |
|
|
609 | |
|
|
610 | |
|
|
611 | |
495 | |
612 | /** |
496 | /** |
613 | * This handles the general commands from the client (ie, north, fire, cast, |
497 | * This handles the general commands from the client (ie, north, fire, cast, |
614 | * etc.) |
498 | * etc.) |
615 | */ |
499 | */ |
|
|
500 | void |
616 | void PlayerCmd(char *buf, int len, player *pl) |
501 | PlayerCmd (char *buf, int len, player *pl) |
617 | { |
502 | { |
618 | |
|
|
619 | /* The following should never happen with a proper or honest client. |
|
|
620 | * Therefore, the error message doesn't have to be too clear - if |
|
|
621 | * someone is playing with a hacked/non working client, this gives them |
|
|
622 | * an idea of the problem, but they deserve what they get |
|
|
623 | */ |
|
|
624 | if (pl->state!=ST_PLAYING) { |
|
|
625 | new_draw_info_format(NDI_UNIQUE, 0,pl->ob, |
|
|
626 | "You can not issue commands - state is not ST_PLAYING (%s)", buf); |
|
|
627 | return; |
|
|
628 | } |
|
|
629 | /* Check if there is a count. In theory, a zero count could also be |
503 | /* Check if there is a count. In theory, a zero count could also be |
630 | * sent, so check for that also. |
504 | * sent, so check for that also. |
631 | */ |
505 | */ |
632 | if (atoi(buf) || buf[0]=='0') { |
506 | if (atoi (buf) || buf[0] == '0') |
|
|
507 | { |
633 | pl->count=atoi((char*)buf); |
508 | pl->count = atoi ((char *) buf); |
|
|
509 | |
634 | buf=strchr(buf,' '); /* advance beyond the numbers */ |
510 | buf = strchr (buf, ' '); /* advance beyond the numbers */ |
635 | if (!buf) { |
511 | if (!buf) |
636 | #ifdef ESRV_DEBUG |
|
|
637 | LOG(llevDebug,"PlayerCmd: Got count but no command.\n"); |
|
|
638 | #endif |
|
|
639 | return; |
512 | return; |
640 | } |
513 | |
641 | buf++; |
514 | buf++; |
642 | } |
515 | } |
643 | /* This should not happen anymore. */ |
516 | |
644 | if (pl->ob->speed_left<-1.0) { |
|
|
645 | LOG(llevError,"Player has negative time - shouldn't do command.\n"); |
|
|
646 | } |
|
|
647 | /* In c_new.c */ |
|
|
648 | execute_newserver_command(pl->ob, (char*)buf); |
517 | execute_newserver_command (pl->ob, (char *) buf); |
|
|
518 | |
649 | /* Perhaps something better should be done with a left over count. |
519 | /* Perhaps something better should be done with a left over count. |
650 | * Cleaning up the input should probably be done first - all actions |
520 | * Cleaning up the input should probably be done first - all actions |
651 | * for the command that issued the count should be done before any other |
521 | * for the command that issued the count should be done before any other |
652 | * commands. |
522 | * commands. |
653 | */ |
523 | */ |
654 | |
|
|
655 | pl->count=0; |
524 | pl->count = 0; |
656 | |
|
|
657 | } |
525 | } |
658 | |
|
|
659 | |
526 | |
660 | /** |
527 | /** |
661 | * This handles the general commands from the client (ie, north, fire, cast, |
528 | * This handles the general commands from the client (ie, north, fire, cast, |
662 | * etc.). It is a lot like PlayerCmd above, but is called with the |
529 | * etc.). It is a lot like PlayerCmd above, but is called with the |
663 | * 'ncom' method which gives more information back to the client so it |
530 | * 'ncom' method which gives more information back to the client so it |
664 | * can throttle. |
531 | * can throttle. |
665 | */ |
532 | */ |
|
|
533 | void |
666 | void NewPlayerCmd(uint8 *buf, int len, player *pl) |
534 | NewPlayerCmd (char *buf, int len, player *pl) |
667 | { |
535 | { |
668 | int time,repeat; |
536 | if (len <= 6) |
669 | short packet; |
537 | { |
670 | unsigned char command[MAX_BUF]; |
|
|
671 | SockList sl; |
|
|
672 | |
|
|
673 | if (len < 7) { |
|
|
674 | LOG(llevDebug,"Corrupt ncom command <%s> not long enough - discarding\n", buf); |
538 | LOG (llevDebug, "Corrupt ncom command <%s> not long enough - discarding\n", buf); |
675 | return; |
539 | return; |
676 | } |
540 | } |
677 | |
541 | |
678 | packet = GetShort_String(buf); |
542 | uint16 cmdid = net_uint16 ((uint8 *)buf); |
679 | repeat = GetInt_String(buf+2); |
543 | sint32 repeat = net_sint32 ((uint8 *)buf + 2); |
|
|
544 | |
680 | /* -1 is special - no repeat, but don't update */ |
545 | /* -1 is special - no repeat, but don't update */ |
681 | if (repeat!=-1) { |
546 | if (repeat != -1) |
682 | pl->count=repeat; |
547 | pl->count = repeat; |
683 | } |
|
|
684 | if ((len-4) >= MAX_BUF) len=MAX_BUF-5; |
|
|
685 | |
548 | |
686 | strncpy((char*)command, (char*)buf+6, len-4); |
549 | buf += 6; //len -= 6; |
687 | command[len-4]='\0'; |
|
|
688 | |
550 | |
689 | /* The following should never happen with a proper or honest client. |
|
|
690 | * Therefore, the error message doesn't have to be too clear - if |
|
|
691 | * someone is playing with a hacked/non working client, this gives them |
|
|
692 | * an idea of the problem, but they deserve what they get |
|
|
693 | */ |
|
|
694 | if (pl->state!=ST_PLAYING) { |
|
|
695 | new_draw_info_format(NDI_UNIQUE, 0,pl->ob, |
|
|
696 | "You can not issue commands - state is not ST_PLAYING (%s)", buf); |
|
|
697 | return; |
|
|
698 | } |
|
|
699 | |
|
|
700 | /* This should not happen anymore. */ |
|
|
701 | if (pl->ob->speed_left<-1.0) { |
|
|
702 | LOG(llevError,"Player has negative time - shouldn't do command.\n"); |
|
|
703 | } |
|
|
704 | /* In c_new.c */ |
|
|
705 | execute_newserver_command(pl->ob, (char*)command); |
551 | execute_newserver_command (pl->ob, buf); |
|
|
552 | |
706 | /* Perhaps something better should be done with a left over count. |
553 | /* Perhaps something better should be done with a left over count. |
707 | * Cleaning up the input should probably be done first - all actions |
554 | * Cleaning up the input should probably be done first - all actions |
708 | * for the command that issued the count should be done before any other |
555 | * for the command that issued the count should be done before any other |
709 | * commands. |
556 | * commands. |
710 | */ |
557 | */ |
711 | pl->count=0; |
558 | pl->count = 0; |
712 | |
559 | |
|
|
560 | //TODO: schmorp thinks whatever this calculates, it makes no sense at all |
|
|
561 | int time = fabs (pl->ob->speed) < 0.001 |
|
|
562 | ? time = MAX_TIME * 100 |
|
|
563 | : time = (int) (MAX_TIME / fabs (pl->ob->speed)); |
|
|
564 | |
713 | /* Send confirmation of command execution now */ |
565 | /* Send confirmation of command execution now */ |
714 | sl.buf = command; |
566 | packet sl ("comc"); |
715 | strcpy((char*)sl.buf,"comc "); |
567 | sl << uint16 (cmdid) << uint32 (time); |
716 | sl.len=5; |
568 | pl->ns->send_packet (sl); |
717 | SockList_AddShort(&sl,packet); |
|
|
718 | if (FABS(pl->ob->speed) < 0.001) time=MAX_TIME * 100; |
|
|
719 | else |
|
|
720 | time = ( int )( MAX_TIME/ FABS(pl->ob->speed) ); |
|
|
721 | SockList_AddInt(&sl,time); |
|
|
722 | Send_With_Handling(&pl->socket, &sl); |
|
|
723 | } |
569 | } |
724 | |
|
|
725 | |
570 | |
726 | /** This is a reply to a previous query. */ |
571 | /** This is a reply to a previous query. */ |
|
|
572 | void |
727 | void ReplyCmd(char *buf, int len, player *pl) |
573 | ReplyCmd (char *buf, int len, client *ns) |
728 | { |
574 | { |
|
|
575 | if (ns->state == ST_CUSTOM) |
|
|
576 | { |
|
|
577 | INVOKE_CLIENT (REPLY, ns, ARG_DATA (buf, len)); |
|
|
578 | return; |
|
|
579 | } |
|
|
580 | |
|
|
581 | if (!ns->pl) |
|
|
582 | return; //TODO: depends on the exact reply we are after |
|
|
583 | //TODO: but right now, we always have a ns->pl |
|
|
584 | |
|
|
585 | player *pl = ns->pl; |
|
|
586 | |
729 | /* This is to synthesize how the data would be stored if it |
587 | /* This is to synthesize how the data would be stored if it |
730 | * was normally entered. A bit of a hack, and should be cleaned up |
588 | * was normally entered. A bit of a hack, and should be cleaned up |
731 | * once all the X11 code is removed from the server. |
589 | * once all the X11 code is removed from the server. |
732 | * |
590 | * |
733 | * We pass 13 to many of the functions because this way they |
591 | * We pass 13 to many of the functions because this way they |
734 | * think it was the carriage return that was entered, and the |
592 | * think it was the carriage return that was entered, and the |
735 | * function then does not try to do additional input. |
593 | * function then does not try to do additional input. |
736 | */ |
594 | */ |
737 | snprintf(pl->write_buf, sizeof(pl->write_buf), ":%s", buf); |
595 | snprintf (pl->write_buf, sizeof (pl->write_buf), ":%s", buf); |
738 | |
596 | |
739 | /* this avoids any hacking here */ |
597 | /* this avoids any hacking here */ |
|
|
598 | |
|
|
599 | switch (ns->state) |
740 | |
600 | { |
741 | switch (pl->state) { |
|
|
742 | case ST_PLAYING: |
601 | case ST_PLAYING: |
743 | LOG(llevError,"Got reply message with ST_PLAYING input state\n"); |
602 | LOG (llevError, "Got reply message with ST_PLAYING input state\n"); |
744 | break; |
|
|
745 | |
|
|
746 | case ST_PLAY_AGAIN: |
|
|
747 | /* We can check this for return value (2==quit). Maybe we |
|
|
748 | * should, and do something appropriate? |
|
|
749 | */ |
|
|
750 | receive_play_again(pl->ob, buf[0]); |
|
|
751 | break; |
|
|
752 | |
|
|
753 | case ST_ROLL_STAT: |
|
|
754 | key_roll_stat(pl->ob,buf[0]); |
|
|
755 | break; |
|
|
756 | |
|
|
757 | case ST_CHANGE_CLASS: |
|
|
758 | |
|
|
759 | key_change_class(pl->ob, buf[0]); |
|
|
760 | break; |
603 | break; |
761 | |
604 | |
762 | case ST_CONFIRM_QUIT: |
|
|
763 | key_confirm_quit(pl->ob, buf[0]); |
|
|
764 | break; |
|
|
765 | |
|
|
766 | case ST_CONFIGURE: |
|
|
767 | LOG(llevError,"In client input handling, but into configure state\n"); |
|
|
768 | pl->state = ST_PLAYING; |
|
|
769 | break; |
|
|
770 | |
|
|
771 | case ST_GET_NAME: |
|
|
772 | receive_player_name(pl->ob,13); |
|
|
773 | break; |
|
|
774 | |
|
|
775 | case ST_GET_PASSWORD: |
|
|
776 | case ST_CONFIRM_PASSWORD: |
|
|
777 | receive_player_password(pl->ob,13); |
|
|
778 | break; |
|
|
779 | |
|
|
780 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
605 | case ST_GET_PARTY_PASSWORD: /* Get password for party */ |
781 | receive_party_password(pl->ob,13); |
606 | receive_party_password (pl->ob, 13); |
782 | break; |
607 | break; |
783 | |
608 | |
784 | default: |
609 | default: |
785 | LOG(llevError,"Unknown input state: %d\n", pl->state); |
610 | LOG (llevError, "Unknown input state: %d\n", ns->state); |
786 | } |
611 | } |
787 | } |
612 | } |
788 | |
613 | |
789 | /** |
614 | /** |
790 | * Client tells its version. If there is a mismatch, we close the |
615 | * Client tells its version. If there is a mismatch, we close the |
791 | * socket. In real life, all we should care about is the client having |
616 | * socket. In real life, all we should care about is the client having |
792 | * something older than the server. If we assume the client will be |
617 | * something older than the server. If we assume the client will be |
793 | * backwards compatible, having it be a later version should not be a |
618 | * backwards compatible, having it be a later version should not be a |
794 | * problem. |
619 | * problem. |
795 | */ |
620 | */ |
|
|
621 | void |
796 | void VersionCmd(char *buf, int len,NewSocket *ns) |
622 | VersionCmd (char *buf, int len, client * ns) |
797 | { |
623 | { |
798 | char *cp; |
|
|
799 | char version_warning[256]; |
|
|
800 | |
|
|
801 | if (!buf) { |
624 | if (!buf) |
|
|
625 | { |
802 | LOG(llevError, "CS: received corrupted version command\n"); |
626 | LOG (llevError, "CS: received corrupted version command\n"); |
803 | return; |
627 | return; |
804 | } |
628 | } |
805 | |
629 | |
806 | ns->cs_version = atoi(buf); |
630 | ns->cs_version = atoi (buf); |
807 | ns->sc_version = ns->cs_version; |
631 | ns->sc_version = ns->cs_version; |
|
|
632 | |
|
|
633 | LOG (llevDebug, "connection from client <%s>\n", buf); |
|
|
634 | |
|
|
635 | //TODO: should log here just for statistics |
|
|
636 | |
808 | if (VERSION_CS != ns->cs_version) { |
637 | //if (VERSION_CS != ns->cs_version) |
809 | #ifdef ESRV_DEBUG |
638 | // unchecked; |
810 | LOG(llevDebug, "CS: csversion mismatch (%d,%d)\n", VERSION_CS,ns->cs_version); |
639 | |
811 | #endif |
|
|
812 | } |
|
|
813 | cp = strchr(buf+1,' '); |
640 | char *cp = strchr (buf + 1, ' '); |
814 | if (!cp) return; |
641 | if (!cp) |
|
|
642 | return; |
|
|
643 | |
815 | ns->sc_version = atoi(cp); |
644 | ns->sc_version = atoi (cp); |
|
|
645 | |
816 | if (VERSION_SC != ns->sc_version) { |
646 | //if (VERSION_SC != ns->sc_version) |
817 | #ifdef ESRV_DEBUG |
647 | // unchecked; |
818 | LOG(llevDebug, "CS: scversion mismatch (%d,%d)\n",VERSION_SC,ns->sc_version); |
648 | |
819 | #endif |
|
|
820 | } |
|
|
821 | cp = strchr(cp+1, ' '); |
649 | cp = strchr (cp + 1, ' '); |
|
|
650 | |
822 | if (cp) { |
651 | if (cp) |
823 | LOG(llevDebug,"CS: connection from client of type <%s>, ip %s\n", cp, ns->host); |
652 | { |
|
|
653 | ns->version = cp + 1; |
824 | |
654 | |
825 | /* This is first implementation - i skip all beta DX clients with it |
655 | if (ns->sc_version < 1026) |
826 | * Add later stuff here for other clients |
656 | ns->send_packet_printf ("drawinfo %d %s", NDI_RED, |
827 | */ |
657 | "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
828 | |
|
|
829 | /* these are old dxclients */ |
|
|
830 | /* Version 1024 added support for singular + plural name values - |
|
|
831 | * requiing this minimal value reduces complexity of that code, and it |
|
|
832 | * has been around for a long time. |
|
|
833 | */ |
|
|
834 | if(!strcmp(" CF DX CLIENT", cp) || ns->sc_version < 1024 ) |
|
|
835 | { |
|
|
836 | sprintf(version_warning,"drawinfo %d %s", NDI_RED, "**** VERSION WARNING ****\n**** CLIENT IS TOO OLD!! UPDATE THE CLIENT!! ****"); |
|
|
837 | Write_String_To_Socket(ns, version_warning, strlen(version_warning)); |
|
|
838 | } |
|
|
839 | |
|
|
840 | } |
658 | } |
841 | } |
659 | } |
842 | |
660 | |
843 | /** sound related functions. */ |
661 | /** sound related functions. */ |
844 | |
662 | void |
845 | void SetSound(char *buf, int len, NewSocket *ns) |
663 | SetSound (char *buf, int len, client * ns) |
846 | { |
664 | { |
847 | ns->sound = atoi(buf); |
665 | ns->sound = atoi (buf); |
848 | } |
666 | } |
849 | |
667 | |
850 | /** client wants the map resent */ |
668 | /** client wants the map resent */ |
851 | |
669 | void |
852 | void MapRedrawCmd(char *buf, int len, player *pl) |
670 | MapRedrawCmd (char *buf, int len, player *pl) |
853 | { |
671 | { |
854 | /* This function is currently disabled; just clearing the map state results in |
672 | /* This function is currently disabled; just clearing the map state results in |
855 | * display errors. It should clear the cache and send a newmap command. |
673 | * display errors. It should clear the cache and send a newmap command. |
856 | * Unfortunately this solution does not work because some client versions send |
674 | * Unfortunately this solution does not work because some client versions send |
857 | * a mapredraw command after receiving a newmap command. |
675 | * a mapredraw command after receiving a newmap command. |
858 | */ |
676 | */ |
859 | #if 0 |
|
|
860 | /* Okay, this is MAJOR UGLY. but the only way I know how to |
|
|
861 | * clear the "cache" |
|
|
862 | */ |
|
|
863 | memset(&pl->socket.lastmap, 0, sizeof(struct Map)); |
|
|
864 | draw_client_map(pl->ob); |
|
|
865 | #endif |
|
|
866 | } |
677 | } |
867 | |
678 | |
868 | /** |
679 | /** |
869 | * Moves an object (typically, container to inventory). |
680 | * Moves an object (typically, container to inventory). |
870 | * syntax is: move (to) (tag) (nrof) |
681 | * syntax is: move (to) (tag) (nrof) |
871 | */ |
682 | */ |
|
|
683 | void |
872 | void MoveCmd(char *buf, int len,player *pl) |
684 | MoveCmd (char *buf, int len, player *pl) |
873 | { |
685 | { |
874 | int vals[3], i; |
686 | int vals[3], i; |
875 | |
687 | |
876 | /* A little funky here. We only cycle for 2 records, because |
688 | /* A little funky here. We only cycle for 2 records, because |
877 | * we obviously am not going to find a space after the third |
689 | * we obviously are not going to find a space after the third |
878 | * record. Perhaps we should just replace this with a |
690 | * record. Perhaps we should just replace this with a |
879 | * sscanf? |
691 | * sscanf? |
880 | */ |
692 | */ |
881 | for (i=0; i<2; i++) { |
693 | for (i = 0; i < 2; i++) |
|
|
694 | { |
882 | vals[i]=atoi(buf); |
695 | vals[i] = atoi (buf); |
|
|
696 | |
883 | if (!(buf = strchr(buf, ' '))) { |
697 | if (!(buf = strchr (buf, ' '))) |
|
|
698 | { |
884 | LOG(llevError,"Incomplete move command: %s\n", buf); |
699 | LOG (llevError, "Incomplete move command: %s\n", buf); |
885 | return; |
700 | return; |
886 | } |
701 | } |
887 | buf++; |
702 | |
|
|
703 | buf++; |
888 | } |
704 | } |
|
|
705 | |
889 | vals[2]=atoi(buf); |
706 | vals[2] = atoi (buf); |
890 | |
707 | |
891 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
708 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
892 | esrv_move_object(pl->ob,vals[0], vals[1], vals[2]); |
709 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
893 | } |
710 | } |
894 | |
|
|
895 | |
|
|
896 | |
711 | |
897 | /****************************************************************************** |
712 | /****************************************************************************** |
898 | * |
713 | * |
899 | * Start of commands the server sends to the client. |
714 | * Start of commands the server sends to the client. |
900 | * |
715 | * |
… | |
… | |
902 | |
717 | |
903 | /** |
718 | /** |
904 | * Asks the client to query the user. This way, the client knows |
719 | * Asks the client to query the user. This way, the client knows |
905 | * it needs to send something back (vs just printing out a message) |
720 | * it needs to send something back (vs just printing out a message) |
906 | */ |
721 | */ |
|
|
722 | void |
907 | void send_query(NewSocket *ns, uint8 flags, char *text) |
723 | send_query (client *ns, uint8 flags, const char *text) |
908 | { |
724 | { |
909 | char buf[MAX_BUF]; |
|
|
910 | |
|
|
911 | sprintf(buf,"query %d %s", flags, text?text:""); |
725 | ns->send_packet_printf ("query %d %s", flags, text ? text : ""); |
912 | Write_String_To_Socket(ns, buf, strlen(buf)); |
726 | } |
|
|
727 | |
|
|
728 | /** |
|
|
729 | * Get player's current range attack in obuf. |
|
|
730 | */ |
|
|
731 | static void |
|
|
732 | rangetostring (player *pl, char *obuf) |
|
|
733 | { |
|
|
734 | dynbuf_text buf; |
|
|
735 | |
|
|
736 | if (pl->ranged_ob) |
|
|
737 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
|
|
738 | |
|
|
739 | if (pl->combat_ob) |
|
|
740 | buf << " Combat" << (pl->ob->current_weapon == pl->combat_ob ? "*" : "") << ": " << pl->combat_ob->name; |
|
|
741 | |
|
|
742 | #if 0 |
|
|
743 | //TODO: remove this when slot system is working, this is only for debugging |
|
|
744 | if (pl->ob->chosen_skill) |
|
|
745 | buf << " Skill*: " << pl->ob->chosen_skill->name; |
|
|
746 | #endif |
|
|
747 | |
|
|
748 | //TODO: maybe golem should become the current_weapon, quite simply? |
|
|
749 | if (pl->golem) |
|
|
750 | buf << " Golem*: " << pl->golem->name; |
|
|
751 | |
|
|
752 | buf.linearise (obuf); |
|
|
753 | obuf [buf.size ()] = 0; |
913 | } |
754 | } |
914 | |
755 | |
915 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
756 | #define AddIfInt64(Old,New,Type) if (Old != New) {\ |
916 | Old = New; \ |
757 | Old = New; \ |
917 | SockList_AddChar(&sl, Type); \ |
758 | sl << uint8 (Type) << uint64 (New); \ |
918 | SockList_AddInt64(&sl, New); \ |
759 | } |
919 | } |
|
|
920 | |
760 | |
921 | #define AddIfInt(Old,New,Type) if (Old != New) {\ |
761 | #define AddIfInt(Old,New,Type) if (Old != New) {\ |
922 | Old = New; \ |
762 | Old = New; \ |
923 | SockList_AddChar(&sl, Type); \ |
763 | sl << uint8 (Type) << uint32 (New); \ |
924 | SockList_AddInt(&sl, New); \ |
764 | } |
925 | } |
|
|
926 | |
765 | |
927 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
766 | #define AddIfShort(Old,New,Type) if (Old != New) {\ |
928 | Old = New; \ |
767 | Old = New; \ |
929 | SockList_AddChar(&sl, Type); \ |
768 | sl << uint8 (Type) << uint16 (New); \ |
930 | SockList_AddShort(&sl, New); \ |
769 | } |
931 | } |
|
|
932 | |
770 | |
933 | #define AddIfFloat(Old,New,Type) if (Old != New) {\ |
771 | #define AddIfFloat(Old,New,Type,mult) if (Old != New) {\ |
934 | Old = New; \ |
772 | Old = New; \ |
935 | SockList_AddChar(&sl, Type); \ |
773 | sl << uint8 (Type) << uint32 (New*FLOAT_MULTI*mult); \ |
936 | SockList_AddInt(&sl,(long)(New*FLOAT_MULTI));\ |
774 | } |
937 | } |
|
|
938 | |
775 | |
939 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
776 | #define AddIfString(Old,New,Type) if (Old == NULL || strcmp(Old,New)) {\ |
940 | if (Old) free(Old);\ |
777 | free(Old); Old = strdup (New);\ |
941 | Old = strdup_local(New);\ |
778 | sl << uint8 (Type) << data8 (New); \ |
942 | SockList_AddChar(&sl, Type); \ |
779 | } |
943 | SockList_AddChar(&sl, ( char )strlen(New)); \ |
|
|
944 | strcpy((char*)sl.buf + sl.len, New); \ |
|
|
945 | sl.len += strlen(New); \ |
|
|
946 | } |
|
|
947 | |
780 | |
948 | /** |
781 | /** |
949 | * Sends a statistics update. We look at the old values, |
782 | * Sends a statistics update. We look at the old values, |
950 | * and only send what has changed. Stat mapping values are in newclient.h |
783 | * and only send what has changed. Stat mapping values are in newclient.h |
951 | * Since this gets sent a lot, this is actually one of the few binary |
784 | * Since this gets sent a lot, this is actually one of the few binary |
952 | * commands for now. |
785 | * commands for now. |
953 | */ |
786 | */ |
|
|
787 | void |
954 | void esrv_update_stats(player *pl) |
788 | esrv_update_stats (player *pl) |
955 | { |
789 | { |
956 | SockList sl; |
|
|
957 | char buf[MAX_BUF]; |
790 | char buf[MAX_BUF]; |
958 | uint16 flags; |
791 | uint16 flags; |
959 | |
792 | |
960 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
793 | client *ns = pl->ns; |
961 | strcpy((char*)sl.buf,"stats "); |
794 | if (!ns) |
962 | sl.len=strlen((char*)sl.buf); |
795 | return; |
963 | |
796 | |
964 | if(pl->ob != NULL) |
797 | object *ob = pl->observe; |
965 | { |
798 | if (!ob) |
|
|
799 | return; |
|
|
800 | |
|
|
801 | player *opl = ob->contr ? static_cast<player *>(ob->contr) : pl; |
|
|
802 | |
|
|
803 | packet sl ("stats"); |
|
|
804 | |
966 | AddIfShort(pl->last_stats.hp, pl->ob->stats.hp, CS_STAT_HP); |
805 | AddIfShort (ns->last_stats.hp, ob->stats.hp, CS_STAT_HP); |
967 | AddIfShort(pl->last_stats.maxhp, pl->ob->stats.maxhp, CS_STAT_MAXHP); |
806 | AddIfShort (ns->last_stats.maxhp, ob->stats.maxhp, CS_STAT_MAXHP); |
968 | AddIfShort(pl->last_stats.sp, pl->ob->stats.sp, CS_STAT_SP); |
807 | AddIfShort (ns->last_stats.sp, ob->stats.sp, CS_STAT_SP); |
969 | AddIfShort(pl->last_stats.maxsp, pl->ob->stats.maxsp, CS_STAT_MAXSP); |
808 | AddIfShort (ns->last_stats.maxsp, ob->stats.maxsp, CS_STAT_MAXSP); |
970 | AddIfShort(pl->last_stats.grace, pl->ob->stats.grace, CS_STAT_GRACE); |
809 | AddIfShort (ns->last_stats.grace, ob->stats.grace, CS_STAT_GRACE); |
971 | AddIfShort(pl->last_stats.maxgrace, pl->ob->stats.maxgrace, CS_STAT_MAXGRACE); |
810 | AddIfShort (ns->last_stats.maxgrace, ob->stats.maxgrace, CS_STAT_MAXGRACE); |
972 | AddIfShort(pl->last_stats.Str, pl->ob->stats.Str, CS_STAT_STR); |
811 | AddIfShort (ns->last_stats.Str, ob->stats.Str, CS_STAT_STR); |
973 | AddIfShort(pl->last_stats.Int, pl->ob->stats.Int, CS_STAT_INT); |
|
|
974 | AddIfShort(pl->last_stats.Pow, pl->ob->stats.Pow, CS_STAT_POW); |
|
|
975 | AddIfShort(pl->last_stats.Wis, pl->ob->stats.Wis, CS_STAT_WIS); |
|
|
976 | AddIfShort(pl->last_stats.Dex, pl->ob->stats.Dex, CS_STAT_DEX); |
812 | AddIfShort (ns->last_stats.Dex, ob->stats.Dex, CS_STAT_DEX); |
977 | AddIfShort(pl->last_stats.Con, pl->ob->stats.Con, CS_STAT_CON); |
813 | AddIfShort (ns->last_stats.Con, ob->stats.Con, CS_STAT_CON); |
|
|
814 | AddIfShort (ns->last_stats.Int, ob->stats.Int, CS_STAT_INT); |
|
|
815 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
|
|
816 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
978 | AddIfShort(pl->last_stats.Cha, pl->ob->stats.Cha, CS_STAT_CHA); |
817 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
979 | } |
818 | |
980 | if(pl->socket.exp64) { |
|
|
981 | uint8 s; |
|
|
982 | for(s=0;s<NUM_SKILLS;s++) { |
819 | for (int s = 0; s < NUM_SKILLS; s++) |
983 | if (pl->last_skill_ob[s] && |
820 | if (object *skill = opl->last_skill_ob[s]) |
984 | pl->last_skill_exp[s] != pl->last_skill_ob[s]->stats.exp) { |
821 | if (skill->stats.exp != ns->last_skill_exp [s]) |
|
|
822 | { |
|
|
823 | ns->last_skill_exp [s] = skill->stats.exp; |
985 | |
824 | |
986 | /* Always send along the level if exp changes. This is only |
825 | /* Always send along the level if exp changes. This is only |
987 | * 1 extra byte, but keeps processing simpler. |
826 | * 1 extra byte, but keeps processing simpler. |
988 | */ |
827 | */ |
989 | SockList_AddChar(&sl, ( char )( s + CS_STAT_SKILLINFO )); |
828 | sl << uint8 (s + CS_STAT_SKILLINFO) |
990 | SockList_AddChar(&sl, ( char )pl->last_skill_ob[s]->level); |
829 | << uint8 (skill->level) |
991 | SockList_AddInt64(&sl, pl->last_skill_ob[s]->stats.exp); |
830 | << uint64 (skill->stats.exp); |
992 | pl->last_skill_exp[s] = pl->last_skill_ob[s]->stats.exp; |
831 | } |
993 | } |
832 | |
994 | } |
|
|
995 | } |
|
|
996 | if (pl->socket.exp64) { |
|
|
997 | AddIfInt64(pl->last_stats.exp, pl->ob->stats.exp, CS_STAT_EXP64); |
833 | AddIfInt64 (ns->last_stats.exp, ob->stats.exp, CS_STAT_EXP64); |
998 | } else { |
|
|
999 | AddIfInt(pl->last_stats.exp, ( int )pl->ob->stats.exp, CS_STAT_EXP); |
|
|
1000 | } |
|
|
1001 | AddIfShort(pl->last_level, ( char )pl->ob->level, CS_STAT_LEVEL); |
834 | AddIfShort (ns->last_level, ob->level, CS_STAT_LEVEL); |
1002 | AddIfShort(pl->last_stats.wc, pl->ob->stats.wc, CS_STAT_WC); |
835 | AddIfShort (ns->last_stats.wc, ob->stats.wc, CS_STAT_WC); |
1003 | AddIfShort(pl->last_stats.ac, pl->ob->stats.ac, CS_STAT_AC); |
836 | AddIfShort (ns->last_stats.ac, ob->stats.ac, CS_STAT_AC); |
1004 | AddIfShort(pl->last_stats.dam, pl->ob->stats.dam, CS_STAT_DAM); |
837 | AddIfShort (ns->last_stats.dam, ob->stats.dam, CS_STAT_DAM); |
1005 | AddIfFloat(pl->last_speed, pl->ob->speed, CS_STAT_SPEED); |
838 | AddIfFloat (ns->last_speed, ob->speed, CS_STAT_SPEED, 1.f/TICK); |
1006 | AddIfShort(pl->last_stats.food, pl->ob->stats.food, CS_STAT_FOOD); |
839 | AddIfShort (ns->last_stats.food, ob->stats.food, CS_STAT_FOOD); |
1007 | AddIfFloat(pl->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP); |
840 | AddIfFloat (ns->last_weapon_sp, pl->weapon_sp, CS_STAT_WEAP_SP, 1.f/TICK); |
1008 | AddIfInt(pl->last_weight_limit, (sint32)weight_limit[pl->ob->stats.Str], CS_STAT_WEIGHT_LIM); |
841 | AddIfInt (ns->last_weight_limit, weight_limit[ob->stats.Str], CS_STAT_WEIGHT_LIM); |
|
|
842 | |
1009 | flags=0; |
843 | flags = 0; |
1010 | if (pl->fire_on) flags |=SF_FIREON; |
|
|
1011 | if (pl->run_on) flags |= SF_RUNON; |
|
|
1012 | |
844 | |
|
|
845 | if (opl->fire_on) |
|
|
846 | flags |= SF_FIREON; |
|
|
847 | |
|
|
848 | if (opl->run_on) |
|
|
849 | flags |= SF_RUNON; |
|
|
850 | |
1013 | AddIfShort(pl->last_flags, flags, CS_STAT_FLAGS); |
851 | AddIfShort (ns->last_flags, flags, CS_STAT_FLAGS); |
1014 | if (pl->socket.sc_version<1025) { |
852 | |
|
|
853 | if (ns->sc_version < 1025) |
1015 | AddIfShort(pl->last_resist[ATNR_PHYSICAL], pl->ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR); |
854 | { AddIfShort (ns->last_resist[ATNR_PHYSICAL], ob->resist[ATNR_PHYSICAL], CS_STAT_ARMOUR) } |
1016 | } else { |
855 | else |
1017 | int i; |
|
|
1018 | |
|
|
1019 | for (i=0; i<NROFATTACKS; i++) { |
856 | for (int i = 0; i < NROFATTACKS; i++) |
|
|
857 | { |
1020 | /* Skip ones we won't send */ |
858 | /* Skip ones we won't send */ |
1021 | if (atnr_cs_stat[i]==-1) continue; |
859 | if (atnr_cs_stat[i] == -1) |
|
|
860 | continue; |
|
|
861 | |
1022 | AddIfShort(pl->last_resist[i], pl->ob->resist[i], ( char )atnr_cs_stat[i]); |
862 | AddIfShort (ns->last_resist[i], ob->resist[i], atnr_cs_stat[i]); |
1023 | } |
|
|
1024 | } |
863 | } |
|
|
864 | |
1025 | if (pl->socket.monitor_spells) { |
865 | if (pl->ns->monitor_spells) |
|
|
866 | { |
1026 | AddIfInt(pl->last_path_attuned, pl->ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
867 | AddIfInt (ns->last_path_attuned, ob->path_attuned, CS_STAT_SPELL_ATTUNE); |
1027 | AddIfInt(pl->last_path_repelled, pl->ob->path_repelled, CS_STAT_SPELL_REPEL); |
868 | AddIfInt (ns->last_path_repelled, ob->path_repelled, CS_STAT_SPELL_REPEL); |
1028 | AddIfInt(pl->last_path_denied, pl->ob->path_denied, CS_STAT_SPELL_DENY); |
869 | AddIfInt (ns->last_path_denied, ob->path_denied, CS_STAT_SPELL_DENY); |
1029 | } |
870 | } |
|
|
871 | |
1030 | rangetostring(pl->ob, buf); /* we want use the new fire & run system in new client */ |
872 | rangetostring (opl, buf); /* we want use the new fire & run system in new client */ |
1031 | AddIfString(pl->socket.stats.range, buf, CS_STAT_RANGE); |
873 | AddIfString (ns->stats.range, buf, CS_STAT_RANGE); |
1032 | set_title(pl->ob, buf); |
874 | set_title (ob, buf); |
1033 | AddIfString(pl->socket.stats.title, buf, CS_STAT_TITLE); |
875 | AddIfString (ns->stats.title, buf, CS_STAT_TITLE); |
1034 | |
876 | |
1035 | /* Only send it away if we have some actual data */ |
877 | /* Only send it away if we have some actual data */ |
1036 | if (sl.len>6) { |
878 | if (sl.length () > 6) |
1037 | #ifdef ESRV_DEBUG |
879 | ns->send_packet (sl); |
1038 | LOG(llevDebug,"Sending stats command, %d bytes long.\n", sl.len); |
|
|
1039 | #endif |
|
|
1040 | Send_With_Handling(&pl->socket, &sl); |
|
|
1041 | } |
|
|
1042 | free(sl.buf); |
|
|
1043 | } |
880 | } |
1044 | |
|
|
1045 | |
881 | |
1046 | /** |
882 | /** |
1047 | * Tells the client that here is a player it should start using. |
883 | * Tells the client that here is a player it should start using. |
1048 | */ |
884 | */ |
|
|
885 | void |
1049 | void esrv_new_player(player *pl, uint32 weight) |
886 | esrv_new_player (player *pl, uint32 weight) |
1050 | { |
887 | { |
1051 | SockList sl; |
888 | packet sl ("player"); |
1052 | |
889 | |
|
|
890 | sl << uint32 (pl->ob->count) |
|
|
891 | << uint32 (weight) |
|
|
892 | << uint32 (pl->ob->face) |
|
|
893 | << data8 (pl->ob->name); |
|
|
894 | |
1053 | pl->last_weight = weight; |
895 | pl->ns->last_weight = weight; |
1054 | |
896 | pl->ns->send_packet (sl); |
1055 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
|
|
1056 | |
|
|
1057 | strcpy((char*)sl.buf,"player "); |
|
|
1058 | sl.len=strlen((char*)sl.buf); |
|
|
1059 | SockList_AddInt(&sl, pl->ob->count); |
|
|
1060 | SockList_AddInt(&sl, weight); |
|
|
1061 | SockList_AddInt(&sl, pl->ob->face->number); |
|
|
1062 | |
|
|
1063 | SockList_AddChar(&sl, ( char )strlen(pl->ob->name)); |
|
|
1064 | strcpy((char*)sl.buf+sl.len, pl->ob->name); |
|
|
1065 | sl.len += strlen(pl->ob->name); |
|
|
1066 | |
|
|
1067 | Send_With_Handling(&pl->socket, &sl); |
|
|
1068 | free(sl.buf); |
|
|
1069 | SET_FLAG(pl->ob, FLAG_CLIENT_SENT); |
897 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
1070 | } |
898 | } |
1071 | |
|
|
1072 | |
|
|
1073 | /** |
|
|
1074 | * Need to send an animation sequence to the client. |
|
|
1075 | * We will send appropriate face commands to the client if we haven't |
|
|
1076 | * sent them the face yet (this can become quite costly in terms of |
|
|
1077 | * how much we are sending - on the other hand, this should only happen |
|
|
1078 | * when the player logs in and picks stuff up. |
|
|
1079 | */ |
|
|
1080 | void esrv_send_animation(NewSocket *ns, short anim_num) |
|
|
1081 | { |
|
|
1082 | SockList sl; |
|
|
1083 | int i; |
|
|
1084 | |
|
|
1085 | /* Do some checking on the anim_num we got. Note that the animations |
|
|
1086 | * are added in contigous order, so if the number is in the valid |
|
|
1087 | * range, it must be a valid animation. |
|
|
1088 | */ |
|
|
1089 | if (anim_num < 0 || anim_num > num_animations) { |
|
|
1090 | LOG(llevError,"esrv_send_anim (%d) out of bounds??\n",anim_num); |
|
|
1091 | return; |
|
|
1092 | } |
|
|
1093 | |
|
|
1094 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
|
|
1095 | strcpy((char*)sl.buf, "anim "); |
|
|
1096 | sl.len=5; |
|
|
1097 | SockList_AddShort(&sl, anim_num); |
|
|
1098 | SockList_AddShort(&sl, 0); /* flags - not used right now */ |
|
|
1099 | /* Build up the list of faces. Also, send any information (ie, the |
|
|
1100 | * the face itself) down to the client. |
|
|
1101 | */ |
|
|
1102 | for (i=0; i<animations[anim_num].num_animations; i++) { |
|
|
1103 | if (!(ns->faces_sent[animations[anim_num].faces[i]] & NS_FACESENT_FACE)) |
|
|
1104 | esrv_send_face(ns,animations[anim_num].faces[i],0); |
|
|
1105 | SockList_AddShort(&sl, animations[anim_num].faces[i]); /* flags - not used right now */ |
|
|
1106 | } |
|
|
1107 | Send_With_Handling(ns, &sl); |
|
|
1108 | free(sl.buf); |
|
|
1109 | ns->anims_sent[anim_num] = 1; |
|
|
1110 | } |
|
|
1111 | |
|
|
1112 | |
899 | |
1113 | /****************************************************************************** |
900 | /****************************************************************************** |
1114 | * |
901 | * |
1115 | * Start of map related commands. |
902 | * Start of map related commands. |
1116 | * |
903 | * |
1117 | ******************************************************************************/ |
904 | ******************************************************************************/ |
1118 | |
905 | |
1119 | /** |
|
|
1120 | * This adds face_num to a map cell at x,y. If the client doesn't have |
|
|
1121 | * the face yet, we will also send it. |
|
|
1122 | */ |
|
|
1123 | static void esrv_map_setbelow(NewSocket *ns, int x,int y, |
|
|
1124 | short face_num, struct Map *newmap) |
|
|
1125 | { |
|
|
1126 | if(newmap->cells[x][y].count >= MAP_LAYERS) { |
|
|
1127 | LOG(llevError,"Too many faces in map cell %d %d\n",x,y); |
|
|
1128 | return; |
|
|
1129 | abort(); |
|
|
1130 | } |
|
|
1131 | newmap->cells[x][y].faces[newmap->cells[x][y].count] = face_num; |
|
|
1132 | newmap->cells[x][y].count ++; |
|
|
1133 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1134 | esrv_send_face(ns,face_num,0); |
|
|
1135 | } |
|
|
1136 | |
|
|
1137 | struct LayerCell { |
|
|
1138 | uint16 xy; |
|
|
1139 | short face; |
|
|
1140 | }; |
|
|
1141 | |
|
|
1142 | struct MapLayer { |
|
|
1143 | int count; |
|
|
1144 | struct LayerCell lcells[MAP_CLIENT_X * MAP_CLIENT_Y]; |
|
|
1145 | }; |
|
|
1146 | |
|
|
1147 | /** Checkes if map cells have changed */ |
|
|
1148 | static int mapcellchanged(NewSocket *ns,int i,int j, struct Map *newmap) |
|
|
1149 | { |
|
|
1150 | int k; |
|
|
1151 | |
|
|
1152 | if (ns->lastmap.cells[i][j].count != newmap->cells[i][j].count) |
|
|
1153 | return 1; |
|
|
1154 | for(k=0;k<newmap->cells[i][j].count;k++) { |
|
|
1155 | if (ns->lastmap.cells[i][j].faces[k] != |
|
|
1156 | newmap->cells[i][j].faces[k]) { |
|
|
1157 | return 1; |
|
|
1158 | } |
|
|
1159 | } |
|
|
1160 | return 0; |
|
|
1161 | } |
|
|
1162 | |
|
|
1163 | /** |
|
|
1164 | * Basically, what this does is pack the data into layers. |
|
|
1165 | * cnum is the client number, cur is the the buffer we put all of |
|
|
1166 | * this data into. we return the end of the data. layers is |
|
|
1167 | * how many layers of data we should back. |
|
|
1168 | */ |
|
|
1169 | static uint8 *compactlayer(NewSocket *ns, unsigned char *cur, int numlayers, |
|
|
1170 | struct Map *newmap) |
|
|
1171 | { |
|
|
1172 | int x,y,k; |
|
|
1173 | int face; |
|
|
1174 | unsigned char *fcur; |
|
|
1175 | struct MapLayer layers[MAP_LAYERS]; |
|
|
1176 | |
|
|
1177 | for(k = 0;k<MAP_LAYERS;k++) |
|
|
1178 | layers[k].count = 0; |
|
|
1179 | fcur = cur; |
|
|
1180 | for(x=0;x<ns->mapx;x++) { |
|
|
1181 | for(y=0;y<ns->mapy;y++) { |
|
|
1182 | if (!mapcellchanged(ns,x,y,newmap)) |
|
|
1183 | continue; |
|
|
1184 | if (newmap->cells[x][y].count == 0) { |
|
|
1185 | *cur = x*ns->mapy+y; /* mark empty space */ |
|
|
1186 | cur++; |
|
|
1187 | continue; |
|
|
1188 | } |
|
|
1189 | for(k=0;k<newmap->cells[x][y].count;k++) { |
|
|
1190 | layers[k].lcells[layers[k].count].xy = x*ns->mapy+y; |
|
|
1191 | layers[k].lcells[layers[k].count].face = |
|
|
1192 | newmap->cells[x][y].faces[k]; |
|
|
1193 | layers[k].count++; |
|
|
1194 | } |
|
|
1195 | } |
|
|
1196 | } |
|
|
1197 | /* If no data, return now. */ |
|
|
1198 | if (fcur == cur && layers[0].count == 0) |
|
|
1199 | return cur; |
|
|
1200 | *cur = 255; /* mark end of explicitly cleared cells */ |
|
|
1201 | cur++; |
|
|
1202 | /* First pack by layers. */ |
|
|
1203 | for(k=0;k<numlayers;k++) { |
|
|
1204 | if (layers[k].count == 0) |
|
|
1205 | break; /* once a layer is entirely empty, no layer below it can |
|
|
1206 | have anything in it either */ |
|
|
1207 | /* Pack by entries in thie layer */ |
|
|
1208 | for(x=0;x<layers[k].count;) { |
|
|
1209 | fcur = cur; |
|
|
1210 | *cur = layers[k].lcells[x].face >> 8; |
|
|
1211 | cur++; |
|
|
1212 | *cur = layers[k].lcells[x].face & 0xFF; |
|
|
1213 | cur++; |
|
|
1214 | face = layers[k].lcells[x].face; |
|
|
1215 | /* Now, we back the redundant data into 1 byte xy pairings */ |
|
|
1216 | for(y=x;y<layers[k].count;y++) { |
|
|
1217 | if (layers[k].lcells[y].face == face) { |
|
|
1218 | *cur = ( uint8 )layers[k].lcells[y].xy; |
|
|
1219 | cur++; |
|
|
1220 | layers[k].lcells[y].face = -1; |
|
|
1221 | } |
|
|
1222 | } |
|
|
1223 | *(cur-1) = *(cur-1) | 128; /* mark for end of xy's; 11*11 < 128 */ |
|
|
1224 | /* forward over the now redundant data */ |
|
|
1225 | while(x < layers[k].count && |
|
|
1226 | layers[k].lcells[x].face == -1) |
|
|
1227 | x++; |
|
|
1228 | } |
|
|
1229 | *fcur = *fcur | 128; /* mark for end of faces at this layer */ |
|
|
1230 | } |
|
|
1231 | return cur; |
|
|
1232 | } |
|
|
1233 | |
|
|
1234 | static void esrv_map_doneredraw(NewSocket *ns, struct Map *newmap) |
|
|
1235 | { |
|
|
1236 | static long frames,bytes,tbytes,tframes; |
|
|
1237 | char *cur; |
|
|
1238 | SockList sl; |
|
|
1239 | |
|
|
1240 | |
|
|
1241 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
|
|
1242 | strcpy((char*)sl.buf,"map "); |
|
|
1243 | sl.len=strlen((char*)sl.buf); |
|
|
1244 | |
|
|
1245 | cur = (char *) compactlayer(ns,(unsigned char*) sl.buf+sl.len,MAP_LAYERS,newmap); |
|
|
1246 | sl.len=cur-(char*)sl.buf; |
|
|
1247 | |
|
|
1248 | /* LOG(llevDebug, "Sending map command.\n");*/ |
|
|
1249 | |
|
|
1250 | if (sl.len>( int )strlen("map ") || ns->sent_scroll) { |
|
|
1251 | /* All of this is just accounting stuff */ |
|
|
1252 | if (tframes>100) { |
|
|
1253 | tframes = tbytes = 0; |
|
|
1254 | } |
|
|
1255 | tframes++; |
|
|
1256 | frames++; |
|
|
1257 | tbytes += sl.len; |
|
|
1258 | bytes += sl.len; |
|
|
1259 | memcpy(&ns->lastmap,newmap,sizeof(struct Map)); |
|
|
1260 | Send_With_Handling(ns, &sl); |
|
|
1261 | ns->sent_scroll = 0; |
|
|
1262 | } |
|
|
1263 | free(sl.buf); |
|
|
1264 | } |
|
|
1265 | |
|
|
1266 | |
|
|
1267 | /** Clears a map cell */ |
906 | /** Clears a map cell */ |
1268 | static void map_clearcell(struct MapCell *cell, int face0, int face1, int face2, int count) |
907 | static void |
|
|
908 | map_clearcell (struct MapCell *cell, int count) |
1269 | { |
909 | { |
1270 | cell->count=count; |
|
|
1271 | cell->faces[0] = face0; |
910 | cell->faces[0] = 0; |
1272 | cell->faces[1] = face1; |
911 | cell->faces[1] = 0; |
1273 | cell->faces[2] = face2; |
912 | cell->faces[2] = 0; |
|
|
913 | cell->smooth[0] = 0; |
|
|
914 | cell->smooth[1] = 0; |
|
|
915 | cell->smooth[2] = 0; |
|
|
916 | cell->count = count; |
|
|
917 | cell->stat_hp = 0; |
|
|
918 | cell->flags = 0; |
|
|
919 | cell->player = 0; |
1274 | } |
920 | } |
1275 | |
921 | |
1276 | #define MAX_HEAD_POS MAX(MAX_CLIENT_X, MAX_CLIENT_Y) |
|
|
1277 | #define MAX_LAYERS 3 |
922 | #define MAX_LAYERS 3 |
1278 | |
|
|
1279 | /* Using a global really isn't a good approach, but saves the over head of |
|
|
1280 | * allocating and deallocating such a block of data each time run through, |
|
|
1281 | * and saves the space of allocating this in the socket object when we only |
|
|
1282 | * need it for this cycle. If the serve is ever threaded, this needs to be |
|
|
1283 | * re-examined. |
|
|
1284 | */ |
|
|
1285 | |
|
|
1286 | static object *heads[MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS]; |
|
|
1287 | |
|
|
1288 | /** |
|
|
1289 | * Returns true if any of the heads for this |
|
|
1290 | * space is set. Returns false if all are blank - this is used |
|
|
1291 | * for empty space checking. |
|
|
1292 | */ |
|
|
1293 | static inline int have_head(int ax, int ay) { |
|
|
1294 | |
|
|
1295 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS] || |
|
|
1296 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 1] || |
|
|
1297 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + 2]) return 1; |
|
|
1298 | return 0; |
|
|
1299 | } |
|
|
1300 | |
|
|
1301 | /** |
|
|
1302 | * check_head is a bit simplistic version of update_space below. |
|
|
1303 | * basically, it only checks the that the head on space ax,ay at layer |
|
|
1304 | * needs to get sent - if so, it adds the data, sending the head |
|
|
1305 | * if needed, and returning 1. If this no data needs to get |
|
|
1306 | * sent, it returns zero. |
|
|
1307 | */ |
|
|
1308 | static inline int check_head(SockList *sl, NewSocket *ns, int ax, int ay, int layer) |
|
|
1309 | { |
|
|
1310 | short face_num; |
|
|
1311 | |
|
|
1312 | if (heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]) |
|
|
1313 | face_num = heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer]->face->number; |
|
|
1314 | else |
|
|
1315 | face_num = 0; |
|
|
1316 | |
|
|
1317 | if (face_num != ns->lastmap.cells[ax][ay].faces[layer]) { |
|
|
1318 | SockList_AddShort(sl, face_num); |
|
|
1319 | if (face_num && !(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1320 | esrv_send_face(ns, face_num, 0); |
|
|
1321 | heads[(ay * MAX_HEAD_POS + ax) * MAX_LAYERS + layer] = NULL; |
|
|
1322 | ns->lastmap.cells[ax][ay].faces[layer] = face_num; |
|
|
1323 | return 1; |
|
|
1324 | } |
|
|
1325 | |
|
|
1326 | return 0; /* No change */ |
|
|
1327 | } |
|
|
1328 | |
923 | |
1329 | /** |
924 | /** |
1330 | * Removes the need to replicate the same code for each layer. |
925 | * Removes the need to replicate the same code for each layer. |
1331 | * this returns true if this space is now in fact different than |
926 | * this returns true if this space is now in fact different than |
1332 | * it was. |
927 | * it was. |
1333 | * sl is the socklist this data is going into. |
928 | * sl is the socklist this data is going into. |
1334 | * ns is the socket we are working on - all the info we care |
929 | * ns is the socket we are working on - all the info we care |
1335 | * about is in this socket structure, so now need not pass the |
930 | * about is in this socket structure, so now need not pass the |
1336 | * entire player object. |
931 | * entire player object. |
1337 | * mx and my are map coordinate offsets for map mp |
|
|
1338 | * sx and sy are the offsets into the socket structure that |
|
|
1339 | * holds the old values. |
|
|
1340 | * layer is the layer to update, with 2 being the floor and 0 the |
932 | * layer is the layer to update, with 2 being the floor and 0 the |
1341 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
933 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ) |
1342 | * take. Interesting to note that before this function, the map1 function |
934 | * take. Interesting to note that before this function, the map1 function |
1343 | * numbers the spaces differently - I think this was a leftover from |
935 | * numbers the spaces differently - I think this was a leftover from |
1344 | * the map command, where the faces stack up. Sinces that is no longer |
936 | * the map command, where the faces stack up. Sinces that is no longer |
1345 | * the case, it seems to make more sense to have these layer values |
937 | * the case, it seems to make more sense to have these layer values |
1346 | * actually match. |
938 | * actually match. |
1347 | */ |
939 | */ |
1348 | |
940 | static int |
1349 | static inline int update_space(SockList *sl, NewSocket *ns, mapstruct *mp, int mx, int my, int sx, int sy, int layer) |
941 | update_space (packet &sl, client &ns, mapspace &ms, MapCell &lastcell, int layer) |
1350 | { |
942 | { |
1351 | object *ob, *head; |
943 | object *ob = ms.faces_obj [layer]; |
1352 | uint16 face_num; |
|
|
1353 | int bx, by,i; |
|
|
1354 | |
944 | |
1355 | /* If there is a multipart object stored away, treat that as more important. |
|
|
1356 | * If not, then do the normal processing. |
|
|
1357 | */ |
|
|
1358 | |
|
|
1359 | head = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer]; |
|
|
1360 | |
|
|
1361 | /* Check to see if this head is part of the set of objects |
|
|
1362 | * we would normally send for this space. If so, then |
|
|
1363 | * don't use the head value. We need to do the check |
|
|
1364 | * here and not when setting up the heads[] value for two reasons - |
|
|
1365 | * 1) the heads[] values will get used even if the space is not visible. |
|
|
1366 | * 2) its possible the head is not on the same map as a part, and I'd |
|
|
1367 | * rather not need to do the map translation overhead. |
|
|
1368 | * 3) We need to do some extra checking to make sure that we will |
|
|
1369 | * otherwise send the image as this layer, eg, either it matches |
|
|
1370 | * the head value, or is not multipart. |
|
|
1371 | */ |
|
|
1372 | if (head && !head->more) { |
|
|
1373 | for (i=0; i<MAP_LAYERS; i++) { |
|
|
1374 | ob = GET_MAP_FACE_OBJ(mp, mx, my, i); |
|
|
1375 | if (!ob) continue; |
|
|
1376 | |
|
|
1377 | if (ob->head) ob=ob->head; |
|
|
1378 | |
|
|
1379 | if (ob == head) { |
|
|
1380 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer] = NULL; |
|
|
1381 | head = NULL; |
|
|
1382 | break; |
|
|
1383 | } |
|
|
1384 | } |
|
|
1385 | } |
|
|
1386 | |
|
|
1387 | ob = head; |
|
|
1388 | if (!ob) ob = GET_MAP_FACE_OBJ(mp, mx, my, layer); |
|
|
1389 | |
|
|
1390 | /* If there is no object for this space, or if the face for the object |
945 | /* If there is no object for this space, or if the face for the object |
1391 | * is the blank face, set the face number to zero. |
946 | * is the blank face, set the face number to zero. |
1392 | * else if we have the stored head object for this space, that takes |
947 | * else if we have the stored head object for this space, that takes |
1393 | * precedence over the other object for this space. |
948 | * precedence over the other object for this space. |
1394 | * otherwise, we do special head processing |
949 | * otherwise, we do special head processing |
1395 | */ |
950 | */ |
1396 | if (!ob || ob->face == blank_face) face_num=0; |
951 | uint16 face_num = ob && ob->face != blank_face ? ob->face : 0; |
1397 | else if (head){ |
|
|
1398 | /* if this is a head that had previously been stored */ |
|
|
1399 | face_num = ob->face->number; |
|
|
1400 | } else { |
|
|
1401 | /* if the faces for the different parts of a multipart object |
|
|
1402 | * are the same, we only want to send the bottom right most |
|
|
1403 | * portion of the object. That info is in the tail_.. values |
|
|
1404 | * of the head. Note that for the head itself, ob->head will |
|
|
1405 | * be null, so we only do this block if we are working on |
|
|
1406 | * a tail piece. |
|
|
1407 | */ |
|
|
1408 | |
952 | |
1409 | /* tail_x and tail_y will only be set in the head object. If |
|
|
1410 | * this is the head object and these are set, we proceed |
|
|
1411 | * with logic to only send bottom right. Similarly, if |
|
|
1412 | * this is one of the more parts but the head has those values |
|
|
1413 | * set, we want to do the processing. There can be cases where |
|
|
1414 | * the head is not visible but one of its parts is, so we just |
|
|
1415 | * can always expect that ob->arch->tail_x will be true for all |
|
|
1416 | * object we may want to display. |
|
|
1417 | */ |
|
|
1418 | if ((ob->arch->tail_x || ob->arch->tail_y) || |
|
|
1419 | (ob->head && (ob->head->arch->tail_x || ob->head->arch->tail_y))) { |
|
|
1420 | |
|
|
1421 | if (ob->head) head = ob->head; |
|
|
1422 | else head = ob; |
|
|
1423 | |
|
|
1424 | /* Basically figure out where the offset is from where we are right |
|
|
1425 | * now. the ob->arch->clone.{x,y} values hold the offset that this current |
|
|
1426 | * piece is from the head, and the tail is where the tail is from the |
|
|
1427 | * head. Note that bx and by will equal sx and sy if we are already working |
|
|
1428 | * on the bottom right corner. If ob is the head, the clone values |
|
|
1429 | * will be zero, so the right thing will still happen. |
|
|
1430 | */ |
|
|
1431 | bx = sx + head->arch->tail_x - ob->arch->clone.x; |
|
|
1432 | by = sy + head->arch->tail_y - ob->arch->clone.y; |
|
|
1433 | |
|
|
1434 | /* I don't think this can ever happen, but better to check for it just |
|
|
1435 | * in case. |
|
|
1436 | */ |
|
|
1437 | if (bx < sx || by < sy) { |
|
|
1438 | LOG(llevError,"update_space: bx (%d) or by (%d) is less than sx (%d) or sy (%d)\n", |
|
|
1439 | bx, by, sx, sy); |
|
|
1440 | face_num = 0; |
|
|
1441 | } |
|
|
1442 | /* single part object, multipart object with non merged faces, |
|
|
1443 | * of multipart object already at lower right. |
|
|
1444 | */ |
|
|
1445 | else if (bx == sx && by == sy) { |
|
|
1446 | face_num = ob->face->number; |
|
|
1447 | |
|
|
1448 | /* if this face matches one stored away, clear that one away. |
|
|
1449 | * this code relies on the fact that the map1 commands |
|
|
1450 | * goes from 2 down to 0. |
|
|
1451 | */ |
|
|
1452 | for (i=0; i<MAP_LAYERS; i++) |
|
|
1453 | if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] && |
|
|
1454 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i]->face->number == face_num) |
|
|
1455 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + i] = NULL; |
|
|
1456 | } |
|
|
1457 | else { |
|
|
1458 | /* If this head is stored away, clear it - otherwise, |
|
|
1459 | * there can be cases where a object is on multiple layers - |
|
|
1460 | * we only want to send it once. |
|
|
1461 | */ |
|
|
1462 | face_num = head->face->number; |
|
|
1463 | for (i=0; i<MAP_LAYERS; i++) |
|
|
1464 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] && |
|
|
1465 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i]->face->number == face_num) |
|
|
1466 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = NULL; |
|
|
1467 | |
|
|
1468 | /* First, try to put the new head on the same layer. If that is used up, |
|
|
1469 | * then find another layer. |
|
|
1470 | */ |
|
|
1471 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] == NULL) { |
|
|
1472 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + layer] = head; |
|
|
1473 | } else for (i=0; i<MAX_LAYERS; i++) { |
|
|
1474 | if (heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == NULL || |
|
|
1475 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] == head) { |
|
|
1476 | heads[(by * MAX_HEAD_POS + bx) * MAX_LAYERS + i] = head; |
|
|
1477 | } |
|
|
1478 | } |
|
|
1479 | face_num = 0; /* Don't send this object - we'll send the head later */ |
|
|
1480 | } |
|
|
1481 | } else { |
|
|
1482 | /* In this case, we are already at the lower right or single part object, |
|
|
1483 | * so nothing special |
|
|
1484 | */ |
|
|
1485 | face_num = ob->face->number; |
|
|
1486 | |
|
|
1487 | /* clear out any head entries that have the same face as this one */ |
|
|
1488 | for (bx=0; bx<layer; bx++) |
|
|
1489 | if (heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] && |
|
|
1490 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx]->face->number == face_num) |
|
|
1491 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + bx] = NULL; |
|
|
1492 | } |
|
|
1493 | } /* else not already head object or blank face */ |
|
|
1494 | |
|
|
1495 | /* This is a real hack. Basically, if we have nothing to send for this layer, |
|
|
1496 | * but there is a head on the next layer, send that instead. |
|
|
1497 | * Without this, what happens is you can get the case where the player stands |
|
|
1498 | * on the same space as the head. However, if you have overlapping big objects |
|
|
1499 | * of the same type, what happens then is it doesn't think it needs to send |
|
|
1500 | * This tends to make stacking also work/look better. |
|
|
1501 | */ |
|
|
1502 | if (!face_num && layer > 0 && heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer -1]) { |
|
|
1503 | face_num = heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer -1]->face->number; |
|
|
1504 | heads[(sy * MAX_HEAD_POS + sx) * MAX_LAYERS + layer -1] = NULL; |
|
|
1505 | } |
|
|
1506 | |
|
|
1507 | /* Another hack - because of heads and whatnot, this face may match one |
|
|
1508 | * we already sent for a lower layer. In that case, don't send |
|
|
1509 | * this one. |
|
|
1510 | */ |
|
|
1511 | if (face_num && layer+1<MAP_LAYERS && ns->lastmap.cells[sx][sy].faces[layer+1] == face_num) { |
|
|
1512 | face_num = 0; |
|
|
1513 | } |
|
|
1514 | |
|
|
1515 | /* We've gotten what face we want to use for the object. Now see if |
953 | /* We've gotten what face we want to use for the object. Now see if |
1516 | * if it has changed since we last sent it to the client. |
954 | * if it has changed since we last sent it to the client. |
1517 | */ |
955 | */ |
1518 | if (ns->lastmap.cells[sx][sy].faces[layer] != face_num) { |
956 | if (lastcell.faces[layer] != face_num) |
1519 | ns->lastmap.cells[sx][sy].faces[layer] = face_num; |
|
|
1520 | if (!(ns->faces_sent[face_num] & NS_FACESENT_FACE)) |
|
|
1521 | esrv_send_face(ns, face_num, 0); |
|
|
1522 | SockList_AddShort(sl, face_num); |
|
|
1523 | return 1; |
|
|
1524 | } |
957 | { |
|
|
958 | lastcell.faces[layer] = face_num; |
|
|
959 | |
|
|
960 | if (!ns.faces_sent[face_num]) |
|
|
961 | if (ob) |
|
|
962 | ns.send_faces (ob); |
|
|
963 | else |
|
|
964 | ns.send_face (face_num); |
|
|
965 | |
|
|
966 | sl << uint16 (face_num); |
|
|
967 | return 1; |
|
|
968 | } |
|
|
969 | |
1525 | /* Nothing changed */ |
970 | /* Nothing changed */ |
1526 | return 0; |
971 | return 0; |
1527 | } |
|
|
1528 | |
|
|
1529 | /** |
|
|
1530 | * This function is mainly a copy of update_space, |
|
|
1531 | * except it handles update of the smoothing updates, |
|
|
1532 | * not the face updates. |
|
|
1533 | * Removes the need to replicate the same code for each layer. |
|
|
1534 | * this returns true if this smooth is now in fact different |
|
|
1535 | * than it was. |
|
|
1536 | * sl is the socklist this data is going into. |
|
|
1537 | * ns is the socket we are working on - all the info we care |
|
|
1538 | * about is in this socket structure, so know need to pass the |
|
|
1539 | * entire player object. |
|
|
1540 | * mx and my are map coordinate offsets for map mp |
|
|
1541 | * sx and sy are the offsets into the socket structure that |
|
|
1542 | * holds the old values. |
|
|
1543 | * layer is the layer to update, with 2 being the floor and 0 the |
|
|
1544 | * top layer (this matches what the GET_MAP_FACE and GET_MAP_FACE_OBJ |
|
|
1545 | * take. |
|
|
1546 | */ |
|
|
1547 | |
|
|
1548 | static inline int update_smooth(SockList *sl, NewSocket *ns, mapstruct *mp, int mx, int my, int sx, int sy, int layer) |
|
|
1549 | { |
|
|
1550 | object *ob; |
|
|
1551 | int smoothlevel; /* old face_num;*/ |
|
|
1552 | |
|
|
1553 | ob = GET_MAP_FACE_OBJ(mp, mx, my, layer); |
|
|
1554 | |
|
|
1555 | /* If there is no object for this space, or if the face for the object |
|
|
1556 | * is the blank face, set the smoothlevel to zero. |
|
|
1557 | */ |
|
|
1558 | if (!ob || ob->face == blank_face || MAP_NOSMOOTH(mp)) smoothlevel=0; |
|
|
1559 | else { |
|
|
1560 | smoothlevel = ob->smoothlevel; |
|
|
1561 | if (smoothlevel && !(ns->faces_sent[ob->face->number] & NS_FACESENT_SMOOTH)) |
|
|
1562 | SendSmooth(ns, ob->face->number); |
|
|
1563 | } /* else not already head object or blank face */ |
|
|
1564 | |
|
|
1565 | /* We've gotten what face we want to use for the object. Now see if |
|
|
1566 | * if it has changed since we last sent it to the client. |
|
|
1567 | */ |
|
|
1568 | if (smoothlevel>255) |
|
|
1569 | smoothlevel=255; |
|
|
1570 | else if (smoothlevel<0) |
|
|
1571 | smoothlevel=0; |
|
|
1572 | if (ns->lastmap.cells[sx][sy].smooth[layer] != smoothlevel) { |
|
|
1573 | ns->lastmap.cells[sx][sy].smooth[layer] = smoothlevel; |
|
|
1574 | SockList_AddChar(sl, (uint8) (smoothlevel&0xFF)); |
|
|
1575 | return 1; |
|
|
1576 | } |
|
|
1577 | /* Nothing changed */ |
|
|
1578 | return 0; |
|
|
1579 | } |
972 | } |
1580 | |
973 | |
1581 | /** |
974 | /** |
1582 | * Returns the size of a data for a map square as returned by |
975 | * Returns the size of a data for a map square as returned by |
1583 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
976 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
1584 | * available. |
977 | * available. |
1585 | */ |
978 | */ |
|
|
979 | int |
1586 | int getExtendedMapInfoSize(NewSocket* ns){ |
980 | getExtendedMapInfoSize (client * ns) |
|
|
981 | { |
1587 | int result=0; |
982 | int result = 0; |
|
|
983 | |
1588 | if (ns->ext_mapinfos){ |
984 | if (ns->ext_mapinfos) |
|
|
985 | { |
1589 | if (ns->EMI_smooth) |
986 | if (ns->EMI_smooth) |
1590 | result+=1; /*One byte for smoothlevel*/ |
987 | result += 1; /*One byte for smoothlevel */ |
1591 | } |
988 | } |
|
|
989 | |
1592 | return result; |
990 | return result; |
1593 | } |
991 | } |
|
|
992 | |
|
|
993 | // prefetch (and touch) all maps within a specific distancd |
|
|
994 | static void |
|
|
995 | prefetch_surrounding_maps (maptile *map, int distance) |
|
|
996 | { |
|
|
997 | map->last_access = runtime; |
|
|
998 | |
|
|
999 | if (--distance) |
|
|
1000 | for (int dir = 4; --dir; ) |
|
|
1001 | if (const shstr &path = map->tile_path [dir]) |
|
|
1002 | if (maptile *&neigh = map->tile_map [dir]) |
|
|
1003 | prefetch_surrounding_maps (neigh, distance); |
|
|
1004 | else |
|
|
1005 | neigh = maptile::find_async (path, map); |
|
|
1006 | } |
|
|
1007 | |
|
|
1008 | // prefetch a generous area around the player |
|
|
1009 | static void |
|
|
1010 | prefetch_surrounding_maps (object *op) |
|
|
1011 | { |
|
|
1012 | prefetch_surrounding_maps (op->map, 3); |
|
|
1013 | } |
|
|
1014 | |
|
|
1015 | /** |
|
|
1016 | * Draws client map. |
|
|
1017 | */ |
|
|
1018 | void |
|
|
1019 | draw_client_map (player *pl) |
|
|
1020 | { |
|
|
1021 | object *ob = pl->observe; |
|
|
1022 | if (!ob->active) |
|
|
1023 | return; |
|
|
1024 | |
|
|
1025 | maptile *plmap = ob->map; |
|
|
1026 | |
|
|
1027 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1028 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
1029 | * be OK once they really log in. |
|
|
1030 | */ |
|
|
1031 | if (!plmap || plmap->in_memory != MAP_IN_MEMORY) |
|
|
1032 | return; |
|
|
1033 | |
|
|
1034 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
|
|
1035 | sint16 nx, ny; |
|
|
1036 | int estartlen, eoldlen; |
|
|
1037 | uint8 eentrysize; |
|
|
1038 | uint16 ewhatstart, ewhatflag; |
|
|
1039 | uint8 extendedinfos; |
|
|
1040 | maptile *m; |
|
|
1041 | |
|
|
1042 | check_map_change (pl); |
|
|
1043 | prefetch_surrounding_maps (pl->ob); |
|
|
1044 | |
|
|
1045 | /* do LOS after calls to update_position */ |
|
|
1046 | if (ob != pl->ob) |
|
|
1047 | clear_los (pl); |
|
|
1048 | else if (pl->do_los) |
|
|
1049 | { |
|
|
1050 | update_los (ob); |
|
|
1051 | pl->do_los = 0; |
|
|
1052 | } |
|
|
1053 | |
1594 | /** |
1054 | /** |
1595 | * This function uses the new map1 protocol command to send the map |
1055 | * This function uses the new map1 protocol command to send the map |
1596 | * to the client. It is necessary because the old map command supports |
1056 | * to the client. It is necessary because the old map command supports |
1597 | * a maximum map size of 15x15. |
1057 | * a maximum map size of 15x15. |
1598 | * This function is much simpler than the old one. This is because |
1058 | * This function is much simpler than the old one. This is because |
1599 | * the old function optimized to send as few face identifiers as possible, |
1059 | * the old function optimized to send as few face identifiers as possible, |
1600 | * at the expense of sending more coordinate location (coordinates were |
1060 | * at the expense of sending more coordinate location (coordinates were |
1601 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
1061 | * only 1 byte, faces 2 bytes, so this was a worthwhile savings). Since |
1602 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1062 | * we need 2 bytes for coordinates and 2 bytes for faces, such a trade off |
1603 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1063 | * maps no sense. Instead, we actually really only use 12 bits for coordinates, |
1604 | * and use the other 4 bits for other informatiion. For full documentation |
1064 | * and use the other 4 bits for other informatiion. For full documentation |
1605 | * of what we send, see the doc/Protocol file. |
1065 | * of what we send, see the doc/Protocol file. |
1606 | * I will describe internally what we do: |
1066 | * I will describe internally what we do: |
1607 | * the socket->lastmap shows how the map last looked when sent to the client. |
1067 | * the ns->lastmap shows how the map last looked when sent to the client. |
1608 | * in the lastmap structure, there is a cells array, which is set to the |
1068 | * in the lastmap structure, there is a cells array, which is set to the |
1609 | * maximum viewable size (As set in config.h). |
1069 | * maximum viewable size (As set in config.h). |
1610 | * in the cells, there are faces and a count value. |
1070 | * in the cells, there are faces and a count value. |
1611 | * we use the count value to hold the darkness value. If -1, then this space |
1071 | * we use the count value to hold the darkness value. If -1, then this space |
1612 | * is not viewable. |
1072 | * is not viewable. |
1613 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
1073 | * we use faces[0] faces[1] faces[2] to hold what the three layers |
1614 | * look like. |
1074 | * look like. |
1615 | */ |
1075 | */ |
1616 | void draw_client_map1(object *pl) |
|
|
1617 | { |
|
|
1618 | int x,y,ax, ay, d, startlen, max_x, max_y, oldlen; |
|
|
1619 | sint16 nx, ny; |
|
|
1620 | int estartlen, eoldlen; |
|
|
1621 | SockList sl; |
|
|
1622 | SockList esl; /*For extended Map info*/ |
|
|
1623 | uint16 mask,emask; |
|
|
1624 | uint8 eentrysize; |
|
|
1625 | uint16 ewhatstart,ewhatflag; |
|
|
1626 | uint8 extendedinfos; |
|
|
1627 | mapstruct *m; |
|
|
1628 | |
1076 | |
1629 | check_map_change (pl->contr); |
1077 | client &socket = *pl->ns; |
1630 | |
1078 | |
1631 | sl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
1079 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1632 | if (pl->contr->socket.mapmode == Map1Cmd) |
1080 | packet esl; |
1633 | strcpy((char*)sl.buf,"map1 "); |
1081 | |
1634 | else |
|
|
1635 | strcpy((char*)sl.buf,"map1a "); |
|
|
1636 | sl.len=strlen((char*)sl.buf); |
|
|
1637 | startlen = sl.len; |
1082 | startlen = sl.length (); |
|
|
1083 | |
1638 | /*Extendedmapinfo structure initialisation*/ |
1084 | /*Extendedmapinfo structure initialisation */ |
1639 | if (pl->contr->socket.ext_mapinfos){ |
1085 | if (socket.ext_mapinfos) |
1640 | esl.buf=(unsigned char*)malloc(MAXSOCKBUF); |
1086 | { |
1641 | strcpy((char*)esl.buf,"mapextended "); |
|
|
1642 | esl.len=strlen((char*)esl.buf); |
|
|
1643 | extendedinfos=EMI_NOREDRAW; |
1087 | extendedinfos = EMI_NOREDRAW; |
|
|
1088 | |
1644 | if (pl->contr->socket.EMI_smooth) |
1089 | if (socket.EMI_smooth) |
1645 | extendedinfos|=EMI_SMOOTH; |
1090 | extendedinfos |= EMI_SMOOTH; |
|
|
1091 | |
1646 | ewhatstart=esl.len; |
1092 | ewhatstart = esl.length (); |
1647 | ewhatflag=extendedinfos; /*The EMI_NOREDRAW bit |
1093 | ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
1648 | could need to be taken away*/ |
1094 | could need to be taken away */ |
1649 | SockList_AddChar(&esl, extendedinfos); |
|
|
1650 | eentrysize=getExtendedMapInfoSize(&(pl->contr->socket)); |
1095 | eentrysize = getExtendedMapInfoSize (&socket); |
1651 | SockList_AddChar(&esl, eentrysize); |
1096 | esl << "mapextended " |
|
|
1097 | << uint8 (extendedinfos) |
|
|
1098 | << uint8 (eentrysize); |
|
|
1099 | |
1652 | estartlen = esl.len; |
1100 | estartlen = esl.length (); |
1653 | } else { |
|
|
1654 | /* suppress compiler warnings */ |
|
|
1655 | ewhatstart = 0; |
|
|
1656 | ewhatflag = 0; |
|
|
1657 | estartlen = 0; |
|
|
1658 | } |
1101 | } |
1659 | /* Init data to zero */ |
|
|
1660 | memset(heads, 0, sizeof(object *) * MAX_HEAD_POS * MAX_HEAD_POS * MAX_LAYERS); |
|
|
1661 | |
1102 | |
1662 | /* x,y are the real map locations. ax, ay are viewport relative |
1103 | /* x,y are the real map locations. ax, ay are viewport relative |
1663 | * locations. |
1104 | * locations. |
1664 | */ |
1105 | */ |
1665 | ay=0; |
1106 | ay = 0; |
1666 | |
1107 | |
1667 | /* We could do this logic as conditionals in the if statement, |
1108 | /* We could do this logic as conditionals in the if statement, |
1668 | * but that started to get a bit messy to look at. |
1109 | * but that started to get a bit messy to look at. |
1669 | */ |
1110 | */ |
1670 | max_x = pl->x+(pl->contr->socket.mapx+1)/2; |
1111 | max_x = ob->x + (socket.mapx + 1) / 2; |
1671 | max_y = pl->y+(pl->contr->socket.mapy+1)/2; |
1112 | max_y = ob->y + (socket.mapy + 1) / 2; |
1672 | if (pl->contr->socket.mapmode == Map1aCmd) { |
1113 | |
1673 | max_x += MAX_HEAD_OFFSET; |
1114 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
1674 | max_y += MAX_HEAD_OFFSET; |
|
|
1675 | } |
1115 | { |
1676 | |
1116 | ax = 0; |
1677 | for(y=pl->y-pl->contr->socket.mapy/2; y<max_y; y++,ay++) { |
1117 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
1678 | ax=0; |
1118 | { |
1679 | for(x=pl->x-pl->contr->socket.mapx/2;x<max_x;x++,ax++) { |
1119 | int emask, mask; |
1680 | |
|
|
1681 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1120 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1682 | |
1121 | |
1683 | /* If this space is out of the normal viewable area, we only check |
1122 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1684 | * the heads value ax or ay will only be greater than what |
|
|
1685 | * the client wants if using the map1a command - this is because |
|
|
1686 | * if the map1a command is not used, max_x and max_y will be |
|
|
1687 | * set to lower values. |
|
|
1688 | */ |
|
|
1689 | if (ax >= pl->contr->socket.mapx || ay >= pl->contr->socket.mapy) { |
|
|
1690 | int i, got_one; |
|
|
1691 | |
1123 | |
1692 | oldlen = sl.len; |
|
|
1693 | |
|
|
1694 | |
|
|
1695 | SockList_AddShort(&sl, mask); |
|
|
1696 | |
|
|
1697 | if (check_head(&sl, &pl->contr->socket, ax, ay, 2)) |
|
|
1698 | mask |= 0x4; |
|
|
1699 | if (check_head(&sl, &pl->contr->socket, ax, ay, 1)) |
|
|
1700 | mask |= 0x2; |
|
|
1701 | if (check_head(&sl, &pl->contr->socket, ax, ay, 0)) |
|
|
1702 | mask |= 0x1; |
|
|
1703 | |
|
|
1704 | /* If all we are doing is sending 0 (blank) faces, we don't |
|
|
1705 | * actually need to send that - just the coordinates |
|
|
1706 | * with no faces tells the client to blank out the |
|
|
1707 | * space. |
|
|
1708 | */ |
|
|
1709 | got_one=0; |
|
|
1710 | for (i=oldlen+2; i<sl.len; i++) { |
|
|
1711 | if (sl.buf[i]) got_one=1; |
|
|
1712 | } |
|
|
1713 | |
|
|
1714 | if (got_one && (mask & 0xf)) { |
|
|
1715 | sl.buf[oldlen+1] = mask & 0xff; |
|
|
1716 | } else { /*either all faces blank, either no face at all*/ |
|
|
1717 | if (mask & 0xf) /*at least 1 face, we know it's blank, only send coordinates*/ |
|
|
1718 | sl.len = oldlen + 2; |
|
|
1719 | else |
|
|
1720 | sl.len = oldlen; |
|
|
1721 | } |
|
|
1722 | /*What concerns extendinfos, nothing to be done for now |
|
|
1723 | * (perhaps effects layer later) |
|
|
1724 | */ |
|
|
1725 | continue; /* don't do processing below */ |
|
|
1726 | } |
|
|
1727 | |
|
|
1728 | d = pl->contr->blocked_los[ax][ay]; |
|
|
1729 | |
|
|
1730 | /* If the coordinates are not valid, or it is too dark to see, |
1124 | /* If the coordinates are not valid, or it is too dark to see, |
1731 | * we tell the client as such |
1125 | * we tell the client as such |
1732 | */ |
1126 | */ |
1733 | nx=x; |
1127 | nx = x; |
1734 | ny=y; |
1128 | ny = y; |
1735 | m = get_map_from_coord(pl->map, &nx, &ny); |
1129 | m = get_map_from_coord (plmap, &nx, &ny); |
1736 | if (!m) { |
1130 | |
|
|
1131 | if (!m) |
|
|
1132 | { |
1737 | /* space is out of map. Update space and clear values |
1133 | /* space is out of map. Update space and clear values |
1738 | * if this hasn't already been done. If the space is out |
1134 | * if this hasn't already been done. If the space is out |
1739 | * of the map, it shouldn't have a head |
1135 | * of the map, it shouldn't have a head |
1740 | */ |
1136 | */ |
1741 | if (pl->contr->socket.lastmap.cells[ax][ay].count != -1) { |
1137 | if (lastcell.count != -1) |
1742 | SockList_AddShort(&sl, mask); |
1138 | { |
1743 | map_clearcell(&pl->contr->socket.lastmap.cells[ax][ay],0,0,0,-1); |
1139 | sl << uint16 (mask); |
1744 | } |
1140 | map_clearcell (&lastcell, -1); |
1745 | } else if (d>3) { |
1141 | } |
1746 | int need_send=0, count; |
1142 | |
|
|
1143 | continue; |
|
|
1144 | } |
|
|
1145 | |
|
|
1146 | m->touch (); |
|
|
1147 | |
|
|
1148 | int d = pl->blocked_los[ax][ay]; |
|
|
1149 | |
|
|
1150 | if (d > 3) |
|
|
1151 | { |
|
|
1152 | |
|
|
1153 | int need_send = 0, count; |
|
|
1154 | |
1747 | /* This block deals with spaces that are not visible for whatever |
1155 | /* This block deals with spaces that are not visible for whatever |
1748 | * reason. Still may need to send the head for this space. |
1156 | * reason. Still may need to send the head for this space. |
1749 | */ |
1157 | */ |
1750 | |
1158 | |
1751 | oldlen = sl.len; |
1159 | oldlen = sl.length (); |
1752 | #if 0 |
|
|
1753 | /* First thing we do is blank out this space (clear it) |
|
|
1754 | * if not already done. If the client is using darkness, and |
|
|
1755 | * this space is at the edge, we also include the darkness. |
|
|
1756 | */ |
|
|
1757 | if (d==4) { |
|
|
1758 | if (pl->contr->socket.darkness && pl->contr->socket.lastmap.cells[ax][ay].count != d) { |
|
|
1759 | mask |= 8; |
|
|
1760 | SockList_AddShort(&sl, mask); |
|
|
1761 | SockList_AddChar(&sl, 0); |
|
|
1762 | } |
|
|
1763 | count = d; |
|
|
1764 | } else |
|
|
1765 | #endif |
|
|
1766 | { |
|
|
1767 | SockList_AddShort(&sl, mask); |
|
|
1768 | if (pl->contr->socket.lastmap.cells[ax][ay].count != -1) need_send=1; |
|
|
1769 | count = -1; |
|
|
1770 | } |
|
|
1771 | |
1160 | |
1772 | if (pl->contr->socket.mapmode == Map1aCmd && have_head(ax, ay)) { |
1161 | sl << uint16 (mask); |
1773 | /* Now check to see if any heads need to be sent */ |
|
|
1774 | |
1162 | |
1775 | if (check_head(&sl, &pl->contr->socket, ax, ay, 2)) |
1163 | if (lastcell.count != -1) |
1776 | mask |= 0x4; |
1164 | need_send = 1; |
1777 | if (check_head(&sl, &pl->contr->socket, ax, ay, 1)) |
|
|
1778 | mask |= 0x2; |
|
|
1779 | if (check_head(&sl, &pl->contr->socket, ax, ay, 0)) |
|
|
1780 | mask |= 0x1; |
|
|
1781 | pl->contr->socket.lastmap.cells[ax][ay].count = count; |
|
|
1782 | |
1165 | |
1783 | } else { |
1166 | count = -1; |
1784 | struct MapCell *cell = &pl->contr->socket.lastmap.cells[ax][ay]; |
1167 | |
1785 | /* properly clear a previously sent big face */ |
1168 | /* properly clear a previously sent big face */ |
1786 | if(cell->faces[0] != 0 |
1169 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1787 | || cell->faces[1] != 0 |
1170 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1788 | || cell->faces[2] != 0) |
1171 | need_send = 1; |
1789 | need_send = 1; |
|
|
1790 | map_clearcell(&pl->contr->socket.lastmap.cells[ax][ay], 0, 0, 0, count); |
|
|
1791 | } |
|
|
1792 | |
1172 | |
|
|
1173 | map_clearcell (&lastcell, count); |
|
|
1174 | |
1793 | if ((mask & 0xf) || need_send) { |
1175 | if ((mask & 0xf) || need_send) |
1794 | sl.buf[oldlen+1] = mask & 0xff; |
1176 | sl[oldlen + 1] = mask & 0xff; |
1795 | } else { |
1177 | else |
1796 | sl.len = oldlen; |
1178 | sl.reset (oldlen); |
1797 | } |
1179 | } |
1798 | } else { |
1180 | else |
1799 | /* In this block, the space is visible or there are head objects |
1181 | { |
1800 | * we need to send. |
1182 | /* In this block, the space is visible. |
1801 | */ |
1183 | */ |
1802 | |
1184 | |
1803 | /* Rather than try to figure out what everything that we might |
1185 | /* Rather than try to figure out what everything that we might |
1804 | * need to send is, then form the packet after that, |
1186 | * need to send is, then form the packet after that, |
1805 | * we presume that we will in fact form a packet, and update |
1187 | * we presume that we will in fact form a packet, and update |
1806 | * the bits by what we do actually send. If we send nothing, |
1188 | * the bits by what we do actually send. If we send nothing, |
1807 | * we just back out sl.len to the old value, and no harm |
1189 | * we just back out sl.length () to the old value, and no harm |
1808 | * is done. |
1190 | * is done. |
1809 | * I think this is simpler than doing a bunch of checks to see |
1191 | * I think this is simpler than doing a bunch of checks to see |
1810 | * what if anything we need to send, setting the bits, then |
1192 | * what if anything we need to send, setting the bits, then |
1811 | * doing those checks again to add the real data. |
1193 | * doing those checks again to add the real data. |
1812 | */ |
1194 | */ |
1813 | oldlen = sl.len; |
1195 | oldlen = sl.length (); |
1814 | mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1196 | eoldlen = esl.length (); |
1815 | eoldlen = esl.len; |
|
|
1816 | emask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1817 | SockList_AddShort(&sl, mask); |
|
|
1818 | |
1197 | |
1819 | if (pl->contr->socket.ext_mapinfos) |
1198 | sl << uint16 (mask); |
1820 | SockList_AddShort(&esl, emask); |
|
|
1821 | |
1199 | |
1822 | /* Darkness changed */ |
1200 | unsigned char dummy; |
1823 | if (pl->contr->socket.lastmap.cells[ax][ay].count != d && pl->contr->socket.darkness) { |
1201 | unsigned char *last_ext = &dummy; |
1824 | pl->contr->socket.lastmap.cells[ax][ay].count = d; |
|
|
1825 | mask |= 0x8; /* darkness bit */ |
|
|
1826 | |
1202 | |
1827 | /* Protocol defines 255 full bright, 0 full dark. |
1203 | /* Darkness changed */ |
1828 | * We currently don't have that many darkness ranges, |
1204 | if (lastcell.count != d && socket.darkness) |
1829 | * so we current what limited values we do have. |
1205 | { |
1830 | */ |
1206 | mask |= 0x8; |
1831 | if (d==0) SockList_AddChar(&sl, 255); |
|
|
1832 | else if (d==1) SockList_AddChar(&sl, 191); |
|
|
1833 | else if (d==2) SockList_AddChar(&sl, 127); |
|
|
1834 | else if (d==3) SockList_AddChar(&sl, 63); |
|
|
1835 | } |
|
|
1836 | else { |
|
|
1837 | /* need to reset from -1 so that if it does become blocked again, |
|
|
1838 | * the code that deals with that can detect that it needs to tell |
|
|
1839 | * the client that this space is now blocked. |
|
|
1840 | */ |
|
|
1841 | pl->contr->socket.lastmap.cells[ax][ay].count = d; |
|
|
1842 | } |
|
|
1843 | |
1207 | |
1844 | /* Floor face */ |
1208 | if (socket.extmap) |
1845 | if (update_space(&sl, &pl->contr->socket, m, nx, ny, ax, ay, 2)) |
1209 | { |
1846 | mask |= 0x4; |
1210 | *last_ext |= 0x80; |
|
|
1211 | last_ext = &sl[sl.length ()]; |
|
|
1212 | sl << uint8 (d); |
|
|
1213 | } |
|
|
1214 | else |
|
|
1215 | sl << uint8 (255 - 64 * d); |
|
|
1216 | } |
1847 | |
1217 | |
1848 | if (pl->contr->socket.EMI_smooth) |
1218 | lastcell.count = d; |
1849 | if (update_smooth(&esl, &pl->contr->socket, m, nx, ny, ax, ay, 2)){ |
|
|
1850 | emask |= 0x4; |
|
|
1851 | } |
|
|
1852 | |
1219 | |
1853 | /* Middle face */ |
1220 | mapspace &ms = m->at (nx, ny); |
1854 | if (update_space(&sl, &pl->contr->socket, m, nx, ny, ax, ay, 1)) |
1221 | ms.update (); |
1855 | mask |= 0x2; |
|
|
1856 | |
1222 | |
1857 | if (pl->contr->socket.EMI_smooth) |
1223 | if (socket.extmap) |
1858 | if (update_smooth(&esl, &pl->contr->socket, m, nx, ny, ax, ay, 1)){ |
1224 | { |
1859 | emask |= 0x2; |
1225 | uint8 stat_hp = 0; |
1860 | } |
1226 | uint8 stat_width = 0; |
|
|
1227 | uint8 flags = 0; |
|
|
1228 | tag_t player = 0; |
1861 | |
1229 | |
|
|
1230 | // send hp information, if applicable |
|
|
1231 | if (object *op = ms.faces_obj [0]) |
|
|
1232 | { |
|
|
1233 | if (op->head || op->invisible) |
|
|
1234 | ; // do not show |
|
|
1235 | else if (op->type == PLAYER |
|
|
1236 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR)) |
|
|
1237 | { |
|
|
1238 | if (op->stats.maxhp > 0 && (unsigned) op->stats.maxhp > (unsigned) op->stats.hp) |
|
|
1239 | { |
|
|
1240 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1241 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1242 | } |
|
|
1243 | } |
1862 | |
1244 | |
1863 | if(nx == pl->x && ny == pl->y && pl->invisible & (pl->invisible < 50 ? 4 : 1)) { |
1245 | if (op->msg && op->msg[0] == '@') |
1864 | if (pl->contr->socket.lastmap.cells[ax][ay].faces[0] != pl->face->number) { |
1246 | flags |= 1; |
1865 | pl->contr->socket.lastmap.cells[ax][ay].faces[0] = pl->face->number; |
1247 | |
1866 | mask |= 0x1; |
1248 | if (op->type == PLAYER && op != ob) |
1867 | if (!(pl->contr->socket.faces_sent[pl->face->number] &NS_FACESENT_FACE)) |
1249 | player = op->count; |
1868 | esrv_send_face(&pl->contr->socket, pl->face->number, 0); |
1250 | } |
1869 | SockList_AddShort(&sl, pl->face->number); |
1251 | |
1870 | } |
1252 | if (lastcell.stat_hp != stat_hp) |
1871 | } |
1253 | { |
1872 | /* Top face */ |
1254 | lastcell.stat_hp = stat_hp; |
1873 | else { |
1255 | |
1874 | if (update_space(&sl, &pl->contr->socket, m, nx, ny, ax, ay, 0)) |
1256 | mask |= 0x8; |
|
|
1257 | *last_ext |= 0x80; |
|
|
1258 | last_ext = &sl[sl.length ()]; |
|
|
1259 | |
|
|
1260 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1261 | |
|
|
1262 | if (stat_width > 1) |
|
|
1263 | { |
|
|
1264 | *last_ext |= 0x80; |
|
|
1265 | last_ext = &sl[sl.length ()]; |
|
|
1266 | |
|
|
1267 | sl << uint8 (6) << uint8 (stat_width); |
|
|
1268 | } |
|
|
1269 | } |
|
|
1270 | |
|
|
1271 | if (lastcell.player != player) |
|
|
1272 | { |
|
|
1273 | lastcell.player = player; |
|
|
1274 | |
|
|
1275 | mask |= 0x8; |
|
|
1276 | *last_ext |= 0x80; |
|
|
1277 | last_ext = &sl[sl.length ()]; |
|
|
1278 | |
|
|
1279 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1280 | } |
|
|
1281 | |
|
|
1282 | if (lastcell.flags != flags) |
|
|
1283 | { |
|
|
1284 | lastcell.flags = flags; |
|
|
1285 | |
|
|
1286 | mask |= 0x8; |
|
|
1287 | *last_ext |= 0x80; |
|
|
1288 | last_ext = &sl[sl.length ()]; |
|
|
1289 | |
|
|
1290 | sl << uint8 (8) << uint8 (flags); |
|
|
1291 | } |
|
|
1292 | } |
|
|
1293 | |
|
|
1294 | /* Floor face */ |
|
|
1295 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1296 | mask |= 0x4; |
|
|
1297 | |
|
|
1298 | /* Middle face */ |
|
|
1299 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1300 | mask |= 0x2; |
|
|
1301 | |
|
|
1302 | if (ms.player () == ob |
|
|
1303 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
|
|
1304 | { |
|
|
1305 | // force player to be visible to himself if invisible |
|
|
1306 | if (lastcell.faces[0] != ob->face) |
|
|
1307 | { |
|
|
1308 | lastcell.faces[0] = ob->face; |
|
|
1309 | |
|
|
1310 | mask |= 0x1; |
|
|
1311 | sl << uint16 (ob->face); |
|
|
1312 | |
|
|
1313 | socket.send_faces (ob); |
|
|
1314 | } |
|
|
1315 | } |
|
|
1316 | /* Top face */ |
|
|
1317 | else if (update_space (sl, socket, ms, lastcell, 0)) |
1875 | mask |= 0x1; |
1318 | mask |= 0x1; |
1876 | if (pl->contr->socket.EMI_smooth) |
1319 | |
1877 | if (update_smooth(&esl, &pl->contr->socket, m, nx, ny, ax, ay, 0)){ |
|
|
1878 | emask |= 0x1; |
|
|
1879 | } |
|
|
1880 | } |
|
|
1881 | /* Check to see if we are in fact sending anything for this |
1320 | /* Check to see if we are in fact sending anything for this |
1882 | * space by checking the mask. If so, update the mask. |
1321 | * space by checking the mask. If so, update the mask. |
1883 | * if not, reset the len to that from before adding the mask |
1322 | * if not, reset the len to that from before adding the mask |
1884 | * value, so we don't send those bits. |
1323 | * value, so we don't send those bits. |
1885 | */ |
1324 | */ |
1886 | if (mask & 0xf) { |
1325 | if (mask & 0xf) |
1887 | sl.buf[oldlen+1] = mask & 0xff; |
1326 | sl[oldlen + 1] = mask & 0xff; |
1888 | } else { |
1327 | else |
1889 | sl.len = oldlen; |
1328 | sl.reset (oldlen); |
1890 | } |
1329 | |
1891 | if (emask & 0xf) { |
1330 | if (socket.ext_mapinfos) |
1892 | esl.buf[eoldlen+1] = emask & 0xff; |
1331 | esl << uint16 (emask); |
1893 | } else { |
1332 | |
1894 | esl.len = eoldlen; |
1333 | if (socket.EMI_smooth) |
1895 | } |
1334 | { |
|
|
1335 | for (int layer = 2+1; layer--; ) |
|
|
1336 | { |
|
|
1337 | object *ob = ms.faces_obj [layer]; |
|
|
1338 | |
|
|
1339 | // If there is no object for this space, or if the face for the object |
|
|
1340 | // is the blank face, set the smoothlevel to zero. |
|
|
1341 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
|
|
1342 | |
|
|
1343 | // We've gotten what face we want to use for the object. Now see if |
|
|
1344 | // if it has changed since we last sent it to the client. |
|
|
1345 | if (lastcell.smooth[layer] != smoothlevel) |
|
|
1346 | { |
|
|
1347 | lastcell.smooth[layer] = smoothlevel; |
|
|
1348 | esl << uint8 (smoothlevel); |
|
|
1349 | emask |= 1 << layer; |
|
|
1350 | } |
|
|
1351 | } |
|
|
1352 | |
|
|
1353 | if (emask & 0xf) |
|
|
1354 | esl[eoldlen + 1] = emask & 0xff; |
|
|
1355 | else |
|
|
1356 | esl.reset (eoldlen); |
|
|
1357 | } |
1896 | } /* else this is a viewable space */ |
1358 | } /* else this is a viewable space */ |
1897 | } /* for x loop */ |
1359 | } /* for x loop */ |
1898 | } /* for y loop */ |
1360 | } /* for y loop */ |
1899 | |
1361 | |
|
|
1362 | socket.flush_fx (); |
|
|
1363 | |
1900 | /* Verify that we in fact do need to send this */ |
1364 | /* Verify that we in fact do need to send this */ |
1901 | if (pl->contr->socket.ext_mapinfos){ |
1365 | if (socket.ext_mapinfos) |
|
|
1366 | { |
1902 | if (!(sl.len>startlen || pl->contr->socket.sent_scroll)){ |
1367 | if (!(sl.length () > startlen || socket.sent_scroll)) |
|
|
1368 | { |
1903 | /* No map data will follow, so don't say the client |
1369 | /* No map data will follow, so don't say the client |
1904 | * it doesn't need draw! |
1370 | * it doesn't need draw! |
1905 | */ |
1371 | */ |
1906 | ewhatflag&=(~EMI_NOREDRAW); |
1372 | ewhatflag &= ~EMI_NOREDRAW; |
1907 | esl.buf[ewhatstart+1] = ewhatflag & 0xff; |
1373 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
1908 | } |
1374 | } |
|
|
1375 | |
1909 | if (esl.len>estartlen) { |
1376 | if (esl.length () > estartlen) |
1910 | Send_With_Handling(&pl->contr->socket, &esl); |
1377 | socket.send_packet (esl); |
1911 | } |
|
|
1912 | free(esl.buf); |
|
|
1913 | } |
|
|
1914 | if (sl.len>startlen || pl->contr->socket.sent_scroll) { |
|
|
1915 | Send_With_Handling(&pl->contr->socket, &sl); |
|
|
1916 | pl->contr->socket.sent_scroll = 0; |
|
|
1917 | } |
|
|
1918 | free(sl.buf); |
|
|
1919 | } |
|
|
1920 | |
|
|
1921 | /** |
|
|
1922 | * Draws client map. |
|
|
1923 | */ |
|
|
1924 | void draw_client_map(object *pl) |
|
|
1925 | { |
|
|
1926 | int i,j; |
|
|
1927 | sint16 ax, ay, nx, ny;/* ax and ay goes from 0 to max-size of arrays */ |
|
|
1928 | New_Face *face,*floor; |
|
|
1929 | New_Face *floor2; |
|
|
1930 | int d, mflags; |
|
|
1931 | struct Map newmap; |
|
|
1932 | mapstruct *m, *pm; |
|
|
1933 | |
|
|
1934 | if (pl->type != PLAYER) { |
|
|
1935 | LOG(llevError,"draw_client_map called with non player/non eric-server\n"); |
|
|
1936 | return; |
|
|
1937 | } |
|
|
1938 | |
|
|
1939 | if (pl->contr->transport) { |
|
|
1940 | pm = pl->contr->transport->map; |
|
|
1941 | } |
|
|
1942 | else |
|
|
1943 | pm = pl->map; |
|
|
1944 | |
|
|
1945 | /* If player is just joining the game, he isn't here yet, so the map |
|
|
1946 | * can get swapped out. If so, don't try to send them a map. All will |
|
|
1947 | * be OK once they really log in. |
|
|
1948 | */ |
|
|
1949 | if (pm==NULL || pm->in_memory!=MAP_IN_MEMORY) return; |
|
|
1950 | |
|
|
1951 | memset(&newmap, 0, sizeof(struct Map)); |
|
|
1952 | |
|
|
1953 | for(j = (pl->y - pl->contr->socket.mapy/2) ; j < (pl->y + (pl->contr->socket.mapy+1)/2); j++) { |
|
|
1954 | for(i = (pl->x - pl->contr->socket.mapx/2) ; i < (pl->x + (pl->contr->socket.mapx+1)/2); i++) { |
|
|
1955 | ax=i; |
|
|
1956 | ay=j; |
|
|
1957 | m = pm; |
|
|
1958 | mflags = get_map_flags(m, &m, ax, ay, &ax, &ay); |
|
|
1959 | if (mflags & P_OUT_OF_MAP) |
|
|
1960 | continue; |
|
|
1961 | if (mflags & P_NEED_UPDATE) |
|
|
1962 | update_position(m, ax, ay); |
|
|
1963 | /* If a map is visible to the player, we don't want to swap it out |
|
|
1964 | * just to reload it. This should really call something like |
|
|
1965 | * swap_map, but this is much more efficient and 'good enough' |
|
|
1966 | */ |
|
|
1967 | if (mflags & P_NEW_MAP) |
|
|
1968 | m->timeout = 50; |
|
|
1969 | } |
|
|
1970 | } |
|
|
1971 | /* do LOS after calls to update_position */ |
|
|
1972 | if(pl->contr->do_los) { |
|
|
1973 | update_los(pl); |
|
|
1974 | pl->contr->do_los = 0; |
|
|
1975 | } |
|
|
1976 | |
|
|
1977 | if (pl->contr->socket.mapmode == Map1Cmd || pl->contr->socket.mapmode == Map1aCmd) { |
|
|
1978 | /* Big maps need a different drawing mechanism to work */ |
|
|
1979 | draw_client_map1(pl); |
|
|
1980 | return; |
|
|
1981 | } |
|
|
1982 | |
1378 | } |
1983 | if(pl->invisible & (pl->invisible < 50 ? 4 : 1)) { |
1379 | |
1984 | esrv_map_setbelow(&pl->contr->socket,pl->contr->socket.mapx/2, |
1380 | if (sl.length () > startlen || socket.sent_scroll) |
1985 | pl->contr->socket.mapy/2,pl->face->number,&newmap); |
|
|
1986 | } |
1381 | { |
1987 | |
1382 | socket.send_packet (sl); |
1988 | /* j and i are the y and x coordinates of the real map (which is |
1383 | socket.sent_scroll = 0; |
1989 | * basically some number of spaces around the player) |
|
|
1990 | * ax and ay are values from within the viewport (ie, 0, 0 is upper |
|
|
1991 | * left corner) and are thus disconnected from the map values. |
|
|
1992 | * Subtract 1 from the max values so that we properly handle cases where |
|
|
1993 | * player has specified an even map. Otherwise, we try to send them too |
|
|
1994 | * much, ie, if mapx is 10, we would try to send from -5 to 5, which is actually |
|
|
1995 | * 11 spaces. Now, we would send from -5 to 4, which is properly. If mapx is |
|
|
1996 | * odd, this still works fine. |
|
|
1997 | */ |
|
|
1998 | ay=0; |
|
|
1999 | for(j=pl->y-pl->contr->socket.mapy/2; j<=pl->y+(pl->contr->socket.mapy-1)/2;j++, ay++) { |
|
|
2000 | ax=0; |
|
|
2001 | for(i=pl->x-pl->contr->socket.mapx/2;i<=pl->x+(pl->contr->socket.mapx-1)/2;i++, ax++) { |
|
|
2002 | |
|
|
2003 | d = pl->contr->blocked_los[ax][ay]; |
|
|
2004 | /* note the out_of_map and d>3 checks are both within the same |
|
|
2005 | * negation check. |
|
|
2006 | */ |
|
|
2007 | nx = i; |
|
|
2008 | ny = j; |
|
|
2009 | m = get_map_from_coord(pm, &nx, &ny); |
|
|
2010 | if (m && d<4) { |
|
|
2011 | face = GET_MAP_FACE(m, nx, ny,0); |
|
|
2012 | floor2 = GET_MAP_FACE(m, nx, ny,1); |
|
|
2013 | floor = GET_MAP_FACE(m, nx, ny,2); |
|
|
2014 | |
|
|
2015 | /* If all is blank, send a blank face. */ |
|
|
2016 | if ((!face || face == blank_face) && |
|
|
2017 | (!floor2 || floor2 == blank_face) && |
|
|
2018 | (!floor || floor == blank_face)) { |
|
|
2019 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2020 | blank_face->number,&newmap); |
|
|
2021 | } else { /* actually have something interesting */ |
|
|
2022 | /* send the darkness mask, if any. */ |
|
|
2023 | if (d && pl->contr->socket.darkness) |
|
|
2024 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2025 | dark_faces[d-1]->number,&newmap); |
|
|
2026 | |
|
|
2027 | if (face && face != blank_face) |
|
|
2028 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2029 | face->number,&newmap); |
|
|
2030 | if (floor2 && floor2 != blank_face) |
|
|
2031 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2032 | floor2->number,&newmap); |
|
|
2033 | if (floor && floor != blank_face) |
|
|
2034 | esrv_map_setbelow(&pl->contr->socket,ax,ay, |
|
|
2035 | floor->number,&newmap); |
|
|
2036 | } |
|
|
2037 | } /* Is a valid space */ |
|
|
2038 | } |
|
|
2039 | } |
1384 | } |
2040 | esrv_map_doneredraw(&pl->contr->socket, &newmap); |
|
|
2041 | |
|
|
2042 | check_map_change (pl->contr); |
|
|
2043 | } |
1385 | } |
2044 | |
|
|
2045 | |
1386 | |
2046 | /*****************************************************************************/ |
1387 | /*****************************************************************************/ |
2047 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
1388 | /* GROS: The following one is used to allow a plugin to send a generic cmd to*/ |
2048 | /* a player. Of course, the client need to know the command to be able to */ |
1389 | /* a player. Of course, the client need to know the command to be able to */ |
2049 | /* manage it ! */ |
1390 | /* manage it ! */ |
2050 | /*****************************************************************************/ |
1391 | /*****************************************************************************/ |
|
|
1392 | void |
2051 | void send_plugin_custom_message(object *pl, char *buf) |
1393 | send_plugin_custom_message (object *pl, char *buf) |
2052 | { |
1394 | { |
2053 | cs_write_string(&pl->contr->socket,buf,strlen(buf)); |
1395 | pl->contr->ns->send_packet (buf); |
2054 | } |
1396 | } |
2055 | |
1397 | |
2056 | /** |
1398 | /** |
2057 | * This sends the skill number to name mapping. We ignore |
1399 | * This sends the skill number to name mapping. We ignore |
2058 | * the params - we always send the same info no matter what. |
1400 | * the params - we always send the same info no matter what. |
2059 | */ |
1401 | */ |
|
|
1402 | void |
2060 | void send_skill_info(NewSocket *ns, char *params) |
1403 | send_skill_info (client *ns, char *params) |
2061 | { |
1404 | { |
2062 | SockList sl; |
1405 | packet sl; |
2063 | int i; |
1406 | sl << "replyinfo skill_info\n"; |
2064 | |
1407 | |
2065 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
|
|
2066 | strcpy((char*)sl.buf,"replyinfo skill_info\n"); |
|
|
2067 | for (i=1; i< NUM_SKILLS; i++) { |
1408 | for (int i = 1; i < NUM_SKILLS; i++) |
2068 | sprintf((char*)sl.buf + strlen((char*)sl.buf), "%d:%s\n", i + CS_STAT_SKILLINFO, |
1409 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
2069 | skill_names[i]); |
1410 | |
2070 | } |
|
|
2071 | sl.len = strlen((char*)sl.buf); |
|
|
2072 | if (sl.len >= MAXSOCKBUF) { |
1411 | if (sl.length () >= MAXSOCKBUF) |
|
|
1412 | { |
2073 | LOG(llevError,"Buffer overflow in send_skill_info!\n"); |
1413 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
2074 | fatal(0); |
1414 | fatal (0); |
2075 | } |
1415 | } |
2076 | Send_With_Handling(ns, &sl); |
1416 | |
2077 | free(sl.buf); |
1417 | ns->send_packet (sl); |
2078 | } |
1418 | } |
2079 | |
1419 | |
2080 | /** |
1420 | /** |
2081 | * This sends the spell path to name mapping. We ignore |
1421 | * This sends the spell path to name mapping. We ignore |
2082 | * the params - we always send the same info no matter what. |
1422 | * the params - we always send the same info no matter what. |
2083 | */ |
1423 | */ |
|
|
1424 | void |
2084 | void send_spell_paths (NewSocket *ns, char *params) { |
1425 | send_spell_paths (client * ns, char *params) |
2085 | SockList sl; |
1426 | { |
2086 | int i; |
1427 | packet sl; |
2087 | |
1428 | |
2088 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
1429 | sl << "replyinfo spell_paths\n"; |
2089 | strcpy((char*)sl.buf,"replyinfo spell_paths\n"); |
1430 | |
2090 | for(i=0; i<NRSPELLPATHS; i++) |
1431 | for (int i = 0; i < NRSPELLPATHS; i++) |
2091 | sprintf((char*)sl.buf + strlen((char*)sl.buf), "%d:%s\n", 1<<i, spellpathnames[i]); |
1432 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
2092 | sl.len = strlen((char*)sl.buf); |
1433 | |
2093 | if (sl.len >= MAXSOCKBUF) { |
1434 | if (sl.length () >= MAXSOCKBUF) |
|
|
1435 | { |
2094 | LOG(llevError,"Buffer overflow in send_spell_paths!\n"); |
1436 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
2095 | fatal(0); |
1437 | fatal (0); |
2096 | } |
1438 | } |
2097 | Send_With_Handling(ns, &sl); |
1439 | |
2098 | free(sl.buf); |
1440 | ns->send_packet (sl); |
2099 | } |
1441 | } |
2100 | |
1442 | |
2101 | /** |
1443 | /** |
2102 | * This looks for any spells the player may have that have changed their stats. |
1444 | * This looks for any spells the player may have that have changed their stats. |
2103 | * it then sends an updspell packet for each spell that has changed in this way |
1445 | * it then sends an updspell packet for each spell that has changed in this way |
2104 | */ |
1446 | */ |
|
|
1447 | void |
2105 | void esrv_update_spells(player *pl) { |
1448 | esrv_update_spells (player *pl) |
2106 | SockList sl; |
1449 | { |
2107 | int flags=0; |
1450 | if (!pl->ns) |
2108 | object *spell; |
1451 | return; |
2109 | if (!pl->socket.monitor_spells) return; |
1452 | |
|
|
1453 | if (!pl->ns->monitor_spells) |
|
|
1454 | return; |
|
|
1455 | |
2110 | for (spell=pl->ob->inv; spell!=NULL; spell=spell->below) { |
1456 | for (object *spell = pl->ob->inv; spell; spell = spell->below) |
|
|
1457 | { |
2111 | if (spell->type == SPELL) { |
1458 | if (spell->type == SPELL) |
|
|
1459 | { |
|
|
1460 | int flags = 0; |
|
|
1461 | |
2112 | /* check if we need to update it*/ |
1462 | /* check if we need to update it */ |
2113 | if (spell->last_sp != SP_level_spellpoint_cost(pl->ob, spell, SPELL_MANA)) { |
1463 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
|
|
1464 | { |
2114 | spell->last_sp = SP_level_spellpoint_cost(pl->ob, spell, SPELL_MANA); |
1465 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
2115 | flags |= UPD_SP_MANA; |
1466 | flags |= UPD_SP_MANA; |
2116 | } |
1467 | } |
|
|
1468 | |
2117 | if (spell->last_grace != SP_level_spellpoint_cost(pl->ob, spell, SPELL_GRACE)) { |
1469 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
|
|
1470 | { |
2118 | spell->last_grace = SP_level_spellpoint_cost(pl->ob, spell, SPELL_GRACE); |
1471 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
2119 | flags |= UPD_SP_GRACE; |
1472 | flags |= UPD_SP_GRACE; |
2120 | } |
1473 | } |
|
|
1474 | |
2121 | if (spell->last_eat != spell->stats.dam+SP_level_dam_adjust(pl->ob, spell)) { |
1475 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
|
|
1476 | { |
2122 | spell->last_eat = spell->stats.dam+SP_level_dam_adjust(pl->ob, spell); |
1477 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
2123 | flags |= UPD_SP_DAMAGE; |
1478 | flags |= UPD_SP_DAMAGE; |
|
|
1479 | } |
|
|
1480 | |
|
|
1481 | if (flags) |
|
|
1482 | { |
|
|
1483 | packet sl; |
|
|
1484 | |
|
|
1485 | sl << "updspell " |
|
|
1486 | << uint8 (flags) |
|
|
1487 | << uint32 (spell->count); |
|
|
1488 | |
|
|
1489 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
|
|
1490 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
|
|
1491 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
|
|
1492 | |
|
|
1493 | pl->ns->send_packet (sl); |
|
|
1494 | } |
|
|
1495 | } |
2124 | } |
1496 | } |
2125 | if (flags !=0) { |
|
|
2126 | sl.buf =(unsigned char*) malloc(MAXSOCKBUF); |
|
|
2127 | strcpy((char*)sl.buf,"updspell "); |
|
|
2128 | sl.len=strlen((char*)sl.buf); |
|
|
2129 | SockList_AddChar(&sl, flags); |
|
|
2130 | SockList_AddInt(&sl, spell->count); |
|
|
2131 | if (flags & UPD_SP_MANA) SockList_AddShort(&sl, spell->last_sp); |
|
|
2132 | if (flags & UPD_SP_GRACE) SockList_AddShort(&sl, spell->last_grace); |
|
|
2133 | if (flags & UPD_SP_DAMAGE) SockList_AddShort(&sl, spell->last_eat); |
|
|
2134 | flags = 0; |
|
|
2135 | Send_With_Handling(&pl->socket, &sl); |
|
|
2136 | free(sl.buf); |
|
|
2137 | } |
|
|
2138 | } |
|
|
2139 | } |
|
|
2140 | } |
1497 | } |
2141 | |
1498 | |
|
|
1499 | void |
2142 | void esrv_remove_spell(player *pl, object *spell) { |
1500 | esrv_remove_spell (player *pl, object *spell) |
2143 | SockList sl; |
1501 | { |
|
|
1502 | if (!pl->ns->monitor_spells) |
|
|
1503 | return; |
2144 | |
1504 | |
2145 | if (!pl->socket.monitor_spells) return; |
|
|
2146 | if (!pl || !spell || spell->env != pl->ob) { |
1505 | if (!pl || !spell || spell->env != pl->ob) |
|
|
1506 | { |
2147 | LOG(llevError, "Invalid call to esrv_remove_spell"); |
1507 | LOG (llevError, "Invalid call to esrv_remove_spell"); |
2148 | return; |
1508 | return; |
2149 | } |
1509 | } |
2150 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
1510 | |
2151 | strcpy((char*)sl.buf,"delspell "); |
1511 | packet sl ("delspell"); |
2152 | sl.len=strlen((char*)sl.buf); |
1512 | |
2153 | SockList_AddInt(&sl, spell->count); |
1513 | sl << uint32 (spell->count); |
2154 | Send_With_Handling(&pl->socket, &sl); |
1514 | |
2155 | free(sl.buf); |
1515 | pl->ns->send_packet (sl); |
2156 | } |
1516 | } |
2157 | |
1517 | |
2158 | /* appends the spell *spell to the Socklist we will send the data to. */ |
1518 | /* appends the spell *spell to the Socklist we will send the data to. */ |
|
|
1519 | static void |
2159 | static void append_spell (player *pl, SockList *sl, object *spell) { |
1520 | append_spell (player *pl, packet &sl, object *spell) |
|
|
1521 | { |
2160 | int len, i, skill=0; |
1522 | int i, skill = 0; |
2161 | |
1523 | |
2162 | if (!(spell->name)) { |
1524 | if (!(spell->name)) |
|
|
1525 | { |
2163 | LOG(llevError, "item number %d is a spell with no name.\n", spell->count); |
1526 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
2164 | return; |
1527 | return; |
2165 | } |
1528 | } |
2166 | SockList_AddInt(sl, spell->count); |
1529 | |
2167 | SockList_AddShort(sl, spell->level); |
|
|
2168 | SockList_AddShort(sl, spell->casting_time); |
|
|
2169 | /* store costs and damage in the object struct, to compare to later */ |
1530 | /* store costs and damage in the object struct, to compare to later */ |
2170 | spell->last_sp = SP_level_spellpoint_cost(pl->ob, spell, SPELL_MANA); |
1531 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
2171 | spell->last_grace = SP_level_spellpoint_cost(pl->ob, spell, SPELL_GRACE); |
1532 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
2172 | spell->last_eat = spell->stats.dam+SP_level_dam_adjust(pl->ob, spell); |
1533 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
2173 | /* send the current values */ |
|
|
2174 | SockList_AddShort(sl, spell->last_sp); |
|
|
2175 | SockList_AddShort(sl, spell->last_grace); |
|
|
2176 | SockList_AddShort(sl, spell->last_eat); |
|
|
2177 | |
1534 | |
2178 | /* figure out which skill it uses, if it uses one */ |
1535 | /* figure out which skill it uses, if it uses one */ |
2179 | if (spell->skill) { |
1536 | if (spell->skill) |
|
|
1537 | { |
2180 | for (i=1; i< NUM_SKILLS; i++) |
1538 | for (i = 1; i < NUM_SKILLS; i++) |
2181 | if (!strcmp(spell->skill, skill_names[i])) { |
1539 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1540 | { |
2182 | skill = i+CS_STAT_SKILLINFO; |
1541 | skill = i + CS_STAT_SKILLINFO; |
2183 | break; |
1542 | break; |
|
|
1543 | } |
2184 | } |
1544 | } |
|
|
1545 | |
|
|
1546 | // spells better have a face |
|
|
1547 | if (!spell->face) |
2185 | } |
1548 | { |
2186 | SockList_AddChar(sl, skill); |
1549 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
2187 | |
1550 | spell->face = face_find ("burnout.x11", blank_face); |
2188 | SockList_AddInt(sl, spell->path_attuned); |
|
|
2189 | SockList_AddInt(sl, (spell->face)?spell->face->number:0); |
|
|
2190 | |
|
|
2191 | len = strlen(spell->name); |
|
|
2192 | SockList_AddChar(sl, (char)len); |
|
|
2193 | memcpy(sl->buf+sl->len, spell->name, len); |
|
|
2194 | sl->len+=len; |
|
|
2195 | |
|
|
2196 | if (!spell->msg) { |
|
|
2197 | SockList_AddShort(sl, 0); |
|
|
2198 | } |
1551 | } |
2199 | else { |
1552 | |
2200 | len = strlen(spell->msg); |
1553 | /* send the current values */ |
2201 | SockList_AddShort(sl, len); |
1554 | sl << uint32 (spell->count) |
2202 | memcpy(sl->buf+sl->len, spell->msg, len); |
1555 | << uint16 (spell->level) |
2203 | sl->len+=len; |
1556 | << uint16 (spell->casting_time) |
2204 | } |
1557 | << uint16 (spell->last_sp) |
|
|
1558 | << uint16 (spell->last_grace) |
|
|
1559 | << uint16 (spell->last_eat) |
|
|
1560 | << uint8 (skill) |
|
|
1561 | << uint32 (spell->path_attuned) |
|
|
1562 | << uint32 (spell->face) |
|
|
1563 | << data8 (spell->name) |
|
|
1564 | << data16 (spell->msg); |
2205 | } |
1565 | } |
2206 | |
1566 | |
2207 | /** |
1567 | /** |
2208 | * This tells the client to add the spell *ob, if *ob is NULL, then add |
1568 | * This tells the client to add the spell *ob, if *ob is NULL, then add |
2209 | * all spells in the player's inventory. |
1569 | * all spells in the player's inventory. |
2210 | */ |
1570 | */ |
|
|
1571 | void |
2211 | void esrv_add_spells(player *pl, object *spell) { |
1572 | esrv_add_spells (player *pl, object *spell) |
2212 | SockList sl; |
1573 | { |
2213 | if (!pl) { |
1574 | if (!pl) |
|
|
1575 | { |
2214 | LOG(llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
1576 | LOG (llevError, "esrv_add_spells, tried to add a spell to a NULL player"); |
2215 | return; |
1577 | return; |
2216 | } |
1578 | } |
2217 | if (!pl->socket.monitor_spells) return; |
1579 | |
2218 | sl.buf = (unsigned char*) malloc(MAXSOCKBUF); |
1580 | if (!pl->ns->monitor_spells) |
2219 | strcpy((char*)sl.buf,"addspell "); |
1581 | return; |
2220 | sl.len=strlen((char*)sl.buf); |
1582 | |
|
|
1583 | packet sl ("addspell"); |
|
|
1584 | |
2221 | if (!spell) { |
1585 | if (!spell) |
|
|
1586 | { |
2222 | for (spell=pl->ob->inv; spell!=NULL; spell=spell->below) { |
1587 | for (spell = pl->ob->inv; spell; spell = spell->below) |
|
|
1588 | { |
2223 | /* were we to simply keep appending data here, we could exceed |
1589 | /* were we to simply keep appending data here, we could exceed |
2224 | * MAXSOCKBUF if the player has enough spells to add, we know that |
1590 | * MAXSOCKBUF if the player has enough spells to add, we know that |
2225 | * append_spells will always append 19 data bytes, plus 4 length |
1591 | * append_spells will always append 19 data bytes, plus 4 length |
2226 | * bytes and 3 strings (because that is the spec) so we need to |
1592 | * bytes and 3 strings (because that is the spec) so we need to |
2227 | * check that the length of those 3 strings, plus the 23 bytes, |
1593 | * check that the length of those 3 strings, plus the 23 bytes, |
2228 | * won't take us over the length limit for the socket, if it does, |
1594 | * won't take us over the length limit for the socket, if it does, |
2229 | * we need to send what we already have, and restart packet formation |
1595 | * we need to send what we already have, and restart packet formation |
2230 | */ |
1596 | */ |
2231 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
1597 | /* Seeing crashes by overflowed buffers. Quick arithemetic seems |
2232 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
1598 | * to show add_spell is 26 bytes + 2 strings. However, the overun |
2233 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
1599 | * is hundreds of bytes off, so correcting 22 vs 26 doesn't seem |
2234 | * like it will fix this |
1600 | * like it will fix this |
2235 | */ |
1601 | */ |
2236 | if (spell->type != SPELL) continue; |
1602 | if (spell->type != SPELL) |
2237 | if (sl.len >= (MAXSOCKBUF - (26 + strlen(spell->name) + |
1603 | continue; |
2238 | (spell->msg?strlen(spell->msg):0)))) { |
1604 | |
2239 | Send_With_Handling(&pl->socket, &sl); |
1605 | if (sl.length () >= (MAXSOCKBUF - (26 + strlen (spell->name) + (spell->msg ? strlen (spell->msg) : 0)))) |
2240 | strcpy((char*)sl.buf,"addspell "); |
1606 | { |
2241 | sl.len=strlen((char*)sl.buf); |
1607 | pl->ns->send_packet (sl); |
|
|
1608 | |
|
|
1609 | sl.reset (); |
|
|
1610 | sl << "addspell "; |
|
|
1611 | } |
|
|
1612 | |
|
|
1613 | append_spell (pl, sl, spell); |
|
|
1614 | } |
2242 | } |
1615 | } |
|
|
1616 | else if (spell->type != SPELL) |
|
|
1617 | { |
|
|
1618 | LOG (llevError, "Asked to send a non-spell object as a spell"); |
|
|
1619 | return; |
|
|
1620 | } |
|
|
1621 | else |
2243 | append_spell(pl, &sl, spell); |
1622 | append_spell (pl, sl, spell); |
2244 | } |
1623 | |
2245 | } |
|
|
2246 | else if (spell->type != SPELL) { |
|
|
2247 | LOG(llevError, "Asked to send a non-spell object as a spell"); |
|
|
2248 | return; |
|
|
2249 | } |
|
|
2250 | else append_spell(pl, &sl, spell); |
|
|
2251 | if (sl.len >= MAXSOCKBUF) { |
1624 | if (sl.length () >= MAXSOCKBUF) |
|
|
1625 | { |
2252 | LOG(llevError,"Buffer overflow in esrv_add_spells!\n"); |
1626 | LOG (llevError, "Buffer overflow in esrv_add_spells!\n"); |
2253 | fatal(0); |
1627 | fatal (0); |
2254 | } |
1628 | } |
|
|
1629 | |
2255 | /* finally, we can send the packet */ |
1630 | /* finally, we can send the packet */ |
2256 | Send_With_Handling(&pl->socket, &sl); |
1631 | pl->ns->send_packet (sl); |
2257 | free(sl.buf); |
|
|
2258 | } |
1632 | } |
2259 | |
1633 | |