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;
665 unsigned int const created;
666 unsigned int const expires;
667 const char * const keyid;
671 %rename(xfopen) solvfp_xfopen;
672 %rename(xfopen_fd) solvfp_xfopen_fd;
674 %nodefaultctor SolvFp;
678 %newobject solvfp_xfopen;
679 %newobject solvfp_xfopen_fd;
681 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
682 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
685 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
689 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
692 sfp = solv_calloc(1, sizeof(SolvFp));
696 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
699 fp = solv_xfopen(fn, mode);
702 sfp = solv_calloc(1, sizeof(SolvFp));
727 %nodefaultctor Transaction;
728 %nodefaultdtor Transaction;
734 Transaction * const transaction;
748 return $self->fp ? fileno($self->fp) : -1;
751 return $self->fp ? dup(fileno($self->fp)) : -1;
756 return fflush($self->fp) == 0;
762 ret = fclose($self->fp) == 0;
769 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
770 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
771 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
772 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
773 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
774 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
775 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
776 static const Id SOLVER_NOOP = SOLVER_NOOP;
777 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
778 static const Id SOLVER_ERASE = SOLVER_ERASE;
779 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
780 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
781 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
782 static const Id SOLVER_LOCK = SOLVER_LOCK;
783 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
784 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
785 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
786 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
787 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
788 static const Id SOLVER_WEAK = SOLVER_WEAK;
789 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
790 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
791 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
792 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
793 static const Id SOLVER_SETEV = SOLVER_SETEV;
794 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
795 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
796 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
797 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
798 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
799 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
800 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
802 Job(Pool *pool, int how, Id what) {
803 Job *job = solv_calloc(1, sizeof(*job));
810 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
811 %newobject solvables;
815 pool_job2solvables($self->pool, &q, $self->how, $self->what);
819 %rename("isemptyupdate?") isemptyupdate;
821 bool isemptyupdate() {
822 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
825 bool __eq__(Job *j) {
826 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
828 bool __ne__(Job *j) {
829 return !Job___eq__($self, j);
831 #if defined(SWIGPERL)
832 %rename("str") __str__;
834 const char *__str__() {
835 return pool_job2str($self->pool, $self->how, $self->what, 0);
837 const char *__repr__() {
838 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
839 return pool_tmpjoin($self->pool, "<Job ", str, ">");
844 static const Id SELECTION_NAME = SELECTION_NAME;
845 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
846 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
847 static const Id SELECTION_CANON = SELECTION_CANON;
848 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
849 static const Id SELECTION_REL = SELECTION_REL;
850 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
851 static const Id SELECTION_GLOB = SELECTION_GLOB;
852 static const Id SELECTION_FLAT = SELECTION_FLAT;
853 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
854 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
855 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
857 Selection(Pool *pool) {
859 s = solv_calloc(1, sizeof(*s));
865 queue_free(&$self->q);
872 %rename("isempty?") isempty;
875 return $self->q.count == 0;
877 void filter(Selection *lsel) {
878 if ($self->pool != lsel->pool)
879 queue_empty(&$self->q);
881 selection_filter($self->pool, &$self->q, &lsel->q);
883 void add(Selection *lsel) {
884 if ($self->pool == lsel->pool)
886 selection_add($self->pool, &$self->q, &lsel->q);
887 $self->flags |= lsel->flags;
890 void add_raw(Id how, Id what) {
891 queue_push2(&$self->q, how, what);
893 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
895 Queue jobs(int flags) {
898 queue_init_clone(&q, &$self->q);
899 for (i = 0; i < q.count; i += 2)
900 q.elements[i] |= flags;
904 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
905 %newobject solvables;
909 selection_solvables($self->pool, &$self->q, &q);
913 #if defined(SWIGPERL)
914 %rename("str") __str__;
916 const char *__str__() {
917 return pool_selection2str($self->pool, &$self->q, 0);
919 const char *__repr__() {
920 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
921 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
927 return (Chksum *)solv_chksum_create(type);
929 Chksum(Id type, const char *hex) {
930 unsigned char buf[64];
931 int l = solv_chksum_len(type);
934 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
936 return (Chksum *)solv_chksum_create_from_bin(type, buf);
939 solv_chksum_free($self, 0);
943 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
944 return solv_chksum_get_type(chksum);
947 void add(const char *str) {
948 solv_chksum_add($self, str, strlen((char *)str));
950 void add_fp(FILE *fp) {
953 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
954 solv_chksum_add($self, buf, l);
955 rewind(fp); /* convenience */
957 void add_fd(int fd) {
960 while ((l = read(fd, buf, sizeof(buf))) > 0)
961 solv_chksum_add($self, buf, l);
962 lseek(fd, 0, 0); /* convenience */
964 void add_stat(const char *filename) {
966 if (stat(filename, &stb))
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));
973 void add_fstat(int fd) {
976 memset(&stb, 0, sizeof(stb));
977 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
978 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
979 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
980 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
984 const unsigned char *b;
985 b = solv_chksum_get($self, &l);
986 return cdata_void((void *)b, l);
991 const unsigned char *b;
994 b = solv_chksum_get($self, &l);
995 ret = solv_malloc(2 * l + 1);
996 solv_bin2hex(b, l, ret);
1000 bool __eq__(Chksum *chk) {
1002 const unsigned char *b, *bo;
1005 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1007 b = solv_chksum_get($self, &l);
1008 bo = solv_chksum_get(chk, 0);
1009 return memcmp(b, bo, l) == 0;
1011 bool __ne__(Chksum *chk) {
1012 return !Chksum___eq__($self, chk);
1014 #if defined(SWIGRUBY)
1015 %rename("to_s") __str__;
1017 #if defined(SWIGPERL)
1018 %rename("str") __str__;
1021 const char *__str__() {
1024 if (solv_chksum_isfinished($self))
1025 h = Chksum_hex($self);
1026 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1027 solv_free((void *)h);
1030 %newobject __repr__;
1031 const char *__repr__() {
1032 const char *h = Chksum___str__($self);
1033 const char *str = solv_dupjoin("<Chksum ", h, ">");
1034 solv_free((void *)h);
1040 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1041 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1042 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1043 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1044 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1045 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1046 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1047 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1048 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1051 Pool *pool = pool_create();
1056 void set_debuglevel(int level) {
1057 pool_setdebuglevel($self, level);
1059 int set_flag(int flag, int value) {
1060 return pool_set_flag($self, flag, value);
1062 int get_flag(int flag) {
1063 return pool_get_flag($self, flag);
1065 void set_rootdir(const char *rootdir) {
1066 pool_set_rootdir($self, rootdir);
1068 const char *get_rootdir(int flag) {
1069 return pool_get_rootdir($self);
1071 #if defined(SWIGPYTHON)
1073 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1074 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1075 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1076 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1081 return 0; /* exception */
1082 ecode = SWIG_AsVal_int(result, &vresult);
1084 return SWIG_IsOK(ecode) ? vresult : 0;
1087 void set_loadcallback(PyObject *callable) {
1088 if ($self->loadcallback == loadcallback) {
1089 PyObject *obj = $self->loadcallbackdata;
1093 Py_INCREF(callable);
1095 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1098 #if defined(SWIGPERL)
1100 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1104 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1109 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1111 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1121 void set_loadcallback(SV *callable) {
1122 if ($self->loadcallback == loadcallback)
1123 SvREFCNT_dec($self->loadcallbackdata);
1125 SvREFCNT_inc(callable);
1126 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1130 #if defined(SWIGRUBY)
1132 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1133 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1134 VALUE callable = (VALUE)d;
1135 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1136 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1137 return res == Qtrue;
1139 SWIGINTERN void mark_Pool(void *ptr) {
1141 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1142 VALUE callable = (VALUE)pool->loadcallbackdata;
1143 rb_gc_mark(callable);
1147 %typemap(in, numinputs=0) VALUE callable {
1148 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1150 void set_loadcallback(VALUE callable) {
1151 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1156 Pool_set_loadcallback($self, 0);
1159 Id str2id(const char *str, bool create=1) {
1160 return pool_str2id($self, str, create);
1163 Dep *Dep(const char *str, bool create=1) {
1164 Id id = pool_str2id($self, str, create);
1165 return new_Dep($self, id);
1167 const char *id2str(Id id) {
1168 return pool_id2str($self, id);
1170 const char *dep2str(Id id) {
1171 return pool_dep2str($self, id);
1173 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1174 return pool_rel2id($self, name, evr, flags, create);
1176 Id id2langid(Id id, const char *lang, bool create=1) {
1177 return pool_id2langid($self, id, lang, create);
1179 void setarch(const char *arch = 0) {
1188 pool_setarch($self, arch);
1190 Repo *add_repo(const char *name) {
1191 return repo_create($self, name);
1193 const char *lookup_str(Id entry, Id keyname) {
1194 return pool_lookup_str($self, entry, keyname);
1196 Id lookup_id(Id entry, Id keyname) {
1197 return pool_lookup_id($self, entry, keyname);
1199 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1200 return pool_lookup_num($self, entry, keyname, notfound);
1202 bool lookup_void(Id entry, Id keyname) {
1203 return pool_lookup_void($self, entry, keyname);
1205 %newobject lookup_checksum;
1206 Chksum *lookup_checksum(Id entry, Id keyname) {
1208 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1209 return solv_chksum_create_from_bin(type, b);
1212 %newobject Dataiterator;
1213 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1214 return new_Dataiterator($self, 0, p, key, match, flags);
1216 const char *solvid2str(Id solvid) {
1217 return pool_solvid2str($self, solvid);
1219 void addfileprovides() {
1220 pool_addfileprovides($self);
1222 Queue addfileprovides_queue() {
1225 pool_addfileprovides_queue($self, &r, 0);
1228 void createwhatprovides() {
1229 pool_createwhatprovides($self);
1232 %newobject id2solvable;
1233 XSolvable *id2solvable(Id id) {
1234 return new_XSolvable($self, id);
1236 %newobject solvables;
1237 Pool_solvable_iterator * const solvables;
1239 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1240 return new_Pool_solvable_iterator(pool);
1243 %newobject solvables_iter;
1244 Pool_solvable_iterator * solvables_iter() {
1245 return new_Pool_solvable_iterator($self);
1248 Repo *id2repo(Id id) {
1249 if (id < 1 || id >= $self->nrepos)
1251 return pool_id2repo($self, id);
1255 Pool_repo_iterator * const repos;
1257 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1258 return new_Pool_repo_iterator(pool);
1261 %newobject repos_iter;
1262 Pool_repo_iterator * repos_iter() {
1263 return new_Pool_repo_iterator($self);
1267 const char * const errstr;
1269 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1270 pool_set_installed(pool, installed);
1272 Repo *Pool_installed_get(Pool *pool) {
1273 return pool->installed;
1275 const char *Pool_errstr_get(Pool *pool) {
1276 return pool_errstr(pool);
1280 Queue matchprovidingids(const char *match, int flags) {
1286 for (id = 1; id < pool->ss.nstrings; id++)
1287 if (pool->whatprovides[id])
1291 if (!datamatcher_init(&ma, match, flags)) {
1292 for (id = 1; id < pool->ss.nstrings; id++)
1293 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1295 datamatcher_free(&ma);
1302 Job *Job(int how, Id what) {
1303 return new_Job($self, how, what);
1306 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1307 %newobject whatprovides;
1308 Queue whatprovides(DepId dep) {
1313 FOR_PROVIDES(p, pp, dep)
1318 Id towhatprovides(Queue q) {
1319 return pool_queuetowhatprovides($self, &q);
1323 %rename("isknownarch?") isknownarch;
1325 bool isknownarch(DepId id) {
1327 if (!id || id == ID_EMPTY)
1329 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1331 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1338 return solver_create($self);
1341 %newobject Selection;
1342 Selection *Selection() {
1343 return new_Selection($self);
1345 %newobject Selection_all;
1346 Selection *Selection_all(int setflags=0) {
1347 Selection *sel = new_Selection($self);
1348 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1352 Selection *select(const char *name, int flags) {
1353 Selection *sel = new_Selection($self);
1354 sel->flags = selection_make($self, &sel->q, name, flags);
1358 void setpooljobs_helper(Queue jobs) {
1359 queue_free(&$self->pooljobs);
1360 queue_init_clone(&$self->pooljobs, &jobs);
1362 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1363 %newobject getpooljobs;
1364 Queue getpooljobs() {
1366 queue_init_clone(&q, &$self->pooljobs);
1370 #if defined(SWIGPYTHON)
1372 def setpooljobs(self, jobs):
1374 for job in jobs: j += [job.how, job.what]
1375 self.setpooljobs_helper(j)
1378 #if defined(SWIGPERL)
1380 sub solv::Solver::setpooljobs {
1381 my ($self, $jobs) = @_;
1382 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1383 return $self->setpooljobs_helper(\@j);
1387 #if defined(SWIGRUBY)
1390 "class Solv::Pool\n"
1391 " def setpooljobs(jobs)\n"
1393 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1394 " setpooljobs_helper(jl)\n"
1403 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1404 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1405 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1406 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1407 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1408 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1409 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1410 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1411 #ifdef ENABLE_SUSEREPO
1412 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1415 void free(bool reuseids = 0) {
1416 repo_free($self, reuseids);
1418 void empty(bool reuseids = 0) {
1419 repo_empty($self, reuseids);
1422 %rename("isempty?") isempty;
1425 return !$self->nsolvables;
1427 bool add_solv(const char *name, int flags = 0) {
1428 FILE *fp = fopen(name, "r");
1432 r = repo_add_solv($self, fp, flags);
1436 bool add_solv(FILE *fp, int flags = 0) {
1437 return repo_add_solv($self, fp, flags) == 0;
1440 %newobject add_solvable;
1441 XSolvable *add_solvable() {
1442 Id solvid = repo_add_solvable($self);
1443 return new_XSolvable($self->pool, solvid);
1447 bool add_rpmdb(int flags = 0) {
1448 return repo_add_rpmdb($self, 0, flags) == 0;
1450 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1451 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1454 XSolvable *add_rpm(const char *name, int flags = 0) {
1455 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1458 #ifdef ENABLE_PUBKEY
1460 bool add_rpmdb_pubkeys(int flags = 0) {
1461 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1464 %newobject add_pubkey;
1465 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
1466 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
1468 bool add_keyring(FILE *fp, int flags = 0) {
1469 return repo_add_keyring($self, fp, flags);
1471 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
1472 return repo_add_keydir($self, keydir, suffix, flags);
1476 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1477 return repo_add_rpmmd($self, fp, language, flags) == 0;
1479 bool add_repomdxml(FILE *fp, int flags = 0) {
1480 return repo_add_repomdxml($self, fp, flags) == 0;
1482 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1483 return repo_add_updateinfoxml($self, fp, flags) == 0;
1485 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1486 return repo_add_deltainfoxml($self, fp, flags) == 0;
1489 #ifdef ENABLE_DEBIAN
1490 bool add_debdb(int flags = 0) {
1491 return repo_add_debdb($self, flags) == 0;
1493 bool add_debpackages(FILE *fp, int flags = 0) {
1494 return repo_add_debpackages($self, fp, flags) == 0;
1497 XSolvable *add_deb(const char *name, int flags = 0) {
1498 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
1501 #ifdef ENABLE_SUSEREPO
1502 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1503 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1505 bool add_content(FILE *fp, int flags = 0) {
1506 return repo_add_content($self, fp, flags) == 0;
1508 bool add_products(const char *proddir, int flags = 0) {
1509 return repo_add_products($self, proddir, flags) == 0;
1512 #ifdef ENABLE_MDKREPO
1513 bool add_mdk(FILE *fp, int flags = 0) {
1514 return repo_add_mdk($self, fp, flags) == 0;
1516 bool add_mdk_info(FILE *fp, int flags = 0) {
1517 return repo_add_mdk_info($self, fp, flags) == 0;
1520 #ifdef ENABLE_ARCHREPO
1521 bool add_arch_repo(FILE *fp, int flags = 0) {
1522 return repo_add_arch_repo($self, fp, flags) == 0;
1524 bool add_arch_local(const char *dir, int flags = 0) {
1525 return repo_add_arch_local($self, dir, flags) == 0;
1527 %newobject add_arch_pkg;
1528 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
1529 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
1532 void internalize() {
1533 repo_internalize($self);
1535 bool write(FILE *fp) {
1536 return repo_write($self, fp) == 0;
1538 # HACK, remove if no longer needed!
1539 bool write_first_repodata(FILE *fp) {
1540 int oldnrepodata = $self->nrepodata;
1542 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1543 res = repo_write($self, fp);
1544 $self->nrepodata = oldnrepodata;
1548 %newobject Dataiterator;
1549 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1550 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1555 SWIGINTERN Id Repo_id_get(Repo *repo) {
1556 return repo->repoid;
1559 %newobject solvables;
1560 Repo_solvable_iterator * const solvables;
1562 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1563 return new_Repo_solvable_iterator(repo);
1567 Datapos * const meta;
1569 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1570 Datapos *pos = solv_calloc(1, sizeof(*pos));
1571 pos->solvid = SOLVID_META;
1577 %newobject solvables_iter;
1578 Repo_solvable_iterator *solvables_iter() {
1579 return new_Repo_solvable_iterator($self);
1582 %newobject add_repodata;
1583 XRepodata *add_repodata(int flags = 0) {
1584 Repodata *rd = repo_add_repodata($self, flags);
1585 return new_XRepodata($self, rd->repodataid);
1588 void create_stubs() {
1590 if (!$self->nrepodata)
1592 data = repo_id2repodata($self, $self->nrepodata - 1);
1593 if (data->state != REPODATA_STUB)
1594 (void)repodata_create_stubs(data);
1597 %rename("iscontiguous?") iscontiguous;
1599 bool iscontiguous() {
1601 for (i = $self->start; i < $self->end; i++)
1602 if ($self->pool->solvables[i].repo != $self)
1606 %newobject first_repodata;
1607 XRepodata *first_repodata() {
1610 if ($self->nrepodata < 2)
1612 /* make sure all repodatas but the first are extensions */
1613 data = repo_id2repodata($self, 1);
1614 if (data->loadcallback)
1616 for (i = 2; i < $self->nrepodata; i++)
1618 data = repo_id2repodata($self, i);
1619 if (!data->loadcallback)
1620 return 0; /* oops, not an extension */
1622 return new_XRepodata($self, 1);
1625 %newobject Selection;
1626 Selection *Selection(int setflags=0) {
1627 Selection *sel = new_Selection($self->pool);
1628 setflags |= SOLVER_SETREPO;
1629 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1633 bool __eq__(Repo *repo) {
1634 return $self == repo;
1636 bool __ne__(Repo *repo) {
1637 return $self != repo;
1639 #if defined(SWIGPERL)
1640 %rename("str") __str__;
1643 const char *__str__() {
1646 return solv_strdup($self->name);
1647 sprintf(buf, "Repo#%d", $self->repoid);
1648 return solv_strdup(buf);
1650 %newobject __repr__;
1651 const char *__repr__() {
1655 sprintf(buf, "<Repo #%d ", $self->repoid);
1656 return solv_dupjoin(buf, $self->name, ">");
1658 sprintf(buf, "<Repo #%d>", $self->repoid);
1659 return solv_strdup(buf);
1663 %extend Dataiterator {
1664 static const int SEARCH_STRING = SEARCH_STRING;
1665 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1666 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1667 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1668 static const int SEARCH_GLOB = SEARCH_GLOB;
1669 static const int SEARCH_REGEX = SEARCH_REGEX;
1670 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1671 static const int SEARCH_FILES = SEARCH_FILES;
1672 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1673 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1675 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1676 Dataiterator *di = solv_calloc(1, sizeof(*di));
1677 dataiterator_init(di, pool, repo, p, key, match, flags);
1681 dataiterator_free($self);
1684 #if defined(SWIGPYTHON)
1685 %newobject __iter__;
1686 Dataiterator *__iter__() {
1688 ndi = solv_calloc(1, sizeof(*ndi));
1689 dataiterator_init_clone(ndi, $self);
1692 %rename("next") __next__();
1693 %exception __next__ {
1696 PyErr_SetString(PyExc_StopIteration,"no more matches");
1703 perliter(solv::Dataiterator)
1706 %newobject __next__;
1707 Datamatch *__next__() {
1709 if (!dataiterator_step($self)) {
1712 ndi = solv_calloc(1, sizeof(*ndi));
1713 dataiterator_init_clone(ndi, $self);
1714 dataiterator_strdup(ndi);
1720 while ((d = Dataiterator___next__($self)) != 0) {
1721 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1725 void prepend_keyname(Id key) {
1726 dataiterator_prepend_keyname($self, key);
1728 void skip_solvable() {
1729 dataiterator_skip_solvable($self);
1734 Id lookup_id(Id keyname) {
1735 Pool *pool = $self->repo->pool;
1736 Datapos oldpos = pool->pos;
1739 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1743 const char *lookup_str(Id keyname) {
1744 Pool *pool = $self->repo->pool;
1745 Datapos oldpos = pool->pos;
1748 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1752 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1753 Pool *pool = $self->repo->pool;
1754 Datapos oldpos = pool->pos;
1755 unsigned long long r;
1757 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1761 bool lookup_void(Id keyname) {
1762 Pool *pool = $self->repo->pool;
1763 Datapos oldpos = pool->pos;
1766 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1770 %newobject lookup_checksum;
1771 Chksum *lookup_checksum(Id keyname) {
1772 Pool *pool = $self->repo->pool;
1773 Datapos oldpos = pool->pos;
1775 const unsigned char *b;
1777 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1779 return solv_chksum_create_from_bin(type, b);
1781 const char *lookup_deltaseq() {
1782 Pool *pool = $self->repo->pool;
1783 Datapos oldpos = pool->pos;
1786 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1788 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1789 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1794 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1795 Pool *pool = $self->repo->pool;
1796 Datapos oldpos = pool->pos;
1799 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1803 Queue lookup_idarray(Id keyname) {
1804 Pool *pool = $self->repo->pool;
1805 Datapos oldpos = pool->pos;
1809 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1813 %newobject Dataiterator;
1814 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1815 Pool *pool = $self->repo->pool;
1816 Datapos oldpos = pool->pos;
1819 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1827 dataiterator_free($self);
1830 %newobject solvable;
1831 XSolvable * const solvable;
1833 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1834 return new_XSolvable(di->pool, di->solvid);
1838 return $self->key->name;
1840 const char *key_idstr() {
1841 return pool_id2str($self->pool, $self->key->name);
1844 return $self->key->type;
1846 const char *type_idstr() {
1847 return pool_id2str($self->pool, $self->key->type);
1850 return $self->kv.id;
1852 const char *idstr() {
1853 return pool_id2str($self->pool, $self->kv.id);
1856 return $self->kv.str;
1858 unsigned long long num() {
1859 if ($self->key->type == REPOKEY_TYPE_NUM)
1860 return SOLV_KV_NUM64(&$self->kv);
1861 return $self->kv.num;
1864 return $self->kv.num2;
1868 Pool *pool = $self->pool;
1869 Datapos *pos, oldpos = pool->pos;
1870 dataiterator_setpos($self);
1871 pos = solv_calloc(1, sizeof(*pos));
1876 %newobject parentpos;
1877 Datapos *parentpos() {
1878 Pool *pool = $self->pool;
1879 Datapos *pos, oldpos = pool->pos;
1880 dataiterator_setpos_parent($self);
1881 pos = solv_calloc(1, sizeof(*pos));
1886 #if defined(SWIGPERL)
1887 %rename("str") __str__;
1889 const char *__str__() {
1890 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1892 return $self->kv.str;
1896 %extend Pool_solvable_iterator {
1897 Pool_solvable_iterator(Pool *pool) {
1898 Pool_solvable_iterator *s;
1899 s = solv_calloc(1, sizeof(*s));
1903 #if defined(SWIGPYTHON)
1904 %newobject __iter__;
1905 Pool_solvable_iterator *__iter__() {
1906 Pool_solvable_iterator *s;
1907 s = solv_calloc(1, sizeof(*s));
1911 %rename("next") __next__();
1912 %exception __next__ {
1915 PyErr_SetString(PyExc_StopIteration,"no more matches");
1922 perliter(solv::Pool_solvable_iterator)
1924 %newobject __next__;
1925 XSolvable *__next__() {
1926 Pool *pool = $self->pool;
1927 if ($self->id >= pool->nsolvables)
1929 while (++$self->id < pool->nsolvables)
1930 if (pool->solvables[$self->id].repo)
1931 return new_XSolvable(pool, $self->id);
1937 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1938 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1942 %newobject __getitem__;
1943 XSolvable *__getitem__(Id key) {
1944 Pool *pool = $self->pool;
1945 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1946 return new_XSolvable(pool, key);
1950 return $self->pool->nsolvables;
1954 %extend Pool_repo_iterator {
1955 Pool_repo_iterator(Pool *pool) {
1956 Pool_repo_iterator *s;
1957 s = solv_calloc(1, sizeof(*s));
1961 #if defined(SWIGPYTHON)
1962 %newobject __iter__;
1963 Pool_repo_iterator *__iter__() {
1964 Pool_repo_iterator *s;
1965 s = solv_calloc(1, sizeof(*s));
1969 %rename("next") __next__();
1970 %exception __next__ {
1973 PyErr_SetString(PyExc_StopIteration,"no more matches");
1978 %newobject __next__;
1980 Pool *pool = $self->pool;
1981 if ($self->id >= pool->nrepos)
1983 while (++$self->id < pool->nrepos) {
1984 Repo *r = pool_id2repo(pool, $self->id);
1993 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1994 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1998 Repo *__getitem__(Id key) {
1999 Pool *pool = $self->pool;
2000 if (key > 0 && key < pool->nrepos)
2001 return pool_id2repo(pool, key);
2005 return $self->pool->nrepos;
2009 %extend Repo_solvable_iterator {
2010 Repo_solvable_iterator(Repo *repo) {
2011 Repo_solvable_iterator *s;
2012 s = solv_calloc(1, sizeof(*s));
2016 #if defined(SWIGPYTHON)
2017 %newobject __iter__;
2018 Repo_solvable_iterator *__iter__() {
2019 Repo_solvable_iterator *s;
2020 s = solv_calloc(1, sizeof(*s));
2024 %rename("next") __next__();
2025 %exception __next__ {
2028 PyErr_SetString(PyExc_StopIteration,"no more matches");
2033 %newobject __next__;
2034 XSolvable *__next__() {
2035 Repo *repo = $self->repo;
2036 Pool *pool = repo->pool;
2037 if (repo->start > 0 && $self->id < repo->start)
2038 $self->id = repo->start - 1;
2039 if ($self->id >= repo->end)
2041 while (++$self->id < repo->end)
2042 if (pool->solvables[$self->id].repo == repo)
2043 return new_XSolvable(pool, $self->id);
2049 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2050 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2054 %newobject __getitem__;
2055 XSolvable *__getitem__(Id key) {
2056 Repo *repo = $self->repo;
2057 Pool *pool = repo->pool;
2058 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2059 return new_XSolvable(pool, key);
2063 return $self->repo->pool->nsolvables;
2068 Dep(Pool *pool, Id id) {
2072 s = solv_calloc(1, sizeof(*s));
2078 Dep *Rel(int flags, DepId evrid, bool create=1) {
2079 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2082 return new_Dep($self->pool, id);
2084 %newobject Selection_name;
2085 Selection *Selection_name(int setflags=0) {
2086 Selection *sel = new_Selection($self->pool);
2087 if (ISRELDEP($self->id)) {
2088 Reldep *rd = GETRELDEP($self->pool, $self->id);
2089 if (rd->flags == REL_EQ) {
2090 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2091 if (ISRELDEP(rd->name))
2092 rd = GETRELDEP($self->pool, rd->name);
2094 if (rd->flags == REL_ARCH)
2095 setflags |= SOLVER_SETARCH;
2097 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2100 %newobject Selection_provides;
2101 Selection *Selection_provides(int setflags=0) {
2102 Selection *sel = new_Selection($self->pool);
2103 if (ISRELDEP($self->id)) {
2104 Reldep *rd = GETRELDEP($self->pool, $self->id);
2105 if (rd->flags == REL_ARCH)
2106 setflags |= SOLVER_SETARCH;
2108 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2112 return pool_dep2str($self->pool, $self->id);
2114 bool __eq__(Dep *s) {
2115 return $self->pool == s->pool && $self->id == s->id;
2117 bool __ne__(Dep *s) {
2118 return !Dep___eq__($self, s);
2120 #if defined(SWIGPERL)
2121 %rename("str") __str__;
2123 const char *__str__() {
2124 return pool_dep2str($self->pool, $self->id);
2126 %newobject __repr__;
2127 const char *__repr__() {
2129 sprintf(buf, "<Id #%d ", $self->id);
2130 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2135 XSolvable(Pool *pool, Id id) {
2137 if (!id || id >= pool->nsolvables)
2139 s = solv_calloc(1, sizeof(*s));
2145 return pool_solvid2str($self->pool, $self->id);
2147 const char *lookup_str(Id keyname) {
2148 return pool_lookup_str($self->pool, $self->id, keyname);
2150 Id lookup_id(Id keyname) {
2151 return pool_lookup_id($self->pool, $self->id, keyname);
2153 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2154 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2156 bool lookup_void(Id keyname) {
2157 return pool_lookup_void($self->pool, $self->id, keyname);
2159 %newobject lookup_checksum;
2160 Chksum *lookup_checksum(Id keyname) {
2162 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2163 return solv_chksum_create_from_bin(type, b);
2165 Queue lookup_idarray(Id keyname, Id marker = -1) {
2166 Solvable *s = $self->pool->solvables + $self->id;
2169 solvable_lookup_deparray(s, keyname, &r, marker);
2172 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2173 %newobject lookup_deparray;
2174 Queue lookup_deparray(Id keyname, Id marker = -1) {
2175 Solvable *s = $self->pool->solvables + $self->id;
2178 solvable_lookup_deparray(s, keyname, &r, marker);
2181 const char *lookup_location(unsigned int *OUTPUT) {
2182 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2184 %newobject Dataiterator;
2185 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2186 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2189 %rename("installable?") installable;
2191 bool installable() {
2192 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2195 %rename("isinstalled?") isinstalled;
2197 bool isinstalled() {
2198 Pool *pool = $self->pool;
2199 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2204 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2205 Pool *pool = xs->pool;
2206 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2208 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2209 Pool *pool = xs->pool;
2210 return pool_id2str(pool, pool->solvables[xs->id].name);
2215 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2216 xs->pool->solvables[xs->id].name = nameid;
2218 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2219 return xs->pool->solvables[xs->id].name;
2224 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2225 Pool *pool = xs->pool;
2226 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2228 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2229 Pool *pool = xs->pool;
2230 return pool_id2str(pool, pool->solvables[xs->id].evr);
2235 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2236 xs->pool->solvables[xs->id].evr = evrid;
2238 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2239 return xs->pool->solvables[xs->id].evr;
2244 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2245 Pool *pool = xs->pool;
2246 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2248 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2249 Pool *pool = xs->pool;
2250 return pool_id2str(pool, pool->solvables[xs->id].arch);
2255 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2256 xs->pool->solvables[xs->id].arch = archid;
2258 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2259 return xs->pool->solvables[xs->id].arch;
2264 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2265 Pool *pool = xs->pool;
2266 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2268 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2269 Pool *pool = xs->pool;
2270 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2275 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2276 xs->pool->solvables[xs->id].vendor = vendorid;
2278 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2279 return xs->pool->solvables[xs->id].vendor;
2284 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2285 return xs->pool->solvables[xs->id].repo;
2289 /* old interface, please use the generic add_deparray instead */
2290 void add_provides(DepId id, Id marker = -1) {
2291 Solvable *s = $self->pool->solvables + $self->id;
2292 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2293 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2295 void add_obsoletes(DepId id) {
2296 Solvable *s = $self->pool->solvables + $self->id;
2297 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2299 void add_conflicts(DepId id) {
2300 Solvable *s = $self->pool->solvables + $self->id;
2301 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2303 void add_requires(DepId id, Id marker = -1) {
2304 Solvable *s = $self->pool->solvables + $self->id;
2305 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2306 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2308 void add_recommends(DepId id) {
2309 Solvable *s = $self->pool->solvables + $self->id;
2310 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2312 void add_suggests(DepId id) {
2313 Solvable *s = $self->pool->solvables + $self->id;
2314 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2316 void add_supplements(DepId id) {
2317 Solvable *s = $self->pool->solvables + $self->id;
2318 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2320 void add_enhances(DepId id) {
2321 Solvable *s = $self->pool->solvables + $self->id;
2322 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2325 void unset(Id keyname) {
2326 Solvable *s = $self->pool->solvables + $self->id;
2327 repo_unset(s->repo, $self->id, keyname);
2330 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2331 Solvable *s = $self->pool->solvables + $self->id;
2332 solvable_add_deparray(s, keyname, id, marker);
2335 %newobject Selection;
2336 Selection *Selection(int setflags=0) {
2337 Selection *sel = new_Selection($self->pool);
2338 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2342 bool __eq__(XSolvable *s) {
2343 return $self->pool == s->pool && $self->id == s->id;
2345 bool __ne__(XSolvable *s) {
2346 return !XSolvable___eq__($self, s);
2348 #if defined(SWIGPERL)
2349 %rename("str") __str__;
2351 const char *__str__() {
2352 return pool_solvid2str($self->pool, $self->id);
2354 %newobject __repr__;
2355 const char *__repr__() {
2357 sprintf(buf, "<Solvable #%d ", $self->id);
2358 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2363 Problem(Solver *solv, Id id) {
2365 p = solv_calloc(1, sizeof(*p));
2370 %newobject findproblemrule;
2371 XRule *findproblemrule() {
2372 Id r = solver_findproblemrule($self->solv, $self->id);
2373 return new_XRule($self->solv, r);
2375 %newobject findallproblemrules;
2376 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2377 Queue findallproblemrules(int unfiltered=0) {
2378 Solver *solv = $self->solv;
2383 solver_findallproblemrules(solv, $self->id, &q);
2386 for (i = j = 0; i < q.count; i++)
2388 SolverRuleinfo rclass;
2389 probr = q.elements[i];
2390 rclass = solver_ruleclass(solv, probr);
2391 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2393 q.elements[j++] = probr;
2396 queue_truncate(&q, j);
2400 int solution_count() {
2401 return solver_solution_count($self->solv, $self->id);
2403 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2404 %newobject solutions;
2409 cnt = solver_solution_count($self->solv, $self->id);
2410 for (i = 1; i <= cnt; i++)
2414 #if defined(SWIGPERL)
2415 %rename("str") __str__;
2417 const char *__str__() {
2418 return solver_problem2str($self->solv, $self->id);
2423 Solution(Problem *p, Id id) {
2425 s = solv_calloc(1, sizeof(*s));
2427 s->problemid = p->id;
2431 int element_count() {
2432 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2435 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2436 %newobject elements;
2437 Queue elements(bool expandreplaces=0) {
2441 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2442 for (i = 1; i <= cnt; i++)
2445 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2447 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2453 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2454 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2456 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2457 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2458 queue_push2(&q, p, rp);
2460 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2461 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2462 queue_push2(&q, p, rp);
2464 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2465 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2466 queue_push2(&q, p, rp);
2468 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2469 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2470 queue_push2(&q, p, rp);
2475 queue_push2(&q, i, type);
2476 queue_push2(&q, p, rp);
2482 %extend Solutionelement {
2483 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2485 e = solv_calloc(1, sizeof(*e));
2487 e->problemid = problemid;
2499 if (p == SOLVER_SOLUTION_ERASE)
2504 else if (p == SOLVER_SOLUTION_REPLACE)
2509 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2510 illegal = POLICY_ILLEGAL_DOWNGRADE;
2511 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2512 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2513 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2514 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2515 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2516 illegal = POLICY_ILLEGAL_NAMECHANGE;
2518 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);
2519 return solver_solutionelement2str($self->solv, p, rp);
2521 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2522 %newobject replaceelements;
2523 Queue replaceelements() {
2528 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2531 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2532 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2533 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2534 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2535 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2536 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2537 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2538 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2539 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2541 queue_push(&q, $self->type);
2544 int illegalreplace() {
2545 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2547 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2549 %newobject solvable;
2550 XSolvable * const solvable;
2551 %newobject replacement;
2552 XSolvable * const replacement;
2555 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2556 return new_XSolvable(e->solv->pool, e->p);
2558 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2559 return new_XSolvable(e->solv->pool, e->rp);
2561 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2562 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2564 return (e->p - 1) / 2;
2569 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2570 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2571 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2572 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2573 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2574 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)
2575 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2576 if ($self->type == SOLVER_SOLUTION_ERASE)
2577 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2583 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2584 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2585 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2586 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2587 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2588 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2589 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2590 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2591 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2592 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2593 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2594 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2595 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2596 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2597 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2598 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2599 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2600 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2601 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2602 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2603 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2604 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2606 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2607 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2608 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2609 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2610 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2611 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2612 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2613 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2614 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2615 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2616 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2618 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2619 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2620 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2621 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2623 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2624 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2625 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2626 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2627 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2628 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2629 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2630 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2631 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2632 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2633 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2634 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2636 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
2637 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
2638 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
2639 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
2640 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
2641 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
2642 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
2643 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
2644 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
2645 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
2646 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
2652 int set_flag(int flag, int value) {
2653 return solver_set_flag($self, flag, value);
2655 int get_flag(int flag) {
2656 return solver_get_flag($self, flag);
2658 #if defined(SWIGPYTHON)
2660 def solve(self, jobs):
2662 for job in jobs: j += [job.how, job.what]
2663 return self.solve_helper(j)
2666 #if defined(SWIGPERL)
2668 sub solv::Solver::solve {
2669 my ($self, $jobs) = @_;
2670 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2671 return $self->solve_helper(\@j);
2675 #if defined(SWIGRUBY)
2678 "class Solv::Solver\n"
2679 " def solve(jobs)\n"
2681 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2682 " solve_helper(jl)\n"
2688 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2689 %newobject solve_helper;
2690 Queue solve_helper(Queue jobs) {
2694 solver_solve($self, &jobs);
2695 cnt = solver_problem_count($self);
2696 for (i = 1; i <= cnt; i++)
2700 %newobject transaction;
2701 Transaction *transaction() {
2702 return solver_create_transaction($self);
2705 int describe_decision(XSolvable *s, XRule **OUTPUT) {
2707 int reason = solver_describe_decision($self, s->id, &ruleid);
2708 *OUTPUT = new_XRule($self, ruleid);
2713 %extend Transaction {
2714 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2715 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2716 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2717 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2718 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2719 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2720 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2721 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2722 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2723 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2724 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2725 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2726 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2727 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2728 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2729 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2730 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2731 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2732 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2733 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2734 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2735 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2736 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2737 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2738 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2739 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2740 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2741 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2743 transaction_free($self);
2746 %rename("isempty?") isempty;
2749 return $self->steps.count == 0;
2752 %newobject othersolvable;
2753 XSolvable *othersolvable(XSolvable *s) {
2754 Id op = transaction_obs_pkg($self, s->id);
2755 return new_XSolvable($self->pool, op);
2758 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2759 %newobject allothersolvables;
2760 Queue allothersolvables(XSolvable *s) {
2763 transaction_all_obs_pkgs($self, s->id, &q);
2767 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2768 %newobject classify;
2769 Queue classify(int mode = 0) {
2772 transaction_classify($self, mode, &q);
2776 # deprecated, use newsolvables instead
2777 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2778 %newobject newpackages;
2779 Queue newpackages() {
2783 cut = transaction_installedresult(self, &q);
2784 queue_truncate(&q, cut);
2788 # deprecated, use keptsolvables instead
2789 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2790 %newobject keptpackages;
2791 Queue keptpackages() {
2795 cut = transaction_installedresult(self, &q);
2797 queue_deleten(&q, 0, cut);
2801 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2802 %newobject newsolvables;
2803 Queue newsolvables() {
2807 cut = transaction_installedresult(self, &q);
2808 queue_truncate(&q, cut);
2812 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2813 %newobject keptsolvables;
2814 Queue keptsolvables() {
2818 cut = transaction_installedresult(self, &q);
2820 queue_deleten(&q, 0, cut);
2824 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2828 queue_init_clone(&q, &$self->steps);
2832 int steptype(XSolvable *s, int mode) {
2833 return transaction_type($self, s->id, mode);
2835 int calc_installsizechange() {
2836 return transaction_calc_installsizechange($self);
2838 void order(int flags=0) {
2839 transaction_order($self, flags);
2843 %extend TransactionClass {
2844 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2845 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2846 cl->transaction = trans;
2850 cl->fromid = fromid;
2854 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2855 %newobject solvables;
2859 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2862 const char * const fromstr;
2863 const char * const tostr;
2865 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
2866 return pool_id2str(cl->transaction->pool, cl->fromid);
2868 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
2869 return pool_id2str(cl->transaction->pool, cl->toid);
2875 XRule(Solver *solv, Id id) {
2878 XRule *xr = solv_calloc(1, sizeof(*xr));
2885 SWIGINTERN int XRule_type_get(XRule *xr) {
2886 return solver_ruleclass(xr->solv, xr->id);
2891 Id type, source, target, dep;
2892 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2893 return new_Ruleinfo($self, type, source, target, dep);
2895 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2896 %newobject allinfos;
2900 solver_allruleinfos($self->solv, $self->id, &q);
2904 bool __eq__(XRule *xr) {
2905 return $self->solv == xr->solv && $self->id == xr->id;
2907 bool __ne__(XRule *xr) {
2908 return !XRule___eq__($self, xr);
2910 %newobject __repr__;
2911 const char *__repr__() {
2913 sprintf(buf, "<Rule #%d>", $self->id);
2914 return solv_strdup(buf);
2919 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
2920 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2924 ri->source = source;
2925 ri->target = target;
2926 ri->dep_id = dep_id;
2929 %newobject solvable;
2930 XSolvable * const solvable;
2931 %newobject othersolvable;
2932 XSolvable * const othersolvable;
2936 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2937 return new_XSolvable(ri->solv->pool, ri->source);
2939 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2940 return new_XSolvable(ri->solv->pool, ri->target);
2942 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
2943 return new_Dep(ri->solv->pool, ri->dep_id);
2946 const char *problemstr() {
2947 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
2952 XRepodata(Repo *repo, Id id) {
2953 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2959 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2961 void set_id(Id solvid, Id keyname, DepId id) {
2962 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2964 void set_str(Id solvid, Id keyname, const char *str) {
2965 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2967 void set_poolstr(Id solvid, Id keyname, const char *str) {
2968 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2970 void add_idarray(Id solvid, Id keyname, DepId id) {
2971 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2973 void add_flexarray(Id solvid, Id keyname, Id handle) {
2974 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2976 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2977 const unsigned char *buf = solv_chksum_get(chksum, 0);
2979 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2981 const char *lookup_str(Id solvid, Id keyname) {
2982 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2984 Queue lookup_idarray(Id solvid, Id keyname) {
2987 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2990 %newobject lookup_checksum;
2991 Chksum *lookup_checksum(Id solvid, Id keyname) {
2993 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2994 return solv_chksum_create_from_bin(type, b);
2996 void internalize() {
2997 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2999 void create_stubs() {
3000 Repodata *data = repo_id2repodata($self->repo, $self->id);
3001 data = repodata_create_stubs(data);
3002 $self->id = data->repodataid;
3004 bool write(FILE *fp) {
3005 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3007 bool add_solv(FILE *fp, int flags = 0) {
3008 Repodata *data = repo_id2repodata($self->repo, $self->id);
3009 int r, oldstate = data->state;
3010 data->state = REPODATA_LOADING;
3011 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3012 if (r || data->state == REPODATA_LOADING)
3013 data->state = oldstate;
3016 void extend_to_repo() {
3017 Repodata *data = repo_id2repodata($self->repo, $self->id);
3018 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3020 bool __eq__(XRepodata *xr) {
3021 return $self->repo == xr->repo && $self->id == xr->id;
3023 bool __ne__(XRepodata *xr) {
3024 return !XRepodata___eq__($self, xr);
3026 %newobject __repr__;
3027 const char *__repr__() {
3029 sprintf(buf, "<Repodata #%d>", $self->id);
3030 return solv_strdup(buf);
3034 #ifdef ENABLE_PUBKEY
3037 return solvsig_create(fp);
3040 solvsig_free($self);
3044 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3047 XSolvable *verify(Repo *repo, Chksum *chksum) {
3048 Id p = solvsig_verify($self, repo, chksum);
3049 return new_XSolvable(repo->pool, p);