2001-08-17 05:46:24 +00:00
|
|
|
/*****************************************************************************
|
|
|
|
*
|
2001-11-04 16:41:54 +00:00
|
|
|
* $Id$
|
2001-08-17 05:46:24 +00:00
|
|
|
* Purpose ...............: Hatch files
|
|
|
|
*
|
|
|
|
*****************************************************************************
|
2002-01-07 19:16:03 +00:00
|
|
|
* Copyright (C) 1997-2002
|
2001-08-17 05:46:24 +00:00
|
|
|
*
|
|
|
|
* Michiel Broek FIDO: 2:280/2802
|
|
|
|
* Beekmansbos 10
|
|
|
|
* 1971 BV IJmuiden
|
|
|
|
* the Netherlands
|
|
|
|
*
|
|
|
|
* This file is part of MBSE BBS.
|
|
|
|
*
|
|
|
|
* This BBS 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.
|
|
|
|
*
|
|
|
|
* MBSE BBS is distributed in the hope that it will be useful, but
|
|
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License
|
|
|
|
* along with MBSE BBS; see the file COPYING. If not, write to the Free
|
|
|
|
* Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
*****************************************************************************/
|
|
|
|
|
|
|
|
#include "../lib/libs.h"
|
|
|
|
#include "../lib/structs.h"
|
2002-01-07 19:16:03 +00:00
|
|
|
#include "../lib/users.h"
|
2001-08-17 05:46:24 +00:00
|
|
|
#include "../lib/records.h"
|
|
|
|
#include "../lib/common.h"
|
|
|
|
#include "../lib/clcomm.h"
|
|
|
|
#include "../lib/dbtic.h"
|
|
|
|
#include "utic.h"
|
|
|
|
#include "rollover.h"
|
|
|
|
#include "hatch.h"
|
|
|
|
|
|
|
|
|
|
|
|
extern int do_quiet;
|
2002-05-10 19:47:16 +00:00
|
|
|
int Days[] = {31,28,31,30,31,30,31,31,30,31,30,31};
|
|
|
|
int Hatched = 0;
|
2001-08-17 05:46:24 +00:00
|
|
|
|
|
|
|
|
|
|
|
int CheckHatch(char *);
|
|
|
|
|
|
|
|
|
|
|
|
void Hatch()
|
|
|
|
{
|
2002-05-10 19:47:16 +00:00
|
|
|
char *temp;
|
|
|
|
FILE *fp;
|
|
|
|
struct tm *Tm;
|
|
|
|
time_t Now;
|
|
|
|
int LastDay;
|
|
|
|
int HatchToday;
|
|
|
|
|
|
|
|
temp = calloc(PATH_MAX, sizeof(char));
|
|
|
|
Syslog('+', "Pass: hatch files");
|
|
|
|
Now = time(NULL);
|
|
|
|
Tm = localtime(&Now);
|
|
|
|
|
|
|
|
LastDay = Days[Tm->tm_mon];
|
|
|
|
if (Tm->tm_mon == 1) {
|
|
|
|
/*
|
|
|
|
* Note that with this method each century change is a leapyear,
|
|
|
|
* but take in mind that fidonet will no longer exist in 2100.
|
|
|
|
*/
|
|
|
|
if (!(Tm->tm_year % 4))
|
|
|
|
LastDay++;
|
|
|
|
}
|
|
|
|
|
|
|
|
sprintf(temp, "%s/etc/hatch.data", getenv("MBSE_ROOT"));
|
|
|
|
if ((fp = fopen(temp, "r")) == NULL) {
|
|
|
|
WriteError("$Can't open %s", temp);
|
|
|
|
free(temp);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
fread(&hatchhdr, sizeof(hatchhdr), 1, fp);
|
|
|
|
|
|
|
|
while (fread(&hatch, hatchhdr.recsize, 1, fp) == 1) {
|
|
|
|
if (hatch.Active) {
|
|
|
|
HatchToday = FALSE;
|
|
|
|
if (hatch.Days[Diw])
|
|
|
|
HatchToday = TRUE;
|
|
|
|
if ((hatch.Month[Tm->tm_mday -1]) || (hatch.Month[31] && (LastDay == Tm->tm_mday)))
|
|
|
|
HatchToday = TRUE;
|
|
|
|
sprintf(temp, "%s", hatch.Spec);
|
|
|
|
|
|
|
|
if (HatchToday)
|
|
|
|
CheckHatch(temp);
|
2001-08-17 05:46:24 +00:00
|
|
|
}
|
2002-05-10 19:47:16 +00:00
|
|
|
}
|
2001-08-17 05:46:24 +00:00
|
|
|
|
2002-05-10 19:47:16 +00:00
|
|
|
fclose(fp);
|
|
|
|
free(temp);
|
2001-08-17 05:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int CheckHatch(char *temp)
|
|
|
|
{
|
2002-05-10 19:47:16 +00:00
|
|
|
DIR *dp;
|
|
|
|
struct dirent *de;
|
|
|
|
char *fn, *tf, tmp[4], *temp2;
|
|
|
|
int i, hatched = FALSE;
|
|
|
|
char *p, *q, mask[256];
|
|
|
|
FILE *Tf;
|
2001-08-17 05:46:24 +00:00
|
|
|
|
2002-05-10 19:47:16 +00:00
|
|
|
fn = xstrcpy(strrchr(temp, '/') + 1);
|
2001-08-17 05:46:24 +00:00
|
|
|
|
2002-05-10 19:47:16 +00:00
|
|
|
while (temp[strlen(temp) -1] != '/')
|
2001-08-17 05:46:24 +00:00
|
|
|
temp[strlen(temp) -1] = '\0';
|
2002-05-10 19:47:16 +00:00
|
|
|
temp[strlen(temp) -1] = '\0';
|
2001-08-17 05:46:24 +00:00
|
|
|
|
2002-05-10 19:47:16 +00:00
|
|
|
if (chdir(temp)) {
|
|
|
|
WriteError("$Can't chdir(%s)", temp);
|
|
|
|
free(fn);
|
|
|
|
return FALSE;
|
|
|
|
}
|
2001-08-17 05:46:24 +00:00
|
|
|
|
2002-05-10 19:47:16 +00:00
|
|
|
if ((dp = opendir(temp)) == NULL) {
|
|
|
|
WriteError("$Can't opendir(%s)", temp);
|
|
|
|
free(fn);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
memset(&mask, 0, sizeof(mask));
|
|
|
|
p = fn;
|
|
|
|
q = mask;
|
|
|
|
*q++ = '^';
|
|
|
|
while ((*p) && (q < (mask + sizeof(mask) - 4))) {
|
|
|
|
switch(*p) {
|
|
|
|
case '\\': *q++ = '\\'; *q++ = '\\'; break;
|
|
|
|
case '?': *q++ = '.'; break;
|
|
|
|
case '.': *q++ = '\\'; *q++ = '.'; break;
|
|
|
|
case '+': *q++ = '\\'; *q++ = '+'; break;
|
|
|
|
case '*': *q++ = '.'; *q++ = '*'; break;
|
|
|
|
case '@': sprintf(q, "[A-Za-z]"); while (*q) q++; break;
|
|
|
|
case '#': sprintf(q, "[0-9]"); while (*q) q++; break;
|
|
|
|
default: *q++ = *p; break;
|
2002-05-08 18:47:55 +00:00
|
|
|
}
|
2002-05-10 19:47:16 +00:00
|
|
|
p++;
|
|
|
|
}
|
|
|
|
*q++ = '$';
|
|
|
|
*q = '\0';
|
|
|
|
Syslog('f', "Hatch mask \"%s\" -> \"%s\"", MBSE_SS(fn), MBSE_SS(mask));
|
|
|
|
|
|
|
|
if ((re_comp(mask)) == NULL) {
|
|
|
|
tf = calloc(PATH_MAX, sizeof(char));
|
2001-08-17 05:46:24 +00:00
|
|
|
while ((de = readdir(dp))) {
|
2002-05-10 19:47:16 +00:00
|
|
|
if (re_exec(de->d_name)) {
|
|
|
|
hatched = TRUE;
|
|
|
|
Syslog('+', "Hatch %s in area %s", de->d_name, hatch.Name);
|
|
|
|
sprintf(tf, "%s/%s", CFG.pinbound, MakeTicName());
|
|
|
|
|
|
|
|
if ((Tf = fopen(tf, "a+")) == NULL) {
|
|
|
|
WriteError("Can't create %s", tf);
|
|
|
|
} else {
|
|
|
|
fprintf(Tf, "Hatch\r\n");
|
|
|
|
fprintf(Tf, "Created MBSE BBS v%s, %s\r\n", VERSION, SHORTRIGHT);
|
|
|
|
fprintf(Tf, "Area %s\r\n", hatch.Name);
|
|
|
|
if (SearchTic(hatch.Name)) {
|
|
|
|
fprintf(Tf, "Origin %s\r\n", aka2str(tic.Aka));
|
|
|
|
fprintf(Tf, "From %s\r\n", aka2str(tic.Aka));
|
|
|
|
} else {
|
|
|
|
fprintf(Tf, "Origin %s\r\n", aka2str(CFG.aka[0]));
|
|
|
|
fprintf(Tf, "From %s\r\n", aka2str(CFG.aka[0]));
|
|
|
|
Syslog('?', "Warning: TIC group not found");
|
|
|
|
}
|
|
|
|
if (strlen(hatch.Replace))
|
|
|
|
fprintf(Tf, "Replaces %s\r\n", hatch.Replace);
|
|
|
|
if (strlen(hatch.Magic))
|
|
|
|
fprintf(Tf, "Magic %s\r\n", hatch.Magic);
|
|
|
|
temp2 = calloc(strlen(de->d_name) + 1, sizeof(char));
|
|
|
|
sprintf(temp2, "%s", de->d_name);
|
|
|
|
name_mangle(temp2);
|
|
|
|
fprintf(Tf, "File %s\r\n", temp2);
|
|
|
|
free(temp2);
|
|
|
|
fprintf(Tf, "Fullname %s\r\n", de->d_name);
|
|
|
|
fprintf(Tf, "Pth %s\r\n", temp);
|
|
|
|
fprintf(Tf, "Desc ");
|
|
|
|
for (i = 0; i < strlen(hatch.Desc); i++) {
|
|
|
|
if (hatch.Desc[i] != '%') {
|
|
|
|
fprintf(Tf, "%c", hatch.Desc[i]);
|
|
|
|
} else {
|
|
|
|
i++;
|
|
|
|
memset(&tmp, 0, sizeof(tmp));
|
|
|
|
if (isdigit(hatch.Desc[i]))
|
|
|
|
tmp[0] = hatch.Desc[i];
|
|
|
|
if (isdigit(hatch.Desc[i+1])) {
|
|
|
|
tmp[1] = hatch.Desc[i+1];
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
fprintf(Tf, "%c", de->d_name[atoi(tmp) -1]);
|
2001-08-17 05:46:24 +00:00
|
|
|
}
|
2002-05-10 19:47:16 +00:00
|
|
|
}
|
|
|
|
fprintf(Tf, "\r\n");
|
|
|
|
fprintf(Tf, "Crc %08lx\r\n", file_crc(de->d_name, CFG.slow_util && do_quiet));
|
|
|
|
fprintf(Tf, "Pw %s\r\n", CFG.hatchpasswd);
|
|
|
|
fclose(Tf);
|
|
|
|
Hatched++;
|
|
|
|
StatAdd(&hatch.Hatched , 1);
|
2001-08-17 05:46:24 +00:00
|
|
|
}
|
2002-05-10 19:47:16 +00:00
|
|
|
}
|
2001-08-17 05:46:24 +00:00
|
|
|
}
|
2002-05-10 19:47:16 +00:00
|
|
|
free(tf);
|
|
|
|
} else {
|
|
|
|
WriteError("Could not create regexp from %s", fn);
|
|
|
|
}
|
|
|
|
|
|
|
|
closedir(dp);
|
|
|
|
free(fn);
|
|
|
|
return hatched;
|
2001-08-17 05:46:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|