… | |
… | |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
4 | * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel |
5 | * Copyright (©) 2001,2007 Mark Wedel |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra is free software: you can redistribute it and/or modify |
8 | * Deliantra is free software: you can redistribute it and/or modify it under |
9 | * it under the terms of the GNU General Public License as published by |
9 | * the terms of the Affero GNU General Public License as published by the |
10 | * the Free Software Foundation, either version 3 of the License, or |
10 | * Free Software Foundation, either version 3 of the License, or (at your |
11 | * (at your option) any later version. |
11 | * option) any later version. |
12 | * |
12 | * |
13 | * This program is distributed in the hope that it will be useful, |
13 | * This program is distributed in the hope that it will be useful, |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
16 | * GNU General Public License for more details. |
16 | * GNU General Public License for more details. |
17 | * |
17 | * |
18 | * You should have received a copy of the GNU General Public License |
18 | * You should have received a copy of the Affero GNU General Public License |
19 | * along with this program. If not, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
|
|
24 | |
|
|
25 | //+GPL |
23 | |
26 | |
24 | /** |
27 | /** |
25 | * \file |
28 | * \file |
26 | * Client handling. |
29 | * Client handling. |
27 | * |
30 | * |
… | |
… | |
63 | * This table translates the attack numbers as used within the |
66 | * This table translates the attack numbers as used within the |
64 | * program to the value we use when sending STATS command to the |
67 | * program to the value we use when sending STATS command to the |
65 | * client. If a value is -1, then we don't send that to the |
68 | * client. If a value is -1, then we don't send that to the |
66 | * client. |
69 | * client. |
67 | */ |
70 | */ |
68 | short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
71 | static short atnr_cs_stat[NROFATTACKS] = { CS_STAT_RES_PHYS, |
69 | CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
72 | CS_STAT_RES_MAG, CS_STAT_RES_FIRE, CS_STAT_RES_ELEC, |
70 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
73 | CS_STAT_RES_COLD, CS_STAT_RES_CONF, CS_STAT_RES_ACID, |
71 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
74 | CS_STAT_RES_DRAIN, -1 /* weaponmagic */ , |
72 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
75 | CS_STAT_RES_GHOSTHIT, CS_STAT_RES_POISON, |
73 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
76 | CS_STAT_RES_SLOW, CS_STAT_RES_PARA, CS_STAT_TURN_UNDEAD, |
… | |
… | |
141 | |
144 | |
142 | static void |
145 | static void |
143 | send_map_info (player *pl) |
146 | send_map_info (player *pl) |
144 | { |
147 | { |
145 | client &socket = *pl->ns; |
148 | client &socket = *pl->ns; |
146 | object *ob = pl->observe; |
149 | object *ob = pl->viewpoint; |
147 | |
150 | |
148 | if (socket.mapinfocmd) |
151 | if (socket.mapinfocmd) |
149 | { |
152 | { |
150 | if (ob->map && ob->map->path[0]) |
153 | if (ob->map && ob->map->path[0]) |
151 | { |
154 | { |
… | |
… | |
168 | /** check for map/region change and send new map data */ |
171 | /** check for map/region change and send new map data */ |
169 | static void |
172 | static void |
170 | check_map_change (player *pl) |
173 | check_map_change (player *pl) |
171 | { |
174 | { |
172 | client &socket = *pl->ns; |
175 | client &socket = *pl->ns; |
173 | object *ob = pl->observe; |
176 | object *ob = pl->viewpoint; |
174 | |
177 | |
175 | region *reg = ob->region (); |
178 | region *reg = ob->region (); |
176 | if (socket.current_region != reg) |
179 | if (socket.current_region != reg) |
177 | { |
180 | { |
178 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
181 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
… | |
… | |
214 | socket.floorbox_reset (); |
217 | socket.floorbox_reset (); |
215 | } |
218 | } |
216 | |
219 | |
217 | socket.current_x = ob->x; |
220 | socket.current_x = ob->x; |
218 | socket.current_y = ob->y; |
221 | socket.current_y = ob->y; |
|
|
222 | } |
|
|
223 | |
|
|
224 | /** |
|
|
225 | * This sends the skill number to name mapping. We ignore |
|
|
226 | * the params - we always send the same info no matter what. |
|
|
227 | */ |
|
|
228 | void |
|
|
229 | send_skill_info (client *ns, char *params) |
|
|
230 | { |
|
|
231 | packet sl; |
|
|
232 | sl << "replyinfo skill_info\n"; |
|
|
233 | |
|
|
234 | for (int i = 1; i < NUM_SKILLS; i++) |
|
|
235 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]); |
|
|
236 | |
|
|
237 | if (sl.length () > MAXSOCKBUF) |
|
|
238 | { |
|
|
239 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
|
|
240 | fatal (0); |
|
|
241 | } |
|
|
242 | |
|
|
243 | ns->send_packet (sl); |
|
|
244 | } |
|
|
245 | |
|
|
246 | /** |
|
|
247 | * This sends the spell path to name mapping. We ignore |
|
|
248 | * the params - we always send the same info no matter what. |
|
|
249 | */ |
|
|
250 | void |
|
|
251 | send_spell_paths (client * ns, char *params) |
|
|
252 | { |
|
|
253 | packet sl; |
|
|
254 | |
|
|
255 | sl << "replyinfo spell_paths\n"; |
|
|
256 | |
|
|
257 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
258 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
259 | |
|
|
260 | if (sl.length () > MAXSOCKBUF) |
|
|
261 | { |
|
|
262 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
263 | fatal (0); |
|
|
264 | } |
|
|
265 | |
|
|
266 | ns->send_packet (sl); |
219 | } |
267 | } |
220 | |
268 | |
221 | /** |
269 | /** |
222 | * RequestInfo is sort of a meta command. There is some specific |
270 | * RequestInfo is sort of a meta command. There is some specific |
223 | * request of information, but we call other functions to provide |
271 | * request of information, but we call other functions to provide |
… | |
… | |
236 | { |
284 | { |
237 | *params++ = 0; |
285 | *params++ = 0; |
238 | break; |
286 | break; |
239 | } |
287 | } |
240 | |
288 | |
241 | if (!strcmp (buf, "image_info")) |
|
|
242 | send_image_info (ns, params); |
|
|
243 | else if (!strcmp (buf, "image_sums")) |
|
|
244 | send_image_sums (ns, params); |
|
|
245 | else if (!strcmp (buf, "skill_info")) |
289 | if (!strcmp (buf, "skill_info")) |
246 | send_skill_info (ns, params); |
290 | send_skill_info (ns, params); |
247 | else if (!strcmp (buf, "spell_paths")) |
291 | else if (!strcmp (buf, "spell_paths")) |
248 | send_spell_paths (ns, params); |
292 | send_spell_paths (ns, params); |
249 | else |
293 | else |
250 | { |
294 | { |
… | |
… | |
266 | ExtiCmd (char *buf, int len, client *ns) |
310 | ExtiCmd (char *buf, int len, client *ns) |
267 | { |
311 | { |
268 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
312 | INVOKE_CLIENT (EXTICMD, ns, ARG_DATA (buf, len)); |
269 | } |
313 | } |
270 | |
314 | |
|
|
315 | //-GPL |
|
|
316 | |
271 | void |
317 | void |
272 | client::mapinfo_queue_clear () |
318 | client::mapinfo_queue_clear () |
273 | { |
319 | { |
274 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
320 | for (auto (i, mapinfo_queue.begin ()); i != mapinfo_queue.end (); ++i) |
275 | free (*i); |
321 | free (*i); |
… | |
… | |
282 | { |
328 | { |
283 | char *token = buf; |
329 | char *token = buf; |
284 | buf += strlen (buf) + 9; |
330 | buf += strlen (buf) + 9; |
285 | |
331 | |
286 | // initial map and its origin |
332 | // initial map and its origin |
287 | maptile *map = pl->observe->map; |
333 | maptile *map = pl->viewpoint->map; |
288 | int mapx = pl->ns->mapx / 2 - pl->observe->x; |
334 | int mapx = pl->ns->mapx / 2 - pl->viewpoint->x; |
289 | int mapy = pl->ns->mapy / 2 - pl->observe->y; |
335 | int mapy = pl->ns->mapy / 2 - pl->viewpoint->y; |
290 | int max_distance = 8; // limit maximum path length to something generous |
336 | int max_distance = 8; // limit maximum path length to something generous |
291 | |
337 | |
292 | while (*buf && map && max_distance) |
338 | while (*buf && map && max_distance) |
293 | { |
339 | { |
294 | int dir = *buf++ - '1'; |
340 | int dir = *buf++ - '1'; |
… | |
… | |
399 | AddMeCmd (char *buf, int len, client *ns) |
445 | AddMeCmd (char *buf, int len, client *ns) |
400 | { |
446 | { |
401 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
447 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
402 | } |
448 | } |
403 | |
449 | |
|
|
450 | //+GPL |
|
|
451 | |
404 | /* |
452 | /* |
405 | #define MSG_TYPE_BOOK 1 |
453 | #define MSG_TYPE_BOOK 1 |
406 | #define MSG_TYPE_CARD 2 |
454 | #define MSG_TYPE_CARD 2 |
407 | #define MSG_TYPE_PAPER 3 |
455 | #define MSG_TYPE_PAPER 3 |
408 | #define MSG_TYPE_SIGN 4 |
456 | #define MSG_TYPE_SIGN 4 |
… | |
… | |
424 | while (1) |
472 | while (1) |
425 | { |
473 | { |
426 | /* 1. Extract an info */ |
474 | /* 1. Extract an info */ |
427 | info = nextinfo; |
475 | info = nextinfo; |
428 | |
476 | |
429 | while ((info < len) && (buf[info] == ' ')) |
477 | while ((info < len) && (buf [info] == ' ')) |
430 | info++; |
478 | info++; |
431 | |
479 | |
432 | if (info >= len) |
480 | if (info >= len) |
433 | break; |
481 | break; |
434 | |
482 | |
435 | nextinfo = info + 1; |
483 | nextinfo = info + 1; |
436 | |
484 | |
437 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
485 | while ((nextinfo < len) && (buf [nextinfo] != ' ')) |
438 | nextinfo++; |
486 | nextinfo++; |
439 | |
487 | |
440 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
488 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
441 | continue; |
489 | continue; |
442 | |
490 | |
443 | strncpy (command, &(buf[info]), nextinfo - info); |
491 | memcpy (command, buf + info, nextinfo - info); |
444 | command[nextinfo - info] = '\0'; |
492 | command [nextinfo - info] = 0; |
|
|
493 | |
445 | /* 2. Interpret info */ |
494 | /* 2. Interpret info */ |
446 | i = sscanf (command, "%d", &flag); |
495 | i = sscanf (command, "%d", &flag); |
447 | |
496 | |
448 | if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
497 | if ((i == 1) && (flag > 0) && (flag <= MSG_TYPE_LAST)) |
449 | ns->supported_readables |= (1 << flag); |
498 | ns->supported_readables |= (1 << flag); |
… | |
… | |
483 | return; |
532 | return; |
484 | |
533 | |
485 | buf++; |
534 | buf++; |
486 | } |
535 | } |
487 | |
536 | |
488 | execute_newserver_command (pl->ob, (char *) buf); |
537 | execute_newserver_command (pl->ob, (char *)buf); |
489 | |
538 | |
490 | /* Perhaps something better should be done with a left over count. |
539 | /* Perhaps something better should be done with a left over count. |
491 | * Cleaning up the input should probably be done first - all actions |
540 | * Cleaning up the input should probably be done first - all actions |
492 | * for the command that issued the count should be done before any other |
541 | * for the command that issued the count should be done before any other |
493 | * commands. |
542 | * commands. |
… | |
… | |
685 | * Get player's current range attack in obuf. |
734 | * Get player's current range attack in obuf. |
686 | */ |
735 | */ |
687 | static void |
736 | static void |
688 | rangetostring (player *pl, char *obuf) |
737 | rangetostring (player *pl, char *obuf) |
689 | { |
738 | { |
690 | dynbuf_text buf; |
739 | dynbuf_text &buf = msg_dynbuf; buf.clear (); |
691 | |
740 | |
692 | if (pl->ranged_ob) |
741 | if (pl->ranged_ob) |
693 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
742 | buf << " Range" << (pl->ob->current_weapon == pl->ranged_ob ? "*" : "") << ": " << pl->ranged_ob->name; |
694 | |
743 | |
695 | if (pl->combat_ob) |
744 | if (pl->combat_ob) |
… | |
… | |
926 | |
975 | |
927 | /* Nothing changed */ |
976 | /* Nothing changed */ |
928 | return 0; |
977 | return 0; |
929 | } |
978 | } |
930 | |
979 | |
|
|
980 | //-GPL |
|
|
981 | |
931 | // prefetch (and touch) all maps within a specific distancd |
982 | // prefetch (and touch) all maps within a specific distancd |
932 | static void |
983 | static void |
933 | prefetch_surrounding_maps (maptile *map, int distance) |
984 | prefetch_surrounding_maps (maptile *map, int distance) |
934 | { |
985 | { |
935 | map->last_access = runtime; |
986 | map->touch (); |
936 | |
987 | |
937 | if (--distance) |
988 | if (--distance) |
938 | for (int dir = 4; --dir; ) |
989 | for (int dir = 4; --dir; ) |
939 | if (const shstr &path = map->tile_path [dir]) |
990 | if (const shstr &path = map->tile_path [dir]) |
940 | if (maptile *&neigh = map->tile_map [dir]) |
991 | if (maptile *&neigh = map->tile_map [dir]) |
… | |
… | |
948 | prefetch_surrounding_maps (object *op) |
999 | prefetch_surrounding_maps (object *op) |
949 | { |
1000 | { |
950 | prefetch_surrounding_maps (op->map, 3); |
1001 | prefetch_surrounding_maps (op->map, 3); |
951 | } |
1002 | } |
952 | |
1003 | |
|
|
1004 | //+GPL |
|
|
1005 | |
953 | /** |
1006 | /** |
954 | * Draws client map. |
1007 | * Draws client map. |
955 | */ |
1008 | */ |
956 | void |
1009 | void |
957 | draw_client_map (player *pl) |
1010 | draw_client_map (player *pl) |
958 | { |
1011 | { |
959 | object *ob = pl->observe; |
1012 | object *ob = pl->viewpoint; |
960 | if (!ob->active) |
1013 | if (!pl->observe->active) |
961 | return; |
1014 | return; |
962 | |
1015 | |
963 | /* If player is just joining the game, he isn't here yet, so the map |
1016 | /* If player is just joining the game, he isn't here yet, so the map |
964 | * can get swapped out. If so, don't try to send them a map. All will |
1017 | * can get swapped out. If so, don't try to send them a map. All will |
965 | * be OK once they really log in. |
1018 | * be OK once they really log in. |
… | |
… | |
972 | check_map_change (pl); |
1025 | check_map_change (pl); |
973 | prefetch_surrounding_maps (pl->ob); |
1026 | prefetch_surrounding_maps (pl->ob); |
974 | |
1027 | |
975 | /* do LOS after calls to update_position */ |
1028 | /* do LOS after calls to update_position */ |
976 | /* unfortunately, we need to udpate los when observing, currently */ |
1029 | /* unfortunately, we need to udpate los when observing, currently */ |
977 | if (pl->do_los || pl->observe != pl->ob) |
1030 | if (pl->do_los || pl->viewpoint != pl->ob) |
978 | { |
1031 | { |
979 | pl->do_los = 0; |
1032 | pl->do_los = 0; |
980 | pl->update_los (); |
1033 | pl->update_los (); |
981 | } |
1034 | } |
982 | |
1035 | |
… | |
… | |
1081 | /* Darkness changed */ |
1134 | /* Darkness changed */ |
1082 | if (lastcell.count != d) |
1135 | if (lastcell.count != d) |
1083 | { |
1136 | { |
1084 | mask |= 0x8; |
1137 | mask |= 0x8; |
1085 | |
1138 | |
1086 | if (socket.extmap) |
1139 | *last_ext |= 0x80; |
|
|
1140 | last_ext = &sl[sl.length ()]; |
|
|
1141 | sl << uint8 (d); |
|
|
1142 | } |
|
|
1143 | |
|
|
1144 | lastcell.count = d; |
|
|
1145 | |
|
|
1146 | mapspace &ms = m->at (nx, ny); |
|
|
1147 | ms.update (); |
|
|
1148 | |
|
|
1149 | // extmap handling |
|
|
1150 | uint8 stat_hp = 0; |
|
|
1151 | uint8 stat_width = 0; |
|
|
1152 | uint8 flags = 0; |
|
|
1153 | tag_t player = 0; |
|
|
1154 | |
|
|
1155 | // send hp information, if applicable |
|
|
1156 | if (object *op = ms.faces_obj [0]) |
|
|
1157 | if (op->is_head () && !op->invisible) |
|
|
1158 | { |
|
|
1159 | if (op->stats.maxhp > op->stats.hp |
|
|
1160 | && op->stats.maxhp > 0 |
|
|
1161 | && (op->type == PLAYER |
|
|
1162 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1163 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1164 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1165 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
|
|
1166 | { |
|
|
1167 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1168 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1169 | } |
|
|
1170 | |
|
|
1171 | if (expect_false (op->has_dialogue ())) |
|
|
1172 | flags |= 1; |
|
|
1173 | |
|
|
1174 | if (expect_false (op->type == PLAYER)) |
|
|
1175 | player = op == ob ? pl->ob->count |
|
|
1176 | : op == pl->ob ? ob->count |
|
|
1177 | : op->count; |
|
|
1178 | } |
|
|
1179 | |
|
|
1180 | if (expect_false (lastcell.stat_hp != stat_hp)) |
|
|
1181 | { |
|
|
1182 | lastcell.stat_hp = stat_hp; |
|
|
1183 | |
|
|
1184 | mask |= 0x8; |
|
|
1185 | *last_ext |= 0x80; |
|
|
1186 | last_ext = &sl[sl.length ()]; |
|
|
1187 | |
|
|
1188 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1189 | |
|
|
1190 | if (stat_width > 1) |
1087 | { |
1191 | { |
1088 | *last_ext |= 0x80; |
1192 | *last_ext |= 0x80; |
1089 | last_ext = &sl[sl.length ()]; |
1193 | last_ext = &sl[sl.length ()]; |
1090 | sl << uint8 (d); |
|
|
1091 | } |
|
|
1092 | else |
|
|
1093 | sl << uint8 (255 - 64 * d); |
|
|
1094 | } |
|
|
1095 | |
1194 | |
1096 | lastcell.count = d; |
|
|
1097 | |
|
|
1098 | mapspace &ms = m->at (nx, ny); |
|
|
1099 | ms.update (); |
|
|
1100 | |
|
|
1101 | if (expect_true (socket.extmap)) |
|
|
1102 | { |
|
|
1103 | uint8 stat_hp = 0; |
|
|
1104 | uint8 stat_width = 0; |
|
|
1105 | uint8 flags = 0; |
|
|
1106 | tag_t player = 0; |
|
|
1107 | |
|
|
1108 | // send hp information, if applicable |
|
|
1109 | if (object *op = ms.faces_obj [0]) |
|
|
1110 | if (op->is_head () && !op->invisible) |
|
|
1111 | { |
|
|
1112 | if (op->stats.maxhp > op->stats.hp |
|
|
1113 | && op->stats.maxhp > 0 |
|
|
1114 | && (op->type == PLAYER |
|
|
1115 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1116 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1117 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1118 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
|
|
1119 | { |
|
|
1120 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1121 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1122 | } |
|
|
1123 | |
|
|
1124 | if (expect_false (op->has_dialogue ())) |
|
|
1125 | flags |= 1; |
|
|
1126 | |
|
|
1127 | if (expect_false (op->type == PLAYER)) |
|
|
1128 | player = op == ob ? pl->ob->count |
|
|
1129 | : op == pl->ob ? ob->count |
|
|
1130 | : op->count; |
|
|
1131 | } |
|
|
1132 | |
|
|
1133 | if (expect_false (lastcell.stat_hp != stat_hp)) |
|
|
1134 | { |
|
|
1135 | lastcell.stat_hp = stat_hp; |
|
|
1136 | |
|
|
1137 | mask |= 0x8; |
|
|
1138 | *last_ext |= 0x80; |
|
|
1139 | last_ext = &sl[sl.length ()]; |
|
|
1140 | |
|
|
1141 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1142 | |
|
|
1143 | if (stat_width > 1) |
|
|
1144 | { |
|
|
1145 | *last_ext |= 0x80; |
|
|
1146 | last_ext = &sl[sl.length ()]; |
|
|
1147 | |
|
|
1148 | sl << uint8 (6) << uint8 (stat_width); |
1195 | sl << uint8 (6) << uint8 (stat_width); |
1149 | } |
|
|
1150 | } |
|
|
1151 | |
|
|
1152 | if (expect_false (lastcell.player != player)) |
|
|
1153 | { |
|
|
1154 | lastcell.player = player; |
|
|
1155 | |
|
|
1156 | mask |= 0x8; |
|
|
1157 | *last_ext |= 0x80; |
|
|
1158 | last_ext = &sl[sl.length ()]; |
|
|
1159 | |
|
|
1160 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1161 | } |
|
|
1162 | |
|
|
1163 | if (expect_false (lastcell.flags != flags)) |
|
|
1164 | { |
|
|
1165 | lastcell.flags = flags; |
|
|
1166 | |
|
|
1167 | mask |= 0x8; |
|
|
1168 | *last_ext |= 0x80; |
|
|
1169 | last_ext = &sl[sl.length ()]; |
|
|
1170 | |
|
|
1171 | sl << uint8 (8) << uint8 (flags); |
|
|
1172 | } |
1196 | } |
1173 | } |
1197 | } |
|
|
1198 | |
|
|
1199 | if (expect_false (lastcell.player != player)) |
|
|
1200 | { |
|
|
1201 | lastcell.player = player; |
|
|
1202 | |
|
|
1203 | mask |= 0x8; |
|
|
1204 | *last_ext |= 0x80; |
|
|
1205 | last_ext = &sl[sl.length ()]; |
|
|
1206 | |
|
|
1207 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1208 | } |
|
|
1209 | |
|
|
1210 | if (expect_false (lastcell.flags != flags)) |
|
|
1211 | { |
|
|
1212 | lastcell.flags = flags; |
|
|
1213 | |
|
|
1214 | mask |= 0x8; |
|
|
1215 | *last_ext |= 0x80; |
|
|
1216 | last_ext = &sl[sl.length ()]; |
|
|
1217 | |
|
|
1218 | sl << uint8 (8) << uint8 (flags); |
|
|
1219 | } |
|
|
1220 | |
|
|
1221 | // faces |
1174 | |
1222 | |
1175 | /* Floor face */ |
1223 | /* Floor face */ |
1176 | if (update_space (sl, socket, ms, lastcell, 2)) |
1224 | if (update_space (sl, socket, ms, lastcell, 2)) |
1177 | mask |= 0x4; |
1225 | mask |= 0x4; |
1178 | |
1226 | |
… | |
… | |
1227 | /*****************************************************************************/ |
1275 | /*****************************************************************************/ |
1228 | void |
1276 | void |
1229 | send_plugin_custom_message (object *pl, char *buf) |
1277 | send_plugin_custom_message (object *pl, char *buf) |
1230 | { |
1278 | { |
1231 | pl->contr->ns->send_packet (buf); |
1279 | pl->contr->ns->send_packet (buf); |
1232 | } |
|
|
1233 | |
|
|
1234 | /** |
|
|
1235 | * This sends the skill number to name mapping. We ignore |
|
|
1236 | * the params - we always send the same info no matter what. |
|
|
1237 | */ |
|
|
1238 | void |
|
|
1239 | send_skill_info (client *ns, char *params) |
|
|
1240 | { |
|
|
1241 | packet sl; |
|
|
1242 | sl << "replyinfo skill_info\n"; |
|
|
1243 | |
|
|
1244 | for (int i = 1; i < NUM_SKILLS; i++) |
|
|
1245 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]); |
|
|
1246 | |
|
|
1247 | if (sl.length () > MAXSOCKBUF) |
|
|
1248 | { |
|
|
1249 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
|
|
1250 | fatal (0); |
|
|
1251 | } |
|
|
1252 | |
|
|
1253 | ns->send_packet (sl); |
|
|
1254 | } |
|
|
1255 | |
|
|
1256 | /** |
|
|
1257 | * This sends the spell path to name mapping. We ignore |
|
|
1258 | * the params - we always send the same info no matter what. |
|
|
1259 | */ |
|
|
1260 | void |
|
|
1261 | send_spell_paths (client * ns, char *params) |
|
|
1262 | { |
|
|
1263 | packet sl; |
|
|
1264 | |
|
|
1265 | sl << "replyinfo spell_paths\n"; |
|
|
1266 | |
|
|
1267 | for (int i = 0; i < NRSPELLPATHS; i++) |
|
|
1268 | sl.printf ("%d:%s\n", 1 << i, spellpathnames[i]); |
|
|
1269 | |
|
|
1270 | if (sl.length () > MAXSOCKBUF) |
|
|
1271 | { |
|
|
1272 | LOG (llevError, "Buffer overflow in send_spell_paths!\n"); |
|
|
1273 | fatal (0); |
|
|
1274 | } |
|
|
1275 | |
|
|
1276 | ns->send_packet (sl); |
|
|
1277 | } |
1280 | } |
1278 | |
1281 | |
1279 | /** |
1282 | /** |
1280 | * This looks for any spells the player may have that have changed their stats. |
1283 | * This looks for any spells the player may have that have changed their stats. |
1281 | * it then sends an updspell packet for each spell that has changed in this way |
1284 | * it then sends an updspell packet for each spell that has changed in this way |
… | |
… | |
1463 | /* finally, we can send the packet */ |
1466 | /* finally, we can send the packet */ |
1464 | pl->ns->flush_fx (); |
1467 | pl->ns->flush_fx (); |
1465 | pl->ns->send_packet (sl); |
1468 | pl->ns->send_packet (sl); |
1466 | } |
1469 | } |
1467 | |
1470 | |
|
|
1471 | //-GPL |
|
|
1472 | |