Mercurialrazor / file revision
summary | shortlog | changelog | graph | tags | branches | files | changeset | file | revisions | annotate | diff | raw
librazor/razor.c
author James Bowes <jbowes@redhat.com>
Mon Jun 23 14:04:47 2008 -0400 (2008-06-23)
changeset 263 23c56c3f0449
parent 259 5b0601d184ed
child 264 634e54ca476c
permissions -rw-r--r--
Display progress when importing rpms 
     1 /*

     2  * Copyright (C) 2008  Kristian Høgsberg <krh@redhat.com>

     3  * Copyright (C) 2008  Red Hat, Inc

     4  *

     5  * This program is free software; you can redistribute it and/or modify

     6  * it under the terms of the GNU General Public License as published by

     7  * the Free Software Foundation; either version 2 of the License, or

     8  * (at your option) any later version.

     9  *

    10  * This program is distributed in the hope that it will be useful,

    11  * but WITHOUT ANY WARRANTY; without even the implied warranty of

    12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

    13  * GNU General Public License for more details.

    14  *

    15  * You should have received a copy of the GNU General Public License along

    16  * with this program; if not, write to the Free Software Foundation, Inc.,

    17  * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.

    18  */

    19 

    20 #define _GNU_SOURCE

    21 

    22 #include <stdlib.h>

    23 #include <stddef.h>

    24 #include <stdint.h>

    25 #include <stdio.h>

    26 #include <string.h>

    27 #include <sys/types.h>

    28 #include <sys/stat.h>

    29 #include <sys/mman.h>

    30 #include <unistd.h>

    31 #include <fcntl.h>

    32 #include <errno.h>

    33 #include <ctype.h>

    34 #include <fnmatch.h>

    35 

    36 #include "razor-internal.h"

    37 #include "razor.h"

    38 

    39 void *

    40 zalloc(size_t size)

    41 {

    42 	void *p;

    43 

    44 	p = malloc(size);

    45 	memset(p, 0, size);

    46 

    47 	return p;

    48 }

    49 

    50 struct razor_set_section razor_sections[] = {

    51 	{ RAZOR_STRING_POOL,	offsetof(struct razor_set, string_pool) },

    52 	{ RAZOR_PACKAGES,	offsetof(struct razor_set, packages) },

    53 	{ RAZOR_PROPERTIES,	offsetof(struct razor_set, properties) },

    54 	{ RAZOR_PACKAGE_POOL,	offsetof(struct razor_set, package_pool) },

    55 	{ RAZOR_PROPERTY_POOL,	offsetof(struct razor_set, property_pool) },

    56 };

    57 

    58 struct razor_set_section razor_files_sections[] = {

    59 	{ RAZOR_FILES,			offsetof(struct razor_set, files) },

    60 	{ RAZOR_FILE_POOL,		offsetof(struct razor_set, file_pool) },

    61 	{ RAZOR_FILE_STRING_POOL,	offsetof(struct razor_set, file_string_pool) },

    62 };

    63 

    64 struct razor_set_section razor_details_sections[] = {

    65 	{ RAZOR_DETAILS_STRING_POOL,	offsetof(struct razor_set, details_string_pool) },

    66 };

    67 

    68 struct razor_set *

    69 razor_set_create(void)

    70 {

    71 	struct razor_set *set;

    72 	struct razor_entry *e;

    73 	char *empty;

    74 

    75 	set = zalloc(sizeof *set);

    76 

    77 	e = array_add(&set->files, sizeof *e);

    78 	empty = array_add(&set->string_pool, 1);

    79 	*empty = '\0';

    80 	e->name = 0;

    81 	e->flags = RAZOR_ENTRY_LAST;

    82 	e->start = 0;

    83 	list_set_empty(&e->packages);

    84 

    85 	return set;

    86 }

    87 

    88 struct razor_set *

    89 razor_set_open(const char *filename)

    90 {

    91 	struct razor_set *set;

    92 	struct razor_set_section *s;

    93 	struct stat stat;

    94 	struct array *array;

    95 	int fd;

    96 

    97 	set = zalloc(sizeof *set);

    98 	fd = open(filename, O_RDONLY);

    99 	if (fstat(fd, &stat) < 0)

   100 		return NULL;

   101 	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);

   102 	if (set->header == MAP_FAILED) {

   103 		free(set);

   104 		return NULL;

   105 	}

   106 

   107 	for (s = set->header->sections; ~s->type; s++) {

   108 		if (s->type >= ARRAY_SIZE(razor_sections))

   109 			continue;

   110 		if (s->type != razor_sections[s->type].type)

   111 			continue;

   112 		array = (void *) set + razor_sections[s->type].offset;

   113 		array->data = (void *) set->header + s->offset;

   114 		array->size = s->size;

   115 		array->alloc = s->size;

   116 	}

   117 	close(fd);

   118 

   119 	return set;

   120 }

   121 

   122 void

   123 razor_set_open_details(struct razor_set *set, const char *filename)

   124 {

   125 	struct razor_set_section *s;

   126 	struct stat stat;

   127 	struct array *array;

   128 	int fd;

   129 

   130 	fd = open(filename, O_RDONLY);

   131 	if (fstat(fd, &stat) < 0)

   132 		return;

   133 	set->details_header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);

   134 	if (set->details_header == MAP_FAILED)

   135 		return;

   136 

   137 	for (s = set->details_header->sections; ~s->type; s++) {

   138 		if (s->type >= ARRAY_SIZE(razor_details_sections))

   139 			continue;

   140 		if (s->type != razor_details_sections[s->type].type)

   141 			continue;

   142 		array = (void *) set + razor_details_sections[s->type].offset;

   143 		array->data = (void *) set->details_header + s->offset;

   144 		array->size = s->size;

   145 		array->alloc = s->size;

   146 	}

   147 	close(fd);

   148 }

   149 

   150 void

   151 razor_set_open_files(struct razor_set *set, const char *filename)

   152 {

   153 	struct razor_set_section *s;

   154 	struct stat stat;

   155 	struct array *array;

   156 	int fd;

   157 

   158 	fd = open(filename, O_RDONLY);

   159 	if (fstat(fd, &stat) < 0)

   160 		return;

   161 	set->files_header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);

   162 	if (set->files_header == MAP_FAILED)

   163 		return;

   164 

   165 	for (s = set->files_header->sections; ~s->type; s++) {

   166 		if (s->type >= ARRAY_SIZE(razor_files_sections))

   167 			continue;

   168 		if (s->type != razor_files_sections[s->type].type)

   169 			continue;

   170 		array = (void *) set + razor_files_sections[s->type].offset;

   171 		array->data = (void *) set->files_header + s->offset;

   172 		array->size = s->size;

   173 		array->alloc = s->size;

   174 	}

   175 	close(fd);

   176 }

   177 

   178 void

   179 razor_set_destroy(struct razor_set *set)

   180 {

   181 	unsigned int size;

   182 	struct array *a;

   183 	int i;

   184 

   185 	if (set->header) {

   186 		for (i = 0; set->header->sections[i].type; i++)

   187 			;

   188 		size = set->header->sections[i].type;

   189 		munmap(set->header, size);

   190 	} else {

   191 		for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {

   192 			a = (void *) set + razor_sections[i].offset;

   193 			free(a->data);

   194 		}

   195 	}

   196 

   197 	if (set->details_header) {

   198 		for (i = 0; set->details_header->sections[i].type; i++)

   199 			;

   200 		size = set->details_header->sections[i].type;

   201 		munmap(set->details_header, size);

   202 	} else {

   203 		for (i = 0; i < ARRAY_SIZE(razor_details_sections); i++) {

   204 			a = (void *) set + razor_details_sections[i].offset;

   205 			free(a->data);

   206 		}

   207 	}

   208 

   209 	if (set->files_header) {

   210 		for (i = 0; set->files_header->sections[i].type; i++)

   211 			;

   212 		size = set->files_header->sections[i].type;

   213 		munmap(set->files_header, size);

   214 	} else {

   215 		for (i = 0; i < ARRAY_SIZE(razor_files_sections); i++) {

   216 			a = (void *) set + razor_files_sections[i].offset;

   217 			free(a->data);

   218 		}

   219 	}

   220 

   221 	free(set);

   222 }

   223 

   224 static int

   225 razor_set_write_sections_to_fd(struct razor_set *set, int fd, int magic,

   226 			       struct razor_set_section *sections,

   227 			       size_t array_size)

   228 {

   229 	char data[4096];

   230 	struct razor_set_header *header = (struct razor_set_header *) data;

   231 	struct array *a;

   232 	uint32_t offset;

   233 	int i;

   234 

   235 	memset(data, 0, sizeof data);

   236 	header->magic = magic;

   237 	header->version = RAZOR_VERSION;

   238 	offset = sizeof data;

   239 

   240 	for (i = 0; i < array_size; i++) {

   241 		if (sections[i].type != i)

   242 			continue;

   243 		a = (void *) set + sections[i].offset;

   244 		header->sections[i].type = i;

   245 		header->sections[i].offset = offset;

   246 		header->sections[i].size = a->size;

   247 		offset += ALIGN(a->size, 4096);

   248 	}

   249 

   250 	header->sections[i].type = ~0;

   251 	header->sections[i].offset = 0;

   252 	header->sections[i].size = 0;

   253 

   254 	razor_write(fd, data, sizeof data);

   255 	memset(data, 0, sizeof data);

   256 	for (i = 0; i < array_size; i++) {

   257 		if (sections[i].type != i)

   258 			continue;

   259 		a = (void *) set + sections[i].offset;

   260 		razor_write(fd, a->data, a->size);

   261 		razor_write(fd, data, ALIGN(a->size, 4096) - a->size);

   262 	}

   263 

   264 	return 0;

   265 }

   266 

   267 int

   268 razor_set_write_to_fd(struct razor_set *set, int fd,

   269 		      enum razor_repo_file_type type)

   270 {

   271 	switch (type) {

   272 	case RAZOR_REPO_FILE_MAIN:

   273 		return razor_set_write_sections_to_fd(set, fd, RAZOR_MAGIC,

   274 						      razor_sections,

   275 						      ARRAY_SIZE(razor_sections));

   276 

   277 	case RAZOR_REPO_FILE_DETAILS:

   278 		return razor_set_write_sections_to_fd(set, fd, RAZOR_DETAILS_MAGIC,

   279 						      razor_details_sections,

   280 						      ARRAY_SIZE(razor_details_sections));

   281 	case RAZOR_REPO_FILE_FILES:

   282 		return razor_set_write_sections_to_fd(set, fd, RAZOR_FILES_MAGIC,

   283 						      razor_files_sections,

   284 						      ARRAY_SIZE(razor_files_sections));

   285 	default:

   286 		return -1;

   287 	}

   288 }

   289 

   290 int

   291 razor_set_write(struct razor_set *set, const char *filename,

   292 		enum razor_repo_file_type type)

   293 {

   294 	int fd, status;

   295 

   296 	fd = open(filename, O_CREAT | O_WRONLY | O_TRUNC, 0666);

   297 	if (fd < 0)

   298 		return -1;

   299 

   300 	status = razor_set_write_to_fd(set, fd, type);

   301 	if (status) {

   302 	    close(fd);

   303 	    return status;

   304 	}

   305 

   306 	return close(fd);

   307 }

   308 void

   309 razor_build_evr(char *evr_buf, int size, const char *epoch,

   310 		const char *version, const char *release)

   311 {

   312 	int len;

   313 

   314 	if (!version || !*version) {

   315 		*evr_buf = '\0';

   316 		return;

   317 	}

   318 

   319 	if (epoch && *epoch && strcmp(epoch, "0") != 0) {

   320 		len = snprintf(evr_buf, size, "%s:", epoch);

   321 		evr_buf += len;

   322 		size -= len;

   323 	}

   324 	len = snprintf(evr_buf, size, "%s", version);

   325 	evr_buf += len;

   326 	size -= len;

   327 	if (release && *release)

   328 		snprintf(evr_buf, size, "-%s", release);

   329 }

   330 

   331 int

   332 razor_versioncmp(const char *s1, const char *s2)

   333 {

   334 	const char *p1, *p2;

   335 	long n1, n2;

   336 	int res;

   337 

   338 	n1 = strtol(s1, (char **) &p1, 10);

   339 	n2 = strtol(s2, (char **) &p2, 10);

   340 

   341 	/* Epoch; if one but not the other has an epoch set, default

   342 	 * the epoch-less version to 0. */

   343 	res = (*p1 == ':') - (*p2 == ':');

   344 	if (res < 0) {

   345 		n1 = 0;

   346 		p1 = s1;

   347 		p2++;

   348 	} else if (res > 0) {

   349 		p1++;

   350 		n2 = 0;

   351 		p2 = s2;

   352 	}

   353 

   354 	if (n1 != n2)

   355 		return n1 - n2;

   356 	while (*p1 && *p2) {

   357 		if (*p1 != *p2)

   358 			return *p1 - *p2;

   359 		p1++;

   360 		p2++;

   361 		if (isdigit(*p1) && isdigit(*p2))

   362 			return razor_versioncmp(p1, p2);

   363 	}

   364 

   365 	return *p1 - *p2;

   366 }

   367 

   368 struct razor_package *

   369 razor_set_get_package(struct razor_set *set, const char *package)

   370 {

   371 	struct razor_package_iterator *pi;

   372 	struct razor_package *p;

   373 	const char *name, *version, *arch;

   374 

   375 	pi = razor_package_iterator_create(set);

   376 	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {

   377 		if (strcmp(package, name) == 0)

   378 			break;

   379 	}

   380 	razor_package_iterator_destroy(pi);

   381 

   382 	return p;

   383 }

   384 

   385 void

   386 razor_package_get_details(struct razor_set *set, struct razor_package *package,

   387 			  const char **summary, const char **description,

   388 			  const char **url, const char **license)

   389 {

   390 	const char *pool = set->details_string_pool.data;

   391 

   392 	*summary = &pool[package->summary];

   393 	*description = &pool[package->description];

   394 	*url = &pool[package->url];

   395 	*license = &pool[package->license];

   396 }

   397 

   398 struct razor_entry *

   399 razor_set_find_entry(struct razor_set *set,

   400 		     struct razor_entry *dir, const char *pattern)

   401 {

   402 	struct razor_entry *e;

   403 	const char *n, *pool = set->string_pool.data;

   404 	int len;

   405 

   406 	e = (struct razor_entry *) set->files.data + dir->start;

   407 	do {

   408 		n = pool + e->name;

   409 		if (strcmp(pattern + 1, n) == 0)

   410 			return e;

   411 		len = strlen(n);

   412 		if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&

   413 		    pattern[len + 1] == '/') {

   414 			return razor_set_find_entry(set, e, pattern + len + 1);

   415 		}

   416 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));

   417 

   418 	return NULL;

   419 }

   420 

   421 static void

   422 list_dir(struct razor_set *set, struct razor_entry *dir,

   423 	 char *prefix, const char *pattern)

   424 {

   425 	struct razor_entry *e;

   426 	const char *n, *pool = set->string_pool.data;

   427 

   428 	e = (struct razor_entry *) set->files.data + dir->start;

   429 	do {

   430 		n = pool + e->name;

   431 		if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)

   432 			continue;

   433 		printf("%s/%s\n", prefix, n);

   434 		if (e->start) {

   435 			char *sub = prefix + strlen (prefix);

   436 			*sub = '/';

   437 			strcpy (sub + 1, n);

   438 			list_dir(set, e, prefix, pattern);

   439 			*sub = '\0';

   440 		}

   441 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));

   442 }

   443 

   444 void

   445 razor_set_list_files(struct razor_set *set, const char *pattern)

   446 {

   447 	struct razor_entry *e;

   448 	char buffer[512], *p, *base;

   449 

   450 	if (pattern == NULL || !strcmp (pattern, "/")) {

   451 		buffer[0] = '\0';

   452 		list_dir(set, set->files.data, buffer, NULL);

   453 		return;

   454 	}

   455 

   456 	strcpy(buffer, pattern);

   457 	e = razor_set_find_entry(set, set->files.data, buffer);

   458 	if (e && e->start > 0) {

   459 		base = NULL;

   460 	} else {

   461 		p = strrchr(buffer, '/');

   462 		if (p) {

   463 			*p = '\0';

   464 			base = p + 1;

   465 		} else {

   466 			base = NULL;

   467 		}

   468 	}

   469 	e = razor_set_find_entry(set, set->files.data, buffer);

   470 	if (e->start != 0)

   471 		list_dir(set, e, buffer, base);

   472 }

   473 

   474 static struct list *

   475 list_package_files(struct razor_set *set, struct list *r,

   476 		   struct razor_entry *dir, uint32_t end,

   477 		   char *prefix)

   478 {

   479 	struct razor_entry *e, *f, *entries;

   480 	uint32_t next, file;

   481 	char *pool;

   482 	int len;

   483 

   484 	entries = (struct razor_entry *) set->files.data;

   485 	pool = set->string_pool.data;

   486 

   487 	e = entries + dir->start;

   488 	do {

   489 		if (entries + r->data == e) {

   490 			printf("%s/%s\n", prefix, pool + e->name);

   491 			r = list_next(r);

   492 			if (!r)

   493 				return NULL;

   494 			if (r->data >= end)

   495 				return r;

   496 		}

   497 	} while (!((e++)->flags & RAZOR_ENTRY_LAST));

   498 

   499 	e = entries + dir->start;

   500 	do {

   501 		if (e->start == 0)

   502 			continue;

   503 

   504 		if (e->flags & RAZOR_ENTRY_LAST)

   505 			next = end;

   506 		else {

   507 			f = e + 1;

   508 			while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))

   509 				f++;

   510 			if (f->start == 0)

   511 				next = end;

   512 			else

   513 				next = f->start;

   514 		}

   515 

   516 		file = r->data;

   517 		if (e->start <= file && file < next) {

   518 			len = strlen(prefix);

   519 			prefix[len] = '/';

   520 			strcpy(prefix + len + 1, pool + e->name);

   521 			r = list_package_files(set, r, e, next, prefix);

   522 			prefix[len] = '\0';

   523 		}

   524 	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);

   525 

   526 	return r;

   527 }

   528 

   529 void

   530 razor_set_list_package_files(struct razor_set *set, const char *name)

   531 {

   532 	struct razor_package *package;

   533 	struct list *r;

   534 	uint32_t end;

   535 	char buffer[512];

   536 

   537 	package = razor_set_get_package(set, name);

   538 

   539 	r = list_first(&package->files, &set->file_pool);

   540 	end = set->files.size / sizeof (struct razor_entry);

   541 	buffer[0] = '\0';

   542 	list_package_files(set, r, set->files.data, end, buffer);

   543 }

   544 

   545 /* The diff order matters.  We should sort the packages so that a

   546  * REMOVE of a package comes before the INSTALL, and so that all

   547  * requires for a package have been installed before the package.

   548  **/

   549 

   550 void

   551 razor_set_diff(struct razor_set *set, struct razor_set *upstream,

   552 	       razor_diff_callback_t callback, void *data)

   553 {

   554  	struct razor_package_iterator *pi1, *pi2;

   555  	struct razor_package *p1, *p2;

   556 	const char *name1, *name2, *version1, *version2, *arch1, *arch2;

   557 	int res;

   558 

   559 	pi1 = razor_package_iterator_create(set);

   560 	pi2 = razor_package_iterator_create(upstream);

   561 

   562 	razor_package_iterator_next(pi1, &p1, &name1, &version1, &arch1);

   563 	razor_package_iterator_next(pi2, &p2, &name2, &version2, &arch2);

   564 

   565 	while (p1 || p2) {

   566 		if (p1 && p2) {

   567 			res = strcmp(name1, name2);

   568 			if (res == 0)

   569 				res = razor_versioncmp(version1, version2);

   570 		} else {

   571 			res = 0;

   572 		}

   573 

   574 		if (p2 == NULL || res < 0)

   575 			callback(RAZOR_DIFF_ACTION_REMOVE,

   576 				 p1, name1, version1, arch1, data);

   577 		else if (p1 == NULL || res > 0)

   578 			callback(RAZOR_DIFF_ACTION_ADD,

   579 				 p2, name2, version2, arch2, data);

   580 

   581 		if (p1 != NULL && res <= 0)

   582 			razor_package_iterator_next(pi1, &p1,

   583 						    &name1, &version1, &arch1);

   584 		if (p2 != NULL && res >= 0)

   585 			razor_package_iterator_next(pi2, &p2,

   586 						    &name2, &version2, &arch2);

   587 	}

   588 

   589 	razor_package_iterator_destroy(pi1);

   590 	razor_package_iterator_destroy(pi2);

   591 }

   592 

   593 static void

   594 add_new_package(enum razor_diff_action action,

   595 		struct razor_package *package,

   596 		const char *name,

   597 		const char *version,

   598 		const char *arch,

   599 		void *data)

   600 {

   601 	if (action == RAZOR_DIFF_ACTION_ADD)

   602 		razor_package_query_add_package(data, package);

   603 }

   604 

   605 struct razor_package_iterator *

   606 razor_set_create_remove_iterator(struct razor_set *set,

   607 				 struct razor_set *next)

   608 {

   609 	struct razor_package_query *query;

   610 	struct razor_package_iterator *pi;

   611 

   612 	query = razor_package_query_create(set);

   613 	razor_set_diff(next, set, add_new_package, query);

   614 

   615 	pi = razor_package_query_finish(query);

   616 

   617 	/* FIXME: We need to figure out the right install order here,

   618 	 * so the post and pre scripts can run. */

   619 

   620 	/* sort */

   621 

   622 	return pi;

   623 }

   624 

   625 struct razor_package_iterator *

   626 razor_set_create_install_iterator(struct razor_set *set,

   627 				  struct razor_set *next)

   628 {

   629 	struct razor_package_query *query;

   630 	struct razor_package_iterator *pi;

   631 

   632 	query = razor_package_query_create(next);

   633 	razor_set_diff(set, next, add_new_package, query);

   634 

   635 	pi = razor_package_query_finish(query);

   636 

   637 	/* FIXME: We need to figure out the right install order here,

   638 	 * so the post and pre scripts can run. */

   639 

   640 	/* sort */

   641 

   642 	return pi;

   643 }
razor