razor: razor.c@6a47b5fc2791 (annotated)

krh@212	1	/*
krh@212	2	* Copyright (C) 2008 Kristian Høgsberg <krh@redhat.com>
krh@212	3	* Copyright (C) 2008 Red Hat, Inc
krh@212	4	*
krh@212	5	* This program is free software; you can redistribute it and/or modify
krh@212	6	* it under the terms of the GNU General Public License as published by
krh@212	7	* the Free Software Foundation; either version 2 of the License, or
krh@212	8	* (at your option) any later version.
krh@212	9	*
krh@212	10	* This program is distributed in the hope that it will be useful,
krh@212	11	* but WITHOUT ANY WARRANTY; without even the implied warranty of
krh@212	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
krh@212	13	* GNU General Public License for more details.
krh@212	14	*
krh@212	15	* You should have received a copy of the GNU General Public License along
krh@212	16	* with this program; if not, write to the Free Software Foundation, Inc.,
krh@212	17	* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
krh@212	18	*/
krh@212	19
krh@15	20	#define _GNU_SOURCE
krh@15	21
krh@0	22	#include <stdlib.h>
krh@19	23	#include <stddef.h>
danw@108	24	#include <stdint.h>
krh@0	25	#include <stdio.h>
krh@0	26	#include <string.h>
krh@0	27	#include <sys/types.h>
krh@0	28	#include <sys/stat.h>
krh@0	29	#include <sys/mman.h>
krh@0	30	#include <unistd.h>
krh@0	31	#include <fcntl.h>
krh@15	32	#include <errno.h>
krh@35	33	#include <ctype.h>
krh@54	34	#include <fnmatch.h>
krh@0	35
krh@27	36	#include "razor.h"
krh@91	37	#include "razor-internal.h"
danw@115	38	#include "types.h"
krh@30	39
krh@30	40	struct razor_set_section {
danw@108	41	uint32_t type;
danw@108	42	uint32_t offset;
danw@108	43	uint32_t size;
krh@30	44	};
krh@30	45
krh@30	46	struct razor_set_header {
danw@108	47	uint32_t magic;
danw@108	48	uint32_t version;
krh@30	49	struct razor_set_section sections[0];
krh@30	50	};
krh@30	51
krh@30	52	#define RAZOR_MAGIC 0x7a7a7a7a
krh@30	53	#define RAZOR_VERSION 1
krh@30	54
krh@66	55	#define RAZOR_STRING_POOL 0
krh@66	56	#define RAZOR_PACKAGES 1
krh@66	57	#define RAZOR_PROPERTIES 2
krh@66	58	#define RAZOR_FILES 3
krh@66	59	#define RAZOR_PACKAGE_POOL 4
krh@66	60	#define RAZOR_PROPERTY_POOL 5
krh@66	61	#define RAZOR_FILE_POOL 6
jbowes@227	62	#define RAZOR_FILE_STRING_POOL 7
krh@30	63
krh@30	64	struct razor_package {
danw@120	65	uint name : 24;
danw@120	66	uint flags : 8;
jbowes@225	67	uint32_t version;
jbowes@225	68	uint32_t arch;
jbowes@224	69	uint32_t summary;
jbowes@224	70	uint32_t description;
jbowes@225	71	uint32_t url;
jbowes@225	72	uint32_t license;
danw@117	73	struct list_head properties;
danw@117	74	struct list_head files;
krh@30	75	};
krh@30	76
krh@30	77	struct razor_property {
danw@119	78	uint name : 24;
danw@119	79	uint flags : 6;
danw@162	80	enum razor_property_type type : 2;
danw@162	81	enum razor_version_relation relation : 32;
danw@108	82	uint32_t version;
danw@117	83	struct list_head packages;
krh@30	84	};
krh@30	85
krh@48	86	struct razor_entry {
danw@120	87	uint name : 24;
danw@120	88	uint flags : 8;
danw@108	89	uint32_t start;
danw@117	90	struct list_head packages;
krh@48	91	};
krh@48	92
danw@120	93	#define RAZOR_ENTRY_LAST 0x80
danw@120	94
krh@30	95	struct razor_set {
krh@30	96	struct array string_pool;
krh@30	97	struct array packages;
krh@66	98	struct array properties;
krh@56	99	struct array files;
krh@56	100	struct array package_pool;
krh@66	101	struct array property_pool;
krh@56	102	struct array file_pool;
jbowes@227	103	struct array file_string_pool;
krh@30	104	struct razor_set_header *header;
krh@30	105	};
krh@30	106
krh@52	107	struct import_entry {
danw@108	108	uint32_t package;
krh@52	109	char *name;
krh@52	110	};
krh@52	111
krh@52	112	struct import_directory {
danw@108	113	uint32_t name, count;
krh@52	114	struct array files;
krh@52	115	struct array packages;
krh@52	116	struct import_directory *last;
krh@52	117	};
krh@52	118
krh@30	119	struct razor_importer {
krh@30	120	struct razor_set *set;
krh@78	121	struct hashtable table;
jbowes@227	122	struct hashtable file_table;
krh@30	123	struct razor_package *package;
krh@66	124	struct array properties;
krh@48	125	struct array files;
danw@159	126	struct array file_requires;
krh@30	127	};
krh@30	128
krh@0	129	static void *
krh@0	130	zalloc(size_t size)
krh@0	131	{
krh@0	132	void *p;
krh@0	133
krh@0	134	p = malloc(size);
krh@0	135	memset(p, 0, size);
krh@0	136
krh@0	137	return p;
krh@0	138	}
krh@0	139
krh@19	140	struct razor_set_section razor_sections[] = {
jbowes@227	141	{ RAZOR_STRING_POOL, offsetof(struct razor_set, string_pool) },
jbowes@227	142	{ RAZOR_PACKAGES, offsetof(struct razor_set, packages) },
jbowes@227	143	{ RAZOR_PROPERTIES, offsetof(struct razor_set, properties) },
jbowes@227	144	{ RAZOR_FILES, offsetof(struct razor_set, files) },
jbowes@227	145	{ RAZOR_PACKAGE_POOL, offsetof(struct razor_set, package_pool) },
jbowes@227	146	{ RAZOR_PROPERTY_POOL, offsetof(struct razor_set, property_pool) },
jbowes@227	147	{ RAZOR_FILE_POOL, offsetof(struct razor_set, file_pool) },
jbowes@227	148	{ RAZOR_FILE_STRING_POOL, offsetof(struct razor_set, file_string_pool) },
krh@19	149	};
krh@19	150
krh@4	151	struct razor_set *
krh@4	152	razor_set_create(void)
krh@0	153	{
krh@150	154	struct razor_set *set;
krh@150	155	struct razor_entry *e;
danw@167	156	char *empty;
krh@150	157
krh@150	158	set = zalloc(sizeof *set);
krh@150	159
krh@150	160	e = array_add(&set->files, sizeof *e);
danw@167	161	empty = array_add(&set->string_pool, 1);
danw@167	162	*empty = '\0';
jbowes@227	163	empty = array_add(&set->file_string_pool, 1);
jbowes@227	164	*empty = '\0';
krh@150	165	e->name = 0;
krh@150	166	e->flags = RAZOR_ENTRY_LAST;
krh@150	167	e->start = 0;
krh@150	168	list_set_empty(&e->packages);
krh@150	169
krh@150	170	return set;
krh@0	171	}
krh@0	172
krh@4	173	struct razor_set *
krh@4	174	razor_set_open(const char *filename)
krh@0	175	{
krh@4	176	struct razor_set *set;
krh@19	177	struct razor_set_section *s;
krh@0	178	struct stat stat;
krh@19	179	struct array *array;
krh@19	180	int fd;
krh@0	181
krh@4	182	set = zalloc(sizeof *set);
krh@0	183	fd = open(filename, O_RDONLY);
krh@0	184	if (fstat(fd, &stat) < 0)
krh@0	185	return NULL;
krh@4	186	set->header = mmap(NULL, stat.st_size, PROT_READ, MAP_PRIVATE, fd, 0);
krh@4	187	if (set->header == MAP_FAILED) {
krh@4	188	free(set);
krh@0	189	return NULL;
krh@0	190	}
krh@0	191
krh@19	192	for (s = set->header->sections; ~s->type; s++) {
krh@19	193	if (s->type >= ARRAY_SIZE(razor_sections))
krh@19	194	continue;
krh@19	195	if (s->type != razor_sections[s->type].type)
krh@19	196	continue;
krh@19	197	array = (void *) set + razor_sections[s->type].offset;
krh@19	198	array->data = (void *) set->header + s->offset;
krh@19	199	array->size = s->size;
krh@19	200	array->alloc = s->size;
krh@0	201	}
krh@0	202	close(fd);
krh@0	203
krh@4	204	return set;
krh@0	205	}
krh@0	206
krh@0	207	void
krh@4	208	razor_set_destroy(struct razor_set *set)
krh@0	209	{
krh@0	210	unsigned int size;
krh@19	211	struct array *a;
krh@0	212	int i;
krh@0	213
krh@4	214	if (set->header) {
krh@4	215	for (i = 0; set->header->sections[i].type; i++)
krh@0	216	;
krh@4	217	size = set->header->sections[i].type;
krh@4	218	munmap(set->header, size);
krh@0	219	} else {
krh@19	220	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	221	a = (void *) set + razor_sections[i].offset;
krh@19	222	free(a->data);
krh@19	223	}
krh@0	224	}
krh@0	225
krh@4	226	free(set);
krh@0	227	}
krh@0	228
krh@43	229	int
krh@197	230	razor_set_write_to_fd(struct razor_set *set, int fd)
krh@0	231	{
krh@0	232	char data[4096];
krh@4	233	struct razor_set_header header = (struct razor_set_header ) data;
krh@19	234	struct array *a;
danw@108	235	uint32_t offset;
krh@197	236	int i;
krh@0	237
krh@0	238	memset(data, 0, sizeof data);
krh@4	239	header->magic = RAZOR_MAGIC;
krh@4	240	header->version = RAZOR_VERSION;
krh@17	241	offset = sizeof data;
krh@0	242
krh@19	243	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	244	if (razor_sections[i].type != i)
krh@19	245	continue;
krh@19	246	a = (void *) set + razor_sections[i].offset;
krh@19	247	header->sections[i].type = i;
krh@17	248	header->sections[i].offset = offset;
krh@19	249	header->sections[i].size = a->size;
krh@91	250	offset += ALIGN(a->size, 4096);
krh@17	251	}
krh@0	252
krh@19	253	header->sections[i].type = ~0;
krh@17	254	header->sections[i].offset = 0;
krh@17	255	header->sections[i].size = 0;
krh@10	256
krh@91	257	razor_write(fd, data, sizeof data);
danw@113	258	memset(data, 0, sizeof data);
krh@19	259	for (i = 0; i < ARRAY_SIZE(razor_sections); i++) {
krh@19	260	if (razor_sections[i].type != i)
krh@19	261	continue;
krh@19	262	a = (void *) set + razor_sections[i].offset;
danw@113	263	razor_write(fd, a->data, a->size);
danw@113	264	razor_write(fd, data, ALIGN(a->size, 4096) - a->size);
krh@19	265	}
krh@17	266
krh@0	267	return 0;
krh@0	268	}
krh@0	269
krh@197	270	int
krh@197	271	razor_set_write(struct razor_set set, const char filename)
krh@197	272	{
krh@197	273	int fd, status;
krh@197	274
krh@197	275	fd = open(filename, O_CREAT \| O_WRONLY \| O_TRUNC, 0666);
krh@197	276	if (fd < 0)
krh@197	277	return -1;
krh@197	278
krh@197	279	status = razor_set_write_to_fd(set, fd);
krh@197	280	if (status) {
krh@197	281	close(fd);
krh@197	282	return status;
krh@197	283	}
krh@197	284
krh@197	285	return close(fd);
krh@197	286	}
krh@197	287
krh@27	288	void
danw@143	289	razor_build_evr(char evr_buf, int size, const char epoch,
danw@143	290	const char version, const char release)
danw@143	291	{
danw@143	292	int len;
danw@143	293
danw@143	294	if (!version \|\| !*version) {
danw@143	295	*evr_buf = '\0';
danw@143	296	return;
danw@143	297	}
danw@143	298
danw@143	299	if (epoch && *epoch && strcmp(epoch, "0") != 0) {
danw@143	300	len = snprintf(evr_buf, size, "%s:", epoch);
danw@143	301	evr_buf += len;
danw@143	302	size -= len;
danw@143	303	}
danw@143	304	len = snprintf(evr_buf, size, "%s", version);
danw@143	305	evr_buf += len;
danw@143	306	size -= len;
danw@143	307	if (release && *release)
danw@143	308	snprintf(evr_buf, size, "-%s", release);
danw@143	309	}
danw@143	310
danw@143	311	void
krh@30	312	razor_importer_begin_package(struct razor_importer *importer,
krh@192	313	const char *name,
krh@192	314	const char *version,
krh@192	315	const char *arch)
krh@13	316	{
krh@25	317	struct razor_package *p;
krh@13	318
krh@30	319	p = array_add(&importer->set->packages, sizeof *p);
krh@95	320	p->name = hashtable_tokenize(&importer->table, name);
danw@120	321	p->flags = 0;
krh@95	322	p->version = hashtable_tokenize(&importer->table, version);
krh@192	323	p->arch = hashtable_tokenize(&importer->table, arch);
krh@13	324
krh@30	325	importer->package = p;
krh@66	326	array_init(&importer->properties);
krh@13	327	}
krh@13	328
krh@13	329	void
krh@30	330	razor_importer_finish_package(struct razor_importer *importer)
krh@13	331	{
danw@117	332	list_set_array(&importer->package->properties,
danw@117	333	&importer->set->property_pool,
danw@124	334	&importer->properties,
danw@124	335	1);
krh@13	336
krh@66	337	array_release(&importer->properties);
krh@13	338	}
krh@13	339
krh@66	340	void
jbowes@224	341	razor_importer_add_details(struct razor_importer *importer,
jbowes@224	342	const char *summary,
jbowes@225	343	const char *description,
jbowes@225	344	const char *url,
jbowes@225	345	const char *license)
jbowes@224	346	{
jbowes@224	347	importer->package->summary = hashtable_tokenize(&importer->table, summary);
jbowes@224	348	importer->package->description = hashtable_tokenize(&importer->table, description);
jbowes@225	349	importer->package->url = hashtable_tokenize(&importer->table, url);
jbowes@225	350	importer->package->license = hashtable_tokenize(&importer->table, license);
jbowes@225	351
jbowes@224	352	}
jbowes@224	353
jbowes@224	354	void
krh@30	355	razor_importer_add_property(struct razor_importer *importer,
danw@109	356	const char *name,
danw@109	357	enum razor_version_relation relation,
danw@109	358	const char *version,
krh@66	359	enum razor_property_type type)
krh@13	360	{
krh@25	361	struct razor_property *p;
danw@108	362	uint32_t *r;
krh@13	363
krh@66	364	p = array_add(&importer->set->properties, sizeof *p);
danw@119	365	p->name = hashtable_tokenize(&importer->table, name);
danw@119	366	p->flags = 0;
danw@119	367	p->type = type;
danw@109	368	p->relation = relation;
krh@95	369	p->version = hashtable_tokenize(&importer->table, version);
danw@117	370	list_set_ptr(&p->packages, importer->package -
danw@117	371	(struct razor_package *) importer->set->packages.data);
krh@13	372
krh@66	373	r = array_add(&importer->properties, sizeof *r);
krh@66	374	r = p - (struct razor_property ) importer->set->properties.data;
danw@159	375
danw@159	376	if (type == RAZOR_PROPERTY_REQUIRES && *name == '/') {
danw@159	377	r = array_add(&importer->file_requires, sizeof *r);
danw@159	378	*r = p->name;
danw@159	379	}
krh@30	380	}
krh@30	381
krh@46	382	void
krh@46	383	razor_importer_add_file(struct razor_importer importer, const char name)
krh@46	384	{
krh@52	385	struct import_entry *e;
krh@48	386
krh@52	387	e = array_add(&importer->files, sizeof *e);
krh@52	388
krh@52	389	e->package = importer->package -
krh@52	390	(struct razor_package *) importer->set->packages.data;
krh@52	391	e->name = strdup(name);
krh@46	392	}
krh@46	393
krh@30	394	struct razor_importer *
krh@30	395	razor_importer_new(void)
krh@30	396	{
krh@30	397	struct razor_importer *importer;
krh@30	398
krh@30	399	importer = zalloc(sizeof *importer);
krh@30	400	importer->set = razor_set_create();
krh@78	401	hashtable_init(&importer->table, &importer->set->string_pool);
jbowes@227	402	hashtable_init(&importer->file_table, &importer->set->file_string_pool);
krh@30	403
krh@30	404	return importer;
krh@9	405	}
krh@9	406
krh@75	407	/* Destroy an importer without creating the set. */
krh@75	408	void
krh@75	409	razor_importer_destroy(struct razor_importer *importer)
krh@75	410	{
krh@75	411	/* FIXME: write this */
krh@75	412	}
krh@75	413
krh@9	414	static int
krh@35	415	versioncmp(const char s1, const char s2)
krh@35	416	{
krh@35	417	const char p1, p2;
krh@35	418	long n1, n2;
krh@35	419	int res;
krh@35	420
danw@153	421	n1 = strtol(s1, (char **) &p1, 10);
danw@153	422	n2 = strtol(s2, (char **) &p2, 10);
krh@35	423
krh@35	424	/* Epoch; if one but not the other has an epoch set, default
krh@35	425	* the epoch-less version to 0. */
krh@35	426	res = (p1 == ':') - (p2 == ':');
krh@35	427	if (res < 0) {
krh@35	428	n1 = 0;
krh@35	429	p1 = s1;
krh@35	430	p2++;
krh@35	431	} else if (res > 0) {
krh@35	432	p1++;
krh@35	433	n2 = 0;
krh@35	434	p2 = s2;
krh@35	435	}
krh@35	436
krh@35	437	if (n1 != n2)
krh@35	438	return n1 - n2;
krh@35	439	while (p1 && p2) {
krh@35	440	if (p1 != p2)
krh@35	441	return p1 - p2;
krh@35	442	p1++;
krh@35	443	p2++;
krh@35	444	if (isdigit(p1) && isdigit(p2))
krh@35	445	return versioncmp(p1, p2);
krh@35	446	}
krh@35	447
krh@35	448	return p1 - p2;
krh@35	449	}
krh@35	450
krh@35	451	static int
krh@22	452	compare_packages(const void p1, const void p2, void *data)
krh@9	453	{
krh@25	454	const struct razor_package pkg1 = p1, pkg2 = p2;
krh@22	455	struct razor_set *set = data;
krh@22	456	char *pool = set->string_pool.data;
krh@9	457
danw@120	458	/* FIXME: what if the flags are different? */
krh@23	459	if (pkg1->name == pkg2->name)
krh@35	460	return versioncmp(&pool[pkg1->version], &pool[pkg2->version]);
krh@23	461	else
krh@23	462	return strcmp(&pool[pkg1->name], &pool[pkg2->name]);
krh@9	463	}
krh@9	464
krh@9	465	static int
krh@22	466	compare_properties(const void p1, const void p2, void *data)
krh@9	467	{
krh@25	468	const struct razor_property prop1 = p1, prop2 = p2;
krh@22	469	struct razor_set *set = data;
krh@22	470	char *pool = set->string_pool.data;
krh@9	471
danw@119	472	if (prop1->name != prop2->name)
danw@119	473	return strcmp(&pool[prop1->name], &pool[prop2->name]);
danw@119	474	else if (prop1->type != prop2->type)
danw@119	475	return prop1->type - prop2->type;
danw@119	476	else if (prop1->relation != prop2->relation)
danw@119	477	return prop1->relation - prop2->relation;
krh@12	478	else
danw@119	479	return versioncmp(&pool[prop1->version], &pool[prop2->version]);
krh@9	480	}
krh@9	481
danw@108	482	static uint32_t *
krh@66	483	uniqueify_properties(struct razor_set *set)
krh@9	484	{
krh@25	485	struct razor_property rp, up, *rp_end;
krh@18	486	struct array pkgs, p;
danw@117	487	struct list_head *r;
danw@117	488	uint32_t map, rmap;
krh@18	489	int i, count, unique;
krh@9	490
krh@66	491	count = set->properties.size / sizeof(struct razor_property);
krh@186	492	map = razor_qsort_with_data(set->properties.data,
krh@186	493	count,
krh@186	494	sizeof(struct razor_property),
krh@186	495	compare_properties,
krh@186	496	set);
krh@9	497
krh@66	498	rp_end = set->properties.data + set->properties.size;
krh@25	499	rmap = malloc(count * sizeof *map);
krh@25	500	pkgs = zalloc(count * sizeof *pkgs);
krh@66	501	for (rp = set->properties.data, up = rp, i = 0; rp < rp_end; rp++, i++) {
danw@119	502	if (rp->name != up->name \|\| rp->type != up->type \|\|
danw@119	503	rp->relation != up->relation \|\| rp->version != up->version) {
krh@25	504	up++;
krh@25	505	up->name = rp->name;
danw@119	506	up->flags = 0;
danw@119	507	up->type = rp->type;
danw@109	508	up->relation = rp->relation;
krh@25	509	up->version = rp->version;
krh@10	510	}
krh@25	511
krh@66	512	unique = up - (struct razor_property *) set->properties.data;
krh@25	513	rmap[map[i]] = unique;
krh@25	514	r = array_add(&pkgs[unique], sizeof *r);
krh@25	515	*r = rp->packages;
krh@10	516	}
krh@25	517	free(map);
krh@9	518
danw@124	519	if (up != rp)
danw@124	520	up++;
krh@66	521	set->properties.size = (void *) up - set->properties.data;
krh@25	522	rp_end = up;
krh@66	523	for (rp = set->properties.data, p = pkgs; rp < rp_end; rp++, p++) {
danw@124	524	list_set_array(&rp->packages, &set->package_pool, p, 0);
krh@25	525	array_release(p);
krh@18	526	}
krh@18	527
krh@18	528	free(pkgs);
krh@18	529
krh@25	530	return rmap;
krh@10	531	}
krh@10	532
krh@48	533	static int
krh@48	534	compare_filenames(const void p1, const void p2, void *data)
krh@48	535	{
krh@52	536	const struct import_entry *e1 = p1;
krh@52	537	const struct import_entry *e2 = p2;
danw@126	538	const char *n1 = e1->name;
danw@126	539	const char *n2 = e2->name;
krh@48	540
danw@126	541	/* Need to make sure that the contents of a directory
danw@126	542	* are sorted immediately after it. So "foo/bar" has to
danw@126	543	* sort before "foo.conf"
danw@126	544	*
danw@126	545	* FIXME: this is about 60% slower than strcmp
danw@126	546	*/
danw@126	547	while (n1 && n2) {
danw@126	548	if (n1 < n2)
danw@126	549	return *n2 == '/' ? 1 : -1;
danw@126	550	else if (n1 > n2)
danw@126	551	return *n1 == '/' ? -1 : 1;
danw@126	552	n1++;
danw@126	553	n2++;
danw@126	554	}
danw@126	555	if (*n1)
danw@126	556	return 1;
danw@126	557	else if (*n2)
danw@126	558	return -1;
danw@126	559	else
danw@126	560	return 0;
krh@48	561	}
krh@48	562
krh@48	563	static void
krh@52	564	count_entries(struct import_directory *d)
krh@48	565	{
krh@52	566	struct import_directory p, end;
krh@48	567
krh@48	568	p = d->files.data;
krh@48	569	end = d->files.data + d->files.size;
krh@48	570	d->count = 0;
krh@48	571	while (p < end) {
krh@48	572	count_entries(p);
krh@48	573	d->count += p->count + 1;
krh@48	574	p++;
krh@48	575	}
krh@48	576	}
krh@48	577
krh@48	578	static void
krh@52	579	serialize_files(struct razor_set *set,
krh@52	580	struct import_directory d, struct array array)
krh@48	581	{
krh@52	582	struct import_directory p, end;
krh@56	583	struct razor_entry *e = NULL;
danw@114	584	uint32_t s;
krh@48	585
krh@48	586	p = d->files.data;
krh@48	587	end = d->files.data + d->files.size;
krh@48	588	s = array->size / sizeof e + d->files.size / sizeof p;
krh@48	589	while (p < end) {
krh@48	590	e = array_add(array, sizeof *e);
krh@48	591	e->name = p->name;
danw@120	592	e->flags = 0;
krh@56	593	e->start = p->count > 0 ? s : 0;
krh@48	594	s += p->count;
krh@60	595
danw@124	596	list_set_array(&e->packages, &set->package_pool, &p->packages, 0);
krh@52	597	array_release(&p->packages);
krh@48	598	p++;
krh@48	599	}
krh@56	600	if (e != NULL)
danw@120	601	e->flags \|= RAZOR_ENTRY_LAST;
krh@48	602
krh@48	603	p = d->files.data;
krh@48	604	end = d->files.data + d->files.size;
krh@48	605	while (p < end) {
krh@52	606	serialize_files(set, p, array);
krh@48	607	p++;
krh@48	608	}
krh@48	609	}
krh@48	610
krh@48	611	static void
danw@108	612	remap_property_package_links(struct array properties, uint32_t rmap)
krh@61	613	{
krh@61	614	struct razor_property p, end;
krh@61	615
krh@61	616	end = properties->data + properties->size;
krh@61	617	for (p = properties->data; p < end; p++)
danw@117	618	list_remap_head(&p->packages, rmap);
krh@61	619	}
krh@61	620
krh@61	621	static void
krh@48	622	build_file_tree(struct razor_importer *importer)
krh@48	623	{
krh@48	624	int count, i, length;
krh@52	625	struct import_entry *filenames;
krh@52	626	char f, end;
danw@108	627	uint32_t name, *r;
krh@48	628	char dirname[256];
krh@52	629	struct import_directory *d, root;
krh@48	630	struct razor_entry *e;
krh@48	631
krh@52	632	count = importer->files.size / sizeof (struct import_entry);
krh@186	633	razor_qsort_with_data(importer->files.data,
krh@186	634	count,
krh@186	635	sizeof (struct import_entry),
krh@186	636	compare_filenames,
krh@186	637	NULL);
krh@48	638
jbowes@227	639	root.name = hashtable_tokenize(&importer->file_table, "");
krh@48	640	array_init(&root.files);
krh@52	641	array_init(&root.packages);
krh@48	642	root.last = NULL;
krh@48	643
krh@48	644	filenames = importer->files.data;
krh@48	645	for (i = 0; i < count; i++) {
krh@52	646	f = filenames[i].name;
krh@48	647	if (*f != '/')
krh@48	648	continue;
krh@57	649	f++;
krh@48	650
krh@48	651	d = &root;
krh@48	652	while (*f) {
krh@57	653	end = strchr(f, '/');
krh@48	654	if (end == NULL)
krh@48	655	end = f + strlen(f);
krh@57	656	length = end - f;
krh@57	657	memcpy(dirname, f, length);
krh@48	658	dirname[length] ='\0';
jbowes@227	659	name = hashtable_tokenize(&importer->file_table, dirname);
krh@48	660	if (d->last == NULL \|\| d->last->name != name) {
krh@48	661	d->last = array_add(&d->files, sizeof *d);
krh@48	662	d->last->name = name;
krh@48	663	d->last->last = NULL;
krh@48	664	array_init(&d->last->files);
krh@52	665	array_init(&d->last->packages);
krh@48	666	}
krh@48	667	d = d->last;
krh@57	668	f = end + 1;
krh@57	669	if (*end == '\0')
krh@57	670	break;
krh@48	671	}
krh@48	672
krh@52	673	r = array_add(&d->packages, sizeof *r);
krh@52	674	*r = filenames[i].package;
krh@52	675	free(filenames[i].name);
krh@48	676	}
krh@48	677
krh@48	678	count_entries(&root);
krh@150	679	e = importer->set->files.data;
danw@120	680	e->name = root.name;
danw@120	681	e->flags = RAZOR_ENTRY_LAST;
danw@129	682	e->start = importer->files.size ? 1 : 0;
danw@117	683	list_set_empty(&e->packages);
krh@48	684
krh@56	685	serialize_files(importer->set, &root, &importer->set->files);
krh@48	686
krh@48	687	array_release(&importer->files);
krh@48	688	}
krh@48	689
danw@159	690	static struct razor_entry *
danw@159	691	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern);
danw@159	692
danw@159	693	static void
danw@159	694	list_to_array(struct list list, struct array array)
danw@159	695	{
danw@159	696	uint32_t *item;
danw@159	697
danw@159	698	while (list) {
danw@159	699	item = array_add(array, sizeof *item);
danw@159	700	*item = list->data;
danw@159	701	list = list_next(list);
danw@159	702	}
danw@159	703	}
danw@159	704
danw@159	705	static int
danw@159	706	compare_file_requires(const void p1, const void p2, void *data)
danw@159	707	{
danw@159	708	uint32_t f1 = (void )p1, f2 = (void )p2;
danw@159	709	const char *pool = data;
danw@159	710
danw@159	711	return strcmp(&pool[f1], &pool[f2]);
danw@159	712	}
danw@159	713
danw@159	714	static void
danw@159	715	find_file_provides(struct razor_importer *importer)
danw@159	716	{
danw@159	717	struct razor_property *prop;
danw@159	718	struct razor_entry top, entry;
danw@159	719	struct razor_package *packages;
danw@163	720	struct array pkgprops;
danw@163	721	struct list *pkg;
danw@163	722	uint32_t req, req_start, *req_end;
danw@163	723	uint32_t map, newprop;
danw@159	724	char *pool;
danw@159	725
danw@159	726	pool = importer->set->string_pool.data;
danw@159	727	packages = importer->set->packages.data;
danw@159	728	top = importer->set->files.data;
danw@159	729
danw@159	730	req = req_start = importer->file_requires.data;
danw@159	731	req_end = importer->file_requires.data + importer->file_requires.size;
krh@186	732	map = razor_qsort_with_data(req, req_end - req, sizeof *req,
krh@186	733	compare_file_requires, pool);
danw@159	734	free(map);
danw@159	735
danw@159	736	for (req = req_start; req < req_end; req++) {
danw@159	737	if (req > req_start && req[0] == req[-1])
danw@159	738	continue;
danw@159	739	entry = find_entry(importer->set, top, &pool[*req]);
danw@163	740	if (!entry)
danw@163	741	continue;
danw@163	742
danw@163	743	for (pkg = list_first(&entry->packages, &importer->set->package_pool); pkg; pkg = list_next(pkg)) {
danw@159	744	prop = array_add(&importer->set->properties, sizeof *prop);
danw@159	745	prop->name = *req;
danw@159	746	prop->type = RAZOR_PROPERTY_PROVIDES;
danw@159	747	prop->relation = RAZOR_VERSION_EQUAL;
danw@159	748	prop->version = hashtable_tokenize(&importer->table, "");
danw@163	749	list_set_ptr(&prop->packages, pkg->data);
danw@163	750
danw@163	751	/* Update property list of pkg */
danw@163	752	array_init(&pkgprops);
danw@163	753	list_to_array(list_first(&packages[pkg->data].properties, &importer->set->property_pool), &pkgprops);
danw@163	754	newprop = array_add(&pkgprops, sizeof *newprop);
danw@163	755	newprop = prop - (struct razor_property )importer->set->properties.data;
danw@163	756	list_set_array(&packages[pkg->data].properties, &importer->set->property_pool, &pkgprops, 1);
danw@163	757	array_release(&pkgprops);
danw@159	758	}
danw@159	759	}
danw@159	760
danw@159	761	array_release(&importer->file_requires);
danw@159	762	}
danw@159	763
krh@56	764	static void
danw@108	765	build_package_file_lists(struct razor_set set, uint32_t rmap)
krh@54	766	{
krh@56	767	struct razor_package p, packages;
krh@56	768	struct array *pkgs;
krh@54	769	struct razor_entry e, end;
danw@117	770	struct list *r;
danw@117	771	uint32_t *q;
krh@56	772	int i, count;
krh@54	773
krh@56	774	count = set->packages.size / sizeof *p;
krh@56	775	pkgs = zalloc(count * sizeof *pkgs);
krh@54	776
krh@56	777	end = set->files.data + set->files.size;
krh@92	778	for (e = set->files.data; e < end; e++) {
danw@117	779	list_remap_head(&e->packages, rmap);
danw@116	780	r = list_first(&e->packages, &set->package_pool);
danw@116	781	while (r) {
danw@117	782	q = array_add(&pkgs[r->data], sizeof *q);
krh@56	783	q = e - (struct razor_entry ) set->files.data;
danw@116	784	r = list_next(r);
krh@54	785	}
krh@54	786	}
krh@54	787
krh@56	788	packages = set->packages.data;
krh@56	789	for (i = 0; i < count; i++) {
danw@124	790	list_set_array(&packages[i].files, &set->file_pool, &pkgs[i], 0);
krh@56	791	array_release(&pkgs[i]);
krh@48	792	}
krh@56	793	free(pkgs);
krh@52	794	}
krh@52	795
krh@27	796	struct razor_set *
krh@30	797	razor_importer_finish(struct razor_importer *importer)
krh@9	798	{
krh@30	799	struct razor_set *set;
danw@108	800	uint32_t map, rmap;
krh@39	801	int i, count;
krh@18	802
danw@159	803	build_file_tree(importer);
danw@159	804	find_file_provides(importer);
danw@159	805
krh@66	806	map = uniqueify_properties(importer->set);
danw@116	807	list_remap_pool(&importer->set->property_pool, map);
krh@39	808	free(map);
krh@25	809
krh@30	810	count = importer->set->packages.size / sizeof(struct razor_package);
krh@186	811	map = razor_qsort_with_data(importer->set->packages.data,
krh@186	812	count,
krh@186	813	sizeof(struct razor_package),
krh@186	814	compare_packages,
krh@186	815	importer->set);
krh@39	816
krh@39	817	rmap = malloc(count * sizeof *rmap);
krh@39	818	for (i = 0; i < count; i++)
krh@39	819	rmap[map[i]] = i;
krh@25	820	free(map);
krh@13	821
danw@116	822	list_remap_pool(&importer->set->package_pool, rmap);
krh@60	823	build_package_file_lists(importer->set, rmap);
krh@66	824	remap_property_package_links(&importer->set->properties, rmap);
krh@52	825	free(rmap);
krh@48	826
krh@30	827	set = importer->set;
krh@78	828	hashtable_release(&importer->table);
jbowes@227	829	hashtable_release(&importer->file_table);
krh@30	830	free(importer);
krh@30	831
krh@30	832	return set;
krh@9	833	}
krh@9	834
krh@92	835	struct razor_package_iterator {
krh@92	836	struct razor_set *set;
krh@92	837	struct razor_package package, end;
danw@117	838	struct list *index;
krh@216	839	int free_index;
krh@92	840	};
krh@92	841
danw@137	842	static struct razor_package_iterator *
krh@101	843	razor_package_iterator_create_with_index(struct razor_set *set,
danw@117	844	struct list *index)
krh@3	845	{
krh@92	846	struct razor_package_iterator *pi;
krh@92	847
krh@92	848	pi = zalloc(sizeof *pi);
krh@92	849	pi->set = set;
krh@101	850	pi->index = index;
krh@92	851
krh@92	852	return pi;
krh@92	853	}
krh@92	854
krh@101	855	struct razor_package_iterator *
krh@101	856	razor_package_iterator_create(struct razor_set *set)
krh@101	857	{
danw@116	858	struct razor_package_iterator *pi;
danw@116	859
danw@116	860	pi = zalloc(sizeof *pi);
danw@116	861	pi->set = set;
danw@116	862	pi->end = set->packages.data + set->packages.size;
danw@116	863	pi->package = set->packages.data;
danw@116	864
danw@116	865	return pi;
krh@101	866	}
krh@101	867
krh@101	868	struct razor_package_iterator *
krh@101	869	razor_package_iterator_create_for_property(struct razor_set *set,
krh@101	870	struct razor_property *property)
krh@101	871	{
danw@117	872	struct list *index;
krh@101	873
danw@116	874	index = list_first(&property->packages, &set->package_pool);
krh@101	875	return razor_package_iterator_create_with_index(set, index);
krh@101	876	}
krh@101	877
krh@92	878	int
krh@92	879	razor_package_iterator_next(struct razor_package_iterator *pi,
krh@92	880	struct razor_package **package,
krh@192	881	const char **name,
krh@192	882	const char **version,
krh@192	883	const char **arch)
krh@92	884	{
krh@6	885	char *pool;
krh@101	886	int valid;
krh@101	887	struct razor_package p, packages;
krh@3	888
danw@116	889	if (pi->package) {
krh@101	890	p = pi->package++;
krh@101	891	valid = p < pi->end;
danw@116	892	} else if (pi->index) {
danw@116	893	packages = pi->set->packages.data;
danw@117	894	p = &packages[pi->index->data];
danw@116	895	pi->index = list_next(pi->index);
danw@116	896	valid = 1;
danw@116	897	} else
danw@116	898	valid = 0;
krh@92	899
krh@101	900	if (valid) {
krh@101	901	pool = pi->set->string_pool.data;
krh@101	902	*package = p;
danw@120	903	*name = &pool[p->name];
krh@101	904	*version = &pool[p->version];
krh@192	905	*arch = &pool[p->arch];
krh@101	906	} else {
krh@101	907	*package = NULL;
krh@101	908	}
krh@101	909
krh@101	910	return valid;
krh@92	911	}
krh@92	912
krh@92	913	void
krh@92	914	razor_package_iterator_destroy(struct razor_package_iterator *pi)
krh@92	915	{
krh@216	916	if (pi->free_index)
krh@216	917	free(pi->index);
krh@216	918
krh@92	919	free(pi);
krh@3	920	}
krh@3	921
krh@10	922	struct razor_package *
krh@10	923	razor_set_get_package(struct razor_set set, const char package)
krh@10	924	{
krh@97	925	struct razor_package_iterator *pi;
krh@97	926	struct razor_package *p;
krh@192	927	const char name, version, *arch;
krh@97	928
krh@97	929	pi = razor_package_iterator_create(set);
krh@192	930	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {
krh@97	931	if (strcmp(package, name) == 0)
krh@97	932	break;
krh@97	933	}
krh@97	934	razor_package_iterator_destroy(pi);
krh@97	935
krh@97	936	return p;
krh@10	937	}
krh@10	938
jbowes@225	939	void
jbowes@225	940	razor_package_get_details(struct razor_set set, struct razor_package package,
jbowes@225	941	const char summary, const char description,
jbowes@225	942	const char url, const char license)
jbowes@224	943	{
jbowes@224	944	const char *pool = set->string_pool.data;
jbowes@225	945
jbowes@225	946	*summary = &pool[package->summary];
jbowes@225	947	*description = &pool[package->description];
jbowes@225	948	*url = &pool[package->url];
jbowes@225	949	*license = &pool[package->license];
jbowes@224	950	}
jbowes@224	951
krh@92	952	struct razor_property_iterator {
krh@92	953	struct razor_set *set;
krh@92	954	struct razor_property property, end;
danw@117	955	struct list *index;
krh@92	956	};
krh@92	957
krh@92	958	struct razor_property_iterator *
krh@92	959	razor_property_iterator_create(struct razor_set *set,
krh@92	960	struct razor_package *package)
krh@92	961	{
krh@92	962	struct razor_property_iterator *pi;
krh@92	963
krh@92	964	pi = zalloc(sizeof *pi);
krh@92	965	pi->set = set;
krh@98	966
danw@116	967	if (package) {
danw@117	968	pi->index = list_first(&package->properties,
danw@117	969	&set->property_pool);
danw@116	970	} else {
danw@116	971	pi->property = set->properties.data;
danw@116	972	pi->end = set->properties.data + set->properties.size;
danw@116	973	}
krh@92	974
krh@92	975	return pi;
krh@92	976	}
krh@92	977
krh@92	978	int
krh@92	979	razor_property_iterator_next(struct razor_property_iterator *pi,
krh@92	980	struct razor_property **property,
danw@109	981	const char **name,
danw@109	982	enum razor_version_relation *relation,
danw@109	983	const char **version,
krh@92	984	enum razor_property_type *type)
krh@92	985	{
krh@92	986	char *pool;
krh@92	987	int valid;
krh@92	988	struct razor_property p, properties;
krh@92	989
danw@116	990	if (pi->property) {
krh@92	991	p = pi->property++;
krh@92	992	valid = p < pi->end;
danw@116	993	} else if (pi->index) {
danw@116	994	properties = pi->set->properties.data;
danw@117	995	p = &properties[pi->index->data];
danw@116	996	pi->index = list_next(pi->index);
danw@116	997	valid = 1;
danw@116	998	} else
danw@116	999	valid = 0;
krh@92	1000
krh@96	1001	if (valid) {
krh@96	1002	pool = pi->set->string_pool.data;
krh@96	1003	*property = p;
danw@119	1004	*name = &pool[p->name];
danw@109	1005	*relation = p->relation;
krh@96	1006	*version = &pool[p->version];
danw@119	1007	*type = p->type;
krh@96	1008	} else {
krh@96	1009	*property = NULL;
krh@96	1010	}
krh@92	1011
krh@92	1012	return valid;
krh@92	1013	}
krh@92	1014
krh@66	1015	void
krh@92	1016	razor_property_iterator_destroy(struct razor_property_iterator *pi)
krh@8	1017	{
krh@92	1018	free(pi);
krh@10	1019	}
krh@10	1020
krh@56	1021	static struct razor_entry *
krh@56	1022	find_entry(struct razor_set set, struct razor_entry dir, const char *pattern)
krh@56	1023	{
krh@56	1024	struct razor_entry *e;
jbowes@227	1025	const char n, pool = set->file_string_pool.data;
krh@56	1026	int len;
krh@56	1027
krh@56	1028	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1029	do {
danw@120	1030	n = pool + e->name;
krh@56	1031	if (strcmp(pattern + 1, n) == 0)
krh@56	1032	return e;
krh@57	1033	len = strlen(n);
krh@56	1034	if (e->start != 0 && strncmp(pattern + 1, n, len) == 0 &&
krh@56	1035	pattern[len + 1] == '/') {
krh@56	1036	return find_entry(set, e, pattern + len + 1);
krh@56	1037	}
danw@120	1038	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1039
krh@56	1040	return NULL;
krh@56	1041	}
krh@56	1042
krh@56	1043	static void
krh@56	1044	list_dir(struct razor_set set, struct razor_entry dir,
danw@127	1045	char prefix, const char pattern)
krh@56	1046	{
krh@56	1047	struct razor_entry *e;
jbowes@227	1048	const char n, pool = set->file_string_pool.data;
krh@56	1049
krh@56	1050	e = (struct razor_entry *) set->files.data + dir->start;
krh@56	1051	do {
danw@120	1052	n = pool + e->name;
krh@56	1053	if (pattern && pattern[0] && fnmatch(pattern, n, 0) != 0)
krh@56	1054	continue;
danw@127	1055	printf("%s/%s\n", prefix, n);
danw@127	1056	if (e->start) {
danw@127	1057	char *sub = prefix + strlen (prefix);
danw@127	1058	*sub = '/';
danw@127	1059	strcpy (sub + 1, n);
danw@127	1060	list_dir(set, e, prefix, pattern);
danw@127	1061	*sub = '\0';
danw@127	1062	}
danw@120	1063	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1064	}
krh@56	1065
krh@56	1066	void
krh@56	1067	razor_set_list_files(struct razor_set set, const char pattern)
krh@56	1068	{
krh@56	1069	struct razor_entry *e;
krh@56	1070	char buffer[512], p, base;
krh@56	1071
danw@127	1072	if (pattern == NULL \|\| !strcmp (pattern, "/")) {
danw@127	1073	buffer[0] = '\0';
danw@127	1074	list_dir(set, set->files.data, buffer, NULL);
danw@127	1075	return;
danw@127	1076	}
krh@56	1077
krh@56	1078	strcpy(buffer, pattern);
krh@56	1079	e = find_entry(set, set->files.data, buffer);
krh@56	1080	if (e && e->start > 0) {
krh@56	1081	base = NULL;
krh@56	1082	} else {
krh@56	1083	p = strrchr(buffer, '/');
krh@56	1084	if (p) {
krh@56	1085	*p = '\0';
krh@56	1086	base = p + 1;
krh@56	1087	} else {
krh@56	1088	base = NULL;
krh@56	1089	}
krh@56	1090	}
krh@56	1091	e = find_entry(set, set->files.data, buffer);
krh@56	1092	if (e->start != 0)
krh@56	1093	list_dir(set, e, buffer, base);
krh@56	1094	}
krh@56	1095
krh@102	1096	struct razor_package_iterator *
krh@102	1097	razor_package_iterator_create_for_file(struct razor_set *set,
krh@102	1098	const char *filename)
krh@56	1099	{
krh@102	1100	struct razor_entry *entry;
danw@117	1101	struct list *index;
krh@56	1102
krh@102	1103	entry = find_entry(set, set->files.data, filename);
krh@102	1104	if (entry == NULL)
krh@102	1105	return NULL;
krh@56	1106
danw@116	1107	index = list_first(&entry->packages, &set->package_pool);
krh@102	1108	return razor_package_iterator_create_with_index(set, index);
krh@56	1109	}
krh@56	1110
danw@117	1111	static struct list *
danw@117	1112	list_package_files(struct razor_set set, struct list r,
danw@108	1113	struct razor_entry *dir, uint32_t end,
krh@56	1114	char *prefix)
krh@56	1115	{
krh@56	1116	struct razor_entry e, f, *entries;
danw@108	1117	uint32_t next, file;
krh@56	1118	char *pool;
krh@56	1119	int len;
krh@56	1120
krh@56	1121	entries = (struct razor_entry *) set->files.data;
jbowes@227	1122	pool = set->file_string_pool.data;
krh@56	1123
krh@56	1124	e = entries + dir->start;
krh@56	1125	do {
danw@117	1126	if (entries + r->data == e) {
danw@120	1127	printf("%s/%s\n", prefix, pool + e->name);
danw@116	1128	r = list_next(r);
danw@116	1129	if (!r)
krh@83	1130	return NULL;
danw@117	1131	if (r->data >= end)
krh@83	1132	return r;
krh@56	1133	}
danw@120	1134	} while (!((e++)->flags & RAZOR_ENTRY_LAST));
krh@56	1135
krh@56	1136	e = entries + dir->start;
krh@56	1137	do {
krh@56	1138	if (e->start == 0)
krh@56	1139	continue;
krh@56	1140
danw@120	1141	if (e->flags & RAZOR_ENTRY_LAST)
krh@56	1142	next = end;
krh@56	1143	else {
krh@56	1144	f = e + 1;
danw@120	1145	while (f->start == 0 && !(f->flags & RAZOR_ENTRY_LAST))
krh@56	1146	f++;
krh@56	1147	if (f->start == 0)
krh@56	1148	next = end;
krh@56	1149	else
krh@56	1150	next = f->start;
krh@56	1151	}
krh@56	1152
danw@117	1153	file = r->data;
krh@83	1154	if (e->start <= file && file < next) {
krh@56	1155	len = strlen(prefix);
krh@56	1156	prefix[len] = '/';
danw@120	1157	strcpy(prefix + len + 1, pool + e->name);
krh@56	1158	r = list_package_files(set, r, e, next, prefix);
krh@56	1159	prefix[len] = '\0';
krh@56	1160	}
danw@120	1161	} while (!((e++)->flags & RAZOR_ENTRY_LAST) && r != NULL);
krh@56	1162
krh@56	1163	return r;
krh@56	1164	}
krh@56	1165
krh@56	1166	void
krh@56	1167	razor_set_list_package_files(struct razor_set set, const char name)
krh@56	1168	{
krh@56	1169	struct razor_package *package;
danw@117	1170	struct list *r;
danw@117	1171	uint32_t end;
krh@56	1172	char buffer[512];
krh@56	1173
krh@56	1174	package = razor_set_get_package(set, name);
krh@56	1175
danw@116	1176	r = list_first(&package->files, &set->file_pool);
krh@56	1177	end = set->files.size / sizeof (struct razor_entry);
krh@56	1178	buffer[0] = '\0';
krh@56	1179	list_package_files(set, r, set->files.data, end, buffer);
krh@56	1180	}
krh@56	1181
krh@43	1182	static void
krh@21	1183	razor_set_validate(struct razor_set set, struct array unsatisfied)
krh@21	1184	{
krh@66	1185	struct razor_property r, p, *end;
danw@108	1186	uint32_t *u;
krh@21	1187	char *pool;
krh@21	1188
krh@66	1189	end = set->properties.data + set->properties.size;
krh@21	1190	pool = set->string_pool.data;
krh@21	1191
krh@66	1192	for (r = set->properties.data, p = r; r < end; r++) {
danw@119	1193	if (r->type != RAZOR_PROPERTY_REQUIRES)
krh@66	1194	continue;
krh@66	1195
danw@129	1196	p = r;
danw@129	1197	while (p < end && p->name == r->name &&
danw@129	1198	p->type == r->type)
danw@129	1199	p++;
krh@37	1200
krh@35	1201	/* If there is more than one version of a provides,
krh@35	1202	* seek to the end for the highest version. */
krh@66	1203	/* FIXME: This doesn't work if we have a series of
krh@66	1204	* requires a = 1, provides a = 1, requires a = 2,
krh@66	1205	* provides a = 2, as the kernel and kernel-devel
krh@66	1206	* does.*/
danw@119	1207	while (p + 1 < end && p->name == (p + 1)->name &&
danw@119	1208	p->type == (p + 1)->type)
krh@35	1209	p++;
krh@37	1210
krh@37	1211	/* FIXME: We need to track property flags (<, <=, =
krh@37	1212	* etc) to properly determine if a requires is
krh@37	1213	* satisfied. The current code doesn't track that the
krh@37	1214	* requires a = 1 isn't satisfied by a = 2 provides. */
krh@37	1215
krh@66	1216	if (p == end \|\|
danw@119	1217	p->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@119	1218	r->name != p->name \|\|
krh@35	1219	versioncmp(&pool[r->version], &pool[p->version]) > 0) {
krh@35	1220	/* FIXME: We ignore file requires for now. */
danw@119	1221	if (pool[r->name] == '/')
krh@35	1222	continue;
krh@21	1223	u = array_add(unsatisfied, sizeof *u);
krh@66	1224	u = r - (struct razor_property ) set->properties.data;
krh@21	1225	}
krh@21	1226	}
krh@21	1227	}
krh@21	1228
krh@21	1229	void
krh@21	1230	razor_set_list_unsatisfied(struct razor_set *set)
krh@21	1231	{
krh@21	1232	struct array unsatisfied;
krh@66	1233	struct razor_property properties, r;
danw@108	1234	uint32_t u, end;
krh@21	1235	char *pool;
krh@21	1236
krh@21	1237	array_init(&unsatisfied);
krh@21	1238	razor_set_validate(set, &unsatisfied);
krh@21	1239
krh@21	1240	end = unsatisfied.data + unsatisfied.size;
krh@66	1241	properties = set->properties.data;
krh@21	1242	pool = set->string_pool.data;
krh@21	1243
krh@21	1244	for (u = unsatisfied.data; u < end; u++) {
krh@66	1245	r = properties + *u;
krh@66	1246	if (pool[r->version] == '\0')
krh@220	1247	printf("%s not satisfied\n",
danw@119	1248	&pool[r->name]);
krh@66	1249	else
krh@66	1250	printf("%s-%s not satisfied\n",
danw@119	1251	&pool[r->name],
krh@66	1252	&pool[r->version]);
krh@21	1253	}
krh@21	1254
krh@21	1255	array_release(&unsatisfied);
krh@21	1256	}
krh@21	1257
danw@120	1258	#define UPSTREAM_SOURCE 0x80
krh@41	1259
krh@41	1260	struct source {
krh@41	1261	struct razor_set *set;
danw@108	1262	uint32_t *property_map;
danw@127	1263	uint32_t *file_map;
krh@41	1264	};
krh@41	1265
krh@79	1266	struct razor_merger {
krh@79	1267	struct razor_set *set;
krh@79	1268	struct hashtable table;
jbowes@227	1269	struct hashtable file_table;
krh@79	1270	struct source source1;
krh@79	1271	struct source source2;
krh@79	1272	};
krh@79	1273
krh@79	1274	static struct razor_merger *
krh@79	1275	razor_merger_create(struct razor_set set1, struct razor_set set2)
krh@41	1276	{
krh@79	1277	struct razor_merger *merger;
krh@41	1278	int count;
krh@41	1279	size_t size;
krh@41	1280
krh@79	1281	merger = zalloc(sizeof *merger);
krh@79	1282	merger->set = razor_set_create();
krh@79	1283	hashtable_init(&merger->table, &merger->set->string_pool);
jbowes@227	1284	hashtable_init(&merger->file_table, &merger->set->file_string_pool);
krh@41	1285
danw@127	1286	merger->source1.set = set1;
krh@79	1287	count = set1->properties.size / sizeof (struct razor_property);
krh@79	1288	size = count * sizeof merger->source1.property_map[0];
krh@79	1289	merger->source1.property_map = zalloc(size);
danw@127	1290	count = set1->files.size / sizeof (struct razor_entry);
danw@127	1291	size = count * sizeof merger->source1.file_map[0];
danw@127	1292	merger->source1.file_map = zalloc(size);
krh@79	1293
danw@127	1294	merger->source2.set = set2;
krh@79	1295	count = set2->properties.size / sizeof (struct razor_property);
krh@79	1296	size = count * sizeof merger->source2.property_map[0];
krh@79	1297	merger->source2.property_map = zalloc(size);
danw@127	1298	count = set2->files.size / sizeof (struct razor_entry);
danw@127	1299	size = count * sizeof merger->source2.file_map[0];
danw@127	1300	merger->source2.file_map = zalloc(size);
krh@79	1301
krh@79	1302	return merger;
krh@41	1303	}
krh@41	1304
krh@33	1305	static void
krh@79	1306	add_package(struct razor_merger *merger,
krh@41	1307	struct razor_package package, struct source source,
danw@108	1308	uint32_t flags)
krh@33	1309	{
krh@33	1310	char *pool;
danw@117	1311	struct list *r;
krh@41	1312	struct razor_package *p;
krh@33	1313
krh@41	1314	pool = source->set->string_pool.data;
krh@79	1315	p = array_add(&merger->set->packages, sizeof *p);
krh@79	1316	p->name = hashtable_tokenize(&merger->table, &pool[package->name]);
danw@120	1317	p->flags = flags;
krh@79	1318	p->version = hashtable_tokenize(&merger->table,
krh@79	1319	&pool[package->version]);
krh@192	1320	p->arch = hashtable_tokenize(&merger->table,
krh@192	1321	&pool[package->arch]);
danw@127	1322
krh@66	1323	p->properties = package->properties;
danw@116	1324	r = list_first(&package->properties, &source->set->property_pool);
danw@116	1325	while (r) {
danw@117	1326	source->property_map[r->data] = 1;
danw@116	1327	r = list_next(r);
krh@64	1328	}
danw@127	1329
danw@127	1330	p->files = package->files;
danw@127	1331	r = list_first(&package->files, &source->set->file_pool);
danw@127	1332	while (r) {
danw@127	1333	source->file_map[r->data] = 1;
danw@127	1334	r = list_next(r);
danw@127	1335	}
krh@41	1336	}
krh@41	1337
danw@108	1338	static uint32_t
krh@79	1339	add_property(struct razor_merger *merger,
danw@109	1340	const char *name, enum razor_version_relation relation,
danw@109	1341	const char *version, int type)
krh@41	1342	{
krh@41	1343	struct razor_property *p;
krh@41	1344
krh@79	1345	p = array_add(&merger->set->properties, sizeof *p);
danw@119	1346	p->name = hashtable_tokenize(&merger->table, name);
danw@119	1347	p->flags = 0;
danw@119	1348	p->type = type;
danw@109	1349	p->relation = relation;
krh@79	1350	p->version = hashtable_tokenize(&merger->table, version);
krh@41	1351
krh@79	1352	return p - (struct razor_property *) merger->set->properties.data;
krh@41	1353	}
krh@41	1354
krh@41	1355	static void
krh@79	1356	merge_properties(struct razor_merger *merger)
krh@41	1357	{
krh@41	1358	struct razor_property p1, p2;
krh@79	1359	struct razor_set set1, set2;
danw@108	1360	uint32_t map1, map2;
krh@41	1361	int i, j, cmp, count1, count2;
krh@41	1362	char pool1, pool2;
krh@41	1363
krh@79	1364	set1 = merger->source1.set;
krh@79	1365	set2 = merger->source2.set;
krh@79	1366	map1 = merger->source1.property_map;
krh@79	1367	map2 = merger->source2.property_map;
krh@79	1368
krh@41	1369	i = 0;
krh@41	1370	j = 0;
krh@41	1371	pool1 = set1->string_pool.data;
krh@41	1372	pool2 = set2->string_pool.data;
krh@41	1373
krh@66	1374	count1 = set1->properties.size / sizeof *p1;
krh@66	1375	count2 = set2->properties.size / sizeof *p2;
krh@41	1376	while (i < count1 \|\| j < count2) {
krh@41	1377	if (i < count1 && map1[i] == 0) {
krh@41	1378	i++;
krh@41	1379	continue;
krh@41	1380	}
krh@41	1381	if (j < count2 && map2[j] == 0) {
krh@41	1382	j++;
krh@41	1383	continue;
krh@41	1384	}
krh@66	1385	p1 = (struct razor_property *) set1->properties.data + i;
krh@66	1386	p2 = (struct razor_property *) set2->properties.data + j;
krh@41	1387	if (i < count1 && j < count2)
danw@119	1388	cmp = strcmp(&pool1[p1->name], &pool2[p2->name]);
krh@41	1389	else if (i < count1)
krh@41	1390	cmp = -1;
krh@41	1391	else
krh@41	1392	cmp = 1;
krh@41	1393	if (cmp == 0)
danw@121	1394	cmp = p1->type - p2->type;
danw@121	1395	if (cmp == 0)
danw@109	1396	cmp = p1->relation - p2->relation;
danw@109	1397	if (cmp == 0)
krh@41	1398	cmp = versioncmp(&pool1[p1->version],
krh@41	1399	&pool2[p2->version]);
krh@41	1400	if (cmp < 0) {
krh@79	1401	map1[i++] = add_property(merger,
danw@119	1402	&pool1[p1->name],
danw@109	1403	p1->relation,
krh@69	1404	&pool1[p1->version],
danw@119	1405	p1->type);
krh@41	1406	} else if (cmp > 0) {
krh@79	1407	map2[j++] = add_property(merger,
danw@119	1408	&pool2[p2->name],
danw@109	1409	p2->relation,
krh@69	1410	&pool2[p2->version],
danw@119	1411	p2->type);
krh@41	1412	} else {
krh@79	1413	map1[i++] = map2[j++] = add_property(merger,
danw@119	1414	&pool1[p1->name],
danw@109	1415	p1->relation,
krh@69	1416	&pool1[p1->version],
danw@119	1417	p1->type);
krh@41	1418	}
krh@41	1419	}
krh@41	1420	}
krh@41	1421
danw@116	1422	static void
danw@117	1423	emit_properties(struct list_head properties, struct array source_pool,
danw@108	1424	uint32_t map, struct array pool)
krh@41	1425	{
danw@117	1426	uint32_t r;
danw@117	1427	struct list p, q;
krh@41	1428
krh@41	1429	r = pool->size / sizeof *q;
danw@116	1430	p = list_first(properties, source_pool);
danw@116	1431	while (p) {
krh@41	1432	q = array_add(pool, sizeof *q);
danw@117	1433	q->data = map[p->data];
danw@117	1434	q->flags = p->flags;
danw@116	1435	p = list_next(p);
krh@33	1436	}
krh@33	1437
danw@117	1438	list_set_ptr(properties, r);
krh@41	1439	}
danw@127	1440
danw@127	1441	static uint32_t
danw@127	1442	add_file(struct razor_merger merger, const char name)
danw@127	1443	{
danw@127	1444	struct razor_entry *e;
danw@127	1445
danw@127	1446	e = array_add(&merger->set->files, sizeof *e);
jbowes@227	1447	e->name = hashtable_tokenize(&merger->file_table, name);
danw@127	1448	e->flags = 0;
danw@127	1449	e->start = 0;
danw@127	1450
danw@127	1451	return e - (struct razor_entry *)merger->set->files.data;
danw@127	1452	}
danw@127	1453
danw@129	1454	/* FIXME. Blah */
danw@127	1455	static int
danw@127	1456	fix_file_map(uint32_t *map,
danw@127	1457	struct razor_entry *files,
danw@127	1458	struct razor_entry *top)
danw@127	1459	{
danw@127	1460	uint32_t e;
danw@127	1461	int found_file = 0;
danw@127	1462
danw@127	1463	e = top->start;
danw@127	1464	do {
danw@127	1465	if (files[e].start)
danw@127	1466	fix_file_map(map, files, &files[e]);
danw@127	1467	if (map[e])
danw@127	1468	found_file = 1;
danw@127	1469	} while (!(files[e++].flags & RAZOR_ENTRY_LAST));
danw@127	1470
danw@127	1471	if (found_file)
danw@127	1472	map[top - files] = 1;
danw@127	1473	return found_file;
danw@127	1474	}
danw@127	1475
danw@127	1476	struct merge_directory {
danw@127	1477	uint32_t merged, dir1, dir2;
danw@127	1478	};
danw@127	1479
danw@127	1480	static void
danw@127	1481	merge_one_directory(struct razor_merger merger, struct merge_directory md)
danw@127	1482	{
danw@127	1483	struct razor_entry root1, root2, mroot, e1, *e2;
danw@127	1484	struct razor_set set1, set2;
danw@127	1485	struct array merge_stack;
danw@127	1486	struct merge_directory child_md, end_md;
danw@127	1487	uint32_t map1, map2, start, last;
danw@127	1488	int cmp;
danw@127	1489	char pool1, pool2;
danw@127	1490
danw@127	1491	set1 = merger->source1.set;
danw@127	1492	set2 = merger->source2.set;
danw@127	1493	map1 = merger->source1.file_map;
danw@127	1494	map2 = merger->source2.file_map;
danw@127	1495	pool1 = set1->string_pool.data;
danw@127	1496	pool2 = set2->string_pool.data;
danw@127	1497	root1 = (struct razor_entry *) set1->files.data;
danw@127	1498	root2 = (struct razor_entry *) set2->files.data;
danw@127	1499
danw@127	1500	array_init(&merge_stack);
danw@127	1501
danw@127	1502	start = merger->set->files.size / sizeof (struct razor_entry);
danw@127	1503	last = 0;
danw@127	1504	e1 = md->dir1 ? root1 + md->dir1 : NULL;
danw@127	1505	e2 = md->dir2 ? root2 + md->dir2 : NULL;
danw@127	1506	while (e1 \|\| e2) {
danw@127	1507	if (!e2 && !map1[e1 - root1]) {
danw@127	1508	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1509	e1 = NULL;
danw@127	1510	continue;
danw@127	1511	}
danw@127	1512	if (!e1 && !map2[e2 - root2]) {
danw@127	1513	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1514	e2 = NULL;
danw@127	1515	continue;
danw@127	1516	}
danw@127	1517	if (e1 && !map1[e1 - root1] &&
danw@127	1518	e2 && !map1[e2 - root2]) {
danw@127	1519	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1520	e1 = NULL;
danw@127	1521	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1522	e2 = NULL;
danw@127	1523	continue;
danw@127	1524	}
danw@127	1525
danw@127	1526	if (!e1)
danw@127	1527	cmp = 1;
danw@127	1528	else if (!e2)
danw@127	1529	cmp = -1;
danw@127	1530	else {
danw@127	1531	cmp = strcmp (&pool1[e1->name],
danw@127	1532	&pool2[e2->name]);
danw@127	1533	}
danw@127	1534
danw@127	1535	if (cmp < 0) {
danw@127	1536	if (map1[e1 - root1]) {
danw@127	1537	map1[e1 - root1] = last =
danw@127	1538	add_file(merger, &pool1[e1->name]);
danw@127	1539	if (e1->start) {
danw@127	1540	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1541	child_md->merged = last;
danw@127	1542	child_md->dir1 = e1->start;
danw@127	1543	child_md->dir2 = 0;
danw@127	1544	}
danw@127	1545	}
danw@127	1546	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1547	e1 = NULL;
danw@127	1548	} else if (cmp > 0) {
danw@127	1549	if (map2[e2 - root2]) {
danw@127	1550	map2[e2 - root2] = last =
danw@127	1551	add_file(merger, &pool2[e2->name]);
danw@127	1552	if (e2->start) {
danw@127	1553	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1554	child_md->merged = last;
danw@127	1555	child_md->dir1 = 0;
danw@127	1556	child_md->dir2 = e2->start;
danw@127	1557	}
danw@127	1558	}
danw@127	1559	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1560	e2 = NULL;
danw@127	1561	} else {
danw@127	1562	map1[e1 - root1] = map2[e2- root2] = last =
danw@127	1563	add_file(merger, &pool1[e1->name]);
danw@127	1564	if (e1->start \|\| e2->start) {
danw@127	1565	child_md = array_add(&merge_stack, sizeof (struct merge_directory));
danw@127	1566	child_md->merged = last;
danw@127	1567	child_md->dir1 = e1->start;
danw@127	1568	child_md->dir2 = e2->start;
danw@127	1569	}
danw@127	1570	if ((e1++)->flags & RAZOR_ENTRY_LAST)
danw@127	1571	e1 = NULL;
danw@127	1572	if ((e2++)->flags & RAZOR_ENTRY_LAST)
danw@127	1573	e2 = NULL;
danw@127	1574	}
danw@127	1575	}
danw@127	1576
danw@127	1577	mroot = (struct razor_entry *)merger->set->files.data;
danw@127	1578	if (last) {
danw@127	1579	mroot[last].flags = RAZOR_ENTRY_LAST;
danw@127	1580	mroot[md->merged].start = start;
danw@127	1581	} else
danw@127	1582	mroot[md->merged].start = 0;
danw@127	1583
danw@127	1584	end_md = merge_stack.data + merge_stack.size;
danw@127	1585	for (child_md = merge_stack.data; child_md < end_md; child_md++)
danw@127	1586	merge_one_directory(merger, child_md);
danw@127	1587	array_release(&merge_stack);
danw@127	1588	}
danw@127	1589
danw@127	1590	static void
danw@127	1591	merge_files(struct razor_merger *merger)
danw@127	1592	{
danw@129	1593	struct razor_entry *root;
danw@127	1594	struct merge_directory md;
danw@127	1595	uint32_t map1, map2;
danw@127	1596
danw@127	1597	map1 = merger->source1.file_map;
danw@127	1598	map2 = merger->source2.file_map;
danw@127	1599
danw@164	1600	md.merged = 0;
danw@129	1601
danw@129	1602	if (merger->source1.set->files.size) {
danw@129	1603	root = (struct razor_entry *) merger->source1.set->files.data;
danw@129	1604	if (root->start)
danw@129	1605	fix_file_map(map1, root, root);
danw@129	1606	md.dir1 = root->start;
danw@129	1607	} else
danw@129	1608	md.dir1 = 0;
danw@129	1609
danw@129	1610	if (merger->source2.set->files.size) {
danw@129	1611	root = (struct razor_entry *) merger->source2.set->files.data;
danw@129	1612	if (root->start)
danw@129	1613	fix_file_map(map2, root, root);
danw@129	1614	md.dir2 = root->start;
danw@129	1615	} else
danw@129	1616	md.dir2 = 0;
danw@129	1617
danw@127	1618	merge_one_directory(merger, &md);
danw@127	1619	}
danw@127	1620
danw@127	1621	static void
danw@127	1622	emit_files(struct list_head files, struct array source_pool,
danw@127	1623	uint32_t map, struct array pool)
danw@127	1624	{
danw@127	1625	uint32_t r;
danw@127	1626	struct list p, q;
danw@127	1627
danw@127	1628	r = pool->size / sizeof *q;
danw@127	1629	p = list_first(files, source_pool);
danw@127	1630	while (p) {
danw@127	1631	q = array_add(pool, sizeof *q);
danw@127	1632	q->data = map[p->data];
danw@127	1633	q->flags = p->flags;
danw@127	1634	p = list_next(p);
danw@127	1635	}
danw@127	1636
danw@127	1637	list_set_ptr(files, r);
danw@127	1638	}
danw@127	1639
krh@41	1640	/* Rebuild property->packages maps. We can't just remap these, as a
krh@41	1641	* property may have lost or gained a number of packages. Allocate an
krh@41	1642	* array per property and loop through the packages and add them to
krh@41	1643	* the arrays for their properties. */
krh@41	1644	static void
danw@127	1645	rebuild_property_package_lists(struct razor_set *set)
krh@41	1646	{
krh@66	1647	struct array pkgs, a;
krh@41	1648	struct razor_package pkg, pkg_end;
krh@41	1649	struct razor_property prop, prop_end;
danw@117	1650	struct list *r;
danw@117	1651	uint32_t *q;
krh@66	1652	int count;
krh@41	1653
krh@66	1654	count = set->properties.size / sizeof (struct razor_property);
krh@66	1655	pkgs = zalloc(count * sizeof *pkgs);
krh@41	1656	pkg_end = set->packages.data + set->packages.size;
krh@41	1657
krh@41	1658	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128	1659	r = list_first(&pkg->properties, &set->property_pool);
danw@116	1660	while (r) {
danw@117	1661	q = array_add(&pkgs[r->data], sizeof *q);
krh@41	1662	q = pkg - (struct razor_package ) set->packages.data;
danw@116	1663	r = list_next(r);
krh@41	1664	}
krh@33	1665	}
krh@33	1666
krh@66	1667	prop_end = set->properties.data + set->properties.size;
krh@66	1668	a = pkgs;
krh@66	1669	for (prop = set->properties.data; prop < prop_end; prop++, a++) {
danw@128	1670	list_set_array(&prop->packages, &set->package_pool, a, 0);
krh@41	1671	array_release(a);
krh@41	1672	}
krh@66	1673	free(pkgs);
krh@33	1674	}
krh@33	1675
danw@127	1676	static void
danw@127	1677	rebuild_file_package_lists(struct razor_set *set)
danw@127	1678	{
danw@127	1679	struct array pkgs, a;
danw@127	1680	struct razor_package pkg, pkg_end;
danw@127	1681	struct razor_entry entry, entry_end;
danw@127	1682	struct list *r;
danw@127	1683	uint32_t *q;
danw@127	1684	int count;
danw@127	1685
danw@127	1686	count = set->files.size / sizeof (struct razor_entry);
danw@127	1687	pkgs = zalloc(count * sizeof *pkgs);
danw@127	1688	pkg_end = set->packages.data + set->packages.size;
danw@127	1689
danw@127	1690	for (pkg = set->packages.data; pkg < pkg_end; pkg++) {
danw@128	1691	r = list_first(&pkg->files, &set->file_pool);
danw@127	1692	while (r) {
danw@127	1693	q = array_add(&pkgs[r->data], sizeof *q);
danw@127	1694	q = pkg - (struct razor_package ) set->packages.data;
danw@127	1695	r = list_next(r);
danw@127	1696	}
danw@127	1697	}
danw@127	1698
danw@127	1699	entry_end = set->files.data + set->files.size;
danw@127	1700	a = pkgs;
danw@127	1701	for (entry = set->files.data; entry < entry_end; entry++, a++) {
danw@128	1702	list_set_array(&entry->packages, &set->package_pool, a, 0);
danw@127	1703	array_release(a);
danw@127	1704	}
danw@127	1705	free(pkgs);
danw@127	1706	}
danw@127	1707
danw@137	1708	static struct razor_set *
krh@79	1709	razor_merger_finish(struct razor_merger *merger)
krh@79	1710	{
krh@79	1711	struct razor_set *result;
krh@41	1712	struct razor_package p, pend;
krh@33	1713
krh@41	1714	/* As we built the package list, we filled out a bitvector of
krh@41	1715	* the properties that are referenced by the packages in the
krh@41	1716	* new set. Now we do a parallel loop through the properties
krh@41	1717	* and emit those marked in the bit vector to the new set. In
krh@41	1718	* the process, we update the bit vector to actually map from
krh@41	1719	* indices in the old property list to indices in the new
krh@41	1720	* property list for both sets. */
krh@41	1721
krh@79	1722	merge_properties(merger);
danw@127	1723	merge_files(merger);
krh@41	1724
krh@41	1725	/* Now we loop through the packages again and emit the
krh@41	1726	* property lists, remapped to point to the new properties. */
krh@41	1727
krh@79	1728	pend = merger->set->packages.data + merger->set->packages.size;
krh@79	1729	for (p = merger->set->packages.data; p < pend; p++) {
krh@41	1730	struct source *src;
krh@41	1731
danw@120	1732	if (p->flags & UPSTREAM_SOURCE)
krh@79	1733	src = &merger->source2;
krh@41	1734	else
krh@79	1735	src = &merger->source1;
krh@41	1736
danw@116	1737	emit_properties(&p->properties,
danw@116	1738	&src->set->property_pool,
danw@116	1739	src->property_map,
danw@116	1740	&merger->set->property_pool);
danw@127	1741	emit_files(&p->files,
danw@127	1742	&src->set->file_pool,
danw@127	1743	src->file_map,
danw@127	1744	&merger->set->file_pool);
danw@120	1745	p->flags &= ~UPSTREAM_SOURCE;
krh@33	1746	}
krh@33	1747
danw@127	1748	rebuild_property_package_lists(merger->set);
danw@127	1749	rebuild_file_package_lists(merger->set);
krh@41	1750
danw@129	1751	result = merger->set;
danw@129	1752	hashtable_release(&merger->table);
jbowes@227	1753	hashtable_release(&merger->file_table);
danw@129	1754	free(merger);
danw@129	1755
danw@129	1756	return result;
danw@129	1757	}
danw@129	1758
danw@146	1759	/* The diff order matters. We should sort the packages so that a
danw@146	1760	* REMOVE of a package comes before the INSTALL, and so that all
danw@146	1761	* requires for a package have been installed before the package.
danw@146	1762	**/
danw@146	1763
danw@146	1764	void
danw@146	1765	razor_set_diff(struct razor_set set, struct razor_set upstream,
danw@146	1766	razor_package_callback_t callback, void *data)
danw@146	1767	{
danw@146	1768	struct razor_package_iterator pi1, pi2;
danw@146	1769	struct razor_package p1, p2;
krh@192	1770	const char name1, name2, version1, version2, arch1, arch2;
danw@146	1771	int res;
danw@146	1772
danw@146	1773	pi1 = razor_package_iterator_create(set);
danw@146	1774	pi2 = razor_package_iterator_create(upstream);
danw@146	1775
krh@192	1776	razor_package_iterator_next(pi1, &p1, &name1, &version1, &arch1);
krh@192	1777	razor_package_iterator_next(pi2, &p2, &name2, &version2, &arch2);
danw@146	1778
danw@146	1779	while (p1 \|\| p2) {
danw@146	1780	if (p1 && p2) {
danw@146	1781	res = strcmp(name1, name2);
danw@146	1782	if (res == 0)
danw@146	1783	res = versioncmp(version1, version2);
danw@146	1784	} else {
danw@146	1785	res = 0;
danw@146	1786	}
danw@146	1787
danw@146	1788	if (p2 == NULL \|\| res < 0)
krh@192	1789	callback(name1, version1, NULL, arch1, data);
danw@146	1790	else if (p1 == NULL \|\| res > 0)
krh@192	1791	callback(name2, NULL, version2, arch2, data);
danw@146	1792
danw@146	1793	if (p1 != NULL && res <= 0)
danw@146	1794	razor_package_iterator_next(pi1, &p1,
krh@192	1795	&name1, &version1, &arch1);
danw@146	1796	if (p2 != NULL && res >= 0)
danw@146	1797	razor_package_iterator_next(pi2, &p2,
krh@192	1798	&name2, &version2, &arch2);
danw@146	1799	}
danw@146	1800
danw@146	1801	razor_package_iterator_destroy(pi1);
danw@146	1802	razor_package_iterator_destroy(pi2);
danw@146	1803	}
danw@146	1804
krh@190	1805	struct razor_transaction;
krh@190	1806	struct razor_transaction_package;
krh@190	1807	struct razor_transaction_resolver;
krh@190	1808
krh@190	1809	struct razor_transaction {
krh@190	1810	int package_count, errors;
krh@190	1811	struct razor_set system, upstream;
krh@191	1812
krh@191	1813	struct bitarray syspkgs, uppkgs;
krh@191	1814	struct array packages;
krh@190	1815	};
krh@190	1816
krh@190	1817	struct razor_transaction_package {
krh@190	1818	const char name, old_version, *new_version;
krh@190	1819	struct razor_package old_package, new_package;
krh@190	1820	enum razor_transaction_package_state state;
krh@190	1821
krh@190	1822	/* dep_package is the name of the package that resulted in
krh@190	1823	* this entry being created (or NULL if the user requested the
krh@190	1824	* install/remove), with the other dep_ fields providing
krh@190	1825	* additional information.
krh@190	1826	*
krh@190	1827	* For INSTALL, if dep_type is REQUIRES, then dep_package
krh@190	1828	* required something that this package provides. If dep_type
krh@190	1829	* is CONFLICTS, then dep_package is a package that conflicted
krh@190	1830	* with an older version of this package, forcing an upgrade.
krh@190	1831	*
krh@190	1832	* For REMOVE, if dep_type is REQUIRES, then dep_package is a
krh@190	1833	* package that is being removed. If dep_type is OBSOLETES,
krh@190	1834	* then dep_package is a package that obsoletes this one.
krh@190	1835	*
krh@190	1836	* For OLD_CONFLICT or NEW_CONFLICT, dep_package is an
krh@190	1837	* existing package that conflicts with this one. The
krh@190	1838	* conflicting property comes from the already-installed
krh@190	1839	* package for OLD_CONFLICT, or the to-be-installed package
krh@190	1840	* for NEW_CONFLICT.
krh@190	1841	*
krh@190	1842	* For UNSATISFIABLE, the dep_ fields are as for an INSTALL,
krh@190	1843	* but the name field will be NULL.
krh@190	1844	*/
krh@190	1845	const char *dep_package;
krh@190	1846	enum razor_property_type dep_type;
krh@190	1847	const char *dep_property;
krh@190	1848	enum razor_version_relation dep_relation;
krh@190	1849	const char *dep_version;
krh@190	1850	};
danw@141	1851
danw@144	1852	static int
danw@144	1853	package_in_set(void package, struct razor_set set)
danw@144	1854	{
danw@144	1855	return package >= set->packages.data &&
danw@144	1856	package < set->packages.data + set->packages.size;
danw@144	1857	}
danw@144	1858
danw@144	1859	static int
danw@144	1860	property_in_set(void property, struct razor_set set)
danw@144	1861	{
danw@144	1862	return property >= set->properties.data &&
danw@144	1863	property < set->properties.data + set->properties.size;
danw@144	1864	}
danw@144	1865
danw@168	1866	static struct razor_package *
krh@191	1867	property_provider_package(struct razor_transaction *trans,
danw@168	1868	struct razor_property *prop,
danw@168	1869	int installed)
danw@168	1870	{
danw@168	1871	struct razor_set *set;
danw@168	1872	struct bitarray *pkgbits;
danw@168	1873	struct razor_package *pkgs;
danw@168	1874	struct list *p;
danw@168	1875
danw@168	1876	if (installed && prop->type != RAZOR_PROPERTY_PROVIDES)
danw@168	1877	return NULL;
danw@168	1878	else if (!installed &&
danw@168	1879	prop->type != RAZOR_PROPERTY_PROVIDES &&
danw@168	1880	prop->type != RAZOR_PROPERTY_OBSOLETES)
danw@168	1881	return NULL;
danw@168	1882
danw@168	1883	if (property_in_set(prop, trans->system)) {
danw@168	1884	set = trans->system;
danw@168	1885	pkgbits = &trans->syspkgs;
danw@168	1886	} else {
danw@168	1887	set = trans->upstream;
danw@168	1888	pkgbits = &trans->uppkgs;
danw@168	1889	}
danw@168	1890	pkgs = set->packages.data;
danw@168	1891
danw@168	1892	for (p = list_first(&prop->packages, &set->package_pool); p; p = list_next(p)) {
danw@168	1893	if (bitarray_get(pkgbits, p->data) != installed)
danw@168	1894	continue;
danw@168	1895	if (prop->type == RAZOR_PROPERTY_OBSOLETES \|\|
danw@168	1896	pkgs[p->data].name == prop->name)
danw@168	1897	return &pkgs[p->data];
danw@168	1898	}
danw@168	1899	return NULL;
danw@168	1900	}
danw@168	1901
danw@144	1902	static int
danw@144	1903	compare_transaction_packages(const void one, const void two)
danw@144	1904	{
danw@160	1905	struct razor_transaction_package *tp1 = (void )one;
danw@160	1906	struct razor_transaction_package *tp2 = (void )two;
danw@160	1907
danw@160	1908	if (!(*tp1)->name)
danw@160	1909	return 1;
danw@160	1910	else if (!(*tp2)->name)
danw@160	1911	return -1;
danw@160	1912	else
danw@160	1913	return strcmp((tp1)->name, (tp2)->name);
danw@144	1914	}
danw@144	1915
danw@168	1916	/* FIXME: merge this into the other property loop in razor_transaction_satisfy */
danw@141	1917	static void
krh@191	1918	resolve_new_packages(struct razor_transaction *trans,
danw@160	1919	int start, int end)
krh@38	1920	{
danw@168	1921	struct razor_property sp, up, sp_end, up_end;
danw@168	1922	struct razor_package spkg, spkgs, upkg, upkgs;
danw@160	1923	struct razor_transaction_package **packages;
danw@144	1924	const char spool, upool;
danw@144	1925	int i;
danw@144	1926
danw@168	1927	sp_end = trans->system->properties.data + trans->system->properties.size;
danw@168	1928	spool = trans->system->string_pool.data;
danw@144	1929	spkgs = trans->system->packages.data;
danw@168	1930	up_end = trans->upstream->properties.data + trans->upstream->properties.size;
danw@168	1931	upool = trans->upstream->string_pool.data;
danw@144	1932	upkgs = trans->upstream->packages.data;
danw@168	1933
danw@168	1934	/* FIXME, check if sorting the packages directly (rather than
danw@168	1935	* sorting pointers-to-packages) still results in confusing
danw@168	1936	* descriptions.
danw@168	1937	*/
danw@160	1938	packages = calloc(end - start, sizeof *packages);
danw@160	1939	for (i = start; i < end; i++)
danw@160	1940	packages[i - start] = ((struct razor_transaction_package *)trans->packages.data) + i;
danw@160	1941	qsort(packages, end - start, sizeof *packages,
danw@160	1942	compare_transaction_packages);
danw@144	1943
danw@168	1944	sp = trans->system->properties.data;
danw@168	1945	up = trans->upstream->properties.data;
danw@160	1946	for (i = 0; i < end - start; i++) {
danw@169	1947	if (!packages[i]->name \|\|
danw@169	1948	packages[i]->state >= RAZOR_PACKAGE_FIRST_ERROR_STATE)
danw@160	1949	continue;
danw@168	1950
danw@168	1951	spkg = NULL;
danw@168	1952	while (sp < sp_end &&
danw@168	1953	strcmp(&spool[sp->name], packages[i]->name) < 0)
danw@144	1954	sp++;
danw@168	1955	while (sp < sp_end &&
danw@168	1956	strcmp(&spool[sp->name], packages[i]->name) == 0 &&
danw@168	1957	!(spkg = property_provider_package(trans, sp, 1)))
danw@168	1958	sp++;
danw@168	1959
danw@168	1960	upkg = NULL;
danw@168	1961	while (up < up_end &&
danw@168	1962	strcmp(&upool[up->name], packages[i]->name) < 0)
danw@168	1963	up++;
danw@168	1964	while (up < up_end &&
danw@168	1965	strcmp(&upool[up->name], packages[i]->name) == 0 &&
danw@168	1966	!(upkg = property_provider_package(trans, up, 0)))
danw@144	1967	up++;
danw@144	1968
danw@160	1969	if (packages[i]->state == RAZOR_PACKAGE_REMOVE \|\|
danw@160	1970	packages[i]->state == RAZOR_PACKAGE_OBSOLETED) {
danw@168	1971	if (spkg) {
danw@168	1972	packages[i]->old_package = spkg;
danw@168	1973	packages[i]->name = &spool[spkg->name];
danw@168	1974	packages[i]->old_version = &spool[spkg->version];
danw@168	1975	bitarray_set(&trans->syspkgs, spkg - spkgs, 0);
danw@169	1976	}
danw@169	1977	if (!packages[i]->old_package) {
danw@160	1978	packages[i]->name = strdup(packages[i]->name);
danw@169	1979	packages[i]->state \|= RAZOR_PACKAGE_UNAVAILABLE_FLAG;
danw@144	1980	trans->errors++;
danw@144	1981	}
danw@144	1982	} else {
danw@168	1983	if (upkg) {
danw@168	1984	packages[i]->new_package = upkg;
danw@168	1985	packages[i]->name = &upool[upkg->name];
danw@168	1986	packages[i]->new_version = &upool[upkg->version];
danw@168	1987
danw@168	1988	if (up->name != upkg->name) {
danw@168	1989	packages[i]->dep_package = &upool[upkg->name];
danw@168	1990	packages[i]->dep_type = up->type;
danw@168	1991	packages[i]->dep_property = &upool[up->name];
danw@168	1992	packages[i]->dep_relation = up->relation;
danw@168	1993	packages[i]->dep_version = &upool[up->version];
danw@168	1994	}
danw@168	1995
danw@168	1996	if (spkg) {
danw@168	1997	packages[i]->old_package = spkg;
danw@168	1998	packages[i]->old_version = &spool[spkg->version];
danw@168	1999	if (versioncmp(&spool[spkg->version], &upool[up->version]) >= 0) {
danw@160	2000	packages[i]->state = RAZOR_PACKAGE_UP_TO_DATE;
danw@144	2001	trans->errors++;
danw@144	2002	continue;
danw@144	2003	}
danw@168	2004	bitarray_set(&trans->syspkgs, spkg - spkgs, 0);
danw@144	2005	}
danw@168	2006	bitarray_set(&trans->uppkgs, upkg - upkgs, 1);
danw@169	2007	}
danw@169	2008	if (!packages[i]->new_package) {
danw@160	2009	packages[i]->name = strdup(packages[i]->name);
danw@169	2010	packages[i]->state \|= RAZOR_PACKAGE_UNAVAILABLE_FLAG;
danw@144	2011	trans->errors++;
krh@105	2012	}
krh@105	2013	}
krh@38	2014	}
krh@38	2015	}
krh@38	2016
danw@137	2017	static int
danw@137	2018	provider_satisfies_requirement(struct razor_property *provider,
danw@137	2019	const char *provider_strings,
danw@137	2020	struct razor_property *requirement,
danw@137	2021	const char *requirement_strings)
danw@137	2022	{
danw@137	2023	int cmp, len;
danw@137	2024	const char *provided = &provider_strings[provider->version];
danw@137	2025	const char *required = &requirement_strings[requirement->version];
danw@137	2026
danw@137	2027	if (!*required)
danw@137	2028	return 1;
danw@170	2029	if (!*provided) {
danw@170	2030	if (requirement->relation >= RAZOR_VERSION_EQUAL)
danw@170	2031	return 1;
danw@170	2032	else
danw@170	2033	return 0;
danw@170	2034	}
danw@137	2035
danw@137	2036	cmp = versioncmp(provided, required);
danw@137	2037
danw@137	2038	switch (requirement->relation) {
danw@137	2039	case RAZOR_VERSION_LESS:
danw@137	2040	return cmp < 0;
danw@137	2041
danw@137	2042	case RAZOR_VERSION_LESS_OR_EQUAL:
danw@137	2043	if (cmp <= 0)
danw@137	2044	return 1;
danw@137	2045	/* fall through: FIXME, make sure this is correct */
danw@137	2046
danw@137	2047	case RAZOR_VERSION_EQUAL:
danw@137	2048	if (cmp == 0)
danw@137	2049	return 1;
danw@137	2050
danw@137	2051	/* "foo == 1.1" is satisfied by "foo 1.1-2" */
danw@137	2052	len = strlen(required);
danw@137	2053	if (!strncmp(required, provided, len) && provided[len] == '-')
danw@137	2054	return 1;
danw@137	2055	return 0;
danw@137	2056
danw@137	2057	case RAZOR_VERSION_GREATER_OR_EQUAL:
danw@137	2058	return cmp >= 0;
danw@137	2059
danw@137	2060	case RAZOR_VERSION_GREATER:
danw@137	2061	return cmp > 0;
danw@137	2062	}
danw@137	2063
danw@137	2064	/* shouldn't happen */
danw@137	2065	return 0;
danw@137	2066	}
danw@137	2067
danw@142	2068	static struct razor_package *
danw@144	2069	find_package_for_file(struct razor_set set, struct bitarray pkgbits,
danw@144	2070	const char *filename, int installed)
danw@134	2071	{
danw@142	2072	struct razor_package *pkgs = set->packages.data;
danw@140	2073	struct razor_entry *entry;
danw@140	2074	struct list *p;
danw@134	2075
danw@140	2076	if (filename[0] != '/')
danw@140	2077	return 0;
danw@140	2078
danw@142	2079	entry = find_entry(set, set->files.data, filename);
danw@140	2080	if (!entry)
danw@140	2081	return 0;
danw@140	2082
danw@142	2083	for (p = list_first(&entry->packages, &set->package_pool); p; p = list_next(p)) {
danw@142	2084	if (bitarray_get(pkgbits, p->data) == installed)
danw@142	2085	return &pkgs[p->data];
danw@134	2086	}
danw@142	2087	return NULL;
danw@142	2088	}
danw@142	2089
danw@142	2090	static struct razor_package *
krh@191	2091	find_installed_package_for_file(struct razor_transaction *trans,
danw@144	2092	const char *filename)
danw@142	2093	{
danw@144	2094	struct razor_package *pkg;
danw@144	2095
danw@144	2096	pkg = find_package_for_file(trans->system, &trans->syspkgs,
danw@144	2097	filename, 1);
danw@144	2098	if (!pkg)
danw@144	2099	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,
danw@144	2100	filename, 1);
danw@144	2101	return pkg;
danw@142	2102	}
danw@142	2103
danw@142	2104	static struct razor_package *
krh@191	2105	find_uninstalled_package_for_file(struct razor_transaction *trans,
danw@144	2106	const char *filename)
danw@142	2107	{
danw@144	2108	struct razor_package *pkg;
danw@144	2109
danw@144	2110	pkg = find_package_for_file(trans->upstream, &trans->uppkgs,
danw@144	2111	filename, 0);
danw@144	2112	if (!pkg)
danw@144	2113	pkg = find_package_for_file(trans->system, &trans->syspkgs,
danw@144	2114	filename, 0);
danw@144	2115	return pkg;
danw@134	2116	}
danw@134	2117
danw@154	2118	static struct razor_property *
krh@191	2119	skip_to_matching_property(struct razor_transaction *trans,
danw@154	2120	struct razor_property *match,
danw@154	2121	struct razor_property *prop)
danw@154	2122	{
danw@154	2123	struct razor_set mset, pset;
danw@154	2124	const char ppool, mpool;
danw@154	2125	struct razor_property *prop_end;
danw@154	2126
danw@154	2127	if (property_in_set(match, trans->system))
danw@154	2128	mset = trans->system;
danw@154	2129	else
danw@154	2130	mset = trans->upstream;
danw@154	2131
danw@154	2132	if (property_in_set(prop, trans->system))
danw@154	2133	pset = trans->system;
danw@154	2134	else if (property_in_set(prop, trans->upstream))
danw@154	2135	pset = trans->upstream;
danw@154	2136	else
danw@154	2137	return prop;
danw@154	2138
danw@154	2139	prop_end = pset->properties.data + pset->properties.size;
danw@154	2140	ppool = pset->string_pool.data;
danw@154	2141	mpool = mset->string_pool.data;
danw@154	2142
danw@154	2143	while (prop < prop_end &&
danw@154	2144	strcmp(&ppool[prop->name], &mpool[match->name]) < 0)
danw@154	2145	prop++;
danw@154	2146	return prop;
danw@154	2147	}
danw@154	2148
danw@140	2149	static struct razor_package *
krh@191	2150	find_package_matching(struct razor_transaction *trans, int installed,
danw@154	2151	struct razor_property *prop,
danw@144	2152	struct razor_property *req,
danw@144	2153	struct razor_set *req_set)
danw@138	2154	{
danw@144	2155	struct razor_set *set;
danw@144	2156	struct bitarray *pkgbits;
danw@144	2157	struct razor_package *pkgs;
danw@154	2158	struct razor_property props, prop_end;
danw@144	2159	enum razor_property_type match_type;
danw@144	2160	const char *pool;
danw@154	2161	const char *rpool;
danw@154	2162	int match_name = (req->type == RAZOR_PROPERTY_OBSOLETES);
danw@144	2163	int match;
danw@144	2164
danw@144	2165	if (property_in_set(prop, trans->system)) {
danw@144	2166	set = trans->system;
danw@144	2167	pkgbits = &trans->syspkgs;
danw@144	2168	} else if (property_in_set(prop, trans->upstream)) {
danw@144	2169	set = trans->upstream;
danw@144	2170	pkgbits = &trans->uppkgs;
danw@144	2171	} else
danw@144	2172	return NULL;
danw@144	2173
danw@154	2174	if (!req_set) {
danw@154	2175	if (property_in_set(req, trans->system))
danw@154	2176	req_set = trans->system;
danw@154	2177	else
danw@154	2178	req_set = trans->upstream;
danw@154	2179	}
danw@154	2180	rpool = req_set->string_pool.data;
danw@154	2181
danw@144	2182	if (req->type == RAZOR_PROPERTY_PROVIDES)
danw@144	2183	match_type = RAZOR_PROPERTY_CONFLICTS;
danw@144	2184	else
danw@144	2185	match_type = RAZOR_PROPERTY_PROVIDES;
danw@144	2186
danw@144	2187	pkgs = set->packages.data;
danw@144	2188	props = set->properties.data;
danw@144	2189	prop_end = set->properties.data + set->properties.size;
danw@144	2190	pool = set->string_pool.data;
danw@144	2191
danw@144	2192	/* Find first matching property */
danw@144	2193	while (prop < prop_end &&
danw@144	2194	strcmp(&pool[prop->name], &rpool[req->name]) < 0)
danw@144	2195	prop++;
danw@144	2196	if (prop == prop_end \|\|
danw@144	2197	strcmp(&pool[prop->name], &rpool[req->name]) > 0)
danw@144	2198	return NULL;
danw@144	2199
danw@144	2200	if (prop->type < match_type) {
danw@144	2201	while (prop < prop_end && prop->type != match_type)
danw@144	2202	prop++;
danw@144	2203	} else {
danw@144	2204	while (prop >= props && prop->type != match_type)
danw@144	2205	prop--;
danw@183	2206	while (prop > props + 1 && (prop - 1)->name == prop->name &&
danw@183	2207	(prop - 1)->type == match_type)
danw@144	2208	prop--;
danw@144	2209	}
danw@144	2210
danw@153	2211	/* Scan matching properties */
danw@144	2212	while (prop < prop_end && prop->type == match_type &&
danw@144	2213	strcmp(&pool[prop->name], &rpool[req->name]) == 0) {
danw@144	2214	if (match_type == RAZOR_PROPERTY_PROVIDES)
danw@144	2215	match = provider_satisfies_requirement(prop, pool, req, rpool);
danw@144	2216	else
danw@144	2217	match = provider_satisfies_requirement(req, rpool, prop, pool);
danw@144	2218	if (match) {
danw@140	2219	struct list *pkg;
danw@140	2220
danw@144	2221	for (pkg = list_first(&prop->packages, &set->package_pool); pkg; pkg = list_next(pkg)) {
danw@144	2222	if (bitarray_get(pkgbits, pkg->data) != installed)
danw@140	2223	continue;
danw@140	2224	if (!match_name \|\|
danw@144	2225	strcmp(&pool[pkgs[pkg->data].name],
danw@144	2226	&rpool[req->name]) == 0)
danw@144	2227	return &pkgs[pkg->data];
danw@140	2228	}
danw@140	2229	}
danw@144	2230	prop++;
danw@140	2231	}
danw@140	2232
danw@140	2233	return NULL;
danw@138	2234	}
danw@138	2235
danw@140	2236	static struct razor_package *
krh@191	2237	find_installed_package_for_property(struct razor_transaction *trans,
danw@154	2238	struct razor_property *sys_start,
danw@154	2239	struct razor_property *up_start,
danw@144	2240	struct razor_property *req)
danw@138	2241	{
danw@144	2242	struct razor_package *pkg;
danw@144	2243
danw@154	2244	pkg = find_package_matching(trans, 1, sys_start, req, NULL);
danw@144	2245	if (!pkg)
danw@154	2246	pkg = find_package_matching(trans, 1, up_start, req, NULL);
danw@144	2247	return pkg;
danw@144	2248	}
danw@144	2249
danw@144	2250	static struct razor_package *
krh@191	2251	find_uninstalled_package_for_property(struct razor_transaction *trans,
danw@154	2252	struct razor_property *sys_start,
danw@154	2253	struct razor_property *up_start,
danw@144	2254	struct razor_property *req)
danw@144	2255	{
danw@144	2256	struct razor_package *pkg;
danw@144	2257
danw@154	2258	pkg = find_package_matching(trans, 0, up_start, req, NULL);
danw@144	2259	if (!pkg)
danw@154	2260	pkg = find_package_matching(trans, 0, sys_start, req, NULL);
danw@144	2261	return pkg;
danw@140	2262	}
danw@140	2263
danw@147	2264	static struct razor_transaction_package *
krh@191	2265	find_transaction_package(struct razor_transaction trans, const char name)
danw@147	2266	{
danw@147	2267	struct razor_transaction_package *packages;
danw@147	2268	int count, i;
danw@147	2269
danw@147	2270	packages = trans->packages.data;
danw@147	2271	count = trans->packages.size / sizeof *packages;
danw@147	2272	for (i = 0; i < count; i++) {
danw@147	2273	if (packages[i].name && !strcmp(packages[i].name, name))
danw@147	2274	return &packages[i];
danw@147	2275	}
danw@147	2276	return NULL;
danw@147	2277	}
danw@147	2278
danw@160	2279	/* FIXME? */
danw@160	2280	static int
krh@191	2281	prop_is_being_installed(struct razor_transaction *trans,
danw@160	2282	struct razor_property *prop)
danw@160	2283	{
danw@160	2284	struct list *pkg;
danw@160	2285
danw@160	2286	for (pkg = list_first(&prop->packages, &trans->upstream->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2287	if (bitarray_get(&trans->uppkgs, pkg->data))
danw@160	2288	return 1;
danw@160	2289	}
danw@160	2290	return 0;
danw@160	2291	}
danw@160	2292
danw@160	2293	static int
krh@191	2294	prop_is_being_removed(struct razor_transaction *trans,
danw@160	2295	struct razor_property *prop)
danw@160	2296	{
danw@160	2297	struct list *pkg;
danw@160	2298
danw@160	2299	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2300	if (bitarray_get(&trans->syspkgs, pkg->data))
danw@160	2301	return 0;
danw@160	2302	}
danw@160	2303	return 1;
danw@160	2304	}
danw@160	2305
danw@160	2306	static int
krh@191	2307	prop_is_being_updated(struct razor_transaction *trans,
danw@160	2308	struct razor_property *prop)
danw@160	2309	{
danw@160	2310	struct razor_package *packages = trans->system->packages.data;
danw@160	2311	const char *pool = trans->system->string_pool.data;
danw@160	2312	struct razor_transaction_package *tp;
danw@160	2313	struct list *pkg;
danw@160	2314
danw@160	2315	/* Assumes prop_is_being_removed returns true */
danw@160	2316
danw@160	2317	for (pkg = list_first(&prop->packages, &trans->system->package_pool); pkg; pkg = list_next(pkg)) {
danw@160	2318	tp = find_transaction_package(trans, &pool[packages[pkg->data].name]);
danw@160	2319	if (tp && tp->state == RAZOR_PACKAGE_REMOVE)
danw@160	2320	return 0;
danw@160	2321	}
danw@160	2322	return 1;
danw@160	2323	}
danw@160	2324
danw@131	2325	static void
krh@191	2326	add_transaction_package(struct razor_transaction *trans,
danw@147	2327	struct razor_package *new_package,
danw@147	2328	struct razor_package *old_package,
danw@140	2329	enum razor_transaction_package_state state,
danw@144	2330	const char *req_package,
danw@144	2331	struct razor_property *req_prop)
danw@131	2332	{
danw@147	2333	struct razor_set new_package_set, old_package_set, *req_set;
danw@160	2334	struct bitarray *reqpkgbits;
danw@147	2335	struct razor_transaction_package tp, already;
danw@140	2336	const char *pool;
danw@140	2337	struct razor_package *pkgs;
danw@140	2338	struct list *pkg;
danw@147	2339	int contradiction = 0;
danw@147	2340
danw@160	2341	if (package_in_set(new_package, trans->system))
danw@147	2342	new_package_set = trans->system;
danw@160	2343	else
danw@147	2344	new_package_set = trans->upstream;
danw@160	2345	if (package_in_set(old_package, trans->system))
danw@147	2346	old_package_set = trans->system;
danw@160	2347	else
danw@147	2348	old_package_set = trans->upstream;
danw@145	2349	if (property_in_set(req_prop, trans->system)) {
danw@145	2350	req_set = trans->system;
danw@145	2351	reqpkgbits = &trans->syspkgs;
danw@145	2352	} else {
danw@145	2353	req_set = trans->upstream;
danw@145	2354	reqpkgbits = &trans->uppkgs;
danw@145	2355	}
danw@144	2356
danw@147	2357	if (new_package) {
danw@147	2358	pool = new_package_set->string_pool.data;
danw@147	2359	already = find_transaction_package(trans, &pool[new_package->name]);
danw@147	2360	if (already) {
danw@147	2361	if (already->new_package == new_package) {
danw@147	2362	/* Already taken care of */
danw@147	2363	return;
danw@166	2364	} else if (new_package_set == trans->upstream &&
danw@166	2365	already->state == RAZOR_PACKAGE_FORCED_UPDATE) {
danw@166	2366	already->new_package = new_package;
danw@166	2367	return;
krh@209	2368	} else if (new_package_set == trans->upstream) {
krh@209	2369	return;
danw@147	2370	}
danw@166	2371
danw@147	2372	/* Oops. We lose */
danw@147	2373	if (state != RAZOR_PACKAGE_CONTRADICTION)
danw@147	2374	contradiction = 1;
danw@147	2375	}
danw@147	2376	} else if (old_package) {
danw@147	2377	pool = old_package_set->string_pool.data;
danw@147	2378	already = find_transaction_package(trans, &pool[old_package->name]);
danw@147	2379	if (already) {
danw@147	2380	if (already->old_package == old_package) {
danw@147	2381	/* Already taken care of */
danw@147	2382	return;
danw@166	2383	} else if (old_package_set == trans->system) {
danw@166	2384	already->old_package = old_package;
danw@166	2385	return;
danw@147	2386	}
danw@166	2387
danw@147	2388	/* Oops. We lose */
danw@147	2389	if (state != RAZOR_PACKAGE_CONTRADICTION)
danw@147	2390	contradiction = 1;
danw@147	2391	}
danw@147	2392	} else
danw@147	2393	state = RAZOR_PACKAGE_UNSATISFIABLE;
danw@147	2394
danw@141	2395	tp = array_add(&trans->packages, sizeof *tp);
danw@140	2396	memset(tp, 0, sizeof *tp);
danw@131	2397
danw@147	2398	if (new_package) {
danw@147	2399	pool = new_package_set->string_pool.data;
danw@147	2400	tp->new_package = new_package;
danw@147	2401	tp->name = &pool[new_package->name];
danw@147	2402	tp->new_version = &pool[new_package->version];
danw@147	2403
danw@147	2404	pkgs = new_package_set->packages.data;
danw@147	2405	}
danw@147	2406	if (old_package) {
danw@147	2407	pool = old_package_set->string_pool.data;
danw@147	2408	tp->old_package = old_package;
danw@147	2409	tp->name = &pool[old_package->name];
danw@147	2410	tp->old_version = &pool[old_package->version];
danw@147	2411
danw@147	2412	pkgs = old_package_set->packages.data;
danw@147	2413	}
danw@147	2414
danw@147	2415	tp->state = state;
danw@147	2416	if (state != RAZOR_PACKAGE_INSTALL &&
danw@154	2417	state != RAZOR_PACKAGE_FORCED_UPDATE &&
danw@154	2418	state != RAZOR_PACKAGE_REMOVE &&
danw@154	2419	state != RAZOR_PACKAGE_OBSOLETED)
danw@145	2420	trans->errors++;
danw@147	2421
danw@147	2422	if (contradiction) {
danw@147	2423	/* Do this now, after adding tp, so that it ends up
danw@147	2424	* after both the INSTALL and the REMOVE in the array.
danw@147	2425	*/
danw@147	2426	add_transaction_package(trans, new_package, old_package,
danw@147	2427	RAZOR_PACKAGE_CONTRADICTION,
danw@147	2428	NULL, NULL);
danw@145	2429	}
danw@140	2430
danw@144	2431	if (req_package)
danw@145	2432	tp->dep_package = req_package;
danw@145	2433	if (!req_prop)
danw@145	2434	return;
danw@145	2435
danw@145	2436	pool = req_set->string_pool.data;
danw@145	2437	pkgs = req_set->packages.data;
danw@145	2438	if (!req_package) {
danw@145	2439	for (pkg = list_first(&req_prop->packages, &req_set->package_pool); pkg; pkg = list_next(pkg)) {
danw@145	2440	if (bitarray_get(reqpkgbits, pkg->data))
danw@144	2441	break;
danw@144	2442	}
danw@145	2443	if (pkg)
danw@145	2444	tp->dep_package = &pool[pkgs[pkg->data].name];
danw@131	2445	}
danw@144	2446
danw@145	2447	tp->dep_type = req_prop->type;
danw@145	2448	tp->dep_property = &pool[req_prop->name];
danw@145	2449	tp->dep_relation = req_prop->relation;
danw@145	2450	tp->dep_version = &pool[req_prop->version];
danw@140	2451	}
danw@140	2452
danw@160	2453	static void
krh@191	2454	razor_transaction_satisfy(struct razor_transaction *trans)
danw@147	2455	{
danw@160	2456	struct razor_package spkgs, upkgs, *pkg;
danw@144	2457	struct razor_property sp, sprops, *sprop_end;
danw@144	2458	struct razor_property up, uprops, *uprop_end;
danw@160	2459	struct razor_property sr, ur, *first_up;
danw@160	2460	const char spool, upool, *removed_package;
danw@160	2461	struct list *reqpkg;
danw@134	2462
danw@140	2463	spkgs = trans->system->packages.data;
danw@140	2464	sprops = trans->system->properties.data;
danw@144	2465	sprop_end = trans->system->properties.data + trans->system->properties.size;
danw@145	2466	spool = trans->system->string_pool.data;
danw@140	2467	upkgs = trans->upstream->packages.data;
danw@140	2468	uprops = trans->upstream->properties.data;
danw@144	2469	uprop_end = trans->upstream->properties.data + trans->upstream->properties.size;
danw@140	2470	upool = trans->upstream->string_pool.data;
krh@33	2471
danw@144	2472	sp = sprops;
danw@160	2473	for (up = uprops; up < uprop_end; up++) {
danw@140	2474	/* Skip 'up' ahead to a property of a package which is
danw@140	2475	* to-be-installed.
danw@140	2476	*/
danw@144	2477	while (up < uprop_end &&
danw@144	2478	!prop_is_being_installed(trans, up))
danw@140	2479	up++;
danw@144	2480	if (up == uprop_end)
danw@140	2481	break;
danw@154	2482	sp = skip_to_matching_property(trans, up, sp);
krh@33	2483
danw@144	2484	switch (up->type) {
danw@140	2485	case RAZOR_PROPERTY_REQUIRES:
danw@144	2486	if (!strncmp(&upool[up->name], "rpmlib(", 7))
danw@140	2487	break;
danw@131	2488
danw@154	2489	if (find_installed_package_for_property(trans, sp, up, up) \|\|
danw@144	2490	find_installed_package_for_file(trans, &upool[up->name])) {
danw@140	2491	/* Requires something that is either installed
danw@140	2492	* or to-be-installed.
danw@140	2493	*/
danw@140	2494	break;
danw@137	2495	}
danw@137	2496
danw@140	2497	/* See if we can install a new upstream provider */
danw@154	2498	pkg = find_uninstalled_package_for_property(trans, sp, up, up);
danw@154	2499	if (!pkg)
danw@144	2500	pkg = find_uninstalled_package_for_file(trans, &upool[up->name]);
danw@160	2501	add_transaction_package(trans, pkg, NULL,
danw@144	2502	RAZOR_PACKAGE_INSTALL,
danw@144	2503	NULL, up);
danw@144	2504	break;
danw@144	2505
danw@144	2506	case RAZOR_PROPERTY_PROVIDES:
danw@144	2507	/* find_installed_package_for_property works backwards
danw@144	2508	* here, finding a conflicting installed package.
danw@144	2509	*/
danw@154	2510	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@140	2511	if (!pkg)
danw@144	2512	break;
danw@144	2513
danw@145	2514	if (package_in_set(pkg, trans->system)) {
danw@145	2515	/* pkg CONFLICTS with what 'up' PROVIDES. Try
danw@145	2516	* finding an upgrade
danw@145	2517	*/
danw@160	2518	add_transaction_package(trans, NULL, pkg,
danw@160	2519	RAZOR_PACKAGE_FORCED_UPDATE,
danw@165	2520	&upool[up->name], sp);
danw@160	2521	} else {
danw@160	2522	add_transaction_package(trans, NULL, pkg,
danw@160	2523	RAZOR_PACKAGE_CONTRADICTION,
danw@160	2524	NULL, up);
danw@144	2525	}
danw@140	2526	break;
danw@140	2527
danw@140	2528	case RAZOR_PROPERTY_CONFLICTS:
danw@154	2529	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@144	2530	if (!pkg)
danw@144	2531	break;
danw@144	2532
danw@144	2533	if (package_in_set(pkg, trans->system)) {
danw@140	2534	/* Conflicts with something already installed.
danw@140	2535	* Try to upgrade out.
danw@140	2536	*/
danw@160	2537	add_transaction_package(trans, NULL, pkg,
danw@160	2538	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2539	NULL, up);
danw@160	2540	} else {
danw@160	2541	add_transaction_package(trans, pkg, NULL,
danw@160	2542	RAZOR_PACKAGE_CONTRADICTION,
danw@160	2543	NULL, up);
danw@140	2544	}
danw@140	2545	break;
danw@140	2546
danw@140	2547	case RAZOR_PROPERTY_OBSOLETES:
danw@154	2548	pkg = find_installed_package_for_property(trans, sp, up, up);
danw@145	2549	if (pkg) {
danw@145	2550	/* If pkg is to-be-installed, this
danw@145	2551	* will add a CONTRADICTION error as well.
danw@145	2552	*/
danw@147	2553	add_transaction_package(trans, NULL, pkg,
danw@154	2554	RAZOR_PACKAGE_OBSOLETED,
danw@144	2555	NULL, up);
danw@140	2556	}
danw@140	2557	break;
danw@140	2558
danw@140	2559	default:
danw@140	2560	/* can't happen */
danw@140	2561	break;
danw@131	2562	}
krh@37	2563	}
danw@154	2564
danw@154	2565	up = uprops;
danw@154	2566	for (sp = sprops; sp < sprop_end; sp++) {
danw@154	2567	/* Skip 'sp' ahead to a PROVIDES of a package which is
danw@154	2568	* to-be-removed.
danw@154	2569	*/
danw@154	2570	while (sp < sprop_end &&
danw@154	2571	(sp->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@154	2572	!prop_is_being_removed(trans, sp)))
danw@154	2573	sp++;
danw@154	2574	if (sp == sprop_end)
danw@154	2575	break;
danw@154	2576
danw@154	2577	removed_package = &spool[spkgs[list_first(&sp->packages, &trans->system->package_pool)->data].name];
danw@154	2578
danw@154	2579	/* Skip 'up' to match */
danw@154	2580	up = skip_to_matching_property(trans, sp, up);
danw@154	2581	ur = first_up = up;
danw@154	2582
danw@154	2583	/* If the package is just being upgraded, we may
danw@154	2584	* already be installing an identical PROVIDES, so
danw@154	2585	* check for that.
danw@154	2586	*/
danw@154	2587	while (up < uprop_end &&
danw@154	2588	strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
danw@154	2589	(up->type != RAZOR_PROPERTY_PROVIDES \|\|
danw@154	2590	sp->relation != up->relation \|\|
danw@154	2591	strcmp(&spool[sp->name], &upool[up->name]) != 0))
danw@154	2592	up++;
danw@154	2593	if (up < uprop_end &&
danw@154	2594	up->type == RAZOR_PROPERTY_PROVIDES &&
danw@154	2595	strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
danw@154	2596	sp->relation == up->relation &&
danw@154	2597	strcmp(&spool[sp->version], &upool[up->version]) == 0 &&
danw@154	2598	prop_is_being_installed(trans, up)) {
danw@154	2599	up = first_up;
danw@154	2600	continue;
danw@154	2601	}
danw@154	2602	up = first_up;
danw@154	2603
danw@154	2604	/* For all still-installed packages that require
danw@154	2605	* sp->name, see if they are satisfied by any other
danw@154	2606	* still-installed or to-be-installed property. If
danw@154	2607	* not, either remove or attempt to update the
danw@154	2608	* package, depending on why the required property has
danw@154	2609	* disappeared
danw@154	2610	*/
danw@154	2611	sr = sp;
danw@154	2612	while (sr > sprops + 1 && (sr - 1)->name == sr->name)
danw@154	2613	sr--;
danw@154	2614	for (; sr->type == RAZOR_PROPERTY_REQUIRES; sr++) {
danw@154	2615	if (prop_is_being_removed(trans, sr))
danw@154	2616	continue;
danw@154	2617	if (find_installed_package_for_property(trans, sp, up, sr))
danw@154	2618	continue;
danw@154	2619
danw@154	2620	for (reqpkg = list_first(&sr->packages, &trans->system->package_pool); reqpkg; reqpkg = list_next(reqpkg)) {
danw@154	2621	if (!bitarray_get(&trans->syspkgs, reqpkg->data))
danw@154	2622	continue;
danw@154	2623	pkg = &spkgs[reqpkg->data];
danw@154	2624	if (prop_is_being_updated(trans, sp)) {
danw@160	2625	add_transaction_package(trans, NULL, pkg,
danw@160	2626	RAZOR_PACKAGE_FORCED_UPDATE,
danw@160	2627	removed_package, NULL);
danw@154	2628	} else {
danw@154	2629	add_transaction_package(trans, NULL, pkg,
danw@154	2630	RAZOR_PACKAGE_REMOVE,
danw@154	2631	removed_package, sr);
danw@154	2632	}
danw@154	2633	}
danw@154	2634	}
danw@154	2635	}
danw@154	2636	}
danw@129	2637
krh@208	2638	void
krh@208	2639	razor_transaction_install_package(struct razor_transaction *transaction,
krh@208	2640	struct razor_package *package)
krh@208	2641	{
krh@208	2642	add_transaction_package(transaction, package, NULL,
krh@208	2643	RAZOR_PACKAGE_INSTALL, NULL, NULL);
krh@208	2644	}
krh@208	2645
krh@208	2646	void
krh@208	2647	razor_transaction_remove_package(struct razor_transaction *transaction,
krh@208	2648	struct razor_package *package)
krh@208	2649	{
krh@208	2650	add_transaction_package(transaction, NULL, package,
krh@208	2651	RAZOR_PACKAGE_REMOVE, NULL, NULL);
krh@208	2652	}
krh@208	2653
krh@208	2654	void
krh@208	2655	razor_transaction_update_all(struct razor_transaction *trans)
krh@208	2656	{
krh@208	2657	struct razor_package sp, spkgs, send, up, upkgs, uend;
krh@208	2658	const char spool, upool;
krh@208	2659
krh@208	2660	spkgs = trans->system->packages.data;
krh@208	2661	send = trans->system->packages.data + trans->system->packages.size;
krh@208	2662	spool = trans->system->string_pool.data;
krh@208	2663	up = upkgs = trans->upstream->packages.data;
krh@208	2664	uend = trans->upstream->packages.data + trans->upstream->packages.size;
krh@208	2665	upool = trans->upstream->string_pool.data;
krh@208	2666
krh@208	2667	for (sp = spkgs; sp < send; sp++) {
krh@208	2668	while (up < uend && strcmp(&spool[sp->name], &upool[up->name]) > 0)
krh@208	2669	up++;
krh@208	2670	if (strcmp(&spool[sp->name], &upool[up->name]) == 0 &&
krh@208	2671	versioncmp(&spool[sp->version], &upool[up->version]) < 0) {
krh@208	2672	add_transaction_package(trans, up, sp,
krh@208	2673	RAZOR_PACKAGE_INSTALL,
krh@208	2674	NULL, NULL);
krh@208	2675	}
krh@208	2676	}
krh@208	2677	}
krh@208	2678
danw@137	2679	struct razor_transaction *
krh@208	2680	razor_transaction_create(struct razor_set system, struct razor_set upstream)
danw@137	2681	{
krh@191	2682	struct razor_transaction *trans;
krh@208	2683	int count;
danw@137	2684
krh@191	2685	trans = zalloc(sizeof *trans);
krh@191	2686
krh@191	2687	trans->system = system;
krh@191	2688	trans->upstream = upstream ? upstream : razor_set_create();
krh@191	2689	array_init(&trans->packages);
krh@208	2690	count = trans->system->packages.size / sizeof (struct razor_package);
krh@208	2691	bitarray_init(&trans->syspkgs, count, 1);
krh@208	2692	count = trans->upstream->packages.size / sizeof (struct razor_package);
krh@208	2693	bitarray_init(&trans->uppkgs, count, 0);
krh@208	2694
krh@208	2695	return trans;
krh@208	2696	}
krh@208	2697
krh@208	2698	static void
krh@208	2699	resolve_transaction(struct razor_transaction *trans)
krh@208	2700	{
krh@208	2701	int start, end;
krh@208	2702
krh@208	2703	if (trans->package_count > 0)
krh@208	2704	/* Already did this, return. */
krh@208	2705	return;
danw@137	2706
danw@137	2707	start = 0;
krh@191	2708	end = trans->packages.size / sizeof (struct razor_transaction_package);
danw@137	2709
danw@160	2710	while (start != end) {
krh@191	2711	resolve_new_packages(trans, start, end);
krh@191	2712	if (trans->errors)
danw@160	2713	break;
danw@160	2714
krh@191	2715	razor_transaction_satisfy(trans);
danw@137	2716
danw@137	2717	start = end;
krh@191	2718	end = trans->packages.size / sizeof (struct razor_transaction_package);
danw@137	2719	}
danw@137	2720
krh@191	2721	trans->package_count = end;
danw@137	2722	}
danw@137	2723
danw@137	2724	const char * const razor_version_relations[] = {
danw@137	2725	/* same order as enum razor_version_relation */
danw@137	2726	"<", "<=", "=", ">=", ">"
danw@137	2727	};
danw@137	2728
danw@140	2729	const char * const razor_property_types[] = {
danw@140	2730	/* same order as enum razor_property_type */
danw@140	2731	"requires", "provides", "conflicts with", "obsoletes"
danw@140	2732	};
danw@140	2733
danw@169	2734	static void
danw@169	2735	print_requirement(struct razor_transaction_package *p)
danw@169	2736	{
danw@169	2737	if (p->dep_type == RAZOR_PROPERTY_CONFLICTS &&
danw@169	2738	!strcmp(p->dep_package, p->name)) {
danw@169	2739	printf(" because %s %s conflicts with %s",
danw@169	2740	p->name, p->old_version, p->dep_property);
danw@169	2741	if (*p->dep_version) {
danw@169	2742	printf(" %s %s",
danw@169	2743	razor_version_relations[p->dep_relation],
danw@169	2744	p->dep_version);
danw@169	2745	}
danw@169	2746	} else {
danw@169	2747	if (strcmp(p->name, p->dep_package) != 0)
danw@169	2748	printf(" for %s", p->dep_package);
danw@169	2749	if (*p->dep_version) {
danw@169	2750	printf(", which %s %s %s %s",
danw@169	2751	razor_property_types[p->dep_type],
danw@169	2752	p->dep_property,
danw@169	2753	razor_version_relations[p->dep_relation],
danw@169	2754	p->dep_version);
danw@169	2755	} else if (strcmp(p->dep_property, p->name) != 0) {
danw@169	2756	printf(", which %s %s",
danw@169	2757	razor_property_types[p->dep_type],
danw@169	2758	p->dep_property);
danw@169	2759	}
danw@169	2760	}
danw@169	2761	}
danw@169	2762
krh@190	2763	int
krh@210	2764	razor_transaction_resolve(struct razor_transaction *trans)
danw@137	2765	{
danw@137	2766	struct razor_transaction_package p, pend, *tps;
danw@137	2767	int errors_only = 0;
danw@137	2768
krh@208	2769	resolve_transaction(trans);
krh@208	2770
krh@191	2771	tps = trans->packages.data;
krh@191	2772	pend = trans->packages.data + trans->packages.size;
krh@191	2773	for (p = trans->packages.data; p < pend; p++) {
danw@137	2774	switch (p->state) {
danw@137	2775	case RAZOR_PACKAGE_INSTALL:
danw@137	2776	if (errors_only)
danw@137	2777	break;
danw@137	2778
danw@147	2779	printf("Installing %s %s", p->name, p->new_version);
danw@169	2780	if (p->dep_package)
danw@169	2781	print_requirement(p);
danw@137	2782	printf("\n");
danw@137	2783	break;
danw@137	2784
danw@154	2785	case RAZOR_PACKAGE_FORCED_UPDATE:
danw@154	2786	if (errors_only)
danw@154	2787	break;
danw@154	2788
danw@154	2789	printf("Updating %s to %s due to update of %s\n",
danw@154	2790	p->name, p->new_version, p->dep_package);
danw@154	2791	break;
danw@154	2792
danw@137	2793	case RAZOR_PACKAGE_REMOVE:
danw@137	2794	if (errors_only)
danw@137	2795	break;
danw@147	2796	printf("Removing %s %s", p->name, p->old_version);
danw@145	2797	if (p->dep_package) {
danw@154	2798	printf(" which required %s",
danw@154	2799	p->dep_package);
danw@162	2800	if (strcmp(p->dep_property, p->dep_package) != 0)
danw@154	2801	printf(" for %s", p->dep_property);
danw@154	2802	}
danw@154	2803	printf("\n");
danw@154	2804	break;
danw@154	2805
danw@154	2806	case RAZOR_PACKAGE_OBSOLETED:
danw@154	2807	if (errors_only)
danw@154	2808	break;
danw@154	2809	printf("Removing %s %s", p->name, p->old_version);
danw@154	2810	if (p->dep_package) {
danw@154	2811	printf(" which is obsoleted by %s",
danw@154	2812	p->dep_package);
danw@137	2813	}
danw@137	2814	printf("\n");
danw@137	2815	break;
danw@137	2816
danw@145	2817	case RAZOR_PACKAGE_INSTALL_UNAVAILABLE:
danw@169	2818	printf("Error: can't find %s", p->name);
danw@169	2819	if (p->dep_package) {
danw@169	2820	printf(" (which is required");
danw@169	2821	print_requirement(p);
danw@169	2822	printf(")");
danw@169	2823	}
danw@169	2824	printf("\n");
danw@169	2825	errors_only = 1;
danw@169	2826	break;
danw@169	2827
danw@169	2828	case RAZOR_PACKAGE_UPDATE_UNAVAILABLE:
danw@169	2829	printf("Error: can't find an updated version of %s (which must be updated due to update of %s)\n",
danw@169	2830	p->name, p->dep_package);
danw@137	2831	errors_only = 1;
danw@137	2832	break;
danw@137	2833
danw@145	2834	case RAZOR_PACKAGE_REMOVE_NOT_INSTALLED:
danw@145	2835	printf("Error: can't remove %s: not installed\n", p->name);
danw@137	2836	errors_only = 1;
danw@137	2837	break;
danw@137	2838
danw@145	2839	case RAZOR_PACKAGE_UP_TO_DATE:
danw@169	2840	printf("Error: can't update %s", p->name);
danw@169	2841	if (p->dep_package)
danw@169	2842	printf(" (which must be updated due to update of %s)", p->dep_package);
danw@169	2843	printf(": %s is most recent version\n", p->old_version);
danw@145	2844	errors_only = 1;
danw@145	2845	break;
danw@145	2846
danw@145	2847	case RAZOR_PACKAGE_CONTRADICTION:
danw@147	2848	printf("Error: package %s is marked for both installation and removal\n", p->name);
danw@145	2849	errors_only = 1;
danw@145	2850	break;
danw@145	2851
danw@145	2852	case RAZOR_PACKAGE_OLD_CONFLICT:
danw@145	2853	printf("Error: can't install %s, because installed package %s conflicts with ",
danw@145	2854	p->name, p->dep_package);
danw@145	2855	if (*p->dep_version) {
danw@145	2856	printf("%s %s %s",
danw@145	2857	p->dep_property,
danw@145	2858	razor_version_relations[p->dep_relation],
danw@145	2859	p->dep_version);
danw@145	2860	} else
danw@145	2861	printf("it");
danw@145	2862	printf("\n");
danw@145	2863
danw@145	2864	errors_only = 1;
danw@145	2865	break;
danw@145	2866
danw@145	2867	case RAZOR_PACKAGE_NEW_CONFLICT:
danw@145	2868	printf("Error: can't install %s, because it conflicts with %s",
danw@145	2869	p->name, p->dep_package);
danw@145	2870	if (*p->dep_version) {
danw@145	2871	printf(" %s %s",
danw@145	2872	razor_version_relations[p->dep_relation],
danw@145	2873	p->dep_version);
danw@145	2874	}
danw@145	2875	printf("\n");
danw@145	2876
danw@145	2877	errors_only = 1;
danw@145	2878	break;
danw@145	2879
danw@145	2880	case RAZOR_PACKAGE_UNSATISFIABLE:
danw@145	2881	printf("Error: can't find package for %s", p->dep_property);
danw@145	2882	if (*p->dep_version) {
danw@145	2883	printf(" %s %s",
danw@145	2884	razor_version_relations[p->dep_relation],
danw@145	2885	p->dep_version);
danw@145	2886	}
danw@145	2887	printf(" which is required by %s\n",
danw@145	2888	p->dep_package);
danw@140	2889	errors_only = 1;
danw@140	2890	break;
danw@140	2891
danw@137	2892	default:
danw@137	2893	/* Shouldn't actually happen */
danw@137	2894	break;
danw@137	2895	}
danw@137	2896	}
krh@190	2897
krh@190	2898	return trans->errors;
krh@190	2899	}
krh@190	2900
krh@190	2901	int
krh@190	2902	razor_transaction_unsatisfied_property(struct razor_transaction *trans,
krh@190	2903	const char *name,
krh@190	2904	enum razor_version_relation rel,
krh@190	2905	const char *version)
krh@190	2906	{
krh@190	2907	struct razor_transaction_package p, end;
krh@190	2908
krh@191	2909	end = trans->packages.data + trans->packages.size;
krh@191	2910	for (p = trans->packages.data; p < end; p++) {
krh@190	2911	if (p->state != RAZOR_PACKAGE_UNSATISFIABLE)
krh@190	2912	continue;
krh@190	2913	if (strcmp(name, p->dep_property) != 0 \|\|
krh@190	2914	rel != p->dep_relation \|\|
krh@190	2915	strcmp(version, p->dep_version) != 0)
krh@190	2916	continue;
krh@190	2917
krh@190	2918	return 1;
krh@190	2919	}
krh@190	2920
krh@190	2921	return 0;
danw@137	2922	}
danw@137	2923
danw@137	2924	struct razor_set *
krh@196	2925	razor_transaction_finish(struct razor_transaction *trans)
danw@137	2926	{
danw@137	2927	struct array install_packages, remove_packages;
danw@137	2928	struct razor_merger *merger;
danw@137	2929	struct razor_package pkg, i, iend, r, rend, s, *send;
krh@196	2930	struct razor_set *set;
danw@137	2931	struct source source1, source2;
danw@137	2932	char spool, ipool, *rpool;
danw@137	2933	uint32_t *map;
krh@191	2934	struct razor_transaction_package p, end;
krh@191	2935	int cmp;
danw@137	2936
danw@137	2937	/* FIXME */
danw@137	2938	if (trans->errors)
danw@137	2939	return NULL;
danw@137	2940
danw@137	2941	/* Sort the transaction packages into two arrays */
danw@137	2942	array_init(&install_packages);
danw@137	2943	array_init(&remove_packages);
krh@191	2944
krh@191	2945	end = trans->packages.data + trans->packages.size;
krh@191	2946	for (p = trans->packages.data; p < end; p++) {
krh@191	2947	if (p->new_package) {
danw@137	2948	pkg = array_add(&install_packages, sizeof *pkg);
krh@191	2949	pkg = p->new_package;
danw@147	2950	} else {
danw@137	2951	pkg = array_add(&remove_packages, sizeof *pkg);
krh@191	2952	pkg = p->old_package;
danw@147	2953	}
danw@137	2954	}
krh@186	2955	map = razor_qsort_with_data(install_packages.data,
krh@186	2956	install_packages.size / sizeof *pkg,
krh@186	2957	sizeof *pkg,
krh@186	2958	compare_packages,
krh@186	2959	trans->upstream);
danw@137	2960	free(map);
krh@186	2961	map = razor_qsort_with_data(remove_packages.data,
krh@186	2962	remove_packages.size / sizeof *pkg,
krh@186	2963	sizeof *pkg,
krh@186	2964	compare_packages,
krh@186	2965	trans->system);
danw@137	2966	free(map);
danw@137	2967
danw@137	2968	merger = razor_merger_create(trans->system, trans->upstream);
danw@137	2969
danw@137	2970	source1 = &merger->source1;
danw@137	2971	source2 = &merger->source2;
danw@137	2972
danw@137	2973	i = install_packages.data;
danw@137	2974	iend = install_packages.data + install_packages.size;
danw@137	2975	ipool = trans->upstream->string_pool.data;
danw@137	2976
danw@137	2977	r = remove_packages.data;
danw@137	2978	rend = remove_packages.data + remove_packages.size;
danw@137	2979	rpool = trans->system->string_pool.data;
danw@137	2980
danw@137	2981	s = trans->system->packages.data;
danw@137	2982	send = trans->system->packages.data + trans->system->packages.size;
danw@137	2983	spool = trans->system->string_pool.data;
danw@137	2984
danw@137	2985	while (s < send \|\| i < iend) {
danw@137	2986	/* Check if s is being removed */
danw@137	2987	if (s < send && r < rend &&
danw@137	2988	s->name == r->name && s->version && r->version) {
danw@137	2989	s++;
danw@137	2990	r++;
danw@137	2991	continue;
danw@137	2992	}
danw@137	2993
danw@137	2994	if (s < send && i < iend)
danw@137	2995	cmp = strcmp(&spool[s->name], &ipool[i->name]);
danw@137	2996	else if (s < send)
danw@137	2997	cmp = -1;
danw@137	2998	else
danw@137	2999	cmp = 1;
danw@137	3000	if (cmp < 0) {
danw@137	3001	add_package(merger, s, source1, 0);
danw@137	3002	s++;
danw@137	3003	} else if (cmp == 0) {
danw@137	3004	add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137	3005	s++;
danw@137	3006	i++;
danw@137	3007	} else {
danw@137	3008	add_package(merger, i, source2, UPSTREAM_SOURCE);
danw@137	3009	i++;
danw@137	3010	}
danw@137	3011	}
danw@137	3012
danw@137	3013	array_release(&install_packages);
danw@137	3014	array_release(&remove_packages);
danw@137	3015
krh@196	3016	set = razor_merger_finish(merger);
krh@196	3017	razor_transaction_destroy(trans);
krh@196	3018
krh@196	3019	return set;
danw@137	3020	}
danw@137	3021
danw@137	3022	void
danw@137	3023	razor_transaction_destroy(struct razor_transaction *trans)
danw@137	3024	{
krh@191	3025	struct razor_transaction_package p, end;
krh@191	3026
krh@191	3027	end = trans->packages.data + trans->packages.size;
krh@191	3028	for (p = trans->packages.data; p < end; p++) {
krh@191	3029	if (!p->dep_package &&
krh@191	3030	(p->state == RAZOR_PACKAGE_INSTALL_UNAVAILABLE \|\|
krh@191	3031	p->state == RAZOR_PACKAGE_REMOVE_NOT_INSTALLED))
krh@191	3032	free((char *)p->name);
danw@137	3033	}
krh@195	3034
krh@195	3035	array_release(&trans->packages);
krh@195	3036	bitarray_release(&trans->syspkgs);
krh@195	3037	bitarray_release(&trans->uppkgs);
danw@137	3038	free(trans);
danw@137	3039
danw@137	3040	/* FIXME: free upstream if it was created as an empty set */
danw@137	3041	}
krh@216	3042
krh@216	3043	struct razor_package_query {
krh@216	3044	struct razor_set *set;
krh@216	3045	char *vector;
krh@216	3046	int count;
krh@216	3047	};
krh@216	3048
krh@216	3049	struct razor_package_query *
krh@216	3050	razor_package_query_create(struct razor_set *set)
krh@216	3051	{
krh@216	3052	struct razor_package_query *pq;
krh@216	3053	int count;
krh@216	3054
krh@216	3055	pq = zalloc(sizeof *pq);
krh@216	3056	pq->set = set;
krh@216	3057	count = set->packages.size / sizeof(struct razor_package);
krh@216	3058	pq->vector = zalloc(count * sizeof(char));
krh@216	3059
krh@216	3060	return pq;
krh@216	3061	}
krh@216	3062
krh@216	3063	void
krh@216	3064	razor_package_query_add_package(struct razor_package_query *pq,
krh@216	3065	struct razor_package *p)
krh@216	3066	{
krh@216	3067	struct razor_package *packages;
krh@216	3068
krh@216	3069	packages = pq->set->packages.data;
krh@216	3070	pq->count += pq->vector[p - packages] ^ 1;
krh@216	3071	pq->vector[p - packages] = 1;
krh@216	3072	}
krh@216	3073
krh@216	3074	void
krh@216	3075	razor_package_query_add_iterator(struct razor_package_query *pq,
krh@216	3076	struct razor_package_iterator *pi)
krh@216	3077	{
krh@216	3078	struct razor_package packages, p;
krh@216	3079	const char name, version, *arch;
krh@216	3080
krh@216	3081	packages = pq->set->packages.data;
krh@216	3082	while (razor_package_iterator_next(pi, &p, &name, &version, &arch)) {
krh@216	3083	pq->count += pq->vector[p - packages] ^ 1;
krh@216	3084	pq->vector[p - packages] = 1;
krh@216	3085	}
krh@216	3086	}
krh@216	3087
krh@216	3088	struct razor_package_iterator *
krh@216	3089	razor_package_query_finish(struct razor_package_query *pq)
krh@216	3090	{
krh@216	3091	struct razor_package_iterator *pi;
krh@216	3092	struct razor_set *set;
krh@216	3093	struct list *index;
krh@216	3094	int i, j, count;
krh@216	3095
krh@216	3096	set = pq->set;
krh@216	3097	count = set->packages.size / sizeof(struct razor_package);
krh@216	3098	index = zalloc(pq->count * sizeof *index);
krh@216	3099
krh@216	3100	for (i = 0, j = 0; i < count; i++) {
krh@216	3101	if (!pq->vector[i])
krh@216	3102	continue;
krh@216	3103
krh@216	3104	index[j].data = i;
krh@216	3105	if (j == pq->count - 1)
krh@216	3106	index[j].flags = 0x80;
krh@216	3107	j++;
krh@216	3108	}
krh@216	3109
krh@216	3110	free(pq);
krh@216	3111
krh@216	3112	pi = razor_package_iterator_create_with_index(set, index);
krh@216	3113	pi->free_index = 1;
krh@216	3114
krh@216	3115	return pi;
krh@216	3116	}

author	James Bowes <jbowes@redhat.com>
	Sun Jun 15 10:50:32 2008 -0400 (2008-06-15)
changeset 227	6a47b5fc2791
parent 225	c51f49f38d18
child 228	8b9849d1e5b0
permissions	-rw-r--r--