//buildidx/Makefile |
---|
0,0 → 1,9 |
CFLAGS = -O3 -std=gnu89 -Wall -Wextra -pedantic |
all: buildidx |
buildidx: buildidx.c |
gcc buildidx.c -o buildidx $(CFLAGS) |
clean: |
rm -f buildidx *.o |
//buildidx/buildidx.c |
---|
0,0 → 1,285 |
/* |
FDNPKG idx builder |
Copyright (C) Mateusz Viste 2012, 2013, 2014, 2015, 2016, 2017 |
buildidx computes idx files for FDNPKG-compatible repositories. |
it must be executed pointing to a directory that stores FreeDOS |
packages (zip) files. buildidx will generate the index file and |
save it into the package repository. |
23 apr 2017: uncompressed index is no longer created, added CRC32 of zib (bin only) files, if present |
28 aug 2016: listing.txt is always written inside the repo dir (instead of inside current dir) |
27 aug 2016: accepting full paths to repos (starting with /...) |
07 dec 2013: rewritten buildidx in ANSI C89 |
19 aug 2013: add a compressed version of the index file to repos (index.gz) |
22 jul 2013: creating a listing.txt file with list of packages |
18 jul 2013: writing the number of packaged into the first line of the lst file |
11 jul 2013: added a switch to 7za to make it case insensitive when extracting lsm files |
10 jul 2013: changed unzip calls to 7za (to handle cases when appinfo is compressed with lzma) |
04 feb 2013: added CRC32 support |
22 sep 2012: forked 1st version from FDUPDATE builder |
*/ |
#include <errno.h> |
#include <stdio.h> /* fopen, fclose... */ |
#include <stdlib.h> /* system() */ |
#include <string.h> /* strcasecmp() */ |
#include <time.h> /* time(), ctime() */ |
#include <unistd.h> /* read() */ |
#include <dirent.h> |
#include <sys/types.h> |
#define pVer "2017-04-23" |
#include "crc32lib.c" |
/* computes the CRC32 of file and returns it. returns 0 on error. */ |
static unsigned long file2crc(char *filename) { |
unsigned long result; |
unsigned char buff[16 * 1024]; |
int buffread; |
FILE *fd; |
fd = fopen(filename, "rb"); |
if (fd == NULL) return(0); |
result = crc32_init(); |
while ((buffread = fread(buff, 1, sizeof(buff), fd)) > 0) { |
if (buffread > 0) crc32_feed(&result, buff, buffread); |
} |
crc32_finish(&result); |
fclose(fd); |
if (buffread < 0) puts("read() error!"); |
return(result); |
} |
static void trim(char *str) { |
int x, y, firstchar = -1, lastchar = -1; |
for (x = 0; str[x] != 0; x++) { |
switch (str[x]) { |
case ' ': |
case '\t': |
case '\n': |
case '\r': |
break; |
default: |
if (firstchar < 0) firstchar = x; |
lastchar = x; |
break; |
} |
} |
str[lastchar + 1] = 0; /* right trim */ |
if (firstchar > 0) { /* left trim (shift to the left ) */ |
y = 0; |
for (x = firstchar; str[x] != 0; x++) str[y++] = str[x]; |
str[y] = 0; |
} |
} |
/* reads a line from a file descriptor, and writes it to *line, the *line array is filled no more than maxlen bytes. returns the number of byte read on success, or a negative value on failure (reaching EOF is considered an error condition) */ |
static int readline_fromfile(FILE *fd, char *line, int maxlen) { |
int bytebuff, linelen = 0; |
for (;;) { |
bytebuff = fgetc(fd); |
if (bytebuff == EOF) { |
line[linelen] = 0; |
if (linelen == 0) return(-1); |
return(linelen); |
} |
if (bytebuff < 0) return(-1); |
if (bytebuff == '\r') continue; /* ignore CR */ |
if (bytebuff == '\n') { |
line[linelen] = 0; |
return(linelen); |
} |
if (linelen < maxlen) line[linelen++] = bytebuff; |
} |
} |
static int readlsm(char *filename, char *version, char *title, char *description) { |
char linebuff[1024]; |
char *valuestr; |
int x; |
FILE *fd; |
/* reset fields to be read to empty values */ |
version[0] = 0; |
description[0] = 0; |
title[0] = 0; |
/* open the file */ |
fd = fopen(filename, "rb"); |
if (fd == NULL) return(-1); |
/* check the file's header */ |
if (readline_fromfile(fd, linebuff, 64) < 0) return(-1); |
if (strcasecmp(linebuff, "begin3") != 0) return(-1); |
/* read the LSM file line by line */ |
while (readline_fromfile(fd, linebuff, 127) >= 0) { |
for (x = 0;; x++) { |
if (linebuff[x] == 0) { |
x = -1; |
break; |
} else if (linebuff[x] == ':') { |
break; |
} |
} |
if (x > 0) { |
linebuff[x] = 0; |
valuestr = linebuff + x + 1; |
trim(linebuff); |
trim(valuestr); |
if (strcasecmp(linebuff, "version") == 0) { |
sprintf(version, "%s", valuestr); |
} else if (strcasecmp(linebuff, "title") == 0) { |
sprintf(title, "%s", valuestr); |
} else if (strcasecmp(linebuff, "description") == 0) { |
sprintf(description, "%s", valuestr); |
} |
} |
} |
fclose(fd); |
return(0); |
} |
static int cmpstring(const void *p1, const void *p2) { |
/* The actual arguments to this function are "pointers to |
pointers to char", but strcmp(3) arguments are "pointers |
to char", hence the following cast plus dereference */ |
return(strcasecmp(* (char * const *) p1, * (char * const *) p2)); |
} |
static char *getlastdir(char *s) { |
char *r = s; |
for (; *s != 0; s++) { |
if ((*s == '/') && (s[1] != 0)) r = s+1; |
} |
return(r); |
} |
static void GenIndexes(char *repodir) { |
char *LsmFileList[4096]; |
char tmpbuf[64]; |
char *LsmFile, LSMpackage[64], LSMtitle[128], LSMversion[128], LSMdescription[1024]; |
int LsmCount = 0, x; |
FILE *idx, *listing; |
time_t curtime; |
DIR *dir; |
struct dirent *diritem; |
dir = opendir("appinfo"); |
if (dir == NULL) { |
printf("ERROR: Unable to open directory '%s' (%s)\n", repodir, strerror(errno)); |
return; |
} |
/* load the content of the appinfo directory */ |
while ((diritem = readdir(dir)) != NULL) { |
if (strstr(diritem->d_name, ".lsm") == NULL) continue; /* skip files that do not contain '.lsm' */ |
LsmFileList[LsmCount] = strdup(diritem->d_name); |
/* printf("Loaded LSM file: %s\n", LsmFileList[LsmCount]); */ |
LsmCount += 1; |
} |
closedir(dir); |
printf("Found %d LSM files\n", LsmCount); |
/* sort the entries */ |
qsort(&LsmFileList[0], LsmCount, sizeof(char *), cmpstring); |
/* Create the index file */ |
sprintf(tmpbuf, "%s/index.lst", repodir); |
idx = fopen(tmpbuf, "wb"); |
sprintf(tmpbuf, "%s/listing.txt", repodir); |
listing = fopen(tmpbuf, "wb"); |
/* Write out the index header */ |
curtime = time(NULL); |
fprintf(idx, "FD-REPOv1\t'%s' built at unix time %ld, lists %d packages\n", getlastdir(repodir), curtime, LsmCount); |
fprintf(listing, "\n"); |
fprintf(listing, "*** Repository '%s' - build time: %s\n", getlastdir(repodir), ctime(&curtime)); |
/* Read every LSM */ |
for (x = 0; x < LsmCount; x++) { |
unsigned long crc32, crc32zib; |
LsmFile = LsmFileList[x]; |
sprintf(LSMpackage, "%s", LsmFile); |
LSMpackage[strlen(LSMpackage) - 4] = 0; |
/* compute the CRC of the zip package, and its zib version, if present */ |
sprintf(tmpbuf, "%s/%s.zip", repodir, LSMpackage); |
crc32 = file2crc(tmpbuf); |
sprintf(tmpbuf, "%s/%s.zib", repodir, LSMpackage); |
crc32zib = file2crc(tmpbuf); |
if (crc32zib != 0) { |
printf("Processing %s... CRC %08lX (zib: %08lX)\n", LsmFile, crc32, crc32zib); |
} else { |
printf("Processing %s... CRC %08lX\n", LsmFile, crc32); |
} |
sprintf(tmpbuf, "appinfo/%s", LsmFile); |
readlsm(tmpbuf, LSMversion, LSMtitle, LSMdescription); |
if (strlen(LSMpackage) > 8) printf("Warning: %s.zip is not in 8.3 format!\n", LSMpackage); |
if (LSMtitle[0] == 0) printf("Warning: no LSM title for %s.zip\n", LSMpackage); |
if (LSMversion[0] == 0) printf("Warning: no LSM version for %s.zip!\n", LSMpackage); |
if (LSMdescription[0] == 0) printf("Warning: no LSM description for %s.zip!\n", LSMpackage); |
if (crc32zib != 0) { |
fprintf(idx, "%s\t%s\t%s\t%08lX\t%08lX\n", LSMpackage, LSMversion, LSMdescription, crc32, crc32zib); |
} else { |
fprintf(idx, "%s\t%s\t%s\t%08lX\t\n", LSMpackage, LSMversion, LSMdescription, crc32); |
} |
fprintf(listing, "%s %s - %s\n", LSMpackage, LSMversion, LSMdescription); |
} |
fprintf(listing, "\n"); |
fclose(idx); |
fclose(listing); |
/* create the compressed version of the index file using gzip */ |
sprintf(tmpbuf, "gzip -9 < %s/index.lst > %s/index.gz", repodir, repodir); |
system(tmpbuf); |
/* remove the uncompressed version */ |
sprintf(tmpbuf, "%s/index.lst", repodir); |
unlink(tmpbuf); |
printf("%d packages found.\n", LsmCount); |
} |
int main(int argc, char **argv) { |
char *repodir; |
char cmdbuff[1024]; |
puts("FDNPKG server repository generator version " pVer); |
if (argc != 2) { |
puts("Usage: buildidx repodir"); |
return(1); |
} |
if ((argv[1][0] == '?') || (argv[1][0] == '-') || (argv[1][0]) == 0) { |
puts("Usage: buildidx repodir"); |
return(1); |
} |
repodir = argv[1]; |
printf("Will build index for %s directory.\n", repodir); |
puts("Recreating the appinfo directory..."); |
system("rm -rf appinfo"); |
system("mkdir appinfo"); |
puts("Populating appinfo with LSM files from archives..."); |
sprintf(cmdbuff, "unzip -C -j -L -o '%s/*.zip' 'appinfo/*.lsm' -d appinfo", repodir); |
system(cmdbuff); |
puts("Generating the index file..."); |
GenIndexes(repodir); |
system("rm -rf appinfo"); |
return(0); |
} |
//buildidx/crc32lib.c |
---|
0,0 → 1,116 |
/* The implementation here was originally done by Gary S. Brown. I have |
borrowed the tables directly, and made some minor changes to the |
crc32-function (including changing the interface). */ |
/* ============================================================= */ |
/* COPYRIGHT (C) 1986 Gary S. Brown. You may use this program, or */ |
/* code or tables extracted from it, as desired without restriction. */ |
/* */ |
/* First, the polynomial itself and its table of feedback terms. The */ |
/* polynomial is */ |
/* X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0 */ |
/* */ |
/* Note that we take it "backwards" and put the highest-order term in */ |
/* the lowest-order bit. The X^32 term is "implied"; the LSB is the */ |
/* X^31 term, etc. The X^0 term (usually shown as "+1") results in */ |
/* the MSB being 1. */ |
/* */ |
/* Note that the usual hardware shift register implementation, which */ |
/* is what we're using (we're merely optimizing it by doing eight-bit */ |
/* chunks at a time) shifts bits into the lowest-order term. In our */ |
/* implementation, that means shifting towards the right. Why do we */ |
/* do it this way? Because the calculated CRC must be transmitted in */ |
/* order from highest-order term to lowest-order term. UARTs transmit */ |
/* characters in order from LSB to MSB. By storing the CRC this way, */ |
/* we hand it to the UART in the order low-byte to high-byte; the UART */ |
/* sends each low-bit to hight-bit; and the result is transmission bit */ |
/* by bit from highest- to lowest-order term without requiring any bit */ |
/* shuffling on our part. Reception works similarly. */ |
/* */ |
/* The feedback terms table consists of 256, 32-bit entries. Notes: */ |
/* */ |
/* The table can be generated at runtime if desired; code to do so */ |
/* is shown later. It might not be obvious, but the feedback */ |
/* terms simply represent the results of eight shift/xor opera- */ |
/* tions for all combinations of data and CRC register values. */ |
/* */ |
/* The values must be right-shifted by eight bits by the "updcrc" */ |
/* logic; the shift must be unsigned (bring in zeroes). On some */ |
/* hardware you could probably optimize the shift in assembler by */ |
/* using byte-swap instructions. */ |
/* polynomial $edb88320 */ |
/* */ |
/* -------------------------------------------------------------------- */ |
const unsigned long crc32_tab[256] = { |
0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L, |
0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L, |
0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L, |
0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL, |
0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L, |
0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L, |
0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L, |
0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL, |
0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L, |
0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL, |
0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L, |
0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L, |
0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L, |
0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL, |
0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL, |
0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L, |
0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL, |
0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L, |
0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L, |
0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L, |
0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL, |
0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L, |
0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L, |
0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL, |
0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L, |
0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L, |
0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L, |
0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L, |
0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L, |
0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL, |
0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL, |
0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L, |
0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L, |
0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL, |
0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL, |
0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L, |
0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL, |
0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L, |
0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL, |
0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L, |
0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL, |
0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L, |
0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L, |
0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL, |
0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L, |
0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L, |
0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L, |
0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L, |
0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L, |
0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L, |
0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL, |
0x2d02ef8dL |
}; |
/* Return a 32-bit CRC of the contents of the buffer. */ |
unsigned long crc32_init() { |
return(0xFFFFFFFF); |
} |
void crc32_feed(unsigned long *crc32val, const unsigned char *s, unsigned int len) { |
unsigned long i; |
for (i = 0; i < len; i++) *crc32val = crc32_tab[(*crc32val ^ s[i]) & 0xff] ^ (*crc32val >> 8); |
} |
void crc32_finish(unsigned long *crc32val) { |
*crc32val ^= 0xFFFFFFFF; |
} |
//buildidx/readme.txt |
---|
0,0 → 1,23 |
buildidx is a little program that generates index.lst files for FDNPKG repositories out of a directory filled with FreeDOS packages. |
You DON'T need buildidx if you're only using FDNPKG. This is a tool that can be useful only to administrators hosting and maintaining FDNPKG repositories. I tested (and used) it only on a Linux platform, but it might work on other platforms as well (if you manage to compile it correctly). |
* Requirements * |
To operate properly, buildidx needs following tools to be available: |
- gzip |
- unzip |
* How to use it * |
Put all your packages into a single directory, for ex. "mystuff", and call buildidx with the directory as a parameter: |
./buildidx mystuff |
Then buildidx will compute a index.lst file and store it inside your directory. The directory will be useable as a FDNPKG repository then. |
- Mateusz Viste |