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 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
386 %typemap(argout,noblock=1) XRule **OUTPUT {
387 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
390 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
391 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
397 #include <sys/stat.h>
398 #include <sys/utsname.h>
399 #include <sys/types.h>
402 /* argh, swig undefs bool for perl */
408 #include "poolarch.h"
411 #include "solverdebug.h"
412 #include "repo_solv.h"
414 #include "selection.h"
416 #include "repo_write.h"
418 #include "repo_rpmdb.h"
421 #include "repo_pubkey.h"
424 #include "repo_deb.h"
427 #include "repo_rpmmd.h"
428 #include "repo_updateinfoxml.h"
429 #include "repo_deltainfoxml.h"
430 #include "repo_repomdxml.h"
432 #ifdef ENABLE_SUSEREPO
433 #include "repo_products.h"
434 #include "repo_susetags.h"
435 #include "repo_content.h"
437 #ifdef ENABLE_MDKREPO
438 #include "repo_mdk.h"
440 #ifdef ENABLE_ARCHREPO
441 #include "repo_arch.h"
443 #include "solv_xfopen.h"
445 /* for old ruby versions */
447 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
450 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
453 #define SOLVER_SOLUTION_ERASE -100
454 #define SOLVER_SOLUTION_REPLACE -101
455 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
456 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
457 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
458 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
460 typedef void *AppObjectPtr;
486 } Pool_solvable_iterator;
491 } Pool_repo_iterator;
496 } Repo_solvable_iterator;
536 Transaction *transaction;
554 typedef Dataiterator Datamatch;
559 %mixin Dataiterator "Enumerable";
560 %mixin Pool_solvable_iterator "Enumerable";
561 %mixin Pool_repo_iterator "Enumerable";
562 %mixin Repo_solvable_iterator "Enumerable";
570 %constant Id SOLVID_META;
571 %constant Id SOLVID_POS;
573 %constant int REL_EQ;
574 %constant int REL_GT;
575 %constant int REL_LT;
576 %constant int REL_ARCH;
587 # put before pool/repo so we can access the constructor
588 %nodefaultdtor Dataiterator;
589 typedef struct {} Dataiterator;
612 typedef struct {} Pool_solvable_iterator;
613 typedef struct {} Pool_repo_iterator;
614 typedef struct {} Repo_solvable_iterator;
616 %nodefaultctor Datamatch;
617 %nodefaultdtor Datamatch;
624 %nodefaultctor Datapos;
638 AppObjectPtr appdata;
645 const char * const name;
648 int const nsolvables;
649 AppObjectPtr appdata;
652 %nodefaultctor Solver;
653 %nodefaultdtor Solver;
664 unsigned int const created;
665 unsigned int const expires;
666 const char * const keyid;
670 %rename(xfopen) solvfp_xfopen;
671 %rename(xfopen_fd) solvfp_xfopen_fd;
673 %nodefaultctor SolvFp;
677 %newobject solvfp_xfopen;
678 %newobject solvfp_xfopen_fd;
680 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
681 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
684 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
688 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
691 sfp = solv_calloc(1, sizeof(SolvFp));
695 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
698 fp = solv_xfopen(fn, mode);
701 sfp = solv_calloc(1, sizeof(SolvFp));
726 %nodefaultctor Transaction;
727 %nodefaultdtor Transaction;
733 Transaction * const transaction;
747 return $self->fp ? fileno($self->fp) : -1;
750 return $self->fp ? dup(fileno($self->fp)) : -1;
755 return fflush($self->fp) == 0;
761 ret = fclose($self->fp) == 0;
768 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
769 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
770 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
771 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
772 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
773 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
774 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
775 static const Id SOLVER_NOOP = SOLVER_NOOP;
776 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
777 static const Id SOLVER_ERASE = SOLVER_ERASE;
778 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
779 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
780 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
781 static const Id SOLVER_LOCK = SOLVER_LOCK;
782 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
783 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
784 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
785 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
786 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
787 static const Id SOLVER_WEAK = SOLVER_WEAK;
788 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
789 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
790 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
791 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
792 static const Id SOLVER_SETEV = SOLVER_SETEV;
793 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
794 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
795 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
796 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
797 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
798 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
799 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
801 Job(Pool *pool, int how, Id what) {
802 Job *job = solv_calloc(1, sizeof(*job));
809 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
810 %newobject solvables;
814 pool_job2solvables($self->pool, &q, $self->how, $self->what);
818 %rename("isemptyupdate?") isemptyupdate;
820 bool isemptyupdate() {
821 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
824 bool __eq__(Job *j) {
825 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
827 bool __ne__(Job *j) {
828 return !Job___eq__($self, j);
830 #if defined(SWIGPERL)
831 %rename("str") __str__;
833 const char *__str__() {
834 return pool_job2str($self->pool, $self->how, $self->what, 0);
836 const char *__repr__() {
837 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
838 return pool_tmpjoin($self->pool, "<Job ", str, ">");
843 static const Id SELECTION_NAME = SELECTION_NAME;
844 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
845 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
846 static const Id SELECTION_CANON = SELECTION_CANON;
847 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
848 static const Id SELECTION_REL = SELECTION_REL;
849 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
850 static const Id SELECTION_GLOB = SELECTION_GLOB;
851 static const Id SELECTION_FLAT = SELECTION_FLAT;
852 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
853 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
854 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
856 Selection(Pool *pool) {
858 s = solv_calloc(1, sizeof(*s));
864 queue_free(&$self->q);
871 %rename("isempty?") isempty;
874 return $self->q.count == 0;
876 void filter(Selection *lsel) {
877 if ($self->pool != lsel->pool)
878 queue_empty(&$self->q);
880 selection_filter($self->pool, &$self->q, &lsel->q);
882 void add(Selection *lsel) {
883 if ($self->pool == lsel->pool)
885 selection_add($self->pool, &$self->q, &lsel->q);
886 $self->flags |= lsel->flags;
889 void add_raw(Id how, Id what) {
890 queue_push2(&$self->q, how, what);
892 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
894 Queue jobs(int flags) {
897 queue_init_clone(&q, &$self->q);
898 for (i = 0; i < q.count; i += 2)
899 q.elements[i] |= flags;
903 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
904 %newobject solvables;
908 selection_solvables($self->pool, &$self->q, &q);
912 #if defined(SWIGPERL)
913 %rename("str") __str__;
915 const char *__str__() {
916 return pool_selection2str($self->pool, &$self->q, 0);
918 const char *__repr__() {
919 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
920 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
926 return solv_chksum_create(type);
928 Chksum(Id type, const char *hex) {
929 unsigned char buf[64];
930 int l = solv_chksum_len(type);
933 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
935 return solv_chksum_create_from_bin(type, buf);
938 solv_chksum_free($self, 0);
942 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
943 return solv_chksum_get_type(chk);
946 void add(const char *str) {
947 solv_chksum_add($self, str, strlen((char *)str));
949 void add_fp(FILE *fp) {
952 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
953 solv_chksum_add($self, buf, l);
954 rewind(fp); /* convenience */
956 void add_fd(int fd) {
959 while ((l = read(fd, buf, sizeof(buf))) > 0)
960 solv_chksum_add($self, buf, l);
961 lseek(fd, 0, 0); /* convenience */
963 void add_stat(const char *filename) {
965 if (stat(filename, &stb))
966 memset(&stb, 0, sizeof(stb));
967 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
968 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
969 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
970 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
972 void add_fstat(int fd) {
975 memset(&stb, 0, sizeof(stb));
976 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
977 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
978 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
979 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
983 const unsigned char *b;
984 b = solv_chksum_get($self, &l);
985 return cdata_void((void *)b, l);
990 const unsigned char *b;
993 b = solv_chksum_get($self, &l);
994 ret = solv_malloc(2 * l + 1);
995 solv_bin2hex(b, l, ret);
999 bool __eq__(Chksum *chk) {
1001 const unsigned char *b, *bo;
1004 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1006 b = solv_chksum_get($self, &l);
1007 bo = solv_chksum_get(chk, 0);
1008 return memcmp(b, bo, l) == 0;
1010 bool __ne__(Chksum *chk) {
1011 return !Chksum___eq__($self, chk);
1013 #if defined(SWIGRUBY)
1014 %rename("to_s") __str__;
1016 #if defined(SWIGPERL)
1017 %rename("str") __str__;
1020 const char *__str__() {
1023 if (solv_chksum_isfinished($self))
1024 h = Chksum_hex($self);
1025 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1026 solv_free((void *)h);
1029 %newobject __repr__;
1030 const char *__repr__() {
1031 const char *h = Chksum___str__($self);
1032 const char *str = solv_dupjoin("<Chksum ", h, ">");
1033 solv_free((void *)h);
1039 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1040 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1041 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1042 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1043 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1044 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1045 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1046 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1047 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1050 Pool *pool = pool_create();
1055 void set_debuglevel(int level) {
1056 pool_setdebuglevel($self, level);
1058 int set_flag(int flag, int value) {
1059 return pool_set_flag($self, flag, value);
1061 int get_flag(int flag) {
1062 return pool_get_flag($self, flag);
1064 void set_rootdir(const char *rootdir) {
1065 pool_set_rootdir($self, rootdir);
1067 const char *get_rootdir(int flag) {
1068 return pool_get_rootdir($self);
1070 #if defined(SWIGPYTHON)
1072 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1073 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1074 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1075 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1080 return 0; /* exception */
1081 ecode = SWIG_AsVal_int(result, &vresult);
1083 return SWIG_IsOK(ecode) ? vresult : 0;
1086 void set_loadcallback(PyObject *callable) {
1087 if ($self->loadcallback == loadcallback) {
1088 PyObject *obj = $self->loadcallbackdata;
1092 Py_INCREF(callable);
1094 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1097 #if defined(SWIGPERL)
1099 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1103 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1108 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1110 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1120 void set_loadcallback(SV *callable) {
1121 if ($self->loadcallback == loadcallback)
1122 SvREFCNT_dec($self->loadcallbackdata);
1124 SvREFCNT_inc(callable);
1125 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1129 #if defined(SWIGRUBY)
1131 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1132 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1133 VALUE callable = (VALUE)d;
1134 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1135 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1136 return res == Qtrue;
1138 SWIGINTERN void mark_Pool(void *ptr) {
1140 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1141 VALUE callable = (VALUE)pool->loadcallbackdata;
1142 rb_gc_mark(callable);
1146 %typemap(in, numinputs=0) VALUE callable {
1147 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1149 void set_loadcallback(VALUE callable) {
1150 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1155 Pool_set_loadcallback($self, 0);
1158 Id str2id(const char *str, bool create=1) {
1159 return pool_str2id($self, str, create);
1162 Dep *Dep(const char *str, bool create=1) {
1163 Id id = pool_str2id($self, str, create);
1164 return new_Dep($self, id);
1166 const char *id2str(Id id) {
1167 return pool_id2str($self, id);
1169 const char *dep2str(Id id) {
1170 return pool_dep2str($self, id);
1172 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1173 return pool_rel2id($self, name, evr, flags, create);
1175 Id id2langid(Id id, const char *lang, bool create=1) {
1176 return pool_id2langid($self, id, lang, create);
1178 void setarch(const char *arch = 0) {
1187 pool_setarch($self, arch);
1189 Repo *add_repo(const char *name) {
1190 return repo_create($self, name);
1192 const char *lookup_str(Id entry, Id keyname) {
1193 return pool_lookup_str($self, entry, keyname);
1195 Id lookup_id(Id entry, Id keyname) {
1196 return pool_lookup_id($self, entry, keyname);
1198 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1199 return pool_lookup_num($self, entry, keyname, notfound);
1201 bool lookup_void(Id entry, Id keyname) {
1202 return pool_lookup_void($self, entry, keyname);
1204 %newobject lookup_checksum;
1205 Chksum *lookup_checksum(Id entry, Id keyname) {
1207 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1208 return solv_chksum_create_from_bin(type, b);
1211 %newobject Dataiterator;
1212 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1213 return new_Dataiterator($self, 0, p, key, match, flags);
1215 const char *solvid2str(Id solvid) {
1216 return pool_solvid2str($self, solvid);
1218 void addfileprovides() {
1219 pool_addfileprovides($self);
1221 Queue addfileprovides_queue() {
1224 pool_addfileprovides_queue($self, &r, 0);
1227 void createwhatprovides() {
1228 pool_createwhatprovides($self);
1231 %newobject id2solvable;
1232 XSolvable *id2solvable(Id id) {
1233 return new_XSolvable($self, id);
1235 %newobject solvables;
1236 Pool_solvable_iterator * const solvables;
1238 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1239 return new_Pool_solvable_iterator(pool);
1242 %newobject solvables_iter;
1243 Pool_solvable_iterator * solvables_iter() {
1244 return new_Pool_solvable_iterator($self);
1247 Repo *id2repo(Id id) {
1248 if (id < 1 || id >= $self->nrepos)
1250 return pool_id2repo($self, id);
1254 Pool_repo_iterator * const repos;
1256 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1257 return new_Pool_repo_iterator(pool);
1260 %newobject repos_iter;
1261 Pool_repo_iterator * repos_iter() {
1262 return new_Pool_repo_iterator($self);
1266 const char * const errstr;
1268 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1269 pool_set_installed(pool, installed);
1271 Repo *Pool_installed_get(Pool *pool) {
1272 return pool->installed;
1274 const char *Pool_errstr_get(Pool *pool) {
1275 return pool_errstr(pool);
1279 Queue matchprovidingids(const char *match, int flags) {
1285 for (id = 1; id < pool->ss.nstrings; id++)
1286 if (pool->whatprovides[id])
1290 if (!datamatcher_init(&ma, match, flags)) {
1291 for (id = 1; id < pool->ss.nstrings; id++)
1292 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1294 datamatcher_free(&ma);
1301 Job *Job(int how, Id what) {
1302 return new_Job($self, how, what);
1305 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1306 %newobject whatprovides;
1307 Queue whatprovides(DepId dep) {
1312 FOR_PROVIDES(p, pp, dep)
1317 Id towhatprovides(Queue q) {
1318 return pool_queuetowhatprovides($self, &q);
1322 %rename("isknownarch?") isknownarch;
1324 bool isknownarch(DepId id) {
1326 if (!id || id == ID_EMPTY)
1328 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1330 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1337 return solver_create($self);
1340 %newobject Selection;
1341 Selection *Selection() {
1342 return new_Selection($self);
1344 %newobject Selection_all;
1345 Selection *Selection_all(int setflags=0) {
1346 Selection *sel = new_Selection($self);
1347 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1351 Selection *select(const char *name, int flags) {
1352 Selection *sel = new_Selection($self);
1353 sel->flags = selection_make($self, &sel->q, name, flags);
1357 void setpooljobs_helper(Queue jobs) {
1358 queue_free(&$self->pooljobs);
1359 queue_init_clone(&$self->pooljobs, &jobs);
1361 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1362 %newobject getpooljobs;
1363 Queue getpooljobs() {
1365 queue_init_clone(&q, &$self->pooljobs);
1369 #if defined(SWIGPYTHON)
1371 def setpooljobs(self, jobs):
1373 for job in jobs: j += [job.how, job.what]
1374 self.setpooljobs_helper(j)
1377 #if defined(SWIGPERL)
1379 sub solv::Solver::setpooljobs {
1380 my ($self, $jobs) = @_;
1381 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1382 return $self->setpooljobs_helper(\@j);
1386 #if defined(SWIGRUBY)
1389 "class Solv::Pool\n"
1390 " def setpooljobs(jobs)\n"
1392 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1393 " setpooljobs_helper(jl)\n"
1402 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1403 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1404 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1405 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1406 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1407 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1408 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1409 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1410 #ifdef ENABLE_SUSEREPO
1411 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1414 void free(bool reuseids = 0) {
1415 repo_free($self, reuseids);
1417 void empty(bool reuseids = 0) {
1418 repo_empty($self, reuseids);
1421 %rename("isempty?") isempty;
1424 return !$self->nsolvables;
1426 bool add_solv(const char *name, int flags = 0) {
1427 FILE *fp = fopen(name, "r");
1431 r = repo_add_solv($self, fp, flags);
1435 bool add_solv(FILE *fp, int flags = 0) {
1436 return repo_add_solv($self, fp, flags) == 0;
1439 %newobject add_solvable;
1440 XSolvable *add_solvable() {
1441 Id solvid = repo_add_solvable($self);
1442 return new_XSolvable($self->pool, solvid);
1446 bool add_rpmdb(int flags = 0) {
1447 return repo_add_rpmdb($self, 0, flags) == 0;
1449 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1450 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1453 XSolvable *add_rpm(const char *name, int flags = 0) {
1454 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1457 #ifdef ENABLE_PUBKEY
1459 bool add_rpmdb_pubkeys(int flags = 0) {
1460 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1463 %newobject add_pubkey;
1464 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
1465 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
1467 bool add_keyring(FILE *fp, int flags = 0) {
1468 return repo_add_keyring($self, fp, flags);
1470 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
1471 return repo_add_keydir($self, keydir, suffix, flags);
1475 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1476 return repo_add_rpmmd($self, fp, language, flags) == 0;
1478 bool add_repomdxml(FILE *fp, int flags = 0) {
1479 return repo_add_repomdxml($self, fp, flags) == 0;
1481 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1482 return repo_add_updateinfoxml($self, fp, flags) == 0;
1484 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1485 return repo_add_deltainfoxml($self, fp, flags) == 0;
1488 #ifdef ENABLE_DEBIAN
1489 bool add_debdb(int flags = 0) {
1490 return repo_add_debdb($self, flags) == 0;
1492 bool add_debpackages(FILE *fp, int flags = 0) {
1493 return repo_add_debpackages($self, fp, flags) == 0;
1496 XSolvable *add_deb(const char *name, int flags = 0) {
1497 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
1500 #ifdef ENABLE_SUSEREPO
1501 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1502 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1504 bool add_content(FILE *fp, int flags = 0) {
1505 return repo_add_content($self, fp, flags) == 0;
1507 bool add_products(const char *proddir, int flags = 0) {
1508 return repo_add_products($self, proddir, flags) == 0;
1511 #ifdef ENABLE_MDKREPO
1512 bool add_mdk(FILE *fp, int flags = 0) {
1513 return repo_add_mdk($self, fp, flags) == 0;
1515 bool add_mdk_info(FILE *fp, int flags = 0) {
1516 return repo_add_mdk_info($self, fp, flags) == 0;
1519 #ifdef ENABLE_ARCHREPO
1520 bool add_arch_repo(FILE *fp, int flags = 0) {
1521 return repo_add_arch_repo($self, fp, flags) == 0;
1523 bool add_arch_local(const char *dir, int flags = 0) {
1524 return repo_add_arch_local($self, dir, flags) == 0;
1526 %newobject add_arch_pkg;
1527 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
1528 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
1531 void internalize() {
1532 repo_internalize($self);
1534 bool write(FILE *fp) {
1535 return repo_write($self, fp) == 0;
1537 # HACK, remove if no longer needed!
1538 bool write_first_repodata(FILE *fp) {
1539 int oldnrepodata = $self->nrepodata;
1541 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1542 res = repo_write($self, fp);
1543 $self->nrepodata = oldnrepodata;
1547 %newobject Dataiterator;
1548 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1549 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1554 SWIGINTERN Id Repo_id_get(Repo *repo) {
1555 return repo->repoid;
1558 %newobject solvables;
1559 Repo_solvable_iterator * const solvables;
1561 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1562 return new_Repo_solvable_iterator(repo);
1566 Datapos * const meta;
1568 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1569 Datapos *pos = solv_calloc(1, sizeof(*pos));
1570 pos->solvid = SOLVID_META;
1576 %newobject solvables_iter;
1577 Repo_solvable_iterator *solvables_iter() {
1578 return new_Repo_solvable_iterator($self);
1581 %newobject add_repodata;
1582 XRepodata *add_repodata(int flags = 0) {
1583 Repodata *rd = repo_add_repodata($self, flags);
1584 return new_XRepodata($self, rd->repodataid);
1587 void create_stubs() {
1589 if (!$self->nrepodata)
1591 data = repo_id2repodata($self, $self->nrepodata - 1);
1592 if (data->state != REPODATA_STUB)
1593 (void)repodata_create_stubs(data);
1596 %rename("iscontiguous?") iscontiguous;
1598 bool iscontiguous() {
1600 for (i = $self->start; i < $self->end; i++)
1601 if ($self->pool->solvables[i].repo != $self)
1605 %newobject first_repodata;
1606 XRepodata *first_repodata() {
1609 if ($self->nrepodata < 2)
1611 /* make sure all repodatas but the first are extensions */
1612 data = repo_id2repodata($self, 1);
1613 if (data->loadcallback)
1615 for (i = 2; i < $self->nrepodata; i++)
1617 data = repo_id2repodata($self, i);
1618 if (!data->loadcallback)
1619 return 0; /* oops, not an extension */
1621 return new_XRepodata($self, 1);
1624 %newobject Selection;
1625 Selection *Selection(int setflags=0) {
1626 Selection *sel = new_Selection($self->pool);
1627 setflags |= SOLVER_SETREPO;
1628 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1632 bool __eq__(Repo *repo) {
1633 return $self == repo;
1635 bool __ne__(Repo *repo) {
1636 return $self != repo;
1638 #if defined(SWIGPERL)
1639 %rename("str") __str__;
1642 const char *__str__() {
1645 return solv_strdup($self->name);
1646 sprintf(buf, "Repo#%d", $self->repoid);
1647 return solv_strdup(buf);
1649 %newobject __repr__;
1650 const char *__repr__() {
1654 sprintf(buf, "<Repo #%d ", $self->repoid);
1655 return solv_dupjoin(buf, $self->name, ">");
1657 sprintf(buf, "<Repo #%d>", $self->repoid);
1658 return solv_strdup(buf);
1662 %extend Dataiterator {
1663 static const int SEARCH_STRING = SEARCH_STRING;
1664 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1665 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1666 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1667 static const int SEARCH_GLOB = SEARCH_GLOB;
1668 static const int SEARCH_REGEX = SEARCH_REGEX;
1669 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1670 static const int SEARCH_FILES = SEARCH_FILES;
1671 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1672 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1674 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1675 Dataiterator *di = solv_calloc(1, sizeof(*di));
1676 dataiterator_init(di, pool, repo, p, key, match, flags);
1680 dataiterator_free($self);
1683 #if defined(SWIGPYTHON)
1684 %newobject __iter__;
1685 Dataiterator *__iter__() {
1687 ndi = solv_calloc(1, sizeof(*ndi));
1688 dataiterator_init_clone(ndi, $self);
1691 %rename("next") __next__();
1692 %exception __next__ {
1695 PyErr_SetString(PyExc_StopIteration,"no more matches");
1702 perliter(solv::Dataiterator)
1705 %newobject __next__;
1706 Datamatch *__next__() {
1708 if (!dataiterator_step($self)) {
1711 ndi = solv_calloc(1, sizeof(*ndi));
1712 dataiterator_init_clone(ndi, $self);
1713 dataiterator_strdup(ndi);
1719 while ((d = Dataiterator___next__($self)) != 0) {
1720 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1724 void prepend_keyname(Id key) {
1725 dataiterator_prepend_keyname($self, key);
1727 void skip_solvable() {
1728 dataiterator_skip_solvable($self);
1733 Id lookup_id(Id keyname) {
1734 Pool *pool = $self->repo->pool;
1735 Datapos oldpos = pool->pos;
1738 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1742 const char *lookup_str(Id keyname) {
1743 Pool *pool = $self->repo->pool;
1744 Datapos oldpos = pool->pos;
1747 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1751 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1752 Pool *pool = $self->repo->pool;
1753 Datapos oldpos = pool->pos;
1754 unsigned long long r;
1756 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1760 bool lookup_void(Id keyname) {
1761 Pool *pool = $self->repo->pool;
1762 Datapos oldpos = pool->pos;
1765 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1769 %newobject lookup_checksum;
1770 Chksum *lookup_checksum(Id keyname) {
1771 Pool *pool = $self->repo->pool;
1772 Datapos oldpos = pool->pos;
1774 const unsigned char *b;
1776 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1778 return solv_chksum_create_from_bin(type, b);
1780 const char *lookup_deltaseq() {
1781 Pool *pool = $self->repo->pool;
1782 Datapos oldpos = pool->pos;
1785 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1787 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1788 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1793 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1794 Pool *pool = $self->repo->pool;
1795 Datapos oldpos = pool->pos;
1798 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1802 Queue lookup_idarray(Id keyname) {
1803 Pool *pool = $self->repo->pool;
1804 Datapos oldpos = pool->pos;
1808 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1812 %newobject Dataiterator;
1813 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1814 Pool *pool = $self->repo->pool;
1815 Datapos oldpos = pool->pos;
1818 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1826 dataiterator_free($self);
1829 %newobject solvable;
1830 XSolvable * const solvable;
1832 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1833 return new_XSolvable(di->pool, di->solvid);
1837 return $self->key->name;
1839 const char *key_idstr() {
1840 return pool_id2str($self->pool, $self->key->name);
1843 return $self->key->type;
1845 const char *type_idstr() {
1846 return pool_id2str($self->pool, $self->key->type);
1849 return $self->kv.id;
1851 const char *idstr() {
1852 return pool_id2str($self->pool, $self->kv.id);
1855 return $self->kv.str;
1857 unsigned long long num() {
1858 if ($self->key->type == REPOKEY_TYPE_NUM)
1859 return SOLV_KV_NUM64(&$self->kv);
1860 return $self->kv.num;
1863 return $self->kv.num2;
1867 Pool *pool = $self->pool;
1868 Datapos *pos, oldpos = pool->pos;
1869 dataiterator_setpos($self);
1870 pos = solv_calloc(1, sizeof(*pos));
1875 %newobject parentpos;
1876 Datapos *parentpos() {
1877 Pool *pool = $self->pool;
1878 Datapos *pos, oldpos = pool->pos;
1879 dataiterator_setpos_parent($self);
1880 pos = solv_calloc(1, sizeof(*pos));
1885 #if defined(SWIGPERL)
1886 %rename("str") __str__;
1888 const char *__str__() {
1889 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1891 return $self->kv.str;
1895 %extend Pool_solvable_iterator {
1896 Pool_solvable_iterator(Pool *pool) {
1897 Pool_solvable_iterator *s;
1898 s = solv_calloc(1, sizeof(*s));
1902 #if defined(SWIGPYTHON)
1903 %newobject __iter__;
1904 Pool_solvable_iterator *__iter__() {
1905 Pool_solvable_iterator *s;
1906 s = solv_calloc(1, sizeof(*s));
1910 %rename("next") __next__();
1911 %exception __next__ {
1914 PyErr_SetString(PyExc_StopIteration,"no more matches");
1921 perliter(solv::Pool_solvable_iterator)
1923 %newobject __next__;
1924 XSolvable *__next__() {
1925 Pool *pool = $self->pool;
1926 if ($self->id >= pool->nsolvables)
1928 while (++$self->id < pool->nsolvables)
1929 if (pool->solvables[$self->id].repo)
1930 return new_XSolvable(pool, $self->id);
1936 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1937 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1941 %newobject __getitem__;
1942 XSolvable *__getitem__(Id key) {
1943 Pool *pool = $self->pool;
1944 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1945 return new_XSolvable(pool, key);
1949 return $self->pool->nsolvables;
1953 %extend Pool_repo_iterator {
1954 Pool_repo_iterator(Pool *pool) {
1955 Pool_repo_iterator *s;
1956 s = solv_calloc(1, sizeof(*s));
1960 #if defined(SWIGPYTHON)
1961 %newobject __iter__;
1962 Pool_repo_iterator *__iter__() {
1963 Pool_repo_iterator *s;
1964 s = solv_calloc(1, sizeof(*s));
1968 %rename("next") __next__();
1969 %exception __next__ {
1972 PyErr_SetString(PyExc_StopIteration,"no more matches");
1977 %newobject __next__;
1979 Pool *pool = $self->pool;
1980 if ($self->id >= pool->nrepos)
1982 while (++$self->id < pool->nrepos) {
1983 Repo *r = pool_id2repo(pool, $self->id);
1992 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1993 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1997 Repo *__getitem__(Id key) {
1998 Pool *pool = $self->pool;
1999 if (key > 0 && key < pool->nrepos)
2000 return pool_id2repo(pool, key);
2004 return $self->pool->nrepos;
2008 %extend Repo_solvable_iterator {
2009 Repo_solvable_iterator(Repo *repo) {
2010 Repo_solvable_iterator *s;
2011 s = solv_calloc(1, sizeof(*s));
2015 #if defined(SWIGPYTHON)
2016 %newobject __iter__;
2017 Repo_solvable_iterator *__iter__() {
2018 Repo_solvable_iterator *s;
2019 s = solv_calloc(1, sizeof(*s));
2023 %rename("next") __next__();
2024 %exception __next__ {
2027 PyErr_SetString(PyExc_StopIteration,"no more matches");
2032 %newobject __next__;
2033 XSolvable *__next__() {
2034 Repo *repo = $self->repo;
2035 Pool *pool = repo->pool;
2036 if (repo->start > 0 && $self->id < repo->start)
2037 $self->id = repo->start - 1;
2038 if ($self->id >= repo->end)
2040 while (++$self->id < repo->end)
2041 if (pool->solvables[$self->id].repo == repo)
2042 return new_XSolvable(pool, $self->id);
2048 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2049 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2053 %newobject __getitem__;
2054 XSolvable *__getitem__(Id key) {
2055 Repo *repo = $self->repo;
2056 Pool *pool = repo->pool;
2057 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2058 return new_XSolvable(pool, key);
2062 return $self->repo->pool->nsolvables;
2067 Dep(Pool *pool, Id id) {
2071 s = solv_calloc(1, sizeof(*s));
2077 Dep *Rel(int flags, DepId evrid, bool create=1) {
2078 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2081 return new_Dep($self->pool, id);
2083 %newobject Selection_name;
2084 Selection *Selection_name(int setflags=0) {
2085 Selection *sel = new_Selection($self->pool);
2086 if (ISRELDEP($self->id)) {
2087 Reldep *rd = GETRELDEP($self->pool, $self->id);
2088 if (rd->flags == REL_EQ) {
2089 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2090 if (ISRELDEP(rd->name))
2091 rd = GETRELDEP($self->pool, rd->name);
2093 if (rd->flags == REL_ARCH)
2094 setflags |= SOLVER_SETARCH;
2096 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2099 %newobject Selection_provides;
2100 Selection *Selection_provides(int setflags=0) {
2101 Selection *sel = new_Selection($self->pool);
2102 if (ISRELDEP($self->id)) {
2103 Reldep *rd = GETRELDEP($self->pool, $self->id);
2104 if (rd->flags == REL_ARCH)
2105 setflags |= SOLVER_SETARCH;
2107 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2111 return pool_dep2str($self->pool, $self->id);
2113 bool __eq__(Dep *s) {
2114 return $self->pool == s->pool && $self->id == s->id;
2116 bool __ne__(Dep *s) {
2117 return !Dep___eq__($self, s);
2119 #if defined(SWIGPERL)
2120 %rename("str") __str__;
2122 const char *__str__() {
2123 return pool_dep2str($self->pool, $self->id);
2125 %newobject __repr__;
2126 const char *__repr__() {
2128 sprintf(buf, "<Id #%d ", $self->id);
2129 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2134 XSolvable(Pool *pool, Id id) {
2136 if (!id || id >= pool->nsolvables)
2138 s = solv_calloc(1, sizeof(*s));
2144 return pool_solvid2str($self->pool, $self->id);
2146 const char *lookup_str(Id keyname) {
2147 return pool_lookup_str($self->pool, $self->id, keyname);
2149 Id lookup_id(Id keyname) {
2150 return pool_lookup_id($self->pool, $self->id, keyname);
2152 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2153 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2155 bool lookup_void(Id keyname) {
2156 return pool_lookup_void($self->pool, $self->id, keyname);
2158 %newobject lookup_checksum;
2159 Chksum *lookup_checksum(Id keyname) {
2161 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2162 return solv_chksum_create_from_bin(type, b);
2164 Queue lookup_idarray(Id keyname, Id marker = -1) {
2165 Solvable *s = $self->pool->solvables + $self->id;
2168 solvable_lookup_deparray(s, keyname, &r, marker);
2171 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2172 %newobject lookup_deparray;
2173 Queue lookup_deparray(Id keyname, Id marker = -1) {
2174 Solvable *s = $self->pool->solvables + $self->id;
2177 solvable_lookup_deparray(s, keyname, &r, marker);
2180 const char *lookup_location(unsigned int *OUTPUT) {
2181 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2183 %newobject Dataiterator;
2184 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2185 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2188 %rename("installable?") installable;
2190 bool installable() {
2191 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2194 %rename("isinstalled?") isinstalled;
2196 bool isinstalled() {
2197 Pool *pool = $self->pool;
2198 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2203 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2204 Pool *pool = xs->pool;
2205 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2207 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2208 Pool *pool = xs->pool;
2209 return pool_id2str(pool, pool->solvables[xs->id].name);
2214 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2215 xs->pool->solvables[xs->id].name = nameid;
2217 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2218 return xs->pool->solvables[xs->id].name;
2223 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2224 Pool *pool = xs->pool;
2225 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2227 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2228 Pool *pool = xs->pool;
2229 return pool_id2str(pool, pool->solvables[xs->id].evr);
2234 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2235 xs->pool->solvables[xs->id].evr = evrid;
2237 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2238 return xs->pool->solvables[xs->id].evr;
2243 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2244 Pool *pool = xs->pool;
2245 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2247 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2248 Pool *pool = xs->pool;
2249 return pool_id2str(pool, pool->solvables[xs->id].arch);
2254 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2255 xs->pool->solvables[xs->id].arch = archid;
2257 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2258 return xs->pool->solvables[xs->id].arch;
2263 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2264 Pool *pool = xs->pool;
2265 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2267 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2268 Pool *pool = xs->pool;
2269 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2274 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2275 xs->pool->solvables[xs->id].vendor = vendorid;
2277 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2278 return xs->pool->solvables[xs->id].vendor;
2283 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2284 return xs->pool->solvables[xs->id].repo;
2288 /* old interface, please use the generic add_deparray instead */
2289 void add_provides(DepId id, Id marker = -1) {
2290 Solvable *s = $self->pool->solvables + $self->id;
2291 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2292 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2294 void add_obsoletes(DepId id) {
2295 Solvable *s = $self->pool->solvables + $self->id;
2296 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2298 void add_conflicts(DepId id) {
2299 Solvable *s = $self->pool->solvables + $self->id;
2300 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2302 void add_requires(DepId id, Id marker = -1) {
2303 Solvable *s = $self->pool->solvables + $self->id;
2304 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2305 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2307 void add_recommends(DepId id) {
2308 Solvable *s = $self->pool->solvables + $self->id;
2309 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2311 void add_suggests(DepId id) {
2312 Solvable *s = $self->pool->solvables + $self->id;
2313 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2315 void add_supplements(DepId id) {
2316 Solvable *s = $self->pool->solvables + $self->id;
2317 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2319 void add_enhances(DepId id) {
2320 Solvable *s = $self->pool->solvables + $self->id;
2321 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2324 void unset(Id keyname) {
2325 Solvable *s = $self->pool->solvables + $self->id;
2326 repo_unset(s->repo, $self->id, keyname);
2329 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2330 Solvable *s = $self->pool->solvables + $self->id;
2331 solvable_add_deparray(s, keyname, id, marker);
2334 %newobject Selection;
2335 Selection *Selection(int setflags=0) {
2336 Selection *sel = new_Selection($self->pool);
2337 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2341 bool __eq__(XSolvable *s) {
2342 return $self->pool == s->pool && $self->id == s->id;
2344 bool __ne__(XSolvable *s) {
2345 return !XSolvable___eq__($self, s);
2347 #if defined(SWIGPERL)
2348 %rename("str") __str__;
2350 const char *__str__() {
2351 return pool_solvid2str($self->pool, $self->id);
2353 %newobject __repr__;
2354 const char *__repr__() {
2356 sprintf(buf, "<Solvable #%d ", $self->id);
2357 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2362 Problem(Solver *solv, Id id) {
2364 p = solv_calloc(1, sizeof(*p));
2369 %newobject findproblemrule;
2370 XRule *findproblemrule() {
2371 Id r = solver_findproblemrule($self->solv, $self->id);
2372 return new_XRule($self->solv, r);
2374 %newobject findallproblemrules;
2375 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2376 Queue findallproblemrules(int unfiltered=0) {
2377 Solver *solv = $self->solv;
2382 solver_findallproblemrules(solv, $self->id, &q);
2385 for (i = j = 0; i < q.count; i++)
2387 SolverRuleinfo rclass;
2388 probr = q.elements[i];
2389 rclass = solver_ruleclass(solv, probr);
2390 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2392 q.elements[j++] = probr;
2395 queue_truncate(&q, j);
2399 int solution_count() {
2400 return solver_solution_count($self->solv, $self->id);
2402 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2403 %newobject solutions;
2408 cnt = solver_solution_count($self->solv, $self->id);
2409 for (i = 1; i <= cnt; i++)
2413 #if defined(SWIGPERL)
2414 %rename("str") __str__;
2416 const char *__str__() {
2417 return solver_problem2str($self->solv, $self->id);
2422 Solution(Problem *p, Id id) {
2424 s = solv_calloc(1, sizeof(*s));
2426 s->problemid = p->id;
2430 int element_count() {
2431 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2434 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2435 %newobject elements;
2436 Queue elements(bool expandreplaces=0) {
2440 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2441 for (i = 1; i <= cnt; i++)
2444 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2446 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2452 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2453 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2455 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2456 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2457 queue_push2(&q, p, rp);
2459 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2460 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2461 queue_push2(&q, p, rp);
2463 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2464 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2465 queue_push2(&q, p, rp);
2467 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2468 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2469 queue_push2(&q, p, rp);
2474 queue_push2(&q, i, type);
2475 queue_push2(&q, p, rp);
2481 %extend Solutionelement {
2482 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2484 e = solv_calloc(1, sizeof(*e));
2486 e->problemid = problemid;
2498 if (p == SOLVER_SOLUTION_ERASE)
2503 else if (p == SOLVER_SOLUTION_REPLACE)
2508 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2509 illegal = POLICY_ILLEGAL_DOWNGRADE;
2510 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2511 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2512 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2513 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2514 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2515 illegal = POLICY_ILLEGAL_NAMECHANGE;
2517 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);
2518 return solver_solutionelement2str($self->solv, p, rp);
2520 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2521 %newobject replaceelements;
2522 Queue replaceelements() {
2527 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2530 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2531 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2532 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2533 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2534 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2535 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2536 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2537 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2538 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2540 queue_push(&q, $self->type);
2543 int illegalreplace() {
2544 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2546 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2548 %newobject solvable;
2549 XSolvable * const solvable;
2550 %newobject replacement;
2551 XSolvable * const replacement;
2554 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2555 return new_XSolvable(e->solv->pool, e->p);
2557 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2558 return new_XSolvable(e->solv->pool, e->rp);
2560 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2561 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2563 return (e->p - 1) / 2;
2568 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2569 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2570 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2571 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2572 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2573 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)
2574 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2575 if ($self->type == SOLVER_SOLUTION_ERASE)
2576 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2582 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2583 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2584 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2585 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2586 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2587 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2588 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2589 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2590 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2591 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2592 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2593 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2594 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2595 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2596 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2597 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2598 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2599 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2600 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2601 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2602 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2603 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2605 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2606 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2607 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2608 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2609 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2610 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2611 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2612 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2613 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2614 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2615 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2617 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2618 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2619 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2620 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2622 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2623 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2624 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2625 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2626 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2627 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2628 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2629 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2630 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2631 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2632 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2633 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2635 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
2636 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
2637 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
2638 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
2639 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
2640 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
2641 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
2642 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
2643 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
2644 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
2645 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
2651 int set_flag(int flag, int value) {
2652 return solver_set_flag($self, flag, value);
2654 int get_flag(int flag) {
2655 return solver_get_flag($self, flag);
2657 #if defined(SWIGPYTHON)
2659 def solve(self, jobs):
2661 for job in jobs: j += [job.how, job.what]
2662 return self.solve_helper(j)
2665 #if defined(SWIGPERL)
2667 sub solv::Solver::solve {
2668 my ($self, $jobs) = @_;
2669 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2670 return $self->solve_helper(\@j);
2674 #if defined(SWIGRUBY)
2677 "class Solv::Solver\n"
2678 " def solve(jobs)\n"
2680 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2681 " solve_helper(jl)\n"
2687 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2688 %newobject solve_helper;
2689 Queue solve_helper(Queue jobs) {
2693 solver_solve($self, &jobs);
2694 cnt = solver_problem_count($self);
2695 for (i = 1; i <= cnt; i++)
2699 %newobject transaction;
2700 Transaction *transaction() {
2701 return solver_create_transaction($self);
2704 int describe_decision(XSolvable *s, XRule **OUTPUT) {
2706 int reason = solver_describe_decision($self, s->id, &ruleid);
2707 *OUTPUT = new_XRule($self, ruleid);
2712 %extend Transaction {
2713 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2714 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2715 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2716 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2717 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2718 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2719 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2720 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2721 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2722 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2723 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2724 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2725 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2726 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2727 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2728 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2729 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2730 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2731 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2732 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2733 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2734 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2735 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2736 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2737 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2738 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2739 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2740 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2742 transaction_free($self);
2745 %rename("isempty?") isempty;
2748 return $self->steps.count == 0;
2751 %newobject othersolvable;
2752 XSolvable *othersolvable(XSolvable *s) {
2753 Id op = transaction_obs_pkg($self, s->id);
2754 return new_XSolvable($self->pool, op);
2757 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2758 %newobject allothersolvables;
2759 Queue allothersolvables(XSolvable *s) {
2762 transaction_all_obs_pkgs($self, s->id, &q);
2766 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2767 %newobject classify;
2768 Queue classify(int mode = 0) {
2771 transaction_classify($self, mode, &q);
2775 # deprecated, use newsolvables instead
2776 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2777 %newobject newpackages;
2778 Queue newpackages() {
2782 cut = transaction_installedresult(self, &q);
2783 queue_truncate(&q, cut);
2787 # deprecated, use keptsolvables instead
2788 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2789 %newobject keptpackages;
2790 Queue keptpackages() {
2794 cut = transaction_installedresult(self, &q);
2796 queue_deleten(&q, 0, cut);
2800 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2801 %newobject newsolvables;
2802 Queue newsolvables() {
2806 cut = transaction_installedresult(self, &q);
2807 queue_truncate(&q, cut);
2811 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2812 %newobject keptsolvables;
2813 Queue keptsolvables() {
2817 cut = transaction_installedresult(self, &q);
2819 queue_deleten(&q, 0, cut);
2823 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2827 queue_init_clone(&q, &$self->steps);
2831 int steptype(XSolvable *s, int mode) {
2832 return transaction_type($self, s->id, mode);
2834 int calc_installsizechange() {
2835 return transaction_calc_installsizechange($self);
2837 void order(int flags=0) {
2838 transaction_order($self, flags);
2842 %extend TransactionClass {
2843 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2844 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2845 cl->transaction = trans;
2849 cl->fromid = fromid;
2853 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2854 %newobject solvables;
2858 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2861 const char * const fromstr;
2862 const char * const tostr;
2864 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
2865 return pool_id2str(cl->transaction->pool, cl->fromid);
2867 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
2868 return pool_id2str(cl->transaction->pool, cl->toid);
2874 XRule(Solver *solv, Id id) {
2877 XRule *xr = solv_calloc(1, sizeof(*xr));
2884 SWIGINTERN int XRule_type_get(XRule *xr) {
2885 return solver_ruleclass(xr->solv, xr->id);
2890 Id type, source, target, dep;
2891 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2892 return new_Ruleinfo($self, type, source, target, dep);
2894 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2895 %newobject allinfos;
2899 solver_allruleinfos($self->solv, $self->id, &q);
2903 bool __eq__(XRule *xr) {
2904 return $self->solv == xr->solv && $self->id == xr->id;
2906 bool __ne__(XRule *xr) {
2907 return !XRule___eq__($self, xr);
2909 %newobject __repr__;
2910 const char *__repr__() {
2912 sprintf(buf, "<Rule #%d>", $self->id);
2913 return solv_strdup(buf);
2918 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
2919 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2923 ri->source = source;
2924 ri->target = target;
2925 ri->dep_id = dep_id;
2928 %newobject solvable;
2929 XSolvable * const solvable;
2930 %newobject othersolvable;
2931 XSolvable * const othersolvable;
2935 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2936 return new_XSolvable(ri->solv->pool, ri->source);
2938 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2939 return new_XSolvable(ri->solv->pool, ri->target);
2941 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
2942 return new_Dep(ri->solv->pool, ri->dep_id);
2945 const char *problemstr() {
2946 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
2951 XRepodata(Repo *repo, Id id) {
2952 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2958 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2960 void set_id(Id solvid, Id keyname, DepId id) {
2961 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2963 void set_str(Id solvid, Id keyname, const char *str) {
2964 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2966 void set_poolstr(Id solvid, Id keyname, const char *str) {
2967 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2969 void add_idarray(Id solvid, Id keyname, DepId id) {
2970 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2972 void add_flexarray(Id solvid, Id keyname, Id handle) {
2973 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2975 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2976 const unsigned char *buf = solv_chksum_get(chksum, 0);
2978 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2980 const char *lookup_str(Id solvid, Id keyname) {
2981 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2983 Queue lookup_idarray(Id solvid, Id keyname) {
2986 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2989 %newobject lookup_checksum;
2990 Chksum *lookup_checksum(Id solvid, Id keyname) {
2992 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2993 return solv_chksum_create_from_bin(type, b);
2995 void internalize() {
2996 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2998 void create_stubs() {
2999 Repodata *data = repo_id2repodata($self->repo, $self->id);
3000 data = repodata_create_stubs(data);
3001 $self->id = data->repodataid;
3003 bool write(FILE *fp) {
3004 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3006 bool add_solv(FILE *fp, int flags = 0) {
3007 Repodata *data = repo_id2repodata($self->repo, $self->id);
3008 int r, oldstate = data->state;
3009 data->state = REPODATA_LOADING;
3010 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3011 if (r || data->state == REPODATA_LOADING)
3012 data->state = oldstate;
3015 void extend_to_repo() {
3016 Repodata *data = repo_id2repodata($self->repo, $self->id);
3017 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3019 bool __eq__(XRepodata *xr) {
3020 return $self->repo == xr->repo && $self->id == xr->id;
3022 bool __ne__(XRepodata *xr) {
3023 return !XRepodata___eq__($self, xr);
3025 %newobject __repr__;
3026 const char *__repr__() {
3028 sprintf(buf, "<Repodata #%d>", $self->id);
3029 return solv_strdup(buf);
3033 #ifdef ENABLE_PUBKEY
3036 return solvsig_create(fp);
3039 solvsig_free($self);
3043 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3045 #ifdef ENABLE_PGPVRFY
3047 XSolvable *verify(Repo *repo, Chksum *chksum) {
3048 Id p = solvsig_verify($self, repo, chksum);
3049 return new_XSolvable(repo->pool, p);