mirror of https://github.com/dirtbags/moth.git
156 lines
3.0 KiB
C
156 lines
3.0 KiB
C
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
#include <unistd.h>
|
|
#include <dirent.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include "common.h"
|
|
|
|
|
|
int
|
|
longcmp(long *a, long *b)
|
|
{
|
|
if (*a < *b) return -1;
|
|
if (*a > *b) return 1;
|
|
return 0;
|
|
}
|
|
|
|
#define PUZZLES_MAX 100
|
|
|
|
/** Keeps track of the most points yet awarded in each category */
|
|
int ncats = 0;
|
|
struct {
|
|
char cat[CAT_MAX];
|
|
long points;
|
|
} points_by_cat[PUZZLES_MAX];
|
|
|
|
|
|
size_t
|
|
read_until_char(FILE *f, char *buf, size_t buflen, char delim)
|
|
{
|
|
size_t i = 0;
|
|
|
|
while (1) {
|
|
int c = fgetc(f);
|
|
|
|
if ((EOF == c) || delim == c) {
|
|
if (buf) {
|
|
buf[i] = '\0';
|
|
}
|
|
return i;
|
|
}
|
|
|
|
if (i + 1 < buflen) {
|
|
buf[i] = c;
|
|
}
|
|
i += 1;
|
|
}
|
|
}
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
int i;
|
|
DIR *opt;
|
|
|
|
if (-1 == cgi_init(argv)) {
|
|
return 0;
|
|
}
|
|
|
|
{
|
|
FILE *f = fopen(state_path("puzzles.db"), "r");
|
|
char cat[CAT_MAX];
|
|
char points_str[11];
|
|
long points;
|
|
int i;
|
|
|
|
while (f && (! feof(f))) {
|
|
read_until_char(f, NULL, 0, ' ');
|
|
read_until_char(f, cat, sizeof(cat), ' ');
|
|
read_until_char(f, points_str, sizeof(points_str), '\n');
|
|
points = atol(points_str);
|
|
|
|
for (i = 0; i < ncats; i += 1) {
|
|
if (0 == strcmp(cat, points_by_cat[i].cat)) break;
|
|
}
|
|
if (i == ncats) {
|
|
if (PUZZLES_MAX == ncats) {
|
|
continue;
|
|
}
|
|
strncpy(points_by_cat[i].cat, cat, sizeof(points_by_cat[i].cat));
|
|
points_by_cat[i].points = 0;
|
|
ncats += 1;
|
|
}
|
|
if (points > points_by_cat[i].points) {
|
|
points_by_cat[i].points = points;
|
|
}
|
|
}
|
|
|
|
if (f) fclose(f);
|
|
}
|
|
|
|
opt = opendir(package_path(""));
|
|
if (NULL == opt) {
|
|
cgi_error("Cannot opendir(\"/opt\")");
|
|
}
|
|
|
|
cgi_head("Open puzzles");
|
|
printf("<dl>\n");
|
|
|
|
/* For each file in /opt/ ... */
|
|
while (1) {
|
|
struct dirent *e = readdir(opt);
|
|
char *cat;
|
|
DIR *puzzles;
|
|
long catpoints[PUZZLES_MAX];
|
|
long maxpoints = 0;
|
|
size_t ncatpoints = 0;
|
|
|
|
|
|
if (! e) break;
|
|
|
|
cat = e->d_name;
|
|
if ('.' == cat[0]) continue;
|
|
|
|
/* Find the most points scored in this category */
|
|
for (i = 0; i < ncats; i += 1) {
|
|
if (0 == strcmp(cat, points_by_cat[i].cat)) {
|
|
maxpoints = points_by_cat[i].points;
|
|
break;
|
|
}
|
|
}
|
|
|
|
/* Read in category's map file, print html until point limit reached */
|
|
FILE *map = fopen(package_path("%s/map.txt", cat), "r");
|
|
if (map == NULL) continue;
|
|
|
|
printf(" <dt>%s</dt>\n", cat);
|
|
printf(" <dd>\n");
|
|
|
|
while (i < PUZZLES_MAX && (!feof(map))) {
|
|
char hash[20];
|
|
char points_str[20];
|
|
long points;
|
|
|
|
read_until_char(map, cat, sizeof(cat), ' ');
|
|
read_until_char(map, points_str, sizeof(points_str), '\n');
|
|
points = atol(hash);
|
|
|
|
printf(" <a href=\"/%s/%ld/\">%ld</a>\n", cat, points, points);
|
|
|
|
if (points > maxpoints) break;
|
|
}
|
|
|
|
printf(" </dd>\n");
|
|
fclose(map);
|
|
}
|
|
|
|
closedir(opt);
|
|
|
|
printf("</dl>\n");
|
|
cgi_foot();
|
|
|
|
return 0;
|
|
}
|