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>
341 #include "poolarch.h"
344 #include "solverdebug.h"
345 #include "repo_solv.h"
348 #include "repo_write.h"
350 #include "repo_rpmdb.h"
353 #include "repo_deb.h"
356 #include "repo_rpmmd.h"
357 #include "repo_updateinfoxml.h"
358 #include "repo_deltainfoxml.h"
359 #include "repo_repomdxml.h"
361 #ifdef ENABLE_SUSEREPO
362 #include "repo_products.h"
363 #include "repo_susetags.h"
364 #include "repo_content.h"
366 #ifdef ENABLE_MDKREPO
367 #include "repo_mdk.h"
369 #ifdef ENABLE_ARCHREPO
370 #include "repo_arch.h"
372 #include "solv_xfopen.h"
374 /* for old ruby versions */
376 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
379 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
382 #define SOLVER_SOLUTION_ERASE -100
383 #define SOLVER_SOLUTION_REPLACE -101
384 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
385 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
386 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
388 typedef struct chksum Chksum;
389 typedef void *AppObjectPtr;
414 } Pool_solvable_iterator;
419 } Pool_repo_iterator;
424 } Repo_solvable_iterator;
464 Transaction *transaction;
472 typedef Dataiterator Datamatch;
477 %mixin Dataiterator "Enumerable";
478 %mixin Pool_solvable_iterator "Enumerable";
479 %mixin Pool_repo_iterator "Enumerable";
480 %mixin Repo_solvable_iterator "Enumerable";
488 %constant Id SOLVID_META;
489 %constant Id SOLVID_POS;
491 %constant int REL_EQ;
492 %constant int REL_GT;
493 %constant int REL_LT;
494 %constant int REL_ARCH;
522 # put before pool/repo so we can access the constructor
523 %nodefaultdtor Dataiterator;
524 typedef struct {} Dataiterator;
525 typedef struct {} Pool_solvable_iterator;
526 typedef struct {} Pool_repo_iterator;
527 typedef struct {} Repo_solvable_iterator;
529 %nodefaultctor Datamatch;
530 %nodefaultdtor Datamatch;
537 %nodefaultctor Datapos;
551 AppObjectPtr appdata;
558 const char * const name;
561 int const nsolvables;
562 AppObjectPtr appdata;
565 %nodefaultctor Solver;
566 %nodefaultdtor Solver;
574 %rename(xfopen) solv_xfopen;
575 %rename(xfopen_fd) solv_xfopen_fd;
576 %rename(xfopen_dup) solv_xfopen_dup;
577 %rename(xfclose) solv_xfclose;
578 %rename(xfileno) solv_xfileno;
580 FILE *solv_xfopen(const char *fn, const char *mode = 0);
581 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
582 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
583 int solv_xfclose(FILE *fp);
584 int solv_xfileno(FILE *fp);
587 SWIGINTERN int solv_xfclose(FILE *fp) {
590 SWIGINTERN int solv_xfileno(FILE *fp) {
593 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
595 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
618 %nodefaultctor Transaction;
619 %nodefaultdtor Transaction;
625 Transaction * const transaction;
634 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
635 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
636 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
637 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
638 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
639 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
640 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
641 static const Id SOLVER_NOOP = SOLVER_NOOP;
642 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
643 static const Id SOLVER_ERASE = SOLVER_ERASE;
644 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
645 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
646 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
647 static const Id SOLVER_LOCK = SOLVER_LOCK;
648 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
649 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
650 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
651 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
652 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
653 static const Id SOLVER_WEAK = SOLVER_WEAK;
654 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
655 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
656 static const Id SOLVER_SETEV = SOLVER_SETEV;
657 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
658 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
659 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
660 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
661 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
662 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
664 Job(Pool *pool, int how, Id what) {
665 Job *job = solv_calloc(1, sizeof(*job));
672 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
673 %newobject solvables;
675 Pool *pool = $self->pool;
679 how = $self->how & SOLVER_SELECTMASK;
680 FOR_JOB_SELECT(p, pp, how, $self->what)
685 bool __eq__(Job *j) {
686 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
688 bool __ne__(Job *j) {
689 return !Job___eq__($self, j);
691 #if defined(SWIGPERL)
692 %rename("str") __str__;
694 const char *__str__() {
695 return pool_job2str($self->pool, $self->how, $self->what, 0);
697 const char *__repr__() {
698 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
699 return pool_tmpjoin($self->pool, "<Job ", str, ">");
705 return (Chksum *)solv_chksum_create(type);
707 Chksum(Id type, const char *hex) {
708 unsigned char buf[64];
709 int l = solv_chksum_len(type);
712 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
714 return (Chksum *)solv_chksum_create_from_bin(type, buf);
717 solv_chksum_free($self, 0);
721 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
722 return solv_chksum_get_type(chksum);
725 void add(const char *str) {
726 solv_chksum_add($self, str, strlen((char *)str));
728 void add_fp(FILE *fp) {
731 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
732 solv_chksum_add($self, buf, l);
733 rewind(fp); /* convenience */
735 void add_fd(int fd) {
738 while ((l = read(fd, buf, sizeof(buf))) > 0)
739 solv_chksum_add($self, buf, l);
740 lseek(fd, 0, 0); /* convenience */
742 void add_stat(const char *filename) {
744 if (stat(filename, &stb))
745 memset(&stb, 0, sizeof(stb));
746 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
747 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
748 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
749 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
753 const unsigned char *b;
754 b = solv_chksum_get($self, &l);
755 return cdata_void((void *)b, l);
760 const unsigned char *b;
763 b = solv_chksum_get($self, &l);
764 ret = solv_malloc(2 * l + 1);
765 solv_bin2hex(b, l, ret);
769 bool __eq__(Chksum *chk) {
771 const unsigned char *b, *bo;
774 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
776 b = solv_chksum_get($self, &l);
777 bo = solv_chksum_get(chk, 0);
778 return memcmp(b, bo, l) == 0;
780 bool __ne__(Chksum *chk) {
781 return !Chksum___eq__($self, chk);
783 #if defined(SWIGRUBY)
784 %rename("to_s") __str__;
785 %rename("inspect") __repr__;
787 #if defined(SWIGPERL)
788 %rename("str") __str__;
791 const char *__str__() {
794 if (solv_chksum_isfinished($self))
795 h = Chksum_hex($self);
796 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
797 solv_free((void *)h);
801 const char *__repr__() {
802 const char *h = Chksum___str__($self);
803 const char *str = solv_dupjoin("<Chksum ", h, ">");
804 solv_free((void *)h);
811 Pool *pool = pool_create();
816 void set_debuglevel(int level) {
817 pool_setdebuglevel($self, level);
819 int set_flag(int flag, int value) {
820 return pool_set_flag($self, flag, value);
822 int get_flag(int flag) {
823 return pool_get_flag($self, flag);
825 #if defined(SWIGPYTHON)
827 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
828 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
829 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
830 PyObject *result = PyEval_CallObject((PyObject *)d, args);
835 return 0; /* exception */
836 ecode = SWIG_AsVal_int(result, &vresult);
838 return SWIG_IsOK(ecode) ? vresult : 0;
841 void set_loadcallback(PyObject *callable) {
842 if ($self->loadcallback == loadcallback) {
843 PyObject *obj = $self->loadcallbackdata;
849 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
852 #if defined(SWIGPERL)
854 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
858 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
863 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
865 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
875 void set_loadcallback(SV *callable) {
876 if ($self->loadcallback == loadcallback)
877 SvREFCNT_dec($self->loadcallbackdata);
879 SvREFCNT_inc(callable);
880 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
884 #if defined(SWIGRUBY)
886 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
887 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
888 VALUE callable = (VALUE)d;
889 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
890 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
893 SWIGINTERN void mark_Pool(void *ptr) {
895 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
896 VALUE callable = (VALUE)pool->loadcallbackdata;
897 rb_gc_mark(callable);
901 %typemap(in, numinputs=0) VALUE callable {
902 $1 = rb_block_given_p() ? rb_block_proc() : 0;
904 void set_loadcallback(VALUE callable) {
905 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
910 Pool_set_loadcallback($self, 0);
913 Id str2id(const char *str, bool create=1) {
914 return pool_str2id($self, str, create);
916 Dep *Dep(const char *str, bool create=1) {
917 Id id = pool_str2id($self, str, create);
918 return new_Dep($self, id);
920 const char *id2str(Id id) {
921 return pool_id2str($self, id);
923 const char *dep2str(Id id) {
924 return pool_dep2str($self, id);
926 Id rel2id(Id name, Id evr, int flags, bool create=1) {
927 return pool_rel2id($self, name, evr, flags, create);
929 Id id2langid(Id id, const char *lang, bool create=1) {
930 return pool_id2langid($self, id, lang, create);
932 void setarch(const char *arch) {
933 pool_setarch($self, arch);
935 Repo *add_repo(const char *name) {
936 return repo_create($self, name);
938 const char *lookup_str(Id entry, Id keyname) {
939 return pool_lookup_str($self, entry, keyname);
941 Id lookup_id(Id entry, Id keyname) {
942 return pool_lookup_id($self, entry, keyname);
944 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
945 return pool_lookup_num($self, entry, keyname, notfound);
947 bool lookup_void(Id entry, Id keyname) {
948 return pool_lookup_void($self, entry, keyname);
950 %newobject lookup_checksum;
951 Chksum *lookup_checksum(Id entry, Id keyname) {
953 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
954 return solv_chksum_create_from_bin(type, b);
957 %newobject Dataiterator;
958 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
959 return new_Dataiterator($self, 0, p, key, match, flags);
961 const char *solvid2str(Id solvid) {
962 return pool_solvid2str($self, solvid);
964 void addfileprovides() {
965 pool_addfileprovides($self);
967 Queue addfileprovides_queue() {
970 pool_addfileprovides_queue($self, &r, 0);
973 void createwhatprovides() {
974 pool_createwhatprovides($self);
977 XSolvable *id2solvable(Id id) {
978 return new_XSolvable($self, id);
980 %newobject solvables;
981 Pool_solvable_iterator * const solvables;
983 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
984 return new_Pool_solvable_iterator(pool);
987 %newobject solvables_iter;
988 Pool_solvable_iterator * solvables_iter() {
989 return new_Pool_solvable_iterator($self);
992 Repo *id2repo(Id id) {
993 if (id < 1 || id >= $self->nrepos)
995 return pool_id2repo($self, id);
998 Pool_repo_iterator * const repos;
1000 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1001 return new_Pool_repo_iterator(pool);
1004 %newobject repos_iter;
1005 Pool_repo_iterator * repos_iter() {
1006 return new_Pool_repo_iterator($self);
1011 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1012 pool_set_installed(pool, installed);
1014 Repo *Pool_installed_get(Pool *pool) {
1015 return pool->installed;
1019 Queue matchprovidingids(const char *match, int flags) {
1025 for (id = 1; id < pool->ss.nstrings; id++)
1026 if (pool->whatprovides[id])
1030 if (!datamatcher_init(&ma, match, flags)) {
1031 for (id = 1; id < pool->ss.nstrings; id++)
1032 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1034 datamatcher_free(&ma);
1040 Job *Job(int how, Id what) {
1041 return new_Job($self, how, what);
1044 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1045 %newobject whatprovides;
1046 Queue whatprovides(Id dep) {
1051 FOR_PROVIDES(p, pp, dep)
1056 Id towhatprovides(Queue q) {
1057 return pool_queuetowhatprovides($self, &q);
1061 %rename("isknownarch?") isknownarch;
1063 bool isknownarch(Id id) {
1065 if (!id || id == ID_EMPTY)
1067 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1069 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1076 return solver_create($self);
1081 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1082 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1083 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1084 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1085 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1086 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1087 #ifdef ENABLE_SUSEREPO
1088 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1091 void free(bool reuseids = 0) {
1092 repo_free($self, reuseids);
1094 void empty(bool reuseids = 0) {
1095 repo_empty($self, reuseids);
1098 %rename("isempty?") isempty;
1101 return !$self->nsolvables;
1103 bool add_solv(const char *name, int flags = 0) {
1104 FILE *fp = fopen(name, "r");
1108 r = repo_add_solv($self, fp, flags);
1112 bool add_solv(FILE *fp, int flags = 0) {
1113 return repo_add_solv($self, fp, flags) == 0;
1116 XSolvable *add_solvable() {
1117 Id solvid = repo_add_solvable($self);
1118 return new_XSolvable($self->pool, solvid);
1122 bool add_rpmdb(Repo *ref, int flags = 0) {
1123 repo_add_rpmdb($self, ref, 0, flags);
1126 Id add_rpm(const char *name, int flags = 0) {
1127 return repo_add_rpm($self, name, flags);
1131 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1132 repo_add_rpmmd($self, fp, language, flags);
1135 bool add_repomdxml(FILE *fp, int flags = 0) {
1136 repo_add_repomdxml($self, fp, flags);
1139 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1140 repo_add_updateinfoxml($self, fp, flags);
1143 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1144 repo_add_deltainfoxml($self, fp, flags);
1148 #ifdef ENABLE_DEBIAN
1149 bool add_debdb(int flags = 0) {
1150 repo_add_debdb($self, 0, flags);
1153 Id add_deb(const char *name, int flags = 0) {
1154 return repo_add_deb($self, name, flags);
1157 #ifdef ENABLE_SUSEREPO
1158 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1159 repo_add_susetags($self, fp, defvendor, language, flags);
1162 bool add_content(FILE *fp, int flags = 0) {
1163 repo_add_content($self, fp, flags);
1166 bool add_products(const char *proddir, int flags = 0) {
1167 repo_add_products($self, proddir, 0, flags);
1171 #ifdef ENABLE_MDKREPO
1172 bool add_mdk(FILE *fp, int flags = 0) {
1173 repo_add_mdk($self, fp, flags);
1176 bool add_mdk_info(FILE *fp, int flags = 0) {
1177 repo_add_mdk($self, fp, flags);
1181 #ifdef ENABLE_ARCHREPO
1182 bool add_arch_repo(FILE *fp, int flags = 0) {
1183 repo_add_arch_repo($self, fp, flags);
1186 Id add_arch_pkg(const char *name, int flags = 0) {
1187 return repo_add_arch_pkg($self, name, flags);
1190 void internalize() {
1191 repo_internalize($self);
1193 const char *lookup_str(Id entry, Id keyname) {
1194 return repo_lookup_str($self, entry, keyname);
1196 Id lookup_id(Id entry, Id keyname) {
1197 return repo_lookup_id($self, entry, keyname);
1199 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1200 return repo_lookup_num($self, entry, keyname, notfound);
1202 void write(FILE *fp) {
1203 repo_write($self, fp);
1205 # HACK, remove if no longer needed!
1206 bool write_first_repodata(FILE *fp) {
1207 int oldnrepodata = $self->nrepodata;
1208 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1209 repo_write($self, fp);
1210 $self->nrepodata = oldnrepodata;
1214 %newobject Dataiterator;
1215 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1216 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1221 SWIGINTERN Id Repo_id_get(Repo *repo) {
1222 return repo->repoid;
1225 Repo_solvable_iterator * const solvables;
1227 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1228 return new_Repo_solvable_iterator(repo);
1231 %newobject solvables_iter;
1232 Repo_solvable_iterator *solvables_iter() {
1233 return new_Repo_solvable_iterator($self);
1236 XRepodata *add_repodata(int flags = 0) {
1237 Repodata *rd = repo_add_repodata($self, flags);
1238 return new_XRepodata($self, rd->repodataid);
1241 void create_stubs() {
1243 if (!$self->nrepodata)
1245 data = repo_id2repodata($self, $self->nrepodata - 1);
1246 if (data->state != REPODATA_STUB)
1247 repodata_create_stubs(data);
1250 %rename("iscontiguous?") iscontiguous;
1252 bool iscontiguous() {
1254 for (i = $self->start; i < $self->end; i++)
1255 if ($self->pool->solvables[i].repo != $self)
1259 XRepodata *first_repodata() {
1262 if ($self->nrepodata < 2)
1264 /* make sure all repodatas but the first are extensions */
1265 data = repo_id2repodata($self, 1);
1266 if (data->loadcallback)
1268 for (i = 2; i < $self->nrepodata; i++)
1270 data = repo_id2repodata($self, i);
1271 if (!data->loadcallback)
1272 return 0; /* oops, not an extension */
1274 return new_XRepodata($self, 1);
1277 bool __eq__(Repo *repo) {
1278 return $self == repo;
1280 bool __ne__(Repo *repo) {
1281 return $self != repo;
1283 #if defined(SWIGPERL)
1284 %rename("str") __str__;
1287 const char *__str__() {
1290 return solv_strdup($self->name);
1291 sprintf(buf, "Repo#%d", $self->repoid);
1292 return solv_strdup(buf);
1294 %newobject __repr__;
1295 const char *__repr__() {
1299 sprintf(buf, "<Repo #%d ", $self->repoid);
1300 return solv_dupjoin(buf, $self->name, ">");
1302 sprintf(buf, "<Repo #%d>", $self->repoid);
1303 return solv_strdup(buf);
1307 %extend Dataiterator {
1308 static const int SEARCH_STRING = SEARCH_STRING;
1309 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1310 static const int SEARCH_GLOB = SEARCH_GLOB;
1311 static const int SEARCH_REGEX = SEARCH_REGEX;
1312 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1313 static const int SEARCH_FILES = SEARCH_FILES;
1314 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1316 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1317 Dataiterator *di = solv_calloc(1, sizeof(*di));
1318 dataiterator_init(di, pool, repo, p, key, match, flags);
1322 dataiterator_free($self);
1325 #if defined(SWIGPYTHON)
1326 %newobject __iter__;
1327 Dataiterator *__iter__() {
1329 ndi = solv_calloc(1, sizeof(*ndi));
1330 dataiterator_init_clone(ndi, $self);
1333 %rename("next") __next__();
1334 %exception __next__ {
1337 PyErr_SetString(PyExc_StopIteration,"no more matches");
1344 perliter(solv::Dataiterator)
1347 %newobject __next__;
1348 Datamatch *__next__() {
1350 if (!dataiterator_step($self)) {
1353 ndi = solv_calloc(1, sizeof(*ndi));
1354 dataiterator_init_clone(ndi, $self);
1360 while ((d = Dataiterator___next__($self)) != 0) {
1361 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1365 void prepend_keyname(Id key) {
1366 dataiterator_prepend_keyname($self, key);
1368 void skip_solvable() {
1369 dataiterator_skip_solvable($self);
1374 Id lookup_id(Id keyname) {
1375 Pool *pool = $self->repo->pool;
1376 Datapos oldpos = pool->pos;
1379 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1383 const char *lookup_str(Id keyname) {
1384 Pool *pool = $self->repo->pool;
1385 Datapos oldpos = pool->pos;
1388 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1392 %newobject lookup_checksum;
1393 Chksum *lookup_checksum(Id keyname) {
1394 Pool *pool = $self->repo->pool;
1395 Datapos oldpos = pool->pos;
1397 const unsigned char *b;
1399 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1401 return solv_chksum_create_from_bin(type, b);
1407 dataiterator_free($self);
1410 %newobject solvable;
1411 XSolvable * const solvable;
1413 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1414 return new_XSolvable(di->pool, di->solvid);
1418 return $self->key->name;
1420 const char *key_idstr() {
1421 return pool_id2str($self->pool, $self->key->name);
1424 return $self->key->type;
1426 const char *type_idstr() {
1427 return pool_id2str($self->pool, $self->key->type);
1430 return $self->kv.id;
1432 const char *idstr() {
1433 return pool_id2str($self->pool, $self->kv.id);
1436 return $self->kv.str;
1439 return $self->kv.num;
1442 return $self->kv.num2;
1446 Pool *pool = $self->pool;
1447 Datapos *pos, oldpos = pool->pos;
1448 dataiterator_setpos($self);
1449 pos = solv_calloc(1, sizeof(*pos));
1454 %newobject parentpos;
1455 Datapos *parentpos() {
1456 Pool *pool = $self->pool;
1457 Datapos *pos, oldpos = pool->pos;
1458 dataiterator_setpos_parent($self);
1459 pos = solv_calloc(1, sizeof(*pos));
1465 dataiterator_setpos($self);
1467 void setpos_parent() {
1468 dataiterator_setpos_parent($self);
1472 %extend Pool_solvable_iterator {
1473 Pool_solvable_iterator(Pool *pool) {
1474 Pool_solvable_iterator *s;
1475 s = solv_calloc(1, sizeof(*s));
1479 #if defined(SWIGPYTHON)
1480 %newobject __iter__;
1481 Pool_solvable_iterator *__iter__() {
1482 Pool_solvable_iterator *s;
1483 s = solv_calloc(1, sizeof(*s));
1487 %rename("next") __next__();
1488 %exception __next__ {
1491 PyErr_SetString(PyExc_StopIteration,"no more matches");
1498 perliter(solv::Pool_solvable_iterator)
1500 %newobject __next__;
1501 XSolvable *__next__() {
1502 Pool *pool = $self->pool;
1503 if ($self->id >= pool->nsolvables)
1505 while (++$self->id < pool->nsolvables)
1506 if (pool->solvables[$self->id].repo)
1507 return new_XSolvable(pool, $self->id);
1513 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1514 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1518 %newobject __getitem__;
1519 XSolvable *__getitem__(Id key) {
1520 Pool *pool = $self->pool;
1521 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1522 return new_XSolvable(pool, key);
1526 return $self->pool->nsolvables;
1530 %extend Pool_repo_iterator {
1531 Pool_repo_iterator(Pool *pool) {
1532 Pool_repo_iterator *s;
1533 s = solv_calloc(1, sizeof(*s));
1537 #if defined(SWIGPYTHON)
1538 %newobject __iter__;
1539 Pool_repo_iterator *__iter__() {
1540 Pool_repo_iterator *s;
1541 s = solv_calloc(1, sizeof(*s));
1545 %rename("next") __next__();
1546 %exception __next__ {
1549 PyErr_SetString(PyExc_StopIteration,"no more matches");
1554 %newobject __next__;
1556 Pool *pool = $self->pool;
1557 if ($self->id >= pool->nrepos)
1559 while (++$self->id < pool->nrepos) {
1560 Repo *r = pool_id2repo(pool, $self->id);
1569 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1570 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1574 Repo *__getitem__(Id key) {
1575 Pool *pool = $self->pool;
1576 if (key > 0 && key < pool->nrepos)
1577 return pool_id2repo(pool, key);
1581 return $self->pool->nrepos;
1585 %extend Repo_solvable_iterator {
1586 Repo_solvable_iterator(Repo *repo) {
1587 Repo_solvable_iterator *s;
1588 s = solv_calloc(1, sizeof(*s));
1592 #if defined(SWIGPYTHON)
1593 %newobject __iter__;
1594 Repo_solvable_iterator *__iter__() {
1595 Repo_solvable_iterator *s;
1596 s = solv_calloc(1, sizeof(*s));
1600 %rename("next") __next__();
1601 %exception __next__ {
1604 PyErr_SetString(PyExc_StopIteration,"no more matches");
1609 %newobject __next__;
1610 XSolvable *__next__() {
1611 Repo *repo = $self->repo;
1612 Pool *pool = repo->pool;
1613 if (repo->start > 0 && $self->id < repo->start)
1614 $self->id = repo->start - 1;
1615 if ($self->id >= repo->end)
1617 while (++$self->id < repo->end)
1618 if (pool->solvables[$self->id].repo == repo)
1619 return new_XSolvable(pool, $self->id);
1625 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1626 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1630 %newobject __getitem__;
1631 XSolvable *__getitem__(Id key) {
1632 Repo *repo = $self->repo;
1633 Pool *pool = repo->pool;
1634 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1635 return new_XSolvable(pool, key);
1639 return $self->repo->pool->nsolvables;
1644 Dep(Pool *pool, Id id) {
1648 s = solv_calloc(1, sizeof(*s));
1654 return pool_dep2str($self->pool, $self->id);
1656 bool __eq__(Dep *s) {
1657 return $self->pool == s->pool && $self->id == s->id;
1659 bool __ne__(Dep *s) {
1660 return !Dep___eq__($self, s);
1662 #if defined(SWIGPERL)
1663 %rename("str") __str__;
1665 const char *__str__() {
1666 return pool_dep2str($self->pool, $self->id);
1668 %newobject __repr__;
1669 const char *__repr__() {
1671 sprintf(buf, "<Id #%d ", $self->id);
1672 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1677 XSolvable(Pool *pool, Id id) {
1679 if (!id || id >= pool->nsolvables)
1681 s = solv_calloc(1, sizeof(*s));
1687 return pool_solvid2str($self->pool, $self->id);
1689 const char *lookup_str(Id keyname) {
1690 return pool_lookup_str($self->pool, $self->id, keyname);
1692 Id lookup_id(Id keyname) {
1693 return pool_lookup_id($self->pool, $self->id, keyname);
1695 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1696 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1698 bool lookup_void(Id keyname) {
1699 return pool_lookup_void($self->pool, $self->id, keyname);
1701 %newobject lookup_checksum;
1702 Chksum *lookup_checksum(Id keyname) {
1704 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1705 return solv_chksum_create_from_bin(type, b);
1707 Queue lookup_idarray(Id keyname, Id marker = 1) {
1708 Solvable *s = $self->pool->solvables + $self->id;
1712 if (keyname == SOLVABLE_PROVIDES)
1713 marker = -SOLVABLE_FILEMARKER;
1714 else if (keyname == SOLVABLE_REQUIRES)
1715 marker = -SOLVABLE_PREREQMARKER;
1719 solvable_lookup_deparray(s, keyname, &r, marker);
1722 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1723 %newobject lookup_deparray;
1724 Queue lookup_deparray(Id keyname, Id marker = 1) {
1725 Solvable *s = $self->pool->solvables + $self->id;
1729 if (keyname == SOLVABLE_PROVIDES)
1730 marker = -SOLVABLE_FILEMARKER;
1731 else if (keyname == SOLVABLE_REQUIRES)
1732 marker = -SOLVABLE_PREREQMARKER;
1736 solvable_lookup_deparray(s, keyname, &r, marker);
1739 const char *lookup_location(unsigned int *OUTPUT) {
1740 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1743 %rename("installable?") installable;
1745 bool installable() {
1746 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1749 %rename("isinstalled?") isinstalled;
1751 bool isinstalled() {
1752 Pool *pool = $self->pool;
1753 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1758 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1759 Pool *pool = xs->pool;
1760 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1762 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1763 Pool *pool = xs->pool;
1764 return pool_id2str(pool, pool->solvables[xs->id].name);
1769 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1770 xs->pool->solvables[xs->id].name = nameid;
1772 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1773 return xs->pool->solvables[xs->id].name;
1778 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1779 Pool *pool = xs->pool;
1780 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1782 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1783 Pool *pool = xs->pool;
1784 return pool_id2str(pool, pool->solvables[xs->id].evr);
1789 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1790 xs->pool->solvables[xs->id].evr = evrid;
1792 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1793 return xs->pool->solvables[xs->id].evr;
1798 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1799 Pool *pool = xs->pool;
1800 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1802 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1803 Pool *pool = xs->pool;
1804 return pool_id2str(pool, pool->solvables[xs->id].arch);
1809 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1810 xs->pool->solvables[xs->id].arch = archid;
1812 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1813 return xs->pool->solvables[xs->id].arch;
1818 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1819 Pool *pool = xs->pool;
1820 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1822 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1823 Pool *pool = xs->pool;
1824 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1829 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1830 xs->pool->solvables[xs->id].vendor = vendorid;
1832 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1833 return xs->pool->solvables[xs->id].vendor;
1838 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1839 return xs->pool->solvables[xs->id].repo;
1843 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1844 Solvable *s = $self->pool->solvables + $self->id;
1845 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1847 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1848 Solvable *s = $self->pool->solvables + $self->id;
1849 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1851 void add_obsoletes(Dep *dep) {
1852 Solvable *s = $self->pool->solvables + $self->id;
1853 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1855 void add_obsoletesid(Id id) {
1856 Solvable *s = $self->pool->solvables + $self->id;
1857 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1859 void add_conflicts(Dep *dep) {
1860 Solvable *s = $self->pool->solvables + $self->id;
1861 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1863 void add_conflictsid(Id id) {
1864 Solvable *s = $self->pool->solvables + $self->id;
1865 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1867 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1868 Solvable *s = $self->pool->solvables + $self->id;
1869 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1871 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1872 Solvable *s = $self->pool->solvables + $self->id;
1873 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1875 void add_recommends(Dep *dep) {
1876 Solvable *s = $self->pool->solvables + $self->id;
1877 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1879 void add_recommendsid(Id id) {
1880 Solvable *s = $self->pool->solvables + $self->id;
1881 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1883 void add_suggests(Dep *dep) {
1884 Solvable *s = $self->pool->solvables + $self->id;
1885 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1887 void add_suggestsid(Id id) {
1888 Solvable *s = $self->pool->solvables + $self->id;
1889 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1891 void add_supplements(Dep *dep) {
1892 Solvable *s = $self->pool->solvables + $self->id;
1893 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1895 void add_supplementsid(Id id) {
1896 Solvable *s = $self->pool->solvables + $self->id;
1897 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1899 void add_enhances(Dep *dep) {
1900 Solvable *s = $self->pool->solvables + $self->id;
1901 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
1903 void add_enhancesid(Id id) {
1904 Solvable *s = $self->pool->solvables + $self->id;
1905 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
1908 bool __eq__(XSolvable *s) {
1909 return $self->pool == s->pool && $self->id == s->id;
1911 bool __ne__(XSolvable *s) {
1912 return !XSolvable___eq__($self, s);
1914 #if defined(SWIGPERL)
1915 %rename("str") __str__;
1917 const char *__str__() {
1918 return pool_solvid2str($self->pool, $self->id);
1920 %newobject __repr__;
1921 const char *__repr__() {
1923 sprintf(buf, "<Solvable #%d ", $self->id);
1924 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1929 Problem(Solver *solv, Id id) {
1931 p = solv_calloc(1, sizeof(*p));
1936 %newobject findproblemrule;
1937 XRule *findproblemrule() {
1938 Id r = solver_findproblemrule($self->solv, $self->id);
1939 return new_XRule($self->solv, r);
1941 %newobject findallproblemrules;
1942 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1943 Queue findallproblemrules(int unfiltered=0) {
1944 Solver *solv = $self->solv;
1949 solver_findallproblemrules(solv, $self->id, &q);
1952 for (i = j = 0; i < q.count; i++)
1954 SolverRuleinfo rclass;
1955 probr = q.elements[i];
1956 rclass = solver_ruleclass(solv, probr);
1957 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1959 q.elements[j++] = probr;
1962 queue_truncate(&q, j);
1966 int solution_count() {
1967 return solver_solution_count($self->solv, $self->id);
1969 %newobject solutions;
1970 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1975 cnt = solver_solution_count($self->solv, $self->id);
1976 for (i = 1; i <= cnt; i++)
1983 Solution(Problem *p, Id id) {
1985 s = solv_calloc(1, sizeof(*s));
1987 s->problemid = p->id;
1991 int element_count() {
1992 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1995 %newobject elements;
1996 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1997 Queue elements(bool expandreplaces=0) {
2001 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2002 for (i = 1; i <= cnt; i++)
2005 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2007 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2013 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2014 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2016 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2017 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2018 queue_push2(&q, p, rp);
2020 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2021 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2022 queue_push2(&q, p, rp);
2024 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2025 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2026 queue_push2(&q, p, rp);
2031 queue_push2(&q, i, type);
2032 queue_push2(&q, p, rp);
2038 %extend Solutionelement {
2039 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2041 e = solv_calloc(1, sizeof(*e));
2043 e->problemid = problemid;
2054 if (p == SOLVER_SOLUTION_ERASE)
2059 else if (p == SOLVER_SOLUTION_REPLACE)
2064 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2065 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);
2066 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2067 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);
2068 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2069 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);
2070 return solver_solutionelement2str($self->solv, p, rp);
2072 %newobject replaceelements;
2073 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2074 Queue replaceelements() {
2079 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2082 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2083 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2084 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2085 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2086 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2087 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2088 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2090 queue_push(&q, $self->type);
2093 int illegalreplace() {
2094 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2096 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2098 %newobject solvable;
2099 XSolvable * const solvable;
2100 %newobject replacement;
2101 XSolvable * const replacement;
2104 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2105 return new_XSolvable(e->solv->pool, e->p);
2107 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2108 return new_XSolvable(e->solv->pool, e->rp);
2110 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2111 if (e->type != SOLVER_SOLUTION_JOB)
2113 return (e->p - 1) / 2;
2118 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2119 if ($self->type == SOLVER_SOLUTION_JOB)
2120 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2121 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2122 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2123 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2124 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2125 if ($self->type == SOLVER_SOLUTION_ERASE)
2126 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2132 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2133 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2134 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2135 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2136 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2137 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2138 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2139 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2140 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2141 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2142 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2143 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2144 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2145 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2146 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2147 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2148 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2149 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2150 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2152 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2153 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2154 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2155 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2156 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2157 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2158 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2159 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2161 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2162 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2163 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2165 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2166 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2167 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2168 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2169 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2170 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2171 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2172 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2173 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2179 int set_flag(int flag, int value) {
2180 return solver_set_flag($self, flag, value);
2182 int get_flag(int flag) {
2183 return solver_get_flag($self, flag);
2185 #if defined(SWIGPYTHON)
2187 def solve(self, jobs):
2189 for job in jobs: j += [job.how, job.what]
2190 return self.solve_helper(j)
2193 #if defined(SWIGPERL)
2195 sub solv::Solver::solve {
2196 my ($self, $jobs) = @_;
2197 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2198 return $self->solve_helper(\@j);
2202 #if defined(SWIGRUBY)
2205 "class Solv::Solver\n"
2206 " def solve(jobs)\n"
2208 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2209 " solve_helper(jl)\n"
2215 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2216 %newobject solve_helper;
2217 Queue solve_helper(Queue jobs) {
2221 solver_solve($self, &jobs);
2222 cnt = solver_problem_count($self);
2223 for (i = 1; i <= cnt; i++)
2227 %newobject transaction;
2228 Transaction *transaction() {
2229 return solver_create_transaction($self);
2233 %extend Transaction {
2234 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2235 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2236 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2237 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2238 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2239 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2240 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2241 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2242 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2243 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2244 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2245 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2246 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2247 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2248 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2249 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2250 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2251 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2252 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2253 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2254 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2255 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2256 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2257 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2258 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2259 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2260 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2262 transaction_free($self);
2265 %rename("isempty?") isempty;
2268 return $self->steps.count == 0;
2271 %newobject othersolvable;
2272 XSolvable *othersolvable(XSolvable *s) {
2273 Id op = transaction_obs_pkg($self, s->id);
2274 return new_XSolvable($self->pool, op);
2277 %newobject allothersolvables;
2278 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2279 Queue allothersolvables(XSolvable *s) {
2282 transaction_all_obs_pkgs($self, s->id, &q);
2286 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2287 %newobject classify;
2288 Queue classify(int mode = 0) {
2291 transaction_classify($self, mode, &q);
2295 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2296 %newobject newpackages;
2297 Queue newpackages() {
2301 cut = transaction_installedresult(self, &q);
2302 queue_truncate(&q, cut);
2306 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2307 %newobject keptpackages;
2308 Queue keptpackages() {
2312 cut = transaction_installedresult(self, &q);
2314 queue_deleten(&q, 0, cut);
2318 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2322 queue_init_clone(&q, &$self->steps);
2326 int steptype(XSolvable *s, int mode) {
2327 return transaction_type($self, s->id, mode);
2329 int calc_installsizechange() {
2330 return transaction_calc_installsizechange($self);
2332 void order(int flags) {
2333 transaction_order($self, flags);
2337 %extend TransactionClass {
2338 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2339 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2340 cl->transaction = trans;
2344 cl->fromid = fromid;
2348 %newobject solvables;
2349 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2353 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2359 XRule(Solver *solv, Id id) {
2362 XRule *xr = solv_calloc(1, sizeof(*xr));
2368 Id type, source, target, dep;
2369 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2370 return new_Ruleinfo($self, type, source, target, dep);
2372 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2373 %newobject allinfos;
2377 solver_allruleinfos($self->solv, $self->id, &q);
2381 bool __eq__(XRule *xr) {
2382 return $self->solv == xr->solv && $self->id == xr->id;
2384 bool __ne__(XRule *xr) {
2385 return !XRule___eq__($self, xr);
2387 %newobject __repr__;
2388 const char *__repr__() {
2390 sprintf(buf, "<Rule #%d>", $self->id);
2391 return solv_strdup(buf);
2396 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2397 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2401 ri->source = source;
2402 ri->target = target;
2406 XSolvable * const solvable;
2407 XSolvable * const othersolvable;
2409 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2410 return new_XSolvable(ri->solv->pool, ri->source);
2412 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2413 return new_XSolvable(ri->solv->pool, ri->target);
2416 const char *problemstr() {
2417 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2422 XRepodata(Repo *repo, Id id) {
2423 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2429 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2431 void set_id(Id solvid, Id keyname, Id id) {
2432 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2434 void set_str(Id solvid, Id keyname, const char *str) {
2435 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2437 void set_poolstr(Id solvid, Id keyname, const char *str) {
2438 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2440 void add_idarray(Id solvid, Id keyname, Id id) {
2441 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2443 void add_flexarray(Id solvid, Id keyname, Id handle) {
2444 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2446 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2447 const unsigned char *buf = solv_chksum_get(chksum, 0);
2449 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2451 const char *lookup_str(Id solvid, Id keyname) {
2452 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2454 Queue lookup_idarray(Id solvid, Id keyname) {
2457 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2460 %newobject lookup_checksum;
2461 Chksum *lookup_checksum(Id solvid, Id keyname) {
2463 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2464 return solv_chksum_create_from_bin(type, b);
2466 void internalize() {
2467 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2469 void create_stubs() {
2470 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2472 void write(FILE *fp) {
2473 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2475 bool add_solv(FILE *fp, int flags = 0) {
2476 Repodata *data = repo_id2repodata($self->repo, $self->id);
2477 int r, oldstate = data->state;
2478 data->state = REPODATA_LOADING;
2479 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2480 if (r || data->state == REPODATA_LOADING)
2481 data->state = oldstate;
2484 void extend_to_repo() {
2485 Repodata *data = repo_id2repodata($self->repo, $self->id);
2486 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2488 bool __eq__(XRepodata *xr) {
2489 return $self->repo == xr->repo && $self->id == xr->id;
2491 bool __ne__(XRepodata *xr) {
2492 return !XRepodata___eq__($self, xr);
2494 %newobject __repr__;
2495 const char *__repr__() {
2497 sprintf(buf, "<Repodata #%d>", $self->id);
2498 return solv_strdup(buf);