| 1 |
/* |
| 2 |
* This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
| 3 |
* |
| 4 |
* Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
| 5 |
* Copyright (©) 2001-2003,2007 Mark Wedel & Crossfire Development Team |
| 6 |
* Copyright (©) 1992,2007 Frank Tore Johansen |
| 7 |
* |
| 8 |
* Crossfire TRT is free software; you can redistribute it and/or modify it |
| 9 |
* under the terms of the GNU General Public License as published by the Free |
| 10 |
* Software Foundation; either version 2 of the License, or (at your option) |
| 11 |
* any later version. |
| 12 |
* |
| 13 |
* This program is distributed in the hope that it will be useful, but |
| 14 |
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
| 15 |
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 16 |
* for more details. |
| 17 |
* |
| 18 |
* You should have received a copy of the GNU General Public License along |
| 19 |
* with Crossfire TRT; if not, write to the Free Software Foundation, Inc. 51 |
| 20 |
* Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA |
| 21 |
* |
| 22 |
* The authors can be reached via e-mail to <crossfire@schmorp.de> |
| 23 |
*/ |
| 24 |
|
| 25 |
#include <global.h> |
| 26 |
#include <object.h> |
| 27 |
#include <tod.h> |
| 28 |
|
| 29 |
#include <sproto.h> |
| 30 |
#include <time.h> |
| 31 |
|
| 32 |
#include <../random_maps/random_map.h> |
| 33 |
#include <../random_maps/rproto.h> |
| 34 |
#include "path.h" |
| 35 |
|
| 36 |
static char days[7][4] = { |
| 37 |
"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat" |
| 38 |
}; |
| 39 |
|
| 40 |
void |
| 41 |
version (object *op) |
| 42 |
{ |
| 43 |
new_draw_info_format (NDI_UNIQUE, 0, op, "This is Crossfire+ v%s", VERSION); |
| 44 |
|
| 45 |
new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to this program:"); |
| 46 |
new_draw_info (NDI_UNIQUE, 0, op, "Marc A. Lehmann <pcg@goof.com>"); |
| 47 |
new_draw_info (NDI_UNIQUE, 0, op, "Robin Redeker <elmex@x-paste.de>"); |
| 48 |
new_draw_info (NDI_UNIQUE, 0, op, "Pippijn van Steenhoven <pip88nl@gmail.com>"); |
| 49 |
new_draw_info (NDI_UNIQUE, 0, op, ""); |
| 50 |
new_draw_info (NDI_UNIQUE, 0, op, "Authors and contributors to the original Crossfire:"); |
| 51 |
new_draw_info (NDI_UNIQUE, 0, op, "Mark Wedel <mwedel@sonic.net>"); |
| 52 |
new_draw_info (NDI_UNIQUE, 0, op, "Frank Tore Johansen <frankj@ifi.uio.no>"); |
| 53 |
new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Torgrim Homme <kjetilho@ifi.uio.no>"); |
| 54 |
new_draw_info (NDI_UNIQUE, 0, op, "Tyler Van Gorder <tvangod@ecst.csuchico.edu>"); |
| 55 |
new_draw_info (NDI_UNIQUE, 0, op, "Tony Elmroth <elmroth@cd.chalmers.se>"); |
| 56 |
new_draw_info (NDI_UNIQUE, 0, op, "Dougal Scott <dougal.scott@fcit.monasu.edu.au>"); |
| 57 |
new_draw_info (NDI_UNIQUE, 0, op, "William <wchuang@athena.mit.edu>"); |
| 58 |
new_draw_info (NDI_UNIQUE, 0, op, "Geoff Bailey <ftww@cs.su.oz.au>"); |
| 59 |
new_draw_info (NDI_UNIQUE, 0, op, "Kjetil Wiekhorst Jørgensen <jorgens@flipper.pvv.unit.no>"); |
| 60 |
new_draw_info (NDI_UNIQUE, 0, op, "Cameron Blackwood <c.blackwood@rdt.monash.edu.au>"); |
| 61 |
new_draw_info (NDI_UNIQUE, 0, op, "Joseph L. Traub <jtraub+@cmu.edu>"); |
| 62 |
new_draw_info (NDI_UNIQUE, 0, op, "Rupert G. Goldie <rgg@aaii.oz.au>"); |
| 63 |
new_draw_info (NDI_UNIQUE, 0, op, "Eric A. Anderson <eanders+@cmu.edu>"); |
| 64 |
new_draw_info (NDI_UNIQUE, 0, op, "Rickard Eneqvist <eneq@Prag.DoCS.UU.SE>"); |
| 65 |
new_draw_info (NDI_UNIQUE, 0, op, "Jarkko Sonninen <Jarkko.Sonninen@lut.fi>"); |
| 66 |
new_draw_info (NDI_UNIQUE, 0, op, "Karl Holland <kholland@sunlab.cit.cornell.du>"); |
| 67 |
new_draw_info (NDI_UNIQUE, 0, op, "Mikael Lundgren <vick@bern.docs.uu.se>"); |
| 68 |
new_draw_info (NDI_UNIQUE, 0, op, "Mikael Olsson <mol@meryl.csd.uu.se>"); |
| 69 |
new_draw_info (NDI_UNIQUE, 0, op, "Tero Haatanen <Tero.Haatanen@lut.fi>"); |
| 70 |
new_draw_info (NDI_UNIQUE, 0, op, "Lasse Ylitalo <ylitalo@student.docs.uu.se>"); |
| 71 |
new_draw_info (NDI_UNIQUE, 0, op, "Niilo Neuvo <anipa@guru.magic.fi>"); |
| 72 |
new_draw_info (NDI_UNIQUE, 0, op, "Markku J{rvinen <mta@modeemi.cs.tut.fi>"); |
| 73 |
new_draw_info (NDI_UNIQUE, 0, op, "Sylvain Meunier <meunier@inf.enst.fr>"); |
| 74 |
new_draw_info (NDI_UNIQUE, 0, op, "Jason Fosback <jfosback@darmok.uoregon.edu>"); |
| 75 |
new_draw_info (NDI_UNIQUE, 0, op, "Carl Edman <cedman@capitalist.princeton.edu>"); |
| 76 |
new_draw_info (NDI_UNIQUE, 0, op, "Charles Henrich <henrich@crh.cl.msu.edu>"); |
| 77 |
new_draw_info (NDI_UNIQUE, 0, op, "Gregor Schmid <schmid@fb3-s7.math.tu-berlin.de>"); |
| 78 |
new_draw_info (NDI_UNIQUE, 0, op, "Raphael Quinet <quinet@montefiore.ulg.ac.be>"); |
| 79 |
new_draw_info (NDI_UNIQUE, 0, op, "Jari Vanhala <jam@modeemi.cs.tut.fi>"); |
| 80 |
new_draw_info (NDI_UNIQUE, 0, op, "Tero Kivinen <kivinen@joker.cs.hut.fi>"); |
| 81 |
new_draw_info (NDI_UNIQUE, 0, op, "Peter Mardahl <peterm@soda.berkeley.edu>"); |
| 82 |
new_draw_info (NDI_UNIQUE, 0, op, "Matthew Zeher <matt@cs.odu.edu>"); |
| 83 |
new_draw_info (NDI_UNIQUE, 0, op, "Scott R. Turner <srt@sun-dimas.aero.org>"); |
| 84 |
new_draw_info (NDI_UNIQUE, 0, op, "Ben Fennema <huma@netcom.com>"); |
| 85 |
new_draw_info (NDI_UNIQUE, 0, op, "Nick Williams <njw@cs.city.ac.uk>"); |
| 86 |
new_draw_info (NDI_UNIQUE, 0, op, "Laurent Wacrenier <Wacren@Gin.ObsPM.Fr>"); |
| 87 |
new_draw_info (NDI_UNIQUE, 0, op, "Brian Thomas <thomas@astro.psu.edu>"); |
| 88 |
new_draw_info (NDI_UNIQUE, 0, op, "John Steven Moerk <jsm@axon.ksc.nasa.gov>"); |
| 89 |
new_draw_info (NDI_UNIQUE, 0, op, "Delbecq David <david.delbecq@mailandnews.com>"); |
| 90 |
new_draw_info (NDI_UNIQUE, 0, op, "Chachkoff Yann <yann.chachkoff@mailandnews.com>\n"); |
| 91 |
new_draw_info (NDI_UNIQUE, 0, op, ""); |
| 92 |
new_draw_info (NDI_UNIQUE, 0, op, "Images and art:"); |
| 93 |
new_draw_info (NDI_UNIQUE, 0, op, "Peter Gardner"); |
| 94 |
new_draw_info (NDI_UNIQUE, 0, op, "David Gervais <david_eg@mail.com>"); |
| 95 |
new_draw_info (NDI_UNIQUE, 0, op, "Mitsuhiro Itakura <ita@gold.koma.jaeri.go.jp>"); |
| 96 |
new_draw_info (NDI_UNIQUE, 0, op, "Hansjoerg Malthaner <hansjoerg.malthaner@danet.de>"); |
| 97 |
new_draw_info (NDI_UNIQUE, 0, op, "Mårten Woxberg <maxmc@telia.com>"); |
| 98 |
new_draw_info (NDI_UNIQUE, 0, op, ""); |
| 99 |
new_draw_info (NDI_UNIQUE, 0, op, "And many more!"); |
| 100 |
} |
| 101 |
|
| 102 |
/* This is a basic little function to put the player back to his |
| 103 |
* savebed. We do some error checking - its possible that the |
| 104 |
* savebed map may no longer exist, so we make sure the player |
| 105 |
* goes someplace. |
| 106 |
*/ |
| 107 |
void |
| 108 |
enter_player_savebed (object *op) |
| 109 |
{ |
| 110 |
object *tmp = object::create (); |
| 111 |
EXIT_PATH (tmp) = op->contr->savebed_map; |
| 112 |
EXIT_X (tmp) = op->contr->bed_x; |
| 113 |
EXIT_Y (tmp) = op->contr->bed_y; |
| 114 |
op->enter_exit (tmp); |
| 115 |
tmp->destroy (); |
| 116 |
} |
| 117 |
|
| 118 |
/* |
| 119 |
* enter_map(): Moves the player and pets from current map (if any) to |
| 120 |
* new map. map, x, y must be set. map is the map we are moving the |
| 121 |
* player to - it could be the map he just came from if the load failed for |
| 122 |
* whatever reason. If default map coordinates are to be used, then |
| 123 |
* the function that calls this should figure them out. |
| 124 |
*/ |
| 125 |
void |
| 126 |
object::enter_map (maptile *newmap, int x, int y) |
| 127 |
{ |
| 128 |
if (destroyed () || !newmap || newmap->in_memory != MAP_IN_MEMORY) |
| 129 |
return; |
| 130 |
|
| 131 |
if (out_of_map (newmap, x, y)) |
| 132 |
{ |
| 133 |
LOG (llevError, "enter_map: supplied coordinates are not within the map! (%s: %d, %d)\n", &newmap->path, x, y); |
| 134 |
x = newmap->enter_x; |
| 135 |
y = newmap->enter_y; |
| 136 |
if (out_of_map (newmap, x, y)) |
| 137 |
{ |
| 138 |
LOG (llevError, "enter_map: map %s provides invalid default enter location (%d, %d) > (%d, %d)\n", |
| 139 |
&newmap->path, x, y, newmap->width, newmap->height); |
| 140 |
new_draw_info (NDI_UNIQUE, 0, this, "The exit is closed"); |
| 141 |
return; |
| 142 |
} |
| 143 |
} |
| 144 |
|
| 145 |
if (contr && map != newmap && map) |
| 146 |
if (INVOKE_MAP (LEAVE, map, ARG_PLAYER (contr))) |
| 147 |
return; |
| 148 |
|
| 149 |
// remove, so stupid ob_locked does not trigger a failure |
| 150 |
remove (); |
| 151 |
|
| 152 |
/* try to find a spot for the player */ |
| 153 |
if (ob_blocked (this, newmap, x, y)) |
| 154 |
{ /* First choice blocked */ |
| 155 |
/* We try to find a spot for the player, starting closest in. |
| 156 |
* We could use find_first_free_spot, but that doesn't randomize it at all, |
| 157 |
* So for example, if the north space is free, you would always end up there even |
| 158 |
* if other spaces around are available. |
| 159 |
* Note that for the second and third calls, we could start at a position other |
| 160 |
* than one, but then we could end up on the other side of walls and so forth. |
| 161 |
*/ |
| 162 |
int i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE1 + 1); |
| 163 |
|
| 164 |
if (i == -1) |
| 165 |
{ |
| 166 |
i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE2 + 1); |
| 167 |
if (i == -1) |
| 168 |
i = find_free_spot (this, newmap, x, y, 1, SIZEOFFREE); |
| 169 |
} |
| 170 |
|
| 171 |
if (i != -1) |
| 172 |
{ |
| 173 |
x += freearr_x[i]; |
| 174 |
y += freearr_y[i]; |
| 175 |
} |
| 176 |
else |
| 177 |
/* not much we can do in this case. */ |
| 178 |
LOG (llevInfo, "enter_map: Could not find free spot for player - will dump on top of object (%s: %d, %d)\n", &newmap->path, x, y); |
| 179 |
} |
| 180 |
|
| 181 |
if (contr && map != newmap) |
| 182 |
{ |
| 183 |
if (INVOKE_PLAYER (MAP_CHANGE, contr, ARG_MAP (newmap), ARG_INT (x), ARG_INT (y))) |
| 184 |
return; |
| 185 |
|
| 186 |
if (INVOKE_MAP (ENTER, newmap, ARG_PLAYER (contr), ARG_INT (x), ARG_INT (y))) |
| 187 |
return; |
| 188 |
} |
| 189 |
|
| 190 |
this->x = x; |
| 191 |
this->y = y; |
| 192 |
map = newmap; |
| 193 |
|
| 194 |
insert_ob_in_map (this, map, 0, INS_NO_WALK_ON); |
| 195 |
|
| 196 |
enemy = 0; |
| 197 |
|
| 198 |
if (contr) |
| 199 |
{ |
| 200 |
contr->maplevel = newmap->path; |
| 201 |
contr->count = 0; |
| 202 |
} |
| 203 |
|
| 204 |
/* Update any golems */ |
| 205 |
if (type == PLAYER) |
| 206 |
if (object *golem = contr->golem) |
| 207 |
{ |
| 208 |
int i = find_free_spot (golem, newmap, x, y, 1, SIZEOFFREE); |
| 209 |
|
| 210 |
if (i < 0) |
| 211 |
golem->destroy (); |
| 212 |
else |
| 213 |
{ |
| 214 |
newmap->insert (golem, x + freearr_x[i], y + freearr_y[i]); |
| 215 |
golem->direction = find_dir_2 (x - golem->x, y - golem->y); |
| 216 |
} |
| 217 |
} |
| 218 |
|
| 219 |
/* since the players map is already loaded, we don't need to worry |
| 220 |
* about pending objects. |
| 221 |
*/ |
| 222 |
remove_all_pets (newmap); |
| 223 |
} |
| 224 |
|
| 225 |
/* process_players1 and process_players2 do all the player related stuff. |
| 226 |
* I moved it out of process events and process_map. This was to some |
| 227 |
* extent for debugging as well as to get a better idea of the time used |
| 228 |
* by the various functions. process_players1() does the processing before |
| 229 |
* objects have been updated, process_players2() does the processing that |
| 230 |
* is needed after the players have been updated. |
| 231 |
*/ |
| 232 |
static void |
| 233 |
process_players1 () |
| 234 |
{ |
| 235 |
/* Basically, we keep looping until all the players have done their actions. */ |
| 236 |
for (int flag = 1; flag != 0;) |
| 237 |
{ |
| 238 |
flag = 0; |
| 239 |
for_all_players (pl) |
| 240 |
{ |
| 241 |
pl->refcnt_chk (); |
| 242 |
|
| 243 |
if (expect_false (!pl->ob || !pl->ns || !pl->ob->active)) |
| 244 |
continue; |
| 245 |
|
| 246 |
if (handle_newcs_player (pl->ob)) |
| 247 |
flag = 1; |
| 248 |
} |
| 249 |
} |
| 250 |
|
| 251 |
for_all_players (pl) |
| 252 |
{ |
| 253 |
object *ob = pl->ob; |
| 254 |
|
| 255 |
if (expect_false (!ob || !pl->ns || !ob->active)) |
| 256 |
continue; |
| 257 |
|
| 258 |
do_some_living (ob); |
| 259 |
} |
| 260 |
} |
| 261 |
|
| 262 |
static void |
| 263 |
process_players2 () |
| 264 |
{ |
| 265 |
/* Then check if any players should use weapon-speed instead of speed */ |
| 266 |
for_all_players (pl) |
| 267 |
{ |
| 268 |
pl->weapon_sp_left = min (pl->weapon_sp, pl->weapon_sp_left + pl->weapon_sp); |
| 269 |
pl->ob->speed_left = min (pl->ob->speed, pl->ob->speed_left + pl->ob->speed); |
| 270 |
} |
| 271 |
} |
| 272 |
|
| 273 |
void |
| 274 |
process_events () |
| 275 |
{ |
| 276 |
process_players1 (); |
| 277 |
|
| 278 |
for_all_actives (op) |
| 279 |
{ |
| 280 |
/* Now process op */ |
| 281 |
if (expect_false (QUERY_FLAG (op, FLAG_FREED))) |
| 282 |
{ |
| 283 |
LOG (llevError, "BUG: process_events(): Free object on list\n"); |
| 284 |
op->set_speed (0); |
| 285 |
continue; |
| 286 |
} |
| 287 |
|
| 288 |
if (expect_false (!op->has_active_speed ())) |
| 289 |
{ |
| 290 |
LOG (llevError, "BUG: process_events(): Object %s has no speed (%f), " |
| 291 |
"but is on active list\n", op->debug_desc (), op->speed); |
| 292 |
op->set_speed (0); |
| 293 |
continue; |
| 294 |
} |
| 295 |
|
| 296 |
if (expect_false (op->flag [FLAG_REMOVED])) |
| 297 |
{ |
| 298 |
LOG (llevError, "BUG: process_events(): removed object is on active list: %s\n", |
| 299 |
op->debug_desc ()); |
| 300 |
op->set_speed (0); |
| 301 |
continue; |
| 302 |
} |
| 303 |
|
| 304 |
/* Animate the object. Bug or feature that anim_speed |
| 305 |
* is based on ticks, and not the creatures speed? |
| 306 |
*/ |
| 307 |
if (op->anim_speed && op->last_anim >= op->anim_speed) |
| 308 |
{ |
| 309 |
animate_object (op, op->contr ? op->facing : op->direction); |
| 310 |
op->last_anim = 1; |
| 311 |
} |
| 312 |
else |
| 313 |
++op->last_anim; |
| 314 |
|
| 315 |
if (op->speed_left > 0.f) |
| 316 |
{ |
| 317 |
--op->speed_left; |
| 318 |
process_object (op); |
| 319 |
|
| 320 |
if (op->destroyed ()) |
| 321 |
continue; |
| 322 |
} |
| 323 |
|
| 324 |
if (!op->contr) |
| 325 |
op->speed_left = min (abs (op->speed), op->speed_left + abs (op->speed)); |
| 326 |
} |
| 327 |
|
| 328 |
process_players2 (); |
| 329 |
} |
| 330 |
|
| 331 |
/* clean up everything before exiting */ |
| 332 |
void |
| 333 |
emergency_save () |
| 334 |
{ |
| 335 |
LOG (llevDebug, "emergency save begin.\n"); |
| 336 |
|
| 337 |
cfperl_emergency_save (); |
| 338 |
|
| 339 |
LOG (llevDebug, "saving book archive.\n"); |
| 340 |
write_book_archive (); |
| 341 |
|
| 342 |
LOG (llevDebug, "emergency save done.\n"); |
| 343 |
} |
| 344 |
|
| 345 |
// send all clients some informational text |
| 346 |
static void |
| 347 |
cleanup_inform (const char *cause, bool make_core) |
| 348 |
{ |
| 349 |
int flags = NDI_UNIQUE | NDI_ALL | (make_core ? NDI_RED : NDI_GREEN); |
| 350 |
|
| 351 |
new_draw_info_format (flags, 0, 0, "The server will now shutdown."); |
| 352 |
new_draw_info_format (flags, 0, 0, "Cause for this shutdown: %s", cause); |
| 353 |
|
| 354 |
if (make_core) |
| 355 |
new_draw_info_format (flags, 0, 0, "This is considered a crash, but all maps and players have been saved."); |
| 356 |
else |
| 357 |
new_draw_info_format (flags, 0, 0, "This is considered to be a clean shutdown, and all maps and players will be saved now."); |
| 358 |
|
| 359 |
new_draw_info_format (flags, 0, 0, "%s", CLEANUP_MESSAGE); |
| 360 |
|
| 361 |
flush_sockets (); |
| 362 |
} |
| 363 |
|
| 364 |
/* clean up everything before exiting */ |
| 365 |
void |
| 366 |
cleanup (const char *cause, bool make_core) |
| 367 |
{ |
| 368 |
if (make_core) |
| 369 |
fork_abort (cause); |
| 370 |
|
| 371 |
LOG (llevError, "cleanup cause: %s\n", cause); |
| 372 |
|
| 373 |
if (!make_core) |
| 374 |
cleanup_inform (cause, make_core); |
| 375 |
|
| 376 |
LOG (llevDebug, "cleanup begin.\n"); |
| 377 |
|
| 378 |
if (init_done && !in_cleanup) |
| 379 |
{ |
| 380 |
in_cleanup = true; |
| 381 |
emergency_save (); |
| 382 |
} |
| 383 |
else |
| 384 |
in_cleanup = true; |
| 385 |
|
| 386 |
LOG (llevDebug, "running cleanup handlers.\n"); |
| 387 |
INVOKE_GLOBAL (CLEANUP); |
| 388 |
|
| 389 |
LOG (llevDebug, "cleanup done.\n"); |
| 390 |
|
| 391 |
if (make_core) |
| 392 |
{ |
| 393 |
cleanup_inform (cause, make_core); |
| 394 |
cfperl_cleanup (make_core); |
| 395 |
_exit (1); |
| 396 |
} |
| 397 |
else |
| 398 |
{ |
| 399 |
new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "Maps and players successfully saved, exiting."); |
| 400 |
new_draw_info_format (NDI_UNIQUE | NDI_ALL | NDI_GREEN, 0, 0, "And again: " CLEANUP_MESSAGE); |
| 401 |
flush_sockets (); |
| 402 |
cfperl_cleanup (make_core); |
| 403 |
_exit (0); |
| 404 |
} |
| 405 |
} |
| 406 |
|
| 407 |
int |
| 408 |
forbid_play (void) |
| 409 |
{ |
| 410 |
#if !defined(_IBMR2) && !defined(___IBMR2) && defined(PERM_FILE) |
| 411 |
char buf[MAX_BUF], day[MAX_BUF]; |
| 412 |
FILE *fp; |
| 413 |
time_t clock; |
| 414 |
struct tm *tm; |
| 415 |
int i, start, stop, forbit = 0, comp; |
| 416 |
|
| 417 |
clock = time (NULL); |
| 418 |
tm = (struct tm *) localtime (&clock); |
| 419 |
|
| 420 |
sprintf (buf, "%s/%s", settings.confdir, PERM_FILE); |
| 421 |
if ((fp = open_and_uncompress (buf, 0, &comp)) == NULL) |
| 422 |
return 0; |
| 423 |
|
| 424 |
while (fgets (buf, MAX_BUF, fp)) |
| 425 |
{ |
| 426 |
if (buf[0] == '#') |
| 427 |
continue; |
| 428 |
|
| 429 |
if (!strncmp (buf, "msg", 3)) |
| 430 |
{ |
| 431 |
if (forbit) |
| 432 |
while (fgets (buf, MAX_BUF, fp)) /* print message */ |
| 433 |
fputs (buf, logfile); |
| 434 |
break; |
| 435 |
} |
| 436 |
else if (sscanf (buf, "%s %d%*c%d\n", day, &start, &stop) != 3) |
| 437 |
{ |
| 438 |
LOG (llevDebug, "Warning: Incomplete line in permission file ignored.\n"); |
| 439 |
continue; |
| 440 |
} |
| 441 |
|
| 442 |
for (i = 0; i < 7; i++) |
| 443 |
{ |
| 444 |
if (!strncmp (buf, days[i], 3) && (tm->tm_wday == i) && (tm->tm_hour >= start) && (tm->tm_hour < stop)) |
| 445 |
forbit = 1; |
| 446 |
} |
| 447 |
} |
| 448 |
|
| 449 |
close_and_delete (fp, comp); |
| 450 |
|
| 451 |
return forbit; |
| 452 |
#else |
| 453 |
return 0; |
| 454 |
#endif |
| 455 |
} |
| 456 |
|
| 457 |
/* |
| 458 |
* do_specials() is a collection of functions to call from time to time. |
| 459 |
* Modified 2000-1-14 MSW to use the global pticks count to determine how |
| 460 |
* often to do things. This will allow us to spred them out more often. |
| 461 |
* I use prime numbers for the factor count - in that way, it is less likely |
| 462 |
* these actions will fall on the same tick (compared to say using 500/2500/15000 |
| 463 |
* which would mean on that 15,000 tick count a whole bunch of stuff gets |
| 464 |
* done). Of course, there can still be times where multiple specials are |
| 465 |
* done on the same tick, but that will happen very infrequently |
| 466 |
* |
| 467 |
* I also think this code makes it easier to see how often we really are |
| 468 |
* doing the various things. |
| 469 |
*/ |
| 470 |
void |
| 471 |
do_specials (void) |
| 472 |
{ |
| 473 |
if (expect_false (!(pticks % TICKS_PER_HOUR))) |
| 474 |
adjust_daylight (); |
| 475 |
|
| 476 |
if (expect_false (!(pticks % 7))) |
| 477 |
shstr::gc (); |
| 478 |
|
| 479 |
if (expect_false (!(pticks % 2503))) |
| 480 |
fix_weight (); /* Hack to fix weightproblems caused by bugs */ |
| 481 |
|
| 482 |
if (expect_false (!(pticks % 5003))) |
| 483 |
write_book_archive (); |
| 484 |
|
| 485 |
if (expect_false (!(pticks % 5009))) |
| 486 |
clean_friendly_list (); |
| 487 |
|
| 488 |
if (expect_false (!(pticks % 5011))) |
| 489 |
obsolete_parties (); |
| 490 |
|
| 491 |
if (expect_false (!(pticks % 12503))) |
| 492 |
fix_luck (); |
| 493 |
} |
| 494 |
|
| 495 |
void |
| 496 |
server_tick () |
| 497 |
{ |
| 498 |
// first do the user visible stuff |
| 499 |
doeric_server (); |
| 500 |
INVOKE_GLOBAL (CLOCK); |
| 501 |
process_events (); /* "do" something with objects with speed */ |
| 502 |
flush_sockets (); |
| 503 |
|
| 504 |
// then do some bookkeeping, should not really be here |
| 505 |
do_specials (); /* Routines called from time to time. */ |
| 506 |
attachable::check_mortals (); |
| 507 |
|
| 508 |
++pticks; |
| 509 |
} |
| 510 |
|
| 511 |
#if 0 |
| 512 |
// used fro benchmarking (x86/amd64-specific) |
| 513 |
typedef unsigned long tval; |
| 514 |
typedef unsigned long long stamp64; |
| 515 |
|
| 516 |
extern inline tval |
| 517 |
stamp (void) |
| 518 |
{ |
| 519 |
tval tsc; |
| 520 |
asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
| 521 |
|
| 522 |
return tsc; |
| 523 |
} |
| 524 |
|
| 525 |
extern inline tval |
| 526 |
measure (tval t) |
| 527 |
{ |
| 528 |
tval tsc; |
| 529 |
asm volatile ("rdtsc":"=a" (tsc)::"edx"); |
| 530 |
|
| 531 |
if (tsc > t) |
| 532 |
return tsc - t; |
| 533 |
else |
| 534 |
return t - tsc; |
| 535 |
} |
| 536 |
|
| 537 |
int |
| 538 |
main (int argc, char **argv) |
| 539 |
{ |
| 540 |
rand_gen rg(0); |
| 541 |
tval fastest = 0x7fffffff; |
| 542 |
for (int loop = 10000; loop--; ) |
| 543 |
{ |
| 544 |
tval s = stamp (); |
| 545 |
volatile int i = rg.get_int(25); |
| 546 |
fastest = min (fastest, measure (s)); |
| 547 |
} |
| 548 |
|
| 549 |
//printf ("fastest %d\n", fastest); |
| 550 |
for (int i = 0; i < 1024*1024*3; ++i) |
| 551 |
{ |
| 552 |
char c = rg.get_int (256); |
| 553 |
write (2, &c, 1); |
| 554 |
} |
| 555 |
} |
| 556 |
|
| 557 |
#else |
| 558 |
|
| 559 |
// normal main |
| 560 |
int |
| 561 |
main (int argc, char **argv) |
| 562 |
{ |
| 563 |
settings.argc = argc; |
| 564 |
settings.argv = argv; |
| 565 |
|
| 566 |
init (argc, argv); |
| 567 |
|
| 568 |
initPlugins (); |
| 569 |
|
| 570 |
for (;;) |
| 571 |
cfperl_main (); |
| 572 |
} |
| 573 |
#endif |
| 574 |
|
