*
*/
-#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"
/* how many strings to maintain (round robin) */
#define POOL_TMPSPACEBUF 16
-//-----------------------------------------------
+/*----------------------------------------------- */
struct _Repo;
struct _Repodata;
struct _Repokey;
struct _KeyValue;
-typedef struct _Repopos {
+typedef struct _Datapos {
struct _Repo *repo;
Id solvid;
Id repodataid;
Id schema;
Id dp;
-} Repopos;
+} 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 */
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;
- /* flags to tell the library how the installed rpm works */
+ /* package manager type, deb/rpm */
+ int disttype;
+
+ /* 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 novirtualconflicts; /* true: conflicts on names, not on provides */
+ 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
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 tmp space string space */
- char *tmpspacebuf[POOL_TMPSPACEBUF];
- int tmpspacelen[POOL_TMPSPACEBUF];
- int tmpspacen;
+ 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 */
- Repopos pos;
+ 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)
+#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_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);
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);
-static inline const char *solvid2str(Pool *pool, Id p)
+
+extern const char *pool_solvable2str(Pool *pool, Solvable *s);
+static inline const char *pool_solvid2str(Pool *pool, Id p)
{
- return solvable2str(pool, pool->solvables + 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);
-Id solvable_lookup_id(Solvable *s, Id keyname);
-unsigned int solvable_lookup_num(Solvable *s, Id keyname, unsigned int notfound);
-const char *solvable_lookup_str(Solvable *s, Id keyname);
-const char *solvable_lookup_str_poollang(Solvable *s, Id keyname);
-const char *solvable_lookup_str_lang(Solvable *s, Id keyname, const char *lang);
-int solvable_lookup_bool(Solvable *s, Id keyname);
-int solvable_lookup_void(Solvable *s, Id keyname);
-char * solvable_get_location(Solvable *s, unsigned int *medianrp);
-const unsigned char *solvable_lookup_bin_checksum(Solvable *s, Id keyname, Id *typep);
-const char *solvable_lookup_checksum(Solvable *s, Id keyname, Id *typep);
-int solvable_identical(Solvable *s1, Solvable *s2);
-Id solvable_selfprovidedep(Solvable *s);
-
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);
*/
extern void pool_createwhatprovides(Pool *pool);
extern void pool_addfileprovides(Pool *pool);
-extern void pool_addfileprovides_ids(Pool *pool, struct _Repo *installed, Id **idp);
+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;
- if (pool->considered)
- {
- Id id = s - pool->solvables;
- if (!MAPTST(pool->considered, id))
- return 0;
- }
- return 1;
-}
-
extern Id pool_addrelproviders(Pool *pool, Id d);
static inline Id pool_whatprovides(Pool *pool, Id d)
return pool->whatprovidesdata + off;
}
-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)
-{
- pool->debugcallback = debugcallback;
- pool->debugcallbackdata = debugcallbackdata;
-}
-
-static inline void pool_setdebugmask(Pool *pool, int mask)
-{
- pool->debugmask = mask;
-}
-
-static inline void pool_setloadcallback(Pool *pool, FILE *(*cb)(struct _Pool *, struct _Repodata *, void *), void *loadcbdata)
-{
- pool->loadcallback = cb;
- pool->loadcallbackdata = loadcbdata;
-}
-
/* search the pool. the following filters are available:
* p - search just this solvable
* key - search only this key
void pool_clear_pos(Pool *pool);
-typedef struct _duchanges {
+typedef struct _DUChanges {
const char *path;
int kbytes;
int files;
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);
+
+
/* loop over all providers of d */
#define FOR_PROVIDES(v, vp, d) \
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