1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326
|
/*
* static char *rcsid_time_c =
* "$Id: time.c 7568 2007-11-24 21:17:09Z akirschbaum $";
*/
/*
CrossFire, A Multiplayer game for X-windows
Copyright (C) 2006 Mark Wedel & Crossfire Development Team
Copyright (C) 1992 Frank Tore Johansen
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
The authors can be reached via e-mail at crossfire-devel@real-time.com
*/
#include <global.h>
#include <funcpoint.h>
#include <tod.h>
#ifndef WIN32 /* ---win32 exclude header */
#include <stdio.h>
#include <sys/types.h>
#include <sys/time.h>
#endif /* win32 */
/*
* Global variables:
*/
uint32 max_time = MAX_TIME;
struct timeval last_time;
#define PBUFLEN 100
uint32 process_utime_save[PBUFLEN];
uint32 psaveind;
uint32 process_max_utime = 0;
uint32 process_min_utime = 999999999;
uint32 process_tot_mtime;
uint32 pticks;
uint32 process_utime_long_count;
const char *season_name[] =
{
"The Season of New Year",
"The Season of Growth",
"The Season of Harvest",
"The Season of Decay",
"The Season of the Blizzard",
"\n"
};
const char *weekdays[DAYS_PER_WEEK] = {
"the Day of the Moon",
"the Day of the Bull",
"the Day of the Deception",
"the Day of Thunder",
"the Day of Freedom",
"the Day of the Great Gods",
"the Day of the Sun"
};
const char *month_name[MONTHS_PER_YEAR] = {
"Month of Winter", /* 0 */
"Month of the Ice Dragon",
"Month of the Frost Giant",
"Month of Valriel",
"Month of Lythander",
"Month of the Harvest",
"Month of Gaea",
"Month of Futility",
"Month of the Dragon",
"Month of the Sun",
"Month of the Great Infernus",
"Month of Ruggilli",
"Month of the Dark Shades",
"Month of the Devourers",
"Month of Sorig",
"Month of the Ancient Darkness",
"Month of Gorokh"
};
/*
* Initialise all variables used in the timing routines.
*/
void
reset_sleep(void)
{
int i;
for(i = 0; i < PBUFLEN; i++)
process_utime_save[i] = 0;
psaveind = 0;
process_max_utime = 0;
process_min_utime = 999999999;
process_tot_mtime = 0;
pticks = 0;
(void) GETTIMEOFDAY(&last_time);
}
void
log_time(long process_utime)
{
pticks++;
if (++psaveind >= PBUFLEN)
psaveind = 0;
process_utime_save[psaveind] = process_utime;
if (process_utime > process_max_utime)
process_max_utime = process_utime;
if (process_utime < process_min_utime)
process_min_utime = process_utime;
process_tot_mtime += process_utime/1000;
}
/*
* enough_elapsed_time will return true if the time passed since
* last tick is more than max-time.
*/
int
enough_elapsed_time(void)
{
static struct timeval new_time;
long elapsed_utime;
(void) GETTIMEOFDAY(&new_time);
elapsed_utime = (new_time.tv_sec - last_time.tv_sec) * 1000000 +
new_time.tv_usec - last_time.tv_usec;
if (elapsed_utime > max_time) {
log_time(elapsed_utime);
last_time.tv_sec = new_time.tv_sec;
last_time.tv_usec = new_time.tv_usec;
return 1;
}
return 0;
}
/*
* sleep_delta checks how much time has elapsed since last tick.
* If it is less than max_time, the remaining time is slept with select().
*/
void
sleep_delta(void)
{
static struct timeval new_time;
long sleep_sec, sleep_usec;
(void) GETTIMEOFDAY(&new_time);
sleep_sec = last_time.tv_sec - new_time.tv_sec;
sleep_usec = max_time - (new_time.tv_usec - last_time.tv_usec);
/* This is very ugly, but probably the fastest for our use: */
while (sleep_usec < 0) {
sleep_usec += 1000000;
sleep_sec -= 1;
}
while (sleep_usec > 1000000) {
sleep_usec -= 1000000;
sleep_sec +=1;
}
log_time((new_time.tv_sec - last_time.tv_sec)*1000000
+ new_time.tv_usec - last_time.tv_usec);
if (sleep_sec >= 0 && sleep_usec > 0) {
static struct timeval sleep_time;
sleep_time.tv_sec = sleep_sec;
sleep_time.tv_usec = sleep_usec;
#ifndef WIN32 /* 'select' doesn't work on Windows, 'Sleep' is used instead */
select(0, NULL, NULL, NULL, &sleep_time);
#else
if (sleep_time.tv_sec) Sleep(sleep_time.tv_sec*1000);
Sleep((int)(sleep_time.tv_usec/1000.));
#endif
}
else
process_utime_long_count++;
/*
* Set last_time to when we're expected to wake up:
*/
last_time.tv_usec += max_time;
while (last_time.tv_usec > 1000000) {
last_time.tv_usec -= 1000000;
last_time.tv_sec++;
}
/*
* Don't do too much catching up:
* (Things can still get jerky on a slow/loaded computer)
*/
if (last_time.tv_sec * 1000000 + last_time.tv_usec <
new_time.tv_sec * 1000000 + new_time.tv_usec)
{
last_time.tv_sec = new_time.tv_sec;
last_time.tv_usec = new_time.tv_usec;
}
}
void
set_max_time(long t) {
max_time = t;
}
extern unsigned long todtick;
void
get_tod(timeofday_t *tod)
{
tod->year = todtick/HOURS_PER_YEAR;
tod->month = (todtick/HOURS_PER_MONTH)%MONTHS_PER_YEAR;
tod->day = (todtick%HOURS_PER_MONTH)/DAYS_PER_MONTH;
tod->dayofweek = tod->day%DAYS_PER_WEEK;
tod->hour = todtick%HOURS_PER_DAY;
tod->minute = (pticks%PTICKS_PER_CLOCK)/(PTICKS_PER_CLOCK/58);
if (tod->minute > 58)
tod->minute = 58; /* it's imprecise at best anyhow */
tod->weekofmonth = tod->day/WEEKS_PER_MONTH;
if (tod->month < 3)
tod->season = 0;
else if (tod->month < 6)
tod->season = 1;
else if (tod->month < 9)
tod->season = 2;
else if (tod->month < 12)
tod->season = 3;
else
tod->season = 4;
}
void
print_tod(object *op)
{
timeofday_t tod;
const char *suf;
int day;
get_tod(&tod);
sprintf(errmsg, "It is %d minute%s past %d o'clock %s, on %s",
tod.minute+1, ((tod.minute+1 < 2) ? "" : "s"),
((tod.hour % 14 == 0) ? 14 : ((tod.hour)%14)),
((tod.hour >= 14) ? "pm" : "am"),
weekdays[tod.dayofweek]);
new_draw_info(NDI_UNIQUE, 0,op,errmsg);
day = tod.day + 1;
if (day == 1 || ((day % 10) == 1 && day > 20))
suf = "st";
else if (day == 2 || ((day % 10) == 2 && day > 20))
suf = "nd";
else if (day == 3 || ((day % 10) == 3 && day > 20))
suf = "rd";
else
suf = "th";
sprintf(errmsg, "The %d%s Day of the %s, Year %d", day, suf,
month_name[tod.month], tod.year+1);
new_draw_info(NDI_UNIQUE, 0,op,errmsg);
sprintf(errmsg, "Time of Year: %s", season_name[tod.season]);
new_draw_info(NDI_UNIQUE, 0,op,errmsg);
}
void
time_info(object *op)
{
int tot = 0, maxt = 0, mint = 99999999, long_count = 0, i;
print_tod(op);
if (!QUERY_FLAG(op,FLAG_WIZ))
return;
new_draw_info (NDI_UNIQUE, 0,op,"Total time:");
sprintf(errmsg,"ticks=%d time=%d.%2d",
pticks, process_tot_mtime/1000, process_tot_mtime%1000);
new_draw_info (NDI_UNIQUE, 0,op,errmsg);
sprintf(errmsg,"avg time=%dms max time=%dms min time=%dms",
process_tot_mtime/pticks, process_max_utime/1000,
process_min_utime/1000);
new_draw_info (NDI_UNIQUE, 0,op,errmsg);
sprintf(errmsg,"ticks longer than max time (%dms) = %d (%d%%)",
max_time/1000,
process_utime_long_count, 100*process_utime_long_count/pticks);
new_draw_info (NDI_UNIQUE, 0,op,errmsg);
sprintf(errmsg,"Time last %d ticks:", pticks > PBUFLEN ? PBUFLEN : pticks);
new_draw_info (NDI_UNIQUE, 0,op,errmsg);
for (i = 0; i < (pticks > PBUFLEN ? PBUFLEN : pticks); i++) {
tot += process_utime_save[i];
if (process_utime_save[i] > maxt) maxt = process_utime_save[i];
if (process_utime_save[i] < mint) mint = process_utime_save[i];
if (process_utime_save[i] > max_time) long_count++;
}
sprintf(errmsg,"avg time=%dms max time=%dms min time=%dms",
tot/(pticks > PBUFLEN ? PBUFLEN : pticks)/1000, maxt/1000,
mint/1000);
new_draw_info (NDI_UNIQUE, 0,op,errmsg);
sprintf(errmsg,"ticks longer than max time (%dms) = %d (%d%%)",
max_time/1000, long_count,
100*long_count/(pticks > PBUFLEN ? PBUFLEN : pticks));
new_draw_info (NDI_UNIQUE, 0,op,errmsg);
}
long
seconds(void)
{
struct timeval now;
(void) GETTIMEOFDAY(&now);
return now.tv_sec;
}
|