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/types.h>
340 /* argh, swig undefs bool for perl */
346 #include "poolarch.h"
349 #include "solverdebug.h"
350 #include "repo_solv.h"
352 #include "selection.h"
354 #include "repo_write.h"
356 #include "repo_rpmdb.h"
359 #include "repo_deb.h"
362 #include "repo_rpmmd.h"
363 #include "repo_updateinfoxml.h"
364 #include "repo_deltainfoxml.h"
365 #include "repo_repomdxml.h"
367 #ifdef ENABLE_SUSEREPO
368 #include "repo_products.h"
369 #include "repo_susetags.h"
370 #include "repo_content.h"
372 #ifdef ENABLE_MDKREPO
373 #include "repo_mdk.h"
375 #ifdef ENABLE_ARCHREPO
376 #include "repo_arch.h"
378 #include "solv_xfopen.h"
380 /* for old ruby versions */
382 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
385 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
388 #define SOLVER_SOLUTION_ERASE -100
389 #define SOLVER_SOLUTION_REPLACE -101
390 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
391 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
392 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
394 typedef struct chksum Chksum;
395 typedef void *AppObjectPtr;
420 } Pool_solvable_iterator;
425 } Pool_repo_iterator;
430 } Repo_solvable_iterator;
470 Transaction *transaction;
484 typedef Dataiterator Datamatch;
489 %mixin Dataiterator "Enumerable";
490 %mixin Pool_solvable_iterator "Enumerable";
491 %mixin Pool_repo_iterator "Enumerable";
492 %mixin Repo_solvable_iterator "Enumerable";
500 %constant Id SOLVID_META;
501 %constant Id SOLVID_POS;
503 %constant int REL_EQ;
504 %constant int REL_GT;
505 %constant int REL_LT;
506 %constant int REL_ARCH;
538 # put before pool/repo so we can access the constructor
539 %nodefaultdtor Dataiterator;
540 typedef struct {} Dataiterator;
541 typedef struct {} Pool_solvable_iterator;
542 typedef struct {} Pool_repo_iterator;
543 typedef struct {} Repo_solvable_iterator;
545 %nodefaultctor Datamatch;
546 %nodefaultdtor Datamatch;
553 %nodefaultctor Datapos;
567 AppObjectPtr appdata;
574 const char * const name;
577 int const nsolvables;
578 AppObjectPtr appdata;
581 %nodefaultctor Solver;
582 %nodefaultdtor Solver;
590 %rename(xfopen) solv_xfopen;
591 %rename(xfopen_fd) solv_xfopen_fd;
592 %rename(xfopen_dup) solv_xfopen_dup;
593 %rename(xfclose) solv_xfclose;
594 %rename(xfileno) solv_xfileno;
596 FILE *solv_xfopen(const char *fn, const char *mode = 0);
597 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
598 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
599 int solv_xfclose(FILE *fp);
600 int solv_xfileno(FILE *fp);
603 SWIGINTERN int solv_xfclose(FILE *fp) {
606 SWIGINTERN int solv_xfileno(FILE *fp) {
609 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
611 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
634 %nodefaultctor Transaction;
635 %nodefaultdtor Transaction;
641 Transaction * const transaction;
650 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
651 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
652 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
653 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
654 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
655 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
656 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
657 static const Id SOLVER_NOOP = SOLVER_NOOP;
658 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
659 static const Id SOLVER_ERASE = SOLVER_ERASE;
660 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
661 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
662 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
663 static const Id SOLVER_LOCK = SOLVER_LOCK;
664 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
665 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
666 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
667 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
668 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
669 static const Id SOLVER_WEAK = SOLVER_WEAK;
670 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
671 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
672 static const Id SOLVER_SETEV = SOLVER_SETEV;
673 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
674 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
675 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
676 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
677 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
678 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
680 Job(Pool *pool, int how, Id what) {
681 Job *job = solv_calloc(1, sizeof(*job));
688 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
689 %newobject solvables;
693 pool_job2solvables($self->pool, &q, $self->how, $self->what);
697 bool __eq__(Job *j) {
698 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
700 bool __ne__(Job *j) {
701 return !Job___eq__($self, j);
703 #if defined(SWIGPERL)
704 %rename("str") __str__;
706 const char *__str__() {
707 return pool_job2str($self->pool, $self->how, $self->what, 0);
709 const char *__repr__() {
710 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
711 return pool_tmpjoin($self->pool, "<Job ", str, ">");
716 static const Id SELECTION_NAME = SELECTION_NAME;
717 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
718 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
719 static const Id SELECTION_GLOB = SELECTION_GLOB;
720 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
721 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
722 static const Id SELECTION_FLAT = SELECTION_FLAT;
723 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
724 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
726 Selection(Pool *pool) {
728 s = solv_calloc(1, sizeof(*s));
734 queue_free(&$self->q);
740 void make(const char *name, int flags) {
741 $self->flags = selection_make($self->pool, &$self->q, name, flags);
744 %rename("isempty?") isempty;
747 return $self->q.count == 0;
749 void limit(Selection *lsel) {
750 if ($self->pool != lsel->pool)
751 queue_empty(&$self->q);
753 selection_limit($self->pool, &$self->q, &lsel->q);
755 void add(Selection *lsel) {
756 if ($self->pool == lsel->pool)
758 selection_add($self->pool, &$self->q, &lsel->q);
759 $self->flags |= lsel->flags;
762 void addsimple(Id how, Id what) {
763 queue_push2(&$self->q, how, what);
765 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
767 Queue jobs(int flags) {
770 queue_init_clone(&q, &$self->q);
771 for (i = 0; i < q.count; i += 2)
772 q.elements[i] |= flags;
776 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
777 %newobject solvables;
781 selection_solvables($self->pool, &$self->q, &q);
785 #if defined(SWIGPERL)
786 %rename("str") __str__;
788 const char *__str__() {
789 return pool_selection2str($self->pool, &$self->q, 0);
791 const char *__repr__() {
792 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
793 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
799 return (Chksum *)solv_chksum_create(type);
801 Chksum(Id type, const char *hex) {
802 unsigned char buf[64];
803 int l = solv_chksum_len(type);
806 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
808 return (Chksum *)solv_chksum_create_from_bin(type, buf);
811 solv_chksum_free($self, 0);
815 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
816 return solv_chksum_get_type(chksum);
819 void add(const char *str) {
820 solv_chksum_add($self, str, strlen((char *)str));
822 void add_fp(FILE *fp) {
825 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
826 solv_chksum_add($self, buf, l);
827 rewind(fp); /* convenience */
829 void add_fd(int fd) {
832 while ((l = read(fd, buf, sizeof(buf))) > 0)
833 solv_chksum_add($self, buf, l);
834 lseek(fd, 0, 0); /* convenience */
836 void add_stat(const char *filename) {
838 if (stat(filename, &stb))
839 memset(&stb, 0, sizeof(stb));
840 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
841 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
842 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
843 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
845 void add_fstat(int fd) {
848 memset(&stb, 0, sizeof(stb));
849 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
850 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
851 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
852 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
856 const unsigned char *b;
857 b = solv_chksum_get($self, &l);
858 return cdata_void((void *)b, l);
863 const unsigned char *b;
866 b = solv_chksum_get($self, &l);
867 ret = solv_malloc(2 * l + 1);
868 solv_bin2hex(b, l, ret);
872 bool __eq__(Chksum *chk) {
874 const unsigned char *b, *bo;
877 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
879 b = solv_chksum_get($self, &l);
880 bo = solv_chksum_get(chk, 0);
881 return memcmp(b, bo, l) == 0;
883 bool __ne__(Chksum *chk) {
884 return !Chksum___eq__($self, chk);
886 #if defined(SWIGRUBY)
887 %rename("to_s") __str__;
888 %rename("inspect") __repr__;
890 #if defined(SWIGPERL)
891 %rename("str") __str__;
894 const char *__str__() {
897 if (solv_chksum_isfinished($self))
898 h = Chksum_hex($self);
899 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
900 solv_free((void *)h);
904 const char *__repr__() {
905 const char *h = Chksum___str__($self);
906 const char *str = solv_dupjoin("<Chksum ", h, ">");
907 solv_free((void *)h);
914 Pool *pool = pool_create();
919 void set_debuglevel(int level) {
920 pool_setdebuglevel($self, level);
922 int set_flag(int flag, int value) {
923 return pool_set_flag($self, flag, value);
925 int get_flag(int flag) {
926 return pool_get_flag($self, flag);
928 void set_rootdir(const char *rootdir) {
929 pool_set_rootdir($self, rootdir);
931 const char *get_rootdir(int flag) {
932 return pool_get_rootdir($self);
934 #if defined(SWIGPYTHON)
936 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
937 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
938 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
939 PyObject *result = PyEval_CallObject((PyObject *)d, args);
944 return 0; /* exception */
945 ecode = SWIG_AsVal_int(result, &vresult);
947 return SWIG_IsOK(ecode) ? vresult : 0;
950 void set_loadcallback(PyObject *callable) {
951 if ($self->loadcallback == loadcallback) {
952 PyObject *obj = $self->loadcallbackdata;
958 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
961 #if defined(SWIGPERL)
963 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
967 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
972 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
974 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
984 void set_loadcallback(SV *callable) {
985 if ($self->loadcallback == loadcallback)
986 SvREFCNT_dec($self->loadcallbackdata);
988 SvREFCNT_inc(callable);
989 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
993 #if defined(SWIGRUBY)
995 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
996 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
997 VALUE callable = (VALUE)d;
998 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
999 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1000 return res == Qtrue;
1002 SWIGINTERN void mark_Pool(void *ptr) {
1004 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1005 VALUE callable = (VALUE)pool->loadcallbackdata;
1006 rb_gc_mark(callable);
1010 %typemap(in, numinputs=0) VALUE callable {
1011 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1013 void set_loadcallback(VALUE callable) {
1014 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1019 Pool_set_loadcallback($self, 0);
1022 Id str2id(const char *str, bool create=1) {
1023 return pool_str2id($self, str, create);
1025 Dep *Dep(const char *str, bool create=1) {
1026 Id id = pool_str2id($self, str, create);
1027 return new_Dep($self, id);
1029 const char *id2str(Id id) {
1030 return pool_id2str($self, id);
1032 const char *dep2str(Id id) {
1033 return pool_dep2str($self, id);
1035 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1036 return pool_rel2id($self, name, evr, flags, create);
1038 Id id2langid(Id id, const char *lang, bool create=1) {
1039 return pool_id2langid($self, id, lang, create);
1041 void setarch(const char *arch) {
1042 pool_setarch($self, arch);
1044 Repo *add_repo(const char *name) {
1045 return repo_create($self, name);
1047 const char *lookup_str(Id entry, Id keyname) {
1048 return pool_lookup_str($self, entry, keyname);
1050 Id lookup_id(Id entry, Id keyname) {
1051 return pool_lookup_id($self, entry, keyname);
1053 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1054 return pool_lookup_num($self, entry, keyname, notfound);
1056 bool lookup_void(Id entry, Id keyname) {
1057 return pool_lookup_void($self, entry, keyname);
1059 %newobject lookup_checksum;
1060 Chksum *lookup_checksum(Id entry, Id keyname) {
1062 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1063 return solv_chksum_create_from_bin(type, b);
1066 %newobject Dataiterator;
1067 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1068 return new_Dataiterator($self, 0, p, key, match, flags);
1070 const char *solvid2str(Id solvid) {
1071 return pool_solvid2str($self, solvid);
1073 void addfileprovides() {
1074 pool_addfileprovides($self);
1076 Queue addfileprovides_queue() {
1079 pool_addfileprovides_queue($self, &r, 0);
1082 void createwhatprovides() {
1083 pool_createwhatprovides($self);
1086 XSolvable *id2solvable(Id id) {
1087 return new_XSolvable($self, id);
1089 %newobject solvables;
1090 Pool_solvable_iterator * const solvables;
1092 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1093 return new_Pool_solvable_iterator(pool);
1096 %newobject solvables_iter;
1097 Pool_solvable_iterator * solvables_iter() {
1098 return new_Pool_solvable_iterator($self);
1101 Repo *id2repo(Id id) {
1102 if (id < 1 || id >= $self->nrepos)
1104 return pool_id2repo($self, id);
1107 Pool_repo_iterator * const repos;
1109 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1110 return new_Pool_repo_iterator(pool);
1113 %newobject repos_iter;
1114 Pool_repo_iterator * repos_iter() {
1115 return new_Pool_repo_iterator($self);
1120 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1121 pool_set_installed(pool, installed);
1123 Repo *Pool_installed_get(Pool *pool) {
1124 return pool->installed;
1128 Queue matchprovidingids(const char *match, int flags) {
1134 for (id = 1; id < pool->ss.nstrings; id++)
1135 if (pool->whatprovides[id])
1139 if (!datamatcher_init(&ma, match, flags)) {
1140 for (id = 1; id < pool->ss.nstrings; id++)
1141 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1143 datamatcher_free(&ma);
1149 Job *Job(int how, Id what) {
1150 return new_Job($self, how, what);
1153 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1154 %newobject whatprovides;
1155 Queue whatprovides(Id dep) {
1160 FOR_PROVIDES(p, pp, dep)
1165 Id towhatprovides(Queue q) {
1166 return pool_queuetowhatprovides($self, &q);
1170 %rename("isknownarch?") isknownarch;
1172 bool isknownarch(Id id) {
1174 if (!id || id == ID_EMPTY)
1176 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1178 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1185 return solver_create($self);
1188 %newobject Selection;
1189 Selection *Selection() {
1190 return new_Selection($self);
1193 Selection *select(const char *name, int flags) {
1194 Selection *sel = new_Selection($self);
1195 sel->flags = selection_make($self, &sel->q, name, flags);
1201 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1202 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1203 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1204 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1205 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1206 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1207 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1208 #ifdef ENABLE_SUSEREPO
1209 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1212 void free(bool reuseids = 0) {
1213 repo_free($self, reuseids);
1215 void empty(bool reuseids = 0) {
1216 repo_empty($self, reuseids);
1219 %rename("isempty?") isempty;
1222 return !$self->nsolvables;
1224 bool add_solv(const char *name, int flags = 0) {
1225 FILE *fp = fopen(name, "r");
1229 r = repo_add_solv($self, fp, flags);
1233 bool add_solv(FILE *fp, int flags = 0) {
1234 return repo_add_solv($self, fp, flags) == 0;
1237 XSolvable *add_solvable() {
1238 Id solvid = repo_add_solvable($self);
1239 return new_XSolvable($self->pool, solvid);
1243 bool add_rpmdb(Repo *ref, int flags = 0) {
1244 return repo_add_rpmdb($self, ref, flags);
1246 Id add_rpm(const char *name, int flags = 0) {
1247 return repo_add_rpm($self, name, flags);
1251 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1252 return repo_add_rpmmd($self, fp, language, flags);
1254 bool add_repomdxml(FILE *fp, int flags = 0) {
1255 return repo_add_repomdxml($self, fp, flags);
1257 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1258 return repo_add_updateinfoxml($self, fp, flags);
1260 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1261 return repo_add_deltainfoxml($self, fp, flags);
1264 #ifdef ENABLE_DEBIAN
1265 bool add_debdb(int flags = 0) {
1266 return repo_add_debdb($self, flags);
1268 Id add_deb(const char *name, int flags = 0) {
1269 return repo_add_deb($self, name, flags);
1272 #ifdef ENABLE_SUSEREPO
1273 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1274 return repo_add_susetags($self, fp, defvendor, language, flags);
1276 bool add_content(FILE *fp, int flags = 0) {
1277 return repo_add_content($self, fp, flags);
1279 bool add_products(const char *proddir, int flags = 0) {
1280 return repo_add_products($self, proddir, flags);
1283 #ifdef ENABLE_MDKREPO
1284 bool add_mdk(FILE *fp, int flags = 0) {
1285 return repo_add_mdk($self, fp, flags);
1287 bool add_mdk_info(FILE *fp, int flags = 0) {
1288 return repo_add_mdk($self, fp, flags);
1291 #ifdef ENABLE_ARCHREPO
1292 bool add_arch_repo(FILE *fp, int flags = 0) {
1293 return repo_add_arch_repo($self, fp, flags);
1295 Id add_arch_pkg(const char *name, int flags = 0) {
1296 return repo_add_arch_pkg($self, name, flags);
1299 void internalize() {
1300 repo_internalize($self);
1302 const char *lookup_str(Id entry, Id keyname) {
1303 return repo_lookup_str($self, entry, keyname);
1305 Id lookup_id(Id entry, Id keyname) {
1306 return repo_lookup_id($self, entry, keyname);
1308 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1309 return repo_lookup_num($self, entry, keyname, notfound);
1311 void write(FILE *fp) {
1312 repo_write($self, fp);
1314 # HACK, remove if no longer needed!
1315 bool write_first_repodata(FILE *fp) {
1316 int oldnrepodata = $self->nrepodata;
1317 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1318 repo_write($self, fp);
1319 $self->nrepodata = oldnrepodata;
1323 %newobject Dataiterator;
1324 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1325 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1330 SWIGINTERN Id Repo_id_get(Repo *repo) {
1331 return repo->repoid;
1334 Repo_solvable_iterator * const solvables;
1336 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1337 return new_Repo_solvable_iterator(repo);
1340 %newobject solvables_iter;
1341 Repo_solvable_iterator *solvables_iter() {
1342 return new_Repo_solvable_iterator($self);
1345 XRepodata *add_repodata(int flags = 0) {
1346 Repodata *rd = repo_add_repodata($self, flags);
1347 return new_XRepodata($self, rd->repodataid);
1350 void create_stubs() {
1352 if (!$self->nrepodata)
1354 data = repo_id2repodata($self, $self->nrepodata - 1);
1355 if (data->state != REPODATA_STUB)
1356 repodata_create_stubs(data);
1359 %rename("iscontiguous?") iscontiguous;
1361 bool iscontiguous() {
1363 for (i = $self->start; i < $self->end; i++)
1364 if ($self->pool->solvables[i].repo != $self)
1368 XRepodata *first_repodata() {
1371 if ($self->nrepodata < 2)
1373 /* make sure all repodatas but the first are extensions */
1374 data = repo_id2repodata($self, 1);
1375 if (data->loadcallback)
1377 for (i = 2; i < $self->nrepodata; i++)
1379 data = repo_id2repodata($self, i);
1380 if (!data->loadcallback)
1381 return 0; /* oops, not an extension */
1383 return new_XRepodata($self, 1);
1386 bool __eq__(Repo *repo) {
1387 return $self == repo;
1389 bool __ne__(Repo *repo) {
1390 return $self != repo;
1392 #if defined(SWIGPERL)
1393 %rename("str") __str__;
1396 const char *__str__() {
1399 return solv_strdup($self->name);
1400 sprintf(buf, "Repo#%d", $self->repoid);
1401 return solv_strdup(buf);
1403 %newobject __repr__;
1404 const char *__repr__() {
1408 sprintf(buf, "<Repo #%d ", $self->repoid);
1409 return solv_dupjoin(buf, $self->name, ">");
1411 sprintf(buf, "<Repo #%d>", $self->repoid);
1412 return solv_strdup(buf);
1416 %extend Dataiterator {
1417 static const int SEARCH_STRING = SEARCH_STRING;
1418 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1419 static const int SEARCH_GLOB = SEARCH_GLOB;
1420 static const int SEARCH_REGEX = SEARCH_REGEX;
1421 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1422 static const int SEARCH_FILES = SEARCH_FILES;
1423 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1425 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1426 Dataiterator *di = solv_calloc(1, sizeof(*di));
1427 dataiterator_init(di, pool, repo, p, key, match, flags);
1431 dataiterator_free($self);
1434 #if defined(SWIGPYTHON)
1435 %newobject __iter__;
1436 Dataiterator *__iter__() {
1438 ndi = solv_calloc(1, sizeof(*ndi));
1439 dataiterator_init_clone(ndi, $self);
1442 %rename("next") __next__();
1443 %exception __next__ {
1446 PyErr_SetString(PyExc_StopIteration,"no more matches");
1453 perliter(solv::Dataiterator)
1456 %newobject __next__;
1457 Datamatch *__next__() {
1459 if (!dataiterator_step($self)) {
1462 ndi = solv_calloc(1, sizeof(*ndi));
1463 dataiterator_init_clone(ndi, $self);
1469 while ((d = Dataiterator___next__($self)) != 0) {
1470 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1474 void prepend_keyname(Id key) {
1475 dataiterator_prepend_keyname($self, key);
1477 void skip_solvable() {
1478 dataiterator_skip_solvable($self);
1483 Id lookup_id(Id keyname) {
1484 Pool *pool = $self->repo->pool;
1485 Datapos oldpos = pool->pos;
1488 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1492 const char *lookup_str(Id keyname) {
1493 Pool *pool = $self->repo->pool;
1494 Datapos oldpos = pool->pos;
1497 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1501 %newobject lookup_checksum;
1502 Chksum *lookup_checksum(Id keyname) {
1503 Pool *pool = $self->repo->pool;
1504 Datapos oldpos = pool->pos;
1506 const unsigned char *b;
1508 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1510 return solv_chksum_create_from_bin(type, b);
1516 dataiterator_free($self);
1519 %newobject solvable;
1520 XSolvable * const solvable;
1522 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1523 return new_XSolvable(di->pool, di->solvid);
1527 return $self->key->name;
1529 const char *key_idstr() {
1530 return pool_id2str($self->pool, $self->key->name);
1533 return $self->key->type;
1535 const char *type_idstr() {
1536 return pool_id2str($self->pool, $self->key->type);
1539 return $self->kv.id;
1541 const char *idstr() {
1542 return pool_id2str($self->pool, $self->kv.id);
1545 return $self->kv.str;
1548 return $self->kv.num;
1551 return $self->kv.num2;
1555 Pool *pool = $self->pool;
1556 Datapos *pos, oldpos = pool->pos;
1557 dataiterator_setpos($self);
1558 pos = solv_calloc(1, sizeof(*pos));
1563 %newobject parentpos;
1564 Datapos *parentpos() {
1565 Pool *pool = $self->pool;
1566 Datapos *pos, oldpos = pool->pos;
1567 dataiterator_setpos_parent($self);
1568 pos = solv_calloc(1, sizeof(*pos));
1574 dataiterator_setpos($self);
1576 void setpos_parent() {
1577 dataiterator_setpos_parent($self);
1581 %extend Pool_solvable_iterator {
1582 Pool_solvable_iterator(Pool *pool) {
1583 Pool_solvable_iterator *s;
1584 s = solv_calloc(1, sizeof(*s));
1588 #if defined(SWIGPYTHON)
1589 %newobject __iter__;
1590 Pool_solvable_iterator *__iter__() {
1591 Pool_solvable_iterator *s;
1592 s = solv_calloc(1, sizeof(*s));
1596 %rename("next") __next__();
1597 %exception __next__ {
1600 PyErr_SetString(PyExc_StopIteration,"no more matches");
1607 perliter(solv::Pool_solvable_iterator)
1609 %newobject __next__;
1610 XSolvable *__next__() {
1611 Pool *pool = $self->pool;
1612 if ($self->id >= pool->nsolvables)
1614 while (++$self->id < pool->nsolvables)
1615 if (pool->solvables[$self->id].repo)
1616 return new_XSolvable(pool, $self->id);
1622 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1623 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1627 %newobject __getitem__;
1628 XSolvable *__getitem__(Id key) {
1629 Pool *pool = $self->pool;
1630 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1631 return new_XSolvable(pool, key);
1635 return $self->pool->nsolvables;
1639 %extend Pool_repo_iterator {
1640 Pool_repo_iterator(Pool *pool) {
1641 Pool_repo_iterator *s;
1642 s = solv_calloc(1, sizeof(*s));
1646 #if defined(SWIGPYTHON)
1647 %newobject __iter__;
1648 Pool_repo_iterator *__iter__() {
1649 Pool_repo_iterator *s;
1650 s = solv_calloc(1, sizeof(*s));
1654 %rename("next") __next__();
1655 %exception __next__ {
1658 PyErr_SetString(PyExc_StopIteration,"no more matches");
1663 %newobject __next__;
1665 Pool *pool = $self->pool;
1666 if ($self->id >= pool->nrepos)
1668 while (++$self->id < pool->nrepos) {
1669 Repo *r = pool_id2repo(pool, $self->id);
1678 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1679 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1683 Repo *__getitem__(Id key) {
1684 Pool *pool = $self->pool;
1685 if (key > 0 && key < pool->nrepos)
1686 return pool_id2repo(pool, key);
1690 return $self->pool->nrepos;
1694 %extend Repo_solvable_iterator {
1695 Repo_solvable_iterator(Repo *repo) {
1696 Repo_solvable_iterator *s;
1697 s = solv_calloc(1, sizeof(*s));
1701 #if defined(SWIGPYTHON)
1702 %newobject __iter__;
1703 Repo_solvable_iterator *__iter__() {
1704 Repo_solvable_iterator *s;
1705 s = solv_calloc(1, sizeof(*s));
1709 %rename("next") __next__();
1710 %exception __next__ {
1713 PyErr_SetString(PyExc_StopIteration,"no more matches");
1718 %newobject __next__;
1719 XSolvable *__next__() {
1720 Repo *repo = $self->repo;
1721 Pool *pool = repo->pool;
1722 if (repo->start > 0 && $self->id < repo->start)
1723 $self->id = repo->start - 1;
1724 if ($self->id >= repo->end)
1726 while (++$self->id < repo->end)
1727 if (pool->solvables[$self->id].repo == repo)
1728 return new_XSolvable(pool, $self->id);
1734 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1735 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1739 %newobject __getitem__;
1740 XSolvable *__getitem__(Id key) {
1741 Repo *repo = $self->repo;
1742 Pool *pool = repo->pool;
1743 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1744 return new_XSolvable(pool, key);
1748 return $self->repo->pool->nsolvables;
1753 Dep(Pool *pool, Id id) {
1757 s = solv_calloc(1, sizeof(*s));
1763 return pool_dep2str($self->pool, $self->id);
1765 bool __eq__(Dep *s) {
1766 return $self->pool == s->pool && $self->id == s->id;
1768 bool __ne__(Dep *s) {
1769 return !Dep___eq__($self, s);
1771 #if defined(SWIGPERL)
1772 %rename("str") __str__;
1774 const char *__str__() {
1775 return pool_dep2str($self->pool, $self->id);
1777 %newobject __repr__;
1778 const char *__repr__() {
1780 sprintf(buf, "<Id #%d ", $self->id);
1781 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1786 XSolvable(Pool *pool, Id id) {
1788 if (!id || id >= pool->nsolvables)
1790 s = solv_calloc(1, sizeof(*s));
1796 return pool_solvid2str($self->pool, $self->id);
1798 const char *lookup_str(Id keyname) {
1799 return pool_lookup_str($self->pool, $self->id, keyname);
1801 Id lookup_id(Id keyname) {
1802 return pool_lookup_id($self->pool, $self->id, keyname);
1804 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1805 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1807 bool lookup_void(Id keyname) {
1808 return pool_lookup_void($self->pool, $self->id, keyname);
1810 %newobject lookup_checksum;
1811 Chksum *lookup_checksum(Id keyname) {
1813 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1814 return solv_chksum_create_from_bin(type, b);
1816 Queue lookup_idarray(Id keyname, Id marker = -1) {
1817 Solvable *s = $self->pool->solvables + $self->id;
1820 if (marker == -1 || marker == 1) {
1821 if (keyname == SOLVABLE_PROVIDES)
1822 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1823 else if (keyname == SOLVABLE_REQUIRES)
1824 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1828 solvable_lookup_deparray(s, keyname, &r, marker);
1831 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1832 %newobject lookup_deparray;
1833 Queue lookup_deparray(Id keyname, Id marker = -1) {
1834 Solvable *s = $self->pool->solvables + $self->id;
1837 if (marker == -1 || marker == 1) {
1838 if (keyname == SOLVABLE_PROVIDES)
1839 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1840 else if (keyname == SOLVABLE_REQUIRES)
1841 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1845 solvable_lookup_deparray(s, keyname, &r, marker);
1848 const char *lookup_location(unsigned int *OUTPUT) {
1849 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1852 %rename("installable?") installable;
1854 bool installable() {
1855 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1858 %rename("isinstalled?") isinstalled;
1860 bool isinstalled() {
1861 Pool *pool = $self->pool;
1862 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1867 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1868 Pool *pool = xs->pool;
1869 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1871 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1872 Pool *pool = xs->pool;
1873 return pool_id2str(pool, pool->solvables[xs->id].name);
1878 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1879 xs->pool->solvables[xs->id].name = nameid;
1881 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1882 return xs->pool->solvables[xs->id].name;
1887 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1888 Pool *pool = xs->pool;
1889 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1891 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1892 Pool *pool = xs->pool;
1893 return pool_id2str(pool, pool->solvables[xs->id].evr);
1898 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1899 xs->pool->solvables[xs->id].evr = evrid;
1901 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1902 return xs->pool->solvables[xs->id].evr;
1907 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1908 Pool *pool = xs->pool;
1909 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1911 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1912 Pool *pool = xs->pool;
1913 return pool_id2str(pool, pool->solvables[xs->id].arch);
1918 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1919 xs->pool->solvables[xs->id].arch = archid;
1921 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1922 return xs->pool->solvables[xs->id].arch;
1927 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1928 Pool *pool = xs->pool;
1929 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1931 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1932 Pool *pool = xs->pool;
1933 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1938 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1939 xs->pool->solvables[xs->id].vendor = vendorid;
1941 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1942 return xs->pool->solvables[xs->id].vendor;
1947 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1948 return xs->pool->solvables[xs->id].repo;
1952 void add_provides(Dep *dep, Id marker = -1) {
1953 Solvable *s = $self->pool->solvables + $self->id;
1954 if (marker == -1 || marker == 1)
1955 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1956 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1958 void add_providesid(Id id, Id marker = -1) {
1959 Solvable *s = $self->pool->solvables + $self->id;
1960 if (marker == -1 || marker == 1)
1961 marker = marker < 0 ? -SOLVABLE_FILEMARKER : SOLVABLE_FILEMARKER;
1962 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1964 void add_obsoletes(Dep *dep) {
1965 Solvable *s = $self->pool->solvables + $self->id;
1966 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1968 void add_obsoletesid(Id id) {
1969 Solvable *s = $self->pool->solvables + $self->id;
1970 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1972 void add_conflicts(Dep *dep) {
1973 Solvable *s = $self->pool->solvables + $self->id;
1974 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1976 void add_conflictsid(Id id) {
1977 Solvable *s = $self->pool->solvables + $self->id;
1978 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1980 void add_requires(Dep *dep, Id marker = -1) {
1981 Solvable *s = $self->pool->solvables + $self->id;
1982 if (marker == -1 || marker == 1)
1983 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1984 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1986 void add_requiresid(Id id, Id marker = -1) {
1987 Solvable *s = $self->pool->solvables + $self->id;
1988 if (marker == -1 || marker == 1)
1989 marker = marker < 0 ? -SOLVABLE_PREREQMARKER : SOLVABLE_PREREQMARKER;
1990 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1992 void add_recommends(Dep *dep) {
1993 Solvable *s = $self->pool->solvables + $self->id;
1994 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1996 void add_recommendsid(Id id) {
1997 Solvable *s = $self->pool->solvables + $self->id;
1998 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2000 void add_suggests(Dep *dep) {
2001 Solvable *s = $self->pool->solvables + $self->id;
2002 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
2004 void add_suggestsid(Id id) {
2005 Solvable *s = $self->pool->solvables + $self->id;
2006 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2008 void add_supplements(Dep *dep) {
2009 Solvable *s = $self->pool->solvables + $self->id;
2010 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
2012 void add_supplementsid(Id id) {
2013 Solvable *s = $self->pool->solvables + $self->id;
2014 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2016 void add_enhances(Dep *dep) {
2017 Solvable *s = $self->pool->solvables + $self->id;
2018 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
2020 void add_enhancesid(Id id) {
2021 Solvable *s = $self->pool->solvables + $self->id;
2022 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2025 bool __eq__(XSolvable *s) {
2026 return $self->pool == s->pool && $self->id == s->id;
2028 bool __ne__(XSolvable *s) {
2029 return !XSolvable___eq__($self, s);
2031 #if defined(SWIGPERL)
2032 %rename("str") __str__;
2034 const char *__str__() {
2035 return pool_solvid2str($self->pool, $self->id);
2037 %newobject __repr__;
2038 const char *__repr__() {
2040 sprintf(buf, "<Solvable #%d ", $self->id);
2041 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2046 Problem(Solver *solv, Id id) {
2048 p = solv_calloc(1, sizeof(*p));
2053 %newobject findproblemrule;
2054 XRule *findproblemrule() {
2055 Id r = solver_findproblemrule($self->solv, $self->id);
2056 return new_XRule($self->solv, r);
2058 %newobject findallproblemrules;
2059 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2060 Queue findallproblemrules(int unfiltered=0) {
2061 Solver *solv = $self->solv;
2066 solver_findallproblemrules(solv, $self->id, &q);
2069 for (i = j = 0; i < q.count; i++)
2071 SolverRuleinfo rclass;
2072 probr = q.elements[i];
2073 rclass = solver_ruleclass(solv, probr);
2074 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2076 q.elements[j++] = probr;
2079 queue_truncate(&q, j);
2083 int solution_count() {
2084 return solver_solution_count($self->solv, $self->id);
2086 %newobject solutions;
2087 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2092 cnt = solver_solution_count($self->solv, $self->id);
2093 for (i = 1; i <= cnt; i++)
2100 Solution(Problem *p, Id id) {
2102 s = solv_calloc(1, sizeof(*s));
2104 s->problemid = p->id;
2108 int element_count() {
2109 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2112 %newobject elements;
2113 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2114 Queue elements(bool expandreplaces=0) {
2118 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2119 for (i = 1; i <= cnt; i++)
2122 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2124 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2130 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2131 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2133 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2134 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2135 queue_push2(&q, p, rp);
2137 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2138 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2139 queue_push2(&q, p, rp);
2141 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2142 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2143 queue_push2(&q, p, rp);
2148 queue_push2(&q, i, type);
2149 queue_push2(&q, p, rp);
2155 %extend Solutionelement {
2156 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2158 e = solv_calloc(1, sizeof(*e));
2160 e->problemid = problemid;
2171 if (p == SOLVER_SOLUTION_ERASE)
2176 else if (p == SOLVER_SOLUTION_REPLACE)
2181 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2182 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);
2183 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2184 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);
2185 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2186 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);
2187 return solver_solutionelement2str($self->solv, p, rp);
2189 %newobject replaceelements;
2190 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2191 Queue replaceelements() {
2196 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2199 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2200 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2201 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2202 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2203 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2204 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2205 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2207 queue_push(&q, $self->type);
2210 int illegalreplace() {
2211 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2213 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2215 %newobject solvable;
2216 XSolvable * const solvable;
2217 %newobject replacement;
2218 XSolvable * const replacement;
2221 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2222 return new_XSolvable(e->solv->pool, e->p);
2224 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2225 return new_XSolvable(e->solv->pool, e->rp);
2227 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2228 if (e->type != SOLVER_SOLUTION_JOB)
2230 return (e->p - 1) / 2;
2235 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2236 if ($self->type == SOLVER_SOLUTION_JOB)
2237 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2238 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2239 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2240 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2241 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2242 if ($self->type == SOLVER_SOLUTION_ERASE)
2243 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2249 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2250 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2251 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2252 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2253 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2254 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2255 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2256 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2257 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2258 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2259 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2260 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2261 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2262 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2263 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2264 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2265 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2266 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2267 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2269 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2270 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2271 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2272 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2273 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2274 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2275 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2276 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2278 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2279 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2280 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2282 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2283 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2284 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2285 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2286 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2287 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2288 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2289 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2290 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2296 int set_flag(int flag, int value) {
2297 return solver_set_flag($self, flag, value);
2299 int get_flag(int flag) {
2300 return solver_get_flag($self, flag);
2302 #if defined(SWIGPYTHON)
2304 def solve(self, jobs):
2306 for job in jobs: j += [job.how, job.what]
2307 return self.solve_helper(j)
2310 #if defined(SWIGPERL)
2312 sub solv::Solver::solve {
2313 my ($self, $jobs) = @_;
2314 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2315 return $self->solve_helper(\@j);
2319 #if defined(SWIGRUBY)
2322 "class Solv::Solver\n"
2323 " def solve(jobs)\n"
2325 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2326 " solve_helper(jl)\n"
2332 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2333 %newobject solve_helper;
2334 Queue solve_helper(Queue jobs) {
2338 solver_solve($self, &jobs);
2339 cnt = solver_problem_count($self);
2340 for (i = 1; i <= cnt; i++)
2344 %newobject transaction;
2345 Transaction *transaction() {
2346 return solver_create_transaction($self);
2350 %extend Transaction {
2351 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2352 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2353 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2354 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2355 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2356 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2357 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2358 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2359 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2360 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2361 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2362 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2363 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2364 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2365 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2366 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2367 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2368 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2369 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2370 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2371 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2372 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2373 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2374 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2375 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2376 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2377 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2379 transaction_free($self);
2382 %rename("isempty?") isempty;
2385 return $self->steps.count == 0;
2388 %newobject othersolvable;
2389 XSolvable *othersolvable(XSolvable *s) {
2390 Id op = transaction_obs_pkg($self, s->id);
2391 return new_XSolvable($self->pool, op);
2394 %newobject allothersolvables;
2395 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2396 Queue allothersolvables(XSolvable *s) {
2399 transaction_all_obs_pkgs($self, s->id, &q);
2403 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2404 %newobject classify;
2405 Queue classify(int mode = 0) {
2408 transaction_classify($self, mode, &q);
2412 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2413 %newobject newpackages;
2414 Queue newpackages() {
2418 cut = transaction_installedresult(self, &q);
2419 queue_truncate(&q, cut);
2423 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2424 %newobject keptpackages;
2425 Queue keptpackages() {
2429 cut = transaction_installedresult(self, &q);
2431 queue_deleten(&q, 0, cut);
2435 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2439 queue_init_clone(&q, &$self->steps);
2443 int steptype(XSolvable *s, int mode) {
2444 return transaction_type($self, s->id, mode);
2446 int calc_installsizechange() {
2447 return transaction_calc_installsizechange($self);
2449 void order(int flags) {
2450 transaction_order($self, flags);
2454 %extend TransactionClass {
2455 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2456 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2457 cl->transaction = trans;
2461 cl->fromid = fromid;
2465 %newobject solvables;
2466 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2470 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2476 XRule(Solver *solv, Id id) {
2479 XRule *xr = solv_calloc(1, sizeof(*xr));
2485 Id type, source, target, dep;
2486 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2487 return new_Ruleinfo($self, type, source, target, dep);
2489 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2490 %newobject allinfos;
2494 solver_allruleinfos($self->solv, $self->id, &q);
2498 bool __eq__(XRule *xr) {
2499 return $self->solv == xr->solv && $self->id == xr->id;
2501 bool __ne__(XRule *xr) {
2502 return !XRule___eq__($self, xr);
2504 %newobject __repr__;
2505 const char *__repr__() {
2507 sprintf(buf, "<Rule #%d>", $self->id);
2508 return solv_strdup(buf);
2513 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2514 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2518 ri->source = source;
2519 ri->target = target;
2523 XSolvable * const solvable;
2524 XSolvable * const othersolvable;
2526 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2527 return new_XSolvable(ri->solv->pool, ri->source);
2529 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2530 return new_XSolvable(ri->solv->pool, ri->target);
2533 const char *problemstr() {
2534 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2539 XRepodata(Repo *repo, Id id) {
2540 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2546 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2548 void set_id(Id solvid, Id keyname, Id id) {
2549 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2551 void set_str(Id solvid, Id keyname, const char *str) {
2552 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2554 void set_poolstr(Id solvid, Id keyname, const char *str) {
2555 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2557 void add_idarray(Id solvid, Id keyname, Id id) {
2558 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2560 void add_flexarray(Id solvid, Id keyname, Id handle) {
2561 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2563 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2564 const unsigned char *buf = solv_chksum_get(chksum, 0);
2566 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2568 const char *lookup_str(Id solvid, Id keyname) {
2569 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2571 Queue lookup_idarray(Id solvid, Id keyname) {
2574 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2577 %newobject lookup_checksum;
2578 Chksum *lookup_checksum(Id solvid, Id keyname) {
2580 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2581 return solv_chksum_create_from_bin(type, b);
2583 void internalize() {
2584 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2586 void create_stubs() {
2587 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2589 void write(FILE *fp) {
2590 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2592 bool add_solv(FILE *fp, int flags = 0) {
2593 Repodata *data = repo_id2repodata($self->repo, $self->id);
2594 int r, oldstate = data->state;
2595 data->state = REPODATA_LOADING;
2596 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2597 if (r || data->state == REPODATA_LOADING)
2598 data->state = oldstate;
2601 void extend_to_repo() {
2602 Repodata *data = repo_id2repodata($self->repo, $self->id);
2603 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2605 bool __eq__(XRepodata *xr) {
2606 return $self->repo == xr->repo && $self->id == xr->id;
2608 bool __ne__(XRepodata *xr) {
2609 return !XRepodata___eq__($self, xr);
2611 %newobject __repr__;
2612 const char *__repr__() {
2614 sprintf(buf, "<Repodata #%d>", $self->id);
2615 return solv_strdup(buf);