2 * WARNING: for perl iterator/array support you need to run
3 * sed -i -e 's/SvTYPE(tsv) == SVt_PVHV/SvTYPE(tsv) == SVt_PVHV || SvTYPE(tsv) == SVt_PVAV/'
4 * on the generated c code
10 %markfunc Pool "mark_Pool";
14 ** binaryblob handling
24 %typemap(in,noblock=1,fragment="SWIG_AsCharPtrAndSize") (const unsigned char *str, size_t len) (int res, char *buf = 0, size_t size = 0, int alloc = 0) {
30 ba = Tcl_GetByteArrayFromObj($input, &bal);
39 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
43 if (!SWIG_IsOK(res)) {
44 #if defined(SWIGPYTHON)
45 const void *pybuf = 0;
46 Py_ssize_t pysize = 0;
47 res = PyObject_AsReadBuffer($input, &pybuf, &pysize);
49 %argument_fail(res, "BinaryBlob", $symname, $argnum);
55 %argument_fail(res, "const char *", $symname, $argnum);
58 $1 = (unsigned char *)buf;
62 %typemap(freearg,noblock=1,match="in") (const unsigned char *str, int len) {
63 if (alloc$argnum == SWIG_NEWOBJ) %delete_array(buf$argnum);
66 %typemap(out,noblock=1,fragment="SWIG_FromCharPtrAndSize") BinaryBlob {
67 #if defined(SWIGPYTHON) && defined(PYTHON3)
68 $result = $1.data ? Py_BuildValue("y#", $1.data, $1.len) : SWIG_Py_Void();
69 #elif defined(SWIGTCL)
70 Tcl_SetObjResult(interp, $1.data ? Tcl_NewByteArrayObj($1.data, $1.len) : NULL);
72 $result = SWIG_FromCharPtrAndSize($1.data, $1.len);
83 %typemap(arginit) Queue {
86 %typemap(freearg) Queue {
90 #if defined(SWIGPYTHON)
92 /* Check if is a list */
93 if (PyList_Check($input)) {
94 int size = PyList_Size($input);
96 for (i = 0; i < size; i++) {
97 PyObject *o = PyList_GetItem($input,i);
99 int e = SWIG_AsVal_int(o, &v);
101 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
105 SWIG_exception_fail(SWIG_TypeError, "list must contain only integers");
109 %typemap(out) Queue {
111 PyObject *o = PyList_New($1.count);
112 for (i = 0; i < $1.count; i++)
113 PyList_SetItem(o, i, SWIG_From_int($1.elements[i]));
118 %define Queue2Array(type, step, con) %{
120 int cnt = $1.count / step;
121 Id *idp = $1.elements;
122 PyObject *o = PyList_New(cnt);
123 for (i = 0; i < cnt; i++, idp += step)
126 #define result resultx
129 PyList_SetItem(o, i, $result);
138 #endif /* SWIGPYTHON */
140 #if defined(SWIGPERL)
144 if (!SvROK($input) || SvTYPE(SvRV($input)) != SVt_PVAV)
145 SWIG_croak("Argument $argnum is not an array reference.");
146 av = (AV*)SvRV($input);
148 for (i = 0; i <= size; i++) {
149 SV **sv = av_fetch(av, i, 0);
151 int e = SWIG_AsVal_int(*sv, &v);
153 SWIG_croak("list must contain only integers");
159 * av_push(o, SvREFCNT_inc(SWIG_From_int($1.elements[i])));
160 * $result = newRV_noinc((SV*)o); argvi++;
162 %typemap(out) Queue {
164 if (argvi + $1.count + 1 >= items) {
165 EXTEND(sp, (argvi + $1.count + 1) - items + 1);
167 for (i = 0; i < $1.count; i++)
168 ST(argvi++) = SvREFCNT_inc(SWIG_From_int($1.elements[i]));
173 %define Queue2Array(type, step, con) %{
175 int cnt = $1.count / step;
176 Id *idp = $1.elements;
177 if (argvi + cnt + 1 >= items) {
178 EXTEND(sp, (argvi + cnt + 1) - items + 1);
180 for (i = 0; i < cnt; i++, idp += step)
183 #define result resultx
186 SvREFCNT_inc(ST(argvi - 1));
194 #endif /* SWIGPERL */
197 #if defined(SWIGRUBY)
201 ary = rb_Array($input);
202 size = RARRAY_LEN(ary);
205 for (i = 0; i < size; i++, o++) {
207 int e = SWIG_AsVal_int(*o, &v);
209 SWIG_exception_fail(SWIG_TypeError, "list must contain only integers");
213 %typemap(out) Queue {
215 VALUE o = rb_ary_new2($1.count);
216 for (i = 0; i < $1.count; i++)
217 rb_ary_store(o, i, SWIG_From_int($1.elements[i]));
221 %typemap(arginit) Queue {
224 %typemap(freearg) Queue {
227 %define Queue2Array(type, step, con) %{
229 int cnt = $1.count / step;
230 Id *idp = $1.elements;
231 VALUE o = rb_ary_new2(cnt);
232 for (i = 0; i < cnt; i++, idp += step)
235 #define result resultx
238 rb_ary_store(o, i, $result);
246 #endif /* SWIGRUBY */
250 /* Check if is a list */
254 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
255 SWIG_exception_fail(SWIG_TypeError, "argument is not a list");
256 for (i = 0; i < size; i++) {
260 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
261 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
262 e = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(o, &v);
264 SWIG_exception_fail(SWIG_ArgError(e), "list must contain only integers");
269 %typemap(out) Queue {
270 Tcl_Obj *objvx[$1.count];
273 for (i = 0; i < $1.count; i++) {
274 objvx[i] = SWIG_From_int($1.elements[i]);
276 Tcl_SetObjResult(interp, Tcl_NewListObj($1.count, objvx));
280 %define Queue2Array(type, step, con) %{
281 { /* scope is needed to make the goto of SWIG_exception_fail work */
283 int cnt = $1.count / step;
284 Id *idp = $1.elements;
287 for (i = 0; i < cnt; i++, idp += step) {
289 #define result resultx
290 #define Tcl_SetObjResult(i, x) resultobj = x
294 objvx[i] = resultobj;
295 #undef Tcl_SetObjResult
299 Tcl_SetObjResult(interp, Tcl_NewListObj(cnt, objvx));
305 %typemap(in) Queue solvejobs {
306 /* Check if is a list */
310 if (TCL_OK != Tcl_ListObjLength(interp, $input, &size))
311 SWIG_exception_fail(SWIG_TypeError, "argument is not a list");
312 for (i = 0; i < size; i++) {
318 if (TCL_OK != Tcl_ListObjIndex(interp, $input, i, &o))
319 SWIG_exception_fail(SWIG_IndexError, "failed to retrieve a list member");
320 e = SWIG_ConvertPtr(o, &jp ,SWIGTYPE_p_Job, 0 | 0 );
322 SWIG_exception_fail(SWIG_ArgError(e), "list member is not a Job");
324 queue_push2(&$1, j->how, j->what);
331 #if defined(SWIGPERL)
333 /* work around a swig bug */
337 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
339 # ifndef MULTIPLICITY
340 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
342 # define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
348 %define perliter(class)
351 my $i = ${##class##::ITERATORS}{$_[0]};
353 $_[1] == $i->[0] - 1 ? $i->[1] : undef;
355 $_[0]->__getitem__($_[1]);
358 sub class##::FETCHSIZE {
359 my $i = ${##class##::ITERATORS}{$_[0]};
361 ($i->[1] = $_[0]->__next__()) ? ++$i->[0] : 0;
371 #define SWIG_PERL_ITERATOR 0x80
373 SWIGRUNTIMEINLINE SV *
374 SWIG_Perl_NewArrayObj(SWIG_MAYBE_PERL_OBJECT void *ptr, swig_type_info *t, int flags) {
375 SV *result = sv_newmortal();
376 if (ptr && (flags & (SWIG_SHADOW | SWIG_POINTER_OWN))) {
381 sv_setref_pv(obj, (char *) SWIG_Perl_TypeProxyName(t), ptr);
382 stash=SvSTASH(SvRV(obj));
383 if (flags & SWIG_POINTER_OWN) {
385 GV *gv=*(GV**)hv_fetch(stash, "OWNER", 5, TRUE);
387 gv_init(gv, stash, "OWNER", 5, FALSE);
389 hv_store_ent(hv, obj, newSViv(1), 0);
391 if (flags & SWIG_PERL_ITERATOR) {
393 GV *gv=*(GV**)hv_fetch(stash, "ITERATORS", 9, TRUE);
396 gv_init(gv, stash, "ITERATORS", 9, FALSE);
398 hv_store_ent(hv, obj, newRV_inc((SV *)av), 0);
400 sv_magic((SV *)array, (SV *)obj, 'P', Nullch, 0);
402 self=newRV_noinc((SV *)array);
403 sv_setsv(result, self);
404 SvREFCNT_dec((SV *)self);
405 sv_bless(result, stash);
407 sv_setref_pv(result, (char *) SWIG_Perl_TypeProxyName(t), ptr);
414 %typemap(out) Perlarray {
415 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow); argvi++;
417 %typemap(out) Perliterator {
418 ST(argvi) = SWIG_Perl_NewArrayObj(SWIG_PERL_OBJECT_CALL SWIG_as_voidptr(result), $1_descriptor, $owner | $shadow | SWIG_PERL_ITERATOR); argvi++;
421 %typemap(out) Pool_solvable_iterator * = Perlarray;
422 %typemap(out) Pool_solvable_iterator * solvables_iter = Perliterator;
423 %typemap(out) Pool_repo_iterator * = Perlarray;
424 %typemap(out) Pool_repo_iterator * repos_iter = Perliterator;
425 %typemap(out) Repo_solvable_iterator * = Perlarray;
426 %typemap(out) Repo_solvable_iterator * solvables_iter = Perliterator;
427 %typemap(out) Dataiterator * = Perliterator;
429 #endif /* SWIGPERL */
436 #if defined(SWIGPYTHON)
437 typedef PyObject *AppObjectPtr;
438 %typemap(in) AppObjectPtr {
443 %typemap(out) AppObjectPtr {
444 $result = $1 ? $1 : Py_None;
447 #elif defined(SWIGPERL)
448 typedef SV *AppObjectPtr;
449 %typemap(in) AppObjectPtr {
452 sv_setsv((SV *)$1, $input);
456 %typemap(out) AppObjectPtr {
457 $result = sv_2mortal($1 ? SvREFCNT_inc($1) : newSV(0));
460 #elif defined(SWIGRUBY)
461 typedef VALUE AppObjectPtr;
462 %typemap(in) AppObjectPtr {
465 %typemap(out) AppObjectPtr {
468 #elif defined(SWIGTCL)
469 typedef Tcl_Obj *AppObjectPtr;
470 %typemap(in) AppObjectPtr {
472 Tcl_IncrRefCount($input);
475 %typemap(out) AppObjectPtr {
476 Tcl_SetObjResult(interp, $1 ? $1 : Tcl_NewObj());
479 #warning AppObjectPtr not defined for this language!
489 %fragment("SWIG_AsValFilePtr","header") {}
493 %fragment("SWIG_AsValSolvFpPtr","header", fragment="SWIG_AsValFilePtr") {
497 SWIG_AsValSolvFpPtr(VALUE obj, FILE **val) {
498 #elif defined(SWIGTCL)
499 SWIG_AsValSolvFpPtr SWIG_TCL_DECL_ARGS_2(void *obj, FILE **val) {
501 SWIG_AsValSolvFpPtr(void *obj, FILE **val) {
503 static swig_type_info* desc = 0;
507 if (!desc) desc = SWIG_TypeQuery("SolvFp *");
508 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
510 *val = vptr ? ((SolvFp *)vptr)->fp : 0;
514 ecode = SWIG_AsValFilePtr(obj, val);
515 if (ecode == SWIG_OK)
518 return SWIG_TypeError;
522 #define SWIG_AsValSolvFpPtr(x, y) SWIG_AsValSolvFpPtr SWIG_TCL_CALL_ARGS_2(x, y)
532 %fragment("SWIG_AsValDepId","header") {
536 SWIG_AsValDepId(VALUE obj, int *val) {
537 #elif defined(SWIGTCL)
538 SWIG_AsValDepId SWIG_TCL_DECL_ARGS_2(void *obj, int *val) {
540 SWIG_AsValDepId(void *obj, int *val) {
542 static swig_type_info* desc = 0;
545 if (!desc) desc = SWIG_TypeQuery("Dep *");
547 ecode = SWIG_AsVal_int SWIG_TCL_CALL_ARGS_2(obj, val);
549 ecode = SWIG_AsVal_int(obj, val);
551 if (SWIG_IsOK(ecode))
553 if ((SWIG_ConvertPtr(obj, &vptr, desc, 0)) == SWIG_OK) {
555 *val = vptr ? ((Dep *)vptr)->id : 0;
558 return SWIG_TypeError;
562 #define SWIG_AsValDepId(x, y) SWIG_AsValDepId SWIG_TCL_CALL_ARGS_2(x, y)
567 ** Pool disown helper
570 %typemap(out) disown_helper {
571 #if defined(SWIGRUBY)
572 SWIG_ConvertPtr(self, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
573 #elif defined(SWIGPYTHON)
574 SWIG_ConvertPtr(obj0, &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
575 #elif defined(SWIGPERL)
576 SWIG_ConvertPtr(ST(0), &argp1,SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0 );
577 #elif defined(SWIGTCL)
578 SWIG_ConvertPtr(objv[1], &argp1, SWIGTYPE_p_Pool, SWIG_POINTER_DISOWN | 0);
580 #warning disown_helper not implemented for this language, this is likely going to leak memory
584 Tcl_SetObjResult(interp, SWIG_From_int((int)(0)));
586 $result = SWIG_From_int((int)(0));
595 %include "typemaps.i"
597 %typemap(in,numinputs=0,noblock=1) XRule **OUTPUT ($*1_ltype temp) {
600 %typemap(argout,noblock=1) XRule **OUTPUT {
601 %append_output(SWIG_NewPointerObj((void*)(*$1), SWIGTYPE_p_XRule, SWIG_POINTER_OWN | %newpointer_flags));
604 %typemaps_asval(%checkcode(POINTER), SWIG_AsValSolvFpPtr, "SWIG_AsValSolvFpPtr", FILE*);
605 %typemaps_asval(%checkcode(INT32), SWIG_AsValDepId, "SWIG_AsValDepId", DepId);
609 ** the C declarations
615 #include <sys/stat.h>
616 #include <sys/utsname.h>
617 #include <sys/types.h>
621 /* argh, swig undefs bool for perl */
627 #include "poolarch.h"
631 #include "solverdebug.h"
632 #include "repo_solv.h"
634 #include "selection.h"
636 #include "repo_write.h"
637 #if defined(ENABLE_RPMDB) || defined(ENABLE_RPMPKG)
638 #include "repo_rpmdb.h"
641 #include "repo_pubkey.h"
644 #include "repo_deb.h"
647 #include "repo_rpmmd.h"
648 #include "repo_updateinfoxml.h"
649 #include "repo_deltainfoxml.h"
650 #include "repo_repomdxml.h"
652 #ifdef ENABLE_SUSEREPO
653 #include "repo_products.h"
654 #include "repo_susetags.h"
655 #include "repo_content.h"
657 #ifdef ENABLE_MDKREPO
658 #include "repo_mdk.h"
660 #ifdef ENABLE_ARCHREPO
661 #include "repo_arch.h"
664 #include "repo_autopattern.h"
666 #include "solv_xfopen.h"
667 #include "testcase.h"
669 /* for old ruby versions */
671 #define RARRAY_PTR(ary) (RARRAY(ary)->ptr)
674 #define RARRAY_LEN(ary) (RARRAY(ary)->len)
677 #define SOLVER_SOLUTION_ERASE -100
678 #define SOLVER_SOLUTION_REPLACE -101
679 #define SOLVER_SOLUTION_REPLACE_DOWNGRADE -102
680 #define SOLVER_SOLUTION_REPLACE_ARCHCHANGE -103
681 #define SOLVER_SOLUTION_REPLACE_VENDORCHANGE -104
682 #define SOLVER_SOLUTION_REPLACE_NAMECHANGE -105
684 typedef void *AppObjectPtr;
710 } Pool_solvable_iterator;
715 } Pool_repo_iterator;
720 } Repo_solvable_iterator;
771 Transaction *transaction;
789 typedef Dataiterator Datamatch;
791 typedef int disown_helper;
808 SWIGINTERN void appdata_disown_helper(void *appdata) {
810 SWIGINTERN void appdata_clr_helper(void **appdatap) {
813 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
816 SWIGINTERN void *appdata_get_helper(void *appdata) {
821 #elif defined(SWIGTCL)
824 SWIGINTERN void appdata_disown_helper(void *appdata) {
826 SWIGINTERN void appdata_clr_helper(void **appdatap) {
828 Tcl_DecrRefCount((Tcl_Obj *)(*appdatap));
831 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
832 appdata_clr_helper(appdatap);
835 SWIGINTERN void *appdata_get_helper(void *appdata) {
840 #elif defined(SWIGPYTHON)
843 SWIGINTERN void appdata_disown_helper(void *appdata) {
844 struct myappdata *myappdata = appdata;
845 if (!myappdata || !myappdata->appdata || myappdata->disowned)
847 myappdata->disowned = 1;
848 Py_DECREF((PyObject *)myappdata->appdata);
850 SWIGINTERN void appdata_clr_helper(void **appdatap) {
851 struct myappdata *myappdata = *(struct myappdata **)appdatap;
852 if (myappdata && myappdata->appdata && !myappdata->disowned) {
853 Py_DECREF((PyObject *)myappdata->appdata);
855 *appdatap = solv_free(myappdata);
857 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
858 appdata_clr_helper(appdatap);
860 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
861 myappdata->appdata = appdata;
864 SWIGINTERN void *appdata_get_helper(void *appdata) {
865 return appdata ? ((struct myappdata *)appdata)->appdata : 0;
870 #elif defined(SWIGPERL)
873 SWIGINTERN void appdata_disown_helper(void *appdata) {
874 struct myappdata *myappdata = appdata;
876 if (!myappdata || !myappdata->appdata || myappdata->disowned)
878 rsv = myappdata->appdata;
881 myappdata->appdata = SvRV(rsv);
882 myappdata->disowned = 1;
885 SWIGINTERN void appdata_clr_helper(void **appdatap) {
886 struct myappdata *myappdata = *(struct myappdata **)appdatap;
887 if (myappdata && myappdata->appdata && !myappdata->disowned) {
888 SvREFCNT_dec((SV *)myappdata->appdata);
890 *appdatap = solv_free(myappdata);
892 SWIGINTERN void appdata_set_helper(void **appdatap, void *appdata) {
893 appdata_clr_helper(appdatap);
895 struct myappdata *myappdata = *appdatap = solv_calloc(sizeof(struct myappdata), 1);
896 myappdata->appdata = appdata;
899 SWIGINTERN void *appdata_get_helper(void *appdata) {
900 struct myappdata *myappdata = appdata;
901 if (!myappdata || !myappdata->appdata)
903 return myappdata->disowned ? newRV_noinc((SV *)myappdata->appdata) : myappdata->appdata;
909 #warning appdata helpers not implemented for this language
914 ** the SWIG declarations defining the API
918 %mixin Dataiterator "Enumerable";
919 %mixin Pool_solvable_iterator "Enumerable";
920 %mixin Pool_repo_iterator "Enumerable";
921 %mixin Repo_solvable_iterator "Enumerable";
928 /* from repodata.h */
929 %constant Id SOLVID_META;
930 %constant Id SOLVID_POS;
932 %constant int REL_EQ;
933 %constant int REL_GT;
934 %constant int REL_LT;
935 %constant int REL_ARCH;
936 %constant int REL_AND;
937 %constant int REL_OR;
938 %constant int REL_WITH;
939 %constant int REL_COND;
940 %constant int REL_ELSE;
951 /* put before pool/repo so we can access the constructor */
952 %nodefaultdtor Dataiterator;
953 typedef struct {} Dataiterator;
976 typedef struct {} Pool_solvable_iterator;
977 typedef struct {} Pool_repo_iterator;
978 typedef struct {} Repo_solvable_iterator;
980 %nodefaultctor Datamatch;
981 %nodefaultdtor Datamatch;
988 %nodefaultctor Datapos;
1000 %nodefaultdtor Pool;
1004 %nodefaultctor Repo;
1005 %nodefaultdtor Repo;
1008 const char * const name;
1011 int const nsolvables;
1014 %nodefaultctor Solver;
1015 %nodefaultdtor Solver;
1023 #ifdef ENABLE_PUBKEY
1026 unsigned int const created;
1027 unsigned int const expires;
1028 const char * const keyid;
1032 %rename(xfopen) solvfp_xfopen;
1033 %rename(xfopen_fd) solvfp_xfopen_fd;
1035 %nodefaultctor SolvFp;
1039 %newobject solvfp_xfopen;
1040 %newobject solvfp_xfopen_fd;
1042 SolvFp *solvfp_xfopen(const char *fn, const char *mode = 0);
1043 SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode = 0);
1046 SWIGINTERN SolvFp *solvfp_xfopen_fd(const char *fn, int fd, const char *mode) {
1052 fcntl(fd, F_SETFD, FD_CLOEXEC);
1053 fp = solv_xfopen_fd(fn, fd, mode);
1058 sfp = solv_calloc(1, sizeof(SolvFp));
1062 SWIGINTERN SolvFp *solvfp_xfopen(const char *fn, const char *mode) {
1065 fp = solv_xfopen(fn, mode);
1068 if (fileno(fp) != -1)
1069 fcntl(fileno(fp), F_SETFD, FD_CLOEXEC);
1070 sfp = solv_calloc(1, sizeof(SolvFp));
1077 Solver * const solv;
1082 Solver * const solv;
1090 Id const solutionid;
1095 %nodefaultctor Alternative;
1106 %nodefaultctor Transaction;
1107 %nodefaultdtor Transaction;
1113 Transaction * const transaction;
1127 return $self->fp ? fileno($self->fp) : -1;
1130 return $self->fp ? dup(fileno($self->fp)) : -1;
1132 bool write(const unsigned char *str, size_t len) {
1133 return fwrite(str, len, 1, $self->fp) == 1;
1138 return fflush($self->fp) == 0;
1144 ret = fclose($self->fp) == 0;
1148 void cloexec(bool state) {
1149 if (!$self->fp || fileno($self->fp) == -1)
1151 fcntl(fileno($self->fp), F_SETFD, state ? FD_CLOEXEC : 0);
1156 static const Id SOLVER_SOLVABLE = SOLVER_SOLVABLE;
1157 static const Id SOLVER_SOLVABLE_NAME = SOLVER_SOLVABLE_NAME;
1158 static const Id SOLVER_SOLVABLE_PROVIDES = SOLVER_SOLVABLE_PROVIDES;
1159 static const Id SOLVER_SOLVABLE_ONE_OF = SOLVER_SOLVABLE_ONE_OF;
1160 static const Id SOLVER_SOLVABLE_REPO = SOLVER_SOLVABLE_REPO;
1161 static const Id SOLVER_SOLVABLE_ALL = SOLVER_SOLVABLE_ALL;
1162 static const Id SOLVER_SELECTMASK = SOLVER_SELECTMASK;
1163 static const Id SOLVER_NOOP = SOLVER_NOOP;
1164 static const Id SOLVER_INSTALL = SOLVER_INSTALL;
1165 static const Id SOLVER_ERASE = SOLVER_ERASE;
1166 static const Id SOLVER_UPDATE = SOLVER_UPDATE;
1167 static const Id SOLVER_WEAKENDEPS = SOLVER_WEAKENDEPS;
1168 static const Id SOLVER_MULTIVERSION = SOLVER_MULTIVERSION;
1169 static const Id SOLVER_LOCK = SOLVER_LOCK;
1170 static const Id SOLVER_DISTUPGRADE = SOLVER_DISTUPGRADE;
1171 static const Id SOLVER_VERIFY = SOLVER_VERIFY;
1172 static const Id SOLVER_DROP_ORPHANED = SOLVER_DROP_ORPHANED;
1173 static const Id SOLVER_USERINSTALLED = SOLVER_USERINSTALLED;
1174 static const Id SOLVER_ALLOWUNINSTALL = SOLVER_ALLOWUNINSTALL;
1175 static const Id SOLVER_FAVOR = SOLVER_FAVOR;
1176 static const Id SOLVER_DISFAVOR = SOLVER_DISFAVOR;
1177 static const Id SOLVER_JOBMASK = SOLVER_JOBMASK;
1178 static const Id SOLVER_WEAK = SOLVER_WEAK;
1179 static const Id SOLVER_ESSENTIAL = SOLVER_ESSENTIAL;
1180 static const Id SOLVER_CLEANDEPS = SOLVER_CLEANDEPS;
1181 static const Id SOLVER_FORCEBEST = SOLVER_FORCEBEST;
1182 static const Id SOLVER_TARGETED = SOLVER_TARGETED;
1183 static const Id SOLVER_NOTBYUSER = SOLVER_NOTBYUSER;
1184 static const Id SOLVER_SETEV = SOLVER_SETEV;
1185 static const Id SOLVER_SETEVR = SOLVER_SETEVR;
1186 static const Id SOLVER_SETARCH = SOLVER_SETARCH;
1187 static const Id SOLVER_SETVENDOR = SOLVER_SETVENDOR;
1188 static const Id SOLVER_SETREPO = SOLVER_SETREPO;
1189 static const Id SOLVER_SETNAME = SOLVER_SETNAME;
1190 static const Id SOLVER_NOAUTOSET = SOLVER_NOAUTOSET;
1191 static const Id SOLVER_SETMASK = SOLVER_SETMASK;
1193 Job(Pool *pool, int how, Id what) {
1194 Job *job = solv_calloc(1, sizeof(*job));
1201 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1202 %newobject solvables;
1206 pool_job2solvables($self->pool, &q, $self->how, $self->what);
1210 %rename("isemptyupdate?") isemptyupdate;
1212 bool isemptyupdate() {
1213 return pool_isemptyupdatejob($self->pool, $self->how, $self->what);
1216 #if defined(SWIGTCL)
1217 %rename("==") __eq__;
1219 bool __eq__(Job *j) {
1220 return $self->pool == j->pool && $self->how == j->how && $self->what == j->what;
1222 #if defined(SWIGTCL)
1223 %rename("!=") __ne__;
1225 bool __ne__(Job *j) {
1226 return !Job___eq__($self, j);
1228 #if defined(SWIGPERL) || defined(SWIGTCL)
1229 %rename("str") __str__;
1231 const char *__str__() {
1232 return pool_job2str($self->pool, $self->how, $self->what, 0);
1234 #if defined(SWIGPERL) || defined(SWIGTCL)
1235 %rename("repr") __repr__;
1237 const char *__repr__() {
1238 const char *str = pool_job2str($self->pool, $self->how, $self->what, ~0);
1239 return pool_tmpjoin($self->pool, "<Job ", str, ">");
1244 static const Id SELECTION_NAME = SELECTION_NAME;
1245 static const Id SELECTION_PROVIDES = SELECTION_PROVIDES;
1246 static const Id SELECTION_FILELIST = SELECTION_FILELIST;
1247 static const Id SELECTION_CANON = SELECTION_CANON;
1248 static const Id SELECTION_DOTARCH = SELECTION_DOTARCH;
1249 static const Id SELECTION_REL = SELECTION_REL;
1250 static const Id SELECTION_INSTALLED_ONLY = SELECTION_INSTALLED_ONLY;
1251 static const Id SELECTION_GLOB = SELECTION_GLOB;
1252 static const Id SELECTION_FLAT = SELECTION_FLAT;
1253 static const Id SELECTION_NOCASE = SELECTION_NOCASE;
1254 static const Id SELECTION_SOURCE_ONLY = SELECTION_SOURCE_ONLY;
1255 static const Id SELECTION_WITH_SOURCE = SELECTION_WITH_SOURCE;
1257 Selection(Pool *pool) {
1259 s = solv_calloc(1, sizeof(*s));
1265 queue_free(&$self->q);
1269 return $self->flags;
1272 %rename("isempty?") isempty;
1275 return $self->q.count == 0;
1277 void filter(Selection *lsel) {
1278 if ($self->pool != lsel->pool)
1279 queue_empty(&$self->q);
1281 selection_filter($self->pool, &$self->q, &lsel->q);
1283 void add(Selection *lsel) {
1284 if ($self->pool == lsel->pool)
1286 selection_add($self->pool, &$self->q, &lsel->q);
1287 $self->flags |= lsel->flags;
1290 void add_raw(Id how, Id what) {
1291 queue_push2(&$self->q, how, what);
1293 %typemap(out) Queue jobs Queue2Array(Job *, 2, new_Job(arg1->pool, id, idp[1]));
1295 Queue jobs(int flags) {
1298 queue_init_clone(&q, &$self->q);
1299 for (i = 0; i < q.count; i += 2)
1300 q.elements[i] |= flags;
1304 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
1305 %newobject solvables;
1309 selection_solvables($self->pool, &$self->q, &q);
1313 #if defined(SWIGPERL) || defined(SWIGTCL)
1314 %rename("str") __str__;
1316 const char *__str__() {
1317 return pool_selection2str($self->pool, &$self->q, 0);
1319 #if defined(SWIGPERL) || defined(SWIGTCL)
1320 %rename("repr") __repr__;
1322 const char *__repr__() {
1323 const char *str = pool_selection2str($self->pool, &$self->q, ~0);
1324 return pool_tmpjoin($self->pool, "<Selection ", str, ">");
1330 return solv_chksum_create(type);
1332 Chksum(Id type, const char *hex) {
1333 unsigned char buf[64];
1334 int l = solv_chksum_len(type);
1337 if (solv_hex2bin(&hex, buf, sizeof(buf)) != l || hex[0])
1339 return solv_chksum_create_from_bin(type, buf);
1341 %newobject from_bin;
1342 static Chksum *from_bin(Id type, const unsigned char *str, size_t len) {
1343 return len == solv_chksum_len(type) ? solv_chksum_create_from_bin(type, str) : 0;
1345 #if defined(SWIGPERL)
1347 undef *solv::Chksum::from_bin;
1348 *solv::Chksum::from_bin = sub {
1350 my $self = solvc::Chksum_from_bin(@_);
1351 bless $self, $pkg if defined $self;
1356 solv_chksum_free($self, 0);
1360 SWIGINTERN Id Chksum_type_get(Chksum *chk) {
1361 return solv_chksum_get_type(chk);
1364 void add(const unsigned char *str, size_t len) {
1365 solv_chksum_add($self, str, (int)len);
1367 void add_fp(FILE *fp) {
1370 while ((l = fread(buf, 1, sizeof(buf), fp)) > 0)
1371 solv_chksum_add($self, buf, l);
1372 rewind(fp); /* convenience */
1374 void add_fd(int fd) {
1377 while ((l = read(fd, buf, sizeof(buf))) > 0)
1378 solv_chksum_add($self, buf, l);
1379 lseek(fd, 0, 0); /* convenience */
1381 void add_stat(const char *filename) {
1383 if (stat(filename, &stb))
1384 memset(&stb, 0, sizeof(stb));
1385 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1386 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1387 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1388 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1390 void add_fstat(int fd) {
1392 if (fstat(fd, &stb))
1393 memset(&stb, 0, sizeof(stb));
1394 solv_chksum_add($self, &stb.st_dev, sizeof(stb.st_dev));
1395 solv_chksum_add($self, &stb.st_ino, sizeof(stb.st_ino));
1396 solv_chksum_add($self, &stb.st_size, sizeof(stb.st_size));
1397 solv_chksum_add($self, &stb.st_mtime, sizeof(stb.st_mtime));
1402 const unsigned char *b;
1403 b = solv_chksum_get($self, &l);
1411 const unsigned char *b;
1414 b = solv_chksum_get($self, &l);
1415 ret = solv_malloc(2 * l + 1);
1416 solv_bin2hex(b, l, ret);
1419 const char *typestr() {
1420 return solv_chksum_type2str(solv_chksum_get_type($self));
1423 #if defined(SWIGTCL)
1424 %rename("==") __eq__;
1426 bool __eq__(Chksum *chk) {
1427 return solv_chksum_cmp($self, chk);
1429 #if defined(SWIGTCL)
1430 %rename("!=") __ne__;
1432 bool __ne__(Chksum *chk) {
1433 return !solv_chksum_cmp($self, chk);
1435 #if defined(SWIGRUBY)
1436 %rename("to_s") __str__;
1438 #if defined(SWIGPERL) || defined(SWIGTCL)
1439 %rename("str") __str__;
1442 const char *__str__() {
1445 if (solv_chksum_isfinished($self))
1446 h = Chksum_hex($self);
1447 str = solv_dupjoin(solv_chksum_type2str(solv_chksum_get_type($self)), ":", h ? h : "unfinished");
1448 solv_free((void *)h);
1451 #if defined(SWIGPERL) || defined(SWIGTCL)
1452 %rename("repr") __repr__;
1454 %newobject __repr__;
1455 const char *__repr__() {
1456 const char *h = Chksum___str__($self);
1457 const char *str = solv_dupjoin("<Chksum ", h, ">");
1458 solv_free((void *)h);
1464 static const int POOL_FLAG_PROMOTEEPOCH = POOL_FLAG_PROMOTEEPOCH;
1465 static const int POOL_FLAG_FORBIDSELFCONFLICTS = POOL_FLAG_FORBIDSELFCONFLICTS;
1466 static const int POOL_FLAG_OBSOLETEUSESPROVIDES = POOL_FLAG_OBSOLETEUSESPROVIDES;
1467 static const int POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES = POOL_FLAG_IMPLICITOBSOLETEUSESPROVIDES;
1468 static const int POOL_FLAG_OBSOLETEUSESCOLORS = POOL_FLAG_OBSOLETEUSESCOLORS;
1469 static const int POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS = POOL_FLAG_IMPLICITOBSOLETEUSESCOLORS;
1470 static const int POOL_FLAG_NOINSTALLEDOBSOLETES = POOL_FLAG_NOINSTALLEDOBSOLETES;
1471 static const int POOL_FLAG_HAVEDISTEPOCH = POOL_FLAG_HAVEDISTEPOCH;
1472 static const int POOL_FLAG_NOOBSOLETESMULTIVERSION = POOL_FLAG_NOOBSOLETESMULTIVERSION;
1473 static const int DISTTYPE_RPM = DISTTYPE_RPM;
1474 static const int DISTTYPE_DEB = DISTTYPE_DEB;
1475 static const int DISTTYPE_ARCH = DISTTYPE_ARCH;
1476 static const int DISTTYPE_HAIKU = DISTTYPE_HAIKU;
1479 Pool *pool = pool_create();
1482 int setdisttype(int disttype) {
1483 return pool_setdisttype($self, disttype);
1485 void set_debuglevel(int level) {
1486 pool_setdebuglevel($self, level);
1488 int set_flag(int flag, int value) {
1489 return pool_set_flag($self, flag, value);
1491 int get_flag(int flag) {
1492 return pool_get_flag($self, flag);
1494 void set_rootdir(const char *rootdir) {
1495 pool_set_rootdir($self, rootdir);
1497 const char *get_rootdir(int flag) {
1498 return pool_get_rootdir($self);
1500 #if defined(SWIGPYTHON)
1502 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1503 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1504 PyObject *args = Py_BuildValue("(O)", SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0));
1505 PyObject *result = PyEval_CallObject((PyObject *)d, args);
1510 return 0; /* exception */
1511 ecode = SWIG_AsVal_int(result, &vresult);
1513 return SWIG_IsOK(ecode) ? vresult : 0;
1516 void clr_loadcallback() {
1517 if ($self->loadcallback == loadcallback) {
1518 PyObject *obj = $self->loadcallbackdata;
1520 pool_setloadcallback($self, 0, 0);
1523 void set_loadcallback(PyObject *callable) {
1524 Pool_clr_loadcallback($self);
1526 Py_INCREF(callable);
1527 pool_setloadcallback($self, loadcallback, callable);
1530 #elif defined(SWIGPERL)
1532 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1536 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1541 XPUSHs(SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_OWNER | SWIG_SHADOW));
1543 count = perl_call_sv((SV *)d, G_EVAL|G_SCALAR);
1553 void clr_loadcallback() {
1554 if ($self->loadcallback == loadcallback) {
1555 SvREFCNT_dec($self->loadcallbackdata);
1556 pool_setloadcallback($self, 0, 0);
1559 void set_loadcallback(SV *callable) {
1560 Pool_clr_loadcallback($self);
1562 SvREFCNT_inc(callable);
1563 pool_setloadcallback($self, loadcallback, callable);
1566 #elif defined(SWIGRUBY)
1568 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1569 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1570 VALUE callable = (VALUE)d;
1571 VALUE rd = SWIG_NewPointerObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, SWIG_POINTER_OWN | 0);
1572 VALUE res = rb_funcall(callable, rb_intern("call"), 1, rd);
1573 return res == Qtrue;
1575 SWIGINTERN void mark_Pool(void *ptr) {
1577 if (pool->loadcallback == loadcallback && pool->loadcallbackdata) {
1578 VALUE callable = (VALUE)pool->loadcallbackdata;
1579 rb_gc_mark(callable);
1583 void clr_loadcallback() {
1584 pool_setloadcallback($self, 0, 0);
1586 %typemap(in, numinputs=0) VALUE callable {
1587 $1 = rb_block_given_p() ? rb_block_proc() : 0;
1589 void set_loadcallback(VALUE callable) {
1590 pool_setloadcallback($self, callable ? loadcallback : 0, (void *)callable);
1592 #elif defined(SWIGTCL)
1598 SWIGINTERN int loadcallback(Pool *pool, Repodata *data, void *d) {
1599 tcl_callback_t *callback_var = (tcl_callback_t *)d;
1600 Tcl_Interp *interp = callback_var->interp;
1601 XRepodata *xd = new_XRepodata(data->repo, data->repodataid);
1602 int result, ecode = 0, vresult = 0;
1604 objvx[0] = callback_var->obj;
1605 objvx[1] = SWIG_NewInstanceObj(SWIG_as_voidptr(xd), SWIGTYPE_p_XRepodata, 0);
1606 Tcl_IncrRefCount(objvx[1]);
1607 result = Tcl_EvalObjv(interp, sizeof(objvx)/sizeof(*objvx), objvx, TCL_EVAL_GLOBAL);
1608 Tcl_DecrRefCount(objvx[1]);
1609 if (result != TCL_OK)
1610 return 0; /* exception */
1611 ecode = SWIG_AsVal_int(interp, Tcl_GetObjResult(interp), &vresult);
1612 return SWIG_IsOK(ecode) ? vresult : 0;
1615 void clr_loadcallback() {
1616 if ($self->loadcallback == loadcallback) {
1617 tcl_callback_t *callback_var = $self->loadcallbackdata;
1618 Tcl_DecrRefCount(callback_var->obj);
1619 solv_free(callback_var);
1620 pool_setloadcallback($self, 0, 0);
1623 void set_loadcallback(Tcl_Obj *callable, Tcl_Interp *interp) {
1624 Pool_clr_loadcallback($self);
1626 tcl_callback_t *callback_var = solv_malloc(sizeof(tcl_callback_t));
1627 Tcl_IncrRefCount(callable);
1628 callback_var->interp = interp;
1629 callback_var->obj = callable;
1630 pool_setloadcallback($self, loadcallback, callback_var);
1634 #warning loadcallback not implemented for this language
1641 FOR_REPOS(repoid, repo)
1642 appdata_clr_helper(&repo->appdata);
1643 Pool_clr_loadcallback(pool);
1644 appdata_clr_helper(&pool->appdata);
1647 disown_helper free() {
1651 FOR_REPOS(repoid, repo)
1652 appdata_clr_helper(&repo->appdata);
1653 Pool_clr_loadcallback(pool);
1654 appdata_clr_helper(&pool->appdata);
1658 disown_helper disown() {
1661 AppObjectPtr appdata;
1663 SWIGINTERN void Pool_appdata_set(Pool *pool, AppObjectPtr appdata) {
1664 appdata_set_helper(&pool->appdata, appdata);
1666 SWIGINTERN AppObjectPtr Pool_appdata_get(Pool *pool) {
1667 return appdata_get_helper(pool->appdata);
1670 void appdata_disown() {
1671 appdata_disown_helper($self->appdata);
1674 Id str2id(const char *str, bool create=1) {
1675 return pool_str2id($self, str, create);
1678 Dep *Dep(const char *str, bool create=1) {
1679 Id id = pool_str2id($self, str, create);
1680 return new_Dep($self, id);
1682 const char *id2str(Id id) {
1683 return pool_id2str($self, id);
1685 const char *dep2str(Id id) {
1686 return pool_dep2str($self, id);
1688 Id rel2id(Id name, Id evr, int flags, bool create=1) {
1689 return pool_rel2id($self, name, evr, flags, create);
1691 Id id2langid(Id id, const char *lang, bool create=1) {
1692 return pool_id2langid($self, id, lang, create);
1694 void setarch(const char *arch = 0) {
1703 pool_setarch($self, arch);
1705 Repo *add_repo(const char *name) {
1706 return repo_create($self, name);
1708 const char *lookup_str(Id entry, Id keyname) {
1709 return pool_lookup_str($self, entry, keyname);
1711 Id lookup_id(Id entry, Id keyname) {
1712 return pool_lookup_id($self, entry, keyname);
1714 unsigned long long lookup_num(Id entry, Id keyname, unsigned long long notfound = 0) {
1715 return pool_lookup_num($self, entry, keyname, notfound);
1717 bool lookup_void(Id entry, Id keyname) {
1718 return pool_lookup_void($self, entry, keyname);
1720 %newobject lookup_checksum;
1721 Chksum *lookup_checksum(Id entry, Id keyname) {
1723 const unsigned char *b = pool_lookup_bin_checksum($self, entry, keyname, &type);
1724 return solv_chksum_create_from_bin(type, b);
1727 %newobject Dataiterator;
1728 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
1729 return new_Dataiterator($self, 0, 0, key, match, flags);
1731 %newobject Dataiterator_solvid;
1732 Dataiterator *Dataiterator_solvid(Id p, Id key, const char *match = 0, int flags = 0) {
1733 return new_Dataiterator($self, 0, p, key, match, flags);
1735 const char *solvid2str(Id solvid) {
1736 return pool_solvid2str($self, solvid);
1738 void addfileprovides() {
1739 pool_addfileprovides($self);
1741 Queue addfileprovides_queue() {
1744 pool_addfileprovides_queue($self, &r, 0);
1747 void createwhatprovides() {
1748 pool_createwhatprovides($self);
1751 %newobject id2solvable;
1752 XSolvable *id2solvable(Id id) {
1753 return new_XSolvable($self, id);
1755 %newobject solvables;
1756 Pool_solvable_iterator * const solvables;
1758 SWIGINTERN Pool_solvable_iterator * Pool_solvables_get(Pool *pool) {
1759 return new_Pool_solvable_iterator(pool);
1762 %newobject solvables_iter;
1763 Pool_solvable_iterator * solvables_iter() {
1764 return new_Pool_solvable_iterator($self);
1767 Repo *id2repo(Id id) {
1768 if (id < 1 || id >= $self->nrepos)
1770 return pool_id2repo($self, id);
1774 Pool_repo_iterator * const repos;
1776 SWIGINTERN Pool_repo_iterator * Pool_repos_get(Pool *pool) {
1777 return new_Pool_repo_iterator(pool);
1780 %newobject repos_iter;
1781 Pool_repo_iterator * repos_iter() {
1782 return new_Pool_repo_iterator($self);
1786 const char * const errstr;
1788 SWIGINTERN void Pool_installed_set(Pool *pool, Repo *installed) {
1789 pool_set_installed(pool, installed);
1791 SWIGINTERN Repo *Pool_installed_get(Pool *pool) {
1792 return pool->installed;
1794 SWIGINTERN const char *Pool_errstr_get(Pool *pool) {
1795 return pool_errstr(pool);
1799 Queue matchprovidingids(const char *match, int flags) {
1805 for (id = 1; id < pool->ss.nstrings; id++)
1806 if (pool->whatprovides[id])
1810 if (!datamatcher_init(&ma, match, flags)) {
1811 for (id = 1; id < pool->ss.nstrings; id++)
1812 if (pool->whatprovides[id] && datamatcher_match(&ma, pool_id2str(pool, id)))
1814 datamatcher_free(&ma);
1821 Job *Job(int how, Id what) {
1822 return new_Job($self, how, what);
1825 %typemap(out) Queue whatprovides Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1826 %newobject whatprovides;
1827 Queue whatprovides(DepId dep) {
1832 FOR_PROVIDES(p, pp, dep)
1837 Id towhatprovides(Queue q) {
1838 return pool_queuetowhatprovides($self, &q);
1841 %typemap(out) Queue whatmatchesdep Queue2Array(XSolvable *, 1, new_XSolvable(arg1, id));
1842 %newobject whatmatchesdep;
1843 Queue whatmatchesdep(Id keyname, DepId dep, Id marker = -1) {
1846 pool_whatmatchesdep($self, keyname, dep, &q, marker);
1851 %rename("isknownarch?") isknownarch;
1853 bool isknownarch(DepId id) {
1855 if (!id || id == ID_EMPTY)
1857 if (id == ARCH_SRC || id == ARCH_NOSRC || id == ARCH_NOARCH)
1859 if (pool->id2arch && (id > pool->lastarch || !pool->id2arch[id]))
1866 return solver_create($self);
1869 %newobject Selection;
1870 Selection *Selection() {
1871 return new_Selection($self);
1873 %newobject Selection_all;
1874 Selection *Selection_all(int setflags=0) {
1875 Selection *sel = new_Selection($self);
1876 queue_push2(&sel->q, SOLVER_SOLVABLE_ALL | setflags, 0);
1880 Selection *select(const char *name, int flags) {
1881 Selection *sel = new_Selection($self);
1882 sel->flags = selection_make($self, &sel->q, name, flags);
1886 void setpooljobs_helper(Queue jobs) {
1887 queue_free(&$self->pooljobs);
1888 queue_init_clone(&$self->pooljobs, &jobs);
1890 %typemap(out) Queue getpooljobs Queue2Array(Job *, 2, new_Job(arg1, id, idp[1]));
1891 %newobject getpooljobs;
1892 Queue getpooljobs() {
1894 queue_init_clone(&q, &$self->pooljobs);
1898 #if defined(SWIGPYTHON)
1900 def setpooljobs(self, jobs):
1902 for job in jobs: j += [job.how, job.what]
1903 self.setpooljobs_helper(j)
1906 #if defined(SWIGPERL)
1908 sub solv::Solver::setpooljobs {
1909 my ($self, $jobs) = @_;
1910 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
1911 return $self->setpooljobs_helper(\@j);
1915 #if defined(SWIGRUBY)
1918 "class Solv::Pool\n"
1919 " def setpooljobs(jobs)\n"
1921 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
1922 " setpooljobs_helper(jl)\n"
1931 static const int REPO_REUSE_REPODATA = REPO_REUSE_REPODATA;
1932 static const int REPO_NO_INTERNALIZE = REPO_NO_INTERNALIZE;
1933 static const int REPO_LOCALPOOL = REPO_LOCALPOOL;
1934 static const int REPO_USE_LOADING = REPO_USE_LOADING;
1935 static const int REPO_EXTEND_SOLVABLES = REPO_EXTEND_SOLVABLES;
1936 static const int REPO_USE_ROOTDIR = REPO_USE_ROOTDIR;
1937 static const int REPO_NO_LOCATION = REPO_NO_LOCATION;
1938 static const int SOLV_ADD_NO_STUBS = SOLV_ADD_NO_STUBS; /* repo_solv */
1939 #ifdef ENABLE_SUSEREPO
1940 static const int SUSETAGS_RECORD_SHARES = SUSETAGS_RECORD_SHARES; /* repo_susetags */
1943 void free(bool reuseids = 0) {
1944 appdata_clr_helper(&$self->appdata);
1945 repo_free($self, reuseids);
1947 void empty(bool reuseids = 0) {
1948 repo_empty($self, reuseids);
1951 %rename("isempty?") isempty;
1954 return !$self->nsolvables;
1957 AppObjectPtr appdata;
1959 SWIGINTERN void Repo_appdata_set(Repo *repo, AppObjectPtr appdata) {
1960 appdata_set_helper(&repo->appdata, appdata);
1962 SWIGINTERN AppObjectPtr Repo_appdata_get(Repo *repo) {
1963 return appdata_get_helper(repo->appdata);
1967 bool add_solv(const char *name, int flags = 0) {
1968 FILE *fp = fopen(name, "r");
1972 r = repo_add_solv($self, fp, flags);
1976 bool add_solv(FILE *fp, int flags = 0) {
1977 return repo_add_solv($self, fp, flags) == 0;
1980 %newobject add_solvable;
1981 XSolvable *add_solvable() {
1982 Id solvid = repo_add_solvable($self);
1983 return new_XSolvable($self->pool, solvid);
1987 bool add_rpmdb(int flags = 0) {
1988 return repo_add_rpmdb($self, 0, flags) == 0;
1990 bool add_rpmdb_reffp(FILE *reffp, int flags = 0) {
1991 return repo_add_rpmdb_reffp($self, reffp, flags) == 0;
1994 #ifdef ENABLE_RPMPKG
1996 XSolvable *add_rpm(const char *name, int flags = 0) {
1997 return new_XSolvable($self->pool, repo_add_rpm($self, name, flags));
2000 #ifdef ENABLE_PUBKEY
2002 bool add_rpmdb_pubkeys(int flags = 0) {
2003 return repo_add_rpmdb_pubkeys($self, flags) == 0;
2006 %newobject add_pubkey;
2007 XSolvable *add_pubkey(const char *keyfile, int flags = 0) {
2008 return new_XSolvable($self->pool, repo_add_pubkey($self, keyfile, flags));
2010 bool add_keyring(FILE *fp, int flags = 0) {
2011 return repo_add_keyring($self, fp, flags);
2013 bool add_keydir(const char *keydir, const char *suffix, int flags = 0) {
2014 return repo_add_keydir($self, keydir, suffix, flags);
2018 bool add_rpmmd(FILE *fp, const char *language, int flags = 0) {
2019 return repo_add_rpmmd($self, fp, language, flags) == 0;
2021 bool add_repomdxml(FILE *fp, int flags = 0) {
2022 return repo_add_repomdxml($self, fp, flags) == 0;
2024 bool add_updateinfoxml(FILE *fp, int flags = 0) {
2025 return repo_add_updateinfoxml($self, fp, flags) == 0;
2027 bool add_deltainfoxml(FILE *fp, int flags = 0) {
2028 return repo_add_deltainfoxml($self, fp, flags) == 0;
2031 #ifdef ENABLE_DEBIAN
2032 bool add_debdb(int flags = 0) {
2033 return repo_add_debdb($self, flags) == 0;
2035 bool add_debpackages(FILE *fp, int flags = 0) {
2036 return repo_add_debpackages($self, fp, flags) == 0;
2039 XSolvable *add_deb(const char *name, int flags = 0) {
2040 return new_XSolvable($self->pool, repo_add_deb($self, name, flags));
2043 #ifdef ENABLE_SUSEREPO
2044 bool add_susetags(FILE *fp, Id defvendor, const char *language, int flags = 0) {
2045 return repo_add_susetags($self, fp, defvendor, language, flags) == 0;
2047 bool add_content(FILE *fp, int flags = 0) {
2048 return repo_add_content($self, fp, flags) == 0;
2050 bool add_products(const char *proddir, int flags = 0) {
2051 return repo_add_products($self, proddir, flags) == 0;
2054 #ifdef ENABLE_MDKREPO
2055 bool add_mdk(FILE *fp, int flags = 0) {
2056 return repo_add_mdk($self, fp, flags) == 0;
2058 bool add_mdk_info(FILE *fp, int flags = 0) {
2059 return repo_add_mdk_info($self, fp, flags) == 0;
2062 #ifdef ENABLE_ARCHREPO
2063 bool add_arch_repo(FILE *fp, int flags = 0) {
2064 return repo_add_arch_repo($self, fp, flags) == 0;
2066 bool add_arch_local(const char *dir, int flags = 0) {
2067 return repo_add_arch_local($self, dir, flags) == 0;
2069 %newobject add_arch_pkg;
2070 XSolvable *add_arch_pkg(const char *name, int flags = 0) {
2071 return new_XSolvable($self->pool, repo_add_arch_pkg($self, name, flags));
2075 bool add_autopattern(int flags = 0) {
2076 return repo_add_autopattern($self, flags) == 0;
2079 void internalize() {
2080 repo_internalize($self);
2082 bool write(FILE *fp) {
2083 return repo_write($self, fp) == 0;
2085 /* HACK, remove if no longer needed! */
2086 bool write_first_repodata(FILE *fp) {
2087 int oldnrepodata = $self->nrepodata;
2089 $self->nrepodata = oldnrepodata > 2 ? 2 : oldnrepodata;
2090 res = repo_write($self, fp);
2091 $self->nrepodata = oldnrepodata;
2095 %newobject Dataiterator;
2096 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2097 return new_Dataiterator($self->pool, $self, 0, key, match, flags);
2099 %newobject Dataiterator_meta;
2100 Dataiterator *Dataiterator_meta(Id key, const char *match = 0, int flags = 0) {
2101 return new_Dataiterator($self->pool, $self, SOLVID_META, key, match, flags);
2106 SWIGINTERN Id Repo_id_get(Repo *repo) {
2107 return repo->repoid;
2110 %newobject solvables;
2111 Repo_solvable_iterator * const solvables;
2113 SWIGINTERN Repo_solvable_iterator * Repo_solvables_get(Repo *repo) {
2114 return new_Repo_solvable_iterator(repo);
2118 Datapos * const meta;
2120 SWIGINTERN Datapos * Repo_meta_get(Repo *repo) {
2121 Datapos *pos = solv_calloc(1, sizeof(*pos));
2122 pos->solvid = SOLVID_META;
2128 %newobject solvables_iter;
2129 Repo_solvable_iterator *solvables_iter() {
2130 return new_Repo_solvable_iterator($self);
2133 %newobject add_repodata;
2134 XRepodata *add_repodata(int flags = 0) {
2135 Repodata *rd = repo_add_repodata($self, flags);
2136 return new_XRepodata($self, rd->repodataid);
2139 void create_stubs() {
2141 if (!$self->nrepodata)
2143 data = repo_id2repodata($self, $self->nrepodata - 1);
2144 if (data->state != REPODATA_STUB)
2145 (void)repodata_create_stubs(data);
2148 %rename("iscontiguous?") iscontiguous;
2150 bool iscontiguous() {
2152 for (i = $self->start; i < $self->end; i++)
2153 if ($self->pool->solvables[i].repo != $self)
2157 %newobject first_repodata;
2158 XRepodata *first_repodata() {
2161 if ($self->nrepodata < 2)
2163 /* make sure all repodatas but the first are extensions */
2164 data = repo_id2repodata($self, 1);
2165 if (data->loadcallback)
2167 for (i = 2; i < $self->nrepodata; i++)
2169 data = repo_id2repodata($self, i);
2170 if (!data->loadcallback)
2171 return 0; /* oops, not an extension */
2173 return new_XRepodata($self, 1);
2176 %newobject Selection;
2177 Selection *Selection(int setflags=0) {
2178 Selection *sel = new_Selection($self->pool);
2179 setflags |= SOLVER_SETREPO;
2180 queue_push2(&sel->q, SOLVER_SOLVABLE_REPO | setflags, $self->repoid);
2184 #ifdef ENABLE_PUBKEY
2185 %newobject find_pubkey;
2186 XSolvable *find_pubkey(const char *keyid) {
2187 return new_XSolvable($self->pool, repo_find_pubkey($self, keyid));
2191 Repo *createshadow(const char *name) {
2192 Repo *repo = repo_create($self->pool, name);
2193 if ($self->idarraysize) {
2194 repo_reserve_ids(repo, 0, $self->idarraysize);
2195 memcpy(repo->idarraydata, $self->idarraydata, sizeof(Id) * $self->idarraysize);
2196 repo->idarraysize = $self->idarraysize;
2198 repo->start = $self->start;
2199 repo->end = $self->end;
2200 repo->nsolvables = $self->nsolvables;
2204 void moveshadow(Queue q) {
2205 Pool *pool = $self->pool;
2207 for (i = 0; i < q.count; i++) {
2209 Id p = q.elements[i];
2210 if (p < $self->start || p >= $self->end)
2212 s = pool->solvables + p;
2213 if ($self->idarraysize != s->repo->idarraysize)
2219 #if defined(SWIGTCL)
2220 %rename("==") __eq__;
2222 bool __eq__(Repo *repo) {
2223 return $self == repo;
2225 #if defined(SWIGTCL)
2226 %rename("!=") __ne__;
2228 bool __ne__(Repo *repo) {
2229 return $self != repo;
2231 #if defined(SWIGPYTHON)
2233 return $self->repoid;
2236 #if defined(SWIGPERL) || defined(SWIGTCL)
2237 %rename("str") __str__;
2240 const char *__str__() {
2243 return solv_strdup($self->name);
2244 sprintf(buf, "Repo#%d", $self->repoid);
2245 return solv_strdup(buf);
2247 #if defined(SWIGPERL) || defined(SWIGTCL)
2248 %rename("repr") __repr__;
2250 %newobject __repr__;
2251 const char *__repr__() {
2255 sprintf(buf, "<Repo #%d ", $self->repoid);
2256 return solv_dupjoin(buf, $self->name, ">");
2258 sprintf(buf, "<Repo #%d>", $self->repoid);
2259 return solv_strdup(buf);
2263 %extend Dataiterator {
2264 static const int SEARCH_STRING = SEARCH_STRING;
2265 static const int SEARCH_STRINGSTART = SEARCH_STRINGSTART;
2266 static const int SEARCH_STRINGEND = SEARCH_STRINGEND;
2267 static const int SEARCH_SUBSTRING = SEARCH_SUBSTRING;
2268 static const int SEARCH_GLOB = SEARCH_GLOB;
2269 static const int SEARCH_REGEX = SEARCH_REGEX;
2270 static const int SEARCH_NOCASE = SEARCH_NOCASE;
2271 static const int SEARCH_FILES = SEARCH_FILES;
2272 static const int SEARCH_COMPLETE_FILELIST = SEARCH_COMPLETE_FILELIST;
2273 static const int SEARCH_CHECKSUMS = SEARCH_CHECKSUMS;
2275 Dataiterator(Pool *pool, Repo *repo, Id p, Id key, const char *match, int flags) {
2276 Dataiterator *di = solv_calloc(1, sizeof(*di));
2277 dataiterator_init(di, pool, repo, p, key, match, flags);
2281 dataiterator_free($self);
2284 #if defined(SWIGPYTHON)
2286 def __iter__(self): return self
2289 %rename("next") __next__();
2291 %exception __next__ {
2294 PyErr_SetString(PyExc_StopIteration,"no more matches");
2300 perliter(solv::Dataiterator)
2302 %newobject __next__;
2303 Datamatch *__next__() {
2305 if (!dataiterator_step($self)) {
2308 ndi = solv_calloc(1, sizeof(*ndi));
2309 dataiterator_init_clone(ndi, $self);
2310 dataiterator_strdup(ndi);
2316 while ((d = Dataiterator___next__($self)) != 0) {
2317 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(d), SWIGTYPE_p_Datamatch, SWIG_POINTER_OWN | 0));
2321 void prepend_keyname(Id key) {
2322 dataiterator_prepend_keyname($self, key);
2324 void skip_solvable() {
2325 dataiterator_skip_solvable($self);
2330 Id lookup_id(Id keyname) {
2331 Pool *pool = $self->repo->pool;
2332 Datapos oldpos = pool->pos;
2335 r = pool_lookup_id(pool, SOLVID_POS, keyname);
2339 const char *lookup_str(Id keyname) {
2340 Pool *pool = $self->repo->pool;
2341 Datapos oldpos = pool->pos;
2344 r = pool_lookup_str(pool, SOLVID_POS, keyname);
2348 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2349 Pool *pool = $self->repo->pool;
2350 Datapos oldpos = pool->pos;
2351 unsigned long long r;
2353 r = pool_lookup_num(pool, SOLVID_POS, keyname, notfound);
2357 bool lookup_void(Id keyname) {
2358 Pool *pool = $self->repo->pool;
2359 Datapos oldpos = pool->pos;
2362 r = pool_lookup_void(pool, SOLVID_POS, keyname);
2366 %newobject lookup_checksum;
2367 Chksum *lookup_checksum(Id keyname) {
2368 Pool *pool = $self->repo->pool;
2369 Datapos oldpos = pool->pos;
2371 const unsigned char *b;
2373 b = pool_lookup_bin_checksum(pool, SOLVID_POS, keyname, &type);
2375 return solv_chksum_create_from_bin(type, b);
2377 const char *lookup_deltaseq() {
2378 Pool *pool = $self->repo->pool;
2379 Datapos oldpos = pool->pos;
2382 seq = pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NAME);
2384 seq = pool_tmpjoin(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_EVR));
2385 seq = pool_tmpappend(pool, seq, "-", pool_lookup_str(pool, SOLVID_POS, DELTA_SEQ_NUM));
2390 const char *lookup_deltalocation(unsigned int *OUTPUT) {
2391 Pool *pool = $self->repo->pool;
2392 Datapos oldpos = pool->pos;
2395 loc = pool_lookup_deltalocation(pool, SOLVID_POS, OUTPUT);
2399 Queue lookup_idarray(Id keyname) {
2400 Pool *pool = $self->repo->pool;
2401 Datapos oldpos = pool->pos;
2405 pool_lookup_idarray(pool, SOLVID_POS, keyname, &r);
2409 %newobject Dataiterator;
2410 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2411 Pool *pool = $self->repo->pool;
2412 Datapos oldpos = pool->pos;
2415 di = new_Dataiterator(pool, 0, SOLVID_POS, key, match, flags);
2423 dataiterator_free($self);
2426 %newobject solvable;
2427 XSolvable * const solvable;
2429 const char * const key_idstr;
2431 const char * const type_idstr;
2433 const char * const idstr;
2434 const char * const str;
2435 BinaryBlob const binary;
2436 unsigned long long const num;
2437 unsigned int const num2;
2439 SWIGINTERN XSolvable *Datamatch_solvable_get(Dataiterator *di) {
2440 return new_XSolvable(di->pool, di->solvid);
2442 SWIGINTERN Id Datamatch_key_id_get(Dataiterator *di) {
2443 return di->key->name;
2445 SWIGINTERN const char *Datamatch_key_idstr_get(Dataiterator *di) {
2446 return pool_id2str(di->pool, di->key->name);
2448 SWIGINTERN Id Datamatch_type_id_get(Dataiterator *di) {
2449 return di->key->type;
2451 SWIGINTERN const char *Datamatch_type_idstr_get(Dataiterator *di) {
2452 return pool_id2str(di->pool, di->key->type);
2454 SWIGINTERN Id Datamatch_id_get(Dataiterator *di) {
2457 SWIGINTERN const char *Datamatch_idstr_get(Dataiterator *di) {
2458 if (di->data && (di->key->type == REPOKEY_TYPE_DIR || di->key->type == REPOKEY_TYPE_DIRSTRARRAY || di->key->type == REPOKEY_TYPE_DIRNUMNUMARRAY))
2459 return repodata_dir2str(di->data, di->kv.id, 0);
2460 if (di->data && di->data->localpool)
2461 return stringpool_id2str(&di->data->spool, di->kv.id);
2462 return pool_id2str(di->pool, di->kv.id);
2464 SWIGINTERN const char * const Datamatch_str_get(Dataiterator *di) {
2467 SWIGINTERN BinaryBlob Datamatch_binary_get(Dataiterator *di) {
2471 if (di->key->type == REPOKEY_TYPE_BINARY)
2473 bl.data = di->kv.str;
2474 bl.len = di->kv.num;
2476 else if ((bl.len = solv_chksum_len(di->key->type)) != 0)
2477 bl.data = di->kv.str;
2480 SWIGINTERN unsigned long long Datamatch_num_get(Dataiterator *di) {
2481 if (di->key->type == REPOKEY_TYPE_NUM)
2482 return SOLV_KV_NUM64(&di->kv);
2485 SWIGINTERN unsigned int Datamatch_num2_get(Dataiterator *di) {
2491 Pool *pool = $self->pool;
2492 Datapos *pos, oldpos = pool->pos;
2493 dataiterator_setpos($self);
2494 pos = solv_calloc(1, sizeof(*pos));
2499 %newobject parentpos;
2500 Datapos *parentpos() {
2501 Pool *pool = $self->pool;
2502 Datapos *pos, oldpos = pool->pos;
2503 dataiterator_setpos_parent($self);
2504 pos = solv_calloc(1, sizeof(*pos));
2509 #if defined(SWIGPERL)
2510 /* cannot use str here because swig reports a bogus conflict... */
2511 %rename("stringify") __str__;
2513 *solv::Datamatch::str = *solvc::Datamatch_stringify;
2516 #if defined(SWIGTCL)
2517 %rename("stringify") __str__;
2519 const char *__str__() {
2520 KeyValue kv = $self->kv;
2521 const char *str = repodata_stringify($self->pool, $self->data, $self->key, &kv, SEARCH_FILES | SEARCH_CHECKSUMS);
2522 return str ? str : "";
2526 %extend Pool_solvable_iterator {
2527 Pool_solvable_iterator(Pool *pool) {
2528 Pool_solvable_iterator *s;
2529 s = solv_calloc(1, sizeof(*s));
2533 #if defined(SWIGPYTHON)
2535 def __iter__(self): return self
2538 %rename("next") __next__();
2540 %exception __next__ {
2543 PyErr_SetString(PyExc_StopIteration,"no more matches");
2549 perliter(solv::Pool_solvable_iterator)
2551 %newobject __next__;
2552 XSolvable *__next__() {
2553 Pool *pool = $self->pool;
2554 if ($self->id >= pool->nsolvables)
2556 while (++$self->id < pool->nsolvables)
2557 if (pool->solvables[$self->id].repo)
2558 return new_XSolvable(pool, $self->id);
2564 while ((n = Pool_solvable_iterator___next__($self)) != 0) {
2565 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2569 %newobject __getitem__;
2570 XSolvable *__getitem__(Id key) {
2571 Pool *pool = $self->pool;
2572 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo)
2573 return new_XSolvable(pool, key);
2577 return $self->pool->nsolvables;
2581 %extend Pool_repo_iterator {
2582 Pool_repo_iterator(Pool *pool) {
2583 Pool_repo_iterator *s;
2584 s = solv_calloc(1, sizeof(*s));
2588 #if defined(SWIGPYTHON)
2590 def __iter__(self): return self
2593 %rename("next") __next__();
2595 %exception __next__ {
2598 PyErr_SetString(PyExc_StopIteration,"no more matches");
2604 perliter(solv::Pool_repo_iterator)
2606 %newobject __next__;
2608 Pool *pool = $self->pool;
2609 if ($self->id >= pool->nrepos)
2611 while (++$self->id < pool->nrepos) {
2612 Repo *r = pool_id2repo(pool, $self->id);
2621 while ((n = Pool_repo_iterator___next__($self)) != 0) {
2622 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_Repo, SWIG_POINTER_OWN | 0));
2626 Repo *__getitem__(Id key) {
2627 Pool *pool = $self->pool;
2628 if (key > 0 && key < pool->nrepos)
2629 return pool_id2repo(pool, key);
2633 return $self->pool->nrepos;
2637 %extend Repo_solvable_iterator {
2638 Repo_solvable_iterator(Repo *repo) {
2639 Repo_solvable_iterator *s;
2640 s = solv_calloc(1, sizeof(*s));
2644 #if defined(SWIGPYTHON)
2646 def __iter__(self): return self
2649 %rename("next") __next__();
2651 %exception __next__ {
2654 PyErr_SetString(PyExc_StopIteration,"no more matches");
2660 perliter(solv::Repo_solvable_iterator)
2662 %newobject __next__;
2663 XSolvable *__next__() {
2664 Repo *repo = $self->repo;
2665 Pool *pool = repo->pool;
2666 if (repo->start > 0 && $self->id < repo->start)
2667 $self->id = repo->start - 1;
2668 if ($self->id >= repo->end)
2670 while (++$self->id < repo->end)
2671 if (pool->solvables[$self->id].repo == repo)
2672 return new_XSolvable(pool, $self->id);
2678 while ((n = Repo_solvable_iterator___next__($self)) != 0) {
2679 rb_yield(SWIG_NewPointerObj(SWIG_as_voidptr(n), SWIGTYPE_p_XSolvable, SWIG_POINTER_OWN | 0));
2683 %newobject __getitem__;
2684 XSolvable *__getitem__(Id key) {
2685 Repo *repo = $self->repo;
2686 Pool *pool = repo->pool;
2687 if (key > 0 && key < pool->nsolvables && pool->solvables[key].repo == repo)
2688 return new_XSolvable(pool, key);
2692 return $self->repo->pool->nsolvables;
2697 Dep(Pool *pool, Id id) {
2701 s = solv_calloc(1, sizeof(*s));
2707 Dep *Rel(int flags, DepId evrid, bool create=1) {
2708 Id id = pool_rel2id($self->pool, $self->id, evrid, flags, create);
2711 return new_Dep($self->pool, id);
2713 %newobject Selection_name;
2714 Selection *Selection_name(int setflags=0) {
2715 Selection *sel = new_Selection($self->pool);
2716 if (ISRELDEP($self->id)) {
2717 Reldep *rd = GETRELDEP($self->pool, $self->id);
2718 if (rd->flags == REL_EQ) {
2719 setflags |= $self->pool->disttype == DISTTYPE_DEB || strchr(pool_id2str($self->pool, rd->evr), '-') != 0 ? SOLVER_SETEVR : SOLVER_SETEV;
2720 if (ISRELDEP(rd->name))
2721 rd = GETRELDEP($self->pool, rd->name);
2723 if (rd->flags == REL_ARCH)
2724 setflags |= SOLVER_SETARCH;
2726 queue_push2(&sel->q, SOLVER_SOLVABLE_NAME | setflags, $self->id);
2729 %newobject Selection_provides;
2730 Selection *Selection_provides(int setflags=0) {
2731 Selection *sel = new_Selection($self->pool);
2732 if (ISRELDEP($self->id)) {
2733 Reldep *rd = GETRELDEP($self->pool, $self->id);
2734 if (rd->flags == REL_ARCH)
2735 setflags |= SOLVER_SETARCH;
2737 queue_push2(&sel->q, SOLVER_SOLVABLE_PROVIDES | setflags, $self->id);
2741 return pool_dep2str($self->pool, $self->id);
2743 #if defined(SWIGTCL)
2744 %rename("==") __eq__;
2746 bool __eq__(Dep *s) {
2747 return $self->pool == s->pool && $self->id == s->id;
2749 #if defined(SWIGTCL)
2750 %rename("!=") __ne__;
2752 bool __ne__(Dep *s) {
2753 return !Dep___eq__($self, s);
2755 #if defined(SWIGPYTHON)
2760 #if defined(SWIGPERL) || defined(SWIGTCL)
2761 %rename("str") __str__;
2763 const char *__str__() {
2764 return pool_dep2str($self->pool, $self->id);
2766 #if defined(SWIGPERL) || defined(SWIGTCL)
2767 %rename("repr") __repr__;
2769 %newobject __repr__;
2770 const char *__repr__() {
2772 sprintf(buf, "<Id #%d ", $self->id);
2773 return solv_dupjoin(buf, pool_dep2str($self->pool, $self->id), ">");
2778 XSolvable(Pool *pool, Id id) {
2780 if (!id || id >= pool->nsolvables)
2782 s = solv_calloc(1, sizeof(*s));
2788 return pool_solvid2str($self->pool, $self->id);
2790 const char *lookup_str(Id keyname) {
2791 return pool_lookup_str($self->pool, $self->id, keyname);
2793 Id lookup_id(Id keyname) {
2794 return pool_lookup_id($self->pool, $self->id, keyname);
2796 unsigned long long lookup_num(Id keyname, unsigned long long notfound = 0) {
2797 return pool_lookup_num($self->pool, $self->id, keyname, notfound);
2799 bool lookup_void(Id keyname) {
2800 return pool_lookup_void($self->pool, $self->id, keyname);
2802 %newobject lookup_checksum;
2803 Chksum *lookup_checksum(Id keyname) {
2805 const unsigned char *b = pool_lookup_bin_checksum($self->pool, $self->id, keyname, &type);
2806 return solv_chksum_create_from_bin(type, b);
2808 Queue lookup_idarray(Id keyname, Id marker = -1) {
2809 Solvable *s = $self->pool->solvables + $self->id;
2812 solvable_lookup_deparray(s, keyname, &r, marker);
2815 %typemap(out) Queue lookup_deparray Queue2Array(Dep *, 1, new_Dep(arg1->pool, id));
2816 %newobject lookup_deparray;
2817 Queue lookup_deparray(Id keyname, Id marker = -1) {
2818 Solvable *s = $self->pool->solvables + $self->id;
2821 solvable_lookup_deparray(s, keyname, &r, marker);
2824 const char *lookup_location(unsigned int *OUTPUT) {
2825 return solvable_lookup_location($self->pool->solvables + $self->id, OUTPUT);
2827 %newobject Dataiterator;
2828 Dataiterator *Dataiterator(Id key, const char *match = 0, int flags = 0) {
2829 return new_Dataiterator($self->pool, 0, $self->id, key, match, flags);
2832 %rename("installable?") installable;
2834 bool installable() {
2835 return pool_installable($self->pool, pool_id2solvable($self->pool, $self->id));
2838 %rename("isinstalled?") isinstalled;
2840 bool isinstalled() {
2841 Pool *pool = $self->pool;
2842 return pool->installed && pool_id2solvable(pool, $self->id)->repo == pool->installed;
2847 SWIGINTERN void XSolvable_name_set(XSolvable *xs, const char *name) {
2848 Pool *pool = xs->pool;
2849 pool->solvables[xs->id].name = pool_str2id(pool, name, 1);
2851 SWIGINTERN const char *XSolvable_name_get(XSolvable *xs) {
2852 Pool *pool = xs->pool;
2853 return pool_id2str(pool, pool->solvables[xs->id].name);
2858 SWIGINTERN void XSolvable_nameid_set(XSolvable *xs, Id nameid) {
2859 xs->pool->solvables[xs->id].name = nameid;
2861 SWIGINTERN Id XSolvable_nameid_get(XSolvable *xs) {
2862 return xs->pool->solvables[xs->id].name;
2867 SWIGINTERN void XSolvable_evr_set(XSolvable *xs, const char *evr) {
2868 Pool *pool = xs->pool;
2869 pool->solvables[xs->id].evr = pool_str2id(pool, evr, 1);
2871 SWIGINTERN const char *XSolvable_evr_get(XSolvable *xs) {
2872 Pool *pool = xs->pool;
2873 return pool_id2str(pool, pool->solvables[xs->id].evr);
2878 SWIGINTERN void XSolvable_evrid_set(XSolvable *xs, Id evrid) {
2879 xs->pool->solvables[xs->id].evr = evrid;
2881 SWIGINTERN Id XSolvable_evrid_get(XSolvable *xs) {
2882 return xs->pool->solvables[xs->id].evr;
2887 SWIGINTERN void XSolvable_arch_set(XSolvable *xs, const char *arch) {
2888 Pool *pool = xs->pool;
2889 pool->solvables[xs->id].arch = pool_str2id(pool, arch, 1);
2891 SWIGINTERN const char *XSolvable_arch_get(XSolvable *xs) {
2892 Pool *pool = xs->pool;
2893 return pool_id2str(pool, pool->solvables[xs->id].arch);
2898 SWIGINTERN void XSolvable_archid_set(XSolvable *xs, Id archid) {
2899 xs->pool->solvables[xs->id].arch = archid;
2901 SWIGINTERN Id XSolvable_archid_get(XSolvable *xs) {
2902 return xs->pool->solvables[xs->id].arch;
2907 SWIGINTERN void XSolvable_vendor_set(XSolvable *xs, const char *vendor) {
2908 Pool *pool = xs->pool;
2909 pool->solvables[xs->id].vendor = pool_str2id(pool, vendor, 1);
2911 SWIGINTERN const char *XSolvable_vendor_get(XSolvable *xs) {
2912 Pool *pool = xs->pool;
2913 return pool_id2str(pool, pool->solvables[xs->id].vendor);
2918 SWIGINTERN void XSolvable_vendorid_set(XSolvable *xs, Id vendorid) {
2919 xs->pool->solvables[xs->id].vendor = vendorid;
2921 SWIGINTERN Id XSolvable_vendorid_get(XSolvable *xs) {
2922 return xs->pool->solvables[xs->id].vendor;
2927 SWIGINTERN Repo *XSolvable_repo_get(XSolvable *xs) {
2928 return xs->pool->solvables[xs->id].repo;
2932 /* old interface, please use the generic add_deparray instead */
2933 void add_provides(DepId id, Id marker = -1) {
2934 Solvable *s = $self->pool->solvables + $self->id;
2935 marker = solv_depmarker(SOLVABLE_PROVIDES, marker);
2936 s->provides = repo_addid_dep(s->repo, s->provides, id, marker);
2938 void add_obsoletes(DepId id) {
2939 Solvable *s = $self->pool->solvables + $self->id;
2940 s->obsoletes = repo_addid_dep(s->repo, s->obsoletes, id, 0);
2942 void add_conflicts(DepId id) {
2943 Solvable *s = $self->pool->solvables + $self->id;
2944 s->conflicts = repo_addid_dep(s->repo, s->conflicts, id, 0);
2946 void add_requires(DepId id, Id marker = -1) {
2947 Solvable *s = $self->pool->solvables + $self->id;
2948 marker = solv_depmarker(SOLVABLE_REQUIRES, marker);
2949 s->requires = repo_addid_dep(s->repo, s->requires, id, marker);
2951 void add_recommends(DepId id) {
2952 Solvable *s = $self->pool->solvables + $self->id;
2953 s->recommends = repo_addid_dep(s->repo, s->recommends, id, 0);
2955 void add_suggests(DepId id) {
2956 Solvable *s = $self->pool->solvables + $self->id;
2957 s->suggests = repo_addid_dep(s->repo, s->suggests, id, 0);
2959 void add_supplements(DepId id) {
2960 Solvable *s = $self->pool->solvables + $self->id;
2961 s->supplements = repo_addid_dep(s->repo, s->supplements, id, 0);
2963 void add_enhances(DepId id) {
2964 Solvable *s = $self->pool->solvables + $self->id;
2965 s->enhances = repo_addid_dep(s->repo, s->enhances, id, 0);
2968 void unset(Id keyname) {
2969 Solvable *s = $self->pool->solvables + $self->id;
2970 repo_unset(s->repo, $self->id, keyname);
2973 void add_deparray(Id keyname, DepId id, Id marker = -1) {
2974 Solvable *s = $self->pool->solvables + $self->id;
2975 solvable_add_deparray(s, keyname, id, marker);
2978 %newobject Selection;
2979 Selection *Selection(int setflags=0) {
2980 Selection *sel = new_Selection($self->pool);
2981 queue_push2(&sel->q, SOLVER_SOLVABLE | setflags, $self->id);
2986 %rename("identical?") identical;
2988 bool identical(XSolvable *s2) {
2989 return solvable_identical($self->pool->solvables + $self->id, s2->pool->solvables + s2->id);
2991 int evrcmp(XSolvable *s2) {
2992 return pool_evrcmp($self->pool, $self->pool->solvables[$self->id].evr, s2->pool->solvables[s2->id].evr, EVRCMP_COMPARE);
2995 %rename("matchesdep?") matchesdep;
2997 bool matchesdep(Id keyname, DepId id, Id marker = -1) {
2998 return solvable_matchesdep($self->pool->solvables + $self->id, keyname, id, marker);
3001 #if defined(SWIGTCL)
3002 %rename("==") __eq__;
3004 bool __eq__(XSolvable *s) {
3005 return $self->pool == s->pool && $self->id == s->id;
3007 #if defined(SWIGTCL)
3008 %rename("!=") __ne__;
3010 bool __ne__(XSolvable *s) {
3011 return !XSolvable___eq__($self, s);
3013 #if defined(SWIGPYTHON)
3018 #if defined(SWIGPERL) || defined(SWIGTCL)
3019 %rename("str") __str__;
3021 const char *__str__() {
3022 return pool_solvid2str($self->pool, $self->id);
3024 #if defined(SWIGPERL) || defined(SWIGTCL)
3025 %rename("repr") __repr__;
3027 %newobject __repr__;
3028 const char *__repr__() {
3030 sprintf(buf, "<Solvable #%d ", $self->id);
3031 return solv_dupjoin(buf, pool_solvid2str($self->pool, $self->id), ">");
3036 Problem(Solver *solv, Id id) {
3038 p = solv_calloc(1, sizeof(*p));
3043 %newobject findproblemrule;
3044 XRule *findproblemrule() {
3045 Id r = solver_findproblemrule($self->solv, $self->id);
3046 return new_XRule($self->solv, r);
3048 %newobject findallproblemrules;
3049 %typemap(out) Queue findallproblemrules Queue2Array(XRule *, 1, new_XRule(arg1->solv, id));
3050 Queue findallproblemrules(int unfiltered=0) {
3051 Solver *solv = $self->solv;
3056 solver_findallproblemrules(solv, $self->id, &q);
3059 for (i = j = 0; i < q.count; i++)
3061 SolverRuleinfo rclass;
3062 probr = q.elements[i];
3063 rclass = solver_ruleclass(solv, probr);
3064 if (rclass == SOLVER_RULE_UPDATE || rclass == SOLVER_RULE_JOB)
3066 q.elements[j++] = probr;
3069 queue_truncate(&q, j);
3073 int solution_count() {
3074 return solver_solution_count($self->solv, $self->id);
3076 %typemap(out) Queue solutions Queue2Array(Solution *, 1, new_Solution(arg1, id));
3077 %newobject solutions;
3082 cnt = solver_solution_count($self->solv, $self->id);
3083 for (i = 1; i <= cnt; i++)
3087 #if defined(SWIGPERL) || defined(SWIGTCL)
3088 %rename("str") __str__;
3090 const char *__str__() {
3091 return solver_problem2str($self->solv, $self->id);
3096 Solution(Problem *p, Id id) {
3098 s = solv_calloc(1, sizeof(*s));
3100 s->problemid = p->id;
3104 int element_count() {
3105 return solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3108 %typemap(out) Queue elements Queue2Array(Solutionelement *, 4, new_Solutionelement(arg1->solv, arg1->problemid, arg1->id, id, idp[1], idp[2], idp[3]));
3109 %newobject elements;
3110 Queue elements(bool expandreplaces=0) {
3114 cnt = solver_solutionelement_count($self->solv, $self->problemid, $self->id);
3115 for (i = 1; i <= cnt; i++)
3118 solver_next_solutionelement($self->solv, $self->problemid, $self->id, i - 1, &p, &rp);
3120 type = rp ? SOLVER_SOLUTION_REPLACE : SOLVER_SOLUTION_ERASE;
3126 if (type == SOLVER_SOLUTION_REPLACE && expandreplaces) {
3127 int illegal = policy_is_illegal(self->solv, self->solv->pool->solvables + p, self->solv->pool->solvables + rp, 0);
3129 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0) {
3130 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3131 queue_push2(&q, p, rp);
3133 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0) {
3134 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3135 queue_push2(&q, p, rp);
3137 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0) {
3138 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3139 queue_push2(&q, p, rp);
3141 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0) {
3142 queue_push2(&q, i, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3143 queue_push2(&q, p, rp);
3148 queue_push2(&q, i, type);
3149 queue_push2(&q, p, rp);
3155 %extend Solutionelement {
3156 Solutionelement(Solver *solv, Id problemid, Id solutionid, Id id, Id type, Id p, Id rp) {
3158 e = solv_calloc(1, sizeof(*e));
3160 e->problemid = problemid;
3172 if (p == SOLVER_SOLUTION_ERASE)
3177 else if (p == SOLVER_SOLUTION_REPLACE)
3182 else if (p == SOLVER_SOLUTION_REPLACE_DOWNGRADE)
3183 illegal = POLICY_ILLEGAL_DOWNGRADE;
3184 else if (p == SOLVER_SOLUTION_REPLACE_ARCHCHANGE)
3185 illegal = POLICY_ILLEGAL_ARCHCHANGE;
3186 else if (p == SOLVER_SOLUTION_REPLACE_VENDORCHANGE)
3187 illegal = POLICY_ILLEGAL_VENDORCHANGE;
3188 else if (p == SOLVER_SOLUTION_REPLACE_NAMECHANGE)
3189 illegal = POLICY_ILLEGAL_NAMECHANGE;
3191 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);
3192 return solver_solutionelement2str($self->solv, p, rp);
3194 %typemap(out) Queue replaceelements Queue2Array(Solutionelement *, 1, new_Solutionelement(arg1->solv, arg1->problemid, arg1->solutionid, arg1->id, id, arg1->p, arg1->rp));
3195 %newobject replaceelements;
3196 Queue replaceelements() {
3201 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3204 illegal = policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3205 if ((illegal & POLICY_ILLEGAL_DOWNGRADE) != 0)
3206 queue_push(&q, SOLVER_SOLUTION_REPLACE_DOWNGRADE);
3207 if ((illegal & POLICY_ILLEGAL_ARCHCHANGE) != 0)
3208 queue_push(&q, SOLVER_SOLUTION_REPLACE_ARCHCHANGE);
3209 if ((illegal & POLICY_ILLEGAL_VENDORCHANGE) != 0)
3210 queue_push(&q, SOLVER_SOLUTION_REPLACE_VENDORCHANGE);
3211 if ((illegal & POLICY_ILLEGAL_NAMECHANGE) != 0)
3212 queue_push(&q, SOLVER_SOLUTION_REPLACE_NAMECHANGE);
3214 queue_push(&q, $self->type);
3217 int illegalreplace() {
3218 if ($self->type != SOLVER_SOLUTION_REPLACE || $self->p <= 0 || $self->rp <= 0)
3220 return policy_is_illegal($self->solv, $self->solv->pool->solvables + $self->p, $self->solv->pool->solvables + $self->rp, 0);
3222 %newobject solvable;
3223 XSolvable * const solvable;
3224 %newobject replacement;
3225 XSolvable * const replacement;
3228 SWIGINTERN XSolvable *Solutionelement_solvable_get(Solutionelement *e) {
3229 return new_XSolvable(e->solv->pool, e->p);
3231 SWIGINTERN XSolvable *Solutionelement_replacement_get(Solutionelement *e) {
3232 return new_XSolvable(e->solv->pool, e->rp);
3234 SWIGINTERN int Solutionelement_jobidx_get(Solutionelement *e) {
3235 if (e->type != SOLVER_SOLUTION_JOB && e->type != SOLVER_SOLUTION_POOLJOB)
3237 return (e->p - 1) / 2;
3242 Id extraflags = solver_solutionelement_extrajobflags($self->solv, $self->problemid, $self->solutionid);
3243 if ($self->type == SOLVER_SOLUTION_JOB || $self->type == SOLVER_SOLUTION_POOLJOB)
3244 return new_Job($self->solv->pool, SOLVER_NOOP, 0);
3245 if ($self->type == SOLVER_SOLUTION_INFARCH || $self->type == SOLVER_SOLUTION_DISTUPGRADE || $self->type == SOLVER_SOLUTION_BEST)
3246 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->p);
3247 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)
3248 return new_Job($self->solv->pool, SOLVER_INSTALL|SOLVER_SOLVABLE|SOLVER_NOTBYUSER|extraflags, $self->rp);
3249 if ($self->type == SOLVER_SOLUTION_ERASE)
3250 return new_Job($self->solv->pool, SOLVER_ERASE|SOLVER_SOLVABLE|extraflags, $self->p);
3256 static const int SOLVER_RULE_UNKNOWN = SOLVER_RULE_UNKNOWN;
3257 static const int SOLVER_RULE_PKG = SOLVER_RULE_PKG;
3258 static const int SOLVER_RULE_PKG_NOT_INSTALLABLE = SOLVER_RULE_PKG_NOT_INSTALLABLE;
3259 static const int SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP = SOLVER_RULE_PKG_NOTHING_PROVIDES_DEP;
3260 static const int SOLVER_RULE_PKG_REQUIRES = SOLVER_RULE_PKG_REQUIRES;
3261 static const int SOLVER_RULE_PKG_SELF_CONFLICT = SOLVER_RULE_PKG_SELF_CONFLICT;
3262 static const int SOLVER_RULE_PKG_CONFLICTS = SOLVER_RULE_PKG_CONFLICTS;
3263 static const int SOLVER_RULE_PKG_SAME_NAME = SOLVER_RULE_PKG_SAME_NAME;
3264 static const int SOLVER_RULE_PKG_OBSOLETES = SOLVER_RULE_PKG_OBSOLETES;
3265 static const int SOLVER_RULE_PKG_IMPLICIT_OBSOLETES = SOLVER_RULE_PKG_IMPLICIT_OBSOLETES;
3266 static const int SOLVER_RULE_PKG_INSTALLED_OBSOLETES = SOLVER_RULE_PKG_INSTALLED_OBSOLETES;
3267 static const int SOLVER_RULE_UPDATE = SOLVER_RULE_UPDATE;
3268 static const int SOLVER_RULE_FEATURE = SOLVER_RULE_FEATURE;
3269 static const int SOLVER_RULE_JOB = SOLVER_RULE_JOB;
3270 static const int SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP = SOLVER_RULE_JOB_NOTHING_PROVIDES_DEP;
3271 static const int SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM = SOLVER_RULE_JOB_PROVIDED_BY_SYSTEM;
3272 static const int SOLVER_RULE_JOB_UNKNOWN_PACKAGE = SOLVER_RULE_JOB_UNKNOWN_PACKAGE;
3273 static const int SOLVER_RULE_JOB_UNSUPPORTED = SOLVER_RULE_JOB_UNSUPPORTED;
3274 static const int SOLVER_RULE_DISTUPGRADE = SOLVER_RULE_DISTUPGRADE;
3275 static const int SOLVER_RULE_INFARCH = SOLVER_RULE_INFARCH;
3276 static const int SOLVER_RULE_CHOICE = SOLVER_RULE_CHOICE;
3277 static const int SOLVER_RULE_LEARNT = SOLVER_RULE_LEARNT;
3279 static const int SOLVER_SOLUTION_JOB = SOLVER_SOLUTION_JOB;
3280 static const int SOLVER_SOLUTION_POOLJOB = SOLVER_SOLUTION_POOLJOB;
3281 static const int SOLVER_SOLUTION_INFARCH = SOLVER_SOLUTION_INFARCH;
3282 static const int SOLVER_SOLUTION_DISTUPGRADE = SOLVER_SOLUTION_DISTUPGRADE;
3283 static const int SOLVER_SOLUTION_BEST = SOLVER_SOLUTION_BEST;
3284 static const int SOLVER_SOLUTION_ERASE = SOLVER_SOLUTION_ERASE;
3285 static const int SOLVER_SOLUTION_REPLACE = SOLVER_SOLUTION_REPLACE;
3286 static const int SOLVER_SOLUTION_REPLACE_DOWNGRADE = SOLVER_SOLUTION_REPLACE_DOWNGRADE;
3287 static const int SOLVER_SOLUTION_REPLACE_ARCHCHANGE = SOLVER_SOLUTION_REPLACE_ARCHCHANGE;
3288 static const int SOLVER_SOLUTION_REPLACE_VENDORCHANGE = SOLVER_SOLUTION_REPLACE_VENDORCHANGE;
3289 static const int SOLVER_SOLUTION_REPLACE_NAMECHANGE = SOLVER_SOLUTION_REPLACE_NAMECHANGE;
3291 static const int POLICY_ILLEGAL_DOWNGRADE = POLICY_ILLEGAL_DOWNGRADE;
3292 static const int POLICY_ILLEGAL_ARCHCHANGE = POLICY_ILLEGAL_ARCHCHANGE;
3293 static const int POLICY_ILLEGAL_VENDORCHANGE = POLICY_ILLEGAL_VENDORCHANGE;
3294 static const int POLICY_ILLEGAL_NAMECHANGE = POLICY_ILLEGAL_NAMECHANGE;
3296 static const int SOLVER_FLAG_ALLOW_DOWNGRADE = SOLVER_FLAG_ALLOW_DOWNGRADE;
3297 static const int SOLVER_FLAG_ALLOW_ARCHCHANGE = SOLVER_FLAG_ALLOW_ARCHCHANGE;
3298 static const int SOLVER_FLAG_ALLOW_VENDORCHANGE = SOLVER_FLAG_ALLOW_VENDORCHANGE;
3299 static const int SOLVER_FLAG_ALLOW_NAMECHANGE = SOLVER_FLAG_ALLOW_NAMECHANGE;
3300 static const int SOLVER_FLAG_ALLOW_UNINSTALL = SOLVER_FLAG_ALLOW_UNINSTALL;
3301 static const int SOLVER_FLAG_NO_UPDATEPROVIDE = SOLVER_FLAG_NO_UPDATEPROVIDE;
3302 static const int SOLVER_FLAG_SPLITPROVIDES = SOLVER_FLAG_SPLITPROVIDES;
3303 static const int SOLVER_FLAG_IGNORE_RECOMMENDED = SOLVER_FLAG_IGNORE_RECOMMENDED;
3304 static const int SOLVER_FLAG_ADD_ALREADY_RECOMMENDED = SOLVER_FLAG_ADD_ALREADY_RECOMMENDED;
3305 static const int SOLVER_FLAG_NO_INFARCHCHECK = SOLVER_FLAG_NO_INFARCHCHECK;
3306 static const int SOLVER_FLAG_BEST_OBEY_POLICY = SOLVER_FLAG_BEST_OBEY_POLICY;
3307 static const int SOLVER_FLAG_NO_AUTOTARGET = SOLVER_FLAG_NO_AUTOTARGET;
3308 static const int SOLVER_FLAG_DUP_ALLOW_DOWNGRADE = SOLVER_FLAG_DUP_ALLOW_DOWNGRADE;
3309 static const int SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE = SOLVER_FLAG_DUP_ALLOW_ARCHCHANGE;
3310 static const int SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE = SOLVER_FLAG_DUP_ALLOW_VENDORCHANGE;
3311 static const int SOLVER_FLAG_DUP_ALLOW_NAMECHANGE = SOLVER_FLAG_DUP_ALLOW_NAMECHANGE;
3312 static const int SOLVER_FLAG_KEEP_ORPHANS = SOLVER_FLAG_KEEP_ORPHANS;
3313 static const int SOLVER_FLAG_BREAK_ORPHANS = SOLVER_FLAG_BREAK_ORPHANS;
3314 static const int SOLVER_FLAG_FOCUS_INSTALLED = SOLVER_FLAG_FOCUS_INSTALLED;
3315 static const int SOLVER_FLAG_YUM_OBSOLETES = SOLVER_FLAG_YUM_OBSOLETES;
3316 static const int SOLVER_FLAG_NEED_UPDATEPROVIDE = SOLVER_FLAG_NEED_UPDATEPROVIDE;
3317 static const int SOLVER_FLAG_FOCUS_BEST = SOLVER_FLAG_FOCUS_BEST;
3318 static const int SOLVER_FLAG_STRONG_RECOMMENDS = SOLVER_FLAG_STRONG_RECOMMENDS;
3319 static const int SOLVER_FLAG_INSTALL_ALSO_UPDATES = SOLVER_FLAG_INSTALL_ALSO_UPDATES;
3321 static const int SOLVER_REASON_UNRELATED = SOLVER_REASON_UNRELATED;
3322 static const int SOLVER_REASON_UNIT_RULE = SOLVER_REASON_UNIT_RULE;
3323 static const int SOLVER_REASON_KEEP_INSTALLED = SOLVER_REASON_KEEP_INSTALLED;
3324 static const int SOLVER_REASON_RESOLVE_JOB = SOLVER_REASON_RESOLVE_JOB;
3325 static const int SOLVER_REASON_UPDATE_INSTALLED = SOLVER_REASON_UPDATE_INSTALLED;
3326 static const int SOLVER_REASON_CLEANDEPS_ERASE = SOLVER_REASON_CLEANDEPS_ERASE;
3327 static const int SOLVER_REASON_RESOLVE = SOLVER_REASON_RESOLVE;
3328 static const int SOLVER_REASON_WEAKDEP = SOLVER_REASON_WEAKDEP;
3329 static const int SOLVER_REASON_RESOLVE_ORPHAN = SOLVER_REASON_RESOLVE_ORPHAN;
3330 static const int SOLVER_REASON_RECOMMENDED = SOLVER_REASON_RECOMMENDED;
3331 static const int SOLVER_REASON_SUPPLEMENTED = SOLVER_REASON_SUPPLEMENTED;
3334 static const int SOLVER_RULE_RPM = SOLVER_RULE_RPM;
3340 int set_flag(int flag, int value) {
3341 return solver_set_flag($self, flag, value);
3343 int get_flag(int flag) {
3344 return solver_get_flag($self, flag);
3346 #if defined(SWIGPYTHON)
3348 def solve(self, jobs):
3350 for job in jobs: j += [job.how, job.what]
3351 return self.solve_helper(j)
3354 #if defined(SWIGPERL)
3356 sub solv::Solver::solve {
3357 my ($self, $jobs) = @_;
3358 my @j = map {($_->{'how'}, $_->{'what'})} @$jobs;
3359 return $self->solve_helper(\@j);
3363 #if defined(SWIGRUBY)
3366 "class Solv::Solver\n"
3367 " def solve(jobs)\n"
3369 " jobs.each do |j| ; jl << j.how << j.what ; end\n"
3370 " solve_helper(jl)\n"
3376 %typemap(out) Queue solve_helper Queue2Array(Problem *, 1, new_Problem(arg1, id));
3377 %newobject solve_helper;
3378 Queue solve_helper(Queue jobs) {
3382 solver_solve($self, &jobs);
3383 cnt = solver_problem_count($self);
3384 for (i = 1; i <= cnt; i++)
3388 #if defined(SWIGTCL)
3389 %typemap(out) Queue solve Queue2Array(Problem *, 1, new_Problem(arg1, id));
3391 Queue solve(Queue solvejobs) {
3395 solver_solve($self, &solvejobs);
3396 cnt = solver_problem_count($self);
3397 for (i = 1; i <= cnt; i++)
3403 %newobject transaction;
3404 Transaction *transaction() {
3405 return solver_create_transaction($self);
3408 int describe_decision(XSolvable *s, XRule **OUTPUT) {
3410 int reason = solver_describe_decision($self, s->id, &ruleid);
3411 *OUTPUT = new_XRule($self, ruleid);
3415 %newobject describe_weakdep_decision_raw;
3416 Queue describe_weakdep_decision_raw(XSolvable *s) {
3419 solver_describe_weakdep_decision($self, s->id, &q);
3422 #if defined(SWIGPYTHON)
3424 def describe_weakdep_decision(self, s):
3425 d = iter(self.describe_weakdep_decision_raw(s))
3426 return [ (t, XSolvable(self.pool, sid), Dep(self.pool, id)) for t, sid, id in zip(d, d, d) ]
3429 #if defined(SWIGPERL)
3431 sub solv::Solver::describe_weakdep_decision {
3432 my ($self, $s) = @_;
3433 my $pool = $self->{'pool'};
3435 my @d = $self->describe_weakdep_decision_raw($s);
3436 push @res, [ splice(@d, 0, 3) ] while @d;
3437 return map { [ $_->[0], solv::XSolvable->new($pool, $_->[1]), solv::Dep->new($pool, $_->[2]) ] } @res;
3441 #if defined(SWIGRUBY)
3444 "class Solv::Solver\n"
3445 " def describe_weakdep_decision(s)\n"
3446 " 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"
3453 int alternatives_count() {
3454 return solver_alternatives_count($self);
3457 %newobject alternative;
3458 Alternative *alternative(Id aid) {
3459 Alternative *a = solv_calloc(1, sizeof(*a));
3461 queue_init(&a->choices);
3462 a->type = solver_get_alternative($self, aid, &a->dep_id, &a->from_id, &a->chosen_id, &a->choices, &a->level);
3464 queue_free(&a->choices);
3468 if (a->type == SOLVER_ALTERNATIVE_TYPE_RULE) {
3475 %typemap(out) Queue all_alternatives Queue2Array(Alternative *, 1, Solver_alternative(arg1, id));
3476 %newobject all_alternatives;
3477 Queue all_alternatives() {
3481 cnt = solver_alternatives_count($self);
3482 for (i = 1; i <= cnt; i++)
3487 bool write_testcase(const char *dir) {
3488 return testcase_write($self, dir, TESTCASE_RESULT_TRANSACTION | TESTCASE_RESULT_PROBLEMS, 0, 0);
3491 Queue raw_decisions(int filter=0) {
3494 solver_get_decisionqueue($self, &q);
3497 for (i = j = 0; i < q.count; i++)
3498 if ((filter > 0 && q.elements[i] > 1) ||
3499 (filter < 0 && q.elements[i] < 0))
3500 q.elements[j++] = q.elements[i];
3501 queue_truncate(&q, j);
3507 %extend Transaction {
3508 static const int SOLVER_TRANSACTION_IGNORE = SOLVER_TRANSACTION_IGNORE;
3509 static const int SOLVER_TRANSACTION_ERASE = SOLVER_TRANSACTION_ERASE;
3510 static const int SOLVER_TRANSACTION_REINSTALLED = SOLVER_TRANSACTION_REINSTALLED;
3511 static const int SOLVER_TRANSACTION_DOWNGRADED = SOLVER_TRANSACTION_DOWNGRADED;
3512 static const int SOLVER_TRANSACTION_CHANGED = SOLVER_TRANSACTION_CHANGED;
3513 static const int SOLVER_TRANSACTION_UPGRADED = SOLVER_TRANSACTION_UPGRADED;
3514 static const int SOLVER_TRANSACTION_OBSOLETED = SOLVER_TRANSACTION_OBSOLETED;
3515 static const int SOLVER_TRANSACTION_INSTALL = SOLVER_TRANSACTION_INSTALL;
3516 static const int SOLVER_TRANSACTION_REINSTALL = SOLVER_TRANSACTION_REINSTALL;
3517 static const int SOLVER_TRANSACTION_DOWNGRADE = SOLVER_TRANSACTION_DOWNGRADE;
3518 static const int SOLVER_TRANSACTION_CHANGE = SOLVER_TRANSACTION_CHANGE;
3519 static const int SOLVER_TRANSACTION_UPGRADE = SOLVER_TRANSACTION_UPGRADE;
3520 static const int SOLVER_TRANSACTION_OBSOLETES = SOLVER_TRANSACTION_OBSOLETES;
3521 static const int SOLVER_TRANSACTION_MULTIINSTALL = SOLVER_TRANSACTION_MULTIINSTALL;
3522 static const int SOLVER_TRANSACTION_MULTIREINSTALL = SOLVER_TRANSACTION_MULTIREINSTALL;
3523 static const int SOLVER_TRANSACTION_MAXTYPE = SOLVER_TRANSACTION_MAXTYPE;
3524 static const int SOLVER_TRANSACTION_SHOW_ACTIVE = SOLVER_TRANSACTION_SHOW_ACTIVE;
3525 static const int SOLVER_TRANSACTION_SHOW_ALL = SOLVER_TRANSACTION_SHOW_ALL;
3526 static const int SOLVER_TRANSACTION_SHOW_OBSOLETES = SOLVER_TRANSACTION_SHOW_OBSOLETES;
3527 static const int SOLVER_TRANSACTION_SHOW_MULTIINSTALL = SOLVER_TRANSACTION_SHOW_MULTIINSTALL;
3528 static const int SOLVER_TRANSACTION_CHANGE_IS_REINSTALL = SOLVER_TRANSACTION_CHANGE_IS_REINSTALL;
3529 static const int SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE = SOLVER_TRANSACTION_OBSOLETE_IS_UPGRADE;
3530 static const int SOLVER_TRANSACTION_MERGE_VENDORCHANGES = SOLVER_TRANSACTION_MERGE_VENDORCHANGES;
3531 static const int SOLVER_TRANSACTION_MERGE_ARCHCHANGES = SOLVER_TRANSACTION_MERGE_ARCHCHANGES;
3532 static const int SOLVER_TRANSACTION_RPM_ONLY = SOLVER_TRANSACTION_RPM_ONLY;
3533 static const int SOLVER_TRANSACTION_ARCHCHANGE = SOLVER_TRANSACTION_ARCHCHANGE;
3534 static const int SOLVER_TRANSACTION_VENDORCHANGE = SOLVER_TRANSACTION_VENDORCHANGE;
3535 static const int SOLVER_TRANSACTION_KEEP_ORDERDATA = SOLVER_TRANSACTION_KEEP_ORDERDATA;
3537 transaction_free($self);
3540 %rename("isempty?") isempty;
3543 return $self->steps.count == 0;
3546 %newobject othersolvable;
3547 XSolvable *othersolvable(XSolvable *s) {
3548 Id op = transaction_obs_pkg($self, s->id);
3549 return new_XSolvable($self->pool, op);
3552 %typemap(out) Queue allothersolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3553 %newobject allothersolvables;
3554 Queue allothersolvables(XSolvable *s) {
3557 transaction_all_obs_pkgs($self, s->id, &q);
3561 %typemap(out) Queue classify Queue2Array(TransactionClass *, 4, new_TransactionClass(arg1, arg2, id, idp[1], idp[2], idp[3]));
3562 %newobject classify;
3563 Queue classify(int mode = 0) {
3566 transaction_classify($self, mode, &q);
3570 /* deprecated, use newsolvables instead */
3571 %typemap(out) Queue newpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3572 %newobject newpackages;
3573 Queue newpackages() {
3577 cut = transaction_installedresult(self, &q);
3578 queue_truncate(&q, cut);
3582 /* deprecated, use keptsolvables instead */
3583 %typemap(out) Queue keptpackages Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3584 %newobject keptpackages;
3585 Queue keptpackages() {
3589 cut = transaction_installedresult(self, &q);
3591 queue_deleten(&q, 0, cut);
3595 %typemap(out) Queue newsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3596 %newobject newsolvables;
3597 Queue newsolvables() {
3601 cut = transaction_installedresult(self, &q);
3602 queue_truncate(&q, cut);
3606 %typemap(out) Queue keptsolvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3607 %newobject keptsolvables;
3608 Queue keptsolvables() {
3612 cut = transaction_installedresult(self, &q);
3614 queue_deleten(&q, 0, cut);
3618 %typemap(out) Queue steps Queue2Array(XSolvable *, 1, new_XSolvable(arg1->pool, id));
3622 queue_init_clone(&q, &$self->steps);
3626 int steptype(XSolvable *s, int mode) {
3627 return transaction_type($self, s->id, mode);
3629 int calc_installsizechange() {
3630 return transaction_calc_installsizechange($self);
3632 void order(int flags=0) {
3633 transaction_order($self, flags);
3637 %extend TransactionClass {
3638 TransactionClass(Transaction *trans, int mode, Id type, int count, Id fromid, Id toid) {
3639 TransactionClass *cl = solv_calloc(1, sizeof(*cl));
3640 cl->transaction = trans;
3644 cl->fromid = fromid;
3648 %typemap(out) Queue solvables Queue2Array(XSolvable *, 1, new_XSolvable(arg1->transaction->pool, id));
3649 %newobject solvables;
3653 transaction_classify_pkgs($self->transaction, $self->mode, $self->type, $self->fromid, $self->toid, &q);
3656 const char * const fromstr;
3657 const char * const tostr;
3659 SWIGINTERN const char *TransactionClass_fromstr_get(TransactionClass *cl) {
3660 return pool_id2str(cl->transaction->pool, cl->fromid);
3662 SWIGINTERN const char *TransactionClass_tostr_get(TransactionClass *cl) {
3663 return pool_id2str(cl->transaction->pool, cl->toid);
3669 XRule(Solver *solv, Id id) {
3672 XRule *xr = solv_calloc(1, sizeof(*xr));
3679 SWIGINTERN int XRule_type_get(XRule *xr) {
3680 return solver_ruleclass(xr->solv, xr->id);
3685 Id type, source, target, dep;
3686 type = solver_ruleinfo($self->solv, $self->id, &source, &target, &dep);
3687 return new_Ruleinfo($self, type, source, target, dep);
3689 %typemap(out) Queue allinfos Queue2Array(Ruleinfo *, 4, new_Ruleinfo(arg1, id, idp[1], idp[2], idp[3]));
3690 %newobject allinfos;
3694 solver_allruleinfos($self->solv, $self->id, &q);
3698 #if defined(SWIGTCL)
3699 %rename("==") __eq__;
3701 bool __eq__(XRule *xr) {
3702 return $self->solv == xr->solv && $self->id == xr->id;
3704 #if defined(SWIGTCL)
3705 %rename("!=") __ne__;
3707 bool __ne__(XRule *xr) {
3708 return !XRule___eq__($self, xr);
3710 #if defined(SWIGPYTHON)
3715 #if defined(SWIGPERL) || defined(SWIGTCL)
3716 %rename("repr") __repr__;
3718 %newobject __repr__;
3719 const char *__repr__() {
3721 sprintf(buf, "<Rule #%d>", $self->id);
3722 return solv_strdup(buf);
3727 Ruleinfo(XRule *r, Id type, Id source, Id target, Id dep_id) {
3728 Ruleinfo *ri = solv_calloc(1, sizeof(*ri));
3732 ri->source = source;
3733 ri->target = target;
3734 ri->dep_id = dep_id;
3737 %newobject solvable;
3738 XSolvable * const solvable;
3739 %newobject othersolvable;
3740 XSolvable * const othersolvable;
3744 SWIGINTERN XSolvable *Ruleinfo_solvable_get(Ruleinfo *ri) {
3745 return new_XSolvable(ri->solv->pool, ri->source);
3747 SWIGINTERN XSolvable *Ruleinfo_othersolvable_get(Ruleinfo *ri) {
3748 return new_XSolvable(ri->solv->pool, ri->target);
3750 SWIGINTERN Dep *Ruleinfo_dep_get(Ruleinfo *ri) {
3751 return new_Dep(ri->solv->pool, ri->dep_id);
3754 const char *problemstr() {
3755 return solver_problemruleinfo2str($self->solv, $self->type, $self->source, $self->target, $self->dep_id);
3760 XRepodata(Repo *repo, Id id) {
3761 XRepodata *xr = solv_calloc(1, sizeof(*xr));
3767 return repodata_new_handle(repo_id2repodata($self->repo, $self->id));
3769 void set_id(Id solvid, Id keyname, DepId id) {
3770 repodata_set_id(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3772 void set_str(Id solvid, Id keyname, const char *str) {
3773 repodata_set_str(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3775 void set_poolstr(Id solvid, Id keyname, const char *str) {
3776 repodata_set_poolstr(repo_id2repodata($self->repo, $self->id), solvid, keyname, str);
3778 void add_idarray(Id solvid, Id keyname, DepId id) {
3779 repodata_add_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, id);
3781 void add_flexarray(Id solvid, Id keyname, Id handle) {
3782 repodata_add_flexarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, handle);
3784 void set_checksum(Id solvid, Id keyname, Chksum *chksum) {
3785 const unsigned char *buf = solv_chksum_get(chksum, 0);
3787 repodata_set_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, solv_chksum_get_type(chksum), buf);
3789 const char *lookup_str(Id solvid, Id keyname) {
3790 return repodata_lookup_str(repo_id2repodata($self->repo, $self->id), solvid, keyname);
3792 Queue lookup_idarray(Id solvid, Id keyname) {
3795 repodata_lookup_idarray(repo_id2repodata($self->repo, $self->id), solvid, keyname, &r);
3798 %newobject lookup_checksum;
3799 Chksum *lookup_checksum(Id solvid, Id keyname) {
3801 const unsigned char *b = repodata_lookup_bin_checksum(repo_id2repodata($self->repo, $self->id), solvid, keyname, &type);
3802 return solv_chksum_create_from_bin(type, b);
3804 void internalize() {
3805 repodata_internalize(repo_id2repodata($self->repo, $self->id));
3807 void create_stubs() {
3808 Repodata *data = repo_id2repodata($self->repo, $self->id);
3809 data = repodata_create_stubs(data);
3810 $self->id = data->repodataid;
3812 bool write(FILE *fp) {
3813 return repodata_write(repo_id2repodata($self->repo, $self->id), fp) == 0;
3815 bool add_solv(FILE *fp, int flags = 0) {
3816 Repodata *data = repo_id2repodata($self->repo, $self->id);
3817 int r, oldstate = data->state;
3818 data->state = REPODATA_LOADING;
3819 r = repo_add_solv(data->repo, fp, flags | REPO_USE_LOADING);
3820 if (r || data->state == REPODATA_LOADING)
3821 data->state = oldstate;
3824 void extend_to_repo() {
3825 Repodata *data = repo_id2repodata($self->repo, $self->id);
3826 repodata_extend_block(data, data->repo->start, data->repo->end - data->repo->start);
3828 #if defined(SWIGTCL)
3829 %rename("==") __eq__;
3831 bool __eq__(XRepodata *xr) {
3832 return $self->repo == xr->repo && $self->id == xr->id;
3834 #if defined(SWIGTCL)
3835 %rename("!=") __ne__;
3837 bool __ne__(XRepodata *xr) {
3838 return !XRepodata___eq__($self, xr);
3840 #if defined(SWIGPYTHON)
3845 #if defined(SWIGPERL) || defined(SWIGTCL)
3846 %rename("repr") __repr__;
3848 %newobject __repr__;
3849 const char *__repr__() {
3851 sprintf(buf, "<Repodata #%d>", $self->id);
3852 return solv_strdup(buf);
3856 #ifdef ENABLE_PUBKEY
3859 return solvsig_create(fp);
3862 solvsig_free($self);
3866 return $self->htype ? (Chksum *)solv_chksum_create($self->htype) : 0;
3868 #ifdef ENABLE_PGPVRFY
3870 XSolvable *verify(Repo *repo, Chksum *chksum) {
3871 Id p = solvsig_verify($self, repo, chksum);
3872 return new_XSolvable(repo->pool, p);
3878 %extend Alternative {
3879 static const int SOLVER_ALTERNATIVE_TYPE_RULE = SOLVER_ALTERNATIVE_TYPE_RULE;
3880 static const int SOLVER_ALTERNATIVE_TYPE_RECOMMENDS = SOLVER_ALTERNATIVE_TYPE_RECOMMENDS;
3881 static const int SOLVER_ALTERNATIVE_TYPE_SUGGESTS = SOLVER_ALTERNATIVE_TYPE_SUGGESTS;
3884 queue_free(&$self->choices);
3888 XSolvable * const chosen;
3891 %newobject depsolvable;
3892 XSolvable * const depsolvable;
3896 SWIGINTERN XSolvable *Alternative_chosen_get(Alternative *a) {
3897 return new_XSolvable(a->solv->pool, a->chosen_id);
3899 SWIGINTERN XRule *Alternative_rule_get(Alternative *a) {
3900 return new_XRule(a->solv, a->rid);
3902 SWIGINTERN XSolvable *Alternative_depsolvable_get(Alternative *a) {
3903 return new_XSolvable(a->solv->pool, a->from_id);
3905 SWIGINTERN Dep *Alternative_dep_get(Alternative *a) {
3906 return new_Dep(a->solv->pool, a->dep_id);
3910 Queue choices_raw() {
3912 queue_init_clone(&r, &$self->choices);
3916 %typemap(out) Queue choices Queue2Array(XSolvable *, 1, new_XSolvable(arg1->solv->pool, id));
3920 queue_init_clone(&r, &$self->choices);
3921 for (i = 0; i < r.count; i++)
3922 if (r.elements[i] < 0)
3923 r.elements[i] = -r.elements[i];
3927 #if defined(SWIGPERL) || defined(SWIGTCL)
3928 %rename("str") __str__;
3930 const char *__str__() {
3931 return solver_alternative2str($self->solv, $self->type, $self->type == SOLVER_ALTERNATIVE_TYPE_RULE ? $self->rid : $self->dep_id, $self->from_id);
3935 #if defined(SWIGTCL)
3938 "proc solv::iter {varname iter body} {\n"\
3940 " set value [$iter __next__]\n"\
3941 " if {$value eq \"NULL\"} { break }\n"\
3942 " uplevel [list set $varname $value]\n"\
3943 " set code [catch {uplevel $body} result]\n"\
3944 " switch -exact -- $code {\n"\
3948 " default { return -code $code $result }\n"\