2 # WARNING: for perl iterator/array support you need to run
3 # sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
4 # on the generated c code
9 # %rename("to_s") string();
11 ##if defined(SWIGPYTHON)
12 # %rename("__str__") string();
19 %markfunc Pool "mark_Pool";
22 #if defined(SWIGPYTHON)
24 /* Check if is a list */
26 if (PyList_Check($input)) {
27 int size = PyList_Size($input);
29 for (i = 0; i < size; i++) {
30 PyObject *o = PyList_GetItem($input,i);
32 int e = SWIG_AsVal_int(o, &v);
34 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
41 PyErr_SetString(PyExc_TypeError,"not a list");
48 PyObject *o = PyList_New($1.count);
49 for (i = 0; i < $1.count; i++)
50 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
55 %define Queue2Array(type, step, con) %{
57 int cnt = $1.count / step;
58 Id *idp = $1.elements;
59 PyObject *o = PyList_New(cnt);
60 for (i = 0; i < cnt; i++, idp += step)
63 #define result resultx
66 PyList_SetItem(o, i, $result);
83 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
84 SWIG_croak("Argument $argnum is not an array reference.");
85 av = (AV*)SvRV($input);
87 for (i = 0; i <= size; i++) {
88 SV **sv = av_fetch(av, i, 0);
90 int e = SWIG_AsVal_int(*sv, &v);
92 SWIG_croak("list must contain only integers");
98 # av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
99 # $result = newRV_noinc((SV*)o); argvi++;
101 %typemap(out) Queue {
103 if (argvi + $1.count + 1>= items) {
104 EXTEND(sp, items - (argvi + $1.count + 1) + 1);
106 for (i = 0; i < $1.count; i++)
107 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
111 %define Queue2Array(type, step, con) %{
113 int cnt = $1.count / step;
114 Id *idp = $1.elements;
115 if (argvi + cnt + 1 >= items) {
116 EXTEND(sp, items - (argvi + cnt + 1) + 1);
118 for (i = 0; i < cnt; i++, idp += step)
121 #define result resultx
124 SvREFCNT_inc(ST(argvi - 1));
134 %typemap(arginit) Queue {
137 %typemap(freearg) Queue {
141 #if defined(SWIGRUBY)
146 size = RARRAY($input)->len;
148 o = RARRAY($input)->ptr;
149 for (i = 0; i < size; i++, o++) {
151 int e = SWIG_AsVal_int(*o, &v);
154 SWIG_Error(SWIG_RuntimeError, "list must contain only integers");
160 %typemap(out) Queue {
162 VALUE o = rb_ary_new2($1.count);
163 for (i = 0; i < $1.count; i++)
164 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
168 %typemap(arginit) Queue {
171 %typemap(freearg) Queue {
174 %define Queue2Array(type, step, con) %{
176 int cnt = $1.count / step;
177 Id *idp = $1.elements;
178 VALUE o = rb_ary_new2(cnt);
179 for (i = 0; i < cnt; i++, idp += step)
182 #define result resultx
185 rb_ary_store(o, i, $result);
197 #if defined(SWIGPERL)
199 # work around a swig bug
203 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
205 # ifndef MULTIPLICITY
206 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
208 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
214 %define perliter(class)
217 my $i = ${##class##::ITERATORS}{$_[0]};
219 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
221 $_[0]->__getitem__($_[1]);
224 sub class##::FETCHSIZE {
225 my $i = ${##class##::ITERATORS}{$_[0]};
227 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
237 #define SWIG_PERL_ITERATOR 0x80
239 SWIGRUNTIMEINLINE SV *
240 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
241 SV *result = sv_newmortal();
242 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
247 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
248 stash=SvSTASH(SvRV(obj));
249 if (flags & SWIG_POINTER_OWN) {
251 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
253 gv_init(gv, stash, "OWNER", 5, FALSE);
255 hv_store_ent(hv, obj, newSViv(1), 0);
257 if (flags & SWIG_PERL_ITERATOR) {
259 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
262 gv_init(gv, stash, "ITERATORS", 9, FALSE);
264 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
266 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
268 self=newRV_noinc((SV *)array);
269 sv_setsv(result, self);
270 SvREFCNT_dec((SV *)self);
271 sv_bless(result, stash);
273 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
280 %typemap(out) Perlarray {
281 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
283 %typemap(out) Perliterator {
284 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
287 %typemap(out) Pool_solvable_iterator * = Perlarray;
288 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
289 %typemap(out) Pool_repo_iterator * = Perlarray;
290 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
291 %typemap(out) Repo_solvable_iterator * = Perlarray;
292 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
293 %typemap(out) Dataiterator * = Perliterator;
299 #if defined(SWIGPYTHON)
300 typedef PyObject *AppObjectPtr;
301 %typemap(out) AppObjectPtr {
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"
348 #include "repo_rpmdb.h"
350 #include "repo_deb.h"
351 #include "repo_rpmmd.h"
352 #include "repo_write.h"
353 #include "repo_products.h"
354 #include "repo_susetags.h"
355 #include "repo_updateinfoxml.h"
356 #include "repo_deltainfoxml.h"
357 #include "repo_repomdxml.h"
358 #include "repo_content.h"
359 #include "solv_xfopen.h"
364 #define SOLVER_SOLUTION_ERASE -100
365 #define SOLVER_SOLUTION_REPLACE -101
366 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
367 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
368 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
370 typedef struct chksum Chksum;
372 typedef void *AppObjectPtr;
397 } Pool_solvable_iterator;
402 } Pool_repo_iterator;
407 } Repo_solvable_iterator;
447 Transaction *transaction;
455 typedef Dataiterator Datamatch;
460 %mixin Dataiterator "Enumerable";
461 %mixin Pool_solvable_iterator "Enumerable";
462 %mixin Pool_repo_iterator "Enumerable";
463 %mixin Repo_solvable_iterator "Enumerable";
471 %constant Id SOLVID_META;
472 %constant Id SOLVID_POS;
474 %constant int REL_EQ;
475 %constant int REL_GT;
476 %constant int REL_LT;
477 %constant int REL_ARCH;
505 # put before pool/repo so we can access the constructor
506 %nodefaultdtor Dataiterator;
507 typedef struct {} Dataiterator;
508 typedef struct {} Pool_solvable_iterator;
509 typedef struct {} Pool_repo_iterator;
510 typedef struct {} Repo_solvable_iterator;
512 %nodefaultctor Datamatch;
513 %nodefaultdtor Datamatch;
520 %nodefaultctor Datapos;
534 AppObjectPtr appdata;
539 typedef struct _Repo {
541 const char * const name;
544 int const nsolvables;
545 AppObjectPtr appdata;
548 %nodefaultctor Solver;
549 %nodefaultdtor Solver;
554 typedef struct chksum {
557 %rename(xfopen) solv_xfopen;
558 %rename(xfopen_fd) solv_xfopen_fd;
559 %rename(xfopen_dup) solv_xfopen_dup;
560 %rename(xfclose) solv_xfclose;
561 %rename(xfileno) solv_xfileno;
563 FILE *solv_xfopen(const char *fn, const char *mode = 0);
564 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
565 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
566 int solv_xfclose(FILE *fp);
567 int solv_xfileno(FILE *fp);
570 SWIGINTERN int solv_xfclose(FILE *fp) {
573 SWIGINTERN int solv_xfileno(FILE *fp) {
576 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
578 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
601 %nodefaultctor Transaction;
602 %nodefaultdtor Transaction;
608 Transaction * const transaction;
617 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
618 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
619 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
620 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
621 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
622 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
623 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
624 static const Id SOLVER_NOOP = SOLVER_NOOP;
625 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
626 static const Id SOLVER_ERASE = SOLVER_ERASE;
627 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
628 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
629 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
630 static const Id SOLVER_LOCK = SOLVER_LOCK;
631 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
632 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
633 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
634 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
635 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
636 static const Id SOLVER_WEAK = SOLVER_WEAK;
637 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
638 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
639 static const Id SOLVER_SETEV = SOLVER_SETEV;
640 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
641 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
642 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
643 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
644 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
645 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
647 Job(Pool *pool, int how, Id what) {
648 Job *job = solv_calloc(1, sizeof(*job));
655 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
656 %newobject solvables;
658 Pool *pool = $self->pool;
662 how = $self->how & SOLVER_SELECTMASK;
663 FOR_JOB_SELECT(p, pp, how, $self->what)
668 bool __eq__(Job *j) {
669 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
671 bool __ne__(Job *j) {
672 return !Job___eq__($self, j);
674 #if defined(SWIGPERL)
675 %rename("str") __str__;
677 const char *__str__() {
678 return pool_job2str($self->pool, $self->how, $self->what, 0);
680 const char *__repr__() {
681 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
682 return pool_tmpjoin($self->pool, "<Job ", str, ">");
688 return (Chksum *)solv_chksum_create(type);
690 Chksum(Id type, const char *hex) {
691 unsigned char buf[64];
692 int l = solv_chksum_len(type);
695 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
697 return (Chksum *)solv_chksum_create_from_bin(type, buf);
700 solv_chksum_free($self, 0);
704 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
705 return solv_chksum_get_type(chksum);
708 void add(const char *str) {
709 solv_chksum_add($self, str, strlen((char *)str));
711 void add_fp(FILE *fp) {
714 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
715 solv_chksum_add($self, buf, l);
716 rewind(fp); /* convenience */
718 void add_fd(int fd) {
721 while ((l = read(fd, buf, sizeof(buf))) > 0)
722 solv_chksum_add($self, buf, l);
723 lseek(fd, 0, 0); /* convenience */
725 void add_stat(const char *filename) {
727 if (stat(filename, &stb))
728 memset(&stb, 0, sizeof(stb));
729 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
730 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
731 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
732 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
736 const unsigned char *b;
737 b = solv_chksum_get($self, &l);
738 return cdata_void((void *)b, l);
743 const unsigned char *b;
746 b = solv_chksum_get($self, &l);
747 ret = solv_malloc(2 * l + 1);
748 solv_bin2hex(b, l, ret);
752 bool __eq__(Chksum *chk) {
754 const unsigned char *b, *bo;
757 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
759 b = solv_chksum_get($self, &l);
760 bo = solv_chksum_get(chk, 0);
761 return memcmp(b, bo, l) == 0;
763 bool __ne__(Chksum *chk) {
764 return !Chksum___eq__($self, chk);
766 #if defined(SWIGRUBY)
767 %rename("to_s") __str__;
768 %rename("inspect") __repr__;
770 #if defined(SWIGPERL)
771 %rename("str") __str__;
774 const char *__str__() {
777 if (solv_chksum_isfinished($self))
778 h = Chksum_hex($self);
779 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
780 solv_free((void *)h);
784 const char *__repr__() {
785 const char *h = Chksum___str__($self);
786 const char *str = solv_dupjoin("<Chksum ", h, ">");
787 solv_free((void *)h);
794 Pool *pool = pool_create();
799 void set_debuglevel(int level) {
800 pool_setdebuglevel($self, level);
802 #if defined(SWIGPYTHON)
804 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
805 XRepodata *xd = new_XRepodata(data->repo, data - data->repo->repodata);
806 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
807 PyObject *result = PyEval_CallObject((PyObject *)d, args);
812 return 0; /* exception */
813 ecode = SWIG_AsVal_int(result, &vresult);
815 return SWIG_IsOK(ecode) ? vresult : 0;
818 void set_loadcallback(PyObject *callable) {
819 if ($self->loadcallback == loadcallback) {
820 Py_DECREF($self->loadcallbackdata);
825 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
828 #if defined(SWIGPERL)
830 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
834 XRepodata *xd = new_XRepodata(data->repo, data - data->repo->repodata);
839 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
841 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
851 void set_loadcallback(SV *callable) {
852 if ($self->loadcallback == loadcallback)
853 SvREFCNT_dec($self->loadcallbackdata);
855 SvREFCNT_inc(callable);
856 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
860 #if defined(SWIGRUBY)
862 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
863 XRepodata *xd = new_XRepodata(data->repo, data - data->repo->repodata);
864 VALUE callable = (VALUE)d;
865 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
866 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
869 SWIGINTERN void mark_Pool(void *ptr) {
871 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
872 VALUE callable = (VALUE)pool->loadcallbackdata;
873 rb_gc_mark(callable);
877 %typemap(in, numinputs=0) VALUE callable {
878 $1 = rb_block_given_p() ? rb_block_proc() : 0;
880 void set_loadcallback(VALUE callable) {
881 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
886 Pool_set_loadcallback($self, 0);
889 Id str2id(const char *str, bool create=1) {
890 return pool_str2id($self, str, create);
892 const char *id2str(Id id) {
893 return pool_id2str($self, id);
895 const char *dep2str(Id id) {
896 return pool_dep2str($self, id);
898 Id rel2id(Id name, Id evr, int flags, bool create=1) {
899 return pool_rel2id($self, name, evr, flags, create);
901 Id id2langid(Id id, const char *lang, bool create=1) {
902 return pool_id2langid($self, id, lang, create);
904 void setarch(const char *arch) {
905 pool_setarch($self, arch);
907 Repo *add_repo(const char *name) {
908 return repo_create($self, name);
910 const char *lookup_str(Id entry, Id keyname) {
911 return pool_lookup_str($self, entry, keyname);
913 Id lookup_id(Id entry, Id keyname) {
914 return pool_lookup_id($self, entry, keyname);
916 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
917 return pool_lookup_num($self, entry, keyname, notfound);
919 bool lookup_void(Id entry, Id keyname) {
920 return pool_lookup_void($self, entry, keyname);
922 %newobject lookup_checksum;
923 Chksum *lookup_checksum(Id entry, Id keyname) {
925 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
926 return solv_chksum_create_from_bin(type, b);
929 %newobject Dataiterator;
930 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
931 return new_Dataiterator($self, 0, p, key, match, flags);
933 const char *solvid2str(Id solvid) {
934 return pool_solvid2str($self, solvid);
936 void addfileprovides() {
937 pool_addfileprovides($self);
939 Queue addfileprovides_ids() {
941 Id *addedfileprovides = 0;
943 pool_addfileprovides_ids($self, $self->installed, &addedfileprovides);
944 if (addedfileprovides) {
945 for (; *addedfileprovides; addedfileprovides++)
946 queue_push(&r, *addedfileprovides);
950 void createwhatprovides() {
951 pool_createwhatprovides($self);
954 XSolvable *id2solvable(Id id) {
955 return new_XSolvable($self, id);
957 %newobject solvables;
958 Pool_solvable_iterator * const solvables;
960 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
961 return new_Pool_solvable_iterator(pool);
964 %newobject solvables_iter;
965 Pool_solvable_iterator * solvables_iter() {
966 return new_Pool_solvable_iterator($self);
969 Repo *id2repo(Id id) {
970 if (id < 1 || id >= $self->nrepos)
972 return pool_id2repo($self, id);
975 Pool_repo_iterator * const repos;
977 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
978 return new_Pool_repo_iterator(pool);
981 %newobject repos_iter;
982 Pool_repo_iterator * repos_iter() {
983 return new_Pool_repo_iterator($self);
988 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
989 pool_set_installed(pool, installed);
991 Repo *Pool_installed_get(Pool *pool) {
992 return pool->installed;
996 Queue matchprovidingids(const char *match, int flags) {
1002 for (id = 1; id < pool->ss.nstrings; id++)
1003 if (pool->whatprovides[id])
1007 if (!datamatcher_init(&ma, match, flags)) {
1008 for (id = 1; id < pool->ss.nstrings; id++)
1009 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1011 datamatcher_free(&ma);
1017 Job *Job(int how, Id what) {
1018 return new_Job($self, how, what);
1021 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1022 %newobject whatprovides;
1023 Queue whatprovides(Id dep) {
1028 FOR_PROVIDES(p, pp, dep)
1033 Id towhatprovides(Queue q) {
1034 return pool_queuetowhatprovides($self, &q);
1038 %rename("isknownarch?") isknownarch;
1040 bool isknownarch(Id id) {
1042 if (!id || id == ID_EMPTY)
1044 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1046 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1053 return solver_create($self);
1058 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1059 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1060 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1061 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1062 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1063 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1064 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1065 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS ; /* repo_solv */
1067 void free(bool reuseids = 0) {
1068 repo_free($self, reuseids);
1070 void empty(bool reuseids = 0) {
1071 repo_empty($self, reuseids);
1074 %rename("isempty?") isempty;
1077 return !$self->nsolvables;
1079 bool add_solv(const char *name, int flags = 0) {
1080 FILE *fp = fopen(name, "r");
1084 r = repo_add_solv_flags($self, fp, flags);
1088 bool add_solv(FILE *fp, int flags = 0) {
1089 return repo_add_solv_flags($self, fp, flags) == 0;
1091 bool add_products(const char *proddir, int flags = 0) {
1092 repo_add_products($self, proddir, 0, flags);
1095 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1096 repo_add_rpmmd($self, fp, language, flags);
1100 bool add_rpmdb(Repo *ref, int flags = 0) {
1101 repo_add_rpmdb($self, ref, 0, flags);
1104 Id add_rpm(const char *name, int flags = 0) {
1105 return repo_add_rpm($self, name, flags);
1108 bool add_debdb(int flags = 0) {
1109 repo_add_debdb($self, 0, flags);
1112 Id add_deb(const char *name, int flags = 0) {
1113 return repo_add_deb($self, name, flags);
1115 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1116 repo_add_susetags($self, fp, defvendor, language, flags);
1119 bool add_repomdxml(FILE *fp, int flags = 0) {
1120 repo_add_repomdxml($self, fp, flags);
1123 bool add_content(FILE *fp, int flags = 0) {
1124 repo_add_content($self, fp, flags);
1127 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1128 repo_add_updateinfoxml($self, fp, flags);
1131 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1132 repo_add_deltainfoxml($self, fp, flags);
1135 void internalize() {
1136 repo_internalize($self);
1138 const char *lookup_str(Id entry, Id keyname) {
1139 return repo_lookup_str($self, entry, keyname);
1141 Id lookup_id(Id entry, Id keyname) {
1142 return repo_lookup_id($self, entry, keyname);
1144 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1145 return repo_lookup_num($self, entry, keyname, notfound);
1147 void write(FILE *fp) {
1148 repo_write($self, fp, repo_write_stdkeyfilter, 0, 0);
1150 # HACK, remove if no longer needed!
1151 bool write_first_repodata(FILE *fp) {
1152 int oldnrepodata = $self->nrepodata;
1153 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1154 repo_write($self, fp, repo_write_stdkeyfilter, 0, 0);
1155 $self->nrepodata = oldnrepodata;
1159 %newobject Dataiterator;
1160 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1161 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1166 SWIGINTERN Id Repo_id_get(Repo *repo) {
1167 return repo->repoid;
1170 Repo_solvable_iterator * const solvables;
1172 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1173 return new_Repo_solvable_iterator(repo);
1176 %newobject solvables_iter;
1177 Repo_solvable_iterator *solvables_iter() {
1178 return new_Repo_solvable_iterator($self);
1181 XRepodata *add_repodata(int flags = 0) {
1182 Repodata *rd = repo_add_repodata($self, flags);
1183 return new_XRepodata($self, rd - $self->repodata);
1186 void create_stubs() {
1188 if (!$self->nrepodata)
1190 data = $self->repodata + ($self->nrepodata - 1);
1191 if (data->state != REPODATA_STUB)
1192 repodata_create_stubs(data);
1195 %rename("iscontiguous?") iscontiguous;
1197 bool iscontiguous() {
1199 for (i = $self->start; i < $self->end; i++)
1200 if ($self->pool->solvables[i].repo != $self)
1204 XRepodata *first_repodata() {
1206 if ($self->nrepodata < 2)
1208 /* make sure all repodatas but the first are extensions */
1209 if ($self->repodata[1].loadcallback)
1211 for (i = 2; i < $self->nrepodata; i++)
1212 if (!$self->repodata[i].loadcallback)
1213 return 0; /* oops, not an extension */
1214 return new_XRepodata($self, 1);
1217 bool __eq__(Repo *repo) {
1218 return $self == repo;
1220 bool __ne__(Repo *repo) {
1221 return $self != repo;
1223 #if defined(SWIGPERL)
1224 %rename("str") __str__;
1227 const char *__str__() {
1230 return solv_strdup($self->name);
1231 sprintf(buf, "Repo#%d", $self->repoid);
1232 return solv_strdup(buf);
1234 %newobject __repr__;
1235 const char *__repr__() {
1239 sprintf(buf, "<Repo #%d ", $self->repoid);
1240 return solv_dupjoin(buf, $self->name, ">");
1242 sprintf(buf, "<Repo #%d>", $self->repoid);
1243 return solv_strdup(buf);
1247 %extend Dataiterator {
1248 static const int SEARCH_STRING = SEARCH_STRING;
1249 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1250 static const int SEARCH_GLOB = SEARCH_GLOB;
1251 static const int SEARCH_REGEX = SEARCH_REGEX;
1252 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1253 static const int SEARCH_FILES = SEARCH_FILES;
1254 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1256 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1257 Dataiterator *di = solv_calloc(1, sizeof(*di));
1258 dataiterator_init(di, pool, repo, p, key, match, flags);
1262 dataiterator_free($self);
1265 #if defined(SWIGPYTHON)
1266 %newobject __iter__;
1267 Dataiterator *__iter__() {
1269 ndi = solv_calloc(1, sizeof(*ndi));
1270 dataiterator_init_clone(ndi, $self);
1273 %rename("next") __next__();
1274 %exception __next__ {
1277 PyErr_SetString(PyExc_StopIteration,"no more matches");
1284 perliter(solv::Dataiterator)
1287 %newobject __next__;
1288 Datamatch *__next__() {
1290 if (!dataiterator_step($self)) {
1293 ndi = solv_calloc(1, sizeof(*ndi));
1294 dataiterator_init_clone(ndi, $self);
1300 while ((d = Dataiterator___next__($self)) != 0) {
1301 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1305 void prepend_keyname(Id key) {
1306 dataiterator_prepend_keyname($self, key);
1308 void skip_solvable() {
1309 dataiterator_skip_solvable($self);
1315 dataiterator_free($self);
1318 %newobject solvable;
1319 XSolvable * const solvable;
1321 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1322 return new_XSolvable(di->pool, di->solvid);
1326 return $self->key->name;
1328 const char *key_idstr() {
1329 return pool_id2str($self->pool, $self->key->name);
1332 return $self->key->type;
1334 const char *type_idstr() {
1335 return pool_id2str($self->pool, $self->key->type);
1338 return $self->kv.id;
1340 const char *idstr() {
1341 return pool_id2str($self->pool, $self->kv.id);
1344 return $self->kv.str;
1347 return $self->kv.num;
1350 return $self->kv.num2;
1353 dataiterator_setpos($self);
1355 void setpos_parent() {
1356 dataiterator_setpos_parent($self);
1360 %extend Pool_solvable_iterator {
1361 Pool_solvable_iterator(Pool *pool) {
1362 Pool_solvable_iterator *s;
1363 s = solv_calloc(1, sizeof(*s));
1367 #if defined(SWIGPYTHON)
1368 %newobject __iter__;
1369 Pool_solvable_iterator *__iter__() {
1370 Pool_solvable_iterator *s;
1371 s = solv_calloc(1, sizeof(*s));
1375 %rename("next") __next__();
1376 %exception __next__ {
1379 PyErr_SetString(PyExc_StopIteration,"no more matches");
1386 perliter(solv::Pool_solvable_iterator)
1388 %newobject __next__;
1389 XSolvable *__next__() {
1390 Pool *pool = $self->pool;
1391 if ($self->id >= pool->nsolvables)
1393 while (++$self->id < pool->nsolvables)
1394 if (pool->solvables[$self->id].repo)
1395 return new_XSolvable(pool, $self->id);
1401 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1402 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1406 %newobject __getitem__;
1407 XSolvable *__getitem__(Id key) {
1408 Pool *pool = $self->pool;
1409 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1410 return new_XSolvable(pool, key);
1414 return $self->pool->nsolvables;
1418 %extend Pool_repo_iterator {
1419 Pool_repo_iterator(Pool *pool) {
1420 Pool_repo_iterator *s;
1421 s = solv_calloc(1, sizeof(*s));
1425 #if defined(SWIGPYTHON)
1426 %newobject __iter__;
1427 Pool_repo_iterator *__iter__() {
1428 Pool_repo_iterator *s;
1429 s = solv_calloc(1, sizeof(*s));
1433 %rename("next") __next__();
1434 %exception __next__ {
1437 PyErr_SetString(PyExc_StopIteration,"no more matches");
1442 %newobject __next__;
1444 Pool *pool = $self->pool;
1445 if ($self->id >= pool->nrepos)
1447 while (++$self->id < pool->nrepos) {
1448 Repo *r = pool_id2repo(pool, $self->id);
1457 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1458 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p__Repo, SWIG_POINTER_OWN | 0));
1462 Repo *__getitem__(Id key) {
1463 Pool *pool = $self->pool;
1464 if (key > 0 && key < pool->nrepos)
1465 return pool_id2repo(pool, key);
1469 return $self->pool->nrepos;
1473 %extend Repo_solvable_iterator {
1474 Repo_solvable_iterator(Repo *repo) {
1475 Repo_solvable_iterator *s;
1476 s = solv_calloc(1, sizeof(*s));
1480 #if defined(SWIGPYTHON)
1481 %newobject __iter__;
1482 Repo_solvable_iterator *__iter__() {
1483 Repo_solvable_iterator *s;
1484 s = solv_calloc(1, sizeof(*s));
1488 %rename("next") __next__();
1489 %exception __next__ {
1492 PyErr_SetString(PyExc_StopIteration,"no more matches");
1497 %newobject __next__;
1498 XSolvable *__next__() {
1499 Repo *repo = $self->repo;
1500 Pool *pool = repo->pool;
1501 if (repo->start > 0 && $self->id < repo->start)
1502 $self->id = repo->start - 1;
1503 if ($self->id >= repo->end)
1505 while (++$self->id < repo->end)
1506 if (pool->solvables[$self->id].repo == repo)
1507 return new_XSolvable(pool, $self->id);
1513 while ((n = Repo_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 Repo *repo = $self->repo;
1521 Pool *pool = repo->pool;
1522 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1523 return new_XSolvable(pool, key);
1527 return $self->repo->pool->nsolvables;
1532 Dep(Pool *pool, Id id) {
1536 s = solv_calloc(1, sizeof(*s));
1542 return pool_dep2str($self->pool, $self->id);
1544 bool __eq__(Dep *s) {
1545 return $self->pool == s->pool && $self->id == s->id;
1547 bool __ne__(Dep *s) {
1548 return !Dep___eq__($self, s);
1550 #if defined(SWIGPERL)
1551 %rename("str") __str__;
1553 const char *__str__() {
1554 return pool_dep2str($self->pool, $self->id);
1556 %newobject __repr__;
1557 const char *__repr__() {
1559 sprintf(buf, "<Id #%d ", $self->id);
1560 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1565 XSolvable(Pool *pool, Id id) {
1567 if (!id || id >= pool->nsolvables)
1569 s = solv_calloc(1, sizeof(*s));
1575 return pool_solvid2str($self->pool, $self->id);
1577 const char *lookup_str(Id keyname) {
1578 return pool_lookup_str($self->pool, $self->id, keyname);
1580 Id lookup_id(Id keyname) {
1581 return pool_lookup_id($self->pool, $self->id, keyname);
1583 unsigned int lookup_num(Id keyname, unsigned int notfound = 0) {
1584 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1586 bool lookup_void(Id keyname) {
1587 return pool_lookup_void($self->pool, $self->id, keyname);
1589 %newobject lookup_checksum;
1590 Chksum *lookup_checksum(Id keyname) {
1592 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1593 return solv_chksum_create_from_bin(type, b);
1595 const char *lookup_location(unsigned int *OUTPUT) {
1596 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1599 %rename("installable?") installable;
1601 bool installable() {
1602 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1605 %rename("isinstalled?") isinstalled;
1607 bool isinstalled() {
1608 Pool *pool = $self->pool;
1609 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1612 const char * const name;
1614 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1615 Pool *pool = xs->pool;
1616 return pool_id2str(pool, pool->solvables[xs->id].name);
1621 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1622 return xs->pool->solvables[xs->id].name;
1625 const char * const evr;
1627 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1628 Pool *pool = xs->pool;
1629 return pool_id2str(pool, pool->solvables[xs->id].evr);
1634 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1635 return xs->pool->solvables[xs->id].evr;
1638 const char * const arch;
1640 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1641 Pool *pool = xs->pool;
1642 return pool_id2str(pool, pool->solvables[xs->id].arch);
1647 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1648 return xs->pool->solvables[xs->id].arch;
1651 const char * const vendor;
1653 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1654 Pool *pool = xs->pool;
1655 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1660 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1661 return xs->pool->solvables[xs->id].vendor;
1666 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1667 return xs->pool->solvables[xs->id].repo;
1671 bool __eq__(XSolvable *s) {
1672 return $self->pool == s->pool && $self->id == s->id;
1674 bool __ne__(XSolvable *s) {
1675 return !XSolvable___eq__($self, s);
1677 #if defined(SWIGPERL)
1678 %rename("str") __str__;
1680 const char *__str__() {
1681 return pool_solvid2str($self->pool, $self->id);
1683 %newobject __repr__;
1684 const char *__repr__() {
1686 sprintf(buf, "<Solvable #%d ", $self->id);
1687 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1692 Problem(Solver *solv, Id id) {
1694 p = solv_calloc(1, sizeof(*p));
1699 %newobject findproblemrule;
1700 XRule *findproblemrule() {
1701 Id r = solver_findproblemrule($self->solv, $self->id);
1702 return new_XRule($self->solv, r);
1704 %newobject findallproblemrules;
1705 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1706 Queue findallproblemrules(int unfiltered=0) {
1707 Solver *solv = $self->solv;
1712 solver_findallproblemrules(solv, $self->id, &q);
1715 for (i = j = 0; i < q.count; i++)
1717 SolverRuleinfo rclass;
1718 probr = q.elements[i];
1719 rclass = solver_ruleclass(solv, probr);
1720 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1722 q.elements[j++] = probr;
1725 queue_truncate(&q, j);
1729 int solution_count() {
1730 return solver_solution_count($self->solv, $self->id);
1732 %newobject solutions;
1733 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1738 cnt = solver_solution_count($self->solv, $self->id);
1739 for (i = 1; i <= cnt; i++)
1746 Solution(Problem *p, Id id) {
1748 s = solv_calloc(1, sizeof(*s));
1750 s->problemid = p->id;
1754 int element_count() {
1755 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1758 %newobject elements;
1759 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1760 Queue elements(bool expandreplaces=0) {
1764 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1765 for (i = 1; i <= cnt; i++)
1768 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
1770 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
1776 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
1777 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
1779 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
1780 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1781 queue_push2(&q, p, rp);
1783 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
1784 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1785 queue_push2(&q, p, rp);
1787 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
1788 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1789 queue_push2(&q, p, rp);
1794 queue_push2(&q, i, type);
1795 queue_push2(&q, p, rp);
1801 %extend Solutionelement {
1802 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
1804 e = solv_calloc(1, sizeof(*e));
1806 e->problemid = problemid;
1817 if (p == SOLVER_SOLUTION_ERASE)
1822 else if (p == SOLVER_SOLUTION_REPLACE)
1827 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
1828 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);
1829 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
1830 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);
1831 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
1832 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);
1833 return solver_solutionelement2str($self->solv, p, rp);
1835 %newobject replaceelements;
1836 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
1837 Queue replaceelements() {
1842 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
1845 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
1846 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
1847 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1848 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
1849 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1850 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
1851 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1853 queue_push(&q, $self->type);
1856 int illegalreplace() {
1857 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
1859 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
1861 %newobject solvable;
1862 XSolvable * const solvable;
1863 %newobject replacement;
1864 XSolvable * const replacement;
1867 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
1868 return new_XSolvable(e->solv->pool, e->p);
1870 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
1871 return new_XSolvable(e->solv->pool, e->rp);
1873 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
1874 return (e->p - 1) / 2;
1879 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
1880 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->p);
1881 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
1882 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->rp);
1883 if ($self->type == SOLVER_SOLUTION_ERASE)
1884 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE, $self->p);
1890 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
1891 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
1892 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
1893 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
1894 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
1895 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
1896 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
1897 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
1898 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
1899 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
1900 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
1901 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
1902 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
1903 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
1904 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
1905 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
1906 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
1907 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
1908 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
1910 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
1911 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
1912 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
1913 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
1914 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
1915 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
1916 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
1917 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
1919 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
1920 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
1921 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
1923 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
1924 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
1925 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
1926 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
1927 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
1928 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
1929 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
1930 static const int SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED = SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED;
1931 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
1937 int set_flag(int flag, int value) {
1938 return solver_set_flag($self, flag, value);
1940 int get_flag(int flag) {
1941 return solver_get_flag($self, flag);
1943 #if defined(SWIGPYTHON)
1945 def solve(self, jobs):
1947 for job in jobs: j += [job.how, job.what]
1948 return self.solve_helper(j)
1951 #if defined(SWIGPERL)
1953 sub solv::Solver::solve {
1954 my ($self, $jobs) = @_;
1955 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1956 return $self->solve_helper(\@j);
1960 #if defined(SWIGRUBY)
1963 "class Solv::Solver\n"
1964 " def solve(jobs)\n"
1966 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1967 " solve_helper(jl)\n"
1973 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
1974 %newobject solve_helper;
1975 Queue solve_helper(Queue jobs) {
1979 solver_solve($self, &jobs);
1980 cnt = solver_problem_count($self);
1981 for (i = 1; i <= cnt; i++)
1985 %newobject transaction;
1986 Transaction *transaction() {
1987 return solver_create_transaction($self);
1991 %extend Transaction {
1992 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
1993 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
1994 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
1995 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
1996 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
1997 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
1998 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
1999 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2000 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2001 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2002 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2003 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2004 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2005 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2006 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2007 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2008 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2009 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2010 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2011 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2012 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2013 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2014 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2015 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2016 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2017 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2018 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2020 transaction_free($self);
2023 %rename("isempty?") isempty;
2026 return $self->steps.count == 0;
2029 %newobject othersolvable;
2030 XSolvable *othersolvable(XSolvable *s) {
2031 Id op = transaction_obs_pkg($self, s->id);
2032 return new_XSolvable($self->pool, op);
2035 %newobject allothersolvables;
2036 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2037 Queue allothersolvables(XSolvable *s) {
2040 transaction_all_obs_pkgs($self, s->id, &q);
2044 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2045 %newobject classify;
2046 Queue classify(int mode = 0) {
2049 transaction_classify($self, mode, &q);
2053 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2054 %newobject newpackages;
2055 Queue newpackages() {
2059 cut = transaction_installedresult(self, &q);
2060 queue_truncate(&q, cut);
2064 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2065 %newobject keptpackages;
2066 Queue keptpackages() {
2070 cut = transaction_installedresult(self, &q);
2072 queue_deleten(&q, 0, cut);
2076 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2080 queue_init_clone(&q, &$self->steps);
2084 int steptype(XSolvable *s, int mode) {
2085 return transaction_type($self, s->id, mode);
2087 int calc_installsizechange() {
2088 return transaction_calc_installsizechange($self);
2090 void order(int flags) {
2091 transaction_order($self, flags);
2095 %extend TransactionClass {
2096 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2097 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2098 cl->transaction = trans;
2102 cl->fromid = fromid;
2106 %newobject solvables;
2107 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2111 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2117 XRule(Solver *solv, Id id) {
2120 XRule *xr = solv_calloc(1, sizeof(*xr));
2126 Id type, source, target, dep;
2127 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2128 return new_Ruleinfo($self, type, source, target, dep);
2130 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2131 %newobject allinfos;
2135 solver_allruleinfos($self->solv, $self->id, &q);
2139 bool __eq__(XRule *xr) {
2140 return $self->solv == xr->solv && $self->id == xr->id;
2142 bool __ne__(XRule *xr) {
2143 return !XRule___eq__($self, xr);
2145 %newobject __repr__;
2146 const char *__repr__() {
2148 sprintf(buf, "<Rule #%d>", $self->id);
2149 return solv_strdup(buf);
2154 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2155 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2159 ri->source = source;
2160 ri->target = target;
2164 XSolvable * const solvable;
2165 XSolvable * const othersolvable;
2167 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2168 return new_XSolvable(ri->solv->pool, ri->source);
2170 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2171 return new_XSolvable(ri->solv->pool, ri->target);
2174 const char *problemstr() {
2175 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2180 XRepodata(Repo *repo, Id id) {
2181 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2187 return repodata_new_handle($self->repo->repodata + $self->id);
2189 void set_id(Id solvid, Id keyname, Id id) {
2190 repodata_set_id($self->repo->repodata + $self->id, solvid, keyname, id);
2192 void set_str(Id solvid, Id keyname, const char *str) {
2193 repodata_set_str($self->repo->repodata + $self->id, solvid, keyname, str);
2195 void set_poolstr(Id solvid, Id keyname, const char *str) {
2196 repodata_set_poolstr($self->repo->repodata + $self->id, solvid, keyname, str);
2198 void add_idarray(Id solvid, Id keyname, Id id) {
2199 repodata_add_idarray($self->repo->repodata + $self->id, solvid, keyname, id);
2201 void add_flexarray(Id solvid, Id keyname, Id handle) {
2202 repodata_add_flexarray($self->repo->repodata + $self->id, solvid, keyname, handle);
2204 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2205 const unsigned char *buf = solv_chksum_get(chksum, 0);
2207 repodata_set_bin_checksum($self->repo->repodata + $self->id, solvid, keyname, solv_chksum_get_type(chksum), buf);
2209 const char *lookup_str(Id solvid, Id keyname) {
2210 return repodata_lookup_str($self->repo->repodata + $self->id, solvid, keyname);
2212 Queue lookup_idarray(Id solvid, Id keyname) {
2215 repodata_lookup_idarray($self->repo->repodata + $self->id, solvid, keyname, &r);
2218 %newobject lookup_checksum;
2219 Chksum *lookup_checksum(Id solvid, Id keyname) {
2221 const unsigned char *b = repodata_lookup_bin_checksum($self->repo->repodata + $self->id, solvid, keyname, &type);
2222 return solv_chksum_create_from_bin(type, b);
2224 void internalize() {
2225 repodata_internalize($self->repo->repodata + $self->id);
2227 void create_stubs() {
2228 repodata_create_stubs($self->repo->repodata + $self->id);
2230 void write(FILE *fp) {
2231 repodata_write($self->repo->repodata + $self->id, fp, repo_write_stdkeyfilter, 0);
2233 bool add_solv(FILE *fp, int flags = 0) {
2234 Repodata *data = $self->repo->repodata + $self->id;
2235 int r, oldstate = data->state;
2236 data->state = REPODATA_LOADING;
2237 r = repo_add_solv_flags(data->repo, fp, flags | REPO_USE_LOADING);
2238 if (r || data->state == REPODATA_LOADING)
2239 data->state = oldstate;
2242 void extend_to_repo() {
2243 Repodata *data = $self->repo->repodata + $self->id;
2244 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2246 bool __eq__(XRepodata *xr) {
2247 return $self->repo == xr->repo && $self->id == xr->id;
2249 bool __ne__(XRepodata *xr) {
2250 return !XRepodata___eq__($self, xr);
2252 %newobject __repr__;
2253 const char *__repr__() {
2255 sprintf(buf, "<Repodata #%d>", $self->id);
2256 return solv_strdup(buf);