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;
724 Selection(Pool *pool) {
726 s = solv_calloc(1, sizeof(*s));
732 queue_free(&$self->q);
738 void make(const char *name, int flags) {
739 $self->flags = selection_make($self->pool, &$self->q, name, flags);
742 %rename("isempty?") isempty;
745 return $self->q.count == 0;
747 void limit(Selection *lsel) {
748 if ($self->pool != lsel->pool)
749 queue_empty(&$self->q);
751 selection_limit($self->pool, &$self->q, &lsel->q);
753 void add(Selection *lsel) {
754 if ($self->pool == lsel->pool)
756 selection_add($self->pool, &$self->q, &lsel->q);
757 $self->flags |= lsel->flags;
760 void addsimple(Id how, Id what) {
761 queue_push2(&$self->q, how, what);
763 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
765 Queue jobs(int flags) {
768 queue_init_clone(&q, &$self->q);
769 for (i = 0; i < q.count; i += 2)
770 q.elements[i] |= flags;
774 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
775 %newobject solvables;
779 selection_solvables($self->pool, &q, &$self->q);
783 #if defined(SWIGPERL)
784 %rename("str") __str__;
786 const char *__str__() {
788 char *s = pool_tmpjoin($self->pool, 0, 0, 0);
789 for (i = 0; i < $self->q.count; i += 2)
790 s = pool_tmpappend($self->pool, s, " | ", solver_select2str($self->pool, $self->q.elements[i] & SOLVER_SELECTMASK, $self->q.elements[i + 1]));
791 return *s ? s + 3 : s;
797 return (Chksum *)solv_chksum_create(type);
799 Chksum(Id type, const char *hex) {
800 unsigned char buf[64];
801 int l = solv_chksum_len(type);
804 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
806 return (Chksum *)solv_chksum_create_from_bin(type, buf);
809 solv_chksum_free($self, 0);
813 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
814 return solv_chksum_get_type(chksum);
817 void add(const char *str) {
818 solv_chksum_add($self, str, strlen((char *)str));
820 void add_fp(FILE *fp) {
823 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
824 solv_chksum_add($self, buf, l);
825 rewind(fp); /* convenience */
827 void add_fd(int fd) {
830 while ((l = read(fd, buf, sizeof(buf))) > 0)
831 solv_chksum_add($self, buf, l);
832 lseek(fd, 0, 0); /* convenience */
834 void add_stat(const char *filename) {
836 if (stat(filename, &stb))
837 memset(&stb, 0, sizeof(stb));
838 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
839 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
840 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
841 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
845 const unsigned char *b;
846 b = solv_chksum_get($self, &l);
847 return cdata_void((void *)b, l);
852 const unsigned char *b;
855 b = solv_chksum_get($self, &l);
856 ret = solv_malloc(2 * l + 1);
857 solv_bin2hex(b, l, ret);
861 bool __eq__(Chksum *chk) {
863 const unsigned char *b, *bo;
866 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
868 b = solv_chksum_get($self, &l);
869 bo = solv_chksum_get(chk, 0);
870 return memcmp(b, bo, l) == 0;
872 bool __ne__(Chksum *chk) {
873 return !Chksum___eq__($self, chk);
875 #if defined(SWIGRUBY)
876 %rename("to_s") __str__;
877 %rename("inspect") __repr__;
879 #if defined(SWIGPERL)
880 %rename("str") __str__;
883 const char *__str__() {
886 if (solv_chksum_isfinished($self))
887 h = Chksum_hex($self);
888 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
889 solv_free((void *)h);
893 const char *__repr__() {
894 const char *h = Chksum___str__($self);
895 const char *str = solv_dupjoin("<Chksum ", h, ">");
896 solv_free((void *)h);
903 Pool *pool = pool_create();
908 void set_debuglevel(int level) {
909 pool_setdebuglevel($self, level);
911 int set_flag(int flag, int value) {
912 return pool_set_flag($self, flag, value);
914 int get_flag(int flag) {
915 return pool_get_flag($self, flag);
917 void set_rootdir(const char *rootdir) {
918 pool_set_rootdir($self, rootdir);
920 const char *get_rootdir(int flag) {
921 return pool_get_rootdir($self);
923 #if defined(SWIGPYTHON)
925 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
926 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
927 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
928 PyObject *result = PyEval_CallObject((PyObject *)d, args);
933 return 0; /* exception */
934 ecode = SWIG_AsVal_int(result, &vresult);
936 return SWIG_IsOK(ecode) ? vresult : 0;
939 void set_loadcallback(PyObject *callable) {
940 if ($self->loadcallback == loadcallback) {
941 PyObject *obj = $self->loadcallbackdata;
947 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
950 #if defined(SWIGPERL)
952 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
956 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
961 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
963 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
973 void set_loadcallback(SV *callable) {
974 if ($self->loadcallback == loadcallback)
975 SvREFCNT_dec($self->loadcallbackdata);
977 SvREFCNT_inc(callable);
978 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
982 #if defined(SWIGRUBY)
984 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
985 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
986 VALUE callable = (VALUE)d;
987 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
988 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
991 SWIGINTERN void mark_Pool(void *ptr) {
993 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
994 VALUE callable = (VALUE)pool->loadcallbackdata;
995 rb_gc_mark(callable);
999 %typemap(in, numinputs=0) VALUE callable {
1000 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1002 void set_loadcallback(VALUE callable) {
1003 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1008 Pool_set_loadcallback($self, 0);
1011 Id str2id(const char *str, bool create=1) {
1012 return pool_str2id($self, str, create);
1014 Dep *Dep(const char *str, bool create=1) {
1015 Id id = pool_str2id($self, str, create);
1016 return new_Dep($self, id);
1018 const char *id2str(Id id) {
1019 return pool_id2str($self, id);
1021 const char *dep2str(Id id) {
1022 return pool_dep2str($self, id);
1024 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1025 return pool_rel2id($self, name, evr, flags, create);
1027 Id id2langid(Id id, const char *lang, bool create=1) {
1028 return pool_id2langid($self, id, lang, create);
1030 void setarch(const char *arch) {
1031 pool_setarch($self, arch);
1033 Repo *add_repo(const char *name) {
1034 return repo_create($self, name);
1036 const char *lookup_str(Id entry, Id keyname) {
1037 return pool_lookup_str($self, entry, keyname);
1039 Id lookup_id(Id entry, Id keyname) {
1040 return pool_lookup_id($self, entry, keyname);
1042 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1043 return pool_lookup_num($self, entry, keyname, notfound);
1045 bool lookup_void(Id entry, Id keyname) {
1046 return pool_lookup_void($self, entry, keyname);
1048 %newobject lookup_checksum;
1049 Chksum *lookup_checksum(Id entry, Id keyname) {
1051 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1052 return solv_chksum_create_from_bin(type, b);
1055 %newobject Dataiterator;
1056 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1057 return new_Dataiterator($self, 0, p, key, match, flags);
1059 const char *solvid2str(Id solvid) {
1060 return pool_solvid2str($self, solvid);
1062 void addfileprovides() {
1063 pool_addfileprovides($self);
1065 Queue addfileprovides_queue() {
1068 pool_addfileprovides_queue($self, &r, 0);
1071 void createwhatprovides() {
1072 pool_createwhatprovides($self);
1075 XSolvable *id2solvable(Id id) {
1076 return new_XSolvable($self, id);
1078 %newobject solvables;
1079 Pool_solvable_iterator * const solvables;
1081 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1082 return new_Pool_solvable_iterator(pool);
1085 %newobject solvables_iter;
1086 Pool_solvable_iterator * solvables_iter() {
1087 return new_Pool_solvable_iterator($self);
1090 Repo *id2repo(Id id) {
1091 if (id < 1 || id >= $self->nrepos)
1093 return pool_id2repo($self, id);
1096 Pool_repo_iterator * const repos;
1098 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1099 return new_Pool_repo_iterator(pool);
1102 %newobject repos_iter;
1103 Pool_repo_iterator * repos_iter() {
1104 return new_Pool_repo_iterator($self);
1109 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1110 pool_set_installed(pool, installed);
1112 Repo *Pool_installed_get(Pool *pool) {
1113 return pool->installed;
1117 Queue matchprovidingids(const char *match, int flags) {
1123 for (id = 1; id < pool->ss.nstrings; id++)
1124 if (pool->whatprovides[id])
1128 if (!datamatcher_init(&ma, match, flags)) {
1129 for (id = 1; id < pool->ss.nstrings; id++)
1130 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1132 datamatcher_free(&ma);
1138 Job *Job(int how, Id what) {
1139 return new_Job($self, how, what);
1142 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1143 %newobject whatprovides;
1144 Queue whatprovides(Id dep) {
1149 FOR_PROVIDES(p, pp, dep)
1154 Id towhatprovides(Queue q) {
1155 return pool_queuetowhatprovides($self, &q);
1159 %rename("isknownarch?") isknownarch;
1161 bool isknownarch(Id id) {
1163 if (!id || id == ID_EMPTY)
1165 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1167 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1174 return solver_create($self);
1177 %newobject Selection;
1178 Selection *Selection() {
1179 return new_Selection($self);
1182 Selection *select(const char *name, int flags) {
1183 Selection *sel = new_Selection($self);
1184 sel->flags = selection_make($self, &sel->q, name, flags);
1190 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1191 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1192 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1193 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1194 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1195 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1196 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1197 #ifdef ENABLE_SUSEREPO
1198 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1201 void free(bool reuseids = 0) {
1202 repo_free($self, reuseids);
1204 void empty(bool reuseids = 0) {
1205 repo_empty($self, reuseids);
1208 %rename("isempty?") isempty;
1211 return !$self->nsolvables;
1213 bool add_solv(const char *name, int flags = 0) {
1214 FILE *fp = fopen(name, "r");
1218 r = repo_add_solv($self, fp, flags);
1222 bool add_solv(FILE *fp, int flags = 0) {
1223 return repo_add_solv($self, fp, flags) == 0;
1226 XSolvable *add_solvable() {
1227 Id solvid = repo_add_solvable($self);
1228 return new_XSolvable($self->pool, solvid);
1232 bool add_rpmdb(Repo *ref, int flags = 0) {
1233 return repo_add_rpmdb($self, ref, flags);
1235 Id add_rpm(const char *name, int flags = 0) {
1236 return repo_add_rpm($self, name, flags);
1240 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1241 return repo_add_rpmmd($self, fp, language, flags);
1243 bool add_repomdxml(FILE *fp, int flags = 0) {
1244 return repo_add_repomdxml($self, fp, flags);
1246 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1247 return repo_add_updateinfoxml($self, fp, flags);
1249 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1250 return repo_add_deltainfoxml($self, fp, flags);
1253 #ifdef ENABLE_DEBIAN
1254 bool add_debdb(int flags = 0) {
1255 return repo_add_debdb($self, flags);
1257 Id add_deb(const char *name, int flags = 0) {
1258 return repo_add_deb($self, name, flags);
1261 #ifdef ENABLE_SUSEREPO
1262 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1263 return repo_add_susetags($self, fp, defvendor, language, flags);
1265 bool add_content(FILE *fp, int flags = 0) {
1266 return repo_add_content($self, fp, flags);
1268 bool add_products(const char *proddir, int flags = 0) {
1269 return repo_add_products($self, proddir, flags);
1272 #ifdef ENABLE_MDKREPO
1273 bool add_mdk(FILE *fp, int flags = 0) {
1274 return repo_add_mdk($self, fp, flags);
1276 bool add_mdk_info(FILE *fp, int flags = 0) {
1277 return repo_add_mdk($self, fp, flags);
1280 #ifdef ENABLE_ARCHREPO
1281 bool add_arch_repo(FILE *fp, int flags = 0) {
1282 return repo_add_arch_repo($self, fp, flags);
1284 Id add_arch_pkg(const char *name, int flags = 0) {
1285 return repo_add_arch_pkg($self, name, flags);
1288 void internalize() {
1289 repo_internalize($self);
1291 const char *lookup_str(Id entry, Id keyname) {
1292 return repo_lookup_str($self, entry, keyname);
1294 Id lookup_id(Id entry, Id keyname) {
1295 return repo_lookup_id($self, entry, keyname);
1297 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1298 return repo_lookup_num($self, entry, keyname, notfound);
1300 void write(FILE *fp) {
1301 repo_write($self, fp);
1303 # HACK, remove if no longer needed!
1304 bool write_first_repodata(FILE *fp) {
1305 int oldnrepodata = $self->nrepodata;
1306 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1307 repo_write($self, fp);
1308 $self->nrepodata = oldnrepodata;
1312 %newobject Dataiterator;
1313 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1314 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1319 SWIGINTERN Id Repo_id_get(Repo *repo) {
1320 return repo->repoid;
1323 Repo_solvable_iterator * const solvables;
1325 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1326 return new_Repo_solvable_iterator(repo);
1329 %newobject solvables_iter;
1330 Repo_solvable_iterator *solvables_iter() {
1331 return new_Repo_solvable_iterator($self);
1334 XRepodata *add_repodata(int flags = 0) {
1335 Repodata *rd = repo_add_repodata($self, flags);
1336 return new_XRepodata($self, rd->repodataid);
1339 void create_stubs() {
1341 if (!$self->nrepodata)
1343 data = repo_id2repodata($self, $self->nrepodata - 1);
1344 if (data->state != REPODATA_STUB)
1345 repodata_create_stubs(data);
1348 %rename("iscontiguous?") iscontiguous;
1350 bool iscontiguous() {
1352 for (i = $self->start; i < $self->end; i++)
1353 if ($self->pool->solvables[i].repo != $self)
1357 XRepodata *first_repodata() {
1360 if ($self->nrepodata < 2)
1362 /* make sure all repodatas but the first are extensions */
1363 data = repo_id2repodata($self, 1);
1364 if (data->loadcallback)
1366 for (i = 2; i < $self->nrepodata; i++)
1368 data = repo_id2repodata($self, i);
1369 if (!data->loadcallback)
1370 return 0; /* oops, not an extension */
1372 return new_XRepodata($self, 1);
1375 bool __eq__(Repo *repo) {
1376 return $self == repo;
1378 bool __ne__(Repo *repo) {
1379 return $self != repo;
1381 #if defined(SWIGPERL)
1382 %rename("str") __str__;
1385 const char *__str__() {
1388 return solv_strdup($self->name);
1389 sprintf(buf, "Repo#%d", $self->repoid);
1390 return solv_strdup(buf);
1392 %newobject __repr__;
1393 const char *__repr__() {
1397 sprintf(buf, "<Repo #%d ", $self->repoid);
1398 return solv_dupjoin(buf, $self->name, ">");
1400 sprintf(buf, "<Repo #%d>", $self->repoid);
1401 return solv_strdup(buf);
1405 %extend Dataiterator {
1406 static const int SEARCH_STRING = SEARCH_STRING;
1407 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1408 static const int SEARCH_GLOB = SEARCH_GLOB;
1409 static const int SEARCH_REGEX = SEARCH_REGEX;
1410 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1411 static const int SEARCH_FILES = SEARCH_FILES;
1412 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1414 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1415 Dataiterator *di = solv_calloc(1, sizeof(*di));
1416 dataiterator_init(di, pool, repo, p, key, match, flags);
1420 dataiterator_free($self);
1423 #if defined(SWIGPYTHON)
1424 %newobject __iter__;
1425 Dataiterator *__iter__() {
1427 ndi = solv_calloc(1, sizeof(*ndi));
1428 dataiterator_init_clone(ndi, $self);
1431 %rename("next") __next__();
1432 %exception __next__ {
1435 PyErr_SetString(PyExc_StopIteration,"no more matches");
1442 perliter(solv::Dataiterator)
1445 %newobject __next__;
1446 Datamatch *__next__() {
1448 if (!dataiterator_step($self)) {
1451 ndi = solv_calloc(1, sizeof(*ndi));
1452 dataiterator_init_clone(ndi, $self);
1458 while ((d = Dataiterator___next__($self)) != 0) {
1459 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1463 void prepend_keyname(Id key) {
1464 dataiterator_prepend_keyname($self, key);
1466 void skip_solvable() {
1467 dataiterator_skip_solvable($self);
1472 Id lookup_id(Id keyname) {
1473 Pool *pool = $self->repo->pool;
1474 Datapos oldpos = pool->pos;
1477 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1481 const char *lookup_str(Id keyname) {
1482 Pool *pool = $self->repo->pool;
1483 Datapos oldpos = pool->pos;
1486 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1490 %newobject lookup_checksum;
1491 Chksum *lookup_checksum(Id keyname) {
1492 Pool *pool = $self->repo->pool;
1493 Datapos oldpos = pool->pos;
1495 const unsigned char *b;
1497 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1499 return solv_chksum_create_from_bin(type, b);
1505 dataiterator_free($self);
1508 %newobject solvable;
1509 XSolvable * const solvable;
1511 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1512 return new_XSolvable(di->pool, di->solvid);
1516 return $self->key->name;
1518 const char *key_idstr() {
1519 return pool_id2str($self->pool, $self->key->name);
1522 return $self->key->type;
1524 const char *type_idstr() {
1525 return pool_id2str($self->pool, $self->key->type);
1528 return $self->kv.id;
1530 const char *idstr() {
1531 return pool_id2str($self->pool, $self->kv.id);
1534 return $self->kv.str;
1537 return $self->kv.num;
1540 return $self->kv.num2;
1544 Pool *pool = $self->pool;
1545 Datapos *pos, oldpos = pool->pos;
1546 dataiterator_setpos($self);
1547 pos = solv_calloc(1, sizeof(*pos));
1552 %newobject parentpos;
1553 Datapos *parentpos() {
1554 Pool *pool = $self->pool;
1555 Datapos *pos, oldpos = pool->pos;
1556 dataiterator_setpos_parent($self);
1557 pos = solv_calloc(1, sizeof(*pos));
1563 dataiterator_setpos($self);
1565 void setpos_parent() {
1566 dataiterator_setpos_parent($self);
1570 %extend Pool_solvable_iterator {
1571 Pool_solvable_iterator(Pool *pool) {
1572 Pool_solvable_iterator *s;
1573 s = solv_calloc(1, sizeof(*s));
1577 #if defined(SWIGPYTHON)
1578 %newobject __iter__;
1579 Pool_solvable_iterator *__iter__() {
1580 Pool_solvable_iterator *s;
1581 s = solv_calloc(1, sizeof(*s));
1585 %rename("next") __next__();
1586 %exception __next__ {
1589 PyErr_SetString(PyExc_StopIteration,"no more matches");
1596 perliter(solv::Pool_solvable_iterator)
1598 %newobject __next__;
1599 XSolvable *__next__() {
1600 Pool *pool = $self->pool;
1601 if ($self->id >= pool->nsolvables)
1603 while (++$self->id < pool->nsolvables)
1604 if (pool->solvables[$self->id].repo)
1605 return new_XSolvable(pool, $self->id);
1611 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1612 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1616 %newobject __getitem__;
1617 XSolvable *__getitem__(Id key) {
1618 Pool *pool = $self->pool;
1619 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1620 return new_XSolvable(pool, key);
1624 return $self->pool->nsolvables;
1628 %extend Pool_repo_iterator {
1629 Pool_repo_iterator(Pool *pool) {
1630 Pool_repo_iterator *s;
1631 s = solv_calloc(1, sizeof(*s));
1635 #if defined(SWIGPYTHON)
1636 %newobject __iter__;
1637 Pool_repo_iterator *__iter__() {
1638 Pool_repo_iterator *s;
1639 s = solv_calloc(1, sizeof(*s));
1643 %rename("next") __next__();
1644 %exception __next__ {
1647 PyErr_SetString(PyExc_StopIteration,"no more matches");
1652 %newobject __next__;
1654 Pool *pool = $self->pool;
1655 if ($self->id >= pool->nrepos)
1657 while (++$self->id < pool->nrepos) {
1658 Repo *r = pool_id2repo(pool, $self->id);
1667 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1668 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1672 Repo *__getitem__(Id key) {
1673 Pool *pool = $self->pool;
1674 if (key > 0 && key < pool->nrepos)
1675 return pool_id2repo(pool, key);
1679 return $self->pool->nrepos;
1683 %extend Repo_solvable_iterator {
1684 Repo_solvable_iterator(Repo *repo) {
1685 Repo_solvable_iterator *s;
1686 s = solv_calloc(1, sizeof(*s));
1690 #if defined(SWIGPYTHON)
1691 %newobject __iter__;
1692 Repo_solvable_iterator *__iter__() {
1693 Repo_solvable_iterator *s;
1694 s = solv_calloc(1, sizeof(*s));
1698 %rename("next") __next__();
1699 %exception __next__ {
1702 PyErr_SetString(PyExc_StopIteration,"no more matches");
1707 %newobject __next__;
1708 XSolvable *__next__() {
1709 Repo *repo = $self->repo;
1710 Pool *pool = repo->pool;
1711 if (repo->start > 0 && $self->id < repo->start)
1712 $self->id = repo->start - 1;
1713 if ($self->id >= repo->end)
1715 while (++$self->id < repo->end)
1716 if (pool->solvables[$self->id].repo == repo)
1717 return new_XSolvable(pool, $self->id);
1723 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1724 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1728 %newobject __getitem__;
1729 XSolvable *__getitem__(Id key) {
1730 Repo *repo = $self->repo;
1731 Pool *pool = repo->pool;
1732 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1733 return new_XSolvable(pool, key);
1737 return $self->repo->pool->nsolvables;
1742 Dep(Pool *pool, Id id) {
1746 s = solv_calloc(1, sizeof(*s));
1752 return pool_dep2str($self->pool, $self->id);
1754 bool __eq__(Dep *s) {
1755 return $self->pool == s->pool && $self->id == s->id;
1757 bool __ne__(Dep *s) {
1758 return !Dep___eq__($self, s);
1760 #if defined(SWIGPERL)
1761 %rename("str") __str__;
1763 const char *__str__() {
1764 return pool_dep2str($self->pool, $self->id);
1766 %newobject __repr__;
1767 const char *__repr__() {
1769 sprintf(buf, "<Id #%d ", $self->id);
1770 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1775 XSolvable(Pool *pool, Id id) {
1777 if (!id || id >= pool->nsolvables)
1779 s = solv_calloc(1, sizeof(*s));
1785 return pool_solvid2str($self->pool, $self->id);
1787 const char *lookup_str(Id keyname) {
1788 return pool_lookup_str($self->pool, $self->id, keyname);
1790 Id lookup_id(Id keyname) {
1791 return pool_lookup_id($self->pool, $self->id, keyname);
1793 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1794 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1796 bool lookup_void(Id keyname) {
1797 return pool_lookup_void($self->pool, $self->id, keyname);
1799 %newobject lookup_checksum;
1800 Chksum *lookup_checksum(Id keyname) {
1802 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1803 return solv_chksum_create_from_bin(type, b);
1805 Queue lookup_idarray(Id keyname, Id marker = 1) {
1806 Solvable *s = $self->pool->solvables + $self->id;
1810 if (keyname == SOLVABLE_PROVIDES)
1811 marker = -SOLVABLE_FILEMARKER;
1812 else if (keyname == SOLVABLE_REQUIRES)
1813 marker = -SOLVABLE_PREREQMARKER;
1817 solvable_lookup_deparray(s, keyname, &r, marker);
1820 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1821 %newobject lookup_deparray;
1822 Queue lookup_deparray(Id keyname, Id marker = 1) {
1823 Solvable *s = $self->pool->solvables + $self->id;
1827 if (keyname == SOLVABLE_PROVIDES)
1828 marker = -SOLVABLE_FILEMARKER;
1829 else if (keyname == SOLVABLE_REQUIRES)
1830 marker = -SOLVABLE_PREREQMARKER;
1834 solvable_lookup_deparray(s, keyname, &r, marker);
1837 const char *lookup_location(unsigned int *OUTPUT) {
1838 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1841 %rename("installable?") installable;
1843 bool installable() {
1844 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1847 %rename("isinstalled?") isinstalled;
1849 bool isinstalled() {
1850 Pool *pool = $self->pool;
1851 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1856 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1857 Pool *pool = xs->pool;
1858 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1860 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1861 Pool *pool = xs->pool;
1862 return pool_id2str(pool, pool->solvables[xs->id].name);
1867 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1868 xs->pool->solvables[xs->id].name = nameid;
1870 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1871 return xs->pool->solvables[xs->id].name;
1876 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1877 Pool *pool = xs->pool;
1878 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1880 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1881 Pool *pool = xs->pool;
1882 return pool_id2str(pool, pool->solvables[xs->id].evr);
1887 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1888 xs->pool->solvables[xs->id].evr = evrid;
1890 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1891 return xs->pool->solvables[xs->id].evr;
1896 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1897 Pool *pool = xs->pool;
1898 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1900 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1901 Pool *pool = xs->pool;
1902 return pool_id2str(pool, pool->solvables[xs->id].arch);
1907 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1908 xs->pool->solvables[xs->id].arch = archid;
1910 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1911 return xs->pool->solvables[xs->id].arch;
1916 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1917 Pool *pool = xs->pool;
1918 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1920 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1921 Pool *pool = xs->pool;
1922 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1927 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1928 xs->pool->solvables[xs->id].vendor = vendorid;
1930 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1931 return xs->pool->solvables[xs->id].vendor;
1936 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1937 return xs->pool->solvables[xs->id].repo;
1941 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1942 Solvable *s = $self->pool->solvables + $self->id;
1943 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1945 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1946 Solvable *s = $self->pool->solvables + $self->id;
1947 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1949 void add_obsoletes(Dep *dep) {
1950 Solvable *s = $self->pool->solvables + $self->id;
1951 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1953 void add_obsoletesid(Id id) {
1954 Solvable *s = $self->pool->solvables + $self->id;
1955 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1957 void add_conflicts(Dep *dep) {
1958 Solvable *s = $self->pool->solvables + $self->id;
1959 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1961 void add_conflictsid(Id id) {
1962 Solvable *s = $self->pool->solvables + $self->id;
1963 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1965 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1966 Solvable *s = $self->pool->solvables + $self->id;
1967 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1969 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1970 Solvable *s = $self->pool->solvables + $self->id;
1971 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1973 void add_recommends(Dep *dep) {
1974 Solvable *s = $self->pool->solvables + $self->id;
1975 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1977 void add_recommendsid(Id id) {
1978 Solvable *s = $self->pool->solvables + $self->id;
1979 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1981 void add_suggests(Dep *dep) {
1982 Solvable *s = $self->pool->solvables + $self->id;
1983 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1985 void add_suggestsid(Id id) {
1986 Solvable *s = $self->pool->solvables + $self->id;
1987 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1989 void add_supplements(Dep *dep) {
1990 Solvable *s = $self->pool->solvables + $self->id;
1991 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1993 void add_supplementsid(Id id) {
1994 Solvable *s = $self->pool->solvables + $self->id;
1995 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1997 void add_enhances(Dep *dep) {
1998 Solvable *s = $self->pool->solvables + $self->id;
1999 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
2001 void add_enhancesid(Id id) {
2002 Solvable *s = $self->pool->solvables + $self->id;
2003 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2006 bool __eq__(XSolvable *s) {
2007 return $self->pool == s->pool && $self->id == s->id;
2009 bool __ne__(XSolvable *s) {
2010 return !XSolvable___eq__($self, s);
2012 #if defined(SWIGPERL)
2013 %rename("str") __str__;
2015 const char *__str__() {
2016 return pool_solvid2str($self->pool, $self->id);
2018 %newobject __repr__;
2019 const char *__repr__() {
2021 sprintf(buf, "<Solvable #%d ", $self->id);
2022 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2027 Problem(Solver *solv, Id id) {
2029 p = solv_calloc(1, sizeof(*p));
2034 %newobject findproblemrule;
2035 XRule *findproblemrule() {
2036 Id r = solver_findproblemrule($self->solv, $self->id);
2037 return new_XRule($self->solv, r);
2039 %newobject findallproblemrules;
2040 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2041 Queue findallproblemrules(int unfiltered=0) {
2042 Solver *solv = $self->solv;
2047 solver_findallproblemrules(solv, $self->id, &q);
2050 for (i = j = 0; i < q.count; i++)
2052 SolverRuleinfo rclass;
2053 probr = q.elements[i];
2054 rclass = solver_ruleclass(solv, probr);
2055 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2057 q.elements[j++] = probr;
2060 queue_truncate(&q, j);
2064 int solution_count() {
2065 return solver_solution_count($self->solv, $self->id);
2067 %newobject solutions;
2068 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2073 cnt = solver_solution_count($self->solv, $self->id);
2074 for (i = 1; i <= cnt; i++)
2081 Solution(Problem *p, Id id) {
2083 s = solv_calloc(1, sizeof(*s));
2085 s->problemid = p->id;
2089 int element_count() {
2090 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2093 %newobject elements;
2094 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2095 Queue elements(bool expandreplaces=0) {
2099 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2100 for (i = 1; i <= cnt; i++)
2103 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2105 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2111 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2112 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2114 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2115 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2116 queue_push2(&q, p, rp);
2118 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2119 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2120 queue_push2(&q, p, rp);
2122 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2123 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2124 queue_push2(&q, p, rp);
2129 queue_push2(&q, i, type);
2130 queue_push2(&q, p, rp);
2136 %extend Solutionelement {
2137 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2139 e = solv_calloc(1, sizeof(*e));
2141 e->problemid = problemid;
2152 if (p == SOLVER_SOLUTION_ERASE)
2157 else if (p == SOLVER_SOLUTION_REPLACE)
2162 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2163 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);
2164 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2165 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);
2166 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2167 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);
2168 return solver_solutionelement2str($self->solv, p, rp);
2170 %newobject replaceelements;
2171 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2172 Queue replaceelements() {
2177 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2180 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2181 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2182 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2183 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2184 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2185 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2186 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2188 queue_push(&q, $self->type);
2191 int illegalreplace() {
2192 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2194 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2196 %newobject solvable;
2197 XSolvable * const solvable;
2198 %newobject replacement;
2199 XSolvable * const replacement;
2202 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2203 return new_XSolvable(e->solv->pool, e->p);
2205 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2206 return new_XSolvable(e->solv->pool, e->rp);
2208 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2209 if (e->type != SOLVER_SOLUTION_JOB)
2211 return (e->p - 1) / 2;
2216 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2217 if ($self->type == SOLVER_SOLUTION_JOB)
2218 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2219 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2220 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2221 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2222 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2223 if ($self->type == SOLVER_SOLUTION_ERASE)
2224 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2230 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2231 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2232 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2233 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2234 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2235 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2236 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2237 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2238 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2239 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2240 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2241 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2242 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2243 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2244 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2245 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2246 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2247 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2248 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2250 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2251 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2252 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2253 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2254 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2255 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2256 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2257 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2259 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2260 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2261 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2263 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2264 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2265 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2266 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2267 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2268 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2269 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2270 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2271 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2277 int set_flag(int flag, int value) {
2278 return solver_set_flag($self, flag, value);
2280 int get_flag(int flag) {
2281 return solver_get_flag($self, flag);
2283 #if defined(SWIGPYTHON)
2285 def solve(self, jobs):
2287 for job in jobs: j += [job.how, job.what]
2288 return self.solve_helper(j)
2291 #if defined(SWIGPERL)
2293 sub solv::Solver::solve {
2294 my ($self, $jobs) = @_;
2295 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2296 return $self->solve_helper(\@j);
2300 #if defined(SWIGRUBY)
2303 "class Solv::Solver\n"
2304 " def solve(jobs)\n"
2306 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2307 " solve_helper(jl)\n"
2313 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2314 %newobject solve_helper;
2315 Queue solve_helper(Queue jobs) {
2319 solver_solve($self, &jobs);
2320 cnt = solver_problem_count($self);
2321 for (i = 1; i <= cnt; i++)
2325 %newobject transaction;
2326 Transaction *transaction() {
2327 return solver_create_transaction($self);
2331 %extend Transaction {
2332 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2333 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2334 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2335 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2336 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2337 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2338 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2339 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2340 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2341 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2342 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2343 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2344 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2345 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2346 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2347 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2348 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2349 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2350 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2351 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2352 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2353 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2354 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2355 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2356 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2357 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2358 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2360 transaction_free($self);
2363 %rename("isempty?") isempty;
2366 return $self->steps.count == 0;
2369 %newobject othersolvable;
2370 XSolvable *othersolvable(XSolvable *s) {
2371 Id op = transaction_obs_pkg($self, s->id);
2372 return new_XSolvable($self->pool, op);
2375 %newobject allothersolvables;
2376 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2377 Queue allothersolvables(XSolvable *s) {
2380 transaction_all_obs_pkgs($self, s->id, &q);
2384 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2385 %newobject classify;
2386 Queue classify(int mode = 0) {
2389 transaction_classify($self, mode, &q);
2393 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2394 %newobject newpackages;
2395 Queue newpackages() {
2399 cut = transaction_installedresult(self, &q);
2400 queue_truncate(&q, cut);
2404 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2405 %newobject keptpackages;
2406 Queue keptpackages() {
2410 cut = transaction_installedresult(self, &q);
2412 queue_deleten(&q, 0, cut);
2416 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2420 queue_init_clone(&q, &$self->steps);
2424 int steptype(XSolvable *s, int mode) {
2425 return transaction_type($self, s->id, mode);
2427 int calc_installsizechange() {
2428 return transaction_calc_installsizechange($self);
2430 void order(int flags) {
2431 transaction_order($self, flags);
2435 %extend TransactionClass {
2436 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2437 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2438 cl->transaction = trans;
2442 cl->fromid = fromid;
2446 %newobject solvables;
2447 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2451 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2457 XRule(Solver *solv, Id id) {
2460 XRule *xr = solv_calloc(1, sizeof(*xr));
2466 Id type, source, target, dep;
2467 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2468 return new_Ruleinfo($self, type, source, target, dep);
2470 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2471 %newobject allinfos;
2475 solver_allruleinfos($self->solv, $self->id, &q);
2479 bool __eq__(XRule *xr) {
2480 return $self->solv == xr->solv && $self->id == xr->id;
2482 bool __ne__(XRule *xr) {
2483 return !XRule___eq__($self, xr);
2485 %newobject __repr__;
2486 const char *__repr__() {
2488 sprintf(buf, "<Rule #%d>", $self->id);
2489 return solv_strdup(buf);
2494 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2495 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2499 ri->source = source;
2500 ri->target = target;
2504 XSolvable * const solvable;
2505 XSolvable * const othersolvable;
2507 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2508 return new_XSolvable(ri->solv->pool, ri->source);
2510 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2511 return new_XSolvable(ri->solv->pool, ri->target);
2514 const char *problemstr() {
2515 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2520 XRepodata(Repo *repo, Id id) {
2521 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2527 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2529 void set_id(Id solvid, Id keyname, Id id) {
2530 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2532 void set_str(Id solvid, Id keyname, const char *str) {
2533 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2535 void set_poolstr(Id solvid, Id keyname, const char *str) {
2536 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2538 void add_idarray(Id solvid, Id keyname, Id id) {
2539 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2541 void add_flexarray(Id solvid, Id keyname, Id handle) {
2542 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2544 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2545 const unsigned char *buf = solv_chksum_get(chksum, 0);
2547 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2549 const char *lookup_str(Id solvid, Id keyname) {
2550 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2552 Queue lookup_idarray(Id solvid, Id keyname) {
2555 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2558 %newobject lookup_checksum;
2559 Chksum *lookup_checksum(Id solvid, Id keyname) {
2561 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2562 return solv_chksum_create_from_bin(type, b);
2564 void internalize() {
2565 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2567 void create_stubs() {
2568 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2570 void write(FILE *fp) {
2571 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2573 bool add_solv(FILE *fp, int flags = 0) {
2574 Repodata *data = repo_id2repodata($self->repo, $self->id);
2575 int r, oldstate = data->state;
2576 data->state = REPODATA_LOADING;
2577 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2578 if (r || data->state == REPODATA_LOADING)
2579 data->state = oldstate;
2582 void extend_to_repo() {
2583 Repodata *data = repo_id2repodata($self->repo, $self->id);
2584 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2586 bool __eq__(XRepodata *xr) {
2587 return $self->repo == xr->repo && $self->id == xr->id;
2589 bool __ne__(XRepodata *xr) {
2590 return !XRepodata___eq__($self, xr);
2592 %newobject __repr__;
2593 const char *__repr__() {
2595 sprintf(buf, "<Repodata #%d>", $self->id);
2596 return solv_strdup(buf);