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 = ((SolvFp *)vptr)->fp;
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 = ((Dep *)vptr)->id;
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
461 typedef struct chksum Chksum;
462 typedef void *AppObjectPtr;
488 } Pool_solvable_iterator;
493 } Pool_repo_iterator;
498 } Repo_solvable_iterator;
538 Transaction *transaction;
556 typedef Dataiterator Datamatch;
561 %mixin Dataiterator "Enumerable";
562 %mixin Pool_solvable_iterator "Enumerable";
563 %mixin Pool_repo_iterator "Enumerable";
564 %mixin Repo_solvable_iterator "Enumerable";
572 %constant Id SOLVID_META;
573 %constant Id SOLVID_POS;
575 %constant int REL_EQ;
576 %constant int REL_GT;
577 %constant int REL_LT;
578 %constant int REL_ARCH;
589 # put before pool/repo so we can access the constructor
590 %nodefaultdtor Dataiterator;
591 typedef struct {} Dataiterator;
614 typedef struct {} Pool_solvable_iterator;
615 typedef struct {} Pool_repo_iterator;
616 typedef struct {} Repo_solvable_iterator;
618 %nodefaultctor Datamatch;
619 %nodefaultdtor Datamatch;
626 %nodefaultctor Datapos;
640 AppObjectPtr appdata;
647 const char * const name;
650 int const nsolvables;
651 AppObjectPtr appdata;
654 %nodefaultctor Solver;
655 %nodefaultdtor Solver;
663 %rename(xfopen) solvfp_xfopen;
664 %rename(xfopen_fd) solvfp_xfopen_fd;
666 %nodefaultctor SolvFp;
670 %newobject solvfp_xfopen;
671 %newobject solvfp_xfopen_fd;
673 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
674 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
677 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
681 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
684 sfp = solv_calloc(1, sizeof(SolvFp));
688 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
691 fp = solv_xfopen(fn, mode);
694 sfp = solv_calloc(1, sizeof(SolvFp));
719 %nodefaultctor Transaction;
720 %nodefaultdtor Transaction;
726 Transaction * const transaction;
740 return $self->fp ? fileno($self->fp) : -1;
743 return $self->fp ? dup(fileno($self->fp)) : -1;
748 return fflush($self->fp) == 0;
754 ret = fclose($self->fp) == 0;
761 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
762 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
763 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
764 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
765 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
766 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
767 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
768 static const Id SOLVER_NOOP = SOLVER_NOOP;
769 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
770 static const Id SOLVER_ERASE = SOLVER_ERASE;
771 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
772 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
773 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
774 static const Id SOLVER_LOCK = SOLVER_LOCK;
775 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
776 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
777 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
778 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
779 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
780 static const Id SOLVER_WEAK = SOLVER_WEAK;
781 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
782 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
783 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
784 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
785 static const Id SOLVER_SETEV = SOLVER_SETEV;
786 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
787 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
788 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
789 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
790 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
791 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
792 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
794 Job(Pool *pool, int how, Id what) {
795 Job *job = solv_calloc(1, sizeof(*job));
802 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
803 %newobject solvables;
807 pool_job2solvables($self->pool, &q, $self->how, $self->what);
811 %rename("isemptyupdate?") isemptyupdate;
813 bool isemptyupdate() {
814 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
817 bool __eq__(Job *j) {
818 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
820 bool __ne__(Job *j) {
821 return !Job___eq__($self, j);
823 #if defined(SWIGPERL)
824 %rename("str") __str__;
826 const char *__str__() {
827 return pool_job2str($self->pool, $self->how, $self->what, 0);
829 const char *__repr__() {
830 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
831 return pool_tmpjoin($self->pool, "<Job ", str, ">");
836 static const Id SELECTION_NAME = SELECTION_NAME;
837 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
838 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
839 static const Id SELECTION_CANON = SELECTION_CANON;
840 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
841 static const Id SELECTION_REL = SELECTION_REL;
842 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
843 static const Id SELECTION_GLOB = SELECTION_GLOB;
844 static const Id SELECTION_FLAT = SELECTION_FLAT;
845 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
846 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
847 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
849 Selection(Pool *pool) {
851 s = solv_calloc(1, sizeof(*s));
857 queue_free(&$self->q);
863 void make(const char *name, int flags) {
864 $self->flags = selection_make($self->pool, &$self->q, name, flags);
867 %rename("isempty?") isempty;
870 return $self->q.count == 0;
872 void filter(Selection *lsel) {
873 if ($self->pool != lsel->pool)
874 queue_empty(&$self->q);
876 selection_filter($self->pool, &$self->q, &lsel->q);
878 void add(Selection *lsel) {
879 if ($self->pool == lsel->pool)
881 selection_add($self->pool, &$self->q, &lsel->q);
882 $self->flags |= lsel->flags;
885 void add_raw(Id how, Id what) {
886 queue_push2(&$self->q, how, what);
888 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
890 Queue jobs(int flags) {
893 queue_init_clone(&q, &$self->q);
894 for (i = 0; i < q.count; i += 2)
895 q.elements[i] |= flags;
899 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
900 %newobject solvables;
904 selection_solvables($self->pool, &$self->q, &q);
908 #if defined(SWIGPERL)
909 %rename("str") __str__;
911 const char *__str__() {
912 return pool_selection2str($self->pool, &$self->q, 0);
914 const char *__repr__() {
915 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
916 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
922 return (Chksum *)solv_chksum_create(type);
924 Chksum(Id type, const char *hex) {
925 unsigned char buf[64];
926 int l = solv_chksum_len(type);
929 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
931 return (Chksum *)solv_chksum_create_from_bin(type, buf);
934 solv_chksum_free($self, 0);
938 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
939 return solv_chksum_get_type(chksum);
942 void add(const char *str) {
943 solv_chksum_add($self, str, strlen((char *)str));
945 void add_fp(FILE *fp) {
948 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
949 solv_chksum_add($self, buf, l);
950 rewind(fp); /* convenience */
952 void add_fd(int fd) {
955 while ((l = read(fd, buf, sizeof(buf))) > 0)
956 solv_chksum_add($self, buf, l);
957 lseek(fd, 0, 0); /* convenience */
959 void add_stat(const char *filename) {
961 if (stat(filename, &stb))
962 memset(&stb, 0, sizeof(stb));
963 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
964 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
965 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
966 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
968 void add_fstat(int fd) {
971 memset(&stb, 0, sizeof(stb));
972 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
973 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
974 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
975 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
979 const unsigned char *b;
980 b = solv_chksum_get($self, &l);
981 return cdata_void((void *)b, l);
986 const unsigned char *b;
989 b = solv_chksum_get($self, &l);
990 ret = solv_malloc(2 * l + 1);
991 solv_bin2hex(b, l, ret);
995 bool __eq__(Chksum *chk) {
997 const unsigned char *b, *bo;
1000 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1002 b = solv_chksum_get($self, &l);
1003 bo = solv_chksum_get(chk, 0);
1004 return memcmp(b, bo, l) == 0;
1006 bool __ne__(Chksum *chk) {
1007 return !Chksum___eq__($self, chk);
1009 #if defined(SWIGRUBY)
1010 %rename("to_s") __str__;
1011 %rename("inspect") __repr__;
1013 #if defined(SWIGPERL)
1014 %rename("str") __str__;
1017 const char *__str__() {
1020 if (solv_chksum_isfinished($self))
1021 h = Chksum_hex($self);
1022 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1023 solv_free((void *)h);
1026 %newobject __repr__;
1027 const char *__repr__() {
1028 const char *h = Chksum___str__($self);
1029 const char *str = solv_dupjoin("<Chksum ", h, ">");
1030 solv_free((void *)h);
1037 Pool *pool = pool_create();
1042 void set_debuglevel(int level) {
1043 pool_setdebuglevel($self, level);
1045 int set_flag(int flag, int value) {
1046 return pool_set_flag($self, flag, value);
1048 int get_flag(int flag) {
1049 return pool_get_flag($self, flag);
1051 void set_rootdir(const char *rootdir) {
1052 pool_set_rootdir($self, rootdir);
1054 const char *get_rootdir(int flag) {
1055 return pool_get_rootdir($self);
1057 #if defined(SWIGPYTHON)
1059 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1060 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1061 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1062 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1067 return 0; /* exception */
1068 ecode = SWIG_AsVal_int(result, &vresult);
1070 return SWIG_IsOK(ecode) ? vresult : 0;
1073 void set_loadcallback(PyObject *callable) {
1074 if ($self->loadcallback == loadcallback) {
1075 PyObject *obj = $self->loadcallbackdata;
1079 Py_INCREF(callable);
1081 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1084 #if defined(SWIGPERL)
1086 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1090 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1095 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1097 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1107 void set_loadcallback(SV *callable) {
1108 if ($self->loadcallback == loadcallback)
1109 SvREFCNT_dec($self->loadcallbackdata);
1111 SvREFCNT_inc(callable);
1112 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1116 #if defined(SWIGRUBY)
1118 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1119 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1120 VALUE callable = (VALUE)d;
1121 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1122 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1123 return res == Qtrue;
1125 SWIGINTERN void mark_Pool(void *ptr) {
1127 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1128 VALUE callable = (VALUE)pool->loadcallbackdata;
1129 rb_gc_mark(callable);
1133 %typemap(in, numinputs=0) VALUE callable {
1134 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1136 void set_loadcallback(VALUE callable) {
1137 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1142 Pool_set_loadcallback($self, 0);
1145 Id str2id(const char *str, bool create=1) {
1146 return pool_str2id($self, str, create);
1148 Dep *Dep(const char *str, bool create=1) {
1149 Id id = pool_str2id($self, str, create);
1150 return new_Dep($self, id);
1152 const char *id2str(Id id) {
1153 return pool_id2str($self, id);
1155 const char *dep2str(Id id) {
1156 return pool_dep2str($self, id);
1158 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1159 return pool_rel2id($self, name, evr, flags, create);
1161 Id id2langid(Id id, const char *lang, bool create=1) {
1162 return pool_id2langid($self, id, lang, create);
1164 void setarch(const char *arch = 0) {
1173 pool_setarch($self, arch);
1175 Repo *add_repo(const char *name) {
1176 return repo_create($self, name);
1178 const char *lookup_str(Id entry, Id keyname) {
1179 return pool_lookup_str($self, entry, keyname);
1181 Id lookup_id(Id entry, Id keyname) {
1182 return pool_lookup_id($self, entry, keyname);
1184 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1185 return pool_lookup_num($self, entry, keyname, notfound);
1187 bool lookup_void(Id entry, Id keyname) {
1188 return pool_lookup_void($self, entry, keyname);
1190 %newobject lookup_checksum;
1191 Chksum *lookup_checksum(Id entry, Id keyname) {
1193 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1194 return solv_chksum_create_from_bin(type, b);
1197 %newobject Dataiterator;
1198 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1199 return new_Dataiterator($self, 0, p, key, match, flags);
1201 const char *solvid2str(Id solvid) {
1202 return pool_solvid2str($self, solvid);
1204 void addfileprovides() {
1205 pool_addfileprovides($self);
1207 Queue addfileprovides_queue() {
1210 pool_addfileprovides_queue($self, &r, 0);
1213 void createwhatprovides() {
1214 pool_createwhatprovides($self);
1217 XSolvable *id2solvable(Id id) {
1218 return new_XSolvable($self, id);
1220 %newobject solvables;
1221 Pool_solvable_iterator * const solvables;
1223 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1224 return new_Pool_solvable_iterator(pool);
1227 %newobject solvables_iter;
1228 Pool_solvable_iterator * solvables_iter() {
1229 return new_Pool_solvable_iterator($self);
1232 Repo *id2repo(Id id) {
1233 if (id < 1 || id >= $self->nrepos)
1235 return pool_id2repo($self, id);
1238 Pool_repo_iterator * const repos;
1240 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1241 return new_Pool_repo_iterator(pool);
1244 %newobject repos_iter;
1245 Pool_repo_iterator * repos_iter() {
1246 return new_Pool_repo_iterator($self);
1251 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1252 pool_set_installed(pool, installed);
1254 Repo *Pool_installed_get(Pool *pool) {
1255 return pool->installed;
1259 Queue matchprovidingids(const char *match, int flags) {
1265 for (id = 1; id < pool->ss.nstrings; id++)
1266 if (pool->whatprovides[id])
1270 if (!datamatcher_init(&ma, match, flags)) {
1271 for (id = 1; id < pool->ss.nstrings; id++)
1272 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1274 datamatcher_free(&ma);
1280 Job *Job(int how, Id what) {
1281 return new_Job($self, how, what);
1284 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1285 %newobject whatprovides;
1286 Queue whatprovides(Id dep) {
1291 FOR_PROVIDES(p, pp, dep)
1296 Id towhatprovides(Queue q) {
1297 return pool_queuetowhatprovides($self, &q);
1301 %rename("isknownarch?") isknownarch;
1303 bool isknownarch(Id id) {
1305 if (!id || id == ID_EMPTY)
1307 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1309 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1316 return solver_create($self);
1319 %newobject Selection;
1320 Selection *Selection() {
1321 return new_Selection($self);
1323 %newobject Selection_all;
1324 Selection *Selection_all(int setflags=0) {
1325 Selection *sel = new_Selection($self);
1326 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1330 Selection *select(const char *name, int flags) {
1331 Selection *sel = new_Selection($self);
1332 sel->flags = selection_make($self, &sel->q, name, flags);
1336 void setpooljobs_helper(Queue jobs) {
1337 queue_free(&$self->pooljobs);
1338 queue_init_clone(&$self->pooljobs, &jobs);
1340 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1341 %newobject getpooljobs;
1342 Queue getpooljobs() {
1344 queue_init_clone(&q, &$self->pooljobs);
1348 #if defined(SWIGPYTHON)
1350 def setpooljobs(self, jobs):
1352 for job in jobs: j += [job.how, job.what]
1353 self.setpooljobs_helper(j)
1356 #if defined(SWIGPERL)
1358 sub solv::Solver::setpooljobs {
1359 my ($self, $jobs) = @_;
1360 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1361 return $self->setpooljobs_helper(\@j);
1365 #if defined(SWIGRUBY)
1368 "class Solv::Pool\n"
1369 " def setpooljobs(jobs)\n"
1371 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1372 " setpooljobs_helper(jl)\n"
1381 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1382 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1383 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1384 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1385 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1386 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1387 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1388 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1389 #ifdef ENABLE_SUSEREPO
1390 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1393 void free(bool reuseids = 0) {
1394 repo_free($self, reuseids);
1396 void empty(bool reuseids = 0) {
1397 repo_empty($self, reuseids);
1400 %rename("isempty?") isempty;
1403 return !$self->nsolvables;
1405 bool add_solv(const char *name, int flags = 0) {
1406 FILE *fp = fopen(name, "r");
1410 r = repo_add_solv($self, fp, flags);
1414 bool add_solv(FILE *fp, int flags = 0) {
1415 return repo_add_solv($self, fp, flags) == 0;
1418 XSolvable *add_solvable() {
1419 Id solvid = repo_add_solvable($self);
1420 return new_XSolvable($self->pool, solvid);
1424 bool add_rpmdb(Repo *ref, int flags = 0) {
1425 return repo_add_rpmdb($self, ref, flags);
1427 Id add_rpm(const char *name, int flags = 0) {
1428 return repo_add_rpm($self, name, flags);
1431 #ifdef ENABLE_RPMDB_PUBKEYS
1432 bool add_rpmdb_pubkeys(int flags = 0) {
1433 return repo_add_rpmdb_pubkeys($self, flags);
1435 Id add_pubkey(const char *key, int flags = 0) {
1436 return repo_add_pubkey($self, key, flags);
1440 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1441 return repo_add_rpmmd($self, fp, language, flags);
1443 bool add_repomdxml(FILE *fp, int flags = 0) {
1444 return repo_add_repomdxml($self, fp, flags);
1446 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1447 return repo_add_updateinfoxml($self, fp, flags);
1449 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1450 return repo_add_deltainfoxml($self, fp, flags);
1453 #ifdef ENABLE_DEBIAN
1454 bool add_debdb(int flags = 0) {
1455 return repo_add_debdb($self, flags);
1457 Id add_deb(const char *name, int flags = 0) {
1458 return repo_add_deb($self, name, flags);
1461 #ifdef ENABLE_SUSEREPO
1462 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1463 return repo_add_susetags($self, fp, defvendor, language, flags);
1465 bool add_content(FILE *fp, int flags = 0) {
1466 return repo_add_content($self, fp, flags);
1468 bool add_products(const char *proddir, int flags = 0) {
1469 return repo_add_products($self, proddir, flags);
1472 #ifdef ENABLE_MDKREPO
1473 bool add_mdk(FILE *fp, int flags = 0) {
1474 return repo_add_mdk($self, fp, flags);
1476 bool add_mdk_info(FILE *fp, int flags = 0) {
1477 return repo_add_mdk($self, fp, flags);
1480 #ifdef ENABLE_ARCHREPO
1481 bool add_arch_repo(FILE *fp, int flags = 0) {
1482 return repo_add_arch_repo($self, fp, flags);
1484 Id add_arch_pkg(const char *name, int flags = 0) {
1485 return repo_add_arch_pkg($self, name, flags);
1488 void internalize() {
1489 repo_internalize($self);
1491 const char *lookup_str(Id entry, Id keyname) {
1492 return repo_lookup_str($self, entry, keyname);
1494 Id lookup_id(Id entry, Id keyname) {
1495 return repo_lookup_id($self, entry, keyname);
1497 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1498 return repo_lookup_num($self, entry, keyname, notfound);
1500 void write(FILE *fp) {
1501 repo_write($self, fp);
1503 # HACK, remove if no longer needed!
1504 bool write_first_repodata(FILE *fp) {
1505 int oldnrepodata = $self->nrepodata;
1506 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1507 repo_write($self, fp);
1508 $self->nrepodata = oldnrepodata;
1512 %newobject Dataiterator;
1513 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1514 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1519 SWIGINTERN Id Repo_id_get(Repo *repo) {
1520 return repo->repoid;
1523 Repo_solvable_iterator * const solvables;
1525 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1526 return new_Repo_solvable_iterator(repo);
1529 %newobject solvables_iter;
1530 Repo_solvable_iterator *solvables_iter() {
1531 return new_Repo_solvable_iterator($self);
1534 XRepodata *add_repodata(int flags = 0) {
1535 Repodata *rd = repo_add_repodata($self, flags);
1536 return new_XRepodata($self, rd->repodataid);
1539 void create_stubs() {
1541 if (!$self->nrepodata)
1543 data = repo_id2repodata($self, $self->nrepodata - 1);
1544 if (data->state != REPODATA_STUB)
1545 repodata_create_stubs(data);
1548 %rename("iscontiguous?") iscontiguous;
1550 bool iscontiguous() {
1552 for (i = $self->start; i < $self->end; i++)
1553 if ($self->pool->solvables[i].repo != $self)
1557 XRepodata *first_repodata() {
1560 if ($self->nrepodata < 2)
1562 /* make sure all repodatas but the first are extensions */
1563 data = repo_id2repodata($self, 1);
1564 if (data->loadcallback)
1566 for (i = 2; i < $self->nrepodata; i++)
1568 data = repo_id2repodata($self, i);
1569 if (!data->loadcallback)
1570 return 0; /* oops, not an extension */
1572 return new_XRepodata($self, 1);
1575 %newobject Selection;
1576 Selection *Selection(int setflags=0) {
1577 Selection *sel = new_Selection($self->pool);
1578 setflags |= SOLVER_SETREPO;
1579 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1583 bool __eq__(Repo *repo) {
1584 return $self == repo;
1586 bool __ne__(Repo *repo) {
1587 return $self != repo;
1589 #if defined(SWIGPERL)
1590 %rename("str") __str__;
1593 const char *__str__() {
1596 return solv_strdup($self->name);
1597 sprintf(buf, "Repo#%d", $self->repoid);
1598 return solv_strdup(buf);
1600 %newobject __repr__;
1601 const char *__repr__() {
1605 sprintf(buf, "<Repo #%d ", $self->repoid);
1606 return solv_dupjoin(buf, $self->name, ">");
1608 sprintf(buf, "<Repo #%d>", $self->repoid);
1609 return solv_strdup(buf);
1613 %extend Dataiterator {
1614 static const int SEARCH_STRING = SEARCH_STRING;
1615 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1616 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1617 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1618 static const int SEARCH_GLOB = SEARCH_GLOB;
1619 static const int SEARCH_REGEX = SEARCH_REGEX;
1620 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1621 static const int SEARCH_FILES = SEARCH_FILES;
1622 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1624 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1625 Dataiterator *di = solv_calloc(1, sizeof(*di));
1626 dataiterator_init(di, pool, repo, p, key, match, flags);
1630 dataiterator_free($self);
1633 #if defined(SWIGPYTHON)
1634 %newobject __iter__;
1635 Dataiterator *__iter__() {
1637 ndi = solv_calloc(1, sizeof(*ndi));
1638 dataiterator_init_clone(ndi, $self);
1641 %rename("next") __next__();
1642 %exception __next__ {
1645 PyErr_SetString(PyExc_StopIteration,"no more matches");
1652 perliter(solv::Dataiterator)
1655 %newobject __next__;
1656 Datamatch *__next__() {
1658 if (!dataiterator_step($self)) {
1661 ndi = solv_calloc(1, sizeof(*ndi));
1662 dataiterator_init_clone(ndi, $self);
1663 dataiterator_strdup(ndi);
1669 while ((d = Dataiterator___next__($self)) != 0) {
1670 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1674 void prepend_keyname(Id key) {
1675 dataiterator_prepend_keyname($self, key);
1677 void skip_solvable() {
1678 dataiterator_skip_solvable($self);
1683 Id lookup_id(Id keyname) {
1684 Pool *pool = $self->repo->pool;
1685 Datapos oldpos = pool->pos;
1688 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1692 const char *lookup_str(Id keyname) {
1693 Pool *pool = $self->repo->pool;
1694 Datapos oldpos = pool->pos;
1697 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1701 %newobject lookup_checksum;
1702 Chksum *lookup_checksum(Id keyname) {
1703 Pool *pool = $self->repo->pool;
1704 Datapos oldpos = pool->pos;
1706 const unsigned char *b;
1708 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1710 return solv_chksum_create_from_bin(type, b);
1712 const char *lookup_deltaseq() {
1713 Pool *pool = $self->repo->pool;
1714 Datapos oldpos = pool->pos;
1717 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1719 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1720 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1725 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1726 Pool *pool = $self->repo->pool;
1727 Datapos oldpos = pool->pos;
1730 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1738 dataiterator_free($self);
1741 %newobject solvable;
1742 XSolvable * const solvable;
1744 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1745 return new_XSolvable(di->pool, di->solvid);
1749 return $self->key->name;
1751 const char *key_idstr() {
1752 return pool_id2str($self->pool, $self->key->name);
1755 return $self->key->type;
1757 const char *type_idstr() {
1758 return pool_id2str($self->pool, $self->key->type);
1761 return $self->kv.id;
1763 const char *idstr() {
1764 return pool_id2str($self->pool, $self->kv.id);
1767 return $self->kv.str;
1770 return $self->kv.num;
1773 return $self->kv.num2;
1777 Pool *pool = $self->pool;
1778 Datapos *pos, oldpos = pool->pos;
1779 dataiterator_setpos($self);
1780 pos = solv_calloc(1, sizeof(*pos));
1785 %newobject parentpos;
1786 Datapos *parentpos() {
1787 Pool *pool = $self->pool;
1788 Datapos *pos, oldpos = pool->pos;
1789 dataiterator_setpos_parent($self);
1790 pos = solv_calloc(1, sizeof(*pos));
1796 dataiterator_setpos($self);
1798 void setpos_parent() {
1799 dataiterator_setpos_parent($self);
1801 #if defined(SWIGPERL)
1802 %rename("str") __str__;
1804 const char *__str__() {
1805 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1807 return $self->kv.str;
1811 %extend Pool_solvable_iterator {
1812 Pool_solvable_iterator(Pool *pool) {
1813 Pool_solvable_iterator *s;
1814 s = solv_calloc(1, sizeof(*s));
1818 #if defined(SWIGPYTHON)
1819 %newobject __iter__;
1820 Pool_solvable_iterator *__iter__() {
1821 Pool_solvable_iterator *s;
1822 s = solv_calloc(1, sizeof(*s));
1826 %rename("next") __next__();
1827 %exception __next__ {
1830 PyErr_SetString(PyExc_StopIteration,"no more matches");
1837 perliter(solv::Pool_solvable_iterator)
1839 %newobject __next__;
1840 XSolvable *__next__() {
1841 Pool *pool = $self->pool;
1842 if ($self->id >= pool->nsolvables)
1844 while (++$self->id < pool->nsolvables)
1845 if (pool->solvables[$self->id].repo)
1846 return new_XSolvable(pool, $self->id);
1852 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1853 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1857 %newobject __getitem__;
1858 XSolvable *__getitem__(Id key) {
1859 Pool *pool = $self->pool;
1860 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1861 return new_XSolvable(pool, key);
1865 return $self->pool->nsolvables;
1869 %extend Pool_repo_iterator {
1870 Pool_repo_iterator(Pool *pool) {
1871 Pool_repo_iterator *s;
1872 s = solv_calloc(1, sizeof(*s));
1876 #if defined(SWIGPYTHON)
1877 %newobject __iter__;
1878 Pool_repo_iterator *__iter__() {
1879 Pool_repo_iterator *s;
1880 s = solv_calloc(1, sizeof(*s));
1884 %rename("next") __next__();
1885 %exception __next__ {
1888 PyErr_SetString(PyExc_StopIteration,"no more matches");
1893 %newobject __next__;
1895 Pool *pool = $self->pool;
1896 if ($self->id >= pool->nrepos)
1898 while (++$self->id < pool->nrepos) {
1899 Repo *r = pool_id2repo(pool, $self->id);
1908 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1909 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1913 Repo *__getitem__(Id key) {
1914 Pool *pool = $self->pool;
1915 if (key > 0 && key < pool->nrepos)
1916 return pool_id2repo(pool, key);
1920 return $self->pool->nrepos;
1924 %extend Repo_solvable_iterator {
1925 Repo_solvable_iterator(Repo *repo) {
1926 Repo_solvable_iterator *s;
1927 s = solv_calloc(1, sizeof(*s));
1931 #if defined(SWIGPYTHON)
1932 %newobject __iter__;
1933 Repo_solvable_iterator *__iter__() {
1934 Repo_solvable_iterator *s;
1935 s = solv_calloc(1, sizeof(*s));
1939 %rename("next") __next__();
1940 %exception __next__ {
1943 PyErr_SetString(PyExc_StopIteration,"no more matches");
1948 %newobject __next__;
1949 XSolvable *__next__() {
1950 Repo *repo = $self->repo;
1951 Pool *pool = repo->pool;
1952 if (repo->start > 0 && $self->id < repo->start)
1953 $self->id = repo->start - 1;
1954 if ($self->id >= repo->end)
1956 while (++$self->id < repo->end)
1957 if (pool->solvables[$self->id].repo == repo)
1958 return new_XSolvable(pool, $self->id);
1964 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1965 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1969 %newobject __getitem__;
1970 XSolvable *__getitem__(Id key) {
1971 Repo *repo = $self->repo;
1972 Pool *pool = repo->pool;
1973 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1974 return new_XSolvable(pool, key);
1978 return $self->repo->pool->nsolvables;
1983 Dep(Pool *pool, Id id) {
1987 s = solv_calloc(1, sizeof(*s));
1993 Dep *Rel(int flags, DepId evrid, bool create=1) {
1994 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
1997 return new_Dep($self->pool, id);
1999 %newobject Selection_name;
2000 Selection *Selection_name(int setflags=0) {
2001 Selection *sel = new_Selection($self->pool);
2002 if (ISRELDEP($self->id)) {
2003 Reldep *rd = GETRELDEP($self->pool, $self->id);
2004 if (rd->flags == REL_EQ) {
2005 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2006 if (ISRELDEP(rd->name))
2007 rd = GETRELDEP($self->pool, rd->name);
2009 if (rd->flags == REL_ARCH)
2010 setflags |= SOLVER_SETARCH;
2012 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2015 %newobject Selection_provides;
2016 Selection *Selection_provides(int setflags=0) {
2017 Selection *sel = new_Selection($self->pool);
2018 if (ISRELDEP($self->id)) {
2019 Reldep *rd = GETRELDEP($self->pool, $self->id);
2020 if (rd->flags == REL_ARCH)
2021 setflags |= SOLVER_SETARCH;
2023 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2027 return pool_dep2str($self->pool, $self->id);
2029 bool __eq__(Dep *s) {
2030 return $self->pool == s->pool && $self->id == s->id;
2032 bool __ne__(Dep *s) {
2033 return !Dep___eq__($self, s);
2035 #if defined(SWIGPERL)
2036 %rename("str") __str__;
2038 const char *__str__() {
2039 return pool_dep2str($self->pool, $self->id);
2041 %newobject __repr__;
2042 const char *__repr__() {
2044 sprintf(buf, "<Id #%d ", $self->id);
2045 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2050 XSolvable(Pool *pool, Id id) {
2052 if (!id || id >= pool->nsolvables)
2054 s = solv_calloc(1, sizeof(*s));
2060 return pool_solvid2str($self->pool, $self->id);
2062 const char *lookup_str(Id keyname) {
2063 return pool_lookup_str($self->pool, $self->id, keyname);
2065 Id lookup_id(Id keyname) {
2066 return pool_lookup_id($self->pool, $self->id, keyname);
2068 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2069 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2071 bool lookup_void(Id keyname) {
2072 return pool_lookup_void($self->pool, $self->id, keyname);
2074 %newobject lookup_checksum;
2075 Chksum *lookup_checksum(Id keyname) {
2077 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2078 return solv_chksum_create_from_bin(type, b);
2080 Queue lookup_idarray(Id keyname, Id marker = -1) {
2081 Solvable *s = $self->pool->solvables + $self->id;
2084 if (marker == -1 || marker == 1) {
2085 if (keyname == SOLVABLE_PROVIDES)
2086 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2087 else if (keyname == SOLVABLE_REQUIRES)
2088 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2092 solvable_lookup_deparray(s, keyname, &r, marker);
2095 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2096 %newobject lookup_deparray;
2097 Queue lookup_deparray(Id keyname, Id marker = -1) {
2098 Solvable *s = $self->pool->solvables + $self->id;
2101 if (marker == -1 || marker == 1) {
2102 if (keyname == SOLVABLE_PROVIDES)
2103 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2104 else if (keyname == SOLVABLE_REQUIRES)
2105 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2109 solvable_lookup_deparray(s, keyname, &r, marker);
2112 const char *lookup_location(unsigned int *OUTPUT) {
2113 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2115 %newobject Dataiterator;
2116 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2117 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2120 %rename("installable?") installable;
2122 bool installable() {
2123 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2126 %rename("isinstalled?") isinstalled;
2128 bool isinstalled() {
2129 Pool *pool = $self->pool;
2130 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2135 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2136 Pool *pool = xs->pool;
2137 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2139 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2140 Pool *pool = xs->pool;
2141 return pool_id2str(pool, pool->solvables[xs->id].name);
2146 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2147 xs->pool->solvables[xs->id].name = nameid;
2149 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2150 return xs->pool->solvables[xs->id].name;
2155 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2156 Pool *pool = xs->pool;
2157 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2159 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2160 Pool *pool = xs->pool;
2161 return pool_id2str(pool, pool->solvables[xs->id].evr);
2166 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2167 xs->pool->solvables[xs->id].evr = evrid;
2169 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2170 return xs->pool->solvables[xs->id].evr;
2175 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2176 Pool *pool = xs->pool;
2177 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2179 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2180 Pool *pool = xs->pool;
2181 return pool_id2str(pool, pool->solvables[xs->id].arch);
2186 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2187 xs->pool->solvables[xs->id].arch = archid;
2189 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2190 return xs->pool->solvables[xs->id].arch;
2195 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2196 Pool *pool = xs->pool;
2197 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2199 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2200 Pool *pool = xs->pool;
2201 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2206 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2207 xs->pool->solvables[xs->id].vendor = vendorid;
2209 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2210 return xs->pool->solvables[xs->id].vendor;
2215 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2216 return xs->pool->solvables[xs->id].repo;
2220 /* old interface, please use the generic add_deparray instead */
2221 void add_provides(DepId id, Id marker = -1) {
2222 Solvable *s = $self->pool->solvables + $self->id;
2223 if (marker == -1 || marker == 1)
2224 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2225 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2227 void add_obsoletes(DepId id) {
2228 Solvable *s = $self->pool->solvables + $self->id;
2229 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2231 void add_conflicts(DepId id) {
2232 Solvable *s = $self->pool->solvables + $self->id;
2233 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2235 void add_requires(DepId id, Id marker = -1) {
2236 Solvable *s = $self->pool->solvables + $self->id;
2237 if (marker == -1 || marker == 1)
2238 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2239 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2241 void add_recommends(DepId id) {
2242 Solvable *s = $self->pool->solvables + $self->id;
2243 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2245 void add_suggests(DepId id) {
2246 Solvable *s = $self->pool->solvables + $self->id;
2247 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2249 void add_supplements(DepId id) {
2250 Solvable *s = $self->pool->solvables + $self->id;
2251 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2253 void add_enhances(DepId id) {
2254 Solvable *s = $self->pool->solvables + $self->id;
2255 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2258 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2259 Solvable *s = $self->pool->solvables + $self->id;
2260 if (marker == -1 || marker == 1) {
2261 if (keyname == SOLVABLE_PROVIDES)
2262 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2263 else if (keyname == SOLVABLE_REQUIRES)
2264 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2268 solvable_add_deparray(s, keyname, id, marker);
2271 %newobject Selection;
2272 Selection *Selection(int setflags=0) {
2273 Selection *sel = new_Selection($self->pool);
2274 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2278 bool __eq__(XSolvable *s) {
2279 return $self->pool == s->pool && $self->id == s->id;
2281 bool __ne__(XSolvable *s) {
2282 return !XSolvable___eq__($self, s);
2284 #if defined(SWIGPERL)
2285 %rename("str") __str__;
2287 const char *__str__() {
2288 return pool_solvid2str($self->pool, $self->id);
2290 %newobject __repr__;
2291 const char *__repr__() {
2293 sprintf(buf, "<Solvable #%d ", $self->id);
2294 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2299 Problem(Solver *solv, Id id) {
2301 p = solv_calloc(1, sizeof(*p));
2306 %newobject findproblemrule;
2307 XRule *findproblemrule() {
2308 Id r = solver_findproblemrule($self->solv, $self->id);
2309 return new_XRule($self->solv, r);
2311 %newobject findallproblemrules;
2312 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2313 Queue findallproblemrules(int unfiltered=0) {
2314 Solver *solv = $self->solv;
2319 solver_findallproblemrules(solv, $self->id, &q);
2322 for (i = j = 0; i < q.count; i++)
2324 SolverRuleinfo rclass;
2325 probr = q.elements[i];
2326 rclass = solver_ruleclass(solv, probr);
2327 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2329 q.elements[j++] = probr;
2332 queue_truncate(&q, j);
2336 int solution_count() {
2337 return solver_solution_count($self->solv, $self->id);
2339 %newobject solutions;
2340 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2345 cnt = solver_solution_count($self->solv, $self->id);
2346 for (i = 1; i <= cnt; i++)
2353 Solution(Problem *p, Id id) {
2355 s = solv_calloc(1, sizeof(*s));
2357 s->problemid = p->id;
2361 int element_count() {
2362 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2365 %newobject elements;
2366 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2367 Queue elements(bool expandreplaces=0) {
2371 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2372 for (i = 1; i <= cnt; i++)
2375 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2377 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2383 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2384 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2386 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2387 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2388 queue_push2(&q, p, rp);
2390 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2391 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2392 queue_push2(&q, p, rp);
2394 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2395 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2396 queue_push2(&q, p, rp);
2401 queue_push2(&q, i, type);
2402 queue_push2(&q, p, rp);
2408 %extend Solutionelement {
2409 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2411 e = solv_calloc(1, sizeof(*e));
2413 e->problemid = problemid;
2424 if (p == SOLVER_SOLUTION_ERASE)
2429 else if (p == SOLVER_SOLUTION_REPLACE)
2434 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2435 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, POLICY_ILLEGAL_DOWNGRADE, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2436 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2437 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, POLICY_ILLEGAL_ARCHCHANGE, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2438 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2439 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, POLICY_ILLEGAL_VENDORCHANGE, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2440 return solver_solutionelement2str($self->solv, p, rp);
2442 %newobject replaceelements;
2443 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2444 Queue replaceelements() {
2449 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2452 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2453 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2454 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2455 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2456 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2457 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2458 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2460 queue_push(&q, $self->type);
2463 int illegalreplace() {
2464 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2466 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2468 %newobject solvable;
2469 XSolvable * const solvable;
2470 %newobject replacement;
2471 XSolvable * const replacement;
2474 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2475 return new_XSolvable(e->solv->pool, e->p);
2477 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2478 return new_XSolvable(e->solv->pool, e->rp);
2480 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2481 if (e->type != SOLVER_SOLUTION_JOB)
2483 return (e->p - 1) / 2;
2488 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2489 if ($self->type == SOLVER_SOLUTION_JOB)
2490 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2491 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2492 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2493 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2494 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2495 if ($self->type == SOLVER_SOLUTION_ERASE)
2496 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2502 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2503 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2504 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2505 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2506 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2507 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2508 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2509 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2510 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2511 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2512 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2513 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2514 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2515 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2516 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2517 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2518 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2519 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2520 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2521 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2523 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2524 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2525 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2526 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2527 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2528 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2529 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2530 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2531 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2532 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2534 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2535 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2536 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2538 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2539 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2540 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2541 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2542 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2543 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2544 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2545 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2546 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2552 int set_flag(int flag, int value) {
2553 return solver_set_flag($self, flag, value);
2555 int get_flag(int flag) {
2556 return solver_get_flag($self, flag);
2558 #if defined(SWIGPYTHON)
2560 def solve(self, jobs):
2562 for job in jobs: j += [job.how, job.what]
2563 return self.solve_helper(j)
2566 #if defined(SWIGPERL)
2568 sub solv::Solver::solve {
2569 my ($self, $jobs) = @_;
2570 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2571 return $self->solve_helper(\@j);
2575 #if defined(SWIGRUBY)
2578 "class Solv::Solver\n"
2579 " def solve(jobs)\n"
2581 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2582 " solve_helper(jl)\n"
2588 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2589 %newobject solve_helper;
2590 Queue solve_helper(Queue jobs) {
2594 solver_solve($self, &jobs);
2595 cnt = solver_problem_count($self);
2596 for (i = 1; i <= cnt; i++)
2600 %newobject transaction;
2601 Transaction *transaction() {
2602 return solver_create_transaction($self);
2606 %extend Transaction {
2607 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2608 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2609 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2610 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2611 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2612 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2613 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2614 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2615 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2616 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2617 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2618 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2619 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2620 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2621 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2622 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2623 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2624 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2625 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2626 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2627 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2628 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2629 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2630 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2631 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2632 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2633 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2635 transaction_free($self);
2638 %rename("isempty?") isempty;
2641 return $self->steps.count == 0;
2644 %newobject othersolvable;
2645 XSolvable *othersolvable(XSolvable *s) {
2646 Id op = transaction_obs_pkg($self, s->id);
2647 return new_XSolvable($self->pool, op);
2650 %newobject allothersolvables;
2651 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2652 Queue allothersolvables(XSolvable *s) {
2655 transaction_all_obs_pkgs($self, s->id, &q);
2659 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2660 %newobject classify;
2661 Queue classify(int mode = 0) {
2664 transaction_classify($self, mode, &q);
2668 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2669 %newobject newpackages;
2670 Queue newpackages() {
2674 cut = transaction_installedresult(self, &q);
2675 queue_truncate(&q, cut);
2679 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2680 %newobject keptpackages;
2681 Queue keptpackages() {
2685 cut = transaction_installedresult(self, &q);
2687 queue_deleten(&q, 0, cut);
2691 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2695 queue_init_clone(&q, &$self->steps);
2699 int steptype(XSolvable *s, int mode) {
2700 return transaction_type($self, s->id, mode);
2702 int calc_installsizechange() {
2703 return transaction_calc_installsizechange($self);
2705 void order(int flags) {
2706 transaction_order($self, flags);
2710 %extend TransactionClass {
2711 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2712 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2713 cl->transaction = trans;
2717 cl->fromid = fromid;
2721 %newobject solvables;
2722 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2726 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2731 return new_Dep($self->transaction->pool, $self->fromid);
2735 return new_Dep($self->transaction->pool, $self->toid);
2740 XRule(Solver *solv, Id id) {
2743 XRule *xr = solv_calloc(1, sizeof(*xr));
2749 Id type, source, target, dep;
2750 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2751 return new_Ruleinfo($self, type, source, target, dep);
2753 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2754 %newobject allinfos;
2758 solver_allruleinfos($self->solv, $self->id, &q);
2762 bool __eq__(XRule *xr) {
2763 return $self->solv == xr->solv && $self->id == xr->id;
2765 bool __ne__(XRule *xr) {
2766 return !XRule___eq__($self, xr);
2768 %newobject __repr__;
2769 const char *__repr__() {
2771 sprintf(buf, "<Rule #%d>", $self->id);
2772 return solv_strdup(buf);
2777 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2778 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2782 ri->source = source;
2783 ri->target = target;
2787 XSolvable * const solvable;
2788 XSolvable * const othersolvable;
2790 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2791 return new_XSolvable(ri->solv->pool, ri->source);
2793 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2794 return new_XSolvable(ri->solv->pool, ri->target);
2797 const char *problemstr() {
2798 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2803 XRepodata(Repo *repo, Id id) {
2804 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2810 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2812 void set_id(Id solvid, Id keyname, DepId id) {
2813 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2815 void set_str(Id solvid, Id keyname, const char *str) {
2816 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2818 void set_poolstr(Id solvid, Id keyname, const char *str) {
2819 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2821 void add_idarray(Id solvid, Id keyname, DepId id) {
2822 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2824 void add_flexarray(Id solvid, Id keyname, Id handle) {
2825 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2827 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2828 const unsigned char *buf = solv_chksum_get(chksum, 0);
2830 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2832 const char *lookup_str(Id solvid, Id keyname) {
2833 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2835 Queue lookup_idarray(Id solvid, Id keyname) {
2838 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2841 %newobject lookup_checksum;
2842 Chksum *lookup_checksum(Id solvid, Id keyname) {
2844 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2845 return solv_chksum_create_from_bin(type, b);
2847 void internalize() {
2848 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2850 void create_stubs() {
2851 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2853 void write(FILE *fp) {
2854 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2856 bool add_solv(FILE *fp, int flags = 0) {
2857 Repodata *data = repo_id2repodata($self->repo, $self->id);
2858 int r, oldstate = data->state;
2859 data->state = REPODATA_LOADING;
2860 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2861 if (r || data->state == REPODATA_LOADING)
2862 data->state = oldstate;
2865 void extend_to_repo() {
2866 Repodata *data = repo_id2repodata($self->repo, $self->id);
2867 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2869 bool __eq__(XRepodata *xr) {
2870 return $self->repo == xr->repo && $self->id == xr->id;
2872 bool __ne__(XRepodata *xr) {
2873 return !XRepodata___eq__($self, xr);
2875 %newobject __repr__;
2876 const char *__repr__() {
2878 sprintf(buf, "<Repodata #%d>", $self->id);
2879 return solv_strdup(buf);