… | |
… | |
31 | # ifdef HAVE_CRYPT_H |
31 | # ifdef HAVE_CRYPT_H |
32 | # include <crypt.h> |
32 | # include <crypt.h> |
33 | # endif |
33 | # endif |
34 | #endif |
34 | #endif |
35 | |
35 | |
36 | #ifndef __CEXTRACT__ |
|
|
37 | # include <sproto.h> |
36 | #include <sproto.h> |
38 | #endif |
|
|
39 | |
|
|
40 | #ifdef HAVE_TIME_H |
|
|
41 | # include <time.h> |
37 | #include <time.h> |
42 | #endif |
|
|
43 | |
38 | |
44 | #include <../random_maps/random_map.h> |
39 | #include <../random_maps/random_map.h> |
45 | #include <../random_maps/rproto.h> |
40 | #include <../random_maps/rproto.h> |
46 | #include "path.h" |
41 | #include "path.h" |
47 | |
42 | |
… | |
… | |
138 | void |
133 | void |
139 | start_info (object *op) |
134 | start_info (object *op) |
140 | { |
135 | { |
141 | char buf[MAX_BUF]; |
136 | char buf[MAX_BUF]; |
142 | |
137 | |
143 | sprintf (buf, "Welcome to Crossfire, v%s!", VERSION); |
138 | sprintf (buf, "Welcome to Crossfire v%s!", VERSION); |
144 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
139 | new_draw_info (NDI_UNIQUE, 0, op, buf); |
145 | new_draw_info (NDI_UNIQUE, 0, op, "Press `?' for help"); |
140 | new_draw_info (NDI_UNIQUE, 0, op, "Press `?' for help"); |
146 | new_draw_info (NDI_UNIQUE, 0, op, " "); |
141 | new_draw_info (NDI_UNIQUE, 0, op, " "); |
147 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, op, "%s entered the game.", &op->name); |
142 | new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, op, "%s entered the game.", &op->name); |
148 | if (!op->contr->name_changed) |
|
|
149 | { |
|
|
150 | new_draw_info (NDI_UNIQUE, 0, op, "Note that you must set your name with the name"); |
|
|
151 | new_draw_info (NDI_UNIQUE, 0, op, "command to enter the highscore list."); |
|
|
152 | new_draw_info (NDI_UNIQUE, 0, op, "(You can also use the crossfire.name X-resource.)"); |
|
|
153 | } |
|
|
154 | } |
|
|
155 | |
|
|
156 | /* Really, there is no reason to crypt the passwords any system. But easier |
|
|
157 | * to just leave this enabled for backward compatibility. Put the |
|
|
158 | * simple case at top - no encryption - makes it easier to read. |
|
|
159 | */ |
|
|
160 | char * |
|
|
161 | crypt_string (char *str, char *salt) |
|
|
162 | { |
|
|
163 | #if (defined(__FreeBSD__) && !defined(HAVE_LIBDES)) |
|
|
164 | return (str); |
|
|
165 | #else |
|
|
166 | static char *c = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789./"; |
|
|
167 | char s[2]; |
|
|
168 | |
|
|
169 | if (salt == NULL) |
|
|
170 | s[0] = c[RANDOM () % (int) strlen (c)], s[1] = c[RANDOM () % (int) strlen (c)]; |
|
|
171 | else |
|
|
172 | s[0] = salt[0], s[1] = salt[1]; |
|
|
173 | |
|
|
174 | # ifdef HAVE_LIBDES |
|
|
175 | return (char *) des_crypt (str, s); |
|
|
176 | # endif |
|
|
177 | /* Default case - just use crypt */ |
|
|
178 | return (char *) crypt (str, s); |
|
|
179 | #endif |
|
|
180 | } |
|
|
181 | |
|
|
182 | int |
|
|
183 | check_password (char *typed, char *crypted) |
|
|
184 | { |
|
|
185 | return !strcmp (crypt_string (typed, crypted), crypted); |
|
|
186 | } |
143 | } |
187 | |
144 | |
188 | /* This is a basic little function to put the player back to his |
145 | /* This is a basic little function to put the player back to his |
189 | * savebed. We do some error checking - its possible that the |
146 | * savebed. We do some error checking - its possible that the |
190 | * savebed map may no longer exist, so we make sure the player |
147 | * savebed map may no longer exist, so we make sure the player |
… | |
… | |
472 | rp.origin_y = exit_ob->y; |
429 | rp.origin_y = exit_ob->y; |
473 | strcpy (rp.origin_map, pl->map->path); |
430 | strcpy (rp.origin_map, pl->map->path); |
474 | |
431 | |
475 | /* If we have a final_map, use it as a base name to give some clue |
432 | /* If we have a final_map, use it as a base name to give some clue |
476 | * as where the player is. Otherwise, use the origin map. |
433 | * as where the player is. Otherwise, use the origin map. |
477 | * Take the last component (after the last slash) to give |
|
|
478 | * shorter names without bogus slashes. |
|
|
479 | */ |
434 | */ |
480 | if (rp.final_map[0]) |
435 | sprintf (newmap_name, "/random%s+%04d", |
481 | { |
436 | *rp.final_map ? rp.final_map : rp.origin_map, |
482 | cp = strrchr (rp.final_map, '/'); |
437 | reference_number++); |
483 | if (!cp) |
|
|
484 | cp = rp.final_map; |
|
|
485 | } |
|
|
486 | else |
|
|
487 | { |
|
|
488 | char buf[HUGE_BUF]; |
|
|
489 | |
|
|
490 | cp = strrchr (rp.origin_map, '/'); |
|
|
491 | if (!cp) |
|
|
492 | cp = rp.origin_map; |
|
|
493 | /* Need to strip of any trailing digits, if it has them */ |
|
|
494 | strcpy (buf, cp); |
|
|
495 | while (isdigit (buf[strlen (buf) - 1])) |
|
|
496 | buf[strlen (buf) - 1] = 0; |
|
|
497 | cp = buf; |
|
|
498 | } |
|
|
499 | |
|
|
500 | sprintf (newmap_name, "/random/%s%04d", cp + 1, reference_number++); |
|
|
501 | |
438 | |
502 | /* now to generate the actual map. */ |
439 | /* now to generate the actual map. */ |
503 | new_map = generate_random_map (newmap_name, &rp); |
440 | new_map = generate_random_map (newmap_name, &rp); |
504 | |
441 | |
505 | /* Update the exit_ob so it now points directly at the newly created |
442 | /* Update the exit_ob so it now points directly at the newly created |
… | |
… | |
633 | |
570 | |
634 | /* If we are coming from another template map, use reletive paths unless |
571 | /* If we are coming from another template map, use reletive paths unless |
635 | * indicated otherwise. |
572 | * indicated otherwise. |
636 | */ |
573 | */ |
637 | if (exit_ob->map->templatemap && (resultname[0] != '/')) |
574 | if (exit_ob->map->templatemap && (resultname[0] != '/')) |
638 | { |
|
|
639 | new_map_name = path_combine_and_normalize (exit_ob->map->path, resultname); |
575 | new_map_name = path_combine_and_normalize (exit_ob->map->path, resultname); |
640 | } |
|
|
641 | else |
576 | else |
642 | { |
|
|
643 | new_map_name = create_template_pathname (resultname); |
577 | new_map_name = create_template_pathname (resultname); |
644 | } |
|
|
645 | |
578 | |
646 | new_map = ready_map_name (new_map_name, MAP_PLAYER_UNIQUE); |
579 | new_map = ready_map_name (new_map_name, MAP_PLAYER_UNIQUE); |
647 | if (!new_map) |
580 | if (!new_map) |
648 | { |
581 | { |
649 | memset (&rp, 0, sizeof (RMParms)); |
582 | memset (&rp, 0, sizeof (RMParms)); |
… | |
… | |
899 | tmp->destroy (); |
832 | tmp->destroy (); |
900 | } |
833 | } |
901 | |
834 | |
902 | strcpy (op->contr->savebed_map, path_combine_and_normalize (exit_ob->map->path, EXIT_PATH (exit_ob))); |
835 | strcpy (op->contr->savebed_map, path_combine_and_normalize (exit_ob->map->path, EXIT_PATH (exit_ob))); |
903 | op->contr->bed_x = EXIT_X (exit_ob), op->contr->bed_y = EXIT_Y (exit_ob); |
836 | op->contr->bed_x = EXIT_X (exit_ob), op->contr->bed_y = EXIT_Y (exit_ob); |
904 | save_player (op, 1); |
837 | op->contr->save (); |
905 | /* LOG(llevDebug,"enter_exit: Taking damned exit %s to (%d,%d) on map %s\n", |
838 | /* LOG(llevDebug,"enter_exit: Taking damned exit %s to (%d,%d) on map %s\n", |
906 | * exit_ob->name?exit_ob->name:"(none)", exit_ob->x, exit_ob->y, |
839 | * exit_ob->name?exit_ob->name:"(none)", exit_ob->x, exit_ob->y, |
907 | * path_combine_and_normalize(exit_ob->map->path, EXIT_PATH(exit_ob))); */ |
840 | * path_combine_and_normalize(exit_ob->map->path, EXIT_PATH(exit_ob))); */ |
908 | } |
841 | } |
909 | |
842 | |
… | |
… | |
950 | |
883 | |
951 | enter_map (op, newmap, op->x, op->y); |
884 | enter_map (op, newmap, op->x, op->y); |
952 | } |
885 | } |
953 | } |
886 | } |
954 | |
887 | |
955 | /* |
|
|
956 | * process_active_maps(): Works like process_events(), but it only |
|
|
957 | * processes maps which a player is on. |
|
|
958 | * |
|
|
959 | */ |
|
|
960 | |
|
|
961 | #if 0 // dead code, schmorp |
|
|
962 | void |
|
|
963 | process_active_maps () |
|
|
964 | { |
|
|
965 | for (maptile *map = first_map; map != NULL; map = map->next) |
|
|
966 | if (map->in_memory == MAP_IN_MEMORY) |
|
|
967 | if (players_on_map (map, TRUE)) |
|
|
968 | process_events (map); |
|
|
969 | } |
|
|
970 | #endif |
|
|
971 | |
|
|
972 | /* process_players1 and process_players2 do all the player related stuff. |
888 | /* process_players1 and process_players2 do all the player related stuff. |
973 | * I moved it out of process events and process_map. This was to some |
889 | * I moved it out of process events and process_map. This was to some |
974 | * extent for debugging as well as to get a better idea of the time used |
890 | * extent for debugging as well as to get a better idea of the time used |
975 | * by the various functions. process_players1() does the processing before |
891 | * by the various functions. process_players1() does the processing before |
976 | * objects have been updated, process_players2() does the processing that |
892 | * objects have been updated, process_players2() does the processing that |
977 | * is needed after the players have been updated. |
893 | * is needed after the players have been updated. |
978 | */ |
894 | */ |
979 | |
895 | static void |
980 | void |
|
|
981 | process_players1 (maptile *map) |
896 | process_players1 () |
982 | { |
897 | { |
983 | int flag; |
898 | int flag; |
984 | player *pl, *plnext; |
|
|
985 | |
899 | |
986 | /* Basically, we keep looping until all the players have done their actions. */ |
900 | /* Basically, we keep looping until all the players have done their actions. */ |
987 | for (flag = 1; flag != 0;) |
901 | for (flag = 1; flag != 0;) |
988 | { |
902 | { |
989 | flag = 0; |
903 | flag = 0; |
990 | for (pl = first_player; pl != NULL; pl = plnext) |
904 | for_all_players (pl) |
991 | { |
905 | { |
992 | plnext = pl->next; /* In case a player exits the game in handle_player() */ |
906 | pl->refcnt_chk (); |
993 | |
907 | |
994 | if (pl->ob == NULL) |
908 | if (!pl->ob || !pl->ns) |
995 | continue; |
909 | continue; |
996 | |
910 | |
997 | if (map != NULL && pl->ob->map != map) |
|
|
998 | continue; |
|
|
999 | |
|
|
1000 | if (pl->ob->speed_left > 0) |
911 | if (pl->ob->speed_left > 0) |
1001 | { |
|
|
1002 | if (handle_newcs_player (pl->ob)) |
912 | if (handle_newcs_player (pl->ob)) |
1003 | flag = 1; |
913 | flag = 1; |
1004 | } /* end if player has speed left */ |
|
|
1005 | |
914 | |
1006 | /* If the player is not actively playing, don't make a |
915 | /* If the player is not actively playing, don't make a |
1007 | * backup save - nothing to save anyway. Plus, the |
916 | * backup save - nothing to save anyway. Plus, the |
1008 | * map may not longer be valid. This can happen when the |
917 | * map may not longer be valid. This can happen when the |
1009 | * player quits - they exist for purposes of tracking on the map, |
918 | * player quits - they exist for purposes of tracking on the map, |
… | |
… | |
1014 | |
923 | |
1015 | #ifdef AUTOSAVE |
924 | #ifdef AUTOSAVE |
1016 | /* check for ST_PLAYING state so that we don't try to save off when |
925 | /* check for ST_PLAYING state so that we don't try to save off when |
1017 | * the player is logging in. |
926 | * the player is logging in. |
1018 | */ |
927 | */ |
1019 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->state == ST_PLAYING) |
928 | if ((pl->last_save_tick + AUTOSAVE) < (uint32) pticks && pl->ns->state == ST_PLAYING) |
1020 | { |
|
|
1021 | /* Don't save the player on unholy ground. Instead, increase the |
|
|
1022 | * tick time so it will be about 10 seconds before we try and save |
|
|
1023 | * again. |
|
|
1024 | */ |
929 | { |
1025 | // if (get_map_flags(pl->ob->map, NULL, pl->ob->x, pl->ob->y, NULL, NULL) & P_NO_CLERIC) { |
930 | pl->ob->contr->save (); |
1026 | // pl->last_save_tick += 100; |
|
|
1027 | // } else { |
|
|
1028 | save_player (pl->ob, 1); |
|
|
1029 | pl->last_save_tick = pticks; |
931 | pl->last_save_tick = pticks; |
1030 | // } |
|
|
1031 | } |
932 | } |
1032 | #endif |
933 | #endif |
1033 | } /* end of for loop for all the players */ |
934 | } /* end of for loop for all the players */ |
1034 | } /* for flag */ |
935 | } /* for flag */ |
1035 | for (pl = first_player; pl != NULL; pl = pl->next) |
936 | |
|
|
937 | for_all_players (pl) |
1036 | { |
938 | { |
1037 | if (map != NULL && (pl->ob == NULL || pl->ob->map != map)) |
939 | if (!pl->ob || !pl->ns) |
1038 | continue; |
940 | continue; |
|
|
941 | |
1039 | if (settings.casting_time == TRUE) |
942 | if (settings.casting_time) |
1040 | { |
943 | { |
1041 | if (pl->ob->casting_time > 0) |
944 | if (pl->ob->casting_time > 0) |
1042 | { |
945 | { |
1043 | pl->ob->casting_time--; |
946 | pl->ob->casting_time--; |
1044 | pl->ob->start_holding = 1; |
947 | pl->ob->start_holding = 1; |
1045 | } |
948 | } |
|
|
949 | |
1046 | /* set spell_state so we can update the range in stats field */ |
950 | /* set spell_state so we can update the range in stats field */ |
1047 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
951 | if ((pl->ob->casting_time == 0) && (pl->ob->start_holding == 1)) |
1048 | { |
|
|
1049 | pl->ob->start_holding = 0; |
952 | pl->ob->start_holding = 0; |
1050 | } |
953 | } |
1051 | } |
954 | |
1052 | do_some_living (pl->ob); |
955 | do_some_living (pl->ob); |
1053 | /* draw(pl->ob); *//* updated in socket code */ |
|
|
1054 | } |
956 | } |
1055 | } |
957 | } |
1056 | |
958 | |
1057 | void |
959 | static void |
1058 | process_players2 (maptile *map) |
960 | process_players2 () |
1059 | { |
961 | { |
1060 | player *pl; |
|
|
1061 | |
|
|
1062 | /* Then check if any players should use weapon-speed instead of speed */ |
962 | /* Then check if any players should use weapon-speed instead of speed */ |
1063 | for (pl = first_player; pl != NULL; pl = pl->next) |
963 | for_all_players (pl) |
1064 | { |
964 | { |
1065 | if (map != NULL) |
|
|
1066 | { |
|
|
1067 | if (pl->ob == NULL || QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
1068 | continue; |
|
|
1069 | else if (pl->loading != NULL) /* Player is blocked */ |
|
|
1070 | pl->ob->speed_left -= pl->ob->speed; |
|
|
1071 | if (pl->ob->map != map) |
|
|
1072 | continue; |
|
|
1073 | } |
|
|
1074 | |
|
|
1075 | /* The code that did weapon_sp handling here was out of place - |
965 | /* The code that did weapon_sp handling here was out of place - |
1076 | * this isn't called until after the player has finished there |
966 | * this isn't called until after the player has finished there |
1077 | * actions, and is thus out of place. All we do here is bounds |
967 | * actions, and is thus out of place. All we do here is bounds |
1078 | * checking. |
968 | * checking. |
1079 | */ |
969 | */ |
… | |
… | |
1085 | /* This needs to be here - if the player is running, we need to |
975 | /* This needs to be here - if the player is running, we need to |
1086 | * clear this each tick, but new commands are not being received |
976 | * clear this each tick, but new commands are not being received |
1087 | * so execute_newserver_command() is never called |
977 | * so execute_newserver_command() is never called |
1088 | */ |
978 | */ |
1089 | pl->has_hit = 0; |
979 | pl->has_hit = 0; |
1090 | |
|
|
1091 | } |
980 | } |
1092 | else if (pl->ob->speed_left > pl->ob->speed) |
981 | else if (pl->ob->speed_left > pl->ob->speed) |
1093 | pl->ob->speed_left = pl->ob->speed; |
982 | pl->ob->speed_left = pl->ob->speed; |
1094 | } |
983 | } |
1095 | } |
984 | } |
1096 | |
985 | |
1097 | void |
986 | void |
1098 | process_events (maptile *map) |
987 | process_events () |
1099 | { |
988 | { |
1100 | object *op; |
989 | object *op; |
1101 | |
990 | |
1102 | static object *marker; |
991 | static object_ptr marker_; |
1103 | |
992 | |
1104 | if (!marker) |
993 | if (!marker_) |
1105 | marker = object::create (); |
994 | marker_ = object::create (); |
1106 | |
995 | |
|
|
996 | object *marker = marker_; |
|
|
997 | |
1107 | process_players1 (map); |
998 | process_players1 (); |
1108 | |
999 | |
1109 | marker->active_next = active_objects; |
1000 | marker->active_next = active_objects; |
1110 | |
1001 | |
1111 | if (marker->active_next) |
1002 | if (marker->active_next) |
1112 | marker->active_next->active_prev = marker; |
1003 | marker->active_next->active_prev = marker; |
1113 | |
1004 | |
1114 | marker->active_prev = NULL; |
1005 | marker->active_prev = 0; |
1115 | active_objects = marker; |
1006 | active_objects = marker; |
1116 | |
1007 | |
1117 | while (marker->active_next) |
1008 | while (marker->active_next) |
1118 | { |
1009 | { |
1119 | op = marker->active_next; |
1010 | op = marker->active_next; |
… | |
… | |
1163 | continue; |
1054 | continue; |
1164 | } |
1055 | } |
1165 | |
1056 | |
1166 | if (!op->speed) |
1057 | if (!op->speed) |
1167 | { |
1058 | { |
1168 | LOG (llevError, "BUG: process_events(): Object %s has no speed, " "but is on active list\n", &op->arch->name); |
1059 | LOG (llevError, "BUG: process_events(): Object %s has no speed, " |
|
|
1060 | "but is on active list\n", &op->arch->name); |
1169 | update_ob_speed (op); |
1061 | update_ob_speed (op); |
1170 | continue; |
1062 | continue; |
1171 | } |
1063 | } |
1172 | |
1064 | |
1173 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP && map == NULL) |
1065 | if (op->map == NULL && op->env == NULL && op->name && op->type != MAP) |
1174 | { |
1066 | { |
1175 | LOG (llevError, "BUG: process_events(): Object without map or " "inventory is on active list: %s (%d)\n", &op->name, op->count); |
1067 | LOG (llevError, "BUG: process_events(): Object without map or " |
|
|
1068 | "inventory is on active list: %s (%d)\n", &op->name, op->count); |
1176 | op->speed = 0; |
1069 | op->speed = 0; |
1177 | update_ob_speed (op); |
1070 | update_ob_speed (op); |
1178 | continue; |
1071 | continue; |
1179 | } |
1072 | } |
1180 | |
1073 | |
1181 | if (map != NULL && op->map != map) |
|
|
1182 | continue; |
|
|
1183 | |
|
|
1184 | /* Animate the object. Bug of feature that andim_speed |
1074 | /* Animate the object. Bug or feature that anim_speed |
1185 | * is based on ticks, and not the creatures speed? |
1075 | * is based on ticks, and not the creatures speed? |
1186 | */ |
1076 | */ |
1187 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
1077 | if (op->anim_speed && op->last_anim >= op->anim_speed) |
1188 | { |
1078 | { |
1189 | if ((op->type == PLAYER) || (op->type == MONSTER)) |
1079 | if ((op->type == PLAYER)) |
1190 | animate_object (op, op->facing); |
1080 | animate_object (op, op->facing); |
1191 | else |
1081 | else |
1192 | animate_object (op, op->direction); |
1082 | animate_object (op, op->direction); |
1193 | |
1083 | |
1194 | op->last_anim = 1; |
1084 | op->last_anim = 1; |
… | |
… | |
1230 | if (marker->active_prev != NULL) |
1120 | if (marker->active_prev != NULL) |
1231 | marker->active_prev->active_next = NULL; |
1121 | marker->active_prev->active_next = NULL; |
1232 | else |
1122 | else |
1233 | active_objects = NULL; |
1123 | active_objects = NULL; |
1234 | |
1124 | |
1235 | process_players2 (map); |
1125 | process_players2 (); |
1236 | } |
1126 | } |
1237 | |
1127 | |
1238 | void |
1128 | void |
1239 | clean_tmp_files (void) |
1129 | clean_tmp_files (void) |
1240 | { |
1130 | { |
… | |
… | |
1244 | |
1134 | |
1245 | /* We save the maps - it may not be intuitive why, but if there are unique |
1135 | /* We save the maps - it may not be intuitive why, but if there are unique |
1246 | * items, we need to save the map so they get saved off. Perhaps we should |
1136 | * items, we need to save the map so they get saved off. Perhaps we should |
1247 | * just make a special function that only saves the unique items. |
1137 | * just make a special function that only saves the unique items. |
1248 | */ |
1138 | */ |
1249 | for (m = first_map; m != NULL; m = next) |
1139 | for (m = first_map; m; m = next) |
1250 | { |
1140 | { |
1251 | next = m->next; |
1141 | next = m->next; |
|
|
1142 | |
1252 | if (m->in_memory == MAP_IN_MEMORY) |
1143 | if (m->in_memory == MAP_IN_MEMORY) |
1253 | { |
1144 | { |
1254 | /* If we want to reuse the temp maps, swap it out (note that will also |
1145 | /* If we want to reuse the temp maps, swap it out (note that will also |
1255 | * update the log file. Otherwise, save the map (mostly for unique item |
1146 | * update the log file. |
1256 | * stuff). Note that the clean_tmp_map is called after the end of |
|
|
1257 | * the for loop but is in the #else bracket. IF we are recycling the maps, |
|
|
1258 | * we certainly don't want the temp maps removed. |
|
|
1259 | */ |
1147 | */ |
1260 | |
1148 | |
1261 | /* XXX The above comment is dead wrong */ |
|
|
1262 | if (settings.recycle_tmp_maps == TRUE) |
|
|
1263 | swap_map (m); |
1149 | swap_map (m); |
1264 | else |
|
|
1265 | { |
|
|
1266 | new_save_map (m, 0); /* note we save here into a overlay map */ |
|
|
1267 | clean_tmp_map (m); |
|
|
1268 | } |
1150 | } |
1269 | } |
|
|
1270 | } |
1151 | } |
|
|
1152 | |
1271 | write_todclock (); /* lets just write the clock here */ |
1153 | write_todclock (); /* lets just write the clock here */ |
1272 | } |
1154 | } |
1273 | |
1155 | |
1274 | /* clean up everything before exiting */ |
1156 | /* clean up everything before exiting */ |
1275 | void |
1157 | void |
1276 | cleanup (void) |
1158 | cleanup (bool make_core) |
1277 | { |
1159 | { |
1278 | LOG (llevDebug, "Cleanup called.\n"); |
1160 | LOG (llevDebug, "Cleanup called.\n"); |
1279 | |
1161 | |
1280 | for (player *pl = first_player; pl != NULL; pl = pl->next) |
1162 | if (init_done) |
1281 | save_player (pl->ob, 0); |
1163 | { |
|
|
1164 | for_all_players (pl) |
|
|
1165 | pl->save (1); |
1282 | |
1166 | |
1283 | for (player *pl = first_player; pl != NULL; pl = pl->next) |
1167 | for_all_players (pl) |
1284 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
1168 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
1285 | leave_map (pl->ob); |
1169 | leave_map (pl->ob); |
1286 | |
1170 | |
1287 | clean_tmp_files (); |
1171 | clean_tmp_files (); |
1288 | write_book_archive (); |
1172 | write_book_archive (); |
1289 | |
1173 | |
1290 | INVOKE_GLOBAL (CLEANUP); |
1174 | INVOKE_GLOBAL (CLEANUP); |
|
|
1175 | } |
1291 | |
1176 | |
|
|
1177 | if (make_core) |
|
|
1178 | abort (); |
|
|
1179 | else |
1292 | _exit (0); |
1180 | _exit (0); |
1293 | } |
1181 | } |
1294 | |
1182 | |
1295 | void |
1183 | void |
1296 | leave (player *pl, int draw_exit) |
1184 | leave (player *pl, int draw_exit) |
1297 | { |
1185 | { |
1298 | if (pl != NULL) |
1186 | if (pl) |
1299 | { |
1187 | { |
|
|
1188 | if (pl->ob->type != DEAD_OBJECT) |
|
|
1189 | { |
|
|
1190 | /* If a hidden dm dropped connection do not create |
|
|
1191 | * inconsistencies by showing that they have left the game |
|
|
1192 | */ |
|
|
1193 | if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden) |
|
|
1194 | && draw_exit) |
|
|
1195 | { |
|
|
1196 | if (pl->ob->map) |
|
|
1197 | { |
|
|
1198 | INVOKE_PLAYER (LOGOUT, pl); |
|
|
1199 | LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->ns->host); |
|
|
1200 | } |
|
|
1201 | |
|
|
1202 | char buf[MAX_BUF]; |
|
|
1203 | |
|
|
1204 | sprintf (buf, "%s left the game.", &pl->ob->name); |
|
|
1205 | new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, 0, buf); |
|
|
1206 | } |
|
|
1207 | |
|
|
1208 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
1209 | leave_map (pl->ob); |
|
|
1210 | |
|
|
1211 | pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */ |
|
|
1212 | } |
|
|
1213 | |
1300 | /* We do this so that the socket handling routine can do the final |
1214 | /* We do this so that the socket handling routine can do the final |
1301 | * cleanup. We also leave that loop to actually handle the freeing |
1215 | * cleanup. We also leave that loop to actually handle the freeing |
1302 | * of the data. |
1216 | * of the data. |
1303 | */ |
1217 | */ |
1304 | if (pl->ob->type != DEAD_OBJECT) |
1218 | if (pl->ns) |
1305 | { |
1219 | pl->ns->destroy (); |
1306 | pl->socket.status = Ns_Dead; |
|
|
1307 | |
1220 | |
1308 | /* If a hidden dm dropped connection do not create |
|
|
1309 | * inconsistencies by showing that they have left the game |
|
|
1310 | */ |
|
|
1311 | if (!(QUERY_FLAG (pl->ob, FLAG_WIZ) && pl->ob->contr->hidden) |
|
|
1312 | && draw_exit && (pl->state != ST_GET_NAME && pl->state != ST_GET_PASSWORD && pl->state != ST_CONFIRM_PASSWORD)) |
|
|
1313 | { |
|
|
1314 | if (pl->ob->map) |
|
|
1315 | { |
|
|
1316 | INVOKE_PLAYER (LOGOUT, pl); |
|
|
1317 | LOG (llevInfo, "LOGOUT: Player named %s from ip %s\n", &pl->ob->name, pl->socket.host); |
|
|
1318 | } |
|
|
1319 | |
|
|
1320 | char buf[MAX_BUF]; |
|
|
1321 | |
|
|
1322 | sprintf (buf, "%s left the game.", &pl->ob->name); |
|
|
1323 | new_draw_info (NDI_UNIQUE | NDI_ALL | NDI_DK_ORANGE, 5, NULL, buf); |
|
|
1324 | } |
|
|
1325 | |
|
|
1326 | if (!QUERY_FLAG (pl->ob, FLAG_REMOVED)) |
|
|
1327 | leave_map (pl->ob); |
|
|
1328 | |
|
|
1329 | pl->ob->type = DEAD_OBJECT; /* To avoid problems with inventory window */ |
|
|
1330 | } |
|
|
1331 | } |
1221 | } |
1332 | } |
1222 | } |
1333 | |
1223 | |
1334 | int |
1224 | int |
1335 | forbid_play (void) |
1225 | forbid_play (void) |
… | |
… | |
1398 | extern unsigned long todtick; |
1288 | extern unsigned long todtick; |
1399 | |
1289 | |
1400 | void |
1290 | void |
1401 | do_specials (void) |
1291 | do_specials (void) |
1402 | { |
1292 | { |
1403 | |
|
|
1404 | #ifdef WATCHDOG |
|
|
1405 | if (!(pticks % 503)) |
|
|
1406 | watchdog (); |
|
|
1407 | #endif |
|
|
1408 | |
|
|
1409 | if (!(pticks % PTICKS_PER_CLOCK)) |
1293 | if (!(pticks % PTICKS_PER_CLOCK)) |
1410 | tick_the_clock (); |
1294 | tick_the_clock (); |
1411 | |
1295 | |
1412 | if (!(pticks % 7)) |
1296 | if (!(pticks % 7)) |
1413 | shstr::gc (); |
1297 | shstr::gc (); |
… | |
… | |
1434 | void |
1318 | void |
1435 | server_tick () |
1319 | server_tick () |
1436 | { |
1320 | { |
1437 | nroferrors = 0; |
1321 | nroferrors = 0; |
1438 | |
1322 | |
|
|
1323 | // first do the user visible stuff |
1439 | doeric_server (); |
1324 | doeric_server (); |
1440 | INVOKE_GLOBAL (CLOCK); |
1325 | INVOKE_GLOBAL (CLOCK); |
1441 | process_events (NULL); /* "do" something with objects with speed */ |
1326 | process_events (); /* "do" something with objects with speed */ |
1442 | flush_sockets (); |
1327 | flush_sockets (); |
|
|
1328 | |
|
|
1329 | // then do some bookkeeping, should not really be here |
1443 | check_active_maps (); /* Removes unused maps after a certain timeout */ |
1330 | check_active_maps (); /* Removes unused maps after a certain timeout */ |
1444 | do_specials (); /* Routines called from time to time. */ |
1331 | do_specials (); /* Routines called from time to time. */ |
1445 | object::free_mortals (); |
1332 | attachable::check_mortals (); |
1446 | |
1333 | |
1447 | ++pticks; |
1334 | ++pticks; |
1448 | } |
1335 | } |
1449 | |
1336 | |
1450 | int |
1337 | int |