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 bool allowarchchange;
555 bool allowvendorchange;
558 bool noupdateprovide;
559 bool dosplitprovides;
560 bool dontinstallrecommended;
561 bool ignorealreadyrecommended;
562 bool dontshowinstalledrecommended;
564 bool distupgrade_removeunsupported;
568 typedef struct chksum {
571 %rename(xfopen) solv_xfopen;
572 %rename(xfopen_fd) solv_xfopen_fd;
573 %rename(xfopen_dup) solv_xfopen_dup;
574 %rename(xfclose) solv_xfclose;
575 %rename(xfileno) solv_xfileno;
577 FILE *solv_xfopen(const char *fn, const char *mode = 0);
578 FILE *solv_xfopen_fd(const char *fn, int fd, const char *mode = 0);
579 FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode = 0);
580 int solv_xfclose(FILE *fp);
581 int solv_xfileno(FILE *fp);
584 SWIGINTERN int solv_xfclose(FILE *fp) {
587 SWIGINTERN int solv_xfileno(FILE *fp) {
590 SWIGINTERN FILE *solv_xfopen_dup(const char *fn, int fd, const char *mode) {
592 return fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
615 %nodefaultctor Transaction;
616 %nodefaultdtor Transaction;
622 Transaction * const transaction;
631 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
632 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
633 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
634 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
635 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
636 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
637 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
638 static const Id SOLVER_NOOP = SOLVER_NOOP;
639 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
640 static const Id SOLVER_ERASE = SOLVER_ERASE;
641 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
642 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
643 static const Id SOLVER_NOOBSOLETES = SOLVER_NOOBSOLETES;
644 static const Id SOLVER_LOCK = SOLVER_LOCK;
645 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
646 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
647 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
648 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
649 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
650 static const Id SOLVER_WEAK = SOLVER_WEAK;
651 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
652 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
653 static const Id SOLVER_SETEV = SOLVER_SETEV;
654 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
655 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
656 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
657 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
658 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
659 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
661 Job(Pool *pool, int how, Id what) {
662 Job *job = solv_calloc(1, sizeof(*job));
669 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
670 %newobject solvables;
672 Pool *pool = $self->pool;
676 how = $self->how & SOLVER_SELECTMASK;
677 FOR_JOB_SELECT(p, pp, how, $self->what)
683 return pool_job2str($self->pool, $self->how, $self->what, 0);
686 bool __eq__(Job *j) {
687 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
689 bool __ne__(Job *j) {
690 return !Job___eq__($self, j);
692 const char *__str__() {
693 return pool_job2str($self->pool, $self->how, $self->what, 0);
695 const char *__repr__() {
696 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
697 return pool_tmpjoin($self->pool, "<Job ", str, ">");
703 return (Chksum *)solv_chksum_create(type);
705 Chksum(Id type, const char *hex) {
706 unsigned char buf[64];
707 int l = solv_chksum_len(type);
710 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
712 return (Chksum *)solv_chksum_create_from_bin(type, buf);
715 solv_chksum_free($self, 0);
719 SWIGINTERN Id Chksum_type_get(Chksum *chksum) {
720 return solv_chksum_get_type(chksum);
723 void add(const char *str) {
724 solv_chksum_add($self, str, strlen((char *)str));
726 void add_fp(FILE *fp) {
729 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
730 solv_chksum_add($self, buf, l);
731 rewind(fp); /* convenience */
733 void add_fd(int fd) {
736 while ((l = read(fd, buf, sizeof(buf))) > 0)
737 solv_chksum_add($self, buf, l);
738 lseek(fd, 0, 0); /* convenience */
740 void add_stat(const char *filename) {
742 if (stat(filename, &stb))
743 memset(&stb, 0, sizeof(stb));
744 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
745 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
746 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
747 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
751 const unsigned char *b;
752 b = solv_chksum_get($self, &l);
753 return cdata_void((void *)b, l);
758 const unsigned char *b;
761 b = solv_chksum_get($self, &l);
762 ret = solv_malloc(2 * l + 1);
763 solv_bin2hex(b, l, ret);
767 bool __eq__(Chksum *chk) {
769 const unsigned char *b, *bo;
772 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
774 b = solv_chksum_get($self, &l);
775 bo = solv_chksum_get(chk, 0);
776 return memcmp(b, bo, l) == 0;
778 bool __ne__(Chksum *chk) {
779 return !Chksum___eq__($self, chk);
781 #if defined(SWIGRUBY)
782 %rename("to_s") __str__;
783 %rename("inspect") __repr__;
786 const char *__str__() {
789 if (solv_chksum_isfinished($self))
790 h = Chksum_hex($self);
791 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
792 solv_free((void *)h);
796 const char *__repr__() {
797 const char *h = Chksum___str__($self);
798 const char *str = solv_dupjoin("<Chksum ", h, ">");
799 solv_free((void *)h);
806 Pool *pool = pool_create();
811 void set_debuglevel(int level) {
812 pool_setdebuglevel($self, level);
814 #if defined(SWIGPYTHON)
816 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
817 XRepodata *xd = new_XRepodata(data->repo, data - data->repo->repodata);
818 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
819 PyObject *result = PyEval_CallObject((PyObject *)d, args);
824 return 0; /* exception */
825 ecode = SWIG_AsVal_int(result, &vresult);
827 return SWIG_IsOK(ecode) ? vresult : 0;
830 void set_loadcallback(PyObject *callable) {
831 if ($self->loadcallback == loadcallback)
832 Py_DECREF($self->loadcallbackdata);
835 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
838 #if defined(SWIGPERL)
840 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
844 XRepodata *xd = new_XRepodata(data->repo, data - data->repo->repodata);
849 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
851 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
861 void set_loadcallback(SV *callable) {
862 if ($self->loadcallback == loadcallback)
863 SvREFCNT_dec($self->loadcallbackdata);
865 SvREFCNT_inc(callable);
866 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
870 #if defined(SWIGRUBY)
872 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
873 XRepodata *xd = new_XRepodata(data->repo, data - data->repo->repodata);
874 VALUE callable = (VALUE)d;
875 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
876 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
879 SWIGINTERN void mark_Pool(void *ptr) {
881 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
882 VALUE callable = (VALUE)pool->loadcallbackdata;
883 rb_gc_mark(callable);
887 %typemap(in, numinputs=0) VALUE callable {
888 $1 = rb_block_given_p() ? rb_block_proc() : 0;
890 void set_loadcallback(VALUE callable) {
891 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
896 Pool_set_loadcallback($self, 0);
899 Id str2id(const char *str, bool create=1) {
900 return pool_str2id($self, str, create);
902 const char *id2str(Id id) {
903 return pool_id2str($self, id);
905 const char *dep2str(Id id) {
906 return pool_dep2str($self, id);
908 Id rel2id(Id name, Id evr, int flags, bool create=1) {
909 return pool_rel2id($self, name, evr, flags, create);
911 Id id2langid(Id id, const char *lang, bool create=1) {
912 return pool_id2langid($self, id, lang, create);
914 void setarch(const char *arch) {
915 pool_setarch($self, arch);
917 Repo *add_repo(const char *name) {
918 return repo_create($self, name);
920 const char *lookup_str(Id entry, Id keyname) {
921 return pool_lookup_str($self, entry, keyname);
923 Id lookup_id(Id entry, Id keyname) {
924 return pool_lookup_id($self, entry, keyname);
926 unsigned int lookup_num(Id entry, Id keyname, unsigned int notfound = 0) {
927 return pool_lookup_num($self, entry, keyname, notfound);
929 bool lookup_void(Id entry, Id keyname) {
930 return pool_lookup_void($self, entry, keyname);
932 %newobject lookup_checksum;
933 Chksum *lookup_checksum(Id entry, Id keyname) {
935 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
936 return solv_chksum_create_from_bin(type, b);
939 %newobject Dataiterator;
940 Dataiterator *Dataiterator(Id p, Id key, const char *match, int flags) {
941 return new_Dataiterator($self, 0, p, key, match, flags);
943 const char *solvid2str(Id solvid) {
944 return pool_solvid2str($self, solvid);
946 void addfileprovides() {
947 pool_addfileprovides($self);
949 Queue addfileprovides_ids() {
951 Id *addedfileprovides = 0;
953 pool_addfileprovides_ids($self, $self->installed, &addedfileprovides);
954 if (addedfileprovides) {
955 for (; *addedfileprovides; addedfileprovides++)
956 queue_push(&r, *addedfileprovides);
960 void createwhatprovides() {
961 pool_createwhatprovides($self);
964 XSolvable *id2solvable(Id id) {
965 return new_XSolvable($self, id);
967 %newobject solvables;
968 Pool_solvable_iterator * const solvables;
970 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
971 return new_Pool_solvable_iterator(pool);
974 %newobject solvables_iter;
975 Pool_solvable_iterator * solvables_iter() {
976 return new_Pool_solvable_iterator($self);
979 Repo *id2repo(Id id) {
980 if (id < 1 || id > $self->nrepos)
982 return pool_id2repo($self, id);
985 Pool_repo_iterator * const repos;
987 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
988 return new_Pool_repo_iterator(pool);
991 %newobject repos_iter;
992 Pool_repo_iterator * repos_iter() {
993 return new_Pool_repo_iterator($self);
998 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
999 pool_set_installed(pool, installed);
1001 Repo *Pool_installed_get(Pool *pool) {
1002 return pool->installed;
1006 Queue matchprovidingids(const char *match, int flags) {
1012 for (id = 1; id < pool->ss.nstrings; id++)
1013 if (pool->whatprovides[id])
1017 if (!datamatcher_init(&ma, match, flags)) {
1018 for (id = 1; id < pool->ss.nstrings; id++)
1019 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1021 datamatcher_free(&ma);
1027 Job *Job(int how, Id what) {
1028 return new_Job($self, how, what);
1031 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1032 %newobject whatprovides;
1033 Queue whatprovides(Id dep) {
1038 FOR_PROVIDES(p, pp, dep)
1043 Id towhatprovides(Queue q) {
1044 return pool_queuetowhatprovides($self, &q);
1048 %rename("isknownarch?") isknownarch;
1050 bool isknownarch(Id id) {
1052 if (!id || id == ID_EMPTY)
1054 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1056 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1063 return solver_create($self);
1068 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1069 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1070 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1071 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1072 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1073 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1074 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1075 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS ; /* repo_solv */
1077 void free(bool reuseids = 0) {
1078 repo_free($self, reuseids);
1080 void empty(bool reuseids = 0) {
1081 repo_empty($self, reuseids);
1084 %rename("isempty?") isempty;
1087 return !$self->nsolvables;
1089 bool add_solv(const char *name, int flags = 0) {
1090 FILE *fp = fopen(name, "r");
1094 r = repo_add_solv_flags($self, fp, flags);
1098 bool add_solv(FILE *fp, int flags = 0) {
1099 return repo_add_solv_flags($self, fp, flags) == 0;
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 = 1;
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)
1218 /* make sure all repodatas but the first are extensions */
1219 if ($self->repodata[0].loadcallback)
1221 for (i = 1; i < $self->nrepodata; i++)
1222 if (!$self->repodata[i].loadcallback)
1223 return 0; /* oops, not an extension */
1224 return new_XRepodata($self, 0);
1227 bool __eq__(Repo *repo) {
1228 return $self == repo;
1230 bool __ne__(Repo *repo) {
1231 return $self != repo;
1234 const char *__str__() {
1237 return strdup($self->name);
1238 sprintf(buf, "Repo#%d", $self->repoid);
1241 %newobject __repr__;
1242 const char *__repr__() {
1246 sprintf(buf, "<Repo #%d ", $self->repoid);
1247 return solv_dupjoin(buf, $self->name, ">");
1249 sprintf(buf, "<Repo #%d>", $self->repoid);
1254 %extend Dataiterator {
1255 static const int SEARCH_STRING = SEARCH_STRING;
1256 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1257 static const int SEARCH_GLOB = SEARCH_GLOB;
1258 static const int SEARCH_REGEX = SEARCH_REGEX;
1259 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1260 static const int SEARCH_FILES = SEARCH_FILES;
1261 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1263 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1264 Dataiterator *di = solv_calloc(1, sizeof(*di));
1265 dataiterator_init(di, pool, repo, p, key, match, flags);
1269 dataiterator_free($self);
1272 #if defined(SWIGPYTHON)
1273 %newobject __iter__;
1274 Dataiterator *__iter__() {
1276 ndi = solv_calloc(1, sizeof(*ndi));
1277 dataiterator_init_clone(ndi, $self);
1280 %rename("next") __next__();
1281 %exception __next__ {
1284 PyErr_SetString(PyExc_StopIteration,"no more matches");
1291 perliter(solv::Dataiterator)
1294 %newobject __next__;
1295 Datamatch *__next__() {
1297 if (!dataiterator_step($self)) {
1300 ndi = solv_calloc(1, sizeof(*ndi));
1301 dataiterator_init_clone(ndi, $self);
1307 while ((d = Dataiterator___next__($self)) != 0) {
1308 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1312 void prepend_keyname(Id key) {
1313 dataiterator_prepend_keyname($self, key);
1315 void skip_solvable() {
1316 dataiterator_skip_solvable($self);
1322 dataiterator_free($self);
1325 %newobject solvable;
1326 XSolvable * const solvable;
1328 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1329 return new_XSolvable(di->pool, di->solvid);
1333 return $self->key->name;
1335 const char *key_idstr() {
1336 return pool_id2str($self->pool, $self->key->name);
1339 return $self->key->type;
1341 const char *type_idstr() {
1342 return pool_id2str($self->pool, $self->key->type);
1345 return $self->kv.id;
1347 const char *idstr() {
1348 return pool_id2str($self->pool, $self->kv.id);
1351 return $self->kv.str;
1354 return $self->kv.num;
1357 return $self->kv.num2;
1360 dataiterator_setpos($self);
1362 void setpos_parent() {
1363 dataiterator_setpos_parent($self);
1367 %extend Pool_solvable_iterator {
1368 Pool_solvable_iterator(Pool *pool) {
1369 Pool_solvable_iterator *s;
1370 s = solv_calloc(1, sizeof(*s));
1374 #if defined(SWIGPYTHON)
1375 %newobject __iter__;
1376 Pool_solvable_iterator *__iter__() {
1377 Pool_solvable_iterator *s;
1378 s = solv_calloc(1, sizeof(*s));
1382 %rename("next") __next__();
1383 %exception __next__ {
1386 PyErr_SetString(PyExc_StopIteration,"no more matches");
1393 perliter(solv::Pool_solvable_iterator)
1395 %newobject __next__;
1396 XSolvable *__next__() {
1397 Pool *pool = $self->pool;
1398 if ($self->id >= pool->nsolvables)
1400 while (++$self->id < pool->nsolvables)
1401 if (pool->solvables[$self->id].repo)
1402 return new_XSolvable(pool, $self->id);
1408 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
1409 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1413 %newobject __getitem__;
1414 XSolvable *__getitem__(Id key) {
1415 Pool *pool = $self->pool;
1416 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
1417 return new_XSolvable(pool, key);
1421 return $self->pool->nsolvables;
1425 %extend Pool_repo_iterator {
1426 Pool_repo_iterator(Pool *pool) {
1427 Pool_repo_iterator *s;
1428 s = solv_calloc(1, sizeof(*s));
1432 #if defined(SWIGPYTHON)
1433 %newobject __iter__;
1434 Pool_repo_iterator *__iter__() {
1435 Pool_repo_iterator *s;
1436 s = solv_calloc(1, sizeof(*s));
1440 %rename("next") __next__();
1441 %exception __next__ {
1444 PyErr_SetString(PyExc_StopIteration,"no more matches");
1449 %newobject __next__;
1451 Pool *pool = $self->pool;
1452 if ($self->id >= pool->nrepos + 1)
1454 while (++$self->id < pool->nrepos + 1) {
1455 Repo *r = pool_id2repo(pool, $self->id);
1464 while ((n = Pool_repo_iterator___next__($self)) != 0) {
1465 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p__Repo, SWIG_POINTER_OWN | 0));
1469 Repo *__getitem__(Id key) {
1470 Pool *pool = $self->pool;
1471 if (key > 0 && key < pool->nrepos + 1)
1472 return pool_id2repo(pool, key);
1476 return $self->pool->nrepos + 1;
1480 %extend Repo_solvable_iterator {
1481 Repo_solvable_iterator(Repo *repo) {
1482 Repo_solvable_iterator *s;
1483 s = solv_calloc(1, sizeof(*s));
1487 #if defined(SWIGPYTHON)
1488 %newobject __iter__;
1489 Repo_solvable_iterator *__iter__() {
1490 Repo_solvable_iterator *s;
1491 s = solv_calloc(1, sizeof(*s));
1495 %rename("next") __next__();
1496 %exception __next__ {
1499 PyErr_SetString(PyExc_StopIteration,"no more matches");
1504 %newobject __next__;
1505 XSolvable *__next__() {
1506 Repo *repo = $self->repo;
1507 Pool *pool = repo->pool;
1508 if (repo->start > 0 && $self->id < repo->start)
1509 $self->id = repo->start - 1;
1510 if ($self->id >= repo->end)
1512 while (++$self->id < repo->end)
1513 if (pool->solvables[$self->id].repo == repo)
1514 return new_XSolvable(pool, $self->id);
1520 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
1521 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
1525 %newobject __getitem__;
1526 XSolvable *__getitem__(Id key) {
1527 Repo *repo = $self->repo;
1528 Pool *pool = repo->pool;
1529 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
1530 return new_XSolvable(pool, key);
1534 return $self->repo->pool->nsolvables;
1539 Dep(Pool *pool, Id id) {
1543 s = solv_calloc(1, sizeof(*s));
1549 return pool_dep2str($self->pool, $self->id);
1551 bool __eq__(Dep *s) {
1552 return $self->pool == s->pool && $self->id == s->id;
1554 bool __ne__(Dep *s) {
1555 return !Dep___eq__($self, s);
1557 const char *__str__() {
1558 return pool_dep2str($self->pool, $self->id);
1560 %newobject __repr__;
1561 const char *__repr__() {
1563 sprintf(buf, "<Id #%d ", $self->id);
1564 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
1569 XSolvable(Pool *pool, Id id) {
1571 if (!id || id >= pool->nsolvables)
1573 s = solv_calloc(1, sizeof(*s));
1579 return pool_solvid2str($self->pool, $self->id);
1581 const char *lookup_str(Id keyname) {
1582 return pool_lookup_str($self->pool, $self->id, keyname);
1584 Id lookup_id(Id keyname) {
1585 return pool_lookup_id($self->pool, $self->id, keyname);
1587 unsigned int lookup_num(Id keyname, unsigned int notfound = 0) {
1588 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
1590 bool lookup_void(Id keyname) {
1591 return pool_lookup_void($self->pool, $self->id, keyname);
1593 %newobject lookup_checksum;
1594 Chksum *lookup_checksum(Id keyname) {
1596 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
1597 return solv_chksum_create_from_bin(type, b);
1599 const char *lookup_location(unsigned int *OUTPUT) {
1600 return solvable_get_location($self->pool->solvables + $self->id, OUTPUT);
1603 %rename("installable?") installable;
1605 bool installable() {
1606 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
1609 %rename("isinstalled?") isinstalled;
1611 bool isinstalled() {
1612 Pool *pool = $self->pool;
1613 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
1616 const char * const name;
1618 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
1619 Pool *pool = xs->pool;
1620 return pool_id2str(pool, pool->solvables[xs->id].name);
1625 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
1626 return xs->pool->solvables[xs->id].name;
1629 const char * const evr;
1631 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
1632 Pool *pool = xs->pool;
1633 return pool_id2str(pool, pool->solvables[xs->id].evr);
1638 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
1639 return xs->pool->solvables[xs->id].evr;
1642 const char * const arch;
1644 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
1645 Pool *pool = xs->pool;
1646 return pool_id2str(pool, pool->solvables[xs->id].arch);
1651 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
1652 return xs->pool->solvables[xs->id].arch;
1655 const char * const vendor;
1657 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
1658 Pool *pool = xs->pool;
1659 return pool_id2str(pool, pool->solvables[xs->id].vendor);
1664 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
1665 return xs->pool->solvables[xs->id].vendor;
1670 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
1671 return xs->pool->solvables[xs->id].repo;
1675 bool __eq__(XSolvable *s) {
1676 return $self->pool == s->pool && $self->id == s->id;
1678 bool __ne__(XSolvable *s) {
1679 return !XSolvable___eq__($self, s);
1681 const char *__str__() {
1682 return pool_solvid2str($self->pool, $self->id);
1684 %newobject __repr__;
1685 const char *__repr__() {
1687 sprintf(buf, "<Solvable #%d ", $self->id);
1688 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
1693 Problem(Solver *solv, Id id) {
1695 p = solv_calloc(1, sizeof(*p));
1700 %newobject findproblemrule;
1701 XRule *findproblemrule() {
1702 Id r = solver_findproblemrule($self->solv, $self->id);
1703 return new_XRule($self->solv, r);
1705 %newobject findallproblemrules;
1706 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
1707 Queue findallproblemrules(int unfiltered=0) {
1708 Solver *solv = $self->solv;
1713 solver_findallproblemrules(solv, $self->id, &q);
1716 for (i = j = 0; i < q.count; i++)
1718 probr = q.elements[i];
1719 if ((probr >= solv->updaterules && probr < solv->updaterules_end) || (probr >= solv->jobrules && probr < solv->jobrules_end))
1721 q.elements[j++] = probr;
1724 queue_truncate(&q, j);
1728 int solution_count() {
1729 return solver_solution_count($self->solv, $self->id);
1731 %newobject solutions;
1732 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
1737 cnt = solver_solution_count($self->solv, $self->id);
1738 for (i = 1; i <= cnt; i++)
1745 Solution(Problem *p, Id id) {
1747 s = solv_calloc(1, sizeof(*s));
1749 s->problemid = p->id;
1753 int element_count() {
1754 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1757 %newobject elements;
1758 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
1759 Queue elements(bool expandreplaces=0) {
1763 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
1764 for (i = 1; i <= cnt; i++)
1767 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
1769 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
1775 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
1776 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
1778 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
1779 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1780 queue_push2(&q, p, rp);
1782 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
1783 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1784 queue_push2(&q, p, rp);
1786 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
1787 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1788 queue_push2(&q, p, rp);
1793 queue_push2(&q, i, type);
1794 queue_push2(&q, p, rp);
1800 %extend Solutionelement {
1801 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
1803 e = solv_calloc(1, sizeof(*e));
1805 e->problemid = problemid;
1816 if (p == SOLVER_SOLUTION_ERASE)
1821 else if (p == SOLVER_SOLUTION_REPLACE)
1826 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
1827 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);
1828 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
1829 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);
1830 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
1831 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);
1832 return solver_solutionelement2str($self->solv, p, rp);
1834 %newobject replaceelements;
1835 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
1836 Queue replaceelements() {
1841 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
1844 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
1845 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
1846 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
1847 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
1848 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
1849 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
1850 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
1852 queue_push(&q, $self->type);
1855 int illegalreplace() {
1856 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
1858 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
1860 %newobject solvable;
1861 XSolvable * const solvable;
1862 %newobject replacement;
1863 XSolvable * const replacement;
1866 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
1867 return new_XSolvable(e->solv->pool, e->p);
1869 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
1870 return new_XSolvable(e->solv->pool, e->rp);
1872 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
1873 return (e->p - 1) / 2;
1878 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE)
1879 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->p);
1880 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
1881 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE, $self->rp);
1882 if ($self->type == SOLVER_SOLUTION_ERASE)
1883 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE, $self->p);
1889 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
1890 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
1891 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
1892 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
1893 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
1894 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
1895 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
1896 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
1897 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
1898 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
1899 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
1900 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
1901 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
1902 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
1903 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
1904 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
1905 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
1906 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
1907 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
1909 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
1910 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
1911 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
1912 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
1913 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
1914 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
1915 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
1916 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
1918 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
1919 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
1920 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
1925 #if defined(SWIGPYTHON)
1927 def solve(self, jobs):
1929 for job in jobs: j += [job.how, job.what]
1930 return self.solve_helper(j)
1933 #if defined(SWIGPERL)
1935 sub solv::Solver::solve {
1936 my ($self, $jobs) = @_;
1937 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1938 return $self->solve_helper(\@j);
1942 #if defined(SWIGRUBY)
1945 "class Solv::Solver\n"
1946 " def solve(jobs)\n"
1948 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1949 " solve_helper(jl)\n"
1955 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
1956 %newobject solve_helper;
1957 Queue solve_helper(Queue jobs) {
1961 solver_solve($self, &jobs);
1962 cnt = solver_problem_count($self);
1963 for (i = 1; i <= cnt; i++)
1967 %newobject transaction;
1968 Transaction *transaction() {
1969 return solver_create_transaction($self);
1973 %extend Transaction {
1974 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
1975 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
1976 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
1977 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
1978 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
1979 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
1980 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
1981 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
1982 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
1983 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
1984 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
1985 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
1986 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
1987 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
1988 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
1989 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
1990 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
1991 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
1992 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
1993 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
1994 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
1995 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
1996 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
1997 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
1998 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
1999 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2000 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2002 transaction_free($self);
2005 %rename("isempty?") isempty;
2008 return $self->steps.count == 0;
2011 %newobject othersolvable;
2012 XSolvable *othersolvable(XSolvable *s) {
2013 Id op = transaction_obs_pkg($self, s->id);
2014 return new_XSolvable($self->pool, op);
2017 %newobject allothersolvables;
2018 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2019 Queue allothersolvables(XSolvable *s) {
2022 transaction_all_obs_pkgs($self, s->id, &q);
2026 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2027 %newobject classify;
2028 Queue classify(int mode = 0) {
2031 transaction_classify($self, mode, &q);
2035 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2036 %newobject newpackages;
2037 Queue newpackages() {
2041 cut = transaction_installedresult(self, &q);
2042 queue_truncate(&q, cut);
2046 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2047 %newobject keptpackages;
2048 Queue keptpackages() {
2052 cut = transaction_installedresult(self, &q);
2054 queue_deleten(&q, 0, cut);
2058 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2062 queue_init_clone(&q, &$self->steps);
2066 int steptype(XSolvable *s, int mode) {
2067 return transaction_type($self, s->id, mode);
2069 int calc_installsizechange() {
2070 return transaction_calc_installsizechange($self);
2072 void order(int flags) {
2073 transaction_order($self, flags);
2077 %extend TransactionClass {
2078 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2079 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2080 cl->transaction = trans;
2084 cl->fromid = fromid;
2088 %newobject solvables;
2089 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
2093 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
2099 XRule(Solver *solv, Id id) {
2102 XRule *xr = solv_calloc(1, sizeof(*xr));
2108 Id type, source, target, dep;
2109 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
2110 return new_Ruleinfo($self, type, source, target, dep);
2112 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
2113 %newobject allinfos;
2117 solver_allruleinfos($self->solv, $self->id, &q);
2121 bool __eq__(XRule *xr) {
2122 return $self->solv == xr->solv && $self->id == xr->id;
2124 bool __ne__(XRule *xr) {
2125 return !XRule___eq__($self, xr);
2127 %newobject __repr__;
2128 const char *__repr__() {
2130 sprintf(buf, "<Rule #%d>", $self->id);
2136 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep) {
2137 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
2141 ri->source = source;
2142 ri->target = target;
2146 XSolvable * const solvable;
2147 XSolvable * const othersolvable;
2149 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
2150 return new_XSolvable(ri->solv->pool, ri->source);
2152 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
2153 return new_XSolvable(ri->solv->pool, ri->target);
2156 const char *problemstr() {
2157 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep);
2162 XRepodata(Repo *repo, Id id) {
2163 XRepodata *xr = solv_calloc(1, sizeof(*xr));
2169 return repodata_new_handle($self->repo->repodata + $self->id);
2171 void set_id(Id solvid, Id keyname, Id id) {
2172 repodata_set_id($self->repo->repodata + $self->id, solvid, keyname, id);
2174 void set_str(Id solvid, Id keyname, const char *str) {
2175 repodata_set_str($self->repo->repodata + $self->id, solvid, keyname, str);
2177 void set_poolstr(Id solvid, Id keyname, const char *str) {
2178 repodata_set_poolstr($self->repo->repodata + $self->id, solvid, keyname, str);
2180 void add_idarray(Id solvid, Id keyname, Id id) {
2181 repodata_add_idarray($self->repo->repodata + $self->id, solvid, keyname, id);
2183 void add_flexarray(Id solvid, Id keyname, Id handle) {
2184 repodata_add_flexarray($self->repo->repodata + $self->id, solvid, keyname, handle);
2186 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
2187 const unsigned char *buf = solv_chksum_get(chksum, 0);
2189 repodata_set_bin_checksum($self->repo->repodata + $self->id, solvid, keyname, solv_chksum_get_type(chksum), buf);
2191 const char *lookup_str(Id solvid, Id keyname) {
2192 return repodata_lookup_str($self->repo->repodata + $self->id, solvid, keyname);
2194 Queue lookup_idarray(Id solvid, Id keyname) {
2197 repodata_lookup_idarray($self->repo->repodata + $self->id, solvid, keyname, &r);
2200 %newobject lookup_checksum;
2201 Chksum *lookup_checksum(Id solvid, Id keyname) {
2203 const unsigned char *b = repodata_lookup_bin_checksum($self->repo->repodata + $self->id, solvid, keyname, &type);
2204 return solv_chksum_create_from_bin(type, b);
2206 void internalize() {
2207 repodata_internalize($self->repo->repodata + $self->id);
2209 void create_stubs() {
2210 repodata_create_stubs($self->repo->repodata + $self->id);
2212 void write(FILE *fp) {
2213 repodata_write($self->repo->repodata + $self->id, fp, repo_write_stdkeyfilter, 0);
2215 bool add_solv(FILE *fp, int flags = 0) {
2216 Repodata *data = $self->repo->repodata + $self->id;
2217 int r, oldstate = data->state;
2218 data->state = REPODATA_LOADING;
2219 r = repo_add_solv_flags(data->repo, fp, flags | REPO_USE_LOADING);
2220 if (r || data->state == REPODATA_LOADING)
2221 data->state = oldstate;
2224 void extend_to_repo() {
2225 Repodata *data = $self->repo->repodata + $self->id;
2226 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
2228 bool __eq__(XRepodata *xr) {
2229 return $self->repo == xr->repo && $self->id == xr->id;
2231 bool __ne__(XRepodata *xr) {
2232 return !XRepodata___eq__($self, xr);
2234 %newobject __repr__;
2235 const char *__repr__() {
2237 sprintf(buf, "<Repodata #%d>", $self->id);