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;
299 #if defined(SWIGPYTHON)
300 typedef PyObject *AppObjectPtr;
301 %typemap(out) AppObjectPtr {
302 $result = $1 ? $1 : Py_None;
306 #if defined(SWIGPERL)
307 typedef SV *AppObjectPtr;
308 %typemap(in) AppObjectPtr {
309 $1 = SvROK($input) ? SvRV($input) : 0;
311 %typemap(out) AppObjectPtr {
312 $result = $1 ? newRV_inc($1) : newSV(0);
316 #if defined(SWIGRUBY)
317 typedef VALUE AppObjectPtr;
318 %typemap(in) AppObjectPtr {
321 %typemap(out) AppObjectPtr {
331 %include "typemaps.i"
336 #include <sys/stat.h>
337 #include <sys/utsname.h>
338 #include <sys/types.h>
342 /* glibc's way of closing the file without freeing the file pointer */
343 extern int _IO_file_close_it(FILE *);
345 #define _IO_file_close_it(fp) 0
348 /* argh, swig undefs bool for perl */
354 #include "poolarch.h"
357 #include "solverdebug.h"
358 #include "repo_solv.h"
360 #include "selection.h"
362 #include "repo_write.h"
364 #include "repo_rpmdb.h"
367 #include "repo_deb.h"
370 #include "repo_rpmmd.h"
371 #include "repo_updateinfoxml.h"
372 #include "repo_deltainfoxml.h"
373 #include "repo_repomdxml.h"
375 #ifdef ENABLE_SUSEREPO
376 #include "repo_products.h"
377 #include "repo_susetags.h"
378 #include "repo_content.h"
380 #ifdef ENABLE_MDKREPO
381 #include "repo_mdk.h"
383 #ifdef ENABLE_ARCHREPO
384 #include "repo_arch.h"
386 #include "solv_xfopen.h"
388 /* for old ruby versions */
390 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
393 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
396 #define SOLVER_SOLUTION_ERASE -100
397 #define SOLVER_SOLUTION_REPLACE -101
398 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
399 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
400 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
402 typedef struct chksum Chksum;
403 typedef void *AppObjectPtr;
428 } Pool_solvable_iterator;
433 } Pool_repo_iterator;
438 } Repo_solvable_iterator;
478 Transaction *transaction;
492 typedef Dataiterator Datamatch;
497 %mixin Dataiterator "Enumerable";
498 %mixin Pool_solvable_iterator "Enumerable";
499 %mixin Pool_repo_iterator "Enumerable";
500 %mixin Repo_solvable_iterator "Enumerable";
508 %constant Id SOLVID_META;
509 %constant Id SOLVID_POS;
511 %constant int REL_EQ;
512 %constant int REL_GT;
513 %constant int REL_LT;
514 %constant int REL_ARCH;
546 # put before pool/repo so we can access the constructor
547 %nodefaultdtor Dataiterator;
548 typedef struct {} Dataiterator;
549 typedef struct {} Pool_solvable_iterator;
550 typedef struct {} Pool_repo_iterator;
551 typedef struct {} Repo_solvable_iterator;
553 %nodefaultctor Datamatch;
554 %nodefaultdtor Datamatch;
561 %nodefaultctor Datapos;
575 AppObjectPtr appdata;
582 const char * const name;
585 int const nsolvables;
586 AppObjectPtr appdata;
589 %nodefaultctor Solver;
590 %nodefaultdtor Solver;
598 %rename(xfopen) solv_xfopen;
599 %rename(xfopen_fd) solv_xfopen_dup;
605 %newobject solv_xfopen;
606 %newobject solv_xfopen_dup;
608 FILE *solv_xfopen(const char *fn, const char *mode = 0);
609 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
612 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
614 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
637 %nodefaultctor Transaction;
638 %nodefaultdtor Transaction;
644 Transaction * const transaction;
656 return fileno($self);
659 return dup(fileno($self));
662 return fflush($self) == 0;
666 ret = fflush($self) == 0;
667 _IO_file_close_it($self);
673 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
674 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
675 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
676 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
677 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
678 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
679 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
680 static const Id SOLVER_NOOP = SOLVER_NOOP;
681 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
682 static const Id SOLVER_ERASE = SOLVER_ERASE;
683 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
684 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
685 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
686 static const Id SOLVER_LOCK = SOLVER_LOCK;
687 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
688 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
689 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
690 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
691 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
692 static const Id SOLVER_WEAK = SOLVER_WEAK;
693 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
694 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
695 static const Id SOLVER_SETEV = SOLVER_SETEV;
696 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
697 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
698 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
699 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
700 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
701 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
703 Job(Pool *pool, int how, Id what) {
704 Job *job = solv_calloc(1, sizeof(*job));
711 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
712 %newobject solvables;
716 pool_job2solvables($self->pool, &q, $self->how, $self->what);
720 bool __eq__(Job *j) {
721 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
723 bool __ne__(Job *j) {
724 return !Job___eq__($self, j);
726 #if defined(SWIGPERL)
727 %rename("str") __str__;
729 const char *__str__() {
730 return pool_job2str($self->pool, $self->how, $self->what, 0);
732 const char *__repr__() {
733 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
734 return pool_tmpjoin($self->pool, "<Job ", str, ">");
739 static const Id SELECTION_NAME = SELECTION_NAME;
740 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
741 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
742 static const Id SELECTION_GLOB = SELECTION_GLOB;
743 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
744 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
745 static const Id SELECTION_FLAT = SELECTION_FLAT;
746 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
747 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
749 Selection(Pool *pool) {
751 s = solv_calloc(1, sizeof(*s));
757 queue_free(&$self->q);
763 void make(const char *name, int flags) {
764 $self->flags = selection_make($self->pool, &$self->q, name, flags);
767 %rename("isempty?") isempty;
770 return $self->q.count == 0;
772 void limit(Selection *lsel) {
773 if ($self->pool != lsel->pool)
774 queue_empty(&$self->q);
776 selection_limit($self->pool, &$self->q, &lsel->q);
778 void add(Selection *lsel) {
779 if ($self->pool == lsel->pool)
781 selection_add($self->pool, &$self->q, &lsel->q);
782 $self->flags |= lsel->flags;
785 void addsimple(Id how, Id what) {
786 queue_push2(&$self->q, how, what);
788 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
790 Queue jobs(int flags) {
793 queue_init_clone(&q, &$self->q);
794 for (i = 0; i < q.count; i += 2)
795 q.elements[i] |= flags;
799 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
800 %newobject solvables;
804 selection_solvables($self->pool, &$self->q, &q);
808 #if defined(SWIGPERL)
809 %rename("str") __str__;
811 const char *__str__() {
812 return pool_selection2str($self->pool, &$self->q, 0);
814 const char *__repr__() {
815 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
816 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
822 return (Chksum *)solv_chksum_create(type);
824 Chksum(Id type, const char *hex) {
825 unsigned char buf[64];
826 int l = solv_chksum_len(type);
829 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
831 return (Chksum *)solv_chksum_create_from_bin(type, buf);
834 solv_chksum_free($self, 0);
838 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
839 return solv_chksum_get_type(chksum);
842 void add(const char *str) {
843 solv_chksum_add($self, str, strlen((char *)str));
845 void add_fp(FILE *fp) {
848 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
849 solv_chksum_add($self, buf, l);
850 rewind(fp); /* convenience */
852 void add_fd(int fd) {
855 while ((l = read(fd, buf, sizeof(buf))) > 0)
856 solv_chksum_add($self, buf, l);
857 lseek(fd, 0, 0); /* convenience */
859 void add_stat(const char *filename) {
861 if (stat(filename, &stb))
862 memset(&stb, 0, sizeof(stb));
863 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
864 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
865 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
866 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
868 void add_fstat(int fd) {
871 memset(&stb, 0, sizeof(stb));
872 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
873 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
874 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
875 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
879 const unsigned char *b;
880 b = solv_chksum_get($self, &l);
881 return cdata_void((void *)b, l);
886 const unsigned char *b;
889 b = solv_chksum_get($self, &l);
890 ret = solv_malloc(2 * l + 1);
891 solv_bin2hex(b, l, ret);
895 bool __eq__(Chksum *chk) {
897 const unsigned char *b, *bo;
900 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
902 b = solv_chksum_get($self, &l);
903 bo = solv_chksum_get(chk, 0);
904 return memcmp(b, bo, l) == 0;
906 bool __ne__(Chksum *chk) {
907 return !Chksum___eq__($self, chk);
909 #if defined(SWIGRUBY)
910 %rename("to_s") __str__;
911 %rename("inspect") __repr__;
913 #if defined(SWIGPERL)
914 %rename("str") __str__;
917 const char *__str__() {
920 if (solv_chksum_isfinished($self))
921 h = Chksum_hex($self);
922 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
923 solv_free((void *)h);
927 const char *__repr__() {
928 const char *h = Chksum___str__($self);
929 const char *str = solv_dupjoin("<Chksum ", h, ">");
930 solv_free((void *)h);
937 Pool *pool = pool_create();
942 void set_debuglevel(int level) {
943 pool_setdebuglevel($self, level);
945 int set_flag(int flag, int value) {
946 return pool_set_flag($self, flag, value);
948 int get_flag(int flag) {
949 return pool_get_flag($self, flag);
951 void set_rootdir(const char *rootdir) {
952 pool_set_rootdir($self, rootdir);
954 const char *get_rootdir(int flag) {
955 return pool_get_rootdir($self);
957 #if defined(SWIGPYTHON)
959 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
960 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
961 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
962 PyObject *result = PyEval_CallObject((PyObject *)d, args);
967 return 0; /* exception */
968 ecode = SWIG_AsVal_int(result, &vresult);
970 return SWIG_IsOK(ecode) ? vresult : 0;
973 void set_loadcallback(PyObject *callable) {
974 if ($self->loadcallback == loadcallback) {
975 PyObject *obj = $self->loadcallbackdata;
981 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
984 #if defined(SWIGPERL)
986 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
990 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
995 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
997 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1007 void set_loadcallback(SV *callable) {
1008 if ($self->loadcallback == loadcallback)
1009 SvREFCNT_dec($self->loadcallbackdata);
1011 SvREFCNT_inc(callable);
1012 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1016 #if defined(SWIGRUBY)
1018 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1019 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1020 VALUE callable = (VALUE)d;
1021 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1022 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1023 return res == Qtrue;
1025 SWIGINTERN void mark_Pool(void *ptr) {
1027 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1028 VALUE callable = (VALUE)pool->loadcallbackdata;
1029 rb_gc_mark(callable);
1033 %typemap(in, numinputs=0) VALUE callable {
1034 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1036 void set_loadcallback(VALUE callable) {
1037 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1042 Pool_set_loadcallback($self, 0);
1045 Id str2id(const char *str, bool create=1) {
1046 return pool_str2id($self, str, create);
1048 Dep *Dep(const char *str, bool create=1) {
1049 Id id = pool_str2id($self, str, create);
1050 return new_Dep($self, id);
1052 const char *id2str(Id id) {
1053 return pool_id2str($self, id);
1055 const char *dep2str(Id id) {
1056 return pool_dep2str($self, id);
1058 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1059 return pool_rel2id($self, name, evr, flags, create);
1061 Id id2langid(Id id, const char *lang, bool create=1) {
1062 return pool_id2langid($self, id, lang, create);
1064 void setarch(const char *arch = 0) {
1073 pool_setarch($self, arch);
1075 Repo *add_repo(const char *name) {
1076 return repo_create($self, name);
1078 const char *lookup_str(Id entry, Id keyname) {
1079 return pool_lookup_str($self, entry, keyname);
1081 Id lookup_id(Id entry, Id keyname) {
1082 return pool_lookup_id($self, entry, keyname);
1084 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1085 return pool_lookup_num($self, entry, keyname, notfound);
1087 bool lookup_void(Id entry, Id keyname) {
1088 return pool_lookup_void($self, entry, keyname);
1090 %newobject lookup_checksum;
1091 Chksum *lookup_checksum(Id entry, Id keyname) {
1093 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1094 return solv_chksum_create_from_bin(type, b);
1097 %newobject Dataiterator;
1098 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1099 return new_Dataiterator($self, 0, p, key, match, flags);
1101 const char *solvid2str(Id solvid) {
1102 return pool_solvid2str($self, solvid);
1104 void addfileprovides() {
1105 pool_addfileprovides($self);
1107 Queue addfileprovides_queue() {
1110 pool_addfileprovides_queue($self, &r, 0);
1113 void createwhatprovides() {
1114 pool_createwhatprovides($self);
1117 XSolvable *id2solvable(Id id) {
1118 return new_XSolvable($self, id);
1120 %newobject solvables;
1121 Pool_solvable_iterator * const solvables;
1123 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1124 return new_Pool_solvable_iterator(pool);
1127 %newobject solvables_iter;
1128 Pool_solvable_iterator * solvables_iter() {
1129 return new_Pool_solvable_iterator($self);
1132 Repo *id2repo(Id id) {
1133 if (id < 1 || id >= $self->nrepos)
1135 return pool_id2repo($self, id);
1138 Pool_repo_iterator * const repos;
1140 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1141 return new_Pool_repo_iterator(pool);
1144 %newobject repos_iter;
1145 Pool_repo_iterator * repos_iter() {
1146 return new_Pool_repo_iterator($self);
1151 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1152 pool_set_installed(pool, installed);
1154 Repo *Pool_installed_get(Pool *pool) {
1155 return pool->installed;
1159 Queue matchprovidingids(const char *match, int flags) {
1165 for (id = 1; id < pool->ss.nstrings; id++)
1166 if (pool->whatprovides[id])
1170 if (!datamatcher_init(&ma, match, flags)) {
1171 for (id = 1; id < pool->ss.nstrings; id++)
1172 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1174 datamatcher_free(&ma);
1180 Job *Job(int how, Id what) {
1181 return new_Job($self, how, what);
1184 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1185 %newobject whatprovides;
1186 Queue whatprovides(Id dep) {
1191 FOR_PROVIDES(p, pp, dep)
1196 Id towhatprovides(Queue q) {
1197 return pool_queuetowhatprovides($self, &q);
1201 %rename("isknownarch?") isknownarch;
1203 bool isknownarch(Id id) {
1205 if (!id || id == ID_EMPTY)
1207 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1209 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1216 return solver_create($self);
1219 %newobject Selection;
1220 Selection *Selection() {
1221 return new_Selection($self);
1224 Selection *select(const char *name, int flags) {
1225 Selection *sel = new_Selection($self);
1226 sel->flags = selection_make($self, &sel->q, name, flags);
1232 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1233 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1234 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1235 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1236 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1237 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1238 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1239 #ifdef ENABLE_SUSEREPO
1240 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1243 void free(bool reuseids = 0) {
1244 repo_free($self, reuseids);
1246 void empty(bool reuseids = 0) {
1247 repo_empty($self, reuseids);
1250 %rename("isempty?") isempty;
1253 return !$self->nsolvables;
1255 bool add_solv(const char *name, int flags = 0) {
1256 FILE *fp = fopen(name, "r");
1260 r = repo_add_solv($self, fp, flags);
1264 bool add_solv(FILE *fp, int flags = 0) {
1265 return repo_add_solv($self, fp, flags) == 0;
1268 XSolvable *add_solvable() {
1269 Id solvid = repo_add_solvable($self);
1270 return new_XSolvable($self->pool, solvid);
1274 bool add_rpmdb(Repo *ref, int flags = 0) {
1275 return repo_add_rpmdb($self, ref, flags);
1277 Id add_rpm(const char *name, int flags = 0) {
1278 return repo_add_rpm($self, name, flags);
1282 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1283 return repo_add_rpmmd($self, fp, language, flags);
1285 bool add_repomdxml(FILE *fp, int flags = 0) {
1286 return repo_add_repomdxml($self, fp, flags);
1288 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1289 return repo_add_updateinfoxml($self, fp, flags);
1291 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1292 return repo_add_deltainfoxml($self, fp, flags);
1295 #ifdef ENABLE_DEBIAN
1296 bool add_debdb(int flags = 0) {
1297 return repo_add_debdb($self, flags);
1299 Id add_deb(const char *name, int flags = 0) {
1300 return repo_add_deb($self, name, flags);
1303 #ifdef ENABLE_SUSEREPO
1304 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1305 return repo_add_susetags($self, fp, defvendor, language, flags);
1307 bool add_content(FILE *fp, int flags = 0) {
1308 return repo_add_content($self, fp, flags);
1310 bool add_products(const char *proddir, int flags = 0) {
1311 return repo_add_products($self, proddir, flags);
1314 #ifdef ENABLE_MDKREPO
1315 bool add_mdk(FILE *fp, int flags = 0) {
1316 return repo_add_mdk($self, fp, flags);
1318 bool add_mdk_info(FILE *fp, int flags = 0) {
1319 return repo_add_mdk($self, fp, flags);
1322 #ifdef ENABLE_ARCHREPO
1323 bool add_arch_repo(FILE *fp, int flags = 0) {
1324 return repo_add_arch_repo($self, fp, flags);
1326 Id add_arch_pkg(const char *name, int flags = 0) {
1327 return repo_add_arch_pkg($self, name, flags);
1330 void internalize() {
1331 repo_internalize($self);
1333 const char *lookup_str(Id entry, Id keyname) {
1334 return repo_lookup_str($self, entry, keyname);
1336 Id lookup_id(Id entry, Id keyname) {
1337 return repo_lookup_id($self, entry, keyname);
1339 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1340 return repo_lookup_num($self, entry, keyname, notfound);
1342 void write(FILE *fp) {
1343 repo_write($self, fp);
1345 # HACK, remove if no longer needed!
1346 bool write_first_repodata(FILE *fp) {
1347 int oldnrepodata = $self->nrepodata;
1348 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1349 repo_write($self, fp);
1350 $self->nrepodata = oldnrepodata;
1354 %newobject Dataiterator;
1355 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1356 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1361 SWIGINTERN Id Repo_id_get(Repo *repo) {
1362 return repo->repoid;
1365 Repo_solvable_iterator * const solvables;
1367 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1368 return new_Repo_solvable_iterator(repo);
1371 %newobject solvables_iter;
1372 Repo_solvable_iterator *solvables_iter() {
1373 return new_Repo_solvable_iterator($self);
1376 XRepodata *add_repodata(int flags = 0) {
1377 Repodata *rd = repo_add_repodata($self, flags);
1378 return new_XRepodata($self, rd->repodataid);
1381 void create_stubs() {
1383 if (!$self->nrepodata)
1385 data = repo_id2repodata($self, $self->nrepodata - 1);
1386 if (data->state != REPODATA_STUB)
1387 repodata_create_stubs(data);
1390 %rename("iscontiguous?") iscontiguous;
1392 bool iscontiguous() {
1394 for (i = $self->start; i < $self->end; i++)
1395 if ($self->pool->solvables[i].repo != $self)
1399 XRepodata *first_repodata() {
1402 if ($self->nrepodata < 2)
1404 /* make sure all repodatas but the first are extensions */
1405 data = repo_id2repodata($self, 1);
1406 if (data->loadcallback)
1408 for (i = 2; i < $self->nrepodata; i++)
1410 data = repo_id2repodata($self, i);
1411 if (!data->loadcallback)
1412 return 0; /* oops, not an extension */
1414 return new_XRepodata($self, 1);
1417 bool __eq__(Repo *repo) {
1418 return $self == repo;
1420 bool __ne__(Repo *repo) {
1421 return $self != repo;
1423 #if defined(SWIGPERL)
1424 %rename("str") __str__;
1427 const char *__str__() {
1430 return solv_strdup($self->name);
1431 sprintf(buf, "Repo#%d", $self->repoid);
1432 return solv_strdup(buf);
1434 %newobject __repr__;
1435 const char *__repr__() {
1439 sprintf(buf, "<Repo #%d ", $self->repoid);
1440 return solv_dupjoin(buf, $self->name, ">");
1442 sprintf(buf, "<Repo #%d>", $self->repoid);
1443 return solv_strdup(buf);
1447 %extend Dataiterator {
1448 static const int SEARCH_STRING = SEARCH_STRING;
1449 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1450 static const int SEARCH_GLOB = SEARCH_GLOB;
1451 static const int SEARCH_REGEX = SEARCH_REGEX;
1452 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1453 static const int SEARCH_FILES = SEARCH_FILES;
1454 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1456 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1457 Dataiterator *di = solv_calloc(1, sizeof(*di));
1458 dataiterator_init(di, pool, repo, p, key, match, flags);
1462 dataiterator_free($self);
1465 #if defined(SWIGPYTHON)
1466 %newobject __iter__;
1467 Dataiterator *__iter__() {
1469 ndi = solv_calloc(1, sizeof(*ndi));
1470 dataiterator_init_clone(ndi, $self);
1473 %rename("next") __next__();
1474 %exception __next__ {
1477 PyErr_SetString(PyExc_StopIteration,"no more matches");
1484 perliter(solv::Dataiterator)
1487 %newobject __next__;
1488 Datamatch *__next__() {
1490 if (!dataiterator_step($self)) {
1493 ndi = solv_calloc(1, sizeof(*ndi));
1494 dataiterator_init_clone(ndi, $self);
1500 while ((d = Dataiterator___next__($self)) != 0) {
1501 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1505 void prepend_keyname(Id key) {
1506 dataiterator_prepend_keyname($self, key);
1508 void skip_solvable() {
1509 dataiterator_skip_solvable($self);
1514 Id lookup_id(Id keyname) {
1515 Pool *pool = $self->repo->pool;
1516 Datapos oldpos = pool->pos;
1519 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1523 const char *lookup_str(Id keyname) {
1524 Pool *pool = $self->repo->pool;
1525 Datapos oldpos = pool->pos;
1528 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1532 %newobject lookup_checksum;
1533 Chksum *lookup_checksum(Id keyname) {
1534 Pool *pool = $self->repo->pool;
1535 Datapos oldpos = pool->pos;
1537 const unsigned char *b;
1539 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1541 return solv_chksum_create_from_bin(type, b);
1543 const char *lookup_deltaseq() {
1544 Pool *pool = $self->repo->pool;
1545 Datapos oldpos = pool->pos;
1548 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1550 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1551 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1556 const char *lookup_deltalocation() {
1557 Pool *pool = $self->repo->pool;
1558 Datapos oldpos = pool->pos;
1561 loc = pool_lookup_deltalocation(pool, SOLVID_POS);
1569 dataiterator_free($self);
1572 %newobject solvable;
1573 XSolvable * const solvable;
1575 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1576 return new_XSolvable(di->pool, di->solvid);
1580 return $self->key->name;
1582 const char *key_idstr() {
1583 return pool_id2str($self->pool, $self->key->name);
1586 return $self->key->type;
1588 const char *type_idstr() {
1589 return pool_id2str($self->pool, $self->key->type);
1592 return $self->kv.id;
1594 const char *idstr() {
1595 return pool_id2str($self->pool, $self->kv.id);
1598 return $self->kv.str;
1601 return $self->kv.num;
1604 return $self->kv.num2;
1608 Pool *pool = $self->pool;
1609 Datapos *pos, oldpos = pool->pos;
1610 dataiterator_setpos($self);
1611 pos = solv_calloc(1, sizeof(*pos));
1616 %newobject parentpos;
1617 Datapos *parentpos() {
1618 Pool *pool = $self->pool;
1619 Datapos *pos, oldpos = pool->pos;
1620 dataiterator_setpos_parent($self);
1621 pos = solv_calloc(1, sizeof(*pos));
1627 dataiterator_setpos($self);
1629 void setpos_parent() {
1630 dataiterator_setpos_parent($self);
1634 %extend Pool_solvable_iterator {
1635 Pool_solvable_iterator(Pool *pool) {
1636 Pool_solvable_iterator *s;
1637 s = solv_calloc(1, sizeof(*s));
1641 #if defined(SWIGPYTHON)
1642 %newobject __iter__;
1643 Pool_solvable_iterator *__iter__() {
1644 Pool_solvable_iterator *s;
1645 s = solv_calloc(1, sizeof(*s));
1649 %rename("next") __next__();
1650 %exception __next__ {
1653 PyErr_SetString(PyExc_StopIteration,"no more matches");
1660 perliter(solv::Pool_solvable_iterator)
1662 %newobject __next__;
1663 XSolvable *__next__() {
1664 Pool *pool = $self->pool;
1665 if ($self->id >= pool->nsolvables)
1667 while (++$self->id < pool->nsolvables)
1668 if (pool->solvables[$self->id].repo)
1669 return new_XSolvable(pool, $self->id);
1675 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1676 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1680 %newobject __getitem__;
1681 XSolvable *__getitem__(Id key) {
1682 Pool *pool = $self->pool;
1683 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1684 return new_XSolvable(pool, key);
1688 return $self->pool->nsolvables;
1692 %extend Pool_repo_iterator {
1693 Pool_repo_iterator(Pool *pool) {
1694 Pool_repo_iterator *s;
1695 s = solv_calloc(1, sizeof(*s));
1699 #if defined(SWIGPYTHON)
1700 %newobject __iter__;
1701 Pool_repo_iterator *__iter__() {
1702 Pool_repo_iterator *s;
1703 s = solv_calloc(1, sizeof(*s));
1707 %rename("next") __next__();
1708 %exception __next__ {
1711 PyErr_SetString(PyExc_StopIteration,"no more matches");
1716 %newobject __next__;
1718 Pool *pool = $self->pool;
1719 if ($self->id >= pool->nrepos)
1721 while (++$self->id < pool->nrepos) {
1722 Repo *r = pool_id2repo(pool, $self->id);
1731 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1732 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1736 Repo *__getitem__(Id key) {
1737 Pool *pool = $self->pool;
1738 if (key > 0 && key < pool->nrepos)
1739 return pool_id2repo(pool, key);
1743 return $self->pool->nrepos;
1747 %extend Repo_solvable_iterator {
1748 Repo_solvable_iterator(Repo *repo) {
1749 Repo_solvable_iterator *s;
1750 s = solv_calloc(1, sizeof(*s));
1754 #if defined(SWIGPYTHON)
1755 %newobject __iter__;
1756 Repo_solvable_iterator *__iter__() {
1757 Repo_solvable_iterator *s;
1758 s = solv_calloc(1, sizeof(*s));
1762 %rename("next") __next__();
1763 %exception __next__ {
1766 PyErr_SetString(PyExc_StopIteration,"no more matches");
1771 %newobject __next__;
1772 XSolvable *__next__() {
1773 Repo *repo = $self->repo;
1774 Pool *pool = repo->pool;
1775 if (repo->start > 0 && $self->id < repo->start)
1776 $self->id = repo->start - 1;
1777 if ($self->id >= repo->end)
1779 while (++$self->id < repo->end)
1780 if (pool->solvables[$self->id].repo == repo)
1781 return new_XSolvable(pool, $self->id);
1787 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1788 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1792 %newobject __getitem__;
1793 XSolvable *__getitem__(Id key) {
1794 Repo *repo = $self->repo;
1795 Pool *pool = repo->pool;
1796 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1797 return new_XSolvable(pool, key);
1801 return $self->repo->pool->nsolvables;
1806 Dep(Pool *pool, Id id) {
1810 s = solv_calloc(1, sizeof(*s));
1816 return pool_dep2str($self->pool, $self->id);
1818 bool __eq__(Dep *s) {
1819 return $self->pool == s->pool && $self->id == s->id;
1821 bool __ne__(Dep *s) {
1822 return !Dep___eq__($self, s);
1824 #if defined(SWIGPERL)
1825 %rename("str") __str__;
1827 const char *__str__() {
1828 return pool_dep2str($self->pool, $self->id);
1830 %newobject __repr__;
1831 const char *__repr__() {
1833 sprintf(buf, "<Id #%d ", $self->id);
1834 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1839 XSolvable(Pool *pool, Id id) {
1841 if (!id || id >= pool->nsolvables)
1843 s = solv_calloc(1, sizeof(*s));
1849 return pool_solvid2str($self->pool, $self->id);
1851 const char *lookup_str(Id keyname) {
1852 return pool_lookup_str($self->pool, $self->id, keyname);
1854 Id lookup_id(Id keyname) {
1855 return pool_lookup_id($self->pool, $self->id, keyname);
1857 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1858 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1860 bool lookup_void(Id keyname) {
1861 return pool_lookup_void($self->pool, $self->id, keyname);
1863 %newobject lookup_checksum;
1864 Chksum *lookup_checksum(Id keyname) {
1866 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1867 return solv_chksum_create_from_bin(type, b);
1869 Queue lookup_idarray(Id keyname, Id marker = -1) {
1870 Solvable *s = $self->pool->solvables + $self->id;
1873 if (marker == -1 || marker == 1) {
1874 if (keyname == SOLVABLE_PROVIDES)
1875 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1876 else if (keyname == SOLVABLE_REQUIRES)
1877 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1881 solvable_lookup_deparray(s, keyname, &r, marker);
1884 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1885 %newobject lookup_deparray;
1886 Queue lookup_deparray(Id keyname, Id marker = -1) {
1887 Solvable *s = $self->pool->solvables + $self->id;
1890 if (marker == -1 || marker == 1) {
1891 if (keyname == SOLVABLE_PROVIDES)
1892 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1893 else if (keyname == SOLVABLE_REQUIRES)
1894 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1898 solvable_lookup_deparray(s, keyname, &r, marker);
1901 const char *lookup_location(unsigned int *OUTPUT) {
1902 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
1905 %rename("installable?") installable;
1907 bool installable() {
1908 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1911 %rename("isinstalled?") isinstalled;
1913 bool isinstalled() {
1914 Pool *pool = $self->pool;
1915 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1920 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1921 Pool *pool = xs->pool;
1922 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1924 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1925 Pool *pool = xs->pool;
1926 return pool_id2str(pool, pool->solvables[xs->id].name);
1931 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1932 xs->pool->solvables[xs->id].name = nameid;
1934 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1935 return xs->pool->solvables[xs->id].name;
1940 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1941 Pool *pool = xs->pool;
1942 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1944 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1945 Pool *pool = xs->pool;
1946 return pool_id2str(pool, pool->solvables[xs->id].evr);
1951 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1952 xs->pool->solvables[xs->id].evr = evrid;
1954 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1955 return xs->pool->solvables[xs->id].evr;
1960 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1961 Pool *pool = xs->pool;
1962 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1964 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1965 Pool *pool = xs->pool;
1966 return pool_id2str(pool, pool->solvables[xs->id].arch);
1971 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1972 xs->pool->solvables[xs->id].arch = archid;
1974 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1975 return xs->pool->solvables[xs->id].arch;
1980 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1981 Pool *pool = xs->pool;
1982 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1984 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1985 Pool *pool = xs->pool;
1986 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1991 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1992 xs->pool->solvables[xs->id].vendor = vendorid;
1994 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1995 return xs->pool->solvables[xs->id].vendor;
2000 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2001 return xs->pool->solvables[xs->id].repo;
2005 void add_provides(Dep *dep, Id marker = -1) {
2006 Solvable *s = $self->pool->solvables + $self->id;
2007 if (marker == -1 || marker == 1)
2008 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2009 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
2011 void add_providesid(Id id, Id marker = -1) {
2012 Solvable *s = $self->pool->solvables + $self->id;
2013 if (marker == -1 || marker == 1)
2014 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
2015 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2017 void add_obsoletes(Dep *dep) {
2018 Solvable *s = $self->pool->solvables + $self->id;
2019 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
2021 void add_obsoletesid(Id id) {
2022 Solvable *s = $self->pool->solvables + $self->id;
2023 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2025 void add_conflicts(Dep *dep) {
2026 Solvable *s = $self->pool->solvables + $self->id;
2027 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
2029 void add_conflictsid(Id id) {
2030 Solvable *s = $self->pool->solvables + $self->id;
2031 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2033 void add_requires(Dep *dep, Id marker = -1) {
2034 Solvable *s = $self->pool->solvables + $self->id;
2035 if (marker == -1 || marker == 1)
2036 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2037 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
2039 void add_requiresid(Id id, Id marker = -1) {
2040 Solvable *s = $self->pool->solvables + $self->id;
2041 if (marker == -1 || marker == 1)
2042 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
2043 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2045 void add_recommends(Dep *dep) {
2046 Solvable *s = $self->pool->solvables + $self->id;
2047 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
2049 void add_recommendsid(Id id) {
2050 Solvable *s = $self->pool->solvables + $self->id;
2051 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2053 void add_suggests(Dep *dep) {
2054 Solvable *s = $self->pool->solvables + $self->id;
2055 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
2057 void add_suggestsid(Id id) {
2058 Solvable *s = $self->pool->solvables + $self->id;
2059 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2061 void add_supplements(Dep *dep) {
2062 Solvable *s = $self->pool->solvables + $self->id;
2063 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
2065 void add_supplementsid(Id id) {
2066 Solvable *s = $self->pool->solvables + $self->id;
2067 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2069 void add_enhances(Dep *dep) {
2070 Solvable *s = $self->pool->solvables + $self->id;
2071 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
2073 void add_enhancesid(Id id) {
2074 Solvable *s = $self->pool->solvables + $self->id;
2075 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2078 bool __eq__(XSolvable *s) {
2079 return $self->pool == s->pool && $self->id == s->id;
2081 bool __ne__(XSolvable *s) {
2082 return !XSolvable___eq__($self, s);
2084 #if defined(SWIGPERL)
2085 %rename("str") __str__;
2087 const char *__str__() {
2088 return pool_solvid2str($self->pool, $self->id);
2090 %newobject __repr__;
2091 const char *__repr__() {
2093 sprintf(buf, "<Solvable #%d ", $self->id);
2094 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2099 Problem(Solver *solv, Id id) {
2101 p = solv_calloc(1, sizeof(*p));
2106 %newobject findproblemrule;
2107 XRule *findproblemrule() {
2108 Id r = solver_findproblemrule($self->solv, $self->id);
2109 return new_XRule($self->solv, r);
2111 %newobject findallproblemrules;
2112 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2113 Queue findallproblemrules(int unfiltered=0) {
2114 Solver *solv = $self->solv;
2119 solver_findallproblemrules(solv, $self->id, &q);
2122 for (i = j = 0; i < q.count; i++)
2124 SolverRuleinfo rclass;
2125 probr = q.elements[i];
2126 rclass = solver_ruleclass(solv, probr);
2127 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2129 q.elements[j++] = probr;
2132 queue_truncate(&q, j);
2136 int solution_count() {
2137 return solver_solution_count($self->solv, $self->id);
2139 %newobject solutions;
2140 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2145 cnt = solver_solution_count($self->solv, $self->id);
2146 for (i = 1; i <= cnt; i++)
2153 Solution(Problem *p, Id id) {
2155 s = solv_calloc(1, sizeof(*s));
2157 s->problemid = p->id;
2161 int element_count() {
2162 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2165 %newobject elements;
2166 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2167 Queue elements(bool expandreplaces=0) {
2171 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2172 for (i = 1; i <= cnt; i++)
2175 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2177 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2183 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2184 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2186 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2187 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2188 queue_push2(&q, p, rp);
2190 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2191 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2192 queue_push2(&q, p, rp);
2194 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2195 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2196 queue_push2(&q, p, rp);
2201 queue_push2(&q, i, type);
2202 queue_push2(&q, p, rp);
2208 %extend Solutionelement {
2209 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2211 e = solv_calloc(1, sizeof(*e));
2213 e->problemid = problemid;
2224 if (p == SOLVER_SOLUTION_ERASE)
2229 else if (p == SOLVER_SOLUTION_REPLACE)
2234 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2235 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);
2236 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2237 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);
2238 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2239 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);
2240 return solver_solutionelement2str($self->solv, p, rp);
2242 %newobject replaceelements;
2243 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2244 Queue replaceelements() {
2249 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2252 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2253 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2254 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2255 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2256 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2257 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2258 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2260 queue_push(&q, $self->type);
2263 int illegalreplace() {
2264 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2266 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2268 %newobject solvable;
2269 XSolvable * const solvable;
2270 %newobject replacement;
2271 XSolvable * const replacement;
2274 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2275 return new_XSolvable(e->solv->pool, e->p);
2277 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2278 return new_XSolvable(e->solv->pool, e->rp);
2280 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2281 if (e->type != SOLVER_SOLUTION_JOB)
2283 return (e->p - 1) / 2;
2288 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2289 if ($self->type == SOLVER_SOLUTION_JOB)
2290 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2291 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2292 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2293 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2294 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2295 if ($self->type == SOLVER_SOLUTION_ERASE)
2296 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2302 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2303 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2304 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2305 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2306 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2307 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2308 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2309 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2310 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2311 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2312 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2313 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2314 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2315 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2316 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2317 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2318 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2319 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2320 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2322 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2323 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2324 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2325 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2326 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2327 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2328 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2329 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2331 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2332 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2333 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2335 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2336 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2337 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2338 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2339 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2340 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2341 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2342 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2343 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2349 int set_flag(int flag, int value) {
2350 return solver_set_flag($self, flag, value);
2352 int get_flag(int flag) {
2353 return solver_get_flag($self, flag);
2355 #if defined(SWIGPYTHON)
2357 def solve(self, jobs):
2359 for job in jobs: j += [job.how, job.what]
2360 return self.solve_helper(j)
2363 #if defined(SWIGPERL)
2365 sub solv::Solver::solve {
2366 my ($self, $jobs) = @_;
2367 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2368 return $self->solve_helper(\@j);
2372 #if defined(SWIGRUBY)
2375 "class Solv::Solver\n"
2376 " def solve(jobs)\n"
2378 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2379 " solve_helper(jl)\n"
2385 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2386 %newobject solve_helper;
2387 Queue solve_helper(Queue jobs) {
2391 solver_solve($self, &jobs);
2392 cnt = solver_problem_count($self);
2393 for (i = 1; i <= cnt; i++)
2397 %newobject transaction;
2398 Transaction *transaction() {
2399 return solver_create_transaction($self);
2403 %extend Transaction {
2404 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2405 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2406 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2407 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2408 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2409 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2410 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2411 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2412 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2413 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2414 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2415 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2416 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2417 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2418 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2419 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2420 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2421 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2422 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2423 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2424 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2425 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2426 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2427 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2428 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2429 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2430 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2432 transaction_free($self);
2435 %rename("isempty?") isempty;
2438 return $self->steps.count == 0;
2441 %newobject othersolvable;
2442 XSolvable *othersolvable(XSolvable *s) {
2443 Id op = transaction_obs_pkg($self, s->id);
2444 return new_XSolvable($self->pool, op);
2447 %newobject allothersolvables;
2448 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2449 Queue allothersolvables(XSolvable *s) {
2452 transaction_all_obs_pkgs($self, s->id, &q);
2456 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2457 %newobject classify;
2458 Queue classify(int mode = 0) {
2461 transaction_classify($self, mode, &q);
2465 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2466 %newobject newpackages;
2467 Queue newpackages() {
2471 cut = transaction_installedresult(self, &q);
2472 queue_truncate(&q, cut);
2476 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2477 %newobject keptpackages;
2478 Queue keptpackages() {
2482 cut = transaction_installedresult(self, &q);
2484 queue_deleten(&q, 0, cut);
2488 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2492 queue_init_clone(&q, &$self->steps);
2496 int steptype(XSolvable *s, int mode) {
2497 return transaction_type($self, s->id, mode);
2499 int calc_installsizechange() {
2500 return transaction_calc_installsizechange($self);
2502 void order(int flags) {
2503 transaction_order($self, flags);
2507 %extend TransactionClass {
2508 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2509 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2510 cl->transaction = trans;
2514 cl->fromid = fromid;
2518 %newobject solvables;
2519 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2523 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2529 XRule(Solver *solv, Id id) {
2532 XRule *xr = solv_calloc(1, sizeof(*xr));
2538 Id type, source, target, dep;
2539 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2540 return new_Ruleinfo($self, type, source, target, dep);
2542 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2543 %newobject allinfos;
2547 solver_allruleinfos($self->solv, $self->id, &q);
2551 bool __eq__(XRule *xr) {
2552 return $self->solv == xr->solv && $self->id == xr->id;
2554 bool __ne__(XRule *xr) {
2555 return !XRule___eq__($self, xr);
2557 %newobject __repr__;
2558 const char *__repr__() {
2560 sprintf(buf, "<Rule #%d>", $self->id);
2561 return solv_strdup(buf);
2566 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2567 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2571 ri->source = source;
2572 ri->target = target;
2576 XSolvable * const solvable;
2577 XSolvable * const othersolvable;
2579 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2580 return new_XSolvable(ri->solv->pool, ri->source);
2582 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2583 return new_XSolvable(ri->solv->pool, ri->target);
2586 const char *problemstr() {
2587 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2592 XRepodata(Repo *repo, Id id) {
2593 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2599 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2601 void set_id(Id solvid, Id keyname, Id id) {
2602 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2604 void set_str(Id solvid, Id keyname, const char *str) {
2605 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2607 void set_poolstr(Id solvid, Id keyname, const char *str) {
2608 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2610 void add_idarray(Id solvid, Id keyname, Id id) {
2611 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2613 void add_flexarray(Id solvid, Id keyname, Id handle) {
2614 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2616 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2617 const unsigned char *buf = solv_chksum_get(chksum, 0);
2619 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2621 const char *lookup_str(Id solvid, Id keyname) {
2622 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2624 Queue lookup_idarray(Id solvid, Id keyname) {
2627 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2630 %newobject lookup_checksum;
2631 Chksum *lookup_checksum(Id solvid, Id keyname) {
2633 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2634 return solv_chksum_create_from_bin(type, b);
2636 void internalize() {
2637 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2639 void create_stubs() {
2640 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2642 void write(FILE *fp) {
2643 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2645 bool add_solv(FILE *fp, int flags = 0) {
2646 Repodata *data = repo_id2repodata($self->repo, $self->id);
2647 int r, oldstate = data->state;
2648 data->state = REPODATA_LOADING;
2649 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2650 if (r || data->state == REPODATA_LOADING)
2651 data->state = oldstate;
2654 void extend_to_repo() {
2655 Repodata *data = repo_id2repodata($self->repo, $self->id);
2656 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2658 bool __eq__(XRepodata *xr) {
2659 return $self->repo == xr->repo && $self->id == xr->id;
2661 bool __ne__(XRepodata *xr) {
2662 return !XRepodata___eq__($self, xr);
2664 %newobject __repr__;
2665 const char *__repr__() {
2667 sprintf(buf, "<Repodata #%d>", $self->id);
2668 return solv_strdup(buf);