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
10 %markfunc Pool "mark_Pool";
24 %typemap(in,noblock=1,fragment="SWIG_AsCharPtrAndSize") (const unsigned char *str, size_t len) (int res, char *buf = 0, size_t size = 0, int alloc = 0) {
25 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
26 if (!SWIG_IsOK(res)) {
27 #if defined(SWIGPYTHON)
28 const void *pybuf = 0;
29 Py_ssize_t pysize = 0;
30 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
32 %argument_fail(res, "BinaryBlob", $symname, $argnum);
38 %argument_fail(res, "const char *", $symname, $argnum);
41 $1 = (unsigned char *)buf;
45 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
46 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
49 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
50 #if defined(SWIGPYTHON) && defined(PYTHON3)
51 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
53 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
60 #if defined(SWIGPYTHON)
62 /* Check if is a list */
64 if (PyList_Check($input)) {
65 int size = PyList_Size($input);
67 for (i = 0; i < size; i++) {
68 PyObject *o = PyList_GetItem($input,i);
70 int e = SWIG_AsVal_int(o, &v);
72 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
79 PyErr_SetString(PyExc_TypeError,"not a list");
86 PyObject *o = PyList_New($1.count);
87 for (i = 0; i < $1.count; i++)
88 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
93 %define Queue2Array(type, step, con) %{
95 int cnt = $1.count / step;
96 Id *idp = $1.elements;
97 PyObject *o = PyList_New(cnt);
98 for (i = 0; i < cnt; i++, idp += step)
101 #define result resultx
104 PyList_SetItem(o, i, $result);
115 #if defined(SWIGPERL)
120 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
121 SWIG_croak("Argument $argnum is not an array reference.");
122 av = (AV*)SvRV($input);
124 for (i = 0; i <= size; i++) {
125 SV **sv = av_fetch(av, i, 0);
127 int e = SWIG_AsVal_int(*sv, &v);
129 SWIG_croak("list must contain only integers");
135 # av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
136 # $result = newRV_noinc((SV*)o); argvi++;
138 %typemap(out) Queue {
140 if (argvi + $1.count + 1 >= items) {
141 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
143 for (i = 0; i < $1.count; i++)
144 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
148 %define Queue2Array(type, step, con) %{
150 int cnt = $1.count / step;
151 Id *idp = $1.elements;
152 if (argvi + cnt + 1 >= items) {
153 EXTEND(sp, (argvi + cnt + 1) - items + 1);
155 for (i = 0; i < cnt; i++, idp += step)
158 #define result resultx
161 SvREFCNT_inc(ST(argvi - 1));
171 %typemap(arginit) Queue {
174 %typemap(freearg) Queue {
178 #if defined(SWIGRUBY)
183 size = RARRAY_LEN($input);
185 o = RARRAY_PTR($input);
186 for (i = 0; i < size; i++, o++) {
188 int e = SWIG_AsVal_int(*o, &v);
191 SWIG_Error(SWIG_RuntimeError, "list must contain only integers");
197 %typemap(out) Queue {
199 VALUE o = rb_ary_new2($1.count);
200 for (i = 0; i < $1.count; i++)
201 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
205 %typemap(arginit) Queue {
208 %typemap(freearg) Queue {
211 %define Queue2Array(type, step, con) %{
213 int cnt = $1.count / step;
214 Id *idp = $1.elements;
215 VALUE o = rb_ary_new2(cnt);
216 for (i = 0; i < cnt; i++, idp += step)
219 #define result resultx
222 rb_ary_store(o, i, $result);
234 #if defined(SWIGPERL)
236 # work around a swig bug
240 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
242 # ifndef MULTIPLICITY
243 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
245 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
251 %define perliter(class)
254 my $i = ${##class##::ITERATORS}{$_[0]};
256 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
258 $_[0]->__getitem__($_[1]);
261 sub class##::FETCHSIZE {
262 my $i = ${##class##::ITERATORS}{$_[0]};
264 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
274 #define SWIG_PERL_ITERATOR 0x80
276 SWIGRUNTIMEINLINE SV *
277 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
278 SV *result = sv_newmortal();
279 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
284 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
285 stash=SvSTASH(SvRV(obj));
286 if (flags & SWIG_POINTER_OWN) {
288 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
290 gv_init(gv, stash, "OWNER", 5, FALSE);
292 hv_store_ent(hv, obj, newSViv(1), 0);
294 if (flags & SWIG_PERL_ITERATOR) {
296 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
299 gv_init(gv, stash, "ITERATORS", 9, FALSE);
301 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
303 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
305 self=newRV_noinc((SV *)array);
306 sv_setsv(result, self);
307 SvREFCNT_dec((SV *)self);
308 sv_bless(result, stash);
310 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
317 %typemap(out) Perlarray {
318 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
320 %typemap(out) Perliterator {
321 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
324 %typemap(out) Pool_solvable_iterator * = Perlarray;
325 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
326 %typemap(out) Pool_repo_iterator * = Perlarray;
327 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
328 %typemap(out) Repo_solvable_iterator * = Perlarray;
329 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
330 %typemap(out) Dataiterator * = Perliterator;
335 #if defined(SWIGPYTHON)
336 typedef PyObject *AppObjectPtr;
337 %typemap(out) AppObjectPtr {
338 $result = $1 ? $1 : Py_None;
342 #if defined(SWIGPERL)
343 typedef SV *AppObjectPtr;
344 %typemap(in) AppObjectPtr {
345 $1 = SvROK($input) ? SvRV($input) : 0;
347 %typemap(out) AppObjectPtr {
348 $result = $1 ? newRV_inc($1) : newSV(0);
352 #if defined(SWIGRUBY)
353 typedef VALUE AppObjectPtr;
354 %typemap(in) AppObjectPtr {
357 %typemap(out) AppObjectPtr {
366 %fragment("SWIG_AsValFilePtr","header") {}
370 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
374 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
376 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
378 static swig_type_info* desc = 0;
382 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
383 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
385 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
389 ecode = SWIG_AsValFilePtr(obj, val);
390 if (ecode == SWIG_OK)
393 return SWIG_TypeError;
399 %fragment("SWIG_AsValDepId","header") {
403 SWIG_AsValDepId(VALUE obj, int *val) {
405 SWIG_AsValDepId(void *obj, int *val) {
407 static swig_type_info* desc = 0;
410 if (!desc) desc = SWIG_TypeQuery("Dep *");
411 ecode = SWIG_AsVal_int(obj, val);
412 if (SWIG_IsOK(ecode))
414 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
416 *val = vptr ? ((Dep *)vptr)->id : 0;
419 return SWIG_TypeError;
424 %typemap(out) disown_helper {
426 SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
429 SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
432 SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
434 $result = SWIG_From_int((int)(0));
437 %include "typemaps.i"
439 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
442 %typemap(argout,noblock=1) XRule **OUTPUT {
443 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
446 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
447 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
453 #include <sys/stat.h>
454 #include <sys/utsname.h>
455 #include <sys/types.h>
458 /* argh, swig undefs bool for perl */
464 #include "poolarch.h"
468 #include "solverdebug.h"
469 #include "repo_solv.h"
471 #include "selection.h"
473 #include "repo_write.h"
475 #include "repo_rpmdb.h"
478 #include "repo_pubkey.h"
481 #include "repo_deb.h"
484 #include "repo_rpmmd.h"
485 #include "repo_updateinfoxml.h"
486 #include "repo_deltainfoxml.h"
487 #include "repo_repomdxml.h"
489 #ifdef ENABLE_SUSEREPO
490 #include "repo_products.h"
491 #include "repo_susetags.h"
492 #include "repo_content.h"
494 #ifdef ENABLE_MDKREPO
495 #include "repo_mdk.h"
497 #ifdef ENABLE_ARCHREPO
498 #include "repo_arch.h"
501 #include "repo_autopattern.h"
503 #include "solv_xfopen.h"
505 /* for old ruby versions */
507 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
510 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
513 #define SOLVER_SOLUTION_ERASE -100
514 #define SOLVER_SOLUTION_REPLACE -101
515 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
516 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
517 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
518 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
520 typedef void *AppObjectPtr;
546 } Pool_solvable_iterator;
551 } Pool_repo_iterator;
556 } Repo_solvable_iterator;
596 Transaction *transaction;
614 typedef Dataiterator Datamatch;
616 typedef int disown_helper;
621 %mixin Dataiterator "Enumerable";
622 %mixin Pool_solvable_iterator "Enumerable";
623 %mixin Pool_repo_iterator "Enumerable";
624 %mixin Repo_solvable_iterator "Enumerable";
632 %constant Id SOLVID_META;
633 %constant Id SOLVID_POS;
635 %constant int REL_EQ;
636 %constant int REL_GT;
637 %constant int REL_LT;
638 %constant int REL_ARCH;
649 # put before pool/repo so we can access the constructor
650 %nodefaultdtor Dataiterator;
651 typedef struct {} Dataiterator;
674 typedef struct {} Pool_solvable_iterator;
675 typedef struct {} Pool_repo_iterator;
676 typedef struct {} Repo_solvable_iterator;
678 %nodefaultctor Datamatch;
679 %nodefaultdtor Datamatch;
686 %nodefaultctor Datapos;
700 AppObjectPtr appdata;
707 const char * const name;
710 int const nsolvables;
711 AppObjectPtr appdata;
714 %nodefaultctor Solver;
715 %nodefaultdtor Solver;
726 unsigned int const created;
727 unsigned int const expires;
728 const char * const keyid;
732 %rename(xfopen) solvfp_xfopen;
733 %rename(xfopen_fd) solvfp_xfopen_fd;
735 %nodefaultctor SolvFp;
739 %newobject solvfp_xfopen;
740 %newobject solvfp_xfopen_fd;
742 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
743 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
746 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
750 fp = fd == -1 ? 0 : solv_xfopen_fd(fn, fd, mode);
753 sfp = solv_calloc(1, sizeof(SolvFp));
757 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
760 fp = solv_xfopen(fn, mode);
763 sfp = solv_calloc(1, sizeof(SolvFp));
788 %nodefaultctor Transaction;
789 %nodefaultdtor Transaction;
795 Transaction * const transaction;
809 return $self->fp ? fileno($self->fp) : -1;
812 return $self->fp ? dup(fileno($self->fp)) : -1;
817 return fflush($self->fp) == 0;
823 ret = fclose($self->fp) == 0;
830 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
831 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
832 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
833 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
834 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
835 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
836 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
837 static const Id SOLVER_NOOP = SOLVER_NOOP;
838 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
839 static const Id SOLVER_ERASE = SOLVER_ERASE;
840 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
841 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
842 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
843 static const Id SOLVER_LOCK = SOLVER_LOCK;
844 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
845 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
846 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
847 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
848 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
849 static const Id SOLVER_WEAK = SOLVER_WEAK;
850 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
851 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
852 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
853 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
854 static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
855 static const Id SOLVER_SETEV = SOLVER_SETEV;
856 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
857 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
858 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
859 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
860 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
861 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
862 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
864 Job(Pool *pool, int how, Id what) {
865 Job *job = solv_calloc(1, sizeof(*job));
872 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
873 %newobject solvables;
877 pool_job2solvables($self->pool, &q, $self->how, $self->what);
881 %rename("isemptyupdate?") isemptyupdate;
883 bool isemptyupdate() {
884 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
887 bool __eq__(Job *j) {
888 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
890 bool __ne__(Job *j) {
891 return !Job___eq__($self, j);
893 #if defined(SWIGPERL)
894 %rename("str") __str__;
896 const char *__str__() {
897 return pool_job2str($self->pool, $self->how, $self->what, 0);
899 const char *__repr__() {
900 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
901 return pool_tmpjoin($self->pool, "<Job ", str, ">");
906 static const Id SELECTION_NAME = SELECTION_NAME;
907 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
908 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
909 static const Id SELECTION_CANON = SELECTION_CANON;
910 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
911 static const Id SELECTION_REL = SELECTION_REL;
912 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
913 static const Id SELECTION_GLOB = SELECTION_GLOB;
914 static const Id SELECTION_FLAT = SELECTION_FLAT;
915 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
916 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
917 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
919 Selection(Pool *pool) {
921 s = solv_calloc(1, sizeof(*s));
927 queue_free(&$self->q);
934 %rename("isempty?") isempty;
937 return $self->q.count == 0;
939 void filter(Selection *lsel) {
940 if ($self->pool != lsel->pool)
941 queue_empty(&$self->q);
943 selection_filter($self->pool, &$self->q, &lsel->q);
945 void add(Selection *lsel) {
946 if ($self->pool == lsel->pool)
948 selection_add($self->pool, &$self->q, &lsel->q);
949 $self->flags |= lsel->flags;
952 void add_raw(Id how, Id what) {
953 queue_push2(&$self->q, how, what);
955 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
957 Queue jobs(int flags) {
960 queue_init_clone(&q, &$self->q);
961 for (i = 0; i < q.count; i += 2)
962 q.elements[i] |= flags;
966 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
967 %newobject solvables;
971 selection_solvables($self->pool, &$self->q, &q);
975 #if defined(SWIGPERL)
976 %rename("str") __str__;
978 const char *__str__() {
979 return pool_selection2str($self->pool, &$self->q, 0);
981 const char *__repr__() {
982 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
983 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
989 return solv_chksum_create(type);
991 Chksum(Id type, const char *hex) {
992 unsigned char buf[64];
993 int l = solv_chksum_len(type);
996 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
998 return solv_chksum_create_from_bin(type, buf);
1001 solv_chksum_free($self, 0);
1005 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
1006 return solv_chksum_get_type(chk);
1009 void add(const unsigned char *str, size_t len) {
1010 solv_chksum_add($self, str, (int)len);
1012 void add_fp(FILE *fp) {
1015 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
1016 solv_chksum_add($self, buf, l);
1017 rewind(fp); /* convenience */
1019 void add_fd(int fd) {
1022 while ((l = read(fd, buf, sizeof(buf))) > 0)
1023 solv_chksum_add($self, buf, l);
1024 lseek(fd, 0, 0); /* convenience */
1026 void add_stat(const char *filename) {
1028 if (stat(filename, &stb))
1029 memset(&stb, 0, sizeof(stb));
1030 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1031 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1032 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1033 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1035 void add_fstat(int fd) {
1037 if (fstat(fd, &stb))
1038 memset(&stb, 0, sizeof(stb));
1039 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1040 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1041 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1042 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1047 const unsigned char *b;
1048 b = solv_chksum_get($self, &l);
1056 const unsigned char *b;
1059 b = solv_chksum_get($self, &l);
1060 ret = solv_malloc(2 * l + 1);
1061 solv_bin2hex(b, l, ret);
1064 const char *typestr() {
1065 return solv_chksum_type2str(solv_chksum_get_type($self));
1068 bool __eq__(Chksum *chk) {
1070 const unsigned char *b, *bo;
1073 if (solv_chksum_get_type($self) != solv_chksum_get_type(chk))
1075 b = solv_chksum_get($self, &l);
1076 bo = solv_chksum_get(chk, 0);
1077 return memcmp(b, bo, l) == 0;
1079 bool __ne__(Chksum *chk) {
1080 return !Chksum___eq__($self, chk);
1082 #if defined(SWIGRUBY)
1083 %rename("to_s") __str__;
1085 #if defined(SWIGPERL)
1086 %rename("str") __str__;
1089 const char *__str__() {
1092 if (solv_chksum_isfinished($self))
1093 h = Chksum_hex($self);
1094 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1095 solv_free((void *)h);
1098 %newobject __repr__;
1099 const char *__repr__() {
1100 const char *h = Chksum___str__($self);
1101 const char *str = solv_dupjoin("<Chksum ", h, ">");
1102 solv_free((void *)h);
1108 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1109 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1110 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1111 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1112 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1113 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1114 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1115 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1116 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1119 Pool *pool = pool_create();
1122 void set_debuglevel(int level) {
1123 pool_setdebuglevel($self, level);
1125 int set_flag(int flag, int value) {
1126 return pool_set_flag($self, flag, value);
1128 int get_flag(int flag) {
1129 return pool_get_flag($self, flag);
1131 void set_rootdir(const char *rootdir) {
1132 pool_set_rootdir($self, rootdir);
1134 const char *get_rootdir(int flag) {
1135 return pool_get_rootdir($self);
1137 #if defined(SWIGPYTHON)
1139 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1140 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1141 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1142 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1147 return 0; /* exception */
1148 ecode = SWIG_AsVal_int(result, &vresult);
1150 return SWIG_IsOK(ecode) ? vresult : 0;
1153 void set_loadcallback(PyObject *callable) {
1154 if ($self->loadcallback == loadcallback) {
1155 PyObject *obj = $self->loadcallbackdata;
1159 Py_INCREF(callable);
1161 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1164 #if defined(SWIGPERL)
1166 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1170 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1175 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1177 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1187 void set_loadcallback(SV *callable) {
1188 if ($self->loadcallback == loadcallback)
1189 SvREFCNT_dec($self->loadcallbackdata);
1191 SvREFCNT_inc(callable);
1192 pool_setloadcallback($self, callable ? loadcallback : 0, callable);
1196 #if defined(SWIGRUBY)
1198 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1199 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1200 VALUE callable = (VALUE)d;
1201 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1202 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1203 return res == Qtrue;
1205 SWIGINTERN void mark_Pool(void *ptr) {
1207 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1208 VALUE callable = (VALUE)pool->loadcallbackdata;
1209 rb_gc_mark(callable);
1213 %typemap(in, numinputs=0) VALUE callable {
1214 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1216 void set_loadcallback(VALUE callable) {
1217 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1222 Pool_set_loadcallback($self, 0);
1225 disown_helper free() {
1226 Pool_set_loadcallback($self, 0);
1230 disown_helper disown() {
1233 Id str2id(const char *str, bool create=1) {
1234 return pool_str2id($self, str, create);
1237 Dep *Dep(const char *str, bool create=1) {
1238 Id id = pool_str2id($self, str, create);
1239 return new_Dep($self, id);
1241 const char *id2str(Id id) {
1242 return pool_id2str($self, id);
1244 const char *dep2str(Id id) {
1245 return pool_dep2str($self, id);
1247 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1248 return pool_rel2id($self, name, evr, flags, create);
1250 Id id2langid(Id id, const char *lang, bool create=1) {
1251 return pool_id2langid($self, id, lang, create);
1253 void setarch(const char *arch = 0) {
1262 pool_setarch($self, arch);
1264 Repo *add_repo(const char *name) {
1265 return repo_create($self, name);
1267 const char *lookup_str(Id entry, Id keyname) {
1268 return pool_lookup_str($self, entry, keyname);
1270 Id lookup_id(Id entry, Id keyname) {
1271 return pool_lookup_id($self, entry, keyname);
1273 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1274 return pool_lookup_num($self, entry, keyname, notfound);
1276 bool lookup_void(Id entry, Id keyname) {
1277 return pool_lookup_void($self, entry, keyname);
1279 %newobject lookup_checksum;
1280 Chksum *lookup_checksum(Id entry, Id keyname) {
1282 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1283 return solv_chksum_create_from_bin(type, b);
1286 %newobject Dataiterator;
1287 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1288 return new_Dataiterator($self, 0, 0, key, match, flags);
1290 %newobject Dataiterator_solvid;
1291 Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
1292 return new_Dataiterator($self, 0, p, key, match, flags);
1294 const char *solvid2str(Id solvid) {
1295 return pool_solvid2str($self, solvid);
1297 void addfileprovides() {
1298 pool_addfileprovides($self);
1300 Queue addfileprovides_queue() {
1303 pool_addfileprovides_queue($self, &r, 0);
1306 void createwhatprovides() {
1307 pool_createwhatprovides($self);
1310 %newobject id2solvable;
1311 XSolvable *id2solvable(Id id) {
1312 return new_XSolvable($self, id);
1314 %newobject solvables;
1315 Pool_solvable_iterator * const solvables;
1317 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1318 return new_Pool_solvable_iterator(pool);
1321 %newobject solvables_iter;
1322 Pool_solvable_iterator * solvables_iter() {
1323 return new_Pool_solvable_iterator($self);
1326 Repo *id2repo(Id id) {
1327 if (id < 1 || id >= $self->nrepos)
1329 return pool_id2repo($self, id);
1333 Pool_repo_iterator * const repos;
1335 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1336 return new_Pool_repo_iterator(pool);
1339 %newobject repos_iter;
1340 Pool_repo_iterator * repos_iter() {
1341 return new_Pool_repo_iterator($self);
1345 const char * const errstr;
1347 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1348 pool_set_installed(pool, installed);
1350 Repo *Pool_installed_get(Pool *pool) {
1351 return pool->installed;
1353 const char *Pool_errstr_get(Pool *pool) {
1354 return pool_errstr(pool);
1358 Queue matchprovidingids(const char *match, int flags) {
1364 for (id = 1; id < pool->ss.nstrings; id++)
1365 if (pool->whatprovides[id])
1369 if (!datamatcher_init(&ma, match, flags)) {
1370 for (id = 1; id < pool->ss.nstrings; id++)
1371 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1373 datamatcher_free(&ma);
1380 Job *Job(int how, Id what) {
1381 return new_Job($self, how, what);
1384 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1385 %newobject whatprovides;
1386 Queue whatprovides(DepId dep) {
1391 FOR_PROVIDES(p, pp, dep)
1396 Id towhatprovides(Queue q) {
1397 return pool_queuetowhatprovides($self, &q);
1400 %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1401 %newobject whatmatchesdep;
1402 Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
1405 pool_whatmatchesdep($self, keyname, dep, &q, marker);
1410 %rename("isknownarch?") isknownarch;
1412 bool isknownarch(DepId id) {
1414 if (!id || id == ID_EMPTY)
1416 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1418 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1425 return solver_create($self);
1428 %newobject Selection;
1429 Selection *Selection() {
1430 return new_Selection($self);
1432 %newobject Selection_all;
1433 Selection *Selection_all(int setflags=0) {
1434 Selection *sel = new_Selection($self);
1435 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1439 Selection *select(const char *name, int flags) {
1440 Selection *sel = new_Selection($self);
1441 sel->flags = selection_make($self, &sel->q, name, flags);
1445 void setpooljobs_helper(Queue jobs) {
1446 queue_free(&$self->pooljobs);
1447 queue_init_clone(&$self->pooljobs, &jobs);
1449 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1450 %newobject getpooljobs;
1451 Queue getpooljobs() {
1453 queue_init_clone(&q, &$self->pooljobs);
1457 #if defined(SWIGPYTHON)
1459 def setpooljobs(self, jobs):
1461 for job in jobs: j += [job.how, job.what]
1462 self.setpooljobs_helper(j)
1465 #if defined(SWIGPERL)
1467 sub solv::Solver::setpooljobs {
1468 my ($self, $jobs) = @_;
1469 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1470 return $self->setpooljobs_helper(\@j);
1474 #if defined(SWIGRUBY)
1477 "class Solv::Pool\n"
1478 " def setpooljobs(jobs)\n"
1480 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1481 " setpooljobs_helper(jl)\n"
1490 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1491 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1492 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1493 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1494 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1495 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1496 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1497 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1498 #ifdef ENABLE_SUSEREPO
1499 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1502 void free(bool reuseids = 0) {
1503 repo_free($self, reuseids);
1505 void empty(bool reuseids = 0) {
1506 repo_empty($self, reuseids);
1509 %rename("isempty?") isempty;
1512 return !$self->nsolvables;
1514 bool add_solv(const char *name, int flags = 0) {
1515 FILE *fp = fopen(name, "r");
1519 r = repo_add_solv($self, fp, flags);
1523 bool add_solv(FILE *fp, int flags = 0) {
1524 return repo_add_solv($self, fp, flags) == 0;
1527 %newobject add_solvable;
1528 XSolvable *add_solvable() {
1529 Id solvid = repo_add_solvable($self);
1530 return new_XSolvable($self->pool, solvid);
1534 bool add_rpmdb(int flags = 0) {
1535 return repo_add_rpmdb($self, 0, flags) == 0;
1537 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1538 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1541 XSolvable *add_rpm(const char *name, int flags = 0) {
1542 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1545 #ifdef ENABLE_PUBKEY
1547 bool add_rpmdb_pubkeys(int flags = 0) {
1548 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1551 %newobject add_pubkey;
1552 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
1553 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
1555 bool add_keyring(FILE *fp, int flags = 0) {
1556 return repo_add_keyring($self, fp, flags);
1558 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
1559 return repo_add_keydir($self, keydir, suffix, flags);
1563 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
1564 return repo_add_rpmmd($self, fp, language, flags) == 0;
1566 bool add_repomdxml(FILE *fp, int flags = 0) {
1567 return repo_add_repomdxml($self, fp, flags) == 0;
1569 bool add_updateinfoxml(FILE *fp, int flags = 0) {
1570 return repo_add_updateinfoxml($self, fp, flags) == 0;
1572 bool add_deltainfoxml(FILE *fp, int flags = 0) {
1573 return repo_add_deltainfoxml($self, fp, flags) == 0;
1576 #ifdef ENABLE_DEBIAN
1577 bool add_debdb(int flags = 0) {
1578 return repo_add_debdb($self, flags) == 0;
1580 bool add_debpackages(FILE *fp, int flags = 0) {
1581 return repo_add_debpackages($self, fp, flags) == 0;
1584 XSolvable *add_deb(const char *name, int flags = 0) {
1585 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
1588 #ifdef ENABLE_SUSEREPO
1589 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
1590 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
1592 bool add_content(FILE *fp, int flags = 0) {
1593 return repo_add_content($self, fp, flags) == 0;
1595 bool add_products(const char *proddir, int flags = 0) {
1596 return repo_add_products($self, proddir, flags) == 0;
1599 #ifdef ENABLE_MDKREPO
1600 bool add_mdk(FILE *fp, int flags = 0) {
1601 return repo_add_mdk($self, fp, flags) == 0;
1603 bool add_mdk_info(FILE *fp, int flags = 0) {
1604 return repo_add_mdk_info($self, fp, flags) == 0;
1607 #ifdef ENABLE_ARCHREPO
1608 bool add_arch_repo(FILE *fp, int flags = 0) {
1609 return repo_add_arch_repo($self, fp, flags) == 0;
1611 bool add_arch_local(const char *dir, int flags = 0) {
1612 return repo_add_arch_local($self, dir, flags) == 0;
1614 %newobject add_arch_pkg;
1615 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
1616 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
1620 bool add_autopattern(int flags = 0) {
1621 return repo_add_autopattern($self, flags) == 0;
1624 void internalize() {
1625 repo_internalize($self);
1627 bool write(FILE *fp) {
1628 return repo_write($self, fp) == 0;
1630 # HACK, remove if no longer needed!
1631 bool write_first_repodata(FILE *fp) {
1632 int oldnrepodata = $self->nrepodata;
1634 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
1635 res = repo_write($self, fp);
1636 $self->nrepodata = oldnrepodata;
1640 %newobject Dataiterator;
1641 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1642 return new_Dataiterator($self->pool, $self, 0, key, match, flags);
1644 %newobject Dataiterator_meta;
1645 Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
1646 return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
1651 SWIGINTERN Id Repo_id_get(Repo *repo) {
1652 return repo->repoid;
1655 %newobject solvables;
1656 Repo_solvable_iterator * const solvables;
1658 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
1659 return new_Repo_solvable_iterator(repo);
1663 Datapos * const meta;
1665 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
1666 Datapos *pos = solv_calloc(1, sizeof(*pos));
1667 pos->solvid = SOLVID_META;
1673 %newobject solvables_iter;
1674 Repo_solvable_iterator *solvables_iter() {
1675 return new_Repo_solvable_iterator($self);
1678 %newobject add_repodata;
1679 XRepodata *add_repodata(int flags = 0) {
1680 Repodata *rd = repo_add_repodata($self, flags);
1681 return new_XRepodata($self, rd->repodataid);
1684 void create_stubs() {
1686 if (!$self->nrepodata)
1688 data = repo_id2repodata($self, $self->nrepodata - 1);
1689 if (data->state != REPODATA_STUB)
1690 (void)repodata_create_stubs(data);
1693 %rename("iscontiguous?") iscontiguous;
1695 bool iscontiguous() {
1697 for (i = $self->start; i < $self->end; i++)
1698 if ($self->pool->solvables[i].repo != $self)
1702 %newobject first_repodata;
1703 XRepodata *first_repodata() {
1706 if ($self->nrepodata < 2)
1708 /* make sure all repodatas but the first are extensions */
1709 data = repo_id2repodata($self, 1);
1710 if (data->loadcallback)
1712 for (i = 2; i < $self->nrepodata; i++)
1714 data = repo_id2repodata($self, i);
1715 if (!data->loadcallback)
1716 return 0; /* oops, not an extension */
1718 return new_XRepodata($self, 1);
1721 %newobject Selection;
1722 Selection *Selection(int setflags=0) {
1723 Selection *sel = new_Selection($self->pool);
1724 setflags |= SOLVER_SETREPO;
1725 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
1729 #ifdef ENABLE_PUBKEY
1730 %newobject find_pubkey;
1731 XSolvable *find_pubkey(const char *keyid) {
1732 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
1736 bool __eq__(Repo *repo) {
1737 return $self == repo;
1739 bool __ne__(Repo *repo) {
1740 return $self != repo;
1742 #if defined(SWIGPERL)
1743 %rename("str") __str__;
1746 const char *__str__() {
1749 return solv_strdup($self->name);
1750 sprintf(buf, "Repo#%d", $self->repoid);
1751 return solv_strdup(buf);
1753 %newobject __repr__;
1754 const char *__repr__() {
1758 sprintf(buf, "<Repo #%d ", $self->repoid);
1759 return solv_dupjoin(buf, $self->name, ">");
1761 sprintf(buf, "<Repo #%d>", $self->repoid);
1762 return solv_strdup(buf);
1766 %extend Dataiterator {
1767 static const int SEARCH_STRING = SEARCH_STRING;
1768 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
1769 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
1770 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
1771 static const int SEARCH_GLOB = SEARCH_GLOB;
1772 static const int SEARCH_REGEX = SEARCH_REGEX;
1773 static const int SEARCH_NOCASE = SEARCH_NOCASE;
1774 static const int SEARCH_FILES = SEARCH_FILES;
1775 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
1776 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
1778 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
1779 Dataiterator *di = solv_calloc(1, sizeof(*di));
1780 dataiterator_init(di, pool, repo, p, key, match, flags);
1784 dataiterator_free($self);
1787 #if defined(SWIGPYTHON)
1789 def __iter__(self): return self
1792 %rename("next") __next__();
1794 %exception __next__ {
1797 PyErr_SetString(PyExc_StopIteration,"no more matches");
1803 perliter(solv::Dataiterator)
1805 %newobject __next__;
1806 Datamatch *__next__() {
1808 if (!dataiterator_step($self)) {
1811 ndi = solv_calloc(1, sizeof(*ndi));
1812 dataiterator_init_clone(ndi, $self);
1813 dataiterator_strdup(ndi);
1819 while ((d = Dataiterator___next__($self)) != 0) {
1820 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
1824 void prepend_keyname(Id key) {
1825 dataiterator_prepend_keyname($self, key);
1827 void skip_solvable() {
1828 dataiterator_skip_solvable($self);
1833 Id lookup_id(Id keyname) {
1834 Pool *pool = $self->repo->pool;
1835 Datapos oldpos = pool->pos;
1838 r = pool_lookup_id(pool, SOLVID_POS, keyname);
1842 const char *lookup_str(Id keyname) {
1843 Pool *pool = $self->repo->pool;
1844 Datapos oldpos = pool->pos;
1847 r = pool_lookup_str(pool, SOLVID_POS, keyname);
1851 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
1852 Pool *pool = $self->repo->pool;
1853 Datapos oldpos = pool->pos;
1854 unsigned long long r;
1856 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
1860 bool lookup_void(Id keyname) {
1861 Pool *pool = $self->repo->pool;
1862 Datapos oldpos = pool->pos;
1865 r = pool_lookup_void(pool, SOLVID_POS, keyname);
1869 %newobject lookup_checksum;
1870 Chksum *lookup_checksum(Id keyname) {
1871 Pool *pool = $self->repo->pool;
1872 Datapos oldpos = pool->pos;
1874 const unsigned char *b;
1876 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
1878 return solv_chksum_create_from_bin(type, b);
1880 const char *lookup_deltaseq() {
1881 Pool *pool = $self->repo->pool;
1882 Datapos oldpos = pool->pos;
1885 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
1887 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
1888 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
1893 const char *lookup_deltalocation(unsigned int *OUTPUT) {
1894 Pool *pool = $self->repo->pool;
1895 Datapos oldpos = pool->pos;
1898 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
1902 Queue lookup_idarray(Id keyname) {
1903 Pool *pool = $self->repo->pool;
1904 Datapos oldpos = pool->pos;
1908 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
1912 %newobject Dataiterator;
1913 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1914 Pool *pool = $self->repo->pool;
1915 Datapos oldpos = pool->pos;
1918 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
1926 dataiterator_free($self);
1929 %newobject solvable;
1930 XSolvable * const solvable;
1932 const char * const key_idstr;
1934 const char * const type_idstr;
1936 const char * const idstr;
1937 const char * const str;
1938 BinaryBlob const binary;
1939 unsigned long long const num;
1940 unsigned int const num2;
1942 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
1943 return new_XSolvable(di->pool, di->solvid);
1945 SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
1946 return di->key->name;
1948 SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
1949 return pool_id2str(di->pool, di->key->name);
1951 SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
1952 return di->key->type;
1954 SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
1955 return pool_id2str(di->pool, di->key->type);
1957 SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
1960 SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
1961 if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
1962 return repodata_dir2str(di->data, di->kv.id, 0);
1963 if (di->data && di->data->localpool)
1964 return stringpool_id2str(&di->data->spool, di->kv.id);
1965 return pool_id2str(di->pool, di->kv.id);
1967 SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
1970 SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
1974 if (di->key->type == REPOKEY_TYPE_BINARY)
1976 bl.data = di->kv.str;
1977 bl.len = di->kv.num;
1979 else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
1980 bl.data = di->kv.str;
1983 SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
1984 if (di->key->type == REPOKEY_TYPE_NUM)
1985 return SOLV_KV_NUM64(&di->kv);
1988 SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
1994 Pool *pool = $self->pool;
1995 Datapos *pos, oldpos = pool->pos;
1996 dataiterator_setpos($self);
1997 pos = solv_calloc(1, sizeof(*pos));
2002 %newobject parentpos;
2003 Datapos *parentpos() {
2004 Pool *pool = $self->pool;
2005 Datapos *pos, oldpos = pool->pos;
2006 dataiterator_setpos_parent($self);
2007 pos = solv_calloc(1, sizeof(*pos));
2012 #if defined(SWIGPERL)
2013 /* cannot use str here because swig reports a bogus conflict... */
2014 %rename("stringify") __str__;
2016 *solv::Datamatch::str = *solvc::Datamatch_stringify;
2019 const char *__str__() {
2020 KeyValue kv = $self->kv;
2021 const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
2022 return str ? str : "";
2026 %extend Pool_solvable_iterator {
2027 Pool_solvable_iterator(Pool *pool) {
2028 Pool_solvable_iterator *s;
2029 s = solv_calloc(1, sizeof(*s));
2033 #if defined(SWIGPYTHON)
2035 def __iter__(self): return self
2038 %rename("next") __next__();
2040 %exception __next__ {
2043 PyErr_SetString(PyExc_StopIteration,"no more matches");
2049 perliter(solv::Pool_solvable_iterator)
2051 %newobject __next__;
2052 XSolvable *__next__() {
2053 Pool *pool = $self->pool;
2054 if ($self->id >= pool->nsolvables)
2056 while (++$self->id < pool->nsolvables)
2057 if (pool->solvables[$self->id].repo)
2058 return new_XSolvable(pool, $self->id);
2064 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2065 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2069 %newobject __getitem__;
2070 XSolvable *__getitem__(Id key) {
2071 Pool *pool = $self->pool;
2072 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2073 return new_XSolvable(pool, key);
2077 return $self->pool->nsolvables;
2081 %extend Pool_repo_iterator {
2082 Pool_repo_iterator(Pool *pool) {
2083 Pool_repo_iterator *s;
2084 s = solv_calloc(1, sizeof(*s));
2088 #if defined(SWIGPYTHON)
2090 def __iter__(self): return self
2093 %rename("next") __next__();
2095 %exception __next__ {
2098 PyErr_SetString(PyExc_StopIteration,"no more matches");
2104 perliter(solv::Pool_repo_iterator)
2106 %newobject __next__;
2108 Pool *pool = $self->pool;
2109 if ($self->id >= pool->nrepos)
2111 while (++$self->id < pool->nrepos) {
2112 Repo *r = pool_id2repo(pool, $self->id);
2121 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2122 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
2126 Repo *__getitem__(Id key) {
2127 Pool *pool = $self->pool;
2128 if (key > 0 && key < pool->nrepos)
2129 return pool_id2repo(pool, key);
2133 return $self->pool->nrepos;
2137 %extend Repo_solvable_iterator {
2138 Repo_solvable_iterator(Repo *repo) {
2139 Repo_solvable_iterator *s;
2140 s = solv_calloc(1, sizeof(*s));
2144 #if defined(SWIGPYTHON)
2146 def __iter__(self): return self
2149 %rename("next") __next__();
2151 %exception __next__ {
2154 PyErr_SetString(PyExc_StopIteration,"no more matches");
2160 perliter(solv::Repo_solvable_iterator)
2162 %newobject __next__;
2163 XSolvable *__next__() {
2164 Repo *repo = $self->repo;
2165 Pool *pool = repo->pool;
2166 if (repo->start > 0 && $self->id < repo->start)
2167 $self->id = repo->start - 1;
2168 if ($self->id >= repo->end)
2170 while (++$self->id < repo->end)
2171 if (pool->solvables[$self->id].repo == repo)
2172 return new_XSolvable(pool, $self->id);
2178 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2179 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2183 %newobject __getitem__;
2184 XSolvable *__getitem__(Id key) {
2185 Repo *repo = $self->repo;
2186 Pool *pool = repo->pool;
2187 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2188 return new_XSolvable(pool, key);
2192 return $self->repo->pool->nsolvables;
2197 Dep(Pool *pool, Id id) {
2201 s = solv_calloc(1, sizeof(*s));
2207 Dep *Rel(int flags, DepId evrid, bool create=1) {
2208 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2211 return new_Dep($self->pool, id);
2213 %newobject Selection_name;
2214 Selection *Selection_name(int setflags=0) {
2215 Selection *sel = new_Selection($self->pool);
2216 if (ISRELDEP($self->id)) {
2217 Reldep *rd = GETRELDEP($self->pool, $self->id);
2218 if (rd->flags == REL_EQ) {
2219 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2220 if (ISRELDEP(rd->name))
2221 rd = GETRELDEP($self->pool, rd->name);
2223 if (rd->flags == REL_ARCH)
2224 setflags |= SOLVER_SETARCH;
2226 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2229 %newobject Selection_provides;
2230 Selection *Selection_provides(int setflags=0) {
2231 Selection *sel = new_Selection($self->pool);
2232 if (ISRELDEP($self->id)) {
2233 Reldep *rd = GETRELDEP($self->pool, $self->id);
2234 if (rd->flags == REL_ARCH)
2235 setflags |= SOLVER_SETARCH;
2237 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2241 return pool_dep2str($self->pool, $self->id);
2243 bool __eq__(Dep *s) {
2244 return $self->pool == s->pool && $self->id == s->id;
2246 bool __ne__(Dep *s) {
2247 return !Dep___eq__($self, s);
2249 #if defined(SWIGPERL)
2250 %rename("str") __str__;
2252 const char *__str__() {
2253 return pool_dep2str($self->pool, $self->id);
2255 %newobject __repr__;
2256 const char *__repr__() {
2258 sprintf(buf, "<Id #%d ", $self->id);
2259 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2264 XSolvable(Pool *pool, Id id) {
2266 if (!id || id >= pool->nsolvables)
2268 s = solv_calloc(1, sizeof(*s));
2274 return pool_solvid2str($self->pool, $self->id);
2276 const char *lookup_str(Id keyname) {
2277 return pool_lookup_str($self->pool, $self->id, keyname);
2279 Id lookup_id(Id keyname) {
2280 return pool_lookup_id($self->pool, $self->id, keyname);
2282 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2283 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2285 bool lookup_void(Id keyname) {
2286 return pool_lookup_void($self->pool, $self->id, keyname);
2288 %newobject lookup_checksum;
2289 Chksum *lookup_checksum(Id keyname) {
2291 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2292 return solv_chksum_create_from_bin(type, b);
2294 Queue lookup_idarray(Id keyname, Id marker = -1) {
2295 Solvable *s = $self->pool->solvables + $self->id;
2298 solvable_lookup_deparray(s, keyname, &r, marker);
2301 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2302 %newobject lookup_deparray;
2303 Queue lookup_deparray(Id keyname, Id marker = -1) {
2304 Solvable *s = $self->pool->solvables + $self->id;
2307 solvable_lookup_deparray(s, keyname, &r, marker);
2310 const char *lookup_location(unsigned int *OUTPUT) {
2311 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2313 %newobject Dataiterator;
2314 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2315 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2318 %rename("installable?") installable;
2320 bool installable() {
2321 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2324 %rename("isinstalled?") isinstalled;
2326 bool isinstalled() {
2327 Pool *pool = $self->pool;
2328 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2333 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2334 Pool *pool = xs->pool;
2335 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2337 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2338 Pool *pool = xs->pool;
2339 return pool_id2str(pool, pool->solvables[xs->id].name);
2344 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2345 xs->pool->solvables[xs->id].name = nameid;
2347 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2348 return xs->pool->solvables[xs->id].name;
2353 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2354 Pool *pool = xs->pool;
2355 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2357 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2358 Pool *pool = xs->pool;
2359 return pool_id2str(pool, pool->solvables[xs->id].evr);
2364 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2365 xs->pool->solvables[xs->id].evr = evrid;
2367 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2368 return xs->pool->solvables[xs->id].evr;
2373 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2374 Pool *pool = xs->pool;
2375 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2377 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2378 Pool *pool = xs->pool;
2379 return pool_id2str(pool, pool->solvables[xs->id].arch);
2384 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2385 xs->pool->solvables[xs->id].arch = archid;
2387 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2388 return xs->pool->solvables[xs->id].arch;
2393 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2394 Pool *pool = xs->pool;
2395 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2397 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2398 Pool *pool = xs->pool;
2399 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2404 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2405 xs->pool->solvables[xs->id].vendor = vendorid;
2407 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2408 return xs->pool->solvables[xs->id].vendor;
2413 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2414 return xs->pool->solvables[xs->id].repo;
2418 /* old interface, please use the generic add_deparray instead */
2419 void add_provides(DepId id, Id marker = -1) {
2420 Solvable *s = $self->pool->solvables + $self->id;
2421 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2422 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2424 void add_obsoletes(DepId id) {
2425 Solvable *s = $self->pool->solvables + $self->id;
2426 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2428 void add_conflicts(DepId id) {
2429 Solvable *s = $self->pool->solvables + $self->id;
2430 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2432 void add_requires(DepId id, Id marker = -1) {
2433 Solvable *s = $self->pool->solvables + $self->id;
2434 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2435 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2437 void add_recommends(DepId id) {
2438 Solvable *s = $self->pool->solvables + $self->id;
2439 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2441 void add_suggests(DepId id) {
2442 Solvable *s = $self->pool->solvables + $self->id;
2443 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2445 void add_supplements(DepId id) {
2446 Solvable *s = $self->pool->solvables + $self->id;
2447 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2449 void add_enhances(DepId id) {
2450 Solvable *s = $self->pool->solvables + $self->id;
2451 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2454 void unset(Id keyname) {
2455 Solvable *s = $self->pool->solvables + $self->id;
2456 repo_unset(s->repo, $self->id, keyname);
2459 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2460 Solvable *s = $self->pool->solvables + $self->id;
2461 solvable_add_deparray(s, keyname, id, marker);
2464 %newobject Selection;
2465 Selection *Selection(int setflags=0) {
2466 Selection *sel = new_Selection($self->pool);
2467 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2472 %rename("identical?") identical;
2474 bool identical(XSolvable *s2) {
2475 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
2477 int evrcmp(XSolvable *s2) {
2478 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
2481 bool __eq__(XSolvable *s) {
2482 return $self->pool == s->pool && $self->id == s->id;
2484 bool __ne__(XSolvable *s) {
2485 return !XSolvable___eq__($self, s);
2487 #if defined(SWIGPERL)
2488 %rename("str") __str__;
2490 const char *__str__() {
2491 return pool_solvid2str($self->pool, $self->id);
2493 %newobject __repr__;
2494 const char *__repr__() {
2496 sprintf(buf, "<Solvable #%d ", $self->id);
2497 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2502 Problem(Solver *solv, Id id) {
2504 p = solv_calloc(1, sizeof(*p));
2509 %newobject findproblemrule;
2510 XRule *findproblemrule() {
2511 Id r = solver_findproblemrule($self->solv, $self->id);
2512 return new_XRule($self->solv, r);
2514 %newobject findallproblemrules;
2515 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2516 Queue findallproblemrules(int unfiltered=0) {
2517 Solver *solv = $self->solv;
2522 solver_findallproblemrules(solv, $self->id, &q);
2525 for (i = j = 0; i < q.count; i++)
2527 SolverRuleinfo rclass;
2528 probr = q.elements[i];
2529 rclass = solver_ruleclass(solv, probr);
2530 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
2532 q.elements[j++] = probr;
2535 queue_truncate(&q, j);
2539 int solution_count() {
2540 return solver_solution_count($self->solv, $self->id);
2542 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
2543 %newobject solutions;
2548 cnt = solver_solution_count($self->solv, $self->id);
2549 for (i = 1; i <= cnt; i++)
2553 #if defined(SWIGPERL)
2554 %rename("str") __str__;
2556 const char *__str__() {
2557 return solver_problem2str($self->solv, $self->id);
2562 Solution(Problem *p, Id id) {
2564 s = solv_calloc(1, sizeof(*s));
2566 s->problemid = p->id;
2570 int element_count() {
2571 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2574 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
2575 %newobject elements;
2576 Queue elements(bool expandreplaces=0) {
2580 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
2581 for (i = 1; i <= cnt; i++)
2584 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
2586 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
2592 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
2593 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
2595 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
2596 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2597 queue_push2(&q, p, rp);
2599 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
2600 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2601 queue_push2(&q, p, rp);
2603 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
2604 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2605 queue_push2(&q, p, rp);
2607 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
2608 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2609 queue_push2(&q, p, rp);
2614 queue_push2(&q, i, type);
2615 queue_push2(&q, p, rp);
2621 %extend Solutionelement {
2622 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
2624 e = solv_calloc(1, sizeof(*e));
2626 e->problemid = problemid;
2638 if (p == SOLVER_SOLUTION_ERASE)
2643 else if (p == SOLVER_SOLUTION_REPLACE)
2648 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
2649 illegal = POLICY_ILLEGAL_DOWNGRADE;
2650 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
2651 illegal = POLICY_ILLEGAL_ARCHCHANGE;
2652 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
2653 illegal = POLICY_ILLEGAL_VENDORCHANGE;
2654 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2655 illegal = POLICY_ILLEGAL_NAMECHANGE;
2657 return pool_tmpjoin($self->solv->pool, "allow ", policy_illegal2str($self->solv, illegal, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp), 0);
2658 return solver_solutionelement2str($self->solv, p, rp);
2660 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
2661 %newobject replaceelements;
2662 Queue replaceelements() {
2667 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2670 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2671 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
2672 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
2673 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
2674 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
2675 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
2676 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
2677 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
2678 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
2680 queue_push(&q, $self->type);
2683 int illegalreplace() {
2684 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
2686 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
2688 %newobject solvable;
2689 XSolvable * const solvable;
2690 %newobject replacement;
2691 XSolvable * const replacement;
2694 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
2695 return new_XSolvable(e->solv->pool, e->p);
2697 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
2698 return new_XSolvable(e->solv->pool, e->rp);
2700 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
2701 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
2703 return (e->p - 1) / 2;
2708 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
2709 if ($self->type == SOLVER_SOLUTION_JOB || SOLVER_SOLUTION_POOLJOB)
2710 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
2711 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
2712 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
2713 if ($self->type == SOLVER_SOLUTION_REPLACE || $self->type == SOLVER_SOLUTION_REPLACE_DOWNGRADE || $self->type == SOLVER_SOLUTION_REPLACE_ARCHCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_VENDORCHANGE || $self->type == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
2714 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
2715 if ($self->type == SOLVER_SOLUTION_ERASE)
2716 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
2722 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
2723 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
2724 static const int SOLVER_RULE_RPM_NOT_INSTALLABLE = SOLVER_RULE_RPM_NOT_INSTALLABLE;
2725 static const int SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP = SOLVER_RULE_RPM_NOTHING_PROVIDES_DEP;
2726 static const int SOLVER_RULE_RPM_PACKAGE_REQUIRES = SOLVER_RULE_RPM_PACKAGE_REQUIRES;
2727 static const int SOLVER_RULE_RPM_SELF_CONFLICT = SOLVER_RULE_RPM_SELF_CONFLICT;
2728 static const int SOLVER_RULE_RPM_PACKAGE_CONFLICT = SOLVER_RULE_RPM_PACKAGE_CONFLICT;
2729 static const int SOLVER_RULE_RPM_SAME_NAME = SOLVER_RULE_RPM_SAME_NAME;
2730 static const int SOLVER_RULE_RPM_PACKAGE_OBSOLETES = SOLVER_RULE_RPM_PACKAGE_OBSOLETES;
2731 static const int SOLVER_RULE_RPM_IMPLICIT_OBSOLETES = SOLVER_RULE_RPM_IMPLICIT_OBSOLETES;
2732 static const int SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES = SOLVER_RULE_RPM_INSTALLEDPKG_OBSOLETES;
2733 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
2734 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
2735 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
2736 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
2737 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
2738 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
2739 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
2740 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
2741 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
2742 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
2743 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
2745 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
2746 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
2747 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
2748 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
2749 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
2750 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
2751 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
2752 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
2753 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
2754 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
2755 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
2757 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
2758 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
2759 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
2760 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
2762 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
2763 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
2764 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
2765 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
2766 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
2767 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
2768 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
2769 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
2770 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
2771 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
2772 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
2773 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
2774 static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
2775 static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
2776 static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
2777 static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
2778 static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
2779 static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
2780 static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
2781 static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
2783 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
2784 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
2785 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
2786 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
2787 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
2788 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
2789 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
2790 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
2791 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
2792 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
2793 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
2799 int set_flag(int flag, int value) {
2800 return solver_set_flag($self, flag, value);
2802 int get_flag(int flag) {
2803 return solver_get_flag($self, flag);
2805 #if defined(SWIGPYTHON)
2807 def solve(self, jobs):
2809 for job in jobs: j += [job.how, job.what]
2810 return self.solve_helper(j)
2813 #if defined(SWIGPERL)
2815 sub solv::Solver::solve {
2816 my ($self, $jobs) = @_;
2817 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
2818 return $self->solve_helper(\@j);
2822 #if defined(SWIGRUBY)
2825 "class Solv::Solver\n"
2826 " def solve(jobs)\n"
2828 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
2829 " solve_helper(jl)\n"
2835 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
2836 %newobject solve_helper;
2837 Queue solve_helper(Queue jobs) {
2841 solver_solve($self, &jobs);
2842 cnt = solver_problem_count($self);
2843 for (i = 1; i <= cnt; i++)
2847 %newobject transaction;
2848 Transaction *transaction() {
2849 return solver_create_transaction($self);
2852 int describe_decision(XSolvable *s, XRule **OUTPUT) {
2854 int reason = solver_describe_decision($self, s->id, &ruleid);
2855 *OUTPUT = new_XRule($self, ruleid);
2860 %extend Transaction {
2861 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
2862 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
2863 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
2864 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
2865 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
2866 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
2867 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
2868 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
2869 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
2870 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
2871 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
2872 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
2873 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
2874 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
2875 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
2876 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
2877 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
2878 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
2879 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
2880 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
2881 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
2882 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
2883 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
2884 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
2885 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
2886 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
2887 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
2888 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
2890 transaction_free($self);
2893 %rename("isempty?") isempty;
2896 return $self->steps.count == 0;
2899 %newobject othersolvable;
2900 XSolvable *othersolvable(XSolvable *s) {
2901 Id op = transaction_obs_pkg($self, s->id);
2902 return new_XSolvable($self->pool, op);
2905 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2906 %newobject allothersolvables;
2907 Queue allothersolvables(XSolvable *s) {
2910 transaction_all_obs_pkgs($self, s->id, &q);
2914 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
2915 %newobject classify;
2916 Queue classify(int mode = 0) {
2919 transaction_classify($self, mode, &q);
2923 # deprecated, use newsolvables instead
2924 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2925 %newobject newpackages;
2926 Queue newpackages() {
2930 cut = transaction_installedresult(self, &q);
2931 queue_truncate(&q, cut);
2935 # deprecated, use keptsolvables instead
2936 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2937 %newobject keptpackages;
2938 Queue keptpackages() {
2942 cut = transaction_installedresult(self, &q);
2944 queue_deleten(&q, 0, cut);
2948 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2949 %newobject newsolvables;
2950 Queue newsolvables() {
2954 cut = transaction_installedresult(self, &q);
2955 queue_truncate(&q, cut);
2959 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2960 %newobject keptsolvables;
2961 Queue keptsolvables() {
2965 cut = transaction_installedresult(self, &q);
2967 queue_deleten(&q, 0, cut);
2971 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
2975 queue_init_clone(&q, &$self->steps);
2979 int steptype(XSolvable *s, int mode) {
2980 return transaction_type($self, s->id, mode);
2982 int calc_installsizechange() {
2983 return transaction_calc_installsizechange($self);
2985 void order(int flags=0) {
2986 transaction_order($self, flags);
2990 %extend TransactionClass {
2991 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
2992 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
2993 cl->transaction = trans;
2997 cl->fromid = fromid;
3001 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
3002 %newobject solvables;
3006 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
3009 const char * const fromstr;
3010 const char * const tostr;
3012 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
3013 return pool_id2str(cl->transaction->pool, cl->fromid);
3015 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
3016 return pool_id2str(cl->transaction->pool, cl->toid);
3022 XRule(Solver *solv, Id id) {
3025 XRule *xr = solv_calloc(1, sizeof(*xr));
3032 SWIGINTERN int XRule_type_get(XRule *xr) {
3033 return solver_ruleclass(xr->solv, xr->id);
3038 Id type, source, target, dep;
3039 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
3040 return new_Ruleinfo($self, type, source, target, dep);
3042 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
3043 %newobject allinfos;
3047 solver_allruleinfos($self->solv, $self->id, &q);
3051 bool __eq__(XRule *xr) {
3052 return $self->solv == xr->solv && $self->id == xr->id;
3054 bool __ne__(XRule *xr) {
3055 return !XRule___eq__($self, xr);
3057 %newobject __repr__;
3058 const char *__repr__() {
3060 sprintf(buf, "<Rule #%d>", $self->id);
3061 return solv_strdup(buf);
3066 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3067 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3071 ri->source = source;
3072 ri->target = target;
3073 ri->dep_id = dep_id;
3076 %newobject solvable;
3077 XSolvable * const solvable;
3078 %newobject othersolvable;
3079 XSolvable * const othersolvable;
3083 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3084 return new_XSolvable(ri->solv->pool, ri->source);
3086 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3087 return new_XSolvable(ri->solv->pool, ri->target);
3089 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3090 return new_Dep(ri->solv->pool, ri->dep_id);
3093 const char *problemstr() {
3094 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3099 XRepodata(Repo *repo, Id id) {
3100 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3106 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3108 void set_id(Id solvid, Id keyname, DepId id) {
3109 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3111 void set_str(Id solvid, Id keyname, const char *str) {
3112 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3114 void set_poolstr(Id solvid, Id keyname, const char *str) {
3115 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3117 void add_idarray(Id solvid, Id keyname, DepId id) {
3118 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3120 void add_flexarray(Id solvid, Id keyname, Id handle) {
3121 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3123 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3124 const unsigned char *buf = solv_chksum_get(chksum, 0);
3126 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3128 const char *lookup_str(Id solvid, Id keyname) {
3129 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3131 Queue lookup_idarray(Id solvid, Id keyname) {
3134 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3137 %newobject lookup_checksum;
3138 Chksum *lookup_checksum(Id solvid, Id keyname) {
3140 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3141 return solv_chksum_create_from_bin(type, b);
3143 void internalize() {
3144 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3146 void create_stubs() {
3147 Repodata *data = repo_id2repodata($self->repo, $self->id);
3148 data = repodata_create_stubs(data);
3149 $self->id = data->repodataid;
3151 bool write(FILE *fp) {
3152 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3154 bool add_solv(FILE *fp, int flags = 0) {
3155 Repodata *data = repo_id2repodata($self->repo, $self->id);
3156 int r, oldstate = data->state;
3157 data->state = REPODATA_LOADING;
3158 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3159 if (r || data->state == REPODATA_LOADING)
3160 data->state = oldstate;
3163 void extend_to_repo() {
3164 Repodata *data = repo_id2repodata($self->repo, $self->id);
3165 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3167 bool __eq__(XRepodata *xr) {
3168 return $self->repo == xr->repo && $self->id == xr->id;
3170 bool __ne__(XRepodata *xr) {
3171 return !XRepodata___eq__($self, xr);
3173 %newobject __repr__;
3174 const char *__repr__() {
3176 sprintf(buf, "<Repodata #%d>", $self->id);
3177 return solv_strdup(buf);
3181 #ifdef ENABLE_PUBKEY
3184 return solvsig_create(fp);
3187 solvsig_free($self);
3191 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3193 #ifdef ENABLE_PGPVRFY
3195 XSolvable *verify(Repo *repo, Chksum *chksum) {
3196 Id p = solvsig_verify($self, repo, chksum);
3197 return new_XSolvable(repo->pool, p);