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"
453 #include "solverdebug.h"
454 #include "repo_solv.h"
456 #include "selection.h"
458 #include "repo_write.h"
460 #include "repo_rpmdb.h"
463 #include "repo_pubkey.h"
466 #include "repo_deb.h"
469 #include "repo_rpmmd.h"
470 #include "repo_updateinfoxml.h"
471 #include "repo_deltainfoxml.h"
472 #include "repo_repomdxml.h"
474 #ifdef ENABLE_SUSEREPO
475 #include "repo_products.h"
476 #include "repo_susetags.h"
477 #include "repo_content.h"
479 #ifdef ENABLE_MDKREPO
480 #include "repo_mdk.h"
482 #ifdef ENABLE_ARCHREPO
483 #include "repo_arch.h"
485 #include "solv_xfopen.h"
487 /* for old ruby versions */
489 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
492 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
495 #define SOLVER_SOLUTION_ERASE -100
496 #define SOLVER_SOLUTION_REPLACE -101
497 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
498 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
499 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
500 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
502 typedef void *AppObjectPtr;
528 } Pool_solvable_iterator;
533 } Pool_repo_iterator;
538 } Repo_solvable_iterator;
578 Transaction *transaction;
596 typedef Dataiterator Datamatch;
601 %mixin Dataiterator "Enumerable";
602 %mixin Pool_solvable_iterator "Enumerable";
603 %mixin Pool_repo_iterator "Enumerable";
604 %mixin Repo_solvable_iterator "Enumerable";
612 %constant Id SOLVID_META;
613 %constant Id SOLVID_POS;
615 %constant int REL_EQ;
616 %constant int REL_GT;
617 %constant int REL_LT;
618 %constant int REL_ARCH;
629 # put before pool/repo so we can access the constructor
630 %nodefaultdtor Dataiterator;
631 typedef struct {} Dataiterator;
654 typedef struct {} Pool_solvable_iterator;
655 typedef struct {} Pool_repo_iterator;
656 typedef struct {} Repo_solvable_iterator;
658 %nodefaultctor Datamatch;
659 %nodefaultdtor Datamatch;
666 %nodefaultctor Datapos;
680 AppObjectPtr appdata;
687 const char * const name;
690 int const nsolvables;
691 AppObjectPtr appdata;
694 %nodefaultctor Solver;
695 %nodefaultdtor Solver;
706 unsigned int const created;
707 unsigned int const expires;
708 const char * const keyid;
712 %rename(xfopen) solvfp_xfopen;
713 %rename(xfopen_fd) solvfp_xfopen_fd;
715 %nodefaultctor SolvFp;
719 %newobject solvfp_xfopen;
720 %newobject solvfp_xfopen_fd;
722 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
723 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
726 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
730 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
733 sfp = solv_calloc(1, sizeof(SolvFp));
737 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
740 fp = solv_xfopen(fn, mode);
743 sfp = solv_calloc(1, sizeof(SolvFp));
768 %nodefaultctor Transaction;
769 %nodefaultdtor Transaction;
775 Transaction * const transaction;
789 return $self->fp ? fileno($self->fp) : -1;
792 return $self->fp ? dup(fileno($self->fp)) : -1;
797 return fflush($self->fp) == 0;
803 ret = fclose($self->fp) == 0;
810 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
811 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
812 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
813 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
814 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
815 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
816 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
817 static const Id SOLVER_NOOP = SOLVER_NOOP;
818 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
819 static const Id SOLVER_ERASE = SOLVER_ERASE;
820 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
821 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
822 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
823 static const Id SOLVER_LOCK = SOLVER_LOCK;
824 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
825 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
826 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
827 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
828 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
829 static const Id SOLVER_WEAK = SOLVER_WEAK;
830 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
831 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
832 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
833 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
834 static const Id SOLVER_SETEV = SOLVER_SETEV;
835 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
836 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
837 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
838 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
839 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
840 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
841 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
843 Job(Pool *pool, int how, Id what) {
844 Job *job = solv_calloc(1, sizeof(*job));
851 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
852 %newobject solvables;
856 pool_job2solvables($self->pool, &q, $self->how, $self->what);
860 %rename("isemptyupdate?") isemptyupdate;
862 bool isemptyupdate() {
863 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
866 bool __eq__(Job *j) {
867 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
869 bool __ne__(Job *j) {
870 return !Job___eq__($self, j);
872 #if defined(SWIGPERL)
873 %rename("str") __str__;
875 const char *__str__() {
876 return pool_job2str($self->pool, $self->how, $self->what, 0);
878 const char *__repr__() {
879 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
880 return pool_tmpjoin($self->pool, "<Job ", str, ">");
885 static const Id SELECTION_NAME = SELECTION_NAME;
886 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
887 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
888 static const Id SELECTION_CANON = SELECTION_CANON;
889 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
890 static const Id SELECTION_REL = SELECTION_REL;
891 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
892 static const Id SELECTION_GLOB = SELECTION_GLOB;
893 static const Id SELECTION_FLAT = SELECTION_FLAT;
894 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
895 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
896 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
898 Selection(Pool *pool) {
900 s = solv_calloc(1, sizeof(*s));
906 queue_free(&$self->q);
913 %rename("isempty?") isempty;
916 return $self->q.count == 0;
918 void filter(Selection *lsel) {
919 if ($self->pool != lsel->pool)
920 queue_empty(&$self->q);
922 selection_filter($self->pool, &$self->q, &lsel->q);
924 void add(Selection *lsel) {
925 if ($self->pool == lsel->pool)
927 selection_add($self->pool, &$self->q, &lsel->q);
928 $self->flags |= lsel->flags;
931 void add_raw(Id how, Id what) {
932 queue_push2(&$self->q, how, what);
934 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
936 Queue jobs(int flags) {
939 queue_init_clone(&q, &$self->q);
940 for (i = 0; i < q.count; i += 2)
941 q.elements[i] |= flags;
945 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
946 %newobject solvables;
950 selection_solvables($self->pool, &$self->q, &q);
954 #if defined(SWIGPERL)
955 %rename("str") __str__;
957 const char *__str__() {
958 return pool_selection2str($self->pool, &$self->q, 0);
960 const char *__repr__() {
961 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
962 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
968 return solv_chksum_create(type);
970 Chksum(Id type, const char *hex) {
971 unsigned char buf[64];
972 int l = solv_chksum_len(type);
975 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
977 return solv_chksum_create_from_bin(type, buf);
980 solv_chksum_free($self, 0);
984 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
985 return solv_chksum_get_type(chk);
988 void add(const unsigned char *str, size_t len) {
989 solv_chksum_add($self, str, (int)len);
991 void add_fp(FILE *fp) {
994 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
995 solv_chksum_add($self, buf, l);
996 rewind(fp); /* convenience */
998 void add_fd(int fd) {
1001 while ((l = read(fd, buf, sizeof(buf))) > 0)
1002 solv_chksum_add($self, buf, l);
1003 lseek(fd, 0, 0); /* convenience */
1005 void add_stat(const char *filename) {
1007 if (stat(filename, &stb))
1008 memset(&stb, 0, sizeof(stb));
1009 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1010 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1011 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1012 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1014 void add_fstat(int fd) {
1016 if (fstat(fd, &stb))
1017 memset(&stb, 0, sizeof(stb));
1018 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1019 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1020 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1021 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1026 const unsigned char *b;
1027 b = solv_chksum_get($self, &l);
1035 const unsigned char *b;
1038 b = solv_chksum_get($self, &l);
1039 ret = solv_malloc(2 * l + 1);
1040 solv_bin2hex(b, l, ret);
1044 bool __eq__(Chksum *chk) {
1046 const unsigned char *b, *bo;
1049 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1051 b = solv_chksum_get($self, &l);
1052 bo = solv_chksum_get(chk, 0);
1053 return memcmp(b, bo, l) == 0;
1055 bool __ne__(Chksum *chk) {
1056 return !Chksum___eq__($self, chk);
1058 #if defined(SWIGRUBY)
1059 %rename("to_s") __str__;
1061 #if defined(SWIGPERL)
1062 %rename("str") __str__;
1065 const char *__str__() {
1068 if (solv_chksum_isfinished($self))
1069 h = Chksum_hex($self);
1070 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1071 solv_free((void *)h);
1074 %newobject __repr__;
1075 const char *__repr__() {
1076 const char *h = Chksum___str__($self);
1077 const char *str = solv_dupjoin("<Chksum ", h, ">");
1078 solv_free((void *)h);
1084 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1085 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1086 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1087 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1088 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1089 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1090 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1091 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1092 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1095 Pool *pool = pool_create();
1100 void set_debuglevel(int level) {
1101 pool_setdebuglevel($self, level);
1103 int set_flag(int flag, int value) {
1104 return pool_set_flag($self, flag, value);
1106 int get_flag(int flag) {
1107 return pool_get_flag($self, flag);
1109 void set_rootdir(const char *rootdir) {
1110 pool_set_rootdir($self, rootdir);
1112 const char *get_rootdir(int flag) {
1113 return pool_get_rootdir($self);
1115 #if defined(SWIGPYTHON)
1117 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1118 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1119 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1120 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1125 return 0; /* exception */
1126 ecode = SWIG_AsVal_int(result, &vresult);
1128 return SWIG_IsOK(ecode) ? vresult : 0;
1131 void set_loadcallback(PyObject *callable) {
1132 if ($self->loadcallback == loadcallback) {
1133 PyObject *obj = $self->loadcallbackdata;
1137 Py_INCREF(callable);
1139 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1142 #if defined(SWIGPERL)
1144 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1148 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1153 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1155 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1165 void set_loadcallback(SV *callable) {
1166 if ($self->loadcallback == loadcallback)
1167 SvREFCNT_dec($self->loadcallbackdata);
1169 SvREFCNT_inc(callable);
1170 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1174 #if defined(SWIGRUBY)
1176 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1177 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1178 VALUE callable = (VALUE)d;
1179 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1180 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1181 return res == Qtrue;
1183 SWIGINTERN void mark_Pool(void *ptr) {
1185 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1186 VALUE callable = (VALUE)pool->loadcallbackdata;
1187 rb_gc_mark(callable);
1191 %typemap(in, numinputs=0) VALUE callable {
1192 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1194 void set_loadcallback(VALUE callable) {
1195 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1200 Pool_set_loadcallback($self, 0);
1203 Id str2id(const char *str, bool create=1) {
1204 return pool_str2id($self, str, create);
1207 Dep *Dep(const char *str, bool create=1) {
1208 Id id = pool_str2id($self, str, create);
1209 return new_Dep($self, id);
1211 const char *id2str(Id id) {
1212 return pool_id2str($self, id);
1214 const char *dep2str(Id id) {
1215 return pool_dep2str($self, id);
1217 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1218 return pool_rel2id($self, name, evr, flags, create);
1220 Id id2langid(Id id, const char *lang, bool create=1) {
1221 return pool_id2langid($self, id, lang, create);
1223 void setarch(const char *arch = 0) {
1232 pool_setarch($self, arch);
1234 Repo *add_repo(const char *name) {
1235 return repo_create($self, name);
1237 const char *lookup_str(Id entry, Id keyname) {
1238 return pool_lookup_str($self, entry, keyname);
1240 Id lookup_id(Id entry, Id keyname) {
1241 return pool_lookup_id($self, entry, keyname);
1243 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1244 return pool_lookup_num($self, entry, keyname, notfound);
1246 bool lookup_void(Id entry, Id keyname) {
1247 return pool_lookup_void($self, entry, keyname);
1249 %newobject lookup_checksum;
1250 Chksum *lookup_checksum(Id entry, Id keyname) {
1252 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1253 return solv_chksum_create_from_bin(type, b);
1256 %newobject Dataiterator;
1257 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1258 return new_Dataiterator($self, 0, p, key, match, flags);
1260 const char *solvid2str(Id solvid) {
1261 return pool_solvid2str($self, solvid);
1263 void addfileprovides() {
1264 pool_addfileprovides($self);
1266 Queue addfileprovides_queue() {
1269 pool_addfileprovides_queue($self, &r, 0);
1272 void createwhatprovides() {
1273 pool_createwhatprovides($self);
1276 %newobject id2solvable;
1277 XSolvable *id2solvable(Id id) {
1278 return new_XSolvable($self, id);
1280 %newobject solvables;
1281 Pool_solvable_iterator * const solvables;
1283 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1284 return new_Pool_solvable_iterator(pool);
1287 %newobject solvables_iter;
1288 Pool_solvable_iterator * solvables_iter() {
1289 return new_Pool_solvable_iterator($self);
1292 Repo *id2repo(Id id) {
1293 if (id < 1 || id >= $self->nrepos)
1295 return pool_id2repo($self, id);
1299 Pool_repo_iterator * const repos;
1301 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1302 return new_Pool_repo_iterator(pool);
1305 %newobject repos_iter;
1306 Pool_repo_iterator * repos_iter() {
1307 return new_Pool_repo_iterator($self);
1311 const char * const errstr;
1313 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1314 pool_set_installed(pool, installed);
1316 Repo *Pool_installed_get(Pool *pool) {
1317 return pool->installed;
1319 const char *Pool_errstr_get(Pool *pool) {
1320 return pool_errstr(pool);
1324 Queue matchprovidingids(const char *match, int flags) {
1330 for (id = 1; id < pool->ss.nstrings; id++)
1331 if (pool->whatprovides[id])
1335 if (!datamatcher_init(&ma, match, flags)) {
1336 for (id = 1; id < pool->ss.nstrings; id++)
1337 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1339 datamatcher_free(&ma);
1346 Job *Job(int how, Id what) {
1347 return new_Job($self, how, what);
1350 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1351 %newobject whatprovides;
1352 Queue whatprovides(DepId dep) {
1357 FOR_PROVIDES(p, pp, dep)
1362 Id towhatprovides(Queue q) {
1363 return pool_queuetowhatprovides($self, &q);
1367 %rename("isknownarch?") isknownarch;
1369 bool isknownarch(DepId id) {
1371 if (!id || id == ID_EMPTY)
1373 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1375 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1382 return solver_create($self);
1385 %newobject Selection;
1386 Selection *Selection() {
1387 return new_Selection($self);
1389 %newobject Selection_all;
1390 Selection *Selection_all(int setflags=0) {
1391 Selection *sel = new_Selection($self);
1392 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1396 Selection *select(const char *name, int flags) {
1397 Selection *sel = new_Selection($self);
1398 sel->flags = selection_make($self, &sel->q, name, flags);
1402 void setpooljobs_helper(Queue jobs) {
1403 queue_free(&$self->pooljobs);
1404 queue_init_clone(&$self->pooljobs, &jobs);
1406 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1407 %newobject getpooljobs;
1408 Queue getpooljobs() {
1410 queue_init_clone(&q, &$self->pooljobs);
1414 #if defined(SWIGPYTHON)
1416 def setpooljobs(self, jobs):
1418 for job in jobs: j += [job.how, job.what]
1419 self.setpooljobs_helper(j)
1422 #if defined(SWIGPERL)
1424 sub solv::Solver::setpooljobs {
1425 my ($self, $jobs) = @_;
1426 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1427 return $self->setpooljobs_helper(\@j);
1431 #if defined(SWIGRUBY)
1434 "class Solv::Pool\n"
1435 " def setpooljobs(jobs)\n"
1437 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1438 " setpooljobs_helper(jl)\n"
1447 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1448 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1449 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1450 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1451 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1452 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1453 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1454 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1455 #ifdef ENABLE_SUSEREPO
1456 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1459 void free(bool reuseids = 0) {
1460 repo_free($self, reuseids);
1462 void empty(bool reuseids = 0) {
1463 repo_empty($self, reuseids);
1466 %rename("isempty?") isempty;
1469 return !$self->nsolvables;
1471 bool add_solv(const char *name, int flags = 0) {
1472 FILE *fp = fopen(name, "r");
1476 r = repo_add_solv($self, fp, flags);
1480 bool add_solv(FILE *fp, int flags = 0) {
1481 return repo_add_solv($self, fp, flags) == 0;
1484 %newobject add_solvable;
1485 XSolvable *add_solvable() {
1486 Id solvid = repo_add_solvable($self);
1487 return new_XSolvable($self->pool, solvid);
1491 bool add_rpmdb(int flags = 0) {
1492 return repo_add_rpmdb($self, 0, flags) == 0;
1494 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1495 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1498 XSolvable *add_rpm(const char *name, int flags = 0) {
1499 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1502 #ifdef ENABLE_PUBKEY
1504 bool add_rpmdb_pubkeys(int flags = 0) {
1505 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1508 %newobject add_pubkey;
1509 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
1510 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
1512 bool add_keyring(FILE *fp, int flags = 0) {
1513 return repo_add_keyring($self, fp, flags);
1515 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
1516 return repo_add_keydir($self, keydir, suffix, flags);
1520 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1521 return repo_add_rpmmd($self, fp, language, flags) == 0;
1523 bool add_repomdxml(FILE *fp, int flags = 0) {
1524 return repo_add_repomdxml($self, fp, flags) == 0;
1526 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1527 return repo_add_updateinfoxml($self, fp, flags) == 0;
1529 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1530 return repo_add_deltainfoxml($self, fp, flags) == 0;
1533 #ifdef ENABLE_DEBIAN
1534 bool add_debdb(int flags = 0) {
1535 return repo_add_debdb($self, flags) == 0;
1537 bool add_debpackages(FILE *fp, int flags = 0) {
1538 return repo_add_debpackages($self, fp, flags) == 0;
1541 XSolvable *add_deb(const char *name, int flags = 0) {
1542 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
1545 #ifdef ENABLE_SUSEREPO
1546 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1547 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1549 bool add_content(FILE *fp, int flags = 0) {
1550 return repo_add_content($self, fp, flags) == 0;
1552 bool add_products(const char *proddir, int flags = 0) {
1553 return repo_add_products($self, proddir, flags) == 0;
1556 #ifdef ENABLE_MDKREPO
1557 bool add_mdk(FILE *fp, int flags = 0) {
1558 return repo_add_mdk($self, fp, flags) == 0;
1560 bool add_mdk_info(FILE *fp, int flags = 0) {
1561 return repo_add_mdk_info($self, fp, flags) == 0;
1564 #ifdef ENABLE_ARCHREPO
1565 bool add_arch_repo(FILE *fp, int flags = 0) {
1566 return repo_add_arch_repo($self, fp, flags) == 0;
1568 bool add_arch_local(const char *dir, int flags = 0) {
1569 return repo_add_arch_local($self, dir, flags) == 0;
1571 %newobject add_arch_pkg;
1572 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
1573 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
1576 void internalize() {
1577 repo_internalize($self);
1579 bool write(FILE *fp) {
1580 return repo_write($self, fp) == 0;
1582 # HACK, remove if no longer needed!
1583 bool write_first_repodata(FILE *fp) {
1584 int oldnrepodata = $self->nrepodata;
1586 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1587 res = repo_write($self, fp);
1588 $self->nrepodata = oldnrepodata;
1592 %newobject Dataiterator;
1593 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1594 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1599 SWIGINTERN Id Repo_id_get(Repo *repo) {
1600 return repo->repoid;
1603 %newobject solvables;
1604 Repo_solvable_iterator * const solvables;
1606 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1607 return new_Repo_solvable_iterator(repo);
1611 Datapos * const meta;
1613 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1614 Datapos *pos = solv_calloc(1, sizeof(*pos));
1615 pos->solvid = SOLVID_META;
1621 %newobject solvables_iter;
1622 Repo_solvable_iterator *solvables_iter() {
1623 return new_Repo_solvable_iterator($self);
1626 %newobject add_repodata;
1627 XRepodata *add_repodata(int flags = 0) {
1628 Repodata *rd = repo_add_repodata($self, flags);
1629 return new_XRepodata($self, rd->repodataid);
1632 void create_stubs() {
1634 if (!$self->nrepodata)
1636 data = repo_id2repodata($self, $self->nrepodata - 1);
1637 if (data->state != REPODATA_STUB)
1638 (void)repodata_create_stubs(data);
1641 %rename("iscontiguous?") iscontiguous;
1643 bool iscontiguous() {
1645 for (i = $self->start; i < $self->end; i++)
1646 if ($self->pool->solvables[i].repo != $self)
1650 %newobject first_repodata;
1651 XRepodata *first_repodata() {
1654 if ($self->nrepodata < 2)
1656 /* make sure all repodatas but the first are extensions */
1657 data = repo_id2repodata($self, 1);
1658 if (data->loadcallback)
1660 for (i = 2; i < $self->nrepodata; i++)
1662 data = repo_id2repodata($self, i);
1663 if (!data->loadcallback)
1664 return 0; /* oops, not an extension */
1666 return new_XRepodata($self, 1);
1669 %newobject Selection;
1670 Selection *Selection(int setflags=0) {
1671 Selection *sel = new_Selection($self->pool);
1672 setflags |= SOLVER_SETREPO;
1673 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1677 #ifdef ENABLE_PUBKEY
1678 %newobject find_pubkey;
1679 XSolvable *find_pubkey(const char *keyid) {
1680 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
1684 bool __eq__(Repo *repo) {
1685 return $self == repo;
1687 bool __ne__(Repo *repo) {
1688 return $self != repo;
1690 #if defined(SWIGPERL)
1691 %rename("str") __str__;
1694 const char *__str__() {
1697 return solv_strdup($self->name);
1698 sprintf(buf, "Repo#%d", $self->repoid);
1699 return solv_strdup(buf);
1701 %newobject __repr__;
1702 const char *__repr__() {
1706 sprintf(buf, "<Repo #%d ", $self->repoid);
1707 return solv_dupjoin(buf, $self->name, ">");
1709 sprintf(buf, "<Repo #%d>", $self->repoid);
1710 return solv_strdup(buf);
1714 %extend Dataiterator {
1715 static const int SEARCH_STRING = SEARCH_STRING;
1716 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1717 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1718 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1719 static const int SEARCH_GLOB = SEARCH_GLOB;
1720 static const int SEARCH_REGEX = SEARCH_REGEX;
1721 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1722 static const int SEARCH_FILES = SEARCH_FILES;
1723 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1724 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1726 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1727 Dataiterator *di = solv_calloc(1, sizeof(*di));
1728 dataiterator_init(di, pool, repo, p, key, match, flags);
1732 dataiterator_free($self);
1735 #if defined(SWIGPYTHON)
1736 %newobject __iter__;
1737 Dataiterator *__iter__() {
1739 ndi = solv_calloc(1, sizeof(*ndi));
1740 dataiterator_init_clone(ndi, $self);
1744 %rename("next") __next__();
1746 %exception __next__ {
1749 PyErr_SetString(PyExc_StopIteration,"no more matches");
1756 perliter(solv::Dataiterator)
1759 %newobject __next__;
1760 Datamatch *__next__() {
1762 if (!dataiterator_step($self)) {
1765 ndi = solv_calloc(1, sizeof(*ndi));
1766 dataiterator_init_clone(ndi, $self);
1767 dataiterator_strdup(ndi);
1773 while ((d = Dataiterator___next__($self)) != 0) {
1774 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1778 void prepend_keyname(Id key) {
1779 dataiterator_prepend_keyname($self, key);
1781 void skip_solvable() {
1782 dataiterator_skip_solvable($self);
1787 Id lookup_id(Id keyname) {
1788 Pool *pool = $self->repo->pool;
1789 Datapos oldpos = pool->pos;
1792 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1796 const char *lookup_str(Id keyname) {
1797 Pool *pool = $self->repo->pool;
1798 Datapos oldpos = pool->pos;
1801 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1805 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1806 Pool *pool = $self->repo->pool;
1807 Datapos oldpos = pool->pos;
1808 unsigned long long r;
1810 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1814 bool lookup_void(Id keyname) {
1815 Pool *pool = $self->repo->pool;
1816 Datapos oldpos = pool->pos;
1819 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1823 %newobject lookup_checksum;
1824 Chksum *lookup_checksum(Id keyname) {
1825 Pool *pool = $self->repo->pool;
1826 Datapos oldpos = pool->pos;
1828 const unsigned char *b;
1830 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1832 return solv_chksum_create_from_bin(type, b);
1834 const char *lookup_deltaseq() {
1835 Pool *pool = $self->repo->pool;
1836 Datapos oldpos = pool->pos;
1839 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1841 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1842 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1847 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1848 Pool *pool = $self->repo->pool;
1849 Datapos oldpos = pool->pos;
1852 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1856 Queue lookup_idarray(Id keyname) {
1857 Pool *pool = $self->repo->pool;
1858 Datapos oldpos = pool->pos;
1862 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1866 %newobject Dataiterator;
1867 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1868 Pool *pool = $self->repo->pool;
1869 Datapos oldpos = pool->pos;
1872 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1880 dataiterator_free($self);
1883 %newobject solvable;
1884 XSolvable * const solvable;
1886 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1887 return new_XSolvable(di->pool, di->solvid);
1891 return $self->key->name;
1893 const char *key_idstr() {
1894 return pool_id2str($self->pool, $self->key->name);
1897 return $self->key->type;
1899 const char *type_idstr() {
1900 return pool_id2str($self->pool, $self->key->type);
1903 return $self->kv.id;
1905 const char *idstr() {
1906 return pool_id2str($self->pool, $self->kv.id);
1909 return $self->kv.str;
1911 BinaryBlob binary() {
1915 if ($self->key->type == REPOKEY_TYPE_BINARY)
1917 bl.data = $self->kv.str;
1918 bl.len = $self->kv.num;
1920 else if ((bl.len = solv_chksum_len($self->key->type)) != 0)
1921 bl.data = $self->kv.str;
1924 unsigned long long num() {
1925 if ($self->key->type == REPOKEY_TYPE_NUM)
1926 return SOLV_KV_NUM64(&$self->kv);
1927 return $self->kv.num;
1930 return $self->kv.num2;
1934 Pool *pool = $self->pool;
1935 Datapos *pos, oldpos = pool->pos;
1936 dataiterator_setpos($self);
1937 pos = solv_calloc(1, sizeof(*pos));
1942 %newobject parentpos;
1943 Datapos *parentpos() {
1944 Pool *pool = $self->pool;
1945 Datapos *pos, oldpos = pool->pos;
1946 dataiterator_setpos_parent($self);
1947 pos = solv_calloc(1, sizeof(*pos));
1952 #if defined(SWIGPERL)
1953 %rename("str") __str__;
1955 const char *__str__() {
1956 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1958 return $self->kv.str;
1962 %extend Pool_solvable_iterator {
1963 Pool_solvable_iterator(Pool *pool) {
1964 Pool_solvable_iterator *s;
1965 s = solv_calloc(1, sizeof(*s));
1969 #if defined(SWIGPYTHON)
1970 %newobject __iter__;
1971 Pool_solvable_iterator *__iter__() {
1972 Pool_solvable_iterator *s;
1973 s = solv_calloc(1, sizeof(*s));
1978 %rename("next") __next__();
1980 %exception __next__ {
1983 PyErr_SetString(PyExc_StopIteration,"no more matches");
1990 perliter(solv::Pool_solvable_iterator)
1992 %newobject __next__;
1993 XSolvable *__next__() {
1994 Pool *pool = $self->pool;
1995 if ($self->id >= pool->nsolvables)
1997 while (++$self->id < pool->nsolvables)
1998 if (pool->solvables[$self->id].repo)
1999 return new_XSolvable(pool, $self->id);
2005 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2006 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2010 %newobject __getitem__;
2011 XSolvable *__getitem__(Id key) {
2012 Pool *pool = $self->pool;
2013 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2014 return new_XSolvable(pool, key);
2018 return $self->pool->nsolvables;
2022 %extend Pool_repo_iterator {
2023 Pool_repo_iterator(Pool *pool) {
2024 Pool_repo_iterator *s;
2025 s = solv_calloc(1, sizeof(*s));
2029 #if defined(SWIGPYTHON)
2030 %newobject __iter__;
2031 Pool_repo_iterator *__iter__() {
2032 Pool_repo_iterator *s;
2033 s = solv_calloc(1, sizeof(*s));
2038 %rename("next") __next__();
2040 %exception __next__ {
2043 PyErr_SetString(PyExc_StopIteration,"no more matches");
2048 %newobject __next__;
2050 Pool *pool = $self->pool;
2051 if ($self->id >= pool->nrepos)
2053 while (++$self->id < pool->nrepos) {
2054 Repo *r = pool_id2repo(pool, $self->id);
2063 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2064 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
2068 Repo *__getitem__(Id key) {
2069 Pool *pool = $self->pool;
2070 if (key > 0 && key < pool->nrepos)
2071 return pool_id2repo(pool, key);
2075 return $self->pool->nrepos;
2079 %extend Repo_solvable_iterator {
2080 Repo_solvable_iterator(Repo *repo) {
2081 Repo_solvable_iterator *s;
2082 s = solv_calloc(1, sizeof(*s));
2086 #if defined(SWIGPYTHON)
2087 %newobject __iter__;
2088 Repo_solvable_iterator *__iter__() {
2089 Repo_solvable_iterator *s;
2090 s = solv_calloc(1, sizeof(*s));
2095 %rename("next") __next__();
2097 %exception __next__ {
2100 PyErr_SetString(PyExc_StopIteration,"no more matches");
2105 %newobject __next__;
2106 XSolvable *__next__() {
2107 Repo *repo = $self->repo;
2108 Pool *pool = repo->pool;
2109 if (repo->start > 0 && $self->id < repo->start)
2110 $self->id = repo->start - 1;
2111 if ($self->id >= repo->end)
2113 while (++$self->id < repo->end)
2114 if (pool->solvables[$self->id].repo == repo)
2115 return new_XSolvable(pool, $self->id);
2121 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2122 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2126 %newobject __getitem__;
2127 XSolvable *__getitem__(Id key) {
2128 Repo *repo = $self->repo;
2129 Pool *pool = repo->pool;
2130 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2131 return new_XSolvable(pool, key);
2135 return $self->repo->pool->nsolvables;
2140 Dep(Pool *pool, Id id) {
2144 s = solv_calloc(1, sizeof(*s));
2150 Dep *Rel(int flags, DepId evrid, bool create=1) {
2151 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2154 return new_Dep($self->pool, id);
2156 %newobject Selection_name;
2157 Selection *Selection_name(int setflags=0) {
2158 Selection *sel = new_Selection($self->pool);
2159 if (ISRELDEP($self->id)) {
2160 Reldep *rd = GETRELDEP($self->pool, $self->id);
2161 if (rd->flags == REL_EQ) {
2162 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2163 if (ISRELDEP(rd->name))
2164 rd = GETRELDEP($self->pool, rd->name);
2166 if (rd->flags == REL_ARCH)
2167 setflags |= SOLVER_SETARCH;
2169 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2172 %newobject Selection_provides;
2173 Selection *Selection_provides(int setflags=0) {
2174 Selection *sel = new_Selection($self->pool);
2175 if (ISRELDEP($self->id)) {
2176 Reldep *rd = GETRELDEP($self->pool, $self->id);
2177 if (rd->flags == REL_ARCH)
2178 setflags |= SOLVER_SETARCH;
2180 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2184 return pool_dep2str($self->pool, $self->id);
2186 bool __eq__(Dep *s) {
2187 return $self->pool == s->pool && $self->id == s->id;
2189 bool __ne__(Dep *s) {
2190 return !Dep___eq__($self, s);
2192 #if defined(SWIGPERL)
2193 %rename("str") __str__;
2195 const char *__str__() {
2196 return pool_dep2str($self->pool, $self->id);
2198 %newobject __repr__;
2199 const char *__repr__() {
2201 sprintf(buf, "<Id #%d ", $self->id);
2202 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2207 XSolvable(Pool *pool, Id id) {
2209 if (!id || id >= pool->nsolvables)
2211 s = solv_calloc(1, sizeof(*s));
2217 return pool_solvid2str($self->pool, $self->id);
2219 const char *lookup_str(Id keyname) {
2220 return pool_lookup_str($self->pool, $self->id, keyname);
2222 Id lookup_id(Id keyname) {
2223 return pool_lookup_id($self->pool, $self->id, keyname);
2225 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2226 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2228 bool lookup_void(Id keyname) {
2229 return pool_lookup_void($self->pool, $self->id, keyname);
2231 %newobject lookup_checksum;
2232 Chksum *lookup_checksum(Id keyname) {
2234 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2235 return solv_chksum_create_from_bin(type, b);
2237 Queue lookup_idarray(Id keyname, Id marker = -1) {
2238 Solvable *s = $self->pool->solvables + $self->id;
2241 solvable_lookup_deparray(s, keyname, &r, marker);
2244 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2245 %newobject lookup_deparray;
2246 Queue lookup_deparray(Id keyname, Id marker = -1) {
2247 Solvable *s = $self->pool->solvables + $self->id;
2250 solvable_lookup_deparray(s, keyname, &r, marker);
2253 const char *lookup_location(unsigned int *OUTPUT) {
2254 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2256 %newobject Dataiterator;
2257 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2258 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2261 %rename("installable?") installable;
2263 bool installable() {
2264 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2267 %rename("isinstalled?") isinstalled;
2269 bool isinstalled() {
2270 Pool *pool = $self->pool;
2271 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2276 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2277 Pool *pool = xs->pool;
2278 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2280 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2281 Pool *pool = xs->pool;
2282 return pool_id2str(pool, pool->solvables[xs->id].name);
2287 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2288 xs->pool->solvables[xs->id].name = nameid;
2290 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2291 return xs->pool->solvables[xs->id].name;
2296 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2297 Pool *pool = xs->pool;
2298 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2300 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2301 Pool *pool = xs->pool;
2302 return pool_id2str(pool, pool->solvables[xs->id].evr);
2307 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2308 xs->pool->solvables[xs->id].evr = evrid;
2310 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2311 return xs->pool->solvables[xs->id].evr;
2316 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2317 Pool *pool = xs->pool;
2318 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2320 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2321 Pool *pool = xs->pool;
2322 return pool_id2str(pool, pool->solvables[xs->id].arch);
2327 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2328 xs->pool->solvables[xs->id].arch = archid;
2330 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2331 return xs->pool->solvables[xs->id].arch;
2336 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2337 Pool *pool = xs->pool;
2338 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2340 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2341 Pool *pool = xs->pool;
2342 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2347 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2348 xs->pool->solvables[xs->id].vendor = vendorid;
2350 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2351 return xs->pool->solvables[xs->id].vendor;
2356 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2357 return xs->pool->solvables[xs->id].repo;
2361 /* old interface, please use the generic add_deparray instead */
2362 void add_provides(DepId id, Id marker = -1) {
2363 Solvable *s = $self->pool->solvables + $self->id;
2364 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2365 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2367 void add_obsoletes(DepId id) {
2368 Solvable *s = $self->pool->solvables + $self->id;
2369 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2371 void add_conflicts(DepId id) {
2372 Solvable *s = $self->pool->solvables + $self->id;
2373 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2375 void add_requires(DepId id, Id marker = -1) {
2376 Solvable *s = $self->pool->solvables + $self->id;
2377 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2378 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2380 void add_recommends(DepId id) {
2381 Solvable *s = $self->pool->solvables + $self->id;
2382 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2384 void add_suggests(DepId id) {
2385 Solvable *s = $self->pool->solvables + $self->id;
2386 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2388 void add_supplements(DepId id) {
2389 Solvable *s = $self->pool->solvables + $self->id;
2390 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2392 void add_enhances(DepId id) {
2393 Solvable *s = $self->pool->solvables + $self->id;
2394 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2397 void unset(Id keyname) {
2398 Solvable *s = $self->pool->solvables + $self->id;
2399 repo_unset(s->repo, $self->id, keyname);
2402 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2403 Solvable *s = $self->pool->solvables + $self->id;
2404 solvable_add_deparray(s, keyname, id, marker);
2407 %newobject Selection;
2408 Selection *Selection(int setflags=0) {
2409 Selection *sel = new_Selection($self->pool);
2410 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2414 bool __eq__(XSolvable *s) {
2415 return $self->pool == s->pool && $self->id == s->id;
2417 bool __ne__(XSolvable *s) {
2418 return !XSolvable___eq__($self, s);
2420 #if defined(SWIGPERL)
2421 %rename("str") __str__;
2423 const char *__str__() {
2424 return pool_solvid2str($self->pool, $self->id);
2426 %newobject __repr__;
2427 const char *__repr__() {
2429 sprintf(buf, "<Solvable #%d ", $self->id);
2430 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2435 Problem(Solver *solv, Id id) {
2437 p = solv_calloc(1, sizeof(*p));
2442 %newobject findproblemrule;
2443 XRule *findproblemrule() {
2444 Id r = solver_findproblemrule($self->solv, $self->id);
2445 return new_XRule($self->solv, r);
2447 %newobject findallproblemrules;
2448 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2449 Queue findallproblemrules(int unfiltered=0) {
2450 Solver *solv = $self->solv;
2455 solver_findallproblemrules(solv, $self->id, &q);
2458 for (i = j = 0; i < q.count; i++)
2460 SolverRuleinfo rclass;
2461 probr = q.elements[i];
2462 rclass = solver_ruleclass(solv, probr);
2463 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2465 q.elements[j++] = probr;
2468 queue_truncate(&q, j);
2472 int solution_count() {
2473 return solver_solution_count($self->solv, $self->id);
2475 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2476 %newobject solutions;
2481 cnt = solver_solution_count($self->solv, $self->id);
2482 for (i = 1; i <= cnt; i++)
2486 #if defined(SWIGPERL)
2487 %rename("str") __str__;
2489 const char *__str__() {
2490 return solver_problem2str($self->solv, $self->id);
2495 Solution(Problem *p, Id id) {
2497 s = solv_calloc(1, sizeof(*s));
2499 s->problemid = p->id;
2503 int element_count() {
2504 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2507 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2508 %newobject elements;
2509 Queue elements(bool expandreplaces=0) {
2513 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2514 for (i = 1; i <= cnt; i++)
2517 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2519 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2525 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2526 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2528 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2529 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2530 queue_push2(&q, p, rp);
2532 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2533 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2534 queue_push2(&q, p, rp);
2536 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2537 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2538 queue_push2(&q, p, rp);
2540 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2541 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2542 queue_push2(&q, p, rp);
2547 queue_push2(&q, i, type);
2548 queue_push2(&q, p, rp);
2554 %extend Solutionelement {
2555 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2557 e = solv_calloc(1, sizeof(*e));
2559 e->problemid = problemid;
2571 if (p == SOLVER_SOLUTION_ERASE)
2576 else if (p == SOLVER_SOLUTION_REPLACE)
2581 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2582 illegal = POLICY_ILLEGAL_DOWNGRADE;
2583 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2584 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2585 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2586 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2587 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2588 illegal = POLICY_ILLEGAL_NAMECHANGE;
2590 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);
2591 return solver_solutionelement2str($self->solv, p, rp);
2593 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2594 %newobject replaceelements;
2595 Queue replaceelements() {
2600 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2603 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2604 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2605 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2606 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2607 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2608 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2609 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2610 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2611 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2613 queue_push(&q, $self->type);
2616 int illegalreplace() {
2617 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2619 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2621 %newobject solvable;
2622 XSolvable * const solvable;
2623 %newobject replacement;
2624 XSolvable * const replacement;
2627 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2628 return new_XSolvable(e->solv->pool, e->p);
2630 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2631 return new_XSolvable(e->solv->pool, e->rp);
2633 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2634 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2636 return (e->p - 1) / 2;
2641 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2642 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2643 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2644 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2645 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2646 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)
2647 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2648 if ($self->type == SOLVER_SOLUTION_ERASE)
2649 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2655 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2656 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2657 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2658 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2659 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2660 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2661 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2662 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2663 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2664 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2665 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2666 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2667 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2668 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2669 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2670 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2671 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2672 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2673 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2674 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2675 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2676 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2678 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2679 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2680 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2681 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2682 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2683 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2684 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2685 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2686 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2687 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2688 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2690 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2691 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2692 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2693 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2695 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2696 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2697 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2698 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2699 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2700 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2701 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2702 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2703 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2704 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2705 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2706 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2708 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
2709 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
2710 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
2711 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
2712 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
2713 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
2714 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
2715 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
2716 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
2717 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
2718 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
2724 int set_flag(int flag, int value) {
2725 return solver_set_flag($self, flag, value);
2727 int get_flag(int flag) {
2728 return solver_get_flag($self, flag);
2730 #if defined(SWIGPYTHON)
2732 def solve(self, jobs):
2734 for job in jobs: j += [job.how, job.what]
2735 return self.solve_helper(j)
2738 #if defined(SWIGPERL)
2740 sub solv::Solver::solve {
2741 my ($self, $jobs) = @_;
2742 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2743 return $self->solve_helper(\@j);
2747 #if defined(SWIGRUBY)
2750 "class Solv::Solver\n"
2751 " def solve(jobs)\n"
2753 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2754 " solve_helper(jl)\n"
2760 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2761 %newobject solve_helper;
2762 Queue solve_helper(Queue jobs) {
2766 solver_solve($self, &jobs);
2767 cnt = solver_problem_count($self);
2768 for (i = 1; i <= cnt; i++)
2772 %newobject transaction;
2773 Transaction *transaction() {
2774 return solver_create_transaction($self);
2777 int describe_decision(XSolvable *s, XRule **OUTPUT) {
2779 int reason = solver_describe_decision($self, s->id, &ruleid);
2780 *OUTPUT = new_XRule($self, ruleid);
2785 %extend Transaction {
2786 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2787 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2788 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2789 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2790 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2791 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2792 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2793 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2794 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2795 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2796 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2797 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2798 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2799 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2800 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2801 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2802 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2803 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2804 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2805 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2806 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2807 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2808 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2809 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2810 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2811 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2812 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2813 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2815 transaction_free($self);
2818 %rename("isempty?") isempty;
2821 return $self->steps.count == 0;
2824 %newobject othersolvable;
2825 XSolvable *othersolvable(XSolvable *s) {
2826 Id op = transaction_obs_pkg($self, s->id);
2827 return new_XSolvable($self->pool, op);
2830 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2831 %newobject allothersolvables;
2832 Queue allothersolvables(XSolvable *s) {
2835 transaction_all_obs_pkgs($self, s->id, &q);
2839 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2840 %newobject classify;
2841 Queue classify(int mode = 0) {
2844 transaction_classify($self, mode, &q);
2848 # deprecated, use newsolvables instead
2849 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2850 %newobject newpackages;
2851 Queue newpackages() {
2855 cut = transaction_installedresult(self, &q);
2856 queue_truncate(&q, cut);
2860 # deprecated, use keptsolvables instead
2861 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2862 %newobject keptpackages;
2863 Queue keptpackages() {
2867 cut = transaction_installedresult(self, &q);
2869 queue_deleten(&q, 0, cut);
2873 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2874 %newobject newsolvables;
2875 Queue newsolvables() {
2879 cut = transaction_installedresult(self, &q);
2880 queue_truncate(&q, cut);
2884 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2885 %newobject keptsolvables;
2886 Queue keptsolvables() {
2890 cut = transaction_installedresult(self, &q);
2892 queue_deleten(&q, 0, cut);
2896 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2900 queue_init_clone(&q, &$self->steps);
2904 int steptype(XSolvable *s, int mode) {
2905 return transaction_type($self, s->id, mode);
2907 int calc_installsizechange() {
2908 return transaction_calc_installsizechange($self);
2910 void order(int flags=0) {
2911 transaction_order($self, flags);
2915 %extend TransactionClass {
2916 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2917 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2918 cl->transaction = trans;
2922 cl->fromid = fromid;
2926 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2927 %newobject solvables;
2931 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2934 const char * const fromstr;
2935 const char * const tostr;
2937 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
2938 return pool_id2str(cl->transaction->pool, cl->fromid);
2940 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
2941 return pool_id2str(cl->transaction->pool, cl->toid);
2947 XRule(Solver *solv, Id id) {
2950 XRule *xr = solv_calloc(1, sizeof(*xr));
2957 SWIGINTERN int XRule_type_get(XRule *xr) {
2958 return solver_ruleclass(xr->solv, xr->id);
2963 Id type, source, target, dep;
2964 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2965 return new_Ruleinfo($self, type, source, target, dep);
2967 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2968 %newobject allinfos;
2972 solver_allruleinfos($self->solv, $self->id, &q);
2976 bool __eq__(XRule *xr) {
2977 return $self->solv == xr->solv && $self->id == xr->id;
2979 bool __ne__(XRule *xr) {
2980 return !XRule___eq__($self, xr);
2982 %newobject __repr__;
2983 const char *__repr__() {
2985 sprintf(buf, "<Rule #%d>", $self->id);
2986 return solv_strdup(buf);
2991 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
2992 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2996 ri->source = source;
2997 ri->target = target;
2998 ri->dep_id = dep_id;
3001 %newobject solvable;
3002 XSolvable * const solvable;
3003 %newobject othersolvable;
3004 XSolvable * const othersolvable;
3008 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3009 return new_XSolvable(ri->solv->pool, ri->source);
3011 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3012 return new_XSolvable(ri->solv->pool, ri->target);
3014 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3015 return new_Dep(ri->solv->pool, ri->dep_id);
3018 const char *problemstr() {
3019 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3024 XRepodata(Repo *repo, Id id) {
3025 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3031 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3033 void set_id(Id solvid, Id keyname, DepId id) {
3034 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3036 void set_str(Id solvid, Id keyname, const char *str) {
3037 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3039 void set_poolstr(Id solvid, Id keyname, const char *str) {
3040 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3042 void add_idarray(Id solvid, Id keyname, DepId id) {
3043 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3045 void add_flexarray(Id solvid, Id keyname, Id handle) {
3046 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3048 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3049 const unsigned char *buf = solv_chksum_get(chksum, 0);
3051 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3053 const char *lookup_str(Id solvid, Id keyname) {
3054 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3056 Queue lookup_idarray(Id solvid, Id keyname) {
3059 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3062 %newobject lookup_checksum;
3063 Chksum *lookup_checksum(Id solvid, Id keyname) {
3065 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3066 return solv_chksum_create_from_bin(type, b);
3068 void internalize() {
3069 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3071 void create_stubs() {
3072 Repodata *data = repo_id2repodata($self->repo, $self->id);
3073 data = repodata_create_stubs(data);
3074 $self->id = data->repodataid;
3076 bool write(FILE *fp) {
3077 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3079 bool add_solv(FILE *fp, int flags = 0) {
3080 Repodata *data = repo_id2repodata($self->repo, $self->id);
3081 int r, oldstate = data->state;
3082 data->state = REPODATA_LOADING;
3083 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3084 if (r || data->state == REPODATA_LOADING)
3085 data->state = oldstate;
3088 void extend_to_repo() {
3089 Repodata *data = repo_id2repodata($self->repo, $self->id);
3090 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3092 bool __eq__(XRepodata *xr) {
3093 return $self->repo == xr->repo && $self->id == xr->id;
3095 bool __ne__(XRepodata *xr) {
3096 return !XRepodata___eq__($self, xr);
3098 %newobject __repr__;
3099 const char *__repr__() {
3101 sprintf(buf, "<Repodata #%d>", $self->id);
3102 return solv_strdup(buf);
3106 #ifdef ENABLE_PUBKEY
3109 return solvsig_create(fp);
3112 solvsig_free($self);
3116 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3118 #ifdef ENABLE_PGPVRFY
3120 XSolvable *verify(Repo *repo, Chksum *chksum) {
3121 Id p = solvsig_verify($self, repo, chksum);
3122 return new_XSolvable(repo->pool, p);