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";
14 ** binaryblob handling
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) {
30 ba = Tcl_GetByteArrayFromObj($input, &bal);
39 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
43 if (!SWIG_IsOK(res)) {
44 #if defined(SWIGPYTHON)
45 const void *pybuf = 0;
46 Py_ssize_t pysize = 0;
47 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
49 %argument_fail(res, "BinaryBlob", $symname, $argnum);
55 %argument_fail(res, "const char *", $symname, $argnum);
58 $1 = (unsigned char *)buf;
62 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
63 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
66 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
67 #if defined(SWIGPYTHON) && defined(PYTHON3)
68 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
69 #elif defined(SWIGTCL)
70 Tcl_SetObjResult(interp, $1.data ? Tcl_NewByteArrayObj($1.data, $1.len) : NULL);
72 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
83 %typemap(arginit) Queue {
86 %typemap(freearg) Queue {
90 #if defined(SWIGPYTHON)
92 /* Check if is a list */
93 if (PyList_Check($input)) {
94 int size = PyList_Size($input);
96 for (i = 0; i < size; i++) {
97 PyObject *o = PyList_GetItem($input,i);
99 int e = SWIG_AsVal_int(o, &v);
101 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
105 SWIG_exception_fail(SWIG_TypeError, "list must contain only integers");
109 %typemap(out) Queue {
111 PyObject *o = PyList_New($1.count);
112 for (i = 0; i < $1.count; i++)
113 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
118 %define Queue2Array(type, step, con) %{
120 int cnt = $1.count / step;
121 Id *idp = $1.elements;
122 PyObject *o = PyList_New(cnt);
123 for (i = 0; i < cnt; i++, idp += step)
126 #define result resultx
129 PyList_SetItem(o, i, $result);
138 #endif /* SWIGPYTHON */
140 #if defined(SWIGPERL)
144 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
145 SWIG_croak("Argument $argnum is not an array reference.");
146 av = (AV*)SvRV($input);
148 for (i = 0; i <= size; i++) {
149 SV **sv = av_fetch(av, i, 0);
151 int e = SWIG_AsVal_int(*sv, &v);
153 SWIG_croak("list must contain only integers");
159 * av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
160 * $result = newRV_noinc((SV*)o); argvi++;
162 %typemap(out) Queue {
164 if (argvi + $1.count + 1 >= items) {
165 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
167 for (i = 0; i < $1.count; i++)
168 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
173 %define Queue2Array(type, step, con) %{
175 int cnt = $1.count / step;
176 Id *idp = $1.elements;
177 if (argvi + cnt + 1 >= items) {
178 EXTEND(sp, (argvi + cnt + 1) - items + 1);
180 for (i = 0; i < cnt; i++, idp += step)
183 #define result resultx
186 SvREFCNT_inc(ST(argvi - 1));
194 #endif /* SWIGPERL */
197 #if defined(SWIGRUBY)
201 ary = rb_Array($input);
202 size = RARRAY_LEN(ary);
205 for (i = 0; i < size; i++, o++) {
207 int e = SWIG_AsVal_int(*o, &v);
209 SWIG_exception_fail(SWIG_TypeError, "list must contain only integers");
213 %typemap(out) Queue {
215 VALUE o = rb_ary_new2($1.count);
216 for (i = 0; i < $1.count; i++)
217 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
221 %typemap(arginit) Queue {
224 %typemap(freearg) Queue {
227 %define Queue2Array(type, step, con) %{
229 int cnt = $1.count / step;
230 Id *idp = $1.elements;
231 VALUE o = rb_ary_new2(cnt);
232 for (i = 0; i < cnt; i++, idp += step)
235 #define result resultx
238 rb_ary_store(o, i, $result);
246 #endif /* SWIGRUBY */
250 /* Check if is a list */
254 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
255 SWIG_exception_fail(SWIG_TypeError, "argument is not a list");
256 for (i = 0; i < size; i++) {
260 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
261 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
262 e = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(o, &v);
264 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
269 %typemap(out) Queue {
270 Tcl_Obj *objvx[$1.count];
273 for (i = 0; i < $1.count; i++) {
274 objvx[i] = SWIG_From_int($1.elements[i]);
276 Tcl_SetObjResult(interp, Tcl_NewListObj($1.count, objvx));
280 %define Queue2Array(type, step, con) %{
281 { /* scope is needed to make the goto of SWIG_exception_fail work */
283 int cnt = $1.count / step;
284 Id *idp = $1.elements;
287 for (i = 0; i < cnt; i++, idp += step) {
289 #define result resultx
290 #define Tcl_SetObjResult(i, x) resultobj = x
294 objvx[i] = resultobj;
295 #undef Tcl_SetObjResult
299 Tcl_SetObjResult(interp, Tcl_NewListObj(cnt, objvx));
305 %typemap(in) Queue solvejobs {
306 /* Check if is a list */
310 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
311 SWIG_exception_fail(SWIG_TypeError, "argument is not a list");
312 for (i = 0; i < size; i++) {
318 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
319 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
320 e = SWIG_ConvertPtr(o, &jp ,SWIGTYPE_p_Job, 0 | 0 );
322 SWIG_exception_fail(SWIG_ArgError(e), "list member is not a Job");
324 queue_push2(&$1, j->how, j->what);
331 #if defined(SWIGPERL)
333 /* work around a swig bug */
337 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
339 # ifndef MULTIPLICITY
340 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
342 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
348 %define perliter(class)
351 my $i = ${##class##::ITERATORS}{$_[0]};
353 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
355 $_[0]->__getitem__($_[1]);
358 sub class##::FETCHSIZE {
359 my $i = ${##class##::ITERATORS}{$_[0]};
361 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
371 #define SWIG_PERL_ITERATOR 0x80
373 SWIGRUNTIMEINLINE SV *
374 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
375 SV *result = sv_newmortal();
376 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
381 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
382 stash=SvSTASH(SvRV(obj));
383 if (flags & SWIG_POINTER_OWN) {
385 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
387 gv_init(gv, stash, "OWNER", 5, FALSE);
389 hv_store_ent(hv, obj, newSViv(1), 0);
391 if (flags & SWIG_PERL_ITERATOR) {
393 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
396 gv_init(gv, stash, "ITERATORS", 9, FALSE);
398 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
400 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
402 self=newRV_noinc((SV *)array);
403 sv_setsv(result, self);
404 SvREFCNT_dec((SV *)self);
405 sv_bless(result, stash);
407 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
414 %typemap(out) Perlarray {
415 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
417 %typemap(out) Perliterator {
418 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
421 %typemap(out) Pool_solvable_iterator * = Perlarray;
422 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
423 %typemap(out) Pool_repo_iterator * = Perlarray;
424 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
425 %typemap(out) Repo_solvable_iterator * = Perlarray;
426 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
427 %typemap(out) Dataiterator * = Perliterator;
429 #endif /* SWIGPERL */
436 #if defined(SWIGPYTHON)
437 typedef PyObject *AppObjectPtr;
438 %typemap(in) AppObjectPtr {
443 %typemap(out) AppObjectPtr {
444 $result = $1 ? $1 : Py_None;
447 #elif defined(SWIGPERL)
448 typedef SV *AppObjectPtr;
449 %typemap(in) AppObjectPtr {
452 sv_setsv((SV *)$1, $input);
456 %typemap(out) AppObjectPtr {
457 $result = sv_2mortal($1 ? SvREFCNT_inc($1) : newSV(0));
460 #elif defined(SWIGRUBY)
461 typedef VALUE AppObjectPtr;
462 %typemap(in) AppObjectPtr {
465 %typemap(out) AppObjectPtr {
468 #elif defined(SWIGTCL)
469 typedef Tcl_Obj *AppObjectPtr;
470 %typemap(in) AppObjectPtr {
472 Tcl_IncrRefCount($input);
475 %typemap(out) AppObjectPtr {
476 Tcl_SetObjResult(interp, $1 ? $1 : Tcl_NewObj());
479 #warning AppObjectPtr not defined for this language!
489 %fragment("SWIG_AsValFilePtr","header") {}
493 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
497 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
498 #elif defined(SWIGTCL)
499 SWIG_AsValSolvFpPtr SWIG_TCL_DECL_ARGS_2(void *obj, FILE **val) {
501 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
503 static swig_type_info* desc = 0;
507 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
508 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
510 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
514 ecode = SWIG_AsValFilePtr(obj, val);
515 if (ecode == SWIG_OK)
518 return SWIG_TypeError;
522 #define SWIG_AsValSolvFpPtr(x, y) SWIG_AsValSolvFpPtr SWIG_TCL_CALL_ARGS_2(x, y)
532 %fragment("SWIG_AsValDepId","header") {
536 SWIG_AsValDepId(VALUE obj, int *val) {
537 #elif defined(SWIGTCL)
538 SWIG_AsValDepId SWIG_TCL_DECL_ARGS_2(void *obj, int *val) {
540 SWIG_AsValDepId(void *obj, int *val) {
542 static swig_type_info* desc = 0;
545 if (!desc) desc = SWIG_TypeQuery("Dep *");
547 ecode = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(obj, val);
549 ecode = SWIG_AsVal_int(obj, val);
551 if (SWIG_IsOK(ecode))
553 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
555 *val = vptr ? ((Dep *)vptr)->id : 0;
558 return SWIG_TypeError;
562 #define SWIG_AsValDepId(x, y) SWIG_AsValDepId SWIG_TCL_CALL_ARGS_2(x, y)
567 ** Pool disown helper
570 %typemap(out) disown_helper {
571 #if defined(SWIGRUBY)
572 SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
573 #elif defined(SWIGPYTHON)
574 SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
575 #elif defined(SWIGPERL)
576 SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
577 #elif defined(SWIGTCL)
578 SWIG_ConvertPtr(objv[1], &argp1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
580 #warning disown_helper not implemented for this language, this is likely going to leak memory
584 Tcl_SetObjResult(interp, SWIG_From_int((int)(0)));
586 $result = SWIG_From_int((int)(0));
595 %include "typemaps.i"
597 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
600 %typemap(argout,noblock=1) XRule **OUTPUT {
601 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
604 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
605 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
609 ** the C declarations
615 #include <sys/stat.h>
616 #include <sys/utsname.h>
617 #include <sys/types.h>
621 /* argh, swig undefs bool for perl */
627 #include "poolarch.h"
631 #include "solverdebug.h"
632 #include "repo_solv.h"
634 #include "selection.h"
636 #include "repo_write.h"
638 #include "repo_rpmdb.h"
641 #include "repo_pubkey.h"
644 #include "repo_deb.h"
647 #include "repo_rpmmd.h"
648 #include "repo_updateinfoxml.h"
649 #include "repo_deltainfoxml.h"
650 #include "repo_repomdxml.h"
652 #ifdef ENABLE_SUSEREPO
653 #include "repo_products.h"
654 #include "repo_susetags.h"
655 #include "repo_content.h"
657 #ifdef ENABLE_MDKREPO
658 #include "repo_mdk.h"
660 #ifdef ENABLE_ARCHREPO
661 #include "repo_arch.h"
664 #include "repo_autopattern.h"
666 #include "solv_xfopen.h"
667 #include "testcase.h"
669 /* for old ruby versions */
671 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
674 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
677 #define SOLVER_SOLUTION_ERASE -100
678 #define SOLVER_SOLUTION_REPLACE -101
679 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
680 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
681 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
682 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
684 typedef void *AppObjectPtr;
710 } Pool_solvable_iterator;
715 } Pool_repo_iterator;
720 } Repo_solvable_iterator;
771 Transaction *transaction;
789 typedef Dataiterator Datamatch;
791 typedef int disown_helper;
808 SWIGINTERN void appdata_disown_helper(void *appdata) {
810 SWIGINTERN void appdata_clr_helper(void **appdatap) {
813 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
816 SWIGINTERN void *appdata_get_helper(void *appdata) {
821 #elif defined(SWIGTCL)
824 SWIGINTERN void appdata_disown_helper(void *appdata) {
826 SWIGINTERN void appdata_clr_helper(void **appdatap) {
828 Tcl_DecrRefCount((Tcl_Obj *)(*appdatap));
831 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
832 appdata_clr_helper(appdatap);
835 SWIGINTERN void *appdata_get_helper(void *appdata) {
840 #elif defined(SWIGPYTHON)
843 SWIGINTERN void appdata_disown_helper(void *appdata) {
844 struct myappdata *myappdata = appdata;
845 if (!myappdata || !myappdata->appdata || myappdata->disowned)
847 myappdata->disowned = 1;
848 Py_DECREF((PyObject *)myappdata->appdata);
850 SWIGINTERN void appdata_clr_helper(void **appdatap) {
851 struct myappdata *myappdata = *(struct myappdata **)appdatap;
852 if (myappdata && myappdata->appdata && !myappdata->disowned) {
853 Py_DECREF((PyObject *)myappdata->appdata);
855 *appdatap = solv_free(myappdata);
857 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
858 appdata_clr_helper(appdatap);
860 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
861 myappdata->appdata = appdata;
864 SWIGINTERN void *appdata_get_helper(void *appdata) {
865 return appdata ? ((struct myappdata *)appdata)->appdata : 0;
870 #elif defined(SWIGPERL)
873 SWIGINTERN void appdata_disown_helper(void *appdata) {
874 struct myappdata *myappdata = appdata;
876 if (!myappdata || !myappdata->appdata || myappdata->disowned)
878 rsv = myappdata->appdata;
881 myappdata->appdata = SvRV(rsv);
882 myappdata->disowned = 1;
885 SWIGINTERN void appdata_clr_helper(void **appdatap) {
886 struct myappdata *myappdata = *(struct myappdata **)appdatap;
887 if (myappdata && myappdata->appdata && !myappdata->disowned) {
888 SvREFCNT_dec((SV *)myappdata->appdata);
890 *appdatap = solv_free(myappdata);
892 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
893 appdata_clr_helper(appdatap);
895 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
896 myappdata->appdata = appdata;
899 SWIGINTERN void *appdata_get_helper(void *appdata) {
900 struct myappdata *myappdata = appdata;
901 if (!myappdata || !myappdata->appdata)
903 return myappdata->disowned ? newRV_noinc((SV *)myappdata->appdata) : myappdata->appdata;
909 #warning appdata helpers not implemented for this language
914 ** the SWIG declarations defining the API
918 %mixin Dataiterator "Enumerable";
919 %mixin Pool_solvable_iterator "Enumerable";
920 %mixin Pool_repo_iterator "Enumerable";
921 %mixin Repo_solvable_iterator "Enumerable";
928 /* from repodata.h */
929 %constant Id SOLVID_META;
930 %constant Id SOLVID_POS;
932 %constant int REL_EQ;
933 %constant int REL_GT;
934 %constant int REL_LT;
935 %constant int REL_ARCH;
936 %constant int REL_AND;
937 %constant int REL_OR;
938 %constant int REL_WITH;
939 %constant int REL_COND;
940 %constant int REL_ELSE;
951 /* put before pool/repo so we can access the constructor */
952 %nodefaultdtor Dataiterator;
953 typedef struct {} Dataiterator;
976 typedef struct {} Pool_solvable_iterator;
977 typedef struct {} Pool_repo_iterator;
978 typedef struct {} Repo_solvable_iterator;
980 %nodefaultctor Datamatch;
981 %nodefaultdtor Datamatch;
988 %nodefaultctor Datapos;
1000 %nodefaultdtor Pool;
1004 %nodefaultctor Repo;
1005 %nodefaultdtor Repo;
1008 const char * const name;
1011 int const nsolvables;
1014 %nodefaultctor Solver;
1015 %nodefaultdtor Solver;
1023 #ifdef ENABLE_PUBKEY
1026 unsigned int const created;
1027 unsigned int const expires;
1028 const char * const keyid;
1032 %rename(xfopen) solvfp_xfopen;
1033 %rename(xfopen_fd) solvfp_xfopen_fd;
1035 %nodefaultctor SolvFp;
1039 %newobject solvfp_xfopen;
1040 %newobject solvfp_xfopen_fd;
1042 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
1043 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
1046 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
1052 fcntl(fd, F_SETFD, FD_CLOEXEC);
1053 fp = solv_xfopen_fd(fn, fd, mode);
1058 sfp = solv_calloc(1, sizeof(SolvFp));
1062 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
1065 fp = solv_xfopen(fn, mode);
1068 if (fileno(fp) != -1)
1069 fcntl(fileno(fp), F_SETFD, FD_CLOEXEC);
1070 sfp = solv_calloc(1, sizeof(SolvFp));
1077 Solver * const solv;
1082 Solver * const solv;
1090 Id const solutionid;
1095 %nodefaultctor Alternative;
1106 %nodefaultctor Transaction;
1107 %nodefaultdtor Transaction;
1113 Transaction * const transaction;
1127 return $self->fp ? fileno($self->fp) : -1;
1130 return $self->fp ? dup(fileno($self->fp)) : -1;
1132 bool write(const unsigned char *str, size_t len) {
1133 return fwrite(str, len, 1, $self->fp) == 1;
1138 return fflush($self->fp) == 0;
1144 ret = fclose($self->fp) == 0;
1148 void cloexec(bool state) {
1149 if (!$self->fp || fileno($self->fp) == -1)
1151 fcntl(fileno($self->fp), F_SETFD, state ? FD_CLOEXEC : 0);
1156 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
1157 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
1158 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
1159 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
1160 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
1161 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
1162 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
1163 static const Id SOLVER_NOOP = SOLVER_NOOP;
1164 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
1165 static const Id SOLVER_ERASE = SOLVER_ERASE;
1166 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
1167 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
1168 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
1169 static const Id SOLVER_LOCK = SOLVER_LOCK;
1170 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
1171 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
1172 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
1173 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
1174 static const Id SOLVER_ALLOWUNINSTALL = SOLVER_ALLOWUNINSTALL;
1175 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
1176 static const Id SOLVER_WEAK = SOLVER_WEAK;
1177 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
1178 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
1179 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
1180 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
1181 static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
1182 static const Id SOLVER_SETEV = SOLVER_SETEV;
1183 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
1184 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
1185 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
1186 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
1187 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
1188 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
1189 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
1191 Job(Pool *pool, int how, Id what) {
1192 Job *job = solv_calloc(1, sizeof(*job));
1199 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1200 %newobject solvables;
1204 pool_job2solvables($self->pool, &q, $self->how, $self->what);
1208 %rename("isemptyupdate?") isemptyupdate;
1210 bool isemptyupdate() {
1211 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
1214 #if defined(SWIGTCL)
1215 %rename("==") __eq__;
1217 bool __eq__(Job *j) {
1218 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
1220 #if defined(SWIGTCL)
1221 %rename("!=") __ne__;
1223 bool __ne__(Job *j) {
1224 return !Job___eq__($self, j);
1226 #if defined(SWIGPERL) || defined(SWIGTCL)
1227 %rename("str") __str__;
1229 const char *__str__() {
1230 return pool_job2str($self->pool, $self->how, $self->what, 0);
1232 #if defined(SWIGPERL) || defined(SWIGTCL)
1233 %rename("repr") __repr__;
1235 const char *__repr__() {
1236 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
1237 return pool_tmpjoin($self->pool, "<Job ", str, ">");
1242 static const Id SELECTION_NAME = SELECTION_NAME;
1243 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
1244 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
1245 static const Id SELECTION_CANON = SELECTION_CANON;
1246 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
1247 static const Id SELECTION_REL = SELECTION_REL;
1248 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
1249 static const Id SELECTION_GLOB = SELECTION_GLOB;
1250 static const Id SELECTION_FLAT = SELECTION_FLAT;
1251 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
1252 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
1253 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
1255 Selection(Pool *pool) {
1257 s = solv_calloc(1, sizeof(*s));
1263 queue_free(&$self->q);
1267 return $self->flags;
1270 %rename("isempty?") isempty;
1273 return $self->q.count == 0;
1275 void filter(Selection *lsel) {
1276 if ($self->pool != lsel->pool)
1277 queue_empty(&$self->q);
1279 selection_filter($self->pool, &$self->q, &lsel->q);
1281 void add(Selection *lsel) {
1282 if ($self->pool == lsel->pool)
1284 selection_add($self->pool, &$self->q, &lsel->q);
1285 $self->flags |= lsel->flags;
1288 void add_raw(Id how, Id what) {
1289 queue_push2(&$self->q, how, what);
1291 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
1293 Queue jobs(int flags) {
1296 queue_init_clone(&q, &$self->q);
1297 for (i = 0; i < q.count; i += 2)
1298 q.elements[i] |= flags;
1302 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1303 %newobject solvables;
1307 selection_solvables($self->pool, &$self->q, &q);
1311 #if defined(SWIGPERL) || defined(SWIGTCL)
1312 %rename("str") __str__;
1314 const char *__str__() {
1315 return pool_selection2str($self->pool, &$self->q, 0);
1317 #if defined(SWIGPERL) || defined(SWIGTCL)
1318 %rename("repr") __repr__;
1320 const char *__repr__() {
1321 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
1322 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
1328 return solv_chksum_create(type);
1330 Chksum(Id type, const char *hex) {
1331 unsigned char buf[64];
1332 int l = solv_chksum_len(type);
1335 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
1337 return solv_chksum_create_from_bin(type, buf);
1339 %newobject from_bin;
1340 static Chksum *from_bin(Id type, const unsigned char *str, size_t len) {
1341 return len == solv_chksum_len(type) ? solv_chksum_create_from_bin(type, str) : 0;
1343 #if defined(SWIGPERL)
1345 undef *solv::Chksum::from_bin;
1346 *solv::Chksum::from_bin = sub {
1348 my $self = solvc::Chksum_from_bin(@_);
1349 bless $self, $pkg if defined $self;
1354 solv_chksum_free($self, 0);
1358 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
1359 return solv_chksum_get_type(chk);
1362 void add(const unsigned char *str, size_t len) {
1363 solv_chksum_add($self, str, (int)len);
1365 void add_fp(FILE *fp) {
1368 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
1369 solv_chksum_add($self, buf, l);
1370 rewind(fp); /* convenience */
1372 void add_fd(int fd) {
1375 while ((l = read(fd, buf, sizeof(buf))) > 0)
1376 solv_chksum_add($self, buf, l);
1377 lseek(fd, 0, 0); /* convenience */
1379 void add_stat(const char *filename) {
1381 if (stat(filename, &stb))
1382 memset(&stb, 0, sizeof(stb));
1383 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1384 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1385 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1386 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1388 void add_fstat(int fd) {
1390 if (fstat(fd, &stb))
1391 memset(&stb, 0, sizeof(stb));
1392 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1393 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1394 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1395 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1400 const unsigned char *b;
1401 b = solv_chksum_get($self, &l);
1409 const unsigned char *b;
1412 b = solv_chksum_get($self, &l);
1413 ret = solv_malloc(2 * l + 1);
1414 solv_bin2hex(b, l, ret);
1417 const char *typestr() {
1418 return solv_chksum_type2str(solv_chksum_get_type($self));
1421 #if defined(SWIGTCL)
1422 %rename("==") __eq__;
1424 bool __eq__(Chksum *chk) {
1425 return solv_chksum_cmp($self, chk);
1427 #if defined(SWIGTCL)
1428 %rename("!=") __ne__;
1430 bool __ne__(Chksum *chk) {
1431 return !solv_chksum_cmp($self, chk);
1433 #if defined(SWIGRUBY)
1434 %rename("to_s") __str__;
1436 #if defined(SWIGPERL) || defined(SWIGTCL)
1437 %rename("str") __str__;
1440 const char *__str__() {
1443 if (solv_chksum_isfinished($self))
1444 h = Chksum_hex($self);
1445 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1446 solv_free((void *)h);
1449 #if defined(SWIGPERL) || defined(SWIGTCL)
1450 %rename("repr") __repr__;
1452 %newobject __repr__;
1453 const char *__repr__() {
1454 const char *h = Chksum___str__($self);
1455 const char *str = solv_dupjoin("<Chksum ", h, ">");
1456 solv_free((void *)h);
1462 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1463 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1464 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1465 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1466 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1467 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1468 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1469 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1470 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1473 Pool *pool = pool_create();
1476 void set_debuglevel(int level) {
1477 pool_setdebuglevel($self, level);
1479 int set_flag(int flag, int value) {
1480 return pool_set_flag($self, flag, value);
1482 int get_flag(int flag) {
1483 return pool_get_flag($self, flag);
1485 void set_rootdir(const char *rootdir) {
1486 pool_set_rootdir($self, rootdir);
1488 const char *get_rootdir(int flag) {
1489 return pool_get_rootdir($self);
1491 #if defined(SWIGPYTHON)
1493 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1494 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1495 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1496 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1501 return 0; /* exception */
1502 ecode = SWIG_AsVal_int(result, &vresult);
1504 return SWIG_IsOK(ecode) ? vresult : 0;
1507 void clr_loadcallback() {
1508 if ($self->loadcallback == loadcallback) {
1509 PyObject *obj = $self->loadcallbackdata;
1511 pool_setloadcallback($self, 0, 0);
1514 void set_loadcallback(PyObject *callable) {
1515 Pool_clr_loadcallback($self);
1517 Py_INCREF(callable);
1518 pool_setloadcallback($self, loadcallback, callable);
1521 #elif defined(SWIGPERL)
1523 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1527 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1532 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1534 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1544 void clr_loadcallback() {
1545 if ($self->loadcallback == loadcallback) {
1546 SvREFCNT_dec($self->loadcallbackdata);
1547 pool_setloadcallback($self, 0, 0);
1550 void set_loadcallback(SV *callable) {
1551 Pool_clr_loadcallback($self);
1553 SvREFCNT_inc(callable);
1554 pool_setloadcallback($self, loadcallback, callable);
1557 #elif defined(SWIGRUBY)
1559 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1560 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1561 VALUE callable = (VALUE)d;
1562 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1563 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1564 return res == Qtrue;
1566 SWIGINTERN void mark_Pool(void *ptr) {
1568 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1569 VALUE callable = (VALUE)pool->loadcallbackdata;
1570 rb_gc_mark(callable);
1574 void clr_loadcallback() {
1575 pool_setloadcallback($self, 0, 0);
1577 %typemap(in, numinputs=0) VALUE callable {
1578 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1580 void set_loadcallback(VALUE callable) {
1581 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1583 #elif defined(SWIGTCL)
1589 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1590 tcl_callback_t *callback_var = (tcl_callback_t *)d;
1591 Tcl_Interp *interp = callback_var->interp;
1592 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1593 int result, ecode = 0, vresult = 0;
1595 objvx[0] = callback_var->obj;
1596 objvx[1] = SWIG_NewInstanceObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
1597 Tcl_IncrRefCount(objvx[1]);
1598 result = Tcl_EvalObjv(interp, sizeof(objvx)/sizeof(*objvx), objvx, TCL_EVAL_GLOBAL);
1599 Tcl_DecrRefCount(objvx[1]);
1600 if (result != TCL_OK)
1601 return 0; /* exception */
1602 ecode = SWIG_AsVal_int(interp, Tcl_GetObjResult(interp), &vresult);
1603 return SWIG_IsOK(ecode) ? vresult : 0;
1606 void clr_loadcallback() {
1607 if ($self->loadcallback == loadcallback) {
1608 tcl_callback_t *callback_var = $self->loadcallbackdata;
1609 Tcl_DecrRefCount(callback_var->obj);
1610 solv_free(callback_var);
1611 pool_setloadcallback($self, 0, 0);
1614 void set_loadcallback(Tcl_Obj *callable, Tcl_Interp *interp) {
1615 Pool_clr_loadcallback($self);
1617 tcl_callback_t *callback_var = solv_malloc(sizeof(tcl_callback_t));
1618 Tcl_IncrRefCount(callable);
1619 callback_var->interp = interp;
1620 callback_var->obj = callable;
1621 pool_setloadcallback($self, loadcallback, callback_var);
1625 #warning loadcallback not implemented for this language
1632 FOR_REPOS(repoid, repo)
1633 appdata_clr_helper(&repo->appdata);
1634 Pool_clr_loadcallback(pool);
1635 appdata_clr_helper(&pool->appdata);
1638 disown_helper free() {
1642 FOR_REPOS(repoid, repo)
1643 appdata_clr_helper(&repo->appdata);
1644 Pool_clr_loadcallback(pool);
1645 appdata_clr_helper(&pool->appdata);
1649 disown_helper disown() {
1652 AppObjectPtr appdata;
1654 SWIGINTERN void Pool_appdata_set(Pool *pool, AppObjectPtr appdata) {
1655 appdata_set_helper(&pool->appdata, appdata);
1657 SWIGINTERN AppObjectPtr Pool_appdata_get(Pool *pool) {
1658 return appdata_get_helper(pool->appdata);
1661 void appdata_disown() {
1662 appdata_disown_helper($self->appdata);
1665 Id str2id(const char *str, bool create=1) {
1666 return pool_str2id($self, str, create);
1669 Dep *Dep(const char *str, bool create=1) {
1670 Id id = pool_str2id($self, str, create);
1671 return new_Dep($self, id);
1673 const char *id2str(Id id) {
1674 return pool_id2str($self, id);
1676 const char *dep2str(Id id) {
1677 return pool_dep2str($self, id);
1679 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1680 return pool_rel2id($self, name, evr, flags, create);
1682 Id id2langid(Id id, const char *lang, bool create=1) {
1683 return pool_id2langid($self, id, lang, create);
1685 void setarch(const char *arch = 0) {
1694 pool_setarch($self, arch);
1696 Repo *add_repo(const char *name) {
1697 return repo_create($self, name);
1699 const char *lookup_str(Id entry, Id keyname) {
1700 return pool_lookup_str($self, entry, keyname);
1702 Id lookup_id(Id entry, Id keyname) {
1703 return pool_lookup_id($self, entry, keyname);
1705 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1706 return pool_lookup_num($self, entry, keyname, notfound);
1708 bool lookup_void(Id entry, Id keyname) {
1709 return pool_lookup_void($self, entry, keyname);
1711 %newobject lookup_checksum;
1712 Chksum *lookup_checksum(Id entry, Id keyname) {
1714 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1715 return solv_chksum_create_from_bin(type, b);
1718 %newobject Dataiterator;
1719 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1720 return new_Dataiterator($self, 0, 0, key, match, flags);
1722 %newobject Dataiterator_solvid;
1723 Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
1724 return new_Dataiterator($self, 0, p, key, match, flags);
1726 const char *solvid2str(Id solvid) {
1727 return pool_solvid2str($self, solvid);
1729 void addfileprovides() {
1730 pool_addfileprovides($self);
1732 Queue addfileprovides_queue() {
1735 pool_addfileprovides_queue($self, &r, 0);
1738 void createwhatprovides() {
1739 pool_createwhatprovides($self);
1742 %newobject id2solvable;
1743 XSolvable *id2solvable(Id id) {
1744 return new_XSolvable($self, id);
1746 %newobject solvables;
1747 Pool_solvable_iterator * const solvables;
1749 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1750 return new_Pool_solvable_iterator(pool);
1753 %newobject solvables_iter;
1754 Pool_solvable_iterator * solvables_iter() {
1755 return new_Pool_solvable_iterator($self);
1758 Repo *id2repo(Id id) {
1759 if (id < 1 || id >= $self->nrepos)
1761 return pool_id2repo($self, id);
1765 Pool_repo_iterator * const repos;
1767 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1768 return new_Pool_repo_iterator(pool);
1771 %newobject repos_iter;
1772 Pool_repo_iterator * repos_iter() {
1773 return new_Pool_repo_iterator($self);
1777 const char * const errstr;
1779 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1780 pool_set_installed(pool, installed);
1782 SWIGINTERN Repo *Pool_installed_get(Pool *pool) {
1783 return pool->installed;
1785 SWIGINTERN const char *Pool_errstr_get(Pool *pool) {
1786 return pool_errstr(pool);
1790 Queue matchprovidingids(const char *match, int flags) {
1796 for (id = 1; id < pool->ss.nstrings; id++)
1797 if (pool->whatprovides[id])
1801 if (!datamatcher_init(&ma, match, flags)) {
1802 for (id = 1; id < pool->ss.nstrings; id++)
1803 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1805 datamatcher_free(&ma);
1812 Job *Job(int how, Id what) {
1813 return new_Job($self, how, what);
1816 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1817 %newobject whatprovides;
1818 Queue whatprovides(DepId dep) {
1823 FOR_PROVIDES(p, pp, dep)
1828 Id towhatprovides(Queue q) {
1829 return pool_queuetowhatprovides($self, &q);
1832 %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1833 %newobject whatmatchesdep;
1834 Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
1837 pool_whatmatchesdep($self, keyname, dep, &q, marker);
1842 %rename("isknownarch?") isknownarch;
1844 bool isknownarch(DepId id) {
1846 if (!id || id == ID_EMPTY)
1848 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1850 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1857 return solver_create($self);
1860 %newobject Selection;
1861 Selection *Selection() {
1862 return new_Selection($self);
1864 %newobject Selection_all;
1865 Selection *Selection_all(int setflags=0) {
1866 Selection *sel = new_Selection($self);
1867 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1871 Selection *select(const char *name, int flags) {
1872 Selection *sel = new_Selection($self);
1873 sel->flags = selection_make($self, &sel->q, name, flags);
1877 void setpooljobs_helper(Queue jobs) {
1878 queue_free(&$self->pooljobs);
1879 queue_init_clone(&$self->pooljobs, &jobs);
1881 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1882 %newobject getpooljobs;
1883 Queue getpooljobs() {
1885 queue_init_clone(&q, &$self->pooljobs);
1889 #if defined(SWIGPYTHON)
1891 def setpooljobs(self, jobs):
1893 for job in jobs: j += [job.how, job.what]
1894 self.setpooljobs_helper(j)
1897 #if defined(SWIGPERL)
1899 sub solv::Solver::setpooljobs {
1900 my ($self, $jobs) = @_;
1901 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1902 return $self->setpooljobs_helper(\@j);
1906 #if defined(SWIGRUBY)
1909 "class Solv::Pool\n"
1910 " def setpooljobs(jobs)\n"
1912 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1913 " setpooljobs_helper(jl)\n"
1922 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1923 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1924 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1925 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1926 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1927 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1928 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1929 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1930 #ifdef ENABLE_SUSEREPO
1931 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1934 void free(bool reuseids = 0) {
1935 appdata_clr_helper(&$self->appdata);
1936 repo_free($self, reuseids);
1938 void empty(bool reuseids = 0) {
1939 repo_empty($self, reuseids);
1942 %rename("isempty?") isempty;
1945 return !$self->nsolvables;
1948 AppObjectPtr appdata;
1950 SWIGINTERN void Repo_appdata_set(Repo *repo, AppObjectPtr appdata) {
1951 appdata_set_helper(&repo->appdata, appdata);
1953 SWIGINTERN AppObjectPtr Repo_appdata_get(Repo *repo) {
1954 return appdata_get_helper(repo->appdata);
1958 bool add_solv(const char *name, int flags = 0) {
1959 FILE *fp = fopen(name, "r");
1963 r = repo_add_solv($self, fp, flags);
1967 bool add_solv(FILE *fp, int flags = 0) {
1968 return repo_add_solv($self, fp, flags) == 0;
1971 %newobject add_solvable;
1972 XSolvable *add_solvable() {
1973 Id solvid = repo_add_solvable($self);
1974 return new_XSolvable($self->pool, solvid);
1978 bool add_rpmdb(int flags = 0) {
1979 return repo_add_rpmdb($self, 0, flags) == 0;
1981 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1982 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1985 XSolvable *add_rpm(const char *name, int flags = 0) {
1986 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
1989 #ifdef ENABLE_PUBKEY
1991 bool add_rpmdb_pubkeys(int flags = 0) {
1992 return repo_add_rpmdb_pubkeys($self, flags) == 0;
1995 %newobject add_pubkey;
1996 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
1997 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
1999 bool add_keyring(FILE *fp, int flags = 0) {
2000 return repo_add_keyring($self, fp, flags);
2002 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
2003 return repo_add_keydir($self, keydir, suffix, flags);
2007 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
2008 return repo_add_rpmmd($self, fp, language, flags) == 0;
2010 bool add_repomdxml(FILE *fp, int flags = 0) {
2011 return repo_add_repomdxml($self, fp, flags) == 0;
2013 bool add_updateinfoxml(FILE *fp, int flags = 0) {
2014 return repo_add_updateinfoxml($self, fp, flags) == 0;
2016 bool add_deltainfoxml(FILE *fp, int flags = 0) {
2017 return repo_add_deltainfoxml($self, fp, flags) == 0;
2020 #ifdef ENABLE_DEBIAN
2021 bool add_debdb(int flags = 0) {
2022 return repo_add_debdb($self, flags) == 0;
2024 bool add_debpackages(FILE *fp, int flags = 0) {
2025 return repo_add_debpackages($self, fp, flags) == 0;
2028 XSolvable *add_deb(const char *name, int flags = 0) {
2029 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
2032 #ifdef ENABLE_SUSEREPO
2033 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
2034 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
2036 bool add_content(FILE *fp, int flags = 0) {
2037 return repo_add_content($self, fp, flags) == 0;
2039 bool add_products(const char *proddir, int flags = 0) {
2040 return repo_add_products($self, proddir, flags) == 0;
2043 #ifdef ENABLE_MDKREPO
2044 bool add_mdk(FILE *fp, int flags = 0) {
2045 return repo_add_mdk($self, fp, flags) == 0;
2047 bool add_mdk_info(FILE *fp, int flags = 0) {
2048 return repo_add_mdk_info($self, fp, flags) == 0;
2051 #ifdef ENABLE_ARCHREPO
2052 bool add_arch_repo(FILE *fp, int flags = 0) {
2053 return repo_add_arch_repo($self, fp, flags) == 0;
2055 bool add_arch_local(const char *dir, int flags = 0) {
2056 return repo_add_arch_local($self, dir, flags) == 0;
2058 %newobject add_arch_pkg;
2059 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
2060 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
2064 bool add_autopattern(int flags = 0) {
2065 return repo_add_autopattern($self, flags) == 0;
2068 void internalize() {
2069 repo_internalize($self);
2071 bool write(FILE *fp) {
2072 return repo_write($self, fp) == 0;
2074 /* HACK, remove if no longer needed! */
2075 bool write_first_repodata(FILE *fp) {
2076 int oldnrepodata = $self->nrepodata;
2078 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
2079 res = repo_write($self, fp);
2080 $self->nrepodata = oldnrepodata;
2084 %newobject Dataiterator;
2085 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2086 return new_Dataiterator($self->pool, $self, 0, key, match, flags);
2088 %newobject Dataiterator_meta;
2089 Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
2090 return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
2095 SWIGINTERN Id Repo_id_get(Repo *repo) {
2096 return repo->repoid;
2099 %newobject solvables;
2100 Repo_solvable_iterator * const solvables;
2102 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
2103 return new_Repo_solvable_iterator(repo);
2107 Datapos * const meta;
2109 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
2110 Datapos *pos = solv_calloc(1, sizeof(*pos));
2111 pos->solvid = SOLVID_META;
2117 %newobject solvables_iter;
2118 Repo_solvable_iterator *solvables_iter() {
2119 return new_Repo_solvable_iterator($self);
2122 %newobject add_repodata;
2123 XRepodata *add_repodata(int flags = 0) {
2124 Repodata *rd = repo_add_repodata($self, flags);
2125 return new_XRepodata($self, rd->repodataid);
2128 void create_stubs() {
2130 if (!$self->nrepodata)
2132 data = repo_id2repodata($self, $self->nrepodata - 1);
2133 if (data->state != REPODATA_STUB)
2134 (void)repodata_create_stubs(data);
2137 %rename("iscontiguous?") iscontiguous;
2139 bool iscontiguous() {
2141 for (i = $self->start; i < $self->end; i++)
2142 if ($self->pool->solvables[i].repo != $self)
2146 %newobject first_repodata;
2147 XRepodata *first_repodata() {
2150 if ($self->nrepodata < 2)
2152 /* make sure all repodatas but the first are extensions */
2153 data = repo_id2repodata($self, 1);
2154 if (data->loadcallback)
2156 for (i = 2; i < $self->nrepodata; i++)
2158 data = repo_id2repodata($self, i);
2159 if (!data->loadcallback)
2160 return 0; /* oops, not an extension */
2162 return new_XRepodata($self, 1);
2165 %newobject Selection;
2166 Selection *Selection(int setflags=0) {
2167 Selection *sel = new_Selection($self->pool);
2168 setflags |= SOLVER_SETREPO;
2169 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
2173 #ifdef ENABLE_PUBKEY
2174 %newobject find_pubkey;
2175 XSolvable *find_pubkey(const char *keyid) {
2176 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
2180 #if defined(SWIGTCL)
2181 %rename("==") __eq__;
2183 bool __eq__(Repo *repo) {
2184 return $self == repo;
2186 #if defined(SWIGTCL)
2187 %rename("!=") __ne__;
2189 bool __ne__(Repo *repo) {
2190 return $self != repo;
2192 #if defined(SWIGPERL) || defined(SWIGTCL)
2193 %rename("str") __str__;
2196 const char *__str__() {
2199 return solv_strdup($self->name);
2200 sprintf(buf, "Repo#%d", $self->repoid);
2201 return solv_strdup(buf);
2203 #if defined(SWIGPERL) || defined(SWIGTCL)
2204 %rename("repr") __repr__;
2206 %newobject __repr__;
2207 const char *__repr__() {
2211 sprintf(buf, "<Repo #%d ", $self->repoid);
2212 return solv_dupjoin(buf, $self->name, ">");
2214 sprintf(buf, "<Repo #%d>", $self->repoid);
2215 return solv_strdup(buf);
2219 %extend Dataiterator {
2220 static const int SEARCH_STRING = SEARCH_STRING;
2221 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
2222 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
2223 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
2224 static const int SEARCH_GLOB = SEARCH_GLOB;
2225 static const int SEARCH_REGEX = SEARCH_REGEX;
2226 static const int SEARCH_NOCASE = SEARCH_NOCASE;
2227 static const int SEARCH_FILES = SEARCH_FILES;
2228 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
2229 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
2231 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
2232 Dataiterator *di = solv_calloc(1, sizeof(*di));
2233 dataiterator_init(di, pool, repo, p, key, match, flags);
2237 dataiterator_free($self);
2240 #if defined(SWIGPYTHON)
2242 def __iter__(self): return self
2245 %rename("next") __next__();
2247 %exception __next__ {
2250 PyErr_SetString(PyExc_StopIteration,"no more matches");
2256 perliter(solv::Dataiterator)
2258 %newobject __next__;
2259 Datamatch *__next__() {
2261 if (!dataiterator_step($self)) {
2264 ndi = solv_calloc(1, sizeof(*ndi));
2265 dataiterator_init_clone(ndi, $self);
2266 dataiterator_strdup(ndi);
2272 while ((d = Dataiterator___next__($self)) != 0) {
2273 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
2277 void prepend_keyname(Id key) {
2278 dataiterator_prepend_keyname($self, key);
2280 void skip_solvable() {
2281 dataiterator_skip_solvable($self);
2286 Id lookup_id(Id keyname) {
2287 Pool *pool = $self->repo->pool;
2288 Datapos oldpos = pool->pos;
2291 r = pool_lookup_id(pool, SOLVID_POS, keyname);
2295 const char *lookup_str(Id keyname) {
2296 Pool *pool = $self->repo->pool;
2297 Datapos oldpos = pool->pos;
2300 r = pool_lookup_str(pool, SOLVID_POS, keyname);
2304 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2305 Pool *pool = $self->repo->pool;
2306 Datapos oldpos = pool->pos;
2307 unsigned long long r;
2309 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
2313 bool lookup_void(Id keyname) {
2314 Pool *pool = $self->repo->pool;
2315 Datapos oldpos = pool->pos;
2318 r = pool_lookup_void(pool, SOLVID_POS, keyname);
2322 %newobject lookup_checksum;
2323 Chksum *lookup_checksum(Id keyname) {
2324 Pool *pool = $self->repo->pool;
2325 Datapos oldpos = pool->pos;
2327 const unsigned char *b;
2329 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
2331 return solv_chksum_create_from_bin(type, b);
2333 const char *lookup_deltaseq() {
2334 Pool *pool = $self->repo->pool;
2335 Datapos oldpos = pool->pos;
2338 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
2340 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
2341 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
2346 const char *lookup_deltalocation(unsigned int *OUTPUT) {
2347 Pool *pool = $self->repo->pool;
2348 Datapos oldpos = pool->pos;
2351 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
2355 Queue lookup_idarray(Id keyname) {
2356 Pool *pool = $self->repo->pool;
2357 Datapos oldpos = pool->pos;
2361 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
2365 %newobject Dataiterator;
2366 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2367 Pool *pool = $self->repo->pool;
2368 Datapos oldpos = pool->pos;
2371 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
2379 dataiterator_free($self);
2382 %newobject solvable;
2383 XSolvable * const solvable;
2385 const char * const key_idstr;
2387 const char * const type_idstr;
2389 const char * const idstr;
2390 const char * const str;
2391 BinaryBlob const binary;
2392 unsigned long long const num;
2393 unsigned int const num2;
2395 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
2396 return new_XSolvable(di->pool, di->solvid);
2398 SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
2399 return di->key->name;
2401 SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
2402 return pool_id2str(di->pool, di->key->name);
2404 SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
2405 return di->key->type;
2407 SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
2408 return pool_id2str(di->pool, di->key->type);
2410 SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
2413 SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
2414 if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
2415 return repodata_dir2str(di->data, di->kv.id, 0);
2416 if (di->data && di->data->localpool)
2417 return stringpool_id2str(&di->data->spool, di->kv.id);
2418 return pool_id2str(di->pool, di->kv.id);
2420 SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
2423 SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
2427 if (di->key->type == REPOKEY_TYPE_BINARY)
2429 bl.data = di->kv.str;
2430 bl.len = di->kv.num;
2432 else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
2433 bl.data = di->kv.str;
2436 SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
2437 if (di->key->type == REPOKEY_TYPE_NUM)
2438 return SOLV_KV_NUM64(&di->kv);
2441 SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
2447 Pool *pool = $self->pool;
2448 Datapos *pos, oldpos = pool->pos;
2449 dataiterator_setpos($self);
2450 pos = solv_calloc(1, sizeof(*pos));
2455 %newobject parentpos;
2456 Datapos *parentpos() {
2457 Pool *pool = $self->pool;
2458 Datapos *pos, oldpos = pool->pos;
2459 dataiterator_setpos_parent($self);
2460 pos = solv_calloc(1, sizeof(*pos));
2465 #if defined(SWIGPERL)
2466 /* cannot use str here because swig reports a bogus conflict... */
2467 %rename("stringify") __str__;
2469 *solv::Datamatch::str = *solvc::Datamatch_stringify;
2472 #if defined(SWIGTCL)
2473 %rename("stringify") __str__;
2475 const char *__str__() {
2476 KeyValue kv = $self->kv;
2477 const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
2478 return str ? str : "";
2482 %extend Pool_solvable_iterator {
2483 Pool_solvable_iterator(Pool *pool) {
2484 Pool_solvable_iterator *s;
2485 s = solv_calloc(1, sizeof(*s));
2489 #if defined(SWIGPYTHON)
2491 def __iter__(self): return self
2494 %rename("next") __next__();
2496 %exception __next__ {
2499 PyErr_SetString(PyExc_StopIteration,"no more matches");
2505 perliter(solv::Pool_solvable_iterator)
2507 %newobject __next__;
2508 XSolvable *__next__() {
2509 Pool *pool = $self->pool;
2510 if ($self->id >= pool->nsolvables)
2512 while (++$self->id < pool->nsolvables)
2513 if (pool->solvables[$self->id].repo)
2514 return new_XSolvable(pool, $self->id);
2520 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2521 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2525 %newobject __getitem__;
2526 XSolvable *__getitem__(Id key) {
2527 Pool *pool = $self->pool;
2528 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2529 return new_XSolvable(pool, key);
2533 return $self->pool->nsolvables;
2537 %extend Pool_repo_iterator {
2538 Pool_repo_iterator(Pool *pool) {
2539 Pool_repo_iterator *s;
2540 s = solv_calloc(1, sizeof(*s));
2544 #if defined(SWIGPYTHON)
2546 def __iter__(self): return self
2549 %rename("next") __next__();
2551 %exception __next__ {
2554 PyErr_SetString(PyExc_StopIteration,"no more matches");
2560 perliter(solv::Pool_repo_iterator)
2562 %newobject __next__;
2564 Pool *pool = $self->pool;
2565 if ($self->id >= pool->nrepos)
2567 while (++$self->id < pool->nrepos) {
2568 Repo *r = pool_id2repo(pool, $self->id);
2577 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2578 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
2582 Repo *__getitem__(Id key) {
2583 Pool *pool = $self->pool;
2584 if (key > 0 && key < pool->nrepos)
2585 return pool_id2repo(pool, key);
2589 return $self->pool->nrepos;
2593 %extend Repo_solvable_iterator {
2594 Repo_solvable_iterator(Repo *repo) {
2595 Repo_solvable_iterator *s;
2596 s = solv_calloc(1, sizeof(*s));
2600 #if defined(SWIGPYTHON)
2602 def __iter__(self): return self
2605 %rename("next") __next__();
2607 %exception __next__ {
2610 PyErr_SetString(PyExc_StopIteration,"no more matches");
2616 perliter(solv::Repo_solvable_iterator)
2618 %newobject __next__;
2619 XSolvable *__next__() {
2620 Repo *repo = $self->repo;
2621 Pool *pool = repo->pool;
2622 if (repo->start > 0 && $self->id < repo->start)
2623 $self->id = repo->start - 1;
2624 if ($self->id >= repo->end)
2626 while (++$self->id < repo->end)
2627 if (pool->solvables[$self->id].repo == repo)
2628 return new_XSolvable(pool, $self->id);
2634 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2635 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2639 %newobject __getitem__;
2640 XSolvable *__getitem__(Id key) {
2641 Repo *repo = $self->repo;
2642 Pool *pool = repo->pool;
2643 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2644 return new_XSolvable(pool, key);
2648 return $self->repo->pool->nsolvables;
2653 Dep(Pool *pool, Id id) {
2657 s = solv_calloc(1, sizeof(*s));
2663 Dep *Rel(int flags, DepId evrid, bool create=1) {
2664 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2667 return new_Dep($self->pool, id);
2669 %newobject Selection_name;
2670 Selection *Selection_name(int setflags=0) {
2671 Selection *sel = new_Selection($self->pool);
2672 if (ISRELDEP($self->id)) {
2673 Reldep *rd = GETRELDEP($self->pool, $self->id);
2674 if (rd->flags == REL_EQ) {
2675 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2676 if (ISRELDEP(rd->name))
2677 rd = GETRELDEP($self->pool, rd->name);
2679 if (rd->flags == REL_ARCH)
2680 setflags |= SOLVER_SETARCH;
2682 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2685 %newobject Selection_provides;
2686 Selection *Selection_provides(int setflags=0) {
2687 Selection *sel = new_Selection($self->pool);
2688 if (ISRELDEP($self->id)) {
2689 Reldep *rd = GETRELDEP($self->pool, $self->id);
2690 if (rd->flags == REL_ARCH)
2691 setflags |= SOLVER_SETARCH;
2693 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2697 return pool_dep2str($self->pool, $self->id);
2699 #if defined(SWIGTCL)
2700 %rename("==") __eq__;
2702 bool __eq__(Dep *s) {
2703 return $self->pool == s->pool && $self->id == s->id;
2705 #if defined(SWIGTCL)
2706 %rename("!=") __ne__;
2708 bool __ne__(Dep *s) {
2709 return !Dep___eq__($self, s);
2711 #if defined(SWIGPERL) || defined(SWIGTCL)
2712 %rename("str") __str__;
2714 const char *__str__() {
2715 return pool_dep2str($self->pool, $self->id);
2717 #if defined(SWIGPERL) || defined(SWIGTCL)
2718 %rename("repr") __repr__;
2720 %newobject __repr__;
2721 const char *__repr__() {
2723 sprintf(buf, "<Id #%d ", $self->id);
2724 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2729 XSolvable(Pool *pool, Id id) {
2731 if (!id || id >= pool->nsolvables)
2733 s = solv_calloc(1, sizeof(*s));
2739 return pool_solvid2str($self->pool, $self->id);
2741 const char *lookup_str(Id keyname) {
2742 return pool_lookup_str($self->pool, $self->id, keyname);
2744 Id lookup_id(Id keyname) {
2745 return pool_lookup_id($self->pool, $self->id, keyname);
2747 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2748 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2750 bool lookup_void(Id keyname) {
2751 return pool_lookup_void($self->pool, $self->id, keyname);
2753 %newobject lookup_checksum;
2754 Chksum *lookup_checksum(Id keyname) {
2756 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2757 return solv_chksum_create_from_bin(type, b);
2759 Queue lookup_idarray(Id keyname, Id marker = -1) {
2760 Solvable *s = $self->pool->solvables + $self->id;
2763 solvable_lookup_deparray(s, keyname, &r, marker);
2766 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2767 %newobject lookup_deparray;
2768 Queue lookup_deparray(Id keyname, Id marker = -1) {
2769 Solvable *s = $self->pool->solvables + $self->id;
2772 solvable_lookup_deparray(s, keyname, &r, marker);
2775 const char *lookup_location(unsigned int *OUTPUT) {
2776 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2778 %newobject Dataiterator;
2779 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2780 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2783 %rename("installable?") installable;
2785 bool installable() {
2786 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2789 %rename("isinstalled?") isinstalled;
2791 bool isinstalled() {
2792 Pool *pool = $self->pool;
2793 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2798 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2799 Pool *pool = xs->pool;
2800 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2802 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2803 Pool *pool = xs->pool;
2804 return pool_id2str(pool, pool->solvables[xs->id].name);
2809 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2810 xs->pool->solvables[xs->id].name = nameid;
2812 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2813 return xs->pool->solvables[xs->id].name;
2818 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2819 Pool *pool = xs->pool;
2820 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2822 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2823 Pool *pool = xs->pool;
2824 return pool_id2str(pool, pool->solvables[xs->id].evr);
2829 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2830 xs->pool->solvables[xs->id].evr = evrid;
2832 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2833 return xs->pool->solvables[xs->id].evr;
2838 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2839 Pool *pool = xs->pool;
2840 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2842 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2843 Pool *pool = xs->pool;
2844 return pool_id2str(pool, pool->solvables[xs->id].arch);
2849 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2850 xs->pool->solvables[xs->id].arch = archid;
2852 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2853 return xs->pool->solvables[xs->id].arch;
2858 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2859 Pool *pool = xs->pool;
2860 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2862 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2863 Pool *pool = xs->pool;
2864 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2869 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2870 xs->pool->solvables[xs->id].vendor = vendorid;
2872 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2873 return xs->pool->solvables[xs->id].vendor;
2878 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2879 return xs->pool->solvables[xs->id].repo;
2883 /* old interface, please use the generic add_deparray instead */
2884 void add_provides(DepId id, Id marker = -1) {
2885 Solvable *s = $self->pool->solvables + $self->id;
2886 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2887 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2889 void add_obsoletes(DepId id) {
2890 Solvable *s = $self->pool->solvables + $self->id;
2891 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2893 void add_conflicts(DepId id) {
2894 Solvable *s = $self->pool->solvables + $self->id;
2895 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2897 void add_requires(DepId id, Id marker = -1) {
2898 Solvable *s = $self->pool->solvables + $self->id;
2899 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2900 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2902 void add_recommends(DepId id) {
2903 Solvable *s = $self->pool->solvables + $self->id;
2904 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2906 void add_suggests(DepId id) {
2907 Solvable *s = $self->pool->solvables + $self->id;
2908 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2910 void add_supplements(DepId id) {
2911 Solvable *s = $self->pool->solvables + $self->id;
2912 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2914 void add_enhances(DepId id) {
2915 Solvable *s = $self->pool->solvables + $self->id;
2916 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2919 void unset(Id keyname) {
2920 Solvable *s = $self->pool->solvables + $self->id;
2921 repo_unset(s->repo, $self->id, keyname);
2924 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2925 Solvable *s = $self->pool->solvables + $self->id;
2926 solvable_add_deparray(s, keyname, id, marker);
2929 %newobject Selection;
2930 Selection *Selection(int setflags=0) {
2931 Selection *sel = new_Selection($self->pool);
2932 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2937 %rename("identical?") identical;
2939 bool identical(XSolvable *s2) {
2940 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
2942 int evrcmp(XSolvable *s2) {
2943 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
2946 #if defined(SWIGTCL)
2947 %rename("==") __eq__;
2949 bool __eq__(XSolvable *s) {
2950 return $self->pool == s->pool && $self->id == s->id;
2952 #if defined(SWIGTCL)
2953 %rename("!=") __ne__;
2955 bool __ne__(XSolvable *s) {
2956 return !XSolvable___eq__($self, s);
2958 #if defined(SWIGPERL) || defined(SWIGTCL)
2959 %rename("str") __str__;
2961 const char *__str__() {
2962 return pool_solvid2str($self->pool, $self->id);
2964 #if defined(SWIGPERL) || defined(SWIGTCL)
2965 %rename("repr") __repr__;
2967 %newobject __repr__;
2968 const char *__repr__() {
2970 sprintf(buf, "<Solvable #%d ", $self->id);
2971 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
2976 Problem(Solver *solv, Id id) {
2978 p = solv_calloc(1, sizeof(*p));
2983 %newobject findproblemrule;
2984 XRule *findproblemrule() {
2985 Id r = solver_findproblemrule($self->solv, $self->id);
2986 return new_XRule($self->solv, r);
2988 %newobject findallproblemrules;
2989 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
2990 Queue findallproblemrules(int unfiltered=0) {
2991 Solver *solv = $self->solv;
2996 solver_findallproblemrules(solv, $self->id, &q);
2999 for (i = j = 0; i < q.count; i++)
3001 SolverRuleinfo rclass;
3002 probr = q.elements[i];
3003 rclass = solver_ruleclass(solv, probr);
3004 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
3006 q.elements[j++] = probr;
3009 queue_truncate(&q, j);
3013 int solution_count() {
3014 return solver_solution_count($self->solv, $self->id);
3016 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
3017 %newobject solutions;
3022 cnt = solver_solution_count($self->solv, $self->id);
3023 for (i = 1; i <= cnt; i++)
3027 #if defined(SWIGPERL) || defined(SWIGTCL)
3028 %rename("str") __str__;
3030 const char *__str__() {
3031 return solver_problem2str($self->solv, $self->id);
3036 Solution(Problem *p, Id id) {
3038 s = solv_calloc(1, sizeof(*s));
3040 s->problemid = p->id;
3044 int element_count() {
3045 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3048 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
3049 %newobject elements;
3050 Queue elements(bool expandreplaces=0) {
3054 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3055 for (i = 1; i <= cnt; i++)
3058 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
3060 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
3066 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
3067 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
3069 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
3070 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3071 queue_push2(&q, p, rp);
3073 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
3074 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3075 queue_push2(&q, p, rp);
3077 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
3078 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3079 queue_push2(&q, p, rp);
3081 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
3082 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3083 queue_push2(&q, p, rp);
3088 queue_push2(&q, i, type);
3089 queue_push2(&q, p, rp);
3095 %extend Solutionelement {
3096 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
3098 e = solv_calloc(1, sizeof(*e));
3100 e->problemid = problemid;
3112 if (p == SOLVER_SOLUTION_ERASE)
3117 else if (p == SOLVER_SOLUTION_REPLACE)
3122 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
3123 illegal = POLICY_ILLEGAL_DOWNGRADE;
3124 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
3125 illegal = POLICY_ILLEGAL_ARCHCHANGE;
3126 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
3127 illegal = POLICY_ILLEGAL_VENDORCHANGE;
3128 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
3129 illegal = POLICY_ILLEGAL_NAMECHANGE;
3131 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);
3132 return solver_solutionelement2str($self->solv, p, rp);
3134 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
3135 %newobject replaceelements;
3136 Queue replaceelements() {
3141 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3144 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3145 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
3146 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3147 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
3148 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3149 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
3150 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3151 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
3152 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3154 queue_push(&q, $self->type);
3157 int illegalreplace() {
3158 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3160 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3162 %newobject solvable;
3163 XSolvable * const solvable;
3164 %newobject replacement;
3165 XSolvable * const replacement;
3168 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
3169 return new_XSolvable(e->solv->pool, e->p);
3171 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
3172 return new_XSolvable(e->solv->pool, e->rp);
3174 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
3175 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
3177 return (e->p - 1) / 2;
3182 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
3183 if ($self->type == SOLVER_SOLUTION_JOB || $self->type == SOLVER_SOLUTION_POOLJOB)
3184 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
3185 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
3186 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
3187 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)
3188 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
3189 if ($self->type == SOLVER_SOLUTION_ERASE)
3190 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
3196 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
3197 static const int SOLVER_RULE_PKG = SOLVER_RULE_PKG;
3198 static const int SOLVER_RULE_PKG_NOT_INSTALLABLE = SOLVER_RULE_PKG_NOT_INSTALLABLE;
3199 static const int SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP = SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP;
3200 static const int SOLVER_RULE_PKG_REQUIRES = SOLVER_RULE_PKG_REQUIRES;
3201 static const int SOLVER_RULE_PKG_SELF_CONFLICT = SOLVER_RULE_PKG_SELF_CONFLICT;
3202 static const int SOLVER_RULE_PKG_CONFLICTS = SOLVER_RULE_PKG_CONFLICTS;
3203 static const int SOLVER_RULE_PKG_SAME_NAME = SOLVER_RULE_PKG_SAME_NAME;
3204 static const int SOLVER_RULE_PKG_OBSOLETES = SOLVER_RULE_PKG_OBSOLETES;
3205 static const int SOLVER_RULE_PKG_IMPLICIT_OBSOLETES = SOLVER_RULE_PKG_IMPLICIT_OBSOLETES;
3206 static const int SOLVER_RULE_PKG_INSTALLED_OBSOLETES = SOLVER_RULE_PKG_INSTALLED_OBSOLETES;
3207 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
3208 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
3209 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
3210 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
3211 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
3212 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
3213 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
3214 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
3215 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
3216 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
3217 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
3219 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
3220 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
3221 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
3222 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
3223 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
3224 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
3225 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
3226 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
3227 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
3228 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
3229 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
3231 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
3232 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
3233 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
3234 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
3236 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
3237 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
3238 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
3239 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
3240 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
3241 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
3242 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
3243 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
3244 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
3245 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
3246 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
3247 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
3248 static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
3249 static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
3250 static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
3251 static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
3252 static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
3253 static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
3254 static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
3255 static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
3256 static const int SOLVER_FLAG_NEED_UPDATEPROVIDE = SOLVER_FLAG_NEED_UPDATEPROVIDE;
3258 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
3259 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
3260 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
3261 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
3262 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
3263 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
3264 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
3265 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
3266 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
3267 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
3268 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
3271 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
3277 int set_flag(int flag, int value) {
3278 return solver_set_flag($self, flag, value);
3280 int get_flag(int flag) {
3281 return solver_get_flag($self, flag);
3283 #if defined(SWIGPYTHON)
3285 def solve(self, jobs):
3287 for job in jobs: j += [job.how, job.what]
3288 return self.solve_helper(j)
3291 #if defined(SWIGPERL)
3293 sub solv::Solver::solve {
3294 my ($self, $jobs) = @_;
3295 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
3296 return $self->solve_helper(\@j);
3300 #if defined(SWIGRUBY)
3303 "class Solv::Solver\n"
3304 " def solve(jobs)\n"
3306 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
3307 " solve_helper(jl)\n"
3313 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
3314 %newobject solve_helper;
3315 Queue solve_helper(Queue jobs) {
3319 solver_solve($self, &jobs);
3320 cnt = solver_problem_count($self);
3321 for (i = 1; i <= cnt; i++)
3325 #if defined(SWIGTCL)
3326 %typemap(out) Queue solve Queue2Array(Problem *, 1, new_Problem(arg1, id));
3328 Queue solve(Queue solvejobs) {
3332 solver_solve($self, &solvejobs);
3333 cnt = solver_problem_count($self);
3334 for (i = 1; i <= cnt; i++)
3340 %newobject transaction;
3341 Transaction *transaction() {
3342 return solver_create_transaction($self);
3345 int describe_decision(XSolvable *s, XRule **OUTPUT) {
3347 int reason = solver_describe_decision($self, s->id, &ruleid);
3348 *OUTPUT = new_XRule($self, ruleid);
3352 %newobject describe_weakdep_decision_raw;
3353 Queue describe_weakdep_decision_raw(XSolvable *s) {
3356 solver_describe_weakdep_decision($self, s->id, &q);
3359 #if defined(SWIGPYTHON)
3361 def describe_weakdep_decision(self, s):
3362 d = iter(self.describe_weakdep_decision_raw(s))
3363 return [ (t, XSolvable(self.pool, sid), Dep(self.pool, id)) for t, sid, id in zip(d, d, d) ]
3366 #if defined(SWIGPERL)
3368 sub solv::Solver::describe_weakdep_decision {
3369 my ($self, $s) = @_;
3370 my $pool = $self->{'pool'};
3372 my @d = $self->describe_weakdep_decision_raw($s);
3373 push @res, [ splice(@d, 0, 3) ] while @d;
3374 return map { [ $_->[0], solv::XSolvable->new($pool, $_->[1]), solv::Dep->new($pool, $_->[2]) ] } @res;
3378 #if defined(SWIGRUBY)
3381 "class Solv::Solver\n"
3382 " def describe_weakdep_decision(s)\n"
3383 " self.describe_weakdep_decision_raw(s).each_slice(3).map { |t, sid, id| [ t, Solv::XSolvable.new(self.pool, sid), Solv::Dep.new(self.pool, id)] }\n"
3390 int alternatives_count() {
3391 return solver_alternatives_count($self);
3394 %newobject alternative;
3395 Alternative *alternative(Id aid) {
3396 Alternative *a = solv_calloc(1, sizeof(*a));
3398 queue_init(&a->choices);
3399 a->type = solver_get_alternative($self, aid, &a->dep_id, &a->from_id, &a->chosen_id, &a->choices, &a->level);
3401 queue_free(&a->choices);
3405 if (a->type == SOLVER_ALTERNATIVE_TYPE_RULE) {
3412 %typemap(out) Queue all_alternatives Queue2Array(Alternative *, 1, Solver_alternative(arg1, id));
3413 %newobject all_alternatives;
3414 Queue all_alternatives() {
3418 cnt = solver_alternatives_count($self);
3419 for (i = 1; i <= cnt; i++)
3424 bool write_testcase(const char *dir) {
3425 return testcase_write($self, dir, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0);
3429 %extend Transaction {
3430 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
3431 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
3432 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
3433 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
3434 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
3435 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
3436 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
3437 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
3438 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
3439 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
3440 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
3441 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
3442 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
3443 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
3444 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
3445 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
3446 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
3447 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
3448 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
3449 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
3450 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
3451 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
3452 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
3453 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
3454 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
3455 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
3456 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
3457 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
3459 transaction_free($self);
3462 %rename("isempty?") isempty;
3465 return $self->steps.count == 0;
3468 %newobject othersolvable;
3469 XSolvable *othersolvable(XSolvable *s) {
3470 Id op = transaction_obs_pkg($self, s->id);
3471 return new_XSolvable($self->pool, op);
3474 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3475 %newobject allothersolvables;
3476 Queue allothersolvables(XSolvable *s) {
3479 transaction_all_obs_pkgs($self, s->id, &q);
3483 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
3484 %newobject classify;
3485 Queue classify(int mode = 0) {
3488 transaction_classify($self, mode, &q);
3492 /* deprecated, use newsolvables instead */
3493 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3494 %newobject newpackages;
3495 Queue newpackages() {
3499 cut = transaction_installedresult(self, &q);
3500 queue_truncate(&q, cut);
3504 /* deprecated, use keptsolvables instead */
3505 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3506 %newobject keptpackages;
3507 Queue keptpackages() {
3511 cut = transaction_installedresult(self, &q);
3513 queue_deleten(&q, 0, cut);
3517 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3518 %newobject newsolvables;
3519 Queue newsolvables() {
3523 cut = transaction_installedresult(self, &q);
3524 queue_truncate(&q, cut);
3528 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3529 %newobject keptsolvables;
3530 Queue keptsolvables() {
3534 cut = transaction_installedresult(self, &q);
3536 queue_deleten(&q, 0, cut);
3540 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3544 queue_init_clone(&q, &$self->steps);
3548 int steptype(XSolvable *s, int mode) {
3549 return transaction_type($self, s->id, mode);
3551 int calc_installsizechange() {
3552 return transaction_calc_installsizechange($self);
3554 void order(int flags=0) {
3555 transaction_order($self, flags);
3559 %extend TransactionClass {
3560 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
3561 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
3562 cl->transaction = trans;
3566 cl->fromid = fromid;
3570 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
3571 %newobject solvables;
3575 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
3578 const char * const fromstr;
3579 const char * const tostr;
3581 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
3582 return pool_id2str(cl->transaction->pool, cl->fromid);
3584 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
3585 return pool_id2str(cl->transaction->pool, cl->toid);
3591 XRule(Solver *solv, Id id) {
3594 XRule *xr = solv_calloc(1, sizeof(*xr));
3601 SWIGINTERN int XRule_type_get(XRule *xr) {
3602 return solver_ruleclass(xr->solv, xr->id);
3607 Id type, source, target, dep;
3608 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
3609 return new_Ruleinfo($self, type, source, target, dep);
3611 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
3612 %newobject allinfos;
3616 solver_allruleinfos($self->solv, $self->id, &q);
3620 #if defined(SWIGTCL)
3621 %rename("==") __eq__;
3623 bool __eq__(XRule *xr) {
3624 return $self->solv == xr->solv && $self->id == xr->id;
3626 #if defined(SWIGTCL)
3627 %rename("!=") __ne__;
3629 bool __ne__(XRule *xr) {
3630 return !XRule___eq__($self, xr);
3632 #if defined(SWIGPERL) || defined(SWIGTCL)
3633 %rename("repr") __repr__;
3635 %newobject __repr__;
3636 const char *__repr__() {
3638 sprintf(buf, "<Rule #%d>", $self->id);
3639 return solv_strdup(buf);
3644 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3645 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3649 ri->source = source;
3650 ri->target = target;
3651 ri->dep_id = dep_id;
3654 %newobject solvable;
3655 XSolvable * const solvable;
3656 %newobject othersolvable;
3657 XSolvable * const othersolvable;
3661 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3662 return new_XSolvable(ri->solv->pool, ri->source);
3664 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3665 return new_XSolvable(ri->solv->pool, ri->target);
3667 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3668 return new_Dep(ri->solv->pool, ri->dep_id);
3671 const char *problemstr() {
3672 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3677 XRepodata(Repo *repo, Id id) {
3678 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3684 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3686 void set_id(Id solvid, Id keyname, DepId id) {
3687 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3689 void set_str(Id solvid, Id keyname, const char *str) {
3690 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3692 void set_poolstr(Id solvid, Id keyname, const char *str) {
3693 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3695 void add_idarray(Id solvid, Id keyname, DepId id) {
3696 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3698 void add_flexarray(Id solvid, Id keyname, Id handle) {
3699 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3701 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3702 const unsigned char *buf = solv_chksum_get(chksum, 0);
3704 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3706 const char *lookup_str(Id solvid, Id keyname) {
3707 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3709 Queue lookup_idarray(Id solvid, Id keyname) {
3712 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3715 %newobject lookup_checksum;
3716 Chksum *lookup_checksum(Id solvid, Id keyname) {
3718 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3719 return solv_chksum_create_from_bin(type, b);
3721 void internalize() {
3722 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3724 void create_stubs() {
3725 Repodata *data = repo_id2repodata($self->repo, $self->id);
3726 data = repodata_create_stubs(data);
3727 $self->id = data->repodataid;
3729 bool write(FILE *fp) {
3730 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3732 bool add_solv(FILE *fp, int flags = 0) {
3733 Repodata *data = repo_id2repodata($self->repo, $self->id);
3734 int r, oldstate = data->state;
3735 data->state = REPODATA_LOADING;
3736 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3737 if (r || data->state == REPODATA_LOADING)
3738 data->state = oldstate;
3741 void extend_to_repo() {
3742 Repodata *data = repo_id2repodata($self->repo, $self->id);
3743 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3745 #if defined(SWIGTCL)
3746 %rename("==") __eq__;
3748 bool __eq__(XRepodata *xr) {
3749 return $self->repo == xr->repo && $self->id == xr->id;
3751 #if defined(SWIGTCL)
3752 %rename("!=") __ne__;
3754 bool __ne__(XRepodata *xr) {
3755 return !XRepodata___eq__($self, xr);
3757 #if defined(SWIGPERL) || defined(SWIGTCL)
3758 %rename("repr") __repr__;
3760 %newobject __repr__;
3761 const char *__repr__() {
3763 sprintf(buf, "<Repodata #%d>", $self->id);
3764 return solv_strdup(buf);
3768 #ifdef ENABLE_PUBKEY
3771 return solvsig_create(fp);
3774 solvsig_free($self);
3778 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3780 #ifdef ENABLE_PGPVRFY
3782 XSolvable *verify(Repo *repo, Chksum *chksum) {
3783 Id p = solvsig_verify($self, repo, chksum);
3784 return new_XSolvable(repo->pool, p);
3790 %extend Alternative {
3791 static const int SOLVER_ALTERNATIVE_TYPE_RULE = SOLVER_ALTERNATIVE_TYPE_RULE;
3792 static const int SOLVER_ALTERNATIVE_TYPE_RECOMMENDS = SOLVER_ALTERNATIVE_TYPE_RECOMMENDS;
3793 static const int SOLVER_ALTERNATIVE_TYPE_SUGGESTS = SOLVER_ALTERNATIVE_TYPE_SUGGESTS;
3796 queue_free(&$self->choices);
3800 XSolvable * const chosen;
3803 %newobject depsolvable;
3804 XSolvable * const depsolvable;
3808 SWIGINTERN XSolvable *Alternative_chosen_get(Alternative *a) {
3809 return new_XSolvable(a->solv->pool, a->chosen_id);
3811 SWIGINTERN XRule *Alternative_rule_get(Alternative *a) {
3812 return new_XRule(a->solv, a->rid);
3814 SWIGINTERN XSolvable *Alternative_depsolvable_get(Alternative *a) {
3815 return new_XSolvable(a->solv->pool, a->from_id);
3817 SWIGINTERN Dep *Alternative_dep_get(Alternative *a) {
3818 return new_Dep(a->solv->pool, a->dep_id);
3822 Queue choices_raw() {
3824 queue_init_clone(&r, &$self->choices);
3828 %typemap(out) Queue choices Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
3832 queue_init_clone(&r, &$self->choices);
3833 for (i = 0; i < r.count; i++)
3834 if (r.elements[i] < 0)
3835 r.elements[i] = -r.elements[i];
3839 #if defined(SWIGPERL) || defined(SWIGTCL)
3840 %rename("str") __str__;
3842 const char *__str__() {
3843 return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
3847 #if defined(SWIGTCL)
3850 "proc solv::iter {varname iter body} {\n"\
3852 " set value [$iter __next__]\n"\
3853 " if {$value eq \"NULL\"} { break }\n"\
3854 " uplevel [list set $varname $value]\n"\
3855 " set code [catch {uplevel $body} result]\n"\
3856 " switch -exact -- $code {\n"\
3860 " default { return -code $code $result }\n"\