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"
335 #include <sys/stat.h>
336 #include <sys/types.h>
340 #include "poolarch.h"
343 #include "solverdebug.h"
344 #include "repo_solv.h"
347 #include "repo_write.h"
349 #include "repo_rpmdb.h"
352 #include "repo_deb.h"
355 #include "repo_rpmmd.h"
356 #include "repo_updateinfoxml.h"
357 #include "repo_deltainfoxml.h"
358 #include "repo_repomdxml.h"
360 #ifdef ENABLE_SUSEREPO
361 #include "repo_products.h"
362 #include "repo_susetags.h"
363 #include "repo_content.h"
365 #ifdef ENABLE_MDKREPO
366 #include "repo_mdk.h"
368 #ifdef ENABLE_ARCHREPO
369 #include "repo_arch.h"
371 #include "solv_xfopen.h"
373 /* for old ruby versions */
375 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
378 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
384 #define SOLVER_SOLUTION_ERASE -100
385 #define SOLVER_SOLUTION_REPLACE -101
386 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
387 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
388 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
390 typedef struct chksum Chksum;
392 typedef void *AppObjectPtr;
417 } Pool_solvable_iterator;
422 } Pool_repo_iterator;
427 } Repo_solvable_iterator;
467 Transaction *transaction;
475 typedef Dataiterator Datamatch;
480 %mixin Dataiterator "Enumerable";
481 %mixin Pool_solvable_iterator "Enumerable";
482 %mixin Pool_repo_iterator "Enumerable";
483 %mixin Repo_solvable_iterator "Enumerable";
491 %constant Id SOLVID_META;
492 %constant Id SOLVID_POS;
494 %constant int REL_EQ;
495 %constant int REL_GT;
496 %constant int REL_LT;
497 %constant int REL_ARCH;
525 # put before pool/repo so we can access the constructor
526 %nodefaultdtor Dataiterator;
527 typedef struct {} Dataiterator;
528 typedef struct {} Pool_solvable_iterator;
529 typedef struct {} Pool_repo_iterator;
530 typedef struct {} Repo_solvable_iterator;
532 %nodefaultctor Datamatch;
533 %nodefaultdtor Datamatch;
540 %nodefaultctor Datapos;
554 AppObjectPtr appdata;
561 const char * const name;
564 int const nsolvables;
565 AppObjectPtr appdata;
568 %nodefaultctor Solver;
569 %nodefaultdtor Solver;
577 %rename(xfopen) solv_xfopen;
578 %rename(xfopen_fd) solv_xfopen_fd;
579 %rename(xfopen_dup) solv_xfopen_dup;
580 %rename(xfclose) solv_xfclose;
581 %rename(xfileno) solv_xfileno;
583 FILE *solv_xfopen(const char *fn, const char *mode = 0);
584 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
585 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
586 int solv_xfclose(FILE *fp);
587 int solv_xfileno(FILE *fp);
590 SWIGINTERN int solv_xfclose(FILE *fp) {
593 SWIGINTERN int solv_xfileno(FILE *fp) {
596 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
598 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
621 %nodefaultctor Transaction;
622 %nodefaultdtor Transaction;
628 Transaction * const transaction;
637 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
638 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
639 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
640 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
641 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
642 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
643 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
644 static const Id SOLVER_NOOP = SOLVER_NOOP;
645 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
646 static const Id SOLVER_ERASE = SOLVER_ERASE;
647 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
648 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
649 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
650 static const Id SOLVER_LOCK = SOLVER_LOCK;
651 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
652 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
653 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
654 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
655 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
656 static const Id SOLVER_WEAK = SOLVER_WEAK;
657 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
658 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
659 static const Id SOLVER_SETEV = SOLVER_SETEV;
660 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
661 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
662 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
663 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
664 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
665 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
667 Job(Pool *pool, int how, Id what) {
668 Job *job = solv_calloc(1, sizeof(*job));
675 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
676 %newobject solvables;
678 Pool *pool = $self->pool;
682 how = $self->how & SOLVER_SELECTMASK;
683 FOR_JOB_SELECT(p, pp, how, $self->what)
688 bool __eq__(Job *j) {
689 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
691 bool __ne__(Job *j) {
692 return !Job___eq__($self, j);
694 #if defined(SWIGPERL)
695 %rename("str") __str__;
697 const char *__str__() {
698 return pool_job2str($self->pool, $self->how, $self->what, 0);
700 const char *__repr__() {
701 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
702 return pool_tmpjoin($self->pool, "<Job ", str, ">");
708 return (Chksum *)solv_chksum_create(type);
710 Chksum(Id type, const char *hex) {
711 unsigned char buf[64];
712 int l = solv_chksum_len(type);
715 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
717 return (Chksum *)solv_chksum_create_from_bin(type, buf);
720 solv_chksum_free($self, 0);
724 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
725 return solv_chksum_get_type(chksum);
728 void add(const char *str) {
729 solv_chksum_add($self, str, strlen((char *)str));
731 void add_fp(FILE *fp) {
734 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
735 solv_chksum_add($self, buf, l);
736 rewind(fp); /* convenience */
738 void add_fd(int fd) {
741 while ((l = read(fd, buf, sizeof(buf))) > 0)
742 solv_chksum_add($self, buf, l);
743 lseek(fd, 0, 0); /* convenience */
745 void add_stat(const char *filename) {
747 if (stat(filename, &stb))
748 memset(&stb, 0, sizeof(stb));
749 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
750 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
751 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
752 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
756 const unsigned char *b;
757 b = solv_chksum_get($self, &l);
758 return cdata_void((void *)b, l);
763 const unsigned char *b;
766 b = solv_chksum_get($self, &l);
767 ret = solv_malloc(2 * l + 1);
768 solv_bin2hex(b, l, ret);
772 bool __eq__(Chksum *chk) {
774 const unsigned char *b, *bo;
777 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
779 b = solv_chksum_get($self, &l);
780 bo = solv_chksum_get(chk, 0);
781 return memcmp(b, bo, l) == 0;
783 bool __ne__(Chksum *chk) {
784 return !Chksum___eq__($self, chk);
786 #if defined(SWIGRUBY)
787 %rename("to_s") __str__;
788 %rename("inspect") __repr__;
790 #if defined(SWIGPERL)
791 %rename("str") __str__;
794 const char *__str__() {
797 if (solv_chksum_isfinished($self))
798 h = Chksum_hex($self);
799 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
800 solv_free((void *)h);
804 const char *__repr__() {
805 const char *h = Chksum___str__($self);
806 const char *str = solv_dupjoin("<Chksum ", h, ">");
807 solv_free((void *)h);
814 Pool *pool = pool_create();
819 void set_debuglevel(int level) {
820 pool_setdebuglevel($self, level);
822 int set_flag(int flag, int value) {
823 return pool_set_flag($self, flag, value);
825 int get_flag(int flag) {
826 return pool_get_flag($self, flag);
828 #if defined(SWIGPYTHON)
830 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
831 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
832 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
833 PyObject *result = PyEval_CallObject((PyObject *)d, args);
838 return 0; /* exception */
839 ecode = SWIG_AsVal_int(result, &vresult);
841 return SWIG_IsOK(ecode) ? vresult : 0;
844 void set_loadcallback(PyObject *callable) {
845 if ($self->loadcallback == loadcallback) {
846 Py_DECREF($self->loadcallbackdata);
851 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
854 #if defined(SWIGPERL)
856 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
860 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
865 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
867 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
877 void set_loadcallback(SV *callable) {
878 if ($self->loadcallback == loadcallback)
879 SvREFCNT_dec($self->loadcallbackdata);
881 SvREFCNT_inc(callable);
882 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
886 #if defined(SWIGRUBY)
888 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
889 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
890 VALUE callable = (VALUE)d;
891 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
892 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
895 SWIGINTERN void mark_Pool(void *ptr) {
897 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
898 VALUE callable = (VALUE)pool->loadcallbackdata;
899 rb_gc_mark(callable);
903 %typemap(in, numinputs=0) VALUE callable {
904 $1 = rb_block_given_p() ? rb_block_proc() : 0;
906 void set_loadcallback(VALUE callable) {
907 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
912 Pool_set_loadcallback($self, 0);
915 Id str2id(const char *str, bool create=1) {
916 return pool_str2id($self, str, create);
918 Dep *Dep(const char *str, bool create=1) {
919 Id id = pool_str2id($self, str, create);
920 return new_Dep($self, id);
922 const char *id2str(Id id) {
923 return pool_id2str($self, id);
925 const char *dep2str(Id id) {
926 return pool_dep2str($self, id);
928 Id rel2id(Id name, Id evr, int flags, bool create=1) {
929 return pool_rel2id($self, name, evr, flags, create);
931 Id id2langid(Id id, const char *lang, bool create=1) {
932 return pool_id2langid($self, id, lang, create);
934 void setarch(const char *arch) {
935 pool_setarch($self, arch);
937 Repo *add_repo(const char *name) {
938 return repo_create($self, name);
940 const char *lookup_str(Id entry, Id keyname) {
941 return pool_lookup_str($self, entry, keyname);
943 Id lookup_id(Id entry, Id keyname) {
944 return pool_lookup_id($self, entry, keyname);
946 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
947 return pool_lookup_num($self, entry, keyname, notfound);
949 bool lookup_void(Id entry, Id keyname) {
950 return pool_lookup_void($self, entry, keyname);
952 %newobject lookup_checksum;
953 Chksum *lookup_checksum(Id entry, Id keyname) {
955 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
956 return solv_chksum_create_from_bin(type, b);
959 %newobject Dataiterator;
960 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
961 return new_Dataiterator($self, 0, p, key, match, flags);
963 const char *solvid2str(Id solvid) {
964 return pool_solvid2str($self, solvid);
966 void addfileprovides() {
967 pool_addfileprovides($self);
969 Queue addfileprovides_queue() {
972 pool_addfileprovides_queue($self, &r, 0);
975 void createwhatprovides() {
976 pool_createwhatprovides($self);
979 XSolvable *id2solvable(Id id) {
980 return new_XSolvable($self, id);
982 %newobject solvables;
983 Pool_solvable_iterator * const solvables;
985 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
986 return new_Pool_solvable_iterator(pool);
989 %newobject solvables_iter;
990 Pool_solvable_iterator * solvables_iter() {
991 return new_Pool_solvable_iterator($self);
994 Repo *id2repo(Id id) {
995 if (id < 1 || id >= $self->nrepos)
997 return pool_id2repo($self, id);
1000 Pool_repo_iterator * const repos;
1002 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1003 return new_Pool_repo_iterator(pool);
1006 %newobject repos_iter;
1007 Pool_repo_iterator * repos_iter() {
1008 return new_Pool_repo_iterator($self);
1013 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1014 pool_set_installed(pool, installed);
1016 Repo *Pool_installed_get(Pool *pool) {
1017 return pool->installed;
1021 Queue matchprovidingids(const char *match, int flags) {
1027 for (id = 1; id < pool->ss.nstrings; id++)
1028 if (pool->whatprovides[id])
1032 if (!datamatcher_init(&ma, match, flags)) {
1033 for (id = 1; id < pool->ss.nstrings; id++)
1034 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1036 datamatcher_free(&ma);
1042 Job *Job(int how, Id what) {
1043 return new_Job($self, how, what);
1046 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1047 %newobject whatprovides;
1048 Queue whatprovides(Id dep) {
1053 FOR_PROVIDES(p, pp, dep)
1058 Id towhatprovides(Queue q) {
1059 return pool_queuetowhatprovides($self, &q);
1063 %rename("isknownarch?") isknownarch;
1065 bool isknownarch(Id id) {
1067 if (!id || id == ID_EMPTY)
1069 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1071 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1078 return solver_create($self);
1083 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1084 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1085 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1086 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1087 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1088 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1089 #ifdef ENABLE_SUSEREPO
1090 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1093 void free(bool reuseids = 0) {
1094 repo_free($self, reuseids);
1096 void empty(bool reuseids = 0) {
1097 repo_empty($self, reuseids);
1100 %rename("isempty?") isempty;
1103 return !$self->nsolvables;
1105 bool add_solv(const char *name, int flags = 0) {
1106 FILE *fp = fopen(name, "r");
1110 r = repo_add_solv($self, fp, flags);
1114 bool add_solv(FILE *fp, int flags = 0) {
1115 return repo_add_solv($self, fp, flags) == 0;
1118 XSolvable *add_solvable() {
1119 Id solvid = repo_add_solvable($self);
1120 return new_XSolvable($self->pool, solvid);
1124 bool add_rpmdb(Repo *ref, int flags = 0) {
1125 repo_add_rpmdb($self, ref, 0, flags);
1128 Id add_rpm(const char *name, int flags = 0) {
1129 return repo_add_rpm($self, name, flags);
1133 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1134 repo_add_rpmmd($self, fp, language, flags);
1137 bool add_repomdxml(FILE *fp, int flags = 0) {
1138 repo_add_repomdxml($self, fp, flags);
1141 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1142 repo_add_updateinfoxml($self, fp, flags);
1145 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1146 repo_add_deltainfoxml($self, fp, flags);
1150 #ifdef ENABLE_DEBIAN
1151 bool add_debdb(int flags = 0) {
1152 repo_add_debdb($self, 0, flags);
1155 Id add_deb(const char *name, int flags = 0) {
1156 return repo_add_deb($self, name, flags);
1159 #ifdef ENABLE_SUSEREPO
1160 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1161 repo_add_susetags($self, fp, defvendor, language, flags);
1164 bool add_content(FILE *fp, int flags = 0) {
1165 repo_add_content($self, fp, flags);
1168 bool add_products(const char *proddir, int flags = 0) {
1169 repo_add_products($self, proddir, 0, flags);
1173 #ifdef ENABLE_MDKREPO
1174 bool add_mdk(FILE *fp, int flags = 0) {
1175 repo_add_mdk($self, fp, flags);
1178 bool add_mdk_info(FILE *fp, int flags = 0) {
1179 repo_add_mdk($self, fp, flags);
1183 #ifdef ENABLE_ARCHREPO
1184 bool add_arch_repo(FILE *fp, int flags = 0) {
1185 repo_add_arch_repo($self, fp, flags);
1188 Id add_arch_pkg(const char *name, int flags = 0) {
1189 return repo_add_arch_pkg($self, name, flags);
1192 void internalize() {
1193 repo_internalize($self);
1195 const char *lookup_str(Id entry, Id keyname) {
1196 return repo_lookup_str($self, entry, keyname);
1198 Id lookup_id(Id entry, Id keyname) {
1199 return repo_lookup_id($self, entry, keyname);
1201 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1202 return repo_lookup_num($self, entry, keyname, notfound);
1204 void write(FILE *fp) {
1205 repo_write($self, fp);
1207 # HACK, remove if no longer needed!
1208 bool write_first_repodata(FILE *fp) {
1209 int oldnrepodata = $self->nrepodata;
1210 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1211 repo_write($self, fp);
1212 $self->nrepodata = oldnrepodata;
1216 %newobject Dataiterator;
1217 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1218 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1223 SWIGINTERN Id Repo_id_get(Repo *repo) {
1224 return repo->repoid;
1227 Repo_solvable_iterator * const solvables;
1229 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1230 return new_Repo_solvable_iterator(repo);
1233 %newobject solvables_iter;
1234 Repo_solvable_iterator *solvables_iter() {
1235 return new_Repo_solvable_iterator($self);
1238 XRepodata *add_repodata(int flags = 0) {
1239 Repodata *rd = repo_add_repodata($self, flags);
1240 return new_XRepodata($self, rd->repodataid);
1243 void create_stubs() {
1245 if (!$self->nrepodata)
1247 data = repo_id2repodata($self, $self->nrepodata - 1);
1248 if (data->state != REPODATA_STUB)
1249 repodata_create_stubs(data);
1252 %rename("iscontiguous?") iscontiguous;
1254 bool iscontiguous() {
1256 for (i = $self->start; i < $self->end; i++)
1257 if ($self->pool->solvables[i].repo != $self)
1261 XRepodata *first_repodata() {
1264 if ($self->nrepodata < 2)
1266 /* make sure all repodatas but the first are extensions */
1267 data = repo_id2repodata($self, 1);
1268 if (data->loadcallback)
1270 for (i = 2; i < $self->nrepodata; i++)
1272 data = repo_id2repodata($self, i);
1273 if (!data->loadcallback)
1274 return 0; /* oops, not an extension */
1276 return new_XRepodata($self, 1);
1279 bool __eq__(Repo *repo) {
1280 return $self == repo;
1282 bool __ne__(Repo *repo) {
1283 return $self != repo;
1285 #if defined(SWIGPERL)
1286 %rename("str") __str__;
1289 const char *__str__() {
1292 return solv_strdup($self->name);
1293 sprintf(buf, "Repo#%d", $self->repoid);
1294 return solv_strdup(buf);
1296 %newobject __repr__;
1297 const char *__repr__() {
1301 sprintf(buf, "<Repo #%d ", $self->repoid);
1302 return solv_dupjoin(buf, $self->name, ">");
1304 sprintf(buf, "<Repo #%d>", $self->repoid);
1305 return solv_strdup(buf);
1309 %extend Dataiterator {
1310 static const int SEARCH_STRING = SEARCH_STRING;
1311 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1312 static const int SEARCH_GLOB = SEARCH_GLOB;
1313 static const int SEARCH_REGEX = SEARCH_REGEX;
1314 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1315 static const int SEARCH_FILES = SEARCH_FILES;
1316 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1318 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1319 Dataiterator *di = solv_calloc(1, sizeof(*di));
1320 dataiterator_init(di, pool, repo, p, key, match, flags);
1324 dataiterator_free($self);
1327 #if defined(SWIGPYTHON)
1328 %newobject __iter__;
1329 Dataiterator *__iter__() {
1331 ndi = solv_calloc(1, sizeof(*ndi));
1332 dataiterator_init_clone(ndi, $self);
1335 %rename("next") __next__();
1336 %exception __next__ {
1339 PyErr_SetString(PyExc_StopIteration,"no more matches");
1346 perliter(solv::Dataiterator)
1349 %newobject __next__;
1350 Datamatch *__next__() {
1352 if (!dataiterator_step($self)) {
1355 ndi = solv_calloc(1, sizeof(*ndi));
1356 dataiterator_init_clone(ndi, $self);
1362 while ((d = Dataiterator___next__($self)) != 0) {
1363 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1367 void prepend_keyname(Id key) {
1368 dataiterator_prepend_keyname($self, key);
1370 void skip_solvable() {
1371 dataiterator_skip_solvable($self);
1376 Id lookup_id(Id keyname) {
1377 Pool *pool = $self->repo->pool;
1378 Datapos oldpos = pool->pos;
1381 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1385 const char *lookup_str(Id keyname) {
1386 Pool *pool = $self->repo->pool;
1387 Datapos oldpos = pool->pos;
1390 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1394 %newobject lookup_checksum;
1395 Chksum *lookup_checksum(Id keyname) {
1396 Pool *pool = $self->repo->pool;
1397 Datapos oldpos = pool->pos;
1399 const unsigned char *b;
1401 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1403 return solv_chksum_create_from_bin(type, b);
1409 dataiterator_free($self);
1412 %newobject solvable;
1413 XSolvable * const solvable;
1415 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1416 return new_XSolvable(di->pool, di->solvid);
1420 return $self->key->name;
1422 const char *key_idstr() {
1423 return pool_id2str($self->pool, $self->key->name);
1426 return $self->key->type;
1428 const char *type_idstr() {
1429 return pool_id2str($self->pool, $self->key->type);
1432 return $self->kv.id;
1434 const char *idstr() {
1435 return pool_id2str($self->pool, $self->kv.id);
1438 return $self->kv.str;
1441 return $self->kv.num;
1444 return $self->kv.num2;
1448 Pool *pool = $self->pool;
1449 Datapos *pos, oldpos = pool->pos;
1450 dataiterator_setpos($self);
1451 pos = solv_calloc(1, sizeof(*pos));
1456 %newobject parentpos;
1457 Datapos *parentpos() {
1458 Pool *pool = $self->pool;
1459 Datapos *pos, oldpos = pool->pos;
1460 dataiterator_setpos_parent($self);
1461 pos = solv_calloc(1, sizeof(*pos));
1467 dataiterator_setpos($self);
1469 void setpos_parent() {
1470 dataiterator_setpos_parent($self);
1474 %extend Pool_solvable_iterator {
1475 Pool_solvable_iterator(Pool *pool) {
1476 Pool_solvable_iterator *s;
1477 s = solv_calloc(1, sizeof(*s));
1481 #if defined(SWIGPYTHON)
1482 %newobject __iter__;
1483 Pool_solvable_iterator *__iter__() {
1484 Pool_solvable_iterator *s;
1485 s = solv_calloc(1, sizeof(*s));
1489 %rename("next") __next__();
1490 %exception __next__ {
1493 PyErr_SetString(PyExc_StopIteration,"no more matches");
1500 perliter(solv::Pool_solvable_iterator)
1502 %newobject __next__;
1503 XSolvable *__next__() {
1504 Pool *pool = $self->pool;
1505 if ($self->id >= pool->nsolvables)
1507 while (++$self->id < pool->nsolvables)
1508 if (pool->solvables[$self->id].repo)
1509 return new_XSolvable(pool, $self->id);
1515 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1516 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1520 %newobject __getitem__;
1521 XSolvable *__getitem__(Id key) {
1522 Pool *pool = $self->pool;
1523 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1524 return new_XSolvable(pool, key);
1528 return $self->pool->nsolvables;
1532 %extend Pool_repo_iterator {
1533 Pool_repo_iterator(Pool *pool) {
1534 Pool_repo_iterator *s;
1535 s = solv_calloc(1, sizeof(*s));
1539 #if defined(SWIGPYTHON)
1540 %newobject __iter__;
1541 Pool_repo_iterator *__iter__() {
1542 Pool_repo_iterator *s;
1543 s = solv_calloc(1, sizeof(*s));
1547 %rename("next") __next__();
1548 %exception __next__ {
1551 PyErr_SetString(PyExc_StopIteration,"no more matches");
1556 %newobject __next__;
1558 Pool *pool = $self->pool;
1559 if ($self->id >= pool->nrepos)
1561 while (++$self->id < pool->nrepos) {
1562 Repo *r = pool_id2repo(pool, $self->id);
1571 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1572 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
1576 Repo *__getitem__(Id key) {
1577 Pool *pool = $self->pool;
1578 if (key > 0 && key < pool->nrepos)
1579 return pool_id2repo(pool, key);
1583 return $self->pool->nrepos;
1587 %extend Repo_solvable_iterator {
1588 Repo_solvable_iterator(Repo *repo) {
1589 Repo_solvable_iterator *s;
1590 s = solv_calloc(1, sizeof(*s));
1594 #if defined(SWIGPYTHON)
1595 %newobject __iter__;
1596 Repo_solvable_iterator *__iter__() {
1597 Repo_solvable_iterator *s;
1598 s = solv_calloc(1, sizeof(*s));
1602 %rename("next") __next__();
1603 %exception __next__ {
1606 PyErr_SetString(PyExc_StopIteration,"no more matches");
1611 %newobject __next__;
1612 XSolvable *__next__() {
1613 Repo *repo = $self->repo;
1614 Pool *pool = repo->pool;
1615 if (repo->start > 0 && $self->id < repo->start)
1616 $self->id = repo->start - 1;
1617 if ($self->id >= repo->end)
1619 while (++$self->id < repo->end)
1620 if (pool->solvables[$self->id].repo == repo)
1621 return new_XSolvable(pool, $self->id);
1627 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1628 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1632 %newobject __getitem__;
1633 XSolvable *__getitem__(Id key) {
1634 Repo *repo = $self->repo;
1635 Pool *pool = repo->pool;
1636 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1637 return new_XSolvable(pool, key);
1641 return $self->repo->pool->nsolvables;
1646 Dep(Pool *pool, Id id) {
1650 s = solv_calloc(1, sizeof(*s));
1656 return pool_dep2str($self->pool, $self->id);
1658 bool __eq__(Dep *s) {
1659 return $self->pool == s->pool && $self->id == s->id;
1661 bool __ne__(Dep *s) {
1662 return !Dep___eq__($self, s);
1664 #if defined(SWIGPERL)
1665 %rename("str") __str__;
1667 const char *__str__() {
1668 return pool_dep2str($self->pool, $self->id);
1670 %newobject __repr__;
1671 const char *__repr__() {
1673 sprintf(buf, "<Id #%d ", $self->id);
1674 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1679 XSolvable(Pool *pool, Id id) {
1681 if (!id || id >= pool->nsolvables)
1683 s = solv_calloc(1, sizeof(*s));
1689 return pool_solvid2str($self->pool, $self->id);
1691 const char *lookup_str(Id keyname) {
1692 return pool_lookup_str($self->pool, $self->id, keyname);
1694 Id lookup_id(Id keyname) {
1695 return pool_lookup_id($self->pool, $self->id, keyname);
1697 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1698 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1700 bool lookup_void(Id keyname) {
1701 return pool_lookup_void($self->pool, $self->id, keyname);
1703 %newobject lookup_checksum;
1704 Chksum *lookup_checksum(Id keyname) {
1706 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1707 return solv_chksum_create_from_bin(type, b);
1709 Queue lookup_idarray(Id keyname, Id marker = 1) {
1710 Solvable *s = $self->pool->solvables + $self->id;
1714 if (keyname == SOLVABLE_PROVIDES)
1715 marker = -SOLVABLE_FILEMARKER;
1716 else if (keyname == SOLVABLE_REQUIRES)
1717 marker = -SOLVABLE_PREREQMARKER;
1721 solvable_lookup_deparray(s, keyname, &r, marker);
1724 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
1725 %newobject lookup_deparray;
1726 Queue lookup_deparray(Id keyname, Id marker = 1) {
1727 Solvable *s = $self->pool->solvables + $self->id;
1731 if (keyname == SOLVABLE_PROVIDES)
1732 marker = -SOLVABLE_FILEMARKER;
1733 else if (keyname == SOLVABLE_REQUIRES)
1734 marker = -SOLVABLE_PREREQMARKER;
1738 solvable_lookup_deparray(s, keyname, &r, marker);
1741 const char *lookup_location(unsigned int *OUTPUT) {
1742 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1745 %rename("installable?") installable;
1747 bool installable() {
1748 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1751 %rename("isinstalled?") isinstalled;
1753 bool isinstalled() {
1754 Pool *pool = $self->pool;
1755 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1760 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1761 Pool *pool = xs->pool;
1762 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1764 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1765 Pool *pool = xs->pool;
1766 return pool_id2str(pool, pool->solvables[xs->id].name);
1771 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1772 xs->pool->solvables[xs->id].name = nameid;
1774 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1775 return xs->pool->solvables[xs->id].name;
1780 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1781 Pool *pool = xs->pool;
1782 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1784 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1785 Pool *pool = xs->pool;
1786 return pool_id2str(pool, pool->solvables[xs->id].evr);
1791 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1792 xs->pool->solvables[xs->id].evr = evrid;
1794 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1795 return xs->pool->solvables[xs->id].evr;
1800 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1801 Pool *pool = xs->pool;
1802 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1804 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1805 Pool *pool = xs->pool;
1806 return pool_id2str(pool, pool->solvables[xs->id].arch);
1811 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1812 xs->pool->solvables[xs->id].arch = archid;
1814 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1815 return xs->pool->solvables[xs->id].arch;
1820 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1821 Pool *pool = xs->pool;
1822 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1824 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1825 Pool *pool = xs->pool;
1826 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1831 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1832 xs->pool->solvables[xs->id].vendor = vendorid;
1834 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1835 return xs->pool->solvables[xs->id].vendor;
1840 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1841 return xs->pool->solvables[xs->id].repo;
1845 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1846 Solvable *s = $self->pool->solvables + $self->id;
1847 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1849 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1850 Solvable *s = $self->pool->solvables + $self->id;
1851 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1853 void add_obsoletes(Dep *dep) {
1854 Solvable *s = $self->pool->solvables + $self->id;
1855 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1857 void add_obsoletesid(Id id) {
1858 Solvable *s = $self->pool->solvables + $self->id;
1859 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1861 void add_conflicts(Dep *dep) {
1862 Solvable *s = $self->pool->solvables + $self->id;
1863 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1865 void add_conflictsid(Id id) {
1866 Solvable *s = $self->pool->solvables + $self->id;
1867 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1869 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1870 Solvable *s = $self->pool->solvables + $self->id;
1871 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1873 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1874 Solvable *s = $self->pool->solvables + $self->id;
1875 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1877 void add_recommends(Dep *dep) {
1878 Solvable *s = $self->pool->solvables + $self->id;
1879 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1881 void add_recommendsid(Id id) {
1882 Solvable *s = $self->pool->solvables + $self->id;
1883 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1885 void add_suggests(Dep *dep) {
1886 Solvable *s = $self->pool->solvables + $self->id;
1887 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1889 void add_suggestsid(Id id) {
1890 Solvable *s = $self->pool->solvables + $self->id;
1891 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1893 void add_supplements(Dep *dep) {
1894 Solvable *s = $self->pool->solvables + $self->id;
1895 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1897 void add_supplementsid(Id id) {
1898 Solvable *s = $self->pool->solvables + $self->id;
1899 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1901 void add_enhances(Dep *dep) {
1902 Solvable *s = $self->pool->solvables + $self->id;
1903 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
1905 void add_enhancesid(Id id) {
1906 Solvable *s = $self->pool->solvables + $self->id;
1907 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
1910 bool __eq__(XSolvable *s) {
1911 return $self->pool == s->pool && $self->id == s->id;
1913 bool __ne__(XSolvable *s) {
1914 return !XSolvable___eq__($self, s);
1916 #if defined(SWIGPERL)
1917 %rename("str") __str__;
1919 const char *__str__() {
1920 return pool_solvid2str($self->pool, $self->id);
1922 %newobject __repr__;
1923 const char *__repr__() {
1925 sprintf(buf, "<Solvable #%d ", $self->id);
1926 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1931 Problem(Solver *solv, Id id) {
1933 p = solv_calloc(1, sizeof(*p));
1938 %newobject findproblemrule;
1939 XRule *findproblemrule() {
1940 Id r = solver_findproblemrule($self->solv, $self->id);
1941 return new_XRule($self->solv, r);
1943 %newobject findallproblemrules;
1944 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1945 Queue findallproblemrules(int unfiltered=0) {
1946 Solver *solv = $self->solv;
1951 solver_findallproblemrules(solv, $self->id, &q);
1954 for (i = j = 0; i < q.count; i++)
1956 SolverRuleinfo rclass;
1957 probr = q.elements[i];
1958 rclass = solver_ruleclass(solv, probr);
1959 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1961 q.elements[j++] = probr;
1964 queue_truncate(&q, j);
1968 int solution_count() {
1969 return solver_solution_count($self->solv, $self->id);
1971 %newobject solutions;
1972 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1977 cnt = solver_solution_count($self->solv, $self->id);
1978 for (i = 1; i <= cnt; i++)
1985 Solution(Problem *p, Id id) {
1987 s = solv_calloc(1, sizeof(*s));
1989 s->problemid = p->id;
1993 int element_count() {
1994 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1997 %newobject elements;
1998 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1999 Queue elements(bool expandreplaces=0) {
2003 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2004 for (i = 1; i <= cnt; i++)
2007 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2009 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2015 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2016 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2018 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2019 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2020 queue_push2(&q, p, rp);
2022 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2023 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2024 queue_push2(&q, p, rp);
2026 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2027 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2028 queue_push2(&q, p, rp);
2033 queue_push2(&q, i, type);
2034 queue_push2(&q, p, rp);
2040 %extend Solutionelement {
2041 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2043 e = solv_calloc(1, sizeof(*e));
2045 e->problemid = problemid;
2056 if (p == SOLVER_SOLUTION_ERASE)
2061 else if (p == SOLVER_SOLUTION_REPLACE)
2066 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2067 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);
2068 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2069 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);
2070 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2071 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);
2072 return solver_solutionelement2str($self->solv, p, rp);
2074 %newobject replaceelements;
2075 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2076 Queue replaceelements() {
2081 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2084 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2085 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2086 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2087 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2088 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2089 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2090 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2092 queue_push(&q, $self->type);
2095 int illegalreplace() {
2096 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2098 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2100 %newobject solvable;
2101 XSolvable * const solvable;
2102 %newobject replacement;
2103 XSolvable * const replacement;
2106 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2107 return new_XSolvable(e->solv->pool, e->p);
2109 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2110 return new_XSolvable(e->solv->pool, e->rp);
2112 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2113 if (e->type != SOLVER_SOLUTION_JOB)
2115 return (e->p - 1) / 2;
2120 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2121 if ($self->type == SOLVER_SOLUTION_JOB)
2122 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2123 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
2124 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->p);
2125 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2126 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|extraflags, $self->rp);
2127 if ($self->type == SOLVER_SOLUTION_ERASE)
2128 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2134 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2135 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2136 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2137 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2138 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2139 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2140 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2141 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2142 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2143 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2144 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2145 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2146 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2147 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2148 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2149 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2150 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2151 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2152 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2154 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2155 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2156 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2157 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2158 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2159 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2160 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2161 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2163 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2164 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2165 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2167 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2168 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2169 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2170 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2171 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2172 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2173 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2174 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2175 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2181 int set_flag(int flag, int value) {
2182 return solver_set_flag($self, flag, value);
2184 int get_flag(int flag) {
2185 return solver_get_flag($self, flag);
2187 #if defined(SWIGPYTHON)
2189 def solve(self, jobs):
2191 for job in jobs: j += [job.how, job.what]
2192 return self.solve_helper(j)
2195 #if defined(SWIGPERL)
2197 sub solv::Solver::solve {
2198 my ($self, $jobs) = @_;
2199 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2200 return $self->solve_helper(\@j);
2204 #if defined(SWIGRUBY)
2207 "class Solv::Solver\n"
2208 " def solve(jobs)\n"
2210 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2211 " solve_helper(jl)\n"
2217 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2218 %newobject solve_helper;
2219 Queue solve_helper(Queue jobs) {
2223 solver_solve($self, &jobs);
2224 cnt = solver_problem_count($self);
2225 for (i = 1; i <= cnt; i++)
2229 %newobject transaction;
2230 Transaction *transaction() {
2231 return solver_create_transaction($self);
2235 %extend Transaction {
2236 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2237 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2238 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2239 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2240 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2241 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2242 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2243 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2244 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2245 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2246 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2247 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2248 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2249 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2250 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2251 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2252 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2253 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2254 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2255 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2256 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2257 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2258 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2259 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2260 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2261 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2262 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2264 transaction_free($self);
2267 %rename("isempty?") isempty;
2270 return $self->steps.count == 0;
2273 %newobject othersolvable;
2274 XSolvable *othersolvable(XSolvable *s) {
2275 Id op = transaction_obs_pkg($self, s->id);
2276 return new_XSolvable($self->pool, op);
2279 %newobject allothersolvables;
2280 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2281 Queue allothersolvables(XSolvable *s) {
2284 transaction_all_obs_pkgs($self, s->id, &q);
2288 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2289 %newobject classify;
2290 Queue classify(int mode = 0) {
2293 transaction_classify($self, mode, &q);
2297 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2298 %newobject newpackages;
2299 Queue newpackages() {
2303 cut = transaction_installedresult(self, &q);
2304 queue_truncate(&q, cut);
2308 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2309 %newobject keptpackages;
2310 Queue keptpackages() {
2314 cut = transaction_installedresult(self, &q);
2316 queue_deleten(&q, 0, cut);
2320 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2324 queue_init_clone(&q, &$self->steps);
2328 int steptype(XSolvable *s, int mode) {
2329 return transaction_type($self, s->id, mode);
2331 int calc_installsizechange() {
2332 return transaction_calc_installsizechange($self);
2334 void order(int flags) {
2335 transaction_order($self, flags);
2339 %extend TransactionClass {
2340 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2341 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2342 cl->transaction = trans;
2346 cl->fromid = fromid;
2350 %newobject solvables;
2351 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2355 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2361 XRule(Solver *solv, Id id) {
2364 XRule *xr = solv_calloc(1, sizeof(*xr));
2370 Id type, source, target, dep;
2371 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2372 return new_Ruleinfo($self, type, source, target, dep);
2374 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2375 %newobject allinfos;
2379 solver_allruleinfos($self->solv, $self->id, &q);
2383 bool __eq__(XRule *xr) {
2384 return $self->solv == xr->solv && $self->id == xr->id;
2386 bool __ne__(XRule *xr) {
2387 return !XRule___eq__($self, xr);
2389 %newobject __repr__;
2390 const char *__repr__() {
2392 sprintf(buf, "<Rule #%d>", $self->id);
2393 return solv_strdup(buf);
2398 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2399 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2403 ri->source = source;
2404 ri->target = target;
2408 XSolvable * const solvable;
2409 XSolvable * const othersolvable;
2411 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2412 return new_XSolvable(ri->solv->pool, ri->source);
2414 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2415 return new_XSolvable(ri->solv->pool, ri->target);
2418 const char *problemstr() {
2419 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2424 XRepodata(Repo *repo, Id id) {
2425 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2431 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
2433 void set_id(Id solvid, Id keyname, Id id) {
2434 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2436 void set_str(Id solvid, Id keyname, const char *str) {
2437 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2439 void set_poolstr(Id solvid, Id keyname, const char *str) {
2440 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
2442 void add_idarray(Id solvid, Id keyname, Id id) {
2443 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
2445 void add_flexarray(Id solvid, Id keyname, Id handle) {
2446 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
2448 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2449 const unsigned char *buf = solv_chksum_get(chksum, 0);
2451 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
2453 const char *lookup_str(Id solvid, Id keyname) {
2454 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
2456 Queue lookup_idarray(Id solvid, Id keyname) {
2459 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
2462 %newobject lookup_checksum;
2463 Chksum *lookup_checksum(Id solvid, Id keyname) {
2465 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
2466 return solv_chksum_create_from_bin(type, b);
2468 void internalize() {
2469 repodata_internalize(repo_id2repodata($self->repo, $self->id));
2471 void create_stubs() {
2472 repodata_create_stubs(repo_id2repodata($self->repo, $self->id));
2474 void write(FILE *fp) {
2475 repodata_write(repo_id2repodata($self->repo, $self->id), fp);
2477 bool add_solv(FILE *fp, int flags = 0) {
2478 Repodata *data = repo_id2repodata($self->repo, $self->id);
2479 int r, oldstate = data->state;
2480 data->state = REPODATA_LOADING;
2481 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
2482 if (r || data->state == REPODATA_LOADING)
2483 data->state = oldstate;
2486 void extend_to_repo() {
2487 Repodata *data = repo_id2repodata($self->repo, $self->id);
2488 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2490 bool __eq__(XRepodata *xr) {
2491 return $self->repo == xr->repo && $self->id == xr->id;
2493 bool __ne__(XRepodata *xr) {
2494 return !XRepodata___eq__($self, xr);
2496 %newobject __repr__;
2497 const char *__repr__() {
2499 sprintf(buf, "<Repodata #%d>", $self->id);
2500 return solv_strdup(buf);