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);
1321 Selection *select(const char *name, int flags) {
1322 Selection *sel = new_Selection($self);
1323 sel->flags = selection_make($self, &sel->q, name, flags);
1329 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1330 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1331 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1332 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1333 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1334 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1335 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1336 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1337 #ifdef ENABLE_SUSEREPO
1338 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1341 void free(bool reuseids = 0) {
1342 repo_free($self, reuseids);
1344 void empty(bool reuseids = 0) {
1345 repo_empty($self, reuseids);
1348 %rename("isempty?") isempty;
1351 return !$self->nsolvables;
1353 bool add_solv(const char *name, int flags = 0) {
1354 FILE *fp = fopen(name, "r");
1358 r = repo_add_solv($self, fp, flags);
1362 bool add_solv(FILE *fp, int flags = 0) {
1363 return repo_add_solv($self, fp, flags) == 0;
1366 XSolvable *add_solvable() {
1367 Id solvid = repo_add_solvable($self);
1368 return new_XSolvable($self->pool, solvid);
1372 bool add_rpmdb(Repo *ref, int flags = 0) {
1373 return repo_add_rpmdb($self, ref, flags);
1375 Id add_rpm(const char *name, int flags = 0) {
1376 return repo_add_rpm($self, name, flags);
1380 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1381 return repo_add_rpmmd($self, fp, language, flags);
1383 bool add_repomdxml(FILE *fp, int flags = 0) {
1384 return repo_add_repomdxml($self, fp, flags);
1386 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1387 return repo_add_updateinfoxml($self, fp, flags);
1389 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1390 return repo_add_deltainfoxml($self, fp, flags);
1393 #ifdef ENABLE_DEBIAN
1394 bool add_debdb(int flags = 0) {
1395 return repo_add_debdb($self, flags);
1397 Id add_deb(const char *name, int flags = 0) {
1398 return repo_add_deb($self, name, flags);
1401 #ifdef ENABLE_SUSEREPO
1402 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1403 return repo_add_susetags($self, fp, defvendor, language, flags);
1405 bool add_content(FILE *fp, int flags = 0) {
1406 return repo_add_content($self, fp, flags);
1408 bool add_products(const char *proddir, int flags = 0) {
1409 return repo_add_products($self, proddir, flags);
1412 #ifdef ENABLE_MDKREPO
1413 bool add_mdk(FILE *fp, int flags = 0) {
1414 return repo_add_mdk($self, fp, flags);
1416 bool add_mdk_info(FILE *fp, int flags = 0) {
1417 return repo_add_mdk($self, fp, flags);
1420 #ifdef ENABLE_ARCHREPO
1421 bool add_arch_repo(FILE *fp, int flags = 0) {
1422 return repo_add_arch_repo($self, fp, flags);
1424 Id add_arch_pkg(const char *name, int flags = 0) {
1425 return repo_add_arch_pkg($self, name, flags);
1428 void internalize() {
1429 repo_internalize($self);
1431 const char *lookup_str(Id entry, Id keyname) {
1432 return repo_lookup_str($self, entry, keyname);
1434 Id lookup_id(Id entry, Id keyname) {
1435 return repo_lookup_id($self, entry, keyname);
1437 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1438 return repo_lookup_num($self, entry, keyname, notfound);
1440 void write(FILE *fp) {
1441 repo_write($self, fp);
1443 # HACK, remove if no longer needed!
1444 bool write_first_repodata(FILE *fp) {
1445 int oldnrepodata = $self->nrepodata;
1446 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1447 repo_write($self, fp);
1448 $self->nrepodata = oldnrepodata;
1452 %newobject Dataiterator;
1453 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1454 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1459 SWIGINTERN Id Repo_id_get(Repo *repo) {
1460 return repo->repoid;
1463 Repo_solvable_iterator * const solvables;
1465 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1466 return new_Repo_solvable_iterator(repo);
1469 %newobject solvables_iter;
1470 Repo_solvable_iterator *solvables_iter() {
1471 return new_Repo_solvable_iterator($self);
1474 XRepodata *add_repodata(int flags = 0) {
1475 Repodata *rd = repo_add_repodata($self, flags);
1476 return new_XRepodata($self, rd->repodataid);
1479 void create_stubs() {
1481 if (!$self->nrepodata)
1483 data = repo_id2repodata($self, $self->nrepodata - 1);
1484 if (data->state != REPODATA_STUB)
1485 repodata_create_stubs(data);
1488 %rename("iscontiguous?") iscontiguous;
1490 bool iscontiguous() {
1492 for (i = $self->start; i < $self->end; i++)
1493 if ($self->pool->solvables[i].repo != $self)
1497 XRepodata *first_repodata() {
1500 if ($self->nrepodata < 2)
1502 /* make sure all repodatas but the first are extensions */
1503 data = repo_id2repodata($self, 1);
1504 if (data->loadcallback)
1506 for (i = 2; i < $self->nrepodata; i++)
1508 data = repo_id2repodata($self, i);
1509 if (!data->loadcallback)
1510 return 0; /* oops, not an extension */
1512 return new_XRepodata($self, 1);
1515 bool __eq__(Repo *repo) {
1516 return $self == repo;
1518 bool __ne__(Repo *repo) {
1519 return $self != repo;
1521 #if defined(SWIGPERL)
1522 %rename("str") __str__;
1525 const char *__str__() {
1528 return solv_strdup($self->name);
1529 sprintf(buf, "Repo#%d", $self->repoid);
1530 return solv_strdup(buf);
1532 %newobject __repr__;
1533 const char *__repr__() {
1537 sprintf(buf, "<Repo #%d ", $self->repoid);
1538 return solv_dupjoin(buf, $self->name, ">");
1540 sprintf(buf, "<Repo #%d>", $self->repoid);
1541 return solv_strdup(buf);
1545 %extend Dataiterator {
1546 static const int SEARCH_STRING = SEARCH_STRING;
1547 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1548 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1549 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1550 static const int SEARCH_GLOB = SEARCH_GLOB;
1551 static const int SEARCH_REGEX = SEARCH_REGEX;
1552 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1553 static const int SEARCH_FILES = SEARCH_FILES;
1554 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1556 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1557 Dataiterator *di = solv_calloc(1, sizeof(*di));
1558 dataiterator_init(di, pool, repo, p, key, match, flags);
1562 dataiterator_free($self);
1565 #if defined(SWIGPYTHON)
1566 %newobject __iter__;
1567 Dataiterator *__iter__() {
1569 ndi = solv_calloc(1, sizeof(*ndi));
1570 dataiterator_init_clone(ndi, $self);
1573 %rename("next") __next__();
1574 %exception __next__ {
1577 PyErr_SetString(PyExc_StopIteration,"no more matches");
1584 perliter(solv::Dataiterator)
1587 %newobject __next__;
1588 Datamatch *__next__() {
1590 if (!dataiterator_step($self)) {
1593 ndi = solv_calloc(1, sizeof(*ndi));
1594 dataiterator_init_clone(ndi, $self);
1600 while ((d = Dataiterator___next__($self)) != 0) {
1601 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1605 void prepend_keyname(Id key) {
1606 dataiterator_prepend_keyname($self, key);
1608 void skip_solvable() {
1609 dataiterator_skip_solvable($self);
1614 Id lookup_id(Id keyname) {
1615 Pool *pool = $self->repo->pool;
1616 Datapos oldpos = pool->pos;
1619 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1623 const char *lookup_str(Id keyname) {
1624 Pool *pool = $self->repo->pool;
1625 Datapos oldpos = pool->pos;
1628 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1632 %newobject lookup_checksum;
1633 Chksum *lookup_checksum(Id keyname) {
1634 Pool *pool = $self->repo->pool;
1635 Datapos oldpos = pool->pos;
1637 const unsigned char *b;
1639 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1641 return solv_chksum_create_from_bin(type, b);
1643 const char *lookup_deltaseq() {
1644 Pool *pool = $self->repo->pool;
1645 Datapos oldpos = pool->pos;
1648 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1650 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1651 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1656 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1657 Pool *pool = $self->repo->pool;
1658 Datapos oldpos = pool->pos;
1661 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1669 dataiterator_free($self);
1672 %newobject solvable;
1673 XSolvable * const solvable;
1675 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1676 return new_XSolvable(di->pool, di->solvid);
1680 return $self->key->name;
1682 const char *key_idstr() {
1683 return pool_id2str($self->pool, $self->key->name);
1686 return $self->key->type;
1688 const char *type_idstr() {
1689 return pool_id2str($self->pool, $self->key->type);
1692 return $self->kv.id;
1694 const char *idstr() {
1695 return pool_id2str($self->pool, $self->kv.id);
1698 return $self->kv.str;
1701 return $self->kv.num;
1704 return $self->kv.num2;
1708 Pool *pool = $self->pool;
1709 Datapos *pos, oldpos = pool->pos;
1710 dataiterator_setpos($self);
1711 pos = solv_calloc(1, sizeof(*pos));
1716 %newobject parentpos;
1717 Datapos *parentpos() {
1718 Pool *pool = $self->pool;
1719 Datapos *pos, oldpos = pool->pos;
1720 dataiterator_setpos_parent($self);
1721 pos = solv_calloc(1, sizeof(*pos));
1727 dataiterator_setpos($self);
1729 void setpos_parent() {
1730 dataiterator_setpos_parent($self);
1732 #if defined(SWIGPERL)
1733 %rename("str") __str__;
1735 const char *__str__() {
1736 if (!repodata_stringify($self->pool, $self->data, $self->key, &$self->kv, $self->flags))
1738 return $self->kv.str;
1742 %extend Pool_solvable_iterator {
1743 Pool_solvable_iterator(Pool *pool) {
1744 Pool_solvable_iterator *s;
1745 s = solv_calloc(1, sizeof(*s));
1749 #if defined(SWIGPYTHON)
1750 %newobject __iter__;
1751 Pool_solvable_iterator *__iter__() {
1752 Pool_solvable_iterator *s;
1753 s = solv_calloc(1, sizeof(*s));
1757 %rename("next") __next__();
1758 %exception __next__ {
1761 PyErr_SetString(PyExc_StopIteration,"no more matches");
1768 perliter(solv::Pool_solvable_iterator)
1770 %newobject __next__;
1771 XSolvable *__next__() {
1772 Pool *pool = $self->pool;
1773 if ($self->id >= pool->nsolvables)
1775 while (++$self->id < pool->nsolvables)
1776 if (pool->solvables[$self->id].repo)
1777 return new_XSolvable(pool, $self->id);
1783 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1784 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1788 %newobject __getitem__;
1789 XSolvable *__getitem__(Id key) {
1790 Pool *pool = $self->pool;
1791 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1792 return new_XSolvable(pool, key);
1796 return $self->pool->nsolvables;
1800 %extend Pool_repo_iterator {
1801 Pool_repo_iterator(Pool *pool) {
1802 Pool_repo_iterator *s;
1803 s = solv_calloc(1, sizeof(*s));
1807 #if defined(SWIGPYTHON)
1808 %newobject __iter__;
1809 Pool_repo_iterator *__iter__() {
1810 Pool_repo_iterator *s;
1811 s = solv_calloc(1, sizeof(*s));
1815 %rename("next") __next__();
1816 %exception __next__ {
1819 PyErr_SetString(PyExc_StopIteration,"no more matches");
1824 %newobject __next__;
1826 Pool *pool = $self->pool;
1827 if ($self->id >= pool->nrepos)
1829 while (++$self->id < pool->nrepos) {
1830 Repo *r = pool_id2repo(pool, $self->id);
1839 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1840 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1844 Repo *__getitem__(Id key) {
1845 Pool *pool = $self->pool;
1846 if (key > 0 && key < pool->nrepos)
1847 return pool_id2repo(pool, key);
1851 return $self->pool->nrepos;
1855 %extend Repo_solvable_iterator {
1856 Repo_solvable_iterator(Repo *repo) {
1857 Repo_solvable_iterator *s;
1858 s = solv_calloc(1, sizeof(*s));
1862 #if defined(SWIGPYTHON)
1863 %newobject __iter__;
1864 Repo_solvable_iterator *__iter__() {
1865 Repo_solvable_iterator *s;
1866 s = solv_calloc(1, sizeof(*s));
1870 %rename("next") __next__();
1871 %exception __next__ {
1874 PyErr_SetString(PyExc_StopIteration,"no more matches");
1879 %newobject __next__;
1880 XSolvable *__next__() {
1881 Repo *repo = $self->repo;
1882 Pool *pool = repo->pool;
1883 if (repo->start > 0 && $self->id < repo->start)
1884 $self->id = repo->start - 1;
1885 if ($self->id >= repo->end)
1887 while (++$self->id < repo->end)
1888 if (pool->solvables[$self->id].repo == repo)
1889 return new_XSolvable(pool, $self->id);
1895 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1896 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1900 %newobject __getitem__;
1901 XSolvable *__getitem__(Id key) {
1902 Repo *repo = $self->repo;
1903 Pool *pool = repo->pool;
1904 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1905 return new_XSolvable(pool, key);
1909 return $self->repo->pool->nsolvables;
1914 Dep(Pool *pool, Id id) {
1918 s = solv_calloc(1, sizeof(*s));
1924 return pool_dep2str($self->pool, $self->id);
1926 bool __eq__(Dep *s) {
1927 return $self->pool == s->pool && $self->id == s->id;
1929 bool __ne__(Dep *s) {
1930 return !Dep___eq__($self, s);
1932 #if defined(SWIGPERL)
1933 %rename("str") __str__;
1935 const char *__str__() {
1936 return pool_dep2str($self->pool, $self->id);
1938 %newobject __repr__;
1939 const char *__repr__() {
1941 sprintf(buf, "<Id #%d ", $self->id);
1942 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1947 XSolvable(Pool *pool, Id id) {
1949 if (!id || id >= pool->nsolvables)
1951 s = solv_calloc(1, sizeof(*s));
1957 return pool_solvid2str($self->pool, $self->id);
1959 const char *lookup_str(Id keyname) {
1960 return pool_lookup_str($self->pool, $self->id, keyname);
1962 Id lookup_id(Id keyname) {
1963 return pool_lookup_id($self->pool, $self->id, keyname);
1965 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1966 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1968 bool lookup_void(Id keyname) {
1969 return pool_lookup_void($self->pool, $self->id, keyname);
1971 %newobject lookup_checksum;
1972 Chksum *lookup_checksum(Id keyname) {
1974 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1975 return solv_chksum_create_from_bin(type, b);
1977 Queue lookup_idarray(Id keyname, Id marker = -1) {
1978 Solvable *s = $self->pool->solvables + $self->id;
1981 if (marker == -1 || marker == 1) {
1982 if (keyname == SOLVABLE_PROVIDES)
1983 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1984 else if (keyname == SOLVABLE_REQUIRES)
1985 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1989 solvable_lookup_deparray(s, keyname, &r, marker);
1992 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1993 %newobject lookup_deparray;
1994 Queue lookup_deparray(Id keyname, Id marker = -1) {
1995 Solvable *s = $self->pool->solvables + $self->id;
1998 if (marker == -1 || marker == 1) {
1999 if (keyname == SOLVABLE_PROVIDES)
2000 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2001 else if (keyname == SOLVABLE_REQUIRES)
2002 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2006 solvable_lookup_deparray(s, keyname, &r, marker);
2009 const char *lookup_location(unsigned int *OUTPUT) {
2010 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2012 %newobject Dataiterator;
2013 Dataiterator *Dataiterator(Id key, const char *match, int flags) {
2014 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2017 %rename("installable?") installable;
2019 bool installable() {
2020 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2023 %rename("isinstalled?") isinstalled;
2025 bool isinstalled() {
2026 Pool *pool = $self->pool;
2027 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2032 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2033 Pool *pool = xs->pool;
2034 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2036 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2037 Pool *pool = xs->pool;
2038 return pool_id2str(pool, pool->solvables[xs->id].name);
2043 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2044 xs->pool->solvables[xs->id].name = nameid;
2046 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2047 return xs->pool->solvables[xs->id].name;
2052 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2053 Pool *pool = xs->pool;
2054 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2056 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2057 Pool *pool = xs->pool;
2058 return pool_id2str(pool, pool->solvables[xs->id].evr);
2063 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2064 xs->pool->solvables[xs->id].evr = evrid;
2066 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2067 return xs->pool->solvables[xs->id].evr;
2072 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2073 Pool *pool = xs->pool;
2074 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2076 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2077 Pool *pool = xs->pool;
2078 return pool_id2str(pool, pool->solvables[xs->id].arch);
2083 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2084 xs->pool->solvables[xs->id].arch = archid;
2086 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2087 return xs->pool->solvables[xs->id].arch;
2092 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2093 Pool *pool = xs->pool;
2094 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2096 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2097 Pool *pool = xs->pool;
2098 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2103 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2104 xs->pool->solvables[xs->id].vendor = vendorid;
2106 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2107 return xs->pool->solvables[xs->id].vendor;
2112 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2113 return xs->pool->solvables[xs->id].repo;
2117 /* old interface, please use the generic add_deparray instead */
2118 void add_provides(DepId id, Id marker = -1) {
2119 Solvable *s = $self->pool->solvables + $self->id;
2120 if (marker == -1 || marker == 1)
2121 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2122 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2124 void add_obsoletes(DepId id) {
2125 Solvable *s = $self->pool->solvables + $self->id;
2126 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2128 void add_conflicts(DepId id) {
2129 Solvable *s = $self->pool->solvables + $self->id;
2130 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2132 void add_requires(DepId id, Id marker = -1) {
2133 Solvable *s = $self->pool->solvables + $self->id;
2134 if (marker == -1 || marker == 1)
2135 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2136 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2138 void add_recommends(DepId id) {
2139 Solvable *s = $self->pool->solvables + $self->id;
2140 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2142 void add_suggests(DepId id) {
2143 Solvable *s = $self->pool->solvables + $self->id;
2144 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2146 void add_supplements(DepId id) {
2147 Solvable *s = $self->pool->solvables + $self->id;
2148 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2150 void add_enhances(DepId id) {
2151 Solvable *s = $self->pool->solvables + $self->id;
2152 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2155 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2156 Solvable *s = $self->pool->solvables + $self->id;
2157 if (marker == -1 || marker == 1) {
2158 if (keyname == SOLVABLE_PROVIDES)
2159 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2160 else if (keyname == SOLVABLE_REQUIRES)
2161 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2165 solvable_add_deparray(s, keyname, id, marker);
2168 bool __eq__(XSolvable *s) {
2169 return $self->pool == s->pool && $self->id == s->id;
2171 bool __ne__(XSolvable *s) {
2172 return !XSolvable___eq__($self, s);
2174 #if defined(SWIGPERL)
2175 %rename("str") __str__;
2177 const char *__str__() {
2178 return pool_solvid2str($self->pool, $self->id);
2180 %newobject __repr__;
2181 const char *__repr__() {
2183 sprintf(buf, "<Solvable #%d ", $self->id);
2184 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2189 Problem(Solver *solv, Id id) {
2191 p = solv_calloc(1, sizeof(*p));
2196 %newobject findproblemrule;
2197 XRule *findproblemrule() {
2198 Id r = solver_findproblemrule($self->solv, $self->id);
2199 return new_XRule($self->solv, r);
2201 %newobject findallproblemrules;
2202 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2203 Queue findallproblemrules(int unfiltered=0) {
2204 Solver *solv = $self->solv;
2209 solver_findallproblemrules(solv, $self->id, &q);
2212 for (i = j = 0; i < q.count; i++)
2214 SolverRuleinfo rclass;
2215 probr = q.elements[i];
2216 rclass = solver_ruleclass(solv, probr);
2217 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2219 q.elements[j++] = probr;
2222 queue_truncate(&q, j);
2226 int solution_count() {
2227 return solver_solution_count($self->solv, $self->id);
2229 %newobject solutions;
2230 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2235 cnt = solver_solution_count($self->solv, $self->id);
2236 for (i = 1; i <= cnt; i++)
2243 Solution(Problem *p, Id id) {
2245 s = solv_calloc(1, sizeof(*s));
2247 s->problemid = p->id;
2251 int element_count() {
2252 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2255 %newobject elements;
2256 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2257 Queue elements(bool expandreplaces=0) {
2261 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2262 for (i = 1; i <= cnt; i++)
2265 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2267 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2273 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2274 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2276 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2277 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2278 queue_push2(&q, p, rp);
2280 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2281 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2282 queue_push2(&q, p, rp);
2284 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2285 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2286 queue_push2(&q, p, rp);
2291 queue_push2(&q, i, type);
2292 queue_push2(&q, p, rp);
2298 %extend Solutionelement {
2299 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2301 e = solv_calloc(1, sizeof(*e));
2303 e->problemid = problemid;
2314 if (p == SOLVER_SOLUTION_ERASE)
2319 else if (p == SOLVER_SOLUTION_REPLACE)
2324 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2325 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);
2326 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2327 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);
2328 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2329 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);
2330 return solver_solutionelement2str($self->solv, p, rp);
2332 %newobject replaceelements;
2333 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2334 Queue replaceelements() {
2339 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2342 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2343 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2344 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2345 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2346 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2347 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2348 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2350 queue_push(&q, $self->type);
2353 int illegalreplace() {
2354 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2356 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2358 %newobject solvable;
2359 XSolvable * const solvable;
2360 %newobject replacement;
2361 XSolvable * const replacement;
2364 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2365 return new_XSolvable(e->solv->pool, e->p);
2367 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2368 return new_XSolvable(e->solv->pool, e->rp);
2370 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2371 if (e->type != SOLVER_SOLUTION_JOB)
2373 return (e->p - 1) / 2;
2378 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2379 if ($self->type == SOLVER_SOLUTION_JOB)
2380 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2381 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2382 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2383 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2384 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2385 if ($self->type == SOLVER_SOLUTION_ERASE)
2386 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2392 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2393 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2394 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2395 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2396 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2397 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2398 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2399 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2400 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2401 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2402 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2403 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2404 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2405 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2406 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2407 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2408 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2409 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2410 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2412 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2413 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2414 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2415 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2416 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2417 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2418 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2419 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2420 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2422 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2423 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2424 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2426 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2427 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2428 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2429 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2430 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2431 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2432 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2433 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2434 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2440 int set_flag(int flag, int value) {
2441 return solver_set_flag($self, flag, value);
2443 int get_flag(int flag) {
2444 return solver_get_flag($self, flag);
2446 #if defined(SWIGPYTHON)
2448 def solve(self, jobs):
2450 for job in jobs: j += [job.how, job.what]
2451 return self.solve_helper(j)
2454 #if defined(SWIGPERL)
2456 sub solv::Solver::solve {
2457 my ($self, $jobs) = @_;
2458 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2459 return $self->solve_helper(\@j);
2463 #if defined(SWIGRUBY)
2466 "class Solv::Solver\n"
2467 " def solve(jobs)\n"
2469 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2470 " solve_helper(jl)\n"
2476 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2477 %newobject solve_helper;
2478 Queue solve_helper(Queue jobs) {
2482 solver_solve($self, &jobs);
2483 cnt = solver_problem_count($self);
2484 for (i = 1; i <= cnt; i++)
2488 %newobject transaction;
2489 Transaction *transaction() {
2490 return solver_create_transaction($self);
2494 %extend Transaction {
2495 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2496 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2497 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2498 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2499 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2500 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2501 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2502 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2503 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2504 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2505 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2506 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2507 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2508 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2509 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2510 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2511 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2512 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2513 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2514 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2515 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2516 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2517 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2518 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2519 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2520 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2521 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2523 transaction_free($self);
2526 %rename("isempty?") isempty;
2529 return $self->steps.count == 0;
2532 %newobject othersolvable;
2533 XSolvable *othersolvable(XSolvable *s) {
2534 Id op = transaction_obs_pkg($self, s->id);
2535 return new_XSolvable($self->pool, op);
2538 %newobject allothersolvables;
2539 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2540 Queue allothersolvables(XSolvable *s) {
2543 transaction_all_obs_pkgs($self, s->id, &q);
2547 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2548 %newobject classify;
2549 Queue classify(int mode = 0) {
2552 transaction_classify($self, mode, &q);
2556 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2557 %newobject newpackages;
2558 Queue newpackages() {
2562 cut = transaction_installedresult(self, &q);
2563 queue_truncate(&q, cut);
2567 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2568 %newobject keptpackages;
2569 Queue keptpackages() {
2573 cut = transaction_installedresult(self, &q);
2575 queue_deleten(&q, 0, cut);
2579 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2583 queue_init_clone(&q, &$self->steps);
2587 int steptype(XSolvable *s, int mode) {
2588 return transaction_type($self, s->id, mode);
2590 int calc_installsizechange() {
2591 return transaction_calc_installsizechange($self);
2593 void order(int flags) {
2594 transaction_order($self, flags);
2598 %extend TransactionClass {
2599 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2600 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2601 cl->transaction = trans;
2605 cl->fromid = fromid;
2609 %newobject solvables;
2610 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2614 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2619 return new_Dep($self->transaction->pool, $self->fromid);
2623 return new_Dep($self->transaction->pool, $self->toid);
2628 XRule(Solver *solv, Id id) {
2631 XRule *xr = solv_calloc(1, sizeof(*xr));
2637 Id type, source, target, dep;
2638 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2639 return new_Ruleinfo($self, type, source, target, dep);
2641 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2642 %newobject allinfos;
2646 solver_allruleinfos($self->solv, $self->id, &q);
2650 bool __eq__(XRule *xr) {
2651 return $self->solv == xr->solv && $self->id == xr->id;
2653 bool __ne__(XRule *xr) {
2654 return !XRule___eq__($self, xr);
2656 %newobject __repr__;
2657 const char *__repr__() {
2659 sprintf(buf, "<Rule #%d>", $self->id);
2660 return solv_strdup(buf);
2665 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2666 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2670 ri->source = source;
2671 ri->target = target;
2675 XSolvable * const solvable;
2676 XSolvable * const othersolvable;
2678 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2679 return new_XSolvable(ri->solv->pool, ri->source);
2681 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2682 return new_XSolvable(ri->solv->pool, ri->target);
2685 const char *problemstr() {
2686 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2691 XRepodata(Repo *repo, Id id) {
2692 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2698 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2700 void set_id(Id solvid, Id keyname, DepId id) {
2701 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2703 void set_str(Id solvid, Id keyname, const char *str) {
2704 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2706 void set_poolstr(Id solvid, Id keyname, const char *str) {
2707 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2709 void add_idarray(Id solvid, Id keyname, DepId id) {
2710 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2712 void add_flexarray(Id solvid, Id keyname, Id handle) {
2713 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2715 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2716 const unsigned char *buf = solv_chksum_get(chksum, 0);
2718 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2720 const char *lookup_str(Id solvid, Id keyname) {
2721 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2723 Queue lookup_idarray(Id solvid, Id keyname) {
2726 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2729 %newobject lookup_checksum;
2730 Chksum *lookup_checksum(Id solvid, Id keyname) {
2732 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2733 return solv_chksum_create_from_bin(type, b);
2735 void internalize() {
2736 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2738 void create_stubs() {
2739 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2741 void write(FILE *fp) {
2742 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2744 bool add_solv(FILE *fp, int flags = 0) {
2745 Repodata *data = repo_id2repodata($self->repo, $self->id);
2746 int r, oldstate = data->state;
2747 data->state = REPODATA_LOADING;
2748 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2749 if (r || data->state == REPODATA_LOADING)
2750 data->state = oldstate;
2753 void extend_to_repo() {
2754 Repodata *data = repo_id2repodata($self->repo, $self->id);
2755 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2757 bool __eq__(XRepodata *xr) {
2758 return $self->repo == xr->repo && $self->id == xr->id;
2760 bool __ne__(XRepodata *xr) {
2761 return !XRepodata___eq__($self, xr);
2763 %newobject __repr__;
2764 const char *__repr__() {
2766 sprintf(buf, "<Repodata #%d>", $self->id);
2767 return solv_strdup(buf);