X-Git-Url: http://review.tizen.org/git/?a=blobdiff_plain;f=src%2Fsolver.h;h=34c045e16f361a0d6acaa78650765ff59bbceffd;hb=refs%2Fheads%2Fupstream;hp=5e3a162214cad5b3194df48b7b6a80e5bc5887c6;hpb=9eaaeb1ef79617559a51b23acf58f9563478207a;p=platform%2Fupstream%2Flibsolv.git diff --git a/src/solver.h b/src/solver.h index 5e3a162..34c045e 100644 --- a/src/solver.h +++ b/src/solver.h @@ -13,10 +13,6 @@ #ifndef LIBSOLV_SOLVER_H #define LIBSOLV_SOLVER_H -#ifdef __cplusplus -extern "C" { -#endif - #include "pooltypes.h" #include "pool.h" #include "repo.h" @@ -26,84 +22,42 @@ extern "C" { #include "rules.h" #include "problems.h" -/* - * Callback definitions in order to "overwrite" the policies by an external application. - */ - -typedef void (*BestSolvableCb) (Pool *pool, Queue *canditates); -typedef int (*ArchCheckCb) (Pool *pool, Solvable *solvable1, Solvable *solvable2); -typedef int (*VendorCheckCb) (Pool *pool, Solvable *solvable1, Solvable *solvable2); -typedef void (*UpdateCandidateCb) (Pool *pool, Solvable *solvable, Queue *canditates); - +#ifdef __cplusplus +extern "C" { +#endif -struct _Solver { +struct s_Solver { Pool *pool; /* back pointer to pool */ Queue job; /* copy of the job we're solving */ - int (*solution_callback)(struct _Solver *solv, void *data); + int (*solution_callback)(struct s_Solver *solv, void *data); void *solution_callback_data; - /* Callbacks for defining the bahaviour of the solver */ - - /* Finding best candidate - * - * Callback definition: - * void bestSolvable (Pool *pool, Queue *canditates) - * candidates : List of canditates which has to be sorted by the function call - * return candidates: Sorted list of the candidates(first is the best). - */ - BestSolvableCb bestSolvableCb; - - /* Checking if two solvables has compatible architectures - * - * Callback definition: - * int archCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2); - * - * return 0 it the two solvables has compatible architectures - */ - ArchCheckCb archCheckCb; - - /* Checking if two solvables has compatible vendors - * - * Callback definition: - * int vendorCheck (Pool *pool, Solvable *solvable1, Solvable *solvable2); - * - * return 0 it the two solvables has compatible architectures - */ - VendorCheckCb vendorCheckCb; - - /* Evaluate update candidate - * - * Callback definition: - * void UpdateCandidateCb (Pool *pool, Solvable *solvable, Queue *canditates) - * solvable : for which updates should be search - * candidates : List of candidates (This list depends on other - * restrictions like architecture and vendor policies too) - */ - UpdateCandidateCb updateCandidateCb; + int pooljobcnt; /* number of pooljob entries in job queue */ #ifdef LIBSOLV_INTERNAL Repo *installed; /* copy of pool->installed */ - + /* list of rules, ordered - * rpm rules first, then features, updates, jobs, learnt + * pkg rules first, then features, updates, jobs, learnt * see start/end offsets below */ Rule *rules; /* all rules */ Id nrules; /* [Offset] index of the last rule */ + Id lastpkgrule; /* last package rule we added */ Queue ruleassertions; /* Queue of all assertion rules */ /* start/end offset for rule 'areas' */ - - Id rpmrules_end; /* [Offset] rpm rules end */ - + + Id pkgrules_end; /* [Offset] dep rules end */ + Id featurerules; /* feature rules start/end */ Id featurerules_end; - + Id updaterules; /* policy rules, e.g. keep packages installed or update. All literals > 0 */ Id updaterules_end; - + Id jobrules; /* user rules */ Id jobrules_end; @@ -112,20 +66,35 @@ struct _Solver { Id duprules; /* dist upgrade rules */ Id duprules_end; - + Id bestrules; /* rules from SOLVER_FORCEBEST */ + Id bestrules_up; /* update rule part starts here*/ Id bestrules_end; - Id *bestrules_pkg; + Id *bestrules_info; /* < 0 : install rule, > 0 : pkg that needs to be updated */ + + Id yumobsrules; /* rules from yum obsoletes handling */ + Id yumobsrules_end; + Id *yumobsrules_info; /* the dependency for each rule */ + + Id blackrules; /* rules from blacklisted packages */ + Id blackrules_end; + + Id strictrepopriorules; /* rules from strict priority repositories */ + Id strictrepopriorules_end; Id choicerules; /* choice rules (always weak) */ Id choicerules_end; - Id *choicerules_ref; + Id *choicerules_info; /* the rule we used to generate the choice rule */ + + Id recommendsrules; /* rules from recommends pkg rules with disfavored literals */ + Id recommendsrules_end; + Id *recommendsrules_info; /* the original pkg rule rule */ Id learntrules; /* learnt rules, (end == nrules) */ Map noupdate; /* don't try to update these installed solvables */ - Map noobsoletes; /* ignore obsoletes for these (multiinstall) */ + Map multiversion; /* ignore obsoletes for these (multiinstall) */ Map updatemap; /* bring these installed packages to the newest version */ int updatemap_all; /* bring all packages to the newest version */ @@ -150,18 +119,13 @@ struct _Solver { /* our decisions: */ Queue decisionq; /* >0:install, <0:remove/conflict */ Queue decisionq_why; /* index of rule, Offset into rules */ + Queue decisionq_reason; /* reason for decision, indexed by level */ Id *decisionmap; /* map for all available solvables, * = 0: undecided * > 0: level of decision when installed, * < 0: level of decision when conflict */ - int decisioncnt_update; - int decisioncnt_keep; - int decisioncnt_resolve; - int decisioncnt_weak; - int decisioncnt_orphan; - /* learnt rule history */ Queue learnt_why; Queue learnt_pool; @@ -180,10 +144,12 @@ struct _Solver { Map recommendsmap; /* recommended packages from decisionmap */ Map suggestsmap; /* suggested packages from decisionmap */ int recommends_index; /* recommendsmap/suggestsmap is created up to this level */ + Queue *recommendscplxq; + Queue *suggestscplxq; Id *obsoletes; /* obsoletes for each installed solvable */ Id *obsoletes_data; /* data area for obsoletes */ - Id *multiversionupdaters; /* updaters for multiversion packages in updatesystem mode */ + Id *specialupdaters; /* updaters for packages with a limited update rule */ /*------------------------------------------------------------------------------------------------------------- * Solver configuration @@ -195,19 +161,29 @@ struct _Solver { int allowvendorchange; /* allow to change vendor of installed solvables */ int allowuninstall; /* allow removal of installed solvables */ int noupdateprovide; /* true: update packages needs not to provide old package */ + int needupdateprovide; /* true: update packages must provide old package */ int dosplitprovides; /* true: consider legacy split provides */ int dontinstallrecommended; /* true: do not install recommended packages */ int addalreadyrecommended; /* true: also install recommended packages that were already recommended by the installed packages */ int dontshowinstalledrecommended; /* true: do not show recommended packages that are already installed */ - + int noinfarchcheck; /* true: do not forbid inferior architectures */ int keepexplicitobsoletes; /* true: honor obsoletes during multiinstall */ int bestobeypolicy; /* true: stay in policy with the best rules */ - - - Map dupmap; /* dup these packages*/ - int dupmap_all; /* dup all packages */ + int noautotarget; /* true: do not assume targeted for up/dup jobs that contain no installed solvable */ + int focus_installed; /* true: resolve update rules first */ + int focus_best; /* true: resolve job dependencies first */ + int do_yum_obsoletes; /* true: add special yumobs rules */ + int urpmreorder; /* true: do special urpm package reordering */ + int strongrecommends; /* true: create weak rules for recommends */ + int install_also_updates; /* true: do not prune install job rules to installed packages */ + int only_namespace_recommended; /* true: only install packages recommended by namespace */ + int strict_repo_priority; /* true: only use packages from highest precedence/priority */ + + int process_orphans; /* true: do special orphan processing */ + Map dupmap; /* dup to those packages */ Map dupinvolvedmap; /* packages involved in dup process */ + int dupinvolvedmap_all; /* all packages are involved */ int dup_allowdowngrade; /* dup mode: allow to downgrade installed solvable */ int dup_allownamechange; /* dup mode: allow to change name of installed solvable */ int dup_allowarchchange; /* dup mode: allow to change architecture of installed solvables */ @@ -224,10 +200,31 @@ struct _Solver { Queue *cleandeps_mistakes; /* mistakes we made */ Queue *update_targets; /* update to specific packages */ + + Queue *installsuppdepq; /* deps from the install namespace provides hack */ + + Queue addedmap_deduceq; /* deduce addedmap from pkg rules */ + Id *instbuddy; /* buddies of installed packages */ + int keep_orphans; /* how to treat orphans */ + int break_orphans; /* how to treat orphans */ + Queue *brokenorphanrules; /* broken rules of orphaned packages */ + + Map allowuninstallmap; /* ok to uninstall those */ + int allowuninstall_all; + + Map excludefromweakmap; /* remove them from candidates for supplements and recommends */ + + Id *favormap; /* favor job index, > 0: favored, < 0: disfavored */ + int havedisfavored; /* do we have disfavored packages? */ + + int installedpos; /* for resolve_installed */ + int do_extra_reordering; /* reorder for future installed packages */ + + Queue *recommendsruleq; /* pkg rules comming from recommends */ #endif /* LIBSOLV_INTERNAL */ }; -typedef struct _Solver Solver; +typedef struct s_Solver Solver; /* * queue commands @@ -247,12 +244,17 @@ typedef struct _Solver Solver; #define SOLVER_ERASE 0x0200 #define SOLVER_UPDATE 0x0300 #define SOLVER_WEAKENDEPS 0x0400 -#define SOLVER_NOOBSOLETES 0x0500 +#define SOLVER_MULTIVERSION 0x0500 #define SOLVER_LOCK 0x0600 #define SOLVER_DISTUPGRADE 0x0700 #define SOLVER_VERIFY 0x0800 #define SOLVER_DROP_ORPHANED 0x0900 -#define SOLVER_USERINSTALLED 0x0a00 +#define SOLVER_USERINSTALLED 0x0a00 +#define SOLVER_ALLOWUNINSTALL 0x0b00 +#define SOLVER_FAVOR 0x0c00 +#define SOLVER_DISFAVOR 0x0d00 +#define SOLVER_BLACKLIST 0x0e00 +#define SOLVER_EXCLUDEFROMWEAK 0x1000 #define SOLVER_JOBMASK 0xff00 @@ -267,6 +269,15 @@ typedef struct _Solver Solver; * not installable. This can be used with INSTALL, UPDATE * and DISTUPGRADE */ #define SOLVER_FORCEBEST 0x100000 +/* TARGETED is used in up/dup jobs to make the solver + * treat the specified selection as target packages. + * It is automatically assumed if the selection does not + * contain an "installed" package unless the + * NO_AUTOTARGET solver flag is set */ +#define SOLVER_TARGETED 0x200000 +/* This (SOLVER_INSTALL) job was automatically added + * and thus does not the add to the userinstalled packages */ +#define SOLVER_NOTBYUSER 0x400000 #define SOLVER_SETEV 0x01000000 #define SOLVER_SETEVR 0x02000000 @@ -278,6 +289,9 @@ typedef struct _Solver Solver; #define SOLVER_SETMASK 0x7f000000 +/* legacy */ +#define SOLVER_NOOBSOLETES SOLVER_MULTIVERSION + #define SOLVER_REASON_UNRELATED 0 #define SOLVER_REASON_UNIT_RULE 1 #define SOLVER_REASON_KEEP_INSTALLED 2 @@ -288,8 +302,11 @@ typedef struct _Solver Solver; #define SOLVER_REASON_WEAKDEP 7 #define SOLVER_REASON_RESOLVE_ORPHAN 8 -#define SOLVER_REASON_RECOMMENDED 16 -#define SOLVER_REASON_SUPPLEMENTED 17 +#define SOLVER_REASON_RECOMMENDED 16 /* deprecated */ +#define SOLVER_REASON_SUPPLEMENTED 17 /* deprecated */ + +#define SOLVER_REASON_UNSOLVABLE 18 +#define SOLVER_REASON_PREMISE 19 #define SOLVER_FLAG_ALLOW_DOWNGRADE 1 @@ -304,6 +321,40 @@ typedef struct _Solver Solver; #define SOLVER_FLAG_ALLOW_NAMECHANGE 10 #define SOLVER_FLAG_KEEP_EXPLICIT_OBSOLETES 11 #define SOLVER_FLAG_BEST_OBEY_POLICY 12 +#define SOLVER_FLAG_NO_AUTOTARGET 13 +#define SOLVER_FLAG_DUP_ALLOW_DOWNGRADE 14 +#define SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE 15 +#define SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE 16 +#define SOLVER_FLAG_DUP_ALLOW_NAMECHANGE 17 +#define SOLVER_FLAG_KEEP_ORPHANS 18 +#define SOLVER_FLAG_BREAK_ORPHANS 19 +#define SOLVER_FLAG_FOCUS_INSTALLED 20 +#define SOLVER_FLAG_YUM_OBSOLETES 21 +#define SOLVER_FLAG_NEED_UPDATEPROVIDE 22 +#define SOLVER_FLAG_URPM_REORDER 23 +#define SOLVER_FLAG_FOCUS_BEST 24 +#define SOLVER_FLAG_STRONG_RECOMMENDS 25 +#define SOLVER_FLAG_INSTALL_ALSO_UPDATES 26 +#define SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED 27 +#define SOLVER_FLAG_STRICT_REPO_PRIORITY 28 + +#define GET_USERINSTALLED_NAMES (1 << 0) /* package names instead of ids */ +#define GET_USERINSTALLED_INVERTED (1 << 1) /* autoinstalled */ +#define GET_USERINSTALLED_NAMEARCH (1 << 2) /* package/arch tuples instead of ids */ + +#define SOLVER_ALTERNATIVE_TYPE_RULE 1 +#define SOLVER_ALTERNATIVE_TYPE_RECOMMENDS 2 +#define SOLVER_ALTERNATIVE_TYPE_SUGGESTS 3 + +/* solver_get_decisionlist / solver_get_learnt flags */ +#define SOLVER_DECISIONLIST_SOLVABLE (1 << 1) +#define SOLVER_DECISIONLIST_PROBLEM (1 << 2) +#define SOLVER_DECISIONLIST_LEARNTRULE (1 << 3) +#define SOLVER_DECISIONLIST_WITHINFO (1 << 8) +#define SOLVER_DECISIONLIST_SORTED (1 << 9) +#define SOLVER_DECISIONLIST_MERGEDINFO (1 << 10) + +#define SOLVER_DECISIONLIST_TYPEMASK (0xff) extern Solver *solver_create(Pool *pool); extern void solver_free(Solver *solv); @@ -320,23 +371,46 @@ extern void solver_get_decisionblock(Solver *solv, int level, Queue *decisionq); extern void solver_get_orphaned(Solver *solv, Queue *orphanedq); extern void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected); extern void solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered); +extern void solver_get_userinstalled(Solver *solv, Queue *q, int flags); +extern void pool_add_userinstalled_jobs(Pool *pool, Queue *q, Queue *job, int flags); +extern void solver_get_cleandeps(Solver *solv, Queue *cleandepsq); extern int solver_describe_decision(Solver *solv, Id p, Id *infop); -extern void solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq); +extern void solver_get_decisionlist(Solver *solv, Id p, int flags, Queue *decisionlistq); +extern void solver_get_decisionlist_multiple(Solver *solv, Queue *pq, int flags, Queue *decisionlistq); +extern void solver_get_learnt(Solver *solv, Id id, int flags, Queue *q); +extern void solver_decisionlist_solvables(Solver *solv, Queue *decisionlistq, int pos, Queue *q); +extern int solver_decisionlist_merged(Solver *solv, Queue *decisionlistq, int pos); + +extern int solver_alternatives_count(Solver *solv); +extern int solver_get_alternative(Solver *solv, Id alternative, Id *idp, Id *fromp, Id *chosenp, Queue *choices, int *levelp); +extern int solver_alternativeinfo(Solver *solv, int type, Id id, Id from, Id *fromp, Id *top, Id *depp); -extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *noobsmap); +extern void solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap); +extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap); /* obsolete */ extern void solver_create_state_maps(Solver *solv, Map *installedmap, Map *conflictsmap); -/* XXX: why is this not static? */ -Id *solver_create_decisions_obsoletesmap(Solver *solv); +extern void solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps); +extern int solver_calc_installsizechange(Solver *solv); -void solver_calc_duchanges(Solver *solv, DUChanges *mps, int nmps); -int solver_calc_installsizechange(Solver *solv); -void solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res); +extern void pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what); +extern int pool_isemptyupdatejob(Pool *pool, Id how, Id what); -void pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what); -int pool_isemptyupdatejob(Pool *pool, Id how, Id what); +/* decisioninfo merging */ +extern int solver_calc_decisioninfo_bits(Solver *solv, Id decision, int type, Id from, Id to, Id dep); +extern int solver_merge_decisioninfo_bits(Solver *solv, int state1, int type1, Id from1, Id to1, Id dep1, int state2, int type2, Id from2, Id to2, Id dep2); + +extern const char *solver_select2str(Pool *pool, Id select, Id what); +extern const char *pool_job2str(Pool *pool, Id how, Id what, Id flagmask); +extern const char *solver_alternative2str(Solver *solv, int type, Id id, Id from); +extern const char *solver_reason2str(Solver *solv, int reason); +extern const char *solver_decisionreason2str(Solver *solv, Id decision, int reason, Id info); +extern const char *solver_decisioninfo2str(Solver *solv, int bits, int type, Id from, Id to, Id dep); + + +/* deprecated, use solver_allweakdepinfos/solver_weakdepinfo instead */ +extern void solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq); /* iterate over all literals of a rule */ #define FOR_RULELITERALS(l, pp, r) \ @@ -364,6 +438,9 @@ int pool_isemptyupdatejob(Pool *pool, Id how, Id what); continue; \ else +/* weird suse stuff */ +extern void solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res); + #ifdef __cplusplus } #endif