1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 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 |
9 | * it under the terms of the GNU General Public License as published by |
9 | * it under the terms of the GNU General Public License as published by |
… | |
… | |
141 | pl->ns->send_packet ("newmap"); |
141 | pl->ns->send_packet ("newmap"); |
142 | |
142 | |
143 | pl->ns->floorbox_reset (); |
143 | pl->ns->floorbox_reset (); |
144 | } |
144 | } |
145 | |
145 | |
|
|
146 | static void |
|
|
147 | send_map_info (player *pl) |
|
|
148 | { |
|
|
149 | client &socket = *pl->ns; |
|
|
150 | object *ob = pl->observe; |
|
|
151 | |
|
|
152 | if (socket.mapinfocmd) |
|
|
153 | { |
|
|
154 | if (ob->map && ob->map->path[0]) |
|
|
155 | { |
|
|
156 | int flags = 0; |
|
|
157 | |
|
|
158 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
159 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
160 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
161 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
162 | |
|
|
163 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
164 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
165 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
166 | } |
|
|
167 | else |
|
|
168 | socket.send_packet ("mapinfo current"); |
|
|
169 | } |
|
|
170 | } |
|
|
171 | |
146 | /** check for map/region change and send new map data */ |
172 | /** check for map/region change and send new map data */ |
147 | static void |
173 | static void |
148 | check_map_change (player *pl) |
174 | check_map_change (player *pl) |
149 | { |
175 | { |
150 | client &socket = *pl->ns; |
176 | client &socket = *pl->ns; |
151 | object *ob = pl->observe; |
177 | object *ob = pl->observe; |
152 | |
178 | |
|
|
179 | region *reg = ob->region (); |
|
|
180 | if (socket.current_region != reg) |
|
|
181 | { |
|
|
182 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
183 | socket.current_region = reg; |
|
|
184 | } |
|
|
185 | |
|
|
186 | // first try to aovid a full newmap on tiled map scrolls |
|
|
187 | if (socket.current_map != ob->map && !socket.force_newmap) |
|
|
188 | { |
|
|
189 | rv_vector rv; |
|
|
190 | |
|
|
191 | get_rangevector_from_mapcoord (socket.current_map, socket.current_x, socket.current_y, ob, &rv, 0); |
|
|
192 | |
|
|
193 | // manhattan distance is very handy here |
|
|
194 | if (rv.distance < 8) // 8 works nicely for speed << 70 and buggy gcfclient |
|
|
195 | { |
|
|
196 | socket.current_map = ob->map; |
|
|
197 | socket.current_x = ob->x; |
|
|
198 | socket.current_y = ob->y; |
|
|
199 | |
|
|
200 | socket_map_scroll (&socket, rv.distance_x, rv.distance_y); |
|
|
201 | socket.floorbox_reset (); |
|
|
202 | send_map_info (pl); |
|
|
203 | } |
|
|
204 | } |
|
|
205 | |
153 | if (socket.current_map != ob->map || socket.force_newmap) |
206 | if (socket.current_map != ob->map || socket.force_newmap) |
154 | { |
207 | { |
155 | clear_map (pl); |
208 | clear_map (pl); |
156 | socket.current_map = ob->map; |
209 | socket.current_map = ob->map; |
157 | |
210 | send_map_info (pl); |
158 | if (socket.mapinfocmd) |
|
|
159 | { |
|
|
160 | if (ob->map && ob->map->path[0]) |
|
|
161 | { |
|
|
162 | int flags = 0; |
|
|
163 | |
|
|
164 | if (ob->map->tile_path[0]) flags |= 1; |
|
|
165 | if (ob->map->tile_path[1]) flags |= 2; |
|
|
166 | if (ob->map->tile_path[2]) flags |= 4; |
|
|
167 | if (ob->map->tile_path[3]) flags |= 8; |
|
|
168 | |
|
|
169 | socket.send_packet_printf ("mapinfo - spatial %d %d %d %d %d %s", |
|
|
170 | flags, socket.mapx / 2 - ob->x, socket.mapy / 2 - ob->y, |
|
|
171 | ob->map->width, ob->map->height, &ob->map->path); |
|
|
172 | } |
|
|
173 | else |
|
|
174 | socket.send_packet ("mapinfo current"); |
|
|
175 | } |
|
|
176 | } |
211 | } |
177 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
212 | else if (socket.current_x != ob->x || socket.current_y != ob->y) |
178 | { |
213 | { |
179 | int dx = ob->x - socket.current_x; |
214 | int dx = ob->x - socket.current_x; |
180 | int dy = ob->y - socket.current_y; |
215 | int dy = ob->y - socket.current_y; |
… | |
… | |
188 | } |
223 | } |
189 | } |
224 | } |
190 | |
225 | |
191 | socket.current_x = ob->x; |
226 | socket.current_x = ob->x; |
192 | socket.current_y = ob->y; |
227 | socket.current_y = ob->y; |
193 | |
|
|
194 | region *reg = ob->region (); |
|
|
195 | if (socket.current_region != reg) |
|
|
196 | { |
|
|
197 | INVOKE_PLAYER (REGION_CHANGE, pl, ARG_REGION (reg), ARG_REGION (socket.current_region)); |
|
|
198 | socket.current_region = reg; |
|
|
199 | } |
|
|
200 | } |
228 | } |
201 | |
229 | |
202 | /** |
230 | /** |
203 | * RequestInfo is sort of a meta command. There is some specific |
231 | * RequestInfo is sort of a meta command. There is some specific |
204 | * request of information, but we call other functions to provide |
232 | * request of information, but we call other functions to provide |
… | |
… | |
686 | * syntax is: move (to) (tag) (nrof) |
714 | * syntax is: move (to) (tag) (nrof) |
687 | */ |
715 | */ |
688 | void |
716 | void |
689 | MoveCmd (char *buf, int len, player *pl) |
717 | MoveCmd (char *buf, int len, player *pl) |
690 | { |
718 | { |
691 | int vals[3], i; |
719 | int to, tag, nrof; |
692 | |
720 | |
693 | /* A little funky here. We only cycle for 2 records, because |
721 | if (3 != sscanf (buf, "%d %d %d", &to, &tag, &nrof)) |
694 | * we obviously are not going to find a space after the third |
|
|
695 | * record. Perhaps we should just replace this with a |
|
|
696 | * sscanf? |
|
|
697 | */ |
|
|
698 | for (i = 0; i < 2; i++) |
|
|
699 | { |
722 | { |
700 | vals[i] = atoi (buf); |
|
|
701 | |
|
|
702 | if (!(buf = strchr (buf, ' '))) |
|
|
703 | { |
|
|
704 | LOG (llevError, "Incomplete move command: %s\n", buf); |
723 | LOG (llevError, "Incomplete move command: %s\n", buf); |
705 | return; |
724 | return; |
706 | } |
|
|
707 | |
|
|
708 | buf++; |
|
|
709 | } |
725 | } |
710 | |
726 | |
711 | vals[2] = atoi (buf); |
727 | esrv_move_object (pl->ob, to, tag, nrof); |
712 | |
|
|
713 | /* LOG(llevDebug,"Move item %d (nrof=%d) to %d.\n", vals[1], vals[2], vals[0]);*/ |
|
|
714 | esrv_move_object (pl->ob, vals[0], vals[1], vals[2]); |
|
|
715 | } |
728 | } |
716 | |
729 | |
717 | /****************************************************************************** |
730 | /****************************************************************************** |
718 | * |
731 | * |
719 | * Start of commands the server sends to the client. |
732 | * Start of commands the server sends to the client. |
… | |
… | |
820 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
833 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
821 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
834 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
822 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
835 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
823 | |
836 | |
824 | for (int s = 0; s < NUM_SKILLS; s++) |
837 | for (int s = 0; s < NUM_SKILLS; s++) |
825 | if (object *skill = opl->last_skill_ob[s]) |
838 | if (object *skill = opl->last_skill_ob [s]) |
826 | if (skill->stats.exp != ns->last_skill_exp [s]) |
839 | if (skill->stats.exp != ns->last_skill_exp [s]) |
827 | { |
840 | { |
828 | ns->last_skill_exp [s] = skill->stats.exp; |
841 | ns->last_skill_exp [s] = skill->stats.exp; |
829 | |
842 | |
830 | /* Always send along the level if exp changes. This is only |
843 | /* Always send along the level if exp changes. This is only |
… | |
… | |
886 | |
899 | |
887 | /** |
900 | /** |
888 | * Tells the client that here is a player it should start using. |
901 | * Tells the client that here is a player it should start using. |
889 | */ |
902 | */ |
890 | void |
903 | void |
891 | esrv_new_player (player *pl, uint32 weight) |
904 | esrv_new_player (player *pl) |
892 | { |
905 | { |
|
|
906 | sint32 weight = pl->ob->client_weight (); |
|
|
907 | |
893 | packet sl ("player"); |
908 | packet sl ("player"); |
894 | |
909 | |
895 | sl << uint32 (pl->ob->count) |
910 | sl << uint32 (pl->ob->count) |
896 | << uint32 (weight) |
911 | << uint32 (weight) |
897 | << uint32 (pl->ob->face) |
912 | << uint32 (pl->ob->face) |
898 | << data8 (pl->ob->name); |
913 | << data8 (pl->ob->name); |
899 | |
914 | |
900 | pl->ns->last_weight = weight; |
915 | pl->ns->last_weight = weight; |
901 | pl->ns->send_packet (sl); |
916 | pl->ns->send_packet (sl); |
902 | SET_FLAG (pl->ob, FLAG_CLIENT_SENT); |
|
|
903 | } |
917 | } |
904 | |
918 | |
905 | /****************************************************************************** |
919 | /****************************************************************************** |
906 | * |
920 | * |
907 | * Start of map related commands. |
921 | * Start of map related commands. |
… | |
… | |
1025 | { |
1039 | { |
1026 | object *ob = pl->observe; |
1040 | object *ob = pl->observe; |
1027 | if (!ob->active) |
1041 | if (!ob->active) |
1028 | return; |
1042 | return; |
1029 | |
1043 | |
1030 | maptile *plmap = ob->map; |
|
|
1031 | |
|
|
1032 | /* If player is just joining the game, he isn't here yet, so the map |
1044 | /* If player is just joining the game, he isn't here yet, so the map |
1033 | * can get swapped out. If so, don't try to send them a map. All will |
1045 | * can get swapped out. If so, don't try to send them a map. All will |
1034 | * be OK once they really log in. |
1046 | * be OK once they really log in. |
1035 | */ |
1047 | */ |
1036 | if (!plmap || plmap->in_memory != MAP_ACTIVE) |
1048 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
1037 | return; |
1049 | return; |
1038 | |
1050 | |
1039 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
1051 | int startlen, oldlen; |
1040 | int estartlen, eoldlen; |
1052 | int estartlen, eoldlen; |
1041 | uint8 eentrysize; |
1053 | uint8 eentrysize; |
1042 | uint16 ewhatstart, ewhatflag; |
1054 | uint16 ewhatstart, ewhatflag; |
1043 | uint8 extendedinfos; |
1055 | uint8 extendedinfos; |
1044 | |
1056 | |
… | |
… | |
1101 | << uint8 (eentrysize); |
1113 | << uint8 (eentrysize); |
1102 | |
1114 | |
1103 | estartlen = esl.length (); |
1115 | estartlen = esl.length (); |
1104 | } |
1116 | } |
1105 | |
1117 | |
1106 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1107 | * locations. |
|
|
1108 | */ |
|
|
1109 | ay = 0; |
|
|
1110 | |
|
|
1111 | /* We could do this logic as conditionals in the if statement, |
1118 | /* We could do this logic as conditionals in the if statement, |
1112 | * but that started to get a bit messy to look at. |
1119 | * but that started to get a bit messy to look at. |
1113 | */ |
1120 | */ |
1114 | max_x = ob->x + (socket.mapx + 1) / 2; |
1121 | int hx = socket.mapx / 2; |
1115 | max_y = ob->y + (socket.mapy + 1) / 2; |
1122 | int hy = socket.mapy / 2; |
1116 | |
1123 | |
1117 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
1124 | for (int dx = -hx; dx <= hx; dx++) |
1118 | { |
1125 | { |
1119 | sint16 nx, ny; |
1126 | sint16 nx, ny; |
1120 | maptile *m = 0; |
1127 | maptile *m = 0; |
1121 | |
1128 | |
1122 | ax = 0; |
1129 | for (int dy = -hy; dy <= hy; dy++) |
1123 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
|
|
1124 | { |
1130 | { |
1125 | // check to see if we can simply go one right quickly |
1131 | // check to see if we can simply go one down quickly |
1126 | ++nx; |
|
|
1127 | if (m && nx >= m->width) |
1132 | if (m && ++ny >= m->height) |
1128 | m = 0; |
1133 | m = 0; |
1129 | |
1134 | |
|
|
1135 | // no, so do it the slow way |
1130 | if (!m) |
1136 | if (!m) |
1131 | { |
1137 | { |
1132 | nx = x; ny = y; m = plmap; |
1138 | nx = ob->x + dx; ny = ob->y + dy; m = ob->map; |
1133 | |
1139 | |
1134 | if (xy_normalise (m, nx, ny)) |
1140 | if (xy_normalise (m, nx, ny)) |
1135 | m->touch (); |
1141 | m->touch (); |
1136 | else |
1142 | else |
1137 | m = 0; |
1143 | m = 0; |
1138 | } |
1144 | } |
1139 | |
1145 | |
|
|
1146 | int ax = dx + hx; |
|
|
1147 | int ay = dy + hy; |
|
|
1148 | |
1140 | int emask, mask; |
1149 | int emask, mask; |
1141 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1150 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
1142 | |
1151 | |
1143 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1152 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1144 | |
1153 | |
1145 | /* If the coordinates are not valid, or it is too dark to see, |
1154 | /* If the coordinates are not valid, or it is too dark to see, |
1146 | * we tell the client as such |
1155 | * we tell the client as such |
1147 | */ |
1156 | */ |
1148 | if (!m) |
1157 | if (!m) |
1149 | { |
1158 | { |
1150 | /* space is out of map. Update space and clear values |
1159 | /* space is out of map. Update space and clear values |
1151 | * if this hasn't already been done. If the space is out |
1160 | * if this hasn't already been done. If the space is out |
1152 | * of the map, it shouldn't have a head |
1161 | * of the map, it shouldn't have a head. |
1153 | */ |
1162 | */ |
1154 | if (lastcell.count != -1) |
1163 | if (lastcell.count != -1) |
1155 | { |
1164 | { |
1156 | sl << uint16 (mask); |
1165 | sl << uint16 (mask); |
1157 | map_clearcell (&lastcell, -1); |
1166 | map_clearcell (&lastcell, -1); |
1158 | } |
1167 | } |
1159 | |
1168 | |
1160 | continue; |
1169 | continue; |
1161 | } |
1170 | } |
1162 | |
1171 | |
1163 | int d = pl->blocked_los[ax][ay]; |
1172 | int d = pl->blocked_los_uc (dx, dy); |
1164 | |
1173 | |
1165 | if (d > 3) |
1174 | if (d > 3) |
1166 | { |
1175 | { |
1167 | |
|
|
1168 | int need_send = 0, count; |
1176 | int need_send = 0, count; |
1169 | |
1177 | |
1170 | /* This block deals with spaces that are not visible for whatever |
1178 | /* This block deals with spaces that are not visible for whatever |
1171 | * reason. Still may need to send the head for this space. |
1179 | * reason. Still may need to send the head for this space. |
1172 | */ |
1180 | */ |
… | |
… | |
1178 | if (lastcell.count != -1) |
1186 | if (lastcell.count != -1) |
1179 | need_send = 1; |
1187 | need_send = 1; |
1180 | |
1188 | |
1181 | count = -1; |
1189 | count = -1; |
1182 | |
1190 | |
1183 | /* properly clear a previously sent big face */ |
|
|
1184 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1191 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
1185 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1192 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
1186 | need_send = 1; |
1193 | need_send = 1; |
1187 | |
1194 | |
|
|
1195 | /* properly clear a previously sent big face */ |
1188 | map_clearcell (&lastcell, count); |
1196 | map_clearcell (&lastcell, count); |
1189 | |
1197 | |
1190 | if ((mask & 0xf) || need_send) |
1198 | if ((mask & 0xf) || need_send) |
1191 | sl[oldlen + 1] = mask & 0xff; |
1199 | sl[oldlen + 1] = mask & 0xff; |
1192 | else |
1200 | else |
… | |
… | |
1248 | { |
1256 | { |
1249 | if (op->stats.maxhp > op->stats.hp |
1257 | if (op->stats.maxhp > op->stats.hp |
1250 | && op->stats.maxhp > 0 |
1258 | && op->stats.maxhp > 0 |
1251 | && (op->type == PLAYER |
1259 | && (op->type == PLAYER |
1252 | || op->type == DOOR // does not work, have maxhp 0 |
1260 | || op->type == DOOR // does not work, have maxhp 0 |
1253 | || QUERY_FLAG (op, FLAG_MONSTER) || QUERY_FLAG (op, FLAG_ALIVE) || QUERY_FLAG (op, FLAG_GENERATOR))) |
1261 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1262 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1263 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
1254 | { |
1264 | { |
1255 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1265 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
1256 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1266 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
1257 | } |
1267 | } |
1258 | |
1268 | |
1259 | if (op->msg && op->msg[0] == '@') |
1269 | if (op->has_dialogue ()) |
1260 | flags |= 1; |
1270 | flags |= 1; |
1261 | |
1271 | |
1262 | if (op->type == PLAYER && op != ob) |
1272 | if (op->type == PLAYER) |
1263 | player = op->count; |
1273 | player = op == ob ? pl->ob->count |
|
|
1274 | : op == pl->ob ? ob->count |
|
|
1275 | : op->count; |
1264 | } |
1276 | } |
1265 | |
1277 | |
1266 | if (lastcell.stat_hp != stat_hp) |
1278 | if (lastcell.stat_hp != stat_hp) |
1267 | { |
1279 | { |
1268 | lastcell.stat_hp = stat_hp; |
1280 | lastcell.stat_hp = stat_hp; |
… | |
… | |
1311 | |
1323 | |
1312 | /* Middle face */ |
1324 | /* Middle face */ |
1313 | if (update_space (sl, socket, ms, lastcell, 1)) |
1325 | if (update_space (sl, socket, ms, lastcell, 1)) |
1314 | mask |= 0x2; |
1326 | mask |= 0x2; |
1315 | |
1327 | |
|
|
1328 | if (ob->invisible |
|
|
1329 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
1316 | if (ms.player () == ob |
1330 | && ms.player () == ob) |
1317 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
|
|
1318 | { |
1331 | { |
1319 | // force player to be visible to himself if invisible |
1332 | // force player to be visible to himself if invisible |
1320 | if (lastcell.faces[0] != ob->face) |
1333 | if (lastcell.faces[0] != ob->face) |
1321 | { |
1334 | { |
1322 | lastcell.faces[0] = ob->face; |
1335 | lastcell.faces[0] = ob->face; |
… | |
… | |
1418 | { |
1431 | { |
1419 | packet sl; |
1432 | packet sl; |
1420 | sl << "replyinfo skill_info\n"; |
1433 | sl << "replyinfo skill_info\n"; |
1421 | |
1434 | |
1422 | for (int i = 1; i < NUM_SKILLS; i++) |
1435 | for (int i = 1; i < NUM_SKILLS; i++) |
1423 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1436 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]); |
1424 | |
1437 | |
1425 | if (sl.length () > MAXSOCKBUF) |
1438 | if (sl.length () > MAXSOCKBUF) |
1426 | { |
1439 | { |
1427 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1440 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1428 | fatal (0); |
1441 | fatal (0); |
… | |
… | |
1472 | if (spell->type == SPELL) |
1485 | if (spell->type == SPELL) |
1473 | { |
1486 | { |
1474 | int flags = 0; |
1487 | int flags = 0; |
1475 | |
1488 | |
1476 | /* check if we need to update it */ |
1489 | /* check if we need to update it */ |
1477 | if (spell->last_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1490 | if (spell->cached_sp != SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA)) |
1478 | { |
1491 | { |
1479 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1492 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1480 | flags |= UPD_SP_MANA; |
1493 | flags |= UPD_SP_MANA; |
1481 | } |
1494 | } |
1482 | |
1495 | |
1483 | if (spell->last_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1496 | if (spell->cached_grace != SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE)) |
1484 | { |
1497 | { |
1485 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1498 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1486 | flags |= UPD_SP_GRACE; |
1499 | flags |= UPD_SP_GRACE; |
1487 | } |
1500 | } |
1488 | |
1501 | |
1489 | if (spell->last_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1502 | if (spell->cached_eat != spell->stats.dam + SP_level_dam_adjust (pl->ob, spell)) |
1490 | { |
1503 | { |
1491 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1504 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1492 | flags |= UPD_SP_DAMAGE; |
1505 | flags |= UPD_SP_DAMAGE; |
1493 | } |
1506 | } |
1494 | |
1507 | |
1495 | if (flags) |
1508 | if (flags) |
1496 | { |
1509 | { |
… | |
… | |
1498 | |
1511 | |
1499 | sl << "updspell " |
1512 | sl << "updspell " |
1500 | << uint8 (flags) |
1513 | << uint8 (flags) |
1501 | << uint32 (spell->count); |
1514 | << uint32 (spell->count); |
1502 | |
1515 | |
1503 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->last_sp); |
1516 | if (flags & UPD_SP_MANA ) sl << uint16 (spell->cached_sp); |
1504 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->last_grace); |
1517 | if (flags & UPD_SP_GRACE ) sl << uint16 (spell->cached_grace); |
1505 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->last_eat); |
1518 | if (flags & UPD_SP_DAMAGE) sl << uint16 (spell->cached_eat); |
1506 | |
1519 | |
1507 | pl->ns->send_packet (sl); |
1520 | pl->ns->send_packet (sl); |
1508 | } |
1521 | } |
1509 | } |
1522 | } |
1510 | } |
1523 | } |
… | |
… | |
1540 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1553 | LOG (llevError, "item number %d is a spell with no name.\n", spell->count); |
1541 | return; |
1554 | return; |
1542 | } |
1555 | } |
1543 | |
1556 | |
1544 | /* store costs and damage in the object struct, to compare to later */ |
1557 | /* store costs and damage in the object struct, to compare to later */ |
1545 | spell->last_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1558 | spell->cached_sp = SP_level_spellpoint_cost (pl->ob, spell, SPELL_MANA); |
1546 | spell->last_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1559 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1547 | spell->last_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1560 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1548 | |
1561 | |
1549 | /* figure out which skill it uses, if it uses one */ |
1562 | /* figure out which skill it uses, if it uses one */ |
1550 | if (spell->skill) |
1563 | if (spell->skill) |
1551 | { |
1564 | if (object *tmp = pl->find_skill (spell->skill)) |
1552 | for (i = 1; i < NUM_SKILLS; i++) |
|
|
1553 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1554 | { |
|
|
1555 | skill = i + CS_STAT_SKILLINFO; |
1565 | skill = tmp->subtype + CS_STAT_SKILLINFO; |
1556 | break; |
|
|
1557 | } |
|
|
1558 | } |
|
|
1559 | |
1566 | |
1560 | // spells better have a face |
1567 | // spells better have a face |
1561 | if (!spell->face) |
1568 | if (!spell->face) |
1562 | { |
1569 | { |
1563 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1570 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
… | |
… | |
1568 | |
1575 | |
1569 | /* send the current values */ |
1576 | /* send the current values */ |
1570 | sl << uint32 (spell->count) |
1577 | sl << uint32 (spell->count) |
1571 | << uint16 (spell->level) |
1578 | << uint16 (spell->level) |
1572 | << uint16 (spell->casting_time) |
1579 | << uint16 (spell->casting_time) |
1573 | << uint16 (spell->last_sp) |
1580 | << uint16 (spell->cached_sp) |
1574 | << uint16 (spell->last_grace) |
1581 | << uint16 (spell->cached_grace) |
1575 | << uint16 (spell->last_eat) |
1582 | << uint16 (spell->cached_eat) |
1576 | << uint8 (skill) |
1583 | << uint8 (skill) |
1577 | << uint32 (spell->path_attuned) |
1584 | << uint32 (spell->path_attuned) |
1578 | << uint32 (spell->face) |
1585 | << uint32 (spell->face) |
1579 | << data8 (spell->name) |
1586 | << data8 (spell->name) |
1580 | << data16 (spell->msg); |
1587 | << data16 (spell->msg); |