aboutsummaryrefslogtreecommitdiffstats
path: root/src/solver.c
Commit message (Collapse)AuthorAgeFilesLines
...
* solver: various fixesTimo Teräs2012-10-031-14/+58
| | | | | | | | | | | | | * push_decision expects to always get the package primary 'name' as apk_name. ASSERT that and fix problem cases. (though - this might need to be reverted, and store the non primary name in apk_decision instead to accomodate for better backtracking optimizations) * fix error reporting of virtual package names * make 'assign_name' errors soft. the incorrect packages just are no longer consider instead of aborting whole calculation. * fix backtracking of virtual packages that are not depended directly
* solver: improve assert error messagesNatanael Copa2012-10-031-2/+3
| | | | Print name of package and void double "ERROR"
* solver: fix compile with -Werror on 64bitNatanael Copa2012-10-031-1/+1
|
* apk: implement --progress-fd to write progress to a specified fdTimo Teräs2012-09-201-17/+27
|
* solver: fix install_if triggers on cyclic and early depsTimo Teräs2012-04-271-11/+15
|
* solver: fix backtracking with install_if dependenciesTimo Teräs2012-04-271-17/+20
|
* solver: fix a type from previous commitTimo Teräs2012-03-311-1/+1
|
* solver: fix installation of non-repository packagesTimo Teräs2012-03-311-1/+2
|
* solver: properly set allowed flag for installed packagesTimo Teräs2012-03-011-3/+6
|
* solver: rename some fieldsTimo Teräs2012-02-291-24/+25
|
* solver: merge apk_name_state to apk_nameTimo Teräs2012-02-291-223/+136
| | | | | | | apk_name_state is now quite small; and we avoid overhead of two pointers (+ malloc overhead) when we just make it part of apk_name. It also fixes some problems (that got introduced) where apk_name_state was not allocated.
* solver, test: make conflicts unconditionalTimo Teräs2012-02-291-13/+36
| | | | | | | Solver will now never report partial solution where a conflict constraint is not satisfied. The is because with --force we might install the partial solution; and if conflicted packages were to be installed we might have extra trouble.
* solver: ask confirmation in interactive mode only if there's changesTimo Teräs2012-02-281-1/+2
|
* solver: do not consider non-allowed packages in main loopTimo Teräs2012-02-281-43/+32
| | | | | Instead cache the allowed pinning decision, and use it. Update install decision heuristic to also use this cached information.
* solver: consider provided names also for preferenceTimo Teräs2012-02-281-2/+13
| | | | ref #574
* solver: fix conflicting provides detectionTimo Teräs2012-02-281-2/+15
| | | | ref #574
* solver: allow multiple packages with same virtual providesTimo Teräs2012-02-281-8/+14
| | | | ref #574
* solver, test: implements more provides things, add testsTimo Teräs2012-02-271-30/+92
| | | | ref #574
* solver: have most inherited things per-package and clean upsTimo Teräs2012-02-271-156/+168
| | | | | | Required for provides support as package might be pulled in via non-primary package name. This allows relatively easily to pass through inherited flags via the provided names. ref #574.
* solver: remove minimum penalty logicTimo Teräs2012-02-271-49/+7
| | | | | | | | | Reasoning: - it is less useful now that we do not do common dependency merging - provides support would make the required logic overly complicated - callgrind reports that depending on the case it can improve or decrease performance (the overhead pays off only in some cases); the difference is not large either way
* solver, dot: elementary provides fixesTimo Teräs2012-02-241-21/+57
| | | | | | implementation is still not near finished, but now at least it can handle it to a minimum degree. many cases are not done right yet, though. ref #574.
* all: introduce apk_provides and use it in apk_nameTimo Teräs2012-02-241-73/+79
| | | | | | | in preparation for provides support. implements also some dependency satisfaction helper routines. ref #574.
* solver: unallowed pinning is worse than changing installed packageTimo Teräs2012-02-241-10/+7
|
* solver: non preferred actions are worse then non preferred pinningTimo Teräs2012-02-241-6/+16
| | | | | | | | Otherwise we might start to change packages unexpectedly when not upgrading. This also fixes some other things the solver might've decided to do. Add also few test cases to detect bad behaviour.
* test: improve pinning testsTimo Teräs2012-02-241-1/+4
|
* solver: fix output of broken dependenciesTimo Teräs2012-02-231-1/+1
|
* solver: report size difference in kibi- or mebibytesTimo Teräs2012-02-231-5/+11
|
* solver: lock early names that have only single option leftTimo Teräs2012-02-221-3/+13
| | | | care is needed to get the score right.
* solver: lazily update name state in main loopTimo Teräs2012-02-221-171/+125
|
* solver: handle fix/reinstall betterTimo Teräs2012-02-221-30/+36
| | | | | | | | | | In case someone did "fix --force" for package for which we have no APK available, we would uninstall the package instead of silently ignoring the request. This could mean worse things. So now we just consider unavailable packages a bad deal for reinstall requests. And will downgrade if necessary. But if we really don't have any APK available, we just skip the request but report it.
* solver: transitive dependency requiringTimo Teräs2012-02-221-12/+41
| | | | | | | | | | | If n+1 packages depend A, and A depend on B. Add n+1 dependencies to B. Otherwise if someone conflicts B, B might be left out. Leaving package unassigned is no longer a non-preferred action, this fixes the final test case that was failing. And with --force we might even install that scenario. Add also some debug checks.
* solver: remove dependency merging; it's not worth itTimo Teräs2012-02-221-77/+4
| | | | | | callgrind says it's more overhead than improvement. back jumping effectively prunes all bad trees. but can be added later if it becomes needed; due to e.g. provides support.
* db, solver, io: scan cache items at startupTimo Teräs2012-02-221-42/+36
| | | | | | It is faster to just scan the cache directory for existing packages at startup than trying to faccessat() them on demand. It also makes quite a few parts of the code more readable and simpler.
* solver: make apk_score a 64-bit int for speedTimo Teräs2012-02-211-9/+49
|
* solver: remove unneeded flagTimo Teräs2012-02-211-4/+1
|
* solver: implement backwards jumping and various other optimizationsTimo Teräs2012-02-211-149/+215
|
* solver: rewrite backtracking and scoring systemTimo Teräs2012-02-201-406/+690
| | | | | | | | | | | | | | | * properly do absolute scoring now, the previous scoring where preference could get reduced could have caused incorrect early pruning of search tree * backtracking is now separated from package state, and first branching point is the decision if a name is left unassigned or if something _has_ to be assigned. this allows multiple future search tree optimizations like handling of common dependencies early. * merge common dependency names early to provide deeper forward checking.
* apk: fix some unharmful leaks reported by valgrindTimo Teräs2012-02-171-0/+1
|
* solver: get rid of saved score in backtrackingTimo Teräs2012-02-171-41/+57
| | | | also, discover late if package is needed or not.
* solver: convert some package state flags to bitfieldsTimo Teräs2012-02-161-11/+13
|
* solver: name's unlocked chosen is always next package getting lockedTimo Teräs2012-02-161-35/+28
| | | | | | | Instead of "skipping" certain packages, we include them as-if required, and at expansion time we decide if they actually need to be considered for installation. This cleans up the expansion main loop a little bit and makes the code work together better.
* solver: rework internals a bitTimo Teräs2012-02-161-138/+190
| | | | | | | | * cleaned up little bit on the internal state machine * the decision applying mechanism now aborts early to avoid work if we are approaching bad solution candidate * package availability checking is now done on-demand; which could still be improved
* solver: fix allowed pinning calculationTimo Teräs2012-02-161-2/+2
|
* solver: record repository tag, and flags in solutionTimo Teräs2012-02-161-55/+92
| | | | | name state could get overwritten later, so we can't use that when generating the changeset.
* solver: remove an unneeded name state variableTimo Teräs2012-02-161-5/+0
|
* solver, db: repository pinning improvementsTimo Teräs2012-02-151-48/+73
| | | | | | | | * solver internally calculates now using tags; not repository masks * installeddb now contains the tag name where the package came from -> we can now handle upgrades properly * the pinning is still a preference, and not strictly enforced; versioned dependencies may overrule preference
* solver: fix regression from "calculate branch minimum penalty early"Timo Teräs2012-01-201-7/+21
| | | | | | | Forgot to reset per-name penalty when it got locked by apply_decision. This also fine tunes compare_package_preference() to always prefer packages specified on command line speeding up calculation certain complicated solutions.
* solver, upgrade: properly detect missing repository tagsTimo Teräs2012-01-171-2/+2
| | | | | | | * upgrade needs explicit check so we don't try self-upgrade (which would print additional messages on screen) * add can fix problems, so check against the new world * merge the code in few places
* solver: fix change ordering of removed pages in relation to installedTimo Teräs2012-01-171-5/+6
|
* solver: calculate branch minimum penalty earlyTimo Teräs2012-01-171-55/+97
| | | | | | | | | Previously we would cache the penalty when evaluating the final solution, and adding that until we backtrack to first topology position changing that penalty. However, we can just keep track of minimum penalty based on name state, and add it. This allows us to bail out early on bad branches because we know in advance how things will turn out.
generated by cgit v1.2.3 (git 2.25.1) at 2025-08-16 13:14:48 +0000