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
9 # %rename("to_s") string();
11 ##if defined(SWIGPYTHON)
12 # %rename("__str__") string();
19 %markfunc Pool "mark_Pool";
22 #if defined(SWIGPYTHON)
24 /* Check if is a list */
26 if (PyList_Check($input)) {
27 int size = PyList_Size($input);
29 for (i = 0; i < size; i++) {
30 PyObject *o = PyList_GetItem($input,i);
32 int e = SWIG_AsVal_int(o, &v);
34 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
41 PyErr_SetString(PyExc_TypeError,"not a list");
48 PyObject *o = PyList_New($1.count);
49 for (i = 0; i < $1.count; i++)
50 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
55 %define Queue2Array(type, step, con) %{
57 int cnt = $1.count / step;
58 Id *idp = $1.elements;
59 PyObject *o = PyList_New(cnt);
60 for (i = 0; i < cnt; i++, idp += step)
63 #define result resultx
66 PyList_SetItem(o, i, $result);
83 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
84 SWIG_croak("Argument $argnum is not an array reference.");
85 av = (AV*)SvRV($input);
87 for (i = 0; i <= size; i++) {
88 SV **sv = av_fetch(av, i, 0);
90 int e = SWIG_AsVal_int(*sv, &v);
92 SWIG_croak("list must contain only integers");
98 # av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
99 # $result = newRV_noinc((SV*)o); argvi++;
101 %typemap(out) Queue {
103 if (argvi + $1.count + 1 >= items) {
104 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
106 for (i = 0; i < $1.count; i++)
107 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
111 %define Queue2Array(type, step, con) %{
113 int cnt = $1.count / step;
114 Id *idp = $1.elements;
115 if (argvi + cnt + 1 >= items) {
116 EXTEND(sp, (argvi + cnt + 1) - items + 1);
118 for (i = 0; i < cnt; i++, idp += step)
121 #define result resultx
124 SvREFCNT_inc(ST(argvi - 1));
134 %typemap(arginit) Queue {
137 %typemap(freearg) Queue {
141 #if defined(SWIGRUBY)
146 size = RARRAY_LEN($input);
148 o = RARRAY_PTR($input);
149 for (i = 0; i < size; i++, o++) {
151 int e = SWIG_AsVal_int(*o, &v);
154 SWIG_Error(SWIG_RuntimeError, "list must contain only integers");
160 %typemap(out) Queue {
162 VALUE o = rb_ary_new2($1.count);
163 for (i = 0; i < $1.count; i++)
164 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
168 %typemap(arginit) Queue {
171 %typemap(freearg) Queue {
174 %define Queue2Array(type, step, con) %{
176 int cnt = $1.count / step;
177 Id *idp = $1.elements;
178 VALUE o = rb_ary_new2(cnt);
179 for (i = 0; i < cnt; i++, idp += step)
182 #define result resultx
185 rb_ary_store(o, i, $result);
197 #if defined(SWIGPERL)
199 # work around a swig bug
203 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
205 # ifndef MULTIPLICITY
206 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
208 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
214 %define perliter(class)
217 my $i = ${##class##::ITERATORS}{$_[0]};
219 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
221 $_[0]->__getitem__($_[1]);
224 sub class##::FETCHSIZE {
225 my $i = ${##class##::ITERATORS}{$_[0]};
227 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
237 #define SWIG_PERL_ITERATOR 0x80
239 SWIGRUNTIMEINLINE SV *
240 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
241 SV *result = sv_newmortal();
242 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
247 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
248 stash=SvSTASH(SvRV(obj));
249 if (flags & SWIG_POINTER_OWN) {
251 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
253 gv_init(gv, stash, "OWNER", 5, FALSE);
255 hv_store_ent(hv, obj, newSViv(1), 0);
257 if (flags & SWIG_PERL_ITERATOR) {
259 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
262 gv_init(gv, stash, "ITERATORS", 9, FALSE);
264 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
266 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
268 self=newRV_noinc((SV *)array);
269 sv_setsv(result, self);
270 SvREFCNT_dec((SV *)self);
271 sv_bless(result, stash);
273 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
280 %typemap(out) Perlarray {
281 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
283 %typemap(out) Perliterator {
284 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
287 %typemap(out) Pool_solvable_iterator * = Perlarray;
288 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
289 %typemap(out) Pool_repo_iterator * = Perlarray;
290 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
291 %typemap(out) Repo_solvable_iterator * = Perlarray;
292 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
293 %typemap(out) Dataiterator * = Perliterator;
298 #if defined(SWIGPYTHON)
299 typedef PyObject *AppObjectPtr;
300 %typemap(out) AppObjectPtr {
301 $result = $1 ? $1 : Py_None;
305 #if defined(SWIGPERL)
306 typedef SV *AppObjectPtr;
307 %typemap(in) AppObjectPtr {
308 $1 = SvROK($input) ? SvRV($input) : 0;
310 %typemap(out) AppObjectPtr {
311 $result = $1 ? newRV_inc($1) : newSV(0);
315 #if defined(SWIGRUBY)
316 typedef VALUE AppObjectPtr;
317 %typemap(in) AppObjectPtr {
320 %typemap(out) AppObjectPtr {
330 %fragment("SWIG_AsValFilePtr","header") {}
334 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
338 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
340 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
342 static swig_type_info* desc = 0;
346 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
347 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
349 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
353 ecode = SWIG_AsValFilePtr(obj, val);
354 if (ecode == SWIG_OK)
357 return SWIG_TypeError;
363 %fragment("SWIG_AsValDepId","header") {
367 SWIG_AsValDepId(VALUE obj, int *val) {
369 SWIG_AsValDepId(void *obj, int *val) {
371 static swig_type_info* desc = 0;
374 if (!desc) desc = SWIG_TypeQuery("Dep *");
375 ecode = SWIG_AsVal_int(obj, val);
376 if (SWIG_IsOK(ecode))
378 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
380 *val = vptr ? ((Dep *)vptr)->id : 0;
383 return SWIG_TypeError;
390 %include "typemaps.i"
392 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
393 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
399 #include <sys/stat.h>
400 #include <sys/utsname.h>
401 #include <sys/types.h>
404 /* argh, swig undefs bool for perl */
410 #include "poolarch.h"
413 #include "solverdebug.h"
414 #include "repo_solv.h"
416 #include "selection.h"
418 #include "repo_write.h"
420 #include "repo_rpmdb.h"
422 #ifdef ENABLE_RPMDB_PUBKEYS
423 #include "repo_rpmdb_pubkey.h"
426 #include "repo_deb.h"
429 #include "repo_rpmmd.h"
430 #include "repo_updateinfoxml.h"
431 #include "repo_deltainfoxml.h"
432 #include "repo_repomdxml.h"
434 #ifdef ENABLE_SUSEREPO
435 #include "repo_products.h"
436 #include "repo_susetags.h"
437 #include "repo_content.h"
439 #ifdef ENABLE_MDKREPO
440 #include "repo_mdk.h"
442 #ifdef ENABLE_ARCHREPO
443 #include "repo_arch.h"
445 #include "solv_xfopen.h"
447 /* for old ruby versions */
449 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
452 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
455 #define SOLVER_SOLUTION_ERASE -100
456 #define SOLVER_SOLUTION_REPLACE -101
457 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
458 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
459 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
460 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
462 typedef struct chksum Chksum;
463 typedef void *AppObjectPtr;
489 } Pool_solvable_iterator;
494 } Pool_repo_iterator;
499 } Repo_solvable_iterator;
539 Transaction *transaction;
557 typedef Dataiterator Datamatch;
562 %mixin Dataiterator "Enumerable";
563 %mixin Pool_solvable_iterator "Enumerable";
564 %mixin Pool_repo_iterator "Enumerable";
565 %mixin Repo_solvable_iterator "Enumerable";
573 %constant Id SOLVID_META;
574 %constant Id SOLVID_POS;
576 %constant int REL_EQ;
577 %constant int REL_GT;
578 %constant int REL_LT;
579 %constant int REL_ARCH;
590 # put before pool/repo so we can access the constructor
591 %nodefaultdtor Dataiterator;
592 typedef struct {} Dataiterator;
615 typedef struct {} Pool_solvable_iterator;
616 typedef struct {} Pool_repo_iterator;
617 typedef struct {} Repo_solvable_iterator;
619 %nodefaultctor Datamatch;
620 %nodefaultdtor Datamatch;
627 %nodefaultctor Datapos;
641 AppObjectPtr appdata;
648 const char * const name;
651 int const nsolvables;
652 AppObjectPtr appdata;
655 %nodefaultctor Solver;
656 %nodefaultdtor Solver;
664 %rename(xfopen) solvfp_xfopen;
665 %rename(xfopen_fd) solvfp_xfopen_fd;
667 %nodefaultctor SolvFp;
671 %newobject solvfp_xfopen;
672 %newobject solvfp_xfopen_fd;
674 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
675 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
678 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
682 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
685 sfp = solv_calloc(1, sizeof(SolvFp));
689 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
692 fp = solv_xfopen(fn, mode);
695 sfp = solv_calloc(1, sizeof(SolvFp));
720 %nodefaultctor Transaction;
721 %nodefaultdtor Transaction;
727 Transaction * const transaction;
741 return $self->fp ? fileno($self->fp) : -1;
744 return $self->fp ? dup(fileno($self->fp)) : -1;
749 return fflush($self->fp) == 0;
755 ret = fclose($self->fp) == 0;
762 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
763 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
764 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
765 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
766 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
767 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
768 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
769 static const Id SOLVER_NOOP = SOLVER_NOOP;
770 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
771 static const Id SOLVER_ERASE = SOLVER_ERASE;
772 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
773 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
774 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
775 static const Id SOLVER_LOCK = SOLVER_LOCK;
776 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
777 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
778 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
779 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
780 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
781 static const Id SOLVER_WEAK = SOLVER_WEAK;
782 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
783 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
784 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
785 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
786 static const Id SOLVER_SETEV = SOLVER_SETEV;
787 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
788 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
789 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
790 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
791 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
792 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
793 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
795 Job(Pool *pool, int how, Id what) {
796 Job *job = solv_calloc(1, sizeof(*job));
803 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
804 %newobject solvables;
808 pool_job2solvables($self->pool, &q, $self->how, $self->what);
812 %rename("isemptyupdate?") isemptyupdate;
814 bool isemptyupdate() {
815 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
818 bool __eq__(Job *j) {
819 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
821 bool __ne__(Job *j) {
822 return !Job___eq__($self, j);
824 #if defined(SWIGPERL)
825 %rename("str") __str__;
827 const char *__str__() {
828 return pool_job2str($self->pool, $self->how, $self->what, 0);
830 const char *__repr__() {
831 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
832 return pool_tmpjoin($self->pool, "<Job ", str, ">");
837 static const Id SELECTION_NAME = SELECTION_NAME;
838 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
839 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
840 static const Id SELECTION_CANON = SELECTION_CANON;
841 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
842 static const Id SELECTION_REL = SELECTION_REL;
843 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
844 static const Id SELECTION_GLOB = SELECTION_GLOB;
845 static const Id SELECTION_FLAT = SELECTION_FLAT;
846 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
847 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
848 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
850 Selection(Pool *pool) {
852 s = solv_calloc(1, sizeof(*s));
858 queue_free(&$self->q);
864 void make(const char *name, int flags) {
865 $self->flags = selection_make($self->pool, &$self->q, name, flags);
868 %rename("isempty?") isempty;
871 return $self->q.count == 0;
873 void filter(Selection *lsel) {
874 if ($self->pool != lsel->pool)
875 queue_empty(&$self->q);
877 selection_filter($self->pool, &$self->q, &lsel->q);
879 void add(Selection *lsel) {
880 if ($self->pool == lsel->pool)
882 selection_add($self->pool, &$self->q, &lsel->q);
883 $self->flags |= lsel->flags;
886 void add_raw(Id how, Id what) {
887 queue_push2(&$self->q, how, what);
889 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
891 Queue jobs(int flags) {
894 queue_init_clone(&q, &$self->q);
895 for (i = 0; i < q.count; i += 2)
896 q.elements[i] |= flags;
900 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
901 %newobject solvables;
905 selection_solvables($self->pool, &$self->q, &q);
909 #if defined(SWIGPERL)
910 %rename("str") __str__;
912 const char *__str__() {
913 return pool_selection2str($self->pool, &$self->q, 0);
915 const char *__repr__() {
916 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
917 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
923 return (Chksum *)solv_chksum_create(type);
925 Chksum(Id type, const char *hex) {
926 unsigned char buf[64];
927 int l = solv_chksum_len(type);
930 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
932 return (Chksum *)solv_chksum_create_from_bin(type, buf);
935 solv_chksum_free($self, 0);
939 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
940 return solv_chksum_get_type(chksum);
943 void add(const char *str) {
944 solv_chksum_add($self, str, strlen((char *)str));
946 void add_fp(FILE *fp) {
949 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
950 solv_chksum_add($self, buf, l);
951 rewind(fp); /* convenience */
953 void add_fd(int fd) {
956 while ((l = read(fd, buf, sizeof(buf))) > 0)
957 solv_chksum_add($self, buf, l);
958 lseek(fd, 0, 0); /* convenience */
960 void add_stat(const char *filename) {
962 if (stat(filename, &stb))
963 memset(&stb, 0, sizeof(stb));
964 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
965 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
966 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
967 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
969 void add_fstat(int fd) {
972 memset(&stb, 0, sizeof(stb));
973 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
974 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
975 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
976 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
980 const unsigned char *b;
981 b = solv_chksum_get($self, &l);
982 return cdata_void((void *)b, l);
987 const unsigned char *b;
990 b = solv_chksum_get($self, &l);
991 ret = solv_malloc(2 * l + 1);
992 solv_bin2hex(b, l, ret);
996 bool __eq__(Chksum *chk) {
998 const unsigned char *b, *bo;
1001 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1003 b = solv_chksum_get($self, &l);
1004 bo = solv_chksum_get(chk, 0);
1005 return memcmp(b, bo, l) == 0;
1007 bool __ne__(Chksum *chk) {
1008 return !Chksum___eq__($self, chk);
1010 #if defined(SWIGRUBY)
1011 %rename("to_s") __str__;
1012 %rename("inspect") __repr__;
1014 #if defined(SWIGPERL)
1015 %rename("str") __str__;
1018 const char *__str__() {
1021 if (solv_chksum_isfinished($self))
1022 h = Chksum_hex($self);
1023 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1024 solv_free((void *)h);
1027 %newobject __repr__;
1028 const char *__repr__() {
1029 const char *h = Chksum___str__($self);
1030 const char *str = solv_dupjoin("<Chksum ", h, ">");
1031 solv_free((void *)h);
1038 Pool *pool = pool_create();
1043 void set_debuglevel(int level) {
1044 pool_setdebuglevel($self, level);
1046 int set_flag(int flag, int value) {
1047 return pool_set_flag($self, flag, value);
1049 int get_flag(int flag) {
1050 return pool_get_flag($self, flag);
1052 void set_rootdir(const char *rootdir) {
1053 pool_set_rootdir($self, rootdir);
1055 const char *get_rootdir(int flag) {
1056 return pool_get_rootdir($self);
1058 #if defined(SWIGPYTHON)
1060 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1061 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1062 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1063 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1068 return 0; /* exception */
1069 ecode = SWIG_AsVal_int(result, &vresult);
1071 return SWIG_IsOK(ecode) ? vresult : 0;
1074 void set_loadcallback(PyObject *callable) {
1075 if ($self->loadcallback == loadcallback) {
1076 PyObject *obj = $self->loadcallbackdata;
1080 Py_INCREF(callable);
1082 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1085 #if defined(SWIGPERL)
1087 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1091 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1096 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1098 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1108 void set_loadcallback(SV *callable) {
1109 if ($self->loadcallback == loadcallback)
1110 SvREFCNT_dec($self->loadcallbackdata);
1112 SvREFCNT_inc(callable);
1113 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1117 #if defined(SWIGRUBY)
1119 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1120 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1121 VALUE callable = (VALUE)d;
1122 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1123 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1124 return res == Qtrue;
1126 SWIGINTERN void mark_Pool(void *ptr) {
1128 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1129 VALUE callable = (VALUE)pool->loadcallbackdata;
1130 rb_gc_mark(callable);
1134 %typemap(in, numinputs=0) VALUE callable {
1135 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1137 void set_loadcallback(VALUE callable) {
1138 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1143 Pool_set_loadcallback($self, 0);
1146 Id str2id(const char *str, bool create=1) {
1147 return pool_str2id($self, str, create);
1149 Dep *Dep(const char *str, bool create=1) {
1150 Id id = pool_str2id($self, str, create);
1151 return new_Dep($self, id);
1153 const char *id2str(Id id) {
1154 return pool_id2str($self, id);
1156 const char *dep2str(Id id) {
1157 return pool_dep2str($self, id);
1159 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1160 return pool_rel2id($self, name, evr, flags, create);
1162 Id id2langid(Id id, const char *lang, bool create=1) {
1163 return pool_id2langid($self, id, lang, create);
1165 void setarch(const char *arch = 0) {
1174 pool_setarch($self, arch);
1176 Repo *add_repo(const char *name) {
1177 return repo_create($self, name);
1179 const char *lookup_str(Id entry, Id keyname) {
1180 return pool_lookup_str($self, entry, keyname);
1182 Id lookup_id(Id entry, Id keyname) {
1183 return pool_lookup_id($self, entry, keyname);
1185 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1186 return pool_lookup_num($self, entry, keyname, notfound);
1188 bool lookup_void(Id entry, Id keyname) {
1189 return pool_lookup_void($self, entry, keyname);
1191 %newobject lookup_checksum;
1192 Chksum *lookup_checksum(Id entry, Id keyname) {
1194 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1195 return solv_chksum_create_from_bin(type, b);
1198 %newobject Dataiterator;
1199 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1200 return new_Dataiterator($self, 0, p, key, match, flags);
1202 const char *solvid2str(Id solvid) {
1203 return pool_solvid2str($self, solvid);
1205 void addfileprovides() {
1206 pool_addfileprovides($self);
1208 Queue addfileprovides_queue() {
1211 pool_addfileprovides_queue($self, &r, 0);
1214 void createwhatprovides() {
1215 pool_createwhatprovides($self);
1218 XSolvable *id2solvable(Id id) {
1219 return new_XSolvable($self, id);
1221 %newobject solvables;
1222 Pool_solvable_iterator * const solvables;
1224 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1225 return new_Pool_solvable_iterator(pool);
1228 %newobject solvables_iter;
1229 Pool_solvable_iterator * solvables_iter() {
1230 return new_Pool_solvable_iterator($self);
1233 Repo *id2repo(Id id) {
1234 if (id < 1 || id >= $self->nrepos)
1236 return pool_id2repo($self, id);
1240 Pool_repo_iterator * const repos;
1242 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1243 return new_Pool_repo_iterator(pool);
1246 %newobject repos_iter;
1247 Pool_repo_iterator * repos_iter() {
1248 return new_Pool_repo_iterator($self);
1253 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1254 pool_set_installed(pool, installed);
1256 Repo *Pool_installed_get(Pool *pool) {
1257 return pool->installed;
1261 Queue matchprovidingids(const char *match, int flags) {
1267 for (id = 1; id < pool->ss.nstrings; id++)
1268 if (pool->whatprovides[id])
1272 if (!datamatcher_init(&ma, match, flags)) {
1273 for (id = 1; id < pool->ss.nstrings; id++)
1274 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1276 datamatcher_free(&ma);
1282 Job *Job(int how, Id what) {
1283 return new_Job($self, how, what);
1286 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1287 %newobject whatprovides;
1288 Queue whatprovides(DepId dep) {
1293 FOR_PROVIDES(p, pp, dep)
1298 Id towhatprovides(Queue q) {
1299 return pool_queuetowhatprovides($self, &q);
1303 %rename("isknownarch?") isknownarch;
1305 bool isknownarch(DepId id) {
1307 if (!id || id == ID_EMPTY)
1309 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1311 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1318 return solver_create($self);
1321 %newobject Selection;
1322 Selection *Selection() {
1323 return new_Selection($self);
1325 %newobject Selection_all;
1326 Selection *Selection_all(int setflags=0) {
1327 Selection *sel = new_Selection($self);
1328 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1332 Selection *select(const char *name, int flags) {
1333 Selection *sel = new_Selection($self);
1334 sel->flags = selection_make($self, &sel->q, name, flags);
1338 void setpooljobs_helper(Queue jobs) {
1339 queue_free(&$self->pooljobs);
1340 queue_init_clone(&$self->pooljobs, &jobs);
1342 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1343 %newobject getpooljobs;
1344 Queue getpooljobs() {
1346 queue_init_clone(&q, &$self->pooljobs);
1350 #if defined(SWIGPYTHON)
1352 def setpooljobs(self, jobs):
1354 for job in jobs: j += [job.how, job.what]
1355 self.setpooljobs_helper(j)
1358 #if defined(SWIGPERL)
1360 sub solv::Solver::setpooljobs {
1361 my ($self, $jobs) = @_;
1362 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1363 return $self->setpooljobs_helper(\@j);
1367 #if defined(SWIGRUBY)
1370 "class Solv::Pool\n"
1371 " def setpooljobs(jobs)\n"
1373 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1374 " setpooljobs_helper(jl)\n"
1383 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1384 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1385 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1386 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1387 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1388 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1389 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1390 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1391 #ifdef ENABLE_SUSEREPO
1392 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1395 void free(bool reuseids = 0) {
1396 repo_free($self, reuseids);
1398 void empty(bool reuseids = 0) {
1399 repo_empty($self, reuseids);
1402 %rename("isempty?") isempty;
1405 return !$self->nsolvables;
1407 bool add_solv(const char *name, int flags = 0) {
1408 FILE *fp = fopen(name, "r");
1412 r = repo_add_solv($self, fp, flags);
1416 bool add_solv(FILE *fp, int flags = 0) {
1417 return repo_add_solv($self, fp, flags) == 0;
1420 XSolvable *add_solvable() {
1421 Id solvid = repo_add_solvable($self);
1422 return new_XSolvable($self->pool, solvid);
1426 bool add_rpmdb(int flags = 0) {
1427 return repo_add_rpmdb($self, 0, flags) == 0;
1429 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1430 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1432 Id add_rpm(const char *name, int flags = 0) {
1433 return repo_add_rpm($self, name, flags);
1436 #ifdef ENABLE_RPMDB_PUBKEYS
1437 bool add_rpmdb_pubkeys(int flags = 0) {
1438 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1440 Id add_pubkey(const char *key, int flags = 0) {
1441 return repo_add_pubkey($self, key, flags);
1445 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1446 return repo_add_rpmmd($self, fp, language, flags) == 0;
1448 bool add_repomdxml(FILE *fp, int flags = 0) {
1449 return repo_add_repomdxml($self, fp, flags) == 0;
1451 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1452 return repo_add_updateinfoxml($self, fp, flags) == 0;
1454 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1455 return repo_add_deltainfoxml($self, fp, flags) == 0;
1458 #ifdef ENABLE_DEBIAN
1459 bool add_debdb(int flags = 0) {
1460 return repo_add_debdb($self, flags) == 0;
1462 bool add_debpackages(FILE *fp, int flags = 0) {
1463 return repo_add_debpackages($self, fp, flags) == 0;
1465 Id add_deb(const char *name, int flags = 0) {
1466 return repo_add_deb($self, name, flags);
1469 #ifdef ENABLE_SUSEREPO
1470 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1471 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1473 bool add_content(FILE *fp, int flags = 0) {
1474 return repo_add_content($self, fp, flags) == 0;
1476 bool add_products(const char *proddir, int flags = 0) {
1477 return repo_add_products($self, proddir, flags) == 0;
1480 #ifdef ENABLE_MDKREPO
1481 bool add_mdk(FILE *fp, int flags = 0) {
1482 return repo_add_mdk($self, fp, flags) == 0;
1484 bool add_mdk_info(FILE *fp, int flags = 0) {
1485 return repo_add_mdk_info($self, fp, flags) == 0;
1488 #ifdef ENABLE_ARCHREPO
1489 bool add_arch_repo(FILE *fp, int flags = 0) {
1490 return repo_add_arch_repo($self, fp, flags) == 0;
1492 bool add_arch_local(const char *dir, int flags = 0) {
1493 return repo_add_arch_local($self, dir, flags) == 0;
1495 Id add_arch_pkg(const char *name, int flags = 0) {
1496 return repo_add_arch_pkg($self, name, flags);
1499 void internalize() {
1500 repo_internalize($self);
1502 bool write(FILE *fp) {
1503 return repo_write($self, fp) == 0;
1505 # HACK, remove if no longer needed!
1506 bool write_first_repodata(FILE *fp) {
1507 int oldnrepodata = $self->nrepodata;
1509 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1510 res = repo_write($self, fp);
1511 $self->nrepodata = oldnrepodata;
1515 %newobject Dataiterator;
1516 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1517 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1522 SWIGINTERN Id Repo_id_get(Repo *repo) {
1523 return repo->repoid;
1526 %newobject solvables;
1527 Repo_solvable_iterator * const solvables;
1529 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1530 return new_Repo_solvable_iterator(repo);
1534 Datapos * const meta;
1536 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1537 Datapos *pos = solv_calloc(1, sizeof(*pos));
1538 pos->solvid = SOLVID_META;
1544 %newobject solvables_iter;
1545 Repo_solvable_iterator *solvables_iter() {
1546 return new_Repo_solvable_iterator($self);
1549 XRepodata *add_repodata(int flags = 0) {
1550 Repodata *rd = repo_add_repodata($self, flags);
1551 return new_XRepodata($self, rd->repodataid);
1554 void create_stubs() {
1556 if (!$self->nrepodata)
1558 data = repo_id2repodata($self, $self->nrepodata - 1);
1559 if (data->state != REPODATA_STUB)
1560 repodata_create_stubs(data);
1563 %rename("iscontiguous?") iscontiguous;
1565 bool iscontiguous() {
1567 for (i = $self->start; i < $self->end; i++)
1568 if ($self->pool->solvables[i].repo != $self)
1572 XRepodata *first_repodata() {
1575 if ($self->nrepodata < 2)
1577 /* make sure all repodatas but the first are extensions */
1578 data = repo_id2repodata($self, 1);
1579 if (data->loadcallback)
1581 for (i = 2; i < $self->nrepodata; i++)
1583 data = repo_id2repodata($self, i);
1584 if (!data->loadcallback)
1585 return 0; /* oops, not an extension */
1587 return new_XRepodata($self, 1);
1590 %newobject Selection;
1591 Selection *Selection(int setflags=0) {
1592 Selection *sel = new_Selection($self->pool);
1593 setflags |= SOLVER_SETREPO;
1594 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1598 bool __eq__(Repo *repo) {
1599 return $self == repo;
1601 bool __ne__(Repo *repo) {
1602 return $self != repo;
1604 #if defined(SWIGPERL)
1605 %rename("str") __str__;
1608 const char *__str__() {
1611 return solv_strdup($self->name);
1612 sprintf(buf, "Repo#%d", $self->repoid);
1613 return solv_strdup(buf);
1615 %newobject __repr__;
1616 const char *__repr__() {
1620 sprintf(buf, "<Repo #%d ", $self->repoid);
1621 return solv_dupjoin(buf, $self->name, ">");
1623 sprintf(buf, "<Repo #%d>", $self->repoid);
1624 return solv_strdup(buf);
1628 %extend Dataiterator {
1629 static const int SEARCH_STRING = SEARCH_STRING;
1630 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1631 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1632 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1633 static const int SEARCH_GLOB = SEARCH_GLOB;
1634 static const int SEARCH_REGEX = SEARCH_REGEX;
1635 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1636 static const int SEARCH_FILES = SEARCH_FILES;
1637 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1639 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1640 Dataiterator *di = solv_calloc(1, sizeof(*di));
1641 dataiterator_init(di, pool, repo, p, key, match, flags);
1645 dataiterator_free($self);
1648 #if defined(SWIGPYTHON)
1649 %newobject __iter__;
1650 Dataiterator *__iter__() {
1652 ndi = solv_calloc(1, sizeof(*ndi));
1653 dataiterator_init_clone(ndi, $self);
1656 %rename("next") __next__();
1657 %exception __next__ {
1660 PyErr_SetString(PyExc_StopIteration,"no more matches");
1667 perliter(solv::Dataiterator)
1670 %newobject __next__;
1671 Datamatch *__next__() {
1673 if (!dataiterator_step($self)) {
1676 ndi = solv_calloc(1, sizeof(*ndi));
1677 dataiterator_init_clone(ndi, $self);
1678 dataiterator_strdup(ndi);
1684 while ((d = Dataiterator___next__($self)) != 0) {
1685 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1689 void prepend_keyname(Id key) {
1690 dataiterator_prepend_keyname($self, key);
1692 void skip_solvable() {
1693 dataiterator_skip_solvable($self);
1698 Id lookup_id(Id keyname) {
1699 Pool *pool = $self->repo->pool;
1700 Datapos oldpos = pool->pos;
1703 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1707 const char *lookup_str(Id keyname) {
1708 Pool *pool = $self->repo->pool;
1709 Datapos oldpos = pool->pos;
1712 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1716 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1717 Pool *pool = $self->repo->pool;
1718 Datapos oldpos = pool->pos;
1719 unsigned long long r;
1721 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1725 bool lookup_void(Id keyname) {
1726 Pool *pool = $self->repo->pool;
1727 Datapos oldpos = pool->pos;
1730 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1734 %newobject lookup_checksum;
1735 Chksum *lookup_checksum(Id keyname) {
1736 Pool *pool = $self->repo->pool;
1737 Datapos oldpos = pool->pos;
1739 const unsigned char *b;
1741 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1743 return solv_chksum_create_from_bin(type, b);
1745 const char *lookup_deltaseq() {
1746 Pool *pool = $self->repo->pool;
1747 Datapos oldpos = pool->pos;
1750 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1752 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1753 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1758 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1759 Pool *pool = $self->repo->pool;
1760 Datapos oldpos = pool->pos;
1763 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1771 dataiterator_free($self);
1774 %newobject solvable;
1775 XSolvable * const solvable;
1777 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1778 return new_XSolvable(di->pool, di->solvid);
1782 return $self->key->name;
1784 const char *key_idstr() {
1785 return pool_id2str($self->pool, $self->key->name);
1788 return $self->key->type;
1790 const char *type_idstr() {
1791 return pool_id2str($self->pool, $self->key->type);
1794 return $self->kv.id;
1796 const char *idstr() {
1797 return pool_id2str($self->pool, $self->kv.id);
1800 return $self->kv.str;
1803 return $self->kv.num;
1806 return $self->kv.num2;
1810 Pool *pool = $self->pool;
1811 Datapos *pos, oldpos = pool->pos;
1812 dataiterator_setpos($self);
1813 pos = solv_calloc(1, sizeof(*pos));
1818 %newobject parentpos;
1819 Datapos *parentpos() {
1820 Pool *pool = $self->pool;
1821 Datapos *pos, oldpos = pool->pos;
1822 dataiterator_setpos_parent($self);
1823 pos = solv_calloc(1, sizeof(*pos));
1829 dataiterator_setpos($self);
1831 void setpos_parent() {
1832 dataiterator_setpos_parent($self);
1834 #if defined(SWIGPERL)
1835 %rename("str") __str__;
1837 const char *__str__() {
1838 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1840 return $self->kv.str;
1844 %extend Pool_solvable_iterator {
1845 Pool_solvable_iterator(Pool *pool) {
1846 Pool_solvable_iterator *s;
1847 s = solv_calloc(1, sizeof(*s));
1851 #if defined(SWIGPYTHON)
1852 %newobject __iter__;
1853 Pool_solvable_iterator *__iter__() {
1854 Pool_solvable_iterator *s;
1855 s = solv_calloc(1, sizeof(*s));
1859 %rename("next") __next__();
1860 %exception __next__ {
1863 PyErr_SetString(PyExc_StopIteration,"no more matches");
1870 perliter(solv::Pool_solvable_iterator)
1872 %newobject __next__;
1873 XSolvable *__next__() {
1874 Pool *pool = $self->pool;
1875 if ($self->id >= pool->nsolvables)
1877 while (++$self->id < pool->nsolvables)
1878 if (pool->solvables[$self->id].repo)
1879 return new_XSolvable(pool, $self->id);
1885 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1886 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1890 %newobject __getitem__;
1891 XSolvable *__getitem__(Id key) {
1892 Pool *pool = $self->pool;
1893 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1894 return new_XSolvable(pool, key);
1898 return $self->pool->nsolvables;
1902 %extend Pool_repo_iterator {
1903 Pool_repo_iterator(Pool *pool) {
1904 Pool_repo_iterator *s;
1905 s = solv_calloc(1, sizeof(*s));
1909 #if defined(SWIGPYTHON)
1910 %newobject __iter__;
1911 Pool_repo_iterator *__iter__() {
1912 Pool_repo_iterator *s;
1913 s = solv_calloc(1, sizeof(*s));
1917 %rename("next") __next__();
1918 %exception __next__ {
1921 PyErr_SetString(PyExc_StopIteration,"no more matches");
1926 %newobject __next__;
1928 Pool *pool = $self->pool;
1929 if ($self->id >= pool->nrepos)
1931 while (++$self->id < pool->nrepos) {
1932 Repo *r = pool_id2repo(pool, $self->id);
1941 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1942 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1946 Repo *__getitem__(Id key) {
1947 Pool *pool = $self->pool;
1948 if (key > 0 && key < pool->nrepos)
1949 return pool_id2repo(pool, key);
1953 return $self->pool->nrepos;
1957 %extend Repo_solvable_iterator {
1958 Repo_solvable_iterator(Repo *repo) {
1959 Repo_solvable_iterator *s;
1960 s = solv_calloc(1, sizeof(*s));
1964 #if defined(SWIGPYTHON)
1965 %newobject __iter__;
1966 Repo_solvable_iterator *__iter__() {
1967 Repo_solvable_iterator *s;
1968 s = solv_calloc(1, sizeof(*s));
1972 %rename("next") __next__();
1973 %exception __next__ {
1976 PyErr_SetString(PyExc_StopIteration,"no more matches");
1981 %newobject __next__;
1982 XSolvable *__next__() {
1983 Repo *repo = $self->repo;
1984 Pool *pool = repo->pool;
1985 if (repo->start > 0 && $self->id < repo->start)
1986 $self->id = repo->start - 1;
1987 if ($self->id >= repo->end)
1989 while (++$self->id < repo->end)
1990 if (pool->solvables[$self->id].repo == repo)
1991 return new_XSolvable(pool, $self->id);
1997 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1998 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2002 %newobject __getitem__;
2003 XSolvable *__getitem__(Id key) {
2004 Repo *repo = $self->repo;
2005 Pool *pool = repo->pool;
2006 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2007 return new_XSolvable(pool, key);
2011 return $self->repo->pool->nsolvables;
2016 Dep(Pool *pool, Id id) {
2020 s = solv_calloc(1, sizeof(*s));
2026 Dep *Rel(int flags, DepId evrid, bool create=1) {
2027 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2030 return new_Dep($self->pool, id);
2032 %newobject Selection_name;
2033 Selection *Selection_name(int setflags=0) {
2034 Selection *sel = new_Selection($self->pool);
2035 if (ISRELDEP($self->id)) {
2036 Reldep *rd = GETRELDEP($self->pool, $self->id);
2037 if (rd->flags == REL_EQ) {
2038 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2039 if (ISRELDEP(rd->name))
2040 rd = GETRELDEP($self->pool, rd->name);
2042 if (rd->flags == REL_ARCH)
2043 setflags |= SOLVER_SETARCH;
2045 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2048 %newobject Selection_provides;
2049 Selection *Selection_provides(int setflags=0) {
2050 Selection *sel = new_Selection($self->pool);
2051 if (ISRELDEP($self->id)) {
2052 Reldep *rd = GETRELDEP($self->pool, $self->id);
2053 if (rd->flags == REL_ARCH)
2054 setflags |= SOLVER_SETARCH;
2056 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2060 return pool_dep2str($self->pool, $self->id);
2062 bool __eq__(Dep *s) {
2063 return $self->pool == s->pool && $self->id == s->id;
2065 bool __ne__(Dep *s) {
2066 return !Dep___eq__($self, s);
2068 #if defined(SWIGPERL)
2069 %rename("str") __str__;
2071 const char *__str__() {
2072 return pool_dep2str($self->pool, $self->id);
2074 %newobject __repr__;
2075 const char *__repr__() {
2077 sprintf(buf, "<Id #%d ", $self->id);
2078 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2083 XSolvable(Pool *pool, Id id) {
2085 if (!id || id >= pool->nsolvables)
2087 s = solv_calloc(1, sizeof(*s));
2093 return pool_solvid2str($self->pool, $self->id);
2095 const char *lookup_str(Id keyname) {
2096 return pool_lookup_str($self->pool, $self->id, keyname);
2098 Id lookup_id(Id keyname) {
2099 return pool_lookup_id($self->pool, $self->id, keyname);
2101 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2102 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2104 bool lookup_void(Id keyname) {
2105 return pool_lookup_void($self->pool, $self->id, keyname);
2107 %newobject lookup_checksum;
2108 Chksum *lookup_checksum(Id keyname) {
2110 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2111 return solv_chksum_create_from_bin(type, b);
2113 Queue lookup_idarray(Id keyname, Id marker = -1) {
2114 Solvable *s = $self->pool->solvables + $self->id;
2117 if (marker == -1 || marker == 1) {
2118 if (keyname == SOLVABLE_PROVIDES)
2119 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2120 else if (keyname == SOLVABLE_REQUIRES)
2121 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2125 solvable_lookup_deparray(s, keyname, &r, marker);
2128 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2129 %newobject lookup_deparray;
2130 Queue lookup_deparray(Id keyname, Id marker = -1) {
2131 Solvable *s = $self->pool->solvables + $self->id;
2134 if (marker == -1 || marker == 1) {
2135 if (keyname == SOLVABLE_PROVIDES)
2136 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2137 else if (keyname == SOLVABLE_REQUIRES)
2138 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2142 solvable_lookup_deparray(s, keyname, &r, marker);
2145 const char *lookup_location(unsigned int *OUTPUT) {
2146 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2148 %newobject Dataiterator;
2149 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2150 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2153 %rename("installable?") installable;
2155 bool installable() {
2156 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2159 %rename("isinstalled?") isinstalled;
2161 bool isinstalled() {
2162 Pool *pool = $self->pool;
2163 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2168 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2169 Pool *pool = xs->pool;
2170 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2172 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2173 Pool *pool = xs->pool;
2174 return pool_id2str(pool, pool->solvables[xs->id].name);
2179 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2180 xs->pool->solvables[xs->id].name = nameid;
2182 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2183 return xs->pool->solvables[xs->id].name;
2188 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2189 Pool *pool = xs->pool;
2190 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2192 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2193 Pool *pool = xs->pool;
2194 return pool_id2str(pool, pool->solvables[xs->id].evr);
2199 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2200 xs->pool->solvables[xs->id].evr = evrid;
2202 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2203 return xs->pool->solvables[xs->id].evr;
2208 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2209 Pool *pool = xs->pool;
2210 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2212 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2213 Pool *pool = xs->pool;
2214 return pool_id2str(pool, pool->solvables[xs->id].arch);
2219 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2220 xs->pool->solvables[xs->id].arch = archid;
2222 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2223 return xs->pool->solvables[xs->id].arch;
2228 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2229 Pool *pool = xs->pool;
2230 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2232 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2233 Pool *pool = xs->pool;
2234 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2239 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2240 xs->pool->solvables[xs->id].vendor = vendorid;
2242 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2243 return xs->pool->solvables[xs->id].vendor;
2248 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2249 return xs->pool->solvables[xs->id].repo;
2253 /* old interface, please use the generic add_deparray instead */
2254 void add_provides(DepId id, Id marker = -1) {
2255 Solvable *s = $self->pool->solvables + $self->id;
2256 if (marker == -1 || marker == 1)
2257 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2258 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2260 void add_obsoletes(DepId id) {
2261 Solvable *s = $self->pool->solvables + $self->id;
2262 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2264 void add_conflicts(DepId id) {
2265 Solvable *s = $self->pool->solvables + $self->id;
2266 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2268 void add_requires(DepId id, Id marker = -1) {
2269 Solvable *s = $self->pool->solvables + $self->id;
2270 if (marker == -1 || marker == 1)
2271 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2272 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2274 void add_recommends(DepId id) {
2275 Solvable *s = $self->pool->solvables + $self->id;
2276 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2278 void add_suggests(DepId id) {
2279 Solvable *s = $self->pool->solvables + $self->id;
2280 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2282 void add_supplements(DepId id) {
2283 Solvable *s = $self->pool->solvables + $self->id;
2284 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2286 void add_enhances(DepId id) {
2287 Solvable *s = $self->pool->solvables + $self->id;
2288 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2291 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2292 Solvable *s = $self->pool->solvables + $self->id;
2293 if (marker == -1 || marker == 1) {
2294 if (keyname == SOLVABLE_PROVIDES)
2295 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2296 else if (keyname == SOLVABLE_REQUIRES)
2297 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2301 solvable_add_deparray(s, keyname, id, marker);
2304 %newobject Selection;
2305 Selection *Selection(int setflags=0) {
2306 Selection *sel = new_Selection($self->pool);
2307 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2311 bool __eq__(XSolvable *s) {
2312 return $self->pool == s->pool && $self->id == s->id;
2314 bool __ne__(XSolvable *s) {
2315 return !XSolvable___eq__($self, s);
2317 #if defined(SWIGPERL)
2318 %rename("str") __str__;
2320 const char *__str__() {
2321 return pool_solvid2str($self->pool, $self->id);
2323 %newobject __repr__;
2324 const char *__repr__() {
2326 sprintf(buf, "<Solvable #%d ", $self->id);
2327 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2332 Problem(Solver *solv, Id id) {
2334 p = solv_calloc(1, sizeof(*p));
2339 %newobject findproblemrule;
2340 XRule *findproblemrule() {
2341 Id r = solver_findproblemrule($self->solv, $self->id);
2342 return new_XRule($self->solv, r);
2344 %newobject findallproblemrules;
2345 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2346 Queue findallproblemrules(int unfiltered=0) {
2347 Solver *solv = $self->solv;
2352 solver_findallproblemrules(solv, $self->id, &q);
2355 for (i = j = 0; i < q.count; i++)
2357 SolverRuleinfo rclass;
2358 probr = q.elements[i];
2359 rclass = solver_ruleclass(solv, probr);
2360 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2362 q.elements[j++] = probr;
2365 queue_truncate(&q, j);
2369 int solution_count() {
2370 return solver_solution_count($self->solv, $self->id);
2372 %newobject solutions;
2373 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2378 cnt = solver_solution_count($self->solv, $self->id);
2379 for (i = 1; i <= cnt; i++)
2386 Solution(Problem *p, Id id) {
2388 s = solv_calloc(1, sizeof(*s));
2390 s->problemid = p->id;
2394 int element_count() {
2395 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2398 %newobject elements;
2399 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2400 Queue elements(bool expandreplaces=0) {
2404 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2405 for (i = 1; i <= cnt; i++)
2408 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2410 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2416 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2417 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2419 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2420 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2421 queue_push2(&q, p, rp);
2423 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2424 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2425 queue_push2(&q, p, rp);
2427 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2428 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2429 queue_push2(&q, p, rp);
2431 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2432 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2433 queue_push2(&q, p, rp);
2438 queue_push2(&q, i, type);
2439 queue_push2(&q, p, rp);
2445 %extend Solutionelement {
2446 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2448 e = solv_calloc(1, sizeof(*e));
2450 e->problemid = problemid;
2462 if (p == SOLVER_SOLUTION_ERASE)
2467 else if (p == SOLVER_SOLUTION_REPLACE)
2472 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2473 illegal = POLICY_ILLEGAL_DOWNGRADE;
2474 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2475 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2476 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2477 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2478 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2479 illegal = POLICY_ILLEGAL_NAMECHANGE;
2481 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);
2482 return solver_solutionelement2str($self->solv, p, rp);
2484 %newobject replaceelements;
2485 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2486 Queue replaceelements() {
2491 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2494 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2495 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2496 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2497 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2498 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2499 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2500 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2501 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2502 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2504 queue_push(&q, $self->type);
2507 int illegalreplace() {
2508 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2510 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2512 %newobject solvable;
2513 XSolvable * const solvable;
2514 %newobject replacement;
2515 XSolvable * const replacement;
2518 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2519 return new_XSolvable(e->solv->pool, e->p);
2521 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2522 return new_XSolvable(e->solv->pool, e->rp);
2524 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2525 if (e->type != SOLVER_SOLUTION_JOB)
2527 return (e->p - 1) / 2;
2532 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2533 if ($self->type == SOLVER_SOLUTION_JOB)
2534 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2535 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2536 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2537 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)
2538 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2539 if ($self->type == SOLVER_SOLUTION_ERASE)
2540 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2546 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2547 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2548 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2549 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2550 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2551 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2552 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2553 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2554 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2555 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2556 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2557 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2558 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2559 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2560 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2561 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2562 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2563 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2564 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2565 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2567 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2568 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2569 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2570 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2571 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2572 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2573 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2574 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2575 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2576 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2577 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2579 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2580 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2581 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2582 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2584 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2585 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2586 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2587 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2588 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2589 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2590 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2591 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2592 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2593 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2599 int set_flag(int flag, int value) {
2600 return solver_set_flag($self, flag, value);
2602 int get_flag(int flag) {
2603 return solver_get_flag($self, flag);
2605 #if defined(SWIGPYTHON)
2607 def solve(self, jobs):
2609 for job in jobs: j += [job.how, job.what]
2610 return self.solve_helper(j)
2613 #if defined(SWIGPERL)
2615 sub solv::Solver::solve {
2616 my ($self, $jobs) = @_;
2617 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2618 return $self->solve_helper(\@j);
2622 #if defined(SWIGRUBY)
2625 "class Solv::Solver\n"
2626 " def solve(jobs)\n"
2628 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2629 " solve_helper(jl)\n"
2635 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2636 %newobject solve_helper;
2637 Queue solve_helper(Queue jobs) {
2641 solver_solve($self, &jobs);
2642 cnt = solver_problem_count($self);
2643 for (i = 1; i <= cnt; i++)
2647 %newobject transaction;
2648 Transaction *transaction() {
2649 return solver_create_transaction($self);
2653 %extend Transaction {
2654 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2655 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2656 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2657 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2658 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2659 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2660 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2661 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2662 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2663 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2664 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2665 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2666 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2667 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2668 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2669 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2670 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2671 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2672 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2673 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2674 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2675 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2676 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2677 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2678 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2679 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2680 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2681 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2683 transaction_free($self);
2686 %rename("isempty?") isempty;
2689 return $self->steps.count == 0;
2692 %newobject othersolvable;
2693 XSolvable *othersolvable(XSolvable *s) {
2694 Id op = transaction_obs_pkg($self, s->id);
2695 return new_XSolvable($self->pool, op);
2698 %newobject allothersolvables;
2699 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2700 Queue allothersolvables(XSolvable *s) {
2703 transaction_all_obs_pkgs($self, s->id, &q);
2707 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2708 %newobject classify;
2709 Queue classify(int mode = 0) {
2712 transaction_classify($self, mode, &q);
2716 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2717 %newobject newpackages;
2718 Queue newpackages() {
2722 cut = transaction_installedresult(self, &q);
2723 queue_truncate(&q, cut);
2727 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2728 %newobject keptpackages;
2729 Queue keptpackages() {
2733 cut = transaction_installedresult(self, &q);
2735 queue_deleten(&q, 0, cut);
2739 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2743 queue_init_clone(&q, &$self->steps);
2747 int steptype(XSolvable *s, int mode) {
2748 return transaction_type($self, s->id, mode);
2750 int calc_installsizechange() {
2751 return transaction_calc_installsizechange($self);
2753 void order(int flags) {
2754 transaction_order($self, flags);
2758 %extend TransactionClass {
2759 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2760 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2761 cl->transaction = trans;
2765 cl->fromid = fromid;
2769 %newobject solvables;
2770 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2774 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2779 return new_Dep($self->transaction->pool, $self->fromid);
2783 return new_Dep($self->transaction->pool, $self->toid);
2788 XRule(Solver *solv, Id id) {
2791 XRule *xr = solv_calloc(1, sizeof(*xr));
2797 Id type, source, target, dep;
2798 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2799 return new_Ruleinfo($self, type, source, target, dep);
2801 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2802 %newobject allinfos;
2806 solver_allruleinfos($self->solv, $self->id, &q);
2810 bool __eq__(XRule *xr) {
2811 return $self->solv == xr->solv && $self->id == xr->id;
2813 bool __ne__(XRule *xr) {
2814 return !XRule___eq__($self, xr);
2816 %newobject __repr__;
2817 const char *__repr__() {
2819 sprintf(buf, "<Rule #%d>", $self->id);
2820 return solv_strdup(buf);
2825 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2826 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2830 ri->source = source;
2831 ri->target = target;
2835 XSolvable * const solvable;
2836 XSolvable * const othersolvable;
2838 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2839 return new_XSolvable(ri->solv->pool, ri->source);
2841 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2842 return new_XSolvable(ri->solv->pool, ri->target);
2845 const char *problemstr() {
2846 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2851 XRepodata(Repo *repo, Id id) {
2852 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2858 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2860 void set_id(Id solvid, Id keyname, DepId id) {
2861 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2863 void set_str(Id solvid, Id keyname, const char *str) {
2864 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2866 void set_poolstr(Id solvid, Id keyname, const char *str) {
2867 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2869 void add_idarray(Id solvid, Id keyname, DepId id) {
2870 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2872 void add_flexarray(Id solvid, Id keyname, Id handle) {
2873 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2875 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2876 const unsigned char *buf = solv_chksum_get(chksum, 0);
2878 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2880 const char *lookup_str(Id solvid, Id keyname) {
2881 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2883 Queue lookup_idarray(Id solvid, Id keyname) {
2886 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2889 %newobject lookup_checksum;
2890 Chksum *lookup_checksum(Id solvid, Id keyname) {
2892 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2893 return solv_chksum_create_from_bin(type, b);
2895 void internalize() {
2896 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2898 void create_stubs() {
2899 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2901 bool write(FILE *fp) {
2902 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
2904 bool add_solv(FILE *fp, int flags = 0) {
2905 Repodata *data = repo_id2repodata($self->repo, $self->id);
2906 int r, oldstate = data->state;
2907 data->state = REPODATA_LOADING;
2908 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2909 if (r || data->state == REPODATA_LOADING)
2910 data->state = oldstate;
2913 void extend_to_repo() {
2914 Repodata *data = repo_id2repodata($self->repo, $self->id);
2915 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2917 bool __eq__(XRepodata *xr) {
2918 return $self->repo == xr->repo && $self->id == xr->id;
2920 bool __ne__(XRepodata *xr) {
2921 return !XRepodata___eq__($self, xr);
2923 %newobject __repr__;
2924 const char *__repr__() {
2926 sprintf(buf, "<Repodata #%d>", $self->id);
2927 return solv_strdup(buf);