rhughes@241: /*
rhughes@241:  * Copyright (C) 2008  Kristian Høgsberg <krh@redhat.com>
rhughes@241:  * Copyright (C) 2008  Red Hat, Inc
rhughes@241:  *
rhughes@241:  * This program is free software; you can redistribute it and/or modify
rhughes@241:  * it under the terms of the GNU General Public License as published by
rhughes@241:  * the Free Software Foundation; either version 2 of the License, or
rhughes@241:  * (at your option) any later version.
rhughes@241:  *
rhughes@241:  * This program is distributed in the hope that it will be useful,
rhughes@241:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
rhughes@241:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
rhughes@241:  * GNU General Public License for more details.
rhughes@241:  *
rhughes@241:  * You should have received a copy of the GNU General Public License along
rhughes@241:  * with this program; if not, write to the Free Software Foundation, Inc.,
rhughes@241:  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
rhughes@241:  */
rhughes@241: 
rhughes@241: #define _GNU_SOURCE
rhughes@241: 
rhughes@241: #include <stdlib.h>
rhughes@241: #include <stddef.h>
rhughes@241: #include <stdint.h>
rhughes@241: #include <stdio.h>
rhughes@241: #include <string.h>
rhughes@241: #include <sys/types.h>
rhughes@241: #include <sys/stat.h>
rhughes@241: #include <sys/mman.h>
rhughes@241: #include <unistd.h>
rhughes@241: #include <fcntl.h>
rhughes@241: #include <errno.h>
rhughes@241: #include <ctype.h>
rhughes@241: #include <fnmatch.h>
rhughes@241: 
krh@253: #include "razor-internal.h"
rhughes@241: #include "razor.h"
rhughes@241: 
krh@248: void *
rhughes@241: zalloc(size_t size)
rhughes@241: {
rhughes@241: 	void *p;
rhughes@241: 
rhughes@241: 	p = malloc(size);
rhughes@241: 	memset(p, 0, size);
rhughes@241: 
rhughes@241: 	return p;
rhughes@241: }
rhughes@241: 
rhughes@241: struct razor_set_section razor_sections[] = {
rhughes@241: 	{ RAZOR_STRING_POOL,	offsetof(struct razor_set, string_pool) },
rhughes@241: 	{ RAZOR_PACKAGES,	offsetof(struct razor_set, packages) },
rhughes@241: 	{ RAZOR_PROPERTIES,	offsetof(struct razor_set, properties) },
rhughes@241: 	{ RAZOR_FILES,		offsetof(struct razor_set, files) },
rhughes@241: 	{ RAZOR_PACKAGE_POOL,	offsetof(struct razor_set, package_pool) },
rhughes@241: 	{ RAZOR_PROPERTY_POOL,	offsetof(struct razor_set, property_pool) },
rhughes@241: 	{ RAZOR_FILE_POOL,	offsetof(struct razor_set, file_pool) },
rhughes@241: };
rhughes@241: 
rhughes@241: struct razor_set *
rhughes@241: razor_set_create(void)
rhughes@241: {
rhughes@241: 	struct razor_set *set;
rhughes@241: 	struct razor_entry *e;
rhughes@241: 	char *empty;
rhughes@241: 
rhughes@241: 	set = zalloc(sizeof *set);
rhughes@241: 
rhughes@241: 	e = array_add(&set->files, sizeof *e);
rhughes@241: 	empty = array_add(&set->string_pool, 1);
rhughes@241: 	*empty = '\0';
rhughes@241: 	e->name = 0;
rhughes@241: 	e->flags = RAZOR_ENTRY_LAST;
rhughes@241: 	e->start = 0;
rhughes@241: 	list_set_empty(&e->packages);
rhughes@241: 
rhughes@241: 	return set;
rhughes@241: }
rhughes@241: 
rhughes@241: struct razor_set *
rhughes@241: razor_set_open(const char *filename)
rhughes@241: {
rhughes@241: 	struct razor_set *set;
rhughes@241: 	struct razor_set_section *s;
rhughes@241: 	struct stat stat;
rhughes@241: 	struct array *array;
rhughes@241: 	int fd;
rhughes@241: 
rhughes@241: 	set = zalloc(sizeof *set);
rhughes@241: 	fd = open(filename, O_RDONLY);
rhughes@241: 	if (fstat(fd, &stat) < 0)
rhughes@241: 		return NULL;
rhughes@241: 	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
rhughes@241: 	if (set->header == MAP_FAILED) {
rhughes@241: 		free(set);
rhughes@241: 		return NULL;
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	for (s = set->header->sections; ~s->type; s++) {
rhughes@241: 		if (s->type >= ARRAY_SIZE(razor_sections))
rhughes@241: 			continue;
rhughes@241: 		if (s->type != razor_sections[s->type].type)
rhughes@241: 			continue;
rhughes@241: 		array = (void *) set + razor_sections[s->type].offset;
rhughes@241: 		array->data = (void *) set->header + s->offset;
rhughes@241: 		array->size = s->size;
rhughes@241: 		array->alloc = s->size;
rhughes@241: 	}
rhughes@241: 	close(fd);
rhughes@241: 
rhughes@241: 	return set;
rhughes@241: }
rhughes@241: 
rhughes@241: void
rhughes@241: razor_set_destroy(struct razor_set *set)
rhughes@241: {
rhughes@241: 	unsigned int size;
rhughes@241: 	struct array *a;
rhughes@241: 	int i;
rhughes@241: 
rhughes@241: 	if (set->header) {
rhughes@241: 		for (i = 0; set->header->sections[i].type; i++)
rhughes@241: 			;
rhughes@241: 		size = set->header->sections[i].type;
rhughes@241: 		munmap(set->header, size);
rhughes@241: 	} else {
rhughes@241: 		for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
rhughes@241: 			a = (void *) set + razor_sections[i].offset;
rhughes@241: 			free(a->data);
rhughes@241: 		}
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	free(set);
rhughes@241: }
rhughes@241: 
rhughes@241: int
rhughes@241: razor_set_write_to_fd(struct razor_set *set, int fd)
rhughes@241: {
rhughes@241: 	char data[4096];
rhughes@241: 	struct razor_set_header *header = (struct razor_set_header *) data;
rhughes@241: 	struct array *a;
rhughes@241: 	uint32_t offset;
rhughes@241: 	int i;
rhughes@241: 
rhughes@241: 	memset(data, 0, sizeof data);
rhughes@241: 	header->magic = RAZOR_MAGIC;
rhughes@241: 	header->version = RAZOR_VERSION;
rhughes@241: 	offset = sizeof data;
rhughes@241: 
rhughes@241: 	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
rhughes@241: 		if (razor_sections[i].type != i)
rhughes@241: 			continue;
rhughes@241: 		a = (void *) set + razor_sections[i].offset;
rhughes@241: 		header->sections[i].type = i;
rhughes@241: 		header->sections[i].offset = offset;
rhughes@241: 		header->sections[i].size = a->size;
rhughes@241: 		offset += ALIGN(a->size, 4096);
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	header->sections[i].type = ~0;
rhughes@241: 	header->sections[i].offset = 0;
rhughes@241: 	header->sections[i].size = 0;
rhughes@241: 
rhughes@241: 	razor_write(fd, data, sizeof data);
rhughes@241: 	memset(data, 0, sizeof data);
rhughes@241: 	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
rhughes@241: 		if (razor_sections[i].type != i)
rhughes@241: 			continue;
rhughes@241: 		a = (void *) set + razor_sections[i].offset;
rhughes@241: 		razor_write(fd, a->data, a->size);
rhughes@241: 		razor_write(fd, data, ALIGN(a->size, 4096) - a->size);
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	return 0;
rhughes@241: }
rhughes@241: 
rhughes@241: int
rhughes@241: razor_set_write(struct razor_set *set, const char *filename)
rhughes@241: {
rhughes@241: 	int fd, status;
rhughes@241: 
rhughes@241: 	fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);
rhughes@241: 	if (fd < 0)
rhughes@241: 		return -1;
rhughes@241: 
rhughes@241: 	status = razor_set_write_to_fd(set, fd);
rhughes@241: 	if (status) {
rhughes@241: 	    close(fd);
rhughes@241: 	    return status;
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	return close(fd);
rhughes@241: }
rhughes@241: 
rhughes@241: void
rhughes@241: razor_build_evr(char *evr_buf, int size, const char *epoch,
rhughes@241: 		const char *version, const char *release)
rhughes@241: {
rhughes@241: 	int len;
rhughes@241: 
rhughes@241: 	if (!version || !*version) {
rhughes@241: 		*evr_buf = '\0';
rhughes@241: 		return;
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	if (epoch && *epoch && strcmp(epoch, "0") != 0) {
rhughes@241: 		len = snprintf(evr_buf, size, "%s:", epoch);
rhughes@241: 		evr_buf += len;
rhughes@241: 		size -= len;
rhughes@241: 	}
rhughes@241: 	len = snprintf(evr_buf, size, "%s", version);
rhughes@241: 	evr_buf += len;
rhughes@241: 	size -= len;
rhughes@241: 	if (release && *release)
rhughes@241: 		snprintf(evr_buf, size, "-%s", release);
rhughes@241: }
rhughes@241: 
krh@248: int
krh@248: razor_versioncmp(const char *s1, const char *s2)
rhughes@241: {
rhughes@241: 	const char *p1, *p2;
rhughes@241: 	long n1, n2;
rhughes@241: 	int res;
rhughes@241: 
rhughes@241: 	n1 = strtol(s1, (char **) &p1, 10);
rhughes@241: 	n2 = strtol(s2, (char **) &p2, 10);
rhughes@241: 
rhughes@241: 	/* Epoch; if one but not the other has an epoch set, default
rhughes@241: 	 * the epoch-less version to 0. */
rhughes@241: 	res = (*p1 == ':') - (*p2 == ':');
rhughes@241: 	if (res < 0) {
rhughes@241: 		n1 = 0;
rhughes@241: 		p1 = s1;
rhughes@241: 		p2++;
rhughes@241: 	} else if (res > 0) {
rhughes@241: 		p1++;
rhughes@241: 		n2 = 0;
rhughes@241: 		p2 = s2;
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	if (n1 != n2)
rhughes@241: 		return n1 - n2;
rhughes@241: 	while (*p1 && *p2) {
rhughes@241: 		if (*p1 != *p2)
rhughes@241: 			return *p1 - *p2;
rhughes@241: 		p1++;
rhughes@241: 		p2++;
rhughes@241: 		if (isdigit(*p1) && isdigit(*p2))
krh@248: 			return razor_versioncmp(p1, p2);
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	return *p1 - *p2;
rhughes@241: }
rhughes@241: 
rhughes@241: struct razor_package *
rhughes@241: razor_set_get_package(struct razor_set *set, const char *package)
rhughes@241: {
rhughes@241: 	struct razor_package_iterator *pi;
rhughes@241: 	struct razor_package *p;
rhughes@241: 	const char *name, *version, *arch;
rhughes@241: 
rhughes@241: 	pi = razor_package_iterator_create(set);
rhughes@241: 	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {
rhughes@241: 		if (strcmp(package, name) == 0)
rhughes@241: 			break;
rhughes@241: 	}
rhughes@241: 	razor_package_iterator_destroy(pi);
rhughes@241: 
rhughes@241: 	return p;
rhughes@241: }
rhughes@241: 
krh@248: struct razor_entry *
krh@248: razor_set_find_entry(struct razor_set *set,
krh@248: 		     struct razor_entry *dir, const char *pattern)
rhughes@241: {
rhughes@241: 	struct razor_entry *e;
rhughes@241: 	const char *n, *pool = set->string_pool.data;
rhughes@241: 	int len;
rhughes@241: 
rhughes@241: 	e = (struct razor_entry *) set->files.data + dir->start;
rhughes@241: 	do {
rhughes@241: 		n = pool + e->name;
rhughes@241: 		if (strcmp(pattern + 1, n) == 0)
rhughes@241: 			return e;
rhughes@241: 		len = strlen(n);
rhughes@241: 		if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
rhughes@241: 		    pattern[len + 1] == '/') {
krh@248: 			return razor_set_find_entry(set, e, pattern + len + 1);
rhughes@241: 		}
rhughes@241: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
rhughes@241: 
rhughes@241: 	return NULL;
rhughes@241: }
rhughes@241: 
rhughes@241: static void
rhughes@241: list_dir(struct razor_set *set, struct razor_entry *dir,
rhughes@241: 	 char *prefix, const char *pattern)
rhughes@241: {
rhughes@241: 	struct razor_entry *e;
rhughes@241: 	const char *n, *pool = set->string_pool.data;
rhughes@241: 
rhughes@241: 	e = (struct razor_entry *) set->files.data + dir->start;
rhughes@241: 	do {
rhughes@241: 		n = pool + e->name;
rhughes@241: 		if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
rhughes@241: 			continue;
rhughes@241: 		printf("%s/%s\n", prefix, n);
rhughes@241: 		if (e->start) {
rhughes@241: 			char *sub = prefix + strlen (prefix);
rhughes@241: 			*sub = '/';
rhughes@241: 			strcpy (sub + 1, n);
rhughes@241: 			list_dir(set, e, prefix, pattern);
rhughes@241: 			*sub = '\0';
rhughes@241: 		}
rhughes@241: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
rhughes@241: }
rhughes@241: 
rhughes@241: void
rhughes@241: razor_set_list_files(struct razor_set *set, const char *pattern)
rhughes@241: {
rhughes@241: 	struct razor_entry *e;
rhughes@241: 	char buffer[512], *p, *base;
rhughes@241: 
rhughes@241: 	if (pattern == NULL || !strcmp (pattern, "/")) {
rhughes@241: 		buffer[0] = '\0';
rhughes@241: 		list_dir(set, set->files.data, buffer, NULL);
rhughes@241: 		return;
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	strcpy(buffer, pattern);
krh@248: 	e = razor_set_find_entry(set, set->files.data, buffer);
rhughes@241: 	if (e && e->start > 0) {
rhughes@241: 		base = NULL;
rhughes@241: 	} else {
rhughes@241: 		p = strrchr(buffer, '/');
rhughes@241: 		if (p) {
rhughes@241: 			*p = '\0';
rhughes@241: 			base = p + 1;
rhughes@241: 		} else {
rhughes@241: 			base = NULL;
rhughes@241: 		}
rhughes@241: 	}
krh@248: 	e = razor_set_find_entry(set, set->files.data, buffer);
rhughes@241: 	if (e->start != 0)
rhughes@241: 		list_dir(set, e, buffer, base);
rhughes@241: }
rhughes@241: 
rhughes@241: static struct list *
rhughes@241: list_package_files(struct razor_set *set, struct list *r,
rhughes@241: 		   struct razor_entry *dir, uint32_t end,
rhughes@241: 		   char *prefix)
rhughes@241: {
rhughes@241: 	struct razor_entry *e, *f, *entries;
rhughes@241: 	uint32_t next, file;
rhughes@241: 	char *pool;
rhughes@241: 	int len;
rhughes@241: 
rhughes@241: 	entries = (struct razor_entry *) set->files.data;
rhughes@241: 	pool = set->string_pool.data;
rhughes@241: 
rhughes@241: 	e = entries + dir->start;
rhughes@241: 	do {
rhughes@241: 		if (entries + r->data == e) {
rhughes@241: 			printf("%s/%s\n", prefix, pool + e->name);
rhughes@241: 			r = list_next(r);
rhughes@241: 			if (!r)
rhughes@241: 				return NULL;
rhughes@241: 			if (r->data >= end)
rhughes@241: 				return r;
rhughes@241: 		}
rhughes@241: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
rhughes@241: 
rhughes@241: 	e = entries + dir->start;
rhughes@241: 	do {
rhughes@241: 		if (e->start == 0)
rhughes@241: 			continue;
rhughes@241: 
rhughes@241: 		if (e->flags & RAZOR_ENTRY_LAST)
rhughes@241: 			next = end;
rhughes@241: 		else {
rhughes@241: 			f = e + 1;
rhughes@241: 			while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))
rhughes@241: 				f++;
rhughes@241: 			if (f->start == 0)
rhughes@241: 				next = end;
rhughes@241: 			else
rhughes@241: 				next = f->start;
rhughes@241: 		}
rhughes@241: 
rhughes@241: 		file = r->data;
rhughes@241: 		if (e->start <= file && file < next) {
rhughes@241: 			len = strlen(prefix);
rhughes@241: 			prefix[len] = '/';
rhughes@241: 			strcpy(prefix + len + 1, pool + e->name);
rhughes@241: 			r = list_package_files(set, r, e, next, prefix);
rhughes@241: 			prefix[len] = '\0';
rhughes@241: 		}
rhughes@241: 	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);
rhughes@241: 
rhughes@241: 	return r;
rhughes@241: }
rhughes@241: 
rhughes@241: void
rhughes@241: razor_set_list_package_files(struct razor_set *set, const char *name)
rhughes@241: {
rhughes@241: 	struct razor_package *package;
rhughes@241: 	struct list *r;
rhughes@241: 	uint32_t end;
rhughes@241: 	char buffer[512];
rhughes@241: 
rhughes@241: 	package = razor_set_get_package(set, name);
rhughes@241: 
rhughes@241: 	r = list_first(&package->files, &set->file_pool);
rhughes@241: 	end = set->files.size / sizeof (struct razor_entry);
rhughes@241: 	buffer[0] = '\0';
rhughes@241: 	list_package_files(set, r, set->files.data, end, buffer);
rhughes@241: }
rhughes@241: 
rhughes@241: /* The diff order matters.  We should sort the packages so that a
rhughes@241:  * REMOVE of a package comes before the INSTALL, and so that all
rhughes@241:  * requires for a package have been installed before the package.
rhughes@241:  **/
rhughes@241: 
rhughes@241: void
rhughes@241: razor_set_diff(struct razor_set *set, struct razor_set *upstream,
krh@253: 	       razor_diff_callback_t callback, void *data)
rhughes@241: {
rhughes@241:  	struct razor_package_iterator *pi1, *pi2;
rhughes@241:  	struct razor_package *p1, *p2;
rhughes@241: 	const char *name1, *name2, *version1, *version2, *arch1, *arch2;
rhughes@241: 	int res;
rhughes@241: 
rhughes@241: 	pi1 = razor_package_iterator_create(set);
rhughes@241: 	pi2 = razor_package_iterator_create(upstream);
rhughes@241: 
rhughes@241: 	razor_package_iterator_next(pi1, &p1, &name1, &version1, &arch1);
rhughes@241: 	razor_package_iterator_next(pi2, &p2, &name2, &version2, &arch2);
rhughes@241: 
rhughes@241: 	while (p1 || p2) {
rhughes@241: 		if (p1 && p2) {
rhughes@241: 			res = strcmp(name1, name2);
rhughes@241: 			if (res == 0)
krh@248: 				res = razor_versioncmp(version1, version2);
rhughes@241: 		} else {
rhughes@241: 			res = 0;
rhughes@241: 		}
rhughes@241: 
rhughes@241: 		if (p2 == NULL || res < 0)
krh@253: 			callback(RAZOR_DIFF_ACTION_REMOVE,
krh@253: 				 p1, name1, version1, arch1, data);
rhughes@241: 		else if (p1 == NULL || res > 0)
krh@253: 			callback(RAZOR_DIFF_ACTION_ADD,
krh@253: 				 p2, name2, version2, arch2, data);
rhughes@241: 
rhughes@241: 		if (p1 != NULL && res <= 0)
rhughes@241: 			razor_package_iterator_next(pi1, &p1,
rhughes@241: 						    &name1, &version1, &arch1);
rhughes@241: 		if (p2 != NULL && res >= 0)
rhughes@241: 			razor_package_iterator_next(pi2, &p2,
rhughes@241: 						    &name2, &version2, &arch2);
rhughes@241: 	}
rhughes@241: 
rhughes@241: 	razor_package_iterator_destroy(pi1);
rhughes@241: 	razor_package_iterator_destroy(pi2);
rhughes@241: }
krh@254: 
krh@254: static void
krh@254: add_new_package(enum razor_diff_action action,
krh@254: 		struct razor_package *package,
krh@254: 		const char *name,
krh@254: 		const char *version,
krh@254: 		const char *arch,
krh@254: 		void *data)
krh@254: {
krh@254: 	if (action == RAZOR_DIFF_ACTION_ADD)
krh@254: 		razor_package_query_add_package(data, package);
krh@254: }
krh@254: 
krh@254: struct razor_package_iterator *
krh@254: razor_set_create_remove_iterator(struct razor_set *set,
krh@254: 				 struct razor_set *next)
krh@254: {
krh@254: 	struct razor_package_query *query;
krh@254: 	struct razor_package_iterator *pi;
krh@254: 
krh@254: 	query = razor_package_query_create(set);
krh@254: 	razor_set_diff(next, set, add_new_package, query);
krh@254: 
krh@254: 	pi = razor_package_query_finish(query);
krh@254: 
krh@254: 	/* FIXME: We need to figure out the right install order here,
krh@254: 	 * so the post and pre scripts can run. */
krh@254: 
krh@254: 	/* sort */
krh@254: 
krh@254: 	return pi;
krh@254: }
krh@254: 
krh@254: struct razor_package_iterator *
krh@254: razor_set_create_install_iterator(struct razor_set *set,
krh@254: 				  struct razor_set *next)
krh@254: {
krh@254: 	struct razor_package_query *query;
krh@254: 	struct razor_package_iterator *pi;
krh@254: 
krh@254: 	query = razor_package_query_create(next);
krh@254: 	razor_set_diff(set, next, add_new_package, query);
krh@254: 
krh@254: 	pi = razor_package_query_finish(query);
krh@254: 
krh@254: 	/* FIXME: We need to figure out the right install order here,
krh@254: 	 * so the post and pre scripts can run. */
krh@254: 
krh@254: 	/* sort */
krh@254: 
krh@254: 	return pi;
krh@254: }