*
*/
-#ifndef SATSOLVER_POOL_H
-#define SATSOLVER_POOL_H
+#ifndef LIBSOLV_POOL_H
+#define LIBSOLV_POOL_H
#ifdef __cplusplus
extern "C" {
#include <stdio.h>
+#include "solvversion.h"
#include "pooltypes.h"
#include "poolid.h"
#include "solvable.h"
+#include "bitmap.h"
#include "queue.h"
#include "strpool.h"
-// see initpool_data[] in pool.c
-
/* well known ids */
-#define ID_NULL STRID_NULL
-#define ID_EMPTY STRID_EMPTY
-#define SOLVABLE_NAME 2
-#define SOLVABLE_ARCH 3
-#define SOLVABLE_EVR 4
-#define SOLVABLE_VENDOR 5
-#define SOLVABLE_PROVIDES 6
-#define SOLVABLE_OBSOLETES 7
-#define SOLVABLE_CONFLICTS 8
-#define SOLVABLE_REQUIRES 9
-#define SOLVABLE_RECOMMENDS 10
-#define SOLVABLE_SUGGESTS 11
-#define SOLVABLE_SUPPLEMENTS 12
-#define SOLVABLE_ENHANCES 13
-#define SOLVABLE_FRESHENS 14
-#define RPM_RPMDBID 15
-#define SOLVABLE_PREREQMARKER 16 // normal requires before this, prereqs after this
-#define SOLVABLE_FILEMARKER 17 // normal provides before this, generated file provides after this
-#define NAMESPACE_INSTALLED 18
-#define NAMESPACE_MODALIAS 19
-#define NAMESPACE_SPLITPROVIDES 20
-#define NAMESPACE_LANGUAGE 21
-#define SYSTEM_SYSTEM 22
-#define ARCH_SRC 23
-#define ARCH_NOSRC 24
-#define ARCH_NOARCH 25
-#define REPODATA_EXTERNAL 26
-#define REPODATA_KEYS 27
-#define REPODATA_LOCATION 28
-
-#define ID_NUM_INTERNAL 29
-
+#include "knownid.h"
/* well known solvable */
#define SYSTEMSOLVABLE 1
/* how many strings to maintain (round robin) */
-#define DEP2STRBUF 16
+#define POOL_TMPSPACEBUF 16
-//-----------------------------------------------
+/*----------------------------------------------- */
struct _Repo;
struct _Repodata;
+struct _Repokey;
+struct _KeyValue;
+
+typedef struct _Datapos {
+ struct _Repo *repo;
+ Id solvid;
+ Id repodataid;
+ Id schema;
+ Id dp;
+} Datapos;
+
+struct _Pool_tmpspace {
+ char *buf[POOL_TMPSPACEBUF];
+ int len[POOL_TMPSPACEBUF];
+ int n;
+};
struct _Pool {
+ void *appdata; /* application private pointer */
+
struct _Stringpool ss;
- Reldep *rels; // table of rels: Id -> Reldep
- int nrels; // number of unique rels
- Hashtable relhashtbl; // hash table: (name,evr,op ->) Hash -> Id
+ Reldep *rels; /* table of rels: Id -> Reldep */
+ int nrels; /* number of unique rels */
+ Hashtable relhashtbl; /* hashtable: (name,evr,op)Hash -> Id */
Hashmask relhashmask;
struct _Repo **repos;
- int nrepos;
+ int nrepos; /* repos allocated */
+ int urepos; /* repos in use */
+
+ struct _Repo *installed; /* packages considered installed */
Solvable *solvables;
- int nsolvables;
+ int nsolvables; /* solvables allocated */
+
+ const char **languages;
+ int nlanguages;
+ Id *languagecache;
+ int languagecacheother;
+
+ /* package manager type, deb/rpm */
+ int disttype;
- int promoteepoch; /* 0/1 */
+ /* flags to tell the library how the installed package manager works */
+ int promoteepoch; /* true: missing epoch is replaced by epoch of dependency */
+ int obsoleteusesprovides; /* true: obsoletes are matched against provides, not names */
+ int implicitobsoleteusesprovides; /* true: implicit obsoletes due to same name are matched against provides, not names */
+ int obsoleteusescolors; /* true: obsoletes check arch color */
+ int noinstalledobsoletes; /* true: ignore obsoletes of installed packages */
+ int allowselfconflicts; /* true: packages which conflict with itself are installable */
Id *id2arch; /* map arch ids to scores */
- Id lastarch; /* last valid entry in id2arch */
+ unsigned char *id2color; /* map arch ids to colors */
+ Id lastarch; /* last valid entry in id2arch/id2color */
+
Queue vendormap; /* map vendor to vendorclasses mask */
+ const char **vendorclasses; /* vendor equivalence classes */
/* providers data, as two-step indirect list
* whatprovides[Id] -> Offset into whatprovidesdata for name
Offset whatprovidesdataoff; /* next free slot within whatprovidesdata */
int whatprovidesdataleft; /* number of 'free slots' within whatprovidesdata */
+ /* If nonzero, then consider only the solvables with Ids set in this
+ bitmap for solving. If zero, consider all solvables. */
+ Map *considered;
+
+ /* callback for REL_NAMESPACE dependencies handled by the application */
Id (*nscallback)(struct _Pool *, void *data, Id name, Id evr);
void *nscallbackdata;
- /* our dep2str string space */
- char *dep2strbuf[DEP2STRBUF];
- int dep2strlen[DEP2STRBUF];
- int dep2strn;
+ /* our tmp space string space */
+ struct _Pool_tmpspace tmpspace;
/* debug mask and callback */
int debugmask;
void *debugcallbackdata;
/* load callback */
- FILE * (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
+ int (*loadcallback)(struct _Pool *, struct _Repodata *, void *);
void *loadcallbackdata;
+
+ /* search position */
+ Datapos pos;
};
-#define SAT_FATAL (1<<0)
-#define SAT_ERROR (1<<1)
-#define SAT_WARN (1<<2)
-#define SAT_DEBUG_STATS (1<<3)
-#define SAT_DEBUG_RULE_CREATION (1<<4)
-#define SAT_DEBUG_PROPAGATE (1<<5)
-#define SAT_DEBUG_ANALYZE (1<<6)
-#define SAT_DEBUG_UNSOLVABLE (1<<7)
-#define SAT_DEBUG_SOLUTIONS (1<<8)
-#define SAT_DEBUG_POLICY (1<<9)
-#define SAT_DEBUG_RESULT (1<<10)
-#define SAT_DEBUG_JOB (1<<11)
-#define SAT_DEBUG_SCHUBI (1<<12)
-
-/* The void type is usable to encode one-valued attributes, they have
- no associated data. This is useful to encode values which many solvables
- have in common, and whose overall set is relatively limited. A prime
- example would be the media number. The actual value is encoded in the
- SIZE member of the key structure. Be warned: careless use of this
- leads to combinatoric explosion of number of schemas. */
-#define TYPE_VOID 0
-#define TYPE_ID 1
-#define TYPE_IDARRAY 2
-#define TYPE_STR 3
-#define TYPE_U32 4
-#define TYPE_REL_IDARRAY 5
-
-#define TYPE_ATTR_INT 6
-#define TYPE_ATTR_CHUNK 7
-#define TYPE_ATTR_STRING 8
-#define TYPE_ATTR_INTLIST 9
-#define TYPE_ATTR_LOCALIDS 10
-
-#define TYPE_COUNT_NAMED 11
-#define TYPE_COUNTED 12
-
-#define TYPE_IDVALUEARRAY 13
-
-#define TYPE_DIR 14
-#define TYPE_DIRNUMNUMARRAY 15
-#define TYPE_DIRSTRARRAY 16
-
-#define TYPE_CONSTANT 17
-#define TYPE_NUM 18
-
-#define TYPE_ATTR_TYPE_MAX 18
-
-//-----------------------------------------------
+#define DISTTYPE_RPM 0
+#define DISTTYPE_DEB 1
+
+#define SOLV_FATAL (1<<0)
+#define SOLV_ERROR (1<<1)
+#define SOLV_WARN (1<<2)
+#define SOLV_DEBUG_STATS (1<<3)
+#define SOLV_DEBUG_RULE_CREATION (1<<4)
+#define SOLV_DEBUG_PROPAGATE (1<<5)
+#define SOLV_DEBUG_ANALYZE (1<<6)
+#define SOLV_DEBUG_UNSOLVABLE (1<<7)
+#define SOLV_DEBUG_SOLUTIONS (1<<8)
+#define SOLV_DEBUG_POLICY (1<<9)
+#define SOLV_DEBUG_RESULT (1<<10)
+#define SOLV_DEBUG_JOB (1<<11)
+#define SOLV_DEBUG_SOLVER (1<<12)
+#define SOLV_DEBUG_TRANSACTION (1<<13)
+
+#define SOLV_DEBUG_TO_STDERR (1<<30)
+
+/* ----------------------------------------------- */
/* mark dependencies with relation by setting bit31 */
#define REL_OR 17
#define REL_WITH 18
#define REL_NAMESPACE 19
+#define REL_ARCH 20
+#define REL_FILECONFLICT 21
+#define REL_COND 22
#if !defined(__GNUC__) && !defined(__attribute__)
# define __attribute__(x)
#endif
-/**
- * Creates a new pool
- */
extern Pool *pool_create(void);
-/**
- * Delete a pool
- */
extern void pool_free(Pool *pool);
+extern void pool_freeallrepos(Pool *pool, int reuseids);
+
+extern void pool_setdebuglevel(Pool *pool, int level);
+#ifdef MULTI_SEMANTICS
+extern void pool_setdisttype(Pool *pool, int disttype);
+#endif
+extern void pool_setvendorclasses(Pool *pool, const char **vendorclasses);
extern void pool_debug(Pool *pool, int type, const char *format, ...) __attribute__((format(printf, 3, 4)));
+extern void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata);
+extern void pool_setdebugmask(Pool *pool, int mask);
+extern void pool_setloadcallback(Pool *pool, int (*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata);
+
+
+extern char *pool_alloctmpspace(Pool *pool, int len);
+extern void pool_freetmpspace(Pool *pool, const char *space);
+extern char *pool_tmpjoin(Pool *pool, const char *str1, const char *str2, const char *str3);
+extern char *pool_tmpappend(Pool *pool, const char *str1, const char *str2, const char *str3);
+extern const char *pool_bin2hex(Pool *pool, const unsigned char *buf, int len);
+
+extern void pool_set_installed(Pool *pool, struct _Repo *repo);
/**
* Solvable management
extern Id pool_add_solvable_block(Pool *pool, int count);
extern void pool_free_solvable_block(Pool *pool, Id start, int count, int reuseids);
-static inline Solvable *pool_id2solvable(Pool *pool, Id p)
+static inline Solvable *pool_id2solvable(const Pool *pool, Id p)
{
return pool->solvables + p;
}
-extern const char *solvable2str(Pool *pool, Solvable *s);
+
+extern const char *pool_solvable2str(Pool *pool, Solvable *s);
+static inline const char *pool_solvid2str(Pool *pool, Id p)
+{
+ return pool_solvable2str(pool, pool->solvables + p);
+}
+
+void pool_set_languages(Pool *pool, const char **languages, int nlanguages);
+Id pool_id2langid(Pool *pool, Id id, const char *lang, int create);
+
+int solvable_trivial_installable_map(Solvable *s, Map *installedmap, Map *conflictsmap);
+int solvable_trivial_installable_repo(Solvable *s, struct _Repo *installed);
+int solvable_trivial_installable_queue(Solvable *s, Queue *installed);
+
+void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
+
+int pool_match_nevr_rel(Pool *pool, Solvable *s, Id d);
+int pool_match_dep(Pool *pool, Id d1, Id d2);
+
+static inline int pool_match_nevr(Pool *pool, Solvable *s, Id d)
+{
+ if (!ISRELDEP(d))
+ return d == s->name;
+ else
+ return pool_match_nevr_rel(pool, s, d);
+}
/**
* Prepares a pool for solving
*/
extern void pool_createwhatprovides(Pool *pool);
-extern void pool_addfileprovides(Pool *pool, struct _Repo *installed);
+extern void pool_addfileprovides(Pool *pool);
+extern void pool_addfileprovides_queue(Pool *pool, Queue *idq);
extern void pool_freewhatprovides(Pool *pool);
extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
-static inline int pool_installable(Pool *pool, Solvable *s)
-{
- if (!s->arch || s->arch == ARCH_SRC || s->arch == ARCH_NOSRC)
- return 0;
- if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
- return 0;
- return 1;
-}
-
-extern Id *pool_addrelproviders(Pool *pool, Id d);
+extern Id pool_addrelproviders(Pool *pool, Id d);
-static inline Id *pool_whatprovides(Pool *pool, Id d)
+static inline Id pool_whatprovides(Pool *pool, Id d)
{
Id v;
if (!ISRELDEP(d))
- return pool->whatprovidesdata + pool->whatprovides[d];
+ return pool->whatprovides[d];
v = GETRELID(d);
if (pool->whatprovides_rel[v])
- return pool->whatprovidesdata + pool->whatprovides_rel[v];
+ return pool->whatprovides_rel[v];
return pool_addrelproviders(pool, d);
}
-extern void pool_setdebuglevel(Pool *pool, int level);
-
-static inline void pool_setdebugcallback(Pool *pool, void (*debugcallback)(struct _Pool *, void *data, int type, const char *str), void *debugcallbackdata)
+static inline Id *pool_whatprovides_ptr(Pool *pool, Id d)
{
- pool->debugcallback = debugcallback;
- pool->debugcallbackdata = debugcallbackdata;
+ Id off = pool_whatprovides(pool, d);
+ return pool->whatprovidesdata + off;
}
-static inline void pool_setdebugmask(Pool *pool, int mask)
-{
- pool->debugmask = mask;
-}
+/* search the pool. the following filters are available:
+ * p - search just this solvable
+ * key - search only this key
+ * match - key must match this string
+ */
+void pool_search(Pool *pool, Id p, Id key, const char *match, int flags, int (*callback)(void *cbdata, Solvable *s, struct _Repodata *data, struct _Repokey *key, struct _KeyValue *kv), void *cbdata);
+
+void pool_clear_pos(Pool *pool);
+
+
+typedef struct _DUChanges {
+ const char *path;
+ int kbytes;
+ int files;
+} DUChanges;
+
+void pool_calc_duchanges(Pool *pool, Map *installedmap, DUChanges *mps, int nmps);
+int pool_calc_installsizechange(Pool *pool, Map *installedmap);
+void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
+void pool_trivial_installable_noobsoletesmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *noobsoletesmap);
+
+const char *pool_lookup_str(Pool *pool, Id entry, Id keyname);
+Id pool_lookup_id(Pool *pool, Id entry, Id keyname);
+unsigned int pool_lookup_num(Pool *pool, Id entry, Id keyname, unsigned int notfound);
+int pool_lookup_void(Pool *pool, Id entry, Id keyname);
+const unsigned char *pool_lookup_bin_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
+const char *pool_lookup_checksum(Pool *pool, Id entry, Id keyname, Id *typep);
+
+void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
+
-static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
-{
- pool->loadcallback = cb;
- pool->loadcallbackdata = loadcbdata;
-}
/* loop over all providers of d */
#define FOR_PROVIDES(v, vp, d) \
- for (vp = pool_whatprovides(pool, d) ; (v = *vp++) != 0; )
+ for (vp = pool_whatprovides(pool, d) ; (v = pool->whatprovidesdata[vp++]) != 0; )
+
+/* loop over all repositories */
+#define FOR_REPOS(repoid, r) \
+ for (repoid = 1; repoid < pool->nrepos; repoid++) \
+ if ((r = pool->repos[repoid]) != 0)
+
#define POOL_DEBUG(type, ...) do {if ((pool->debugmask & (type)) != 0) pool_debug(pool, (type), __VA_ARGS__);} while (0)
#define IF_POOLDEBUG(type) if ((pool->debugmask & (type)) != 0)
#endif
-#endif /* SATSOLVER_POOL_H */
+#endif /* LIBSOLV_POOL_H */
projects / platform / upstream / libsolv.git / blobdiff