… | |
… | |
98 | */ |
98 | */ |
99 | mx = ns->mapx; |
99 | mx = ns->mapx; |
100 | my = ns->mapy; |
100 | my = ns->mapy; |
101 | |
101 | |
102 | /* the x and y here are coordinates for the new map, i.e. if we moved |
102 | /* the x and y here are coordinates for the new map, i.e. if we moved |
103 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
103 | * (dx,dy), newmap[x][y] = oldmap[x-dx][y-dy]. For this reason, |
104 | * if the destination x or y coordinate is outside the viewable |
104 | * if the destination x or y coordinate is outside the viewable |
105 | * area, we clear the values - otherwise, the old values |
105 | * area, we clear the values - otherwise, the old values |
106 | * are preserved, and the check_head thinks it needs to clear them. |
106 | * are preserved, and the check_head thinks it needs to clear them. |
107 | */ |
107 | */ |
108 | for (x = 0; x < mx; x++) |
108 | for (x = 0; x < mx; x++) |
109 | { |
|
|
110 | for (y = 0; y < my; y++) |
109 | for (y = 0; y < my; y++) |
111 | { |
|
|
112 | if (x >= ns->mapx || y >= ns->mapy) |
110 | if (x >= ns->mapx || y >= ns->mapy) |
113 | /* clear cells outside the viewable area */ |
111 | /* clear cells outside the viewable area */ |
114 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
112 | memset (&newmap.cells[x][y], 0, sizeof (struct MapCell)); |
115 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
113 | else if ((x + dx) < 0 || (x + dx) >= ns->mapx || (y + dy) < 0 || (y + dy) >= ns->mapy) |
116 | /* clear newly visible tiles within the viewable area */ |
114 | /* clear newly visible tiles within the viewable area */ |
117 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
115 | memset (&(newmap.cells[x][y]), 0, sizeof (struct MapCell)); |
118 | else |
116 | else |
119 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
117 | memcpy (&(newmap.cells[x][y]), &(ns->lastmap.cells[x + dx][y + dy]), sizeof (struct MapCell)); |
120 | } |
|
|
121 | } |
|
|
122 | |
118 | |
123 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
119 | memcpy (&(ns->lastmap), &newmap, sizeof (struct Map)); |
124 | |
120 | |
125 | /* Make sure that the next "map1" command will be sent (even if it is |
121 | /* Make sure that the next "map1" command will be sent (even if it is |
126 | * empty). |
122 | * empty). |
… | |
… | |
406 | */ |
402 | */ |
407 | void |
403 | void |
408 | AddMeCmd (char *buf, int len, client *ns) |
404 | AddMeCmd (char *buf, int len, client *ns) |
409 | { |
405 | { |
410 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
406 | INVOKE_CLIENT (ADDME, ns, ARG_DATA (buf, len)); |
411 | } |
|
|
412 | |
|
|
413 | /** Reply to ExtendedInfos command */ |
|
|
414 | void |
|
|
415 | ToggleExtendedInfos (char *buf, int len, client * ns) |
|
|
416 | { |
|
|
417 | char cmdback[MAX_BUF]; |
|
|
418 | char command[50]; |
|
|
419 | int info, nextinfo; |
|
|
420 | |
|
|
421 | cmdback[0] = '\0'; |
|
|
422 | nextinfo = 0; |
|
|
423 | |
|
|
424 | while (1) |
|
|
425 | { |
|
|
426 | /* 1. Extract an info */ |
|
|
427 | info = nextinfo; |
|
|
428 | |
|
|
429 | while ((info < len) && (buf[info] == ' ')) |
|
|
430 | info++; |
|
|
431 | |
|
|
432 | if (info >= len) |
|
|
433 | break; |
|
|
434 | |
|
|
435 | nextinfo = info + 1; |
|
|
436 | |
|
|
437 | while ((nextinfo < len) && (buf[nextinfo] != ' ')) |
|
|
438 | nextinfo++; |
|
|
439 | |
|
|
440 | if (nextinfo - info >= 49) /*Erroneous info asked */ |
|
|
441 | continue; |
|
|
442 | |
|
|
443 | strncpy (command, &(buf[info]), nextinfo - info); |
|
|
444 | |
|
|
445 | /* 2. Interpret info */ |
|
|
446 | if (!strcmp ("smooth", command)) |
|
|
447 | /* Toggle smoothing */ |
|
|
448 | ns->EMI_smooth = !ns->EMI_smooth; |
|
|
449 | else |
|
|
450 | /*bad value */; |
|
|
451 | |
|
|
452 | /*3. Next info */ |
|
|
453 | } |
|
|
454 | |
|
|
455 | strcpy (cmdback, "ExtendedInfoSet"); |
|
|
456 | |
|
|
457 | if (ns->EMI_smooth) |
|
|
458 | { |
|
|
459 | strcat (cmdback, " "); |
|
|
460 | strcat (cmdback, "smoothing"); |
|
|
461 | } |
|
|
462 | |
|
|
463 | ns->send_packet (cmdback); |
|
|
464 | } |
407 | } |
465 | |
408 | |
466 | /* |
409 | /* |
467 | #define MSG_TYPE_BOOK 1 |
410 | #define MSG_TYPE_BOOK 1 |
468 | #define MSG_TYPE_CARD 2 |
411 | #define MSG_TYPE_CARD 2 |
… | |
… | |
833 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
776 | AddIfShort (ns->last_stats.Wis, ob->stats.Wis, CS_STAT_WIS); |
834 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
777 | AddIfShort (ns->last_stats.Pow, ob->stats.Pow, CS_STAT_POW); |
835 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
778 | AddIfShort (ns->last_stats.Cha, ob->stats.Cha, CS_STAT_CHA); |
836 | |
779 | |
837 | for (int s = 0; s < NUM_SKILLS; s++) |
780 | for (int s = 0; s < NUM_SKILLS; s++) |
838 | if (object *skill = opl->last_skill_ob[s]) |
781 | if (object *skill = opl->last_skill_ob [s]) |
839 | if (skill->stats.exp != ns->last_skill_exp [s]) |
782 | if (skill->stats.exp != ns->last_skill_exp [s]) |
840 | { |
783 | { |
841 | ns->last_skill_exp [s] = skill->stats.exp; |
784 | ns->last_skill_exp [s] = skill->stats.exp; |
842 | |
785 | |
843 | /* Always send along the level if exp changes. This is only |
786 | /* Always send along the level if exp changes. This is only |
… | |
… | |
988 | |
931 | |
989 | /* Nothing changed */ |
932 | /* Nothing changed */ |
990 | return 0; |
933 | return 0; |
991 | } |
934 | } |
992 | |
935 | |
993 | /** |
|
|
994 | * Returns the size of a data for a map square as returned by |
|
|
995 | * mapextended. There are CLIENTMAPX*CLIENTMAPY*LAYERS entries |
|
|
996 | * available. |
|
|
997 | */ |
|
|
998 | int |
|
|
999 | getExtendedMapInfoSize (client * ns) |
|
|
1000 | { |
|
|
1001 | int result = 0; |
|
|
1002 | |
|
|
1003 | if (ns->ext_mapinfos) |
|
|
1004 | { |
|
|
1005 | if (ns->EMI_smooth) |
|
|
1006 | result += 1; /*One byte for smoothlevel */ |
|
|
1007 | } |
|
|
1008 | |
|
|
1009 | return result; |
|
|
1010 | } |
|
|
1011 | |
|
|
1012 | // prefetch (and touch) all maps within a specific distancd |
936 | // prefetch (and touch) all maps within a specific distancd |
1013 | static void |
937 | static void |
1014 | prefetch_surrounding_maps (maptile *map, int distance) |
938 | prefetch_surrounding_maps (maptile *map, int distance) |
1015 | { |
939 | { |
1016 | map->last_access = runtime; |
940 | map->last_access = runtime; |
… | |
… | |
1039 | { |
963 | { |
1040 | object *ob = pl->observe; |
964 | object *ob = pl->observe; |
1041 | if (!ob->active) |
965 | if (!ob->active) |
1042 | return; |
966 | return; |
1043 | |
967 | |
1044 | maptile *plmap = ob->map; |
|
|
1045 | |
|
|
1046 | /* If player is just joining the game, he isn't here yet, so the map |
968 | /* If player is just joining the game, he isn't here yet, so the map |
1047 | * can get swapped out. If so, don't try to send them a map. All will |
969 | * can get swapped out. If so, don't try to send them a map. All will |
1048 | * be OK once they really log in. |
970 | * be OK once they really log in. |
1049 | */ |
971 | */ |
1050 | if (!plmap || plmap->in_memory != MAP_ACTIVE) |
972 | if (!ob->map || ob->map->in_memory != MAP_ACTIVE) |
1051 | return; |
973 | return; |
1052 | |
974 | |
1053 | int x, y, ax, ay, startlen, max_x, max_y, oldlen; |
|
|
1054 | int estartlen, eoldlen; |
975 | int startlen, oldlen; |
1055 | uint8 eentrysize; |
|
|
1056 | uint16 ewhatstart, ewhatflag; |
|
|
1057 | uint8 extendedinfos; |
|
|
1058 | |
976 | |
1059 | check_map_change (pl); |
977 | check_map_change (pl); |
1060 | prefetch_surrounding_maps (pl->ob); |
978 | prefetch_surrounding_maps (pl->ob); |
1061 | |
979 | |
1062 | /* do LOS after calls to update_position */ |
980 | /* do LOS after calls to update_position */ |
1063 | if (ob != pl->ob) |
981 | /* unfortunately, we need to udpate los when observing, currently */ |
1064 | clear_los (pl); |
982 | if (pl->do_los || pl->observe != pl->ob) |
1065 | else if (pl->do_los) |
|
|
1066 | { |
983 | { |
1067 | update_los (ob); |
|
|
1068 | pl->do_los = 0; |
984 | pl->do_los = 0; |
|
|
985 | pl->update_los (); |
1069 | } |
986 | } |
1070 | |
987 | |
1071 | /** |
988 | /** |
1072 | * This function uses the new map1 protocol command to send the map |
989 | * This function uses the new map1 protocol command to send the map |
1073 | * to the client. It is necessary because the old map command supports |
990 | * to the client. It is necessary because the old map command supports |
… | |
… | |
1092 | */ |
1009 | */ |
1093 | |
1010 | |
1094 | client &socket = *pl->ns; |
1011 | client &socket = *pl->ns; |
1095 | |
1012 | |
1096 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1013 | packet sl (socket.mapmode == Map1Cmd ? "map1" : "map1a"); |
1097 | packet esl; |
|
|
1098 | |
1014 | |
1099 | startlen = sl.length (); |
1015 | startlen = sl.length (); |
1100 | |
1016 | |
1101 | /*Extendedmapinfo structure initialisation */ |
1017 | int hx = socket.mapx / 2; |
1102 | if (socket.ext_mapinfos) |
1018 | int hy = socket.mapy / 2; |
1103 | { |
|
|
1104 | extendedinfos = EMI_NOREDRAW; |
|
|
1105 | |
1019 | |
1106 | if (socket.EMI_smooth) |
1020 | ordered_mapwalk_begin (ob, -hx, -hy, hx, hy) |
1107 | extendedinfos |= EMI_SMOOTH; |
1021 | int ax = dx + hx; |
|
|
1022 | int ay = dy + hy; |
1108 | |
1023 | |
1109 | ewhatstart = esl.length (); |
1024 | int mask = (ax << 10) | (ay << 4); |
1110 | ewhatflag = extendedinfos; /*The EMI_NOREDRAW bit |
|
|
1111 | could need to be taken away */ |
|
|
1112 | eentrysize = getExtendedMapInfoSize (&socket); |
|
|
1113 | esl << "mapextended " |
|
|
1114 | << uint8 (extendedinfos) |
|
|
1115 | << uint8 (eentrysize); |
|
|
1116 | |
|
|
1117 | estartlen = esl.length (); |
|
|
1118 | } |
|
|
1119 | |
|
|
1120 | /* x,y are the real map locations. ax, ay are viewport relative |
|
|
1121 | * locations. |
|
|
1122 | */ |
|
|
1123 | ay = 0; |
|
|
1124 | |
|
|
1125 | /* We could do this logic as conditionals in the if statement, |
|
|
1126 | * but that started to get a bit messy to look at. |
|
|
1127 | */ |
|
|
1128 | max_x = ob->x + (socket.mapx + 1) / 2; |
|
|
1129 | max_y = ob->y + (socket.mapy + 1) / 2; |
|
|
1130 | |
|
|
1131 | for (y = ob->y - socket.mapy / 2; y < max_y; y++, ay++) |
|
|
1132 | { |
|
|
1133 | sint16 nx, ny; |
|
|
1134 | maptile *m = 0; |
|
|
1135 | |
|
|
1136 | ax = 0; |
|
|
1137 | for (x = ob->x - socket.mapx / 2; x < max_x; x++, ax++) |
|
|
1138 | { |
|
|
1139 | // check to see if we can simply go one right quickly |
|
|
1140 | ++nx; |
|
|
1141 | if (m && nx >= m->width) |
|
|
1142 | m = 0; |
|
|
1143 | |
|
|
1144 | if (!m) |
|
|
1145 | { |
|
|
1146 | nx = x; ny = y; m = plmap; |
|
|
1147 | |
|
|
1148 | if (xy_normalise (m, nx, ny)) |
|
|
1149 | m->touch (); |
|
|
1150 | else |
|
|
1151 | m = 0; |
|
|
1152 | } |
|
|
1153 | |
|
|
1154 | int emask, mask; |
|
|
1155 | emask = mask = (ax & 0x3f) << 10 | (ay & 0x3f) << 4; |
|
|
1156 | |
|
|
1157 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1025 | MapCell &lastcell = socket.lastmap.cells[ax][ay]; |
1158 | |
1026 | |
1159 | /* If the coordinates are not valid, or it is too dark to see, |
1027 | /* If the coordinates are not valid, or it is too dark to see, |
1160 | * we tell the client as such |
1028 | * we tell the client as such |
1161 | */ |
1029 | */ |
1162 | if (!m) |
1030 | if (!m) |
1163 | { |
1031 | { |
1164 | /* space is out of map. Update space and clear values |
1032 | /* space is out of map. Update space and clear values |
1165 | * if this hasn't already been done. If the space is out |
1033 | * if this hasn't already been done. If the space is out |
1166 | * of the map, it shouldn't have a head |
1034 | * of the map, it shouldn't have a head. |
1167 | */ |
1035 | */ |
1168 | if (lastcell.count != -1) |
1036 | if (lastcell.count != -1) |
|
|
1037 | { |
|
|
1038 | sl << uint16 (mask); |
|
|
1039 | map_clearcell (&lastcell, -1); |
|
|
1040 | } |
|
|
1041 | |
|
|
1042 | continue; |
|
|
1043 | } |
|
|
1044 | |
|
|
1045 | int d = pl->blocked_los_uc (dx, dy); |
|
|
1046 | |
|
|
1047 | if (d > 3) |
|
|
1048 | { |
|
|
1049 | /* This block deals with spaces that are not visible for whatever |
|
|
1050 | * reason. Still may need to send the head for this space. |
|
|
1051 | */ |
|
|
1052 | if (lastcell.count != -1 |
|
|
1053 | || lastcell.faces[0] |
|
|
1054 | || lastcell.faces[1] |
|
|
1055 | || lastcell.faces[2] |
|
|
1056 | || lastcell.stat_hp |
|
|
1057 | || lastcell.flags |
|
|
1058 | || lastcell.player) |
|
|
1059 | sl << uint16 (mask); |
|
|
1060 | |
|
|
1061 | /* properly clear a previously sent big face */ |
|
|
1062 | map_clearcell (&lastcell, -1); |
|
|
1063 | } |
|
|
1064 | else |
|
|
1065 | { |
|
|
1066 | /* In this block, the space is visible. |
|
|
1067 | */ |
|
|
1068 | |
|
|
1069 | /* Rather than try to figure out what everything that we might |
|
|
1070 | * need to send is, then form the packet after that, |
|
|
1071 | * we presume that we will in fact form a packet, and update |
|
|
1072 | * the bits by what we do actually send. If we send nothing, |
|
|
1073 | * we just back out sl.length () to the old value, and no harm |
|
|
1074 | * is done. |
|
|
1075 | * I think this is simpler than doing a bunch of checks to see |
|
|
1076 | * what if anything we need to send, setting the bits, then |
|
|
1077 | * doing those checks again to add the real data. |
|
|
1078 | */ |
|
|
1079 | oldlen = sl.length (); |
|
|
1080 | |
|
|
1081 | sl << uint16 (mask); |
|
|
1082 | |
|
|
1083 | unsigned char dummy; |
|
|
1084 | unsigned char *last_ext = &dummy; |
|
|
1085 | |
|
|
1086 | /* Darkness changed */ |
|
|
1087 | if (lastcell.count != d && socket.darkness) |
|
|
1088 | { |
|
|
1089 | mask |= 0x8; |
|
|
1090 | |
|
|
1091 | if (socket.extmap) |
|
|
1092 | { |
|
|
1093 | *last_ext |= 0x80; |
|
|
1094 | last_ext = &sl[sl.length ()]; |
|
|
1095 | sl << uint8 (d); |
|
|
1096 | } |
|
|
1097 | else |
|
|
1098 | sl << uint8 (255 - 64 * d); |
|
|
1099 | } |
|
|
1100 | |
|
|
1101 | lastcell.count = d; |
|
|
1102 | |
|
|
1103 | mapspace &ms = m->at (nx, ny); |
|
|
1104 | ms.update (); |
|
|
1105 | |
|
|
1106 | if (expect_true (socket.extmap)) |
|
|
1107 | { |
|
|
1108 | uint8 stat_hp = 0; |
|
|
1109 | uint8 stat_width = 0; |
|
|
1110 | uint8 flags = 0; |
|
|
1111 | tag_t player = 0; |
|
|
1112 | |
|
|
1113 | // send hp information, if applicable |
|
|
1114 | if (object *op = ms.faces_obj [0]) |
|
|
1115 | if (op->is_head () && !op->invisible) |
1169 | { |
1116 | { |
1170 | sl << uint16 (mask); |
1117 | if (op->stats.maxhp > op->stats.hp |
1171 | map_clearcell (&lastcell, -1); |
1118 | && op->stats.maxhp > 0 |
|
|
1119 | && (op->type == PLAYER |
|
|
1120 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1121 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1122 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1123 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
|
|
1124 | { |
|
|
1125 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1126 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1127 | } |
|
|
1128 | |
|
|
1129 | if (expect_false (op->has_dialogue ())) |
|
|
1130 | flags |= 1; |
|
|
1131 | |
|
|
1132 | if (expect_false (op->type == PLAYER)) |
|
|
1133 | player = op == ob ? pl->ob->count |
|
|
1134 | : op == pl->ob ? ob->count |
|
|
1135 | : op->count; |
1172 | } |
1136 | } |
1173 | |
1137 | |
1174 | continue; |
1138 | if (expect_false (lastcell.stat_hp != stat_hp)) |
1175 | } |
|
|
1176 | |
|
|
1177 | int d = pl->blocked_los[ax][ay]; |
|
|
1178 | |
|
|
1179 | if (d > 3) |
|
|
1180 | { |
|
|
1181 | int need_send = 0, count; |
|
|
1182 | |
|
|
1183 | /* This block deals with spaces that are not visible for whatever |
|
|
1184 | * reason. Still may need to send the head for this space. |
|
|
1185 | */ |
|
|
1186 | |
|
|
1187 | oldlen = sl.length (); |
|
|
1188 | |
|
|
1189 | sl << uint16 (mask); |
|
|
1190 | |
|
|
1191 | if (lastcell.count != -1) |
|
|
1192 | need_send = 1; |
|
|
1193 | |
|
|
1194 | count = -1; |
|
|
1195 | |
|
|
1196 | if (lastcell.faces[0] || lastcell.faces[1] || lastcell.faces[2] |
|
|
1197 | || lastcell.stat_hp || lastcell.flags || lastcell.player) |
|
|
1198 | need_send = 1; |
|
|
1199 | |
|
|
1200 | /* properly clear a previously sent big face */ |
|
|
1201 | map_clearcell (&lastcell, count); |
|
|
1202 | |
|
|
1203 | if ((mask & 0xf) || need_send) |
|
|
1204 | sl[oldlen + 1] = mask & 0xff; |
|
|
1205 | else |
|
|
1206 | sl.reset (oldlen); |
|
|
1207 | } |
|
|
1208 | else |
|
|
1209 | { |
|
|
1210 | /* In this block, the space is visible. |
|
|
1211 | */ |
|
|
1212 | |
|
|
1213 | /* Rather than try to figure out what everything that we might |
|
|
1214 | * need to send is, then form the packet after that, |
|
|
1215 | * we presume that we will in fact form a packet, and update |
|
|
1216 | * the bits by what we do actually send. If we send nothing, |
|
|
1217 | * we just back out sl.length () to the old value, and no harm |
|
|
1218 | * is done. |
|
|
1219 | * I think this is simpler than doing a bunch of checks to see |
|
|
1220 | * what if anything we need to send, setting the bits, then |
|
|
1221 | * doing those checks again to add the real data. |
|
|
1222 | */ |
|
|
1223 | oldlen = sl.length (); |
|
|
1224 | eoldlen = esl.length (); |
|
|
1225 | |
|
|
1226 | sl << uint16 (mask); |
|
|
1227 | |
|
|
1228 | unsigned char dummy; |
|
|
1229 | unsigned char *last_ext = &dummy; |
|
|
1230 | |
|
|
1231 | /* Darkness changed */ |
|
|
1232 | if (lastcell.count != d && socket.darkness) |
|
|
1233 | { |
1139 | { |
|
|
1140 | lastcell.stat_hp = stat_hp; |
|
|
1141 | |
1234 | mask |= 0x8; |
1142 | mask |= 0x8; |
|
|
1143 | *last_ext |= 0x80; |
|
|
1144 | last_ext = &sl[sl.length ()]; |
1235 | |
1145 | |
1236 | if (socket.extmap) |
1146 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1147 | |
|
|
1148 | if (stat_width > 1) |
1237 | { |
1149 | { |
1238 | *last_ext |= 0x80; |
1150 | *last_ext |= 0x80; |
1239 | last_ext = &sl[sl.length ()]; |
1151 | last_ext = &sl[sl.length ()]; |
1240 | sl << uint8 (d); |
|
|
1241 | } |
|
|
1242 | else |
|
|
1243 | sl << uint8 (255 - 64 * d); |
|
|
1244 | } |
|
|
1245 | |
1152 | |
1246 | lastcell.count = d; |
|
|
1247 | |
|
|
1248 | mapspace &ms = m->at (nx, ny); |
|
|
1249 | ms.update (); |
|
|
1250 | |
|
|
1251 | if (socket.extmap) |
|
|
1252 | { |
|
|
1253 | uint8 stat_hp = 0; |
|
|
1254 | uint8 stat_width = 0; |
|
|
1255 | uint8 flags = 0; |
|
|
1256 | tag_t player = 0; |
|
|
1257 | |
|
|
1258 | // send hp information, if applicable |
|
|
1259 | if (object *op = ms.faces_obj [0]) |
|
|
1260 | if (op->is_head () && !op->invisible) |
|
|
1261 | { |
|
|
1262 | if (op->stats.maxhp > op->stats.hp |
|
|
1263 | && op->stats.maxhp > 0 |
|
|
1264 | && (op->type == PLAYER |
|
|
1265 | || op->type == DOOR // does not work, have maxhp 0 |
|
|
1266 | || QUERY_FLAG (op, FLAG_MONSTER) |
|
|
1267 | || QUERY_FLAG (op, FLAG_ALIVE) |
|
|
1268 | || QUERY_FLAG (op, FLAG_GENERATOR))) |
|
|
1269 | { |
|
|
1270 | stat_hp = 255 - (op->stats.hp * 255 + 254) / op->stats.maxhp; |
|
|
1271 | stat_width = op->arch->max_x - op->arch->x; //TODO: should be upper-left edge |
|
|
1272 | } |
|
|
1273 | |
|
|
1274 | if (op->has_dialogue ()) |
|
|
1275 | flags |= 1; |
|
|
1276 | |
|
|
1277 | if (op->type == PLAYER) |
|
|
1278 | player = op == ob ? pl->ob->count |
|
|
1279 | : op == pl->ob ? ob->count |
|
|
1280 | : op->count; |
|
|
1281 | } |
|
|
1282 | |
|
|
1283 | if (lastcell.stat_hp != stat_hp) |
|
|
1284 | { |
|
|
1285 | lastcell.stat_hp = stat_hp; |
|
|
1286 | |
|
|
1287 | mask |= 0x8; |
|
|
1288 | *last_ext |= 0x80; |
|
|
1289 | last_ext = &sl[sl.length ()]; |
|
|
1290 | |
|
|
1291 | sl << uint8 (5) << uint8 (stat_hp); |
|
|
1292 | |
|
|
1293 | if (stat_width > 1) |
|
|
1294 | { |
|
|
1295 | *last_ext |= 0x80; |
|
|
1296 | last_ext = &sl[sl.length ()]; |
|
|
1297 | |
|
|
1298 | sl << uint8 (6) << uint8 (stat_width); |
1153 | sl << uint8 (6) << uint8 (stat_width); |
1299 | } |
|
|
1300 | } |
1154 | } |
1301 | |
|
|
1302 | if (lastcell.player != player) |
|
|
1303 | { |
|
|
1304 | lastcell.player = player; |
|
|
1305 | |
|
|
1306 | mask |= 0x8; |
|
|
1307 | *last_ext |= 0x80; |
|
|
1308 | last_ext = &sl[sl.length ()]; |
|
|
1309 | |
|
|
1310 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
|
|
1311 | } |
|
|
1312 | |
|
|
1313 | if (lastcell.flags != flags) |
|
|
1314 | { |
|
|
1315 | lastcell.flags = flags; |
|
|
1316 | |
|
|
1317 | mask |= 0x8; |
|
|
1318 | *last_ext |= 0x80; |
|
|
1319 | last_ext = &sl[sl.length ()]; |
|
|
1320 | |
|
|
1321 | sl << uint8 (8) << uint8 (flags); |
|
|
1322 | } |
|
|
1323 | } |
1155 | } |
1324 | |
1156 | |
1325 | /* Floor face */ |
1157 | if (expect_false (lastcell.player != player)) |
1326 | if (update_space (sl, socket, ms, lastcell, 2)) |
1158 | { |
|
|
1159 | lastcell.player = player; |
|
|
1160 | |
1327 | mask |= 0x4; |
1161 | mask |= 0x8; |
|
|
1162 | *last_ext |= 0x80; |
|
|
1163 | last_ext = &sl[sl.length ()]; |
1328 | |
1164 | |
1329 | /* Middle face */ |
1165 | sl << uint8 (0x47) << uint8 (4) << (uint32)player; |
1330 | if (update_space (sl, socket, ms, lastcell, 1)) |
1166 | } |
|
|
1167 | |
|
|
1168 | if (expect_false (lastcell.flags != flags)) |
|
|
1169 | { |
|
|
1170 | lastcell.flags = flags; |
|
|
1171 | |
1331 | mask |= 0x2; |
1172 | mask |= 0x8; |
|
|
1173 | *last_ext |= 0x80; |
|
|
1174 | last_ext = &sl[sl.length ()]; |
1332 | |
1175 | |
1333 | if (ms.player () == ob |
1176 | sl << uint8 (8) << uint8 (flags); |
1334 | && (ob->invisible & (ob->invisible < 50 ? 1 : 7))) |
|
|
1335 | { |
1177 | } |
|
|
1178 | } |
|
|
1179 | |
|
|
1180 | /* Floor face */ |
|
|
1181 | if (update_space (sl, socket, ms, lastcell, 2)) |
|
|
1182 | mask |= 0x4; |
|
|
1183 | |
|
|
1184 | /* Middle face */ |
|
|
1185 | if (update_space (sl, socket, ms, lastcell, 1)) |
|
|
1186 | mask |= 0x2; |
|
|
1187 | |
|
|
1188 | if (expect_false (ob->invisible) |
|
|
1189 | && ob->invisible & (ob->invisible < 50 ? 1 : 7) |
|
|
1190 | && ms.player () == ob) |
|
|
1191 | { |
1336 | // force player to be visible to himself if invisible |
1192 | // force player to be visible to himself if invisible |
1337 | if (lastcell.faces[0] != ob->face) |
1193 | if (lastcell.faces[0] != ob->face) |
1338 | { |
1194 | { |
1339 | lastcell.faces[0] = ob->face; |
1195 | lastcell.faces[0] = ob->face; |
1340 | |
1196 | |
1341 | mask |= 0x1; |
|
|
1342 | sl << uint16 (ob->face); |
|
|
1343 | |
|
|
1344 | socket.send_faces (ob); |
|
|
1345 | } |
|
|
1346 | } |
|
|
1347 | /* Top face */ |
|
|
1348 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1349 | mask |= 0x1; |
1197 | mask |= 0x1; |
|
|
1198 | sl << uint16 (ob->face); |
1350 | |
1199 | |
|
|
1200 | socket.send_faces (ob); |
|
|
1201 | } |
|
|
1202 | } |
|
|
1203 | /* Top face */ |
|
|
1204 | else if (update_space (sl, socket, ms, lastcell, 0)) |
|
|
1205 | mask |= 0x1; |
|
|
1206 | |
1351 | /* Check to see if we are in fact sending anything for this |
1207 | /* Check to see if we are in fact sending anything for this |
1352 | * space by checking the mask. If so, update the mask. |
1208 | * space by checking the mask. If so, update the mask. |
1353 | * if not, reset the len to that from before adding the mask |
1209 | * if not, reset the len to that from before adding the mask |
1354 | * value, so we don't send those bits. |
1210 | * value, so we don't send those bits. |
1355 | */ |
1211 | */ |
1356 | if (mask & 0xf) |
1212 | if (mask & 0xf) |
1357 | sl[oldlen + 1] = mask & 0xff; |
1213 | sl[oldlen + 1] = mask & 0xff; |
1358 | else |
1214 | else |
1359 | sl.reset (oldlen); |
1215 | sl.reset (oldlen); |
1360 | |
|
|
1361 | if (socket.ext_mapinfos) |
|
|
1362 | esl << uint16 (emask); |
|
|
1363 | |
|
|
1364 | if (socket.EMI_smooth) |
|
|
1365 | { |
|
|
1366 | for (int layer = 2+1; layer--; ) |
|
|
1367 | { |
|
|
1368 | object *ob = ms.faces_obj [layer]; |
|
|
1369 | |
|
|
1370 | // If there is no object for this space, or if the face for the object |
|
|
1371 | // is the blank face, set the smoothlevel to zero. |
|
|
1372 | int smoothlevel = ob && ob->face != blank_face ? ob->smoothlevel : 0; |
|
|
1373 | |
|
|
1374 | // We've gotten what face we want to use for the object. Now see if |
|
|
1375 | // if it has changed since we last sent it to the client. |
|
|
1376 | if (lastcell.smooth[layer] != smoothlevel) |
|
|
1377 | { |
|
|
1378 | lastcell.smooth[layer] = smoothlevel; |
|
|
1379 | esl << uint8 (smoothlevel); |
|
|
1380 | emask |= 1 << layer; |
|
|
1381 | } |
|
|
1382 | } |
|
|
1383 | |
|
|
1384 | if (emask & 0xf) |
|
|
1385 | esl[eoldlen + 1] = emask & 0xff; |
|
|
1386 | else |
|
|
1387 | esl.reset (eoldlen); |
|
|
1388 | } |
|
|
1389 | } /* else this is a viewable space */ |
1216 | } /* else this is a viewable space */ |
1390 | } /* for x loop */ |
1217 | ordered_mapwalk_end |
1391 | } /* for y loop */ |
|
|
1392 | |
1218 | |
1393 | socket.flush_fx (); |
1219 | socket.flush_fx (); |
1394 | |
|
|
1395 | /* Verify that we in fact do need to send this */ |
|
|
1396 | if (socket.ext_mapinfos) |
|
|
1397 | { |
|
|
1398 | if (!(sl.length () > startlen || socket.sent_scroll)) |
|
|
1399 | { |
|
|
1400 | /* No map data will follow, so don't say the client |
|
|
1401 | * it doesn't need draw! |
|
|
1402 | */ |
|
|
1403 | ewhatflag &= ~EMI_NOREDRAW; |
|
|
1404 | esl[ewhatstart + 1] = ewhatflag & 0xff; |
|
|
1405 | } |
|
|
1406 | |
|
|
1407 | if (esl.length () > estartlen) |
|
|
1408 | socket.send_packet (esl); |
|
|
1409 | } |
|
|
1410 | |
1220 | |
1411 | if (sl.length () > startlen || socket.sent_scroll) |
1221 | if (sl.length () > startlen || socket.sent_scroll) |
1412 | { |
1222 | { |
1413 | socket.send_packet (sl); |
1223 | socket.send_packet (sl); |
1414 | socket.sent_scroll = 0; |
1224 | socket.sent_scroll = 0; |
… | |
… | |
1435 | { |
1245 | { |
1436 | packet sl; |
1246 | packet sl; |
1437 | sl << "replyinfo skill_info\n"; |
1247 | sl << "replyinfo skill_info\n"; |
1438 | |
1248 | |
1439 | for (int i = 1; i < NUM_SKILLS; i++) |
1249 | for (int i = 1; i < NUM_SKILLS; i++) |
1440 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names[i]); |
1250 | sl.printf ("%d:%s\n", i + CS_STAT_SKILLINFO, &skill_names [i]); |
1441 | |
1251 | |
1442 | if (sl.length () > MAXSOCKBUF) |
1252 | if (sl.length () > MAXSOCKBUF) |
1443 | { |
1253 | { |
1444 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1254 | LOG (llevError, "Buffer overflow in send_skill_info!\n"); |
1445 | fatal (0); |
1255 | fatal (0); |
… | |
… | |
1563 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1373 | spell->cached_grace = SP_level_spellpoint_cost (pl->ob, spell, SPELL_GRACE); |
1564 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1374 | spell->cached_eat = spell->stats.dam + SP_level_dam_adjust (pl->ob, spell); |
1565 | |
1375 | |
1566 | /* figure out which skill it uses, if it uses one */ |
1376 | /* figure out which skill it uses, if it uses one */ |
1567 | if (spell->skill) |
1377 | if (spell->skill) |
1568 | { |
1378 | if (object *tmp = pl->find_skill (spell->skill)) |
1569 | for (i = 1; i < NUM_SKILLS; i++) |
|
|
1570 | if (!strcmp (spell->skill, skill_names[i])) |
|
|
1571 | { |
|
|
1572 | skill = i + CS_STAT_SKILLINFO; |
1379 | skill = tmp->subtype + CS_STAT_SKILLINFO; |
1573 | break; |
|
|
1574 | } |
|
|
1575 | } |
|
|
1576 | |
1380 | |
1577 | // spells better have a face |
1381 | // spells better have a face |
1578 | if (!spell->face) |
1382 | if (!spell->face) |
1579 | { |
1383 | { |
1580 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |
1384 | LOG (llevError, "%s: spell has no face, but face is mandatory.\n", &spell->name); |