2 * WARNING: for perl iterator/array support you need to run
3 * sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
4 * on the generated c code
10 %markfunc Pool "mark_Pool";
14 ** binaryblob handling
24 %typemap(in,noblock=1,fragment="SWIG_AsCharPtrAndSize") (const unsigned char *str, size_t len) (int res, char *buf = 0, size_t size = 0, int alloc = 0) {
30 ba = Tcl_GetByteArrayFromObj($input, &bal);
39 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
43 if (!SWIG_IsOK(res)) {
44 #if defined(SWIGPYTHON)
45 const void *pybuf = 0;
46 Py_ssize_t pysize = 0;
47 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
49 %argument_fail(res, "BinaryBlob", $symname, $argnum);
55 %argument_fail(res, "const char *", $symname, $argnum);
58 $1 = (unsigned char *)buf;
62 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
63 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
66 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
67 #if defined(SWIGPYTHON) && defined(PYTHON3)
68 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
69 #elif defined(SWIGTCL)
70 Tcl_SetObjResult(interp, $1.data ? Tcl_NewByteArrayObj($1.data, $1.len) : NULL);
72 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
83 %typemap(arginit) Queue {
86 %typemap(freearg) Queue {
90 #if defined(SWIGPYTHON)
94 PyObject *o = PyList_New($1.count);
95 for (i = 0; i < $1.count; i++)
96 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
101 %define Queue2Array(type, step, con) %{ {
103 int cnt = $1.count / step;
104 Id *idp = $1.elements;
105 PyObject *o = PyList_New(cnt);
106 for (i = 0; i < cnt; i++, idp += step)
109 #define result resultx
112 PyList_SetItem(o, i, $result);
121 %define Array2Queue(asval_meth,typestr) %{ {
123 if (!PyList_Check($input))
124 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
125 size = PyList_Size($input);
126 for (i = 0; i < size; i++) {
127 PyObject *o = PyList_GetItem($input,i);
129 int e = asval_meth(o, &v);
131 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only" typestr);
138 %define ObjArray2Queue(type, obj2queue) %{ {
140 if (!PyList_Check($input))
141 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
142 size = PyList_Size($input);
143 for (i = 0; i < size; i++) {
144 PyObject *o = PyList_GetItem($input,i);
146 int e = SWIG_ConvertPtr(o, (void **)&obj, $descriptor(type), 0 | 0);
148 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
155 #endif /* SWIGPYTHON */
157 #if defined(SWIGPERL)
159 * av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
160 * $result = newRV_noinc((SV*)o); argvi++;
162 %typemap(out) Queue {
164 if (argvi + $1.count + 1 >= items) {
165 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
167 for (i = 0; i < $1.count; i++)
168 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
173 %define Queue2Array(type, step, con) %{ {
175 int cnt = $1.count / step;
176 Id *idp = $1.elements;
177 if (argvi + cnt + 1 >= items) {
178 EXTEND(sp, (argvi + cnt + 1) - items + 1);
180 for (i = 0; i < cnt; i++, idp += step)
183 #define result resultx
186 SvREFCNT_inc(ST(argvi - 1));
195 %define Array2Queue(asval_meth,typestr) %{ {
198 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
199 SWIG_croak("argument $argnum is not an array reference.");
200 av = (AV*)SvRV($input);
202 for (i = 0; i <= size; i++) {
203 SV **sv = av_fetch(av, i, 0);
205 int e = asval_meth(*sv, &v);
207 SWIG_croak("array in argument $argnum must contain only " typestr);
214 %define ObjArray2Queue(type, obj2queue) %{ {
217 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
218 SWIG_croak("argument $argnum is not an array reference.");
219 av = (AV*)SvRV($input);
221 for (i = 0; i <= size; i++) {
222 SV **sv = av_fetch(av, i, 0);
224 int e = SWIG_ConvertPtr(*sv, (void **)&obj, $descriptor(type), 0 | 0);
226 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
233 #endif /* SWIGPERL */
236 #if defined(SWIGRUBY)
237 %typemap(out) Queue {
239 VALUE o = rb_ary_new2($1.count);
240 for (i = 0; i < $1.count; i++)
241 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
246 %define Queue2Array(type, step, con) %{ {
248 int cnt = $1.count / step;
249 Id *idp = $1.elements;
250 VALUE o = rb_ary_new2(cnt);
251 for (i = 0; i < cnt; i++, idp += step)
254 #define result resultx
257 rb_ary_store(o, i, $result);
266 %define Array2Queue(asval_meth,typestr) %{ {
269 ary = rb_Array($input);
270 size = RARRAY_LEN(ary);
273 for (i = 0; i < size; i++, o++) {
275 int e = asval_meth(*o, &v);
277 SWIG_exception_fail(SWIG_TypeError, "list in argument $argnum must contain only " typestr);
284 %define ObjArray2Queue(type, obj2queue) %{ {
287 ary = rb_Array($input);
288 size = RARRAY_LEN(ary);
291 for (i = 0; i < size; i++, o++) {
293 int e = SWIG_ConvertPtr(*o, (void **)&obj, $descriptor(type), 0 | 0);
295 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
302 #endif /* SWIGRUBY */
305 %typemap(out) Queue {
306 Tcl_Obj *objvx[$1.count];
309 for (i = 0; i < $1.count; i++) {
310 objvx[i] = SWIG_From_int($1.elements[i]);
312 Tcl_SetObjResult(interp, Tcl_NewListObj($1.count, objvx));
316 %define Queue2Array(type, step, con) %{
317 { /* scope is needed to make the goto of SWIG_exception_fail work */
319 int cnt = $1.count / step;
320 Id *idp = $1.elements;
323 for (i = 0; i < cnt; i++, idp += step) {
325 #define result resultx
326 #define Tcl_SetObjResult(i, x) resultobj = x
330 objvx[i] = resultobj;
331 #undef Tcl_SetObjResult
335 Tcl_SetObjResult(interp, Tcl_NewListObj(cnt, objvx));
340 %define Array2Queue(asval_meth,typestr) %{ {
343 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
344 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
345 for (i = 0; i < size; i++) {
349 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
350 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
351 e = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(o, &v);
353 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only " typestr);
360 %define ObjArray2Queue(type, obj2queue) %{ {
363 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
364 SWIG_exception_fail(SWIG_TypeError, "argument $argnum is not a list");
365 for (i = 0; i < size; i++) {
369 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
370 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
371 e = SWIG_ConvertPtr(o, (void **)&obj, $descriptor(type), 0 | 0);
373 SWIG_exception_fail(SWIG_ArgError(e), "list in argument $argnum must contain only "`type`);
382 %typemap(in) Queue Array2Queue(SWIG_AsVal_int, "integers")
383 %typemap(in) Queue solvejobs ObjArray2Queue(Job *, queue_push2(&$1, obj->how, obj->what))
387 #if defined(SWIGPERL)
389 /* work around a swig bug for swig versions < 2.0.5 */
390 #if SWIG_VERSION < 0x020005
394 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
396 # ifndef MULTIPLICITY
397 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
399 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
406 %define perliter(class)
409 my $i = ${##class##::ITERATORS}{$_[0]};
411 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
413 $_[0]->__getitem__($_[1]);
416 sub class##::FETCHSIZE {
417 my $i = ${##class##::ITERATORS}{$_[0]};
419 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
429 #define SWIG_PERL_ITERATOR 0x80
431 SWIGRUNTIMEINLINE SV *
432 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
433 SV *result = sv_newmortal();
434 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
439 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
440 stash=SvSTASH(SvRV(obj));
441 if (flags & SWIG_POINTER_OWN) {
443 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
445 gv_init(gv, stash, "OWNER", 5, FALSE);
447 hv_store_ent(hv, obj, newSViv(1), 0);
449 if (flags & SWIG_PERL_ITERATOR) {
451 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
454 gv_init(gv, stash, "ITERATORS", 9, FALSE);
456 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
458 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
460 self=newRV_noinc((SV *)array);
461 sv_setsv(result, self);
462 SvREFCNT_dec((SV *)self);
463 sv_bless(result, stash);
465 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
472 %typemap(out) Perlarray {
473 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
475 %typemap(out) Perliterator {
476 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
479 %typemap(out) Pool_solvable_iterator * = Perlarray;
480 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
481 %typemap(out) Pool_repo_iterator * = Perlarray;
482 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
483 %typemap(out) Repo_solvable_iterator * = Perlarray;
484 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
485 %typemap(out) Dataiterator * = Perliterator;
487 #endif /* SWIGPERL */
494 #if defined(SWIGPYTHON)
495 typedef PyObject *AppObjectPtr;
496 %typemap(in) AppObjectPtr {
501 %typemap(out) AppObjectPtr {
502 $result = $1 ? $1 : Py_None;
505 #elif defined(SWIGPERL)
506 typedef SV *AppObjectPtr;
507 %typemap(in) AppObjectPtr {
510 sv_setsv((SV *)$1, $input);
514 %typemap(out) AppObjectPtr {
515 $result = sv_2mortal($1 ? SvREFCNT_inc($1) : newSV(0));
518 #elif defined(SWIGRUBY)
519 typedef VALUE AppObjectPtr;
520 %typemap(in) AppObjectPtr {
523 %typemap(out) AppObjectPtr {
526 #elif defined(SWIGTCL)
527 typedef Tcl_Obj *AppObjectPtr;
528 %typemap(in) AppObjectPtr {
530 Tcl_IncrRefCount($input);
533 %typemap(out) AppObjectPtr {
534 Tcl_SetObjResult(interp, $1 ? $1 : Tcl_NewObj());
537 #warning AppObjectPtr not defined for this language!
547 %fragment("SWIG_AsValFilePtr","header") {}
551 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
555 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
556 #elif defined(SWIGTCL)
557 SWIG_AsValSolvFpPtr SWIG_TCL_DECL_ARGS_2(void *obj, FILE **val) {
559 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
561 static swig_type_info* desc = 0;
565 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
566 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
568 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
572 ecode = SWIG_AsValFilePtr(obj, val);
573 if (ecode == SWIG_OK)
576 return SWIG_TypeError;
580 #define SWIG_AsValSolvFpPtr(x, y) SWIG_AsValSolvFpPtr SWIG_TCL_CALL_ARGS_2(x, y)
590 %fragment("SWIG_AsValDepId","header") {
594 SWIG_AsValDepId(VALUE obj, int *val) {
595 #elif defined(SWIGTCL)
596 SWIG_AsValDepId SWIG_TCL_DECL_ARGS_2(void *obj, int *val) {
598 SWIG_AsValDepId(void *obj, int *val) {
600 static swig_type_info* desc = 0;
603 if (!desc) desc = SWIG_TypeQuery("Dep *");
605 ecode = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(obj, val);
607 ecode = SWIG_AsVal_int(obj, val);
609 if (SWIG_IsOK(ecode))
611 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
613 *val = vptr ? ((Dep *)vptr)->id : 0;
616 return SWIG_TypeError;
620 #define SWIG_AsValDepId(x, y) SWIG_AsValDepId SWIG_TCL_CALL_ARGS_2(x, y)
625 ** Pool disown helper
628 %typemap(out) disown_helper {
629 #if defined(SWIGRUBY)
630 SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
631 #elif defined(SWIGPYTHON)
632 SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
633 #elif defined(SWIGPERL)
634 SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
635 #elif defined(SWIGTCL)
636 SWIG_ConvertPtr(objv[1], &argp1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
638 #warning disown_helper not implemented for this language, this is likely going to leak memory
642 Tcl_SetObjResult(interp, SWIG_From_int((int)(0)));
644 $result = SWIG_From_int((int)(0));
653 %include "typemaps.i"
655 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
658 %typemap(argout,noblock=1) XRule **OUTPUT {
659 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
662 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
663 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
667 ** the C declarations
673 #include <sys/stat.h>
674 #include <sys/utsname.h>
675 #include <sys/types.h>
679 /* argh, swig undefs bool for perl */
685 #include "poolarch.h"
689 #include "solverdebug.h"
690 #include "repo_solv.h"
692 #include "selection.h"
694 #include "repo_write.h"
695 #if defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG)
696 #include "repo_rpmdb.h"
699 #include "repo_pubkey.h"
702 #include "repo_deb.h"
705 #include "repo_rpmmd.h"
706 #include "repo_updateinfoxml.h"
707 #include "repo_deltainfoxml.h"
708 #include "repo_repomdxml.h"
710 #ifdef ENABLE_SUSEREPO
711 #include "repo_products.h"
712 #include "repo_susetags.h"
713 #include "repo_content.h"
715 #ifdef ENABLE_MDKREPO
716 #include "repo_mdk.h"
718 #ifdef ENABLE_ARCHREPO
719 #include "repo_arch.h"
722 #include "repo_autopattern.h"
724 #if defined(ENABLE_COMPLEX_DEPS) && (defined(ENABLE_SUSEREPO) || defined(ENABLE_RPMMD) || defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG))
725 #include "pool_parserpmrichdep.h"
727 #include "solv_xfopen.h"
728 #include "testcase.h"
730 /* for old ruby versions */
732 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
735 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
738 #define SOLVER_SOLUTION_ERASE -100
739 #define SOLVER_SOLUTION_REPLACE -101
740 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
741 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
742 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
743 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
745 typedef void *AppObjectPtr;
771 } Pool_solvable_iterator;
776 } Pool_repo_iterator;
781 } Repo_solvable_iterator;
832 Transaction *transaction;
850 typedef Dataiterator Datamatch;
852 typedef int disown_helper;
869 SWIGINTERN void appdata_disown_helper(void *appdata) {
871 SWIGINTERN void appdata_clr_helper(void **appdatap) {
874 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
877 SWIGINTERN void *appdata_get_helper(void *appdata) {
882 #elif defined(SWIGTCL)
885 SWIGINTERN void appdata_disown_helper(void *appdata) {
887 SWIGINTERN void appdata_clr_helper(void **appdatap) {
889 Tcl_DecrRefCount((Tcl_Obj *)(*appdatap));
892 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
893 appdata_clr_helper(appdatap);
896 SWIGINTERN void *appdata_get_helper(void *appdata) {
901 #elif defined(SWIGPYTHON)
904 SWIGINTERN void appdata_disown_helper(void *appdata) {
905 struct myappdata *myappdata = appdata;
906 if (!myappdata || !myappdata->appdata || myappdata->disowned)
908 myappdata->disowned = 1;
909 Py_DECREF((PyObject *)myappdata->appdata);
911 SWIGINTERN void appdata_clr_helper(void **appdatap) {
912 struct myappdata *myappdata = *(struct myappdata **)appdatap;
913 if (myappdata && myappdata->appdata && !myappdata->disowned) {
914 Py_DECREF((PyObject *)myappdata->appdata);
916 *appdatap = solv_free(myappdata);
918 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
919 appdata_clr_helper(appdatap);
921 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
922 myappdata->appdata = appdata;
925 SWIGINTERN void *appdata_get_helper(void *appdata) {
926 return appdata ? ((struct myappdata *)appdata)->appdata : 0;
931 #elif defined(SWIGPERL)
934 SWIGINTERN void appdata_disown_helper(void *appdata) {
935 struct myappdata *myappdata = appdata;
937 if (!myappdata || !myappdata->appdata || myappdata->disowned)
939 rsv = myappdata->appdata;
942 myappdata->appdata = SvRV(rsv);
943 myappdata->disowned = 1;
946 SWIGINTERN void appdata_clr_helper(void **appdatap) {
947 struct myappdata *myappdata = *(struct myappdata **)appdatap;
948 if (myappdata && myappdata->appdata && !myappdata->disowned) {
949 SvREFCNT_dec((SV *)myappdata->appdata);
951 *appdatap = solv_free(myappdata);
953 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
954 appdata_clr_helper(appdatap);
956 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
957 myappdata->appdata = appdata;
960 SWIGINTERN void *appdata_get_helper(void *appdata) {
961 struct myappdata *myappdata = appdata;
962 if (!myappdata || !myappdata->appdata)
964 return myappdata->disowned ? newRV_noinc((SV *)myappdata->appdata) : myappdata->appdata;
970 #warning appdata helpers not implemented for this language
975 ** the SWIG declarations defining the API
979 %mixin Dataiterator "Enumerable";
980 %mixin Pool_solvable_iterator "Enumerable";
981 %mixin Pool_repo_iterator "Enumerable";
982 %mixin Repo_solvable_iterator "Enumerable";
989 /* from repodata.h */
990 %constant Id SOLVID_META;
991 %constant Id SOLVID_POS;
993 %constant int REL_EQ;
994 %constant int REL_GT;
995 %constant int REL_LT;
996 %constant int REL_AND;
997 %constant int REL_OR;
998 %constant int REL_WITH;
999 %constant int REL_NAMESPACE;
1000 %constant int REL_ARCH;
1001 %constant int REL_FILECONFLICT;
1002 %constant int REL_COND;
1003 %constant int REL_COMPAT;
1004 %constant int REL_KIND;
1005 %constant int REL_MULTIARCH;
1006 %constant int REL_ELSE;
1007 %constant int REL_ERROR;
1008 %constant int REL_WITHOUT;
1009 %constant int REL_UNLESS;
1021 /* put before pool/repo so we can access the constructor */
1022 %nodefaultdtor Dataiterator;
1023 typedef struct {} Dataiterator;
1046 typedef struct {} Pool_solvable_iterator;
1047 typedef struct {} Pool_repo_iterator;
1048 typedef struct {} Repo_solvable_iterator;
1050 %nodefaultctor Datamatch;
1051 %nodefaultdtor Datamatch;
1058 %nodefaultctor Datapos;
1069 %nodefaultctor Pool;
1070 %nodefaultdtor Pool;
1074 %nodefaultctor Repo;
1075 %nodefaultdtor Repo;
1078 const char * const name;
1081 int const nsolvables;
1084 %nodefaultctor Solver;
1085 %nodefaultdtor Solver;
1093 #ifdef ENABLE_PUBKEY
1096 unsigned int const created;
1097 unsigned int const expires;
1098 const char * const keyid;
1102 %rename(xfopen) solvfp_xfopen;
1103 %rename(xfopen_fd) solvfp_xfopen_fd;
1105 %nodefaultctor SolvFp;
1109 %newobject solvfp_xfopen;
1110 %newobject solvfp_xfopen_fd;
1112 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
1113 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
1116 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
1122 fcntl(fd, F_SETFD, FD_CLOEXEC);
1123 fp = solv_xfopen_fd(fn, fd, mode);
1128 sfp = solv_calloc(1, sizeof(SolvFp));
1132 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
1135 fp = solv_xfopen(fn, mode);
1138 if (fileno(fp) != -1)
1139 fcntl(fileno(fp), F_SETFD, FD_CLOEXEC);
1140 sfp = solv_calloc(1, sizeof(SolvFp));
1147 Solver * const solv;
1152 Solver * const solv;
1160 Id const solutionid;
1165 %nodefaultctor Alternative;
1176 %nodefaultctor Transaction;
1177 %nodefaultdtor Transaction;
1183 Transaction * const transaction;
1197 return $self->fp ? fileno($self->fp) : -1;
1200 return $self->fp ? dup(fileno($self->fp)) : -1;
1202 bool write(const unsigned char *str, size_t len) {
1203 return fwrite(str, len, 1, $self->fp) == 1;
1208 return fflush($self->fp) == 0;
1214 ret = fclose($self->fp) == 0;
1218 void cloexec(bool state) {
1219 if (!$self->fp || fileno($self->fp) == -1)
1221 fcntl(fileno($self->fp), F_SETFD, state ? FD_CLOEXEC : 0);
1226 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
1227 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
1228 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
1229 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
1230 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
1231 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
1232 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
1233 static const Id SOLVER_NOOP = SOLVER_NOOP;
1234 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
1235 static const Id SOLVER_ERASE = SOLVER_ERASE;
1236 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
1237 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
1238 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
1239 static const Id SOLVER_LOCK = SOLVER_LOCK;
1240 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
1241 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
1242 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
1243 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
1244 static const Id SOLVER_ALLOWUNINSTALL = SOLVER_ALLOWUNINSTALL;
1245 static const Id SOLVER_FAVOR = SOLVER_FAVOR;
1246 static const Id SOLVER_DISFAVOR = SOLVER_DISFAVOR;
1247 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
1248 static const Id SOLVER_WEAK = SOLVER_WEAK;
1249 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
1250 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
1251 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
1252 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
1253 static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
1254 static const Id SOLVER_SETEV = SOLVER_SETEV;
1255 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
1256 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
1257 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
1258 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
1259 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
1260 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
1261 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
1263 Job(Pool *pool, int how, Id what) {
1264 Job *job = solv_calloc(1, sizeof(*job));
1271 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1272 %newobject solvables;
1276 pool_job2solvables($self->pool, &q, $self->how, $self->what);
1280 %rename("isemptyupdate?") isemptyupdate;
1282 bool isemptyupdate() {
1283 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
1286 #if defined(SWIGTCL)
1287 %rename("==") __eq__;
1289 bool __eq__(Job *j) {
1290 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
1292 #if defined(SWIGTCL)
1293 %rename("!=") __ne__;
1295 bool __ne__(Job *j) {
1296 return !Job___eq__($self, j);
1298 #if defined(SWIGPERL) || defined(SWIGTCL)
1299 %rename("str") __str__;
1301 const char *__str__() {
1302 return pool_job2str($self->pool, $self->how, $self->what, 0);
1304 #if defined(SWIGPERL) || defined(SWIGTCL)
1305 %rename("repr") __repr__;
1307 const char *__repr__() {
1308 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
1309 return pool_tmpjoin($self->pool, "<Job ", str, ">");
1314 static const Id SELECTION_NAME = SELECTION_NAME;
1315 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
1316 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
1317 static const Id SELECTION_CANON = SELECTION_CANON;
1318 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
1319 static const Id SELECTION_REL = SELECTION_REL;
1320 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
1321 static const Id SELECTION_GLOB = SELECTION_GLOB;
1322 static const Id SELECTION_FLAT = SELECTION_FLAT;
1323 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
1324 static const Id SELECTION_SKIP_KIND = SELECTION_SKIP_KIND;
1325 static const Id SELECTION_MATCH_DEPSTR = SELECTION_MATCH_DEPSTR;
1326 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
1327 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
1328 static const Id SELECTION_WITH_DISABLED = SELECTION_WITH_DISABLED;
1329 static const Id SELECTION_WITH_BADARCH = SELECTION_WITH_BADARCH;
1330 static const Id SELECTION_WITH_ALL = SELECTION_WITH_ALL;
1331 static const Id SELECTION_ADD = SELECTION_ADD;
1332 static const Id SELECTION_SUBTRACT = SELECTION_SUBTRACT;
1333 static const Id SELECTION_FILTER = SELECTION_FILTER;
1334 static const Id SELECTION_FILTER_KEEP_IFEMPTY = SELECTION_FILTER_KEEP_IFEMPTY;
1335 static const Id SELECTION_FILTER_SWAPPED = SELECTION_FILTER_SWAPPED;
1337 Selection(Pool *pool) {
1339 s = solv_calloc(1, sizeof(*s));
1345 queue_free(&$self->q);
1349 %rename("isempty?") isempty;
1352 return $self->q.count == 0;
1355 Selection *clone(int flags = 0) {
1356 Selection *s = new_Selection($self->pool);
1357 queue_init_clone(&s->q, &$self->q);
1358 s->flags = $self->flags;
1361 void filter(Selection *lsel) {
1362 if ($self->pool != lsel->pool)
1363 queue_empty(&$self->q);
1365 selection_filter($self->pool, &$self->q, &lsel->q);
1367 void add(Selection *lsel) {
1368 if ($self->pool == lsel->pool)
1370 selection_add($self->pool, &$self->q, &lsel->q);
1371 $self->flags |= lsel->flags;
1374 void add_raw(Id how, Id what) {
1375 queue_push2(&$self->q, how, what);
1377 void subtract(Selection *lsel) {
1378 if ($self->pool == lsel->pool)
1379 selection_subtract($self->pool, &$self->q, &lsel->q);
1382 void select(const char *name, int flags) {
1383 if ((flags & SELECTION_MODEBITS) == 0)
1384 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1385 $self->flags = selection_make($self->pool, &$self->q, name, flags);
1387 void matchdeps(const char *name, int flags, Id keyname, Id marker = -1) {
1388 if ((flags & SELECTION_MODEBITS) == 0)
1389 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1390 $self->flags = selection_make_matchdeps($self->pool, &$self->q, name, flags, keyname, marker);
1392 void matchdepid(DepId dep, int flags, Id keyname, Id marker = -1) {
1393 if ((flags & SELECTION_MODEBITS) == 0)
1394 flags |= SELECTION_FILTER | SELECTION_WITH_ALL;
1395 $self->flags = selection_make_matchdepid($self->pool, &$self->q, dep, flags, keyname, marker);
1398 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
1400 Queue jobs(int flags) {
1403 queue_init_clone(&q, &$self->q);
1404 for (i = 0; i < q.count; i += 2)
1405 q.elements[i] |= flags;
1409 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1410 %newobject solvables;
1414 selection_solvables($self->pool, &$self->q, &q);
1418 #if defined(SWIGPERL) || defined(SWIGTCL)
1419 %rename("str") __str__;
1421 const char *__str__() {
1422 return pool_selection2str($self->pool, &$self->q, 0);
1424 #if defined(SWIGPERL) || defined(SWIGTCL)
1425 %rename("repr") __repr__;
1427 const char *__repr__() {
1428 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
1429 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
1435 return solv_chksum_create(type);
1437 Chksum(Id type, const char *hex) {
1438 unsigned char buf[64];
1439 int l = solv_chksum_len(type);
1442 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
1444 return solv_chksum_create_from_bin(type, buf);
1446 %newobject from_bin;
1447 static Chksum *from_bin(Id type, const unsigned char *str, size_t len) {
1448 return len == solv_chksum_len(type) ? solv_chksum_create_from_bin(type, str) : 0;
1450 #if defined(SWIGPERL)
1452 undef *solv::Chksum::from_bin;
1453 *solv::Chksum::from_bin = sub {
1455 my $self = solvc::Chksum_from_bin(@_);
1456 bless $self, $pkg if defined $self;
1461 solv_chksum_free($self, 0);
1465 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
1466 return solv_chksum_get_type(chk);
1469 void add(const unsigned char *str, size_t len) {
1470 solv_chksum_add($self, str, (int)len);
1472 void add_fp(FILE *fp) {
1475 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
1476 solv_chksum_add($self, buf, l);
1477 rewind(fp); /* convenience */
1479 void add_fd(int fd) {
1482 while ((l = read(fd, buf, sizeof(buf))) > 0)
1483 solv_chksum_add($self, buf, l);
1484 lseek(fd, 0, 0); /* convenience */
1486 void add_stat(const char *filename) {
1488 if (stat(filename, &stb))
1489 memset(&stb, 0, sizeof(stb));
1490 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1491 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1492 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1493 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1495 void add_fstat(int fd) {
1497 if (fstat(fd, &stb))
1498 memset(&stb, 0, sizeof(stb));
1499 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1500 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1501 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1502 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1507 const unsigned char *b;
1508 b = solv_chksum_get($self, &l);
1516 const unsigned char *b;
1519 b = solv_chksum_get($self, &l);
1520 ret = solv_malloc(2 * l + 1);
1521 solv_bin2hex(b, l, ret);
1524 const char *typestr() {
1525 return solv_chksum_type2str(solv_chksum_get_type($self));
1528 #if defined(SWIGTCL)
1529 %rename("==") __eq__;
1531 bool __eq__(Chksum *chk) {
1532 return solv_chksum_cmp($self, chk);
1534 #if defined(SWIGTCL)
1535 %rename("!=") __ne__;
1537 bool __ne__(Chksum *chk) {
1538 return !solv_chksum_cmp($self, chk);
1540 #if defined(SWIGRUBY)
1541 %rename("to_s") __str__;
1543 #if defined(SWIGPERL) || defined(SWIGTCL)
1544 %rename("str") __str__;
1547 const char *__str__() {
1550 if (solv_chksum_isfinished($self))
1551 h = Chksum_hex($self);
1552 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1553 solv_free((void *)h);
1556 #if defined(SWIGPERL) || defined(SWIGTCL)
1557 %rename("repr") __repr__;
1559 %newobject __repr__;
1560 const char *__repr__() {
1561 const char *h = Chksum___str__($self);
1562 const char *str = solv_dupjoin("<Chksum ", h, ">");
1563 solv_free((void *)h);
1569 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1570 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1571 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1572 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1573 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1574 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1575 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1576 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1577 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1578 static const int DISTTYPE_RPM = DISTTYPE_RPM;
1579 static const int DISTTYPE_DEB = DISTTYPE_DEB;
1580 static const int DISTTYPE_ARCH = DISTTYPE_ARCH;
1581 static const int DISTTYPE_HAIKU = DISTTYPE_HAIKU;
1584 Pool *pool = pool_create();
1587 int setdisttype(int disttype) {
1588 return pool_setdisttype($self, disttype);
1590 void set_debuglevel(int level) {
1591 pool_setdebuglevel($self, level);
1593 int set_flag(int flag, int value) {
1594 return pool_set_flag($self, flag, value);
1596 int get_flag(int flag) {
1597 return pool_get_flag($self, flag);
1599 void set_rootdir(const char *rootdir) {
1600 pool_set_rootdir($self, rootdir);
1602 const char *get_rootdir(int flag) {
1603 return pool_get_rootdir($self);
1605 #if defined(SWIGPYTHON)
1607 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1608 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1609 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1610 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1615 return 0; /* exception */
1616 ecode = SWIG_AsVal_int(result, &vresult);
1618 return SWIG_IsOK(ecode) ? vresult : 0;
1621 void clr_loadcallback() {
1622 if ($self->loadcallback == loadcallback) {
1623 PyObject *obj = $self->loadcallbackdata;
1625 pool_setloadcallback($self, 0, 0);
1628 void set_loadcallback(PyObject *callable) {
1629 Pool_clr_loadcallback($self);
1631 Py_INCREF(callable);
1632 pool_setloadcallback($self, loadcallback, callable);
1635 #elif defined(SWIGPERL)
1637 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1641 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1646 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1648 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1658 void clr_loadcallback() {
1659 if ($self->loadcallback == loadcallback) {
1660 SvREFCNT_dec($self->loadcallbackdata);
1661 pool_setloadcallback($self, 0, 0);
1664 void set_loadcallback(SV *callable) {
1665 Pool_clr_loadcallback($self);
1667 SvREFCNT_inc(callable);
1668 pool_setloadcallback($self, loadcallback, callable);
1671 #elif defined(SWIGRUBY)
1673 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1674 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1675 VALUE callable = (VALUE)d;
1676 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1677 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1678 return res == Qtrue;
1680 SWIGINTERN void mark_Pool(void *ptr) {
1682 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1683 VALUE callable = (VALUE)pool->loadcallbackdata;
1684 rb_gc_mark(callable);
1688 void clr_loadcallback() {
1689 pool_setloadcallback($self, 0, 0);
1691 %typemap(in, numinputs=0) VALUE callable {
1692 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1694 void set_loadcallback(VALUE callable) {
1695 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1697 #elif defined(SWIGTCL)
1703 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1704 tcl_callback_t *callback_var = (tcl_callback_t *)d;
1705 Tcl_Interp *interp = callback_var->interp;
1706 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1707 int result, ecode = 0, vresult = 0;
1709 objvx[0] = callback_var->obj;
1710 objvx[1] = SWIG_NewInstanceObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
1711 Tcl_IncrRefCount(objvx[1]);
1712 result = Tcl_EvalObjv(interp, sizeof(objvx)/sizeof(*objvx), objvx, TCL_EVAL_GLOBAL);
1713 Tcl_DecrRefCount(objvx[1]);
1714 if (result != TCL_OK)
1715 return 0; /* exception */
1716 ecode = SWIG_AsVal_int(interp, Tcl_GetObjResult(interp), &vresult);
1717 return SWIG_IsOK(ecode) ? vresult : 0;
1720 void clr_loadcallback() {
1721 if ($self->loadcallback == loadcallback) {
1722 tcl_callback_t *callback_var = $self->loadcallbackdata;
1723 Tcl_DecrRefCount(callback_var->obj);
1724 solv_free(callback_var);
1725 pool_setloadcallback($self, 0, 0);
1728 void set_loadcallback(Tcl_Obj *callable, Tcl_Interp *interp) {
1729 Pool_clr_loadcallback($self);
1731 tcl_callback_t *callback_var = solv_malloc(sizeof(tcl_callback_t));
1732 Tcl_IncrRefCount(callable);
1733 callback_var->interp = interp;
1734 callback_var->obj = callable;
1735 pool_setloadcallback($self, loadcallback, callback_var);
1739 #warning loadcallback not implemented for this language
1746 FOR_REPOS(repoid, repo)
1747 appdata_clr_helper(&repo->appdata);
1748 Pool_clr_loadcallback(pool);
1749 appdata_clr_helper(&pool->appdata);
1752 disown_helper free() {
1756 FOR_REPOS(repoid, repo)
1757 appdata_clr_helper(&repo->appdata);
1758 Pool_clr_loadcallback(pool);
1759 appdata_clr_helper(&pool->appdata);
1763 disown_helper disown() {
1766 AppObjectPtr appdata;
1768 SWIGINTERN void Pool_appdata_set(Pool *pool, AppObjectPtr appdata) {
1769 appdata_set_helper(&pool->appdata, appdata);
1771 SWIGINTERN AppObjectPtr Pool_appdata_get(Pool *pool) {
1772 return appdata_get_helper(pool->appdata);
1775 void appdata_disown() {
1776 appdata_disown_helper($self->appdata);
1779 Id str2id(const char *str, bool create=1) {
1780 return pool_str2id($self, str, create);
1783 Dep *Dep(const char *str, bool create=1) {
1784 Id id = pool_str2id($self, str, create);
1785 return new_Dep($self, id);
1787 #if defined(ENABLE_COMPLEX_DEPS) && (defined(ENABLE_SUSEREPO) || defined(ENABLE_RPMMD) || defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG))
1789 Dep *parserpmrichdep(const char *str) {
1790 Id id = pool_parserpmrichdep($self, str);
1791 return new_Dep($self, id);
1794 const char *id2str(Id id) {
1795 return pool_id2str($self, id);
1797 const char *dep2str(Id id) {
1798 return pool_dep2str($self, id);
1800 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1801 return pool_rel2id($self, name, evr, flags, create);
1803 Id id2langid(Id id, const char *lang, bool create=1) {
1804 return pool_id2langid($self, id, lang, create);
1806 void setarch(const char *arch = 0) {
1815 pool_setarch($self, arch);
1817 Repo *add_repo(const char *name) {
1818 return repo_create($self, name);
1820 const char *lookup_str(Id entry, Id keyname) {
1821 return pool_lookup_str($self, entry, keyname);
1823 Id lookup_id(Id entry, Id keyname) {
1824 return pool_lookup_id($self, entry, keyname);
1826 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1827 return pool_lookup_num($self, entry, keyname, notfound);
1829 bool lookup_void(Id entry, Id keyname) {
1830 return pool_lookup_void($self, entry, keyname);
1832 %newobject lookup_checksum;
1833 Chksum *lookup_checksum(Id entry, Id keyname) {
1835 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1836 return solv_chksum_create_from_bin(type, b);
1839 %newobject Dataiterator;
1840 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1841 return new_Dataiterator($self, 0, 0, key, match, flags);
1843 %newobject Dataiterator_solvid;
1844 Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
1845 return new_Dataiterator($self, 0, p, key, match, flags);
1847 const char *solvid2str(Id solvid) {
1848 return pool_solvid2str($self, solvid);
1850 void addfileprovides() {
1851 pool_addfileprovides($self);
1853 Queue addfileprovides_queue() {
1856 pool_addfileprovides_queue($self, &r, 0);
1859 void createwhatprovides() {
1860 pool_createwhatprovides($self);
1863 %newobject id2solvable;
1864 XSolvable *id2solvable(Id id) {
1865 return new_XSolvable($self, id);
1867 %newobject solvables;
1868 Pool_solvable_iterator * const solvables;
1870 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1871 return new_Pool_solvable_iterator(pool);
1874 %newobject solvables_iter;
1875 Pool_solvable_iterator * solvables_iter() {
1876 return new_Pool_solvable_iterator($self);
1879 Repo *id2repo(Id id) {
1880 if (id < 1 || id >= $self->nrepos)
1882 return pool_id2repo($self, id);
1886 Pool_repo_iterator * const repos;
1888 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1889 return new_Pool_repo_iterator(pool);
1892 %newobject repos_iter;
1893 Pool_repo_iterator * repos_iter() {
1894 return new_Pool_repo_iterator($self);
1898 const char * const errstr;
1900 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1901 pool_set_installed(pool, installed);
1903 SWIGINTERN Repo *Pool_installed_get(Pool *pool) {
1904 return pool->installed;
1906 SWIGINTERN const char *Pool_errstr_get(Pool *pool) {
1907 return pool_errstr(pool);
1911 Queue matchprovidingids(const char *match, int flags) {
1917 for (id = 1; id < pool->ss.nstrings; id++)
1918 if (pool->whatprovides[id])
1922 if (!datamatcher_init(&ma, match, flags)) {
1923 for (id = 1; id < pool->ss.nstrings; id++)
1924 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1926 datamatcher_free(&ma);
1933 Job *Job(int how, Id what) {
1934 return new_Job($self, how, what);
1937 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1938 %newobject whatprovides;
1939 Queue whatprovides(DepId dep) {
1944 FOR_PROVIDES(p, pp, dep)
1949 Id towhatprovides(Queue q) {
1950 return pool_queuetowhatprovides($self, &q);
1953 void set_namespaceproviders(DepId ns, DepId evr, bool value=1) {
1954 Id dep = pool_rel2id($self, ns, evr, REL_NAMESPACE, 1);
1955 pool_set_whatprovides($self, dep, value ? 2 : 1);
1958 void flush_namespaceproviders(DepId ns, DepId evr) {
1959 pool_flush_namespaceproviders($self, ns, evr);
1963 %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1964 %newobject whatmatchesdep;
1965 Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
1968 pool_whatmatchesdep($self, keyname, dep, &q, marker);
1973 %rename("isknownarch?") isknownarch;
1975 bool isknownarch(DepId id) {
1977 if (!id || id == ID_EMPTY)
1979 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1981 if (pool->id2arch && pool_arch2score(pool, id) == 0)
1988 return solver_create($self);
1991 %newobject Selection;
1992 Selection *Selection() {
1993 return new_Selection($self);
1995 %newobject Selection_all;
1996 Selection *Selection_all(int setflags=0) {
1997 Selection *sel = new_Selection($self);
1998 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
2002 Selection *select(const char *name, int flags) {
2003 Selection *sel = new_Selection($self);
2004 sel->flags = selection_make($self, &sel->q, name, flags);
2008 %newobject matchdeps;
2009 Selection *matchdeps(const char *name, int flags, Id keyname, Id marker = -1) {
2010 Selection *sel = new_Selection($self);
2011 sel->flags = selection_make_matchdeps($self, &sel->q, name, flags, keyname, marker);
2015 %newobject matchdepid;
2016 Selection *matchdepid(DepId dep, int flags, Id keyname, Id marker = -1) {
2017 Selection *sel = new_Selection($self);
2018 sel->flags = selection_make_matchdepid($self, &sel->q, dep, flags, keyname, marker);
2022 Queue get_considered_list() {
2026 for (i = 2; i < $self->nsolvables; i++) {
2027 if (!$self->solvables[i].repo)
2029 if (!$self->considered || MAPTST($self->considered, i))
2035 void set_considered_list(Queue q) {
2038 if (!$self->considered) {
2039 $self->considered = solv_calloc(1, sizeof(Map));
2040 map_init($self->considered, $self->nsolvables);
2042 map_empty($self->considered);
2043 MAPSET($self->considered, 1);
2044 for (i = 0; i < q.count; i++) {
2046 if (p > 0 && p < $self->nsolvables)
2047 MAPSET($self->considered, p);
2051 void setpooljobs(Queue solvejobs) {
2052 queue_free(&$self->pooljobs);
2053 queue_init_clone(&$self->pooljobs, &solvejobs);
2055 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
2056 %newobject getpooljobs;
2057 Queue getpooljobs() {
2059 queue_init_clone(&q, &$self->pooljobs);
2066 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
2067 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
2068 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
2069 static const int REPO_USE_LOADING = REPO_USE_LOADING;
2070 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
2071 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
2072 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
2073 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
2074 #ifdef ENABLE_SUSEREPO
2075 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
2078 void free(bool reuseids = 0) {
2079 appdata_clr_helper(&$self->appdata);
2080 repo_free($self, reuseids);
2082 void empty(bool reuseids = 0) {
2083 repo_empty($self, reuseids);
2086 %rename("isempty?") isempty;
2089 return !$self->nsolvables;
2092 AppObjectPtr appdata;
2094 SWIGINTERN void Repo_appdata_set(Repo *repo, AppObjectPtr appdata) {
2095 appdata_set_helper(&repo->appdata, appdata);
2097 SWIGINTERN AppObjectPtr Repo_appdata_get(Repo *repo) {
2098 return appdata_get_helper(repo->appdata);
2102 bool add_solv(const char *name, int flags = 0) {
2103 FILE *fp = fopen(name, "r");
2107 r = repo_add_solv($self, fp, flags);
2111 bool add_solv(FILE *fp, int flags = 0) {
2112 return repo_add_solv($self, fp, flags) == 0;
2115 %newobject add_solvable;
2116 XSolvable *add_solvable() {
2117 Id solvid = repo_add_solvable($self);
2118 return new_XSolvable($self->pool, solvid);
2122 bool add_rpmdb(int flags = 0) {
2123 return repo_add_rpmdb($self, 0, flags) == 0;
2125 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
2126 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
2129 #ifdef ENABLE_RPMPKG
2131 XSolvable *add_rpm(const char *name, int flags = 0) {
2132 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
2135 #ifdef ENABLE_PUBKEY
2137 bool add_rpmdb_pubkeys(int flags = 0) {
2138 return repo_add_rpmdb_pubkeys($self, flags) == 0;
2141 %newobject add_pubkey;
2142 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
2143 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
2145 bool add_keyring(FILE *fp, int flags = 0) {
2146 return repo_add_keyring($self, fp, flags);
2148 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
2149 return repo_add_keydir($self, keydir, suffix, flags);
2153 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
2154 return repo_add_rpmmd($self, fp, language, flags) == 0;
2156 bool add_repomdxml(FILE *fp, int flags = 0) {
2157 return repo_add_repomdxml($self, fp, flags) == 0;
2159 bool add_updateinfoxml(FILE *fp, int flags = 0) {
2160 return repo_add_updateinfoxml($self, fp, flags) == 0;
2162 bool add_deltainfoxml(FILE *fp, int flags = 0) {
2163 return repo_add_deltainfoxml($self, fp, flags) == 0;
2166 #ifdef ENABLE_DEBIAN
2167 bool add_debdb(int flags = 0) {
2168 return repo_add_debdb($self, flags) == 0;
2170 bool add_debpackages(FILE *fp, int flags = 0) {
2171 return repo_add_debpackages($self, fp, flags) == 0;
2174 XSolvable *add_deb(const char *name, int flags = 0) {
2175 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
2178 #ifdef ENABLE_SUSEREPO
2179 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
2180 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
2182 bool add_content(FILE *fp, int flags = 0) {
2183 return repo_add_content($self, fp, flags) == 0;
2185 bool add_products(const char *proddir, int flags = 0) {
2186 return repo_add_products($self, proddir, flags) == 0;
2189 #ifdef ENABLE_MDKREPO
2190 bool add_mdk(FILE *fp, int flags = 0) {
2191 return repo_add_mdk($self, fp, flags) == 0;
2193 bool add_mdk_info(FILE *fp, int flags = 0) {
2194 return repo_add_mdk_info($self, fp, flags) == 0;
2197 #ifdef ENABLE_ARCHREPO
2198 bool add_arch_repo(FILE *fp, int flags = 0) {
2199 return repo_add_arch_repo($self, fp, flags) == 0;
2201 bool add_arch_local(const char *dir, int flags = 0) {
2202 return repo_add_arch_local($self, dir, flags) == 0;
2204 %newobject add_arch_pkg;
2205 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
2206 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
2210 bool add_autopattern(int flags = 0) {
2211 return repo_add_autopattern($self, flags) == 0;
2214 void internalize() {
2215 repo_internalize($self);
2217 bool write(FILE *fp) {
2218 return repo_write($self, fp) == 0;
2220 /* HACK, remove if no longer needed! */
2221 bool write_first_repodata(FILE *fp) {
2222 int oldnrepodata = $self->nrepodata;
2224 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
2225 res = repo_write($self, fp);
2226 $self->nrepodata = oldnrepodata;
2230 %newobject Dataiterator;
2231 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2232 return new_Dataiterator($self->pool, $self, 0, key, match, flags);
2234 %newobject Dataiterator_meta;
2235 Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
2236 return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
2241 SWIGINTERN Id Repo_id_get(Repo *repo) {
2242 return repo->repoid;
2245 %newobject solvables;
2246 Repo_solvable_iterator * const solvables;
2248 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
2249 return new_Repo_solvable_iterator(repo);
2253 Datapos * const meta;
2255 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
2256 Datapos *pos = solv_calloc(1, sizeof(*pos));
2257 pos->solvid = SOLVID_META;
2263 %newobject solvables_iter;
2264 Repo_solvable_iterator *solvables_iter() {
2265 return new_Repo_solvable_iterator($self);
2268 %newobject add_repodata;
2269 XRepodata *add_repodata(int flags = 0) {
2270 Repodata *rd = repo_add_repodata($self, flags);
2271 return new_XRepodata($self, rd->repodataid);
2274 void create_stubs() {
2276 if (!$self->nrepodata)
2278 data = repo_id2repodata($self, $self->nrepodata - 1);
2279 if (data->state != REPODATA_STUB)
2280 (void)repodata_create_stubs(data);
2283 %rename("iscontiguous?") iscontiguous;
2285 bool iscontiguous() {
2287 for (i = $self->start; i < $self->end; i++)
2288 if ($self->pool->solvables[i].repo != $self)
2292 %newobject first_repodata;
2293 XRepodata *first_repodata() {
2296 if ($self->nrepodata < 2)
2298 /* make sure all repodatas but the first are extensions */
2299 data = repo_id2repodata($self, 1);
2300 if (data->loadcallback)
2302 for (i = 2; i < $self->nrepodata; i++)
2304 data = repo_id2repodata($self, i);
2305 if (!data->loadcallback)
2306 return 0; /* oops, not an extension */
2308 return new_XRepodata($self, 1);
2311 %newobject Selection;
2312 Selection *Selection(int setflags=0) {
2313 Selection *sel = new_Selection($self->pool);
2314 setflags |= SOLVER_SETREPO;
2315 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
2319 #ifdef ENABLE_PUBKEY
2320 %newobject find_pubkey;
2321 XSolvable *find_pubkey(const char *keyid) {
2322 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
2326 Repo *createshadow(const char *name) {
2327 Repo *repo = repo_create($self->pool, name);
2328 if ($self->idarraysize) {
2329 repo_reserve_ids(repo, 0, $self->idarraysize);
2330 memcpy(repo->idarraydata, $self->idarraydata, sizeof(Id) * $self->idarraysize);
2331 repo->idarraysize = $self->idarraysize;
2333 repo->start = $self->start;
2334 repo->end = $self->end;
2335 repo->nsolvables = $self->nsolvables;
2339 void moveshadow(Queue q) {
2340 Pool *pool = $self->pool;
2342 for (i = 0; i < q.count; i++) {
2344 Id p = q.elements[i];
2345 if (p < $self->start || p >= $self->end)
2347 s = pool->solvables + p;
2348 if ($self->idarraysize != s->repo->idarraysize)
2354 #if defined(SWIGTCL)
2355 %rename("==") __eq__;
2357 bool __eq__(Repo *repo) {
2358 return $self == repo;
2360 #if defined(SWIGTCL)
2361 %rename("!=") __ne__;
2363 bool __ne__(Repo *repo) {
2364 return $self != repo;
2366 #if defined(SWIGPYTHON)
2368 return $self->repoid;
2371 #if defined(SWIGPERL) || defined(SWIGTCL)
2372 %rename("str") __str__;
2375 const char *__str__() {
2378 return solv_strdup($self->name);
2379 sprintf(buf, "Repo#%d", $self->repoid);
2380 return solv_strdup(buf);
2382 #if defined(SWIGPERL) || defined(SWIGTCL)
2383 %rename("repr") __repr__;
2385 %newobject __repr__;
2386 const char *__repr__() {
2390 sprintf(buf, "<Repo #%d ", $self->repoid);
2391 return solv_dupjoin(buf, $self->name, ">");
2393 sprintf(buf, "<Repo #%d>", $self->repoid);
2394 return solv_strdup(buf);
2398 %extend Dataiterator {
2399 static const int SEARCH_STRING = SEARCH_STRING;
2400 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
2401 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
2402 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
2403 static const int SEARCH_GLOB = SEARCH_GLOB;
2404 static const int SEARCH_REGEX = SEARCH_REGEX;
2405 static const int SEARCH_NOCASE = SEARCH_NOCASE;
2406 static const int SEARCH_FILES = SEARCH_FILES;
2407 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
2408 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
2410 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
2411 Dataiterator *di = solv_calloc(1, sizeof(*di));
2412 dataiterator_init(di, pool, repo, p, key, match, flags);
2416 dataiterator_free($self);
2419 #if defined(SWIGPYTHON)
2421 def __iter__(self): return self
2424 %rename("next") __next__();
2426 %exception __next__ {
2429 PyErr_SetString(PyExc_StopIteration,"no more matches");
2435 perliter(solv::Dataiterator)
2437 %newobject __next__;
2438 Datamatch *__next__() {
2440 if (!dataiterator_step($self)) {
2443 ndi = solv_calloc(1, sizeof(*ndi));
2444 dataiterator_init_clone(ndi, $self);
2445 dataiterator_strdup(ndi);
2451 while ((d = Dataiterator___next__($self)) != 0) {
2452 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
2456 void prepend_keyname(Id key) {
2457 dataiterator_prepend_keyname($self, key);
2459 void skip_solvable() {
2460 dataiterator_skip_solvable($self);
2465 Id lookup_id(Id keyname) {
2466 Pool *pool = $self->repo->pool;
2467 Datapos oldpos = pool->pos;
2470 r = pool_lookup_id(pool, SOLVID_POS, keyname);
2474 const char *lookup_str(Id keyname) {
2475 Pool *pool = $self->repo->pool;
2476 Datapos oldpos = pool->pos;
2479 r = pool_lookup_str(pool, SOLVID_POS, keyname);
2483 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2484 Pool *pool = $self->repo->pool;
2485 Datapos oldpos = pool->pos;
2486 unsigned long long r;
2488 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
2492 bool lookup_void(Id keyname) {
2493 Pool *pool = $self->repo->pool;
2494 Datapos oldpos = pool->pos;
2497 r = pool_lookup_void(pool, SOLVID_POS, keyname);
2501 %newobject lookup_checksum;
2502 Chksum *lookup_checksum(Id keyname) {
2503 Pool *pool = $self->repo->pool;
2504 Datapos oldpos = pool->pos;
2506 const unsigned char *b;
2508 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
2510 return solv_chksum_create_from_bin(type, b);
2512 const char *lookup_deltaseq() {
2513 Pool *pool = $self->repo->pool;
2514 Datapos oldpos = pool->pos;
2517 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
2519 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
2520 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
2525 const char *lookup_deltalocation(unsigned int *OUTPUT) {
2526 Pool *pool = $self->repo->pool;
2527 Datapos oldpos = pool->pos;
2530 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
2534 Queue lookup_idarray(Id keyname) {
2535 Pool *pool = $self->repo->pool;
2536 Datapos oldpos = pool->pos;
2540 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
2544 %newobject Dataiterator;
2545 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2546 Pool *pool = $self->repo->pool;
2547 Datapos oldpos = pool->pos;
2550 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
2558 dataiterator_free($self);
2561 %newobject solvable;
2562 XSolvable * const solvable;
2564 const char * const key_idstr;
2566 const char * const type_idstr;
2568 const char * const idstr;
2569 const char * const str;
2570 BinaryBlob const binary;
2571 unsigned long long const num;
2572 unsigned int const num2;
2574 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
2575 return new_XSolvable(di->pool, di->solvid);
2577 SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
2578 return di->key->name;
2580 SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
2581 return pool_id2str(di->pool, di->key->name);
2583 SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
2584 return di->key->type;
2586 SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
2587 return pool_id2str(di->pool, di->key->type);
2589 SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
2592 SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
2593 if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
2594 return repodata_dir2str(di->data, di->kv.id, 0);
2595 if (di->data && di->data->localpool)
2596 return stringpool_id2str(&di->data->spool, di->kv.id);
2597 return pool_id2str(di->pool, di->kv.id);
2599 SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
2602 SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
2606 if (di->key->type == REPOKEY_TYPE_BINARY)
2608 bl.data = di->kv.str;
2609 bl.len = di->kv.num;
2611 else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
2612 bl.data = di->kv.str;
2615 SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
2616 if (di->key->type == REPOKEY_TYPE_NUM)
2617 return SOLV_KV_NUM64(&di->kv);
2620 SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
2626 Pool *pool = $self->pool;
2627 Datapos *pos, oldpos = pool->pos;
2628 dataiterator_setpos($self);
2629 pos = solv_calloc(1, sizeof(*pos));
2634 %newobject parentpos;
2635 Datapos *parentpos() {
2636 Pool *pool = $self->pool;
2637 Datapos *pos, oldpos = pool->pos;
2638 dataiterator_setpos_parent($self);
2639 pos = solv_calloc(1, sizeof(*pos));
2644 #if defined(SWIGPERL)
2645 /* cannot use str here because swig reports a bogus conflict... */
2646 %rename("stringify") __str__;
2648 *solv::Datamatch::str = *solvc::Datamatch_stringify;
2651 #if defined(SWIGTCL)
2652 %rename("stringify") __str__;
2654 const char *__str__() {
2655 KeyValue kv = $self->kv;
2656 const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
2657 return str ? str : "";
2661 %extend Pool_solvable_iterator {
2662 Pool_solvable_iterator(Pool *pool) {
2663 Pool_solvable_iterator *s;
2664 s = solv_calloc(1, sizeof(*s));
2668 #if defined(SWIGPYTHON)
2670 def __iter__(self): return self
2673 %rename("next") __next__();
2675 %exception __next__ {
2678 PyErr_SetString(PyExc_StopIteration,"no more matches");
2684 perliter(solv::Pool_solvable_iterator)
2686 %newobject __next__;
2687 XSolvable *__next__() {
2688 Pool *pool = $self->pool;
2689 if ($self->id >= pool->nsolvables)
2691 while (++$self->id < pool->nsolvables)
2692 if (pool->solvables[$self->id].repo)
2693 return new_XSolvable(pool, $self->id);
2699 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2700 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2704 %newobject __getitem__;
2705 XSolvable *__getitem__(Id key) {
2706 Pool *pool = $self->pool;
2707 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2708 return new_XSolvable(pool, key);
2712 return $self->pool->nsolvables;
2716 %extend Pool_repo_iterator {
2717 Pool_repo_iterator(Pool *pool) {
2718 Pool_repo_iterator *s;
2719 s = solv_calloc(1, sizeof(*s));
2723 #if defined(SWIGPYTHON)
2725 def __iter__(self): return self
2728 %rename("next") __next__();
2730 %exception __next__ {
2733 PyErr_SetString(PyExc_StopIteration,"no more matches");
2739 perliter(solv::Pool_repo_iterator)
2742 Pool *pool = $self->pool;
2743 if ($self->id >= pool->nrepos)
2745 while (++$self->id < pool->nrepos) {
2746 Repo *r = pool_id2repo(pool, $self->id);
2755 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2756 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, 0 | 0));
2760 Repo *__getitem__(Id key) {
2761 Pool *pool = $self->pool;
2762 if (key > 0 && key < pool->nrepos)
2763 return pool_id2repo(pool, key);
2767 return $self->pool->nrepos;
2771 %extend Repo_solvable_iterator {
2772 Repo_solvable_iterator(Repo *repo) {
2773 Repo_solvable_iterator *s;
2774 s = solv_calloc(1, sizeof(*s));
2778 #if defined(SWIGPYTHON)
2780 def __iter__(self): return self
2783 %rename("next") __next__();
2785 %exception __next__ {
2788 PyErr_SetString(PyExc_StopIteration,"no more matches");
2794 perliter(solv::Repo_solvable_iterator)
2796 %newobject __next__;
2797 XSolvable *__next__() {
2798 Repo *repo = $self->repo;
2799 Pool *pool = repo->pool;
2800 if (repo->start > 0 && $self->id < repo->start)
2801 $self->id = repo->start - 1;
2802 if ($self->id >= repo->end)
2804 while (++$self->id < repo->end)
2805 if (pool->solvables[$self->id].repo == repo)
2806 return new_XSolvable(pool, $self->id);
2812 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2813 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2817 %newobject __getitem__;
2818 XSolvable *__getitem__(Id key) {
2819 Repo *repo = $self->repo;
2820 Pool *pool = repo->pool;
2821 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2822 return new_XSolvable(pool, key);
2826 return $self->repo->pool->nsolvables;
2831 Dep(Pool *pool, Id id) {
2835 s = solv_calloc(1, sizeof(*s));
2841 Dep *Rel(int flags, DepId evrid, bool create=1) {
2842 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2845 return new_Dep($self->pool, id);
2847 %newobject Selection_name;
2848 Selection *Selection_name(int setflags=0) {
2849 Selection *sel = new_Selection($self->pool);
2850 if (ISRELDEP($self->id)) {
2851 Reldep *rd = GETRELDEP($self->pool, $self->id);
2852 if (rd->flags == REL_EQ) {
2853 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2854 if (ISRELDEP(rd->name))
2855 rd = GETRELDEP($self->pool, rd->name);
2857 if (rd->flags == REL_ARCH)
2858 setflags |= SOLVER_SETARCH;
2860 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2863 %newobject Selection_provides;
2864 Selection *Selection_provides(int setflags=0) {
2865 Selection *sel = new_Selection($self->pool);
2866 if (ISRELDEP($self->id)) {
2867 Reldep *rd = GETRELDEP($self->pool, $self->id);
2868 if (rd->flags == REL_ARCH)
2869 setflags |= SOLVER_SETARCH;
2871 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2875 return pool_dep2str($self->pool, $self->id);
2877 #if defined(SWIGTCL)
2878 %rename("==") __eq__;
2880 bool __eq__(Dep *s) {
2881 return $self->pool == s->pool && $self->id == s->id;
2883 #if defined(SWIGTCL)
2884 %rename("!=") __ne__;
2886 bool __ne__(Dep *s) {
2887 return !Dep___eq__($self, s);
2889 #if defined(SWIGPYTHON)
2894 #if defined(SWIGPERL) || defined(SWIGTCL)
2895 %rename("str") __str__;
2897 const char *__str__() {
2898 return pool_dep2str($self->pool, $self->id);
2900 #if defined(SWIGPERL) || defined(SWIGTCL)
2901 %rename("repr") __repr__;
2903 %newobject __repr__;
2904 const char *__repr__() {
2906 sprintf(buf, "<Id #%d ", $self->id);
2907 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2912 XSolvable(Pool *pool, Id id) {
2914 if (!id || id >= pool->nsolvables)
2916 s = solv_calloc(1, sizeof(*s));
2922 return pool_solvid2str($self->pool, $self->id);
2924 const char *lookup_str(Id keyname) {
2925 return pool_lookup_str($self->pool, $self->id, keyname);
2927 Id lookup_id(Id keyname) {
2928 return pool_lookup_id($self->pool, $self->id, keyname);
2930 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2931 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2933 bool lookup_void(Id keyname) {
2934 return pool_lookup_void($self->pool, $self->id, keyname);
2936 %newobject lookup_checksum;
2937 Chksum *lookup_checksum(Id keyname) {
2939 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2940 return solv_chksum_create_from_bin(type, b);
2942 Queue lookup_idarray(Id keyname, Id marker = -1) {
2943 Solvable *s = $self->pool->solvables + $self->id;
2946 solvable_lookup_deparray(s, keyname, &r, marker);
2949 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2950 %newobject lookup_deparray;
2951 Queue lookup_deparray(Id keyname, Id marker = -1) {
2952 Solvable *s = $self->pool->solvables + $self->id;
2955 solvable_lookup_deparray(s, keyname, &r, marker);
2958 const char *lookup_location(unsigned int *OUTPUT) {
2959 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2961 const char *lookup_sourcepkg() {
2962 return solvable_lookup_sourcepkg($self->pool->solvables + $self->id);
2964 %newobject Dataiterator;
2965 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2966 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2969 %rename("installable?") installable;
2971 bool installable() {
2972 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2975 %rename("isinstalled?") isinstalled;
2977 bool isinstalled() {
2978 Pool *pool = $self->pool;
2979 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2984 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2985 Pool *pool = xs->pool;
2986 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2988 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2989 Pool *pool = xs->pool;
2990 return pool_id2str(pool, pool->solvables[xs->id].name);
2995 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2996 xs->pool->solvables[xs->id].name = nameid;
2998 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2999 return xs->pool->solvables[xs->id].name;
3004 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
3005 Pool *pool = xs->pool;
3006 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
3008 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
3009 Pool *pool = xs->pool;
3010 return pool_id2str(pool, pool->solvables[xs->id].evr);
3015 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
3016 xs->pool->solvables[xs->id].evr = evrid;
3018 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
3019 return xs->pool->solvables[xs->id].evr;
3024 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
3025 Pool *pool = xs->pool;
3026 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
3028 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
3029 Pool *pool = xs->pool;
3030 return pool_id2str(pool, pool->solvables[xs->id].arch);
3035 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
3036 xs->pool->solvables[xs->id].arch = archid;
3038 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
3039 return xs->pool->solvables[xs->id].arch;
3044 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
3045 Pool *pool = xs->pool;
3046 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
3048 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
3049 Pool *pool = xs->pool;
3050 return pool_id2str(pool, pool->solvables[xs->id].vendor);
3055 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
3056 xs->pool->solvables[xs->id].vendor = vendorid;
3058 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
3059 return xs->pool->solvables[xs->id].vendor;
3064 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
3065 return xs->pool->solvables[xs->id].repo;
3069 /* old interface, please use the generic add_deparray instead */
3070 void add_provides(DepId id, Id marker = -1) {
3071 Solvable *s = $self->pool->solvables + $self->id;
3072 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
3073 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
3075 void add_obsoletes(DepId id) {
3076 Solvable *s = $self->pool->solvables + $self->id;
3077 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
3079 void add_conflicts(DepId id) {
3080 Solvable *s = $self->pool->solvables + $self->id;
3081 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
3083 void add_requires(DepId id, Id marker = -1) {
3084 Solvable *s = $self->pool->solvables + $self->id;
3085 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
3086 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
3088 void add_recommends(DepId id) {
3089 Solvable *s = $self->pool->solvables + $self->id;
3090 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
3092 void add_suggests(DepId id) {
3093 Solvable *s = $self->pool->solvables + $self->id;
3094 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
3096 void add_supplements(DepId id) {
3097 Solvable *s = $self->pool->solvables + $self->id;
3098 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
3100 void add_enhances(DepId id) {
3101 Solvable *s = $self->pool->solvables + $self->id;
3102 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
3105 void unset(Id keyname) {
3106 Solvable *s = $self->pool->solvables + $self->id;
3107 repo_unset(s->repo, $self->id, keyname);
3110 void add_deparray(Id keyname, DepId id, Id marker = -1) {
3111 Solvable *s = $self->pool->solvables + $self->id;
3112 solvable_add_deparray(s, keyname, id, marker);
3115 %newobject Selection;
3116 Selection *Selection(int setflags=0) {
3117 Selection *sel = new_Selection($self->pool);
3118 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
3123 %rename("identical?") identical;
3125 bool identical(XSolvable *s2) {
3126 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
3128 int evrcmp(XSolvable *s2) {
3129 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
3132 %rename("matchesdep?") matchesdep;
3134 bool matchesdep(Id keyname, DepId id, Id marker = -1) {
3135 return solvable_matchesdep($self->pool->solvables + $self->id, keyname, id, marker);
3138 #if defined(SWIGTCL)
3139 %rename("==") __eq__;
3141 bool __eq__(XSolvable *s) {
3142 return $self->pool == s->pool && $self->id == s->id;
3144 #if defined(SWIGTCL)
3145 %rename("!=") __ne__;
3147 bool __ne__(XSolvable *s) {
3148 return !XSolvable___eq__($self, s);
3150 #if defined(SWIGPYTHON)
3155 #if defined(SWIGPERL) || defined(SWIGTCL)
3156 %rename("str") __str__;
3158 const char *__str__() {
3159 return pool_solvid2str($self->pool, $self->id);
3161 #if defined(SWIGPERL) || defined(SWIGTCL)
3162 %rename("repr") __repr__;
3164 %newobject __repr__;
3165 const char *__repr__() {
3167 sprintf(buf, "<Solvable #%d ", $self->id);
3168 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
3173 Problem(Solver *solv, Id id) {
3175 p = solv_calloc(1, sizeof(*p));
3180 %newobject findproblemrule;
3181 XRule *findproblemrule() {
3182 Id r = solver_findproblemrule($self->solv, $self->id);
3183 return new_XRule($self->solv, r);
3185 %newobject findallproblemrules;
3186 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
3187 Queue findallproblemrules(int unfiltered=0) {
3188 Solver *solv = $self->solv;
3193 solver_findallproblemrules(solv, $self->id, &q);
3196 for (i = j = 0; i < q.count; i++)
3198 SolverRuleinfo rclass;
3199 probr = q.elements[i];
3200 rclass = solver_ruleclass(solv, probr);
3201 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
3203 q.elements[j++] = probr;
3206 queue_truncate(&q, j);
3210 int solution_count() {
3211 return solver_solution_count($self->solv, $self->id);
3213 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
3214 %newobject solutions;
3219 cnt = solver_solution_count($self->solv, $self->id);
3220 for (i = 1; i <= cnt; i++)
3224 #if defined(SWIGPERL) || defined(SWIGTCL)
3225 %rename("str") __str__;
3227 const char *__str__() {
3228 return solver_problem2str($self->solv, $self->id);
3233 Solution(Problem *p, Id id) {
3235 s = solv_calloc(1, sizeof(*s));
3237 s->problemid = p->id;
3241 int element_count() {
3242 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3245 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
3246 %newobject elements;
3247 Queue elements(bool expandreplaces=0) {
3251 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3252 for (i = 1; i <= cnt; i++)
3255 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
3257 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
3263 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
3264 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
3266 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
3267 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3268 queue_push2(&q, p, rp);
3270 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
3271 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3272 queue_push2(&q, p, rp);
3274 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
3275 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3276 queue_push2(&q, p, rp);
3278 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
3279 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3280 queue_push2(&q, p, rp);
3285 queue_push2(&q, i, type);
3286 queue_push2(&q, p, rp);
3292 %extend Solutionelement {
3293 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
3295 e = solv_calloc(1, sizeof(*e));
3297 e->problemid = problemid;
3309 if (p == SOLVER_SOLUTION_ERASE)
3314 else if (p == SOLVER_SOLUTION_REPLACE)
3319 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
3320 illegal = POLICY_ILLEGAL_DOWNGRADE;
3321 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
3322 illegal = POLICY_ILLEGAL_ARCHCHANGE;
3323 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
3324 illegal = POLICY_ILLEGAL_VENDORCHANGE;
3325 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
3326 illegal = POLICY_ILLEGAL_NAMECHANGE;
3328 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);
3329 return solver_solutionelement2str($self->solv, p, rp);
3331 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
3332 %newobject replaceelements;
3333 Queue replaceelements() {
3338 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3341 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3342 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
3343 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3344 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
3345 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3346 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
3347 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3348 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
3349 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3351 queue_push(&q, $self->type);
3354 int illegalreplace() {
3355 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3357 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3359 %newobject solvable;
3360 XSolvable * const solvable;
3361 %newobject replacement;
3362 XSolvable * const replacement;
3365 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
3366 return new_XSolvable(e->solv->pool, e->p);
3368 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
3369 return new_XSolvable(e->solv->pool, e->rp);
3371 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
3372 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
3374 return (e->p - 1) / 2;
3379 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
3380 if ($self->type == SOLVER_SOLUTION_JOB || $self->type == SOLVER_SOLUTION_POOLJOB)
3381 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
3382 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
3383 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
3384 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)
3385 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
3386 if ($self->type == SOLVER_SOLUTION_ERASE)
3387 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
3393 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
3394 static const int SOLVER_RULE_PKG = SOLVER_RULE_PKG;
3395 static const int SOLVER_RULE_PKG_NOT_INSTALLABLE = SOLVER_RULE_PKG_NOT_INSTALLABLE;
3396 static const int SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP = SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP;
3397 static const int SOLVER_RULE_PKG_REQUIRES = SOLVER_RULE_PKG_REQUIRES;
3398 static const int SOLVER_RULE_PKG_SELF_CONFLICT = SOLVER_RULE_PKG_SELF_CONFLICT;
3399 static const int SOLVER_RULE_PKG_CONFLICTS = SOLVER_RULE_PKG_CONFLICTS;
3400 static const int SOLVER_RULE_PKG_SAME_NAME = SOLVER_RULE_PKG_SAME_NAME;
3401 static const int SOLVER_RULE_PKG_OBSOLETES = SOLVER_RULE_PKG_OBSOLETES;
3402 static const int SOLVER_RULE_PKG_IMPLICIT_OBSOLETES = SOLVER_RULE_PKG_IMPLICIT_OBSOLETES;
3403 static const int SOLVER_RULE_PKG_INSTALLED_OBSOLETES = SOLVER_RULE_PKG_INSTALLED_OBSOLETES;
3404 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
3405 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
3406 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
3407 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
3408 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
3409 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
3410 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
3411 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
3412 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
3413 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
3414 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
3416 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
3417 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
3418 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
3419 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
3420 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
3421 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
3422 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
3423 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
3424 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
3425 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
3426 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
3428 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
3429 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
3430 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
3431 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
3433 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
3434 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
3435 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
3436 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
3437 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
3438 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
3439 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
3440 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
3441 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
3442 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
3443 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
3444 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
3445 static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
3446 static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
3447 static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
3448 static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
3449 static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
3450 static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
3451 static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
3452 static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
3453 static const int SOLVER_FLAG_NEED_UPDATEPROVIDE = SOLVER_FLAG_NEED_UPDATEPROVIDE;
3454 static const int SOLVER_FLAG_FOCUS_BEST = SOLVER_FLAG_FOCUS_BEST;
3455 static const int SOLVER_FLAG_STRONG_RECOMMENDS = SOLVER_FLAG_STRONG_RECOMMENDS;
3456 static const int SOLVER_FLAG_INSTALL_ALSO_UPDATES = SOLVER_FLAG_INSTALL_ALSO_UPDATES;
3457 static const int SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED = SOLVER_FLAG_ONLY_NAMESPACE_RECOMMENDED;
3459 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
3460 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
3461 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
3462 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
3463 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
3464 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
3465 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
3466 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
3467 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
3468 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
3469 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
3472 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
3478 int set_flag(int flag, int value) {
3479 return solver_set_flag($self, flag, value);
3481 int get_flag(int flag) {
3482 return solver_get_flag($self, flag);
3485 %typemap(out) Queue solve Queue2Array(Problem *, 1, new_Problem(arg1, id));
3487 Queue solve(Queue solvejobs) {
3491 solver_solve($self, &solvejobs);
3492 cnt = solver_problem_count($self);
3493 for (i = 1; i <= cnt; i++)
3498 %newobject transaction;
3499 Transaction *transaction() {
3500 return solver_create_transaction($self);
3503 int describe_decision(XSolvable *s, XRule **OUTPUT) {
3505 int reason = solver_describe_decision($self, s->id, &ruleid);
3506 *OUTPUT = new_XRule($self, ruleid);
3510 %newobject describe_weakdep_decision_raw;
3511 Queue describe_weakdep_decision_raw(XSolvable *s) {
3514 solver_describe_weakdep_decision($self, s->id, &q);
3517 #if defined(SWIGPYTHON)
3519 def describe_weakdep_decision(self, s):
3520 d = iter(self.describe_weakdep_decision_raw(s))
3521 return [ (t, XSolvable(self.pool, sid), Dep(self.pool, id)) for t, sid, id in zip(d, d, d) ]
3524 #if defined(SWIGPERL)
3526 sub solv::Solver::describe_weakdep_decision {
3527 my ($self, $s) = @_;
3528 my $pool = $self->{'pool'};
3530 my @d = $self->describe_weakdep_decision_raw($s);
3531 push @res, [ splice(@d, 0, 3) ] while @d;
3532 return map { [ $_->[0], solv::XSolvable->new($pool, $_->[1]), solv::Dep->new($pool, $_->[2]) ] } @res;
3536 #if defined(SWIGRUBY)
3539 "class Solv::Solver\n"
3540 " def describe_weakdep_decision(s)\n"
3541 " 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"
3548 int alternatives_count() {
3549 return solver_alternatives_count($self);
3552 %newobject alternative;
3553 Alternative *alternative(Id aid) {
3554 Alternative *a = solv_calloc(1, sizeof(*a));
3556 queue_init(&a->choices);
3557 a->type = solver_get_alternative($self, aid, &a->dep_id, &a->from_id, &a->chosen_id, &a->choices, &a->level);
3559 queue_free(&a->choices);
3563 if (a->type == SOLVER_ALTERNATIVE_TYPE_RULE) {
3570 %typemap(out) Queue all_alternatives Queue2Array(Alternative *, 1, Solver_alternative(arg1, id));
3571 %newobject all_alternatives;
3572 Queue all_alternatives() {
3576 cnt = solver_alternatives_count($self);
3577 for (i = 1; i <= cnt; i++)
3582 bool write_testcase(const char *dir) {
3583 return testcase_write($self, dir, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0);
3586 Queue raw_decisions(int filter=0) {
3589 solver_get_decisionqueue($self, &q);
3592 for (i = j = 0; i < q.count; i++)
3593 if ((filter > 0 && q.elements[i] > 1) ||
3594 (filter < 0 && q.elements[i] < 0))
3595 q.elements[j++] = q.elements[i];
3596 queue_truncate(&q, j);
3601 %typemap(out) Queue get_recommended Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3602 %newobject get_recommended;
3603 Queue get_recommended(bool noselected=0) {
3606 solver_get_recommendations($self, &q, NULL, noselected);
3609 %typemap(out) Queue get_suggested Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3610 %newobject get_suggested;
3611 Queue get_suggested(bool noselected=0) {
3614 solver_get_recommendations($self, NULL, &q, noselected);
3619 %extend Transaction {
3620 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
3621 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
3622 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
3623 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
3624 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
3625 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
3626 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
3627 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
3628 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
3629 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
3630 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
3631 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
3632 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
3633 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
3634 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
3635 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
3636 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
3637 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
3638 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
3639 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
3640 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
3641 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
3642 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
3643 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
3644 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
3645 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
3646 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
3647 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
3649 transaction_free($self);
3652 %rename("isempty?") isempty;
3655 return $self->steps.count == 0;
3658 %newobject othersolvable;
3659 XSolvable *othersolvable(XSolvable *s) {
3660 Id op = transaction_obs_pkg($self, s->id);
3661 return new_XSolvable($self->pool, op);
3664 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3665 %newobject allothersolvables;
3666 Queue allothersolvables(XSolvable *s) {
3669 transaction_all_obs_pkgs($self, s->id, &q);
3673 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
3674 %newobject classify;
3675 Queue classify(int mode = 0) {
3678 transaction_classify($self, mode, &q);
3682 /* deprecated, use newsolvables instead */
3683 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3684 %newobject newpackages;
3685 Queue newpackages() {
3689 cut = transaction_installedresult(self, &q);
3690 queue_truncate(&q, cut);
3694 /* deprecated, use keptsolvables instead */
3695 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3696 %newobject keptpackages;
3697 Queue keptpackages() {
3701 cut = transaction_installedresult(self, &q);
3703 queue_deleten(&q, 0, cut);
3707 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3708 %newobject newsolvables;
3709 Queue newsolvables() {
3713 cut = transaction_installedresult(self, &q);
3714 queue_truncate(&q, cut);
3718 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3719 %newobject keptsolvables;
3720 Queue keptsolvables() {
3724 cut = transaction_installedresult(self, &q);
3726 queue_deleten(&q, 0, cut);
3730 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3734 queue_init_clone(&q, &$self->steps);
3738 int steptype(XSolvable *s, int mode) {
3739 return transaction_type($self, s->id, mode);
3741 long long calc_installsizechange() {
3742 return transaction_calc_installsizechange($self);
3744 void order(int flags=0) {
3745 transaction_order($self, flags);
3749 %extend TransactionClass {
3750 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
3751 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
3752 cl->transaction = trans;
3756 cl->fromid = fromid;
3760 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
3761 %newobject solvables;
3765 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
3768 const char * const fromstr;
3769 const char * const tostr;
3771 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
3772 return pool_id2str(cl->transaction->pool, cl->fromid);
3774 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
3775 return pool_id2str(cl->transaction->pool, cl->toid);
3781 XRule(Solver *solv, Id id) {
3784 XRule *xr = solv_calloc(1, sizeof(*xr));
3791 SWIGINTERN int XRule_type_get(XRule *xr) {
3792 return solver_ruleclass(xr->solv, xr->id);
3797 Id type, source, target, dep;
3798 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
3799 return new_Ruleinfo($self, type, source, target, dep);
3801 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
3802 %newobject allinfos;
3806 solver_allruleinfos($self->solv, $self->id, &q);
3810 #if defined(SWIGTCL)
3811 %rename("==") __eq__;
3813 bool __eq__(XRule *xr) {
3814 return $self->solv == xr->solv && $self->id == xr->id;
3816 #if defined(SWIGTCL)
3817 %rename("!=") __ne__;
3819 bool __ne__(XRule *xr) {
3820 return !XRule___eq__($self, xr);
3822 #if defined(SWIGPYTHON)
3827 #if defined(SWIGPERL) || defined(SWIGTCL)
3828 %rename("repr") __repr__;
3830 %newobject __repr__;
3831 const char *__repr__() {
3833 sprintf(buf, "<Rule #%d>", $self->id);
3834 return solv_strdup(buf);
3839 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3840 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3844 ri->source = source;
3845 ri->target = target;
3846 ri->dep_id = dep_id;
3849 %newobject solvable;
3850 XSolvable * const solvable;
3851 %newobject othersolvable;
3852 XSolvable * const othersolvable;
3856 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3857 return new_XSolvable(ri->solv->pool, ri->source);
3859 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3860 return new_XSolvable(ri->solv->pool, ri->target);
3862 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3863 return new_Dep(ri->solv->pool, ri->dep_id);
3866 const char *problemstr() {
3867 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3872 XRepodata(Repo *repo, Id id) {
3873 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3879 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3881 void set_id(Id solvid, Id keyname, DepId id) {
3882 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3884 void set_num(Id solvid, Id keyname, unsigned long long num) {
3885 repodata_set_num(repo_id2repodata($self->repo, $self->id), solvid, keyname, num);
3887 void set_str(Id solvid, Id keyname, const char *str) {
3888 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3890 void set_void(Id solvid, Id keyname) {
3891 repodata_set_void(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3893 void set_poolstr(Id solvid, Id keyname, const char *str) {
3894 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3896 void add_idarray(Id solvid, Id keyname, DepId id) {
3897 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3899 void add_flexarray(Id solvid, Id keyname, Id handle) {
3900 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3902 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3903 const unsigned char *buf = solv_chksum_get(chksum, 0);
3905 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3907 void set_sourcepkg(Id solvid, const char *sourcepkg) {
3908 repodata_set_sourcepkg(repo_id2repodata($self->repo, $self->id), solvid, sourcepkg);
3910 void set_location(Id solvid, unsigned int mediano, const char *location) {
3911 repodata_set_location(repo_id2repodata($self->repo, $self->id), solvid, mediano, 0, location);
3913 void unset(Id solvid, Id keyname) {
3914 repodata_unset(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3916 const char *lookup_str(Id solvid, Id keyname) {
3917 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3919 Id lookup_id(Id solvid, Id keyname) {
3920 return repodata_lookup_id(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3922 unsigned long long lookup_num(Id solvid, Id keyname, unsigned long long notfound = 0) {
3923 return repodata_lookup_num(repo_id2repodata($self->repo, $self->id), solvid, keyname, notfound);
3925 bool lookup_void(Id solvid, Id keyname) {
3926 return repodata_lookup_void(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3928 Queue lookup_idarray(Id solvid, Id keyname) {
3931 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3934 %newobject lookup_checksum;
3935 Chksum *lookup_checksum(Id solvid, Id keyname) {
3937 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3938 return solv_chksum_create_from_bin(type, b);
3940 void internalize() {
3941 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3943 void create_stubs() {
3944 Repodata *data = repo_id2repodata($self->repo, $self->id);
3945 data = repodata_create_stubs(data);
3946 $self->id = data->repodataid;
3948 bool write(FILE *fp) {
3949 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3951 Id str2dir(const char *dir, bool create=1) {
3952 Repodata *data = repo_id2repodata($self->repo, $self->id);
3953 return repodata_str2dir(data, dir, create);
3955 const char *dir2str(Id did, const char *suf = 0) {
3956 Repodata *data = repo_id2repodata($self->repo, $self->id);
3957 return repodata_dir2str(data, did, suf);
3959 void add_dirstr(Id solvid, Id keyname, Id dir, const char *str) {
3960 Repodata *data = repo_id2repodata($self->repo, $self->id);
3961 repodata_add_dirstr(data, solvid, keyname, dir, str);
3963 bool add_solv(FILE *fp, int flags = 0) {
3964 Repodata *data = repo_id2repodata($self->repo, $self->id);
3965 int r, oldstate = data->state;
3966 data->state = REPODATA_LOADING;
3967 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3968 if (r || data->state == REPODATA_LOADING)
3969 data->state = oldstate;
3972 void extend_to_repo() {
3973 Repodata *data = repo_id2repodata($self->repo, $self->id);
3974 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3976 #if defined(SWIGTCL)
3977 %rename("==") __eq__;
3979 bool __eq__(XRepodata *xr) {
3980 return $self->repo == xr->repo && $self->id == xr->id;
3982 #if defined(SWIGTCL)
3983 %rename("!=") __ne__;
3985 bool __ne__(XRepodata *xr) {
3986 return !XRepodata___eq__($self, xr);
3988 #if defined(SWIGPYTHON)
3993 #if defined(SWIGPERL) || defined(SWIGTCL)
3994 %rename("repr") __repr__;
3996 %newobject __repr__;
3997 const char *__repr__() {
3999 sprintf(buf, "<Repodata #%d>", $self->id);
4000 return solv_strdup(buf);
4004 #ifdef ENABLE_PUBKEY
4007 return solvsig_create(fp);
4010 solvsig_free($self);
4014 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
4016 #ifdef ENABLE_PGPVRFY
4018 XSolvable *verify(Repo *repo, Chksum *chksum) {
4019 Id p = solvsig_verify($self, repo, chksum);
4020 return new_XSolvable(repo->pool, p);
4026 %extend Alternative {
4027 static const int SOLVER_ALTERNATIVE_TYPE_RULE = SOLVER_ALTERNATIVE_TYPE_RULE;
4028 static const int SOLVER_ALTERNATIVE_TYPE_RECOMMENDS = SOLVER_ALTERNATIVE_TYPE_RECOMMENDS;
4029 static const int SOLVER_ALTERNATIVE_TYPE_SUGGESTS = SOLVER_ALTERNATIVE_TYPE_SUGGESTS;
4032 queue_free(&$self->choices);
4036 XSolvable * const chosen;
4039 %newobject depsolvable;
4040 XSolvable * const depsolvable;
4044 SWIGINTERN XSolvable *Alternative_chosen_get(Alternative *a) {
4045 return new_XSolvable(a->solv->pool, a->chosen_id);
4047 SWIGINTERN XRule *Alternative_rule_get(Alternative *a) {
4048 return new_XRule(a->solv, a->rid);
4050 SWIGINTERN XSolvable *Alternative_depsolvable_get(Alternative *a) {
4051 return new_XSolvable(a->solv->pool, a->from_id);
4053 SWIGINTERN Dep *Alternative_dep_get(Alternative *a) {
4054 return new_Dep(a->solv->pool, a->dep_id);
4058 Queue choices_raw() {
4060 queue_init_clone(&r, &$self->choices);
4064 %typemap(out) Queue choices Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
4068 queue_init_clone(&r, &$self->choices);
4069 for (i = 0; i < r.count; i++)
4070 if (r.elements[i] < 0)
4071 r.elements[i] = -r.elements[i];
4075 #if defined(SWIGPERL) || defined(SWIGTCL)
4076 %rename("str") __str__;
4078 const char *__str__() {
4079 return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
4083 #if defined(SWIGTCL)
4086 "proc solv::iter {varname iter body} {\n"\
4088 " set value [$iter __next__]\n"\
4089 " if {$value eq \"NULL\"} { break }\n"\
4090 " uplevel [list set $varname $value]\n"\
4091 " set code [catch {uplevel $body} result]\n"\
4092 " switch -exact -- $code {\n"\
4096 " default { return -code $code $result }\n"\