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 Dep *Dep(const char *str, bool create=1) {
893 Id id = pool_str2id($self, str, create);
894 return new_Dep($self, id);
896 const char *id2str(Id id) {
897 return pool_id2str($self, id);
899 const char *dep2str(Id id) {
900 return pool_dep2str($self, id);
902 Id rel2id(Id name, Id evr, int flags, bool create=1) {
903 return pool_rel2id($self, name, evr, flags, create);
905 Id id2langid(Id id, const char *lang, bool create=1) {
906 return pool_id2langid($self, id, lang, create);
908 void setarch(const char *arch) {
909 pool_setarch($self, arch);
911 Repo *add_repo(const char *name) {
912 return repo_create($self, name);
914 const char *lookup_str(Id entry, Id keyname) {
915 return pool_lookup_str($self, entry, keyname);
917 Id lookup_id(Id entry, Id keyname) {
918 return pool_lookup_id($self, entry, keyname);
920 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
921 return pool_lookup_num($self, entry, keyname, notfound);
923 bool lookup_void(Id entry, Id keyname) {
924 return pool_lookup_void($self, entry, keyname);
926 %newobject lookup_checksum;
927 Chksum *lookup_checksum(Id entry, Id keyname) {
929 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
930 return solv_chksum_create_from_bin(type, b);
933 %newobject Dataiterator;
934 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
935 return new_Dataiterator($self, 0, p, key, match, flags);
937 const char *solvid2str(Id solvid) {
938 return pool_solvid2str($self, solvid);
940 void addfileprovides() {
941 pool_addfileprovides($self);
943 Queue addfileprovides_ids() {
945 Id *addedfileprovides = 0;
947 pool_addfileprovides_ids($self, $self->installed, &addedfileprovides);
948 if (addedfileprovides) {
949 for (; *addedfileprovides; addedfileprovides++)
950 queue_push(&r, *addedfileprovides);
954 void createwhatprovides() {
955 pool_createwhatprovides($self);
958 XSolvable *id2solvable(Id id) {
959 return new_XSolvable($self, id);
961 %newobject solvables;
962 Pool_solvable_iterator * const solvables;
964 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
965 return new_Pool_solvable_iterator(pool);
968 %newobject solvables_iter;
969 Pool_solvable_iterator * solvables_iter() {
970 return new_Pool_solvable_iterator($self);
973 Repo *id2repo(Id id) {
974 if (id < 1 || id >= $self->nrepos)
976 return pool_id2repo($self, id);
979 Pool_repo_iterator * const repos;
981 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
982 return new_Pool_repo_iterator(pool);
985 %newobject repos_iter;
986 Pool_repo_iterator * repos_iter() {
987 return new_Pool_repo_iterator($self);
992 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
993 pool_set_installed(pool, installed);
995 Repo *Pool_installed_get(Pool *pool) {
996 return pool->installed;
1000 Queue matchprovidingids(const char *match, int flags) {
1006 for (id = 1; id < pool->ss.nstrings; id++)
1007 if (pool->whatprovides[id])
1011 if (!datamatcher_init(&ma, match, flags)) {
1012 for (id = 1; id < pool->ss.nstrings; id++)
1013 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1015 datamatcher_free(&ma);
1021 Job *Job(int how, Id what) {
1022 return new_Job($self, how, what);
1025 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1026 %newobject whatprovides;
1027 Queue whatprovides(Id dep) {
1032 FOR_PROVIDES(p, pp, dep)
1037 Id towhatprovides(Queue q) {
1038 return pool_queuetowhatprovides($self, &q);
1042 %rename("isknownarch?") isknownarch;
1044 bool isknownarch(Id id) {
1046 if (!id || id == ID_EMPTY)
1048 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1050 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1057 return solver_create($self);
1062 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1063 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1064 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1065 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1066 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1067 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1068 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1069 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS ; /* repo_solv */
1071 void free(bool reuseids = 0) {
1072 repo_free($self, reuseids);
1074 void empty(bool reuseids = 0) {
1075 repo_empty($self, reuseids);
1078 %rename("isempty?") isempty;
1081 return !$self->nsolvables;
1083 bool add_solv(const char *name, int flags = 0) {
1084 FILE *fp = fopen(name, "r");
1088 r = repo_add_solv_flags($self, fp, flags);
1092 bool add_solv(FILE *fp, int flags = 0) {
1093 return repo_add_solv_flags($self, fp, flags) == 0;
1096 XSolvable *add_solvable() {
1097 Id solvid = repo_add_solvable($self);
1098 return new_XSolvable($self->pool, solvid);
1101 bool add_products(const char *proddir, int flags = 0) {
1102 repo_add_products($self, proddir, 0, flags);
1105 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1106 repo_add_rpmmd($self, fp, language, flags);
1110 bool add_rpmdb(Repo *ref, int flags = 0) {
1111 repo_add_rpmdb($self, ref, 0, flags);
1114 Id add_rpm(const char *name, int flags = 0) {
1115 return repo_add_rpm($self, name, flags);
1118 bool add_debdb(int flags = 0) {
1119 repo_add_debdb($self, 0, flags);
1122 Id add_deb(const char *name, int flags = 0) {
1123 return repo_add_deb($self, name, flags);
1125 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1126 repo_add_susetags($self, fp, defvendor, language, flags);
1129 bool add_repomdxml(FILE *fp, int flags = 0) {
1130 repo_add_repomdxml($self, fp, flags);
1133 bool add_content(FILE *fp, int flags = 0) {
1134 repo_add_content($self, fp, flags);
1137 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1138 repo_add_updateinfoxml($self, fp, flags);
1141 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1142 repo_add_deltainfoxml($self, fp, flags);
1145 void internalize() {
1146 repo_internalize($self);
1148 const char *lookup_str(Id entry, Id keyname) {
1149 return repo_lookup_str($self, entry, keyname);
1151 Id lookup_id(Id entry, Id keyname) {
1152 return repo_lookup_id($self, entry, keyname);
1154 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
1155 return repo_lookup_num($self, entry, keyname, notfound);
1157 void write(FILE *fp) {
1158 repo_write($self, fp, repo_write_stdkeyfilter, 0, 0);
1160 # HACK, remove if no longer needed!
1161 bool write_first_repodata(FILE *fp) {
1162 int oldnrepodata = $self->nrepodata;
1163 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1164 repo_write($self, fp, repo_write_stdkeyfilter, 0, 0);
1165 $self->nrepodata = oldnrepodata;
1169 %newobject Dataiterator;
1170 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
1171 return new_Dataiterator($self->pool, $self, p, key, match, flags);
1176 SWIGINTERN Id Repo_id_get(Repo *repo) {
1177 return repo->repoid;
1180 Repo_solvable_iterator * const solvables;
1182 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1183 return new_Repo_solvable_iterator(repo);
1186 %newobject solvables_iter;
1187 Repo_solvable_iterator *solvables_iter() {
1188 return new_Repo_solvable_iterator($self);
1191 XRepodata *add_repodata(int flags = 0) {
1192 Repodata *rd = repo_add_repodata($self, flags);
1193 return new_XRepodata($self, rd - $self->repodata);
1196 void create_stubs() {
1198 if (!$self->nrepodata)
1200 data = $self->repodata + ($self->nrepodata - 1);
1201 if (data->state != REPODATA_STUB)
1202 repodata_create_stubs(data);
1205 %rename("iscontiguous?") iscontiguous;
1207 bool iscontiguous() {
1209 for (i = $self->start; i < $self->end; i++)
1210 if ($self->pool->solvables[i].repo != $self)
1214 XRepodata *first_repodata() {
1216 if ($self->nrepodata < 2)
1218 /* make sure all repodatas but the first are extensions */
1219 if ($self->repodata[1].loadcallback)
1221 for (i = 2; i < $self->nrepodata; i++)
1222 if (!$self->repodata[i].loadcallback)
1223 return 0; /* oops, not an extension */
1224 return new_XRepodata($self, 1);
1227 bool __eq__(Repo *repo) {
1228 return $self == repo;
1230 bool __ne__(Repo *repo) {
1231 return $self != repo;
1233 #if defined(SWIGPERL)
1234 %rename("str") __str__;
1237 const char *__str__() {
1240 return solv_strdup($self->name);
1241 sprintf(buf, "Repo#%d", $self->repoid);
1242 return solv_strdup(buf);
1244 %newobject __repr__;
1245 const char *__repr__() {
1249 sprintf(buf, "<Repo #%d ", $self->repoid);
1250 return solv_dupjoin(buf, $self->name, ">");
1252 sprintf(buf, "<Repo #%d>", $self->repoid);
1253 return solv_strdup(buf);
1257 %extend Dataiterator {
1258 static const int SEARCH_STRING = SEARCH_STRING;
1259 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1260 static const int SEARCH_GLOB = SEARCH_GLOB;
1261 static const int SEARCH_REGEX = SEARCH_REGEX;
1262 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1263 static const int SEARCH_FILES = SEARCH_FILES;
1264 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1266 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1267 Dataiterator *di = solv_calloc(1, sizeof(*di));
1268 dataiterator_init(di, pool, repo, p, key, match, flags);
1272 dataiterator_free($self);
1275 #if defined(SWIGPYTHON)
1276 %newobject __iter__;
1277 Dataiterator *__iter__() {
1279 ndi = solv_calloc(1, sizeof(*ndi));
1280 dataiterator_init_clone(ndi, $self);
1283 %rename("next") __next__();
1284 %exception __next__ {
1287 PyErr_SetString(PyExc_StopIteration,"no more matches");
1294 perliter(solv::Dataiterator)
1297 %newobject __next__;
1298 Datamatch *__next__() {
1300 if (!dataiterator_step($self)) {
1303 ndi = solv_calloc(1, sizeof(*ndi));
1304 dataiterator_init_clone(ndi, $self);
1310 while ((d = Dataiterator___next__($self)) != 0) {
1311 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1315 void prepend_keyname(Id key) {
1316 dataiterator_prepend_keyname($self, key);
1318 void skip_solvable() {
1319 dataiterator_skip_solvable($self);
1325 dataiterator_free($self);
1328 %newobject solvable;
1329 XSolvable * const solvable;
1331 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1332 return new_XSolvable(di->pool, di->solvid);
1336 return $self->key->name;
1338 const char *key_idstr() {
1339 return pool_id2str($self->pool, $self->key->name);
1342 return $self->key->type;
1344 const char *type_idstr() {
1345 return pool_id2str($self->pool, $self->key->type);
1348 return $self->kv.id;
1350 const char *idstr() {
1351 return pool_id2str($self->pool, $self->kv.id);
1354 return $self->kv.str;
1357 return $self->kv.num;
1360 return $self->kv.num2;
1363 dataiterator_setpos($self);
1365 void setpos_parent() {
1366 dataiterator_setpos_parent($self);
1370 %extend Pool_solvable_iterator {
1371 Pool_solvable_iterator(Pool *pool) {
1372 Pool_solvable_iterator *s;
1373 s = solv_calloc(1, sizeof(*s));
1377 #if defined(SWIGPYTHON)
1378 %newobject __iter__;
1379 Pool_solvable_iterator *__iter__() {
1380 Pool_solvable_iterator *s;
1381 s = solv_calloc(1, sizeof(*s));
1385 %rename("next") __next__();
1386 %exception __next__ {
1389 PyErr_SetString(PyExc_StopIteration,"no more matches");
1396 perliter(solv::Pool_solvable_iterator)
1398 %newobject __next__;
1399 XSolvable *__next__() {
1400 Pool *pool = $self->pool;
1401 if ($self->id >= pool->nsolvables)
1403 while (++$self->id < pool->nsolvables)
1404 if (pool->solvables[$self->id].repo)
1405 return new_XSolvable(pool, $self->id);
1411 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1412 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1416 %newobject __getitem__;
1417 XSolvable *__getitem__(Id key) {
1418 Pool *pool = $self->pool;
1419 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1420 return new_XSolvable(pool, key);
1424 return $self->pool->nsolvables;
1428 %extend Pool_repo_iterator {
1429 Pool_repo_iterator(Pool *pool) {
1430 Pool_repo_iterator *s;
1431 s = solv_calloc(1, sizeof(*s));
1435 #if defined(SWIGPYTHON)
1436 %newobject __iter__;
1437 Pool_repo_iterator *__iter__() {
1438 Pool_repo_iterator *s;
1439 s = solv_calloc(1, sizeof(*s));
1443 %rename("next") __next__();
1444 %exception __next__ {
1447 PyErr_SetString(PyExc_StopIteration,"no more matches");
1452 %newobject __next__;
1454 Pool *pool = $self->pool;
1455 if ($self->id >= pool->nrepos)
1457 while (++$self->id < pool->nrepos) {
1458 Repo *r = pool_id2repo(pool, $self->id);
1467 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1468 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p__Repo, SWIG_POINTER_OWN | 0));
1472 Repo *__getitem__(Id key) {
1473 Pool *pool = $self->pool;
1474 if (key > 0 && key < pool->nrepos)
1475 return pool_id2repo(pool, key);
1479 return $self->pool->nrepos;
1483 %extend Repo_solvable_iterator {
1484 Repo_solvable_iterator(Repo *repo) {
1485 Repo_solvable_iterator *s;
1486 s = solv_calloc(1, sizeof(*s));
1490 #if defined(SWIGPYTHON)
1491 %newobject __iter__;
1492 Repo_solvable_iterator *__iter__() {
1493 Repo_solvable_iterator *s;
1494 s = solv_calloc(1, sizeof(*s));
1498 %rename("next") __next__();
1499 %exception __next__ {
1502 PyErr_SetString(PyExc_StopIteration,"no more matches");
1507 %newobject __next__;
1508 XSolvable *__next__() {
1509 Repo *repo = $self->repo;
1510 Pool *pool = repo->pool;
1511 if (repo->start > 0 && $self->id < repo->start)
1512 $self->id = repo->start - 1;
1513 if ($self->id >= repo->end)
1515 while (++$self->id < repo->end)
1516 if (pool->solvables[$self->id].repo == repo)
1517 return new_XSolvable(pool, $self->id);
1523 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1524 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1528 %newobject __getitem__;
1529 XSolvable *__getitem__(Id key) {
1530 Repo *repo = $self->repo;
1531 Pool *pool = repo->pool;
1532 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1533 return new_XSolvable(pool, key);
1537 return $self->repo->pool->nsolvables;
1542 Dep(Pool *pool, Id id) {
1546 s = solv_calloc(1, sizeof(*s));
1552 return pool_dep2str($self->pool, $self->id);
1554 bool __eq__(Dep *s) {
1555 return $self->pool == s->pool && $self->id == s->id;
1557 bool __ne__(Dep *s) {
1558 return !Dep___eq__($self, s);
1560 #if defined(SWIGPERL)
1561 %rename("str") __str__;
1563 const char *__str__() {
1564 return pool_dep2str($self->pool, $self->id);
1566 %newobject __repr__;
1567 const char *__repr__() {
1569 sprintf(buf, "<Id #%d ", $self->id);
1570 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1575 XSolvable(Pool *pool, Id id) {
1577 if (!id || id >= pool->nsolvables)
1579 s = solv_calloc(1, sizeof(*s));
1585 return pool_solvid2str($self->pool, $self->id);
1587 const char *lookup_str(Id keyname) {
1588 return pool_lookup_str($self->pool, $self->id, keyname);
1590 Id lookup_id(Id keyname) {
1591 return pool_lookup_id($self->pool, $self->id, keyname);
1593 unsigned int lookup_num(Id keyname, unsigned int notfound = 0) {
1594 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1596 bool lookup_void(Id keyname) {
1597 return pool_lookup_void($self->pool, $self->id, keyname);
1599 %newobject lookup_checksum;
1600 Chksum *lookup_checksum(Id keyname) {
1602 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1603 return solv_chksum_create_from_bin(type, b);
1605 const char *lookup_location(unsigned int *OUTPUT) {
1606 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1609 %rename("installable?") installable;
1611 bool installable() {
1612 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1615 %rename("isinstalled?") isinstalled;
1617 bool isinstalled() {
1618 Pool *pool = $self->pool;
1619 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1624 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
1625 Pool *pool = xs->pool;
1626 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
1628 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1629 Pool *pool = xs->pool;
1630 return pool_id2str(pool, pool->solvables[xs->id].name);
1635 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
1636 xs->pool->solvables[xs->id].name = nameid;
1638 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1639 return xs->pool->solvables[xs->id].name;
1644 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
1645 Pool *pool = xs->pool;
1646 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
1648 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1649 Pool *pool = xs->pool;
1650 return pool_id2str(pool, pool->solvables[xs->id].evr);
1655 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
1656 xs->pool->solvables[xs->id].evr = evrid;
1658 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1659 return xs->pool->solvables[xs->id].evr;
1664 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
1665 Pool *pool = xs->pool;
1666 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
1668 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1669 Pool *pool = xs->pool;
1670 return pool_id2str(pool, pool->solvables[xs->id].arch);
1675 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
1676 xs->pool->solvables[xs->id].arch = archid;
1678 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1679 return xs->pool->solvables[xs->id].arch;
1684 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
1685 Pool *pool = xs->pool;
1686 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
1688 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1689 Pool *pool = xs->pool;
1690 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1695 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
1696 xs->pool->solvables[xs->id].vendor = vendorid;
1698 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1699 return xs->pool->solvables[xs->id].vendor;
1704 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1705 return xs->pool->solvables[xs->id].repo;
1709 void add_provides(Dep *dep, Id marker = -SOLVABLE_FILEMARKER) {
1710 Solvable *s = $self->pool->solvables + $self->id;
1711 s->provides = repo_addid_dep(s->repo, s->provides, dep->id, marker);
1713 void add_providesid(Id id, Id marker = -SOLVABLE_FILEMARKER) {
1714 Solvable *s = $self->pool->solvables + $self->id;
1715 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
1717 void add_obsoletes(Dep *dep) {
1718 Solvable *s = $self->pool->solvables + $self->id;
1719 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, dep->id, 0);
1721 void add_obsoletesid(Id id) {
1722 Solvable *s = $self->pool->solvables + $self->id;
1723 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
1725 void add_conflicts(Dep *dep) {
1726 Solvable *s = $self->pool->solvables + $self->id;
1727 s->conflicts = repo_addid_dep(s->repo, s->conflicts, dep->id, 0);
1729 void add_conflictsid(Id id) {
1730 Solvable *s = $self->pool->solvables + $self->id;
1731 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
1733 void add_requires(Dep *dep, Id marker = -SOLVABLE_PREREQMARKER) {
1734 Solvable *s = $self->pool->solvables + $self->id;
1735 s->requires = repo_addid_dep(s->repo, s->requires, dep->id, marker);
1737 void add_requiresid(Id id, Id marker = -SOLVABLE_PREREQMARKER) {
1738 Solvable *s = $self->pool->solvables + $self->id;
1739 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
1741 void add_recommends(Dep *dep) {
1742 Solvable *s = $self->pool->solvables + $self->id;
1743 s->recommends = repo_addid_dep(s->repo, s->recommends, dep->id, 0);
1745 void add_recommendsid(Id id) {
1746 Solvable *s = $self->pool->solvables + $self->id;
1747 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
1749 void add_suggests(Dep *dep) {
1750 Solvable *s = $self->pool->solvables + $self->id;
1751 s->suggests = repo_addid_dep(s->repo, s->suggests, dep->id, 0);
1753 void add_suggestsid(Id id) {
1754 Solvable *s = $self->pool->solvables + $self->id;
1755 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
1757 void add_supplements(Dep *dep) {
1758 Solvable *s = $self->pool->solvables + $self->id;
1759 s->supplements = repo_addid_dep(s->repo, s->supplements, dep->id, 0);
1761 void add_supplementsid(Id id) {
1762 Solvable *s = $self->pool->solvables + $self->id;
1763 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
1765 void add_enhances(Dep *dep) {
1766 Solvable *s = $self->pool->solvables + $self->id;
1767 s->enhances = repo_addid_dep(s->repo, s->enhances, dep->id, 0);
1769 void add_enhancesid(Id id) {
1770 Solvable *s = $self->pool->solvables + $self->id;
1771 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
1774 bool __eq__(XSolvable *s) {
1775 return $self->pool == s->pool && $self->id == s->id;
1777 bool __ne__(XSolvable *s) {
1778 return !XSolvable___eq__($self, s);
1780 #if defined(SWIGPERL)
1781 %rename("str") __str__;
1783 const char *__str__() {
1784 return pool_solvid2str($self->pool, $self->id);
1786 %newobject __repr__;
1787 const char *__repr__() {
1789 sprintf(buf, "<Solvable #%d ", $self->id);
1790 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1795 Problem(Solver *solv, Id id) {
1797 p = solv_calloc(1, sizeof(*p));
1802 %newobject findproblemrule;
1803 XRule *findproblemrule() {
1804 Id r = solver_findproblemrule($self->solv, $self->id);
1805 return new_XRule($self->solv, r);
1807 %newobject findallproblemrules;
1808 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1809 Queue findallproblemrules(int unfiltered=0) {
1810 Solver *solv = $self->solv;
1815 solver_findallproblemrules(solv, $self->id, &q);
1818 for (i = j = 0; i < q.count; i++)
1820 SolverRuleinfo rclass;
1821 probr = q.elements[i];
1822 rclass = solver_ruleclass(solv, probr);
1823 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
1825 q.elements[j++] = probr;
1828 queue_truncate(&q, j);
1832 int solution_count() {
1833 return solver_solution_count($self->solv, $self->id);
1835 %newobject solutions;
1836 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1841 cnt = solver_solution_count($self->solv, $self->id);
1842 for (i = 1; i <= cnt; i++)
1849 Solution(Problem *p, Id id) {
1851 s = solv_calloc(1, sizeof(*s));
1853 s->problemid = p->id;
1857 int element_count() {
1858 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1861 %newobject elements;
1862 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1863 Queue elements(bool expandreplaces=0) {
1867 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1868 for (i = 1; i <= cnt; i++)
1871 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
1873 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
1879 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
1880 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
1882 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
1883 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1884 queue_push2(&q, p, rp);
1886 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
1887 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1888 queue_push2(&q, p, rp);
1890 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
1891 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1892 queue_push2(&q, p, rp);
1897 queue_push2(&q, i, type);
1898 queue_push2(&q, p, rp);
1904 %extend Solutionelement {
1905 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
1907 e = solv_calloc(1, sizeof(*e));
1909 e->problemid = problemid;
1920 if (p == SOLVER_SOLUTION_ERASE)
1925 else if (p == SOLVER_SOLUTION_REPLACE)
1930 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
1931 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);
1932 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
1933 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);
1934 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
1935 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);
1936 return solver_solutionelement2str($self->solv, p, rp);
1938 %newobject replaceelements;
1939 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
1940 Queue replaceelements() {
1945 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
1948 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
1949 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
1950 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1951 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
1952 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1953 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
1954 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1956 queue_push(&q, $self->type);
1959 int illegalreplace() {
1960 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
1962 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
1964 %newobject solvable;
1965 XSolvable * const solvable;
1966 %newobject replacement;
1967 XSolvable * const replacement;
1970 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
1971 return new_XSolvable(e->solv->pool, e->p);
1973 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
1974 return new_XSolvable(e->solv->pool, e->rp);
1976 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
1977 if (e->type != SOLVER_SOLUTION_JOB)
1979 return (e->p - 1) / 2;
1984 if ($self->type == SOLVER_SOLUTION_JOB)
1985 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
1986 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
1987 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->p);
1988 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
1989 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->rp);
1990 if ($self->type == SOLVER_SOLUTION_ERASE)
1991 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE, $self->p);
1997 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
1998 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
1999 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2000 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2001 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2002 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2003 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2004 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2005 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2006 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2007 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2008 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2009 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2010 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2011 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2012 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2013 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2014 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2015 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2017 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2018 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2019 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2020 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2021 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2022 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2023 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2024 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2026 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2027 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2028 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2030 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2031 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2032 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2033 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2034 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2035 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2036 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2037 static const int SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED = SOLVER_FLAG_IGNORE_ALREADY_RECOMMENDED;
2038 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2044 int set_flag(int flag, int value) {
2045 return solver_set_flag($self, flag, value);
2047 int get_flag(int flag) {
2048 return solver_get_flag($self, flag);
2050 #if defined(SWIGPYTHON)
2052 def solve(self, jobs):
2054 for job in jobs: j += [job.how, job.what]
2055 return self.solve_helper(j)
2058 #if defined(SWIGPERL)
2060 sub solv::Solver::solve {
2061 my ($self, $jobs) = @_;
2062 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2063 return $self->solve_helper(\@j);
2067 #if defined(SWIGRUBY)
2070 "class Solv::Solver\n"
2071 " def solve(jobs)\n"
2073 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2074 " solve_helper(jl)\n"
2080 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2081 %newobject solve_helper;
2082 Queue solve_helper(Queue jobs) {
2086 solver_solve($self, &jobs);
2087 cnt = solver_problem_count($self);
2088 for (i = 1; i <= cnt; i++)
2092 %newobject transaction;
2093 Transaction *transaction() {
2094 return solver_create_transaction($self);
2098 %extend Transaction {
2099 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2100 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2101 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2102 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2103 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2104 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2105 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2106 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2107 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2108 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2109 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2110 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2111 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2112 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2113 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2114 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2115 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2116 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2117 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2118 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2119 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2120 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2121 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2122 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2123 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2124 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2125 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2127 transaction_free($self);
2130 %rename("isempty?") isempty;
2133 return $self->steps.count == 0;
2136 %newobject othersolvable;
2137 XSolvable *othersolvable(XSolvable *s) {
2138 Id op = transaction_obs_pkg($self, s->id);
2139 return new_XSolvable($self->pool, op);
2142 %newobject allothersolvables;
2143 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2144 Queue allothersolvables(XSolvable *s) {
2147 transaction_all_obs_pkgs($self, s->id, &q);
2151 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2152 %newobject classify;
2153 Queue classify(int mode = 0) {
2156 transaction_classify($self, mode, &q);
2160 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2161 %newobject newpackages;
2162 Queue newpackages() {
2166 cut = transaction_installedresult(self, &q);
2167 queue_truncate(&q, cut);
2171 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2172 %newobject keptpackages;
2173 Queue keptpackages() {
2177 cut = transaction_installedresult(self, &q);
2179 queue_deleten(&q, 0, cut);
2183 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2187 queue_init_clone(&q, &$self->steps);
2191 int steptype(XSolvable *s, int mode) {
2192 return transaction_type($self, s->id, mode);
2194 int calc_installsizechange() {
2195 return transaction_calc_installsizechange($self);
2197 void order(int flags) {
2198 transaction_order($self, flags);
2202 %extend TransactionClass {
2203 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2204 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2205 cl->transaction = trans;
2209 cl->fromid = fromid;
2213 %newobject solvables;
2214 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2218 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2224 XRule(Solver *solv, Id id) {
2227 XRule *xr = solv_calloc(1, sizeof(*xr));
2233 Id type, source, target, dep;
2234 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2235 return new_Ruleinfo($self, type, source, target, dep);
2237 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2238 %newobject allinfos;
2242 solver_allruleinfos($self->solv, $self->id, &q);
2246 bool __eq__(XRule *xr) {
2247 return $self->solv == xr->solv && $self->id == xr->id;
2249 bool __ne__(XRule *xr) {
2250 return !XRule___eq__($self, xr);
2252 %newobject __repr__;
2253 const char *__repr__() {
2255 sprintf(buf, "<Rule #%d>", $self->id);
2256 return solv_strdup(buf);
2261 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2262 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2266 ri->source = source;
2267 ri->target = target;
2271 XSolvable * const solvable;
2272 XSolvable * const othersolvable;
2274 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2275 return new_XSolvable(ri->solv->pool, ri->source);
2277 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2278 return new_XSolvable(ri->solv->pool, ri->target);
2281 const char *problemstr() {
2282 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2287 XRepodata(Repo *repo, Id id) {
2288 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2294 return repodata_new_handle($self->repo->repodata + $self->id);
2296 void set_id(Id solvid, Id keyname, Id id) {
2297 repodata_set_id($self->repo->repodata + $self->id, solvid, keyname, id);
2299 void set_str(Id solvid, Id keyname, const char *str) {
2300 repodata_set_str($self->repo->repodata + $self->id, solvid, keyname, str);
2302 void set_poolstr(Id solvid, Id keyname, const char *str) {
2303 repodata_set_poolstr($self->repo->repodata + $self->id, solvid, keyname, str);
2305 void add_idarray(Id solvid, Id keyname, Id id) {
2306 repodata_add_idarray($self->repo->repodata + $self->id, solvid, keyname, id);
2308 void add_flexarray(Id solvid, Id keyname, Id handle) {
2309 repodata_add_flexarray($self->repo->repodata + $self->id, solvid, keyname, handle);
2311 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2312 const unsigned char *buf = solv_chksum_get(chksum, 0);
2314 repodata_set_bin_checksum($self->repo->repodata + $self->id, solvid, keyname, solv_chksum_get_type(chksum), buf);
2316 const char *lookup_str(Id solvid, Id keyname) {
2317 return repodata_lookup_str($self->repo->repodata + $self->id, solvid, keyname);
2319 Queue lookup_idarray(Id solvid, Id keyname) {
2322 repodata_lookup_idarray($self->repo->repodata + $self->id, solvid, keyname, &r);
2325 %newobject lookup_checksum;
2326 Chksum *lookup_checksum(Id solvid, Id keyname) {
2328 const unsigned char *b = repodata_lookup_bin_checksum($self->repo->repodata + $self->id, solvid, keyname, &type);
2329 return solv_chksum_create_from_bin(type, b);
2331 void internalize() {
2332 repodata_internalize($self->repo->repodata + $self->id);
2334 void create_stubs() {
2335 repodata_create_stubs($self->repo->repodata + $self->id);
2337 void write(FILE *fp) {
2338 repodata_write($self->repo->repodata + $self->id, fp, repo_write_stdkeyfilter, 0);
2340 bool add_solv(FILE *fp, int flags = 0) {
2341 Repodata *data = $self->repo->repodata + $self->id;
2342 int r, oldstate = data->state;
2343 data->state = REPODATA_LOADING;
2344 r = repo_add_solv_flags(data->repo, fp, flags | REPO_USE_LOADING);
2345 if (r || data->state == REPODATA_LOADING)
2346 data->state = oldstate;
2349 void extend_to_repo() {
2350 Repodata *data = $self->repo->repodata + $self->id;
2351 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2353 bool __eq__(XRepodata *xr) {
2354 return $self->repo == xr->repo && $self->id == xr->id;
2356 bool __ne__(XRepodata *xr) {
2357 return !XRepodata___eq__($self, xr);
2359 %newobject __repr__;
2360 const char *__repr__() {
2362 sprintf(buf, "<Repodata #%d>", $self->id);
2363 return solv_strdup(buf);