neale/moth
neale
/
moth
mirror of https://github.com/dirtbags/moth.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Merge branch 'master' of ssh://fozzie/home/neale/projects/ctf

This commit is contained in:
Neale Pickett 2012-05-30 18:04:32 -06:00
parent d95aecd25d 672482b2c8
commit c352563d40
1 changed files with 46 additions and 62 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

82
packages/mcp/src/puzzles.cgi.c
View File

@ -52,7 +52,7 @@ int
main(int argc, char *argv[]) main(int argc, char *argv[])
{ {
int i; int i;
DIR *srv; DIR *opt;
if (-1 == cgi_init(argv)) { if (-1 == cgi_init(argv)) {
return 0; return 0;
@ -66,9 +66,11 @@ main(int argc, char *argv[])
int i; int i;
while (f && (! feof(f))) { while (f && (! feof(f))) {
read_until_char(f, NULL, 0, ' ');
read_until_char(f, NULL, 0, ' '); read_until_char(f, NULL, 0, ' ');
read_until_char(f, cat, sizeof(cat), ' '); read_until_char(f, cat, sizeof(cat), ' ');
read_until_char(f, points_str, sizeof(points_str), '\n'); read_until_char(f, points_str, sizeof(points_str), ' ');
read_until_char(f, NULL, 0, '\n');
points = atol(points_str); points = atol(points_str);
for (i = 0; i < ncats; i += 1) { for (i = 0; i < ncats; i += 1) {
@ -90,60 +92,28 @@ main(int argc, char *argv[])
if (f) fclose(f); if (f) fclose(f);
} }
srv = opendir(package_path("")); opt = opendir(package_path(""));
if (NULL == srv) { if (NULL == opt) {
cgi_error("Cannot opendir(\"/srv\")"); cgi_error("Cannot opendir(\"/opt\")");
} }
cgi_head("Open puzzles"); cgi_head("Open puzzles");
printf("<dl>\n"); printf("<dl>\n");
/* For each file in /srv/ ... */ /* For each file in /opt/ ... */
while (1) { while (1) {
struct dirent *e = readdir(srv); struct dirent *e = readdir(opt);
char *cat; char *cat;
DIR *puzzles; DIR *puzzles;
long catpoints[PUZZLES_MAX]; long catpoints[PUZZLES_MAX];
long maxpoints = 0;
size_t ncatpoints = 0; size_t ncatpoints = 0;
if (! e) break; if (! e) break;
cat = e->d_name; cat = e->d_name;
if ('.' == cat[0]) continue; if ('.' == cat[0]) continue;
/* We have to lstat anyway to see if it's a directory; may as
well just barge ahead and watch for errors. */
/* Open /srv/ctf/$cat/puzzles/ */
puzzles = opendir(package_path("%s/puzzles", cat));
if (NULL == puzzles) {
continue;
}
while (ncatpoints < PUZZLES_MAX) {
struct dirent *pe = readdir(puzzles);
long points;
char *p;
if (! pe) break;
/* Only do this if it's an int */
points = strtol(pe->d_name, &p, 10);
if (*p) continue;
catpoints[ncatpoints++] = points;
}
closedir(puzzles);
/* Sort points */
qsort(catpoints, ncatpoints, sizeof(*catpoints),
(int (*)(const void *, const void *))longcmp);
/* Print out point values up to one past the last solved puzzle in
this category */
{
long maxpoints = 0;
/* Find the most points scored in this category */ /* Find the most points scored in this category */
for (i = 0; i < ncats; i += 1) { for (i = 0; i < ncats; i += 1) {
@ -153,18 +123,32 @@ main(int argc, char *argv[])
} }
} }
/* 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(" <dt>%s</dt>\n", cat);
printf(" <dd>\n"); printf(" <dd>\n");
for (i = 0; i < ncatpoints; i += 1) {
printf(" <a href=\"/%s/%ld/\">%ld</a>\n", while (i < PUZZLES_MAX && (!feof(map))) {
cat, catpoints[i], catpoints[i]); char hash[20];
if (catpoints[i] > maxpoints) break; char points_str[20];
} long points;
printf(" </dd>\n");
} read_until_char(map, points_str, sizeof(points_str), ' ');
read_until_char(map, cat, sizeof(cat), '\n');
points = atol(hash);
printf(" <a href=\"/%s/%ld/\">%ld</a>\n", cat, points, points);
if (points > maxpoints) break;
} }
closedir(srv); printf(" </dd>\n");
fclose(map);
}
closedir(opt);
printf("</dl>\n"); printf("</dl>\n");
cgi_foot(); cgi_foot();