mirror of
https://github.com/sheumann/hush.git
synced 2024-08-16 09:29:16 +00:00
849 lines
21 KiB
C
849 lines
21 KiB
C
#include <dirent.h>
|
|
#include <getopt.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <search.h>
|
|
#include <errno.h>
|
|
#include <fcntl.h>
|
|
#include <unistd.h>
|
|
#include <utime.h>
|
|
#include <sys/types.h>
|
|
#include <sys/stat.h>
|
|
|
|
#include "busybox.h"
|
|
|
|
|
|
#define DEPENDSMAX 64 /* maximum number of depends we can handle */
|
|
|
|
/* Should we do full dependency checking? */
|
|
#define DODEPENDS 1
|
|
|
|
/* Should we do debugging? */
|
|
//#define DODEBUG 1
|
|
|
|
#ifdef DODEBUG
|
|
#define SYSTEM(x) do_system(x)
|
|
#define DPRINTF(fmt,args...) fprintf(stderr, fmt, ##args)
|
|
#else
|
|
#define SYSTEM(x) system(x)
|
|
#define DPRINTF(fmt,args...) /* nothing */
|
|
#endif
|
|
|
|
/* from dpkg-deb.c */
|
|
extern int deb_extract(int optflags, const char *dir_name, const char *deb_filename);
|
|
static const int dpkg_deb_contents = 1;
|
|
static const int dpkg_deb_control = 2;
|
|
// const int dpkg_deb_info = 4;
|
|
static const int dpkg_deb_extract = 8;
|
|
static const int dpkg_deb_verbose_extract = 16;
|
|
static const int dpkg_deb_list = 32;
|
|
|
|
static const char statusfile[] = "/var/lib/dpkg/status.udeb";
|
|
static const char new_statusfile[] = "/var/lib/dpkg/status.udeb.new";
|
|
static const char bak_statusfile[] = "/var/lib/dpkg/status.udeb.bak";
|
|
|
|
static const char dpkgcidir[] = "/var/lib/dpkg/tmp.ci/";
|
|
|
|
static const char infodir[] = "/var/lib/dpkg/info/";
|
|
static const char udpkg_quiet[] = "UDPKG_QUIET";
|
|
|
|
//static const int status_want_unknown = 1;
|
|
static const int status_want_install = 2;
|
|
//static const int status_want_hold = 3;
|
|
//static const int status_want_deinstall = 4;
|
|
//static const int status_want_purge = 5;
|
|
|
|
static const int status_flag_ok = 1;
|
|
//static const int status_flag_reinstreq = 2;
|
|
//static const int status_flag_hold = 3;
|
|
//static const int status_flag_holdreinstreq = 4;
|
|
|
|
//static const int status_statusnoninstalled = 1;
|
|
static const int status_status_unpacked = 2;
|
|
static const int status_status_halfconfigured = 3;
|
|
static const int status_status_installed = 4;
|
|
static const int status_status_halfinstalled = 5;
|
|
//static const int status_statusconfigfiles = 6;
|
|
//static const int status_statuspostinstfailed = 7;
|
|
//static const int status_statusremovalfailed = 8;
|
|
|
|
static const char *status_words_want[] = { "unknown", "install", "hold", "deinstall", "purge", 0 };
|
|
static const char *status_words_flag[] = { "ok", "reinstreq", "hold", "hold-reinstreq", 0 };
|
|
static const char *status_words_status[] = { "not-installed", "unpacked", "half-configured", "installed",
|
|
"half-installed", "config-files", "post-inst-failed", "removal-failed", 0 };
|
|
|
|
static const int color_white = 0;
|
|
static const int color_grey = 1;
|
|
static const int color_black = 2;
|
|
|
|
/* data structures */
|
|
typedef struct package_s {
|
|
char *file;
|
|
char *package;
|
|
char *version;
|
|
char *depends;
|
|
char *provides;
|
|
char *description;
|
|
int installer_menu_item;
|
|
unsigned char status_want;
|
|
unsigned char status_flag;
|
|
unsigned char status_status;
|
|
char color; /* for topo-sort */
|
|
struct package_s *requiredfor[DEPENDSMAX];
|
|
unsigned short requiredcount;
|
|
struct package_s *next;
|
|
} package_t;
|
|
|
|
#ifdef DODEBUG
|
|
static int do_system(const char *cmd)
|
|
{
|
|
DPRINTF("cmd is %s\n", cmd);
|
|
return system(cmd);
|
|
}
|
|
#else
|
|
#define do_system(cmd) system(cmd)
|
|
#endif
|
|
|
|
static int package_compare(const void *p1, const void *p2)
|
|
{
|
|
return strcmp(((package_t *)p1)->package,
|
|
((package_t *)p2)->package);
|
|
}
|
|
|
|
/*
|
|
* NOTE: this was handled by a "rm -rf" shell command
|
|
* Maybe theis behaviour should be integrated into the rm applet
|
|
* (i dont appreciate the rm applets recursive action fn)-bug1
|
|
*/
|
|
static int remove_dir(const char *dirname)
|
|
{
|
|
struct dirent *fp;
|
|
DIR *dp = opendir(dirname);
|
|
while ((fp = readdir(dp)) != NULL) {
|
|
struct stat statbuf;
|
|
char *filename;
|
|
|
|
filename = (char *) xcalloc(1, strlen(dirname) + strlen(fp->d_name) + 2);
|
|
strcpy(filename, dirname);
|
|
strcat(filename, fp->d_name);
|
|
lstat(filename, &statbuf);
|
|
|
|
if ((strcmp(fp->d_name, ".") != 0) && (strcmp(fp->d_name, "..") != 0)) {
|
|
if (S_ISDIR(statbuf.st_mode)) {
|
|
remove_dir(strcat(filename, "/"));
|
|
}
|
|
else if (remove(filename) == -1) {
|
|
perror_msg(filename);
|
|
}
|
|
}
|
|
}
|
|
remove(dirname);
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
#ifdef DODEPENDS
|
|
#include <ctype.h>
|
|
|
|
static char **depends_split(const char *dependsstr)
|
|
{
|
|
static char *dependsvec[DEPENDSMAX];
|
|
char *p;
|
|
int i = 0;
|
|
|
|
dependsvec[0] = 0;
|
|
if (dependsstr == 0) {
|
|
goto end;
|
|
}
|
|
|
|
p = xstrdup(dependsstr);
|
|
while (*p != 0 && *p != '\n') {
|
|
if (*p != ' ') {
|
|
if (*p == ',') {
|
|
*p = 0;
|
|
dependsvec[++i] = 0;
|
|
} else {
|
|
if (dependsvec[i] == 0) {
|
|
dependsvec[i] = p;
|
|
}
|
|
}
|
|
} else {
|
|
*p = 0; /* eat the space... */
|
|
}
|
|
p++;
|
|
}
|
|
*p = 0;
|
|
|
|
end:
|
|
dependsvec[i+1] = 0;
|
|
return dependsvec;
|
|
}
|
|
|
|
/* Topological sort algorithm:
|
|
* ordered is the output list, pkgs is the dependency graph, pkg is
|
|
* the current node
|
|
*
|
|
* recursively add all the adjacent nodes to the ordered list, marking
|
|
* each one as visited along the way
|
|
*
|
|
* yes, this algorithm looks a bit odd when all the params have the
|
|
* same type :-)
|
|
*/
|
|
static void depends_sort_visit(package_t **ordered, package_t *pkgs,
|
|
package_t *pkg)
|
|
{
|
|
unsigned short i;
|
|
|
|
/* mark node as processing */
|
|
pkg->color = color_grey;
|
|
|
|
/* visit each not-yet-visited node */
|
|
for (i = 0; i < pkg->requiredcount; i++)
|
|
if (pkg->requiredfor[i]->color == color_white)
|
|
depends_sort_visit(ordered, pkgs, pkg->requiredfor[i]);
|
|
|
|
#if 0
|
|
/* add it to the list */
|
|
newnode = (struct package_t *)xmalloc(sizeof(struct package_t));
|
|
/* make a shallow copy */
|
|
*newnode = *pkg;
|
|
newnode->next = *ordered;
|
|
*ordered = newnode;
|
|
#endif
|
|
|
|
pkg->next = *ordered;
|
|
*ordered = pkg;
|
|
|
|
/* mark node as done */
|
|
pkg->color = color_black;
|
|
}
|
|
|
|
static package_t *depends_sort(package_t *pkgs)
|
|
{
|
|
/* TODO: it needs to break cycles in the to-be-installed package
|
|
* graph... */
|
|
package_t *ordered = NULL;
|
|
package_t *pkg;
|
|
|
|
for (pkg = pkgs; pkg != 0; pkg = pkg->next) {
|
|
pkg->color = color_white;
|
|
}
|
|
for (pkg = pkgs; pkg != 0; pkg = pkg->next) {
|
|
if (pkg->color == color_white) {
|
|
depends_sort_visit(&ordered, pkgs, pkg);
|
|
}
|
|
}
|
|
|
|
/* Leaks the old list... return the new one... */
|
|
return ordered;
|
|
}
|
|
|
|
|
|
/* resolve package dependencies --
|
|
* for each package in the list of packages to be installed, we parse its
|
|
* dependency info to determine if the dependent packages are either
|
|
* already installed, or are scheduled to be installed. If both tests fail
|
|
* than bail.
|
|
*
|
|
* The algorithm here is O(n^2*m) where n = number of packages to be
|
|
* installed and m is the # of dependencies per package. Not a terribly
|
|
* efficient algorithm, but given that at any one time you are unlikely
|
|
* to install a very large number of packages it doesn't really matter
|
|
*/
|
|
static package_t *depends_resolve(package_t *pkgs, void *status)
|
|
{
|
|
package_t *pkg, *chk;
|
|
package_t dependpkg;
|
|
char **dependsvec;
|
|
int i;
|
|
void *found;
|
|
|
|
for (pkg = pkgs; pkg != 0; pkg = pkg->next) {
|
|
dependsvec = depends_split(pkg->depends);
|
|
i = 0;
|
|
while (dependsvec[i] != 0) {
|
|
/* Check for dependencies; first look for installed packages */
|
|
dependpkg.package = dependsvec[i];
|
|
if (((found = tfind(&dependpkg, &status, package_compare)) == 0) ||
|
|
((chk = *(package_t **)found) && (chk->status_flag & status_flag_ok) &&
|
|
(chk->status_status & status_status_installed))) {
|
|
|
|
/* if it fails, we look through the list of packages we are going to
|
|
* install */
|
|
for (chk = pkgs; chk != 0; chk = chk->next) {
|
|
if (strcmp(chk->package, dependsvec[i]) == 0 || (chk->provides &&
|
|
strncmp(chk->provides, dependsvec[i], strlen(dependsvec[i])) == 0)) {
|
|
if (chk->requiredcount >= DEPENDSMAX) {
|
|
error_msg("Too many dependencies for %s", chk->package);
|
|
return 0;
|
|
}
|
|
if (chk != pkg) {
|
|
chk->requiredfor[chk->requiredcount++] = pkg;
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
if (chk == 0) {
|
|
error_msg("%s depends on %s, but it is not going to be installed", pkg->package, dependsvec[i]);
|
|
return 0;
|
|
}
|
|
}
|
|
i++;
|
|
}
|
|
}
|
|
|
|
return depends_sort(pkgs);
|
|
}
|
|
#endif
|
|
|
|
/* Status file handling routines
|
|
*
|
|
* This is a fairly minimalistic implementation. there are two main functions
|
|
* that are supported:
|
|
*
|
|
* 1) reading the entire status file:
|
|
* the status file is read into memory as a binary-tree, with just the
|
|
* package and status info preserved
|
|
*
|
|
* 2) merging the status file
|
|
* control info from (new) packages is merged into the status file,
|
|
* replacing any pre-existing entries. when a merge happens, status info
|
|
* read using the status_read function is written back to the status file
|
|
*/
|
|
static unsigned char status_parse(const char *line, const char **status_words)
|
|
{
|
|
unsigned char status_num;
|
|
int i = 0;
|
|
|
|
while (status_words[i] != 0) {
|
|
if (strncmp(line, status_words[i], strlen(status_words[i])) == 0) {
|
|
status_num = (char)i;
|
|
return(status_num);
|
|
}
|
|
i++;
|
|
}
|
|
/* parse error */
|
|
error_msg("Invalid status word");
|
|
return(0);
|
|
}
|
|
|
|
/*
|
|
* Read a control file (or a stanza of a status file) and parse it,
|
|
* filling parsed fields into the package structure
|
|
*/
|
|
static int control_read(FILE *file, package_t *p)
|
|
{
|
|
char *line;
|
|
|
|
while ((line = get_line_from_file(file)) != NULL) {
|
|
line[strlen(line) - 1] = '\0';
|
|
|
|
if (strlen(line) == 0) {
|
|
break;
|
|
}
|
|
else if (strstr(line, "Package: ") == line) {
|
|
p->package = xstrdup(line + 9);
|
|
}
|
|
else if (strstr(line, "Status: ") == line) {
|
|
char *word_pointer;
|
|
word_pointer = strchr(line, ' ') + 1;
|
|
p->status_want = status_parse(word_pointer, status_words_want);
|
|
word_pointer = strchr(word_pointer, ' ') + 1;
|
|
p->status_flag = status_parse(word_pointer, status_words_flag);
|
|
word_pointer = strchr(word_pointer, ' ') + 1;
|
|
p->status_status = status_parse(word_pointer, status_words_status);
|
|
}
|
|
else if (strstr(line, "Depends: ") == line) {
|
|
p->depends = xstrdup(line + 9);
|
|
}
|
|
else if (strstr(line, "Provides: ") == line) {
|
|
p->provides = xstrdup(line + 10);
|
|
}
|
|
else if (strstr(line, "Description: ") == line) {
|
|
p->description = xstrdup(line + 13);
|
|
/* This is specific to the Debian Installer. Ifdef? */
|
|
}
|
|
else if (strstr(line, "installer-menu-item: ") == line) {
|
|
p->installer_menu_item = atoi(line + 21);
|
|
}
|
|
/* TODO: localized descriptions */
|
|
}
|
|
free(line);
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
static void *status_read(void)
|
|
{
|
|
FILE *f;
|
|
void *status = 0;
|
|
package_t *m = 0, *p = 0, *t = 0;
|
|
|
|
if (getenv(udpkg_quiet) == NULL) {
|
|
printf("(Reading database...)\n");
|
|
}
|
|
|
|
if ((f = wfopen(statusfile, "r")) == NULL) {
|
|
return(NULL);
|
|
}
|
|
|
|
while (!feof(f)) {
|
|
m = (package_t *)xcalloc(1, sizeof(package_t));
|
|
control_read(f, m);
|
|
if (m->package) {
|
|
/*
|
|
* If there is an item in the tree by this name,
|
|
* it must be a virtual package; insert real
|
|
* package in preference.
|
|
*/
|
|
tdelete(m, &status, package_compare);
|
|
tsearch(m, &status, package_compare);
|
|
if (m->provides) {
|
|
/*
|
|
* A "Provides" triggers the insertion
|
|
* of a pseudo package into the status
|
|
* binary-tree.
|
|
*/
|
|
p = (package_t *)xcalloc(1, sizeof(package_t));
|
|
p->package = xstrdup(m->provides);
|
|
t = *(package_t **)tsearch(p, &status, package_compare);
|
|
if (t != p) {
|
|
free(p->package);
|
|
free(p);
|
|
} else {
|
|
/*
|
|
* Pseudo package status is the
|
|
* same as the status of the
|
|
* package providing it
|
|
* FIXME: (not quite right, if 2
|
|
* packages of different statuses
|
|
* provide it).
|
|
*/
|
|
t->status_want = m->status_want;
|
|
t->status_flag = m->status_flag;
|
|
t->status_status = m->status_status;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
free(m);
|
|
}
|
|
}
|
|
fclose(f);
|
|
return status;
|
|
}
|
|
|
|
static int status_merge(void *status, package_t *pkgs)
|
|
{
|
|
FILE *fin, *fout;
|
|
char *line = NULL;
|
|
package_t *pkg = 0, *statpkg = 0;
|
|
package_t locpkg;
|
|
|
|
if ((fout = wfopen(new_statusfile, "w")) == NULL) {
|
|
return 0;
|
|
}
|
|
if (getenv(udpkg_quiet) == NULL) {
|
|
printf("(Updating database...)\n");
|
|
}
|
|
|
|
/*
|
|
* Dont use wfopen here, handle errors ourself
|
|
*/
|
|
if ((fin = fopen(statusfile, "r")) != NULL) {
|
|
while (((line = get_line_from_file(fin)) != NULL) && !feof(fin)) {
|
|
line[strlen(line) - 1] = '\0'; /* trim newline */
|
|
/* If we see a package header, find out if it's a package
|
|
* that we have processed. if so, we skip that block for
|
|
* now (write it at the end).
|
|
*
|
|
* we also look at packages in the status cache and update
|
|
* their status fields
|
|
*/
|
|
if (strstr(line, "Package: ") == line) {
|
|
for (pkg = pkgs; pkg != 0 && strcmp(line + 9,
|
|
pkg->package) != 0; pkg = pkg->next) ;
|
|
|
|
locpkg.package = line + 9;
|
|
statpkg = tfind(&locpkg, &status, package_compare);
|
|
|
|
/* note: statpkg should be non-zero, unless the status
|
|
* file was changed while we are processing (no locking
|
|
* is currently done...
|
|
*/
|
|
if (statpkg != 0) {
|
|
statpkg = *(package_t **)statpkg;
|
|
}
|
|
}
|
|
if (pkg != 0) {
|
|
continue;
|
|
}
|
|
if (strstr(line, "Status: ") == line && statpkg != 0) {
|
|
snprintf(line, sizeof(line), "Status: %s %s %s",
|
|
status_words_want[statpkg->status_want - 1],
|
|
status_words_flag[statpkg->status_flag - 1],
|
|
status_words_status[statpkg->status_status - 1]);
|
|
}
|
|
fprintf(fout, "%s\n", line);
|
|
}
|
|
fclose(fin);
|
|
}
|
|
free(line);
|
|
|
|
// Print out packages we processed.
|
|
for (pkg = pkgs; pkg != 0; pkg = pkg->next) {
|
|
fprintf(fout, "Package: %s\nStatus: %s %s %s\n",
|
|
pkg->package, status_words_want[pkg->status_want - 1],
|
|
status_words_flag[pkg->status_flag - 1],
|
|
status_words_status[pkg->status_status - 1]);
|
|
|
|
if (pkg->depends)
|
|
fprintf(fout, "Depends: %s\n", pkg->depends);
|
|
if (pkg->provides)
|
|
fprintf(fout, "Provides: %s\n", pkg->provides);
|
|
if (pkg->installer_menu_item)
|
|
fprintf(fout, "installer-menu-item: %i\n", pkg->installer_menu_item);
|
|
if (pkg->description)
|
|
fprintf(fout, "Description: %s\n", pkg->description);
|
|
fputc('\n', fout);
|
|
}
|
|
fclose(fout);
|
|
|
|
/*
|
|
* Its ok if renaming statusfile fails becasue it doesnt exist
|
|
*/
|
|
if (rename(statusfile, bak_statusfile) == -1) {
|
|
struct stat stat_buf;
|
|
if (stat(statusfile, &stat_buf) == 0) {
|
|
error_msg("Couldnt create backup status file");
|
|
return(EXIT_FAILURE);
|
|
}
|
|
error_msg("No status file found, creating new one");
|
|
}
|
|
|
|
if (rename(new_statusfile, statusfile) == -1) {
|
|
error_msg("Couldnt create status file");
|
|
return(EXIT_FAILURE);
|
|
}
|
|
return(EXIT_SUCCESS);
|
|
}
|
|
|
|
static int is_file(const char *fn)
|
|
{
|
|
struct stat statbuf;
|
|
|
|
if (stat(fn, &statbuf) < 0) {
|
|
return 0;
|
|
}
|
|
return S_ISREG(statbuf.st_mode);
|
|
}
|
|
|
|
static int dpkg_doconfigure(package_t *pkg)
|
|
{
|
|
int r;
|
|
char postinst[1024];
|
|
char buf[1024];
|
|
|
|
DPRINTF("Configuring %s\n", pkg->package);
|
|
pkg->status_status = 0;
|
|
snprintf(postinst, sizeof(postinst), "%s%s.postinst", infodir, pkg->package);
|
|
|
|
if (is_file(postinst)) {
|
|
snprintf(buf, sizeof(buf), "%s configure", postinst);
|
|
if ((r = do_system(buf)) != 0) {
|
|
error_msg("postinst exited with status %d\n", r);
|
|
pkg->status_status = status_status_halfconfigured;
|
|
return 1;
|
|
}
|
|
}
|
|
pkg->status_status = status_status_installed;
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int dpkg_dounpack(package_t *pkg)
|
|
{
|
|
int r = 0, i;
|
|
int status = TRUE;
|
|
char *cwd = xgetcwd(0);
|
|
char *src_file = NULL;
|
|
char *dst_file = NULL;
|
|
// char *lst_file = NULL;
|
|
char *adminscripts[] = { "prerm", "postrm", "preinst", "postinst",
|
|
"conffiles", "md5sums", "shlibs", "templates" };
|
|
|
|
DPRINTF("Unpacking %s\n", pkg->package);
|
|
|
|
if(cwd==NULL)
|
|
exit(EXIT_FAILURE);
|
|
chdir("/");
|
|
deb_extract(dpkg_deb_extract, "/", pkg->file);
|
|
|
|
/* Installs the package scripts into the info directory */
|
|
for (i = 0; i < sizeof(adminscripts) / sizeof(adminscripts[0]); i++) {
|
|
struct stat src_stat_buf;
|
|
int src_fd = 0, dst_fd = 0;
|
|
|
|
/* The full path of the current location of the admin file */
|
|
src_file = xrealloc(src_file, strlen(dpkgcidir) + strlen(pkg->package) + strlen(adminscripts[i]) + 1);
|
|
sprintf(src_file, "%s%s/%s", dpkgcidir, pkg->package, adminscripts[i]);
|
|
|
|
/* the full path of where we want the file to be copied to */
|
|
dst_file = xrealloc(dst_file, strlen(infodir) + strlen(pkg->package) + strlen(adminscripts[i]) + 1);
|
|
sprintf(dst_file, "%s%s.%s", infodir, pkg->package, adminscripts[i]);
|
|
|
|
/*
|
|
* copy admin file to permanent home
|
|
* NOTE: Maybe merge this behaviour into libb/copy_file.c
|
|
*/
|
|
if (lstat(src_file, &src_stat_buf) == 0) {
|
|
if ((src_fd = open(src_file, O_RDONLY)) != -1) {
|
|
if ((dst_fd = open(dst_file, O_WRONLY | O_CREAT, 0644)) == -1) {
|
|
status = FALSE;
|
|
perror_msg("Opening %s", dst_file);
|
|
}
|
|
copy_file_chunk(src_fd, dst_fd, src_stat_buf.st_size);
|
|
close(src_fd);
|
|
close(dst_fd);
|
|
} else {
|
|
status = FALSE;
|
|
error_msg("couldnt open [%s]\n", src_file);
|
|
}
|
|
}
|
|
}
|
|
|
|
/*
|
|
* create the list file
|
|
* FIXME: currently this dumps the lst to stdout instead of a file
|
|
*/
|
|
/* lst_file = (char *) xmalloc(strlen(infodir) + strlen(pkg->package) + 6);
|
|
strcpy(lst_file, infodir);
|
|
strcat(lst_file, pkg->package);
|
|
strcat(lst_file, ".list");
|
|
deb_extract(dpkg_deb_list, NULL, pkg->file);
|
|
*/
|
|
|
|
pkg->status_want = status_want_install;
|
|
pkg->status_flag = status_flag_ok;
|
|
|
|
if (status == TRUE) {
|
|
pkg->status_status = status_status_unpacked;
|
|
} else {
|
|
pkg->status_status = status_status_halfinstalled;
|
|
}
|
|
|
|
chdir(cwd);
|
|
return r;
|
|
}
|
|
|
|
/*
|
|
* Extract and parse the control.tar.gz from the specified package
|
|
*/
|
|
static int dpkg_unpackcontrol(package_t *pkg)
|
|
{
|
|
char *tmp_name;
|
|
FILE *file;
|
|
int length;
|
|
|
|
/* clean the temp directory (dpkgcidir) be recreating it */
|
|
remove_dir(dpkgcidir);
|
|
if (create_path(dpkgcidir, S_IRWXU) == FALSE) {
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
/*
|
|
* Get the package name from the file name,
|
|
* first remove the directories
|
|
*/
|
|
if ((tmp_name = strrchr(pkg->file, '/')) == NULL) {
|
|
tmp_name = pkg->file;
|
|
} else {
|
|
tmp_name++;
|
|
}
|
|
/* now remove trailing version numbers etc */
|
|
length = strcspn(tmp_name, "_.");
|
|
pkg->package = (char *) xcalloc(1, length + 1);
|
|
/* store the package name */
|
|
strncpy(pkg->package, tmp_name, length);
|
|
|
|
/* work out the full extraction path */
|
|
tmp_name = (char *) xcalloc(1, strlen(dpkgcidir) + strlen(pkg->package) + 9);
|
|
strcpy(tmp_name, dpkgcidir);
|
|
strcat(tmp_name, pkg->package);
|
|
|
|
/* extract control.tar.gz to the full extraction path */
|
|
deb_extract(dpkg_deb_control, tmp_name, pkg->file);
|
|
|
|
/* parse the extracted control file */
|
|
strcat(tmp_name, "/control");
|
|
if ((file = wfopen(tmp_name, "r")) == NULL) {
|
|
return EXIT_FAILURE;
|
|
}
|
|
if (control_read(file, pkg) == EXIT_FAILURE) {
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|
|
|
|
static int dpkg_unpack(package_t *pkgs, void *status)
|
|
{
|
|
int r = 0;
|
|
package_t *pkg;
|
|
|
|
for (pkg = pkgs; pkg != 0; pkg = pkg->next) {
|
|
if (dpkg_unpackcontrol(pkg) == EXIT_FAILURE) {
|
|
return EXIT_FAILURE;
|
|
}
|
|
if ((r = dpkg_dounpack(pkg)) != 0 ) {
|
|
break;
|
|
}
|
|
}
|
|
status_merge(status, pkgs);
|
|
remove_dir(dpkgcidir);
|
|
|
|
return r;
|
|
}
|
|
|
|
static int dpkg_configure(package_t *pkgs, void *status)
|
|
{
|
|
int r = 0;
|
|
void *found;
|
|
package_t *pkg;
|
|
|
|
for (pkg = pkgs; pkg != 0 && r == 0; pkg = pkg->next) {
|
|
found = tfind(pkg, &status, package_compare);
|
|
|
|
if (found == 0) {
|
|
error_msg("Trying to configure %s, but it is not installed", pkg->package);
|
|
r = 1;
|
|
}
|
|
/* configure the package listed in the status file;
|
|
* not pkg, as we have info only for the latter
|
|
*/
|
|
else {
|
|
r = dpkg_doconfigure(*(package_t **)found);
|
|
}
|
|
}
|
|
status_merge(status, 0);
|
|
|
|
return r;
|
|
}
|
|
|
|
static int dpkg_install(package_t *pkgs, void *status)
|
|
{
|
|
package_t *p, *ordered = 0;
|
|
|
|
/* Stage 1: parse all the control information */
|
|
for (p = pkgs; p != 0; p = p->next) {
|
|
if (dpkg_unpackcontrol(p) == EXIT_FAILURE) {
|
|
return(EXIT_FAILURE);
|
|
}
|
|
}
|
|
|
|
/* Stage 2: resolve dependencies */
|
|
#ifdef DODEPENDS
|
|
ordered = depends_resolve(pkgs, status);
|
|
#else
|
|
ordered = pkgs;
|
|
#endif
|
|
|
|
/* Stage 3: install */
|
|
for (p = ordered; p != 0; p = p->next) {
|
|
p->status_want = status_want_install;
|
|
|
|
/* for now the flag is always set to ok... this is probably
|
|
* not what we want
|
|
*/
|
|
p->status_flag = status_flag_ok;
|
|
|
|
DPRINTF("Installing %s\n", p->package);
|
|
if (dpkg_dounpack(p) != 0) {
|
|
perror_msg(p->file);
|
|
}
|
|
|
|
if (dpkg_doconfigure(p) != 0) {
|
|
perror_msg(p->file);
|
|
}
|
|
}
|
|
|
|
if (ordered != 0) {
|
|
status_merge(status, pkgs);
|
|
}
|
|
remove_dir(dpkgcidir);
|
|
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Not implemented yet
|
|
*
|
|
static int dpkg_remove(package_t *pkgs, void *status)
|
|
{
|
|
package_t *p;
|
|
|
|
for (p = pkgs; p != 0; p = p->next)
|
|
{
|
|
}
|
|
status_merge(status, 0);
|
|
|
|
return 0;
|
|
}
|
|
*/
|
|
|
|
extern int dpkg_main(int argc, char **argv)
|
|
{
|
|
const int arg_install = 1;
|
|
const int arg_unpack = 2;
|
|
const int arg_configure = 4;
|
|
|
|
package_t *p, *packages = NULL;
|
|
void *status = NULL;
|
|
char opt = 0;
|
|
int optflag = 0;
|
|
|
|
while ((opt = getopt(argc, argv, "iruc")) != -1) {
|
|
switch (opt) {
|
|
case 'i':
|
|
optflag |= arg_install;
|
|
break;
|
|
case 'u':
|
|
optflag |= arg_unpack;
|
|
break;
|
|
case 'c':
|
|
optflag |= arg_configure;
|
|
break;
|
|
default:
|
|
show_usage();
|
|
}
|
|
}
|
|
|
|
while (optind < argc) {
|
|
p = (package_t *) xcalloc(1, sizeof(package_t));
|
|
if (optflag & arg_configure) {
|
|
p->package = xstrdup(argv[optind]);
|
|
} else {
|
|
p->file = xstrdup(argv[optind]);
|
|
}
|
|
p->next = packages;
|
|
packages = p;
|
|
|
|
optind++;
|
|
}
|
|
|
|
create_path(dpkgcidir, S_IRWXU);
|
|
create_path(infodir, S_IRWXU);
|
|
|
|
status = status_read();
|
|
|
|
if (optflag & arg_install) {
|
|
return dpkg_install(packages, status);
|
|
}
|
|
else if (optflag & arg_unpack) {
|
|
return dpkg_unpack(packages, status);
|
|
}
|
|
else if (optflag & arg_configure) {
|
|
return dpkg_configure(packages, status);
|
|
}
|
|
return(EXIT_FAILURE);
|
|
}
|