solver.c 33.9 KB
Newer Older
1 2 3
/* solver.c - Alpine Package Keeper (APK)
 * A backtracking, forward checking dependency graph solver.
 *
4
 * Copyright (C) 2008-2011 Timo Teräs <timo.teras@iki.fi>
5 6 7 8 9 10 11 12 13 14 15 16 17
 * All rights reserved.
 *
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 as published
 * by the Free Software Foundation. See http://www.gnu.org/ for details.
 */

#include <stdlib.h>
#include "apk_defines.h"
#include "apk_database.h"
#include "apk_package.h"
#include "apk_solver.h"

Timo Teräs's avatar
Timo Teräs committed
18 19
#include "apk_print.h"

20 21 22 23 24 25 26 27 28 29 30
#if 0
#include <stdio.h>
#define dbg_printf(args...) fprintf(stderr, args)
#else
#define dbg_printf(args...)
#endif

#define APK_PKGSTF_NOINSTALL		0
#define APK_PKGSTF_INSTALL		1
#define APK_PKGSTF_BRANCH		2
#define APK_PKGSTF_ALT_BRANCH		4
31
#define APK_PKGSTF_INSTALLIF		8
32
#define APK_PKGSTF_DECIDED		16
33 34 35

struct apk_package_state {
	struct apk_package *backtrack;
36
	unsigned int topology_soft;
37 38
	unsigned short flags;
	unsigned short conflicts;
39
	unsigned short cur_unsatisfiable;
40 41 42 43 44 45
};

struct apk_name_state {
	struct list_head unsolved_list;
	struct apk_package *chosen;
	unsigned short requirers;
46
	unsigned short install_ifs;
Timo Teräs's avatar
Timo Teräs committed
47 48 49 50 51 52 53 54

	unsigned int solver_flags_local : 4;
	unsigned int solver_flags_local_mask : 4;
	unsigned int solver_flags_inherited : 4;

	unsigned int availability_checked : 1;
	unsigned int locked : 1;
	unsigned int no_options : 1;
55 56 57 58
};

struct apk_solver_state {
	struct apk_database *db;
59 60
	unsigned num_topology_positions;

61 62 63 64
	struct list_head unsolved_list_head;
	struct apk_package *latest_decision;
	unsigned int topology_position;
	unsigned int assigned_names;
65
	unsigned short cur_unsatisfiable;
66

Timo Teräs's avatar
Timo Teräs committed
67 68
	unsigned short solver_flags;

69
	struct apk_package_array *best_solution;
70
	unsigned short best_unsatisfiable;
71 72
};

73 74 75 76
static void apply_constraint(struct apk_solver_state *ss, struct apk_dependency *dep);
static void undo_constraint(struct apk_solver_state *ss, struct apk_dependency *dep);
static void push_decision(struct apk_solver_state *ss, struct apk_package *pkg,
			  int flags);
77

Timo Teräs's avatar
Timo Teräs committed
78
static struct apk_package_state *pkg_to_ps(struct apk_package *pkg)
79 80 81 82
{
	return (struct apk_package_state*) pkg->state_ptr;
}

Timo Teräs's avatar
Timo Teräs committed
83 84 85 86 87 88 89
static struct apk_name_state *name_to_ns(struct apk_name *name)
{
	if (name->state_ptr == NULL)
		name->state_ptr = calloc(1, sizeof(struct apk_name_state));
	return (struct apk_name_state*) name->state_ptr;
}

90 91 92 93 94 95 96 97 98 99 100
static inline int pkg_available(struct apk_database *db, struct apk_package *pkg)
{
	if (pkg->installed_size == 0)
		return TRUE;
	if (pkg->filename != NULL)
		return TRUE;
	if (apk_db_select_repo(db, pkg) != NULL)
		return TRUE;
	return FALSE;
}

101 102 103
static void foreach_dependency_pkg(
	struct apk_solver_state *ss, struct apk_dependency_array *depends,
	void (*cb)(struct apk_solver_state *ss, struct apk_package *dependency))
104 105 106
{
	int i, j;

107 108 109
	/* And sort the main dependencies */
	for (i = 0; i < depends->num; i++) {
		struct apk_dependency *dep = &depends->item[i];
110 111 112 113
		struct apk_name *name0 = dep->name;

		for (j = 0; j < name0->pkgs->num; j++) {
			struct apk_package *pkg0 = name0->pkgs->item[j];
114

115 116 117 118
			/* conflict depends on all to be not installed */
			if (dep->result_mask != APK_DEPMASK_CONFLICT &&
			    !apk_dep_is_satisfied(dep, pkg0))
				continue;
119 120

			cb(ss, pkg0);
121 122
		}
	}
123
}
124

125 126 127 128 129 130 131 132 133 134 135 136
static void foreach_rinstall_if_pkg(
	struct apk_solver_state *ss, struct apk_package *pkg,
	void (*cb)(struct apk_solver_state *ss, struct apk_package *rinstall_if))
{
	struct apk_name *name = pkg->name;
	int i, j, k;

	for (i = 0; i < pkg->name->rinstall_if->num; i++) {
		struct apk_name *name0 = pkg->name->rinstall_if->item[i];

		dbg_printf(PKG_VER_FMT ": rinstall_if %s\n",
			   PKG_VER_PRINTF(pkg), name0->name);
137

138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164
		for (j = 0; j < name0->pkgs->num; j++) {
			struct apk_package *pkg0 = name0->pkgs->item[j];

			for (k = 0; k < pkg0->install_if->num; k++) {
				struct apk_dependency *dep = &pkg0->install_if->item[k];
				if (dep->name == name &&
				    (dep->result_mask == APK_DEPMASK_CONFLICT ||
				     apk_dep_is_satisfied(dep, pkg)))
					break;
			}
			if (k >= pkg0->install_if->num)
				continue;

			/* pkg depends (via install_if) on pkg0 */
			cb(ss, pkg0);
		}
	}
}

static void sort_hard_dependencies(struct apk_solver_state *ss, struct apk_package *pkg)
{
	struct apk_package_state *ps;

	if (pkg->state_ptr == NULL)
		pkg->state_ptr = calloc(1, sizeof(struct apk_package_state));

	ps = pkg_to_ps(pkg);
165
	if (ps->topology_soft)
166
		return;
167
	pkg->topology_hard = -1;
168
	ps->topology_soft = -1;
169 170 171 172 173

	/* Consider hard dependencies only */
	foreach_dependency_pkg(ss, pkg->depends, sort_hard_dependencies);
	foreach_dependency_pkg(ss, pkg->install_if, sort_hard_dependencies);

174
	ps->topology_soft = pkg->topology_hard = ++ss->num_topology_positions;
175
	dbg_printf(PKG_VER_FMT ": topology_hard=%d\n",
176
		   PKG_VER_PRINTF(pkg), pkg->topology_hard);
177 178 179 180 181 182 183 184 185
}

static void sort_soft_dependencies(struct apk_solver_state *ss, struct apk_package *pkg)
{
	struct apk_package_state *ps;

	sort_hard_dependencies(ss, pkg);

	ps = pkg_to_ps(pkg);
186
	if (ps->topology_soft != pkg->topology_hard)
187
		return;
Timo Teräs's avatar
Timo Teräs committed
188
	ps->topology_soft = -1;
189 190 191 192 193 194 195 196 197

	/* Soft reverse dependencies aka. install_if */
	foreach_rinstall_if_pkg(ss, pkg, sort_hard_dependencies);
	foreach_dependency_pkg(ss, pkg->depends, sort_soft_dependencies);

	/* Assign a topology sorting order */
	ps->topology_soft = ++ss->num_topology_positions;
	dbg_printf(PKG_VER_FMT ": topology_soft=%d\n",
		   PKG_VER_PRINTF(pkg), ps->topology_soft);
198 199 200 201 202 203 204
}

static void sort_name(struct apk_solver_state *ss, struct apk_name *name)
{
	int i;

	for (i = 0; i < name->pkgs->num; i++)
205
		sort_soft_dependencies(ss, name->pkgs->item[i]);
206 207
}

208 209 210 211 212
static void prepare_name(struct apk_solver_state *ss, struct apk_name *name,
			 struct apk_name_state *ns)
{
	int i;

Timo Teräs's avatar
Timo Teräs committed
213
	if (ns->availability_checked)
214 215 216 217
		return;

	for (i = 0; i < name->pkgs->num; i++) {
		struct apk_package *pkg = name->pkgs->item[i];
218
		struct apk_package_state *ps = pkg_to_ps(pkg);
Timo Teräs's avatar
Timo Teräs committed
219
		struct apk_name_state *ns = name_to_ns(pkg->name);
220 221

		/* if package is needed for (re-)install */
Timo Teräs's avatar
Timo Teräs committed
222
		if ((pkg->ipkg == NULL) ||
Timo Teräs's avatar
Timo Teräs committed
223 224
		    ((ns->solver_flags_local | ns->solver_flags_inherited |
		      ss->solver_flags) & APK_SOLVERF_REINSTALL)) {
225 226
			/* and it's not available, we can't use it */
			if (!pkg_available(ss->db, pkg))
227
				ps->conflicts = 1024;
228 229 230
		}
	}

Timo Teräs's avatar
Timo Teräs committed
231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260
	ns->availability_checked = 1;
}

static void foreach_locked_reverse_dependency(
	struct apk_name *name,
	void (*cb)(struct apk_package *rdepend, void *ctx), void *ctx)
{
	int i, j;

	if (name == NULL)
		return;

	for (i = 0; i < name->rdepends->num; i++) {
		struct apk_name *name0 = name->rdepends->item[i];
		struct apk_name_state *ns0 = name_to_ns(name0);
		struct apk_package *pkg0 = ns0->chosen;

		if (!ns0->locked || ns0->chosen == NULL)
			continue;

		for (j = 0; j < pkg0->depends->num; j++) {
			struct apk_dependency *dep = &pkg0->depends->item[j];
			if (dep->name == name)
				break;
		}
		if (j >= pkg0->depends->num)
			continue;

		cb(pkg0, ctx);
	}
261 262
}

263 264
static void foreach_dependency(struct apk_solver_state *ss, struct apk_dependency_array *deps,
			       void (*func)(struct apk_solver_state *ss, struct apk_dependency *dep))
265
{
266
	int i;
267
	for (i = 0; i < deps->num; i++)
268
		func(ss, &deps->item[i]);
269 270
}

271
static int get_pkg_expansion_flags(struct apk_solver_state *ss, struct apk_package *pkg)
272 273
{
	struct apk_name *name = pkg->name;
274
	struct apk_name_state *ns = name_to_ns(name);
275
	int i, options = 0;
276 277 278

	/* check if the suggested package is the most preferred one of
	 * available packages for the name */
279
	for (i = 0; i < name->pkgs->num; i++) {
280
		struct apk_package *pkg0 = name->pkgs->item[i];
281
		struct apk_package_state *ps0 = pkg_to_ps(pkg0);
282

283
		if (pkg0 == pkg || ps0 == NULL ||
284
		    pkg0->topology_hard > ss->topology_position ||
285 286
		    (ps0->flags & APK_PKGSTF_DECIDED) ||
		    ps0->conflicts != 0)
287 288
			continue;

289 290
		options++;

Timo Teräs's avatar
Timo Teräs committed
291 292
		if ((ns->solver_flags_local | ns->solver_flags_inherited |
		     ss->solver_flags) & APK_SOLVERF_AVAILABLE) {
293 294
			/* pkg available, pkg0 not */
			if (pkg->repos != 0 && pkg0->repos == 0)
295
				continue;
296 297
			/* pkg0 available, pkg not */
			if (pkg0->repos != 0 && pkg->repos == 0)
298
				return APK_PKGSTF_NOINSTALL | APK_PKGSTF_BRANCH;
299 300
		}

Timo Teräs's avatar
Timo Teräs committed
301 302
		if ((ns->solver_flags_local | ns->solver_flags_inherited |
		     ss->solver_flags) & APK_SOLVERF_UPGRADE) {
303 304 305 306
			/* upgrading, or neither of the package is installed, so
			 * we just fall back comparing to versions */
			switch (apk_pkg_version_compare(pkg0, pkg)) {
			case APK_VERSION_GREATER:
307
				return APK_PKGSTF_NOINSTALL | APK_PKGSTF_BRANCH;
308 309 310
			case APK_VERSION_LESS:
				continue;
			}
311 312
		}

313 314
		/* not upgrading, prefer the installed package */
		if (pkg->ipkg == NULL && pkg0->ipkg != NULL)
315
			return APK_PKGSTF_NOINSTALL | APK_PKGSTF_BRANCH;
316 317
	}

318
	/* no package greater than the selected */
319 320 321 322 323
	if (options)
		return APK_PKGSTF_INSTALL | APK_PKGSTF_BRANCH;

	/* no other choice */
	return APK_PKGSTF_INSTALL;
324 325
}

326 327
static int install_if_missing(struct apk_solver_state *ss, struct apk_package *pkg)
{
Timo Teräs's avatar
Timo Teräs committed
328
	struct apk_name_state *ns;
329 330 331 332 333
	int i, missing = 0;

	for (i = 0; i < pkg->install_if->num; i++) {
		struct apk_dependency *dep = &pkg->install_if->item[i];

Timo Teräs's avatar
Timo Teräs committed
334
		ns = name_to_ns(dep->name);
Timo Teräs's avatar
Timo Teräs committed
335
		if (!ns->locked || !apk_dep_is_satisfied(dep, ns->chosen))
336 337 338 339 340 341
			missing++;
	}

	return missing;
}

342
static int update_name_state(struct apk_solver_state *ss,
343 344
			     struct apk_name *name, struct apk_name_state *ns,
			     int requirers_adjustment)
345
{
346 347
	struct apk_package *best_pkg = NULL;
	unsigned int best_topology = 0;
348
	int i, options = 0, skipped_options = 0;
349

350 351
	ns->requirers += requirers_adjustment;

352 353
	for (i = 0; i < name->pkgs->num; i++) {
		struct apk_package *pkg0 = name->pkgs->item[i];
354
		struct apk_package_state *ps0 = pkg_to_ps(pkg0);
355

356
		if (ps0 == NULL ||
357
		    pkg0->topology_hard >= ss->topology_position ||
358
		    (ps0->flags & APK_PKGSTF_DECIDED))
359 360
			continue;

361 362 363 364 365 366
		if (ns->requirers == 0 && ns->install_ifs != 0 &&
		    install_if_missing(ss, pkg0)) {
			skipped_options++;
			continue;
		}

367
		options++;
368 369 370
		if (ps0->topology_soft < ss->topology_position &&
		    ps0->topology_soft > best_topology)
			best_pkg = pkg0, best_topology = ps0->topology_soft;
371 372
		else if (pkg0->topology_hard > best_topology)
			best_pkg = pkg0, best_topology = pkg0->topology_hard;
373
	}
374

375
	if (options == 0 && skipped_options == 0) {
Timo Teräs's avatar
Timo Teräs committed
376
		if (!ns->no_options) {
377
			ss->cur_unsatisfiable += ns->requirers;
378 379
			if (ns->install_ifs)
				ss->cur_unsatisfiable++;
Timo Teräs's avatar
Timo Teräs committed
380
			ns->no_options = 1;
381 382 383 384
		} else if (requirers_adjustment > 0) {
			ss->cur_unsatisfiable += requirers_adjustment;
		}
	} else
Timo Teräs's avatar
Timo Teräs committed
385
		ns->no_options = 0;
386

387 388
	if ((options == 0 && skipped_options == 0) ||
	    (ns->requirers == 0 && ns->install_ifs == 0)) {
389 390 391 392 393
		if (list_hashed(&ns->unsolved_list)) {
			list_del(&ns->unsolved_list);
			list_init(&ns->unsolved_list);
			ns->chosen = NULL;
		}
394 395
		dbg_printf("%s: deleted from unsolved: %d requirers, %d install_ifs, %d options, %d skipped\n",
			   name->name, ns->requirers, ns->install_ifs, options, skipped_options);
396
	} else {
397 398 399
		dbg_printf("%s: added to unsolved: %d requirers, %d install_ifs, %d options (next topology %d)\n",
			   name->name, ns->requirers, ns->install_ifs, options,
			   best_topology);
400 401
		if (!list_hashed(&ns->unsolved_list))
			list_add(&ns->unsolved_list, &ss->unsolved_list_head);
402
		ns->chosen = best_pkg;
403 404
	}

405
	return options + skipped_options;
406 407
}

408 409 410 411
static void trigger_install_if(struct apk_solver_state *ss,
			       struct apk_package *pkg)
{
	if (install_if_missing(ss, pkg) == 0) {
Timo Teräs's avatar
Timo Teräs committed
412
		struct apk_name_state *ns = ns = name_to_ns(pkg->name);
413 414 415 416 417 418 419 420 421 422 423 424

		dbg_printf("trigger_install_if: " PKG_VER_FMT " triggered\n",
			   PKG_VER_PRINTF(pkg));
		ns->install_ifs++;
		update_name_state(ss, pkg->name, ns, 0);
	}
}

static void untrigger_install_if(struct apk_solver_state *ss,
			       struct apk_package *pkg)
{
	if (install_if_missing(ss, pkg) != 1) {
Timo Teräs's avatar
Timo Teräs committed
425
		struct apk_name_state *ns = name_to_ns(pkg->name);
426 427 428 429 430 431 432 433

		dbg_printf("untrigger_install_if: " PKG_VER_FMT " no longer triggered\n",
			   PKG_VER_PRINTF(pkg));
		ns->install_ifs--;
		update_name_state(ss, pkg->name, ns, 0);
	}
}

434 435 436
static void apply_decision(struct apk_solver_state *ss,
			   struct apk_package *pkg,
			   struct apk_package_state *ps)
437
{
Timo Teräs's avatar
Timo Teräs committed
438
	struct apk_name_state *ns = name_to_ns(pkg->name);
439 440 441 442 443 444

	dbg_printf("apply_decision: " PKG_VER_FMT " %s\n", PKG_VER_PRINTF(pkg),
		   (ps->flags & APK_PKGSTF_INSTALL) ? "INSTALL" : "NO_INSTALL");

	if (ps->flags & APK_PKGSTF_INSTALL) {
		ss->assigned_names++;
445
		ss->cur_unsatisfiable += ps->conflicts;
446
		ns->chosen = pkg;
Timo Teräs's avatar
Timo Teräs committed
447
		ns->locked = 1;
448 449 450 451 452 453 454

		list_del(&ns->unsolved_list);
		list_init(&ns->unsolved_list);
		dbg_printf("%s: deleting from unsolved list\n",
			   pkg->name->name);

		foreach_dependency(ss, pkg->depends, apply_constraint);
455
		foreach_rinstall_if_pkg(ss, pkg, trigger_install_if);
456
	} else {
457
		update_name_state(ss, pkg->name, ns, 0);
458 459 460 461 462 463 464
	}
}

static void undo_decision(struct apk_solver_state *ss,
			  struct apk_package *pkg,
			  struct apk_package_state *ps)
{
Timo Teräs's avatar
Timo Teräs committed
465
	struct apk_name_state *ns = name_to_ns(pkg->name);
466 467 468 469

	dbg_printf("undo_decision: " PKG_VER_FMT " %s\n", PKG_VER_PRINTF(pkg),
		   (ps->flags & APK_PKGSTF_INSTALL) ? "INSTALL" : "NO_INSTALL");

470 471 472
	if (ps->flags & APK_PKGSTF_INSTALLIF)
		ss->topology_position = ps->topology_soft;
	else
473
		ss->topology_position = pkg->topology_hard;
474

475 476
	if (ps->flags & APK_PKGSTF_INSTALL) {
		ss->assigned_names--;
477 478

		foreach_rinstall_if_pkg(ss, pkg, untrigger_install_if);
479 480
		foreach_dependency(ss, pkg->depends, undo_constraint);

Timo Teräs's avatar
Timo Teräs committed
481
		ns->locked = 0;
482
		ns->chosen = NULL;
483
	}
484

485
	ss->cur_unsatisfiable = ps->cur_unsatisfiable;
486
	update_name_state(ss, pkg->name, ns, 0);
487 488
}

489 490
static void push_decision(struct apk_solver_state *ss, struct apk_package *pkg,
			  int flags)
491
{
492
	struct apk_package_state *ps = pkg_to_ps(pkg);
493 494

	ps->backtrack = ss->latest_decision;
495
	ps->flags = flags | APK_PKGSTF_DECIDED;
496
	ps->cur_unsatisfiable = ss->cur_unsatisfiable;
497 498 499 500 501 502 503

	if (ps->topology_soft < ss->topology_position) {
		if (flags & APK_PKGSTF_INSTALL)
			ps->flags |= APK_PKGSTF_INSTALLIF;
		ss->topology_position = ps->topology_soft;
	} else {
		ps->flags &= ~APK_PKGSTF_INSTALLIF;
504
		ss->topology_position = pkg->topology_hard;
505
	}
506
	ss->latest_decision = pkg;
507

508 509 510 511 512 513
	if (flags & APK_PKGSTF_BRANCH) {
		dbg_printf("push_decision: adding new BRANCH at topology_position %d\n",
			   ss->topology_position);
	} else
		ps->flags |= APK_PKGSTF_ALT_BRANCH;

514 515 516 517
	if (ps->flags & APK_PKGSTF_INSTALLIF)
		dbg_printf("triggers due to " PKG_VER_FMT "\n",
			   PKG_VER_PRINTF(pkg));

518
	apply_decision(ss, pkg, ps);
519 520 521 522 523 524 525
}

static int next_branch(struct apk_solver_state *ss)
{
	struct apk_package *pkg;
	struct apk_package_state *ps;

526
	while (ss->latest_decision != NULL) {
527
		pkg = ss->latest_decision;
528
		ps = pkg_to_ps(pkg);
529 530 531 532 533
		undo_decision(ss, pkg, ps);

		if (ps->flags & APK_PKGSTF_ALT_BRANCH) {
			dbg_printf("next_branch: undo decision at topology_position %d\n",
				   ss->topology_position);
534 535
			ps->flags &= ~(APK_PKGSTF_ALT_BRANCH | APK_PKGSTF_DECIDED);
			ss->latest_decision = ps->backtrack;
536 537 538 539 540 541 542
		} else {
			dbg_printf("next_branch: swapping BRANCH at topology_position %d\n",
				   ss->topology_position);

			ps->flags |= APK_PKGSTF_ALT_BRANCH;
			ps->flags ^= APK_PKGSTF_INSTALL;

543 544
			apply_decision(ss, pkg, ps);
			return 0;
545 546
		}
	}
547 548 549

	dbg_printf("next_branch: no more branches\n");
	return 1;
550 551
}

Timo Teräs's avatar
Timo Teräs committed
552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
static void inherit_name_state(struct apk_name *to, struct apk_name *from)
{
	struct apk_name_state *tns = name_to_ns(to);
	struct apk_name_state *fns = name_to_ns(from);

	tns->solver_flags_inherited |=
		fns->solver_flags_inherited |
		(fns->solver_flags_local & fns->solver_flags_local_mask);
}

static void inherit_name_state_wrapper(struct apk_package *rdepend, void *ctx)
{
	struct apk_name *name = (struct apk_name *) ctx;
	inherit_name_state(name, rdepend->name);
}

static int has_inherited_state(struct apk_name *name)
{
	struct apk_name_state *ns = name_to_ns(name);

	if (name == NULL)
		return 0;
	if (ns->solver_flags_inherited || (ns->solver_flags_local & ns->solver_flags_local_mask))
		return 1;
	return 0;
}

static void recalculate_inherted_name_state(struct apk_name *name)
{
	struct apk_name_state *ns = name_to_ns(name);

	ns->solver_flags_inherited = 0;
	foreach_locked_reverse_dependency(name, inherit_name_state_wrapper, name);
}

587
static void apply_constraint(struct apk_solver_state *ss, struct apk_dependency *dep)
588 589
{
	struct apk_name *name = dep->name;
Timo Teräs's avatar
Timo Teräs committed
590
	struct apk_name_state *ns = name_to_ns(name);
591
	int i;
592

593
	prepare_name(ss, name, ns);
594

Timo Teräs's avatar
Timo Teräs committed
595
	if (ns->locked) {
596 597 598
		dbg_printf(PKG_VER_FMT " selected already for %s\n",
			   PKG_VER_PRINTF(ns->chosen), dep->name->name);
		if (!apk_dep_is_satisfied(dep, ns->chosen))
599
			ss->cur_unsatisfiable++;
600 601 602
		return;
	}

603 604
	for (i = 0; i < name->pkgs->num; i++) {
		struct apk_package *pkg0 = name->pkgs->item[i];
605
		struct apk_package_state *ps0 = pkg_to_ps(pkg0);
606

607
		if (ps0 == NULL ||
608
		    pkg0->topology_hard >= ss->topology_position)
609 610 611 612 613 614 615 616 617 618
			continue;

		if (!apk_dep_is_satisfied(dep, pkg0)) {
			ps0->conflicts++;
			dbg_printf(PKG_VER_FMT ": conflicts++ -> %d\n",
				   PKG_VER_PRINTF(pkg0),
				   ps0->conflicts);
		}
	}

Timo Teräs's avatar
Timo Teräs committed
619 620 621
	if (ss->latest_decision != NULL)
		inherit_name_state(name, ss->latest_decision->name);

622 623
	update_name_state(ss, name, ns,
			  (dep->result_mask != APK_DEPMASK_CONFLICT) ? 1 : 0);
624 625
}

626
static void undo_constraint(struct apk_solver_state *ss, struct apk_dependency *dep)
627 628
{
	struct apk_name *name = dep->name;
Timo Teräs's avatar
Timo Teräs committed
629
	struct apk_name_state *ns = name_to_ns(name);
630 631
	int i;

Timo Teräs's avatar
Timo Teräs committed
632
	if (ns->locked) {
633 634 635 636
		dbg_printf(PKG_VER_FMT " selected already for %s\n",
			   PKG_VER_PRINTF(ns->chosen), dep->name->name);
		return;
	}
637 638 639

	for (i = 0; i < name->pkgs->num; i++) {
		struct apk_package *pkg0 = name->pkgs->item[i];
640
		struct apk_package_state *ps0 = pkg_to_ps(pkg0);
641

642
		if (pkg0->topology_hard >= ss->topology_position)
643 644 645 646 647 648 649 650 651 652
			continue;

		if (!apk_dep_is_satisfied(dep, pkg0)) {
			ps0->conflicts--;
			dbg_printf(PKG_VER_FMT ": conflicts-- -> %d\n",
				   PKG_VER_PRINTF(pkg0),
				   ps0->conflicts);
		}
	}

Timo Teräs's avatar
Timo Teräs committed
653 654 655
	if (ss->latest_decision && has_inherited_state(ss->latest_decision->name))
		recalculate_inherted_name_state(name);

656 657
	update_name_state(ss, name, ns,
		(dep->result_mask != APK_DEPMASK_CONFLICT) ? -1 : 0);
658 659 660 661
}

static int expand_branch(struct apk_solver_state *ss)
{
662 663
	struct apk_name_state *ns;
	struct apk_package *pkg0 = NULL;
664
	unsigned int topology0 = 0;
665 666 667

	/* FIXME: change unsolved_list to a priority queue */
	list_for_each_entry(ns, &ss->unsolved_list_head, unsolved_list) {
668 669 670 671 672 673 674 675 676
		/* ns->chosen can be NULL if the name has only install_if
		 * requirers that got later conflicted, but it still has
		 * other options that can get activated later due to more
		 * complicated install_if rules in some other package. */
		if (ns->chosen == NULL)
			continue;
		if (pkg_to_ps(ns->chosen)->topology_soft < ss->topology_position &&
		    pkg_to_ps(ns->chosen)->topology_soft > topology0)
			pkg0 = ns->chosen, topology0 = pkg_to_ps(pkg0)->topology_soft;
677 678
		else if (ns->chosen->topology_hard > topology0)
			pkg0 = ns->chosen, topology0 = pkg0->topology_hard;
679 680 681 682 683 684
	}
	if (pkg0 == NULL) {
		dbg_printf("expand_branch: list is empty (%d unsatisfied)\n",
			   ss->cur_unsatisfiable);
		return 1;
	}
685

686 687
	/* someone needs to provide this name -- find next eligible
	 * provider candidate */
Timo Teräs's avatar
Timo Teräs committed
688
	ns = name_to_ns(pkg0->name);
689
	dbg_printf("expand_branch: %s\n", pkg0->name->name);
690

691
	push_decision(ss, pkg0, get_pkg_expansion_flags(ss, pkg0));
692 693 694 695 696 697 698 699 700 701 702 703 704 705 706

	return 0;
}

static void record_solution(struct apk_solver_state *ss)
{
	struct apk_package *pkg;
	struct apk_package_state *ps;
	int i;

	apk_package_array_resize(&ss->best_solution, ss->assigned_names);

	i = 0;
	pkg = ss->latest_decision;
	while (pkg != NULL) {
707
		ps = pkg_to_ps(pkg);
708 709 710
		if (ps->flags & APK_PKGSTF_INSTALL) {
			if (i >= ss->assigned_names)
				abort();
711
			ss->best_solution->item[i++] = pkg;
712
		}
713 714 715 716 717 718 719

		dbg_printf("record_solution: " PKG_VER_FMT ": %sINSTALL\n",
			   PKG_VER_PRINTF(pkg),
			   (ps->flags & APK_PKGSTF_INSTALL) ? "" : "NO_");

		pkg = ps->backtrack;
	}
720 721 722 723 724 725 726 727 728 729
	apk_package_array_resize(&ss->best_solution, i);
	ss->best_unsatisfiable = ss->cur_unsatisfiable;
}

static int compare_package_name(const void *p1, const void *p2)
{
	const struct apk_package **c1 = (const struct apk_package **) p1;
	const struct apk_package **c2 = (const struct apk_package **) p2;

	return strcmp((*c1)->name->name, (*c2)->name->name);
730 731
}

Timo Teräs's avatar
Timo Teräs committed
732 733 734 735 736 737 738 739
static int compare_change(const void *p1, const void *p2)
{
	const struct apk_change *c1 = (const struct apk_change *) p1;
	const struct apk_change *c2 = (const struct apk_change *) p2;

	if (c1->newpkg == NULL) {
		if (c2->newpkg == NULL)
			/* both deleted - reverse topology order */
740 741
			return  c2->oldpkg->topology_hard -
				c1->oldpkg->topology_hard;
Timo Teräs's avatar
Timo Teräs committed
742 743 744 745 746 747 748 749

		/* c1 deleted, c2 installed -> c2 first*/
		return -1;
	}
	if (c2->newpkg == NULL)
		/* c1 installed, c2 deleted -> c1 first*/
		return 1;

750 751
	return  c1->newpkg->topology_hard -
		c2->newpkg->topology_hard;
Timo Teräs's avatar
Timo Teräs committed
752 753 754 755
}

static int generate_changeset(struct apk_database *db,
			      struct apk_package_array *solution,
756 757
			      struct apk_changeset *changeset,
			      unsigned short solver_flags)
Timo Teräs's avatar
Timo Teräs committed
758 759 760 761 762 763 764 765 766 767
{
	struct apk_name *name;
	struct apk_name_state *ns;
	struct apk_package *pkg, *pkg0;
	struct apk_installed_package *ipkg;
	int i, j, num_installs = 0, num_removed = 0, ci = 0;

	/* calculate change set size */
	for (i = 0; i < solution->num; i++) {
		pkg = solution->item[i];
Timo Teräs's avatar
Timo Teräs committed
768
		ns = name_to_ns(pkg->name);
Timo Teräs's avatar
Timo Teräs committed
769
		if ((pkg->ipkg == NULL) ||
Timo Teräs's avatar
Timo Teräs committed
770 771
		    ((ns->solver_flags_local | ns->solver_flags_inherited |
		      solver_flags) & APK_SOLVERF_REINSTALL))
Timo Teräs's avatar
Timo Teräs committed
772 773 774 775 776
			num_installs++;
	}
	list_for_each_entry(ipkg, &db->installed.packages, installed_pkgs_list) {
		name = ipkg->pkg->name;
		ns = name_to_ns(name);
Timo Teräs's avatar
Timo Teräs committed
777
		if ((ns->chosen == NULL) || !ns->locked)
Timo Teräs's avatar
Timo Teräs committed
778 779 780 781 782 783 784 785
			num_removed++;
	}

	/* construct changeset */
	apk_change_array_resize(&changeset->changes, num_installs + num_removed);
	list_for_each_entry(ipkg, &db->installed.packages, installed_pkgs_list) {
		name = ipkg->pkg->name;
		ns = name_to_ns(name);
Timo Teräs's avatar
Timo Teräs committed
786
		if ((ns->chosen == NULL) || !ns->locked) {
Timo Teräs's avatar
Timo Teräs committed
787 788 789 790 791 792 793
			changeset->changes->item[ci].oldpkg = ipkg->pkg;
			ci++;
		}
	}
	for (i = 0; i < solution->num; i++) {
		pkg = solution->item[i];
		name = pkg->name;
Timo Teräs's avatar
Timo Teräs committed
794
		ns = name_to_ns(name);
Timo Teräs's avatar
Timo Teräs committed
795 796

		if ((pkg->ipkg == NULL) ||
Timo Teräs's avatar
Timo Teräs committed
797 798
		    ((ns->solver_flags_local | ns->solver_flags_inherited |
		      solver_flags) & APK_SOLVERF_REINSTALL)) {
Timo Teräs's avatar
Timo Teräs committed
799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828
			for (j = 0; j < name->pkgs->num; j++) {
				pkg0 = name->pkgs->item[j];
				if (pkg0->ipkg == NULL)
					continue;
				changeset->changes->item[ci].oldpkg = pkg0;
				break;
			}
			changeset->changes->item[ci].newpkg = pkg;
			ci++;
		}
	}

	/* sort changeset to topology order */
	qsort(changeset->changes->item, changeset->changes->num,
	      sizeof(struct apk_change), compare_change);

	return 0;
}

static int free_state(apk_hash_item item, void *ctx)
{
	struct apk_name *name = (struct apk_name *) item;

	if (name->state_ptr != NULL) {
		free(name->state_ptr);
		name->state_ptr = NULL;
	}
	return 0;
}

829 830 831 832 833 834 835 836 837 838 839
static int free_package(apk_hash_item item, void *ctx)
{
	struct apk_package *pkg = (struct apk_package *) item;

	if (pkg->state_ptr != NULL) {
		free(pkg->state_ptr);
		pkg->state_ptr = NULL;
	}
	return 0;
}

840
void apk_solver_set_name_flags(struct apk_name *name,
Timo Teräs's avatar
Timo Teräs committed
841 842
			       unsigned short solver_flags,
			       unsigned short solver_flags_inheritable)
843 844
{
	struct apk_name_state *ns = name_to_ns(name);
Timo Teräs's avatar
Timo Teräs committed
845 846
	ns->solver_flags_local = solver_flags;
	ns->solver_flags_local_mask = solver_flags_inheritable;
847 848
}

849 850 851 852 853 854
static void apk_solver_free(struct apk_database *db)
{
	apk_hash_foreach(&db->available.names, free_state, NULL);
	apk_hash_foreach(&db->available.packages, free_package, NULL);
}

Timo Teräs's avatar
Timo Teräs committed
855 856 857 858 859
int apk_solver_solve(struct apk_database *db,
		     unsigned short solver_flags,
		     struct apk_dependency_array *world,
		     struct apk_package_array **solution,
		     struct apk_changeset *changeset)
860 861
{
	struct apk_solver_state *ss;
Timo Teräs's avatar
Timo Teräs committed
862
	struct apk_installed_package *ipkg;
863
	int i, r;
864 865 866

	ss = calloc(1, sizeof(struct apk_solver_state));
	ss->db = db;
Timo Teräs's avatar
Timo Teräs committed
867
	ss->solver_flags = solver_flags;
868
	ss->topology_position = -1;
869
	ss->best_unsatisfiable = -1;
870
	list_init(&ss->unsolved_list_head);
871 872 873

	for (i = 0; i < world->num; i++)
		sort_name(ss, world->item[i].name);
Timo Teräs's avatar
Timo Teräs committed
874 875
	list_for_each_entry(ipkg, &db->installed.packages, installed_pkgs_list)
		sort_name(ss, ipkg->pkg->name);
876

877 878
	foreach_dependency(ss, world, apply_constraint);
	do {
Timo Teräs's avatar
Timo Teräs committed
879
		if (ss->cur_unsatisfiable < ss->best_unsatisfiable) {
880 881
			r = expand_branch(ss);
			if (r) {
882 883
				dbg_printf("solution with %d unsatisfiable\n",
					   ss->cur_unsatisfiable);
884 885 886 887 888 889 890 891 892 893 894 895 896
				if (ss->cur_unsatisfiable == 0) {
					/* found solution - it is optimal because we permutate
					 * each preferred local option first, and permutations
					 * happen in topologally sorted order. */
					r = 0;
					break;
				}
				if (ss->cur_unsatisfiable < ss->best_unsatisfiable)
					record_solution(ss);
				r = next_branch(ss);
			}
		} else {
			r = next_branch(ss);
897
		}
898
	} while (r == 0);
899 900

	/* collect packages */
901
	if (r == 0 && ss->cur_unsatisfiable == 0) {
902
		record_solution(ss);
Timo Teräs's avatar
Timo Teräs committed
903
		if (changeset != NULL)
904 905
			generate_changeset(db, ss->best_solution, changeset,
					   ss->solver_flags);
906
		r = 0;
Timo Teräs's avatar
Timo Teräs committed
907
	} else {
908 909 910
		qsort(ss->best_solution->item, ss->best_solution->num,
		      sizeof(struct apk_package *), compare_package_name);
		r = ss->best_unsatisfiable;
Timo Teräs's avatar
Timo Teräs committed
911 912 913 914 915 916
	}

	if (solution != NULL)
		*solution = ss->best_solution;
	else
		apk_package_array_free(&ss->best_solution);
917

918
	apk_solver_free(db);
919 920 921 922 923
	free(ss);

	return r;
}

Timo Teräs's avatar
Timo Teräs committed
924 925 926
static void print_change(struct apk_database *db,
			 struct apk_change *change,
			 int cur, int total)
927
{
Timo Teräs's avatar
Timo Teräs committed
928 929 930 931 932 933
	struct apk_name *name;
	struct apk_package *oldpkg = change->oldpkg;
	struct apk_package *newpkg = change->newpkg;
	const char *msg = NULL;
	char status[64];
	int r;
934

Timo Teräs's avatar
Timo Teräs committed
935 936
	snprintf(status, sizeof(status), "(%i/%i)", cur+1, total);
	status[sizeof(status) - 1] = '\0';
937

Timo Teräs's avatar
Timo Teräs committed
938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970
	if (oldpkg != NULL)
		name = oldpkg->name;
	else
		name = newpkg->name;

	if (oldpkg == NULL) {
		apk_message("%s Installing %s (" BLOB_FMT ")",
			    status, name->name,
			    BLOB_PRINTF(*newpkg->version));
	} else if (newpkg == NULL) {
		apk_message("%s Purging %s (" BLOB_FMT ")",
			    status, name->name,
			    BLOB_PRINTF(*oldpkg->version));
	} else {
		r = apk_pkg_version_compare(newpkg, oldpkg);
		switch (r) {
		case APK_VERSION_LESS:
			msg = "Downgrading";
			break;
		case APK_VERSION_EQUAL:
			if (newpkg == oldpkg)
				msg = "Re-installing";
			else
				msg = "Replacing";
			break;
		case APK_VERSION_GREATER:
			msg = "Upgrading";
			break;
		}
		apk_message("%s %s %s (" BLOB_FMT " -> " BLOB_FMT ")",
			    status, msg, name->name,
			    BLOB_PRINTF(*oldpkg->version),
			    BLOB_PRINTF(*newpkg->version));
971
	}
Timo Teräs's avatar
Timo Teräs committed
972
}
973

Timo Teräs's avatar
Timo Teräs committed
974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001
struct apk_stats {
	unsigned int bytes;
	unsigned int packages;
};

static void count_change(struct apk_change *change, struct apk_stats *stats)
{
	if (change->newpkg != NULL) {
		stats->bytes += change->newpkg->installed_size;
		stats->packages ++;
	}
	if (change->oldpkg != NULL)
		stats->packages ++;
}

static void draw_progress(int percent)
{
	const int bar_width = apk_get_screen_width() - 7;
	int i;

	fprintf(stderr, "\e7%3i%% [", percent);
	for (i = 0; i < bar_width * percent / 100; i++)
		fputc('#', stderr);
	for (; i < bar_width; i++)
		fputc(' ', stderr);
	fputc(']', stderr);
	fflush(stderr);
	fputs("\e8\e[0K", stderr);
1002 1003
}

Timo Teräs's avatar
Timo Teräs committed
1004 1005 1006 1007 1008 1009 1010 1011
struct progress {
	struct apk_stats done;
	struct apk_stats total;
	struct apk_package *pkg;
	size_t count;
};

static void progress_cb(void *ctx, size_t progress)
1012
{
Timo Teräs's avatar
Timo Teräs committed
1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031
	struct progress *prog = (struct progress *) ctx;
	size_t partial = 0, count;

	if (prog->pkg != NULL)
		partial = muldiv(progress, prog->pkg->installed_size, APK_PROGRESS_SCALE);

        count = muldiv(100, prog->done.bytes + prog->done.packages + partial,
		       prog->total.bytes + prog->total.packages);

	if (prog->count != count)
		draw_progress(count);
	prog->count = count;
}

static int dump_packages(struct apk_changeset *changeset,
			 int (*cmp)(struct apk_change *change),
			 const char *msg)
{
	struct apk_change *change;
1032
	struct apk_name *name;
1033
	struct apk_indent indent = { .indent = 2 };
Timo Teräs's avatar
Timo Teräs committed
1034
	int match = 0, i;
1035

Timo Teräs's avatar
Timo Teräs committed
1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048
	for (i = 0; i < changeset->changes->num; i++) {
		change = &changeset->changes->item[i];
		if (!cmp(change))
			continue;
		if (match == 0)
			printf("%s:\n ", msg);
		if (change->newpkg != NULL)
			name = change->newpkg->name;
		else
			name = change->oldpkg->name;

		apk_print_indented(&indent, APK_BLOB_STR(name->name));
		match++;
1049
	}
Timo Teräs's avatar
Timo Teräs committed
1050 1051 1052 1053
	if (match)
		printf("\n");
	return match;
}
1054

Timo Teräs's avatar
Timo Teräs committed
1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091
static int cmp_remove(struct apk_change *change)
{
	return change->newpkg == NULL;
}

static int cmp_new(struct apk_change *change)
{
	return change->oldpkg == NULL;
}

static int cmp_downgrade(struct apk_change *change)
{
	if (change->newpkg == NULL || change->oldpkg == NULL)
		return 0;
	if (apk_pkg_version_compare(change->newpkg, change->oldpkg)
	    & APK_VERSION_LESS)
		return 1;
	return 0;
}

static int cmp_upgrade(struct apk_change *change)
{
	if (change->newpkg == NULL || change->oldpkg == NULL)
		return 0;

	/* Count swapping package as upgrade too - this can happen if
	 * same package version is used after it was rebuilt against
	 * newer libraries. Basically, different (and probably newer)
	 * package, but equal version number. */
	if ((apk_pkg_version_compare(change->newpkg, change->oldpkg) &
	     (APK_VERSION_GREATER | APK_VERSION_EQUAL)) &&
	    (change->newpkg != change->oldpkg))
		return 1;

	return 0;
}

1092 1093 1094 1095 1096
static int compare_package(const void *p1, const void *p2)
{
	struct apk_package *pkg1 = *(struct apk_package **) p1;
	struct apk_package *pkg2 = *(struct apk_package **) p2;

1097
	return pkg1->topology_hard - pkg2->topology_hard;
1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123
}

static void run_triggers(struct apk_database *db)
{
	struct apk_package_array *pkgs;
	int i;

	pkgs = apk_db_get_pending_triggers(db);
	if (pkgs == NULL || pkgs->num == 0)
		return;

	qsort(pkgs->item, pkgs->num, sizeof(struct apk_package *),
	      compare_package);

	for (i = 0; i < pkgs->num; i++) {
		struct apk_package *pkg = pkgs->item[i];
		struct apk_installed_package *ipkg = pkg->ipkg;

		*apk_string_array_add(&ipkg->pending_triggers) = NULL;
		apk_ipkg_run_script(ipkg, db, APK_SCRIPT_TRIGGER,
				    ipkg->pending_triggers->item);
		apk_string_array_free(&ipkg->pending_triggers);
	}
	apk_package_array_free(&pkgs);
}

1124 1125 1126
int apk_solver_commit_changeset(struct apk_database *db,
				struct apk_changeset *changeset,
				struct apk_dependency_array *world)
Timo Teräs's avatar
Timo Teräs committed
1127 1128 1129 1130 1131
{
	struct progress prog;
	struct apk_change *change;
	int i, r = 0, size_diff = 0;

1132 1133 1134
	if (changeset->changes == NULL)
		goto all_done;

Timo Teräs's avatar
Timo Teräs committed
1135 1136 1137 1138 1139