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($input)->len;
148 o = RARRAY($input)->ptr;
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"
335 #include <sys/stat.h>
336 #include <sys/types.h>
340 #include "poolarch.h"
343 #include "solverdebug.h"
344 #include "repo_solv.h"
347 #include "repo_write.h"
349 #include "repo_rpmdb.h"
352 #include "repo_deb.h"
355 #include "repo_rpmmd.h"
356 #include "repo_updateinfoxml.h"
357 #include "repo_deltainfoxml.h"
358 #include "repo_repomdxml.h"
360 #ifdef ENABLE_SUSEREPO
361 #include "repo_products.h"
362 #include "repo_susetags.h"
363 #include "repo_content.h"
365 #ifdef ENABLE_MDKREPO
366 #include "repo_mdk.h"
368 #ifdef ENABLE_ARCHREPO
369 #include "repo_arch.h"
371 #include "solv_xfopen.h"
376 #define SOLVER_SOLUTION_ERASE -100
377 #define SOLVER_SOLUTION_REPLACE -101
378 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
379 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
380 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
382 typedef struct chksum Chksum;
384 typedef void *AppObjectPtr;
409 } Pool_solvable_iterator;
414 } Pool_repo_iterator;
419 } Repo_solvable_iterator;
459 Transaction *transaction;
467 typedef Dataiterator Datamatch;
472 %mixin Dataiterator "Enumerable";
473 %mixin Pool_solvable_iterator "Enumerable";
474 %mixin Pool_repo_iterator "Enumerable";
475 %mixin Repo_solvable_iterator "Enumerable";
483 %constant Id SOLVID_META;
484 %constant Id SOLVID_POS;
486 %constant int REL_EQ;
487 %constant int REL_GT;
488 %constant int REL_LT;
489 %constant int REL_ARCH;
517 # put before pool/repo so we can access the constructor
518 %nodefaultdtor Dataiterator;
519 typedef struct {} Dataiterator;
520 typedef struct {} Pool_solvable_iterator;
521 typedef struct {} Pool_repo_iterator;
522 typedef struct {} Repo_solvable_iterator;
524 %nodefaultctor Datamatch;
525 %nodefaultdtor Datamatch;
532 %nodefaultctor Datapos;
546 AppObjectPtr appdata;
553 const char * const name;
556 int const nsolvables;
557 AppObjectPtr appdata;
560 %nodefaultctor Solver;
561 %nodefaultdtor Solver;
569 %rename(xfopen) solv_xfopen;
570 %rename(xfopen_fd) solv_xfopen_fd;
571 %rename(xfopen_dup) solv_xfopen_dup;
572 %rename(xfclose) solv_xfclose;
573 %rename(xfileno) solv_xfileno;
575 FILE *solv_xfopen(const char *fn, const char *mode = 0);
576 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
577 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
578 int solv_xfclose(FILE *fp);
579 int solv_xfileno(FILE *fp);
582 SWIGINTERN int solv_xfclose(FILE *fp) {
585 SWIGINTERN int solv_xfileno(FILE *fp) {
588 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
590 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
613 %nodefaultctor Transaction;
614 %nodefaultdtor Transaction;
620 Transaction * const transaction;
629 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
630 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
631 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
632 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
633 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
634 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
635 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
636 static const Id SOLVER_NOOP = SOLVER_NOOP;
637 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
638 static const Id SOLVER_ERASE = SOLVER_ERASE;
639 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
640 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
641 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
642 static const Id SOLVER_LOCK = SOLVER_LOCK;
643 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
644 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
645 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
646 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
647 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
648 static const Id SOLVER_WEAK = SOLVER_WEAK;
649 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
650 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
651 static const Id SOLVER_SETEV = SOLVER_SETEV;
652 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
653 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
654 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
655 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
656 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
657 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
659 Job(Pool *pool, int how, Id what) {
660 Job *job = solv_calloc(1, sizeof(*job));
667 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
668 %newobject solvables;
670 Pool *pool = $self->pool;
674 how = $self->how & SOLVER_SELECTMASK;
675 FOR_JOB_SELECT(p, pp, how, $self->what)
680 bool __eq__(Job *j) {
681 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
683 bool __ne__(Job *j) {
684 return !Job___eq__($self, j);
686 #if defined(SWIGPERL)
687 %rename("str") __str__;
689 const char *__str__() {
690 return pool_job2str($self->pool, $self->how, $self->what, 0);
692 const char *__repr__() {
693 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
694 return pool_tmpjoin($self->pool, "<Job ", str, ">");
700 return (Chksum *)solv_chksum_create(type);
702 Chksum(Id type, const char *hex) {
703 unsigned char buf[64];
704 int l = solv_chksum_len(type);
707 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
709 return (Chksum *)solv_chksum_create_from_bin(type, buf);
712 solv_chksum_free($self, 0);
716 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
717 return solv_chksum_get_type(chksum);
720 void add(const char *str) {
721 solv_chksum_add($self, str, strlen((char *)str));
723 void add_fp(FILE *fp) {
726 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
727 solv_chksum_add($self, buf, l);
728 rewind(fp); /* convenience */
730 void add_fd(int fd) {
733 while ((l = read(fd, buf, sizeof(buf))) > 0)
734 solv_chksum_add($self, buf, l);
735 lseek(fd, 0, 0); /* convenience */
737 void add_stat(const char *filename) {
739 if (stat(filename, &stb))
740 memset(&stb, 0, sizeof(stb));
741 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
742 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
743 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
744 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
748 const unsigned char *b;
749 b = solv_chksum_get($self, &l);
750 return cdata_void((void *)b, l);
755 const unsigned char *b;
758 b = solv_chksum_get($self, &l);
759 ret = solv_malloc(2 * l + 1);
760 solv_bin2hex(b, l, ret);
764 bool __eq__(Chksum *chk) {
766 const unsigned char *b, *bo;
769 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
771 b = solv_chksum_get($self, &l);
772 bo = solv_chksum_get(chk, 0);
773 return memcmp(b, bo, l) == 0;
775 bool __ne__(Chksum *chk) {
776 return !Chksum___eq__($self, chk);
778 #if defined(SWIGRUBY)
779 %rename("to_s") __str__;
780 %rename("inspect") __repr__;
782 #if defined(SWIGPERL)
783 %rename("str") __str__;
786 const char *__str__() {
789 if (solv_chksum_isfinished($self))
790 h = Chksum_hex($self);
791 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
792 solv_free((void *)h);
796 const char *__repr__() {
797 const char *h = Chksum___str__($self);
798 const char *str = solv_dupjoin("<Chksum ", h, ">");
799 solv_free((void *)h);
806 Pool *pool = pool_create();
811 void set_debuglevel(int level) {
812 pool_setdebuglevel($self, level);
814 int set_flag(int flag, int value) {
815 return pool_set_flag($self, flag, value);
817 int get_flag(int flag) {
818 return pool_get_flag($self, flag);
820 #if defined(SWIGPYTHON)
822 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
823 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
824 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
825 PyObject *result = PyEval_CallObject((PyObject *)d, args);
830 return 0; /* exception */
831 ecode = SWIG_AsVal_int(result, &vresult);
833 return SWIG_IsOK(ecode) ? vresult : 0;
836 void set_loadcallback(PyObject *callable) {
837 if ($self->loadcallback == loadcallback) {
838 Py_DECREF($self->loadcallbackdata);
843 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
846 #if defined(SWIGPERL)
848 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
852 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
857 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
859 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
869 void set_loadcallback(SV *callable) {
870 if ($self->loadcallback == loadcallback)
871 SvREFCNT_dec($self->loadcallbackdata);
873 SvREFCNT_inc(callable);
874 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
878 #if defined(SWIGRUBY)
880 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
881 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
882 VALUE callable = (VALUE)d;
883 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
884 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
887 SWIGINTERN void mark_Pool(void *ptr) {
889 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
890 VALUE callable = (VALUE)pool->loadcallbackdata;
891 rb_gc_mark(callable);
895 %typemap(in, numinputs=0) VALUE callable {
896 $1 = rb_block_given_p() ? rb_block_proc() : 0;
898 void set_loadcallback(VALUE callable) {
899 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
904 Pool_set_loadcallback($self, 0);
907 Id str2id(const char *str, bool create=1) {
908 return pool_str2id($self, str, create);
910 Dep *Dep(const char *str, bool create=1) {
911 Id id = pool_str2id($self, str, create);
912 return new_Dep($self, id);
914 const char *id2str(Id id) {
915 return pool_id2str($self, id);
917 const char *dep2str(Id id) {
918 return pool_dep2str($self, id);
920 Id rel2id(Id name, Id evr, int flags, bool create=1) {
921 return pool_rel2id($self, name, evr, flags, create);
923 Id id2langid(Id id, const char *lang, bool create=1) {
924 return pool_id2langid($self, id, lang, create);
926 void setarch(const char *arch) {
927 pool_setarch($self, arch);
929 Repo *add_repo(const char *name) {
930 return repo_create($self, name);
932 const char *lookup_str(Id entry, Id keyname) {
933 return pool_lookup_str($self, entry, keyname);
935 Id lookup_id(Id entry, Id keyname) {
936 return pool_lookup_id($self, entry, keyname);
938 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
939 return pool_lookup_num($self, entry, keyname, notfound);
941 bool lookup_void(Id entry, Id keyname) {
942 return pool_lookup_void($self, entry, keyname);
944 %newobject lookup_checksum;
945 Chksum *lookup_checksum(Id entry, Id keyname) {
947 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
948 return solv_chksum_create_from_bin(type, b);
951 %newobject Dataiterator;
952 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
953 return new_Dataiterator($self, 0, p, key, match, flags);
955 const char *solvid2str(Id solvid) {
956 return pool_solvid2str($self, solvid);
958 void addfileprovides() {
959 pool_addfileprovides($self);
961 Queue addfileprovides_queue() {
964 pool_addfileprovides_queue($self, &r, 0);
967 void createwhatprovides() {
968 pool_createwhatprovides($self);
971 XSolvable *id2solvable(Id id) {
972 return new_XSolvable($self, id);
974 %newobject solvables;
975 Pool_solvable_iterator * const solvables;
977 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
978 return new_Pool_solvable_iterator(pool);
981 %newobject solvables_iter;
982 Pool_solvable_iterator * solvables_iter() {
983 return new_Pool_solvable_iterator($self);
986 Repo *id2repo(Id id) {
987 if (id < 1 || id >= $self->nrepos)
989 return pool_id2repo($self, id);
992 Pool_repo_iterator * const repos;
994 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
995 return new_Pool_repo_iterator(pool);
998 %newobject repos_iter;
999 Pool_repo_iterator * repos_iter() {
1000 return new_Pool_repo_iterator($self);
1005 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1006 pool_set_installed(pool, installed);
1008 Repo *Pool_installed_get(Pool *pool) {
1009 return pool->installed;
1013 Queue matchprovidingids(const char *match, int flags) {
1019 for (id = 1; id < pool->ss.nstrings; id++)
1020 if (pool->whatprovides[id])
1024 if (!datamatcher_init(&ma, match, flags)) {
1025 for (id = 1; id < pool->ss.nstrings; id++)
1026 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1028 datamatcher_free(&ma);
1034 Job *Job(int how, Id what) {
1035 return new_Job($self, how, what);
1038 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1039 %newobject whatprovides;
1040 Queue whatprovides(Id dep) {
1045 FOR_PROVIDES(p, pp, dep)
1050 Id towhatprovides(Queue q) {
1051 return pool_queuetowhatprovides($self, &q);
1055 %rename("isknownarch?") isknownarch;
1057 bool isknownarch(Id id) {
1059 if (!id || id == ID_EMPTY)
1061 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1063 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1070 return solver_create($self);
1075 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1076 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1077 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1078 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1079 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1080 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1081 #ifdef ENABLE_SUSEREPO
1082 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1085 void free(bool reuseids = 0) {
1086 repo_free($self, reuseids);
1088 void empty(bool reuseids = 0) {
1089 repo_empty($self, reuseids);
1092 %rename("isempty?") isempty;
1095 return !$self->nsolvables;
1097 bool add_solv(const char *name, int flags = 0) {
1098 FILE *fp = fopen(name, "r");
1102 r = repo_add_solv($self, fp, flags);
1106 bool add_solv(FILE *fp, int flags = 0) {
1107 return repo_add_solv($self, fp, flags) == 0;
1110 XSolvable *add_solvable() {
1111 Id solvid = repo_add_solvable($self);
1112 return new_XSolvable($self->pool, solvid);
1116 bool add_rpmdb(Repo *ref, int flags = 0) {
1117 repo_add_rpmdb($self, ref, 0, flags);
1120 Id add_rpm(const char *name, int flags = 0) {
1121 return repo_add_rpm($self, name, flags);
1125 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1126 repo_add_rpmmd($self, fp, language, flags);
1129 bool add_repomdxml(FILE *fp, int flags = 0) {
1130 repo_add_repomdxml($self, fp, flags);
1133 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1134 repo_add_updateinfoxml($self, fp, flags);
1137 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1138 repo_add_deltainfoxml($self, fp, flags);
1142 #ifdef ENABLE_DEBIAN
1143 bool add_debdb(int flags = 0) {
1144 repo_add_debdb($self, 0, flags);
1147 Id add_deb(const char *name, int flags = 0) {
1148 return repo_add_deb($self, name, flags);
1151 #ifdef ENABLE_SUSEREPO
1152 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1153 repo_add_susetags($self, fp, defvendor, language, flags);
1156 bool add_content(FILE *fp, int flags = 0) {
1157 repo_add_content($self, fp, flags);
1160 bool add_products(const char *proddir, int flags = 0) {
1161 repo_add_products($self, proddir, 0, flags);
1165 #ifdef ENABLE_MDKREPO
1166 bool add_mdk(FILE *fp, int flags = 0) {
1167 repo_add_mdk($self, fp, flags);
1170 bool add_mdk_info(FILE *fp, int flags = 0) {
1171 repo_add_mdk($self, fp, flags);
1175 #ifdef ENABLE_ARCHREPO
1176 bool add_arch_repo(FILE *fp, int flags = 0) {
1177 repo_add_arch_repo($self, fp, flags);
1180 Id add_arch_pkg(const char *name, int flags = 0) {
1181 return repo_add_arch_pkg($self, name, flags);
1184 void internalize() {
1185 repo_internalize($self);
1187 const char *lookup_str(Id entry, Id keyname) {
1188 return repo_lookup_str($self, entry, keyname);
1190 Id lookup_id(Id entry, Id keyname) {
1191 return repo_lookup_id($self, entry, keyname);
1193 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1194 return repo_lookup_num($self, entry, keyname, notfound);
1196 void write(FILE *fp) {
1197 repo_write($self, fp);
1199 # HACK, remove if no longer needed!
1200 bool write_first_repodata(FILE *fp) {
1201 int oldnrepodata = $self->nrepodata;
1202 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1203 repo_write($self, fp);
1204 $self->nrepodata = oldnrepodata;
1208 %newobject Dataiterator;
1209 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1210 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1215 SWIGINTERN Id Repo_id_get(Repo *repo) {
1216 return repo->repoid;
1219 Repo_solvable_iterator * const solvables;
1221 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1222 return new_Repo_solvable_iterator(repo);
1225 %newobject solvables_iter;
1226 Repo_solvable_iterator *solvables_iter() {
1227 return new_Repo_solvable_iterator($self);
1230 XRepodata *add_repodata(int flags = 0) {
1231 Repodata *rd = repo_add_repodata($self, flags);
1232 return new_XRepodata($self, rd->repodataid);
1235 void create_stubs() {
1237 if (!$self->nrepodata)
1239 data = repo_id2repodata($self, $self->nrepodata - 1);
1240 if (data->state != REPODATA_STUB)
1241 repodata_create_stubs(data);
1244 %rename("iscontiguous?") iscontiguous;
1246 bool iscontiguous() {
1248 for (i = $self->start; i < $self->end; i++)
1249 if ($self->pool->solvables[i].repo != $self)
1253 XRepodata *first_repodata() {
1256 if ($self->nrepodata < 2)
1258 /* make sure all repodatas but the first are extensions */
1259 data = repo_id2repodata($self, 1);
1260 if (data->loadcallback)
1262 for (i = 2; i < $self->nrepodata; i++)
1264 data = repo_id2repodata($self, i);
1265 if (!data->loadcallback)
1266 return 0; /* oops, not an extension */
1268 return new_XRepodata($self, 1);
1271 bool __eq__(Repo *repo) {
1272 return $self == repo;
1274 bool __ne__(Repo *repo) {
1275 return $self != repo;
1277 #if defined(SWIGPERL)
1278 %rename("str") __str__;
1281 const char *__str__() {
1284 return solv_strdup($self->name);
1285 sprintf(buf, "Repo#%d", $self->repoid);
1286 return solv_strdup(buf);
1288 %newobject __repr__;
1289 const char *__repr__() {
1293 sprintf(buf, "<Repo #%d ", $self->repoid);
1294 return solv_dupjoin(buf, $self->name, ">");
1296 sprintf(buf, "<Repo #%d>", $self->repoid);
1297 return solv_strdup(buf);
1301 %extend Dataiterator {
1302 static const int SEARCH_STRING = SEARCH_STRING;
1303 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1304 static const int SEARCH_GLOB = SEARCH_GLOB;
1305 static const int SEARCH_REGEX = SEARCH_REGEX;
1306 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1307 static const int SEARCH_FILES = SEARCH_FILES;
1308 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1310 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1311 Dataiterator *di = solv_calloc(1, sizeof(*di));
1312 dataiterator_init(di, pool, repo, p, key, match, flags);
1316 dataiterator_free($self);
1319 #if defined(SWIGPYTHON)
1320 %newobject __iter__;
1321 Dataiterator *__iter__() {
1323 ndi = solv_calloc(1, sizeof(*ndi));
1324 dataiterator_init_clone(ndi, $self);
1327 %rename("next") __next__();
1328 %exception __next__ {
1331 PyErr_SetString(PyExc_StopIteration,"no more matches");
1338 perliter(solv::Dataiterator)
1341 %newobject __next__;
1342 Datamatch *__next__() {
1344 if (!dataiterator_step($self)) {
1347 ndi = solv_calloc(1, sizeof(*ndi));
1348 dataiterator_init_clone(ndi, $self);
1354 while ((d = Dataiterator___next__($self)) != 0) {
1355 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1359 void prepend_keyname(Id key) {
1360 dataiterator_prepend_keyname($self, key);
1362 void skip_solvable() {
1363 dataiterator_skip_solvable($self);
1368 Id lookup_id(Id keyname) {
1369 Pool *pool = $self->repo->pool;
1370 Datapos oldpos = pool->pos;
1373 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1377 const char *lookup_str(Id keyname) {
1378 Pool *pool = $self->repo->pool;
1379 Datapos oldpos = pool->pos;
1382 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1386 %newobject lookup_checksum;
1387 Chksum *lookup_checksum(Id keyname) {
1388 Pool *pool = $self->repo->pool;
1389 Datapos oldpos = pool->pos;
1391 const unsigned char *b;
1393 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1395 return solv_chksum_create_from_bin(type, b);
1401 dataiterator_free($self);
1404 %newobject solvable;
1405 XSolvable * const solvable;
1407 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1408 return new_XSolvable(di->pool, di->solvid);
1412 return $self->key->name;
1414 const char *key_idstr() {
1415 return pool_id2str($self->pool, $self->key->name);
1418 return $self->key->type;
1420 const char *type_idstr() {
1421 return pool_id2str($self->pool, $self->key->type);
1424 return $self->kv.id;
1426 const char *idstr() {
1427 return pool_id2str($self->pool, $self->kv.id);
1430 return $self->kv.str;
1433 return $self->kv.num;
1436 return $self->kv.num2;
1440 Pool *pool = $self->pool;
1441 Datapos *pos, oldpos = pool->pos;
1442 dataiterator_setpos($self);
1443 pos = solv_calloc(1, sizeof(*pos));
1448 %newobject parentpos;
1449 Datapos *parentpos() {
1450 Pool *pool = $self->pool;
1451 Datapos *pos, oldpos = pool->pos;
1452 dataiterator_setpos_parent($self);
1453 pos = solv_calloc(1, sizeof(*pos));
1459 dataiterator_setpos($self);
1461 void setpos_parent() {
1462 dataiterator_setpos_parent($self);
1466 %extend Pool_solvable_iterator {
1467 Pool_solvable_iterator(Pool *pool) {
1468 Pool_solvable_iterator *s;
1469 s = solv_calloc(1, sizeof(*s));
1473 #if defined(SWIGPYTHON)
1474 %newobject __iter__;
1475 Pool_solvable_iterator *__iter__() {
1476 Pool_solvable_iterator *s;
1477 s = solv_calloc(1, sizeof(*s));
1481 %rename("next") __next__();
1482 %exception __next__ {
1485 PyErr_SetString(PyExc_StopIteration,"no more matches");
1492 perliter(solv::Pool_solvable_iterator)
1494 %newobject __next__;
1495 XSolvable *__next__() {
1496 Pool *pool = $self->pool;
1497 if ($self->id >= pool->nsolvables)
1499 while (++$self->id < pool->nsolvables)
1500 if (pool->solvables[$self->id].repo)
1501 return new_XSolvable(pool, $self->id);
1507 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1508 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1512 %newobject __getitem__;
1513 XSolvable *__getitem__(Id key) {
1514 Pool *pool = $self->pool;
1515 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1516 return new_XSolvable(pool, key);
1520 return $self->pool->nsolvables;
1524 %extend Pool_repo_iterator {
1525 Pool_repo_iterator(Pool *pool) {
1526 Pool_repo_iterator *s;
1527 s = solv_calloc(1, sizeof(*s));
1531 #if defined(SWIGPYTHON)
1532 %newobject __iter__;
1533 Pool_repo_iterator *__iter__() {
1534 Pool_repo_iterator *s;
1535 s = solv_calloc(1, sizeof(*s));
1539 %rename("next") __next__();
1540 %exception __next__ {
1543 PyErr_SetString(PyExc_StopIteration,"no more matches");
1548 %newobject __next__;
1550 Pool *pool = $self->pool;
1551 if ($self->id >= pool->nrepos)
1553 while (++$self->id < pool->nrepos) {
1554 Repo *r = pool_id2repo(pool, $self->id);
1563 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1564 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1568 Repo *__getitem__(Id key) {
1569 Pool *pool = $self->pool;
1570 if (key > 0 && key < pool->nrepos)
1571 return pool_id2repo(pool, key);
1575 return $self->pool->nrepos;
1579 %extend Repo_solvable_iterator {
1580 Repo_solvable_iterator(Repo *repo) {
1581 Repo_solvable_iterator *s;
1582 s = solv_calloc(1, sizeof(*s));
1586 #if defined(SWIGPYTHON)
1587 %newobject __iter__;
1588 Repo_solvable_iterator *__iter__() {
1589 Repo_solvable_iterator *s;
1590 s = solv_calloc(1, sizeof(*s));
1594 %rename("next") __next__();
1595 %exception __next__ {
1598 PyErr_SetString(PyExc_StopIteration,"no more matches");
1603 %newobject __next__;
1604 XSolvable *__next__() {
1605 Repo *repo = $self->repo;
1606 Pool *pool = repo->pool;
1607 if (repo->start > 0 && $self->id < repo->start)
1608 $self->id = repo->start - 1;
1609 if ($self->id >= repo->end)
1611 while (++$self->id < repo->end)
1612 if (pool->solvables[$self->id].repo == repo)
1613 return new_XSolvable(pool, $self->id);
1619 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1620 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1624 %newobject __getitem__;
1625 XSolvable *__getitem__(Id key) {
1626 Repo *repo = $self->repo;
1627 Pool *pool = repo->pool;
1628 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1629 return new_XSolvable(pool, key);
1633 return $self->repo->pool->nsolvables;
1638 Dep(Pool *pool, Id id) {
1642 s = solv_calloc(1, sizeof(*s));
1648 return pool_dep2str($self->pool, $self->id);
1650 bool __eq__(Dep *s) {
1651 return $self->pool == s->pool && $self->id == s->id;
1653 bool __ne__(Dep *s) {
1654 return !Dep___eq__($self, s);
1656 #if defined(SWIGPERL)
1657 %rename("str") __str__;
1659 const char *__str__() {
1660 return pool_dep2str($self->pool, $self->id);
1662 %newobject __repr__;
1663 const char *__repr__() {
1665 sprintf(buf, "<Id #%d ", $self->id);
1666 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1671 XSolvable(Pool *pool, Id id) {
1673 if (!id || id >= pool->nsolvables)
1675 s = solv_calloc(1, sizeof(*s));
1681 return pool_solvid2str($self->pool, $self->id);
1683 const char *lookup_str(Id keyname) {
1684 return pool_lookup_str($self->pool, $self->id, keyname);
1686 Id lookup_id(Id keyname) {
1687 return pool_lookup_id($self->pool, $self->id, keyname);
1689 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1690 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1692 bool lookup_void(Id keyname) {
1693 return pool_lookup_void($self->pool, $self->id, keyname);
1695 %newobject lookup_checksum;
1696 Chksum *lookup_checksum(Id keyname) {
1698 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1699 return solv_chksum_create_from_bin(type, b);
1701 Queue lookup_idarray(Id keyname, Id marker = 1) {
1702 Solvable *s = $self->pool->solvables + $self->id;
1706 if (keyname == SOLVABLE_PROVIDES)
1707 marker = -SOLVABLE_FILEMARKER;
1708 else if (keyname == SOLVABLE_REQUIRES)
1709 marker = -SOLVABLE_PREREQMARKER;
1713 solvable_lookup_deparray(s, keyname, &r, marker);
1716 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1717 %newobject lookup_deparray;
1718 Queue lookup_deparray(Id keyname, Id marker = 1) {
1719 Solvable *s = $self->pool->solvables + $self->id;
1723 if (keyname == SOLVABLE_PROVIDES)
1724 marker = -SOLVABLE_FILEMARKER;
1725 else if (keyname == SOLVABLE_REQUIRES)
1726 marker = -SOLVABLE_PREREQMARKER;
1730 solvable_lookup_deparray(s, keyname, &r, marker);
1733 const char *lookup_location(unsigned int *OUTPUT) {
1734 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1737 %rename("installable?") installable;
1739 bool installable() {
1740 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1743 %rename("isinstalled?") isinstalled;
1745 bool isinstalled() {
1746 Pool *pool = $self->pool;
1747 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1752 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1753 Pool *pool = xs->pool;
1754 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1756 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1757 Pool *pool = xs->pool;
1758 return pool_id2str(pool, pool->solvables[xs->id].name);
1763 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1764 xs->pool->solvables[xs->id].name = nameid;
1766 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1767 return xs->pool->solvables[xs->id].name;
1772 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1773 Pool *pool = xs->pool;
1774 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1776 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1777 Pool *pool = xs->pool;
1778 return pool_id2str(pool, pool->solvables[xs->id].evr);
1783 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1784 xs->pool->solvables[xs->id].evr = evrid;
1786 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1787 return xs->pool->solvables[xs->id].evr;
1792 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1793 Pool *pool = xs->pool;
1794 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1796 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1797 Pool *pool = xs->pool;
1798 return pool_id2str(pool, pool->solvables[xs->id].arch);
1803 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1804 xs->pool->solvables[xs->id].arch = archid;
1806 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1807 return xs->pool->solvables[xs->id].arch;
1812 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1813 Pool *pool = xs->pool;
1814 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1816 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1817 Pool *pool = xs->pool;
1818 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1823 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1824 xs->pool->solvables[xs->id].vendor = vendorid;
1826 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1827 return xs->pool->solvables[xs->id].vendor;
1832 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1833 return xs->pool->solvables[xs->id].repo;
1837 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1838 Solvable *s = $self->pool->solvables + $self->id;
1839 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1841 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1842 Solvable *s = $self->pool->solvables + $self->id;
1843 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1845 void add_obsoletes(Dep *dep) {
1846 Solvable *s = $self->pool->solvables + $self->id;
1847 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1849 void add_obsoletesid(Id id) {
1850 Solvable *s = $self->pool->solvables + $self->id;
1851 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1853 void add_conflicts(Dep *dep) {
1854 Solvable *s = $self->pool->solvables + $self->id;
1855 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1857 void add_conflictsid(Id id) {
1858 Solvable *s = $self->pool->solvables + $self->id;
1859 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1861 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1862 Solvable *s = $self->pool->solvables + $self->id;
1863 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1865 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1866 Solvable *s = $self->pool->solvables + $self->id;
1867 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1869 void add_recommends(Dep *dep) {
1870 Solvable *s = $self->pool->solvables + $self->id;
1871 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1873 void add_recommendsid(Id id) {
1874 Solvable *s = $self->pool->solvables + $self->id;
1875 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1877 void add_suggests(Dep *dep) {
1878 Solvable *s = $self->pool->solvables + $self->id;
1879 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1881 void add_suggestsid(Id id) {
1882 Solvable *s = $self->pool->solvables + $self->id;
1883 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1885 void add_supplements(Dep *dep) {
1886 Solvable *s = $self->pool->solvables + $self->id;
1887 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1889 void add_supplementsid(Id id) {
1890 Solvable *s = $self->pool->solvables + $self->id;
1891 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1893 void add_enhances(Dep *dep) {
1894 Solvable *s = $self->pool->solvables + $self->id;
1895 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
1897 void add_enhancesid(Id id) {
1898 Solvable *s = $self->pool->solvables + $self->id;
1899 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
1902 bool __eq__(XSolvable *s) {
1903 return $self->pool == s->pool && $self->id == s->id;
1905 bool __ne__(XSolvable *s) {
1906 return !XSolvable___eq__($self, s);
1908 #if defined(SWIGPERL)
1909 %rename("str") __str__;
1911 const char *__str__() {
1912 return pool_solvid2str($self->pool, $self->id);
1914 %newobject __repr__;
1915 const char *__repr__() {
1917 sprintf(buf, "<Solvable #%d ", $self->id);
1918 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1923 Problem(Solver *solv, Id id) {
1925 p = solv_calloc(1, sizeof(*p));
1930 %newobject findproblemrule;
1931 XRule *findproblemrule() {
1932 Id r = solver_findproblemrule($self->solv, $self->id);
1933 return new_XRule($self->solv, r);
1935 %newobject findallproblemrules;
1936 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1937 Queue findallproblemrules(int unfiltered=0) {
1938 Solver *solv = $self->solv;
1943 solver_findallproblemrules(solv, $self->id, &q);
1946 for (i = j = 0; i < q.count; i++)
1948 SolverRuleinfo rclass;
1949 probr = q.elements[i];
1950 rclass = solver_ruleclass(solv, probr);
1951 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1953 q.elements[j++] = probr;
1956 queue_truncate(&q, j);
1960 int solution_count() {
1961 return solver_solution_count($self->solv, $self->id);
1963 %newobject solutions;
1964 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1969 cnt = solver_solution_count($self->solv, $self->id);
1970 for (i = 1; i <= cnt; i++)
1977 Solution(Problem *p, Id id) {
1979 s = solv_calloc(1, sizeof(*s));
1981 s->problemid = p->id;
1985 int element_count() {
1986 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1989 %newobject elements;
1990 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1991 Queue elements(bool expandreplaces=0) {
1995 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1996 for (i = 1; i <= cnt; i++)
1999 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2001 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2007 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2008 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2010 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2011 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2012 queue_push2(&q, p, rp);
2014 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2015 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2016 queue_push2(&q, p, rp);
2018 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2019 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2020 queue_push2(&q, p, rp);
2025 queue_push2(&q, i, type);
2026 queue_push2(&q, p, rp);
2032 %extend Solutionelement {
2033 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2035 e = solv_calloc(1, sizeof(*e));
2037 e->problemid = problemid;
2048 if (p == SOLVER_SOLUTION_ERASE)
2053 else if (p == SOLVER_SOLUTION_REPLACE)
2058 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2059 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);
2060 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2061 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);
2062 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2063 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);
2064 return solver_solutionelement2str($self->solv, p, rp);
2066 %newobject replaceelements;
2067 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2068 Queue replaceelements() {
2073 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2076 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2077 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2078 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2079 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2080 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2081 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2082 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2084 queue_push(&q, $self->type);
2087 int illegalreplace() {
2088 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2090 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2092 %newobject solvable;
2093 XSolvable * const solvable;
2094 %newobject replacement;
2095 XSolvable * const replacement;
2098 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2099 return new_XSolvable(e->solv->pool, e->p);
2101 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2102 return new_XSolvable(e->solv->pool, e->rp);
2104 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2105 if (e->type != SOLVER_SOLUTION_JOB)
2107 return (e->p - 1) / 2;
2112 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2113 if ($self->type == SOLVER_SOLUTION_JOB)
2114 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2115 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2116 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2117 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2118 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2119 if ($self->type == SOLVER_SOLUTION_ERASE)
2120 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2126 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2127 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2128 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2129 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2130 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2131 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2132 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2133 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2134 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2135 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2136 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2137 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2138 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2139 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2140 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2141 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2142 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2143 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2144 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2146 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2147 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2148 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2149 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2150 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2151 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2152 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2153 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2155 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2156 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2157 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2159 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2160 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2161 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2162 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2163 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2164 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2165 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2166 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2167 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2173 int set_flag(int flag, int value) {
2174 return solver_set_flag($self, flag, value);
2176 int get_flag(int flag) {
2177 return solver_get_flag($self, flag);
2179 #if defined(SWIGPYTHON)
2181 def solve(self, jobs):
2183 for job in jobs: j += [job.how, job.what]
2184 return self.solve_helper(j)
2187 #if defined(SWIGPERL)
2189 sub solv::Solver::solve {
2190 my ($self, $jobs) = @_;
2191 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2192 return $self->solve_helper(\@j);
2196 #if defined(SWIGRUBY)
2199 "class Solv::Solver\n"
2200 " def solve(jobs)\n"
2202 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2203 " solve_helper(jl)\n"
2209 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2210 %newobject solve_helper;
2211 Queue solve_helper(Queue jobs) {
2215 solver_solve($self, &jobs);
2216 cnt = solver_problem_count($self);
2217 for (i = 1; i <= cnt; i++)
2221 %newobject transaction;
2222 Transaction *transaction() {
2223 return solver_create_transaction($self);
2227 %extend Transaction {
2228 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2229 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2230 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2231 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2232 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2233 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2234 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2235 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2236 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2237 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2238 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2239 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2240 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2241 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2242 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2243 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2244 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2245 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2246 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2247 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2248 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2249 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2250 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2251 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2252 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2253 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2254 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2256 transaction_free($self);
2259 %rename("isempty?") isempty;
2262 return $self->steps.count == 0;
2265 %newobject othersolvable;
2266 XSolvable *othersolvable(XSolvable *s) {
2267 Id op = transaction_obs_pkg($self, s->id);
2268 return new_XSolvable($self->pool, op);
2271 %newobject allothersolvables;
2272 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2273 Queue allothersolvables(XSolvable *s) {
2276 transaction_all_obs_pkgs($self, s->id, &q);
2280 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2281 %newobject classify;
2282 Queue classify(int mode = 0) {
2285 transaction_classify($self, mode, &q);
2289 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2290 %newobject newpackages;
2291 Queue newpackages() {
2295 cut = transaction_installedresult(self, &q);
2296 queue_truncate(&q, cut);
2300 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2301 %newobject keptpackages;
2302 Queue keptpackages() {
2306 cut = transaction_installedresult(self, &q);
2308 queue_deleten(&q, 0, cut);
2312 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2316 queue_init_clone(&q, &$self->steps);
2320 int steptype(XSolvable *s, int mode) {
2321 return transaction_type($self, s->id, mode);
2323 int calc_installsizechange() {
2324 return transaction_calc_installsizechange($self);
2326 void order(int flags) {
2327 transaction_order($self, flags);
2331 %extend TransactionClass {
2332 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2333 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2334 cl->transaction = trans;
2338 cl->fromid = fromid;
2342 %newobject solvables;
2343 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2347 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2353 XRule(Solver *solv, Id id) {
2356 XRule *xr = solv_calloc(1, sizeof(*xr));
2362 Id type, source, target, dep;
2363 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2364 return new_Ruleinfo($self, type, source, target, dep);
2366 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2367 %newobject allinfos;
2371 solver_allruleinfos($self->solv, $self->id, &q);
2375 bool __eq__(XRule *xr) {
2376 return $self->solv == xr->solv && $self->id == xr->id;
2378 bool __ne__(XRule *xr) {
2379 return !XRule___eq__($self, xr);
2381 %newobject __repr__;
2382 const char *__repr__() {
2384 sprintf(buf, "<Rule #%d>", $self->id);
2385 return solv_strdup(buf);
2390 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2391 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2395 ri->source = source;
2396 ri->target = target;
2400 XSolvable * const solvable;
2401 XSolvable * const othersolvable;
2403 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2404 return new_XSolvable(ri->solv->pool, ri->source);
2406 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2407 return new_XSolvable(ri->solv->pool, ri->target);
2410 const char *problemstr() {
2411 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2416 XRepodata(Repo *repo, Id id) {
2417 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2423 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2425 void set_id(Id solvid, Id keyname, Id id) {
2426 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2428 void set_str(Id solvid, Id keyname, const char *str) {
2429 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2431 void set_poolstr(Id solvid, Id keyname, const char *str) {
2432 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2434 void add_idarray(Id solvid, Id keyname, Id id) {
2435 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2437 void add_flexarray(Id solvid, Id keyname, Id handle) {
2438 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2440 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2441 const unsigned char *buf = solv_chksum_get(chksum, 0);
2443 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2445 const char *lookup_str(Id solvid, Id keyname) {
2446 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2448 Queue lookup_idarray(Id solvid, Id keyname) {
2451 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2454 %newobject lookup_checksum;
2455 Chksum *lookup_checksum(Id solvid, Id keyname) {
2457 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2458 return solv_chksum_create_from_bin(type, b);
2460 void internalize() {
2461 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2463 void create_stubs() {
2464 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2466 void write(FILE *fp) {
2467 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2469 bool add_solv(FILE *fp, int flags = 0) {
2470 Repodata *data = repo_id2repodata($self->repo, $self->id);
2471 int r, oldstate = data->state;
2472 data->state = REPODATA_LOADING;
2473 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2474 if (r || data->state == REPODATA_LOADING)
2475 data->state = oldstate;
2478 void extend_to_repo() {
2479 Repodata *data = repo_id2repodata($self->repo, $self->id);
2480 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2482 bool __eq__(XRepodata *xr) {
2483 return $self->repo == xr->repo && $self->id == xr->id;
2485 bool __ne__(XRepodata *xr) {
2486 return !XRepodata___eq__($self, xr);
2488 %newobject __repr__;
2489 const char *__repr__() {
2491 sprintf(buf, "<Repodata #%d>", $self->id);
2492 return solv_strdup(buf);