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 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956
|
/* Scores and scoring in Xconq.
Copyright (C) 1987, 1988, 1989, 1991, 1992, 1993, 1994, 1995, 1996
Stanley T. Shebs.
Xconq 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, or (at your option)
any later version. See the file COPYING. */
/* Scoring in Xconq does not happen by default; instead a game design
may include one or more "scorekeepers", which are objects with properties
that define how winning and losing will be decided.
There are two kinds of functionality in scorekeepers. One kind is the
ability to end a game based on a specified condition, such as "the Star
of Satyria enters Noblum". The other is the accumulation of a numeric score.
A scorekeeper may include both, so it can (for instance) end the game the
instant that a player's score reaches 100, or 100 more than another player,
or whatever. */
#include "conq.h"
extern FILE *open_scorefile_for_reading PARAMS ((char *name));
extern FILE *open_scorefile_for_writing PARAMS ((char *name));
int read_scorefile PARAMS ((void));
int interp_score_record PARAMS ((Obj *form));
typedef struct a_score_record {
char *gamename;
Obj *sides;
Obj *raw;
struct a_score_record *next;
} ScoreRecord;
/* Iteration over all recorded scores. */
#define for_all_score_records(sr) \
for ((sr) = records; (sr) != NULL; (sr) = (sr)->next)
ScoreRecord *records;
ScoreRecord *last_record;
/* This is true when the given side should be tested against the given scorekeeper. */
#define scorekeeper_applicable(side,sk) \
((side)->ingame && (side_in_set((side), (sk)->whomask)))
static void eval_sk_last_side_wins PARAMS ((Scorekeeper *sk));
/* The head of the list of scorekeepers. */
Scorekeeper *scorekeepers;
/* The end of the list of scorekeepers. */
Scorekeeper *last_scorekeeper;
/* The total number of scorekeepers defined. */
int numscorekeepers;
int nextskid;
/* The number of scorekeepers maintaining numeric scores. */
int numscores;
/* True if any pre-turn scorekeepers are defined. */
int any_pre_turn_scores;
/* True if any post-turn scorekeepers are defined. */
int any_post_turn_scores;
/* True if any post-action scorekeepers are defined. */
int any_post_action_scores;
/* True if any post-event scorekeepers are defined. */
int any_post_event_scores;
/* True if any turn-specific scorekeepers are defined. */
int any_turn_specific_scores;
/* The count of sides in the game when the last-side-wins scorekeeper
first tested. */
static int num_sides_originally;
/* Clear out any possible scorekeepers. */
void
init_scorekeepers()
{
scorekeepers = last_scorekeeper = NULL;
numscorekeepers = 0;
nextskid = 1;
any_pre_turn_scores = FALSE;
any_post_turn_scores = FALSE;
any_post_action_scores = FALSE;
any_post_event_scores = FALSE;
any_turn_specific_scores = FALSE;
}
Scorekeeper *
create_scorekeeper()
{
Scorekeeper *sk = (Scorekeeper *) xmalloc(sizeof(Scorekeeper));
/* Initialize any nonzero fields. */
sk->id = nextskid++;
sk->when = lispnil;
sk->who = lispnil;
sk->whomask = ALLSIDES;
sk->knownto = lispnil;
sk->trigger = lispnil;
sk->body = lispnil;
sk->record = lispnil;
sk->notes = lispnil;
sk->scorenum = -1;
/* Init the initial score to a disallowed value, this keeps it off the
side's scorecard. */
sk->initial = -10001;
sk->triggered = FALSE;
/* Add the new scorekeeper to the end of the list. */
if (last_scorekeeper != NULL) {
last_scorekeeper->next = sk;
last_scorekeeper = sk;
} else {
scorekeepers = last_scorekeeper = sk;
}
++numscorekeepers;
return sk;
}
Scorekeeper *
find_scorekeeper(id)
int id;
{
Scorekeeper *sk;
for_all_scorekeepers(sk) {
if (sk->id == id)
return sk;
}
return NULL;
}
/* Allocate and fill in the initial score records for each side. This
must happen after all scorekeepers have been defined. */
void
init_scores()
{
int score;
Side *side;
Scorekeeper *sk;
Obj *savedscores, *when;
/* First count and index all the scorekeepers that maintain
a numeric score. */
numscores = 0;
for_all_scorekeepers(sk) {
if (sk->initial != -10001) {
sk->scorenum = numscores++;
}
}
/* Allocate an appropriately-sized scorecard for each side. Note that a
particular position in the scorecard might not apply to all sides. */
for_all_sides(side) {
/* Collect any Lisp object that might have been stashed here
while reading a game module. */
savedscores = side->rawscores;
side->scores = NULL;
if (numscores > 0) {
side->scores = (short *) xmalloc(numscores * sizeof(short));
for_all_scorekeepers(sk) {
score = sk->initial;
/* Collect a saved score if there is one to collect. */
if (savedscores != NULL
&& savedscores != lispnil
&& numberp(car(savedscores))) {
score = c_number(car(savedscores));
savedscores = cdr(savedscores);
}
side->scores[sk->scorenum] = score;
}
}
}
/* Some kinds of scorekeepers are expensive to run, so we set flags to
indicate directly that we need to make the check. */
for_all_scorekeepers(sk) {
when = sk->when;
if (consp(when)) {
if (cdr(when) != lispnil) {
any_turn_specific_scores = TRUE;
}
when = car(when);
}
if (match_keyword(when, K_BEFORE_TURN)) {
any_pre_turn_scores = TRUE;
}
if (when == lispnil || match_keyword(when, K_AFTER_TURN)) {
any_post_turn_scores = TRUE;
}
if (match_keyword(when, K_AFTER_ACTION)) {
any_post_action_scores = TRUE;
}
if (match_keyword(when, K_AFTER_EVENT)) {
any_post_event_scores = TRUE;
}
}
/* Compute the number of sides in the game initially. This is so
we don't force the game to end because (for whatever reason)
only one side was active from the beginning. */
num_sides_originally = 0;
for_all_sides(side) {
if (side->ingame)
++num_sides_originally;
}
}
/* Test all the scorekeepers that should be run immediately before any
side moves anything. */
void
check_pre_turn_scores()
{
Side *side;
Scorekeeper *sk;
if (any_pre_turn_scores) {
for_all_scorekeepers(sk) {
if (match_keyword(sk->when, K_BEFORE_TURN)) {
for_all_sides(side) {
if (scorekeeper_applicable(side, sk)) {
run_scorekeeper(side, sk);
} else {
Dprintf("sk %d not applicable to %s\n",
sk->id, side_desig(side));
}
}
}
}
}
}
/* Test all the scorekeepers that should be run only at the end of a turn. */
void
check_post_turn_scores()
{
Side *side;
Scorekeeper *sk;
if (any_post_turn_scores) {
for_all_scorekeepers(sk) {
Dprintf("Checking post-turn scorekeeper %d\n", sk->id);
if (sk->when == lispnil || match_keyword(sk->when, K_AFTER_TURN)) {
/* Decide whether the scorekeeper applies to one side
or to the whole game. */
if (symbolp(sk->body)
&& match_keyword(sk->body, K_LAST_SIDE_WINS)) {
eval_sk_last_side_wins(sk);
} else {
for_all_sides(side) {
if (scorekeeper_applicable(side, sk)) {
run_scorekeeper(side, sk);
} else {
Dprintf("sk %d not applicable to %s\n",
sk->id, side_desig(side));
}
}
}
}
}
}
}
void
check_post_action_scores(unit, action, rslt)
Unit *unit;
Action *action;
int rslt;
{
Side *side;
Scorekeeper *sk;
if (any_post_action_scores) {
Dprintf("Checking post-action scorekeepers\n");
for_all_scorekeepers(sk) {
if (match_keyword(sk->when, K_AFTER_ACTION)) {
if (sk->trigger == lispnil || sk->triggered) {
for_all_sides(side) {
if (scorekeeper_applicable(side, sk)) {
run_scorekeeper(side, sk);
} else {
Dprintf("sk %d not applicable to %s\n",
sk->id, side_desig(side));
}
}
}
}
}
}
}
void
check_post_event_scores(hevt)
HistEvent *hevt;
{
Side *side;
Scorekeeper *sk;
if (any_post_event_scores) {
Dprintf("Checking post-event scorekeepers\n");
for_all_scorekeepers(sk) {
if (match_keyword(sk->when, K_AFTER_EVENT)) {
if (sk->trigger == lispnil || sk->triggered) {
for_all_sides(side) {
if (scorekeeper_applicable(side, sk)) {
run_scorekeeper(side, sk);
} else {
Dprintf("sk %d not applicable to %s\n",
sk->id, side_desig(side));
}
}
}
}
}
}
}
/* This is what actually does the test and effect of the scorekeeper
on the given side. This can be expensive to run. */
void
run_scorekeeper(side, sk)
Side *side;
Scorekeeper *sk;
{
eval_sk_form(side, sk, sk->body);
}
int
eval_sk_form(side, sk, form)
Side *side;
Scorekeeper *sk;
Obj *form;
{
int val;
char *formtype;
Obj *test, *clauses, *clause, *rest;
if (symbolp(form)) {
if (match_keyword(form, K_LAST_SIDE_WINS)) {
eval_sk_last_side_wins(sk);
return 0;
} else if (boundp(form)) {
return 0;
} else {
syntax_error(form, "scorekeeper body");
return 0;
}
} else if (consp(form) && symbolp(car(form))) {
formtype = c_string(car(form));
switch (keyword_code(formtype)) {
case K_IF:
test = cadr(form);
if (eval_sk_test(side, sk, test)) {
eval_sk_form(side, sk, car(cddr(form)));
}
break;
case K_COND:
/* Interpret the traditional cond form. */
for (clauses = cdr(form); clauses != lispnil; clauses = cdr(clauses)) {
clause = car(clauses);
test = car(clause);
if (eval_sk_test(side, sk, test)) {
for (rest = cdr(clause); rest != lispnil; rest = cdr(rest)) {
eval_sk_form(side, sk, car(rest));
}
/* Don't look at any more clauses. */
break;
}
}
break;
case K_STOP:
run_error("game stopped by scorekeeper %d", sk->id);
break;
case K_WIN:
if (side->ingame)
side_wins(side, sk->id);
break;
case K_LOSE:
if (side->ingame)
side_loses(side, NULL, sk->id);
break;
case K_DRAW:
all_sides_draw();
break;
case K_END:
/* (should end the game, assign scores to all sides) */
break;
case K_SET:
/* (should only do if this actually *is* a numeric scorekeeper) */
side->scores[sk->scorenum] = eval_sk_form(side, sk, cadr(form));
return side->scores[sk->scorenum];
case K_ADD:
if (cdr(form) != lispnil) {
val = eval_sk_form(side, sk, cadr(form));
} else {
val = 1;
}
/* (should only do if this actually *is* a numeric scorekeeper) */
side->scores[sk->scorenum] += val;
return side->scores[sk->scorenum];
case K_SUM:
return sum_property(side, cdr(form));
default:
run_warning("unknown form type `%s' in scorekeeper %d", formtype, sk->id);
}
/* This is for those forms that don't really have values, but may appear in
a value-using context anyway. */
return 0;
} else if (numberp(form)) {
return c_number(form);
} else {
syntax_error(form, "scorekeeper body");
return 0;
}
}
int
sum_property(side, form)
Side *side;
Obj *form;
{
int sum = 0, i, typevec[200];
Obj *sidelist = lispnil, *typelist = lispnil, *prop = lispnil;
Obj *filter = lispnil;
Unit *unit;
if (typelist != lispnil) {
/* (should decide overall type of objects first) */
for (i = 0; i < 200; ++i)
typevec[i] = FALSE;
} else {
for (i = 0; i < 200; ++i)
typevec[i] = TRUE;
}
if (consp(form)) {
prop = car(form);
form = cdr(form);
}
if (sidelist != lispnil) {
/* (should let optional cadr designate some other side) */
} else {
if (1 /* iterating over units */) {
for_all_side_units(side, unit) {
if (in_play(unit)
&& typevec[unit->type]
&& (filter == lispnil || TRUE /*filter allows through*/)) {
if (prop != lispnil) {
if (symbolp(prop)
&& strcmp(c_string(prop), "point-value") == 0) {
sum += point_value(unit);
} else {
}
} else {
sum += 1;
}
}
}
}
}
return sum;
}
int
point_value(unit)
Unit *unit;
{
Obj *val;
/* Incomplete units are always worthless. */
if (unit->cp > 0 && !completed(unit))
return 0;
if (unit_point_value(unit) >= 0)
return unit_point_value(unit);
return u_point_value(unit->type);
}
int
side_point_value(side)
Side *side;
{
int points;
Unit *unit;
if (!side->point_value_valid) {
side->point_value_cache = 0;
for_all_side_units(side, unit) {
if ((in_play(unit) && completed(unit))
|| (alive(unit) && unit->cp < 0)) {
side->point_value_cache += point_value(unit);
}
}
side->point_value_valid = TRUE;
}
return side->point_value_cache;
}
/* Evaluate a given form with respect to the given scorekeeper and side. */
int
eval_sk_test(side, sk, form)
Side *side;
Scorekeeper *sk;
Obj *form;
{
char *formtype;
Obj *arg1 = lispnil, *arg2 = lispnil, *rest;
if (consp(form)) {
formtype = c_string(car(form));
if (consp(cdr(form)))
arg1 = cadr(form);
if (consp(cddr(form)))
arg2 = car(cddr(form));
switch (keyword_code(formtype)) {
case K_AND:
for (rest = cdr(form); rest != lispnil; rest = cdr(rest)) {
if (!eval_sk_form(side, sk, car(rest)))
return FALSE;
}
return TRUE;
case K_OR:
for (rest = cdr(form); rest != lispnil; rest = cdr(rest)) {
if (eval_sk_form(side, sk, car(rest)))
return TRUE;
}
return FALSE;
case K_NOT:
return (!eval_sk_form(side, sk, arg1));
case K_EQ:
return (eval_sk_form(side, sk, arg1) ==
eval_sk_form(side, sk, arg2));
case K_NE:
return (eval_sk_form(side, sk, arg1) !=
eval_sk_form(side, sk, arg2));
case K_LT:
return (eval_sk_form(side, sk, arg1) <
eval_sk_form(side, sk, arg2));
case K_LE:
return (eval_sk_form(side, sk, arg1) <=
eval_sk_form(side, sk, arg2));
case K_GT:
return (eval_sk_form(side, sk, arg1) >
eval_sk_form(side, sk, arg2));
case K_GE:
return (eval_sk_form(side, sk, arg1) >=
eval_sk_form(side, sk, arg2));
default:
run_warning("not a proper test");
return FALSE;
}
} else if (symbolp(form)) {
eval_symbol(form);
}
return FALSE;
}
static void
eval_sk_last_side_wins(sk)
Scorekeeper *sk;
{
Side *side2, *winner = NULL;
int numleft = 0, points;
/* This is only meaningful in games with at least two sides. */
if (num_sides_originally >= 2) {
for_all_sides(side2) {
if (side2->ingame) {
points = side_point_value(side2);
Dprintf("%s has %d points worth of units\n",
side_desig(side2), points);
if (points == 0) {
side_loses(side2, NULL, sk->id);
} else {
++numleft;
winner = side2;
}
}
}
if (numleft == 1) {
side_wins(winner, sk->id);
}
}
}
/* Implement the effects of a side winning. */
void
side_wins(side, why)
Side *side;
int why;
{
/* Nothing happens to the side's units or people. */
side->status = 1;
record_event(H_SIDE_WON, ALLSIDES, side_number(side), why);
remove_side_from_game(side);
}
/* Implement the effects of a side losing. */
void
side_loses(side, side2, why)
Side *side, *side2;
int why;
{
int x, y, s, s2, ux, uy;
Unit *unit;
/* These should not happen, but a stupid AI might try, so just
and clear the mistaken side. */
if (side == side2) {
run_warning("losing to self, ignoring side");
side2 = NULL;
}
if (side2 != NULL && !side2->ingame) {
run_warning("losing to side not in game, ignoring side");
side2 = NULL;
}
if (side2 != NULL) {
/* Dispose of all of a side's units. */
for_all_units(unit) {
if (unit->side == side) {
if (in_play(unit)) {
ux = unit->x; uy = unit->y;
change_unit_side(unit, side2, H_SIDE_LOST, NULL);
/* Everybody gets to see this change. */
all_see_cell(ux, uy);
} else {
/* Even out-of-play units need to have their side set. */
set_unit_side(unit, side2);
}
}
}
/* The people also change sides. */
if (people_sides_defined()) {
s = side_number(side);
s2 = side_number(side2);
for_all_cells(x, y) {
if (people_side_at(x, y) == s) {
set_people_side_at(x, y, s2);
all_see_cell(x, y);
}
}
}
/* Reset view coverage everywhere. */
if (!all_see_all) {
for_all_cells(x, y) {
set_cover(side, x, y, 0);
}
}
}
/* Add the mark of shame itself. */
side->status = -1;
record_event(H_SIDE_LOST, ALLSIDES, side_number(side), why);
remove_side_from_game(side);
}
void
all_sides_draw()
{
Side *side;
for_all_sides(side) {
if (side->ingame) {
side->status = 0;
record_event(H_SIDE_WITHDREW, ALLSIDES, side_number(side));
remove_side_from_game(side);
}
}
}
/* Record the outcome of the game into the scorefile. */
void
record_into_scorefile()
{
int i;
int any_advantage_variation = FALSE, adv, adv2;
char *filename, *mversion;
Variant *variants, *var;
FILE *fp;
Side *side;
/* (should make following code into a separate routine) */
adv = max(1, sidelist->advantage);
adv = (sidelist->player ? sidelist->player->advantage : adv);
for_all_sides(side) {
adv2 = max(1, sidelist->advantage);
adv2 = (sidelist->player ? sidelist->player->advantage : adv2);
if (adv != adv2) {
any_advantage_variation = TRUE;
break;
}
}
filename = SCOREFILE;
if (!empty_string(g_scorefile_name()))
filename = g_scorefile_name();
fp = open_scorefile_for_writing(filename);
if (fp != NULL) {
fprintf(fp, "(game");
fprintf(fp, " \"%s\"",
/* (should record this for comparison when displaying scores) */
(mainmodule->origmodulename
? mainmodule->origmodulename
: mainmodule->name));
/* Record the module's version if defined. */
mversion = (mainmodule->origversion
? mainmodule->origversion
: mainmodule->version);
if (!empty_string(mversion))
fprintf(fp, " (version \"%s\")", mversion);
/* Record all the choices of variant. */
variants = (mainmodule->origvariants
? mainmodule->origvariants
: mainmodule->variants);
if (variants) {
fprintf(fp, " (variants");
for (i = 0; variants[i].id != lispnil; ++i) {
var = &(variants[i]);
if (symbolp(var->id)) {
fprintf(fp, " (%s", c_string(var->id));
} else {
fprintf(fp, " (%d", i);
}
if (var->hasintvalue) {
fprintf(fp, " %d", var->intvalue);
}
fprintf(fp, ")");
}
fprintf(fp, ")");
}
fprintf(fp, "\n");
/* Record all the participants and how they fared. */
fprintf(fp, " (sides");
for_all_sides(side) {
fprintf(fp, " (%d", side_number(side));
if (side->everingame) {
fprintf(fp, " %s",
(side_won(side)
? "won"
: (side_lost(side) ? "lost" : "drew")));
short_player_title(spbuf, side->player, NULL);
fprintf(fp, " \"%s\"", spbuf);
if (any_advantage_variation) {
/* (should have cached as "actual advantage"?) */
int advantage = max(1, side->advantage);
advantage =
(side->player ? side->player->advantage : advantage);
fprintf(fp, " (+ %d)", advantage);
}
if (numscores > 0) {
fprintf(fp, " (scores");
for (i = 0; i < numscores; ++i) {
fprintf(fp, " %d", side->scores[i]);
}
fprintf(fp, ")");
}
}
fprintf(fp, ")");
}
fprintf(fp, ")");
/* (should record other useful info about game, such as date(s) played) */
fprintf(fp, ")\n");
fclose(fp);
}
}
int
read_scorefile()
{
int startlineno = 1, endlineno = 1;
int numrecs;
char *filename;
Obj *form;
FILE *fp;
ScoreRecord *sr;
filename = SCOREFILE;
if (!empty_string(g_scorefile_name()))
filename = g_scorefile_name();
fp = open_scorefile_for_reading(filename);
if (fp != NULL) {
numrecs = 0;
/* Read everything in the file. */
while ((form = read_form(fp, &startlineno, &endlineno)) != lispeof) {
if (interp_score_record(form)) {
++numrecs;
}
}
fclose(fp);
Dprintf("%d score records read.\n", numrecs);
for_all_score_records(sr) {
Dprintf("%s\n", sr->gamename);
}
return TRUE;
}
return FALSE;
}
int
interp_score_record(form)
Obj *form;
{
char *propname;
Obj *props, *prop;
ScoreRecord *sr;
if (consp(form)
&& symbolp(car(form))
/* (should) and symbol is 'game' */
&& stringp(cadr(form))) {
sr = (ScoreRecord *) xmalloc(sizeof(ScoreRecord));
sr->gamename = c_string(cadr(form));
for_all_list(cddr(form), props) {
prop = car(props);
if (symbolp(car(prop))) {
propname = c_string(car(prop));
switch (keyword_code(propname)) {
case K_VERSION:
break;
case K_VARIANTS:
break;
default:
/* This is for keywords that may appear in a
score record but are not actually part of GDL. */
if (strcmp(propname, "sides") == 0) {
sr->sides = cdr(prop);
} else {
/* should complain? */
}
break;
}
}
}
sr->raw = form;
/* Add the record to the end of the list. */
if (records != NULL) {
last_record->next = sr;
last_record = sr;
} else {
records = last_record = sr;
}
return TRUE;
}
return FALSE;
}
char *get_scores PARAMS ((Side *side));
char *
get_scores(side)
Side *side;
{
char *buf = xmalloc(5000);
char buf2[BUFSIZE];
char *thisgame, *playername;
Obj *sds, *sd;
ScoreRecord *sr;
thisgame = (mainmodule->origmodulename
? mainmodule->origmodulename
: mainmodule->name);
if (thisgame == NULL)
return "???";
sprintf(buf, "Scores for \"%s\":\n", thisgame);
read_scorefile();
playername = NULL;
if (side != NULL) {
short_player_title(buf2, side->player, NULL);
playername = buf2;
}
if (1 /* summarize */) {
int wins, losses, plays;
wins = losses = plays = 0;
for_all_score_records(sr) {
if (!empty_string(sr->gamename)
&& strcmp(thisgame, sr->gamename) == 0) {
if (playername != NULL && sr->sides != NULL) {
for_all_list(sr->sides, sds) {
sd = car(sds);
if (strcmp(playername, c_string(car(cddr(sd)))) == 0) {
if (strcmp("won", c_string(car(cdr(sd)))) == 0) {
++wins;
} else if (strcmp("lost", c_string(car(cdr(sd)))) == 0) {
++losses;
}
}
}
}
++plays;
}
}
tprintf(buf, "%s won %d and lost %d of %d games played.\n",
"You", wins, losses, plays);
return buf;
}
/* List all the games explicitly. */
for_all_score_records(sr) {
if (!empty_string(sr->gamename)
&& strcmp(thisgame, sr->gamename) == 0) {
if (playername == NULL || 1 /* playername != NULL */) {
if (sr->sides != NULL) {
for_all_list(sr->sides, sds) {
sd = car(sds);
tprintf(buf, " %s %s",
c_string(car(cddr(sd))), c_string(car(cdr(sd))));
}
}
} else {
}
tprintf(buf, "\n");
if (strlen(buf) > 4500)
break;
}
}
return buf;
}
/* This is a general test of whether the given side should be trying
to win somehow, or if it can just goof off. */
int
should_try_to_win(side)
Side *side;
{
Scorekeeper *sk;
for_all_scorekeepers(sk) {
if (scorekeeper_applicable(side, sk)) {
return TRUE;
}
}
return FALSE;
}
|