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 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553
|
/**********************************************************************
* This source code is copyright 1999 by Gus Hartmann & Peter Keller *
* It may be distributed under the terms of the GNU General Purpose *
* License, version 2 or above; see the file COPYING for more *
* information. *
* *
* $Id: pbests.c,v 1.29 2000/11/07 05:31:09 hartmann Exp $
* *
**********************************************************************/
#include "sweep.h"
static struct BestFileDesc* NewBFD(void);
static void LoadBestTimesFile(struct BestFileDesc *bfd, char *filename);
static void BFDSort(struct BestFileDesc *bfd);
static void InsertEntry(struct BestFileDesc *bfd, struct BestEntry *n);
static void SaveBestTimesFile(struct BestFileDesc *bfd, char *filename);
static struct BestEntry* NewBestEntry(GameStats *Game);
static void Unpack(struct BestFileDesc *bfd, FILE *abyss);
static void Pack(struct BestFileDesc *bfd, FILE *fp);
static int BECmpFunc(const void *l, const void *r);
static void tlockf(FILE *fp, char * name);
static void tunlockf(FILE *fp);
static void DumpBFD(struct BestFileDesc *bfd, int valid);
extern int errno;
/* need a simple line buffer */
struct MBuf
{
unsigned int len;
char *buf;
};
/* the one function that does it all */
void UpdateBestTimesFile(GameStats *Game, char *filename)
{
struct BestFileDesc *bfd = NULL;
struct BestEntry *b = NULL;
bfd = NewBFD();
b = NewBestEntry(Game);
DumpGame(Game);
LoadBestTimesFile(bfd, filename);
DumpBFD(bfd, FALSE);
fflush(NULL);
InsertEntry(bfd, b);
DumpBFD(bfd, TRUE);
fflush(NULL);
BFDSort(bfd);
DumpBFD(bfd, TRUE);
fflush(NULL);
SaveBestTimesFile(bfd, filename);
fflush(NULL);
free(b);
free(bfd->ents);
free(bfd);
}
/* construct a new best file descriptor */
struct BestFileDesc* NewBFD(void)
{
struct BestFileDesc *bfd = NULL;
bfd = (struct BestFileDesc*)xmalloc(sizeof(struct BestFileDesc) * 1);
bfd->ents = NULL;
bfd->numents = 0;
bfd->replflag = FALSE;
return bfd;
}
/* summon from the depths of the abyss the best times file */
void LoadBestTimesFile(struct BestFileDesc *bfd, char *truename)
{
FILE *abyss = NULL;
again:
abyss = fopen(truename, "r+");
if (abyss == NULL)
{
abyss = fopen(truename, "w");
tlockf(abyss, truename);
fprintf(abyss, "0\n0\n");
tunlockf(abyss);
fclose(abyss);
goto again; /* XXX So sue me, I'm lazy */
}
tlockf(abyss, truename);
/* take the ascii/binary mess the file is and make it into a nice bfd */
Unpack(bfd, abyss);
tunlockf(abyss);
fclose(abyss); /* you just try! */
}
void Unpack(struct BestFileDesc *bfd, FILE *abyss)
{
unsigned char *space = NULL;
unsigned int numents = 0;
unsigned int size = 0;
unsigned int i = 0;
unsigned char *p = NULL;
struct BestEntry *b = NULL;
/* how many entries do I have? */
fscanf(abyss, "%u\n", &numents);
if (numents == 0) /* uh oh, first time */
{
/* one more than I need, for later */
bfd->ents = (struct BestEntry*)xmalloc(sizeof(struct BestEntry));
}
else
{
/* one more than I need, for later */
bfd->ents = (struct BestEntry*)
xmalloc(sizeof(struct BestEntry)*numents +
sizeof(struct BestEntry));
}
bfd->numents = numents; /* yes, this could be zero */
/* how many bytes do I need to read? */
fscanf(abyss, "%u\n", &size);
/* see if there is any hope in hell */
if (size != 0)
{
space = (unsigned char*)xmalloc(sizeof(unsigned char) * size + 1);
/* this also null terminates any string I put into it */
memset(space, 0, sizeof(unsigned char) * size + 1);
/* read it in */
fread(space, size, 1, abyss);
/* convert it to real ascii */
for (i = 0; i < size; i++)
{
/* space[i] ^= MAGIC_NUMBER;*/
}
/* walk through memory looking for newlines and building the entries
* as you go */
p = space;
for (i = 0; i < bfd->numents; i++)
{
b = &bfd->ents[i]; /* save me typing */
/* get all the data out and into the entry */
sscanf((char *)p, "%[^(](a%dm%dt%d)%s",
b->name, &b->area, &b->mines, &b->time, b->date);
while(*p++ != '\n');
}
free(space);
}
}
void BFDSort(struct BestFileDesc *bfd)
{
if (bfd->replflag == TRUE)
{
/* I just replaced a node, everything is still sorted */
return;
}
else
{
/* qsort the whole mess */
qsort(bfd->ents, bfd->numents+1, sizeof(bfd->ents[0]), BECmpFunc);
}
}
/* the Best Entry comparison function */
int BECmpFunc(const void *l, const void *r)
{
struct BestEntry *bl, *br;
bl = (struct BestEntry*)l;
br = (struct BestEntry*)r;
if (bl->area < br->area)
{
return 1;
}
else if (bl->area > br->area)
{
return -1;
}
else if (bl->area == br->area)
{
if (bl->mines < br->mines)
{
return 1;
}
else if (bl->mines > br->mines)
{
return -1;
}
else if (bl->mines == br->mines)
{
if (bl->time < br->time)
{
return 1;
}
else if (bl->time > br->time)
{
return -1;
}
else if (bl->time == br->time)
{
return 0;
}
}
}
/* shut the compiler up */
/* this never happens */
return 0;
}
void InsertEntry(struct BestFileDesc *bfd, struct BestEntry *n)
{
int replaced = FALSE;
int i = 0;
/* search until I find a match */
for (i = 0; i < bfd->numents; i++)
{
/* did the area match? */
if (n->area == bfd->ents[i].area)
{
/* did the number of mines match? */
if (n->mines == bfd->ents[i].mines)
{
/* yup, replace it and mark the flag */
bfd->ents[i].time = n->time;
strncpy(bfd->ents[i].name, n->name, MAX_NAME);
strncpy(bfd->ents[i].date, n->date, MAX_DATE);
replaced = TRUE;
}
}
}
if (replaced == TRUE)
{
bfd->replflag = TRUE;
return;
}
else
{
/* use the x-tra one I got initially */
bfd->ents[bfd->numents].area = n->area;
bfd->ents[bfd->numents].mines = n->mines;
bfd->ents[bfd->numents].time = n->time;
strncpy(bfd->ents[bfd->numents].name, n->name, MAX_NAME);
strncpy(bfd->ents[bfd->numents].date, n->date, MAX_DATE);
}
}
void SaveBestTimesFile(struct BestFileDesc *bfd, char *name)
{
FILE *fp = NULL;
fp = fopen(name, "w");
tlockf(fp, name);
/* convert the bfd to a mess and write it out */
Pack(bfd, fp);
tunlockf(fp);
fclose(fp);
}
void Pack(struct BestFileDesc *bfd, FILE *fp)
{
struct MBuf *mbuf = NULL;
unsigned int bfdnum = 0;
unsigned int maxsize = 0, totalsize = 0;
unsigned int i, j;
struct BestEntry *b = NULL;
/* see how many I need to write out */
if (bfd->replflag == FALSE)
{
bfdnum = bfd->numents + 1;
}
else
{
bfdnum = bfd->numents;
}
mbuf = (struct MBuf*)xmalloc(sizeof(struct MBuf) * bfdnum);
/* compute the maximum size I will need to allocate for each line
* in the buflines array */
/* this is: three unsigned ints converted to ascii + maximum name len +
* maximum date len + 2 paren separators + 3 letters + 1 newline + 1 null */
maxsize = 3 * (unsigned int)ceil(log10(pow(2, sizeof(unsigned int)*8)))
+ MAX_NAME + MAX_DATE + 2 + 3 + 1 + 1;
totalsize = 0;
/* shove the entries into the line buffer */
for (i = 0; i < bfdnum; i++)
{
/* make a new line */
mbuf[i].buf = (char*)xmalloc(sizeof(char) * maxsize + 1);
/* print the line into the buffer */
b = &bfd->ents[i];
#if defined HAVE_SNPRINTF
snprintf(mbuf[i].buf, maxsize, "%s(a%um%ut%u)%s\n",
#else
sprintf(mbuf[i].buf, "%s(a%um%ut%u)%s\n",
#endif
b->name, b->area, b->mines, b->time, b->date);
mbuf[i].len = strlen(mbuf[i].buf);
/* encrypt the data */
for (j = 0; j < mbuf[i].len; j++)
{
/* mbuf[i].buf[j] ^= MAGIC_NUMBER;*/
}
totalsize += mbuf[i].len;
}
/* now that the data is encrypted and ready, shove it out to the file */
/* number of entries */
fprintf(fp, "%u\n", bfdnum);
/* byte size of file */
fprintf(fp, "%u\n", totalsize);
/* the data */
for (i = 0; i < bfdnum; i++)
{
fwrite(mbuf[i].buf, mbuf[i].len, 1, fp);
}
/* free up all of the shit I just used */
for (i = 0; i < bfdnum; i++)
{
free(mbuf[i].buf);
}
free(mbuf);
}
struct BestEntry* NewBestEntry(GameStats *Game)
{
struct BestEntry *b = NULL;
time_t now;
char *buf = NULL, *p = NULL;
b = (struct BestEntry*)xmalloc(sizeof(struct BestEntry) * 1);
/* fill in some attributes */
b->area = Game->Height * Game->Width;
b->mines = Game->NumMines;
b->time = Game->Time;
/* do the username */
buf = getenv("USER");
if (buf == NULL)
{
SweepError("You do not have a username!");
buf = "unknown";
}
strcpy(b->name, buf);
/* get the real time it was completed */
time(&now);
buf = ctime(&now);
if (buf == NULL)
{
buf = "unknown";
}
p = strchr(buf, '\n'); /* some clean up work */
if (p != NULL)
{
*p = 0;
}
strcpy(b->date, buf);
/* add _ instead of spaces for easier data format storage */
while((p = strchr(b->date, ' ')) != NULL)
{
*p = '_';
}
return b;
}
/* Full Path To Best Times File in HOME */
char* FPTBTF(void)
{
char *home = NULL;
char *fp = NULL;
home = getenv("HOME");
if (home == NULL)
{
SweepError("You don't have a home dir!");
/* XXX fix this up */
exit(EXIT_FAILURE);
}
/* get me some memory for the string */
fp = (char*)xmalloc(strlen(home) + strlen(DFL_BESTS_FILE) + 2);
/* make the full path */
strcpy(fp, home);
strcat(fp, "/" DFL_BESTS_FILE);
return fp;
}
#if defined USE_GROUP_BEST_FILE
/* full path to group best times file */
char* FPTGBTF(void)
{
char *fp = NULL;
/* get me some memory for the string */
fp = (char*)xmalloc(strlen(mkstr(SCORESDIR)) + 11);
/* make the full path */
strcpy(fp, mkstr(SCORESDIR));
strcat(fp, "/sweeptimes");
return fp;
}
#endif /* USE_GROUP_BEST_FILE */
static void DumpBFD(struct BestFileDesc *bfd, int valid)
{
#ifdef DEBUG_LOG
int i = 0;
fprintf(DebugLog, "BFD DUMP START\n");
fprintf(DebugLog, "Numents -> %u\n", bfd->numents);
fprintf(DebugLog, "Replflag -> %s\n",
bfd->replflag?"TRUE":"FALSE");
for (i = 0; i < bfd->numents; i++)
{
fprintf(DebugLog, "- %s %u %u %u %s\n", bfd->ents[i].name,
bfd->ents[i].area, bfd->ents[i].mines, bfd->ents[i].time,
bfd->ents[i].date);
}
if (valid == TRUE)
{
if (bfd->replflag == FALSE)
{
fprintf(DebugLog, "AND\n");
fprintf(DebugLog, "- %s %u %u %u %s\n", bfd->ents[i].name,
bfd->ents[i].area, bfd->ents[i].mines, bfd->ents[i].time,
bfd->ents[i].date);
}
}
fprintf(DebugLog, "BFD DUMP END\n");
#endif /* DEBUG_LOG */
}
/* Lock a file for exclusive use */
void tlockf(FILE *fp, char *name)
{
int fd;
/* this is actually dark magic. You aren't supposed to mix fileno
* and streams */
fflush(fp);
#if defined(HAVE_FILENO)
fd = fileno(fp);
#else
#error "Need fileno() replacement"
#endif
lseek(fd, 0L, SEEK_SET);
#if defined(HAVE_FLOCK) && defined(HAVE_LOCKF)
if(flock(fd, LOCK_EX) == -1)
#elif defined(HAVE_FLOCK)
if(flock(fd, LOCK_EX) == -1)
#elif defined(HAVE_LOCKF)
if(lockf(fd, F_LOCK, 0L) == -1)
#else
#error "Need flock() or lockf()"
#endif
{
#ifdef DEBUG_LOG
fprintf(DebugLog, "Can't lock file: (%d)%s\n", errno, name);
#endif /* DEBUG_LOG */
SweepError("Cannot lock file: %s\n", name);
exit(EXIT_FAILURE);
}
}
/* unlock a locked file */
void tunlockf(FILE *fp)
{
int fd;
/* this is actually dark magic. You aren't supposed to mix fileno
* and streams */
fflush(fp);
#if defined(HAVE_FILENO)
fd = fileno(fp);
#else
#error "Need fileno() replacement"
#endif
lseek(fd, 0L, SEEK_SET);
#if defined(HAVE_FLOCK) && defined(HAVE_LOCKF)
if(flock(fd, LOCK_UN) == -1)
#elif defined(HAVE_FLOCK)
if(flock(fd, LOCK_UN) == -1)
#elif defined(HAVE_LOCKF)
if(lockf(fd, F_ULOCK, 0L) == -1)
#else
#error "Need flock() or lockf()"
#endif
{
#ifdef DEBUG_LOG
fprintf(DebugLog, "Can't unlock file: %d\n", errno);
#endif /* DEBUG_LOG */
SweepError("Cannot unlock file: %d\n", errno);
exit(EXIT_FAILURE);
}
}
|