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 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790
|
/* $NetBSD: hack.end.c,v 1.6 2003/04/02 18:36:36 jsm Exp $ */
/*
* Copyright (c) 1985, Stichting Centrum voor Wiskunde en Informatica,
* Amsterdam
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* - Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* - Neither the name of the Stichting Centrum voor Wiskunde en
* Informatica, nor the names of its contributors may be used to endorse or
* promote products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright (c) 1982 Jay Fenlason <hack@gnu.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
* THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/cdefs.h>
#ifndef lint
__RCSID("$NetBSD: hack.end.c,v 1.6 2003/04/02 18:36:36 jsm Exp $");
#endif /* not lint */
#include <signal.h>
#include <unistd.h>
#include <stdlib.h>
#include "hack.h"
#include "extern.h"
#define Sprintf (void) sprintf
xchar maxdlevel = 1;
int
dodone()
{
done1(0);
return 0;
}
/*ARGSUSED*/
void
done1(n)
int n __attribute__((__unused__));
{
(void) signal(SIGINT, SIG_IGN);
pline("Really quit?");
if (readchar() != 'y') {
(void) signal(SIGINT, done1);
clrlin();
(void) fflush(stdout);
if (multi > 0)
nomul(0);
return;
}
done("quit");
/* NOTREACHED */
}
int done_stopprint;
int done_hup;
/*ARGSUSED*/
void
done_intr(n)
int n __attribute__((__unused__));
{
done_stopprint++;
(void) signal(SIGINT, SIG_IGN);
(void) signal(SIGQUIT, SIG_IGN);
}
void
done_hangup(n)
int n;
{
done_hup++;
(void) signal(SIGHUP, SIG_IGN);
done_intr(n);
}
void
done_in_by(mtmp)
struct monst *mtmp;
{
static char buf[BUFSZ];
pline("You die ...");
if (mtmp->data->mlet == ' ') {
Sprintf(buf, "the ghost of %s", (char *) mtmp->mextra);
killer = buf;
} else if (mtmp->mnamelth) {
Sprintf(buf, "%s called %s",
mtmp->data->mname, NAME(mtmp));
killer = buf;
} else if (mtmp->minvis) {
Sprintf(buf, "invisible %s", mtmp->data->mname);
killer = buf;
} else
killer = mtmp->data->mname;
done("died");
}
/*
* called with arg "died", "drowned", "escaped", "quit", "choked",
* "panicked", "burned", "starved" or "tricked"
*/
/* Be careful not to call panic from here! */
void
done(st1)
const char *st1;
{
#ifdef WIZARD
if (wizard && *st1 == 'd') {
u.uswldtim = 0;
if (u.uhpmax < 0)
u.uhpmax = 100; /* arbitrary */
u.uhp = u.uhpmax;
pline("For some reason you are still alive.");
flags.move = 0;
if (multi > 0)
multi = 0;
else
multi = -1;
flags.botl = 1;
return;
}
#endif /* WIZARD */
(void) signal(SIGINT, done_intr);
(void) signal(SIGQUIT, done_intr);
(void) signal(SIGHUP, done_hangup);
if (*st1 == 'q' && u.uhp < 1) {
st1 = "died";
killer = "quit while already on Charon's boat";
}
if (*st1 == 's')
killer = "starvation";
else if (*st1 == 'd' && st1[1] == 'r')
killer = "drowning";
else if (*st1 == 'p')
killer = "panic";
else if (*st1 == 't')
killer = "trickery";
else if (!strchr("bcd", *st1))
killer = st1;
paybill();
clearlocks();
if (flags.toplin == 1)
more();
if (strchr("bcds", *st1)) {
#ifdef WIZARD
if (!wizard)
#endif /* WIZARD */
savebones();
if (!flags.notombstone)
outrip();
}
if (*st1 == 'c')
killer = st1; /* after outrip() */
settty((char *) 0); /* does a clear_screen() */
if (!done_stopprint)
printf("Goodbye %s %s...\n\n", pl_character, plname);
{
long int tmp;
tmp = u.ugold - u.ugold0;
if (tmp < 0)
tmp = 0;
if (*st1 == 'd' || *st1 == 'b')
tmp -= tmp / 10;
u.urexp += tmp;
u.urexp += 50 * maxdlevel;
if (maxdlevel > 20)
u.urexp += 1000 * ((maxdlevel > 30) ? 10 : maxdlevel - 20);
}
if (*st1 == 'e') {
struct monst *mtmp;
struct obj *otmp;
int i;
unsigned worthlessct = 0;
boolean has_amulet = FALSE;
killer = st1;
keepdogs();
mtmp = mydogs;
if (mtmp) {
if (!done_stopprint)
printf("You");
while (mtmp) {
if (!done_stopprint)
printf(" and %s", monnam(mtmp));
if (mtmp->mtame)
u.urexp += mtmp->mhp;
mtmp = mtmp->nmon;
}
if (!done_stopprint)
printf("\nescaped from the dungeon with %ld points,\n",
u.urexp);
} else if (!done_stopprint)
printf("You escaped from the dungeon with %ld points,\n",
u.urexp);
for (otmp = invent; otmp; otmp = otmp->nobj) {
if (otmp->olet == GEM_SYM) {
objects[otmp->otyp].oc_name_known = 1;
i = otmp->quan * objects[otmp->otyp].g_val;
if (i == 0) {
worthlessct += otmp->quan;
continue;
}
u.urexp += i;
if (!done_stopprint)
printf("\t%s (worth %d Zorkmids),\n",
doname(otmp), i);
} else if (otmp->olet == AMULET_SYM) {
otmp->known = 1;
i = (otmp->spe < 0) ? 2 : 5000;
u.urexp += i;
if (!done_stopprint)
printf("\t%s (worth %d Zorkmids),\n",
doname(otmp), i);
if (otmp->spe >= 0) {
has_amulet = TRUE;
killer = "escaped (with amulet)";
}
}
}
if (worthlessct)
if (!done_stopprint)
printf("\t%u worthless piece%s of coloured glass,\n",
worthlessct, plur(worthlessct));
if (has_amulet)
u.urexp *= 2;
} else if (!done_stopprint)
printf("You %s on dungeon level %d with %ld points,\n",
st1, dlevel, u.urexp);
if (!done_stopprint)
printf("and %ld piece%s of gold, after %ld move%s.\n",
u.ugold, plur(u.ugold), moves, plur(moves));
if (!done_stopprint)
printf("You were level %u with a maximum of %d hit points when you %s.\n",
u.ulevel, u.uhpmax, st1);
if (*st1 == 'e' && !done_stopprint) {
getret(); /* all those pieces of coloured glass ... */
cls();
}
#ifdef WIZARD
if (!wizard)
#endif /* WIZARD */
topten();
if (done_stopprint)
printf("\n\n");
exit(0);
}
#define newttentry() (struct toptenentry *) alloc(sizeof(struct toptenentry))
#define NAMSZ 8
#define DTHSZ 40
#define PERSMAX 1
#define POINTSMIN 1 /* must be > 0 */
#define ENTRYMAX 100 /* must be >= 10 */
#define PERS_IS_UID /* delete for PERSMAX per name; now per uid */
struct toptenentry {
struct toptenentry *tt_next;
long int points;
int level, maxlvl, hp, maxhp;
int uid;
char plchar;
char sex;
char name[NAMSZ + 1];
char death[DTHSZ + 1];
char date[7];/* yymmdd */
} *tt_head;
void
topten()
{
int uid = getuid();
int rank, rank0 = -1, rank1 = 0;
int occ_cnt = PERSMAX;
struct toptenentry *t0, *t1, *tprev;
const char *recfile = RECORD;
const char *reclock = "record_lock";
int sleepct = 300;
FILE *rfile;
int flg = 0;
#define HUP if(!done_hup)
while (link(recfile, reclock) == -1) {
HUP perror(reclock);
if (!sleepct--) {
HUP puts("I give up. Sorry.");
HUP puts("Perhaps there is an old record_lock around?");
return;
}
HUP printf("Waiting for access to record file. (%d)\n",
sleepct);
HUP(void) fflush(stdout);
sleep(1);
}
if (!(rfile = fopen(recfile, "r"))) {
HUP puts("Cannot open record file!");
goto unlock;
}
HUP(void) putchar('\n');
/* create a new 'topten' entry */
t0 = newttentry();
t0->level = dlevel;
t0->maxlvl = maxdlevel;
t0->hp = u.uhp;
t0->maxhp = u.uhpmax;
t0->points = u.urexp;
t0->plchar = pl_character[0];
t0->sex = (flags.female ? 'F' : 'M');
t0->uid = uid;
(void) strncpy(t0->name, plname, NAMSZ);
(t0->name)[NAMSZ] = 0;
(void) strncpy(t0->death, killer, DTHSZ);
(t0->death)[DTHSZ] = 0;
(void) strcpy(t0->date, getdate());
/* assure minimum number of points */
if (t0->points < POINTSMIN)
t0->points = 0;
t1 = tt_head = newttentry();
tprev = 0;
/* rank0: -1 undefined, 0 not_on_list, n n_th on list */
for (rank = 1;;) {
if (fscanf(rfile, "%6s %d %d %d %d %d %ld %c%c %[^,],%[^\n]",
t1->date, &t1->uid,
&t1->level, &t1->maxlvl,
&t1->hp, &t1->maxhp, &t1->points,
&t1->plchar, &t1->sex, t1->name, t1->death) != 11
|| t1->points < POINTSMIN)
t1->points = 0;
if (rank0 < 0 && t1->points < t0->points) {
rank0 = rank++;
if (tprev == 0)
tt_head = t0;
else
tprev->tt_next = t0;
t0->tt_next = t1;
occ_cnt--;
flg++; /* ask for a rewrite */
} else
tprev = t1;
if (t1->points == 0)
break;
if (
#ifdef PERS_IS_UID
t1->uid == t0->uid &&
#else
strncmp(t1->name, t0->name, NAMSZ) == 0 &&
#endif /* PERS_IS_UID */
t1->plchar == t0->plchar && --occ_cnt <= 0) {
if (rank0 < 0) {
rank0 = 0;
rank1 = rank;
HUP printf("You didn't beat your previous score of %ld points.\n\n",
t1->points);
}
if (occ_cnt < 0) {
flg++;
continue;
}
}
if (rank <= ENTRYMAX) {
t1 = t1->tt_next = newttentry();
rank++;
}
if (rank > ENTRYMAX) {
t1->points = 0;
break;
}
}
if (flg) { /* rewrite record file */
(void) fclose(rfile);
if (!(rfile = fopen(recfile, "w"))) {
HUP puts("Cannot write record file\n");
goto unlock;
}
if (!done_stopprint)
if (rank0 > 0) {
if (rank0 <= 10)
puts("You made the top ten list!\n");
else
printf("You reached the %d%s place on the top %d list.\n\n",
rank0, ordin(rank0), ENTRYMAX);
}
}
if (rank0 == 0)
rank0 = rank1;
if (rank0 <= 0)
rank0 = rank;
if (!done_stopprint)
outheader();
t1 = tt_head;
for (rank = 1; t1->points != 0; rank++, t1 = t1->tt_next) {
if (flg)
fprintf(rfile, "%6s %d %d %d %d %d %ld %c%c %s,%s\n",
t1->date, t1->uid,
t1->level, t1->maxlvl,
t1->hp, t1->maxhp, t1->points,
t1->plchar, t1->sex, t1->name, t1->death);
if (done_stopprint)
continue;
if (rank > (int)flags.end_top &&
(rank < rank0 - (int)flags.end_around || rank > rank0 + (int)flags.end_around)
&& (!flags.end_own ||
#ifdef PERS_IS_UID
t1->uid != t0->uid))
#else
strncmp(t1->name, t0->name, NAMSZ)))
#endif /* PERS_IS_UID */
continue;
if (rank == rank0 - (int)flags.end_around &&
rank0 > (int)(flags.end_top + flags.end_around + 1) &&
!flags.end_own)
(void) putchar('\n');
if (rank != rank0)
(void) outentry(rank, t1, 0);
else if (!rank1)
(void) outentry(rank, t1, 1);
else {
int t0lth = outentry(0, t0, -1);
int t1lth = outentry(rank, t1, t0lth);
if (t1lth > t0lth)
t0lth = t1lth;
(void) outentry(0, t0, t0lth);
}
}
if (rank0 >= rank)
if (!done_stopprint)
(void) outentry(0, t0, 1);
(void) fclose(rfile);
unlock:
(void) unlink(reclock);
}
void
outheader()
{
char linebuf[BUFSZ];
char *bp;
(void) strcpy(linebuf, "Number Points Name");
bp = eos(linebuf);
while (bp < linebuf + COLNO - 9)
*bp++ = ' ';
(void) strcpy(bp, "Hp [max]");
puts(linebuf);
}
/* so>0: standout line; so=0: ordinary line; so<0: no output, return lth */
int
outentry(int rank, struct toptenentry *t1, int so)
{
boolean quit = FALSE, killed = FALSE, starv = FALSE;
char linebuf[BUFSZ];
linebuf[0] = 0;
if (rank)
Sprintf(eos(linebuf), "%3d", rank);
else
Sprintf(eos(linebuf), " ");
Sprintf(eos(linebuf), " %6ld %8s", t1->points, t1->name);
if (t1->plchar == 'X')
Sprintf(eos(linebuf), " ");
else
Sprintf(eos(linebuf), "-%c ", t1->plchar);
if (!strncmp("escaped", t1->death, 7)) {
if (!strcmp(" (with amulet)", t1->death + 7))
Sprintf(eos(linebuf), "escaped the dungeon with amulet");
else
Sprintf(eos(linebuf), "escaped the dungeon [max level %d]",
t1->maxlvl);
} else {
if (!strncmp(t1->death, "quit", 4)) {
quit = TRUE;
if (t1->maxhp < 3 * t1->hp && t1->maxlvl < 4)
Sprintf(eos(linebuf), "cravenly gave up");
else
Sprintf(eos(linebuf), "quit");
} else if (!strcmp(t1->death, "choked"))
Sprintf(eos(linebuf), "choked on %s food",
(t1->sex == 'F') ? "her" : "his");
else if (!strncmp(t1->death, "starv", 5))
Sprintf(eos(linebuf), "starved to death"), starv = TRUE;
else
Sprintf(eos(linebuf), "was killed"), killed = TRUE;
Sprintf(eos(linebuf), " on%s level %d",
(killed || starv) ? "" : " dungeon", t1->level);
if (t1->maxlvl != t1->level)
Sprintf(eos(linebuf), " [max %d]", t1->maxlvl);
if (quit && t1->death[4])
Sprintf(eos(linebuf), "%s", t1->death + 4);
}
if (killed)
Sprintf(eos(linebuf), " by %s%s",
(!strncmp(t1->death, "trick", 5) || !strncmp(t1->death, "the ", 4))
? "" :
strchr(vowels, *t1->death) ? "an " : "a ",
t1->death);
Sprintf(eos(linebuf), ".");
if (t1->maxhp) {
char *bp = eos(linebuf);
char hpbuf[10];
int hppos;
Sprintf(hpbuf, "%s", (t1->hp > 0) ? itoa(t1->hp) : "-");
hppos = COLNO - 7 - strlen(hpbuf);
if (bp <= linebuf + hppos) {
while (bp < linebuf + hppos)
*bp++ = ' ';
(void) strcpy(bp, hpbuf);
Sprintf(eos(bp), " [%d]", t1->maxhp);
}
}
if (so == 0)
puts(linebuf);
else if (so > 0) {
char *bp = eos(linebuf);
if (so >= COLNO)
so = COLNO - 1;
while (bp < linebuf + so)
*bp++ = ' ';
*bp = 0;
standoutbeg();
fputs(linebuf, stdout);
standoutend();
(void) putchar('\n');
}
return (strlen(linebuf));
}
char *
itoa(a)
int a;
{
static char buf[12];
Sprintf(buf, "%d", a);
return (buf);
}
const char *
ordin(n)
int n;
{
int d = n % 10;
return ((d == 0 || d > 3 || n / 10 == 1) ? "th" : (d == 1) ? "st" :
(d == 2) ? "nd" : "rd");
}
void
clearlocks()
{
int x;
(void) signal(SIGHUP, SIG_IGN);
for (x = maxdlevel; x >= 0; x--) {
glo(x);
(void) unlink(lock); /* not all levels need be present */
}
}
#ifdef NOSAVEONHANGUP
/*ARGSUSED*/
void
hangup(n)
int n;
{
(void) signal(SIGINT, SIG_IGN);
clearlocks();
exit(1);
}
#endif /* NOSAVEONHANGUP */
char *
eos(s)
char *s;
{
while (*s)
s++;
return (s);
}
/* it is the callers responsibility to check that there is room for c */
void
charcat(s, c)
char *s, c;
{
while (*s)
s++;
*s++ = c;
*s = 0;
}
/*
* Called with args from main if argc >= 0. In this case, list scores as
* requested. Otherwise, find scores for the current player (and list them
* if argc == -1).
*/
void
prscore(argc, argv)
int argc;
char **argv;
{
char **players = NULL;
int playerct;
int rank;
struct toptenentry *t1, *t2;
const char *recfile = RECORD;
FILE *rfile;
int flg = 0;
int i;
#ifdef nonsense
long total_score = 0L;
char totchars[10];
int totcharct = 0;
#endif /* nonsense */
int outflg = (argc >= -1);
#ifdef PERS_IS_UID
int uid = -1;
#else
char *player0;
#endif /* PERS_IS_UID */
if (!(rfile = fopen(recfile, "r"))) {
puts("Cannot open record file!");
return;
}
if (argc > 1 && !strncmp(argv[1], "-s", 2)) {
if (!argv[1][2]) {
argc--;
argv++;
} else if (!argv[1][3] && strchr("CFKSTWX", argv[1][2])) {
argv[1]++;
argv[1][0] = '-';
} else
argv[1] += 2;
}
if (argc <= 1) {
#ifdef PERS_IS_UID
uid = getuid();
playerct = 0;
#else
player0 = plname;
if (!*player0)
player0 = "hackplayer";
playerct = 1;
players = &player0;
#endif /* PERS_IS_UID */
} else {
playerct = --argc;
players = ++argv;
}
if (outflg)
putchar('\n');
t1 = tt_head = newttentry();
for (rank = 1;; rank++) {
if (fscanf(rfile, "%6s %d %d %d %d %d %ld %c%c %[^,],%[^\n]",
t1->date, &t1->uid,
&t1->level, &t1->maxlvl,
&t1->hp, &t1->maxhp, &t1->points,
&t1->plchar, &t1->sex, t1->name, t1->death) != 11)
t1->points = 0;
if (t1->points == 0)
break;
#ifdef PERS_IS_UID
if (!playerct && t1->uid == uid)
flg++;
else
#endif /* PERS_IS_UID */
for (i = 0; i < playerct; i++) {
if (strcmp(players[i], "all") == 0 ||
strncmp(t1->name, players[i], NAMSZ) == 0 ||
(players[i][0] == '-' &&
players[i][1] == t1->plchar &&
players[i][2] == 0) ||
(digit(players[i][0]) && rank <= atoi(players[i])))
flg++;
}
t1 = t1->tt_next = newttentry();
}
(void) fclose(rfile);
if (!flg) {
if (outflg) {
printf("Cannot find any entries for ");
if (playerct < 1)
printf("you.\n");
else {
if (playerct > 1)
printf("any of ");
for (i = 0; i < playerct; i++)
printf("%s%s", players[i], (i < playerct - 1) ? ", " : ".\n");
printf("Call is: %s -s [playernames]\n", hname);
}
}
return;
}
if (outflg)
outheader();
t1 = tt_head;
for (rank = 1; t1->points != 0; rank++, t1 = t2) {
t2 = t1->tt_next;
#ifdef PERS_IS_UID
if (!playerct && t1->uid == uid)
goto outwithit;
else
#endif /* PERS_IS_UID */
for (i = 0; i < playerct; i++) {
if (strcmp(players[i], "all") == 0 ||
strncmp(t1->name, players[i], NAMSZ) == 0 ||
(players[i][0] == '-' &&
players[i][1] == t1->plchar &&
players[i][2] == 0) ||
(digit(players[i][0]) && rank <= atoi(players[i]))) {
outwithit:
if (outflg)
(void) outentry(rank, t1, 0);
#ifdef nonsense
total_score += t1->points;
if (totcharct < sizeof(totchars) - 1)
totchars[totcharct++] = t1->plchar;
#endif /* nonsense */
break;
}
}
free((char *) t1);
}
#ifdef nonsense
totchars[totcharct] = 0;
/*
* We would like to determine whether he is experienced. However, the
* information collected here only tells about the scores/roles that
* got into the topten (top 100?). We should maintain a .hacklog or
* something in his home directory.
*/
flags.beginner = (total_score < 6000);
for (i = 0; i < 6; i++)
if (!strchr(totchars, "CFKSTWX"[i])) {
flags.beginner = 1;
if (!pl_character[0])
pl_character[0] = "CFKSTWX"[i];
break;
}
#endif /* nonsense */
}
|