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);
865 %rename("isempty?") isempty;
868 return $self->q.count == 0;
870 void filter(Selection *lsel) {
871 if ($self->pool != lsel->pool)
872 queue_empty(&$self->q);
874 selection_filter($self->pool, &$self->q, &lsel->q);
876 void add(Selection *lsel) {
877 if ($self->pool == lsel->pool)
879 selection_add($self->pool, &$self->q, &lsel->q);
880 $self->flags |= lsel->flags;
883 void add_raw(Id how, Id what) {
884 queue_push2(&$self->q, how, what);
886 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
888 Queue jobs(int flags) {
891 queue_init_clone(&q, &$self->q);
892 for (i = 0; i < q.count; i += 2)
893 q.elements[i] |= flags;
897 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
898 %newobject solvables;
902 selection_solvables($self->pool, &$self->q, &q);
906 #if defined(SWIGPERL)
907 %rename("str") __str__;
909 const char *__str__() {
910 return pool_selection2str($self->pool, &$self->q, 0);
912 const char *__repr__() {
913 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
914 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
920 return (Chksum *)solv_chksum_create(type);
922 Chksum(Id type, const char *hex) {
923 unsigned char buf[64];
924 int l = solv_chksum_len(type);
927 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
929 return (Chksum *)solv_chksum_create_from_bin(type, buf);
932 solv_chksum_free($self, 0);
936 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
937 return solv_chksum_get_type(chksum);
940 void add(const char *str) {
941 solv_chksum_add($self, str, strlen((char *)str));
943 void add_fp(FILE *fp) {
946 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
947 solv_chksum_add($self, buf, l);
948 rewind(fp); /* convenience */
950 void add_fd(int fd) {
953 while ((l = read(fd, buf, sizeof(buf))) > 0)
954 solv_chksum_add($self, buf, l);
955 lseek(fd, 0, 0); /* convenience */
957 void add_stat(const char *filename) {
959 if (stat(filename, &stb))
960 memset(&stb, 0, sizeof(stb));
961 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
962 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
963 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
964 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
966 void add_fstat(int fd) {
969 memset(&stb, 0, sizeof(stb));
970 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
971 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
972 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
973 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
977 const unsigned char *b;
978 b = solv_chksum_get($self, &l);
979 return cdata_void((void *)b, l);
984 const unsigned char *b;
987 b = solv_chksum_get($self, &l);
988 ret = solv_malloc(2 * l + 1);
989 solv_bin2hex(b, l, ret);
993 bool __eq__(Chksum *chk) {
995 const unsigned char *b, *bo;
998 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1000 b = solv_chksum_get($self, &l);
1001 bo = solv_chksum_get(chk, 0);
1002 return memcmp(b, bo, l) == 0;
1004 bool __ne__(Chksum *chk) {
1005 return !Chksum___eq__($self, chk);
1007 #if defined(SWIGRUBY)
1008 %rename("to_s") __str__;
1009 %rename("inspect") __repr__;
1011 #if defined(SWIGPERL)
1012 %rename("str") __str__;
1015 const char *__str__() {
1018 if (solv_chksum_isfinished($self))
1019 h = Chksum_hex($self);
1020 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1021 solv_free((void *)h);
1024 %newobject __repr__;
1025 const char *__repr__() {
1026 const char *h = Chksum___str__($self);
1027 const char *str = solv_dupjoin("<Chksum ", h, ">");
1028 solv_free((void *)h);
1034 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1035 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1036 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1037 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1038 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1039 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1040 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1041 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1044 Pool *pool = pool_create();
1049 void set_debuglevel(int level) {
1050 pool_setdebuglevel($self, level);
1052 int set_flag(int flag, int value) {
1053 return pool_set_flag($self, flag, value);
1055 int get_flag(int flag) {
1056 return pool_get_flag($self, flag);
1058 void set_rootdir(const char *rootdir) {
1059 pool_set_rootdir($self, rootdir);
1061 const char *get_rootdir(int flag) {
1062 return pool_get_rootdir($self);
1064 #if defined(SWIGPYTHON)
1066 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1067 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1068 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1069 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1074 return 0; /* exception */
1075 ecode = SWIG_AsVal_int(result, &vresult);
1077 return SWIG_IsOK(ecode) ? vresult : 0;
1080 void set_loadcallback(PyObject *callable) {
1081 if ($self->loadcallback == loadcallback) {
1082 PyObject *obj = $self->loadcallbackdata;
1086 Py_INCREF(callable);
1088 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1091 #if defined(SWIGPERL)
1093 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1097 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1102 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1104 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1114 void set_loadcallback(SV *callable) {
1115 if ($self->loadcallback == loadcallback)
1116 SvREFCNT_dec($self->loadcallbackdata);
1118 SvREFCNT_inc(callable);
1119 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1123 #if defined(SWIGRUBY)
1125 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1126 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1127 VALUE callable = (VALUE)d;
1128 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1129 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1130 return res == Qtrue;
1132 SWIGINTERN void mark_Pool(void *ptr) {
1134 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1135 VALUE callable = (VALUE)pool->loadcallbackdata;
1136 rb_gc_mark(callable);
1140 %typemap(in, numinputs=0) VALUE callable {
1141 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1143 void set_loadcallback(VALUE callable) {
1144 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1149 Pool_set_loadcallback($self, 0);
1152 Id str2id(const char *str, bool create=1) {
1153 return pool_str2id($self, str, create);
1155 Dep *Dep(const char *str, bool create=1) {
1156 Id id = pool_str2id($self, str, create);
1157 return new_Dep($self, id);
1159 const char *id2str(Id id) {
1160 return pool_id2str($self, id);
1162 const char *dep2str(Id id) {
1163 return pool_dep2str($self, id);
1165 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1166 return pool_rel2id($self, name, evr, flags, create);
1168 Id id2langid(Id id, const char *lang, bool create=1) {
1169 return pool_id2langid($self, id, lang, create);
1171 void setarch(const char *arch = 0) {
1180 pool_setarch($self, arch);
1182 Repo *add_repo(const char *name) {
1183 return repo_create($self, name);
1185 const char *lookup_str(Id entry, Id keyname) {
1186 return pool_lookup_str($self, entry, keyname);
1188 Id lookup_id(Id entry, Id keyname) {
1189 return pool_lookup_id($self, entry, keyname);
1191 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1192 return pool_lookup_num($self, entry, keyname, notfound);
1194 bool lookup_void(Id entry, Id keyname) {
1195 return pool_lookup_void($self, entry, keyname);
1197 %newobject lookup_checksum;
1198 Chksum *lookup_checksum(Id entry, Id keyname) {
1200 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1201 return solv_chksum_create_from_bin(type, b);
1204 %newobject Dataiterator;
1205 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1206 return new_Dataiterator($self, 0, p, key, match, flags);
1208 const char *solvid2str(Id solvid) {
1209 return pool_solvid2str($self, solvid);
1211 void addfileprovides() {
1212 pool_addfileprovides($self);
1214 Queue addfileprovides_queue() {
1217 pool_addfileprovides_queue($self, &r, 0);
1220 void createwhatprovides() {
1221 pool_createwhatprovides($self);
1224 XSolvable *id2solvable(Id id) {
1225 return new_XSolvable($self, id);
1227 %newobject solvables;
1228 Pool_solvable_iterator * const solvables;
1230 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1231 return new_Pool_solvable_iterator(pool);
1234 %newobject solvables_iter;
1235 Pool_solvable_iterator * solvables_iter() {
1236 return new_Pool_solvable_iterator($self);
1239 Repo *id2repo(Id id) {
1240 if (id < 1 || id >= $self->nrepos)
1242 return pool_id2repo($self, id);
1246 Pool_repo_iterator * const repos;
1248 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1249 return new_Pool_repo_iterator(pool);
1252 %newobject repos_iter;
1253 Pool_repo_iterator * repos_iter() {
1254 return new_Pool_repo_iterator($self);
1259 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1260 pool_set_installed(pool, installed);
1262 Repo *Pool_installed_get(Pool *pool) {
1263 return pool->installed;
1267 Queue matchprovidingids(const char *match, int flags) {
1273 for (id = 1; id < pool->ss.nstrings; id++)
1274 if (pool->whatprovides[id])
1278 if (!datamatcher_init(&ma, match, flags)) {
1279 for (id = 1; id < pool->ss.nstrings; id++)
1280 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1282 datamatcher_free(&ma);
1288 Job *Job(int how, Id what) {
1289 return new_Job($self, how, what);
1292 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1293 %newobject whatprovides;
1294 Queue whatprovides(DepId dep) {
1299 FOR_PROVIDES(p, pp, dep)
1304 Id towhatprovides(Queue q) {
1305 return pool_queuetowhatprovides($self, &q);
1309 %rename("isknownarch?") isknownarch;
1311 bool isknownarch(DepId id) {
1313 if (!id || id == ID_EMPTY)
1315 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1317 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1324 return solver_create($self);
1327 %newobject Selection;
1328 Selection *Selection() {
1329 return new_Selection($self);
1331 %newobject Selection_all;
1332 Selection *Selection_all(int setflags=0) {
1333 Selection *sel = new_Selection($self);
1334 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1338 Selection *select(const char *name, int flags) {
1339 Selection *sel = new_Selection($self);
1340 sel->flags = selection_make($self, &sel->q, name, flags);
1344 void setpooljobs_helper(Queue jobs) {
1345 queue_free(&$self->pooljobs);
1346 queue_init_clone(&$self->pooljobs, &jobs);
1348 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1349 %newobject getpooljobs;
1350 Queue getpooljobs() {
1352 queue_init_clone(&q, &$self->pooljobs);
1356 #if defined(SWIGPYTHON)
1358 def setpooljobs(self, jobs):
1360 for job in jobs: j += [job.how, job.what]
1361 self.setpooljobs_helper(j)
1364 #if defined(SWIGPERL)
1366 sub solv::Solver::setpooljobs {
1367 my ($self, $jobs) = @_;
1368 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1369 return $self->setpooljobs_helper(\@j);
1373 #if defined(SWIGRUBY)
1376 "class Solv::Pool\n"
1377 " def setpooljobs(jobs)\n"
1379 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1380 " setpooljobs_helper(jl)\n"
1389 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1390 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1391 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1392 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1393 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1394 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1395 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1396 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1397 #ifdef ENABLE_SUSEREPO
1398 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1401 void free(bool reuseids = 0) {
1402 repo_free($self, reuseids);
1404 void empty(bool reuseids = 0) {
1405 repo_empty($self, reuseids);
1408 %rename("isempty?") isempty;
1411 return !$self->nsolvables;
1413 bool add_solv(const char *name, int flags = 0) {
1414 FILE *fp = fopen(name, "r");
1418 r = repo_add_solv($self, fp, flags);
1422 bool add_solv(FILE *fp, int flags = 0) {
1423 return repo_add_solv($self, fp, flags) == 0;
1426 XSolvable *add_solvable() {
1427 Id solvid = repo_add_solvable($self);
1428 return new_XSolvable($self->pool, solvid);
1432 bool add_rpmdb(int flags = 0) {
1433 return repo_add_rpmdb($self, 0, flags) == 0;
1435 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1436 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1438 Id add_rpm(const char *name, int flags = 0) {
1439 return repo_add_rpm($self, name, flags);
1442 #ifdef ENABLE_RPMDB_PUBKEYS
1443 bool add_rpmdb_pubkeys(int flags = 0) {
1444 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1446 Id add_pubkey(const char *key, int flags = 0) {
1447 return repo_add_pubkey($self, key, flags);
1451 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1452 return repo_add_rpmmd($self, fp, language, flags) == 0;
1454 bool add_repomdxml(FILE *fp, int flags = 0) {
1455 return repo_add_repomdxml($self, fp, flags) == 0;
1457 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1458 return repo_add_updateinfoxml($self, fp, flags) == 0;
1460 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1461 return repo_add_deltainfoxml($self, fp, flags) == 0;
1464 #ifdef ENABLE_DEBIAN
1465 bool add_debdb(int flags = 0) {
1466 return repo_add_debdb($self, flags) == 0;
1468 bool add_debpackages(FILE *fp, int flags = 0) {
1469 return repo_add_debpackages($self, fp, flags) == 0;
1471 Id add_deb(const char *name, int flags = 0) {
1472 return repo_add_deb($self, name, flags);
1475 #ifdef ENABLE_SUSEREPO
1476 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1477 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1479 bool add_content(FILE *fp, int flags = 0) {
1480 return repo_add_content($self, fp, flags) == 0;
1482 bool add_products(const char *proddir, int flags = 0) {
1483 return repo_add_products($self, proddir, flags) == 0;
1486 #ifdef ENABLE_MDKREPO
1487 bool add_mdk(FILE *fp, int flags = 0) {
1488 return repo_add_mdk($self, fp, flags) == 0;
1490 bool add_mdk_info(FILE *fp, int flags = 0) {
1491 return repo_add_mdk_info($self, fp, flags) == 0;
1494 #ifdef ENABLE_ARCHREPO
1495 bool add_arch_repo(FILE *fp, int flags = 0) {
1496 return repo_add_arch_repo($self, fp, flags) == 0;
1498 bool add_arch_local(const char *dir, int flags = 0) {
1499 return repo_add_arch_local($self, dir, flags) == 0;
1501 Id add_arch_pkg(const char *name, int flags = 0) {
1502 return repo_add_arch_pkg($self, name, flags);
1505 void internalize() {
1506 repo_internalize($self);
1508 bool write(FILE *fp) {
1509 return repo_write($self, fp) == 0;
1511 # HACK, remove if no longer needed!
1512 bool write_first_repodata(FILE *fp) {
1513 int oldnrepodata = $self->nrepodata;
1515 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1516 res = repo_write($self, fp);
1517 $self->nrepodata = oldnrepodata;
1521 %newobject Dataiterator;
1522 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1523 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1528 SWIGINTERN Id Repo_id_get(Repo *repo) {
1529 return repo->repoid;
1532 %newobject solvables;
1533 Repo_solvable_iterator * const solvables;
1535 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1536 return new_Repo_solvable_iterator(repo);
1540 Datapos * const meta;
1542 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1543 Datapos *pos = solv_calloc(1, sizeof(*pos));
1544 pos->solvid = SOLVID_META;
1550 %newobject solvables_iter;
1551 Repo_solvable_iterator *solvables_iter() {
1552 return new_Repo_solvable_iterator($self);
1555 XRepodata *add_repodata(int flags = 0) {
1556 Repodata *rd = repo_add_repodata($self, flags);
1557 return new_XRepodata($self, rd->repodataid);
1560 void create_stubs() {
1562 if (!$self->nrepodata)
1564 data = repo_id2repodata($self, $self->nrepodata - 1);
1565 if (data->state != REPODATA_STUB)
1566 repodata_create_stubs(data);
1569 %rename("iscontiguous?") iscontiguous;
1571 bool iscontiguous() {
1573 for (i = $self->start; i < $self->end; i++)
1574 if ($self->pool->solvables[i].repo != $self)
1578 XRepodata *first_repodata() {
1581 if ($self->nrepodata < 2)
1583 /* make sure all repodatas but the first are extensions */
1584 data = repo_id2repodata($self, 1);
1585 if (data->loadcallback)
1587 for (i = 2; i < $self->nrepodata; i++)
1589 data = repo_id2repodata($self, i);
1590 if (!data->loadcallback)
1591 return 0; /* oops, not an extension */
1593 return new_XRepodata($self, 1);
1596 %newobject Selection;
1597 Selection *Selection(int setflags=0) {
1598 Selection *sel = new_Selection($self->pool);
1599 setflags |= SOLVER_SETREPO;
1600 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1604 bool __eq__(Repo *repo) {
1605 return $self == repo;
1607 bool __ne__(Repo *repo) {
1608 return $self != repo;
1610 #if defined(SWIGPERL)
1611 %rename("str") __str__;
1614 const char *__str__() {
1617 return solv_strdup($self->name);
1618 sprintf(buf, "Repo#%d", $self->repoid);
1619 return solv_strdup(buf);
1621 %newobject __repr__;
1622 const char *__repr__() {
1626 sprintf(buf, "<Repo #%d ", $self->repoid);
1627 return solv_dupjoin(buf, $self->name, ">");
1629 sprintf(buf, "<Repo #%d>", $self->repoid);
1630 return solv_strdup(buf);
1634 %extend Dataiterator {
1635 static const int SEARCH_STRING = SEARCH_STRING;
1636 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1637 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1638 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1639 static const int SEARCH_GLOB = SEARCH_GLOB;
1640 static const int SEARCH_REGEX = SEARCH_REGEX;
1641 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1642 static const int SEARCH_FILES = SEARCH_FILES;
1643 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1644 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1646 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1647 Dataiterator *di = solv_calloc(1, sizeof(*di));
1648 dataiterator_init(di, pool, repo, p, key, match, flags);
1652 dataiterator_free($self);
1655 #if defined(SWIGPYTHON)
1656 %newobject __iter__;
1657 Dataiterator *__iter__() {
1659 ndi = solv_calloc(1, sizeof(*ndi));
1660 dataiterator_init_clone(ndi, $self);
1663 %rename("next") __next__();
1664 %exception __next__ {
1667 PyErr_SetString(PyExc_StopIteration,"no more matches");
1674 perliter(solv::Dataiterator)
1677 %newobject __next__;
1678 Datamatch *__next__() {
1680 if (!dataiterator_step($self)) {
1683 ndi = solv_calloc(1, sizeof(*ndi));
1684 dataiterator_init_clone(ndi, $self);
1685 dataiterator_strdup(ndi);
1691 while ((d = Dataiterator___next__($self)) != 0) {
1692 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1696 void prepend_keyname(Id key) {
1697 dataiterator_prepend_keyname($self, key);
1699 void skip_solvable() {
1700 dataiterator_skip_solvable($self);
1705 Id lookup_id(Id keyname) {
1706 Pool *pool = $self->repo->pool;
1707 Datapos oldpos = pool->pos;
1710 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1714 const char *lookup_str(Id keyname) {
1715 Pool *pool = $self->repo->pool;
1716 Datapos oldpos = pool->pos;
1719 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1723 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1724 Pool *pool = $self->repo->pool;
1725 Datapos oldpos = pool->pos;
1726 unsigned long long r;
1728 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1732 bool lookup_void(Id keyname) {
1733 Pool *pool = $self->repo->pool;
1734 Datapos oldpos = pool->pos;
1737 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1741 %newobject lookup_checksum;
1742 Chksum *lookup_checksum(Id keyname) {
1743 Pool *pool = $self->repo->pool;
1744 Datapos oldpos = pool->pos;
1746 const unsigned char *b;
1748 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1750 return solv_chksum_create_from_bin(type, b);
1752 const char *lookup_deltaseq() {
1753 Pool *pool = $self->repo->pool;
1754 Datapos oldpos = pool->pos;
1757 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1759 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1760 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1765 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1766 Pool *pool = $self->repo->pool;
1767 Datapos oldpos = pool->pos;
1770 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1774 Queue lookup_idarray(Id keyname) {
1775 Pool *pool = $self->repo->pool;
1776 Datapos oldpos = pool->pos;
1780 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1784 %newobject Dataiterator;
1785 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
1786 Pool *pool = $self->repo->pool;
1787 Datapos oldpos = pool->pos;
1790 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1798 dataiterator_free($self);
1801 %newobject solvable;
1802 XSolvable * const solvable;
1804 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1805 return new_XSolvable(di->pool, di->solvid);
1809 return $self->key->name;
1811 const char *key_idstr() {
1812 return pool_id2str($self->pool, $self->key->name);
1815 return $self->key->type;
1817 const char *type_idstr() {
1818 return pool_id2str($self->pool, $self->key->type);
1821 return $self->kv.id;
1823 const char *idstr() {
1824 return pool_id2str($self->pool, $self->kv.id);
1827 return $self->kv.str;
1829 unsigned long long num() {
1830 if ($self->key->type == REPOKEY_TYPE_NUM)
1831 return SOLV_KV_NUM64(&$self->kv);
1832 return $self->kv.num;
1835 return $self->kv.num2;
1839 Pool *pool = $self->pool;
1840 Datapos *pos, oldpos = pool->pos;
1841 dataiterator_setpos($self);
1842 pos = solv_calloc(1, sizeof(*pos));
1847 %newobject parentpos;
1848 Datapos *parentpos() {
1849 Pool *pool = $self->pool;
1850 Datapos *pos, oldpos = pool->pos;
1851 dataiterator_setpos_parent($self);
1852 pos = solv_calloc(1, sizeof(*pos));
1857 #if defined(SWIGPERL)
1858 %rename("str") __str__;
1860 const char *__str__() {
1861 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1863 return $self->kv.str;
1867 %extend Pool_solvable_iterator {
1868 Pool_solvable_iterator(Pool *pool) {
1869 Pool_solvable_iterator *s;
1870 s = solv_calloc(1, sizeof(*s));
1874 #if defined(SWIGPYTHON)
1875 %newobject __iter__;
1876 Pool_solvable_iterator *__iter__() {
1877 Pool_solvable_iterator *s;
1878 s = solv_calloc(1, sizeof(*s));
1882 %rename("next") __next__();
1883 %exception __next__ {
1886 PyErr_SetString(PyExc_StopIteration,"no more matches");
1893 perliter(solv::Pool_solvable_iterator)
1895 %newobject __next__;
1896 XSolvable *__next__() {
1897 Pool *pool = $self->pool;
1898 if ($self->id >= pool->nsolvables)
1900 while (++$self->id < pool->nsolvables)
1901 if (pool->solvables[$self->id].repo)
1902 return new_XSolvable(pool, $self->id);
1908 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1909 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1913 %newobject __getitem__;
1914 XSolvable *__getitem__(Id key) {
1915 Pool *pool = $self->pool;
1916 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1917 return new_XSolvable(pool, key);
1921 return $self->pool->nsolvables;
1925 %extend Pool_repo_iterator {
1926 Pool_repo_iterator(Pool *pool) {
1927 Pool_repo_iterator *s;
1928 s = solv_calloc(1, sizeof(*s));
1932 #if defined(SWIGPYTHON)
1933 %newobject __iter__;
1934 Pool_repo_iterator *__iter__() {
1935 Pool_repo_iterator *s;
1936 s = solv_calloc(1, sizeof(*s));
1940 %rename("next") __next__();
1941 %exception __next__ {
1944 PyErr_SetString(PyExc_StopIteration,"no more matches");
1949 %newobject __next__;
1951 Pool *pool = $self->pool;
1952 if ($self->id >= pool->nrepos)
1954 while (++$self->id < pool->nrepos) {
1955 Repo *r = pool_id2repo(pool, $self->id);
1964 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1965 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1969 Repo *__getitem__(Id key) {
1970 Pool *pool = $self->pool;
1971 if (key > 0 && key < pool->nrepos)
1972 return pool_id2repo(pool, key);
1976 return $self->pool->nrepos;
1980 %extend Repo_solvable_iterator {
1981 Repo_solvable_iterator(Repo *repo) {
1982 Repo_solvable_iterator *s;
1983 s = solv_calloc(1, sizeof(*s));
1987 #if defined(SWIGPYTHON)
1988 %newobject __iter__;
1989 Repo_solvable_iterator *__iter__() {
1990 Repo_solvable_iterator *s;
1991 s = solv_calloc(1, sizeof(*s));
1995 %rename("next") __next__();
1996 %exception __next__ {
1999 PyErr_SetString(PyExc_StopIteration,"no more matches");
2004 %newobject __next__;
2005 XSolvable *__next__() {
2006 Repo *repo = $self->repo;
2007 Pool *pool = repo->pool;
2008 if (repo->start > 0 && $self->id < repo->start)
2009 $self->id = repo->start - 1;
2010 if ($self->id >= repo->end)
2012 while (++$self->id < repo->end)
2013 if (pool->solvables[$self->id].repo == repo)
2014 return new_XSolvable(pool, $self->id);
2020 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2021 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2025 %newobject __getitem__;
2026 XSolvable *__getitem__(Id key) {
2027 Repo *repo = $self->repo;
2028 Pool *pool = repo->pool;
2029 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2030 return new_XSolvable(pool, key);
2034 return $self->repo->pool->nsolvables;
2039 Dep(Pool *pool, Id id) {
2043 s = solv_calloc(1, sizeof(*s));
2049 Dep *Rel(int flags, DepId evrid, bool create=1) {
2050 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2053 return new_Dep($self->pool, id);
2055 %newobject Selection_name;
2056 Selection *Selection_name(int setflags=0) {
2057 Selection *sel = new_Selection($self->pool);
2058 if (ISRELDEP($self->id)) {
2059 Reldep *rd = GETRELDEP($self->pool, $self->id);
2060 if (rd->flags == REL_EQ) {
2061 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2062 if (ISRELDEP(rd->name))
2063 rd = GETRELDEP($self->pool, rd->name);
2065 if (rd->flags == REL_ARCH)
2066 setflags |= SOLVER_SETARCH;
2068 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2071 %newobject Selection_provides;
2072 Selection *Selection_provides(int setflags=0) {
2073 Selection *sel = new_Selection($self->pool);
2074 if (ISRELDEP($self->id)) {
2075 Reldep *rd = GETRELDEP($self->pool, $self->id);
2076 if (rd->flags == REL_ARCH)
2077 setflags |= SOLVER_SETARCH;
2079 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2083 return pool_dep2str($self->pool, $self->id);
2085 bool __eq__(Dep *s) {
2086 return $self->pool == s->pool && $self->id == s->id;
2088 bool __ne__(Dep *s) {
2089 return !Dep___eq__($self, s);
2091 #if defined(SWIGPERL)
2092 %rename("str") __str__;
2094 const char *__str__() {
2095 return pool_dep2str($self->pool, $self->id);
2097 %newobject __repr__;
2098 const char *__repr__() {
2100 sprintf(buf, "<Id #%d ", $self->id);
2101 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2106 XSolvable(Pool *pool, Id id) {
2108 if (!id || id >= pool->nsolvables)
2110 s = solv_calloc(1, sizeof(*s));
2116 return pool_solvid2str($self->pool, $self->id);
2118 const char *lookup_str(Id keyname) {
2119 return pool_lookup_str($self->pool, $self->id, keyname);
2121 Id lookup_id(Id keyname) {
2122 return pool_lookup_id($self->pool, $self->id, keyname);
2124 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2125 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2127 bool lookup_void(Id keyname) {
2128 return pool_lookup_void($self->pool, $self->id, keyname);
2130 %newobject lookup_checksum;
2131 Chksum *lookup_checksum(Id keyname) {
2133 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2134 return solv_chksum_create_from_bin(type, b);
2136 Queue lookup_idarray(Id keyname, Id marker = -1) {
2137 Solvable *s = $self->pool->solvables + $self->id;
2140 if (marker == -1 || marker == 1) {
2141 if (keyname == SOLVABLE_PROVIDES)
2142 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2143 else if (keyname == SOLVABLE_REQUIRES)
2144 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2148 solvable_lookup_deparray(s, keyname, &r, marker);
2151 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2152 %newobject lookup_deparray;
2153 Queue lookup_deparray(Id keyname, Id marker = -1) {
2154 Solvable *s = $self->pool->solvables + $self->id;
2157 if (marker == -1 || marker == 1) {
2158 if (keyname == SOLVABLE_PROVIDES)
2159 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2160 else if (keyname == SOLVABLE_REQUIRES)
2161 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2165 solvable_lookup_deparray(s, keyname, &r, marker);
2168 const char *lookup_location(unsigned int *OUTPUT) {
2169 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2171 %newobject Dataiterator;
2172 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2173 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2176 %rename("installable?") installable;
2178 bool installable() {
2179 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2182 %rename("isinstalled?") isinstalled;
2184 bool isinstalled() {
2185 Pool *pool = $self->pool;
2186 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2191 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2192 Pool *pool = xs->pool;
2193 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2195 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2196 Pool *pool = xs->pool;
2197 return pool_id2str(pool, pool->solvables[xs->id].name);
2202 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2203 xs->pool->solvables[xs->id].name = nameid;
2205 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2206 return xs->pool->solvables[xs->id].name;
2211 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2212 Pool *pool = xs->pool;
2213 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2215 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2216 Pool *pool = xs->pool;
2217 return pool_id2str(pool, pool->solvables[xs->id].evr);
2222 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2223 xs->pool->solvables[xs->id].evr = evrid;
2225 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2226 return xs->pool->solvables[xs->id].evr;
2231 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2232 Pool *pool = xs->pool;
2233 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2235 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2236 Pool *pool = xs->pool;
2237 return pool_id2str(pool, pool->solvables[xs->id].arch);
2242 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2243 xs->pool->solvables[xs->id].arch = archid;
2245 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2246 return xs->pool->solvables[xs->id].arch;
2251 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2252 Pool *pool = xs->pool;
2253 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2255 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2256 Pool *pool = xs->pool;
2257 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2262 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2263 xs->pool->solvables[xs->id].vendor = vendorid;
2265 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2266 return xs->pool->solvables[xs->id].vendor;
2271 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2272 return xs->pool->solvables[xs->id].repo;
2276 /* old interface, please use the generic add_deparray instead */
2277 void add_provides(DepId id, Id marker = -1) {
2278 Solvable *s = $self->pool->solvables + $self->id;
2279 if (marker == -1 || marker == 1)
2280 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2281 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2283 void add_obsoletes(DepId id) {
2284 Solvable *s = $self->pool->solvables + $self->id;
2285 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2287 void add_conflicts(DepId id) {
2288 Solvable *s = $self->pool->solvables + $self->id;
2289 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2291 void add_requires(DepId id, Id marker = -1) {
2292 Solvable *s = $self->pool->solvables + $self->id;
2293 if (marker == -1 || marker == 1)
2294 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2295 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2297 void add_recommends(DepId id) {
2298 Solvable *s = $self->pool->solvables + $self->id;
2299 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2301 void add_suggests(DepId id) {
2302 Solvable *s = $self->pool->solvables + $self->id;
2303 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2305 void add_supplements(DepId id) {
2306 Solvable *s = $self->pool->solvables + $self->id;
2307 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2309 void add_enhances(DepId id) {
2310 Solvable *s = $self->pool->solvables + $self->id;
2311 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2314 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2315 Solvable *s = $self->pool->solvables + $self->id;
2316 if (marker == -1 || marker == 1) {
2317 if (keyname == SOLVABLE_PROVIDES)
2318 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2319 else if (keyname == SOLVABLE_REQUIRES)
2320 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2324 solvable_add_deparray(s, keyname, id, marker);
2327 %newobject Selection;
2328 Selection *Selection(int setflags=0) {
2329 Selection *sel = new_Selection($self->pool);
2330 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2334 bool __eq__(XSolvable *s) {
2335 return $self->pool == s->pool && $self->id == s->id;
2337 bool __ne__(XSolvable *s) {
2338 return !XSolvable___eq__($self, s);
2340 #if defined(SWIGPERL)
2341 %rename("str") __str__;
2343 const char *__str__() {
2344 return pool_solvid2str($self->pool, $self->id);
2346 %newobject __repr__;
2347 const char *__repr__() {
2349 sprintf(buf, "<Solvable #%d ", $self->id);
2350 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2355 Problem(Solver *solv, Id id) {
2357 p = solv_calloc(1, sizeof(*p));
2362 %newobject findproblemrule;
2363 XRule *findproblemrule() {
2364 Id r = solver_findproblemrule($self->solv, $self->id);
2365 return new_XRule($self->solv, r);
2367 %newobject findallproblemrules;
2368 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2369 Queue findallproblemrules(int unfiltered=0) {
2370 Solver *solv = $self->solv;
2375 solver_findallproblemrules(solv, $self->id, &q);
2378 for (i = j = 0; i < q.count; i++)
2380 SolverRuleinfo rclass;
2381 probr = q.elements[i];
2382 rclass = solver_ruleclass(solv, probr);
2383 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2385 q.elements[j++] = probr;
2388 queue_truncate(&q, j);
2392 int solution_count() {
2393 return solver_solution_count($self->solv, $self->id);
2395 %newobject solutions;
2396 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2401 cnt = solver_solution_count($self->solv, $self->id);
2402 for (i = 1; i <= cnt; i++)
2409 Solution(Problem *p, Id id) {
2411 s = solv_calloc(1, sizeof(*s));
2413 s->problemid = p->id;
2417 int element_count() {
2418 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2421 %newobject elements;
2422 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2423 Queue elements(bool expandreplaces=0) {
2427 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2428 for (i = 1; i <= cnt; i++)
2431 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2433 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2439 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2440 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2442 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2443 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2444 queue_push2(&q, p, rp);
2446 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2447 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2448 queue_push2(&q, p, rp);
2450 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2451 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2452 queue_push2(&q, p, rp);
2454 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2455 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2456 queue_push2(&q, p, rp);
2461 queue_push2(&q, i, type);
2462 queue_push2(&q, p, rp);
2468 %extend Solutionelement {
2469 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2471 e = solv_calloc(1, sizeof(*e));
2473 e->problemid = problemid;
2485 if (p == SOLVER_SOLUTION_ERASE)
2490 else if (p == SOLVER_SOLUTION_REPLACE)
2495 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2496 illegal = POLICY_ILLEGAL_DOWNGRADE;
2497 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2498 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2499 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2500 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2501 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2502 illegal = POLICY_ILLEGAL_NAMECHANGE;
2504 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);
2505 return solver_solutionelement2str($self->solv, p, rp);
2507 %newobject replaceelements;
2508 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2509 Queue replaceelements() {
2514 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2517 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2518 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2519 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2520 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2521 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2522 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2523 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2524 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2525 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2527 queue_push(&q, $self->type);
2530 int illegalreplace() {
2531 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2533 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2535 %newobject solvable;
2536 XSolvable * const solvable;
2537 %newobject replacement;
2538 XSolvable * const replacement;
2541 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2542 return new_XSolvable(e->solv->pool, e->p);
2544 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2545 return new_XSolvable(e->solv->pool, e->rp);
2547 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2548 if (e->type != SOLVER_SOLUTION_JOB)
2550 return (e->p - 1) / 2;
2555 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2556 if ($self->type == SOLVER_SOLUTION_JOB)
2557 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2558 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2559 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2560 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)
2561 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2562 if ($self->type == SOLVER_SOLUTION_ERASE)
2563 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2569 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2570 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2571 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2572 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2573 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2574 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2575 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2576 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2577 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2578 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2579 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2580 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2581 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2582 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2583 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2584 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2585 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2586 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2587 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2588 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2590 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2591 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2592 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2593 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2594 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2595 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2596 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2597 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2598 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2599 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2600 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2602 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2603 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2604 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2605 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2607 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2608 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2609 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2610 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2611 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2612 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2613 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2614 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2615 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2616 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2617 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2618 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2624 int set_flag(int flag, int value) {
2625 return solver_set_flag($self, flag, value);
2627 int get_flag(int flag) {
2628 return solver_get_flag($self, flag);
2630 #if defined(SWIGPYTHON)
2632 def solve(self, jobs):
2634 for job in jobs: j += [job.how, job.what]
2635 return self.solve_helper(j)
2638 #if defined(SWIGPERL)
2640 sub solv::Solver::solve {
2641 my ($self, $jobs) = @_;
2642 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2643 return $self->solve_helper(\@j);
2647 #if defined(SWIGRUBY)
2650 "class Solv::Solver\n"
2651 " def solve(jobs)\n"
2653 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2654 " solve_helper(jl)\n"
2660 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2661 %newobject solve_helper;
2662 Queue solve_helper(Queue jobs) {
2666 solver_solve($self, &jobs);
2667 cnt = solver_problem_count($self);
2668 for (i = 1; i <= cnt; i++)
2672 %newobject transaction;
2673 Transaction *transaction() {
2674 return solver_create_transaction($self);
2678 %extend Transaction {
2679 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2680 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2681 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2682 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2683 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2684 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2685 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2686 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2687 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2688 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2689 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2690 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2691 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2692 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2693 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2694 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2695 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2696 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2697 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2698 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2699 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2700 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2701 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2702 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2703 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2704 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2705 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2706 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2708 transaction_free($self);
2711 %rename("isempty?") isempty;
2714 return $self->steps.count == 0;
2717 %newobject othersolvable;
2718 XSolvable *othersolvable(XSolvable *s) {
2719 Id op = transaction_obs_pkg($self, s->id);
2720 return new_XSolvable($self->pool, op);
2723 %newobject allothersolvables;
2724 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2725 Queue allothersolvables(XSolvable *s) {
2728 transaction_all_obs_pkgs($self, s->id, &q);
2732 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2733 %newobject classify;
2734 Queue classify(int mode = 0) {
2737 transaction_classify($self, mode, &q);
2741 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2742 %newobject newpackages;
2743 Queue newpackages() {
2747 cut = transaction_installedresult(self, &q);
2748 queue_truncate(&q, cut);
2752 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2753 %newobject keptpackages;
2754 Queue keptpackages() {
2758 cut = transaction_installedresult(self, &q);
2760 queue_deleten(&q, 0, cut);
2764 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2768 queue_init_clone(&q, &$self->steps);
2772 int steptype(XSolvable *s, int mode) {
2773 return transaction_type($self, s->id, mode);
2775 int calc_installsizechange() {
2776 return transaction_calc_installsizechange($self);
2778 void order(int flags) {
2779 transaction_order($self, flags);
2783 %extend TransactionClass {
2784 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2785 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2786 cl->transaction = trans;
2790 cl->fromid = fromid;
2794 %newobject solvables;
2795 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2799 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2804 return new_Dep($self->transaction->pool, $self->fromid);
2808 return new_Dep($self->transaction->pool, $self->toid);
2813 XRule(Solver *solv, Id id) {
2816 XRule *xr = solv_calloc(1, sizeof(*xr));
2822 Id type, source, target, dep;
2823 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2824 return new_Ruleinfo($self, type, source, target, dep);
2826 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2827 %newobject allinfos;
2831 solver_allruleinfos($self->solv, $self->id, &q);
2835 bool __eq__(XRule *xr) {
2836 return $self->solv == xr->solv && $self->id == xr->id;
2838 bool __ne__(XRule *xr) {
2839 return !XRule___eq__($self, xr);
2841 %newobject __repr__;
2842 const char *__repr__() {
2844 sprintf(buf, "<Rule #%d>", $self->id);
2845 return solv_strdup(buf);
2850 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2851 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2855 ri->source = source;
2856 ri->target = target;
2860 XSolvable * const solvable;
2861 XSolvable * const othersolvable;
2863 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2864 return new_XSolvable(ri->solv->pool, ri->source);
2866 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2867 return new_XSolvable(ri->solv->pool, ri->target);
2870 const char *problemstr() {
2871 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2876 XRepodata(Repo *repo, Id id) {
2877 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2883 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2885 void set_id(Id solvid, Id keyname, DepId id) {
2886 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2888 void set_str(Id solvid, Id keyname, const char *str) {
2889 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2891 void set_poolstr(Id solvid, Id keyname, const char *str) {
2892 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2894 void add_idarray(Id solvid, Id keyname, DepId id) {
2895 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2897 void add_flexarray(Id solvid, Id keyname, Id handle) {
2898 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2900 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2901 const unsigned char *buf = solv_chksum_get(chksum, 0);
2903 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2905 const char *lookup_str(Id solvid, Id keyname) {
2906 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2908 Queue lookup_idarray(Id solvid, Id keyname) {
2911 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2914 %newobject lookup_checksum;
2915 Chksum *lookup_checksum(Id solvid, Id keyname) {
2917 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2918 return solv_chksum_create_from_bin(type, b);
2920 void internalize() {
2921 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2923 void create_stubs() {
2924 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2926 bool write(FILE *fp) {
2927 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
2929 bool add_solv(FILE *fp, int flags = 0) {
2930 Repodata *data = repo_id2repodata($self->repo, $self->id);
2931 int r, oldstate = data->state;
2932 data->state = REPODATA_LOADING;
2933 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2934 if (r || data->state == REPODATA_LOADING)
2935 data->state = oldstate;
2938 void extend_to_repo() {
2939 Repodata *data = repo_id2repodata($self->repo, $self->id);
2940 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2942 bool __eq__(XRepodata *xr) {
2943 return $self->repo == xr->repo && $self->id == xr->id;
2945 bool __ne__(XRepodata *xr) {
2946 return !XRepodata___eq__($self, xr);
2948 %newobject __repr__;
2949 const char *__repr__() {
2951 sprintf(buf, "<Repodata #%d>", $self->id);
2952 return solv_strdup(buf);