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, items - (argvi + $1.count + 1) + 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, items - (argvi + cnt + 1) + 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_SETEV = SOLVER_SETEV;
781 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
782 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
783 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
784 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
785 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
786 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
788 Job(Pool *pool, int how, Id what) {
789 Job *job = solv_calloc(1, sizeof(*job));
796 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
797 %newobject solvables;
801 pool_job2solvables($self->pool, &q, $self->how, $self->what);
805 bool __eq__(Job *j) {
806 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
808 bool __ne__(Job *j) {
809 return !Job___eq__($self, j);
811 #if defined(SWIGPERL)
812 %rename("str") __str__;
814 const char *__str__() {
815 return pool_job2str($self->pool, $self->how, $self->what, 0);
817 const char *__repr__() {
818 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
819 return pool_tmpjoin($self->pool, "<Job ", str, ">");
824 static const Id SELECTION_NAME = SELECTION_NAME;
825 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
826 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
827 static const Id SELECTION_GLOB = SELECTION_GLOB;
828 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
829 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
830 static const Id SELECTION_FLAT = SELECTION_FLAT;
831 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
832 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
834 Selection(Pool *pool) {
836 s = solv_calloc(1, sizeof(*s));
842 queue_free(&$self->q);
848 void make(const char *name, int flags) {
849 $self->flags = selection_make($self->pool, &$self->q, name, flags);
852 %rename("isempty?") isempty;
855 return $self->q.count == 0;
857 void limit(Selection *lsel) {
858 if ($self->pool != lsel->pool)
859 queue_empty(&$self->q);
861 selection_limit($self->pool, &$self->q, &lsel->q);
863 void add(Selection *lsel) {
864 if ($self->pool == lsel->pool)
866 selection_add($self->pool, &$self->q, &lsel->q);
867 $self->flags |= lsel->flags;
870 void addsimple(Id how, Id what) {
871 queue_push2(&$self->q, how, what);
873 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
875 Queue jobs(int flags) {
878 queue_init_clone(&q, &$self->q);
879 for (i = 0; i < q.count; i += 2)
880 q.elements[i] |= flags;
884 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
885 %newobject solvables;
889 selection_solvables($self->pool, &$self->q, &q);
893 #if defined(SWIGPERL)
894 %rename("str") __str__;
896 const char *__str__() {
897 return pool_selection2str($self->pool, &$self->q, 0);
899 const char *__repr__() {
900 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
901 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
907 return (Chksum *)solv_chksum_create(type);
909 Chksum(Id type, const char *hex) {
910 unsigned char buf[64];
911 int l = solv_chksum_len(type);
914 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
916 return (Chksum *)solv_chksum_create_from_bin(type, buf);
919 solv_chksum_free($self, 0);
923 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
924 return solv_chksum_get_type(chksum);
927 void add(const char *str) {
928 solv_chksum_add($self, str, strlen((char *)str));
930 void add_fp(FILE *fp) {
933 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
934 solv_chksum_add($self, buf, l);
935 rewind(fp); /* convenience */
937 void add_fd(int fd) {
940 while ((l = read(fd, buf, sizeof(buf))) > 0)
941 solv_chksum_add($self, buf, l);
942 lseek(fd, 0, 0); /* convenience */
944 void add_stat(const char *filename) {
946 if (stat(filename, &stb))
947 memset(&stb, 0, sizeof(stb));
948 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
949 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
950 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
951 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
953 void add_fstat(int fd) {
956 memset(&stb, 0, sizeof(stb));
957 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
958 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
959 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
960 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
964 const unsigned char *b;
965 b = solv_chksum_get($self, &l);
966 return cdata_void((void *)b, l);
971 const unsigned char *b;
974 b = solv_chksum_get($self, &l);
975 ret = solv_malloc(2 * l + 1);
976 solv_bin2hex(b, l, ret);
980 bool __eq__(Chksum *chk) {
982 const unsigned char *b, *bo;
985 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
987 b = solv_chksum_get($self, &l);
988 bo = solv_chksum_get(chk, 0);
989 return memcmp(b, bo, l) == 0;
991 bool __ne__(Chksum *chk) {
992 return !Chksum___eq__($self, chk);
994 #if defined(SWIGRUBY)
995 %rename("to_s") __str__;
996 %rename("inspect") __repr__;
998 #if defined(SWIGPERL)
999 %rename("str") __str__;
1002 const char *__str__() {
1005 if (solv_chksum_isfinished($self))
1006 h = Chksum_hex($self);
1007 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1008 solv_free((void *)h);
1011 %newobject __repr__;
1012 const char *__repr__() {
1013 const char *h = Chksum___str__($self);
1014 const char *str = solv_dupjoin("<Chksum ", h, ">");
1015 solv_free((void *)h);
1022 Pool *pool = pool_create();
1027 void set_debuglevel(int level) {
1028 pool_setdebuglevel($self, level);
1030 int set_flag(int flag, int value) {
1031 return pool_set_flag($self, flag, value);
1033 int get_flag(int flag) {
1034 return pool_get_flag($self, flag);
1036 void set_rootdir(const char *rootdir) {
1037 pool_set_rootdir($self, rootdir);
1039 const char *get_rootdir(int flag) {
1040 return pool_get_rootdir($self);
1042 #if defined(SWIGPYTHON)
1044 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1045 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1046 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1047 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1052 return 0; /* exception */
1053 ecode = SWIG_AsVal_int(result, &vresult);
1055 return SWIG_IsOK(ecode) ? vresult : 0;
1058 void set_loadcallback(PyObject *callable) {
1059 if ($self->loadcallback == loadcallback) {
1060 PyObject *obj = $self->loadcallbackdata;
1064 Py_INCREF(callable);
1066 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1069 #if defined(SWIGPERL)
1071 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1075 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1080 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1082 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1092 void set_loadcallback(SV *callable) {
1093 if ($self->loadcallback == loadcallback)
1094 SvREFCNT_dec($self->loadcallbackdata);
1096 SvREFCNT_inc(callable);
1097 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1101 #if defined(SWIGRUBY)
1103 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1104 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1105 VALUE callable = (VALUE)d;
1106 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1107 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1108 return res == Qtrue;
1110 SWIGINTERN void mark_Pool(void *ptr) {
1112 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1113 VALUE callable = (VALUE)pool->loadcallbackdata;
1114 rb_gc_mark(callable);
1118 %typemap(in, numinputs=0) VALUE callable {
1119 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1121 void set_loadcallback(VALUE callable) {
1122 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1127 Pool_set_loadcallback($self, 0);
1130 Id str2id(const char *str, bool create=1) {
1131 return pool_str2id($self, str, create);
1133 Dep *Dep(const char *str, bool create=1) {
1134 Id id = pool_str2id($self, str, create);
1135 return new_Dep($self, id);
1137 const char *id2str(Id id) {
1138 return pool_id2str($self, id);
1140 const char *dep2str(Id id) {
1141 return pool_dep2str($self, id);
1143 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1144 return pool_rel2id($self, name, evr, flags, create);
1146 Id id2langid(Id id, const char *lang, bool create=1) {
1147 return pool_id2langid($self, id, lang, create);
1149 void setarch(const char *arch = 0) {
1158 pool_setarch($self, arch);
1160 Repo *add_repo(const char *name) {
1161 return repo_create($self, name);
1163 const char *lookup_str(Id entry, Id keyname) {
1164 return pool_lookup_str($self, entry, keyname);
1166 Id lookup_id(Id entry, Id keyname) {
1167 return pool_lookup_id($self, entry, keyname);
1169 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1170 return pool_lookup_num($self, entry, keyname, notfound);
1172 bool lookup_void(Id entry, Id keyname) {
1173 return pool_lookup_void($self, entry, keyname);
1175 %newobject lookup_checksum;
1176 Chksum *lookup_checksum(Id entry, Id keyname) {
1178 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1179 return solv_chksum_create_from_bin(type, b);
1182 %newobject Dataiterator;
1183 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1184 return new_Dataiterator($self, 0, p, key, match, flags);
1186 const char *solvid2str(Id solvid) {
1187 return pool_solvid2str($self, solvid);
1189 void addfileprovides() {
1190 pool_addfileprovides($self);
1192 Queue addfileprovides_queue() {
1195 pool_addfileprovides_queue($self, &r, 0);
1198 void createwhatprovides() {
1199 pool_createwhatprovides($self);
1202 XSolvable *id2solvable(Id id) {
1203 return new_XSolvable($self, id);
1205 %newobject solvables;
1206 Pool_solvable_iterator * const solvables;
1208 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1209 return new_Pool_solvable_iterator(pool);
1212 %newobject solvables_iter;
1213 Pool_solvable_iterator * solvables_iter() {
1214 return new_Pool_solvable_iterator($self);
1217 Repo *id2repo(Id id) {
1218 if (id < 1 || id >= $self->nrepos)
1220 return pool_id2repo($self, id);
1223 Pool_repo_iterator * const repos;
1225 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1226 return new_Pool_repo_iterator(pool);
1229 %newobject repos_iter;
1230 Pool_repo_iterator * repos_iter() {
1231 return new_Pool_repo_iterator($self);
1236 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1237 pool_set_installed(pool, installed);
1239 Repo *Pool_installed_get(Pool *pool) {
1240 return pool->installed;
1244 Queue matchprovidingids(const char *match, int flags) {
1250 for (id = 1; id < pool->ss.nstrings; id++)
1251 if (pool->whatprovides[id])
1255 if (!datamatcher_init(&ma, match, flags)) {
1256 for (id = 1; id < pool->ss.nstrings; id++)
1257 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1259 datamatcher_free(&ma);
1265 Job *Job(int how, Id what) {
1266 return new_Job($self, how, what);
1269 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1270 %newobject whatprovides;
1271 Queue whatprovides(Id dep) {
1276 FOR_PROVIDES(p, pp, dep)
1281 Id towhatprovides(Queue q) {
1282 return pool_queuetowhatprovides($self, &q);
1286 %rename("isknownarch?") isknownarch;
1288 bool isknownarch(Id id) {
1290 if (!id || id == ID_EMPTY)
1292 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1294 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1301 return solver_create($self);
1304 %newobject Selection;
1305 Selection *Selection() {
1306 return new_Selection($self);
1309 Selection *select(const char *name, int flags) {
1310 Selection *sel = new_Selection($self);
1311 sel->flags = selection_make($self, &sel->q, name, flags);
1317 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1318 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1319 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1320 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1321 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1322 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1323 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1324 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1325 #ifdef ENABLE_SUSEREPO
1326 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1329 void free(bool reuseids = 0) {
1330 repo_free($self, reuseids);
1332 void empty(bool reuseids = 0) {
1333 repo_empty($self, reuseids);
1336 %rename("isempty?") isempty;
1339 return !$self->nsolvables;
1341 bool add_solv(const char *name, int flags = 0) {
1342 FILE *fp = fopen(name, "r");
1346 r = repo_add_solv($self, fp, flags);
1350 bool add_solv(FILE *fp, int flags = 0) {
1351 return repo_add_solv($self, fp, flags) == 0;
1354 XSolvable *add_solvable() {
1355 Id solvid = repo_add_solvable($self);
1356 return new_XSolvable($self->pool, solvid);
1360 bool add_rpmdb(Repo *ref, int flags = 0) {
1361 return repo_add_rpmdb($self, ref, flags);
1363 Id add_rpm(const char *name, int flags = 0) {
1364 return repo_add_rpm($self, name, flags);
1368 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1369 return repo_add_rpmmd($self, fp, language, flags);
1371 bool add_repomdxml(FILE *fp, int flags = 0) {
1372 return repo_add_repomdxml($self, fp, flags);
1374 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1375 return repo_add_updateinfoxml($self, fp, flags);
1377 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1378 return repo_add_deltainfoxml($self, fp, flags);
1381 #ifdef ENABLE_DEBIAN
1382 bool add_debdb(int flags = 0) {
1383 return repo_add_debdb($self, flags);
1385 Id add_deb(const char *name, int flags = 0) {
1386 return repo_add_deb($self, name, flags);
1389 #ifdef ENABLE_SUSEREPO
1390 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1391 return repo_add_susetags($self, fp, defvendor, language, flags);
1393 bool add_content(FILE *fp, int flags = 0) {
1394 return repo_add_content($self, fp, flags);
1396 bool add_products(const char *proddir, int flags = 0) {
1397 return repo_add_products($self, proddir, flags);
1400 #ifdef ENABLE_MDKREPO
1401 bool add_mdk(FILE *fp, int flags = 0) {
1402 return repo_add_mdk($self, fp, flags);
1404 bool add_mdk_info(FILE *fp, int flags = 0) {
1405 return repo_add_mdk($self, fp, flags);
1408 #ifdef ENABLE_ARCHREPO
1409 bool add_arch_repo(FILE *fp, int flags = 0) {
1410 return repo_add_arch_repo($self, fp, flags);
1412 Id add_arch_pkg(const char *name, int flags = 0) {
1413 return repo_add_arch_pkg($self, name, flags);
1416 void internalize() {
1417 repo_internalize($self);
1419 const char *lookup_str(Id entry, Id keyname) {
1420 return repo_lookup_str($self, entry, keyname);
1422 Id lookup_id(Id entry, Id keyname) {
1423 return repo_lookup_id($self, entry, keyname);
1425 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1426 return repo_lookup_num($self, entry, keyname, notfound);
1428 void write(FILE *fp) {
1429 repo_write($self, fp);
1431 # HACK, remove if no longer needed!
1432 bool write_first_repodata(FILE *fp) {
1433 int oldnrepodata = $self->nrepodata;
1434 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1435 repo_write($self, fp);
1436 $self->nrepodata = oldnrepodata;
1440 %newobject Dataiterator;
1441 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1442 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1447 SWIGINTERN Id Repo_id_get(Repo *repo) {
1448 return repo->repoid;
1451 Repo_solvable_iterator * const solvables;
1453 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1454 return new_Repo_solvable_iterator(repo);
1457 %newobject solvables_iter;
1458 Repo_solvable_iterator *solvables_iter() {
1459 return new_Repo_solvable_iterator($self);
1462 XRepodata *add_repodata(int flags = 0) {
1463 Repodata *rd = repo_add_repodata($self, flags);
1464 return new_XRepodata($self, rd->repodataid);
1467 void create_stubs() {
1469 if (!$self->nrepodata)
1471 data = repo_id2repodata($self, $self->nrepodata - 1);
1472 if (data->state != REPODATA_STUB)
1473 repodata_create_stubs(data);
1476 %rename("iscontiguous?") iscontiguous;
1478 bool iscontiguous() {
1480 for (i = $self->start; i < $self->end; i++)
1481 if ($self->pool->solvables[i].repo != $self)
1485 XRepodata *first_repodata() {
1488 if ($self->nrepodata < 2)
1490 /* make sure all repodatas but the first are extensions */
1491 data = repo_id2repodata($self, 1);
1492 if (data->loadcallback)
1494 for (i = 2; i < $self->nrepodata; i++)
1496 data = repo_id2repodata($self, i);
1497 if (!data->loadcallback)
1498 return 0; /* oops, not an extension */
1500 return new_XRepodata($self, 1);
1503 bool __eq__(Repo *repo) {
1504 return $self == repo;
1506 bool __ne__(Repo *repo) {
1507 return $self != repo;
1509 #if defined(SWIGPERL)
1510 %rename("str") __str__;
1513 const char *__str__() {
1516 return solv_strdup($self->name);
1517 sprintf(buf, "Repo#%d", $self->repoid);
1518 return solv_strdup(buf);
1520 %newobject __repr__;
1521 const char *__repr__() {
1525 sprintf(buf, "<Repo #%d ", $self->repoid);
1526 return solv_dupjoin(buf, $self->name, ">");
1528 sprintf(buf, "<Repo #%d>", $self->repoid);
1529 return solv_strdup(buf);
1533 %extend Dataiterator {
1534 static const int SEARCH_STRING = SEARCH_STRING;
1535 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1536 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1537 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1538 static const int SEARCH_GLOB = SEARCH_GLOB;
1539 static const int SEARCH_REGEX = SEARCH_REGEX;
1540 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1541 static const int SEARCH_FILES = SEARCH_FILES;
1542 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1544 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1545 Dataiterator *di = solv_calloc(1, sizeof(*di));
1546 dataiterator_init(di, pool, repo, p, key, match, flags);
1550 dataiterator_free($self);
1553 #if defined(SWIGPYTHON)
1554 %newobject __iter__;
1555 Dataiterator *__iter__() {
1557 ndi = solv_calloc(1, sizeof(*ndi));
1558 dataiterator_init_clone(ndi, $self);
1561 %rename("next") __next__();
1562 %exception __next__ {
1565 PyErr_SetString(PyExc_StopIteration,"no more matches");
1572 perliter(solv::Dataiterator)
1575 %newobject __next__;
1576 Datamatch *__next__() {
1578 if (!dataiterator_step($self)) {
1581 ndi = solv_calloc(1, sizeof(*ndi));
1582 dataiterator_init_clone(ndi, $self);
1588 while ((d = Dataiterator___next__($self)) != 0) {
1589 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1593 void prepend_keyname(Id key) {
1594 dataiterator_prepend_keyname($self, key);
1596 void skip_solvable() {
1597 dataiterator_skip_solvable($self);
1602 Id lookup_id(Id keyname) {
1603 Pool *pool = $self->repo->pool;
1604 Datapos oldpos = pool->pos;
1607 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1611 const char *lookup_str(Id keyname) {
1612 Pool *pool = $self->repo->pool;
1613 Datapos oldpos = pool->pos;
1616 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1620 %newobject lookup_checksum;
1621 Chksum *lookup_checksum(Id keyname) {
1622 Pool *pool = $self->repo->pool;
1623 Datapos oldpos = pool->pos;
1625 const unsigned char *b;
1627 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1629 return solv_chksum_create_from_bin(type, b);
1631 const char *lookup_deltaseq() {
1632 Pool *pool = $self->repo->pool;
1633 Datapos oldpos = pool->pos;
1636 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1638 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1639 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1644 const char *lookup_deltalocation() {
1645 Pool *pool = $self->repo->pool;
1646 Datapos oldpos = pool->pos;
1649 loc = pool_lookup_deltalocation(pool, SOLVID_POS);
1657 dataiterator_free($self);
1660 %newobject solvable;
1661 XSolvable * const solvable;
1663 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1664 return new_XSolvable(di->pool, di->solvid);
1668 return $self->key->name;
1670 const char *key_idstr() {
1671 return pool_id2str($self->pool, $self->key->name);
1674 return $self->key->type;
1676 const char *type_idstr() {
1677 return pool_id2str($self->pool, $self->key->type);
1680 return $self->kv.id;
1682 const char *idstr() {
1683 return pool_id2str($self->pool, $self->kv.id);
1686 return $self->kv.str;
1689 return $self->kv.num;
1692 return $self->kv.num2;
1696 Pool *pool = $self->pool;
1697 Datapos *pos, oldpos = pool->pos;
1698 dataiterator_setpos($self);
1699 pos = solv_calloc(1, sizeof(*pos));
1704 %newobject parentpos;
1705 Datapos *parentpos() {
1706 Pool *pool = $self->pool;
1707 Datapos *pos, oldpos = pool->pos;
1708 dataiterator_setpos_parent($self);
1709 pos = solv_calloc(1, sizeof(*pos));
1715 dataiterator_setpos($self);
1717 void setpos_parent() {
1718 dataiterator_setpos_parent($self);
1720 #if defined(SWIGPERL)
1721 %rename("str") __str__;
1723 const char *__str__() {
1724 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1726 return $self->kv.str;
1730 %extend Pool_solvable_iterator {
1731 Pool_solvable_iterator(Pool *pool) {
1732 Pool_solvable_iterator *s;
1733 s = solv_calloc(1, sizeof(*s));
1737 #if defined(SWIGPYTHON)
1738 %newobject __iter__;
1739 Pool_solvable_iterator *__iter__() {
1740 Pool_solvable_iterator *s;
1741 s = solv_calloc(1, sizeof(*s));
1745 %rename("next") __next__();
1746 %exception __next__ {
1749 PyErr_SetString(PyExc_StopIteration,"no more matches");
1756 perliter(solv::Pool_solvable_iterator)
1758 %newobject __next__;
1759 XSolvable *__next__() {
1760 Pool *pool = $self->pool;
1761 if ($self->id >= pool->nsolvables)
1763 while (++$self->id < pool->nsolvables)
1764 if (pool->solvables[$self->id].repo)
1765 return new_XSolvable(pool, $self->id);
1771 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1772 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1776 %newobject __getitem__;
1777 XSolvable *__getitem__(Id key) {
1778 Pool *pool = $self->pool;
1779 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1780 return new_XSolvable(pool, key);
1784 return $self->pool->nsolvables;
1788 %extend Pool_repo_iterator {
1789 Pool_repo_iterator(Pool *pool) {
1790 Pool_repo_iterator *s;
1791 s = solv_calloc(1, sizeof(*s));
1795 #if defined(SWIGPYTHON)
1796 %newobject __iter__;
1797 Pool_repo_iterator *__iter__() {
1798 Pool_repo_iterator *s;
1799 s = solv_calloc(1, sizeof(*s));
1803 %rename("next") __next__();
1804 %exception __next__ {
1807 PyErr_SetString(PyExc_StopIteration,"no more matches");
1812 %newobject __next__;
1814 Pool *pool = $self->pool;
1815 if ($self->id >= pool->nrepos)
1817 while (++$self->id < pool->nrepos) {
1818 Repo *r = pool_id2repo(pool, $self->id);
1827 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1828 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1832 Repo *__getitem__(Id key) {
1833 Pool *pool = $self->pool;
1834 if (key > 0 && key < pool->nrepos)
1835 return pool_id2repo(pool, key);
1839 return $self->pool->nrepos;
1843 %extend Repo_solvable_iterator {
1844 Repo_solvable_iterator(Repo *repo) {
1845 Repo_solvable_iterator *s;
1846 s = solv_calloc(1, sizeof(*s));
1850 #if defined(SWIGPYTHON)
1851 %newobject __iter__;
1852 Repo_solvable_iterator *__iter__() {
1853 Repo_solvable_iterator *s;
1854 s = solv_calloc(1, sizeof(*s));
1858 %rename("next") __next__();
1859 %exception __next__ {
1862 PyErr_SetString(PyExc_StopIteration,"no more matches");
1867 %newobject __next__;
1868 XSolvable *__next__() {
1869 Repo *repo = $self->repo;
1870 Pool *pool = repo->pool;
1871 if (repo->start > 0 && $self->id < repo->start)
1872 $self->id = repo->start - 1;
1873 if ($self->id >= repo->end)
1875 while (++$self->id < repo->end)
1876 if (pool->solvables[$self->id].repo == repo)
1877 return new_XSolvable(pool, $self->id);
1883 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1884 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1888 %newobject __getitem__;
1889 XSolvable *__getitem__(Id key) {
1890 Repo *repo = $self->repo;
1891 Pool *pool = repo->pool;
1892 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1893 return new_XSolvable(pool, key);
1897 return $self->repo->pool->nsolvables;
1902 Dep(Pool *pool, Id id) {
1906 s = solv_calloc(1, sizeof(*s));
1912 return pool_dep2str($self->pool, $self->id);
1914 bool __eq__(Dep *s) {
1915 return $self->pool == s->pool && $self->id == s->id;
1917 bool __ne__(Dep *s) {
1918 return !Dep___eq__($self, s);
1920 #if defined(SWIGPERL)
1921 %rename("str") __str__;
1923 const char *__str__() {
1924 return pool_dep2str($self->pool, $self->id);
1926 %newobject __repr__;
1927 const char *__repr__() {
1929 sprintf(buf, "<Id #%d ", $self->id);
1930 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1935 XSolvable(Pool *pool, Id id) {
1937 if (!id || id >= pool->nsolvables)
1939 s = solv_calloc(1, sizeof(*s));
1945 return pool_solvid2str($self->pool, $self->id);
1947 const char *lookup_str(Id keyname) {
1948 return pool_lookup_str($self->pool, $self->id, keyname);
1950 Id lookup_id(Id keyname) {
1951 return pool_lookup_id($self->pool, $self->id, keyname);
1953 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1954 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1956 bool lookup_void(Id keyname) {
1957 return pool_lookup_void($self->pool, $self->id, keyname);
1959 %newobject lookup_checksum;
1960 Chksum *lookup_checksum(Id keyname) {
1962 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1963 return solv_chksum_create_from_bin(type, b);
1965 Queue lookup_idarray(Id keyname, Id marker = -1) {
1966 Solvable *s = $self->pool->solvables + $self->id;
1969 if (marker == -1 || marker == 1) {
1970 if (keyname == SOLVABLE_PROVIDES)
1971 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1972 else if (keyname == SOLVABLE_REQUIRES)
1973 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1977 solvable_lookup_deparray(s, keyname, &r, marker);
1980 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1981 %newobject lookup_deparray;
1982 Queue lookup_deparray(Id keyname, Id marker = -1) {
1983 Solvable *s = $self->pool->solvables + $self->id;
1986 if (marker == -1 || marker == 1) {
1987 if (keyname == SOLVABLE_PROVIDES)
1988 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1989 else if (keyname == SOLVABLE_REQUIRES)
1990 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1994 solvable_lookup_deparray(s, keyname, &r, marker);
1997 const char *lookup_location(unsigned int *OUTPUT) {
1998 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2000 %newobject Dataiterator;
2001 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2002 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2005 %rename("installable?") installable;
2007 bool installable() {
2008 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2011 %rename("isinstalled?") isinstalled;
2013 bool isinstalled() {
2014 Pool *pool = $self->pool;
2015 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2020 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2021 Pool *pool = xs->pool;
2022 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2024 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2025 Pool *pool = xs->pool;
2026 return pool_id2str(pool, pool->solvables[xs->id].name);
2031 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2032 xs->pool->solvables[xs->id].name = nameid;
2034 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2035 return xs->pool->solvables[xs->id].name;
2040 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2041 Pool *pool = xs->pool;
2042 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2044 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2045 Pool *pool = xs->pool;
2046 return pool_id2str(pool, pool->solvables[xs->id].evr);
2051 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2052 xs->pool->solvables[xs->id].evr = evrid;
2054 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2055 return xs->pool->solvables[xs->id].evr;
2060 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2061 Pool *pool = xs->pool;
2062 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2064 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2065 Pool *pool = xs->pool;
2066 return pool_id2str(pool, pool->solvables[xs->id].arch);
2071 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2072 xs->pool->solvables[xs->id].arch = archid;
2074 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2075 return xs->pool->solvables[xs->id].arch;
2080 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2081 Pool *pool = xs->pool;
2082 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2084 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2085 Pool *pool = xs->pool;
2086 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2091 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2092 xs->pool->solvables[xs->id].vendor = vendorid;
2094 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2095 return xs->pool->solvables[xs->id].vendor;
2100 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2101 return xs->pool->solvables[xs->id].repo;
2105 /* old interface, please use the generic add_deparray instead */
2106 void add_provides(DepId id, Id marker = -1) {
2107 Solvable *s = $self->pool->solvables + $self->id;
2108 if (marker == -1 || marker == 1)
2109 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2110 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2112 void add_obsoletes(DepId id) {
2113 Solvable *s = $self->pool->solvables + $self->id;
2114 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2116 void add_conflicts(DepId id) {
2117 Solvable *s = $self->pool->solvables + $self->id;
2118 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2120 void add_requires(DepId id, Id marker = -1) {
2121 Solvable *s = $self->pool->solvables + $self->id;
2122 if (marker == -1 || marker == 1)
2123 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2124 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2126 void add_recommends(DepId id) {
2127 Solvable *s = $self->pool->solvables + $self->id;
2128 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2130 void add_suggests(DepId id) {
2131 Solvable *s = $self->pool->solvables + $self->id;
2132 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2134 void add_supplements(DepId id) {
2135 Solvable *s = $self->pool->solvables + $self->id;
2136 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2138 void add_enhances(DepId id) {
2139 Solvable *s = $self->pool->solvables + $self->id;
2140 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2143 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2144 Solvable *s = $self->pool->solvables + $self->id;
2145 if (marker == -1 || marker == 1) {
2146 if (keyname == SOLVABLE_PROVIDES)
2147 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2148 else if (keyname == SOLVABLE_REQUIRES)
2149 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2153 solvable_add_deparray(s, keyname, id, marker);
2156 bool __eq__(XSolvable *s) {
2157 return $self->pool == s->pool && $self->id == s->id;
2159 bool __ne__(XSolvable *s) {
2160 return !XSolvable___eq__($self, s);
2162 #if defined(SWIGPERL)
2163 %rename("str") __str__;
2165 const char *__str__() {
2166 return pool_solvid2str($self->pool, $self->id);
2168 %newobject __repr__;
2169 const char *__repr__() {
2171 sprintf(buf, "<Solvable #%d ", $self->id);
2172 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2177 Problem(Solver *solv, Id id) {
2179 p = solv_calloc(1, sizeof(*p));
2184 %newobject findproblemrule;
2185 XRule *findproblemrule() {
2186 Id r = solver_findproblemrule($self->solv, $self->id);
2187 return new_XRule($self->solv, r);
2189 %newobject findallproblemrules;
2190 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2191 Queue findallproblemrules(int unfiltered=0) {
2192 Solver *solv = $self->solv;
2197 solver_findallproblemrules(solv, $self->id, &q);
2200 for (i = j = 0; i < q.count; i++)
2202 SolverRuleinfo rclass;
2203 probr = q.elements[i];
2204 rclass = solver_ruleclass(solv, probr);
2205 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2207 q.elements[j++] = probr;
2210 queue_truncate(&q, j);
2214 int solution_count() {
2215 return solver_solution_count($self->solv, $self->id);
2217 %newobject solutions;
2218 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2223 cnt = solver_solution_count($self->solv, $self->id);
2224 for (i = 1; i <= cnt; i++)
2231 Solution(Problem *p, Id id) {
2233 s = solv_calloc(1, sizeof(*s));
2235 s->problemid = p->id;
2239 int element_count() {
2240 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2243 %newobject elements;
2244 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2245 Queue elements(bool expandreplaces=0) {
2249 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2250 for (i = 1; i <= cnt; i++)
2253 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2255 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2261 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2262 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2264 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2265 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2266 queue_push2(&q, p, rp);
2268 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2269 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2270 queue_push2(&q, p, rp);
2272 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2273 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2274 queue_push2(&q, p, rp);
2279 queue_push2(&q, i, type);
2280 queue_push2(&q, p, rp);
2286 %extend Solutionelement {
2287 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2289 e = solv_calloc(1, sizeof(*e));
2291 e->problemid = problemid;
2302 if (p == SOLVER_SOLUTION_ERASE)
2307 else if (p == SOLVER_SOLUTION_REPLACE)
2312 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2313 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);
2314 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2315 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);
2316 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2317 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);
2318 return solver_solutionelement2str($self->solv, p, rp);
2320 %newobject replaceelements;
2321 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2322 Queue replaceelements() {
2327 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2330 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2331 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2332 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2333 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2334 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2335 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2336 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2338 queue_push(&q, $self->type);
2341 int illegalreplace() {
2342 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2344 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2346 %newobject solvable;
2347 XSolvable * const solvable;
2348 %newobject replacement;
2349 XSolvable * const replacement;
2352 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2353 return new_XSolvable(e->solv->pool, e->p);
2355 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2356 return new_XSolvable(e->solv->pool, e->rp);
2358 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2359 if (e->type != SOLVER_SOLUTION_JOB)
2361 return (e->p - 1) / 2;
2366 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2367 if ($self->type == SOLVER_SOLUTION_JOB)
2368 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2369 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2370 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2371 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2372 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2373 if ($self->type == SOLVER_SOLUTION_ERASE)
2374 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2380 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2381 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2382 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2383 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2384 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2385 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2386 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2387 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2388 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2389 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2390 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2391 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2392 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2393 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2394 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2395 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2396 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2397 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2398 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2400 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2401 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2402 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2403 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2404 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2405 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2406 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2407 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2409 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2410 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2411 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2413 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2414 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2415 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2416 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2417 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2418 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2419 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2420 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2421 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2427 int set_flag(int flag, int value) {
2428 return solver_set_flag($self, flag, value);
2430 int get_flag(int flag) {
2431 return solver_get_flag($self, flag);
2433 #if defined(SWIGPYTHON)
2435 def solve(self, jobs):
2437 for job in jobs: j += [job.how, job.what]
2438 return self.solve_helper(j)
2441 #if defined(SWIGPERL)
2443 sub solv::Solver::solve {
2444 my ($self, $jobs) = @_;
2445 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2446 return $self->solve_helper(\@j);
2450 #if defined(SWIGRUBY)
2453 "class Solv::Solver\n"
2454 " def solve(jobs)\n"
2456 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2457 " solve_helper(jl)\n"
2463 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2464 %newobject solve_helper;
2465 Queue solve_helper(Queue jobs) {
2469 solver_solve($self, &jobs);
2470 cnt = solver_problem_count($self);
2471 for (i = 1; i <= cnt; i++)
2475 %newobject transaction;
2476 Transaction *transaction() {
2477 return solver_create_transaction($self);
2481 %extend Transaction {
2482 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2483 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2484 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2485 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2486 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2487 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2488 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2489 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2490 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2491 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2492 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2493 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2494 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2495 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2496 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2497 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2498 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2499 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2500 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2501 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2502 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2503 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2504 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2505 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2506 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2507 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2508 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2510 transaction_free($self);
2513 %rename("isempty?") isempty;
2516 return $self->steps.count == 0;
2519 %newobject othersolvable;
2520 XSolvable *othersolvable(XSolvable *s) {
2521 Id op = transaction_obs_pkg($self, s->id);
2522 return new_XSolvable($self->pool, op);
2525 %newobject allothersolvables;
2526 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2527 Queue allothersolvables(XSolvable *s) {
2530 transaction_all_obs_pkgs($self, s->id, &q);
2534 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2535 %newobject classify;
2536 Queue classify(int mode = 0) {
2539 transaction_classify($self, mode, &q);
2543 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2544 %newobject newpackages;
2545 Queue newpackages() {
2549 cut = transaction_installedresult(self, &q);
2550 queue_truncate(&q, cut);
2554 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2555 %newobject keptpackages;
2556 Queue keptpackages() {
2560 cut = transaction_installedresult(self, &q);
2562 queue_deleten(&q, 0, cut);
2566 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2570 queue_init_clone(&q, &$self->steps);
2574 int steptype(XSolvable *s, int mode) {
2575 return transaction_type($self, s->id, mode);
2577 int calc_installsizechange() {
2578 return transaction_calc_installsizechange($self);
2580 void order(int flags) {
2581 transaction_order($self, flags);
2585 %extend TransactionClass {
2586 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2587 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2588 cl->transaction = trans;
2592 cl->fromid = fromid;
2596 %newobject solvables;
2597 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2601 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2606 return new_Dep($self->transaction->pool, $self->fromid);
2610 return new_Dep($self->transaction->pool, $self->toid);
2615 XRule(Solver *solv, Id id) {
2618 XRule *xr = solv_calloc(1, sizeof(*xr));
2624 Id type, source, target, dep;
2625 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2626 return new_Ruleinfo($self, type, source, target, dep);
2628 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2629 %newobject allinfos;
2633 solver_allruleinfos($self->solv, $self->id, &q);
2637 bool __eq__(XRule *xr) {
2638 return $self->solv == xr->solv && $self->id == xr->id;
2640 bool __ne__(XRule *xr) {
2641 return !XRule___eq__($self, xr);
2643 %newobject __repr__;
2644 const char *__repr__() {
2646 sprintf(buf, "<Rule #%d>", $self->id);
2647 return solv_strdup(buf);
2652 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2653 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2657 ri->source = source;
2658 ri->target = target;
2662 XSolvable * const solvable;
2663 XSolvable * const othersolvable;
2665 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2666 return new_XSolvable(ri->solv->pool, ri->source);
2668 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2669 return new_XSolvable(ri->solv->pool, ri->target);
2672 const char *problemstr() {
2673 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2678 XRepodata(Repo *repo, Id id) {
2679 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2685 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2687 void set_id(Id solvid, Id keyname, DepId id) {
2688 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2690 void set_str(Id solvid, Id keyname, const char *str) {
2691 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2693 void set_poolstr(Id solvid, Id keyname, const char *str) {
2694 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2696 void add_idarray(Id solvid, Id keyname, DepId id) {
2697 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2699 void add_flexarray(Id solvid, Id keyname, Id handle) {
2700 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2702 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2703 const unsigned char *buf = solv_chksum_get(chksum, 0);
2705 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2707 const char *lookup_str(Id solvid, Id keyname) {
2708 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2710 Queue lookup_idarray(Id solvid, Id keyname) {
2713 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2716 %newobject lookup_checksum;
2717 Chksum *lookup_checksum(Id solvid, Id keyname) {
2719 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2720 return solv_chksum_create_from_bin(type, b);
2722 void internalize() {
2723 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2725 void create_stubs() {
2726 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2728 void write(FILE *fp) {
2729 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2731 bool add_solv(FILE *fp, int flags = 0) {
2732 Repodata *data = repo_id2repodata($self->repo, $self->id);
2733 int r, oldstate = data->state;
2734 data->state = REPODATA_LOADING;
2735 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2736 if (r || data->state == REPODATA_LOADING)
2737 data->state = oldstate;
2740 void extend_to_repo() {
2741 Repodata *data = repo_id2repodata($self->repo, $self->id);
2742 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2744 bool __eq__(XRepodata *xr) {
2745 return $self->repo == xr->repo && $self->id == xr->id;
2747 bool __ne__(XRepodata *xr) {
2748 return !XRepodata___eq__($self, xr);
2750 %newobject __repr__;
2751 const char *__repr__() {
2753 sprintf(buf, "<Repodata #%d>", $self->id);
2754 return solv_strdup(buf);