2 # WARNING: for perl iterator/array support you need to run
3 # sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
4 # on the generated c code
10 %markfunc Pool "mark_Pool";
13 #if defined(SWIGPYTHON)
15 /* Check if is a list */
17 if (PyList_Check($input)) {
18 int size = PyList_Size($input);
20 for (i = 0; i < size; i++) {
21 PyObject *o = PyList_GetItem($input,i);
23 int e = SWIG_AsVal_int(o, &v);
25 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
32 PyErr_SetString(PyExc_TypeError,"not a list");
39 PyObject *o = PyList_New($1.count);
40 for (i = 0; i < $1.count; i++)
41 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
46 %define Queue2Array(type, step, con) %{
48 int cnt = $1.count / step;
49 Id *idp = $1.elements;
50 PyObject *o = PyList_New(cnt);
51 for (i = 0; i < cnt; i++, idp += step)
54 #define result resultx
57 PyList_SetItem(o, i, $result);
74 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
75 SWIG_croak("Argument $argnum is not an array reference.");
76 av = (AV*)SvRV($input);
78 for (i = 0; i <= size; i++) {
79 SV **sv = av_fetch(av, i, 0);
81 int e = SWIG_AsVal_int(*sv, &v);
83 SWIG_croak("list must contain only integers");
89 # av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
90 # $result = newRV_noinc((SV*)o); argvi++;
94 if (argvi + $1.count + 1 >= items) {
95 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
97 for (i = 0; i < $1.count; i++)
98 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
102 %define Queue2Array(type, step, con) %{
104 int cnt = $1.count / step;
105 Id *idp = $1.elements;
106 if (argvi + cnt + 1 >= items) {
107 EXTEND(sp, (argvi + cnt + 1) - items + 1);
109 for (i = 0; i < cnt; i++, idp += step)
112 #define result resultx
115 SvREFCNT_inc(ST(argvi - 1));
125 %typemap(arginit) Queue {
128 %typemap(freearg) Queue {
132 #if defined(SWIGRUBY)
137 size = RARRAY_LEN($input);
139 o = RARRAY_PTR($input);
140 for (i = 0; i < size; i++, o++) {
142 int e = SWIG_AsVal_int(*o, &v);
145 SWIG_Error(SWIG_RuntimeError, "list must contain only integers");
151 %typemap(out) Queue {
153 VALUE o = rb_ary_new2($1.count);
154 for (i = 0; i < $1.count; i++)
155 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
159 %typemap(arginit) Queue {
162 %typemap(freearg) Queue {
165 %define Queue2Array(type, step, con) %{
167 int cnt = $1.count / step;
168 Id *idp = $1.elements;
169 VALUE o = rb_ary_new2(cnt);
170 for (i = 0; i < cnt; i++, idp += step)
173 #define result resultx
176 rb_ary_store(o, i, $result);
188 #if defined(SWIGPERL)
190 # work around a swig bug
194 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
196 # ifndef MULTIPLICITY
197 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
199 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
205 %define perliter(class)
208 my $i = ${##class##::ITERATORS}{$_[0]};
210 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
212 $_[0]->__getitem__($_[1]);
215 sub class##::FETCHSIZE {
216 my $i = ${##class##::ITERATORS}{$_[0]};
218 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
228 #define SWIG_PERL_ITERATOR 0x80
230 SWIGRUNTIMEINLINE SV *
231 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
232 SV *result = sv_newmortal();
233 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
238 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
239 stash=SvSTASH(SvRV(obj));
240 if (flags & SWIG_POINTER_OWN) {
242 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
244 gv_init(gv, stash, "OWNER", 5, FALSE);
246 hv_store_ent(hv, obj, newSViv(1), 0);
248 if (flags & SWIG_PERL_ITERATOR) {
250 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
253 gv_init(gv, stash, "ITERATORS", 9, FALSE);
255 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
257 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
259 self=newRV_noinc((SV *)array);
260 sv_setsv(result, self);
261 SvREFCNT_dec((SV *)self);
262 sv_bless(result, stash);
264 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
271 %typemap(out) Perlarray {
272 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
274 %typemap(out) Perliterator {
275 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
278 %typemap(out) Pool_solvable_iterator * = Perlarray;
279 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
280 %typemap(out) Pool_repo_iterator * = Perlarray;
281 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
282 %typemap(out) Repo_solvable_iterator * = Perlarray;
283 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
284 %typemap(out) Dataiterator * = Perliterator;
289 #if defined(SWIGPYTHON)
290 typedef PyObject *AppObjectPtr;
291 %typemap(out) AppObjectPtr {
292 $result = $1 ? $1 : Py_None;
296 #if defined(SWIGPERL)
297 typedef SV *AppObjectPtr;
298 %typemap(in) AppObjectPtr {
299 $1 = SvROK($input) ? SvRV($input) : 0;
301 %typemap(out) AppObjectPtr {
302 $result = $1 ? newRV_inc($1) : newSV(0);
306 #if defined(SWIGRUBY)
307 typedef VALUE AppObjectPtr;
308 %typemap(in) AppObjectPtr {
311 %typemap(out) AppObjectPtr {
321 %fragment("SWIG_AsValFilePtr","header") {}
325 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
329 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
331 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
333 static swig_type_info* desc = 0;
337 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
338 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
340 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
344 ecode = SWIG_AsValFilePtr(obj, val);
345 if (ecode == SWIG_OK)
348 return SWIG_TypeError;
354 %fragment("SWIG_AsValDepId","header") {
358 SWIG_AsValDepId(VALUE obj, int *val) {
360 SWIG_AsValDepId(void *obj, int *val) {
362 static swig_type_info* desc = 0;
365 if (!desc) desc = SWIG_TypeQuery("Dep *");
366 ecode = SWIG_AsVal_int(obj, val);
367 if (SWIG_IsOK(ecode))
369 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
371 *val = vptr ? ((Dep *)vptr)->id : 0;
374 return SWIG_TypeError;
381 %include "typemaps.i"
383 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
384 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
390 #include <sys/stat.h>
391 #include <sys/utsname.h>
392 #include <sys/types.h>
395 /* argh, swig undefs bool for perl */
401 #include "poolarch.h"
404 #include "solverdebug.h"
405 #include "repo_solv.h"
407 #include "selection.h"
409 #include "repo_write.h"
411 #include "repo_rpmdb.h"
413 #ifdef ENABLE_RPMDB_PUBKEYS
414 #include "repo_rpmdb_pubkey.h"
417 #include "repo_deb.h"
420 #include "repo_rpmmd.h"
421 #include "repo_updateinfoxml.h"
422 #include "repo_deltainfoxml.h"
423 #include "repo_repomdxml.h"
425 #ifdef ENABLE_SUSEREPO
426 #include "repo_products.h"
427 #include "repo_susetags.h"
428 #include "repo_content.h"
430 #ifdef ENABLE_MDKREPO
431 #include "repo_mdk.h"
433 #ifdef ENABLE_ARCHREPO
434 #include "repo_arch.h"
436 #include "solv_xfopen.h"
438 /* for old ruby versions */
440 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
443 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
446 #define SOLVER_SOLUTION_ERASE -100
447 #define SOLVER_SOLUTION_REPLACE -101
448 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
449 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
450 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
451 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
453 typedef struct chksum Chksum;
454 typedef void *AppObjectPtr;
480 } Pool_solvable_iterator;
485 } Pool_repo_iterator;
490 } Repo_solvable_iterator;
530 Transaction *transaction;
548 typedef Dataiterator Datamatch;
553 %mixin Dataiterator "Enumerable";
554 %mixin Pool_solvable_iterator "Enumerable";
555 %mixin Pool_repo_iterator "Enumerable";
556 %mixin Repo_solvable_iterator "Enumerable";
564 %constant Id SOLVID_META;
565 %constant Id SOLVID_POS;
567 %constant int REL_EQ;
568 %constant int REL_GT;
569 %constant int REL_LT;
570 %constant int REL_ARCH;
581 # put before pool/repo so we can access the constructor
582 %nodefaultdtor Dataiterator;
583 typedef struct {} Dataiterator;
606 typedef struct {} Pool_solvable_iterator;
607 typedef struct {} Pool_repo_iterator;
608 typedef struct {} Repo_solvable_iterator;
610 %nodefaultctor Datamatch;
611 %nodefaultdtor Datamatch;
618 %nodefaultctor Datapos;
632 AppObjectPtr appdata;
639 const char * const name;
642 int const nsolvables;
643 AppObjectPtr appdata;
646 %nodefaultctor Solver;
647 %nodefaultdtor Solver;
655 %rename(xfopen) solvfp_xfopen;
656 %rename(xfopen_fd) solvfp_xfopen_fd;
658 %nodefaultctor SolvFp;
662 %newobject solvfp_xfopen;
663 %newobject solvfp_xfopen_fd;
665 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
666 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
669 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
673 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
676 sfp = solv_calloc(1, sizeof(SolvFp));
680 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
683 fp = solv_xfopen(fn, mode);
686 sfp = solv_calloc(1, sizeof(SolvFp));
711 %nodefaultctor Transaction;
712 %nodefaultdtor Transaction;
718 Transaction * const transaction;
732 return $self->fp ? fileno($self->fp) : -1;
735 return $self->fp ? dup(fileno($self->fp)) : -1;
740 return fflush($self->fp) == 0;
746 ret = fclose($self->fp) == 0;
753 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
754 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
755 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
756 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
757 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
758 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
759 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
760 static const Id SOLVER_NOOP = SOLVER_NOOP;
761 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
762 static const Id SOLVER_ERASE = SOLVER_ERASE;
763 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
764 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
765 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
766 static const Id SOLVER_LOCK = SOLVER_LOCK;
767 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
768 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
769 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
770 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
771 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
772 static const Id SOLVER_WEAK = SOLVER_WEAK;
773 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
774 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
775 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
776 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
777 static const Id SOLVER_SETEV = SOLVER_SETEV;
778 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
779 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
780 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
781 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
782 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
783 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
784 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
786 Job(Pool *pool, int how, Id what) {
787 Job *job = solv_calloc(1, sizeof(*job));
794 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
795 %newobject solvables;
799 pool_job2solvables($self->pool, &q, $self->how, $self->what);
803 %rename("isemptyupdate?") isemptyupdate;
805 bool isemptyupdate() {
806 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
809 bool __eq__(Job *j) {
810 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
812 bool __ne__(Job *j) {
813 return !Job___eq__($self, j);
815 #if defined(SWIGPERL)
816 %rename("str") __str__;
818 const char *__str__() {
819 return pool_job2str($self->pool, $self->how, $self->what, 0);
821 const char *__repr__() {
822 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
823 return pool_tmpjoin($self->pool, "<Job ", str, ">");
828 static const Id SELECTION_NAME = SELECTION_NAME;
829 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
830 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
831 static const Id SELECTION_CANON = SELECTION_CANON;
832 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
833 static const Id SELECTION_REL = SELECTION_REL;
834 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
835 static const Id SELECTION_GLOB = SELECTION_GLOB;
836 static const Id SELECTION_FLAT = SELECTION_FLAT;
837 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
838 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
839 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
841 Selection(Pool *pool) {
843 s = solv_calloc(1, sizeof(*s));
849 queue_free(&$self->q);
856 %rename("isempty?") isempty;
859 return $self->q.count == 0;
861 void filter(Selection *lsel) {
862 if ($self->pool != lsel->pool)
863 queue_empty(&$self->q);
865 selection_filter($self->pool, &$self->q, &lsel->q);
867 void add(Selection *lsel) {
868 if ($self->pool == lsel->pool)
870 selection_add($self->pool, &$self->q, &lsel->q);
871 $self->flags |= lsel->flags;
874 void add_raw(Id how, Id what) {
875 queue_push2(&$self->q, how, what);
877 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
879 Queue jobs(int flags) {
882 queue_init_clone(&q, &$self->q);
883 for (i = 0; i < q.count; i += 2)
884 q.elements[i] |= flags;
888 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
889 %newobject solvables;
893 selection_solvables($self->pool, &$self->q, &q);
897 #if defined(SWIGPERL)
898 %rename("str") __str__;
900 const char *__str__() {
901 return pool_selection2str($self->pool, &$self->q, 0);
903 const char *__repr__() {
904 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
905 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
911 return (Chksum *)solv_chksum_create(type);
913 Chksum(Id type, const char *hex) {
914 unsigned char buf[64];
915 int l = solv_chksum_len(type);
918 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
920 return (Chksum *)solv_chksum_create_from_bin(type, buf);
923 solv_chksum_free($self, 0);
927 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
928 return solv_chksum_get_type(chksum);
931 void add(const char *str) {
932 solv_chksum_add($self, str, strlen((char *)str));
934 void add_fp(FILE *fp) {
937 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
938 solv_chksum_add($self, buf, l);
939 rewind(fp); /* convenience */
941 void add_fd(int fd) {
944 while ((l = read(fd, buf, sizeof(buf))) > 0)
945 solv_chksum_add($self, buf, l);
946 lseek(fd, 0, 0); /* convenience */
948 void add_stat(const char *filename) {
950 if (stat(filename, &stb))
951 memset(&stb, 0, sizeof(stb));
952 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
953 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
954 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
955 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
957 void add_fstat(int fd) {
960 memset(&stb, 0, sizeof(stb));
961 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
962 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
963 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
964 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
968 const unsigned char *b;
969 b = solv_chksum_get($self, &l);
970 return cdata_void((void *)b, l);
975 const unsigned char *b;
978 b = solv_chksum_get($self, &l);
979 ret = solv_malloc(2 * l + 1);
980 solv_bin2hex(b, l, ret);
984 bool __eq__(Chksum *chk) {
986 const unsigned char *b, *bo;
989 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
991 b = solv_chksum_get($self, &l);
992 bo = solv_chksum_get(chk, 0);
993 return memcmp(b, bo, l) == 0;
995 bool __ne__(Chksum *chk) {
996 return !Chksum___eq__($self, chk);
998 #if defined(SWIGRUBY)
999 %rename("to_s") __str__;
1000 %rename("inspect") __repr__;
1002 #if defined(SWIGPERL)
1003 %rename("str") __str__;
1006 const char *__str__() {
1009 if (solv_chksum_isfinished($self))
1010 h = Chksum_hex($self);
1011 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1012 solv_free((void *)h);
1015 %newobject __repr__;
1016 const char *__repr__() {
1017 const char *h = Chksum___str__($self);
1018 const char *str = solv_dupjoin("<Chksum ", h, ">");
1019 solv_free((void *)h);
1025 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1026 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1027 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1028 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1029 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1030 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1031 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1032 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1033 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1036 Pool *pool = pool_create();
1041 void set_debuglevel(int level) {
1042 pool_setdebuglevel($self, level);
1044 int set_flag(int flag, int value) {
1045 return pool_set_flag($self, flag, value);
1047 int get_flag(int flag) {
1048 return pool_get_flag($self, flag);
1050 void set_rootdir(const char *rootdir) {
1051 pool_set_rootdir($self, rootdir);
1053 const char *get_rootdir(int flag) {
1054 return pool_get_rootdir($self);
1056 #if defined(SWIGPYTHON)
1058 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1059 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1060 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1061 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1066 return 0; /* exception */
1067 ecode = SWIG_AsVal_int(result, &vresult);
1069 return SWIG_IsOK(ecode) ? vresult : 0;
1072 void set_loadcallback(PyObject *callable) {
1073 if ($self->loadcallback == loadcallback) {
1074 PyObject *obj = $self->loadcallbackdata;
1078 Py_INCREF(callable);
1080 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1083 #if defined(SWIGPERL)
1085 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1089 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1094 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1096 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1106 void set_loadcallback(SV *callable) {
1107 if ($self->loadcallback == loadcallback)
1108 SvREFCNT_dec($self->loadcallbackdata);
1110 SvREFCNT_inc(callable);
1111 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1115 #if defined(SWIGRUBY)
1117 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1118 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1119 VALUE callable = (VALUE)d;
1120 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1121 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1122 return res == Qtrue;
1124 SWIGINTERN void mark_Pool(void *ptr) {
1126 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1127 VALUE callable = (VALUE)pool->loadcallbackdata;
1128 rb_gc_mark(callable);
1132 %typemap(in, numinputs=0) VALUE callable {
1133 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1135 void set_loadcallback(VALUE callable) {
1136 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1141 Pool_set_loadcallback($self, 0);
1144 Id str2id(const char *str, bool create=1) {
1145 return pool_str2id($self, str, create);
1148 Dep *Dep(const char *str, bool create=1) {
1149 Id id = pool_str2id($self, str, create);
1150 return new_Dep($self, id);
1152 const char *id2str(Id id) {
1153 return pool_id2str($self, id);
1155 const char *dep2str(Id id) {
1156 return pool_dep2str($self, id);
1158 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1159 return pool_rel2id($self, name, evr, flags, create);
1161 Id id2langid(Id id, const char *lang, bool create=1) {
1162 return pool_id2langid($self, id, lang, create);
1164 void setarch(const char *arch = 0) {
1173 pool_setarch($self, arch);
1175 Repo *add_repo(const char *name) {
1176 return repo_create($self, name);
1178 const char *lookup_str(Id entry, Id keyname) {
1179 return pool_lookup_str($self, entry, keyname);
1181 Id lookup_id(Id entry, Id keyname) {
1182 return pool_lookup_id($self, entry, keyname);
1184 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1185 return pool_lookup_num($self, entry, keyname, notfound);
1187 bool lookup_void(Id entry, Id keyname) {
1188 return pool_lookup_void($self, entry, keyname);
1190 %newobject lookup_checksum;
1191 Chksum *lookup_checksum(Id entry, Id keyname) {
1193 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1194 return solv_chksum_create_from_bin(type, b);
1197 %newobject Dataiterator;
1198 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1199 return new_Dataiterator($self, 0, p, key, match, flags);
1201 const char *solvid2str(Id solvid) {
1202 return pool_solvid2str($self, solvid);
1204 void addfileprovides() {
1205 pool_addfileprovides($self);
1207 Queue addfileprovides_queue() {
1210 pool_addfileprovides_queue($self, &r, 0);
1213 void createwhatprovides() {
1214 pool_createwhatprovides($self);
1217 %newobject id2solvable;
1218 XSolvable *id2solvable(Id id) {
1219 return new_XSolvable($self, id);
1221 %newobject solvables;
1222 Pool_solvable_iterator * const solvables;
1224 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1225 return new_Pool_solvable_iterator(pool);
1228 %newobject solvables_iter;
1229 Pool_solvable_iterator * solvables_iter() {
1230 return new_Pool_solvable_iterator($self);
1233 Repo *id2repo(Id id) {
1234 if (id < 1 || id >= $self->nrepos)
1236 return pool_id2repo($self, id);
1240 Pool_repo_iterator * const repos;
1242 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1243 return new_Pool_repo_iterator(pool);
1246 %newobject repos_iter;
1247 Pool_repo_iterator * repos_iter() {
1248 return new_Pool_repo_iterator($self);
1253 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1254 pool_set_installed(pool, installed);
1256 Repo *Pool_installed_get(Pool *pool) {
1257 return pool->installed;
1261 Queue matchprovidingids(const char *match, int flags) {
1267 for (id = 1; id < pool->ss.nstrings; id++)
1268 if (pool->whatprovides[id])
1272 if (!datamatcher_init(&ma, match, flags)) {
1273 for (id = 1; id < pool->ss.nstrings; id++)
1274 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1276 datamatcher_free(&ma);
1283 Job *Job(int how, Id what) {
1284 return new_Job($self, how, what);
1287 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1288 %newobject whatprovides;
1289 Queue whatprovides(DepId dep) {
1294 FOR_PROVIDES(p, pp, dep)
1299 Id towhatprovides(Queue q) {
1300 return pool_queuetowhatprovides($self, &q);
1304 %rename("isknownarch?") isknownarch;
1306 bool isknownarch(DepId id) {
1308 if (!id || id == ID_EMPTY)
1310 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1312 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1319 return solver_create($self);
1322 %newobject Selection;
1323 Selection *Selection() {
1324 return new_Selection($self);
1326 %newobject Selection_all;
1327 Selection *Selection_all(int setflags=0) {
1328 Selection *sel = new_Selection($self);
1329 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1333 Selection *select(const char *name, int flags) {
1334 Selection *sel = new_Selection($self);
1335 sel->flags = selection_make($self, &sel->q, name, flags);
1339 void setpooljobs_helper(Queue jobs) {
1340 queue_free(&$self->pooljobs);
1341 queue_init_clone(&$self->pooljobs, &jobs);
1343 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1344 %newobject getpooljobs;
1345 Queue getpooljobs() {
1347 queue_init_clone(&q, &$self->pooljobs);
1351 #if defined(SWIGPYTHON)
1353 def setpooljobs(self, jobs):
1355 for job in jobs: j += [job.how, job.what]
1356 self.setpooljobs_helper(j)
1359 #if defined(SWIGPERL)
1361 sub solv::Solver::setpooljobs {
1362 my ($self, $jobs) = @_;
1363 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1364 return $self->setpooljobs_helper(\@j);
1368 #if defined(SWIGRUBY)
1371 "class Solv::Pool\n"
1372 " def setpooljobs(jobs)\n"
1374 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1375 " setpooljobs_helper(jl)\n"
1384 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1385 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1386 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1387 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1388 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1389 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1390 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1391 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1392 #ifdef ENABLE_SUSEREPO
1393 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1396 void free(bool reuseids = 0) {
1397 repo_free($self, reuseids);
1399 void empty(bool reuseids = 0) {
1400 repo_empty($self, reuseids);
1403 %rename("isempty?") isempty;
1406 return !$self->nsolvables;
1408 bool add_solv(const char *name, int flags = 0) {
1409 FILE *fp = fopen(name, "r");
1413 r = repo_add_solv($self, fp, flags);
1417 bool add_solv(FILE *fp, int flags = 0) {
1418 return repo_add_solv($self, fp, flags) == 0;
1421 %newobject add_solvable;
1422 XSolvable *add_solvable() {
1423 Id solvid = repo_add_solvable($self);
1424 return new_XSolvable($self->pool, solvid);
1428 bool add_rpmdb(int flags = 0) {
1429 return repo_add_rpmdb($self, 0, flags) == 0;
1431 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1432 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1434 Id add_rpm(const char *name, int flags = 0) {
1435 return repo_add_rpm($self, name, flags);
1438 #ifdef ENABLE_RPMDB_PUBKEYS
1439 bool add_rpmdb_pubkeys(int flags = 0) {
1440 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1442 Id add_pubkey(const char *key, int flags = 0) {
1443 return repo_add_pubkey($self, key, flags);
1447 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1448 return repo_add_rpmmd($self, fp, language, flags) == 0;
1450 bool add_repomdxml(FILE *fp, int flags = 0) {
1451 return repo_add_repomdxml($self, fp, flags) == 0;
1453 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1454 return repo_add_updateinfoxml($self, fp, flags) == 0;
1456 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1457 return repo_add_deltainfoxml($self, fp, flags) == 0;
1460 #ifdef ENABLE_DEBIAN
1461 bool add_debdb(int flags = 0) {
1462 return repo_add_debdb($self, flags) == 0;
1464 bool add_debpackages(FILE *fp, int flags = 0) {
1465 return repo_add_debpackages($self, fp, flags) == 0;
1467 Id add_deb(const char *name, int flags = 0) {
1468 return repo_add_deb($self, name, flags);
1471 #ifdef ENABLE_SUSEREPO
1472 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1473 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1475 bool add_content(FILE *fp, int flags = 0) {
1476 return repo_add_content($self, fp, flags) == 0;
1478 bool add_products(const char *proddir, int flags = 0) {
1479 return repo_add_products($self, proddir, flags) == 0;
1482 #ifdef ENABLE_MDKREPO
1483 bool add_mdk(FILE *fp, int flags = 0) {
1484 return repo_add_mdk($self, fp, flags) == 0;
1486 bool add_mdk_info(FILE *fp, int flags = 0) {
1487 return repo_add_mdk_info($self, fp, flags) == 0;
1490 #ifdef ENABLE_ARCHREPO
1491 bool add_arch_repo(FILE *fp, int flags = 0) {
1492 return repo_add_arch_repo($self, fp, flags) == 0;
1494 bool add_arch_local(const char *dir, int flags = 0) {
1495 return repo_add_arch_local($self, dir, flags) == 0;
1497 Id add_arch_pkg(const char *name, int flags = 0) {
1498 return repo_add_arch_pkg($self, name, flags);
1501 void internalize() {
1502 repo_internalize($self);
1504 bool write(FILE *fp) {
1505 return repo_write($self, fp) == 0;
1507 # HACK, remove if no longer needed!
1508 bool write_first_repodata(FILE *fp) {
1509 int oldnrepodata = $self->nrepodata;
1511 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1512 res = repo_write($self, fp);
1513 $self->nrepodata = oldnrepodata;
1517 %newobject Dataiterator;
1518 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1519 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1524 SWIGINTERN Id Repo_id_get(Repo *repo) {
1525 return repo->repoid;
1528 %newobject solvables;
1529 Repo_solvable_iterator * const solvables;
1531 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1532 return new_Repo_solvable_iterator(repo);
1536 Datapos * const meta;
1538 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1539 Datapos *pos = solv_calloc(1, sizeof(*pos));
1540 pos->solvid = SOLVID_META;
1546 %newobject solvables_iter;
1547 Repo_solvable_iterator *solvables_iter() {
1548 return new_Repo_solvable_iterator($self);
1551 %newobject add_repodata;
1552 XRepodata *add_repodata(int flags = 0) {
1553 Repodata *rd = repo_add_repodata($self, flags);
1554 return new_XRepodata($self, rd->repodataid);
1557 void create_stubs() {
1559 if (!$self->nrepodata)
1561 data = repo_id2repodata($self, $self->nrepodata - 1);
1562 if (data->state != REPODATA_STUB)
1563 repodata_create_stubs(data);
1566 %rename("iscontiguous?") iscontiguous;
1568 bool iscontiguous() {
1570 for (i = $self->start; i < $self->end; i++)
1571 if ($self->pool->solvables[i].repo != $self)
1575 %newobject first_repodata;
1576 XRepodata *first_repodata() {
1579 if ($self->nrepodata < 2)
1581 /* make sure all repodatas but the first are extensions */
1582 data = repo_id2repodata($self, 1);
1583 if (data->loadcallback)
1585 for (i = 2; i < $self->nrepodata; i++)
1587 data = repo_id2repodata($self, i);
1588 if (!data->loadcallback)
1589 return 0; /* oops, not an extension */
1591 return new_XRepodata($self, 1);
1594 %newobject Selection;
1595 Selection *Selection(int setflags=0) {
1596 Selection *sel = new_Selection($self->pool);
1597 setflags |= SOLVER_SETREPO;
1598 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1602 bool __eq__(Repo *repo) {
1603 return $self == repo;
1605 bool __ne__(Repo *repo) {
1606 return $self != repo;
1608 #if defined(SWIGPERL)
1609 %rename("str") __str__;
1612 const char *__str__() {
1615 return solv_strdup($self->name);
1616 sprintf(buf, "Repo#%d", $self->repoid);
1617 return solv_strdup(buf);
1619 %newobject __repr__;
1620 const char *__repr__() {
1624 sprintf(buf, "<Repo #%d ", $self->repoid);
1625 return solv_dupjoin(buf, $self->name, ">");
1627 sprintf(buf, "<Repo #%d>", $self->repoid);
1628 return solv_strdup(buf);
1632 %extend Dataiterator {
1633 static const int SEARCH_STRING = SEARCH_STRING;
1634 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1635 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1636 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1637 static const int SEARCH_GLOB = SEARCH_GLOB;
1638 static const int SEARCH_REGEX = SEARCH_REGEX;
1639 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1640 static const int SEARCH_FILES = SEARCH_FILES;
1641 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1642 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1644 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1645 Dataiterator *di = solv_calloc(1, sizeof(*di));
1646 dataiterator_init(di, pool, repo, p, key, match, flags);
1650 dataiterator_free($self);
1653 #if defined(SWIGPYTHON)
1654 %newobject __iter__;
1655 Dataiterator *__iter__() {
1657 ndi = solv_calloc(1, sizeof(*ndi));
1658 dataiterator_init_clone(ndi, $self);
1661 %rename("next") __next__();
1662 %exception __next__ {
1665 PyErr_SetString(PyExc_StopIteration,"no more matches");
1672 perliter(solv::Dataiterator)
1675 %newobject __next__;
1676 Datamatch *__next__() {
1678 if (!dataiterator_step($self)) {
1681 ndi = solv_calloc(1, sizeof(*ndi));
1682 dataiterator_init_clone(ndi, $self);
1683 dataiterator_strdup(ndi);
1689 while ((d = Dataiterator___next__($self)) != 0) {
1690 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1694 void prepend_keyname(Id key) {
1695 dataiterator_prepend_keyname($self, key);
1697 void skip_solvable() {
1698 dataiterator_skip_solvable($self);
1703 Id lookup_id(Id keyname) {
1704 Pool *pool = $self->repo->pool;
1705 Datapos oldpos = pool->pos;
1708 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1712 const char *lookup_str(Id keyname) {
1713 Pool *pool = $self->repo->pool;
1714 Datapos oldpos = pool->pos;
1717 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1721 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1722 Pool *pool = $self->repo->pool;
1723 Datapos oldpos = pool->pos;
1724 unsigned long long r;
1726 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1730 bool lookup_void(Id keyname) {
1731 Pool *pool = $self->repo->pool;
1732 Datapos oldpos = pool->pos;
1735 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1739 %newobject lookup_checksum;
1740 Chksum *lookup_checksum(Id keyname) {
1741 Pool *pool = $self->repo->pool;
1742 Datapos oldpos = pool->pos;
1744 const unsigned char *b;
1746 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1748 return solv_chksum_create_from_bin(type, b);
1750 const char *lookup_deltaseq() {
1751 Pool *pool = $self->repo->pool;
1752 Datapos oldpos = pool->pos;
1755 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1757 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1758 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1763 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1764 Pool *pool = $self->repo->pool;
1765 Datapos oldpos = pool->pos;
1768 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1772 Queue lookup_idarray(Id keyname) {
1773 Pool *pool = $self->repo->pool;
1774 Datapos oldpos = pool->pos;
1778 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1782 %newobject Dataiterator;
1783 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1784 Pool *pool = $self->repo->pool;
1785 Datapos oldpos = pool->pos;
1788 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1796 dataiterator_free($self);
1799 %newobject solvable;
1800 XSolvable * const solvable;
1802 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1803 return new_XSolvable(di->pool, di->solvid);
1807 return $self->key->name;
1809 const char *key_idstr() {
1810 return pool_id2str($self->pool, $self->key->name);
1813 return $self->key->type;
1815 const char *type_idstr() {
1816 return pool_id2str($self->pool, $self->key->type);
1819 return $self->kv.id;
1821 const char *idstr() {
1822 return pool_id2str($self->pool, $self->kv.id);
1825 return $self->kv.str;
1827 unsigned long long num() {
1828 if ($self->key->type == REPOKEY_TYPE_NUM)
1829 return SOLV_KV_NUM64(&$self->kv);
1830 return $self->kv.num;
1833 return $self->kv.num2;
1837 Pool *pool = $self->pool;
1838 Datapos *pos, oldpos = pool->pos;
1839 dataiterator_setpos($self);
1840 pos = solv_calloc(1, sizeof(*pos));
1845 %newobject parentpos;
1846 Datapos *parentpos() {
1847 Pool *pool = $self->pool;
1848 Datapos *pos, oldpos = pool->pos;
1849 dataiterator_setpos_parent($self);
1850 pos = solv_calloc(1, sizeof(*pos));
1855 #if defined(SWIGPERL)
1856 %rename("str") __str__;
1858 const char *__str__() {
1859 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1861 return $self->kv.str;
1865 %extend Pool_solvable_iterator {
1866 Pool_solvable_iterator(Pool *pool) {
1867 Pool_solvable_iterator *s;
1868 s = solv_calloc(1, sizeof(*s));
1872 #if defined(SWIGPYTHON)
1873 %newobject __iter__;
1874 Pool_solvable_iterator *__iter__() {
1875 Pool_solvable_iterator *s;
1876 s = solv_calloc(1, sizeof(*s));
1880 %rename("next") __next__();
1881 %exception __next__ {
1884 PyErr_SetString(PyExc_StopIteration,"no more matches");
1891 perliter(solv::Pool_solvable_iterator)
1893 %newobject __next__;
1894 XSolvable *__next__() {
1895 Pool *pool = $self->pool;
1896 if ($self->id >= pool->nsolvables)
1898 while (++$self->id < pool->nsolvables)
1899 if (pool->solvables[$self->id].repo)
1900 return new_XSolvable(pool, $self->id);
1906 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1907 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1911 %newobject __getitem__;
1912 XSolvable *__getitem__(Id key) {
1913 Pool *pool = $self->pool;
1914 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1915 return new_XSolvable(pool, key);
1919 return $self->pool->nsolvables;
1923 %extend Pool_repo_iterator {
1924 Pool_repo_iterator(Pool *pool) {
1925 Pool_repo_iterator *s;
1926 s = solv_calloc(1, sizeof(*s));
1930 #if defined(SWIGPYTHON)
1931 %newobject __iter__;
1932 Pool_repo_iterator *__iter__() {
1933 Pool_repo_iterator *s;
1934 s = solv_calloc(1, sizeof(*s));
1938 %rename("next") __next__();
1939 %exception __next__ {
1942 PyErr_SetString(PyExc_StopIteration,"no more matches");
1947 %newobject __next__;
1949 Pool *pool = $self->pool;
1950 if ($self->id >= pool->nrepos)
1952 while (++$self->id < pool->nrepos) {
1953 Repo *r = pool_id2repo(pool, $self->id);
1962 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1963 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1967 Repo *__getitem__(Id key) {
1968 Pool *pool = $self->pool;
1969 if (key > 0 && key < pool->nrepos)
1970 return pool_id2repo(pool, key);
1974 return $self->pool->nrepos;
1978 %extend Repo_solvable_iterator {
1979 Repo_solvable_iterator(Repo *repo) {
1980 Repo_solvable_iterator *s;
1981 s = solv_calloc(1, sizeof(*s));
1985 #if defined(SWIGPYTHON)
1986 %newobject __iter__;
1987 Repo_solvable_iterator *__iter__() {
1988 Repo_solvable_iterator *s;
1989 s = solv_calloc(1, sizeof(*s));
1993 %rename("next") __next__();
1994 %exception __next__ {
1997 PyErr_SetString(PyExc_StopIteration,"no more matches");
2002 %newobject __next__;
2003 XSolvable *__next__() {
2004 Repo *repo = $self->repo;
2005 Pool *pool = repo->pool;
2006 if (repo->start > 0 && $self->id < repo->start)
2007 $self->id = repo->start - 1;
2008 if ($self->id >= repo->end)
2010 while (++$self->id < repo->end)
2011 if (pool->solvables[$self->id].repo == repo)
2012 return new_XSolvable(pool, $self->id);
2018 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2019 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2023 %newobject __getitem__;
2024 XSolvable *__getitem__(Id key) {
2025 Repo *repo = $self->repo;
2026 Pool *pool = repo->pool;
2027 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2028 return new_XSolvable(pool, key);
2032 return $self->repo->pool->nsolvables;
2037 Dep(Pool *pool, Id id) {
2041 s = solv_calloc(1, sizeof(*s));
2047 Dep *Rel(int flags, DepId evrid, bool create=1) {
2048 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2051 return new_Dep($self->pool, id);
2053 %newobject Selection_name;
2054 Selection *Selection_name(int setflags=0) {
2055 Selection *sel = new_Selection($self->pool);
2056 if (ISRELDEP($self->id)) {
2057 Reldep *rd = GETRELDEP($self->pool, $self->id);
2058 if (rd->flags == REL_EQ) {
2059 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2060 if (ISRELDEP(rd->name))
2061 rd = GETRELDEP($self->pool, rd->name);
2063 if (rd->flags == REL_ARCH)
2064 setflags |= SOLVER_SETARCH;
2066 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2069 %newobject Selection_provides;
2070 Selection *Selection_provides(int setflags=0) {
2071 Selection *sel = new_Selection($self->pool);
2072 if (ISRELDEP($self->id)) {
2073 Reldep *rd = GETRELDEP($self->pool, $self->id);
2074 if (rd->flags == REL_ARCH)
2075 setflags |= SOLVER_SETARCH;
2077 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2081 return pool_dep2str($self->pool, $self->id);
2083 bool __eq__(Dep *s) {
2084 return $self->pool == s->pool && $self->id == s->id;
2086 bool __ne__(Dep *s) {
2087 return !Dep___eq__($self, s);
2089 #if defined(SWIGPERL)
2090 %rename("str") __str__;
2092 const char *__str__() {
2093 return pool_dep2str($self->pool, $self->id);
2095 %newobject __repr__;
2096 const char *__repr__() {
2098 sprintf(buf, "<Id #%d ", $self->id);
2099 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2104 XSolvable(Pool *pool, Id id) {
2106 if (!id || id >= pool->nsolvables)
2108 s = solv_calloc(1, sizeof(*s));
2114 return pool_solvid2str($self->pool, $self->id);
2116 const char *lookup_str(Id keyname) {
2117 return pool_lookup_str($self->pool, $self->id, keyname);
2119 Id lookup_id(Id keyname) {
2120 return pool_lookup_id($self->pool, $self->id, keyname);
2122 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2123 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2125 bool lookup_void(Id keyname) {
2126 return pool_lookup_void($self->pool, $self->id, keyname);
2128 %newobject lookup_checksum;
2129 Chksum *lookup_checksum(Id keyname) {
2131 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2132 return solv_chksum_create_from_bin(type, b);
2134 Queue lookup_idarray(Id keyname, Id marker = -1) {
2135 Solvable *s = $self->pool->solvables + $self->id;
2138 if (marker == -1 || marker == 1) {
2139 if (keyname == SOLVABLE_PROVIDES)
2140 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2141 else if (keyname == SOLVABLE_REQUIRES)
2142 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2146 solvable_lookup_deparray(s, keyname, &r, marker);
2149 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2150 %newobject lookup_deparray;
2151 Queue lookup_deparray(Id keyname, Id marker = -1) {
2152 Solvable *s = $self->pool->solvables + $self->id;
2155 if (marker == -1 || marker == 1) {
2156 if (keyname == SOLVABLE_PROVIDES)
2157 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2158 else if (keyname == SOLVABLE_REQUIRES)
2159 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2163 solvable_lookup_deparray(s, keyname, &r, marker);
2166 const char *lookup_location(unsigned int *OUTPUT) {
2167 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2169 %newobject Dataiterator;
2170 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2171 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2174 %rename("installable?") installable;
2176 bool installable() {
2177 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2180 %rename("isinstalled?") isinstalled;
2182 bool isinstalled() {
2183 Pool *pool = $self->pool;
2184 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2189 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2190 Pool *pool = xs->pool;
2191 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2193 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2194 Pool *pool = xs->pool;
2195 return pool_id2str(pool, pool->solvables[xs->id].name);
2200 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2201 xs->pool->solvables[xs->id].name = nameid;
2203 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2204 return xs->pool->solvables[xs->id].name;
2209 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2210 Pool *pool = xs->pool;
2211 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2213 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2214 Pool *pool = xs->pool;
2215 return pool_id2str(pool, pool->solvables[xs->id].evr);
2220 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2221 xs->pool->solvables[xs->id].evr = evrid;
2223 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2224 return xs->pool->solvables[xs->id].evr;
2229 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2230 Pool *pool = xs->pool;
2231 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2233 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2234 Pool *pool = xs->pool;
2235 return pool_id2str(pool, pool->solvables[xs->id].arch);
2240 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2241 xs->pool->solvables[xs->id].arch = archid;
2243 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2244 return xs->pool->solvables[xs->id].arch;
2249 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2250 Pool *pool = xs->pool;
2251 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2253 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2254 Pool *pool = xs->pool;
2255 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2260 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2261 xs->pool->solvables[xs->id].vendor = vendorid;
2263 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2264 return xs->pool->solvables[xs->id].vendor;
2269 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2270 return xs->pool->solvables[xs->id].repo;
2274 /* old interface, please use the generic add_deparray instead */
2275 void add_provides(DepId id, Id marker = -1) {
2276 Solvable *s = $self->pool->solvables + $self->id;
2277 if (marker == -1 || marker == 1)
2278 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2279 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2281 void add_obsoletes(DepId id) {
2282 Solvable *s = $self->pool->solvables + $self->id;
2283 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2285 void add_conflicts(DepId id) {
2286 Solvable *s = $self->pool->solvables + $self->id;
2287 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2289 void add_requires(DepId id, Id marker = -1) {
2290 Solvable *s = $self->pool->solvables + $self->id;
2291 if (marker == -1 || marker == 1)
2292 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2293 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2295 void add_recommends(DepId id) {
2296 Solvable *s = $self->pool->solvables + $self->id;
2297 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2299 void add_suggests(DepId id) {
2300 Solvable *s = $self->pool->solvables + $self->id;
2301 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2303 void add_supplements(DepId id) {
2304 Solvable *s = $self->pool->solvables + $self->id;
2305 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2307 void add_enhances(DepId id) {
2308 Solvable *s = $self->pool->solvables + $self->id;
2309 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2312 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2313 Solvable *s = $self->pool->solvables + $self->id;
2314 if (marker == -1 || marker == 1) {
2315 if (keyname == SOLVABLE_PROVIDES)
2316 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2317 else if (keyname == SOLVABLE_REQUIRES)
2318 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2322 solvable_add_deparray(s, keyname, id, marker);
2325 %newobject Selection;
2326 Selection *Selection(int setflags=0) {
2327 Selection *sel = new_Selection($self->pool);
2328 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2332 bool __eq__(XSolvable *s) {
2333 return $self->pool == s->pool && $self->id == s->id;
2335 bool __ne__(XSolvable *s) {
2336 return !XSolvable___eq__($self, s);
2338 #if defined(SWIGPERL)
2339 %rename("str") __str__;
2341 const char *__str__() {
2342 return pool_solvid2str($self->pool, $self->id);
2344 %newobject __repr__;
2345 const char *__repr__() {
2347 sprintf(buf, "<Solvable #%d ", $self->id);
2348 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2353 Problem(Solver *solv, Id id) {
2355 p = solv_calloc(1, sizeof(*p));
2360 %newobject findproblemrule;
2361 XRule *findproblemrule() {
2362 Id r = solver_findproblemrule($self->solv, $self->id);
2363 return new_XRule($self->solv, r);
2365 %newobject findallproblemrules;
2366 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2367 Queue findallproblemrules(int unfiltered=0) {
2368 Solver *solv = $self->solv;
2373 solver_findallproblemrules(solv, $self->id, &q);
2376 for (i = j = 0; i < q.count; i++)
2378 SolverRuleinfo rclass;
2379 probr = q.elements[i];
2380 rclass = solver_ruleclass(solv, probr);
2381 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2383 q.elements[j++] = probr;
2386 queue_truncate(&q, j);
2390 int solution_count() {
2391 return solver_solution_count($self->solv, $self->id);
2393 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2394 %newobject solutions;
2399 cnt = solver_solution_count($self->solv, $self->id);
2400 for (i = 1; i <= cnt; i++)
2407 Solution(Problem *p, Id id) {
2409 s = solv_calloc(1, sizeof(*s));
2411 s->problemid = p->id;
2415 int element_count() {
2416 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2419 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2420 %newobject elements;
2421 Queue elements(bool expandreplaces=0) {
2425 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2426 for (i = 1; i <= cnt; i++)
2429 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2431 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2437 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2438 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2440 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2441 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2442 queue_push2(&q, p, rp);
2444 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2445 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2446 queue_push2(&q, p, rp);
2448 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2449 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2450 queue_push2(&q, p, rp);
2452 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2453 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2454 queue_push2(&q, p, rp);
2459 queue_push2(&q, i, type);
2460 queue_push2(&q, p, rp);
2466 %extend Solutionelement {
2467 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2469 e = solv_calloc(1, sizeof(*e));
2471 e->problemid = problemid;
2483 if (p == SOLVER_SOLUTION_ERASE)
2488 else if (p == SOLVER_SOLUTION_REPLACE)
2493 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2494 illegal = POLICY_ILLEGAL_DOWNGRADE;
2495 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2496 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2497 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2498 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2499 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2500 illegal = POLICY_ILLEGAL_NAMECHANGE;
2502 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, illegal, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2503 return solver_solutionelement2str($self->solv, p, rp);
2505 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2506 %newobject replaceelements;
2507 Queue replaceelements() {
2512 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2515 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2516 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2517 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2518 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2519 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2520 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2521 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2522 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2523 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2525 queue_push(&q, $self->type);
2528 int illegalreplace() {
2529 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2531 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2533 %newobject solvable;
2534 XSolvable * const solvable;
2535 %newobject replacement;
2536 XSolvable * const replacement;
2539 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2540 return new_XSolvable(e->solv->pool, e->p);
2542 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2543 return new_XSolvable(e->solv->pool, e->rp);
2545 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2546 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2548 return (e->p - 1) / 2;
2553 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2554 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2555 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2556 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2557 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2558 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2559 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2560 if ($self->type == SOLVER_SOLUTION_ERASE)
2561 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2567 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2568 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2569 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2570 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2571 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2572 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2573 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2574 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2575 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2576 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2577 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2578 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2579 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2580 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2581 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2582 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2583 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2584 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2585 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2586 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2587 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2588 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2590 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2591 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2592 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2593 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2594 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2595 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2596 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2597 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2598 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2599 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2600 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2602 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2603 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2604 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2605 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2607 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2608 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2609 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2610 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2611 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2612 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2613 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2614 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2615 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2616 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2617 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2618 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2624 int set_flag(int flag, int value) {
2625 return solver_set_flag($self, flag, value);
2627 int get_flag(int flag) {
2628 return solver_get_flag($self, flag);
2630 #if defined(SWIGPYTHON)
2632 def solve(self, jobs):
2634 for job in jobs: j += [job.how, job.what]
2635 return self.solve_helper(j)
2638 #if defined(SWIGPERL)
2640 sub solv::Solver::solve {
2641 my ($self, $jobs) = @_;
2642 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2643 return $self->solve_helper(\@j);
2647 #if defined(SWIGRUBY)
2650 "class Solv::Solver\n"
2651 " def solve(jobs)\n"
2653 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2654 " solve_helper(jl)\n"
2660 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2661 %newobject solve_helper;
2662 Queue solve_helper(Queue jobs) {
2666 solver_solve($self, &jobs);
2667 cnt = solver_problem_count($self);
2668 for (i = 1; i <= cnt; i++)
2672 %newobject transaction;
2673 Transaction *transaction() {
2674 return solver_create_transaction($self);
2678 %extend Transaction {
2679 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2680 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2681 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2682 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2683 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2684 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2685 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2686 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2687 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2688 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2689 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2690 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2691 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2692 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2693 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2694 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2695 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2696 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2697 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2698 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2699 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2700 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2701 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2702 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2703 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2704 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2705 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2706 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2708 transaction_free($self);
2711 %rename("isempty?") isempty;
2714 return $self->steps.count == 0;
2717 %newobject othersolvable;
2718 XSolvable *othersolvable(XSolvable *s) {
2719 Id op = transaction_obs_pkg($self, s->id);
2720 return new_XSolvable($self->pool, op);
2723 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2724 %newobject allothersolvables;
2725 Queue allothersolvables(XSolvable *s) {
2728 transaction_all_obs_pkgs($self, s->id, &q);
2732 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2733 %newobject classify;
2734 Queue classify(int mode = 0) {
2737 transaction_classify($self, mode, &q);
2741 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2742 %newobject newpackages;
2743 Queue newpackages() {
2747 cut = transaction_installedresult(self, &q);
2748 queue_truncate(&q, cut);
2752 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2753 %newobject keptpackages;
2754 Queue keptpackages() {
2758 cut = transaction_installedresult(self, &q);
2760 queue_deleten(&q, 0, cut);
2764 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2768 queue_init_clone(&q, &$self->steps);
2772 int steptype(XSolvable *s, int mode) {
2773 return transaction_type($self, s->id, mode);
2775 int calc_installsizechange() {
2776 return transaction_calc_installsizechange($self);
2778 void order(int flags=0) {
2779 transaction_order($self, flags);
2783 %extend TransactionClass {
2784 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2785 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2786 cl->transaction = trans;
2790 cl->fromid = fromid;
2794 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2795 %newobject solvables;
2799 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2802 const char * const fromstr;
2803 const char * const tostr;
2805 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
2806 return pool_id2str(cl->transaction->pool, cl->fromid);
2808 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
2809 return pool_id2str(cl->transaction->pool, cl->toid);
2815 XRule(Solver *solv, Id id) {
2818 XRule *xr = solv_calloc(1, sizeof(*xr));
2825 SWIGINTERN int XRule_type_get(XRule *xr) {
2826 return solver_ruleclass(xr->solv, xr->id);
2831 Id type, source, target, dep;
2832 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2833 return new_Ruleinfo($self, type, source, target, dep);
2835 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2836 %newobject allinfos;
2840 solver_allruleinfos($self->solv, $self->id, &q);
2844 bool __eq__(XRule *xr) {
2845 return $self->solv == xr->solv && $self->id == xr->id;
2847 bool __ne__(XRule *xr) {
2848 return !XRule___eq__($self, xr);
2850 %newobject __repr__;
2851 const char *__repr__() {
2853 sprintf(buf, "<Rule #%d>", $self->id);
2854 return solv_strdup(buf);
2859 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
2860 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2864 ri->source = source;
2865 ri->target = target;
2866 ri->dep_id = dep_id;
2869 %newobject solvable;
2870 XSolvable * const solvable;
2871 %newobject othersolvable;
2872 XSolvable * const othersolvable;
2876 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2877 return new_XSolvable(ri->solv->pool, ri->source);
2879 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2880 return new_XSolvable(ri->solv->pool, ri->target);
2882 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
2883 return new_Dep(ri->solv->pool, ri->dep_id);
2886 const char *problemstr() {
2887 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
2892 XRepodata(Repo *repo, Id id) {
2893 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2899 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2901 void set_id(Id solvid, Id keyname, DepId id) {
2902 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2904 void set_str(Id solvid, Id keyname, const char *str) {
2905 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2907 void set_poolstr(Id solvid, Id keyname, const char *str) {
2908 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2910 void add_idarray(Id solvid, Id keyname, DepId id) {
2911 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2913 void add_flexarray(Id solvid, Id keyname, Id handle) {
2914 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2916 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2917 const unsigned char *buf = solv_chksum_get(chksum, 0);
2919 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2921 const char *lookup_str(Id solvid, Id keyname) {
2922 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2924 Queue lookup_idarray(Id solvid, Id keyname) {
2927 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2930 %newobject lookup_checksum;
2931 Chksum *lookup_checksum(Id solvid, Id keyname) {
2933 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2934 return solv_chksum_create_from_bin(type, b);
2936 void internalize() {
2937 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2939 void create_stubs() {
2940 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2942 bool write(FILE *fp) {
2943 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
2945 bool add_solv(FILE *fp, int flags = 0) {
2946 Repodata *data = repo_id2repodata($self->repo, $self->id);
2947 int r, oldstate = data->state;
2948 data->state = REPODATA_LOADING;
2949 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2950 if (r || data->state == REPODATA_LOADING)
2951 data->state = oldstate;
2954 void extend_to_repo() {
2955 Repodata *data = repo_id2repodata($self->repo, $self->id);
2956 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2958 bool __eq__(XRepodata *xr) {
2959 return $self->repo == xr->repo && $self->id == xr->id;
2961 bool __ne__(XRepodata *xr) {
2962 return !XRepodata___eq__($self, xr);
2964 %newobject __repr__;
2965 const char *__repr__() {
2967 sprintf(buf, "<Repodata #%d>", $self->id);
2968 return solv_strdup(buf);