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"
423 #include "repo_deb.h"
426 #include "repo_rpmmd.h"
427 #include "repo_updateinfoxml.h"
428 #include "repo_deltainfoxml.h"
429 #include "repo_repomdxml.h"
431 #ifdef ENABLE_SUSEREPO
432 #include "repo_products.h"
433 #include "repo_susetags.h"
434 #include "repo_content.h"
436 #ifdef ENABLE_MDKREPO
437 #include "repo_mdk.h"
439 #ifdef ENABLE_ARCHREPO
440 #include "repo_arch.h"
442 #include "solv_xfopen.h"
444 /* for old ruby versions */
446 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
449 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
452 #define SOLVER_SOLUTION_ERASE -100
453 #define SOLVER_SOLUTION_REPLACE -101
454 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
455 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
456 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
458 typedef struct chksum Chksum;
459 typedef void *AppObjectPtr;
485 } Pool_solvable_iterator;
490 } Pool_repo_iterator;
495 } Repo_solvable_iterator;
535 Transaction *transaction;
553 typedef Dataiterator Datamatch;
558 %mixin Dataiterator "Enumerable";
559 %mixin Pool_solvable_iterator "Enumerable";
560 %mixin Pool_repo_iterator "Enumerable";
561 %mixin Repo_solvable_iterator "Enumerable";
569 %constant Id SOLVID_META;
570 %constant Id SOLVID_POS;
572 %constant int REL_EQ;
573 %constant int REL_GT;
574 %constant int REL_LT;
575 %constant int REL_ARCH;
586 # put before pool/repo so we can access the constructor
587 %nodefaultdtor Dataiterator;
588 typedef struct {} Dataiterator;
611 typedef struct {} Pool_solvable_iterator;
612 typedef struct {} Pool_repo_iterator;
613 typedef struct {} Repo_solvable_iterator;
615 %nodefaultctor Datamatch;
616 %nodefaultdtor Datamatch;
623 %nodefaultctor Datapos;
637 AppObjectPtr appdata;
644 const char * const name;
647 int const nsolvables;
648 AppObjectPtr appdata;
651 %nodefaultctor Solver;
652 %nodefaultdtor Solver;
660 %rename(xfopen) solvfp_xfopen;
661 %rename(xfopen_fd) solvfp_xfopen_fd;
663 %nodefaultctor SolvFp;
667 %newobject solvfp_xfopen;
668 %newobject solvfp_xfopen_fd;
670 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
671 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
674 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
678 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
681 sfp = solv_calloc(1, sizeof(SolvFp));
685 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
688 fp = solv_xfopen(fn, mode);
691 sfp = solv_calloc(1, sizeof(SolvFp));
716 %nodefaultctor Transaction;
717 %nodefaultdtor Transaction;
723 Transaction * const transaction;
737 return $self->fp ? fileno($self->fp) : -1;
740 return $self->fp ? dup(fileno($self->fp)) : -1;
745 return fflush($self->fp) == 0;
751 ret = fclose($self->fp) == 0;
758 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
759 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
760 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
761 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
762 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
763 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
764 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
765 static const Id SOLVER_NOOP = SOLVER_NOOP;
766 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
767 static const Id SOLVER_ERASE = SOLVER_ERASE;
768 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
769 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
770 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
771 static const Id SOLVER_LOCK = SOLVER_LOCK;
772 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
773 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
774 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
775 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
776 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
777 static const Id SOLVER_WEAK = SOLVER_WEAK;
778 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
779 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
780 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
781 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
782 static const Id SOLVER_SETEV = SOLVER_SETEV;
783 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
784 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
785 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
786 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
787 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
788 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
789 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
791 Job(Pool *pool, int how, Id what) {
792 Job *job = solv_calloc(1, sizeof(*job));
799 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
800 %newobject solvables;
804 pool_job2solvables($self->pool, &q, $self->how, $self->what);
808 %rename("isemptyupdate?") isemptyupdate;
810 bool isemptyupdate() {
811 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
814 bool __eq__(Job *j) {
815 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
817 bool __ne__(Job *j) {
818 return !Job___eq__($self, j);
820 #if defined(SWIGPERL)
821 %rename("str") __str__;
823 const char *__str__() {
824 return pool_job2str($self->pool, $self->how, $self->what, 0);
826 const char *__repr__() {
827 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
828 return pool_tmpjoin($self->pool, "<Job ", str, ">");
833 static const Id SELECTION_NAME = SELECTION_NAME;
834 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
835 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
836 static const Id SELECTION_CANON = SELECTION_CANON;
837 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
838 static const Id SELECTION_REL = SELECTION_REL;
839 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
840 static const Id SELECTION_GLOB = SELECTION_GLOB;
841 static const Id SELECTION_FLAT = SELECTION_FLAT;
842 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
843 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
844 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
846 Selection(Pool *pool) {
848 s = solv_calloc(1, sizeof(*s));
854 queue_free(&$self->q);
860 void make(const char *name, int flags) {
861 $self->flags = selection_make($self->pool, &$self->q, name, flags);
864 %rename("isempty?") isempty;
867 return $self->q.count == 0;
869 void filter(Selection *lsel) {
870 if ($self->pool != lsel->pool)
871 queue_empty(&$self->q);
873 selection_filter($self->pool, &$self->q, &lsel->q);
875 void add(Selection *lsel) {
876 if ($self->pool == lsel->pool)
878 selection_add($self->pool, &$self->q, &lsel->q);
879 $self->flags |= lsel->flags;
882 void add_raw(Id how, Id what) {
883 queue_push2(&$self->q, how, what);
885 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
887 Queue jobs(int flags) {
890 queue_init_clone(&q, &$self->q);
891 for (i = 0; i < q.count; i += 2)
892 q.elements[i] |= flags;
896 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
897 %newobject solvables;
901 selection_solvables($self->pool, &$self->q, &q);
905 #if defined(SWIGPERL)
906 %rename("str") __str__;
908 const char *__str__() {
909 return pool_selection2str($self->pool, &$self->q, 0);
911 const char *__repr__() {
912 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
913 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
919 return (Chksum *)solv_chksum_create(type);
921 Chksum(Id type, const char *hex) {
922 unsigned char buf[64];
923 int l = solv_chksum_len(type);
926 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
928 return (Chksum *)solv_chksum_create_from_bin(type, buf);
931 solv_chksum_free($self, 0);
935 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
936 return solv_chksum_get_type(chksum);
939 void add(const char *str) {
940 solv_chksum_add($self, str, strlen((char *)str));
942 void add_fp(FILE *fp) {
945 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
946 solv_chksum_add($self, buf, l);
947 rewind(fp); /* convenience */
949 void add_fd(int fd) {
952 while ((l = read(fd, buf, sizeof(buf))) > 0)
953 solv_chksum_add($self, buf, l);
954 lseek(fd, 0, 0); /* convenience */
956 void add_stat(const char *filename) {
958 if (stat(filename, &stb))
959 memset(&stb, 0, sizeof(stb));
960 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
961 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
962 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
963 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
965 void add_fstat(int fd) {
968 memset(&stb, 0, sizeof(stb));
969 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
970 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
971 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
972 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
976 const unsigned char *b;
977 b = solv_chksum_get($self, &l);
978 return cdata_void((void *)b, l);
983 const unsigned char *b;
986 b = solv_chksum_get($self, &l);
987 ret = solv_malloc(2 * l + 1);
988 solv_bin2hex(b, l, ret);
992 bool __eq__(Chksum *chk) {
994 const unsigned char *b, *bo;
997 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
999 b = solv_chksum_get($self, &l);
1000 bo = solv_chksum_get(chk, 0);
1001 return memcmp(b, bo, l) == 0;
1003 bool __ne__(Chksum *chk) {
1004 return !Chksum___eq__($self, chk);
1006 #if defined(SWIGRUBY)
1007 %rename("to_s") __str__;
1008 %rename("inspect") __repr__;
1010 #if defined(SWIGPERL)
1011 %rename("str") __str__;
1014 const char *__str__() {
1017 if (solv_chksum_isfinished($self))
1018 h = Chksum_hex($self);
1019 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1020 solv_free((void *)h);
1023 %newobject __repr__;
1024 const char *__repr__() {
1025 const char *h = Chksum___str__($self);
1026 const char *str = solv_dupjoin("<Chksum ", h, ">");
1027 solv_free((void *)h);
1034 Pool *pool = pool_create();
1039 void set_debuglevel(int level) {
1040 pool_setdebuglevel($self, level);
1042 int set_flag(int flag, int value) {
1043 return pool_set_flag($self, flag, value);
1045 int get_flag(int flag) {
1046 return pool_get_flag($self, flag);
1048 void set_rootdir(const char *rootdir) {
1049 pool_set_rootdir($self, rootdir);
1051 const char *get_rootdir(int flag) {
1052 return pool_get_rootdir($self);
1054 #if defined(SWIGPYTHON)
1056 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1057 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1058 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1059 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1064 return 0; /* exception */
1065 ecode = SWIG_AsVal_int(result, &vresult);
1067 return SWIG_IsOK(ecode) ? vresult : 0;
1070 void set_loadcallback(PyObject *callable) {
1071 if ($self->loadcallback == loadcallback) {
1072 PyObject *obj = $self->loadcallbackdata;
1076 Py_INCREF(callable);
1078 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1081 #if defined(SWIGPERL)
1083 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1087 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1092 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1094 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1104 void set_loadcallback(SV *callable) {
1105 if ($self->loadcallback == loadcallback)
1106 SvREFCNT_dec($self->loadcallbackdata);
1108 SvREFCNT_inc(callable);
1109 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1113 #if defined(SWIGRUBY)
1115 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1116 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1117 VALUE callable = (VALUE)d;
1118 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1119 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1120 return res == Qtrue;
1122 SWIGINTERN void mark_Pool(void *ptr) {
1124 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1125 VALUE callable = (VALUE)pool->loadcallbackdata;
1126 rb_gc_mark(callable);
1130 %typemap(in, numinputs=0) VALUE callable {
1131 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1133 void set_loadcallback(VALUE callable) {
1134 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1139 Pool_set_loadcallback($self, 0);
1142 Id str2id(const char *str, bool create=1) {
1143 return pool_str2id($self, str, create);
1145 Dep *Dep(const char *str, bool create=1) {
1146 Id id = pool_str2id($self, str, create);
1147 return new_Dep($self, id);
1149 const char *id2str(Id id) {
1150 return pool_id2str($self, id);
1152 const char *dep2str(Id id) {
1153 return pool_dep2str($self, id);
1155 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1156 return pool_rel2id($self, name, evr, flags, create);
1158 Id id2langid(Id id, const char *lang, bool create=1) {
1159 return pool_id2langid($self, id, lang, create);
1161 void setarch(const char *arch = 0) {
1170 pool_setarch($self, arch);
1172 Repo *add_repo(const char *name) {
1173 return repo_create($self, name);
1175 const char *lookup_str(Id entry, Id keyname) {
1176 return pool_lookup_str($self, entry, keyname);
1178 Id lookup_id(Id entry, Id keyname) {
1179 return pool_lookup_id($self, entry, keyname);
1181 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1182 return pool_lookup_num($self, entry, keyname, notfound);
1184 bool lookup_void(Id entry, Id keyname) {
1185 return pool_lookup_void($self, entry, keyname);
1187 %newobject lookup_checksum;
1188 Chksum *lookup_checksum(Id entry, Id keyname) {
1190 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1191 return solv_chksum_create_from_bin(type, b);
1194 %newobject Dataiterator;
1195 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1196 return new_Dataiterator($self, 0, p, key, match, flags);
1198 const char *solvid2str(Id solvid) {
1199 return pool_solvid2str($self, solvid);
1201 void addfileprovides() {
1202 pool_addfileprovides($self);
1204 Queue addfileprovides_queue() {
1207 pool_addfileprovides_queue($self, &r, 0);
1210 void createwhatprovides() {
1211 pool_createwhatprovides($self);
1214 XSolvable *id2solvable(Id id) {
1215 return new_XSolvable($self, id);
1217 %newobject solvables;
1218 Pool_solvable_iterator * const solvables;
1220 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1221 return new_Pool_solvable_iterator(pool);
1224 %newobject solvables_iter;
1225 Pool_solvable_iterator * solvables_iter() {
1226 return new_Pool_solvable_iterator($self);
1229 Repo *id2repo(Id id) {
1230 if (id < 1 || id >= $self->nrepos)
1232 return pool_id2repo($self, id);
1235 Pool_repo_iterator * const repos;
1237 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1238 return new_Pool_repo_iterator(pool);
1241 %newobject repos_iter;
1242 Pool_repo_iterator * repos_iter() {
1243 return new_Pool_repo_iterator($self);
1248 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1249 pool_set_installed(pool, installed);
1251 Repo *Pool_installed_get(Pool *pool) {
1252 return pool->installed;
1256 Queue matchprovidingids(const char *match, int flags) {
1262 for (id = 1; id < pool->ss.nstrings; id++)
1263 if (pool->whatprovides[id])
1267 if (!datamatcher_init(&ma, match, flags)) {
1268 for (id = 1; id < pool->ss.nstrings; id++)
1269 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1271 datamatcher_free(&ma);
1277 Job *Job(int how, Id what) {
1278 return new_Job($self, how, what);
1281 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1282 %newobject whatprovides;
1283 Queue whatprovides(Id dep) {
1288 FOR_PROVIDES(p, pp, dep)
1293 Id towhatprovides(Queue q) {
1294 return pool_queuetowhatprovides($self, &q);
1298 %rename("isknownarch?") isknownarch;
1300 bool isknownarch(Id id) {
1302 if (!id || id == ID_EMPTY)
1304 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1306 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1313 return solver_create($self);
1316 %newobject Selection;
1317 Selection *Selection() {
1318 return new_Selection($self);
1320 %newobject Selection_all;
1321 Selection *Selection_all(int setflags=0) {
1322 Selection *sel = new_Selection($self);
1323 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1327 Selection *select(const char *name, int flags) {
1328 Selection *sel = new_Selection($self);
1329 sel->flags = selection_make($self, &sel->q, name, flags);
1333 void setpooljobs_helper(Queue jobs) {
1334 queue_free(&$self->pooljobs);
1335 queue_init_clone(&$self->pooljobs, &jobs);
1337 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1338 %newobject getpooljobs;
1339 Queue getpooljobs() {
1341 queue_init_clone(&q, &$self->pooljobs);
1345 #if defined(SWIGPYTHON)
1347 def setpooljobs(self, jobs):
1349 for job in jobs: j += [job.how, job.what]
1350 self.setpooljobs_helper(j)
1353 #if defined(SWIGPERL)
1355 sub solv::Solver::setpooljobs {
1356 my ($self, $jobs) = @_;
1357 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1358 return $self->setpooljobs_helper(\@j);
1362 #if defined(SWIGRUBY)
1365 "class Solv::Pool\n"
1366 " def setpooljobs(jobs)\n"
1368 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1369 " setpooljobs_helper(jl)\n"
1378 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1379 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1380 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1381 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1382 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1383 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1384 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1385 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1386 #ifdef ENABLE_SUSEREPO
1387 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1390 void free(bool reuseids = 0) {
1391 repo_free($self, reuseids);
1393 void empty(bool reuseids = 0) {
1394 repo_empty($self, reuseids);
1397 %rename("isempty?") isempty;
1400 return !$self->nsolvables;
1402 bool add_solv(const char *name, int flags = 0) {
1403 FILE *fp = fopen(name, "r");
1407 r = repo_add_solv($self, fp, flags);
1411 bool add_solv(FILE *fp, int flags = 0) {
1412 return repo_add_solv($self, fp, flags) == 0;
1415 XSolvable *add_solvable() {
1416 Id solvid = repo_add_solvable($self);
1417 return new_XSolvable($self->pool, solvid);
1421 bool add_rpmdb(Repo *ref, int flags = 0) {
1422 return repo_add_rpmdb($self, ref, flags);
1424 Id add_rpm(const char *name, int flags = 0) {
1425 return repo_add_rpm($self, name, flags);
1429 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1430 return repo_add_rpmmd($self, fp, language, flags);
1432 bool add_repomdxml(FILE *fp, int flags = 0) {
1433 return repo_add_repomdxml($self, fp, flags);
1435 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1436 return repo_add_updateinfoxml($self, fp, flags);
1438 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1439 return repo_add_deltainfoxml($self, fp, flags);
1442 #ifdef ENABLE_DEBIAN
1443 bool add_debdb(int flags = 0) {
1444 return repo_add_debdb($self, flags);
1446 Id add_deb(const char *name, int flags = 0) {
1447 return repo_add_deb($self, name, flags);
1450 #ifdef ENABLE_SUSEREPO
1451 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1452 return repo_add_susetags($self, fp, defvendor, language, flags);
1454 bool add_content(FILE *fp, int flags = 0) {
1455 return repo_add_content($self, fp, flags);
1457 bool add_products(const char *proddir, int flags = 0) {
1458 return repo_add_products($self, proddir, flags);
1461 #ifdef ENABLE_MDKREPO
1462 bool add_mdk(FILE *fp, int flags = 0) {
1463 return repo_add_mdk($self, fp, flags);
1465 bool add_mdk_info(FILE *fp, int flags = 0) {
1466 return repo_add_mdk($self, fp, flags);
1469 #ifdef ENABLE_ARCHREPO
1470 bool add_arch_repo(FILE *fp, int flags = 0) {
1471 return repo_add_arch_repo($self, fp, flags);
1473 Id add_arch_pkg(const char *name, int flags = 0) {
1474 return repo_add_arch_pkg($self, name, flags);
1477 void internalize() {
1478 repo_internalize($self);
1480 const char *lookup_str(Id entry, Id keyname) {
1481 return repo_lookup_str($self, entry, keyname);
1483 Id lookup_id(Id entry, Id keyname) {
1484 return repo_lookup_id($self, entry, keyname);
1486 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1487 return repo_lookup_num($self, entry, keyname, notfound);
1489 void write(FILE *fp) {
1490 repo_write($self, fp);
1492 # HACK, remove if no longer needed!
1493 bool write_first_repodata(FILE *fp) {
1494 int oldnrepodata = $self->nrepodata;
1495 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1496 repo_write($self, fp);
1497 $self->nrepodata = oldnrepodata;
1501 %newobject Dataiterator;
1502 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1503 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1508 SWIGINTERN Id Repo_id_get(Repo *repo) {
1509 return repo->repoid;
1512 Repo_solvable_iterator * const solvables;
1514 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1515 return new_Repo_solvable_iterator(repo);
1518 %newobject solvables_iter;
1519 Repo_solvable_iterator *solvables_iter() {
1520 return new_Repo_solvable_iterator($self);
1523 XRepodata *add_repodata(int flags = 0) {
1524 Repodata *rd = repo_add_repodata($self, flags);
1525 return new_XRepodata($self, rd->repodataid);
1528 void create_stubs() {
1530 if (!$self->nrepodata)
1532 data = repo_id2repodata($self, $self->nrepodata - 1);
1533 if (data->state != REPODATA_STUB)
1534 repodata_create_stubs(data);
1537 %rename("iscontiguous?") iscontiguous;
1539 bool iscontiguous() {
1541 for (i = $self->start; i < $self->end; i++)
1542 if ($self->pool->solvables[i].repo != $self)
1546 XRepodata *first_repodata() {
1549 if ($self->nrepodata < 2)
1551 /* make sure all repodatas but the first are extensions */
1552 data = repo_id2repodata($self, 1);
1553 if (data->loadcallback)
1555 for (i = 2; i < $self->nrepodata; i++)
1557 data = repo_id2repodata($self, i);
1558 if (!data->loadcallback)
1559 return 0; /* oops, not an extension */
1561 return new_XRepodata($self, 1);
1564 %newobject Selection;
1565 Selection *Selection(int setflags=0) {
1566 Selection *sel = new_Selection($self->pool);
1567 setflags |= SOLVER_SETREPO;
1568 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1572 bool __eq__(Repo *repo) {
1573 return $self == repo;
1575 bool __ne__(Repo *repo) {
1576 return $self != repo;
1578 #if defined(SWIGPERL)
1579 %rename("str") __str__;
1582 const char *__str__() {
1585 return solv_strdup($self->name);
1586 sprintf(buf, "Repo#%d", $self->repoid);
1587 return solv_strdup(buf);
1589 %newobject __repr__;
1590 const char *__repr__() {
1594 sprintf(buf, "<Repo #%d ", $self->repoid);
1595 return solv_dupjoin(buf, $self->name, ">");
1597 sprintf(buf, "<Repo #%d>", $self->repoid);
1598 return solv_strdup(buf);
1602 %extend Dataiterator {
1603 static const int SEARCH_STRING = SEARCH_STRING;
1604 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1605 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1606 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1607 static const int SEARCH_GLOB = SEARCH_GLOB;
1608 static const int SEARCH_REGEX = SEARCH_REGEX;
1609 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1610 static const int SEARCH_FILES = SEARCH_FILES;
1611 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1613 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1614 Dataiterator *di = solv_calloc(1, sizeof(*di));
1615 dataiterator_init(di, pool, repo, p, key, match, flags);
1619 dataiterator_free($self);
1622 #if defined(SWIGPYTHON)
1623 %newobject __iter__;
1624 Dataiterator *__iter__() {
1626 ndi = solv_calloc(1, sizeof(*ndi));
1627 dataiterator_init_clone(ndi, $self);
1630 %rename("next") __next__();
1631 %exception __next__ {
1634 PyErr_SetString(PyExc_StopIteration,"no more matches");
1641 perliter(solv::Dataiterator)
1644 %newobject __next__;
1645 Datamatch *__next__() {
1647 if (!dataiterator_step($self)) {
1650 ndi = solv_calloc(1, sizeof(*ndi));
1651 dataiterator_init_clone(ndi, $self);
1652 dataiterator_strdup(ndi);
1658 while ((d = Dataiterator___next__($self)) != 0) {
1659 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1663 void prepend_keyname(Id key) {
1664 dataiterator_prepend_keyname($self, key);
1666 void skip_solvable() {
1667 dataiterator_skip_solvable($self);
1672 Id lookup_id(Id keyname) {
1673 Pool *pool = $self->repo->pool;
1674 Datapos oldpos = pool->pos;
1677 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1681 const char *lookup_str(Id keyname) {
1682 Pool *pool = $self->repo->pool;
1683 Datapos oldpos = pool->pos;
1686 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1690 %newobject lookup_checksum;
1691 Chksum *lookup_checksum(Id keyname) {
1692 Pool *pool = $self->repo->pool;
1693 Datapos oldpos = pool->pos;
1695 const unsigned char *b;
1697 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1699 return solv_chksum_create_from_bin(type, b);
1701 const char *lookup_deltaseq() {
1702 Pool *pool = $self->repo->pool;
1703 Datapos oldpos = pool->pos;
1706 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1708 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1709 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1714 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1715 Pool *pool = $self->repo->pool;
1716 Datapos oldpos = pool->pos;
1719 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1727 dataiterator_free($self);
1730 %newobject solvable;
1731 XSolvable * const solvable;
1733 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1734 return new_XSolvable(di->pool, di->solvid);
1738 return $self->key->name;
1740 const char *key_idstr() {
1741 return pool_id2str($self->pool, $self->key->name);
1744 return $self->key->type;
1746 const char *type_idstr() {
1747 return pool_id2str($self->pool, $self->key->type);
1750 return $self->kv.id;
1752 const char *idstr() {
1753 return pool_id2str($self->pool, $self->kv.id);
1756 return $self->kv.str;
1759 return $self->kv.num;
1762 return $self->kv.num2;
1766 Pool *pool = $self->pool;
1767 Datapos *pos, oldpos = pool->pos;
1768 dataiterator_setpos($self);
1769 pos = solv_calloc(1, sizeof(*pos));
1774 %newobject parentpos;
1775 Datapos *parentpos() {
1776 Pool *pool = $self->pool;
1777 Datapos *pos, oldpos = pool->pos;
1778 dataiterator_setpos_parent($self);
1779 pos = solv_calloc(1, sizeof(*pos));
1785 dataiterator_setpos($self);
1787 void setpos_parent() {
1788 dataiterator_setpos_parent($self);
1790 #if defined(SWIGPERL)
1791 %rename("str") __str__;
1793 const char *__str__() {
1794 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1796 return $self->kv.str;
1800 %extend Pool_solvable_iterator {
1801 Pool_solvable_iterator(Pool *pool) {
1802 Pool_solvable_iterator *s;
1803 s = solv_calloc(1, sizeof(*s));
1807 #if defined(SWIGPYTHON)
1808 %newobject __iter__;
1809 Pool_solvable_iterator *__iter__() {
1810 Pool_solvable_iterator *s;
1811 s = solv_calloc(1, sizeof(*s));
1815 %rename("next") __next__();
1816 %exception __next__ {
1819 PyErr_SetString(PyExc_StopIteration,"no more matches");
1826 perliter(solv::Pool_solvable_iterator)
1828 %newobject __next__;
1829 XSolvable *__next__() {
1830 Pool *pool = $self->pool;
1831 if ($self->id >= pool->nsolvables)
1833 while (++$self->id < pool->nsolvables)
1834 if (pool->solvables[$self->id].repo)
1835 return new_XSolvable(pool, $self->id);
1841 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1842 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1846 %newobject __getitem__;
1847 XSolvable *__getitem__(Id key) {
1848 Pool *pool = $self->pool;
1849 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1850 return new_XSolvable(pool, key);
1854 return $self->pool->nsolvables;
1858 %extend Pool_repo_iterator {
1859 Pool_repo_iterator(Pool *pool) {
1860 Pool_repo_iterator *s;
1861 s = solv_calloc(1, sizeof(*s));
1865 #if defined(SWIGPYTHON)
1866 %newobject __iter__;
1867 Pool_repo_iterator *__iter__() {
1868 Pool_repo_iterator *s;
1869 s = solv_calloc(1, sizeof(*s));
1873 %rename("next") __next__();
1874 %exception __next__ {
1877 PyErr_SetString(PyExc_StopIteration,"no more matches");
1882 %newobject __next__;
1884 Pool *pool = $self->pool;
1885 if ($self->id >= pool->nrepos)
1887 while (++$self->id < pool->nrepos) {
1888 Repo *r = pool_id2repo(pool, $self->id);
1897 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1898 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1902 Repo *__getitem__(Id key) {
1903 Pool *pool = $self->pool;
1904 if (key > 0 && key < pool->nrepos)
1905 return pool_id2repo(pool, key);
1909 return $self->pool->nrepos;
1913 %extend Repo_solvable_iterator {
1914 Repo_solvable_iterator(Repo *repo) {
1915 Repo_solvable_iterator *s;
1916 s = solv_calloc(1, sizeof(*s));
1920 #if defined(SWIGPYTHON)
1921 %newobject __iter__;
1922 Repo_solvable_iterator *__iter__() {
1923 Repo_solvable_iterator *s;
1924 s = solv_calloc(1, sizeof(*s));
1928 %rename("next") __next__();
1929 %exception __next__ {
1932 PyErr_SetString(PyExc_StopIteration,"no more matches");
1937 %newobject __next__;
1938 XSolvable *__next__() {
1939 Repo *repo = $self->repo;
1940 Pool *pool = repo->pool;
1941 if (repo->start > 0 && $self->id < repo->start)
1942 $self->id = repo->start - 1;
1943 if ($self->id >= repo->end)
1945 while (++$self->id < repo->end)
1946 if (pool->solvables[$self->id].repo == repo)
1947 return new_XSolvable(pool, $self->id);
1953 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1954 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1958 %newobject __getitem__;
1959 XSolvable *__getitem__(Id key) {
1960 Repo *repo = $self->repo;
1961 Pool *pool = repo->pool;
1962 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1963 return new_XSolvable(pool, key);
1967 return $self->repo->pool->nsolvables;
1972 Dep(Pool *pool, Id id) {
1976 s = solv_calloc(1, sizeof(*s));
1982 Dep *Rel(int flags, DepId evrid, bool create=1) {
1983 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
1986 return new_Dep($self->pool, id);
1988 %newobject Selection_name;
1989 Selection *Selection_name(int setflags=0) {
1990 Selection *sel = new_Selection($self->pool);
1991 if (ISRELDEP($self->id)) {
1992 Reldep *rd = GETRELDEP($self->pool, $self->id);
1993 if (rd->flags == REL_EQ) {
1994 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
1995 if (ISRELDEP(rd->name))
1996 rd = GETRELDEP($self->pool, rd->name);
1998 if (rd->flags == REL_ARCH)
1999 setflags |= SOLVER_SETARCH;
2001 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2004 %newobject Selection_provides;
2005 Selection *Selection_provides(int setflags=0) {
2006 Selection *sel = new_Selection($self->pool);
2007 if (ISRELDEP($self->id)) {
2008 Reldep *rd = GETRELDEP($self->pool, $self->id);
2009 if (rd->flags == REL_ARCH)
2010 setflags |= SOLVER_SETARCH;
2012 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2016 return pool_dep2str($self->pool, $self->id);
2018 bool __eq__(Dep *s) {
2019 return $self->pool == s->pool && $self->id == s->id;
2021 bool __ne__(Dep *s) {
2022 return !Dep___eq__($self, s);
2024 #if defined(SWIGPERL)
2025 %rename("str") __str__;
2027 const char *__str__() {
2028 return pool_dep2str($self->pool, $self->id);
2030 %newobject __repr__;
2031 const char *__repr__() {
2033 sprintf(buf, "<Id #%d ", $self->id);
2034 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2039 XSolvable(Pool *pool, Id id) {
2041 if (!id || id >= pool->nsolvables)
2043 s = solv_calloc(1, sizeof(*s));
2049 return pool_solvid2str($self->pool, $self->id);
2051 const char *lookup_str(Id keyname) {
2052 return pool_lookup_str($self->pool, $self->id, keyname);
2054 Id lookup_id(Id keyname) {
2055 return pool_lookup_id($self->pool, $self->id, keyname);
2057 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2058 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2060 bool lookup_void(Id keyname) {
2061 return pool_lookup_void($self->pool, $self->id, keyname);
2063 %newobject lookup_checksum;
2064 Chksum *lookup_checksum(Id keyname) {
2066 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2067 return solv_chksum_create_from_bin(type, b);
2069 Queue lookup_idarray(Id keyname, Id marker = -1) {
2070 Solvable *s = $self->pool->solvables + $self->id;
2073 if (marker == -1 || marker == 1) {
2074 if (keyname == SOLVABLE_PROVIDES)
2075 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2076 else if (keyname == SOLVABLE_REQUIRES)
2077 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2081 solvable_lookup_deparray(s, keyname, &r, marker);
2084 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2085 %newobject lookup_deparray;
2086 Queue lookup_deparray(Id keyname, Id marker = -1) {
2087 Solvable *s = $self->pool->solvables + $self->id;
2090 if (marker == -1 || marker == 1) {
2091 if (keyname == SOLVABLE_PROVIDES)
2092 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2093 else if (keyname == SOLVABLE_REQUIRES)
2094 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2098 solvable_lookup_deparray(s, keyname, &r, marker);
2101 const char *lookup_location(unsigned int *OUTPUT) {
2102 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2104 %newobject Dataiterator;
2105 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2106 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2109 %rename("installable?") installable;
2111 bool installable() {
2112 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2115 %rename("isinstalled?") isinstalled;
2117 bool isinstalled() {
2118 Pool *pool = $self->pool;
2119 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2124 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2125 Pool *pool = xs->pool;
2126 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2128 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2129 Pool *pool = xs->pool;
2130 return pool_id2str(pool, pool->solvables[xs->id].name);
2135 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2136 xs->pool->solvables[xs->id].name = nameid;
2138 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2139 return xs->pool->solvables[xs->id].name;
2144 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2145 Pool *pool = xs->pool;
2146 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2148 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2149 Pool *pool = xs->pool;
2150 return pool_id2str(pool, pool->solvables[xs->id].evr);
2155 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2156 xs->pool->solvables[xs->id].evr = evrid;
2158 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2159 return xs->pool->solvables[xs->id].evr;
2164 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2165 Pool *pool = xs->pool;
2166 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2168 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2169 Pool *pool = xs->pool;
2170 return pool_id2str(pool, pool->solvables[xs->id].arch);
2175 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2176 xs->pool->solvables[xs->id].arch = archid;
2178 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2179 return xs->pool->solvables[xs->id].arch;
2184 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2185 Pool *pool = xs->pool;
2186 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2188 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2189 Pool *pool = xs->pool;
2190 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2195 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2196 xs->pool->solvables[xs->id].vendor = vendorid;
2198 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2199 return xs->pool->solvables[xs->id].vendor;
2204 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2205 return xs->pool->solvables[xs->id].repo;
2209 /* old interface, please use the generic add_deparray instead */
2210 void add_provides(DepId id, Id marker = -1) {
2211 Solvable *s = $self->pool->solvables + $self->id;
2212 if (marker == -1 || marker == 1)
2213 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2214 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2216 void add_obsoletes(DepId id) {
2217 Solvable *s = $self->pool->solvables + $self->id;
2218 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2220 void add_conflicts(DepId id) {
2221 Solvable *s = $self->pool->solvables + $self->id;
2222 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2224 void add_requires(DepId id, Id marker = -1) {
2225 Solvable *s = $self->pool->solvables + $self->id;
2226 if (marker == -1 || marker == 1)
2227 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2228 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2230 void add_recommends(DepId id) {
2231 Solvable *s = $self->pool->solvables + $self->id;
2232 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2234 void add_suggests(DepId id) {
2235 Solvable *s = $self->pool->solvables + $self->id;
2236 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2238 void add_supplements(DepId id) {
2239 Solvable *s = $self->pool->solvables + $self->id;
2240 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2242 void add_enhances(DepId id) {
2243 Solvable *s = $self->pool->solvables + $self->id;
2244 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2247 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2248 Solvable *s = $self->pool->solvables + $self->id;
2249 if (marker == -1 || marker == 1) {
2250 if (keyname == SOLVABLE_PROVIDES)
2251 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2252 else if (keyname == SOLVABLE_REQUIRES)
2253 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2257 solvable_add_deparray(s, keyname, id, marker);
2260 %newobject Selection;
2261 Selection *Selection(int setflags=0) {
2262 Selection *sel = new_Selection($self->pool);
2263 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2267 bool __eq__(XSolvable *s) {
2268 return $self->pool == s->pool && $self->id == s->id;
2270 bool __ne__(XSolvable *s) {
2271 return !XSolvable___eq__($self, s);
2273 #if defined(SWIGPERL)
2274 %rename("str") __str__;
2276 const char *__str__() {
2277 return pool_solvid2str($self->pool, $self->id);
2279 %newobject __repr__;
2280 const char *__repr__() {
2282 sprintf(buf, "<Solvable #%d ", $self->id);
2283 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2288 Problem(Solver *solv, Id id) {
2290 p = solv_calloc(1, sizeof(*p));
2295 %newobject findproblemrule;
2296 XRule *findproblemrule() {
2297 Id r = solver_findproblemrule($self->solv, $self->id);
2298 return new_XRule($self->solv, r);
2300 %newobject findallproblemrules;
2301 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2302 Queue findallproblemrules(int unfiltered=0) {
2303 Solver *solv = $self->solv;
2308 solver_findallproblemrules(solv, $self->id, &q);
2311 for (i = j = 0; i < q.count; i++)
2313 SolverRuleinfo rclass;
2314 probr = q.elements[i];
2315 rclass = solver_ruleclass(solv, probr);
2316 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2318 q.elements[j++] = probr;
2321 queue_truncate(&q, j);
2325 int solution_count() {
2326 return solver_solution_count($self->solv, $self->id);
2328 %newobject solutions;
2329 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2334 cnt = solver_solution_count($self->solv, $self->id);
2335 for (i = 1; i <= cnt; i++)
2342 Solution(Problem *p, Id id) {
2344 s = solv_calloc(1, sizeof(*s));
2346 s->problemid = p->id;
2350 int element_count() {
2351 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2354 %newobject elements;
2355 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2356 Queue elements(bool expandreplaces=0) {
2360 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2361 for (i = 1; i <= cnt; i++)
2364 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2366 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2372 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2373 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2375 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2376 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2377 queue_push2(&q, p, rp);
2379 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2380 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2381 queue_push2(&q, p, rp);
2383 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2384 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2385 queue_push2(&q, p, rp);
2390 queue_push2(&q, i, type);
2391 queue_push2(&q, p, rp);
2397 %extend Solutionelement {
2398 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2400 e = solv_calloc(1, sizeof(*e));
2402 e->problemid = problemid;
2413 if (p == SOLVER_SOLUTION_ERASE)
2418 else if (p == SOLVER_SOLUTION_REPLACE)
2423 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2424 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);
2425 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2426 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);
2427 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2428 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);
2429 return solver_solutionelement2str($self->solv, p, rp);
2431 %newobject replaceelements;
2432 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2433 Queue replaceelements() {
2438 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2441 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2442 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2443 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2444 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2445 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2446 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2447 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2449 queue_push(&q, $self->type);
2452 int illegalreplace() {
2453 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2455 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2457 %newobject solvable;
2458 XSolvable * const solvable;
2459 %newobject replacement;
2460 XSolvable * const replacement;
2463 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2464 return new_XSolvable(e->solv->pool, e->p);
2466 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2467 return new_XSolvable(e->solv->pool, e->rp);
2469 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2470 if (e->type != SOLVER_SOLUTION_JOB)
2472 return (e->p - 1) / 2;
2477 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2478 if ($self->type == SOLVER_SOLUTION_JOB)
2479 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2480 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2481 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2482 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2483 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2484 if ($self->type == SOLVER_SOLUTION_ERASE)
2485 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2491 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2492 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2493 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2494 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2495 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2496 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2497 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2498 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2499 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2500 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2501 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2502 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2503 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2504 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2505 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2506 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2507 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2508 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2509 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2510 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2512 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2513 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2514 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2515 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2516 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2517 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2518 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2519 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2520 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2521 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2523 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2524 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2525 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2527 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2528 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2529 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2530 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2531 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2532 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2533 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2534 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2535 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2541 int set_flag(int flag, int value) {
2542 return solver_set_flag($self, flag, value);
2544 int get_flag(int flag) {
2545 return solver_get_flag($self, flag);
2547 #if defined(SWIGPYTHON)
2549 def solve(self, jobs):
2551 for job in jobs: j += [job.how, job.what]
2552 return self.solve_helper(j)
2555 #if defined(SWIGPERL)
2557 sub solv::Solver::solve {
2558 my ($self, $jobs) = @_;
2559 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2560 return $self->solve_helper(\@j);
2564 #if defined(SWIGRUBY)
2567 "class Solv::Solver\n"
2568 " def solve(jobs)\n"
2570 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2571 " solve_helper(jl)\n"
2577 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2578 %newobject solve_helper;
2579 Queue solve_helper(Queue jobs) {
2583 solver_solve($self, &jobs);
2584 cnt = solver_problem_count($self);
2585 for (i = 1; i <= cnt; i++)
2589 %newobject transaction;
2590 Transaction *transaction() {
2591 return solver_create_transaction($self);
2595 %extend Transaction {
2596 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2597 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2598 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2599 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2600 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2601 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2602 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2603 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2604 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2605 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2606 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2607 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2608 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2609 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2610 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2611 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2612 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2613 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2614 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2615 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2616 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2617 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2618 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2619 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2620 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2621 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2622 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2624 transaction_free($self);
2627 %rename("isempty?") isempty;
2630 return $self->steps.count == 0;
2633 %newobject othersolvable;
2634 XSolvable *othersolvable(XSolvable *s) {
2635 Id op = transaction_obs_pkg($self, s->id);
2636 return new_XSolvable($self->pool, op);
2639 %newobject allothersolvables;
2640 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2641 Queue allothersolvables(XSolvable *s) {
2644 transaction_all_obs_pkgs($self, s->id, &q);
2648 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2649 %newobject classify;
2650 Queue classify(int mode = 0) {
2653 transaction_classify($self, mode, &q);
2657 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2658 %newobject newpackages;
2659 Queue newpackages() {
2663 cut = transaction_installedresult(self, &q);
2664 queue_truncate(&q, cut);
2668 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2669 %newobject keptpackages;
2670 Queue keptpackages() {
2674 cut = transaction_installedresult(self, &q);
2676 queue_deleten(&q, 0, cut);
2680 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2684 queue_init_clone(&q, &$self->steps);
2688 int steptype(XSolvable *s, int mode) {
2689 return transaction_type($self, s->id, mode);
2691 int calc_installsizechange() {
2692 return transaction_calc_installsizechange($self);
2694 void order(int flags) {
2695 transaction_order($self, flags);
2699 %extend TransactionClass {
2700 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2701 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2702 cl->transaction = trans;
2706 cl->fromid = fromid;
2710 %newobject solvables;
2711 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2715 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2720 return new_Dep($self->transaction->pool, $self->fromid);
2724 return new_Dep($self->transaction->pool, $self->toid);
2729 XRule(Solver *solv, Id id) {
2732 XRule *xr = solv_calloc(1, sizeof(*xr));
2738 Id type, source, target, dep;
2739 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2740 return new_Ruleinfo($self, type, source, target, dep);
2742 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2743 %newobject allinfos;
2747 solver_allruleinfos($self->solv, $self->id, &q);
2751 bool __eq__(XRule *xr) {
2752 return $self->solv == xr->solv && $self->id == xr->id;
2754 bool __ne__(XRule *xr) {
2755 return !XRule___eq__($self, xr);
2757 %newobject __repr__;
2758 const char *__repr__() {
2760 sprintf(buf, "<Rule #%d>", $self->id);
2761 return solv_strdup(buf);
2766 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2767 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2771 ri->source = source;
2772 ri->target = target;
2776 XSolvable * const solvable;
2777 XSolvable * const othersolvable;
2779 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2780 return new_XSolvable(ri->solv->pool, ri->source);
2782 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2783 return new_XSolvable(ri->solv->pool, ri->target);
2786 const char *problemstr() {
2787 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2792 XRepodata(Repo *repo, Id id) {
2793 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2799 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2801 void set_id(Id solvid, Id keyname, DepId id) {
2802 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2804 void set_str(Id solvid, Id keyname, const char *str) {
2805 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2807 void set_poolstr(Id solvid, Id keyname, const char *str) {
2808 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2810 void add_idarray(Id solvid, Id keyname, DepId id) {
2811 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2813 void add_flexarray(Id solvid, Id keyname, Id handle) {
2814 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2816 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2817 const unsigned char *buf = solv_chksum_get(chksum, 0);
2819 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2821 const char *lookup_str(Id solvid, Id keyname) {
2822 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2824 Queue lookup_idarray(Id solvid, Id keyname) {
2827 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2830 %newobject lookup_checksum;
2831 Chksum *lookup_checksum(Id solvid, Id keyname) {
2833 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2834 return solv_chksum_create_from_bin(type, b);
2836 void internalize() {
2837 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2839 void create_stubs() {
2840 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2842 void write(FILE *fp) {
2843 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2845 bool add_solv(FILE *fp, int flags = 0) {
2846 Repodata *data = repo_id2repodata($self->repo, $self->id);
2847 int r, oldstate = data->state;
2848 data->state = REPODATA_LOADING;
2849 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2850 if (r || data->state == REPODATA_LOADING)
2851 data->state = oldstate;
2854 void extend_to_repo() {
2855 Repodata *data = repo_id2repodata($self->repo, $self->id);
2856 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2858 bool __eq__(XRepodata *xr) {
2859 return $self->repo == xr->repo && $self->id == xr->id;
2861 bool __ne__(XRepodata *xr) {
2862 return !XRepodata___eq__($self, xr);
2864 %newobject __repr__;
2865 const char *__repr__() {
2867 sprintf(buf, "<Repodata #%d>", $self->id);
2868 return solv_strdup(buf);