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"
353 #include "repo_write.h"
355 #include "repo_rpmdb.h"
358 #include "repo_deb.h"
361 #include "repo_rpmmd.h"
362 #include "repo_updateinfoxml.h"
363 #include "repo_deltainfoxml.h"
364 #include "repo_repomdxml.h"
366 #ifdef ENABLE_SUSEREPO
367 #include "repo_products.h"
368 #include "repo_susetags.h"
369 #include "repo_content.h"
371 #ifdef ENABLE_MDKREPO
372 #include "repo_mdk.h"
374 #ifdef ENABLE_ARCHREPO
375 #include "repo_arch.h"
377 #include "solv_xfopen.h"
379 /* for old ruby versions */
381 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
384 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
387 #define SOLVER_SOLUTION_ERASE -100
388 #define SOLVER_SOLUTION_REPLACE -101
389 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
390 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
391 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
393 typedef struct chksum Chksum;
394 typedef void *AppObjectPtr;
419 } Pool_solvable_iterator;
424 } Pool_repo_iterator;
429 } Repo_solvable_iterator;
469 Transaction *transaction;
477 typedef Dataiterator Datamatch;
482 %mixin Dataiterator "Enumerable";
483 %mixin Pool_solvable_iterator "Enumerable";
484 %mixin Pool_repo_iterator "Enumerable";
485 %mixin Repo_solvable_iterator "Enumerable";
493 %constant Id SOLVID_META;
494 %constant Id SOLVID_POS;
496 %constant int REL_EQ;
497 %constant int REL_GT;
498 %constant int REL_LT;
499 %constant int REL_ARCH;
527 # put before pool/repo so we can access the constructor
528 %nodefaultdtor Dataiterator;
529 typedef struct {} Dataiterator;
530 typedef struct {} Pool_solvable_iterator;
531 typedef struct {} Pool_repo_iterator;
532 typedef struct {} Repo_solvable_iterator;
534 %nodefaultctor Datamatch;
535 %nodefaultdtor Datamatch;
542 %nodefaultctor Datapos;
556 AppObjectPtr appdata;
563 const char * const name;
566 int const nsolvables;
567 AppObjectPtr appdata;
570 %nodefaultctor Solver;
571 %nodefaultdtor Solver;
579 %rename(xfopen) solv_xfopen;
580 %rename(xfopen_fd) solv_xfopen_fd;
581 %rename(xfopen_dup) solv_xfopen_dup;
582 %rename(xfclose) solv_xfclose;
583 %rename(xfileno) solv_xfileno;
585 FILE *solv_xfopen(const char *fn, const char *mode = 0);
586 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
587 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
588 int solv_xfclose(FILE *fp);
589 int solv_xfileno(FILE *fp);
592 SWIGINTERN int solv_xfclose(FILE *fp) {
595 SWIGINTERN int solv_xfileno(FILE *fp) {
598 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
600 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
623 %nodefaultctor Transaction;
624 %nodefaultdtor Transaction;
630 Transaction * const transaction;
639 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
640 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
641 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
642 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
643 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
644 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
645 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
646 static const Id SOLVER_NOOP = SOLVER_NOOP;
647 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
648 static const Id SOLVER_ERASE = SOLVER_ERASE;
649 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
650 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
651 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
652 static const Id SOLVER_LOCK = SOLVER_LOCK;
653 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
654 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
655 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
656 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
657 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
658 static const Id SOLVER_WEAK = SOLVER_WEAK;
659 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
660 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
661 static const Id SOLVER_SETEV = SOLVER_SETEV;
662 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
663 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
664 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
665 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
666 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
667 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
669 Job(Pool *pool, int how, Id what) {
670 Job *job = solv_calloc(1, sizeof(*job));
677 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
678 %newobject solvables;
680 Pool *pool = $self->pool;
684 how = $self->how & SOLVER_SELECTMASK;
685 FOR_JOB_SELECT(p, pp, how, $self->what)
690 bool __eq__(Job *j) {
691 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
693 bool __ne__(Job *j) {
694 return !Job___eq__($self, j);
696 #if defined(SWIGPERL)
697 %rename("str") __str__;
699 const char *__str__() {
700 return pool_job2str($self->pool, $self->how, $self->what, 0);
702 const char *__repr__() {
703 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
704 return pool_tmpjoin($self->pool, "<Job ", str, ">");
710 return (Chksum *)solv_chksum_create(type);
712 Chksum(Id type, const char *hex) {
713 unsigned char buf[64];
714 int l = solv_chksum_len(type);
717 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
719 return (Chksum *)solv_chksum_create_from_bin(type, buf);
722 solv_chksum_free($self, 0);
726 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
727 return solv_chksum_get_type(chksum);
730 void add(const char *str) {
731 solv_chksum_add($self, str, strlen((char *)str));
733 void add_fp(FILE *fp) {
736 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
737 solv_chksum_add($self, buf, l);
738 rewind(fp); /* convenience */
740 void add_fd(int fd) {
743 while ((l = read(fd, buf, sizeof(buf))) > 0)
744 solv_chksum_add($self, buf, l);
745 lseek(fd, 0, 0); /* convenience */
747 void add_stat(const char *filename) {
749 if (stat(filename, &stb))
750 memset(&stb, 0, sizeof(stb));
751 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
752 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
753 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
754 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
758 const unsigned char *b;
759 b = solv_chksum_get($self, &l);
760 return cdata_void((void *)b, l);
765 const unsigned char *b;
768 b = solv_chksum_get($self, &l);
769 ret = solv_malloc(2 * l + 1);
770 solv_bin2hex(b, l, ret);
774 bool __eq__(Chksum *chk) {
776 const unsigned char *b, *bo;
779 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
781 b = solv_chksum_get($self, &l);
782 bo = solv_chksum_get(chk, 0);
783 return memcmp(b, bo, l) == 0;
785 bool __ne__(Chksum *chk) {
786 return !Chksum___eq__($self, chk);
788 #if defined(SWIGRUBY)
789 %rename("to_s") __str__;
790 %rename("inspect") __repr__;
792 #if defined(SWIGPERL)
793 %rename("str") __str__;
796 const char *__str__() {
799 if (solv_chksum_isfinished($self))
800 h = Chksum_hex($self);
801 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
802 solv_free((void *)h);
806 const char *__repr__() {
807 const char *h = Chksum___str__($self);
808 const char *str = solv_dupjoin("<Chksum ", h, ">");
809 solv_free((void *)h);
816 Pool *pool = pool_create();
821 void set_debuglevel(int level) {
822 pool_setdebuglevel($self, level);
824 int set_flag(int flag, int value) {
825 return pool_set_flag($self, flag, value);
827 int get_flag(int flag) {
828 return pool_get_flag($self, flag);
830 #if defined(SWIGPYTHON)
832 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
833 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
834 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
835 PyObject *result = PyEval_CallObject((PyObject *)d, args);
840 return 0; /* exception */
841 ecode = SWIG_AsVal_int(result, &vresult);
843 return SWIG_IsOK(ecode) ? vresult : 0;
846 void set_loadcallback(PyObject *callable) {
847 if ($self->loadcallback == loadcallback) {
848 PyObject *obj = $self->loadcallbackdata;
854 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
857 #if defined(SWIGPERL)
859 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
863 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
868 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
870 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
880 void set_loadcallback(SV *callable) {
881 if ($self->loadcallback == loadcallback)
882 SvREFCNT_dec($self->loadcallbackdata);
884 SvREFCNT_inc(callable);
885 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
889 #if defined(SWIGRUBY)
891 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
892 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
893 VALUE callable = (VALUE)d;
894 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
895 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
898 SWIGINTERN void mark_Pool(void *ptr) {
900 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
901 VALUE callable = (VALUE)pool->loadcallbackdata;
902 rb_gc_mark(callable);
906 %typemap(in, numinputs=0) VALUE callable {
907 $1 = rb_block_given_p() ? rb_block_proc() : 0;
909 void set_loadcallback(VALUE callable) {
910 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
915 Pool_set_loadcallback($self, 0);
918 Id str2id(const char *str, bool create=1) {
919 return pool_str2id($self, str, create);
921 Dep *Dep(const char *str, bool create=1) {
922 Id id = pool_str2id($self, str, create);
923 return new_Dep($self, id);
925 const char *id2str(Id id) {
926 return pool_id2str($self, id);
928 const char *dep2str(Id id) {
929 return pool_dep2str($self, id);
931 Id rel2id(Id name, Id evr, int flags, bool create=1) {
932 return pool_rel2id($self, name, evr, flags, create);
934 Id id2langid(Id id, const char *lang, bool create=1) {
935 return pool_id2langid($self, id, lang, create);
937 void setarch(const char *arch) {
938 pool_setarch($self, arch);
940 Repo *add_repo(const char *name) {
941 return repo_create($self, name);
943 const char *lookup_str(Id entry, Id keyname) {
944 return pool_lookup_str($self, entry, keyname);
946 Id lookup_id(Id entry, Id keyname) {
947 return pool_lookup_id($self, entry, keyname);
949 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
950 return pool_lookup_num($self, entry, keyname, notfound);
952 bool lookup_void(Id entry, Id keyname) {
953 return pool_lookup_void($self, entry, keyname);
955 %newobject lookup_checksum;
956 Chksum *lookup_checksum(Id entry, Id keyname) {
958 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
959 return solv_chksum_create_from_bin(type, b);
962 %newobject Dataiterator;
963 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
964 return new_Dataiterator($self, 0, p, key, match, flags);
966 const char *solvid2str(Id solvid) {
967 return pool_solvid2str($self, solvid);
969 void addfileprovides() {
970 pool_addfileprovides($self);
972 Queue addfileprovides_queue() {
975 pool_addfileprovides_queue($self, &r, 0);
978 void createwhatprovides() {
979 pool_createwhatprovides($self);
982 XSolvable *id2solvable(Id id) {
983 return new_XSolvable($self, id);
985 %newobject solvables;
986 Pool_solvable_iterator * const solvables;
988 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
989 return new_Pool_solvable_iterator(pool);
992 %newobject solvables_iter;
993 Pool_solvable_iterator * solvables_iter() {
994 return new_Pool_solvable_iterator($self);
997 Repo *id2repo(Id id) {
998 if (id < 1 || id >= $self->nrepos)
1000 return pool_id2repo($self, id);
1003 Pool_repo_iterator * const repos;
1005 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1006 return new_Pool_repo_iterator(pool);
1009 %newobject repos_iter;
1010 Pool_repo_iterator * repos_iter() {
1011 return new_Pool_repo_iterator($self);
1016 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1017 pool_set_installed(pool, installed);
1019 Repo *Pool_installed_get(Pool *pool) {
1020 return pool->installed;
1024 Queue matchprovidingids(const char *match, int flags) {
1030 for (id = 1; id < pool->ss.nstrings; id++)
1031 if (pool->whatprovides[id])
1035 if (!datamatcher_init(&ma, match, flags)) {
1036 for (id = 1; id < pool->ss.nstrings; id++)
1037 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1039 datamatcher_free(&ma);
1045 Job *Job(int how, Id what) {
1046 return new_Job($self, how, what);
1049 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1050 %newobject whatprovides;
1051 Queue whatprovides(Id dep) {
1056 FOR_PROVIDES(p, pp, dep)
1061 Id towhatprovides(Queue q) {
1062 return pool_queuetowhatprovides($self, &q);
1066 %rename("isknownarch?") isknownarch;
1068 bool isknownarch(Id id) {
1070 if (!id || id == ID_EMPTY)
1072 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1074 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1081 return solver_create($self);
1086 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1087 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1088 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1089 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1090 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1091 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1092 #ifdef ENABLE_SUSEREPO
1093 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1096 void free(bool reuseids = 0) {
1097 repo_free($self, reuseids);
1099 void empty(bool reuseids = 0) {
1100 repo_empty($self, reuseids);
1103 %rename("isempty?") isempty;
1106 return !$self->nsolvables;
1108 bool add_solv(const char *name, int flags = 0) {
1109 FILE *fp = fopen(name, "r");
1113 r = repo_add_solv($self, fp, flags);
1117 bool add_solv(FILE *fp, int flags = 0) {
1118 return repo_add_solv($self, fp, flags) == 0;
1121 XSolvable *add_solvable() {
1122 Id solvid = repo_add_solvable($self);
1123 return new_XSolvable($self->pool, solvid);
1127 bool add_rpmdb(Repo *ref, int flags = 0) {
1128 repo_add_rpmdb($self, ref, 0, flags);
1131 Id add_rpm(const char *name, int flags = 0) {
1132 return repo_add_rpm($self, name, flags);
1136 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1137 repo_add_rpmmd($self, fp, language, flags);
1140 bool add_repomdxml(FILE *fp, int flags = 0) {
1141 repo_add_repomdxml($self, fp, flags);
1144 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1145 repo_add_updateinfoxml($self, fp, flags);
1148 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1149 repo_add_deltainfoxml($self, fp, flags);
1153 #ifdef ENABLE_DEBIAN
1154 bool add_debdb(int flags = 0) {
1155 repo_add_debdb($self, 0, flags);
1158 Id add_deb(const char *name, int flags = 0) {
1159 return repo_add_deb($self, name, flags);
1162 #ifdef ENABLE_SUSEREPO
1163 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1164 repo_add_susetags($self, fp, defvendor, language, flags);
1167 bool add_content(FILE *fp, int flags = 0) {
1168 repo_add_content($self, fp, flags);
1171 bool add_products(const char *proddir, int flags = 0) {
1172 repo_add_products($self, proddir, 0, flags);
1176 #ifdef ENABLE_MDKREPO
1177 bool add_mdk(FILE *fp, int flags = 0) {
1178 repo_add_mdk($self, fp, flags);
1181 bool add_mdk_info(FILE *fp, int flags = 0) {
1182 repo_add_mdk($self, fp, flags);
1186 #ifdef ENABLE_ARCHREPO
1187 bool add_arch_repo(FILE *fp, int flags = 0) {
1188 repo_add_arch_repo($self, fp, flags);
1191 Id add_arch_pkg(const char *name, int flags = 0) {
1192 return repo_add_arch_pkg($self, name, flags);
1195 void internalize() {
1196 repo_internalize($self);
1198 const char *lookup_str(Id entry, Id keyname) {
1199 return repo_lookup_str($self, entry, keyname);
1201 Id lookup_id(Id entry, Id keyname) {
1202 return repo_lookup_id($self, entry, keyname);
1204 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1205 return repo_lookup_num($self, entry, keyname, notfound);
1207 void write(FILE *fp) {
1208 repo_write($self, fp);
1210 # HACK, remove if no longer needed!
1211 bool write_first_repodata(FILE *fp) {
1212 int oldnrepodata = $self->nrepodata;
1213 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1214 repo_write($self, fp);
1215 $self->nrepodata = oldnrepodata;
1219 %newobject Dataiterator;
1220 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1221 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1226 SWIGINTERN Id Repo_id_get(Repo *repo) {
1227 return repo->repoid;
1230 Repo_solvable_iterator * const solvables;
1232 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1233 return new_Repo_solvable_iterator(repo);
1236 %newobject solvables_iter;
1237 Repo_solvable_iterator *solvables_iter() {
1238 return new_Repo_solvable_iterator($self);
1241 XRepodata *add_repodata(int flags = 0) {
1242 Repodata *rd = repo_add_repodata($self, flags);
1243 return new_XRepodata($self, rd->repodataid);
1246 void create_stubs() {
1248 if (!$self->nrepodata)
1250 data = repo_id2repodata($self, $self->nrepodata - 1);
1251 if (data->state != REPODATA_STUB)
1252 repodata_create_stubs(data);
1255 %rename("iscontiguous?") iscontiguous;
1257 bool iscontiguous() {
1259 for (i = $self->start; i < $self->end; i++)
1260 if ($self->pool->solvables[i].repo != $self)
1264 XRepodata *first_repodata() {
1267 if ($self->nrepodata < 2)
1269 /* make sure all repodatas but the first are extensions */
1270 data = repo_id2repodata($self, 1);
1271 if (data->loadcallback)
1273 for (i = 2; i < $self->nrepodata; i++)
1275 data = repo_id2repodata($self, i);
1276 if (!data->loadcallback)
1277 return 0; /* oops, not an extension */
1279 return new_XRepodata($self, 1);
1282 bool __eq__(Repo *repo) {
1283 return $self == repo;
1285 bool __ne__(Repo *repo) {
1286 return $self != repo;
1288 #if defined(SWIGPERL)
1289 %rename("str") __str__;
1292 const char *__str__() {
1295 return solv_strdup($self->name);
1296 sprintf(buf, "Repo#%d", $self->repoid);
1297 return solv_strdup(buf);
1299 %newobject __repr__;
1300 const char *__repr__() {
1304 sprintf(buf, "<Repo #%d ", $self->repoid);
1305 return solv_dupjoin(buf, $self->name, ">");
1307 sprintf(buf, "<Repo #%d>", $self->repoid);
1308 return solv_strdup(buf);
1312 %extend Dataiterator {
1313 static const int SEARCH_STRING = SEARCH_STRING;
1314 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1315 static const int SEARCH_GLOB = SEARCH_GLOB;
1316 static const int SEARCH_REGEX = SEARCH_REGEX;
1317 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1318 static const int SEARCH_FILES = SEARCH_FILES;
1319 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1321 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1322 Dataiterator *di = solv_calloc(1, sizeof(*di));
1323 dataiterator_init(di, pool, repo, p, key, match, flags);
1327 dataiterator_free($self);
1330 #if defined(SWIGPYTHON)
1331 %newobject __iter__;
1332 Dataiterator *__iter__() {
1334 ndi = solv_calloc(1, sizeof(*ndi));
1335 dataiterator_init_clone(ndi, $self);
1338 %rename("next") __next__();
1339 %exception __next__ {
1342 PyErr_SetString(PyExc_StopIteration,"no more matches");
1349 perliter(solv::Dataiterator)
1352 %newobject __next__;
1353 Datamatch *__next__() {
1355 if (!dataiterator_step($self)) {
1358 ndi = solv_calloc(1, sizeof(*ndi));
1359 dataiterator_init_clone(ndi, $self);
1365 while ((d = Dataiterator___next__($self)) != 0) {
1366 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1370 void prepend_keyname(Id key) {
1371 dataiterator_prepend_keyname($self, key);
1373 void skip_solvable() {
1374 dataiterator_skip_solvable($self);
1379 Id lookup_id(Id keyname) {
1380 Pool *pool = $self->repo->pool;
1381 Datapos oldpos = pool->pos;
1384 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1388 const char *lookup_str(Id keyname) {
1389 Pool *pool = $self->repo->pool;
1390 Datapos oldpos = pool->pos;
1393 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1397 %newobject lookup_checksum;
1398 Chksum *lookup_checksum(Id keyname) {
1399 Pool *pool = $self->repo->pool;
1400 Datapos oldpos = pool->pos;
1402 const unsigned char *b;
1404 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1406 return solv_chksum_create_from_bin(type, b);
1412 dataiterator_free($self);
1415 %newobject solvable;
1416 XSolvable * const solvable;
1418 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1419 return new_XSolvable(di->pool, di->solvid);
1423 return $self->key->name;
1425 const char *key_idstr() {
1426 return pool_id2str($self->pool, $self->key->name);
1429 return $self->key->type;
1431 const char *type_idstr() {
1432 return pool_id2str($self->pool, $self->key->type);
1435 return $self->kv.id;
1437 const char *idstr() {
1438 return pool_id2str($self->pool, $self->kv.id);
1441 return $self->kv.str;
1444 return $self->kv.num;
1447 return $self->kv.num2;
1451 Pool *pool = $self->pool;
1452 Datapos *pos, oldpos = pool->pos;
1453 dataiterator_setpos($self);
1454 pos = solv_calloc(1, sizeof(*pos));
1459 %newobject parentpos;
1460 Datapos *parentpos() {
1461 Pool *pool = $self->pool;
1462 Datapos *pos, oldpos = pool->pos;
1463 dataiterator_setpos_parent($self);
1464 pos = solv_calloc(1, sizeof(*pos));
1470 dataiterator_setpos($self);
1472 void setpos_parent() {
1473 dataiterator_setpos_parent($self);
1477 %extend Pool_solvable_iterator {
1478 Pool_solvable_iterator(Pool *pool) {
1479 Pool_solvable_iterator *s;
1480 s = solv_calloc(1, sizeof(*s));
1484 #if defined(SWIGPYTHON)
1485 %newobject __iter__;
1486 Pool_solvable_iterator *__iter__() {
1487 Pool_solvable_iterator *s;
1488 s = solv_calloc(1, sizeof(*s));
1492 %rename("next") __next__();
1493 %exception __next__ {
1496 PyErr_SetString(PyExc_StopIteration,"no more matches");
1503 perliter(solv::Pool_solvable_iterator)
1505 %newobject __next__;
1506 XSolvable *__next__() {
1507 Pool *pool = $self->pool;
1508 if ($self->id >= pool->nsolvables)
1510 while (++$self->id < pool->nsolvables)
1511 if (pool->solvables[$self->id].repo)
1512 return new_XSolvable(pool, $self->id);
1518 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1519 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1523 %newobject __getitem__;
1524 XSolvable *__getitem__(Id key) {
1525 Pool *pool = $self->pool;
1526 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1527 return new_XSolvable(pool, key);
1531 return $self->pool->nsolvables;
1535 %extend Pool_repo_iterator {
1536 Pool_repo_iterator(Pool *pool) {
1537 Pool_repo_iterator *s;
1538 s = solv_calloc(1, sizeof(*s));
1542 #if defined(SWIGPYTHON)
1543 %newobject __iter__;
1544 Pool_repo_iterator *__iter__() {
1545 Pool_repo_iterator *s;
1546 s = solv_calloc(1, sizeof(*s));
1550 %rename("next") __next__();
1551 %exception __next__ {
1554 PyErr_SetString(PyExc_StopIteration,"no more matches");
1559 %newobject __next__;
1561 Pool *pool = $self->pool;
1562 if ($self->id >= pool->nrepos)
1564 while (++$self->id < pool->nrepos) {
1565 Repo *r = pool_id2repo(pool, $self->id);
1574 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1575 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1579 Repo *__getitem__(Id key) {
1580 Pool *pool = $self->pool;
1581 if (key > 0 && key < pool->nrepos)
1582 return pool_id2repo(pool, key);
1586 return $self->pool->nrepos;
1590 %extend Repo_solvable_iterator {
1591 Repo_solvable_iterator(Repo *repo) {
1592 Repo_solvable_iterator *s;
1593 s = solv_calloc(1, sizeof(*s));
1597 #if defined(SWIGPYTHON)
1598 %newobject __iter__;
1599 Repo_solvable_iterator *__iter__() {
1600 Repo_solvable_iterator *s;
1601 s = solv_calloc(1, sizeof(*s));
1605 %rename("next") __next__();
1606 %exception __next__ {
1609 PyErr_SetString(PyExc_StopIteration,"no more matches");
1614 %newobject __next__;
1615 XSolvable *__next__() {
1616 Repo *repo = $self->repo;
1617 Pool *pool = repo->pool;
1618 if (repo->start > 0 && $self->id < repo->start)
1619 $self->id = repo->start - 1;
1620 if ($self->id >= repo->end)
1622 while (++$self->id < repo->end)
1623 if (pool->solvables[$self->id].repo == repo)
1624 return new_XSolvable(pool, $self->id);
1630 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1631 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1635 %newobject __getitem__;
1636 XSolvable *__getitem__(Id key) {
1637 Repo *repo = $self->repo;
1638 Pool *pool = repo->pool;
1639 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1640 return new_XSolvable(pool, key);
1644 return $self->repo->pool->nsolvables;
1649 Dep(Pool *pool, Id id) {
1653 s = solv_calloc(1, sizeof(*s));
1659 return pool_dep2str($self->pool, $self->id);
1661 bool __eq__(Dep *s) {
1662 return $self->pool == s->pool && $self->id == s->id;
1664 bool __ne__(Dep *s) {
1665 return !Dep___eq__($self, s);
1667 #if defined(SWIGPERL)
1668 %rename("str") __str__;
1670 const char *__str__() {
1671 return pool_dep2str($self->pool, $self->id);
1673 %newobject __repr__;
1674 const char *__repr__() {
1676 sprintf(buf, "<Id #%d ", $self->id);
1677 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1682 XSolvable(Pool *pool, Id id) {
1684 if (!id || id >= pool->nsolvables)
1686 s = solv_calloc(1, sizeof(*s));
1692 return pool_solvid2str($self->pool, $self->id);
1694 const char *lookup_str(Id keyname) {
1695 return pool_lookup_str($self->pool, $self->id, keyname);
1697 Id lookup_id(Id keyname) {
1698 return pool_lookup_id($self->pool, $self->id, keyname);
1700 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1701 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1703 bool lookup_void(Id keyname) {
1704 return pool_lookup_void($self->pool, $self->id, keyname);
1706 %newobject lookup_checksum;
1707 Chksum *lookup_checksum(Id keyname) {
1709 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1710 return solv_chksum_create_from_bin(type, b);
1712 Queue lookup_idarray(Id keyname, Id marker = 1) {
1713 Solvable *s = $self->pool->solvables + $self->id;
1717 if (keyname == SOLVABLE_PROVIDES)
1718 marker = -SOLVABLE_FILEMARKER;
1719 else if (keyname == SOLVABLE_REQUIRES)
1720 marker = -SOLVABLE_PREREQMARKER;
1724 solvable_lookup_deparray(s, keyname, &r, marker);
1727 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1728 %newobject lookup_deparray;
1729 Queue lookup_deparray(Id keyname, Id marker = 1) {
1730 Solvable *s = $self->pool->solvables + $self->id;
1734 if (keyname == SOLVABLE_PROVIDES)
1735 marker = -SOLVABLE_FILEMARKER;
1736 else if (keyname == SOLVABLE_REQUIRES)
1737 marker = -SOLVABLE_PREREQMARKER;
1741 solvable_lookup_deparray(s, keyname, &r, marker);
1744 const char *lookup_location(unsigned int *OUTPUT) {
1745 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1748 %rename("installable?") installable;
1750 bool installable() {
1751 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1754 %rename("isinstalled?") isinstalled;
1756 bool isinstalled() {
1757 Pool *pool = $self->pool;
1758 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1763 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1764 Pool *pool = xs->pool;
1765 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1767 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1768 Pool *pool = xs->pool;
1769 return pool_id2str(pool, pool->solvables[xs->id].name);
1774 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1775 xs->pool->solvables[xs->id].name = nameid;
1777 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1778 return xs->pool->solvables[xs->id].name;
1783 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1784 Pool *pool = xs->pool;
1785 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1787 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1788 Pool *pool = xs->pool;
1789 return pool_id2str(pool, pool->solvables[xs->id].evr);
1794 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1795 xs->pool->solvables[xs->id].evr = evrid;
1797 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1798 return xs->pool->solvables[xs->id].evr;
1803 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1804 Pool *pool = xs->pool;
1805 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1807 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1808 Pool *pool = xs->pool;
1809 return pool_id2str(pool, pool->solvables[xs->id].arch);
1814 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1815 xs->pool->solvables[xs->id].arch = archid;
1817 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1818 return xs->pool->solvables[xs->id].arch;
1823 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1824 Pool *pool = xs->pool;
1825 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1827 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1828 Pool *pool = xs->pool;
1829 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1834 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1835 xs->pool->solvables[xs->id].vendor = vendorid;
1837 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1838 return xs->pool->solvables[xs->id].vendor;
1843 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1844 return xs->pool->solvables[xs->id].repo;
1848 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1849 Solvable *s = $self->pool->solvables + $self->id;
1850 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1852 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1853 Solvable *s = $self->pool->solvables + $self->id;
1854 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1856 void add_obsoletes(Dep *dep) {
1857 Solvable *s = $self->pool->solvables + $self->id;
1858 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1860 void add_obsoletesid(Id id) {
1861 Solvable *s = $self->pool->solvables + $self->id;
1862 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1864 void add_conflicts(Dep *dep) {
1865 Solvable *s = $self->pool->solvables + $self->id;
1866 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1868 void add_conflictsid(Id id) {
1869 Solvable *s = $self->pool->solvables + $self->id;
1870 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1872 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1873 Solvable *s = $self->pool->solvables + $self->id;
1874 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1876 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1877 Solvable *s = $self->pool->solvables + $self->id;
1878 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1880 void add_recommends(Dep *dep) {
1881 Solvable *s = $self->pool->solvables + $self->id;
1882 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1884 void add_recommendsid(Id id) {
1885 Solvable *s = $self->pool->solvables + $self->id;
1886 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1888 void add_suggests(Dep *dep) {
1889 Solvable *s = $self->pool->solvables + $self->id;
1890 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1892 void add_suggestsid(Id id) {
1893 Solvable *s = $self->pool->solvables + $self->id;
1894 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1896 void add_supplements(Dep *dep) {
1897 Solvable *s = $self->pool->solvables + $self->id;
1898 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1900 void add_supplementsid(Id id) {
1901 Solvable *s = $self->pool->solvables + $self->id;
1902 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1904 void add_enhances(Dep *dep) {
1905 Solvable *s = $self->pool->solvables + $self->id;
1906 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
1908 void add_enhancesid(Id id) {
1909 Solvable *s = $self->pool->solvables + $self->id;
1910 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
1913 bool __eq__(XSolvable *s) {
1914 return $self->pool == s->pool && $self->id == s->id;
1916 bool __ne__(XSolvable *s) {
1917 return !XSolvable___eq__($self, s);
1919 #if defined(SWIGPERL)
1920 %rename("str") __str__;
1922 const char *__str__() {
1923 return pool_solvid2str($self->pool, $self->id);
1925 %newobject __repr__;
1926 const char *__repr__() {
1928 sprintf(buf, "<Solvable #%d ", $self->id);
1929 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1934 Problem(Solver *solv, Id id) {
1936 p = solv_calloc(1, sizeof(*p));
1941 %newobject findproblemrule;
1942 XRule *findproblemrule() {
1943 Id r = solver_findproblemrule($self->solv, $self->id);
1944 return new_XRule($self->solv, r);
1946 %newobject findallproblemrules;
1947 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1948 Queue findallproblemrules(int unfiltered=0) {
1949 Solver *solv = $self->solv;
1954 solver_findallproblemrules(solv, $self->id, &q);
1957 for (i = j = 0; i < q.count; i++)
1959 SolverRuleinfo rclass;
1960 probr = q.elements[i];
1961 rclass = solver_ruleclass(solv, probr);
1962 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1964 q.elements[j++] = probr;
1967 queue_truncate(&q, j);
1971 int solution_count() {
1972 return solver_solution_count($self->solv, $self->id);
1974 %newobject solutions;
1975 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1980 cnt = solver_solution_count($self->solv, $self->id);
1981 for (i = 1; i <= cnt; i++)
1988 Solution(Problem *p, Id id) {
1990 s = solv_calloc(1, sizeof(*s));
1992 s->problemid = p->id;
1996 int element_count() {
1997 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2000 %newobject elements;
2001 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2002 Queue elements(bool expandreplaces=0) {
2006 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2007 for (i = 1; i <= cnt; i++)
2010 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2012 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2018 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2019 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2021 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2022 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2023 queue_push2(&q, p, rp);
2025 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2026 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2027 queue_push2(&q, p, rp);
2029 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2030 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2031 queue_push2(&q, p, rp);
2036 queue_push2(&q, i, type);
2037 queue_push2(&q, p, rp);
2043 %extend Solutionelement {
2044 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2046 e = solv_calloc(1, sizeof(*e));
2048 e->problemid = problemid;
2059 if (p == SOLVER_SOLUTION_ERASE)
2064 else if (p == SOLVER_SOLUTION_REPLACE)
2069 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2070 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);
2071 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2072 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);
2073 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2074 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);
2075 return solver_solutionelement2str($self->solv, p, rp);
2077 %newobject replaceelements;
2078 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2079 Queue replaceelements() {
2084 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2087 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2088 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2089 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2090 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2091 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2092 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2093 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2095 queue_push(&q, $self->type);
2098 int illegalreplace() {
2099 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2101 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2103 %newobject solvable;
2104 XSolvable * const solvable;
2105 %newobject replacement;
2106 XSolvable * const replacement;
2109 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2110 return new_XSolvable(e->solv->pool, e->p);
2112 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2113 return new_XSolvable(e->solv->pool, e->rp);
2115 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2116 if (e->type != SOLVER_SOLUTION_JOB)
2118 return (e->p - 1) / 2;
2123 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2124 if ($self->type == SOLVER_SOLUTION_JOB)
2125 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2126 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2127 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2128 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2129 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2130 if ($self->type == SOLVER_SOLUTION_ERASE)
2131 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2137 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2138 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2139 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2140 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2141 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2142 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2143 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2144 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2145 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2146 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2147 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2148 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2149 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2150 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2151 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2152 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2153 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2154 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2155 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2157 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2158 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2159 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2160 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2161 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2162 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2163 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2164 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2166 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2167 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2168 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2170 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2171 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2172 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2173 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2174 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2175 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2176 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2177 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2178 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2184 int set_flag(int flag, int value) {
2185 return solver_set_flag($self, flag, value);
2187 int get_flag(int flag) {
2188 return solver_get_flag($self, flag);
2190 #if defined(SWIGPYTHON)
2192 def solve(self, jobs):
2194 for job in jobs: j += [job.how, job.what]
2195 return self.solve_helper(j)
2198 #if defined(SWIGPERL)
2200 sub solv::Solver::solve {
2201 my ($self, $jobs) = @_;
2202 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2203 return $self->solve_helper(\@j);
2207 #if defined(SWIGRUBY)
2210 "class Solv::Solver\n"
2211 " def solve(jobs)\n"
2213 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2214 " solve_helper(jl)\n"
2220 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2221 %newobject solve_helper;
2222 Queue solve_helper(Queue jobs) {
2226 solver_solve($self, &jobs);
2227 cnt = solver_problem_count($self);
2228 for (i = 1; i <= cnt; i++)
2232 %newobject transaction;
2233 Transaction *transaction() {
2234 return solver_create_transaction($self);
2238 %extend Transaction {
2239 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2240 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2241 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2242 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2243 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2244 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2245 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2246 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2247 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2248 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2249 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2250 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2251 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2252 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2253 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2254 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2255 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2256 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2257 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2258 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2259 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2260 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2261 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2262 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2263 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2264 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2265 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2267 transaction_free($self);
2270 %rename("isempty?") isempty;
2273 return $self->steps.count == 0;
2276 %newobject othersolvable;
2277 XSolvable *othersolvable(XSolvable *s) {
2278 Id op = transaction_obs_pkg($self, s->id);
2279 return new_XSolvable($self->pool, op);
2282 %newobject allothersolvables;
2283 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2284 Queue allothersolvables(XSolvable *s) {
2287 transaction_all_obs_pkgs($self, s->id, &q);
2291 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2292 %newobject classify;
2293 Queue classify(int mode = 0) {
2296 transaction_classify($self, mode, &q);
2300 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2301 %newobject newpackages;
2302 Queue newpackages() {
2306 cut = transaction_installedresult(self, &q);
2307 queue_truncate(&q, cut);
2311 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2312 %newobject keptpackages;
2313 Queue keptpackages() {
2317 cut = transaction_installedresult(self, &q);
2319 queue_deleten(&q, 0, cut);
2323 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2327 queue_init_clone(&q, &$self->steps);
2331 int steptype(XSolvable *s, int mode) {
2332 return transaction_type($self, s->id, mode);
2334 int calc_installsizechange() {
2335 return transaction_calc_installsizechange($self);
2337 void order(int flags) {
2338 transaction_order($self, flags);
2342 %extend TransactionClass {
2343 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2344 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2345 cl->transaction = trans;
2349 cl->fromid = fromid;
2353 %newobject solvables;
2354 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2358 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2364 XRule(Solver *solv, Id id) {
2367 XRule *xr = solv_calloc(1, sizeof(*xr));
2373 Id type, source, target, dep;
2374 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2375 return new_Ruleinfo($self, type, source, target, dep);
2377 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2378 %newobject allinfos;
2382 solver_allruleinfos($self->solv, $self->id, &q);
2386 bool __eq__(XRule *xr) {
2387 return $self->solv == xr->solv && $self->id == xr->id;
2389 bool __ne__(XRule *xr) {
2390 return !XRule___eq__($self, xr);
2392 %newobject __repr__;
2393 const char *__repr__() {
2395 sprintf(buf, "<Rule #%d>", $self->id);
2396 return solv_strdup(buf);
2401 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2402 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2406 ri->source = source;
2407 ri->target = target;
2411 XSolvable * const solvable;
2412 XSolvable * const othersolvable;
2414 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2415 return new_XSolvable(ri->solv->pool, ri->source);
2417 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2418 return new_XSolvable(ri->solv->pool, ri->target);
2421 const char *problemstr() {
2422 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2427 XRepodata(Repo *repo, Id id) {
2428 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2434 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2436 void set_id(Id solvid, Id keyname, Id id) {
2437 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2439 void set_str(Id solvid, Id keyname, const char *str) {
2440 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2442 void set_poolstr(Id solvid, Id keyname, const char *str) {
2443 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2445 void add_idarray(Id solvid, Id keyname, Id id) {
2446 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2448 void add_flexarray(Id solvid, Id keyname, Id handle) {
2449 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2451 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2452 const unsigned char *buf = solv_chksum_get(chksum, 0);
2454 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2456 const char *lookup_str(Id solvid, Id keyname) {
2457 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2459 Queue lookup_idarray(Id solvid, Id keyname) {
2462 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2465 %newobject lookup_checksum;
2466 Chksum *lookup_checksum(Id solvid, Id keyname) {
2468 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2469 return solv_chksum_create_from_bin(type, b);
2471 void internalize() {
2472 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2474 void create_stubs() {
2475 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2477 void write(FILE *fp) {
2478 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2480 bool add_solv(FILE *fp, int flags = 0) {
2481 Repodata *data = repo_id2repodata($self->repo, $self->id);
2482 int r, oldstate = data->state;
2483 data->state = REPODATA_LOADING;
2484 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2485 if (r || data->state == REPODATA_LOADING)
2486 data->state = oldstate;
2489 void extend_to_repo() {
2490 Repodata *data = repo_id2repodata($self->repo, $self->id);
2491 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2493 bool __eq__(XRepodata *xr) {
2494 return $self->repo == xr->repo && $self->id == xr->id;
2496 bool __ne__(XRepodata *xr) {
2497 return !XRepodata___eq__($self, xr);
2499 %newobject __repr__;
2500 const char *__repr__() {
2502 sprintf(buf, "<Repodata #%d>", $self->id);
2503 return solv_strdup(buf);