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 %#if PY_VERSION_HEX >= 0x03000000
48 res = PyBytes_AsStringAndSize($input, (char **)&pybuf, &pysize);
50 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
53 %argument_fail(res, "BinaryBlob", $symname, $argnum);
59 %argument_fail(res, "const char *", $symname, $argnum);
62 $1 = (unsigned char *)buf;
66 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
67 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
70 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
71 #if defined(SWIGPYTHON) && defined(PYTHON3)
72 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
73 #elif defined(SWIGTCL)
74 Tcl_SetObjResult(interp, $1.data ? Tcl_NewByteArrayObj($1.data, $1.len) : NULL);
76 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
87 %typemap(arginit) Queue {
90 %typemap(freearg) Queue {
94 #if defined(SWIGPYTHON)
98 PyObject *o = PyList_New($1.count);
99 for (i = 0; i < $1.count; i++)
100 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
105 %define Queue2Array(type, step, con) %{ {
107 int cnt = $1.count / step;
108 Id *idp = $1.elements;
109 PyObject *o = PyList_New(cnt);
110 for (i = 0; i < cnt; i++, idp += step)
113 #define result resultx
116 PyList_SetItem(o, i, $result);
125 %define Array2Queue(asval_meth,typestr) %{ {
127 if (!PyList_Check($input))
128 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
129 size = PyList_Size($input);
130 for (i = 0; i < size; i++) {
131 PyObject *o = PyList_GetItem($input,i);
133 int e = asval_meth(o, &v);
135 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only" typestr);
142 %define ObjArray2Queue(type, obj2queue) %{ {
144 if (!PyList_Check($input))
145 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
146 size = PyList_Size($input);
147 for (i = 0; i < size; i++) {
148 PyObject *o = PyList_GetItem($input,i);
150 int e = SWIG_ConvertPtr(o, (void **)&obj, $descriptor(type), 0 | 0);
152 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
159 #endif /* SWIGPYTHON */
161 #if defined(SWIGPERL)
163 * av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
164 * $result = newRV_noinc((SV*)o); argvi++;
166 %typemap(out) Queue {
168 if (argvi + $1.count + 1 >= items) {
169 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
171 for (i = 0; i < $1.count; i++)
172 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
177 %define Queue2Array(type, step, con) %{ {
179 int cnt = $1.count / step;
180 Id *idp = $1.elements;
181 if (argvi + cnt + 1 >= items) {
182 EXTEND(sp, (argvi + cnt + 1) - items + 1);
184 for (i = 0; i < cnt; i++, idp += step)
187 #define result resultx
190 SvREFCNT_inc(ST(argvi - 1));
199 %define Array2Queue(asval_meth,typestr) %{ {
202 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
203 SWIG_croak("argument $argnum is not an array reference.");
204 av = (AV*)SvRV($input);
206 for (i = 0; i <= size; i++) {
207 SV **sv = av_fetch(av, i, 0);
209 int e = asval_meth(*sv, &v);
211 SWIG_croak("array in argument $argnum must contain only " typestr);
218 %define ObjArray2Queue(type, obj2queue) %{ {
221 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
222 SWIG_croak("argument $argnum is not an array reference.");
223 av = (AV*)SvRV($input);
225 for (i = 0; i <= size; i++) {
226 SV **sv = av_fetch(av, i, 0);
228 int e = SWIG_ConvertPtr(*sv, (void **)&obj, $descriptor(type), 0 | 0);
230 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
237 #endif /* SWIGPERL */
240 #if defined(SWIGRUBY)
241 %typemap(out) Queue {
243 VALUE o = rb_ary_new2($1.count);
244 for (i = 0; i < $1.count; i++)
245 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
250 %define Queue2Array(type, step, con) %{ {
252 int cnt = $1.count / step;
253 Id *idp = $1.elements;
254 VALUE o = rb_ary_new2(cnt);
255 for (i = 0; i < cnt; i++, idp += step)
258 #define result resultx
261 rb_ary_store(o, i, $result);
270 %define Array2Queue(asval_meth,typestr) %{ {
273 ary = rb_Array($input);
274 size = RARRAY_LEN(ary);
277 for (i = 0; i < size; i++, o++) {
279 int e = asval_meth(*o, &v);
281 SWIG_exception_fail(SWIG_TypeError, "list in argument $argnum must contain only " typestr);
288 %define ObjArray2Queue(type, obj2queue) %{ {
291 ary = rb_Array($input);
292 size = RARRAY_LEN(ary);
295 for (i = 0; i < size; i++, o++) {
297 int e = SWIG_ConvertPtr(*o, (void **)&obj, $descriptor(type), 0 | 0);
299 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
306 #endif /* SWIGRUBY */
309 %typemap(out) Queue {
310 Tcl_Obj *objvx[$1.count];
313 for (i = 0; i < $1.count; i++) {
314 objvx[i] = SWIG_From_int($1.elements[i]);
316 Tcl_SetObjResult(interp, Tcl_NewListObj($1.count, objvx));
320 %define Queue2Array(type, step, con) %{
321 { /* scope is needed to make the goto of SWIG_exception_fail work */
323 int cnt = $1.count / step;
324 Id *idp = $1.elements;
327 for (i = 0; i < cnt; i++, idp += step) {
329 #define result resultx
330 #define Tcl_SetObjResult(i, x) resultobj = x
334 objvx[i] = resultobj;
335 #undef Tcl_SetObjResult
339 Tcl_SetObjResult(interp, Tcl_NewListObj(cnt, objvx));
344 %define Array2Queue(asval_meth,typestr) %{ {
347 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
348 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
349 for (i = 0; i < size; i++) {
353 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
354 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
355 e = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(o, &v);
357 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only " typestr);
364 %define ObjArray2Queue(type, obj2queue) %{ {
367 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
368 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
369 for (i = 0; i < size; i++) {
373 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
374 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
375 e = SWIG_ConvertPtr(o, (void **)&obj, $descriptor(type), 0 | 0);
377 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
386 %typemap(in) Queue Array2Queue(SWIG_AsVal_int, "integers")
387 %typemap(in) Queue solvejobs ObjArray2Queue(Job *, queue_push2(&$1, obj->how, obj->what))
388 %typemap(in) Queue solvables ObjArray2Queue(XSolvable *, queue_push(&$1, obj->id))
392 #if defined(SWIGPERL)
394 /* work around a swig bug for swig versions < 2.0.5 */
395 #if SWIG_VERSION < 0x020005
399 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
401 # ifndef MULTIPLICITY
402 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
404 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
411 %define perliter(class)
414 my $i = ${##class##::ITERATORS}{$_[0]};
416 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
418 $_[0]->__getitem__($_[1]);
421 sub class##::FETCHSIZE {
422 my $i = ${##class##::ITERATORS}{$_[0]};
424 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
434 #define SWIG_PERL_ITERATOR 0x80
436 SWIGRUNTIMEINLINE SV *
437 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
438 SV *result = sv_newmortal();
439 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
444 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
445 stash=SvSTASH(SvRV(obj));
446 if (flags & SWIG_POINTER_OWN) {
448 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
450 gv_init(gv, stash, "OWNER", 5, FALSE);
452 hv_store_ent(hv, obj, newSViv(1), 0);
454 if (flags & SWIG_PERL_ITERATOR) {
456 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
459 gv_init(gv, stash, "ITERATORS", 9, FALSE);
461 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
463 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
465 self=newRV_noinc((SV *)array);
466 sv_setsv(result, self);
467 SvREFCNT_dec((SV *)self);
468 sv_bless(result, stash);
470 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
477 %typemap(out) Perlarray {
478 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
480 %typemap(out) Perliterator {
481 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
484 %typemap(out) Pool_solvable_iterator * = Perlarray;
485 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
486 %typemap(out) Pool_repo_iterator * = Perlarray;
487 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
488 %typemap(out) Repo_solvable_iterator * = Perlarray;
489 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
490 %typemap(out) Dataiterator * = Perliterator;
492 #endif /* SWIGPERL */
499 #if defined(SWIGPYTHON)
500 typedef PyObject *AppObjectPtr;
501 %typemap(in) AppObjectPtr {
506 %typemap(out) AppObjectPtr {
507 $result = $1 ? $1 : Py_None;
510 #elif defined(SWIGPERL)
511 typedef SV *AppObjectPtr;
512 %typemap(in) AppObjectPtr {
515 sv_setsv((SV *)$1, $input);
519 %typemap(out) AppObjectPtr {
520 $result = sv_2mortal($1 ? SvREFCNT_inc($1) : newSV(0));
523 #elif defined(SWIGRUBY)
524 typedef VALUE AppObjectPtr;
525 %typemap(in) AppObjectPtr {
528 %typemap(out) AppObjectPtr {
531 #elif defined(SWIGTCL)
532 typedef Tcl_Obj *AppObjectPtr;
533 %typemap(in) AppObjectPtr {
535 Tcl_IncrRefCount($input);
538 %typemap(out) AppObjectPtr {
539 Tcl_SetObjResult(interp, $1 ? $1 : Tcl_NewObj());
542 #warning AppObjectPtr not defined for this language!
552 %fragment("SWIG_AsValFilePtr","header") {}
556 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
560 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
561 #elif defined(SWIGTCL)
562 SWIG_AsValSolvFpPtr SWIG_TCL_DECL_ARGS_2(void *obj, FILE **val) {
564 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
566 static swig_type_info* desc = 0;
570 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
571 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
573 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
577 ecode = SWIG_AsValFilePtr(obj, val);
578 if (ecode == SWIG_OK)
581 return SWIG_TypeError;
585 #define SWIG_AsValSolvFpPtr(x, y) SWIG_AsValSolvFpPtr SWIG_TCL_CALL_ARGS_2(x, y)
595 %fragment("SWIG_AsValDepId","header") {
599 SWIG_AsValDepId(VALUE obj, int *val) {
600 #elif defined(SWIGTCL)
601 SWIG_AsValDepId SWIG_TCL_DECL_ARGS_2(void *obj, int *val) {
603 SWIG_AsValDepId(void *obj, int *val) {
605 static swig_type_info* desc = 0;
608 if (!desc) desc = SWIG_TypeQuery("Dep *");
610 ecode = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(obj, val);
612 ecode = SWIG_AsVal_int(obj, val);
614 if (SWIG_IsOK(ecode))
616 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
618 *val = vptr ? ((Dep *)vptr)->id : 0;
621 return SWIG_TypeError;
625 #define SWIG_AsValDepId(x, y) SWIG_AsValDepId SWIG_TCL_CALL_ARGS_2(x, y)
630 ** Pool disown helper
633 %typemap(out) disown_helper {
634 #if defined(SWIGRUBY)
635 SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
636 #elif defined(SWIGPYTHON)
637 SWIG_ConvertPtr($self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
638 #elif defined(SWIGPERL)
639 SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
640 #elif defined(SWIGTCL)
641 SWIG_ConvertPtr(objv[1], &argp1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
643 #warning disown_helper not implemented for this language, this is likely going to leak memory
647 Tcl_SetObjResult(interp, SWIG_From_int((int)(0)));
649 $result = SWIG_From_int((int)(0));
658 %define returnself(func)
659 #if defined(SWIGPYTHON)
660 %typemap(out) void func {
664 #elif defined(SWIGPERL)
665 %typemap(out) void func {
666 $result = sv_2mortal(SvREFCNT_inc(ST(0)));argvi++;
668 #elif defined(SWIGRUBY)
669 %typemap(ret) void func {
672 #elif defined(SWIGTCL)
673 %typemap(out) void func {
674 Tcl_IncrRefCount(objv[1]);
675 Tcl_SetObjResult(interp, objv[1]);
685 %include "typemaps.i"
687 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
690 %typemap(argout,noblock=1) XRule **OUTPUT {
691 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
694 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
695 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
699 ** the C declarations
705 #include <sys/stat.h>
706 #include <sys/utsname.h>
707 #include <sys/types.h>
711 /* argh, swig undefs bool for perl */
717 #include "poolarch.h"
721 #include "solverdebug.h"
722 #include "repo_solv.h"
724 #include "selection.h"
726 #include "repo_write.h"
727 #if defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG)
728 #include "repo_rpmdb.h"
731 #include "repo_pubkey.h"
734 #include "repo_deb.h"
737 #include "repo_rpmmd.h"
738 #include "repo_updateinfoxml.h"
739 #include "repo_deltainfoxml.h"
740 #include "repo_repomdxml.h"
742 #ifdef ENABLE_SUSEREPO
743 #include "repo_products.h"
744 #include "repo_susetags.h"
745 #include "repo_content.h"
747 #ifdef ENABLE_MDKREPO
748 #include "repo_mdk.h"
750 #ifdef ENABLE_ARCHREPO
751 #include "repo_arch.h"
754 #include "repo_autopattern.h"
756 #if defined(ENABLE_COMPLEX_DEPS) && (defined(ENABLE_SUSEREPO) || defined(ENABLE_RPMMD) || defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG))
757 #include "pool_parserpmrichdep.h"
759 #include "solv_xfopen.h"
760 #include "testcase.h"
762 /* for old ruby versions */
764 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
767 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
770 #define SOLVER_SOLUTION_ERASE -100
771 #define SOLVER_SOLUTION_REPLACE -101
772 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
773 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
774 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
775 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
777 typedef void *AppObjectPtr;
803 } Pool_solvable_iterator;
808 } Pool_repo_iterator;
813 } Repo_solvable_iterator;
864 Transaction *transaction;
882 typedef Dataiterator Datamatch;
884 typedef int disown_helper;
901 SWIGINTERN void appdata_disown_helper(void *appdata) {
903 SWIGINTERN void appdata_clr_helper(void **appdatap) {
906 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
909 SWIGINTERN void *appdata_get_helper(void *appdata) {
914 #elif defined(SWIGTCL)
917 SWIGINTERN void appdata_disown_helper(void *appdata) {
919 SWIGINTERN void appdata_clr_helper(void **appdatap) {
921 Tcl_DecrRefCount((Tcl_Obj *)(*appdatap));
924 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
925 appdata_clr_helper(appdatap);
928 SWIGINTERN void *appdata_get_helper(void *appdata) {
933 #elif defined(SWIGPYTHON)
936 SWIGINTERN void appdata_disown_helper(void *appdata) {
937 struct myappdata *myappdata = appdata;
938 if (!myappdata || !myappdata->appdata || myappdata->disowned)
940 myappdata->disowned = 1;
941 Py_DECREF((PyObject *)myappdata->appdata);
943 SWIGINTERN void appdata_clr_helper(void **appdatap) {
944 struct myappdata *myappdata = *(struct myappdata **)appdatap;
945 if (myappdata && myappdata->appdata && !myappdata->disowned) {
946 Py_DECREF((PyObject *)myappdata->appdata);
948 *appdatap = solv_free(myappdata);
950 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
951 appdata_clr_helper(appdatap);
953 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
954 myappdata->appdata = appdata;
957 SWIGINTERN void *appdata_get_helper(void *appdata) {
958 return appdata ? ((struct myappdata *)appdata)->appdata : 0;
963 #elif defined(SWIGPERL)
966 SWIGINTERN void appdata_disown_helper(void *appdata) {
967 struct myappdata *myappdata = appdata;
969 if (!myappdata || !myappdata->appdata || myappdata->disowned)
971 rsv = myappdata->appdata;
974 myappdata->appdata = SvRV(rsv);
975 myappdata->disowned = 1;
978 SWIGINTERN void appdata_clr_helper(void **appdatap) {
979 struct myappdata *myappdata = *(struct myappdata **)appdatap;
980 if (myappdata && myappdata->appdata && !myappdata->disowned) {
981 SvREFCNT_dec((SV *)myappdata->appdata);
983 *appdatap = solv_free(myappdata);
985 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
986 appdata_clr_helper(appdatap);
988 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
989 myappdata->appdata = appdata;
992 SWIGINTERN void *appdata_get_helper(void *appdata) {
993 struct myappdata *myappdata = appdata;
994 if (!myappdata || !myappdata->appdata)
996 return myappdata->disowned ? newRV_noinc((SV *)myappdata->appdata) : myappdata->appdata;
1002 #warning appdata helpers not implemented for this language
1007 ** the SWIG declarations defining the API
1011 %mixin Dataiterator "Enumerable";
1012 %mixin Pool_solvable_iterator "Enumerable";
1013 %mixin Pool_repo_iterator "Enumerable";
1014 %mixin Repo_solvable_iterator "Enumerable";
1019 %include "knownid.h"
1021 /* from repodata.h */
1022 %constant Id SOLVID_META;
1023 %constant Id SOLVID_POS;
1025 %constant int REL_EQ;
1026 %constant int REL_GT;
1027 %constant int REL_LT;
1028 %constant int REL_AND;
1029 %constant int REL_OR;
1030 %constant int REL_WITH;
1031 %constant int REL_NAMESPACE;
1032 %constant int REL_ARCH;
1033 %constant int REL_FILECONFLICT;
1034 %constant int REL_COND;
1035 %constant int REL_COMPAT;
1036 %constant int REL_KIND;
1037 %constant int REL_MULTIARCH;
1038 %constant int REL_ELSE;
1039 %constant int REL_ERROR;
1040 %constant int REL_WITHOUT;
1041 %constant int REL_UNLESS;
1042 %constant int REL_CONDA;
1054 /* put before pool/repo so we can access the constructor */
1055 %nodefaultdtor Dataiterator;
1056 typedef struct {} Dataiterator;
1079 typedef struct {} Pool_solvable_iterator;
1080 typedef struct {} Pool_repo_iterator;
1081 typedef struct {} Repo_solvable_iterator;
1083 %nodefaultctor Datamatch;
1084 %nodefaultdtor Datamatch;
1091 %nodefaultctor Datapos;
1102 %nodefaultctor Pool;
1103 %nodefaultdtor Pool;
1107 %nodefaultctor Repo;
1108 %nodefaultdtor Repo;
1111 const char * const name;
1114 int const nsolvables;
1117 %nodefaultctor Solver;
1118 %nodefaultdtor Solver;
1126 #ifdef ENABLE_PUBKEY
1129 unsigned int const created;
1130 unsigned int const expires;
1131 const char * const keyid;
1135 %rename(xfopen) solvfp_xfopen;
1136 %rename(xfopen_fd) solvfp_xfopen_fd;
1138 %nodefaultctor SolvFp;
1142 %newobject solvfp_xfopen;
1143 %newobject solvfp_xfopen_fd;
1145 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
1146 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
1149 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
1155 solv_setcloexec(fd, 1);
1156 fp = solv_xfopen_fd(fn, fd, mode);
1161 sfp = solv_calloc(1, sizeof(SolvFp));
1165 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
1168 fp = solv_xfopen(fn, mode);
1171 if (fileno(fp) != -1)
1172 solv_setcloexec(fileno(fp), 1);
1173 sfp = solv_calloc(1, sizeof(SolvFp));
1180 Solver * const solv;
1185 Solver * const solv;
1193 Id const solutionid;
1198 %nodefaultctor Alternative;
1209 %nodefaultctor Transaction;
1210 %nodefaultdtor Transaction;
1216 Transaction * const transaction;
1230 return $self->fp ? fileno($self->fp) : -1;
1233 return $self->fp ? dup(fileno($self->fp)) : -1;
1235 bool write(const unsigned char *str, size_t len) {
1236 return fwrite(str, len, 1, $self->fp) == 1;
1241 return fflush($self->fp) == 0;
1247 ret = fclose($self->fp) == 0;
1251 void cloexec(bool state) {
1252 if (!$self->fp || fileno($self->fp) == -1)
1254 solv_setcloexec(fileno($self->fp), state);
1259 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
1260 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
1261 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
1262 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
1263 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
1264 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
1265 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
1266 static const Id SOLVER_NOOP = SOLVER_NOOP;
1267 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
1268 static const Id SOLVER_ERASE = SOLVER_ERASE;
1269 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
1270 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
1271 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
1272 static const Id SOLVER_LOCK = SOLVER_LOCK;
1273 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
1274 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
1275 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
1276 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
1277 static const Id SOLVER_ALLOWUNINSTALL = SOLVER_ALLOWUNINSTALL;
1278 static const Id SOLVER_FAVOR = SOLVER_FAVOR;
1279 static const Id SOLVER_DISFAVOR = SOLVER_DISFAVOR;
1280 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
1281 static const Id SOLVER_WEAK = SOLVER_WEAK;
1282 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
1283 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
1284 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
1285 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
1286 static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
1287 static const Id SOLVER_SETEV = SOLVER_SETEV;
1288 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
1289 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
1290 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
1291 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
1292 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
1293 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
1294 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
1296 Job(Pool *pool, int how, Id what) {
1297 Job *job = solv_calloc(1, sizeof(*job));
1304 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1305 %newobject solvables;
1309 pool_job2solvables($self->pool, &q, $self->how, $self->what);
1313 %rename("isemptyupdate?") isemptyupdate;
1315 bool isemptyupdate() {
1316 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
1319 #if defined(SWIGTCL)
1320 %rename("==") __eq__;
1322 bool __eq__(Job *j) {
1323 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
1325 #if defined(SWIGTCL)
1326 %rename("!=") __ne__;
1328 bool __ne__(Job *j) {
1329 return !Job___eq__($self, j);
1331 #if defined(SWIGPERL) || defined(SWIGTCL)
1332 %rename("str") __str__;
1334 const char *__str__() {
1335 return pool_job2str($self->pool, $self->how, $self->what, 0);
1337 #if defined(SWIGPERL) || defined(SWIGTCL)
1338 %rename("repr") __repr__;
1340 const char *__repr__() {
1341 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
1342 return pool_tmpjoin($self->pool, "<Job ", str, ">");
1347 static const Id SELECTION_NAME = SELECTION_NAME;
1348 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
1349 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
1350 static const Id SELECTION_CANON = SELECTION_CANON;
1351 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
1352 static const Id SELECTION_REL = SELECTION_REL;
1353 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
1354 static const Id SELECTION_GLOB = SELECTION_GLOB;
1355 static const Id SELECTION_FLAT = SELECTION_FLAT;
1356 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
1357 static const Id SELECTION_SKIP_KIND = SELECTION_SKIP_KIND;
1358 static const Id SELECTION_MATCH_DEPSTR = SELECTION_MATCH_DEPSTR;
1359 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
1360 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
1361 static const Id SELECTION_WITH_DISABLED = SELECTION_WITH_DISABLED;
1362 static const Id SELECTION_WITH_BADARCH = SELECTION_WITH_BADARCH;
1363 static const Id SELECTION_WITH_ALL = SELECTION_WITH_ALL;
1364 static const Id SELECTION_ADD = SELECTION_ADD;
1365 static const Id SELECTION_SUBTRACT = SELECTION_SUBTRACT;
1366 static const Id SELECTION_FILTER = SELECTION_FILTER;
1367 static const Id SELECTION_FILTER_KEEP_IFEMPTY = SELECTION_FILTER_KEEP_IFEMPTY;
1368 static const Id SELECTION_FILTER_SWAPPED = SELECTION_FILTER_SWAPPED;
1370 Selection(Pool *pool) {
1372 s = solv_calloc(1, sizeof(*s));
1378 queue_free(&$self->q);
1382 %rename("isempty?") isempty;
1385 return $self->q.count == 0;
1388 Selection *clone(int flags = 0) {
1389 Selection *s = new_Selection($self->pool);
1390 queue_init_clone(&s->q, &$self->q);
1391 s->flags = $self->flags;
1395 void filter(Selection *lsel) {
1396 if ($self->pool != lsel->pool)
1397 queue_empty(&$self->q);
1399 selection_filter($self->pool, &$self->q, &lsel->q);
1402 void add(Selection *lsel) {
1403 if ($self->pool == lsel->pool)
1405 selection_add($self->pool, &$self->q, &lsel->q);
1406 $self->flags |= lsel->flags;
1410 void add_raw(Id how, Id what) {
1411 queue_push2(&$self->q, how, what);
1413 returnself(subtract)
1414 void subtract(Selection *lsel) {
1415 if ($self->pool == lsel->pool)
1416 selection_subtract($self->pool, &$self->q, &lsel->q);
1420 void select(const char *name, int flags) {
1421 if ((flags & SELECTION_MODEBITS) == 0)
1422 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1423 $self->flags = selection_make($self->pool, &$self->q, name, flags);
1425 returnself(matchdeps)
1426 void matchdeps(const char *name, int flags, Id keyname, Id marker = -1) {
1427 if ((flags & SELECTION_MODEBITS) == 0)
1428 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1429 $self->flags = selection_make_matchdeps($self->pool, &$self->q, name, flags, keyname, marker);
1431 returnself(matchdepid)
1432 void matchdepid(DepId dep, int flags, Id keyname, Id marker = -1) {
1433 if ((flags & SELECTION_MODEBITS) == 0)
1434 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1435 $self->flags = selection_make_matchdepid($self->pool, &$self->q, dep, flags, keyname, marker);
1437 returnself(matchsolvable)
1438 void matchsolvable(XSolvable *solvable, int flags, Id keyname, Id marker = -1) {
1439 if ((flags & SELECTION_MODEBITS) == 0)
1440 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1441 $self->flags = selection_make_matchsolvable($self->pool, &$self->q, solvable->id, flags, keyname, marker);
1444 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
1446 Queue jobs(int flags) {
1449 queue_init_clone(&q, &$self->q);
1450 for (i = 0; i < q.count; i += 2)
1451 q.elements[i] |= flags;
1455 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1456 %newobject solvables;
1460 selection_solvables($self->pool, &$self->q, &q);
1464 #if defined(SWIGPERL) || defined(SWIGTCL)
1465 %rename("str") __str__;
1467 const char *__str__() {
1468 return pool_selection2str($self->pool, &$self->q, 0);
1470 #if defined(SWIGPERL) || defined(SWIGTCL)
1471 %rename("repr") __repr__;
1473 const char *__repr__() {
1474 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
1475 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
1481 return solv_chksum_create(type);
1483 Chksum(Id type, const char *hex) {
1484 unsigned char buf[64];
1485 int l = solv_chksum_len(type);
1488 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
1490 return solv_chksum_create_from_bin(type, buf);
1492 %newobject from_bin;
1493 static Chksum *from_bin(Id type, const unsigned char *str, size_t len) {
1494 return len == solv_chksum_len(type) ? solv_chksum_create_from_bin(type, str) : 0;
1496 #if defined(SWIGPERL)
1498 undef *solv::Chksum::from_bin;
1499 *solv::Chksum::from_bin = sub {
1501 my $self = solvc::Chksum_from_bin(@_);
1502 bless $self, $pkg if defined $self;
1507 solv_chksum_free($self, 0);
1511 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
1512 return solv_chksum_get_type(chk);
1515 void add(const unsigned char *str, size_t len) {
1516 solv_chksum_add($self, str, (int)len);
1518 void add_fp(FILE *fp) {
1521 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
1522 solv_chksum_add($self, buf, l);
1523 rewind(fp); /* convenience */
1525 void add_fd(int fd) {
1528 while ((l = read(fd, buf, sizeof(buf))) > 0)
1529 solv_chksum_add($self, buf, l);
1530 lseek(fd, 0, 0); /* convenience */
1532 void add_stat(const char *filename) {
1534 if (stat(filename, &stb))
1535 memset(&stb, 0, sizeof(stb));
1536 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1537 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1538 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1539 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1541 void add_fstat(int fd) {
1543 if (fstat(fd, &stb))
1544 memset(&stb, 0, sizeof(stb));
1545 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1546 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1547 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1548 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1553 const unsigned char *b;
1554 b = solv_chksum_get($self, &l);
1562 const unsigned char *b;
1565 b = solv_chksum_get($self, &l);
1566 ret = solv_malloc(2 * l + 1);
1567 solv_bin2hex(b, l, ret);
1570 const char *typestr() {
1571 return solv_chksum_type2str(solv_chksum_get_type($self));
1574 #if defined(SWIGTCL)
1575 %rename("==") __eq__;
1577 bool __eq__(Chksum *chk) {
1578 return solv_chksum_cmp($self, chk);
1580 #if defined(SWIGTCL)
1581 %rename("!=") __ne__;
1583 bool __ne__(Chksum *chk) {
1584 return !solv_chksum_cmp($self, chk);
1586 #if defined(SWIGRUBY)
1587 %rename("to_s") __str__;
1589 #if defined(SWIGPERL) || defined(SWIGTCL)
1590 %rename("str") __str__;
1593 const char *__str__() {
1596 if (solv_chksum_isfinished($self))
1597 h = Chksum_hex($self);
1598 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1599 solv_free((void *)h);
1602 #if defined(SWIGPERL) || defined(SWIGTCL)
1603 %rename("repr") __repr__;
1605 %newobject __repr__;
1606 const char *__repr__() {
1607 const char *h = Chksum___str__($self);
1608 const char *str = solv_dupjoin("<Chksum ", h, ">");
1609 solv_free((void *)h);
1615 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1616 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1617 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1618 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1619 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1620 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1621 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1622 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1623 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1624 static const int DISTTYPE_RPM = DISTTYPE_RPM;
1625 static const int DISTTYPE_DEB = DISTTYPE_DEB;
1626 static const int DISTTYPE_ARCH = DISTTYPE_ARCH;
1627 static const int DISTTYPE_HAIKU = DISTTYPE_HAIKU;
1630 Pool *pool = pool_create();
1633 int setdisttype(int disttype) {
1634 return pool_setdisttype($self, disttype);
1636 void set_debuglevel(int level) {
1637 pool_setdebuglevel($self, level);
1639 int set_flag(int flag, int value) {
1640 return pool_set_flag($self, flag, value);
1642 int get_flag(int flag) {
1643 return pool_get_flag($self, flag);
1645 void set_rootdir(const char *rootdir) {
1646 pool_set_rootdir($self, rootdir);
1648 const char *get_rootdir(int flag) {
1649 return pool_get_rootdir($self);
1651 #if defined(SWIGPYTHON)
1653 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1654 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1655 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1656 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1661 return 0; /* exception */
1662 ecode = SWIG_AsVal_int(result, &vresult);
1664 return SWIG_IsOK(ecode) ? vresult : 0;
1667 void clr_loadcallback() {
1668 if ($self->loadcallback == loadcallback) {
1669 PyObject *obj = $self->loadcallbackdata;
1671 pool_setloadcallback($self, 0, 0);
1674 void set_loadcallback(PyObject *callable) {
1675 Pool_clr_loadcallback($self);
1677 Py_INCREF(callable);
1678 pool_setloadcallback($self, loadcallback, callable);
1681 #elif defined(SWIGPERL)
1683 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1687 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1692 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1694 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1704 void clr_loadcallback() {
1705 if ($self->loadcallback == loadcallback) {
1706 SvREFCNT_dec($self->loadcallbackdata);
1707 pool_setloadcallback($self, 0, 0);
1710 void set_loadcallback(SV *callable) {
1711 Pool_clr_loadcallback($self);
1713 SvREFCNT_inc(callable);
1714 pool_setloadcallback($self, loadcallback, callable);
1717 #elif defined(SWIGRUBY)
1719 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1720 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1721 VALUE callable = (VALUE)d;
1722 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1723 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1724 return res == Qtrue;
1726 SWIGINTERN void mark_Pool(void *ptr) {
1728 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1729 VALUE callable = (VALUE)pool->loadcallbackdata;
1730 rb_gc_mark(callable);
1734 void clr_loadcallback() {
1735 pool_setloadcallback($self, 0, 0);
1737 %typemap(in, numinputs=0) VALUE callable {
1738 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1740 void set_loadcallback(VALUE callable) {
1741 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1743 #elif defined(SWIGTCL)
1749 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1750 tcl_callback_t *callback_var = (tcl_callback_t *)d;
1751 Tcl_Interp *interp = callback_var->interp;
1752 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1753 int result, ecode = 0, vresult = 0;
1755 objvx[0] = callback_var->obj;
1756 objvx[1] = SWIG_NewInstanceObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
1757 Tcl_IncrRefCount(objvx[1]);
1758 result = Tcl_EvalObjv(interp, sizeof(objvx)/sizeof(*objvx), objvx, TCL_EVAL_GLOBAL);
1759 Tcl_DecrRefCount(objvx[1]);
1760 if (result != TCL_OK)
1761 return 0; /* exception */
1762 ecode = SWIG_AsVal_int(interp, Tcl_GetObjResult(interp), &vresult);
1763 return SWIG_IsOK(ecode) ? vresult : 0;
1766 void clr_loadcallback() {
1767 if ($self->loadcallback == loadcallback) {
1768 tcl_callback_t *callback_var = $self->loadcallbackdata;
1769 Tcl_DecrRefCount(callback_var->obj);
1770 solv_free(callback_var);
1771 pool_setloadcallback($self, 0, 0);
1774 void set_loadcallback(Tcl_Obj *callable, Tcl_Interp *interp) {
1775 Pool_clr_loadcallback($self);
1777 tcl_callback_t *callback_var = solv_malloc(sizeof(tcl_callback_t));
1778 Tcl_IncrRefCount(callable);
1779 callback_var->interp = interp;
1780 callback_var->obj = callable;
1781 pool_setloadcallback($self, loadcallback, callback_var);
1785 #warning loadcallback not implemented for this language
1792 FOR_REPOS(repoid, repo)
1793 appdata_clr_helper(&repo->appdata);
1794 Pool_clr_loadcallback(pool);
1795 appdata_clr_helper(&pool->appdata);
1798 disown_helper free() {
1802 FOR_REPOS(repoid, repo)
1803 appdata_clr_helper(&repo->appdata);
1804 Pool_clr_loadcallback(pool);
1805 appdata_clr_helper(&pool->appdata);
1809 disown_helper disown() {
1812 AppObjectPtr appdata;
1814 SWIGINTERN void Pool_appdata_set(Pool *pool, AppObjectPtr appdata) {
1815 appdata_set_helper(&pool->appdata, appdata);
1817 SWIGINTERN AppObjectPtr Pool_appdata_get(Pool *pool) {
1818 return appdata_get_helper(pool->appdata);
1821 void appdata_disown() {
1822 appdata_disown_helper($self->appdata);
1825 Id str2id(const char *str, bool create=1) {
1826 return pool_str2id($self, str, create);
1829 Dep *Dep(const char *str, bool create=1) {
1830 Id id = pool_str2id($self, str, create);
1831 return new_Dep($self, id);
1833 #if defined(ENABLE_COMPLEX_DEPS) && (defined(ENABLE_SUSEREPO) || defined(ENABLE_RPMMD) || defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG))
1835 Dep *parserpmrichdep(const char *str) {
1836 Id id = pool_parserpmrichdep($self, str);
1837 return new_Dep($self, id);
1840 const char *id2str(Id id) {
1841 return pool_id2str($self, id);
1843 const char *dep2str(Id id) {
1844 return pool_dep2str($self, id);
1846 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1847 return pool_rel2id($self, name, evr, flags, create);
1849 Id id2langid(Id id, const char *lang, bool create=1) {
1850 return pool_id2langid($self, id, lang, create);
1852 void setarch(const char *arch = 0) {
1861 pool_setarch($self, arch);
1863 Repo *add_repo(const char *name) {
1864 return repo_create($self, name);
1866 const char *lookup_str(Id entry, Id keyname) {
1867 return pool_lookup_str($self, entry, keyname);
1869 Id lookup_id(Id entry, Id keyname) {
1870 return pool_lookup_id($self, entry, keyname);
1872 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1873 return pool_lookup_num($self, entry, keyname, notfound);
1875 bool lookup_void(Id entry, Id keyname) {
1876 return pool_lookup_void($self, entry, keyname);
1878 %newobject lookup_checksum;
1879 Chksum *lookup_checksum(Id entry, Id keyname) {
1881 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1882 return solv_chksum_create_from_bin(type, b);
1885 %newobject Dataiterator;
1886 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1887 return new_Dataiterator($self, 0, 0, key, match, flags);
1889 %newobject Dataiterator_solvid;
1890 Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
1891 return new_Dataiterator($self, 0, p, key, match, flags);
1893 const char *solvid2str(Id solvid) {
1894 return pool_solvid2str($self, solvid);
1896 void addfileprovides() {
1897 pool_addfileprovides($self);
1899 Queue addfileprovides_queue() {
1902 pool_addfileprovides_queue($self, &r, 0);
1905 void createwhatprovides() {
1906 pool_createwhatprovides($self);
1909 %newobject id2solvable;
1910 XSolvable *id2solvable(Id id) {
1911 return new_XSolvable($self, id);
1913 %newobject solvables;
1914 Pool_solvable_iterator * const solvables;
1916 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1917 return new_Pool_solvable_iterator(pool);
1920 %newobject solvables_iter;
1921 Pool_solvable_iterator * solvables_iter() {
1922 return new_Pool_solvable_iterator($self);
1925 Repo *id2repo(Id id) {
1926 if (id < 1 || id >= $self->nrepos)
1928 return pool_id2repo($self, id);
1932 Pool_repo_iterator * const repos;
1934 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1935 return new_Pool_repo_iterator(pool);
1938 %newobject repos_iter;
1939 Pool_repo_iterator * repos_iter() {
1940 return new_Pool_repo_iterator($self);
1944 const char * const errstr;
1946 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1947 pool_set_installed(pool, installed);
1949 SWIGINTERN Repo *Pool_installed_get(Pool *pool) {
1950 return pool->installed;
1952 SWIGINTERN const char *Pool_errstr_get(Pool *pool) {
1953 return pool_errstr(pool);
1957 Queue matchprovidingids(const char *match, int flags) {
1963 for (id = 1; id < pool->ss.nstrings; id++)
1964 if (pool->whatprovides[id])
1968 if (!datamatcher_init(&ma, match, flags)) {
1969 for (id = 1; id < pool->ss.nstrings; id++)
1970 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1972 datamatcher_free(&ma);
1979 Job *Job(int how, Id what) {
1980 return new_Job($self, how, what);
1983 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1984 %newobject whatprovides;
1985 Queue whatprovides(DepId dep) {
1990 FOR_PROVIDES(p, pp, dep)
1994 %typemap(out) Queue best_solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1995 %newobject best_solvables;
1996 Queue best_solvables(Queue solvables, int flags=0) {
1998 queue_init_clone(&q, &solvables);
1999 pool_best_solvables($self, &q, flags);
2003 Id towhatprovides(Queue q) {
2004 return pool_queuetowhatprovides($self, &q);
2007 void set_namespaceproviders(DepId ns, DepId evr, bool value=1) {
2008 Id dep = pool_rel2id($self, ns, evr, REL_NAMESPACE, 1);
2009 pool_set_whatprovides($self, dep, value ? 2 : 1);
2012 void flush_namespaceproviders(DepId ns, DepId evr) {
2013 pool_flush_namespaceproviders($self, ns, evr);
2016 %typemap(out) Queue whatcontainsdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
2017 %newobject whatcontainsdep;
2018 Queue whatcontainsdep(Id keyname, DepId dep, Id marker = -1) {
2021 pool_whatcontainsdep($self, keyname, dep, &q, marker);
2025 %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
2026 %newobject whatmatchesdep;
2027 Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
2030 pool_whatmatchesdep($self, keyname, dep, &q, marker);
2034 %typemap(out) Queue whatmatchessolvable Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
2035 %newobject whatmatchessolvable;
2036 Queue whatmatchessolvable(Id keyname, XSolvable *pool_solvable, Id marker = -1) {
2039 pool_whatmatchessolvable($self, keyname, pool_solvable->id, &q, marker);
2044 %rename("isknownarch?") isknownarch;
2046 bool isknownarch(DepId id) {
2048 if (!id || id == ID_EMPTY)
2050 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
2052 if (pool->id2arch && pool_arch2score(pool, id) == 0)
2059 return solver_create($self);
2062 %newobject Selection;
2063 Selection *Selection() {
2064 return new_Selection($self);
2066 %newobject Selection_all;
2067 Selection *Selection_all(int setflags=0) {
2068 Selection *sel = new_Selection($self);
2069 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
2073 Selection *select(const char *name, int flags) {
2074 Selection *sel = new_Selection($self);
2075 sel->flags = selection_make($self, &sel->q, name, flags);
2079 %newobject matchdeps;
2080 Selection *matchdeps(const char *name, int flags, Id keyname, Id marker = -1) {
2081 Selection *sel = new_Selection($self);
2082 sel->flags = selection_make_matchdeps($self, &sel->q, name, flags, keyname, marker);
2086 %newobject matchdepid;
2087 Selection *matchdepid(DepId dep, int flags, Id keyname, Id marker = -1) {
2088 Selection *sel = new_Selection($self);
2089 sel->flags = selection_make_matchdepid($self, &sel->q, dep, flags, keyname, marker);
2093 %newobject matchsolvable;
2094 Selection *matchsolvable(XSolvable *solvable, int flags, Id keyname, Id marker = -1) {
2095 Selection *sel = new_Selection($self);
2096 sel->flags = selection_make_matchsolvable($self, &sel->q, solvable->id, flags, keyname, marker);
2100 Queue get_considered_list() {
2104 for (i = 2; i < $self->nsolvables; i++) {
2105 if ($self->solvables[i].repo && (!$self->considered || MAPTST($self->considered, i)))
2111 Queue get_disabled_list() {
2115 for (i = 2; i < $self->nsolvables; i++) {
2116 if ($self->solvables[i].repo && ($self->considered && !MAPTST($self->considered, i)))
2122 void set_considered_list(Queue q) {
2125 if (!$self->considered) {
2126 $self->considered = solv_calloc(1, sizeof(Map));
2127 map_init($self->considered, $self->nsolvables);
2129 map_empty($self->considered);
2130 MAPSET($self->considered, 1);
2131 for (i = 0; i < q.count; i++) {
2133 if (p > 0 && p < $self->nsolvables)
2134 MAPSET($self->considered, p);
2138 void set_disabled_list(Queue q) {
2142 if ($self->considered) {
2143 map_free($self->considered);
2144 $self->considered = solv_free($self->considered);
2148 if (!$self->considered) {
2149 $self->considered = solv_calloc(1, sizeof(Map));
2150 map_init($self->considered, $self->nsolvables);
2152 map_setall($self->considered);
2153 for (i = 0; i < q.count; i++) {
2155 if (p > 0 && p < $self->nsolvables)
2156 MAPCLR($self->considered, p);
2160 void setpooljobs(Queue solvejobs) {
2161 queue_free(&$self->pooljobs);
2162 queue_init_clone(&$self->pooljobs, &solvejobs);
2164 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
2165 %newobject getpooljobs;
2166 Queue getpooljobs() {
2168 queue_init_clone(&q, &$self->pooljobs);
2175 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
2176 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
2177 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
2178 static const int REPO_USE_LOADING = REPO_USE_LOADING;
2179 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
2180 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
2181 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
2182 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
2183 #ifdef ENABLE_SUSEREPO
2184 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
2187 void free(bool reuseids = 0) {
2188 appdata_clr_helper(&$self->appdata);
2189 repo_free($self, reuseids);
2191 void empty(bool reuseids = 0) {
2192 repo_empty($self, reuseids);
2195 %rename("isempty?") isempty;
2198 return !$self->nsolvables;
2201 AppObjectPtr appdata;
2203 SWIGINTERN void Repo_appdata_set(Repo *repo, AppObjectPtr appdata) {
2204 appdata_set_helper(&repo->appdata, appdata);
2206 SWIGINTERN AppObjectPtr Repo_appdata_get(Repo *repo) {
2207 return appdata_get_helper(repo->appdata);
2211 bool add_solv(const char *name, int flags = 0) {
2212 FILE *fp = fopen(name, "r");
2216 r = repo_add_solv($self, fp, flags);
2220 bool add_solv(FILE *fp, int flags = 0) {
2221 return repo_add_solv($self, fp, flags) == 0;
2224 %newobject add_solvable;
2225 XSolvable *add_solvable() {
2226 Id solvid = repo_add_solvable($self);
2227 return new_XSolvable($self->pool, solvid);
2231 bool add_rpmdb(int flags = 0) {
2232 return repo_add_rpmdb($self, 0, flags) == 0;
2234 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
2235 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
2238 #ifdef ENABLE_RPMPKG
2240 XSolvable *add_rpm(const char *name, int flags = 0) {
2241 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
2244 #ifdef ENABLE_PUBKEY
2246 bool add_rpmdb_pubkeys(int flags = 0) {
2247 return repo_add_rpmdb_pubkeys($self, flags) == 0;
2250 %newobject add_pubkey;
2251 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
2252 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
2254 bool add_keyring(FILE *fp, int flags = 0) {
2255 return repo_add_keyring($self, fp, flags);
2257 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
2258 return repo_add_keydir($self, keydir, suffix, flags);
2262 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
2263 return repo_add_rpmmd($self, fp, language, flags) == 0;
2265 bool add_repomdxml(FILE *fp, int flags = 0) {
2266 return repo_add_repomdxml($self, fp, flags) == 0;
2268 bool add_updateinfoxml(FILE *fp, int flags = 0) {
2269 return repo_add_updateinfoxml($self, fp, flags) == 0;
2271 bool add_deltainfoxml(FILE *fp, int flags = 0) {
2272 return repo_add_deltainfoxml($self, fp, flags) == 0;
2275 #ifdef ENABLE_DEBIAN
2276 bool add_debdb(int flags = 0) {
2277 return repo_add_debdb($self, flags) == 0;
2279 bool add_debpackages(FILE *fp, int flags = 0) {
2280 return repo_add_debpackages($self, fp, flags) == 0;
2283 XSolvable *add_deb(const char *name, int flags = 0) {
2284 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
2287 #ifdef ENABLE_SUSEREPO
2288 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
2289 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
2291 bool add_content(FILE *fp, int flags = 0) {
2292 return repo_add_content($self, fp, flags) == 0;
2294 bool add_products(const char *proddir, int flags = 0) {
2295 return repo_add_products($self, proddir, flags) == 0;
2298 #ifdef ENABLE_MDKREPO
2299 bool add_mdk(FILE *fp, int flags = 0) {
2300 return repo_add_mdk($self, fp, flags) == 0;
2302 bool add_mdk_info(FILE *fp, int flags = 0) {
2303 return repo_add_mdk_info($self, fp, flags) == 0;
2306 #ifdef ENABLE_ARCHREPO
2307 bool add_arch_repo(FILE *fp, int flags = 0) {
2308 return repo_add_arch_repo($self, fp, flags) == 0;
2310 bool add_arch_local(const char *dir, int flags = 0) {
2311 return repo_add_arch_local($self, dir, flags) == 0;
2313 %newobject add_arch_pkg;
2314 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
2315 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
2319 bool add_autopattern(int flags = 0) {
2320 return repo_add_autopattern($self, flags) == 0;
2323 void internalize() {
2324 repo_internalize($self);
2326 bool write(FILE *fp) {
2327 return repo_write($self, fp) == 0;
2329 /* HACK, remove if no longer needed! */
2330 bool write_first_repodata(FILE *fp) {
2331 int oldnrepodata = $self->nrepodata;
2333 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
2334 res = repo_write($self, fp);
2335 $self->nrepodata = oldnrepodata;
2339 %newobject Dataiterator;
2340 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2341 return new_Dataiterator($self->pool, $self, 0, key, match, flags);
2343 %newobject Dataiterator_meta;
2344 Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
2345 return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
2350 SWIGINTERN Id Repo_id_get(Repo *repo) {
2351 return repo->repoid;
2354 %newobject solvables;
2355 Repo_solvable_iterator * const solvables;
2357 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
2358 return new_Repo_solvable_iterator(repo);
2362 Datapos * const meta;
2364 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
2365 Datapos *pos = solv_calloc(1, sizeof(*pos));
2366 pos->solvid = SOLVID_META;
2372 %newobject solvables_iter;
2373 Repo_solvable_iterator *solvables_iter() {
2374 return new_Repo_solvable_iterator($self);
2377 %newobject add_repodata;
2378 XRepodata *add_repodata(int flags = 0) {
2379 Repodata *rd = repo_add_repodata($self, flags);
2380 return new_XRepodata($self, rd->repodataid);
2383 void create_stubs() {
2385 if (!$self->nrepodata)
2387 data = repo_id2repodata($self, $self->nrepodata - 1);
2388 if (data->state != REPODATA_STUB)
2389 (void)repodata_create_stubs(data);
2392 %rename("iscontiguous?") iscontiguous;
2394 bool iscontiguous() {
2396 for (i = $self->start; i < $self->end; i++)
2397 if ($self->pool->solvables[i].repo != $self)
2401 %newobject first_repodata;
2402 XRepodata *first_repodata() {
2405 if ($self->nrepodata < 2)
2407 /* make sure all repodatas but the first are extensions */
2408 data = repo_id2repodata($self, 1);
2409 if (data->loadcallback)
2411 for (i = 2; i < $self->nrepodata; i++)
2413 data = repo_id2repodata($self, i);
2414 if (!data->loadcallback)
2415 return 0; /* oops, not an extension */
2417 return new_XRepodata($self, 1);
2420 %newobject Selection;
2421 Selection *Selection(int setflags=0) {
2422 Selection *sel = new_Selection($self->pool);
2423 setflags |= SOLVER_SETREPO;
2424 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
2428 #ifdef ENABLE_PUBKEY
2429 %newobject find_pubkey;
2430 XSolvable *find_pubkey(const char *keyid) {
2431 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
2435 Repo *createshadow(const char *name) {
2436 Repo *repo = repo_create($self->pool, name);
2437 if ($self->idarraysize) {
2438 repo_reserve_ids(repo, 0, $self->idarraysize);
2439 memcpy(repo->idarraydata, $self->idarraydata, sizeof(Id) * $self->idarraysize);
2440 repo->idarraysize = $self->idarraysize;
2442 repo->start = $self->start;
2443 repo->end = $self->end;
2444 repo->nsolvables = $self->nsolvables;
2448 void moveshadow(Queue q) {
2449 Pool *pool = $self->pool;
2451 for (i = 0; i < q.count; i++) {
2453 Id p = q.elements[i];
2454 if (p < $self->start || p >= $self->end)
2456 s = pool->solvables + p;
2457 if ($self->idarraysize != s->repo->idarraysize)
2463 #if defined(SWIGTCL)
2464 %rename("==") __eq__;
2466 bool __eq__(Repo *repo) {
2467 return $self == repo;
2469 #if defined(SWIGTCL)
2470 %rename("!=") __ne__;
2472 bool __ne__(Repo *repo) {
2473 return $self != repo;
2475 #if defined(SWIGPYTHON)
2477 return $self->repoid;
2480 #if defined(SWIGPERL) || defined(SWIGTCL)
2481 %rename("str") __str__;
2484 const char *__str__() {
2487 return solv_strdup($self->name);
2488 sprintf(buf, "Repo#%d", $self->repoid);
2489 return solv_strdup(buf);
2491 #if defined(SWIGPERL) || defined(SWIGTCL)
2492 %rename("repr") __repr__;
2494 %newobject __repr__;
2495 const char *__repr__() {
2499 sprintf(buf, "<Repo #%d ", $self->repoid);
2500 return solv_dupjoin(buf, $self->name, ">");
2502 sprintf(buf, "<Repo #%d>", $self->repoid);
2503 return solv_strdup(buf);
2507 %extend Dataiterator {
2508 static const int SEARCH_STRING = SEARCH_STRING;
2509 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
2510 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
2511 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
2512 static const int SEARCH_GLOB = SEARCH_GLOB;
2513 static const int SEARCH_REGEX = SEARCH_REGEX;
2514 static const int SEARCH_NOCASE = SEARCH_NOCASE;
2515 static const int SEARCH_FILES = SEARCH_FILES;
2516 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
2517 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
2519 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
2520 Dataiterator *di = solv_calloc(1, sizeof(*di));
2521 dataiterator_init(di, pool, repo, p, key, match, flags);
2525 dataiterator_free($self);
2528 #if defined(SWIGPYTHON)
2530 def __iter__(self): return self
2533 %rename("next") __next__();
2535 %exception __next__ {
2538 PyErr_SetString(PyExc_StopIteration,"no more matches");
2544 perliter(solv::Dataiterator)
2546 %newobject __next__;
2547 Datamatch *__next__() {
2549 if (!dataiterator_step($self)) {
2552 ndi = solv_calloc(1, sizeof(*ndi));
2553 dataiterator_init_clone(ndi, $self);
2554 dataiterator_strdup(ndi);
2560 while ((d = Dataiterator___next__($self)) != 0) {
2561 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
2565 void prepend_keyname(Id key) {
2566 dataiterator_prepend_keyname($self, key);
2568 void skip_solvable() {
2569 dataiterator_skip_solvable($self);
2574 Id lookup_id(Id keyname) {
2575 Pool *pool = $self->repo->pool;
2576 Datapos oldpos = pool->pos;
2579 r = pool_lookup_id(pool, SOLVID_POS, keyname);
2583 const char *lookup_str(Id keyname) {
2584 Pool *pool = $self->repo->pool;
2585 Datapos oldpos = pool->pos;
2588 r = pool_lookup_str(pool, SOLVID_POS, keyname);
2592 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2593 Pool *pool = $self->repo->pool;
2594 Datapos oldpos = pool->pos;
2595 unsigned long long r;
2597 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
2601 bool lookup_void(Id keyname) {
2602 Pool *pool = $self->repo->pool;
2603 Datapos oldpos = pool->pos;
2606 r = pool_lookup_void(pool, SOLVID_POS, keyname);
2610 %newobject lookup_checksum;
2611 Chksum *lookup_checksum(Id keyname) {
2612 Pool *pool = $self->repo->pool;
2613 Datapos oldpos = pool->pos;
2615 const unsigned char *b;
2617 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
2619 return solv_chksum_create_from_bin(type, b);
2621 const char *lookup_deltaseq() {
2622 Pool *pool = $self->repo->pool;
2623 Datapos oldpos = pool->pos;
2626 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
2628 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
2629 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
2634 const char *lookup_deltalocation(unsigned int *OUTPUT) {
2635 Pool *pool = $self->repo->pool;
2636 Datapos oldpos = pool->pos;
2639 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
2643 Queue lookup_idarray(Id keyname) {
2644 Pool *pool = $self->repo->pool;
2645 Datapos oldpos = pool->pos;
2649 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
2653 %newobject Dataiterator;
2654 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2655 Pool *pool = $self->repo->pool;
2656 Datapos oldpos = pool->pos;
2659 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
2667 dataiterator_free($self);
2670 %newobject solvable;
2671 XSolvable * const solvable;
2673 const char * const key_idstr;
2675 const char * const type_idstr;
2677 const char * const idstr;
2678 const char * const str;
2679 BinaryBlob const binary;
2680 unsigned long long const num;
2681 unsigned int const num2;
2683 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
2684 return new_XSolvable(di->pool, di->solvid);
2686 SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
2687 return di->key->name;
2689 SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
2690 return pool_id2str(di->pool, di->key->name);
2692 SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
2693 return di->key->type;
2695 SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
2696 return pool_id2str(di->pool, di->key->type);
2698 SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
2701 SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
2702 if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
2703 return repodata_dir2str(di->data, di->kv.id, 0);
2704 if (di->data && di->data->localpool)
2705 return stringpool_id2str(&di->data->spool, di->kv.id);
2706 return pool_id2str(di->pool, di->kv.id);
2708 SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
2711 SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
2715 if (di->key->type == REPOKEY_TYPE_BINARY)
2717 bl.data = di->kv.str;
2718 bl.len = di->kv.num;
2720 else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
2721 bl.data = di->kv.str;
2724 SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
2725 if (di->key->type == REPOKEY_TYPE_NUM)
2726 return SOLV_KV_NUM64(&di->kv);
2729 SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
2735 Pool *pool = $self->pool;
2736 Datapos *pos, oldpos = pool->pos;
2737 dataiterator_setpos($self);
2738 pos = solv_calloc(1, sizeof(*pos));
2743 %newobject parentpos;
2744 Datapos *parentpos() {
2745 Pool *pool = $self->pool;
2746 Datapos *pos, oldpos = pool->pos;
2747 dataiterator_setpos_parent($self);
2748 pos = solv_calloc(1, sizeof(*pos));
2753 #if defined(SWIGPERL)
2754 /* cannot use str here because swig reports a bogus conflict... */
2755 %rename("stringify") __str__;
2757 *solv::Datamatch::str = *solvc::Datamatch_stringify;
2760 #if defined(SWIGTCL)
2761 %rename("stringify") __str__;
2763 const char *__str__() {
2764 KeyValue kv = $self->kv;
2765 const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
2766 return str ? str : "";
2770 %extend Pool_solvable_iterator {
2771 Pool_solvable_iterator(Pool *pool) {
2772 Pool_solvable_iterator *s;
2773 s = solv_calloc(1, sizeof(*s));
2777 #if defined(SWIGPYTHON)
2779 def __iter__(self): return self
2782 %rename("next") __next__();
2784 %exception __next__ {
2787 PyErr_SetString(PyExc_StopIteration,"no more matches");
2793 perliter(solv::Pool_solvable_iterator)
2795 %newobject __next__;
2796 XSolvable *__next__() {
2797 Pool *pool = $self->pool;
2798 if ($self->id >= pool->nsolvables)
2800 while (++$self->id < pool->nsolvables)
2801 if (pool->solvables[$self->id].repo)
2802 return new_XSolvable(pool, $self->id);
2808 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2809 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2813 %newobject __getitem__;
2814 XSolvable *__getitem__(Id key) {
2815 Pool *pool = $self->pool;
2816 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2817 return new_XSolvable(pool, key);
2821 return $self->pool->nsolvables;
2825 %extend Pool_repo_iterator {
2826 Pool_repo_iterator(Pool *pool) {
2827 Pool_repo_iterator *s;
2828 s = solv_calloc(1, sizeof(*s));
2832 #if defined(SWIGPYTHON)
2834 def __iter__(self): return self
2837 %rename("next") __next__();
2839 %exception __next__ {
2842 PyErr_SetString(PyExc_StopIteration,"no more matches");
2848 perliter(solv::Pool_repo_iterator)
2851 Pool *pool = $self->pool;
2852 if ($self->id >= pool->nrepos)
2854 while (++$self->id < pool->nrepos) {
2855 Repo *r = pool_id2repo(pool, $self->id);
2864 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2865 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, 0 | 0));
2869 Repo *__getitem__(Id key) {
2870 Pool *pool = $self->pool;
2871 if (key > 0 && key < pool->nrepos)
2872 return pool_id2repo(pool, key);
2876 return $self->pool->nrepos;
2880 %extend Repo_solvable_iterator {
2881 Repo_solvable_iterator(Repo *repo) {
2882 Repo_solvable_iterator *s;
2883 s = solv_calloc(1, sizeof(*s));
2887 #if defined(SWIGPYTHON)
2889 def __iter__(self): return self
2892 %rename("next") __next__();
2894 %exception __next__ {
2897 PyErr_SetString(PyExc_StopIteration,"no more matches");
2903 perliter(solv::Repo_solvable_iterator)
2905 %newobject __next__;
2906 XSolvable *__next__() {
2907 Repo *repo = $self->repo;
2908 Pool *pool = repo->pool;
2909 if (repo->start > 0 && $self->id < repo->start)
2910 $self->id = repo->start - 1;
2911 if ($self->id >= repo->end)
2913 while (++$self->id < repo->end)
2914 if (pool->solvables[$self->id].repo == repo)
2915 return new_XSolvable(pool, $self->id);
2921 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2922 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2926 %newobject __getitem__;
2927 XSolvable *__getitem__(Id key) {
2928 Repo *repo = $self->repo;
2929 Pool *pool = repo->pool;
2930 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2931 return new_XSolvable(pool, key);
2935 return $self->repo->pool->nsolvables;
2940 Dep(Pool *pool, Id id) {
2944 s = solv_calloc(1, sizeof(*s));
2950 Dep *Rel(int flags, DepId evrid, bool create=1) {
2951 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2954 return new_Dep($self->pool, id);
2956 %newobject Selection_name;
2957 Selection *Selection_name(int setflags=0) {
2958 Selection *sel = new_Selection($self->pool);
2959 if (ISRELDEP($self->id)) {
2960 Reldep *rd = GETRELDEP($self->pool, $self->id);
2961 if (rd->flags == REL_EQ) {
2962 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2963 if (ISRELDEP(rd->name))
2964 rd = GETRELDEP($self->pool, rd->name);
2966 if (rd->flags == REL_ARCH)
2967 setflags |= SOLVER_SETARCH;
2969 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2972 %newobject Selection_provides;
2973 Selection *Selection_provides(int setflags=0) {
2974 Selection *sel = new_Selection($self->pool);
2975 if (ISRELDEP($self->id)) {
2976 Reldep *rd = GETRELDEP($self->pool, $self->id);
2977 if (rd->flags == REL_ARCH)
2978 setflags |= SOLVER_SETARCH;
2980 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2984 return pool_dep2str($self->pool, $self->id);
2986 #if defined(SWIGTCL)
2987 %rename("==") __eq__;
2989 bool __eq__(Dep *s) {
2990 return $self->pool == s->pool && $self->id == s->id;
2992 #if defined(SWIGTCL)
2993 %rename("!=") __ne__;
2995 bool __ne__(Dep *s) {
2996 return !Dep___eq__($self, s);
2998 #if defined(SWIGPYTHON)
3003 #if defined(SWIGPERL) || defined(SWIGTCL)
3004 %rename("str") __str__;
3006 const char *__str__() {
3007 return pool_dep2str($self->pool, $self->id);
3009 #if defined(SWIGPERL) || defined(SWIGTCL)
3010 %rename("repr") __repr__;
3012 %newobject __repr__;
3013 const char *__repr__() {
3015 sprintf(buf, "<Id #%d ", $self->id);
3016 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
3021 XSolvable(Pool *pool, Id id) {
3023 if (!id || id >= pool->nsolvables)
3025 s = solv_calloc(1, sizeof(*s));
3031 return pool_solvid2str($self->pool, $self->id);
3033 const char *lookup_str(Id keyname) {
3034 return pool_lookup_str($self->pool, $self->id, keyname);
3036 Id lookup_id(Id keyname) {
3037 return pool_lookup_id($self->pool, $self->id, keyname);
3039 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
3040 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
3042 bool lookup_void(Id keyname) {
3043 return pool_lookup_void($self->pool, $self->id, keyname);
3045 %newobject lookup_checksum;
3046 Chksum *lookup_checksum(Id keyname) {
3048 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
3049 return solv_chksum_create_from_bin(type, b);
3051 Queue lookup_idarray(Id keyname, Id marker = -1) {
3052 Solvable *s = $self->pool->solvables + $self->id;
3055 solvable_lookup_deparray(s, keyname, &r, marker);
3058 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
3059 %newobject lookup_deparray;
3060 Queue lookup_deparray(Id keyname, Id marker = -1) {
3061 Solvable *s = $self->pool->solvables + $self->id;
3064 solvable_lookup_deparray(s, keyname, &r, marker);
3067 const char *lookup_location(unsigned int *OUTPUT) {
3068 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
3070 const char *lookup_sourcepkg() {
3071 return solvable_lookup_sourcepkg($self->pool->solvables + $self->id);
3073 %newobject Dataiterator;
3074 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
3075 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
3078 %rename("installable?") installable;
3080 bool installable() {
3081 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
3084 %rename("isinstalled?") isinstalled;
3086 bool isinstalled() {
3087 Pool *pool = $self->pool;
3088 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
3093 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
3094 Pool *pool = xs->pool;
3095 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
3097 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
3098 Pool *pool = xs->pool;
3099 return pool_id2str(pool, pool->solvables[xs->id].name);
3104 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
3105 xs->pool->solvables[xs->id].name = nameid;
3107 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
3108 return xs->pool->solvables[xs->id].name;
3113 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
3114 Pool *pool = xs->pool;
3115 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
3117 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
3118 Pool *pool = xs->pool;
3119 return pool_id2str(pool, pool->solvables[xs->id].evr);
3124 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
3125 xs->pool->solvables[xs->id].evr = evrid;
3127 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
3128 return xs->pool->solvables[xs->id].evr;
3133 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
3134 Pool *pool = xs->pool;
3135 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
3137 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
3138 Pool *pool = xs->pool;
3139 return pool_id2str(pool, pool->solvables[xs->id].arch);
3144 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
3145 xs->pool->solvables[xs->id].arch = archid;
3147 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
3148 return xs->pool->solvables[xs->id].arch;
3153 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
3154 Pool *pool = xs->pool;
3155 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
3157 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
3158 Pool *pool = xs->pool;
3159 return pool_id2str(pool, pool->solvables[xs->id].vendor);
3164 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
3165 xs->pool->solvables[xs->id].vendor = vendorid;
3167 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
3168 return xs->pool->solvables[xs->id].vendor;
3173 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
3174 return xs->pool->solvables[xs->id].repo;
3178 /* old interface, please use the generic add_deparray instead */
3179 void add_provides(DepId id, Id marker = -1) {
3180 Solvable *s = $self->pool->solvables + $self->id;
3181 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
3182 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
3184 void add_obsoletes(DepId id) {
3185 Solvable *s = $self->pool->solvables + $self->id;
3186 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
3188 void add_conflicts(DepId id) {
3189 Solvable *s = $self->pool->solvables + $self->id;
3190 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
3192 void add_requires(DepId id, Id marker = -1) {
3193 Solvable *s = $self->pool->solvables + $self->id;
3194 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
3195 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
3197 void add_recommends(DepId id) {
3198 Solvable *s = $self->pool->solvables + $self->id;
3199 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
3201 void add_suggests(DepId id) {
3202 Solvable *s = $self->pool->solvables + $self->id;
3203 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
3205 void add_supplements(DepId id) {
3206 Solvable *s = $self->pool->solvables + $self->id;
3207 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
3209 void add_enhances(DepId id) {
3210 Solvable *s = $self->pool->solvables + $self->id;
3211 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
3214 void unset(Id keyname) {
3215 Solvable *s = $self->pool->solvables + $self->id;
3216 repo_unset(s->repo, $self->id, keyname);
3219 void add_deparray(Id keyname, DepId id, Id marker = -1) {
3220 Solvable *s = $self->pool->solvables + $self->id;
3221 solvable_add_deparray(s, keyname, id, marker);
3224 %newobject Selection;
3225 Selection *Selection(int setflags=0) {
3226 Selection *sel = new_Selection($self->pool);
3227 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
3232 %rename("identical?") identical;
3234 bool identical(XSolvable *s2) {
3235 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
3237 int evrcmp(XSolvable *s2) {
3238 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
3241 %rename("matchesdep?") matchesdep;
3243 bool matchesdep(Id keyname, DepId id, Id marker = -1) {
3244 return solvable_matchesdep($self->pool->solvables + $self->id, keyname, id, marker);
3247 #if defined(SWIGTCL)
3248 %rename("==") __eq__;
3250 bool __eq__(XSolvable *s) {
3251 return $self->pool == s->pool && $self->id == s->id;
3253 #if defined(SWIGTCL)
3254 %rename("!=") __ne__;
3256 bool __ne__(XSolvable *s) {
3257 return !XSolvable___eq__($self, s);
3259 #if defined(SWIGPYTHON)
3264 #if defined(SWIGPERL) || defined(SWIGTCL)
3265 %rename("str") __str__;
3267 const char *__str__() {
3268 return pool_solvid2str($self->pool, $self->id);
3270 #if defined(SWIGPERL) || defined(SWIGTCL)
3271 %rename("repr") __repr__;
3273 %newobject __repr__;
3274 const char *__repr__() {
3276 sprintf(buf, "<Solvable #%d ", $self->id);
3277 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
3282 Problem(Solver *solv, Id id) {
3284 p = solv_calloc(1, sizeof(*p));
3289 %newobject findproblemrule;
3290 XRule *findproblemrule() {
3291 Id r = solver_findproblemrule($self->solv, $self->id);
3292 return new_XRule($self->solv, r);
3294 %newobject findallproblemrules;
3295 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
3296 Queue findallproblemrules(int unfiltered=0) {
3297 Solver *solv = $self->solv;
3302 solver_findallproblemrules(solv, $self->id, &q);
3305 for (i = j = 0; i < q.count; i++)
3307 SolverRuleinfo rclass;
3308 probr = q.elements[i];
3309 rclass = solver_ruleclass(solv, probr);
3310 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
3312 q.elements[j++] = probr;
3315 queue_truncate(&q, j);
3319 int solution_count() {
3320 return solver_solution_count($self->solv, $self->id);
3322 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
3323 %newobject solutions;
3328 cnt = solver_solution_count($self->solv, $self->id);
3329 for (i = 1; i <= cnt; i++)
3333 #if defined(SWIGPERL) || defined(SWIGTCL)
3334 %rename("str") __str__;
3336 const char *__str__() {
3337 return solver_problem2str($self->solv, $self->id);
3342 Solution(Problem *p, Id id) {
3344 s = solv_calloc(1, sizeof(*s));
3346 s->problemid = p->id;
3350 int element_count() {
3351 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3354 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
3355 %newobject elements;
3356 Queue elements(bool expandreplaces=0) {
3360 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3361 for (i = 1; i <= cnt; i++)
3364 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
3366 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
3372 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
3373 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
3375 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
3376 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3377 queue_push2(&q, p, rp);
3379 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
3380 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3381 queue_push2(&q, p, rp);
3383 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
3384 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3385 queue_push2(&q, p, rp);
3387 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
3388 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3389 queue_push2(&q, p, rp);
3394 queue_push2(&q, i, type);
3395 queue_push2(&q, p, rp);
3401 %extend Solutionelement {
3402 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
3404 e = solv_calloc(1, sizeof(*e));
3406 e->problemid = problemid;
3418 if (p == SOLVER_SOLUTION_ERASE)
3423 else if (p == SOLVER_SOLUTION_REPLACE)
3428 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
3429 illegal = POLICY_ILLEGAL_DOWNGRADE;
3430 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
3431 illegal = POLICY_ILLEGAL_ARCHCHANGE;
3432 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
3433 illegal = POLICY_ILLEGAL_VENDORCHANGE;
3434 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
3435 illegal = POLICY_ILLEGAL_NAMECHANGE;
3437 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);
3438 return solver_solutionelement2str($self->solv, p, rp);
3440 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
3441 %newobject replaceelements;
3442 Queue replaceelements() {
3447 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3450 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3451 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
3452 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3453 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
3454 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3455 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
3456 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3457 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
3458 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3460 queue_push(&q, $self->type);
3463 int illegalreplace() {
3464 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3466 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3468 %newobject solvable;
3469 XSolvable * const solvable;
3470 %newobject replacement;
3471 XSolvable * const replacement;
3474 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
3475 return new_XSolvable(e->solv->pool, e->p);
3477 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
3478 return new_XSolvable(e->solv->pool, e->rp);
3480 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
3481 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
3483 return (e->p - 1) / 2;
3488 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
3489 if ($self->type == SOLVER_SOLUTION_JOB || $self->type == SOLVER_SOLUTION_POOLJOB)
3490 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
3491 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
3492 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
3493 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)
3494 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
3495 if ($self->type == SOLVER_SOLUTION_ERASE)
3496 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
3502 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
3503 static const int SOLVER_RULE_PKG = SOLVER_RULE_PKG;
3504 static const int SOLVER_RULE_PKG_NOT_INSTALLABLE = SOLVER_RULE_PKG_NOT_INSTALLABLE;
3505 static const int SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP = SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP;
3506 static const int SOLVER_RULE_PKG_REQUIRES = SOLVER_RULE_PKG_REQUIRES;
3507 static const int SOLVER_RULE_PKG_SELF_CONFLICT = SOLVER_RULE_PKG_SELF_CONFLICT;
3508 static const int SOLVER_RULE_PKG_CONFLICTS = SOLVER_RULE_PKG_CONFLICTS;
3509 static const int SOLVER_RULE_PKG_SAME_NAME = SOLVER_RULE_PKG_SAME_NAME;
3510 static const int SOLVER_RULE_PKG_OBSOLETES = SOLVER_RULE_PKG_OBSOLETES;
3511 static const int SOLVER_RULE_PKG_IMPLICIT_OBSOLETES = SOLVER_RULE_PKG_IMPLICIT_OBSOLETES;
3512 static const int SOLVER_RULE_PKG_INSTALLED_OBSOLETES = SOLVER_RULE_PKG_INSTALLED_OBSOLETES;
3513 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
3514 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
3515 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
3516 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
3517 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
3518 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
3519 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
3520 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
3521 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
3522 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
3523 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
3525 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
3526 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
3527 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
3528 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
3529 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
3530 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
3531 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
3532 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
3533 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
3534 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
3535 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
3537 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
3538 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
3539 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
3540 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
3542 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
3543 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
3544 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
3545 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
3546 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
3547 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
3548 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
3549 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
3550 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
3551 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
3552 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
3553 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
3554 static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
3555 static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
3556 static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
3557 static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
3558 static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
3559 static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
3560 static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
3561 static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
3562 static const int SOLVER_FLAG_NEED_UPDATEPROVIDE = SOLVER_FLAG_NEED_UPDATEPROVIDE;
3563 static const int SOLVER_FLAG_FOCUS_BEST = SOLVER_FLAG_FOCUS_BEST;
3564 static const int SOLVER_FLAG_STRONG_RECOMMENDS = SOLVER_FLAG_STRONG_RECOMMENDS;
3565 static const int SOLVER_FLAG_INSTALL_ALSO_UPDATES = SOLVER_FLAG_INSTALL_ALSO_UPDATES;
3566 static const int SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED = SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED;
3568 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
3569 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
3570 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
3571 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
3572 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
3573 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
3574 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
3575 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
3576 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
3577 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
3578 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
3581 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
3587 int set_flag(int flag, int value) {
3588 return solver_set_flag($self, flag, value);
3590 int get_flag(int flag) {
3591 return solver_get_flag($self, flag);
3594 %typemap(out) Queue solve Queue2Array(Problem *, 1, new_Problem(arg1, id));
3596 Queue solve(Queue solvejobs) {
3600 solver_solve($self, &solvejobs);
3601 cnt = solver_problem_count($self);
3602 for (i = 1; i <= cnt; i++)
3607 %newobject transaction;
3608 Transaction *transaction() {
3609 return solver_create_transaction($self);
3612 int describe_decision(XSolvable *s, XRule **OUTPUT) {
3614 int reason = solver_describe_decision($self, s->id, &ruleid);
3615 *OUTPUT = new_XRule($self, ruleid);
3619 %newobject describe_weakdep_decision_raw;
3620 Queue describe_weakdep_decision_raw(XSolvable *s) {
3623 solver_describe_weakdep_decision($self, s->id, &q);
3626 #if defined(SWIGPYTHON)
3628 def describe_weakdep_decision(self, s):
3629 d = iter(self.describe_weakdep_decision_raw(s))
3630 return [ (t, XSolvable(self.pool, sid), Dep(self.pool, id)) for t, sid, id in zip(d, d, d) ]
3633 #if defined(SWIGPERL)
3635 sub solv::Solver::describe_weakdep_decision {
3636 my ($self, $s) = @_;
3637 my $pool = $self->{'pool'};
3639 my @d = $self->describe_weakdep_decision_raw($s);
3640 push @res, [ splice(@d, 0, 3) ] while @d;
3641 return map { [ $_->[0], solv::XSolvable->new($pool, $_->[1]), solv::Dep->new($pool, $_->[2]) ] } @res;
3645 #if defined(SWIGRUBY)
3648 "class Solv::Solver\n"
3649 " def describe_weakdep_decision(s)\n"
3650 " 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"
3657 int alternatives_count() {
3658 return solver_alternatives_count($self);
3661 %newobject alternative;
3662 Alternative *alternative(Id aid) {
3663 Alternative *a = solv_calloc(1, sizeof(*a));
3665 queue_init(&a->choices);
3666 a->type = solver_get_alternative($self, aid, &a->dep_id, &a->from_id, &a->chosen_id, &a->choices, &a->level);
3668 queue_free(&a->choices);
3672 if (a->type == SOLVER_ALTERNATIVE_TYPE_RULE) {
3679 %typemap(out) Queue all_alternatives Queue2Array(Alternative *, 1, Solver_alternative(arg1, id));
3680 %newobject all_alternatives;
3681 Queue all_alternatives() {
3685 cnt = solver_alternatives_count($self);
3686 for (i = 1; i <= cnt; i++)
3691 bool write_testcase(const char *dir) {
3692 return testcase_write($self, dir, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0);
3695 Queue raw_decisions(int filter=0) {
3698 solver_get_decisionqueue($self, &q);
3701 for (i = j = 0; i < q.count; i++)
3702 if ((filter > 0 && q.elements[i] > 1) ||
3703 (filter < 0 && q.elements[i] < 0))
3704 q.elements[j++] = q.elements[i];
3705 queue_truncate(&q, j);
3710 %typemap(out) Queue get_recommended Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3711 %newobject get_recommended;
3712 Queue get_recommended(bool noselected=0) {
3715 solver_get_recommendations($self, &q, NULL, noselected);
3718 %typemap(out) Queue get_suggested Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3719 %newobject get_suggested;
3720 Queue get_suggested(bool noselected=0) {
3723 solver_get_recommendations($self, NULL, &q, noselected);
3728 %extend Transaction {
3729 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
3730 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
3731 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
3732 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
3733 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
3734 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
3735 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
3736 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
3737 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
3738 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
3739 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
3740 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
3741 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
3742 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
3743 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
3744 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
3745 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
3746 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
3747 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
3748 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
3749 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
3750 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
3751 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
3752 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
3753 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
3754 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
3755 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
3756 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
3758 transaction_free($self);
3761 %rename("isempty?") isempty;
3764 return $self->steps.count == 0;
3767 %newobject othersolvable;
3768 XSolvable *othersolvable(XSolvable *s) {
3769 Id op = transaction_obs_pkg($self, s->id);
3770 return new_XSolvable($self->pool, op);
3773 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3774 %newobject allothersolvables;
3775 Queue allothersolvables(XSolvable *s) {
3778 transaction_all_obs_pkgs($self, s->id, &q);
3782 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
3783 %newobject classify;
3784 Queue classify(int mode = 0) {
3787 transaction_classify($self, mode, &q);
3791 /* deprecated, use newsolvables instead */
3792 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3793 %newobject newpackages;
3794 Queue newpackages() {
3798 cut = transaction_installedresult(self, &q);
3799 queue_truncate(&q, cut);
3803 /* deprecated, use keptsolvables instead */
3804 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3805 %newobject keptpackages;
3806 Queue keptpackages() {
3810 cut = transaction_installedresult(self, &q);
3812 queue_deleten(&q, 0, cut);
3816 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3817 %newobject newsolvables;
3818 Queue newsolvables() {
3822 cut = transaction_installedresult(self, &q);
3823 queue_truncate(&q, cut);
3827 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3828 %newobject keptsolvables;
3829 Queue keptsolvables() {
3833 cut = transaction_installedresult(self, &q);
3835 queue_deleten(&q, 0, cut);
3839 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3843 queue_init_clone(&q, &$self->steps);
3847 int steptype(XSolvable *s, int mode) {
3848 return transaction_type($self, s->id, mode);
3850 long long calc_installsizechange() {
3851 return transaction_calc_installsizechange($self);
3853 void order(int flags=0) {
3854 transaction_order($self, flags);
3858 %extend TransactionClass {
3859 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
3860 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
3861 cl->transaction = trans;
3865 cl->fromid = fromid;
3869 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
3870 %newobject solvables;
3874 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
3877 const char * const fromstr;
3878 const char * const tostr;
3880 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
3881 return pool_id2str(cl->transaction->pool, cl->fromid);
3883 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
3884 return pool_id2str(cl->transaction->pool, cl->toid);
3890 XRule(Solver *solv, Id id) {
3893 XRule *xr = solv_calloc(1, sizeof(*xr));
3900 SWIGINTERN int XRule_type_get(XRule *xr) {
3901 return solver_ruleclass(xr->solv, xr->id);
3906 Id type, source, target, dep;
3907 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
3908 return new_Ruleinfo($self, type, source, target, dep);
3910 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
3911 %newobject allinfos;
3915 solver_allruleinfos($self->solv, $self->id, &q);
3919 #if defined(SWIGTCL)
3920 %rename("==") __eq__;
3922 bool __eq__(XRule *xr) {
3923 return $self->solv == xr->solv && $self->id == xr->id;
3925 #if defined(SWIGTCL)
3926 %rename("!=") __ne__;
3928 bool __ne__(XRule *xr) {
3929 return !XRule___eq__($self, xr);
3931 #if defined(SWIGPYTHON)
3936 #if defined(SWIGPERL) || defined(SWIGTCL)
3937 %rename("repr") __repr__;
3939 %newobject __repr__;
3940 const char *__repr__() {
3942 sprintf(buf, "<Rule #%d>", $self->id);
3943 return solv_strdup(buf);
3948 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3949 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3953 ri->source = source;
3954 ri->target = target;
3955 ri->dep_id = dep_id;
3958 %newobject solvable;
3959 XSolvable * const solvable;
3960 %newobject othersolvable;
3961 XSolvable * const othersolvable;
3965 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3966 return new_XSolvable(ri->solv->pool, ri->source);
3968 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3969 return new_XSolvable(ri->solv->pool, ri->target);
3971 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3972 return new_Dep(ri->solv->pool, ri->dep_id);
3975 const char *problemstr() {
3976 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3981 XRepodata(Repo *repo, Id id) {
3982 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3988 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3990 void set_id(Id solvid, Id keyname, DepId id) {
3991 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3993 void set_num(Id solvid, Id keyname, unsigned long long num) {
3994 repodata_set_num(repo_id2repodata($self->repo, $self->id), solvid, keyname, num);
3996 void set_str(Id solvid, Id keyname, const char *str) {
3997 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3999 void set_void(Id solvid, Id keyname) {
4000 repodata_set_void(repo_id2repodata($self->repo, $self->id), solvid, keyname);
4002 void set_poolstr(Id solvid, Id keyname, const char *str) {
4003 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
4005 void add_idarray(Id solvid, Id keyname, DepId id) {
4006 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
4008 void add_flexarray(Id solvid, Id keyname, Id handle) {
4009 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
4011 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
4012 const unsigned char *buf = solv_chksum_get(chksum, 0);
4014 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
4016 void set_sourcepkg(Id solvid, const char *sourcepkg) {
4017 repodata_set_sourcepkg(repo_id2repodata($self->repo, $self->id), solvid, sourcepkg);
4019 void set_location(Id solvid, unsigned int mediano, const char *location) {
4020 repodata_set_location(repo_id2repodata($self->repo, $self->id), solvid, mediano, 0, location);
4022 void unset(Id solvid, Id keyname) {
4023 repodata_unset(repo_id2repodata($self->repo, $self->id), solvid, keyname);
4025 const char *lookup_str(Id solvid, Id keyname) {
4026 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
4028 Id lookup_id(Id solvid, Id keyname) {
4029 return repodata_lookup_id(repo_id2repodata($self->repo, $self->id), solvid, keyname);
4031 unsigned long long lookup_num(Id solvid, Id keyname, unsigned long long notfound = 0) {
4032 return repodata_lookup_num(repo_id2repodata($self->repo, $self->id), solvid, keyname, notfound);
4034 bool lookup_void(Id solvid, Id keyname) {
4035 return repodata_lookup_void(repo_id2repodata($self->repo, $self->id), solvid, keyname);
4037 Queue lookup_idarray(Id solvid, Id keyname) {
4040 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
4043 %newobject lookup_checksum;
4044 Chksum *lookup_checksum(Id solvid, Id keyname) {
4046 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
4047 return solv_chksum_create_from_bin(type, b);
4049 void internalize() {
4050 repodata_internalize(repo_id2repodata($self->repo, $self->id));
4052 void create_stubs() {
4053 Repodata *data = repo_id2repodata($self->repo, $self->id);
4054 data = repodata_create_stubs(data);
4055 $self->id = data->repodataid;
4057 bool write(FILE *fp) {
4058 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
4060 Id str2dir(const char *dir, bool create=1) {
4061 Repodata *data = repo_id2repodata($self->repo, $self->id);
4062 return repodata_str2dir(data, dir, create);
4064 const char *dir2str(Id did, const char *suf = 0) {
4065 Repodata *data = repo_id2repodata($self->repo, $self->id);
4066 return repodata_dir2str(data, did, suf);
4068 void add_dirstr(Id solvid, Id keyname, Id dir, const char *str) {
4069 Repodata *data = repo_id2repodata($self->repo, $self->id);
4070 repodata_add_dirstr(data, solvid, keyname, dir, str);
4072 bool add_solv(FILE *fp, int flags = 0) {
4073 Repodata *data = repo_id2repodata($self->repo, $self->id);
4074 int r, oldstate = data->state;
4075 data->state = REPODATA_LOADING;
4076 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
4077 if (r || data->state == REPODATA_LOADING)
4078 data->state = oldstate;
4081 void extend_to_repo() {
4082 Repodata *data = repo_id2repodata($self->repo, $self->id);
4083 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
4085 #if defined(SWIGTCL)
4086 %rename("==") __eq__;
4088 bool __eq__(XRepodata *xr) {
4089 return $self->repo == xr->repo && $self->id == xr->id;
4091 #if defined(SWIGTCL)
4092 %rename("!=") __ne__;
4094 bool __ne__(XRepodata *xr) {
4095 return !XRepodata___eq__($self, xr);
4097 #if defined(SWIGPYTHON)
4102 #if defined(SWIGPERL) || defined(SWIGTCL)
4103 %rename("repr") __repr__;
4105 %newobject __repr__;
4106 const char *__repr__() {
4108 sprintf(buf, "<Repodata #%d>", $self->id);
4109 return solv_strdup(buf);
4113 #ifdef ENABLE_PUBKEY
4116 return solvsig_create(fp);
4119 solvsig_free($self);
4123 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
4125 #ifdef ENABLE_PGPVRFY
4127 XSolvable *verify(Repo *repo, Chksum *chksum) {
4128 Id p = solvsig_verify($self, repo, chksum);
4129 return new_XSolvable(repo->pool, p);
4135 %extend Alternative {
4136 static const int SOLVER_ALTERNATIVE_TYPE_RULE = SOLVER_ALTERNATIVE_TYPE_RULE;
4137 static const int SOLVER_ALTERNATIVE_TYPE_RECOMMENDS = SOLVER_ALTERNATIVE_TYPE_RECOMMENDS;
4138 static const int SOLVER_ALTERNATIVE_TYPE_SUGGESTS = SOLVER_ALTERNATIVE_TYPE_SUGGESTS;
4141 queue_free(&$self->choices);
4145 XSolvable * const chosen;
4148 %newobject depsolvable;
4149 XSolvable * const depsolvable;
4153 SWIGINTERN XSolvable *Alternative_chosen_get(Alternative *a) {
4154 return new_XSolvable(a->solv->pool, a->chosen_id);
4156 SWIGINTERN XRule *Alternative_rule_get(Alternative *a) {
4157 return new_XRule(a->solv, a->rid);
4159 SWIGINTERN XSolvable *Alternative_depsolvable_get(Alternative *a) {
4160 return new_XSolvable(a->solv->pool, a->from_id);
4162 SWIGINTERN Dep *Alternative_dep_get(Alternative *a) {
4163 return new_Dep(a->solv->pool, a->dep_id);
4167 Queue choices_raw() {
4169 queue_init_clone(&r, &$self->choices);
4173 %typemap(out) Queue choices Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
4177 queue_init_clone(&r, &$self->choices);
4178 for (i = 0; i < r.count; i++)
4179 if (r.elements[i] < 0)
4180 r.elements[i] = -r.elements[i];
4184 #if defined(SWIGPERL) || defined(SWIGTCL)
4185 %rename("str") __str__;
4187 const char *__str__() {
4188 return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
4192 #if defined(SWIGTCL)
4195 "proc solv::iter {varname iter body} {\n"\
4197 " set value [$iter __next__]\n"\
4198 " if {$value eq \"NULL\"} { break }\n"\
4199 " uplevel [list set $varname $value]\n"\
4200 " set code [catch {uplevel $body} result]\n"\
4201 " switch -exact -- $code {\n"\
4205 " default { return -code $code $result }\n"\