# work around a swig bug
%{
#undef SWIG_CALLXS
-#ifdef PERL_OBJECT
-# define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
-#else
-# ifndef MULTIPLICITY
-# define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
-# else
-# define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
-# endif
-#endif
+#ifdef PERL_OBJECT
+# define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv,pPerl)
+#else
+# ifndef MULTIPLICITY
+# define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(cv)
+# else
+# define SWIG_CALLXS(_name) TOPMARK=MARK-PL_stack_base;_name(PERL_GET_THX, cv)
+# endif
+#endif
%}
SWIG_AsValDepId(void *obj, int *val) {
#endif
static swig_type_info* desc = 0;
- void *vptr = 0;
+ void *vptr = 0;
int ecode;
if (!desc) desc = SWIG_TypeQuery("Dep *");
ecode = SWIG_AsVal_int(obj, val);
}
else if (!strcmp(argv[1], "--arch"))
{
- if (!strcmp(argv[2], "src") || !strcmp(argv[2], "nosrc"))
+ if (!strcmp(argv[2], "src") || !strcmp(argv[2], "nosrc"))
archfilter_src = 1;
queue_push2(&archfilter, SOLVER_SOLVABLE_PROVIDES, pool_rel2id(pool, 0, pool_str2id(pool, argv[2], 1), REL_ARCH, 1));
argc -= 2;
/*
* dataiterator.h
- *
+ *
*/
#ifndef LIBSOLV_DATAITERATOR_H
/*
* Dataiterator
- *
+ *
* Iterator like interface to 'search' functionality
- *
+ *
* Dataiterator is per-pool, additional filters can be applied
* to limit the search domain. See dataiterator_init below.
- *
+ *
* Use these like:
* Dataiterator di;
* dataiterator_init(&di, repo->pool, repo, 0, 0, "bla", SEARCH_SUBSTRING);
/*
* Initialize dataiterator
- *
+ *
* di: Pointer to Dataiterator to be initialized
* pool: Search domain for the iterator
* repo: if non-null, limit search to this repo
/*
* evr.h
- *
+ *
*/
#ifndef LIBSOLV_EVR_H
/* compute bitmask for value
* returns smallest (2^n-1) > 2 * num
- *
+ *
* used for Hashtable 'modulo' operation
- */
+ */
static inline Hashval
mkmask(unsigned int num)
{
/*
* pool.h
- *
+ *
*/
#ifndef LIBSOLV_POOL_H
Id solvid;
Id repodataid;
Id schema;
- Id dp;
+ Id dp;
} Datapos;
struct _Pool_tmpspace {
/*
* poolid.h
- *
+ *
*/
#ifndef LIBSOLV_POOLID_H
/*
* poolid_private.h
- *
+ *
*/
#ifndef LIBSOLV_POOLID_PRIVATE_H
/*
* pooltypes.h
- *
+ *
*/
#ifndef LIBSOLV_POOLTYPES_H
/*
* queue.h
- *
+ *
*/
#ifndef LIBSOLV_QUEUE_H
/*
* repo.h
- *
+ *
*/
#ifndef LIBSOLV_REPO_H
if (s->repo && s->repo->disabled)
return 1;
if (pool->considered)
- {
+ {
Id id = s - pool->solvables;
if (!MAPTST(pool->considered, id))
return 1;
if (pool->id2arch && (s->arch > pool->lastarch || !pool->id2arch[s->arch]))
return 0;
if (pool->considered)
- {
+ {
Id id = s - pool->solvables;
if (!MAPTST(pool->considered, id))
return 0;
void repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q);
void repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker);
void repo_unset(Repo *repo, Id p, Id keyname);
-
+
void repo_internalize(Repo *repo);
void repo_disable_paging(Repo *repo);
/*
* repodata.h
- *
+ *
*/
#ifndef LIBSOLV_REPODATA_H
#define LIBSOLV_REPODATA_H
-#include <stdio.h>
+#include <stdio.h>
#include "pooltypes.h"
#include "pool.h"
void repodata_unset(Repodata *data, Id solvid, Id keyname);
void repodata_unset_uninternalized(Repodata *data, Id solvid, Id keyname);
-/*
+/*
merge/swap attributes from one solvable to another
works only if the data is not yet internalized
*/
/*
* selection.h
- *
+ *
*/
#ifndef LIBSOLV_SELECTION_H
/*
* FILE: sha2.h
* AUTHOR: Aaron D. Gifford <me@aarongifford.com>
- *
+ *
* Copyright (c) 2000-2001, Aaron D. Gifford
* All rights reserved.
*
* 3. Neither the name of the copyright holder nor the names of contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
- *
+ *
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
/*
* solvable.h
- *
+ *
* A solvable represents an object with name-epoch:version-release.arch
* and dependencies
*/
void solvable_unset(Solvable *s, Id keyname);
int solvable_identical(Solvable *s1, Solvable *s2);
-Id solvable_selfprovidedep(Solvable *s);
+Id solvable_selfprovidedep(Solvable *s);
int solvable_matchesdep(Solvable *s, Id keyname, Id dep, int marker);
#ifdef __cplusplus
#ifdef LIBSOLV_INTERNAL
Repo *installed; /* copy of pool->installed */
-
+
/* list of rules, ordered
* rpm rules first, then features, updates, jobs, learnt
* see start/end offsets below
Queue ruleassertions; /* Queue of all assertion rules */
/* start/end offset for rule 'areas' */
-
+
Id rpmrules_end; /* [Offset] rpm rules end */
-
+
Id featurerules; /* feature rules start/end */
Id featurerules_end;
-
+
Id updaterules; /* policy rules, e.g. keep packages installed or update. All literals > 0 */
Id updaterules_end;
-
+
Id jobrules; /* user rules */
Id jobrules_end;
Id duprules; /* dist upgrade rules */
Id duprules_end;
-
+
Id bestrules; /* rules from SOLVER_FORCEBEST */
Id bestrules_end;
Id *bestrules_pkg;
int dontinstallrecommended; /* true: do not install recommended packages */
int addalreadyrecommended; /* true: also install recommended packages that were already recommended by the installed packages */
int dontshowinstalledrecommended; /* true: do not show recommended packages that are already installed */
-
+
int noinfarchcheck; /* true: do not forbid inferior architectures */
int keepexplicitobsoletes; /* true: honor obsoletes during multiinstall */
int bestobeypolicy; /* true: stay in policy with the best rules */
int noautotarget; /* true: do not assume targeted for up/dup jobs that contain no installed solvable */
-
+
Map dupmap; /* dup these packages*/
int dupmap_all; /* dup all packages */
Map dupinvolvedmap; /* packages involved in dup process */
/* order a transaction */
extern void transaction_order(Transaction *trans, int flags);
-/* roll your own order funcion:
+/* roll your own order funcion:
* add pkgs free for installation to queue choices after chosen was
* installed. start with chosen = 0
* needs an ordered transaction created with SOLVER_TRANSACTION_KEEP_ORDERDATA */