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 struct chksum Chksum;
461 typedef void *AppObjectPtr;
487 } Pool_solvable_iterator;
492 } Pool_repo_iterator;
497 } Repo_solvable_iterator;
537 Transaction *transaction;
555 typedef Dataiterator Datamatch;
560 %mixin Dataiterator "Enumerable";
561 %mixin Pool_solvable_iterator "Enumerable";
562 %mixin Pool_repo_iterator "Enumerable";
563 %mixin Repo_solvable_iterator "Enumerable";
571 %constant Id SOLVID_META;
572 %constant Id SOLVID_POS;
574 %constant int REL_EQ;
575 %constant int REL_GT;
576 %constant int REL_LT;
577 %constant int REL_ARCH;
588 # put before pool/repo so we can access the constructor
589 %nodefaultdtor Dataiterator;
590 typedef struct {} Dataiterator;
613 typedef struct {} Pool_solvable_iterator;
614 typedef struct {} Pool_repo_iterator;
615 typedef struct {} Repo_solvable_iterator;
617 %nodefaultctor Datamatch;
618 %nodefaultdtor Datamatch;
625 %nodefaultctor Datapos;
639 AppObjectPtr appdata;
646 const char * const name;
649 int const nsolvables;
650 AppObjectPtr appdata;
653 %nodefaultctor Solver;
654 %nodefaultdtor Solver;
662 %rename(xfopen) solvfp_xfopen;
663 %rename(xfopen_fd) solvfp_xfopen_fd;
665 %nodefaultctor SolvFp;
669 %newobject solvfp_xfopen;
670 %newobject solvfp_xfopen_fd;
672 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
673 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
676 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
680 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
683 sfp = solv_calloc(1, sizeof(SolvFp));
687 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
690 fp = solv_xfopen(fn, mode);
693 sfp = solv_calloc(1, sizeof(SolvFp));
718 %nodefaultctor Transaction;
719 %nodefaultdtor Transaction;
725 Transaction * const transaction;
739 return $self->fp ? fileno($self->fp) : -1;
742 return $self->fp ? dup(fileno($self->fp)) : -1;
747 return fflush($self->fp) == 0;
753 ret = fclose($self->fp) == 0;
760 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
761 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
762 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
763 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
764 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
765 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
766 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
767 static const Id SOLVER_NOOP = SOLVER_NOOP;
768 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
769 static const Id SOLVER_ERASE = SOLVER_ERASE;
770 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
771 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
772 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
773 static const Id SOLVER_LOCK = SOLVER_LOCK;
774 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
775 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
776 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
777 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
778 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
779 static const Id SOLVER_WEAK = SOLVER_WEAK;
780 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
781 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
782 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
783 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
784 static const Id SOLVER_SETEV = SOLVER_SETEV;
785 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
786 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
787 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
788 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
789 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
790 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
791 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
793 Job(Pool *pool, int how, Id what) {
794 Job *job = solv_calloc(1, sizeof(*job));
801 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
802 %newobject solvables;
806 pool_job2solvables($self->pool, &q, $self->how, $self->what);
810 %rename("isemptyupdate?") isemptyupdate;
812 bool isemptyupdate() {
813 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
816 bool __eq__(Job *j) {
817 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
819 bool __ne__(Job *j) {
820 return !Job___eq__($self, j);
822 #if defined(SWIGPERL)
823 %rename("str") __str__;
825 const char *__str__() {
826 return pool_job2str($self->pool, $self->how, $self->what, 0);
828 const char *__repr__() {
829 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
830 return pool_tmpjoin($self->pool, "<Job ", str, ">");
835 static const Id SELECTION_NAME = SELECTION_NAME;
836 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
837 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
838 static const Id SELECTION_CANON = SELECTION_CANON;
839 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
840 static const Id SELECTION_REL = SELECTION_REL;
841 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
842 static const Id SELECTION_GLOB = SELECTION_GLOB;
843 static const Id SELECTION_FLAT = SELECTION_FLAT;
844 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
845 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
846 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
848 Selection(Pool *pool) {
850 s = solv_calloc(1, sizeof(*s));
856 queue_free(&$self->q);
863 %rename("isempty?") isempty;
866 return $self->q.count == 0;
868 void filter(Selection *lsel) {
869 if ($self->pool != lsel->pool)
870 queue_empty(&$self->q);
872 selection_filter($self->pool, &$self->q, &lsel->q);
874 void add(Selection *lsel) {
875 if ($self->pool == lsel->pool)
877 selection_add($self->pool, &$self->q, &lsel->q);
878 $self->flags |= lsel->flags;
881 void add_raw(Id how, Id what) {
882 queue_push2(&$self->q, how, what);
884 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
886 Queue jobs(int flags) {
889 queue_init_clone(&q, &$self->q);
890 for (i = 0; i < q.count; i += 2)
891 q.elements[i] |= flags;
895 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
896 %newobject solvables;
900 selection_solvables($self->pool, &$self->q, &q);
904 #if defined(SWIGPERL)
905 %rename("str") __str__;
907 const char *__str__() {
908 return pool_selection2str($self->pool, &$self->q, 0);
910 const char *__repr__() {
911 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
912 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
918 return (Chksum *)solv_chksum_create(type);
920 Chksum(Id type, const char *hex) {
921 unsigned char buf[64];
922 int l = solv_chksum_len(type);
925 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
927 return (Chksum *)solv_chksum_create_from_bin(type, buf);
930 solv_chksum_free($self, 0);
934 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
935 return solv_chksum_get_type(chksum);
938 void add(const char *str) {
939 solv_chksum_add($self, str, strlen((char *)str));
941 void add_fp(FILE *fp) {
944 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
945 solv_chksum_add($self, buf, l);
946 rewind(fp); /* convenience */
948 void add_fd(int fd) {
951 while ((l = read(fd, buf, sizeof(buf))) > 0)
952 solv_chksum_add($self, buf, l);
953 lseek(fd, 0, 0); /* convenience */
955 void add_stat(const char *filename) {
957 if (stat(filename, &stb))
958 memset(&stb, 0, sizeof(stb));
959 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
960 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
961 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
962 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
964 void add_fstat(int fd) {
967 memset(&stb, 0, sizeof(stb));
968 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
969 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
970 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
971 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
975 const unsigned char *b;
976 b = solv_chksum_get($self, &l);
977 return cdata_void((void *)b, l);
982 const unsigned char *b;
985 b = solv_chksum_get($self, &l);
986 ret = solv_malloc(2 * l + 1);
987 solv_bin2hex(b, l, ret);
991 bool __eq__(Chksum *chk) {
993 const unsigned char *b, *bo;
996 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
998 b = solv_chksum_get($self, &l);
999 bo = solv_chksum_get(chk, 0);
1000 return memcmp(b, bo, l) == 0;
1002 bool __ne__(Chksum *chk) {
1003 return !Chksum___eq__($self, chk);
1005 #if defined(SWIGRUBY)
1006 %rename("to_s") __str__;
1008 #if defined(SWIGPERL)
1009 %rename("str") __str__;
1012 const char *__str__() {
1015 if (solv_chksum_isfinished($self))
1016 h = Chksum_hex($self);
1017 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1018 solv_free((void *)h);
1021 %newobject __repr__;
1022 const char *__repr__() {
1023 const char *h = Chksum___str__($self);
1024 const char *str = solv_dupjoin("<Chksum ", h, ">");
1025 solv_free((void *)h);
1031 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1032 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1033 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1034 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1035 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1036 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1037 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1038 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1039 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1042 Pool *pool = pool_create();
1047 void set_debuglevel(int level) {
1048 pool_setdebuglevel($self, level);
1050 int set_flag(int flag, int value) {
1051 return pool_set_flag($self, flag, value);
1053 int get_flag(int flag) {
1054 return pool_get_flag($self, flag);
1056 void set_rootdir(const char *rootdir) {
1057 pool_set_rootdir($self, rootdir);
1059 const char *get_rootdir(int flag) {
1060 return pool_get_rootdir($self);
1062 #if defined(SWIGPYTHON)
1064 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1065 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1066 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1067 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1072 return 0; /* exception */
1073 ecode = SWIG_AsVal_int(result, &vresult);
1075 return SWIG_IsOK(ecode) ? vresult : 0;
1078 void set_loadcallback(PyObject *callable) {
1079 if ($self->loadcallback == loadcallback) {
1080 PyObject *obj = $self->loadcallbackdata;
1084 Py_INCREF(callable);
1086 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1089 #if defined(SWIGPERL)
1091 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1095 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1100 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1102 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1112 void set_loadcallback(SV *callable) {
1113 if ($self->loadcallback == loadcallback)
1114 SvREFCNT_dec($self->loadcallbackdata);
1116 SvREFCNT_inc(callable);
1117 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1121 #if defined(SWIGRUBY)
1123 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1124 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1125 VALUE callable = (VALUE)d;
1126 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1127 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1128 return res == Qtrue;
1130 SWIGINTERN void mark_Pool(void *ptr) {
1132 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1133 VALUE callable = (VALUE)pool->loadcallbackdata;
1134 rb_gc_mark(callable);
1138 %typemap(in, numinputs=0) VALUE callable {
1139 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1141 void set_loadcallback(VALUE callable) {
1142 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1147 Pool_set_loadcallback($self, 0);
1150 Id str2id(const char *str, bool create=1) {
1151 return pool_str2id($self, str, create);
1154 Dep *Dep(const char *str, bool create=1) {
1155 Id id = pool_str2id($self, str, create);
1156 return new_Dep($self, id);
1158 const char *id2str(Id id) {
1159 return pool_id2str($self, id);
1161 const char *dep2str(Id id) {
1162 return pool_dep2str($self, id);
1164 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1165 return pool_rel2id($self, name, evr, flags, create);
1167 Id id2langid(Id id, const char *lang, bool create=1) {
1168 return pool_id2langid($self, id, lang, create);
1170 void setarch(const char *arch = 0) {
1179 pool_setarch($self, arch);
1181 Repo *add_repo(const char *name) {
1182 return repo_create($self, name);
1184 const char *lookup_str(Id entry, Id keyname) {
1185 return pool_lookup_str($self, entry, keyname);
1187 Id lookup_id(Id entry, Id keyname) {
1188 return pool_lookup_id($self, entry, keyname);
1190 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1191 return pool_lookup_num($self, entry, keyname, notfound);
1193 bool lookup_void(Id entry, Id keyname) {
1194 return pool_lookup_void($self, entry, keyname);
1196 %newobject lookup_checksum;
1197 Chksum *lookup_checksum(Id entry, Id keyname) {
1199 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1200 return solv_chksum_create_from_bin(type, b);
1203 %newobject Dataiterator;
1204 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1205 return new_Dataiterator($self, 0, p, key, match, flags);
1207 const char *solvid2str(Id solvid) {
1208 return pool_solvid2str($self, solvid);
1210 void addfileprovides() {
1211 pool_addfileprovides($self);
1213 Queue addfileprovides_queue() {
1216 pool_addfileprovides_queue($self, &r, 0);
1219 void createwhatprovides() {
1220 pool_createwhatprovides($self);
1223 %newobject id2solvable;
1224 XSolvable *id2solvable(Id id) {
1225 return new_XSolvable($self, id);
1227 %newobject solvables;
1228 Pool_solvable_iterator * const solvables;
1230 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1231 return new_Pool_solvable_iterator(pool);
1234 %newobject solvables_iter;
1235 Pool_solvable_iterator * solvables_iter() {
1236 return new_Pool_solvable_iterator($self);
1239 Repo *id2repo(Id id) {
1240 if (id < 1 || id >= $self->nrepos)
1242 return pool_id2repo($self, id);
1246 Pool_repo_iterator * const repos;
1248 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1249 return new_Pool_repo_iterator(pool);
1252 %newobject repos_iter;
1253 Pool_repo_iterator * repos_iter() {
1254 return new_Pool_repo_iterator($self);
1258 const char * const errstr;
1260 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1261 pool_set_installed(pool, installed);
1263 Repo *Pool_installed_get(Pool *pool) {
1264 return pool->installed;
1266 const char *Pool_errstr_get(Pool *pool) {
1267 return pool_errstr(pool);
1271 Queue matchprovidingids(const char *match, int flags) {
1277 for (id = 1; id < pool->ss.nstrings; id++)
1278 if (pool->whatprovides[id])
1282 if (!datamatcher_init(&ma, match, flags)) {
1283 for (id = 1; id < pool->ss.nstrings; id++)
1284 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1286 datamatcher_free(&ma);
1293 Job *Job(int how, Id what) {
1294 return new_Job($self, how, what);
1297 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1298 %newobject whatprovides;
1299 Queue whatprovides(DepId dep) {
1304 FOR_PROVIDES(p, pp, dep)
1309 Id towhatprovides(Queue q) {
1310 return pool_queuetowhatprovides($self, &q);
1314 %rename("isknownarch?") isknownarch;
1316 bool isknownarch(DepId id) {
1318 if (!id || id == ID_EMPTY)
1320 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1322 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1329 return solver_create($self);
1332 %newobject Selection;
1333 Selection *Selection() {
1334 return new_Selection($self);
1336 %newobject Selection_all;
1337 Selection *Selection_all(int setflags=0) {
1338 Selection *sel = new_Selection($self);
1339 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1343 Selection *select(const char *name, int flags) {
1344 Selection *sel = new_Selection($self);
1345 sel->flags = selection_make($self, &sel->q, name, flags);
1349 void setpooljobs_helper(Queue jobs) {
1350 queue_free(&$self->pooljobs);
1351 queue_init_clone(&$self->pooljobs, &jobs);
1353 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1354 %newobject getpooljobs;
1355 Queue getpooljobs() {
1357 queue_init_clone(&q, &$self->pooljobs);
1361 #if defined(SWIGPYTHON)
1363 def setpooljobs(self, jobs):
1365 for job in jobs: j += [job.how, job.what]
1366 self.setpooljobs_helper(j)
1369 #if defined(SWIGPERL)
1371 sub solv::Solver::setpooljobs {
1372 my ($self, $jobs) = @_;
1373 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1374 return $self->setpooljobs_helper(\@j);
1378 #if defined(SWIGRUBY)
1381 "class Solv::Pool\n"
1382 " def setpooljobs(jobs)\n"
1384 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1385 " setpooljobs_helper(jl)\n"
1394 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1395 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1396 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1397 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1398 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1399 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1400 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1401 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1402 #ifdef ENABLE_SUSEREPO
1403 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1406 void free(bool reuseids = 0) {
1407 repo_free($self, reuseids);
1409 void empty(bool reuseids = 0) {
1410 repo_empty($self, reuseids);
1413 %rename("isempty?") isempty;
1416 return !$self->nsolvables;
1418 bool add_solv(const char *name, int flags = 0) {
1419 FILE *fp = fopen(name, "r");
1423 r = repo_add_solv($self, fp, flags);
1427 bool add_solv(FILE *fp, int flags = 0) {
1428 return repo_add_solv($self, fp, flags) == 0;
1431 %newobject add_solvable;
1432 XSolvable *add_solvable() {
1433 Id solvid = repo_add_solvable($self);
1434 return new_XSolvable($self->pool, solvid);
1438 bool add_rpmdb(int flags = 0) {
1439 return repo_add_rpmdb($self, 0, flags) == 0;
1441 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1442 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1445 XSolvable *add_rpm(const char *name, int flags = 0) {
1446 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1449 #ifdef ENABLE_PUBKEY
1451 bool add_rpmdb_pubkeys(int flags = 0) {
1452 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1455 %newobject add_pubkey;
1456 XSolvable *add_pubkey(const char *key, int flags = 0) {
1457 return new_XSolvable($self->pool, repo_add_pubkey($self, key, flags));
1461 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1462 return repo_add_rpmmd($self, fp, language, flags) == 0;
1464 bool add_repomdxml(FILE *fp, int flags = 0) {
1465 return repo_add_repomdxml($self, fp, flags) == 0;
1467 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1468 return repo_add_updateinfoxml($self, fp, flags) == 0;
1470 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1471 return repo_add_deltainfoxml($self, fp, flags) == 0;
1474 #ifdef ENABLE_DEBIAN
1475 bool add_debdb(int flags = 0) {
1476 return repo_add_debdb($self, flags) == 0;
1478 bool add_debpackages(FILE *fp, int flags = 0) {
1479 return repo_add_debpackages($self, fp, flags) == 0;
1482 XSolvable *add_deb(const char *name, int flags = 0) {
1483 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
1486 #ifdef ENABLE_SUSEREPO
1487 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1488 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1490 bool add_content(FILE *fp, int flags = 0) {
1491 return repo_add_content($self, fp, flags) == 0;
1493 bool add_products(const char *proddir, int flags = 0) {
1494 return repo_add_products($self, proddir, flags) == 0;
1497 #ifdef ENABLE_MDKREPO
1498 bool add_mdk(FILE *fp, int flags = 0) {
1499 return repo_add_mdk($self, fp, flags) == 0;
1501 bool add_mdk_info(FILE *fp, int flags = 0) {
1502 return repo_add_mdk_info($self, fp, flags) == 0;
1505 #ifdef ENABLE_ARCHREPO
1506 bool add_arch_repo(FILE *fp, int flags = 0) {
1507 return repo_add_arch_repo($self, fp, flags) == 0;
1509 bool add_arch_local(const char *dir, int flags = 0) {
1510 return repo_add_arch_local($self, dir, flags) == 0;
1512 %newobject add_arch_pkg;
1513 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
1514 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
1517 void internalize() {
1518 repo_internalize($self);
1520 bool write(FILE *fp) {
1521 return repo_write($self, fp) == 0;
1523 # HACK, remove if no longer needed!
1524 bool write_first_repodata(FILE *fp) {
1525 int oldnrepodata = $self->nrepodata;
1527 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1528 res = repo_write($self, fp);
1529 $self->nrepodata = oldnrepodata;
1533 %newobject Dataiterator;
1534 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1535 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1540 SWIGINTERN Id Repo_id_get(Repo *repo) {
1541 return repo->repoid;
1544 %newobject solvables;
1545 Repo_solvable_iterator * const solvables;
1547 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1548 return new_Repo_solvable_iterator(repo);
1552 Datapos * const meta;
1554 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1555 Datapos *pos = solv_calloc(1, sizeof(*pos));
1556 pos->solvid = SOLVID_META;
1562 %newobject solvables_iter;
1563 Repo_solvable_iterator *solvables_iter() {
1564 return new_Repo_solvable_iterator($self);
1567 %newobject add_repodata;
1568 XRepodata *add_repodata(int flags = 0) {
1569 Repodata *rd = repo_add_repodata($self, flags);
1570 return new_XRepodata($self, rd->repodataid);
1573 void create_stubs() {
1575 if (!$self->nrepodata)
1577 data = repo_id2repodata($self, $self->nrepodata - 1);
1578 if (data->state != REPODATA_STUB)
1579 (void)repodata_create_stubs(data);
1582 %rename("iscontiguous?") iscontiguous;
1584 bool iscontiguous() {
1586 for (i = $self->start; i < $self->end; i++)
1587 if ($self->pool->solvables[i].repo != $self)
1591 %newobject first_repodata;
1592 XRepodata *first_repodata() {
1595 if ($self->nrepodata < 2)
1597 /* make sure all repodatas but the first are extensions */
1598 data = repo_id2repodata($self, 1);
1599 if (data->loadcallback)
1601 for (i = 2; i < $self->nrepodata; i++)
1603 data = repo_id2repodata($self, i);
1604 if (!data->loadcallback)
1605 return 0; /* oops, not an extension */
1607 return new_XRepodata($self, 1);
1610 %newobject Selection;
1611 Selection *Selection(int setflags=0) {
1612 Selection *sel = new_Selection($self->pool);
1613 setflags |= SOLVER_SETREPO;
1614 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1618 bool __eq__(Repo *repo) {
1619 return $self == repo;
1621 bool __ne__(Repo *repo) {
1622 return $self != repo;
1624 #if defined(SWIGPERL)
1625 %rename("str") __str__;
1628 const char *__str__() {
1631 return solv_strdup($self->name);
1632 sprintf(buf, "Repo#%d", $self->repoid);
1633 return solv_strdup(buf);
1635 %newobject __repr__;
1636 const char *__repr__() {
1640 sprintf(buf, "<Repo #%d ", $self->repoid);
1641 return solv_dupjoin(buf, $self->name, ">");
1643 sprintf(buf, "<Repo #%d>", $self->repoid);
1644 return solv_strdup(buf);
1648 %extend Dataiterator {
1649 static const int SEARCH_STRING = SEARCH_STRING;
1650 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1651 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1652 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1653 static const int SEARCH_GLOB = SEARCH_GLOB;
1654 static const int SEARCH_REGEX = SEARCH_REGEX;
1655 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1656 static const int SEARCH_FILES = SEARCH_FILES;
1657 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1658 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1660 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1661 Dataiterator *di = solv_calloc(1, sizeof(*di));
1662 dataiterator_init(di, pool, repo, p, key, match, flags);
1666 dataiterator_free($self);
1669 #if defined(SWIGPYTHON)
1670 %newobject __iter__;
1671 Dataiterator *__iter__() {
1673 ndi = solv_calloc(1, sizeof(*ndi));
1674 dataiterator_init_clone(ndi, $self);
1677 %rename("next") __next__();
1678 %exception __next__ {
1681 PyErr_SetString(PyExc_StopIteration,"no more matches");
1688 perliter(solv::Dataiterator)
1691 %newobject __next__;
1692 Datamatch *__next__() {
1694 if (!dataiterator_step($self)) {
1697 ndi = solv_calloc(1, sizeof(*ndi));
1698 dataiterator_init_clone(ndi, $self);
1699 dataiterator_strdup(ndi);
1705 while ((d = Dataiterator___next__($self)) != 0) {
1706 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1710 void prepend_keyname(Id key) {
1711 dataiterator_prepend_keyname($self, key);
1713 void skip_solvable() {
1714 dataiterator_skip_solvable($self);
1719 Id lookup_id(Id keyname) {
1720 Pool *pool = $self->repo->pool;
1721 Datapos oldpos = pool->pos;
1724 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1728 const char *lookup_str(Id keyname) {
1729 Pool *pool = $self->repo->pool;
1730 Datapos oldpos = pool->pos;
1733 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1737 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1738 Pool *pool = $self->repo->pool;
1739 Datapos oldpos = pool->pos;
1740 unsigned long long r;
1742 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1746 bool lookup_void(Id keyname) {
1747 Pool *pool = $self->repo->pool;
1748 Datapos oldpos = pool->pos;
1751 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1755 %newobject lookup_checksum;
1756 Chksum *lookup_checksum(Id keyname) {
1757 Pool *pool = $self->repo->pool;
1758 Datapos oldpos = pool->pos;
1760 const unsigned char *b;
1762 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1764 return solv_chksum_create_from_bin(type, b);
1766 const char *lookup_deltaseq() {
1767 Pool *pool = $self->repo->pool;
1768 Datapos oldpos = pool->pos;
1771 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1773 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1774 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1779 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1780 Pool *pool = $self->repo->pool;
1781 Datapos oldpos = pool->pos;
1784 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1788 Queue lookup_idarray(Id keyname) {
1789 Pool *pool = $self->repo->pool;
1790 Datapos oldpos = pool->pos;
1794 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1798 %newobject Dataiterator;
1799 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1800 Pool *pool = $self->repo->pool;
1801 Datapos oldpos = pool->pos;
1804 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1812 dataiterator_free($self);
1815 %newobject solvable;
1816 XSolvable * const solvable;
1818 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1819 return new_XSolvable(di->pool, di->solvid);
1823 return $self->key->name;
1825 const char *key_idstr() {
1826 return pool_id2str($self->pool, $self->key->name);
1829 return $self->key->type;
1831 const char *type_idstr() {
1832 return pool_id2str($self->pool, $self->key->type);
1835 return $self->kv.id;
1837 const char *idstr() {
1838 return pool_id2str($self->pool, $self->kv.id);
1841 return $self->kv.str;
1843 unsigned long long num() {
1844 if ($self->key->type == REPOKEY_TYPE_NUM)
1845 return SOLV_KV_NUM64(&$self->kv);
1846 return $self->kv.num;
1849 return $self->kv.num2;
1853 Pool *pool = $self->pool;
1854 Datapos *pos, oldpos = pool->pos;
1855 dataiterator_setpos($self);
1856 pos = solv_calloc(1, sizeof(*pos));
1861 %newobject parentpos;
1862 Datapos *parentpos() {
1863 Pool *pool = $self->pool;
1864 Datapos *pos, oldpos = pool->pos;
1865 dataiterator_setpos_parent($self);
1866 pos = solv_calloc(1, sizeof(*pos));
1871 #if defined(SWIGPERL)
1872 %rename("str") __str__;
1874 const char *__str__() {
1875 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1877 return $self->kv.str;
1881 %extend Pool_solvable_iterator {
1882 Pool_solvable_iterator(Pool *pool) {
1883 Pool_solvable_iterator *s;
1884 s = solv_calloc(1, sizeof(*s));
1888 #if defined(SWIGPYTHON)
1889 %newobject __iter__;
1890 Pool_solvable_iterator *__iter__() {
1891 Pool_solvable_iterator *s;
1892 s = solv_calloc(1, sizeof(*s));
1896 %rename("next") __next__();
1897 %exception __next__ {
1900 PyErr_SetString(PyExc_StopIteration,"no more matches");
1907 perliter(solv::Pool_solvable_iterator)
1909 %newobject __next__;
1910 XSolvable *__next__() {
1911 Pool *pool = $self->pool;
1912 if ($self->id >= pool->nsolvables)
1914 while (++$self->id < pool->nsolvables)
1915 if (pool->solvables[$self->id].repo)
1916 return new_XSolvable(pool, $self->id);
1922 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1923 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1927 %newobject __getitem__;
1928 XSolvable *__getitem__(Id key) {
1929 Pool *pool = $self->pool;
1930 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1931 return new_XSolvable(pool, key);
1935 return $self->pool->nsolvables;
1939 %extend Pool_repo_iterator {
1940 Pool_repo_iterator(Pool *pool) {
1941 Pool_repo_iterator *s;
1942 s = solv_calloc(1, sizeof(*s));
1946 #if defined(SWIGPYTHON)
1947 %newobject __iter__;
1948 Pool_repo_iterator *__iter__() {
1949 Pool_repo_iterator *s;
1950 s = solv_calloc(1, sizeof(*s));
1954 %rename("next") __next__();
1955 %exception __next__ {
1958 PyErr_SetString(PyExc_StopIteration,"no more matches");
1963 %newobject __next__;
1965 Pool *pool = $self->pool;
1966 if ($self->id >= pool->nrepos)
1968 while (++$self->id < pool->nrepos) {
1969 Repo *r = pool_id2repo(pool, $self->id);
1978 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1979 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1983 Repo *__getitem__(Id key) {
1984 Pool *pool = $self->pool;
1985 if (key > 0 && key < pool->nrepos)
1986 return pool_id2repo(pool, key);
1990 return $self->pool->nrepos;
1994 %extend Repo_solvable_iterator {
1995 Repo_solvable_iterator(Repo *repo) {
1996 Repo_solvable_iterator *s;
1997 s = solv_calloc(1, sizeof(*s));
2001 #if defined(SWIGPYTHON)
2002 %newobject __iter__;
2003 Repo_solvable_iterator *__iter__() {
2004 Repo_solvable_iterator *s;
2005 s = solv_calloc(1, sizeof(*s));
2009 %rename("next") __next__();
2010 %exception __next__ {
2013 PyErr_SetString(PyExc_StopIteration,"no more matches");
2018 %newobject __next__;
2019 XSolvable *__next__() {
2020 Repo *repo = $self->repo;
2021 Pool *pool = repo->pool;
2022 if (repo->start > 0 && $self->id < repo->start)
2023 $self->id = repo->start - 1;
2024 if ($self->id >= repo->end)
2026 while (++$self->id < repo->end)
2027 if (pool->solvables[$self->id].repo == repo)
2028 return new_XSolvable(pool, $self->id);
2034 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2035 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2039 %newobject __getitem__;
2040 XSolvable *__getitem__(Id key) {
2041 Repo *repo = $self->repo;
2042 Pool *pool = repo->pool;
2043 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2044 return new_XSolvable(pool, key);
2048 return $self->repo->pool->nsolvables;
2053 Dep(Pool *pool, Id id) {
2057 s = solv_calloc(1, sizeof(*s));
2063 Dep *Rel(int flags, DepId evrid, bool create=1) {
2064 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2067 return new_Dep($self->pool, id);
2069 %newobject Selection_name;
2070 Selection *Selection_name(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_EQ) {
2075 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2076 if (ISRELDEP(rd->name))
2077 rd = GETRELDEP($self->pool, rd->name);
2079 if (rd->flags == REL_ARCH)
2080 setflags |= SOLVER_SETARCH;
2082 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2085 %newobject Selection_provides;
2086 Selection *Selection_provides(int setflags=0) {
2087 Selection *sel = new_Selection($self->pool);
2088 if (ISRELDEP($self->id)) {
2089 Reldep *rd = GETRELDEP($self->pool, $self->id);
2090 if (rd->flags == REL_ARCH)
2091 setflags |= SOLVER_SETARCH;
2093 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2097 return pool_dep2str($self->pool, $self->id);
2099 bool __eq__(Dep *s) {
2100 return $self->pool == s->pool && $self->id == s->id;
2102 bool __ne__(Dep *s) {
2103 return !Dep___eq__($self, s);
2105 #if defined(SWIGPERL)
2106 %rename("str") __str__;
2108 const char *__str__() {
2109 return pool_dep2str($self->pool, $self->id);
2111 %newobject __repr__;
2112 const char *__repr__() {
2114 sprintf(buf, "<Id #%d ", $self->id);
2115 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2120 XSolvable(Pool *pool, Id id) {
2122 if (!id || id >= pool->nsolvables)
2124 s = solv_calloc(1, sizeof(*s));
2130 return pool_solvid2str($self->pool, $self->id);
2132 const char *lookup_str(Id keyname) {
2133 return pool_lookup_str($self->pool, $self->id, keyname);
2135 Id lookup_id(Id keyname) {
2136 return pool_lookup_id($self->pool, $self->id, keyname);
2138 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2139 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2141 bool lookup_void(Id keyname) {
2142 return pool_lookup_void($self->pool, $self->id, keyname);
2144 %newobject lookup_checksum;
2145 Chksum *lookup_checksum(Id keyname) {
2147 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2148 return solv_chksum_create_from_bin(type, b);
2150 Queue lookup_idarray(Id keyname, Id marker = -1) {
2151 Solvable *s = $self->pool->solvables + $self->id;
2154 solvable_lookup_deparray(s, keyname, &r, marker);
2157 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2158 %newobject lookup_deparray;
2159 Queue lookup_deparray(Id keyname, Id marker = -1) {
2160 Solvable *s = $self->pool->solvables + $self->id;
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 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2278 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2280 void add_obsoletes(DepId id) {
2281 Solvable *s = $self->pool->solvables + $self->id;
2282 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2284 void add_conflicts(DepId id) {
2285 Solvable *s = $self->pool->solvables + $self->id;
2286 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2288 void add_requires(DepId id, Id marker = -1) {
2289 Solvable *s = $self->pool->solvables + $self->id;
2290 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2291 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2293 void add_recommends(DepId id) {
2294 Solvable *s = $self->pool->solvables + $self->id;
2295 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2297 void add_suggests(DepId id) {
2298 Solvable *s = $self->pool->solvables + $self->id;
2299 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2301 void add_supplements(DepId id) {
2302 Solvable *s = $self->pool->solvables + $self->id;
2303 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2305 void add_enhances(DepId id) {
2306 Solvable *s = $self->pool->solvables + $self->id;
2307 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2310 void unset(Id keyname) {
2311 Solvable *s = $self->pool->solvables + $self->id;
2312 repo_unset(s->repo, $self->id, keyname);
2315 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2316 Solvable *s = $self->pool->solvables + $self->id;
2317 solvable_add_deparray(s, keyname, id, marker);
2320 %newobject Selection;
2321 Selection *Selection(int setflags=0) {
2322 Selection *sel = new_Selection($self->pool);
2323 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2327 bool __eq__(XSolvable *s) {
2328 return $self->pool == s->pool && $self->id == s->id;
2330 bool __ne__(XSolvable *s) {
2331 return !XSolvable___eq__($self, s);
2333 #if defined(SWIGPERL)
2334 %rename("str") __str__;
2336 const char *__str__() {
2337 return pool_solvid2str($self->pool, $self->id);
2339 %newobject __repr__;
2340 const char *__repr__() {
2342 sprintf(buf, "<Solvable #%d ", $self->id);
2343 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2348 Problem(Solver *solv, Id id) {
2350 p = solv_calloc(1, sizeof(*p));
2355 %newobject findproblemrule;
2356 XRule *findproblemrule() {
2357 Id r = solver_findproblemrule($self->solv, $self->id);
2358 return new_XRule($self->solv, r);
2360 %newobject findallproblemrules;
2361 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2362 Queue findallproblemrules(int unfiltered=0) {
2363 Solver *solv = $self->solv;
2368 solver_findallproblemrules(solv, $self->id, &q);
2371 for (i = j = 0; i < q.count; i++)
2373 SolverRuleinfo rclass;
2374 probr = q.elements[i];
2375 rclass = solver_ruleclass(solv, probr);
2376 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2378 q.elements[j++] = probr;
2381 queue_truncate(&q, j);
2385 int solution_count() {
2386 return solver_solution_count($self->solv, $self->id);
2388 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2389 %newobject solutions;
2394 cnt = solver_solution_count($self->solv, $self->id);
2395 for (i = 1; i <= cnt; i++)
2399 #if defined(SWIGPERL)
2400 %rename("str") __str__;
2402 const char *__str__() {
2403 Id type, source, target, dep;
2404 Id r = solver_findproblemrule($self->solv, $self->id);
2407 type = solver_ruleinfo($self->solv, r, &source, &target, &dep);
2408 return solver_problemruleinfo2str($self->solv, type, source, target, dep);
2413 Solution(Problem *p, Id id) {
2415 s = solv_calloc(1, sizeof(*s));
2417 s->problemid = p->id;
2421 int element_count() {
2422 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2425 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2426 %newobject elements;
2427 Queue elements(bool expandreplaces=0) {
2431 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2432 for (i = 1; i <= cnt; i++)
2435 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2437 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2443 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2444 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2446 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2447 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2448 queue_push2(&q, p, rp);
2450 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2451 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2452 queue_push2(&q, p, rp);
2454 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2455 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2456 queue_push2(&q, p, rp);
2458 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2459 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2460 queue_push2(&q, p, rp);
2465 queue_push2(&q, i, type);
2466 queue_push2(&q, p, rp);
2472 %extend Solutionelement {
2473 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2475 e = solv_calloc(1, sizeof(*e));
2477 e->problemid = problemid;
2489 if (p == SOLVER_SOLUTION_ERASE)
2494 else if (p == SOLVER_SOLUTION_REPLACE)
2499 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2500 illegal = POLICY_ILLEGAL_DOWNGRADE;
2501 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2502 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2503 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2504 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2505 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2506 illegal = POLICY_ILLEGAL_NAMECHANGE;
2508 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);
2509 return solver_solutionelement2str($self->solv, p, rp);
2511 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2512 %newobject replaceelements;
2513 Queue replaceelements() {
2518 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2521 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2522 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2523 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2524 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2525 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2526 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2527 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2528 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2529 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2531 queue_push(&q, $self->type);
2534 int illegalreplace() {
2535 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2537 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2539 %newobject solvable;
2540 XSolvable * const solvable;
2541 %newobject replacement;
2542 XSolvable * const replacement;
2545 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2546 return new_XSolvable(e->solv->pool, e->p);
2548 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2549 return new_XSolvable(e->solv->pool, e->rp);
2551 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2552 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2554 return (e->p - 1) / 2;
2559 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2560 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2561 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2562 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2563 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2564 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)
2565 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2566 if ($self->type == SOLVER_SOLUTION_ERASE)
2567 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2573 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2574 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2575 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2576 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2577 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2578 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2579 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2580 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2581 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2582 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2583 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2584 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2585 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2586 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2587 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2588 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2589 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2590 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2591 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2592 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2593 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2594 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2596 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2597 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2598 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2599 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2600 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2601 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2602 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2603 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2604 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2605 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2606 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2608 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2609 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2610 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2611 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2613 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2614 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2615 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2616 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2617 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2618 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2619 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2620 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2621 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2622 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2623 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2624 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2626 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
2627 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
2628 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
2629 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
2630 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
2631 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
2632 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
2633 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
2634 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
2635 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
2636 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
2642 int set_flag(int flag, int value) {
2643 return solver_set_flag($self, flag, value);
2645 int get_flag(int flag) {
2646 return solver_get_flag($self, flag);
2648 #if defined(SWIGPYTHON)
2650 def solve(self, jobs):
2652 for job in jobs: j += [job.how, job.what]
2653 return self.solve_helper(j)
2656 #if defined(SWIGPERL)
2658 sub solv::Solver::solve {
2659 my ($self, $jobs) = @_;
2660 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2661 return $self->solve_helper(\@j);
2665 #if defined(SWIGRUBY)
2668 "class Solv::Solver\n"
2669 " def solve(jobs)\n"
2671 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2672 " solve_helper(jl)\n"
2678 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2679 %newobject solve_helper;
2680 Queue solve_helper(Queue jobs) {
2684 solver_solve($self, &jobs);
2685 cnt = solver_problem_count($self);
2686 for (i = 1; i <= cnt; i++)
2690 %newobject transaction;
2691 Transaction *transaction() {
2692 return solver_create_transaction($self);
2695 int describe_decision(XSolvable *s, XRule **OUTPUT) {
2697 int reason = solver_describe_decision($self, s->id, &ruleid);
2698 *OUTPUT = new_XRule($self, ruleid);
2703 %extend Transaction {
2704 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2705 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2706 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2707 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2708 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2709 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2710 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2711 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2712 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2713 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2714 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2715 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2716 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2717 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2718 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2719 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2720 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2721 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2722 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2723 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2724 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2725 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2726 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2727 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2728 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2729 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2730 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2731 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2733 transaction_free($self);
2736 %rename("isempty?") isempty;
2739 return $self->steps.count == 0;
2742 %newobject othersolvable;
2743 XSolvable *othersolvable(XSolvable *s) {
2744 Id op = transaction_obs_pkg($self, s->id);
2745 return new_XSolvable($self->pool, op);
2748 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2749 %newobject allothersolvables;
2750 Queue allothersolvables(XSolvable *s) {
2753 transaction_all_obs_pkgs($self, s->id, &q);
2757 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2758 %newobject classify;
2759 Queue classify(int mode = 0) {
2762 transaction_classify($self, mode, &q);
2766 # deprecated, use newsolvables instead
2767 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2768 %newobject newpackages;
2769 Queue newpackages() {
2773 cut = transaction_installedresult(self, &q);
2774 queue_truncate(&q, cut);
2778 # deprecated, use keptsolvables instead
2779 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2780 %newobject keptpackages;
2781 Queue keptpackages() {
2785 cut = transaction_installedresult(self, &q);
2787 queue_deleten(&q, 0, cut);
2791 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2792 %newobject newsolvables;
2793 Queue newsolvables() {
2797 cut = transaction_installedresult(self, &q);
2798 queue_truncate(&q, cut);
2802 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2803 %newobject keptsolvables;
2804 Queue keptsolvables() {
2808 cut = transaction_installedresult(self, &q);
2810 queue_deleten(&q, 0, cut);
2814 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2818 queue_init_clone(&q, &$self->steps);
2822 int steptype(XSolvable *s, int mode) {
2823 return transaction_type($self, s->id, mode);
2825 int calc_installsizechange() {
2826 return transaction_calc_installsizechange($self);
2828 void order(int flags=0) {
2829 transaction_order($self, flags);
2833 %extend TransactionClass {
2834 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2835 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2836 cl->transaction = trans;
2840 cl->fromid = fromid;
2844 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2845 %newobject solvables;
2849 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2852 const char * const fromstr;
2853 const char * const tostr;
2855 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
2856 return pool_id2str(cl->transaction->pool, cl->fromid);
2858 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
2859 return pool_id2str(cl->transaction->pool, cl->toid);
2865 XRule(Solver *solv, Id id) {
2868 XRule *xr = solv_calloc(1, sizeof(*xr));
2875 SWIGINTERN int XRule_type_get(XRule *xr) {
2876 return solver_ruleclass(xr->solv, xr->id);
2881 Id type, source, target, dep;
2882 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2883 return new_Ruleinfo($self, type, source, target, dep);
2885 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2886 %newobject allinfos;
2890 solver_allruleinfos($self->solv, $self->id, &q);
2894 bool __eq__(XRule *xr) {
2895 return $self->solv == xr->solv && $self->id == xr->id;
2897 bool __ne__(XRule *xr) {
2898 return !XRule___eq__($self, xr);
2900 %newobject __repr__;
2901 const char *__repr__() {
2903 sprintf(buf, "<Rule #%d>", $self->id);
2904 return solv_strdup(buf);
2909 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
2910 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2914 ri->source = source;
2915 ri->target = target;
2916 ri->dep_id = dep_id;
2919 %newobject solvable;
2920 XSolvable * const solvable;
2921 %newobject othersolvable;
2922 XSolvable * const othersolvable;
2926 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2927 return new_XSolvable(ri->solv->pool, ri->source);
2929 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2930 return new_XSolvable(ri->solv->pool, ri->target);
2932 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
2933 return new_Dep(ri->solv->pool, ri->dep_id);
2936 const char *problemstr() {
2937 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
2942 XRepodata(Repo *repo, Id id) {
2943 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2949 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2951 void set_id(Id solvid, Id keyname, DepId id) {
2952 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2954 void set_str(Id solvid, Id keyname, const char *str) {
2955 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2957 void set_poolstr(Id solvid, Id keyname, const char *str) {
2958 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2960 void add_idarray(Id solvid, Id keyname, DepId id) {
2961 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2963 void add_flexarray(Id solvid, Id keyname, Id handle) {
2964 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2966 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2967 const unsigned char *buf = solv_chksum_get(chksum, 0);
2969 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2971 const char *lookup_str(Id solvid, Id keyname) {
2972 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2974 Queue lookup_idarray(Id solvid, Id keyname) {
2977 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2980 %newobject lookup_checksum;
2981 Chksum *lookup_checksum(Id solvid, Id keyname) {
2983 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2984 return solv_chksum_create_from_bin(type, b);
2986 void internalize() {
2987 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2989 void create_stubs() {
2990 Repodata *data = repo_id2repodata($self->repo, $self->id);
2991 data = repodata_create_stubs(data);
2992 $self->id = data->repodataid;
2994 bool write(FILE *fp) {
2995 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
2997 bool add_solv(FILE *fp, int flags = 0) {
2998 Repodata *data = repo_id2repodata($self->repo, $self->id);
2999 int r, oldstate = data->state;
3000 data->state = REPODATA_LOADING;
3001 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3002 if (r || data->state == REPODATA_LOADING)
3003 data->state = oldstate;
3006 void extend_to_repo() {
3007 Repodata *data = repo_id2repodata($self->repo, $self->id);
3008 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3010 bool __eq__(XRepodata *xr) {
3011 return $self->repo == xr->repo && $self->id == xr->id;
3013 bool __ne__(XRepodata *xr) {
3014 return !XRepodata___eq__($self, xr);
3016 %newobject __repr__;
3017 const char *__repr__() {
3019 sprintf(buf, "<Repodata #%d>", $self->id);
3020 return solv_strdup(buf);