2 * WARNING: for perl iterator/array support you need to run
3 * sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
4 * on the generated c code
10 %markfunc Pool "mark_Pool";
14 ** binaryblob handling
24 %typemap(in,noblock=1,fragment="SWIG_AsCharPtrAndSize") (const unsigned char *str, size_t len) (int res, char *buf = 0, size_t size = 0, int alloc = 0) {
30 ba = Tcl_GetByteArrayFromObj($input, &bal);
39 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
43 if (!SWIG_IsOK(res)) {
44 #if defined(SWIGPYTHON)
45 const void *pybuf = 0;
46 Py_ssize_t pysize = 0;
47 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
49 %argument_fail(res, "BinaryBlob", $symname, $argnum);
55 %argument_fail(res, "const char *", $symname, $argnum);
58 $1 = (unsigned char *)buf;
62 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
63 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
66 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
67 #if defined(SWIGPYTHON) && defined(PYTHON3)
68 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
69 #elif defined(SWIGTCL)
70 Tcl_SetObjResult(interp, $1.data ? Tcl_NewByteArrayObj($1.data, $1.len) : NULL);
72 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
83 %typemap(arginit) Queue {
86 %typemap(freearg) Queue {
90 #if defined(SWIGPYTHON)
92 /* Check if is a list */
93 if (PyList_Check($input)) {
94 int size = PyList_Size($input);
96 for (i = 0; i < size; i++) {
97 PyObject *o = PyList_GetItem($input,i);
99 int e = SWIG_AsVal_int(o, &v);
101 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
105 SWIG_exception_fail(SWIG_TypeError, "list must contain only integers");
109 %typemap(out) Queue {
111 PyObject *o = PyList_New($1.count);
112 for (i = 0; i < $1.count; i++)
113 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
118 %define Queue2Array(type, step, con) %{
120 int cnt = $1.count / step;
121 Id *idp = $1.elements;
122 PyObject *o = PyList_New(cnt);
123 for (i = 0; i < cnt; i++, idp += step)
126 #define result resultx
129 PyList_SetItem(o, i, $result);
138 #endif /* SWIGPYTHON */
140 #if defined(SWIGPERL)
144 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
145 SWIG_croak("Argument $argnum is not an array reference.");
146 av = (AV*)SvRV($input);
148 for (i = 0; i <= size; i++) {
149 SV **sv = av_fetch(av, i, 0);
151 int e = SWIG_AsVal_int(*sv, &v);
153 SWIG_croak("list must contain only integers");
159 * av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
160 * $result = newRV_noinc((SV*)o); argvi++;
162 %typemap(out) Queue {
164 if (argvi + $1.count + 1 >= items) {
165 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
167 for (i = 0; i < $1.count; i++)
168 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
173 %define Queue2Array(type, step, con) %{
175 int cnt = $1.count / step;
176 Id *idp = $1.elements;
177 if (argvi + cnt + 1 >= items) {
178 EXTEND(sp, (argvi + cnt + 1) - items + 1);
180 for (i = 0; i < cnt; i++, idp += step)
183 #define result resultx
186 SvREFCNT_inc(ST(argvi - 1));
194 #endif /* SWIGPERL */
197 #if defined(SWIGRUBY)
201 ary = rb_Array($input);
202 size = RARRAY_LEN(ary);
205 for (i = 0; i < size; i++, o++) {
207 int e = SWIG_AsVal_int(*o, &v);
209 SWIG_exception_fail(SWIG_TypeError, "list must contain only integers");
213 %typemap(out) Queue {
215 VALUE o = rb_ary_new2($1.count);
216 for (i = 0; i < $1.count; i++)
217 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
221 %typemap(arginit) Queue {
224 %typemap(freearg) Queue {
227 %define Queue2Array(type, step, con) %{
229 int cnt = $1.count / step;
230 Id *idp = $1.elements;
231 VALUE o = rb_ary_new2(cnt);
232 for (i = 0; i < cnt; i++, idp += step)
235 #define result resultx
238 rb_ary_store(o, i, $result);
246 #endif /* SWIGRUBY */
250 /* Check if is a list */
254 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
255 SWIG_exception_fail(SWIG_TypeError, "argument is not a list");
256 for (i = 0; i < size; i++) {
260 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
261 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
262 e = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(o, &v);
264 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
269 %typemap(out) Queue {
270 Tcl_Obj *objvx[$1.count];
273 for (i = 0; i < $1.count; i++) {
274 objvx[i] = SWIG_From_int($1.elements[i]);
276 Tcl_SetObjResult(interp, Tcl_NewListObj($1.count, objvx));
280 %define Queue2Array(type, step, con) %{
281 { /* scope is needed to make the goto of SWIG_exception_fail work */
283 int cnt = $1.count / step;
284 Id *idp = $1.elements;
287 for (i = 0; i < cnt; i++, idp += step) {
289 #define result resultx
290 #define Tcl_SetObjResult(i, x) resultobj = x
294 objvx[i] = resultobj;
295 #undef Tcl_SetObjResult
299 Tcl_SetObjResult(interp, Tcl_NewListObj(cnt, objvx));
305 %typemap(in) Queue solvejobs {
306 /* Check if is a list */
310 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
311 SWIG_exception_fail(SWIG_TypeError, "argument is not a list");
312 for (i = 0; i < size; i++) {
318 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
319 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
320 e = SWIG_ConvertPtr(o, &jp ,SWIGTYPE_p_Job, 0 | 0 );
322 SWIG_exception_fail(SWIG_ArgError(e), "list member is not a Job");
324 queue_push2(&$1, j->how, j->what);
331 #if defined(SWIGPERL)
333 /* work around a swig bug for swig versions < 2.0.5 */
334 #if SWIG_VERSION < 0x020005
338 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
340 # ifndef MULTIPLICITY
341 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
343 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
350 %define perliter(class)
353 my $i = ${##class##::ITERATORS}{$_[0]};
355 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
357 $_[0]->__getitem__($_[1]);
360 sub class##::FETCHSIZE {
361 my $i = ${##class##::ITERATORS}{$_[0]};
363 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
373 #define SWIG_PERL_ITERATOR 0x80
375 SWIGRUNTIMEINLINE SV *
376 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
377 SV *result = sv_newmortal();
378 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
383 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
384 stash=SvSTASH(SvRV(obj));
385 if (flags & SWIG_POINTER_OWN) {
387 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
389 gv_init(gv, stash, "OWNER", 5, FALSE);
391 hv_store_ent(hv, obj, newSViv(1), 0);
393 if (flags & SWIG_PERL_ITERATOR) {
395 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
398 gv_init(gv, stash, "ITERATORS", 9, FALSE);
400 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
402 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
404 self=newRV_noinc((SV *)array);
405 sv_setsv(result, self);
406 SvREFCNT_dec((SV *)self);
407 sv_bless(result, stash);
409 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
416 %typemap(out) Perlarray {
417 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
419 %typemap(out) Perliterator {
420 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
423 %typemap(out) Pool_solvable_iterator * = Perlarray;
424 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
425 %typemap(out) Pool_repo_iterator * = Perlarray;
426 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
427 %typemap(out) Repo_solvable_iterator * = Perlarray;
428 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
429 %typemap(out) Dataiterator * = Perliterator;
431 #endif /* SWIGPERL */
438 #if defined(SWIGPYTHON)
439 typedef PyObject *AppObjectPtr;
440 %typemap(in) AppObjectPtr {
445 %typemap(out) AppObjectPtr {
446 $result = $1 ? $1 : Py_None;
449 #elif defined(SWIGPERL)
450 typedef SV *AppObjectPtr;
451 %typemap(in) AppObjectPtr {
454 sv_setsv((SV *)$1, $input);
458 %typemap(out) AppObjectPtr {
459 $result = sv_2mortal($1 ? SvREFCNT_inc($1) : newSV(0));
462 #elif defined(SWIGRUBY)
463 typedef VALUE AppObjectPtr;
464 %typemap(in) AppObjectPtr {
467 %typemap(out) AppObjectPtr {
470 #elif defined(SWIGTCL)
471 typedef Tcl_Obj *AppObjectPtr;
472 %typemap(in) AppObjectPtr {
474 Tcl_IncrRefCount($input);
477 %typemap(out) AppObjectPtr {
478 Tcl_SetObjResult(interp, $1 ? $1 : Tcl_NewObj());
481 #warning AppObjectPtr not defined for this language!
491 %fragment("SWIG_AsValFilePtr","header") {}
495 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
499 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
500 #elif defined(SWIGTCL)
501 SWIG_AsValSolvFpPtr SWIG_TCL_DECL_ARGS_2(void *obj, FILE **val) {
503 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
505 static swig_type_info* desc = 0;
509 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
510 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
512 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
516 ecode = SWIG_AsValFilePtr(obj, val);
517 if (ecode == SWIG_OK)
520 return SWIG_TypeError;
524 #define SWIG_AsValSolvFpPtr(x, y) SWIG_AsValSolvFpPtr SWIG_TCL_CALL_ARGS_2(x, y)
534 %fragment("SWIG_AsValDepId","header") {
538 SWIG_AsValDepId(VALUE obj, int *val) {
539 #elif defined(SWIGTCL)
540 SWIG_AsValDepId SWIG_TCL_DECL_ARGS_2(void *obj, int *val) {
542 SWIG_AsValDepId(void *obj, int *val) {
544 static swig_type_info* desc = 0;
547 if (!desc) desc = SWIG_TypeQuery("Dep *");
549 ecode = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(obj, val);
551 ecode = SWIG_AsVal_int(obj, val);
553 if (SWIG_IsOK(ecode))
555 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
557 *val = vptr ? ((Dep *)vptr)->id : 0;
560 return SWIG_TypeError;
564 #define SWIG_AsValDepId(x, y) SWIG_AsValDepId SWIG_TCL_CALL_ARGS_2(x, y)
569 ** Pool disown helper
572 %typemap(out) disown_helper {
573 #if defined(SWIGRUBY)
574 SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
575 #elif defined(SWIGPYTHON)
576 SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
577 #elif defined(SWIGPERL)
578 SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
579 #elif defined(SWIGTCL)
580 SWIG_ConvertPtr(objv[1], &argp1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
582 #warning disown_helper not implemented for this language, this is likely going to leak memory
586 Tcl_SetObjResult(interp, SWIG_From_int((int)(0)));
588 $result = SWIG_From_int((int)(0));
597 %include "typemaps.i"
599 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
602 %typemap(argout,noblock=1) XRule **OUTPUT {
603 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
606 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
607 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
611 ** the C declarations
617 #include <sys/stat.h>
618 #include <sys/utsname.h>
619 #include <sys/types.h>
623 /* argh, swig undefs bool for perl */
629 #include "poolarch.h"
633 #include "solverdebug.h"
634 #include "repo_solv.h"
636 #include "selection.h"
638 #include "repo_write.h"
639 #if defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG)
640 #include "repo_rpmdb.h"
643 #include "repo_pubkey.h"
646 #include "repo_deb.h"
649 #include "repo_rpmmd.h"
650 #include "repo_updateinfoxml.h"
651 #include "repo_deltainfoxml.h"
652 #include "repo_repomdxml.h"
654 #ifdef ENABLE_SUSEREPO
655 #include "repo_products.h"
656 #include "repo_susetags.h"
657 #include "repo_content.h"
659 #ifdef ENABLE_MDKREPO
660 #include "repo_mdk.h"
662 #ifdef ENABLE_ARCHREPO
663 #include "repo_arch.h"
666 #include "repo_autopattern.h"
668 #include "solv_xfopen.h"
669 #include "testcase.h"
671 /* for old ruby versions */
673 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
676 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
679 #define SOLVER_SOLUTION_ERASE -100
680 #define SOLVER_SOLUTION_REPLACE -101
681 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
682 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
683 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
684 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
686 typedef void *AppObjectPtr;
712 } Pool_solvable_iterator;
717 } Pool_repo_iterator;
722 } Repo_solvable_iterator;
773 Transaction *transaction;
791 typedef Dataiterator Datamatch;
793 typedef int disown_helper;
810 SWIGINTERN void appdata_disown_helper(void *appdata) {
812 SWIGINTERN void appdata_clr_helper(void **appdatap) {
815 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
818 SWIGINTERN void *appdata_get_helper(void *appdata) {
823 #elif defined(SWIGTCL)
826 SWIGINTERN void appdata_disown_helper(void *appdata) {
828 SWIGINTERN void appdata_clr_helper(void **appdatap) {
830 Tcl_DecrRefCount((Tcl_Obj *)(*appdatap));
833 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
834 appdata_clr_helper(appdatap);
837 SWIGINTERN void *appdata_get_helper(void *appdata) {
842 #elif defined(SWIGPYTHON)
845 SWIGINTERN void appdata_disown_helper(void *appdata) {
846 struct myappdata *myappdata = appdata;
847 if (!myappdata || !myappdata->appdata || myappdata->disowned)
849 myappdata->disowned = 1;
850 Py_DECREF((PyObject *)myappdata->appdata);
852 SWIGINTERN void appdata_clr_helper(void **appdatap) {
853 struct myappdata *myappdata = *(struct myappdata **)appdatap;
854 if (myappdata && myappdata->appdata && !myappdata->disowned) {
855 Py_DECREF((PyObject *)myappdata->appdata);
857 *appdatap = solv_free(myappdata);
859 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
860 appdata_clr_helper(appdatap);
862 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
863 myappdata->appdata = appdata;
866 SWIGINTERN void *appdata_get_helper(void *appdata) {
867 return appdata ? ((struct myappdata *)appdata)->appdata : 0;
872 #elif defined(SWIGPERL)
875 SWIGINTERN void appdata_disown_helper(void *appdata) {
876 struct myappdata *myappdata = appdata;
878 if (!myappdata || !myappdata->appdata || myappdata->disowned)
880 rsv = myappdata->appdata;
883 myappdata->appdata = SvRV(rsv);
884 myappdata->disowned = 1;
887 SWIGINTERN void appdata_clr_helper(void **appdatap) {
888 struct myappdata *myappdata = *(struct myappdata **)appdatap;
889 if (myappdata && myappdata->appdata && !myappdata->disowned) {
890 SvREFCNT_dec((SV *)myappdata->appdata);
892 *appdatap = solv_free(myappdata);
894 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
895 appdata_clr_helper(appdatap);
897 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
898 myappdata->appdata = appdata;
901 SWIGINTERN void *appdata_get_helper(void *appdata) {
902 struct myappdata *myappdata = appdata;
903 if (!myappdata || !myappdata->appdata)
905 return myappdata->disowned ? newRV_noinc((SV *)myappdata->appdata) : myappdata->appdata;
911 #warning appdata helpers not implemented for this language
916 ** the SWIG declarations defining the API
920 %mixin Dataiterator "Enumerable";
921 %mixin Pool_solvable_iterator "Enumerable";
922 %mixin Pool_repo_iterator "Enumerable";
923 %mixin Repo_solvable_iterator "Enumerable";
930 /* from repodata.h */
931 %constant Id SOLVID_META;
932 %constant Id SOLVID_POS;
934 %constant int REL_EQ;
935 %constant int REL_GT;
936 %constant int REL_LT;
937 %constant int REL_AND;
938 %constant int REL_OR;
939 %constant int REL_WITH;
940 %constant int REL_NAMESPACE;
941 %constant int REL_ARCH;
942 %constant int REL_FILECONFLICT;
943 %constant int REL_COND;
944 %constant int REL_COMPAT;
945 %constant int REL_KIND;
946 %constant int REL_MULTIARCH;
947 %constant int REL_ELSE;
948 %constant int REL_ERROR;
949 %constant int REL_WITHOUT;
950 %constant int REL_UNLESS;
961 /* put before pool/repo so we can access the constructor */
962 %nodefaultdtor Dataiterator;
963 typedef struct {} Dataiterator;
986 typedef struct {} Pool_solvable_iterator;
987 typedef struct {} Pool_repo_iterator;
988 typedef struct {} Repo_solvable_iterator;
990 %nodefaultctor Datamatch;
991 %nodefaultdtor Datamatch;
998 %nodefaultctor Datapos;
1009 %nodefaultctor Pool;
1010 %nodefaultdtor Pool;
1014 %nodefaultctor Repo;
1015 %nodefaultdtor Repo;
1018 const char * const name;
1021 int const nsolvables;
1024 %nodefaultctor Solver;
1025 %nodefaultdtor Solver;
1033 #ifdef ENABLE_PUBKEY
1036 unsigned int const created;
1037 unsigned int const expires;
1038 const char * const keyid;
1042 %rename(xfopen) solvfp_xfopen;
1043 %rename(xfopen_fd) solvfp_xfopen_fd;
1045 %nodefaultctor SolvFp;
1049 %newobject solvfp_xfopen;
1050 %newobject solvfp_xfopen_fd;
1052 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
1053 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
1056 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
1062 fcntl(fd, F_SETFD, FD_CLOEXEC);
1063 fp = solv_xfopen_fd(fn, fd, mode);
1068 sfp = solv_calloc(1, sizeof(SolvFp));
1072 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
1075 fp = solv_xfopen(fn, mode);
1078 if (fileno(fp) != -1)
1079 fcntl(fileno(fp), F_SETFD, FD_CLOEXEC);
1080 sfp = solv_calloc(1, sizeof(SolvFp));
1087 Solver * const solv;
1092 Solver * const solv;
1100 Id const solutionid;
1105 %nodefaultctor Alternative;
1116 %nodefaultctor Transaction;
1117 %nodefaultdtor Transaction;
1123 Transaction * const transaction;
1137 return $self->fp ? fileno($self->fp) : -1;
1140 return $self->fp ? dup(fileno($self->fp)) : -1;
1142 bool write(const unsigned char *str, size_t len) {
1143 return fwrite(str, len, 1, $self->fp) == 1;
1148 return fflush($self->fp) == 0;
1154 ret = fclose($self->fp) == 0;
1158 void cloexec(bool state) {
1159 if (!$self->fp || fileno($self->fp) == -1)
1161 fcntl(fileno($self->fp), F_SETFD, state ? FD_CLOEXEC : 0);
1166 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
1167 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
1168 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
1169 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
1170 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
1171 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
1172 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
1173 static const Id SOLVER_NOOP = SOLVER_NOOP;
1174 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
1175 static const Id SOLVER_ERASE = SOLVER_ERASE;
1176 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
1177 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
1178 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
1179 static const Id SOLVER_LOCK = SOLVER_LOCK;
1180 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
1181 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
1182 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
1183 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
1184 static const Id SOLVER_ALLOWUNINSTALL = SOLVER_ALLOWUNINSTALL;
1185 static const Id SOLVER_FAVOR = SOLVER_FAVOR;
1186 static const Id SOLVER_DISFAVOR = SOLVER_DISFAVOR;
1187 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
1188 static const Id SOLVER_WEAK = SOLVER_WEAK;
1189 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
1190 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
1191 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
1192 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
1193 static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
1194 static const Id SOLVER_SETEV = SOLVER_SETEV;
1195 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
1196 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
1197 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
1198 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
1199 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
1200 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
1201 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
1203 Job(Pool *pool, int how, Id what) {
1204 Job *job = solv_calloc(1, sizeof(*job));
1211 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1212 %newobject solvables;
1216 pool_job2solvables($self->pool, &q, $self->how, $self->what);
1220 %rename("isemptyupdate?") isemptyupdate;
1222 bool isemptyupdate() {
1223 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
1226 #if defined(SWIGTCL)
1227 %rename("==") __eq__;
1229 bool __eq__(Job *j) {
1230 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
1232 #if defined(SWIGTCL)
1233 %rename("!=") __ne__;
1235 bool __ne__(Job *j) {
1236 return !Job___eq__($self, j);
1238 #if defined(SWIGPERL) || defined(SWIGTCL)
1239 %rename("str") __str__;
1241 const char *__str__() {
1242 return pool_job2str($self->pool, $self->how, $self->what, 0);
1244 #if defined(SWIGPERL) || defined(SWIGTCL)
1245 %rename("repr") __repr__;
1247 const char *__repr__() {
1248 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
1249 return pool_tmpjoin($self->pool, "<Job ", str, ">");
1254 static const Id SELECTION_NAME = SELECTION_NAME;
1255 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
1256 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
1257 static const Id SELECTION_CANON = SELECTION_CANON;
1258 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
1259 static const Id SELECTION_REL = SELECTION_REL;
1260 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
1261 static const Id SELECTION_GLOB = SELECTION_GLOB;
1262 static const Id SELECTION_FLAT = SELECTION_FLAT;
1263 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
1264 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
1265 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
1267 Selection(Pool *pool) {
1269 s = solv_calloc(1, sizeof(*s));
1275 queue_free(&$self->q);
1279 return $self->flags;
1282 %rename("isempty?") isempty;
1285 return $self->q.count == 0;
1287 void filter(Selection *lsel) {
1288 if ($self->pool != lsel->pool)
1289 queue_empty(&$self->q);
1291 selection_filter($self->pool, &$self->q, &lsel->q);
1293 void add(Selection *lsel) {
1294 if ($self->pool == lsel->pool)
1296 selection_add($self->pool, &$self->q, &lsel->q);
1297 $self->flags |= lsel->flags;
1300 void add_raw(Id how, Id what) {
1301 queue_push2(&$self->q, how, what);
1303 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
1305 Queue jobs(int flags) {
1308 queue_init_clone(&q, &$self->q);
1309 for (i = 0; i < q.count; i += 2)
1310 q.elements[i] |= flags;
1314 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1315 %newobject solvables;
1319 selection_solvables($self->pool, &$self->q, &q);
1323 #if defined(SWIGPERL) || defined(SWIGTCL)
1324 %rename("str") __str__;
1326 const char *__str__() {
1327 return pool_selection2str($self->pool, &$self->q, 0);
1329 #if defined(SWIGPERL) || defined(SWIGTCL)
1330 %rename("repr") __repr__;
1332 const char *__repr__() {
1333 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
1334 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
1340 return solv_chksum_create(type);
1342 Chksum(Id type, const char *hex) {
1343 unsigned char buf[64];
1344 int l = solv_chksum_len(type);
1347 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
1349 return solv_chksum_create_from_bin(type, buf);
1351 %newobject from_bin;
1352 static Chksum *from_bin(Id type, const unsigned char *str, size_t len) {
1353 return len == solv_chksum_len(type) ? solv_chksum_create_from_bin(type, str) : 0;
1355 #if defined(SWIGPERL)
1357 undef *solv::Chksum::from_bin;
1358 *solv::Chksum::from_bin = sub {
1360 my $self = solvc::Chksum_from_bin(@_);
1361 bless $self, $pkg if defined $self;
1366 solv_chksum_free($self, 0);
1370 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
1371 return solv_chksum_get_type(chk);
1374 void add(const unsigned char *str, size_t len) {
1375 solv_chksum_add($self, str, (int)len);
1377 void add_fp(FILE *fp) {
1380 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
1381 solv_chksum_add($self, buf, l);
1382 rewind(fp); /* convenience */
1384 void add_fd(int fd) {
1387 while ((l = read(fd, buf, sizeof(buf))) > 0)
1388 solv_chksum_add($self, buf, l);
1389 lseek(fd, 0, 0); /* convenience */
1391 void add_stat(const char *filename) {
1393 if (stat(filename, &stb))
1394 memset(&stb, 0, sizeof(stb));
1395 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1396 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1397 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1398 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1400 void add_fstat(int fd) {
1402 if (fstat(fd, &stb))
1403 memset(&stb, 0, sizeof(stb));
1404 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1405 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1406 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1407 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1412 const unsigned char *b;
1413 b = solv_chksum_get($self, &l);
1421 const unsigned char *b;
1424 b = solv_chksum_get($self, &l);
1425 ret = solv_malloc(2 * l + 1);
1426 solv_bin2hex(b, l, ret);
1429 const char *typestr() {
1430 return solv_chksum_type2str(solv_chksum_get_type($self));
1433 #if defined(SWIGTCL)
1434 %rename("==") __eq__;
1436 bool __eq__(Chksum *chk) {
1437 return solv_chksum_cmp($self, chk);
1439 #if defined(SWIGTCL)
1440 %rename("!=") __ne__;
1442 bool __ne__(Chksum *chk) {
1443 return !solv_chksum_cmp($self, chk);
1445 #if defined(SWIGRUBY)
1446 %rename("to_s") __str__;
1448 #if defined(SWIGPERL) || defined(SWIGTCL)
1449 %rename("str") __str__;
1452 const char *__str__() {
1455 if (solv_chksum_isfinished($self))
1456 h = Chksum_hex($self);
1457 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1458 solv_free((void *)h);
1461 #if defined(SWIGPERL) || defined(SWIGTCL)
1462 %rename("repr") __repr__;
1464 %newobject __repr__;
1465 const char *__repr__() {
1466 const char *h = Chksum___str__($self);
1467 const char *str = solv_dupjoin("<Chksum ", h, ">");
1468 solv_free((void *)h);
1474 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1475 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1476 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1477 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1478 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1479 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1480 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1481 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1482 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1483 static const int DISTTYPE_RPM = DISTTYPE_RPM;
1484 static const int DISTTYPE_DEB = DISTTYPE_DEB;
1485 static const int DISTTYPE_ARCH = DISTTYPE_ARCH;
1486 static const int DISTTYPE_HAIKU = DISTTYPE_HAIKU;
1489 Pool *pool = pool_create();
1492 int setdisttype(int disttype) {
1493 return pool_setdisttype($self, disttype);
1495 void set_debuglevel(int level) {
1496 pool_setdebuglevel($self, level);
1498 int set_flag(int flag, int value) {
1499 return pool_set_flag($self, flag, value);
1501 int get_flag(int flag) {
1502 return pool_get_flag($self, flag);
1504 void set_rootdir(const char *rootdir) {
1505 pool_set_rootdir($self, rootdir);
1507 const char *get_rootdir(int flag) {
1508 return pool_get_rootdir($self);
1510 #if defined(SWIGPYTHON)
1512 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1513 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1514 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1515 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1520 return 0; /* exception */
1521 ecode = SWIG_AsVal_int(result, &vresult);
1523 return SWIG_IsOK(ecode) ? vresult : 0;
1526 void clr_loadcallback() {
1527 if ($self->loadcallback == loadcallback) {
1528 PyObject *obj = $self->loadcallbackdata;
1530 pool_setloadcallback($self, 0, 0);
1533 void set_loadcallback(PyObject *callable) {
1534 Pool_clr_loadcallback($self);
1536 Py_INCREF(callable);
1537 pool_setloadcallback($self, loadcallback, callable);
1540 #elif defined(SWIGPERL)
1542 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1546 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1551 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1553 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1563 void clr_loadcallback() {
1564 if ($self->loadcallback == loadcallback) {
1565 SvREFCNT_dec($self->loadcallbackdata);
1566 pool_setloadcallback($self, 0, 0);
1569 void set_loadcallback(SV *callable) {
1570 Pool_clr_loadcallback($self);
1572 SvREFCNT_inc(callable);
1573 pool_setloadcallback($self, loadcallback, callable);
1576 #elif defined(SWIGRUBY)
1578 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1579 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1580 VALUE callable = (VALUE)d;
1581 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1582 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1583 return res == Qtrue;
1585 SWIGINTERN void mark_Pool(void *ptr) {
1587 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1588 VALUE callable = (VALUE)pool->loadcallbackdata;
1589 rb_gc_mark(callable);
1593 void clr_loadcallback() {
1594 pool_setloadcallback($self, 0, 0);
1596 %typemap(in, numinputs=0) VALUE callable {
1597 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1599 void set_loadcallback(VALUE callable) {
1600 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1602 #elif defined(SWIGTCL)
1608 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1609 tcl_callback_t *callback_var = (tcl_callback_t *)d;
1610 Tcl_Interp *interp = callback_var->interp;
1611 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1612 int result, ecode = 0, vresult = 0;
1614 objvx[0] = callback_var->obj;
1615 objvx[1] = SWIG_NewInstanceObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
1616 Tcl_IncrRefCount(objvx[1]);
1617 result = Tcl_EvalObjv(interp, sizeof(objvx)/sizeof(*objvx), objvx, TCL_EVAL_GLOBAL);
1618 Tcl_DecrRefCount(objvx[1]);
1619 if (result != TCL_OK)
1620 return 0; /* exception */
1621 ecode = SWIG_AsVal_int(interp, Tcl_GetObjResult(interp), &vresult);
1622 return SWIG_IsOK(ecode) ? vresult : 0;
1625 void clr_loadcallback() {
1626 if ($self->loadcallback == loadcallback) {
1627 tcl_callback_t *callback_var = $self->loadcallbackdata;
1628 Tcl_DecrRefCount(callback_var->obj);
1629 solv_free(callback_var);
1630 pool_setloadcallback($self, 0, 0);
1633 void set_loadcallback(Tcl_Obj *callable, Tcl_Interp *interp) {
1634 Pool_clr_loadcallback($self);
1636 tcl_callback_t *callback_var = solv_malloc(sizeof(tcl_callback_t));
1637 Tcl_IncrRefCount(callable);
1638 callback_var->interp = interp;
1639 callback_var->obj = callable;
1640 pool_setloadcallback($self, loadcallback, callback_var);
1644 #warning loadcallback not implemented for this language
1651 FOR_REPOS(repoid, repo)
1652 appdata_clr_helper(&repo->appdata);
1653 Pool_clr_loadcallback(pool);
1654 appdata_clr_helper(&pool->appdata);
1657 disown_helper free() {
1661 FOR_REPOS(repoid, repo)
1662 appdata_clr_helper(&repo->appdata);
1663 Pool_clr_loadcallback(pool);
1664 appdata_clr_helper(&pool->appdata);
1668 disown_helper disown() {
1671 AppObjectPtr appdata;
1673 SWIGINTERN void Pool_appdata_set(Pool *pool, AppObjectPtr appdata) {
1674 appdata_set_helper(&pool->appdata, appdata);
1676 SWIGINTERN AppObjectPtr Pool_appdata_get(Pool *pool) {
1677 return appdata_get_helper(pool->appdata);
1680 void appdata_disown() {
1681 appdata_disown_helper($self->appdata);
1684 Id str2id(const char *str, bool create=1) {
1685 return pool_str2id($self, str, create);
1688 Dep *Dep(const char *str, bool create=1) {
1689 Id id = pool_str2id($self, str, create);
1690 return new_Dep($self, id);
1692 const char *id2str(Id id) {
1693 return pool_id2str($self, id);
1695 const char *dep2str(Id id) {
1696 return pool_dep2str($self, id);
1698 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1699 return pool_rel2id($self, name, evr, flags, create);
1701 Id id2langid(Id id, const char *lang, bool create=1) {
1702 return pool_id2langid($self, id, lang, create);
1704 void setarch(const char *arch = 0) {
1713 pool_setarch($self, arch);
1715 Repo *add_repo(const char *name) {
1716 return repo_create($self, name);
1718 const char *lookup_str(Id entry, Id keyname) {
1719 return pool_lookup_str($self, entry, keyname);
1721 Id lookup_id(Id entry, Id keyname) {
1722 return pool_lookup_id($self, entry, keyname);
1724 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1725 return pool_lookup_num($self, entry, keyname, notfound);
1727 bool lookup_void(Id entry, Id keyname) {
1728 return pool_lookup_void($self, entry, keyname);
1730 %newobject lookup_checksum;
1731 Chksum *lookup_checksum(Id entry, Id keyname) {
1733 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1734 return solv_chksum_create_from_bin(type, b);
1737 %newobject Dataiterator;
1738 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1739 return new_Dataiterator($self, 0, 0, key, match, flags);
1741 %newobject Dataiterator_solvid;
1742 Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
1743 return new_Dataiterator($self, 0, p, key, match, flags);
1745 const char *solvid2str(Id solvid) {
1746 return pool_solvid2str($self, solvid);
1748 void addfileprovides() {
1749 pool_addfileprovides($self);
1751 Queue addfileprovides_queue() {
1754 pool_addfileprovides_queue($self, &r, 0);
1757 void createwhatprovides() {
1758 pool_createwhatprovides($self);
1761 %newobject id2solvable;
1762 XSolvable *id2solvable(Id id) {
1763 return new_XSolvable($self, id);
1765 %newobject solvables;
1766 Pool_solvable_iterator * const solvables;
1768 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1769 return new_Pool_solvable_iterator(pool);
1772 %newobject solvables_iter;
1773 Pool_solvable_iterator * solvables_iter() {
1774 return new_Pool_solvable_iterator($self);
1777 Repo *id2repo(Id id) {
1778 if (id < 1 || id >= $self->nrepos)
1780 return pool_id2repo($self, id);
1784 Pool_repo_iterator * const repos;
1786 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1787 return new_Pool_repo_iterator(pool);
1790 %newobject repos_iter;
1791 Pool_repo_iterator * repos_iter() {
1792 return new_Pool_repo_iterator($self);
1796 const char * const errstr;
1798 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1799 pool_set_installed(pool, installed);
1801 SWIGINTERN Repo *Pool_installed_get(Pool *pool) {
1802 return pool->installed;
1804 SWIGINTERN const char *Pool_errstr_get(Pool *pool) {
1805 return pool_errstr(pool);
1809 Queue matchprovidingids(const char *match, int flags) {
1815 for (id = 1; id < pool->ss.nstrings; id++)
1816 if (pool->whatprovides[id])
1820 if (!datamatcher_init(&ma, match, flags)) {
1821 for (id = 1; id < pool->ss.nstrings; id++)
1822 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1824 datamatcher_free(&ma);
1831 Job *Job(int how, Id what) {
1832 return new_Job($self, how, what);
1835 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1836 %newobject whatprovides;
1837 Queue whatprovides(DepId dep) {
1842 FOR_PROVIDES(p, pp, dep)
1847 Id towhatprovides(Queue q) {
1848 return pool_queuetowhatprovides($self, &q);
1851 %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1852 %newobject whatmatchesdep;
1853 Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
1856 pool_whatmatchesdep($self, keyname, dep, &q, marker);
1861 %rename("isknownarch?") isknownarch;
1863 bool isknownarch(DepId id) {
1865 if (!id || id == ID_EMPTY)
1867 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1869 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1876 return solver_create($self);
1879 %newobject Selection;
1880 Selection *Selection() {
1881 return new_Selection($self);
1883 %newobject Selection_all;
1884 Selection *Selection_all(int setflags=0) {
1885 Selection *sel = new_Selection($self);
1886 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1890 Selection *select(const char *name, int flags) {
1891 Selection *sel = new_Selection($self);
1892 sel->flags = selection_make($self, &sel->q, name, flags);
1896 void setpooljobs_helper(Queue jobs) {
1897 queue_free(&$self->pooljobs);
1898 queue_init_clone(&$self->pooljobs, &jobs);
1900 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1901 %newobject getpooljobs;
1902 Queue getpooljobs() {
1904 queue_init_clone(&q, &$self->pooljobs);
1908 #if defined(SWIGPYTHON)
1910 def setpooljobs(self, jobs):
1912 for job in jobs: j += [job.how, job.what]
1913 self.setpooljobs_helper(j)
1916 #if defined(SWIGPERL)
1918 sub solv::Solver::setpooljobs {
1919 my ($self, $jobs) = @_;
1920 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1921 return $self->setpooljobs_helper(\@j);
1925 #if defined(SWIGRUBY)
1928 "class Solv::Pool\n"
1929 " def setpooljobs(jobs)\n"
1931 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1932 " setpooljobs_helper(jl)\n"
1941 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1942 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1943 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1944 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1945 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1946 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1947 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1948 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1949 #ifdef ENABLE_SUSEREPO
1950 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1953 void free(bool reuseids = 0) {
1954 appdata_clr_helper(&$self->appdata);
1955 repo_free($self, reuseids);
1957 void empty(bool reuseids = 0) {
1958 repo_empty($self, reuseids);
1961 %rename("isempty?") isempty;
1964 return !$self->nsolvables;
1967 AppObjectPtr appdata;
1969 SWIGINTERN void Repo_appdata_set(Repo *repo, AppObjectPtr appdata) {
1970 appdata_set_helper(&repo->appdata, appdata);
1972 SWIGINTERN AppObjectPtr Repo_appdata_get(Repo *repo) {
1973 return appdata_get_helper(repo->appdata);
1977 bool add_solv(const char *name, int flags = 0) {
1978 FILE *fp = fopen(name, "r");
1982 r = repo_add_solv($self, fp, flags);
1986 bool add_solv(FILE *fp, int flags = 0) {
1987 return repo_add_solv($self, fp, flags) == 0;
1990 %newobject add_solvable;
1991 XSolvable *add_solvable() {
1992 Id solvid = repo_add_solvable($self);
1993 return new_XSolvable($self->pool, solvid);
1997 bool add_rpmdb(int flags = 0) {
1998 return repo_add_rpmdb($self, 0, flags) == 0;
2000 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
2001 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
2004 #ifdef ENABLE_RPMPKG
2006 XSolvable *add_rpm(const char *name, int flags = 0) {
2007 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
2010 #ifdef ENABLE_PUBKEY
2012 bool add_rpmdb_pubkeys(int flags = 0) {
2013 return repo_add_rpmdb_pubkeys($self, flags) == 0;
2016 %newobject add_pubkey;
2017 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
2018 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
2020 bool add_keyring(FILE *fp, int flags = 0) {
2021 return repo_add_keyring($self, fp, flags);
2023 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
2024 return repo_add_keydir($self, keydir, suffix, flags);
2028 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
2029 return repo_add_rpmmd($self, fp, language, flags) == 0;
2031 bool add_repomdxml(FILE *fp, int flags = 0) {
2032 return repo_add_repomdxml($self, fp, flags) == 0;
2034 bool add_updateinfoxml(FILE *fp, int flags = 0) {
2035 return repo_add_updateinfoxml($self, fp, flags) == 0;
2037 bool add_deltainfoxml(FILE *fp, int flags = 0) {
2038 return repo_add_deltainfoxml($self, fp, flags) == 0;
2041 #ifdef ENABLE_DEBIAN
2042 bool add_debdb(int flags = 0) {
2043 return repo_add_debdb($self, flags) == 0;
2045 bool add_debpackages(FILE *fp, int flags = 0) {
2046 return repo_add_debpackages($self, fp, flags) == 0;
2049 XSolvable *add_deb(const char *name, int flags = 0) {
2050 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
2053 #ifdef ENABLE_SUSEREPO
2054 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
2055 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
2057 bool add_content(FILE *fp, int flags = 0) {
2058 return repo_add_content($self, fp, flags) == 0;
2060 bool add_products(const char *proddir, int flags = 0) {
2061 return repo_add_products($self, proddir, flags) == 0;
2064 #ifdef ENABLE_MDKREPO
2065 bool add_mdk(FILE *fp, int flags = 0) {
2066 return repo_add_mdk($self, fp, flags) == 0;
2068 bool add_mdk_info(FILE *fp, int flags = 0) {
2069 return repo_add_mdk_info($self, fp, flags) == 0;
2072 #ifdef ENABLE_ARCHREPO
2073 bool add_arch_repo(FILE *fp, int flags = 0) {
2074 return repo_add_arch_repo($self, fp, flags) == 0;
2076 bool add_arch_local(const char *dir, int flags = 0) {
2077 return repo_add_arch_local($self, dir, flags) == 0;
2079 %newobject add_arch_pkg;
2080 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
2081 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
2085 bool add_autopattern(int flags = 0) {
2086 return repo_add_autopattern($self, flags) == 0;
2089 void internalize() {
2090 repo_internalize($self);
2092 bool write(FILE *fp) {
2093 return repo_write($self, fp) == 0;
2095 /* HACK, remove if no longer needed! */
2096 bool write_first_repodata(FILE *fp) {
2097 int oldnrepodata = $self->nrepodata;
2099 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
2100 res = repo_write($self, fp);
2101 $self->nrepodata = oldnrepodata;
2105 %newobject Dataiterator;
2106 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2107 return new_Dataiterator($self->pool, $self, 0, key, match, flags);
2109 %newobject Dataiterator_meta;
2110 Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
2111 return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
2116 SWIGINTERN Id Repo_id_get(Repo *repo) {
2117 return repo->repoid;
2120 %newobject solvables;
2121 Repo_solvable_iterator * const solvables;
2123 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
2124 return new_Repo_solvable_iterator(repo);
2128 Datapos * const meta;
2130 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
2131 Datapos *pos = solv_calloc(1, sizeof(*pos));
2132 pos->solvid = SOLVID_META;
2138 %newobject solvables_iter;
2139 Repo_solvable_iterator *solvables_iter() {
2140 return new_Repo_solvable_iterator($self);
2143 %newobject add_repodata;
2144 XRepodata *add_repodata(int flags = 0) {
2145 Repodata *rd = repo_add_repodata($self, flags);
2146 return new_XRepodata($self, rd->repodataid);
2149 void create_stubs() {
2151 if (!$self->nrepodata)
2153 data = repo_id2repodata($self, $self->nrepodata - 1);
2154 if (data->state != REPODATA_STUB)
2155 (void)repodata_create_stubs(data);
2158 %rename("iscontiguous?") iscontiguous;
2160 bool iscontiguous() {
2162 for (i = $self->start; i < $self->end; i++)
2163 if ($self->pool->solvables[i].repo != $self)
2167 %newobject first_repodata;
2168 XRepodata *first_repodata() {
2171 if ($self->nrepodata < 2)
2173 /* make sure all repodatas but the first are extensions */
2174 data = repo_id2repodata($self, 1);
2175 if (data->loadcallback)
2177 for (i = 2; i < $self->nrepodata; i++)
2179 data = repo_id2repodata($self, i);
2180 if (!data->loadcallback)
2181 return 0; /* oops, not an extension */
2183 return new_XRepodata($self, 1);
2186 %newobject Selection;
2187 Selection *Selection(int setflags=0) {
2188 Selection *sel = new_Selection($self->pool);
2189 setflags |= SOLVER_SETREPO;
2190 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
2194 #ifdef ENABLE_PUBKEY
2195 %newobject find_pubkey;
2196 XSolvable *find_pubkey(const char *keyid) {
2197 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
2201 Repo *createshadow(const char *name) {
2202 Repo *repo = repo_create($self->pool, name);
2203 if ($self->idarraysize) {
2204 repo_reserve_ids(repo, 0, $self->idarraysize);
2205 memcpy(repo->idarraydata, $self->idarraydata, sizeof(Id) * $self->idarraysize);
2206 repo->idarraysize = $self->idarraysize;
2208 repo->start = $self->start;
2209 repo->end = $self->end;
2210 repo->nsolvables = $self->nsolvables;
2214 void moveshadow(Queue q) {
2215 Pool *pool = $self->pool;
2217 for (i = 0; i < q.count; i++) {
2219 Id p = q.elements[i];
2220 if (p < $self->start || p >= $self->end)
2222 s = pool->solvables + p;
2223 if ($self->idarraysize != s->repo->idarraysize)
2229 #if defined(SWIGTCL)
2230 %rename("==") __eq__;
2232 bool __eq__(Repo *repo) {
2233 return $self == repo;
2235 #if defined(SWIGTCL)
2236 %rename("!=") __ne__;
2238 bool __ne__(Repo *repo) {
2239 return $self != repo;
2241 #if defined(SWIGPYTHON)
2243 return $self->repoid;
2246 #if defined(SWIGPERL) || defined(SWIGTCL)
2247 %rename("str") __str__;
2250 const char *__str__() {
2253 return solv_strdup($self->name);
2254 sprintf(buf, "Repo#%d", $self->repoid);
2255 return solv_strdup(buf);
2257 #if defined(SWIGPERL) || defined(SWIGTCL)
2258 %rename("repr") __repr__;
2260 %newobject __repr__;
2261 const char *__repr__() {
2265 sprintf(buf, "<Repo #%d ", $self->repoid);
2266 return solv_dupjoin(buf, $self->name, ">");
2268 sprintf(buf, "<Repo #%d>", $self->repoid);
2269 return solv_strdup(buf);
2273 %extend Dataiterator {
2274 static const int SEARCH_STRING = SEARCH_STRING;
2275 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
2276 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
2277 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
2278 static const int SEARCH_GLOB = SEARCH_GLOB;
2279 static const int SEARCH_REGEX = SEARCH_REGEX;
2280 static const int SEARCH_NOCASE = SEARCH_NOCASE;
2281 static const int SEARCH_FILES = SEARCH_FILES;
2282 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
2283 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
2285 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
2286 Dataiterator *di = solv_calloc(1, sizeof(*di));
2287 dataiterator_init(di, pool, repo, p, key, match, flags);
2291 dataiterator_free($self);
2294 #if defined(SWIGPYTHON)
2296 def __iter__(self): return self
2299 %rename("next") __next__();
2301 %exception __next__ {
2304 PyErr_SetString(PyExc_StopIteration,"no more matches");
2310 perliter(solv::Dataiterator)
2312 %newobject __next__;
2313 Datamatch *__next__() {
2315 if (!dataiterator_step($self)) {
2318 ndi = solv_calloc(1, sizeof(*ndi));
2319 dataiterator_init_clone(ndi, $self);
2320 dataiterator_strdup(ndi);
2326 while ((d = Dataiterator___next__($self)) != 0) {
2327 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
2331 void prepend_keyname(Id key) {
2332 dataiterator_prepend_keyname($self, key);
2334 void skip_solvable() {
2335 dataiterator_skip_solvable($self);
2340 Id lookup_id(Id keyname) {
2341 Pool *pool = $self->repo->pool;
2342 Datapos oldpos = pool->pos;
2345 r = pool_lookup_id(pool, SOLVID_POS, keyname);
2349 const char *lookup_str(Id keyname) {
2350 Pool *pool = $self->repo->pool;
2351 Datapos oldpos = pool->pos;
2354 r = pool_lookup_str(pool, SOLVID_POS, keyname);
2358 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2359 Pool *pool = $self->repo->pool;
2360 Datapos oldpos = pool->pos;
2361 unsigned long long r;
2363 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
2367 bool lookup_void(Id keyname) {
2368 Pool *pool = $self->repo->pool;
2369 Datapos oldpos = pool->pos;
2372 r = pool_lookup_void(pool, SOLVID_POS, keyname);
2376 %newobject lookup_checksum;
2377 Chksum *lookup_checksum(Id keyname) {
2378 Pool *pool = $self->repo->pool;
2379 Datapos oldpos = pool->pos;
2381 const unsigned char *b;
2383 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
2385 return solv_chksum_create_from_bin(type, b);
2387 const char *lookup_deltaseq() {
2388 Pool *pool = $self->repo->pool;
2389 Datapos oldpos = pool->pos;
2392 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
2394 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
2395 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
2400 const char *lookup_deltalocation(unsigned int *OUTPUT) {
2401 Pool *pool = $self->repo->pool;
2402 Datapos oldpos = pool->pos;
2405 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
2409 Queue lookup_idarray(Id keyname) {
2410 Pool *pool = $self->repo->pool;
2411 Datapos oldpos = pool->pos;
2415 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
2419 %newobject Dataiterator;
2420 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2421 Pool *pool = $self->repo->pool;
2422 Datapos oldpos = pool->pos;
2425 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
2433 dataiterator_free($self);
2436 %newobject solvable;
2437 XSolvable * const solvable;
2439 const char * const key_idstr;
2441 const char * const type_idstr;
2443 const char * const idstr;
2444 const char * const str;
2445 BinaryBlob const binary;
2446 unsigned long long const num;
2447 unsigned int const num2;
2449 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
2450 return new_XSolvable(di->pool, di->solvid);
2452 SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
2453 return di->key->name;
2455 SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
2456 return pool_id2str(di->pool, di->key->name);
2458 SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
2459 return di->key->type;
2461 SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
2462 return pool_id2str(di->pool, di->key->type);
2464 SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
2467 SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
2468 if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
2469 return repodata_dir2str(di->data, di->kv.id, 0);
2470 if (di->data && di->data->localpool)
2471 return stringpool_id2str(&di->data->spool, di->kv.id);
2472 return pool_id2str(di->pool, di->kv.id);
2474 SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
2477 SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
2481 if (di->key->type == REPOKEY_TYPE_BINARY)
2483 bl.data = di->kv.str;
2484 bl.len = di->kv.num;
2486 else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
2487 bl.data = di->kv.str;
2490 SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
2491 if (di->key->type == REPOKEY_TYPE_NUM)
2492 return SOLV_KV_NUM64(&di->kv);
2495 SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
2501 Pool *pool = $self->pool;
2502 Datapos *pos, oldpos = pool->pos;
2503 dataiterator_setpos($self);
2504 pos = solv_calloc(1, sizeof(*pos));
2509 %newobject parentpos;
2510 Datapos *parentpos() {
2511 Pool *pool = $self->pool;
2512 Datapos *pos, oldpos = pool->pos;
2513 dataiterator_setpos_parent($self);
2514 pos = solv_calloc(1, sizeof(*pos));
2519 #if defined(SWIGPERL)
2520 /* cannot use str here because swig reports a bogus conflict... */
2521 %rename("stringify") __str__;
2523 *solv::Datamatch::str = *solvc::Datamatch_stringify;
2526 #if defined(SWIGTCL)
2527 %rename("stringify") __str__;
2529 const char *__str__() {
2530 KeyValue kv = $self->kv;
2531 const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
2532 return str ? str : "";
2536 %extend Pool_solvable_iterator {
2537 Pool_solvable_iterator(Pool *pool) {
2538 Pool_solvable_iterator *s;
2539 s = solv_calloc(1, sizeof(*s));
2543 #if defined(SWIGPYTHON)
2545 def __iter__(self): return self
2548 %rename("next") __next__();
2550 %exception __next__ {
2553 PyErr_SetString(PyExc_StopIteration,"no more matches");
2559 perliter(solv::Pool_solvable_iterator)
2561 %newobject __next__;
2562 XSolvable *__next__() {
2563 Pool *pool = $self->pool;
2564 if ($self->id >= pool->nsolvables)
2566 while (++$self->id < pool->nsolvables)
2567 if (pool->solvables[$self->id].repo)
2568 return new_XSolvable(pool, $self->id);
2574 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2575 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2579 %newobject __getitem__;
2580 XSolvable *__getitem__(Id key) {
2581 Pool *pool = $self->pool;
2582 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2583 return new_XSolvable(pool, key);
2587 return $self->pool->nsolvables;
2591 %extend Pool_repo_iterator {
2592 Pool_repo_iterator(Pool *pool) {
2593 Pool_repo_iterator *s;
2594 s = solv_calloc(1, sizeof(*s));
2598 #if defined(SWIGPYTHON)
2600 def __iter__(self): return self
2603 %rename("next") __next__();
2605 %exception __next__ {
2608 PyErr_SetString(PyExc_StopIteration,"no more matches");
2614 perliter(solv::Pool_repo_iterator)
2617 Pool *pool = $self->pool;
2618 if ($self->id >= pool->nrepos)
2620 while (++$self->id < pool->nrepos) {
2621 Repo *r = pool_id2repo(pool, $self->id);
2630 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2631 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, 0 | 0));
2635 Repo *__getitem__(Id key) {
2636 Pool *pool = $self->pool;
2637 if (key > 0 && key < pool->nrepos)
2638 return pool_id2repo(pool, key);
2642 return $self->pool->nrepos;
2646 %extend Repo_solvable_iterator {
2647 Repo_solvable_iterator(Repo *repo) {
2648 Repo_solvable_iterator *s;
2649 s = solv_calloc(1, sizeof(*s));
2653 #if defined(SWIGPYTHON)
2655 def __iter__(self): return self
2658 %rename("next") __next__();
2660 %exception __next__ {
2663 PyErr_SetString(PyExc_StopIteration,"no more matches");
2669 perliter(solv::Repo_solvable_iterator)
2671 %newobject __next__;
2672 XSolvable *__next__() {
2673 Repo *repo = $self->repo;
2674 Pool *pool = repo->pool;
2675 if (repo->start > 0 && $self->id < repo->start)
2676 $self->id = repo->start - 1;
2677 if ($self->id >= repo->end)
2679 while (++$self->id < repo->end)
2680 if (pool->solvables[$self->id].repo == repo)
2681 return new_XSolvable(pool, $self->id);
2687 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2688 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2692 %newobject __getitem__;
2693 XSolvable *__getitem__(Id key) {
2694 Repo *repo = $self->repo;
2695 Pool *pool = repo->pool;
2696 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2697 return new_XSolvable(pool, key);
2701 return $self->repo->pool->nsolvables;
2706 Dep(Pool *pool, Id id) {
2710 s = solv_calloc(1, sizeof(*s));
2716 Dep *Rel(int flags, DepId evrid, bool create=1) {
2717 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2720 return new_Dep($self->pool, id);
2722 %newobject Selection_name;
2723 Selection *Selection_name(int setflags=0) {
2724 Selection *sel = new_Selection($self->pool);
2725 if (ISRELDEP($self->id)) {
2726 Reldep *rd = GETRELDEP($self->pool, $self->id);
2727 if (rd->flags == REL_EQ) {
2728 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2729 if (ISRELDEP(rd->name))
2730 rd = GETRELDEP($self->pool, rd->name);
2732 if (rd->flags == REL_ARCH)
2733 setflags |= SOLVER_SETARCH;
2735 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2738 %newobject Selection_provides;
2739 Selection *Selection_provides(int setflags=0) {
2740 Selection *sel = new_Selection($self->pool);
2741 if (ISRELDEP($self->id)) {
2742 Reldep *rd = GETRELDEP($self->pool, $self->id);
2743 if (rd->flags == REL_ARCH)
2744 setflags |= SOLVER_SETARCH;
2746 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2750 return pool_dep2str($self->pool, $self->id);
2752 #if defined(SWIGTCL)
2753 %rename("==") __eq__;
2755 bool __eq__(Dep *s) {
2756 return $self->pool == s->pool && $self->id == s->id;
2758 #if defined(SWIGTCL)
2759 %rename("!=") __ne__;
2761 bool __ne__(Dep *s) {
2762 return !Dep___eq__($self, s);
2764 #if defined(SWIGPYTHON)
2769 #if defined(SWIGPERL) || defined(SWIGTCL)
2770 %rename("str") __str__;
2772 const char *__str__() {
2773 return pool_dep2str($self->pool, $self->id);
2775 #if defined(SWIGPERL) || defined(SWIGTCL)
2776 %rename("repr") __repr__;
2778 %newobject __repr__;
2779 const char *__repr__() {
2781 sprintf(buf, "<Id #%d ", $self->id);
2782 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2787 XSolvable(Pool *pool, Id id) {
2789 if (!id || id >= pool->nsolvables)
2791 s = solv_calloc(1, sizeof(*s));
2797 return pool_solvid2str($self->pool, $self->id);
2799 const char *lookup_str(Id keyname) {
2800 return pool_lookup_str($self->pool, $self->id, keyname);
2802 Id lookup_id(Id keyname) {
2803 return pool_lookup_id($self->pool, $self->id, keyname);
2805 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2806 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2808 bool lookup_void(Id keyname) {
2809 return pool_lookup_void($self->pool, $self->id, keyname);
2811 %newobject lookup_checksum;
2812 Chksum *lookup_checksum(Id keyname) {
2814 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2815 return solv_chksum_create_from_bin(type, b);
2817 Queue lookup_idarray(Id keyname, Id marker = -1) {
2818 Solvable *s = $self->pool->solvables + $self->id;
2821 solvable_lookup_deparray(s, keyname, &r, marker);
2824 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2825 %newobject lookup_deparray;
2826 Queue lookup_deparray(Id keyname, Id marker = -1) {
2827 Solvable *s = $self->pool->solvables + $self->id;
2830 solvable_lookup_deparray(s, keyname, &r, marker);
2833 const char *lookup_location(unsigned int *OUTPUT) {
2834 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2836 const char *lookup_sourcepkg() {
2837 return solvable_lookup_sourcepkg($self->pool->solvables + $self->id);
2839 %newobject Dataiterator;
2840 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2841 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2844 %rename("installable?") installable;
2846 bool installable() {
2847 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2850 %rename("isinstalled?") isinstalled;
2852 bool isinstalled() {
2853 Pool *pool = $self->pool;
2854 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2859 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2860 Pool *pool = xs->pool;
2861 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2863 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2864 Pool *pool = xs->pool;
2865 return pool_id2str(pool, pool->solvables[xs->id].name);
2870 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2871 xs->pool->solvables[xs->id].name = nameid;
2873 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2874 return xs->pool->solvables[xs->id].name;
2879 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2880 Pool *pool = xs->pool;
2881 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2883 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2884 Pool *pool = xs->pool;
2885 return pool_id2str(pool, pool->solvables[xs->id].evr);
2890 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2891 xs->pool->solvables[xs->id].evr = evrid;
2893 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2894 return xs->pool->solvables[xs->id].evr;
2899 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2900 Pool *pool = xs->pool;
2901 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2903 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2904 Pool *pool = xs->pool;
2905 return pool_id2str(pool, pool->solvables[xs->id].arch);
2910 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2911 xs->pool->solvables[xs->id].arch = archid;
2913 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2914 return xs->pool->solvables[xs->id].arch;
2919 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2920 Pool *pool = xs->pool;
2921 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2923 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2924 Pool *pool = xs->pool;
2925 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2930 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2931 xs->pool->solvables[xs->id].vendor = vendorid;
2933 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2934 return xs->pool->solvables[xs->id].vendor;
2939 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2940 return xs->pool->solvables[xs->id].repo;
2944 /* old interface, please use the generic add_deparray instead */
2945 void add_provides(DepId id, Id marker = -1) {
2946 Solvable *s = $self->pool->solvables + $self->id;
2947 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2948 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2950 void add_obsoletes(DepId id) {
2951 Solvable *s = $self->pool->solvables + $self->id;
2952 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2954 void add_conflicts(DepId id) {
2955 Solvable *s = $self->pool->solvables + $self->id;
2956 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2958 void add_requires(DepId id, Id marker = -1) {
2959 Solvable *s = $self->pool->solvables + $self->id;
2960 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2961 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2963 void add_recommends(DepId id) {
2964 Solvable *s = $self->pool->solvables + $self->id;
2965 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2967 void add_suggests(DepId id) {
2968 Solvable *s = $self->pool->solvables + $self->id;
2969 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2971 void add_supplements(DepId id) {
2972 Solvable *s = $self->pool->solvables + $self->id;
2973 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2975 void add_enhances(DepId id) {
2976 Solvable *s = $self->pool->solvables + $self->id;
2977 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2980 void unset(Id keyname) {
2981 Solvable *s = $self->pool->solvables + $self->id;
2982 repo_unset(s->repo, $self->id, keyname);
2985 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2986 Solvable *s = $self->pool->solvables + $self->id;
2987 solvable_add_deparray(s, keyname, id, marker);
2990 %newobject Selection;
2991 Selection *Selection(int setflags=0) {
2992 Selection *sel = new_Selection($self->pool);
2993 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2998 %rename("identical?") identical;
3000 bool identical(XSolvable *s2) {
3001 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
3003 int evrcmp(XSolvable *s2) {
3004 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
3007 %rename("matchesdep?") matchesdep;
3009 bool matchesdep(Id keyname, DepId id, Id marker = -1) {
3010 return solvable_matchesdep($self->pool->solvables + $self->id, keyname, id, marker);
3013 #if defined(SWIGTCL)
3014 %rename("==") __eq__;
3016 bool __eq__(XSolvable *s) {
3017 return $self->pool == s->pool && $self->id == s->id;
3019 #if defined(SWIGTCL)
3020 %rename("!=") __ne__;
3022 bool __ne__(XSolvable *s) {
3023 return !XSolvable___eq__($self, s);
3025 #if defined(SWIGPYTHON)
3030 #if defined(SWIGPERL) || defined(SWIGTCL)
3031 %rename("str") __str__;
3033 const char *__str__() {
3034 return pool_solvid2str($self->pool, $self->id);
3036 #if defined(SWIGPERL) || defined(SWIGTCL)
3037 %rename("repr") __repr__;
3039 %newobject __repr__;
3040 const char *__repr__() {
3042 sprintf(buf, "<Solvable #%d ", $self->id);
3043 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
3048 Problem(Solver *solv, Id id) {
3050 p = solv_calloc(1, sizeof(*p));
3055 %newobject findproblemrule;
3056 XRule *findproblemrule() {
3057 Id r = solver_findproblemrule($self->solv, $self->id);
3058 return new_XRule($self->solv, r);
3060 %newobject findallproblemrules;
3061 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
3062 Queue findallproblemrules(int unfiltered=0) {
3063 Solver *solv = $self->solv;
3068 solver_findallproblemrules(solv, $self->id, &q);
3071 for (i = j = 0; i < q.count; i++)
3073 SolverRuleinfo rclass;
3074 probr = q.elements[i];
3075 rclass = solver_ruleclass(solv, probr);
3076 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
3078 q.elements[j++] = probr;
3081 queue_truncate(&q, j);
3085 int solution_count() {
3086 return solver_solution_count($self->solv, $self->id);
3088 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
3089 %newobject solutions;
3094 cnt = solver_solution_count($self->solv, $self->id);
3095 for (i = 1; i <= cnt; i++)
3099 #if defined(SWIGPERL) || defined(SWIGTCL)
3100 %rename("str") __str__;
3102 const char *__str__() {
3103 return solver_problem2str($self->solv, $self->id);
3108 Solution(Problem *p, Id id) {
3110 s = solv_calloc(1, sizeof(*s));
3112 s->problemid = p->id;
3116 int element_count() {
3117 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3120 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
3121 %newobject elements;
3122 Queue elements(bool expandreplaces=0) {
3126 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3127 for (i = 1; i <= cnt; i++)
3130 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
3132 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
3138 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
3139 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
3141 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
3142 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3143 queue_push2(&q, p, rp);
3145 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
3146 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3147 queue_push2(&q, p, rp);
3149 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
3150 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3151 queue_push2(&q, p, rp);
3153 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
3154 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3155 queue_push2(&q, p, rp);
3160 queue_push2(&q, i, type);
3161 queue_push2(&q, p, rp);
3167 %extend Solutionelement {
3168 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
3170 e = solv_calloc(1, sizeof(*e));
3172 e->problemid = problemid;
3184 if (p == SOLVER_SOLUTION_ERASE)
3189 else if (p == SOLVER_SOLUTION_REPLACE)
3194 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
3195 illegal = POLICY_ILLEGAL_DOWNGRADE;
3196 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
3197 illegal = POLICY_ILLEGAL_ARCHCHANGE;
3198 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
3199 illegal = POLICY_ILLEGAL_VENDORCHANGE;
3200 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
3201 illegal = POLICY_ILLEGAL_NAMECHANGE;
3203 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);
3204 return solver_solutionelement2str($self->solv, p, rp);
3206 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
3207 %newobject replaceelements;
3208 Queue replaceelements() {
3213 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3216 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3217 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
3218 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3219 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
3220 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3221 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
3222 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3223 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
3224 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3226 queue_push(&q, $self->type);
3229 int illegalreplace() {
3230 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3232 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3234 %newobject solvable;
3235 XSolvable * const solvable;
3236 %newobject replacement;
3237 XSolvable * const replacement;
3240 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
3241 return new_XSolvable(e->solv->pool, e->p);
3243 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
3244 return new_XSolvable(e->solv->pool, e->rp);
3246 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
3247 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
3249 return (e->p - 1) / 2;
3254 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
3255 if ($self->type == SOLVER_SOLUTION_JOB || $self->type == SOLVER_SOLUTION_POOLJOB)
3256 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
3257 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
3258 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
3259 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)
3260 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
3261 if ($self->type == SOLVER_SOLUTION_ERASE)
3262 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
3268 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
3269 static const int SOLVER_RULE_PKG = SOLVER_RULE_PKG;
3270 static const int SOLVER_RULE_PKG_NOT_INSTALLABLE = SOLVER_RULE_PKG_NOT_INSTALLABLE;
3271 static const int SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP = SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP;
3272 static const int SOLVER_RULE_PKG_REQUIRES = SOLVER_RULE_PKG_REQUIRES;
3273 static const int SOLVER_RULE_PKG_SELF_CONFLICT = SOLVER_RULE_PKG_SELF_CONFLICT;
3274 static const int SOLVER_RULE_PKG_CONFLICTS = SOLVER_RULE_PKG_CONFLICTS;
3275 static const int SOLVER_RULE_PKG_SAME_NAME = SOLVER_RULE_PKG_SAME_NAME;
3276 static const int SOLVER_RULE_PKG_OBSOLETES = SOLVER_RULE_PKG_OBSOLETES;
3277 static const int SOLVER_RULE_PKG_IMPLICIT_OBSOLETES = SOLVER_RULE_PKG_IMPLICIT_OBSOLETES;
3278 static const int SOLVER_RULE_PKG_INSTALLED_OBSOLETES = SOLVER_RULE_PKG_INSTALLED_OBSOLETES;
3279 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
3280 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
3281 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
3282 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
3283 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
3284 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
3285 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
3286 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
3287 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
3288 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
3289 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
3291 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
3292 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
3293 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
3294 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
3295 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
3296 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
3297 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
3298 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
3299 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
3300 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
3301 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
3303 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
3304 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
3305 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
3306 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
3308 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
3309 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
3310 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
3311 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
3312 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
3313 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
3314 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
3315 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
3316 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
3317 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
3318 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
3319 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
3320 static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
3321 static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
3322 static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
3323 static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
3324 static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
3325 static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
3326 static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
3327 static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
3328 static const int SOLVER_FLAG_NEED_UPDATEPROVIDE = SOLVER_FLAG_NEED_UPDATEPROVIDE;
3329 static const int SOLVER_FLAG_FOCUS_BEST = SOLVER_FLAG_FOCUS_BEST;
3330 static const int SOLVER_FLAG_STRONG_RECOMMENDS = SOLVER_FLAG_STRONG_RECOMMENDS;
3331 static const int SOLVER_FLAG_INSTALL_ALSO_UPDATES = SOLVER_FLAG_INSTALL_ALSO_UPDATES;
3333 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
3334 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
3335 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
3336 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
3337 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
3338 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
3339 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
3340 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
3341 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
3342 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
3343 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
3346 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
3352 int set_flag(int flag, int value) {
3353 return solver_set_flag($self, flag, value);
3355 int get_flag(int flag) {
3356 return solver_get_flag($self, flag);
3358 #if defined(SWIGPYTHON)
3360 def solve(self, jobs):
3362 for job in jobs: j += [job.how, job.what]
3363 return self.solve_helper(j)
3366 #if defined(SWIGPERL)
3368 sub solv::Solver::solve {
3369 my ($self, $jobs) = @_;
3370 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
3371 return $self->solve_helper(\@j);
3375 #if defined(SWIGRUBY)
3378 "class Solv::Solver\n"
3379 " def solve(jobs)\n"
3381 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
3382 " solve_helper(jl)\n"
3388 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
3389 %newobject solve_helper;
3390 Queue solve_helper(Queue jobs) {
3394 solver_solve($self, &jobs);
3395 cnt = solver_problem_count($self);
3396 for (i = 1; i <= cnt; i++)
3400 #if defined(SWIGTCL)
3401 %typemap(out) Queue solve Queue2Array(Problem *, 1, new_Problem(arg1, id));
3403 Queue solve(Queue solvejobs) {
3407 solver_solve($self, &solvejobs);
3408 cnt = solver_problem_count($self);
3409 for (i = 1; i <= cnt; i++)
3415 %newobject transaction;
3416 Transaction *transaction() {
3417 return solver_create_transaction($self);
3420 int describe_decision(XSolvable *s, XRule **OUTPUT) {
3422 int reason = solver_describe_decision($self, s->id, &ruleid);
3423 *OUTPUT = new_XRule($self, ruleid);
3427 %newobject describe_weakdep_decision_raw;
3428 Queue describe_weakdep_decision_raw(XSolvable *s) {
3431 solver_describe_weakdep_decision($self, s->id, &q);
3434 #if defined(SWIGPYTHON)
3436 def describe_weakdep_decision(self, s):
3437 d = iter(self.describe_weakdep_decision_raw(s))
3438 return [ (t, XSolvable(self.pool, sid), Dep(self.pool, id)) for t, sid, id in zip(d, d, d) ]
3441 #if defined(SWIGPERL)
3443 sub solv::Solver::describe_weakdep_decision {
3444 my ($self, $s) = @_;
3445 my $pool = $self->{'pool'};
3447 my @d = $self->describe_weakdep_decision_raw($s);
3448 push @res, [ splice(@d, 0, 3) ] while @d;
3449 return map { [ $_->[0], solv::XSolvable->new($pool, $_->[1]), solv::Dep->new($pool, $_->[2]) ] } @res;
3453 #if defined(SWIGRUBY)
3456 "class Solv::Solver\n"
3457 " def describe_weakdep_decision(s)\n"
3458 " 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"
3465 int alternatives_count() {
3466 return solver_alternatives_count($self);
3469 %newobject alternative;
3470 Alternative *alternative(Id aid) {
3471 Alternative *a = solv_calloc(1, sizeof(*a));
3473 queue_init(&a->choices);
3474 a->type = solver_get_alternative($self, aid, &a->dep_id, &a->from_id, &a->chosen_id, &a->choices, &a->level);
3476 queue_free(&a->choices);
3480 if (a->type == SOLVER_ALTERNATIVE_TYPE_RULE) {
3487 %typemap(out) Queue all_alternatives Queue2Array(Alternative *, 1, Solver_alternative(arg1, id));
3488 %newobject all_alternatives;
3489 Queue all_alternatives() {
3493 cnt = solver_alternatives_count($self);
3494 for (i = 1; i <= cnt; i++)
3499 bool write_testcase(const char *dir) {
3500 return testcase_write($self, dir, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0);
3503 Queue raw_decisions(int filter=0) {
3506 solver_get_decisionqueue($self, &q);
3509 for (i = j = 0; i < q.count; i++)
3510 if ((filter > 0 && q.elements[i] > 1) ||
3511 (filter < 0 && q.elements[i] < 0))
3512 q.elements[j++] = q.elements[i];
3513 queue_truncate(&q, j);
3518 %typemap(out) Queue get_recommended Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3519 %newobject get_recommended;
3520 Queue get_recommended(bool noselected=0) {
3523 solver_get_recommendations($self, &q, NULL, noselected);
3526 %typemap(out) Queue get_suggested Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3527 %newobject get_suggested;
3528 Queue get_suggested(bool noselected=0) {
3531 solver_get_recommendations($self, NULL, &q, noselected);
3536 %extend Transaction {
3537 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
3538 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
3539 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
3540 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
3541 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
3542 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
3543 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
3544 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
3545 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
3546 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
3547 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
3548 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
3549 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
3550 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
3551 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
3552 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
3553 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
3554 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
3555 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
3556 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
3557 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
3558 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
3559 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
3560 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
3561 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
3562 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
3563 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
3564 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
3566 transaction_free($self);
3569 %rename("isempty?") isempty;
3572 return $self->steps.count == 0;
3575 %newobject othersolvable;
3576 XSolvable *othersolvable(XSolvable *s) {
3577 Id op = transaction_obs_pkg($self, s->id);
3578 return new_XSolvable($self->pool, op);
3581 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3582 %newobject allothersolvables;
3583 Queue allothersolvables(XSolvable *s) {
3586 transaction_all_obs_pkgs($self, s->id, &q);
3590 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
3591 %newobject classify;
3592 Queue classify(int mode = 0) {
3595 transaction_classify($self, mode, &q);
3599 /* deprecated, use newsolvables instead */
3600 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3601 %newobject newpackages;
3602 Queue newpackages() {
3606 cut = transaction_installedresult(self, &q);
3607 queue_truncate(&q, cut);
3611 /* deprecated, use keptsolvables instead */
3612 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3613 %newobject keptpackages;
3614 Queue keptpackages() {
3618 cut = transaction_installedresult(self, &q);
3620 queue_deleten(&q, 0, cut);
3624 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3625 %newobject newsolvables;
3626 Queue newsolvables() {
3630 cut = transaction_installedresult(self, &q);
3631 queue_truncate(&q, cut);
3635 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3636 %newobject keptsolvables;
3637 Queue keptsolvables() {
3641 cut = transaction_installedresult(self, &q);
3643 queue_deleten(&q, 0, cut);
3647 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3651 queue_init_clone(&q, &$self->steps);
3655 int steptype(XSolvable *s, int mode) {
3656 return transaction_type($self, s->id, mode);
3658 int calc_installsizechange() {
3659 return transaction_calc_installsizechange($self);
3661 void order(int flags=0) {
3662 transaction_order($self, flags);
3666 %extend TransactionClass {
3667 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
3668 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
3669 cl->transaction = trans;
3673 cl->fromid = fromid;
3677 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
3678 %newobject solvables;
3682 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
3685 const char * const fromstr;
3686 const char * const tostr;
3688 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
3689 return pool_id2str(cl->transaction->pool, cl->fromid);
3691 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
3692 return pool_id2str(cl->transaction->pool, cl->toid);
3698 XRule(Solver *solv, Id id) {
3701 XRule *xr = solv_calloc(1, sizeof(*xr));
3708 SWIGINTERN int XRule_type_get(XRule *xr) {
3709 return solver_ruleclass(xr->solv, xr->id);
3714 Id type, source, target, dep;
3715 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
3716 return new_Ruleinfo($self, type, source, target, dep);
3718 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
3719 %newobject allinfos;
3723 solver_allruleinfos($self->solv, $self->id, &q);
3727 #if defined(SWIGTCL)
3728 %rename("==") __eq__;
3730 bool __eq__(XRule *xr) {
3731 return $self->solv == xr->solv && $self->id == xr->id;
3733 #if defined(SWIGTCL)
3734 %rename("!=") __ne__;
3736 bool __ne__(XRule *xr) {
3737 return !XRule___eq__($self, xr);
3739 #if defined(SWIGPYTHON)
3744 #if defined(SWIGPERL) || defined(SWIGTCL)
3745 %rename("repr") __repr__;
3747 %newobject __repr__;
3748 const char *__repr__() {
3750 sprintf(buf, "<Rule #%d>", $self->id);
3751 return solv_strdup(buf);
3756 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3757 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3761 ri->source = source;
3762 ri->target = target;
3763 ri->dep_id = dep_id;
3766 %newobject solvable;
3767 XSolvable * const solvable;
3768 %newobject othersolvable;
3769 XSolvable * const othersolvable;
3773 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3774 return new_XSolvable(ri->solv->pool, ri->source);
3776 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3777 return new_XSolvable(ri->solv->pool, ri->target);
3779 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3780 return new_Dep(ri->solv->pool, ri->dep_id);
3783 const char *problemstr() {
3784 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3789 XRepodata(Repo *repo, Id id) {
3790 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3796 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3798 void set_id(Id solvid, Id keyname, DepId id) {
3799 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3801 void set_str(Id solvid, Id keyname, const char *str) {
3802 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3804 void set_poolstr(Id solvid, Id keyname, const char *str) {
3805 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3807 void add_idarray(Id solvid, Id keyname, DepId id) {
3808 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3810 void add_flexarray(Id solvid, Id keyname, Id handle) {
3811 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3813 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3814 const unsigned char *buf = solv_chksum_get(chksum, 0);
3816 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3818 void set_sourcepkg(Id solvid, const char *sourcepkg) {
3819 repodata_set_sourcepkg(repo_id2repodata($self->repo, $self->id), solvid, sourcepkg);
3821 const char *lookup_str(Id solvid, Id keyname) {
3822 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3824 Queue lookup_idarray(Id solvid, Id keyname) {
3827 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3830 %newobject lookup_checksum;
3831 Chksum *lookup_checksum(Id solvid, Id keyname) {
3833 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3834 return solv_chksum_create_from_bin(type, b);
3836 void internalize() {
3837 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3839 void create_stubs() {
3840 Repodata *data = repo_id2repodata($self->repo, $self->id);
3841 data = repodata_create_stubs(data);
3842 $self->id = data->repodataid;
3844 bool write(FILE *fp) {
3845 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3847 bool add_solv(FILE *fp, int flags = 0) {
3848 Repodata *data = repo_id2repodata($self->repo, $self->id);
3849 int r, oldstate = data->state;
3850 data->state = REPODATA_LOADING;
3851 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3852 if (r || data->state == REPODATA_LOADING)
3853 data->state = oldstate;
3856 void extend_to_repo() {
3857 Repodata *data = repo_id2repodata($self->repo, $self->id);
3858 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3860 #if defined(SWIGTCL)
3861 %rename("==") __eq__;
3863 bool __eq__(XRepodata *xr) {
3864 return $self->repo == xr->repo && $self->id == xr->id;
3866 #if defined(SWIGTCL)
3867 %rename("!=") __ne__;
3869 bool __ne__(XRepodata *xr) {
3870 return !XRepodata___eq__($self, xr);
3872 #if defined(SWIGPYTHON)
3877 #if defined(SWIGPERL) || defined(SWIGTCL)
3878 %rename("repr") __repr__;
3880 %newobject __repr__;
3881 const char *__repr__() {
3883 sprintf(buf, "<Repodata #%d>", $self->id);
3884 return solv_strdup(buf);
3888 #ifdef ENABLE_PUBKEY
3891 return solvsig_create(fp);
3894 solvsig_free($self);
3898 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3900 #ifdef ENABLE_PGPVRFY
3902 XSolvable *verify(Repo *repo, Chksum *chksum) {
3903 Id p = solvsig_verify($self, repo, chksum);
3904 return new_XSolvable(repo->pool, p);
3910 %extend Alternative {
3911 static const int SOLVER_ALTERNATIVE_TYPE_RULE = SOLVER_ALTERNATIVE_TYPE_RULE;
3912 static const int SOLVER_ALTERNATIVE_TYPE_RECOMMENDS = SOLVER_ALTERNATIVE_TYPE_RECOMMENDS;
3913 static const int SOLVER_ALTERNATIVE_TYPE_SUGGESTS = SOLVER_ALTERNATIVE_TYPE_SUGGESTS;
3916 queue_free(&$self->choices);
3920 XSolvable * const chosen;
3923 %newobject depsolvable;
3924 XSolvable * const depsolvable;
3928 SWIGINTERN XSolvable *Alternative_chosen_get(Alternative *a) {
3929 return new_XSolvable(a->solv->pool, a->chosen_id);
3931 SWIGINTERN XRule *Alternative_rule_get(Alternative *a) {
3932 return new_XRule(a->solv, a->rid);
3934 SWIGINTERN XSolvable *Alternative_depsolvable_get(Alternative *a) {
3935 return new_XSolvable(a->solv->pool, a->from_id);
3937 SWIGINTERN Dep *Alternative_dep_get(Alternative *a) {
3938 return new_Dep(a->solv->pool, a->dep_id);
3942 Queue choices_raw() {
3944 queue_init_clone(&r, &$self->choices);
3948 %typemap(out) Queue choices Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
3952 queue_init_clone(&r, &$self->choices);
3953 for (i = 0; i < r.count; i++)
3954 if (r.elements[i] < 0)
3955 r.elements[i] = -r.elements[i];
3959 #if defined(SWIGPERL) || defined(SWIGTCL)
3960 %rename("str") __str__;
3962 const char *__str__() {
3963 return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
3967 #if defined(SWIGTCL)
3970 "proc solv::iter {varname iter body} {\n"\
3972 " set value [$iter __next__]\n"\
3973 " if {$value eq \"NULL\"} { break }\n"\
3974 " uplevel [list set $varname $value]\n"\
3975 " set code [catch {uplevel $body} result]\n"\
3976 " switch -exact -- $code {\n"\
3980 " default { return -code $code $result }\n"\