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";
24 %typemap(in,noblock=1,fragment="SWIG_AsCharPtrAndSize") (const unsigned char *str, size_t len) (int res, char *buf = 0, size_t size = 0, int alloc = 0) {
25 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
26 if (!SWIG_IsOK(res)) {
27 #if defined(SWIGPYTHON)
28 const void *pybuf = 0;
29 Py_ssize_t pysize = 0;
30 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
32 %argument_fail(res, "BinaryBlob", $symname, $argnum);
38 %argument_fail(res, "const char *", $symname, $argnum);
41 $1 = (unsigned char *)buf;
45 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
46 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
49 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
50 #if defined(SWIGPYTHON) && defined(PYTHON3)
51 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
53 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
57 #if defined(SWIGPYTHON)
59 /* Check if is a list */
61 if (PyList_Check($input)) {
62 int size = PyList_Size($input);
64 for (i = 0; i < size; i++) {
65 PyObject *o = PyList_GetItem($input,i);
67 int e = SWIG_AsVal_int(o, &v);
69 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
76 PyErr_SetString(PyExc_TypeError,"not a list");
83 PyObject *o = PyList_New($1.count);
84 for (i = 0; i < $1.count; i++)
85 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
90 %define Queue2Array(type, step, con) %{
92 int cnt = $1.count / step;
93 Id *idp = $1.elements;
94 PyObject *o = PyList_New(cnt);
95 for (i = 0; i < cnt; i++, idp += step)
98 #define result resultx
101 PyList_SetItem(o, i, $result);
112 #if defined(SWIGPERL)
117 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
118 SWIG_croak("Argument $argnum is not an array reference.");
119 av = (AV*)SvRV($input);
121 for (i = 0; i <= size; i++) {
122 SV **sv = av_fetch(av, i, 0);
124 int e = SWIG_AsVal_int(*sv, &v);
126 SWIG_croak("list must contain only integers");
132 # av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
133 # $result = newRV_noinc((SV*)o); argvi++;
135 %typemap(out) Queue {
137 if (argvi + $1.count + 1 >= items) {
138 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
140 for (i = 0; i < $1.count; i++)
141 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
145 %define Queue2Array(type, step, con) %{
147 int cnt = $1.count / step;
148 Id *idp = $1.elements;
149 if (argvi + cnt + 1 >= items) {
150 EXTEND(sp, (argvi + cnt + 1) - items + 1);
152 for (i = 0; i < cnt; i++, idp += step)
155 #define result resultx
158 SvREFCNT_inc(ST(argvi - 1));
168 %typemap(arginit) Queue {
171 %typemap(freearg) Queue {
175 #if defined(SWIGRUBY)
180 size = RARRAY_LEN($input);
182 o = RARRAY_PTR($input);
183 for (i = 0; i < size; i++, o++) {
185 int e = SWIG_AsVal_int(*o, &v);
188 SWIG_Error(SWIG_RuntimeError, "list must contain only integers");
194 %typemap(out) Queue {
196 VALUE o = rb_ary_new2($1.count);
197 for (i = 0; i < $1.count; i++)
198 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
202 %typemap(arginit) Queue {
205 %typemap(freearg) Queue {
208 %define Queue2Array(type, step, con) %{
210 int cnt = $1.count / step;
211 Id *idp = $1.elements;
212 VALUE o = rb_ary_new2(cnt);
213 for (i = 0; i < cnt; i++, idp += step)
216 #define result resultx
219 rb_ary_store(o, i, $result);
231 #if defined(SWIGPERL)
233 # work around a swig bug
237 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
239 # ifndef MULTIPLICITY
240 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
242 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
248 %define perliter(class)
251 my $i = ${##class##::ITERATORS}{$_[0]};
253 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
255 $_[0]->__getitem__($_[1]);
258 sub class##::FETCHSIZE {
259 my $i = ${##class##::ITERATORS}{$_[0]};
261 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
271 #define SWIG_PERL_ITERATOR 0x80
273 SWIGRUNTIMEINLINE SV *
274 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
275 SV *result = sv_newmortal();
276 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
281 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
282 stash=SvSTASH(SvRV(obj));
283 if (flags & SWIG_POINTER_OWN) {
285 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
287 gv_init(gv, stash, "OWNER", 5, FALSE);
289 hv_store_ent(hv, obj, newSViv(1), 0);
291 if (flags & SWIG_PERL_ITERATOR) {
293 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
296 gv_init(gv, stash, "ITERATORS", 9, FALSE);
298 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
300 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
302 self=newRV_noinc((SV *)array);
303 sv_setsv(result, self);
304 SvREFCNT_dec((SV *)self);
305 sv_bless(result, stash);
307 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
314 %typemap(out) Perlarray {
315 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
317 %typemap(out) Perliterator {
318 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
321 %typemap(out) Pool_solvable_iterator * = Perlarray;
322 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
323 %typemap(out) Pool_repo_iterator * = Perlarray;
324 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
325 %typemap(out) Repo_solvable_iterator * = Perlarray;
326 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
327 %typemap(out) Dataiterator * = Perliterator;
332 #if defined(SWIGPYTHON)
333 typedef PyObject *AppObjectPtr;
334 %typemap(out) AppObjectPtr {
335 $result = $1 ? $1 : Py_None;
339 #if defined(SWIGPERL)
340 typedef SV *AppObjectPtr;
341 %typemap(in) AppObjectPtr {
342 $1 = SvROK($input) ? SvRV($input) : 0;
344 %typemap(out) AppObjectPtr {
345 $result = $1 ? newRV_inc($1) : newSV(0);
349 #if defined(SWIGRUBY)
350 typedef VALUE AppObjectPtr;
351 %typemap(in) AppObjectPtr {
354 %typemap(out) AppObjectPtr {
363 %fragment("SWIG_AsValFilePtr","header") {}
367 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
371 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
373 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
375 static swig_type_info* desc = 0;
379 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
380 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
382 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
386 ecode = SWIG_AsValFilePtr(obj, val);
387 if (ecode == SWIG_OK)
390 return SWIG_TypeError;
396 %fragment("SWIG_AsValDepId","header") {
400 SWIG_AsValDepId(VALUE obj, int *val) {
402 SWIG_AsValDepId(void *obj, int *val) {
404 static swig_type_info* desc = 0;
407 if (!desc) desc = SWIG_TypeQuery("Dep *");
408 ecode = SWIG_AsVal_int(obj, val);
409 if (SWIG_IsOK(ecode))
411 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
413 *val = vptr ? ((Dep *)vptr)->id : 0;
416 return SWIG_TypeError;
423 %include "typemaps.i"
425 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
428 %typemap(argout,noblock=1) XRule **OUTPUT {
429 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
432 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
433 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
439 #include <sys/stat.h>
440 #include <sys/utsname.h>
441 #include <sys/types.h>
444 /* argh, swig undefs bool for perl */
450 #include "poolarch.h"
454 #include "solverdebug.h"
455 #include "repo_solv.h"
457 #include "selection.h"
459 #include "repo_write.h"
461 #include "repo_rpmdb.h"
464 #include "repo_pubkey.h"
467 #include "repo_deb.h"
470 #include "repo_rpmmd.h"
471 #include "repo_updateinfoxml.h"
472 #include "repo_deltainfoxml.h"
473 #include "repo_repomdxml.h"
475 #ifdef ENABLE_SUSEREPO
476 #include "repo_products.h"
477 #include "repo_susetags.h"
478 #include "repo_content.h"
480 #ifdef ENABLE_MDKREPO
481 #include "repo_mdk.h"
483 #ifdef ENABLE_ARCHREPO
484 #include "repo_arch.h"
486 #include "solv_xfopen.h"
488 /* for old ruby versions */
490 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
493 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
496 #define SOLVER_SOLUTION_ERASE -100
497 #define SOLVER_SOLUTION_REPLACE -101
498 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
499 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
500 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
501 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
503 typedef void *AppObjectPtr;
529 } Pool_solvable_iterator;
534 } Pool_repo_iterator;
539 } Repo_solvable_iterator;
579 Transaction *transaction;
597 typedef Dataiterator Datamatch;
602 %mixin Dataiterator "Enumerable";
603 %mixin Pool_solvable_iterator "Enumerable";
604 %mixin Pool_repo_iterator "Enumerable";
605 %mixin Repo_solvable_iterator "Enumerable";
613 %constant Id SOLVID_META;
614 %constant Id SOLVID_POS;
616 %constant int REL_EQ;
617 %constant int REL_GT;
618 %constant int REL_LT;
619 %constant int REL_ARCH;
630 # put before pool/repo so we can access the constructor
631 %nodefaultdtor Dataiterator;
632 typedef struct {} Dataiterator;
655 typedef struct {} Pool_solvable_iterator;
656 typedef struct {} Pool_repo_iterator;
657 typedef struct {} Repo_solvable_iterator;
659 %nodefaultctor Datamatch;
660 %nodefaultdtor Datamatch;
667 %nodefaultctor Datapos;
681 AppObjectPtr appdata;
688 const char * const name;
691 int const nsolvables;
692 AppObjectPtr appdata;
695 %nodefaultctor Solver;
696 %nodefaultdtor Solver;
707 unsigned int const created;
708 unsigned int const expires;
709 const char * const keyid;
713 %rename(xfopen) solvfp_xfopen;
714 %rename(xfopen_fd) solvfp_xfopen_fd;
716 %nodefaultctor SolvFp;
720 %newobject solvfp_xfopen;
721 %newobject solvfp_xfopen_fd;
723 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
724 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
727 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
731 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
734 sfp = solv_calloc(1, sizeof(SolvFp));
738 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
741 fp = solv_xfopen(fn, mode);
744 sfp = solv_calloc(1, sizeof(SolvFp));
769 %nodefaultctor Transaction;
770 %nodefaultdtor Transaction;
776 Transaction * const transaction;
790 return $self->fp ? fileno($self->fp) : -1;
793 return $self->fp ? dup(fileno($self->fp)) : -1;
798 return fflush($self->fp) == 0;
804 ret = fclose($self->fp) == 0;
811 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
812 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
813 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
814 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
815 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
816 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
817 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
818 static const Id SOLVER_NOOP = SOLVER_NOOP;
819 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
820 static const Id SOLVER_ERASE = SOLVER_ERASE;
821 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
822 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
823 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
824 static const Id SOLVER_LOCK = SOLVER_LOCK;
825 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
826 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
827 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
828 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
829 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
830 static const Id SOLVER_WEAK = SOLVER_WEAK;
831 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
832 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
833 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
834 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
835 static const Id SOLVER_SETEV = SOLVER_SETEV;
836 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
837 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
838 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
839 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
840 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
841 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
842 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
844 Job(Pool *pool, int how, Id what) {
845 Job *job = solv_calloc(1, sizeof(*job));
852 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
853 %newobject solvables;
857 pool_job2solvables($self->pool, &q, $self->how, $self->what);
861 %rename("isemptyupdate?") isemptyupdate;
863 bool isemptyupdate() {
864 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
867 bool __eq__(Job *j) {
868 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
870 bool __ne__(Job *j) {
871 return !Job___eq__($self, j);
873 #if defined(SWIGPERL)
874 %rename("str") __str__;
876 const char *__str__() {
877 return pool_job2str($self->pool, $self->how, $self->what, 0);
879 const char *__repr__() {
880 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
881 return pool_tmpjoin($self->pool, "<Job ", str, ">");
886 static const Id SELECTION_NAME = SELECTION_NAME;
887 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
888 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
889 static const Id SELECTION_CANON = SELECTION_CANON;
890 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
891 static const Id SELECTION_REL = SELECTION_REL;
892 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
893 static const Id SELECTION_GLOB = SELECTION_GLOB;
894 static const Id SELECTION_FLAT = SELECTION_FLAT;
895 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
896 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
897 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
899 Selection(Pool *pool) {
901 s = solv_calloc(1, sizeof(*s));
907 queue_free(&$self->q);
914 %rename("isempty?") isempty;
917 return $self->q.count == 0;
919 void filter(Selection *lsel) {
920 if ($self->pool != lsel->pool)
921 queue_empty(&$self->q);
923 selection_filter($self->pool, &$self->q, &lsel->q);
925 void add(Selection *lsel) {
926 if ($self->pool == lsel->pool)
928 selection_add($self->pool, &$self->q, &lsel->q);
929 $self->flags |= lsel->flags;
932 void add_raw(Id how, Id what) {
933 queue_push2(&$self->q, how, what);
935 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
937 Queue jobs(int flags) {
940 queue_init_clone(&q, &$self->q);
941 for (i = 0; i < q.count; i += 2)
942 q.elements[i] |= flags;
946 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
947 %newobject solvables;
951 selection_solvables($self->pool, &$self->q, &q);
955 #if defined(SWIGPERL)
956 %rename("str") __str__;
958 const char *__str__() {
959 return pool_selection2str($self->pool, &$self->q, 0);
961 const char *__repr__() {
962 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
963 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
969 return solv_chksum_create(type);
971 Chksum(Id type, const char *hex) {
972 unsigned char buf[64];
973 int l = solv_chksum_len(type);
976 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
978 return solv_chksum_create_from_bin(type, buf);
981 solv_chksum_free($self, 0);
985 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
986 return solv_chksum_get_type(chk);
989 void add(const unsigned char *str, size_t len) {
990 solv_chksum_add($self, str, (int)len);
992 void add_fp(FILE *fp) {
995 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
996 solv_chksum_add($self, buf, l);
997 rewind(fp); /* convenience */
999 void add_fd(int fd) {
1002 while ((l = read(fd, buf, sizeof(buf))) > 0)
1003 solv_chksum_add($self, buf, l);
1004 lseek(fd, 0, 0); /* convenience */
1006 void add_stat(const char *filename) {
1008 if (stat(filename, &stb))
1009 memset(&stb, 0, sizeof(stb));
1010 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1011 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1012 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1013 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1015 void add_fstat(int fd) {
1017 if (fstat(fd, &stb))
1018 memset(&stb, 0, sizeof(stb));
1019 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1020 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1021 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1022 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1027 const unsigned char *b;
1028 b = solv_chksum_get($self, &l);
1036 const unsigned char *b;
1039 b = solv_chksum_get($self, &l);
1040 ret = solv_malloc(2 * l + 1);
1041 solv_bin2hex(b, l, ret);
1045 bool __eq__(Chksum *chk) {
1047 const unsigned char *b, *bo;
1050 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1052 b = solv_chksum_get($self, &l);
1053 bo = solv_chksum_get(chk, 0);
1054 return memcmp(b, bo, l) == 0;
1056 bool __ne__(Chksum *chk) {
1057 return !Chksum___eq__($self, chk);
1059 #if defined(SWIGRUBY)
1060 %rename("to_s") __str__;
1062 #if defined(SWIGPERL)
1063 %rename("str") __str__;
1066 const char *__str__() {
1069 if (solv_chksum_isfinished($self))
1070 h = Chksum_hex($self);
1071 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1072 solv_free((void *)h);
1075 %newobject __repr__;
1076 const char *__repr__() {
1077 const char *h = Chksum___str__($self);
1078 const char *str = solv_dupjoin("<Chksum ", h, ">");
1079 solv_free((void *)h);
1085 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1086 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1087 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1088 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1089 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1090 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1091 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1092 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1093 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1096 Pool *pool = pool_create();
1101 void set_debuglevel(int level) {
1102 pool_setdebuglevel($self, level);
1104 int set_flag(int flag, int value) {
1105 return pool_set_flag($self, flag, value);
1107 int get_flag(int flag) {
1108 return pool_get_flag($self, flag);
1110 void set_rootdir(const char *rootdir) {
1111 pool_set_rootdir($self, rootdir);
1113 const char *get_rootdir(int flag) {
1114 return pool_get_rootdir($self);
1116 #if defined(SWIGPYTHON)
1118 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1119 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1120 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1121 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1126 return 0; /* exception */
1127 ecode = SWIG_AsVal_int(result, &vresult);
1129 return SWIG_IsOK(ecode) ? vresult : 0;
1132 void set_loadcallback(PyObject *callable) {
1133 if ($self->loadcallback == loadcallback) {
1134 PyObject *obj = $self->loadcallbackdata;
1138 Py_INCREF(callable);
1140 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1143 #if defined(SWIGPERL)
1145 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1149 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1154 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1156 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1166 void set_loadcallback(SV *callable) {
1167 if ($self->loadcallback == loadcallback)
1168 SvREFCNT_dec($self->loadcallbackdata);
1170 SvREFCNT_inc(callable);
1171 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1175 #if defined(SWIGRUBY)
1177 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1178 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1179 VALUE callable = (VALUE)d;
1180 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1181 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1182 return res == Qtrue;
1184 SWIGINTERN void mark_Pool(void *ptr) {
1186 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1187 VALUE callable = (VALUE)pool->loadcallbackdata;
1188 rb_gc_mark(callable);
1192 %typemap(in, numinputs=0) VALUE callable {
1193 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1195 void set_loadcallback(VALUE callable) {
1196 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1201 Pool_set_loadcallback($self, 0);
1204 Id str2id(const char *str, bool create=1) {
1205 return pool_str2id($self, str, create);
1208 Dep *Dep(const char *str, bool create=1) {
1209 Id id = pool_str2id($self, str, create);
1210 return new_Dep($self, id);
1212 const char *id2str(Id id) {
1213 return pool_id2str($self, id);
1215 const char *dep2str(Id id) {
1216 return pool_dep2str($self, id);
1218 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1219 return pool_rel2id($self, name, evr, flags, create);
1221 Id id2langid(Id id, const char *lang, bool create=1) {
1222 return pool_id2langid($self, id, lang, create);
1224 void setarch(const char *arch = 0) {
1233 pool_setarch($self, arch);
1235 Repo *add_repo(const char *name) {
1236 return repo_create($self, name);
1238 const char *lookup_str(Id entry, Id keyname) {
1239 return pool_lookup_str($self, entry, keyname);
1241 Id lookup_id(Id entry, Id keyname) {
1242 return pool_lookup_id($self, entry, keyname);
1244 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1245 return pool_lookup_num($self, entry, keyname, notfound);
1247 bool lookup_void(Id entry, Id keyname) {
1248 return pool_lookup_void($self, entry, keyname);
1250 %newobject lookup_checksum;
1251 Chksum *lookup_checksum(Id entry, Id keyname) {
1253 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1254 return solv_chksum_create_from_bin(type, b);
1257 %newobject Dataiterator;
1258 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1259 return new_Dataiterator($self, 0, p, key, match, flags);
1261 const char *solvid2str(Id solvid) {
1262 return pool_solvid2str($self, solvid);
1264 void addfileprovides() {
1265 pool_addfileprovides($self);
1267 Queue addfileprovides_queue() {
1270 pool_addfileprovides_queue($self, &r, 0);
1273 void createwhatprovides() {
1274 pool_createwhatprovides($self);
1277 %newobject id2solvable;
1278 XSolvable *id2solvable(Id id) {
1279 return new_XSolvable($self, id);
1281 %newobject solvables;
1282 Pool_solvable_iterator * const solvables;
1284 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1285 return new_Pool_solvable_iterator(pool);
1288 %newobject solvables_iter;
1289 Pool_solvable_iterator * solvables_iter() {
1290 return new_Pool_solvable_iterator($self);
1293 Repo *id2repo(Id id) {
1294 if (id < 1 || id >= $self->nrepos)
1296 return pool_id2repo($self, id);
1300 Pool_repo_iterator * const repos;
1302 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1303 return new_Pool_repo_iterator(pool);
1306 %newobject repos_iter;
1307 Pool_repo_iterator * repos_iter() {
1308 return new_Pool_repo_iterator($self);
1312 const char * const errstr;
1314 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1315 pool_set_installed(pool, installed);
1317 Repo *Pool_installed_get(Pool *pool) {
1318 return pool->installed;
1320 const char *Pool_errstr_get(Pool *pool) {
1321 return pool_errstr(pool);
1325 Queue matchprovidingids(const char *match, int flags) {
1331 for (id = 1; id < pool->ss.nstrings; id++)
1332 if (pool->whatprovides[id])
1336 if (!datamatcher_init(&ma, match, flags)) {
1337 for (id = 1; id < pool->ss.nstrings; id++)
1338 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1340 datamatcher_free(&ma);
1347 Job *Job(int how, Id what) {
1348 return new_Job($self, how, what);
1351 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1352 %newobject whatprovides;
1353 Queue whatprovides(DepId dep) {
1358 FOR_PROVIDES(p, pp, dep)
1363 Id towhatprovides(Queue q) {
1364 return pool_queuetowhatprovides($self, &q);
1368 %rename("isknownarch?") isknownarch;
1370 bool isknownarch(DepId id) {
1372 if (!id || id == ID_EMPTY)
1374 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1376 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1383 return solver_create($self);
1386 %newobject Selection;
1387 Selection *Selection() {
1388 return new_Selection($self);
1390 %newobject Selection_all;
1391 Selection *Selection_all(int setflags=0) {
1392 Selection *sel = new_Selection($self);
1393 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1397 Selection *select(const char *name, int flags) {
1398 Selection *sel = new_Selection($self);
1399 sel->flags = selection_make($self, &sel->q, name, flags);
1403 void setpooljobs_helper(Queue jobs) {
1404 queue_free(&$self->pooljobs);
1405 queue_init_clone(&$self->pooljobs, &jobs);
1407 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1408 %newobject getpooljobs;
1409 Queue getpooljobs() {
1411 queue_init_clone(&q, &$self->pooljobs);
1415 #if defined(SWIGPYTHON)
1417 def setpooljobs(self, jobs):
1419 for job in jobs: j += [job.how, job.what]
1420 self.setpooljobs_helper(j)
1423 #if defined(SWIGPERL)
1425 sub solv::Solver::setpooljobs {
1426 my ($self, $jobs) = @_;
1427 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1428 return $self->setpooljobs_helper(\@j);
1432 #if defined(SWIGRUBY)
1435 "class Solv::Pool\n"
1436 " def setpooljobs(jobs)\n"
1438 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1439 " setpooljobs_helper(jl)\n"
1448 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1449 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1450 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1451 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1452 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1453 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1454 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1455 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1456 #ifdef ENABLE_SUSEREPO
1457 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1460 void free(bool reuseids = 0) {
1461 repo_free($self, reuseids);
1463 void empty(bool reuseids = 0) {
1464 repo_empty($self, reuseids);
1467 %rename("isempty?") isempty;
1470 return !$self->nsolvables;
1472 bool add_solv(const char *name, int flags = 0) {
1473 FILE *fp = fopen(name, "r");
1477 r = repo_add_solv($self, fp, flags);
1481 bool add_solv(FILE *fp, int flags = 0) {
1482 return repo_add_solv($self, fp, flags) == 0;
1485 %newobject add_solvable;
1486 XSolvable *add_solvable() {
1487 Id solvid = repo_add_solvable($self);
1488 return new_XSolvable($self->pool, solvid);
1492 bool add_rpmdb(int flags = 0) {
1493 return repo_add_rpmdb($self, 0, flags) == 0;
1495 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1496 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1499 XSolvable *add_rpm(const char *name, int flags = 0) {
1500 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1503 #ifdef ENABLE_PUBKEY
1505 bool add_rpmdb_pubkeys(int flags = 0) {
1506 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1509 %newobject add_pubkey;
1510 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
1511 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
1513 bool add_keyring(FILE *fp, int flags = 0) {
1514 return repo_add_keyring($self, fp, flags);
1516 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
1517 return repo_add_keydir($self, keydir, suffix, flags);
1521 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1522 return repo_add_rpmmd($self, fp, language, flags) == 0;
1524 bool add_repomdxml(FILE *fp, int flags = 0) {
1525 return repo_add_repomdxml($self, fp, flags) == 0;
1527 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1528 return repo_add_updateinfoxml($self, fp, flags) == 0;
1530 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1531 return repo_add_deltainfoxml($self, fp, flags) == 0;
1534 #ifdef ENABLE_DEBIAN
1535 bool add_debdb(int flags = 0) {
1536 return repo_add_debdb($self, flags) == 0;
1538 bool add_debpackages(FILE *fp, int flags = 0) {
1539 return repo_add_debpackages($self, fp, flags) == 0;
1542 XSolvable *add_deb(const char *name, int flags = 0) {
1543 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
1546 #ifdef ENABLE_SUSEREPO
1547 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1548 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1550 bool add_content(FILE *fp, int flags = 0) {
1551 return repo_add_content($self, fp, flags) == 0;
1553 bool add_products(const char *proddir, int flags = 0) {
1554 return repo_add_products($self, proddir, flags) == 0;
1557 #ifdef ENABLE_MDKREPO
1558 bool add_mdk(FILE *fp, int flags = 0) {
1559 return repo_add_mdk($self, fp, flags) == 0;
1561 bool add_mdk_info(FILE *fp, int flags = 0) {
1562 return repo_add_mdk_info($self, fp, flags) == 0;
1565 #ifdef ENABLE_ARCHREPO
1566 bool add_arch_repo(FILE *fp, int flags = 0) {
1567 return repo_add_arch_repo($self, fp, flags) == 0;
1569 bool add_arch_local(const char *dir, int flags = 0) {
1570 return repo_add_arch_local($self, dir, flags) == 0;
1572 %newobject add_arch_pkg;
1573 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
1574 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
1577 void internalize() {
1578 repo_internalize($self);
1580 bool write(FILE *fp) {
1581 return repo_write($self, fp) == 0;
1583 # HACK, remove if no longer needed!
1584 bool write_first_repodata(FILE *fp) {
1585 int oldnrepodata = $self->nrepodata;
1587 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1588 res = repo_write($self, fp);
1589 $self->nrepodata = oldnrepodata;
1593 %newobject Dataiterator;
1594 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1595 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1600 SWIGINTERN Id Repo_id_get(Repo *repo) {
1601 return repo->repoid;
1604 %newobject solvables;
1605 Repo_solvable_iterator * const solvables;
1607 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1608 return new_Repo_solvable_iterator(repo);
1612 Datapos * const meta;
1614 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1615 Datapos *pos = solv_calloc(1, sizeof(*pos));
1616 pos->solvid = SOLVID_META;
1622 %newobject solvables_iter;
1623 Repo_solvable_iterator *solvables_iter() {
1624 return new_Repo_solvable_iterator($self);
1627 %newobject add_repodata;
1628 XRepodata *add_repodata(int flags = 0) {
1629 Repodata *rd = repo_add_repodata($self, flags);
1630 return new_XRepodata($self, rd->repodataid);
1633 void create_stubs() {
1635 if (!$self->nrepodata)
1637 data = repo_id2repodata($self, $self->nrepodata - 1);
1638 if (data->state != REPODATA_STUB)
1639 (void)repodata_create_stubs(data);
1642 %rename("iscontiguous?") iscontiguous;
1644 bool iscontiguous() {
1646 for (i = $self->start; i < $self->end; i++)
1647 if ($self->pool->solvables[i].repo != $self)
1651 %newobject first_repodata;
1652 XRepodata *first_repodata() {
1655 if ($self->nrepodata < 2)
1657 /* make sure all repodatas but the first are extensions */
1658 data = repo_id2repodata($self, 1);
1659 if (data->loadcallback)
1661 for (i = 2; i < $self->nrepodata; i++)
1663 data = repo_id2repodata($self, i);
1664 if (!data->loadcallback)
1665 return 0; /* oops, not an extension */
1667 return new_XRepodata($self, 1);
1670 %newobject Selection;
1671 Selection *Selection(int setflags=0) {
1672 Selection *sel = new_Selection($self->pool);
1673 setflags |= SOLVER_SETREPO;
1674 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1678 #ifdef ENABLE_PUBKEY
1679 %newobject find_pubkey;
1680 XSolvable *find_pubkey(const char *keyid) {
1681 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
1685 bool __eq__(Repo *repo) {
1686 return $self == repo;
1688 bool __ne__(Repo *repo) {
1689 return $self != repo;
1691 #if defined(SWIGPERL)
1692 %rename("str") __str__;
1695 const char *__str__() {
1698 return solv_strdup($self->name);
1699 sprintf(buf, "Repo#%d", $self->repoid);
1700 return solv_strdup(buf);
1702 %newobject __repr__;
1703 const char *__repr__() {
1707 sprintf(buf, "<Repo #%d ", $self->repoid);
1708 return solv_dupjoin(buf, $self->name, ">");
1710 sprintf(buf, "<Repo #%d>", $self->repoid);
1711 return solv_strdup(buf);
1715 %extend Dataiterator {
1716 static const int SEARCH_STRING = SEARCH_STRING;
1717 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1718 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1719 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1720 static const int SEARCH_GLOB = SEARCH_GLOB;
1721 static const int SEARCH_REGEX = SEARCH_REGEX;
1722 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1723 static const int SEARCH_FILES = SEARCH_FILES;
1724 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1725 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1727 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1728 Dataiterator *di = solv_calloc(1, sizeof(*di));
1729 dataiterator_init(di, pool, repo, p, key, match, flags);
1733 dataiterator_free($self);
1736 #if defined(SWIGPYTHON)
1737 %newobject __iter__;
1738 Dataiterator *__iter__() {
1740 ndi = solv_calloc(1, sizeof(*ndi));
1741 dataiterator_init_clone(ndi, $self);
1745 %rename("next") __next__();
1747 %exception __next__ {
1750 PyErr_SetString(PyExc_StopIteration,"no more matches");
1756 perliter(solv::Dataiterator)
1758 %newobject __next__;
1759 Datamatch *__next__() {
1761 if (!dataiterator_step($self)) {
1764 ndi = solv_calloc(1, sizeof(*ndi));
1765 dataiterator_init_clone(ndi, $self);
1766 dataiterator_strdup(ndi);
1772 while ((d = Dataiterator___next__($self)) != 0) {
1773 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1777 void prepend_keyname(Id key) {
1778 dataiterator_prepend_keyname($self, key);
1780 void skip_solvable() {
1781 dataiterator_skip_solvable($self);
1786 Id lookup_id(Id keyname) {
1787 Pool *pool = $self->repo->pool;
1788 Datapos oldpos = pool->pos;
1791 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1795 const char *lookup_str(Id keyname) {
1796 Pool *pool = $self->repo->pool;
1797 Datapos oldpos = pool->pos;
1800 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1804 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1805 Pool *pool = $self->repo->pool;
1806 Datapos oldpos = pool->pos;
1807 unsigned long long r;
1809 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1813 bool lookup_void(Id keyname) {
1814 Pool *pool = $self->repo->pool;
1815 Datapos oldpos = pool->pos;
1818 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1822 %newobject lookup_checksum;
1823 Chksum *lookup_checksum(Id keyname) {
1824 Pool *pool = $self->repo->pool;
1825 Datapos oldpos = pool->pos;
1827 const unsigned char *b;
1829 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1831 return solv_chksum_create_from_bin(type, b);
1833 const char *lookup_deltaseq() {
1834 Pool *pool = $self->repo->pool;
1835 Datapos oldpos = pool->pos;
1838 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1840 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1841 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1846 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1847 Pool *pool = $self->repo->pool;
1848 Datapos oldpos = pool->pos;
1851 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1855 Queue lookup_idarray(Id keyname) {
1856 Pool *pool = $self->repo->pool;
1857 Datapos oldpos = pool->pos;
1861 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1865 %newobject Dataiterator;
1866 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1867 Pool *pool = $self->repo->pool;
1868 Datapos oldpos = pool->pos;
1871 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1879 dataiterator_free($self);
1882 %newobject solvable;
1883 XSolvable * const solvable;
1885 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1886 return new_XSolvable(di->pool, di->solvid);
1890 return $self->key->name;
1892 const char *key_idstr() {
1893 return pool_id2str($self->pool, $self->key->name);
1896 return $self->key->type;
1898 const char *type_idstr() {
1899 return pool_id2str($self->pool, $self->key->type);
1902 return $self->kv.id;
1904 const char *idstr() {
1905 if ($self->data && ($self->key->type == REPOKEY_TYPE_DIR || $self->key->type == REPOKEY_TYPE_DIRSTRARRAY || $self->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
1906 return repodata_dir2str($self->data, $self->kv.id, 0);
1907 if ($self->data && $self->data->localpool)
1908 return stringpool_id2str(&self->data->spool, $self->kv.id);
1909 return pool_id2str($self->pool, $self->kv.id);
1912 return $self->kv.str;
1914 BinaryBlob binary() {
1918 if ($self->key->type == REPOKEY_TYPE_BINARY)
1920 bl.data = $self->kv.str;
1921 bl.len = $self->kv.num;
1923 else if ((bl.len = solv_chksum_len($self->key->type)) != 0)
1924 bl.data = $self->kv.str;
1927 unsigned long long num() {
1928 if ($self->key->type == REPOKEY_TYPE_NUM)
1929 return SOLV_KV_NUM64(&$self->kv);
1930 return $self->kv.num;
1933 return $self->kv.num2;
1937 Pool *pool = $self->pool;
1938 Datapos *pos, oldpos = pool->pos;
1939 dataiterator_setpos($self);
1940 pos = solv_calloc(1, sizeof(*pos));
1945 %newobject parentpos;
1946 Datapos *parentpos() {
1947 Pool *pool = $self->pool;
1948 Datapos *pos, oldpos = pool->pos;
1949 dataiterator_setpos_parent($self);
1950 pos = solv_calloc(1, sizeof(*pos));
1955 #if defined(SWIGPERL)
1956 %rename("str") __str__;
1958 const char *__str__() {
1959 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1961 return $self->kv.str;
1965 %extend Pool_solvable_iterator {
1966 Pool_solvable_iterator(Pool *pool) {
1967 Pool_solvable_iterator *s;
1968 s = solv_calloc(1, sizeof(*s));
1972 #if defined(SWIGPYTHON)
1973 %newobject __iter__;
1974 Pool_solvable_iterator *__iter__() {
1975 Pool_solvable_iterator *s;
1976 s = solv_calloc(1, sizeof(*s));
1981 %rename("next") __next__();
1983 %exception __next__ {
1986 PyErr_SetString(PyExc_StopIteration,"no more matches");
1992 perliter(solv::Pool_solvable_iterator)
1994 %newobject __next__;
1995 XSolvable *__next__() {
1996 Pool *pool = $self->pool;
1997 if ($self->id >= pool->nsolvables)
1999 while (++$self->id < pool->nsolvables)
2000 if (pool->solvables[$self->id].repo)
2001 return new_XSolvable(pool, $self->id);
2007 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2008 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2012 %newobject __getitem__;
2013 XSolvable *__getitem__(Id key) {
2014 Pool *pool = $self->pool;
2015 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2016 return new_XSolvable(pool, key);
2020 return $self->pool->nsolvables;
2024 %extend Pool_repo_iterator {
2025 Pool_repo_iterator(Pool *pool) {
2026 Pool_repo_iterator *s;
2027 s = solv_calloc(1, sizeof(*s));
2031 #if defined(SWIGPYTHON)
2032 %newobject __iter__;
2033 Pool_repo_iterator *__iter__() {
2034 Pool_repo_iterator *s;
2035 s = solv_calloc(1, sizeof(*s));
2040 %rename("next") __next__();
2042 %exception __next__ {
2045 PyErr_SetString(PyExc_StopIteration,"no more matches");
2051 perliter(solv::Pool_repo_iterator)
2053 %newobject __next__;
2055 Pool *pool = $self->pool;
2056 if ($self->id >= pool->nrepos)
2058 while (++$self->id < pool->nrepos) {
2059 Repo *r = pool_id2repo(pool, $self->id);
2068 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2069 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
2073 Repo *__getitem__(Id key) {
2074 Pool *pool = $self->pool;
2075 if (key > 0 && key < pool->nrepos)
2076 return pool_id2repo(pool, key);
2080 return $self->pool->nrepos;
2084 %extend Repo_solvable_iterator {
2085 Repo_solvable_iterator(Repo *repo) {
2086 Repo_solvable_iterator *s;
2087 s = solv_calloc(1, sizeof(*s));
2091 #if defined(SWIGPYTHON)
2092 %newobject __iter__;
2093 Repo_solvable_iterator *__iter__() {
2094 Repo_solvable_iterator *s;
2095 s = solv_calloc(1, sizeof(*s));
2100 %rename("next") __next__();
2102 %exception __next__ {
2105 PyErr_SetString(PyExc_StopIteration,"no more matches");
2111 perliter(solv::Repo_solvable_iterator)
2113 %newobject __next__;
2114 XSolvable *__next__() {
2115 Repo *repo = $self->repo;
2116 Pool *pool = repo->pool;
2117 if (repo->start > 0 && $self->id < repo->start)
2118 $self->id = repo->start - 1;
2119 if ($self->id >= repo->end)
2121 while (++$self->id < repo->end)
2122 if (pool->solvables[$self->id].repo == repo)
2123 return new_XSolvable(pool, $self->id);
2129 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2130 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2134 %newobject __getitem__;
2135 XSolvable *__getitem__(Id key) {
2136 Repo *repo = $self->repo;
2137 Pool *pool = repo->pool;
2138 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2139 return new_XSolvable(pool, key);
2143 return $self->repo->pool->nsolvables;
2148 Dep(Pool *pool, Id id) {
2152 s = solv_calloc(1, sizeof(*s));
2158 Dep *Rel(int flags, DepId evrid, bool create=1) {
2159 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2162 return new_Dep($self->pool, id);
2164 %newobject Selection_name;
2165 Selection *Selection_name(int setflags=0) {
2166 Selection *sel = new_Selection($self->pool);
2167 if (ISRELDEP($self->id)) {
2168 Reldep *rd = GETRELDEP($self->pool, $self->id);
2169 if (rd->flags == REL_EQ) {
2170 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2171 if (ISRELDEP(rd->name))
2172 rd = GETRELDEP($self->pool, rd->name);
2174 if (rd->flags == REL_ARCH)
2175 setflags |= SOLVER_SETARCH;
2177 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2180 %newobject Selection_provides;
2181 Selection *Selection_provides(int setflags=0) {
2182 Selection *sel = new_Selection($self->pool);
2183 if (ISRELDEP($self->id)) {
2184 Reldep *rd = GETRELDEP($self->pool, $self->id);
2185 if (rd->flags == REL_ARCH)
2186 setflags |= SOLVER_SETARCH;
2188 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2192 return pool_dep2str($self->pool, $self->id);
2194 bool __eq__(Dep *s) {
2195 return $self->pool == s->pool && $self->id == s->id;
2197 bool __ne__(Dep *s) {
2198 return !Dep___eq__($self, s);
2200 #if defined(SWIGPERL)
2201 %rename("str") __str__;
2203 const char *__str__() {
2204 return pool_dep2str($self->pool, $self->id);
2206 %newobject __repr__;
2207 const char *__repr__() {
2209 sprintf(buf, "<Id #%d ", $self->id);
2210 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2215 XSolvable(Pool *pool, Id id) {
2217 if (!id || id >= pool->nsolvables)
2219 s = solv_calloc(1, sizeof(*s));
2225 return pool_solvid2str($self->pool, $self->id);
2227 const char *lookup_str(Id keyname) {
2228 return pool_lookup_str($self->pool, $self->id, keyname);
2230 Id lookup_id(Id keyname) {
2231 return pool_lookup_id($self->pool, $self->id, keyname);
2233 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2234 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2236 bool lookup_void(Id keyname) {
2237 return pool_lookup_void($self->pool, $self->id, keyname);
2239 %newobject lookup_checksum;
2240 Chksum *lookup_checksum(Id keyname) {
2242 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2243 return solv_chksum_create_from_bin(type, b);
2245 Queue lookup_idarray(Id keyname, Id marker = -1) {
2246 Solvable *s = $self->pool->solvables + $self->id;
2249 solvable_lookup_deparray(s, keyname, &r, marker);
2252 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2253 %newobject lookup_deparray;
2254 Queue lookup_deparray(Id keyname, Id marker = -1) {
2255 Solvable *s = $self->pool->solvables + $self->id;
2258 solvable_lookup_deparray(s, keyname, &r, marker);
2261 const char *lookup_location(unsigned int *OUTPUT) {
2262 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2264 %newobject Dataiterator;
2265 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2266 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2269 %rename("installable?") installable;
2271 bool installable() {
2272 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2275 %rename("isinstalled?") isinstalled;
2277 bool isinstalled() {
2278 Pool *pool = $self->pool;
2279 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2284 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2285 Pool *pool = xs->pool;
2286 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2288 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2289 Pool *pool = xs->pool;
2290 return pool_id2str(pool, pool->solvables[xs->id].name);
2295 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2296 xs->pool->solvables[xs->id].name = nameid;
2298 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2299 return xs->pool->solvables[xs->id].name;
2304 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2305 Pool *pool = xs->pool;
2306 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2308 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2309 Pool *pool = xs->pool;
2310 return pool_id2str(pool, pool->solvables[xs->id].evr);
2315 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2316 xs->pool->solvables[xs->id].evr = evrid;
2318 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2319 return xs->pool->solvables[xs->id].evr;
2324 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2325 Pool *pool = xs->pool;
2326 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2328 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2329 Pool *pool = xs->pool;
2330 return pool_id2str(pool, pool->solvables[xs->id].arch);
2335 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2336 xs->pool->solvables[xs->id].arch = archid;
2338 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2339 return xs->pool->solvables[xs->id].arch;
2344 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2345 Pool *pool = xs->pool;
2346 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2348 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2349 Pool *pool = xs->pool;
2350 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2355 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2356 xs->pool->solvables[xs->id].vendor = vendorid;
2358 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2359 return xs->pool->solvables[xs->id].vendor;
2364 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2365 return xs->pool->solvables[xs->id].repo;
2369 /* old interface, please use the generic add_deparray instead */
2370 void add_provides(DepId id, Id marker = -1) {
2371 Solvable *s = $self->pool->solvables + $self->id;
2372 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2373 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2375 void add_obsoletes(DepId id) {
2376 Solvable *s = $self->pool->solvables + $self->id;
2377 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2379 void add_conflicts(DepId id) {
2380 Solvable *s = $self->pool->solvables + $self->id;
2381 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2383 void add_requires(DepId id, Id marker = -1) {
2384 Solvable *s = $self->pool->solvables + $self->id;
2385 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2386 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2388 void add_recommends(DepId id) {
2389 Solvable *s = $self->pool->solvables + $self->id;
2390 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2392 void add_suggests(DepId id) {
2393 Solvable *s = $self->pool->solvables + $self->id;
2394 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2396 void add_supplements(DepId id) {
2397 Solvable *s = $self->pool->solvables + $self->id;
2398 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2400 void add_enhances(DepId id) {
2401 Solvable *s = $self->pool->solvables + $self->id;
2402 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2405 void unset(Id keyname) {
2406 Solvable *s = $self->pool->solvables + $self->id;
2407 repo_unset(s->repo, $self->id, keyname);
2410 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2411 Solvable *s = $self->pool->solvables + $self->id;
2412 solvable_add_deparray(s, keyname, id, marker);
2415 %newobject Selection;
2416 Selection *Selection(int setflags=0) {
2417 Selection *sel = new_Selection($self->pool);
2418 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2423 %rename("identical?") identical;
2425 bool identical(XSolvable *s2) {
2426 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
2428 int evrcmp(XSolvable *s2) {
2429 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
2432 bool __eq__(XSolvable *s) {
2433 return $self->pool == s->pool && $self->id == s->id;
2435 bool __ne__(XSolvable *s) {
2436 return !XSolvable___eq__($self, s);
2438 #if defined(SWIGPERL)
2439 %rename("str") __str__;
2441 const char *__str__() {
2442 return pool_solvid2str($self->pool, $self->id);
2444 %newobject __repr__;
2445 const char *__repr__() {
2447 sprintf(buf, "<Solvable #%d ", $self->id);
2448 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2453 Problem(Solver *solv, Id id) {
2455 p = solv_calloc(1, sizeof(*p));
2460 %newobject findproblemrule;
2461 XRule *findproblemrule() {
2462 Id r = solver_findproblemrule($self->solv, $self->id);
2463 return new_XRule($self->solv, r);
2465 %newobject findallproblemrules;
2466 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2467 Queue findallproblemrules(int unfiltered=0) {
2468 Solver *solv = $self->solv;
2473 solver_findallproblemrules(solv, $self->id, &q);
2476 for (i = j = 0; i < q.count; i++)
2478 SolverRuleinfo rclass;
2479 probr = q.elements[i];
2480 rclass = solver_ruleclass(solv, probr);
2481 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2483 q.elements[j++] = probr;
2486 queue_truncate(&q, j);
2490 int solution_count() {
2491 return solver_solution_count($self->solv, $self->id);
2493 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2494 %newobject solutions;
2499 cnt = solver_solution_count($self->solv, $self->id);
2500 for (i = 1; i <= cnt; i++)
2504 #if defined(SWIGPERL)
2505 %rename("str") __str__;
2507 const char *__str__() {
2508 return solver_problem2str($self->solv, $self->id);
2513 Solution(Problem *p, Id id) {
2515 s = solv_calloc(1, sizeof(*s));
2517 s->problemid = p->id;
2521 int element_count() {
2522 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2525 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2526 %newobject elements;
2527 Queue elements(bool expandreplaces=0) {
2531 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2532 for (i = 1; i <= cnt; i++)
2535 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2537 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2543 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2544 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2546 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2547 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2548 queue_push2(&q, p, rp);
2550 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2551 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2552 queue_push2(&q, p, rp);
2554 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2555 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2556 queue_push2(&q, p, rp);
2558 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2559 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2560 queue_push2(&q, p, rp);
2565 queue_push2(&q, i, type);
2566 queue_push2(&q, p, rp);
2572 %extend Solutionelement {
2573 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2575 e = solv_calloc(1, sizeof(*e));
2577 e->problemid = problemid;
2589 if (p == SOLVER_SOLUTION_ERASE)
2594 else if (p == SOLVER_SOLUTION_REPLACE)
2599 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2600 illegal = POLICY_ILLEGAL_DOWNGRADE;
2601 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2602 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2603 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2604 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2605 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2606 illegal = POLICY_ILLEGAL_NAMECHANGE;
2608 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);
2609 return solver_solutionelement2str($self->solv, p, rp);
2611 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2612 %newobject replaceelements;
2613 Queue replaceelements() {
2618 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2621 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2622 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2623 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2624 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2625 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2626 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2627 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2628 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2629 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2631 queue_push(&q, $self->type);
2634 int illegalreplace() {
2635 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2637 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2639 %newobject solvable;
2640 XSolvable * const solvable;
2641 %newobject replacement;
2642 XSolvable * const replacement;
2645 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2646 return new_XSolvable(e->solv->pool, e->p);
2648 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2649 return new_XSolvable(e->solv->pool, e->rp);
2651 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2652 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2654 return (e->p - 1) / 2;
2659 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2660 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2661 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2662 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2663 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2664 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)
2665 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2666 if ($self->type == SOLVER_SOLUTION_ERASE)
2667 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2673 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2674 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2675 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2676 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2677 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2678 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2679 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2680 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2681 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2682 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2683 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2684 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2685 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2686 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2687 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2688 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2689 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2690 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2691 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2692 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2693 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2694 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2696 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2697 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2698 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2699 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2700 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2701 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2702 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2703 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2704 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2705 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2706 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2708 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2709 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2710 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2711 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2713 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2714 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2715 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2716 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2717 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2718 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2719 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2720 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2721 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2722 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2723 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2724 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2726 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
2727 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
2728 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
2729 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
2730 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
2731 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
2732 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
2733 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
2734 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
2735 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
2736 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
2742 int set_flag(int flag, int value) {
2743 return solver_set_flag($self, flag, value);
2745 int get_flag(int flag) {
2746 return solver_get_flag($self, flag);
2748 #if defined(SWIGPYTHON)
2750 def solve(self, jobs):
2752 for job in jobs: j += [job.how, job.what]
2753 return self.solve_helper(j)
2756 #if defined(SWIGPERL)
2758 sub solv::Solver::solve {
2759 my ($self, $jobs) = @_;
2760 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2761 return $self->solve_helper(\@j);
2765 #if defined(SWIGRUBY)
2768 "class Solv::Solver\n"
2769 " def solve(jobs)\n"
2771 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2772 " solve_helper(jl)\n"
2778 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2779 %newobject solve_helper;
2780 Queue solve_helper(Queue jobs) {
2784 solver_solve($self, &jobs);
2785 cnt = solver_problem_count($self);
2786 for (i = 1; i <= cnt; i++)
2790 %newobject transaction;
2791 Transaction *transaction() {
2792 return solver_create_transaction($self);
2795 int describe_decision(XSolvable *s, XRule **OUTPUT) {
2797 int reason = solver_describe_decision($self, s->id, &ruleid);
2798 *OUTPUT = new_XRule($self, ruleid);
2803 %extend Transaction {
2804 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2805 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2806 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2807 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2808 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2809 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2810 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2811 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2812 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2813 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2814 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2815 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2816 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2817 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2818 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2819 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2820 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2821 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2822 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2823 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2824 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2825 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2826 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2827 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2828 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2829 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2830 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2831 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2833 transaction_free($self);
2836 %rename("isempty?") isempty;
2839 return $self->steps.count == 0;
2842 %newobject othersolvable;
2843 XSolvable *othersolvable(XSolvable *s) {
2844 Id op = transaction_obs_pkg($self, s->id);
2845 return new_XSolvable($self->pool, op);
2848 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2849 %newobject allothersolvables;
2850 Queue allothersolvables(XSolvable *s) {
2853 transaction_all_obs_pkgs($self, s->id, &q);
2857 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2858 %newobject classify;
2859 Queue classify(int mode = 0) {
2862 transaction_classify($self, mode, &q);
2866 # deprecated, use newsolvables instead
2867 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2868 %newobject newpackages;
2869 Queue newpackages() {
2873 cut = transaction_installedresult(self, &q);
2874 queue_truncate(&q, cut);
2878 # deprecated, use keptsolvables instead
2879 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2880 %newobject keptpackages;
2881 Queue keptpackages() {
2885 cut = transaction_installedresult(self, &q);
2887 queue_deleten(&q, 0, cut);
2891 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2892 %newobject newsolvables;
2893 Queue newsolvables() {
2897 cut = transaction_installedresult(self, &q);
2898 queue_truncate(&q, cut);
2902 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2903 %newobject keptsolvables;
2904 Queue keptsolvables() {
2908 cut = transaction_installedresult(self, &q);
2910 queue_deleten(&q, 0, cut);
2914 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2918 queue_init_clone(&q, &$self->steps);
2922 int steptype(XSolvable *s, int mode) {
2923 return transaction_type($self, s->id, mode);
2925 int calc_installsizechange() {
2926 return transaction_calc_installsizechange($self);
2928 void order(int flags=0) {
2929 transaction_order($self, flags);
2933 %extend TransactionClass {
2934 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2935 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2936 cl->transaction = trans;
2940 cl->fromid = fromid;
2944 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2945 %newobject solvables;
2949 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2952 const char * const fromstr;
2953 const char * const tostr;
2955 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
2956 return pool_id2str(cl->transaction->pool, cl->fromid);
2958 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
2959 return pool_id2str(cl->transaction->pool, cl->toid);
2965 XRule(Solver *solv, Id id) {
2968 XRule *xr = solv_calloc(1, sizeof(*xr));
2975 SWIGINTERN int XRule_type_get(XRule *xr) {
2976 return solver_ruleclass(xr->solv, xr->id);
2981 Id type, source, target, dep;
2982 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2983 return new_Ruleinfo($self, type, source, target, dep);
2985 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2986 %newobject allinfos;
2990 solver_allruleinfos($self->solv, $self->id, &q);
2994 bool __eq__(XRule *xr) {
2995 return $self->solv == xr->solv && $self->id == xr->id;
2997 bool __ne__(XRule *xr) {
2998 return !XRule___eq__($self, xr);
3000 %newobject __repr__;
3001 const char *__repr__() {
3003 sprintf(buf, "<Rule #%d>", $self->id);
3004 return solv_strdup(buf);
3009 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3010 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3014 ri->source = source;
3015 ri->target = target;
3016 ri->dep_id = dep_id;
3019 %newobject solvable;
3020 XSolvable * const solvable;
3021 %newobject othersolvable;
3022 XSolvable * const othersolvable;
3026 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3027 return new_XSolvable(ri->solv->pool, ri->source);
3029 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3030 return new_XSolvable(ri->solv->pool, ri->target);
3032 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3033 return new_Dep(ri->solv->pool, ri->dep_id);
3036 const char *problemstr() {
3037 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3042 XRepodata(Repo *repo, Id id) {
3043 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3049 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3051 void set_id(Id solvid, Id keyname, DepId id) {
3052 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3054 void set_str(Id solvid, Id keyname, const char *str) {
3055 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3057 void set_poolstr(Id solvid, Id keyname, const char *str) {
3058 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3060 void add_idarray(Id solvid, Id keyname, DepId id) {
3061 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3063 void add_flexarray(Id solvid, Id keyname, Id handle) {
3064 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3066 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3067 const unsigned char *buf = solv_chksum_get(chksum, 0);
3069 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3071 const char *lookup_str(Id solvid, Id keyname) {
3072 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3074 Queue lookup_idarray(Id solvid, Id keyname) {
3077 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3080 %newobject lookup_checksum;
3081 Chksum *lookup_checksum(Id solvid, Id keyname) {
3083 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3084 return solv_chksum_create_from_bin(type, b);
3086 void internalize() {
3087 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3089 void create_stubs() {
3090 Repodata *data = repo_id2repodata($self->repo, $self->id);
3091 data = repodata_create_stubs(data);
3092 $self->id = data->repodataid;
3094 bool write(FILE *fp) {
3095 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3097 bool add_solv(FILE *fp, int flags = 0) {
3098 Repodata *data = repo_id2repodata($self->repo, $self->id);
3099 int r, oldstate = data->state;
3100 data->state = REPODATA_LOADING;
3101 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3102 if (r || data->state == REPODATA_LOADING)
3103 data->state = oldstate;
3106 void extend_to_repo() {
3107 Repodata *data = repo_id2repodata($self->repo, $self->id);
3108 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3110 bool __eq__(XRepodata *xr) {
3111 return $self->repo == xr->repo && $self->id == xr->id;
3113 bool __ne__(XRepodata *xr) {
3114 return !XRepodata___eq__($self, xr);
3116 %newobject __repr__;
3117 const char *__repr__() {
3119 sprintf(buf, "<Repodata #%d>", $self->id);
3120 return solv_strdup(buf);
3124 #ifdef ENABLE_PUBKEY
3127 return solvsig_create(fp);
3130 solvsig_free($self);
3134 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3136 #ifdef ENABLE_PGPVRFY
3138 XSolvable *verify(Repo *repo, Chksum *chksum) {
3139 Id p = solvsig_verify($self, repo, chksum);
3140 return new_XSolvable(repo->pool, p);