Compare commits
No commits in common. 'c9' and 'c8' have entirely different histories.
@ -1 +1 @@
|
|||||||
SOURCES/libsolv-0.7.24.tar.gz
|
SOURCES/libsolv-0.7.20.tar.gz
|
||||||
|
@ -1 +1 @@
|
|||||||
d5bcae967154dd1e904fd90cc17f5dce3da646f8 SOURCES/libsolv-0.7.24.tar.gz
|
35be0bb4422af55bc8434f3c33367dbb7dc50cba SOURCES/libsolv-0.7.20.tar.gz
|
||||||
|
@ -0,0 +1,311 @@
|
|||||||
|
From 9b89a186e3769631b6cee859be9d69063cfdfb94 Mon Sep 17 00:00:00 2001
|
||||||
|
From: Michael Schroeder <mls@suse.de>
|
||||||
|
Date: Fri, 25 Feb 2022 16:47:21 +0100
|
||||||
|
Subject: [PATCH 2/3] Add support for storing user data in a solv file
|
||||||
|
|
||||||
|
Userdata can be arbritrary (binary)data with a maximum size of
|
||||||
|
65535 bytes. It can be read without reading the complete
|
||||||
|
solv file, but do not forget to rewind the fp after reading
|
||||||
|
the user data.
|
||||||
|
|
||||||
|
New functions:
|
||||||
|
void
|
||||||
|
void repowriter_set_userdata(Repowriter *writer, const void *data, int len)
|
||||||
|
int solv_read_userdata(FILE *fp, unsigned char **datap, int *lenp)
|
||||||
|
---
|
||||||
|
src/libsolv.ver | 2 ++
|
||||||
|
src/pooltypes.h | 6 ++++--
|
||||||
|
src/repo_solv.c | 54 ++++++++++++++++++++++++++++++++++++++++++++++++
|
||||||
|
src/repo_solv.h | 1 +
|
||||||
|
src/repo_write.c | 24 ++++++++++++++++++++-
|
||||||
|
src/repo_write.h | 3 +++
|
||||||
|
tools/dumpsolv.c | 50 ++++++++++++++++++++++++++++++++++++++++----
|
||||||
|
7 files changed, 133 insertions(+), 7 deletions(-)
|
||||||
|
|
||||||
|
diff --git a/src/libsolv.ver b/src/libsolv.ver
|
||||||
|
index ee40d0ad..4c6fbf4f 100644
|
||||||
|
--- a/src/libsolv.ver
|
||||||
|
+++ b/src/libsolv.ver
|
||||||
|
@@ -255,6 +255,7 @@ SOLV_1.0 {
|
||||||
|
repowriter_set_keyqueue;
|
||||||
|
repowriter_set_repodatarange;
|
||||||
|
repowriter_set_solvablerange;
|
||||||
|
+ repowriter_set_userdata;
|
||||||
|
repowriter_write;
|
||||||
|
selection_add;
|
||||||
|
selection_filter;
|
||||||
|
@@ -288,6 +289,7 @@ SOLV_1.0 {
|
||||||
|
solv_malloc;
|
||||||
|
solv_malloc2;
|
||||||
|
solv_oom;
|
||||||
|
+ solv_read_userdata;
|
||||||
|
solv_realloc;
|
||||||
|
solv_realloc2;
|
||||||
|
solv_replacebadutf8;
|
||||||
|
diff --git a/src/pooltypes.h b/src/pooltypes.h
|
||||||
|
index e1f77b0e..3bde155a 100644
|
||||||
|
--- a/src/pooltypes.h
|
||||||
|
+++ b/src/pooltypes.h
|
||||||
|
@@ -23,9 +23,11 @@
|
||||||
|
#define SOLV_VERSION_6 6
|
||||||
|
#define SOLV_VERSION_7 7
|
||||||
|
#define SOLV_VERSION_8 8
|
||||||
|
+#define SOLV_VERSION_9 9
|
||||||
|
|
||||||
|
-#define SOLV_FLAG_PREFIX_POOL 4
|
||||||
|
-#define SOLV_FLAG_SIZE_BYTES 8
|
||||||
|
+#define SOLV_FLAG_PREFIX_POOL 4
|
||||||
|
+#define SOLV_FLAG_SIZE_BYTES 8
|
||||||
|
+#define SOLV_FLAG_USERDATA 16
|
||||||
|
|
||||||
|
struct s_Stringpool;
|
||||||
|
typedef struct s_Stringpool Stringpool;
|
||||||
|
diff --git a/src/repo_solv.c b/src/repo_solv.c
|
||||||
|
index 761d06e6..2ba602b2 100644
|
||||||
|
--- a/src/repo_solv.c
|
||||||
|
+++ b/src/repo_solv.c
|
||||||
|
@@ -514,6 +514,7 @@ repo_add_solv(Repo *repo, FILE *fp, int flags)
|
||||||
|
switch (solvversion)
|
||||||
|
{
|
||||||
|
case SOLV_VERSION_8:
|
||||||
|
+ case SOLV_VERSION_9:
|
||||||
|
break;
|
||||||
|
default:
|
||||||
|
return pool_error(pool, SOLV_ERROR_UNSUPPORTED, "unsupported SOLV version");
|
||||||
|
@@ -552,6 +553,18 @@ repo_add_solv(Repo *repo, FILE *fp, int flags)
|
||||||
|
return pool_error(pool, SOLV_ERROR_CORRUPT, "main repository contains holes, cannot extend");
|
||||||
|
}
|
||||||
|
|
||||||
|
+ /******* Part 0: skip optional userdata ******************************/
|
||||||
|
+
|
||||||
|
+ if (solvflags & SOLV_FLAG_USERDATA)
|
||||||
|
+ {
|
||||||
|
+ unsigned int userdatalen = read_u32(&data);
|
||||||
|
+ if (userdatalen >= 65536)
|
||||||
|
+ return pool_error(pool, SOLV_ERROR_CORRUPT, "illegal userdata length");
|
||||||
|
+ while (userdatalen--)
|
||||||
|
+ if (getc(data.fp) == EOF)
|
||||||
|
+ return pool_error(pool, SOLV_ERROR_EOF, "unexpected EOF");
|
||||||
|
+ }
|
||||||
|
+
|
||||||
|
/******* Part 1: string IDs *****************************************/
|
||||||
|
|
||||||
|
sizeid = read_u32(&data); /* size of string space */
|
||||||
|
@@ -1353,3 +1366,44 @@ printf("=> %s %s %p\n", pool_id2str(pool, keys[key].name), pool_id2str(pool, key
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
+int
|
||||||
|
+solv_read_userdata(FILE *fp, unsigned char **datap, int *lenp)
|
||||||
|
+{
|
||||||
|
+ unsigned char d[4 * 10], *ud = 0;
|
||||||
|
+ unsigned int n;
|
||||||
|
+ if (fread(d, sizeof(d), 1, fp) != 1)
|
||||||
|
+ return SOLV_ERROR_EOF;
|
||||||
|
+ n = d[0] << 24 | d[1] << 16 | d[2] << 8 | d[3];
|
||||||
|
+ if (n != ('S' << 24 | 'O' << 16 | 'L' << 8 | 'V'))
|
||||||
|
+ return SOLV_ERROR_NOT_SOLV;
|
||||||
|
+ n = d[4] << 24 | d[5] << 16 | d[6] << 8 | d[7];
|
||||||
|
+ switch(n)
|
||||||
|
+ {
|
||||||
|
+ case SOLV_VERSION_8:
|
||||||
|
+ case SOLV_VERSION_9:
|
||||||
|
+ break;
|
||||||
|
+ default:
|
||||||
|
+ return SOLV_ERROR_UNSUPPORTED;
|
||||||
|
+ }
|
||||||
|
+ n = d[32] << 24 | d[33] << 16 | d[34] << 8 | d[35];
|
||||||
|
+ if (!(n & SOLV_FLAG_USERDATA))
|
||||||
|
+ n = 0;
|
||||||
|
+ else
|
||||||
|
+ n = d[36] << 24 | d[37] << 16 | d[38] << 8 | d[39];
|
||||||
|
+ if (n >= 65536)
|
||||||
|
+ return SOLV_ERROR_CORRUPT;
|
||||||
|
+ if (n)
|
||||||
|
+ {
|
||||||
|
+ ud = solv_malloc(n + 1);
|
||||||
|
+ if (fread(ud, n, 1, fp) != 1)
|
||||||
|
+ {
|
||||||
|
+ solv_free(ud);
|
||||||
|
+ return SOLV_ERROR_EOF;
|
||||||
|
+ }
|
||||||
|
+ ud[n] = 0;
|
||||||
|
+ }
|
||||||
|
+ *datap = ud;
|
||||||
|
+ if (lenp)
|
||||||
|
+ *lenp = (int)n;
|
||||||
|
+ return 0;
|
||||||
|
+}
|
||||||
|
diff --git a/src/repo_solv.h b/src/repo_solv.h
|
||||||
|
index 0c663949..57bf1772 100644
|
||||||
|
--- a/src/repo_solv.h
|
||||||
|
+++ b/src/repo_solv.h
|
||||||
|
@@ -23,6 +23,7 @@ extern "C" {
|
||||||
|
#endif
|
||||||
|
|
||||||
|
extern int repo_add_solv(Repo *repo, FILE *fp, int flags);
|
||||||
|
+extern int solv_read_userdata(FILE *fp, unsigned char **datap, int *lenp);
|
||||||
|
|
||||||
|
#define SOLV_ADD_NO_STUBS (1 << 8)
|
||||||
|
|
||||||
|
diff --git a/src/repo_write.c b/src/repo_write.c
|
||||||
|
index af4e7599..a11de002 100644
|
||||||
|
--- a/src/repo_write.c
|
||||||
|
+++ b/src/repo_write.c
|
||||||
|
@@ -1071,6 +1071,7 @@ repowriter_create(Repo *repo)
|
||||||
|
Repowriter *
|
||||||
|
repowriter_free(Repowriter *writer)
|
||||||
|
{
|
||||||
|
+ solv_free(writer->userdata);
|
||||||
|
return solv_free(writer);
|
||||||
|
}
|
||||||
|
|
||||||
|
@@ -1107,6 +1108,17 @@ repowriter_set_solvablerange(Repowriter *writer, int solvablestart, int solvable
|
||||||
|
writer->solvableend = solvableend;
|
||||||
|
}
|
||||||
|
|
||||||
|
+void
|
||||||
|
+repowriter_set_userdata(Repowriter *writer, const void *data, int len)
|
||||||
|
+{
|
||||||
|
+ writer->userdata = solv_free(writer->userdata);
|
||||||
|
+ writer->userdatalen = 0;
|
||||||
|
+ if (len < 0 || len >= 65536)
|
||||||
|
+ return;
|
||||||
|
+ writer->userdata = len ? solv_memdup(data, len) : 0;
|
||||||
|
+ writer->userdatalen = len;
|
||||||
|
+}
|
||||||
|
+
|
||||||
|
/*
|
||||||
|
* the code works the following way:
|
||||||
|
*
|
||||||
|
@@ -1898,7 +1910,10 @@ for (i = 1; i < target.nkeys; i++)
|
||||||
|
|
||||||
|
/* write file header */
|
||||||
|
write_u32(&target, 'S' << 24 | 'O' << 16 | 'L' << 8 | 'V');
|
||||||
|
- write_u32(&target, SOLV_VERSION_8);
|
||||||
|
+ if (writer->userdatalen)
|
||||||
|
+ write_u32(&target, SOLV_VERSION_9);
|
||||||
|
+ else
|
||||||
|
+ write_u32(&target, SOLV_VERSION_8);
|
||||||
|
|
||||||
|
|
||||||
|
/* write counts */
|
||||||
|
@@ -1911,7 +1926,14 @@ for (i = 1; i < target.nkeys; i++)
|
||||||
|
solv_flags = 0;
|
||||||
|
solv_flags |= SOLV_FLAG_PREFIX_POOL;
|
||||||
|
solv_flags |= SOLV_FLAG_SIZE_BYTES;
|
||||||
|
+ if (writer->userdatalen)
|
||||||
|
+ solv_flags |= SOLV_FLAG_USERDATA;
|
||||||
|
write_u32(&target, solv_flags);
|
||||||
|
+ if (writer->userdatalen)
|
||||||
|
+ {
|
||||||
|
+ write_u32(&target, writer->userdatalen);
|
||||||
|
+ write_blob(&target, writer->userdata, writer->userdatalen);
|
||||||
|
+ }
|
||||||
|
|
||||||
|
if (nstrings)
|
||||||
|
{
|
||||||
|
diff --git a/src/repo_write.h b/src/repo_write.h
|
||||||
|
index 34716705..7734b013 100644
|
||||||
|
--- a/src/repo_write.h
|
||||||
|
+++ b/src/repo_write.h
|
||||||
|
@@ -32,6 +32,8 @@ typedef struct s_Repowriter {
|
||||||
|
int (*keyfilter)(Repo *repo, Repokey *key, void *kfdata);
|
||||||
|
void *kfdata;
|
||||||
|
Queue *keyq;
|
||||||
|
+ void *userdata;
|
||||||
|
+ int userdatalen;
|
||||||
|
} Repowriter;
|
||||||
|
|
||||||
|
/* repowriter flags */
|
||||||
|
@@ -46,6 +48,7 @@ void repowriter_set_keyfilter(Repowriter *writer, int (*keyfilter)(Repo *repo, R
|
||||||
|
void repowriter_set_keyqueue(Repowriter *writer, Queue *keyq);
|
||||||
|
void repowriter_set_repodatarange(Repowriter *writer, int repodatastart, int repodataend);
|
||||||
|
void repowriter_set_solvablerange(Repowriter *writer, int solvablestart, int solvableend);
|
||||||
|
+void repowriter_set_userdata(Repowriter *writer, const void *data, int len);
|
||||||
|
int repowriter_write(Repowriter *writer, FILE *fp);
|
||||||
|
|
||||||
|
/* convenience functions */
|
||||||
|
diff --git a/tools/dumpsolv.c b/tools/dumpsolv.c
|
||||||
|
index 13076574..49651fbe 100644
|
||||||
|
--- a/tools/dumpsolv.c
|
||||||
|
+++ b/tools/dumpsolv.c
|
||||||
|
@@ -13,6 +13,7 @@
|
||||||
|
|
||||||
|
static int with_attr;
|
||||||
|
static int dump_json;
|
||||||
|
+static int dump_userdata;
|
||||||
|
|
||||||
|
#include "pool.h"
|
||||||
|
#include "chksum.h"
|
||||||
|
@@ -394,10 +395,7 @@ int main(int argc, char **argv)
|
||||||
|
int c, i, j, n;
|
||||||
|
Solvable *s;
|
||||||
|
|
||||||
|
- pool = pool_create();
|
||||||
|
- pool_setloadcallback(pool, loadcallback, 0);
|
||||||
|
-
|
||||||
|
- while ((c = getopt(argc, argv, "haj")) >= 0)
|
||||||
|
+ while ((c = getopt(argc, argv, "uhaj")) >= 0)
|
||||||
|
{
|
||||||
|
switch(c)
|
||||||
|
{
|
||||||
|
@@ -410,11 +408,55 @@ int main(int argc, char **argv)
|
||||||
|
case 'j':
|
||||||
|
dump_json = 1;
|
||||||
|
break;
|
||||||
|
+ case 'u':
|
||||||
|
+ dump_userdata++;
|
||||||
|
+ break;
|
||||||
|
default:
|
||||||
|
usage(1);
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
+ if (dump_userdata)
|
||||||
|
+ {
|
||||||
|
+ if (optind == argc)
|
||||||
|
+ argc++;
|
||||||
|
+ for (; optind < argc; optind++)
|
||||||
|
+ {
|
||||||
|
+ unsigned char *userdata = 0;
|
||||||
|
+ int r, userdatalen = 0;
|
||||||
|
+ if (argv[optind] && freopen(argv[optind], "r", stdin) == 0)
|
||||||
|
+ {
|
||||||
|
+ perror(argv[optind]);
|
||||||
|
+ exit(1);
|
||||||
|
+ }
|
||||||
|
+ r = solv_read_userdata(stdin, &userdata, &userdatalen);
|
||||||
|
+ if (r)
|
||||||
|
+ {
|
||||||
|
+ fprintf(stderr, "could not read userdata: error %d\n", r);
|
||||||
|
+ exit(1);
|
||||||
|
+ }
|
||||||
|
+ if (dump_userdata > 1)
|
||||||
|
+ {
|
||||||
|
+ /* dump raw */
|
||||||
|
+ if (userdatalen && fwrite(userdata, userdatalen, 1, stdout) != 1)
|
||||||
|
+ {
|
||||||
|
+ perror("fwrite");
|
||||||
|
+ exit(1);
|
||||||
|
+ }
|
||||||
|
+ }
|
||||||
|
+ else
|
||||||
|
+ {
|
||||||
|
+ for (r = 0; r < userdatalen; r++)
|
||||||
|
+ printf("%02x", userdata[r]);
|
||||||
|
+ printf("\n");
|
||||||
|
+ }
|
||||||
|
+ solv_free(userdata);
|
||||||
|
+ }
|
||||||
|
+ exit(0);
|
||||||
|
+ }
|
||||||
|
+
|
||||||
|
+ pool = pool_create();
|
||||||
|
+ pool_setloadcallback(pool, loadcallback, 0);
|
||||||
|
if (!dump_json)
|
||||||
|
pool_setdebuglevel(pool, 1);
|
||||||
|
if (dump_json)
|
||||||
|
--
|
||||||
|
2.31.1
|
||||||
|
|
@ -1,348 +0,0 @@
|
|||||||
From 21090e6067660e4a22d6227118d5cfc30629d548 Mon Sep 17 00:00:00 2001
|
|
||||||
From: Nicola Sella <nsella@redhat.com>
|
|
||||||
Date: Wed, 7 Dec 2022 16:11:10 +0100
|
|
||||||
Subject: [PATCH 1/3] Revert "Improve choice rule generation"
|
|
||||||
|
|
||||||
This reverts commit 1da9bef88dd269055cbd7eda2f3572963d6d9b64.
|
|
||||||
---
|
|
||||||
src/rules.c | 169 ++++++++++++++++++++++++++++++++++++++-------------
|
|
||||||
src/solver.c | 45 --------------
|
|
||||||
2 files changed, 126 insertions(+), 88 deletions(-)
|
|
||||||
|
|
||||||
diff --git a/src/rules.c b/src/rules.c
|
|
||||||
index 2c56959c..a260c2de 100644
|
|
||||||
--- a/src/rules.c
|
|
||||||
+++ b/src/rules.c
|
|
||||||
@@ -3255,12 +3255,6 @@ solver_rule2rules(Solver *solv, Id rid, Queue *q, int recursive)
|
|
||||||
|
|
||||||
|
|
||||||
/* check if the newest versions of pi still provides the dependency we're looking for */
|
|
||||||
-/* pi: installed package
|
|
||||||
- * r: rule for the dependency
|
|
||||||
- * m: map with all positive elements of r
|
|
||||||
- * return 0: at least one provider
|
|
||||||
- * return 1: the newest versions do not provide the dependency
|
|
||||||
- */
|
|
||||||
static int
|
|
||||||
solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m, Queue *q)
|
|
||||||
{
|
|
||||||
@@ -3309,6 +3303,94 @@ solver_choicerulecheck(Solver *solv, Id pi, Rule *r, Map *m, Queue *q)
|
|
||||||
return 1; /* none of the new packages provided it */
|
|
||||||
}
|
|
||||||
|
|
||||||
+static int
|
|
||||||
+solver_choicerulecheck2(Solver *solv, Id pi, Id pt, Queue *q)
|
|
||||||
+{
|
|
||||||
+ Pool *pool = solv->pool;
|
|
||||||
+ Rule *ur;
|
|
||||||
+ Id p, pp;
|
|
||||||
+ int i;
|
|
||||||
+
|
|
||||||
+ if (!q->count || q->elements[0] != pi)
|
|
||||||
+ {
|
|
||||||
+ if (q->count)
|
|
||||||
+ queue_empty(q);
|
|
||||||
+ ur = solv->rules + solv->updaterules + (pi - pool->installed->start);
|
|
||||||
+ if (!ur->p)
|
|
||||||
+ ur = solv->rules + solv->featurerules + (pi - pool->installed->start);
|
|
||||||
+ if (!ur->p)
|
|
||||||
+ return 1; /* orphaned, thus newest */
|
|
||||||
+ queue_push2(q, pi, 0);
|
|
||||||
+ FOR_RULELITERALS(p, pp, ur)
|
|
||||||
+ if (p > 0 && p != pi)
|
|
||||||
+ queue_push(q, p);
|
|
||||||
+ queue_push(q, pi);
|
|
||||||
+ }
|
|
||||||
+ if (q->count <= 3)
|
|
||||||
+ return q->count == 3 && q->elements[2] == pt ? 1 : 0;
|
|
||||||
+ if (!q->elements[1])
|
|
||||||
+ {
|
|
||||||
+ queue_deleten(q, 0, 2);
|
|
||||||
+ policy_filter_unwanted(solv, q, POLICY_MODE_CHOOSE);
|
|
||||||
+ queue_unshift(q, 1); /* filter mark */
|
|
||||||
+ queue_unshift(q, pi);
|
|
||||||
+ }
|
|
||||||
+ for (i = 2; i < q->count; i++)
|
|
||||||
+ if (q->elements[i] == pt)
|
|
||||||
+ return 1;
|
|
||||||
+ return 0; /* not newest */
|
|
||||||
+}
|
|
||||||
+
|
|
||||||
+static int
|
|
||||||
+solver_choicerulecheck3(Solver *solv, Id pt, Queue *q)
|
|
||||||
+{
|
|
||||||
+ Pool *pool = solv->pool;
|
|
||||||
+ Id p, pp;
|
|
||||||
+ int i;
|
|
||||||
+
|
|
||||||
+ if (!q->count || q->elements[0] != pt)
|
|
||||||
+ {
|
|
||||||
+ Solvable *s = pool->solvables + pt;
|
|
||||||
+ if (q->count)
|
|
||||||
+ queue_empty(q);
|
|
||||||
+ /* no installed package, so check all with same name */
|
|
||||||
+ queue_push2(q, pt, 0);
|
|
||||||
+ FOR_PROVIDES(p, pp, s->name)
|
|
||||||
+ if (pool->solvables[p].name == s->name && p != pt)
|
|
||||||
+ queue_push(q, p);
|
|
||||||
+ queue_push(q, pt);
|
|
||||||
+ }
|
|
||||||
+ if (q->count <= 3)
|
|
||||||
+ return q->count == 3 && q->elements[2] == pt ? 1 : 0;
|
|
||||||
+ if (!q->elements[1])
|
|
||||||
+ {
|
|
||||||
+ queue_deleten(q, 0, 2);
|
|
||||||
+ policy_filter_unwanted(solv, q, POLICY_MODE_CHOOSE);
|
|
||||||
+ queue_unshift(q, 1); /* filter mark */
|
|
||||||
+ queue_unshift(q, pt);
|
|
||||||
+ }
|
|
||||||
+ for (i = 2; i < q->count; i++)
|
|
||||||
+ if (q->elements[i] == pt)
|
|
||||||
+ return 1;
|
|
||||||
+ return 0; /* not newest */
|
|
||||||
+}
|
|
||||||
+
|
|
||||||
+static inline void
|
|
||||||
+queue_removeelement(Queue *q, Id el)
|
|
||||||
+{
|
|
||||||
+ int i, j;
|
|
||||||
+ for (i = 0; i < q->count; i++)
|
|
||||||
+ if (q->elements[i] == el)
|
|
||||||
+ break;
|
|
||||||
+ if (i < q->count)
|
|
||||||
+ {
|
|
||||||
+ for (j = i++; i < q->count; i++)
|
|
||||||
+ if (q->elements[i] != el)
|
|
||||||
+ q->elements[j++] = q->elements[i];
|
|
||||||
+ queue_truncate(q, j);
|
|
||||||
+ }
|
|
||||||
+}
|
|
||||||
+
|
|
||||||
static Id
|
|
||||||
choicerule_find_installed(Pool *pool, Id p)
|
|
||||||
{
|
|
||||||
@@ -3357,14 +3439,14 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
Pool *pool = solv->pool;
|
|
||||||
Map m, mneg;
|
|
||||||
Rule *r;
|
|
||||||
- Queue q, qi, qcheck, infoq;
|
|
||||||
+ Queue q, qi, qcheck, qcheck2, infoq;
|
|
||||||
int i, j, rid, havechoice, negcnt;
|
|
||||||
Id p, d, pp, p2;
|
|
||||||
Solvable *s;
|
|
||||||
Id lastaddedp, lastaddedd;
|
|
||||||
int lastaddedcnt;
|
|
||||||
unsigned int now;
|
|
||||||
- int isinstalled;
|
|
||||||
+ int isnewest = 0;
|
|
||||||
|
|
||||||
solv->choicerules = solv->nrules;
|
|
||||||
if (!pool->installed)
|
|
||||||
@@ -3376,6 +3458,7 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
queue_init(&q);
|
|
||||||
queue_init(&qi);
|
|
||||||
queue_init(&qcheck);
|
|
||||||
+ queue_init(&qcheck2);
|
|
||||||
queue_init(&infoq);
|
|
||||||
map_init(&m, pool->nsolvables);
|
|
||||||
map_init(&mneg, pool->nsolvables);
|
|
||||||
@@ -3395,28 +3478,20 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
if (r->p >= 0 || ((r->d == 0 || r->d == -1) && r->w2 <= 0))
|
|
||||||
continue; /* only look at requires rules */
|
|
||||||
/* solver_printrule(solv, SOLV_DEBUG_RESULT, r); */
|
|
||||||
+ queue_empty(&q);
|
|
||||||
queue_empty(&qi);
|
|
||||||
havechoice = 0;
|
|
||||||
- isinstalled = 0;
|
|
||||||
FOR_RULELITERALS(p, pp, r)
|
|
||||||
{
|
|
||||||
if (p < 0)
|
|
||||||
- {
|
|
||||||
- Solvable *s = pool->solvables - p;
|
|
||||||
- p2 = s->repo == pool->installed ? -p : 0;
|
|
||||||
- if (p2)
|
|
||||||
- {
|
|
||||||
- if (!(solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, p2 - solv->installed->start))))
|
|
||||||
- isinstalled = 1;
|
|
||||||
- }
|
|
||||||
- continue;
|
|
||||||
- }
|
|
||||||
+ continue;
|
|
||||||
s = pool->solvables + p;
|
|
||||||
if (!s->repo)
|
|
||||||
continue;
|
|
||||||
if (s->repo == pool->installed)
|
|
||||||
{
|
|
||||||
queue_push2(&qi, p, p);
|
|
||||||
+ queue_push(&q, p);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
/* find an installed package p2 that we can update/downgrade to p */
|
|
||||||
@@ -3428,6 +3503,7 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
if (policy_is_illegal(solv, pool->solvables + p2, s, 0))
|
|
||||||
continue;
|
|
||||||
queue_push2(&qi, p2, p);
|
|
||||||
+ queue_push(&q, p);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
/* package p is independent of the installed ones */
|
|
||||||
@@ -3436,31 +3512,47 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
#if 0
|
|
||||||
printf("havechoice: %d qcount %d qicount %d\n", havechoice, q.count, qi.count);
|
|
||||||
#endif
|
|
||||||
- if (!havechoice || !qi.count)
|
|
||||||
+ if (!havechoice || !q.count || !qi.count)
|
|
||||||
continue; /* no choice */
|
|
||||||
|
|
||||||
FOR_RULELITERALS(p, pp, r)
|
|
||||||
if (p > 0)
|
|
||||||
MAPSET(&m, p);
|
|
||||||
|
|
||||||
- if (!isinstalled)
|
|
||||||
+ isnewest = 1;
|
|
||||||
+ FOR_RULELITERALS(p, pp, r)
|
|
||||||
{
|
|
||||||
- /* do extra checking for packages related to installed packages */
|
|
||||||
- for (i = j = 0; i < qi.count; i += 2)
|
|
||||||
+ if (p > 0)
|
|
||||||
+ break;
|
|
||||||
+ p2 = choicerule_find_installed(pool, -p);
|
|
||||||
+ if (p2 && !solver_choicerulecheck2(solv, p2, -p, &qcheck2))
|
|
||||||
{
|
|
||||||
- p2 = qi.elements[i];
|
|
||||||
- if (solv->updatemap_all || (solv->updatemap.size && MAPTST(&solv->updatemap, p2 - solv->installed->start)))
|
|
||||||
- {
|
|
||||||
- if (solver_choicerulecheck(solv, p2, r, &m, &qcheck))
|
|
||||||
- continue;
|
|
||||||
- }
|
|
||||||
- qi.elements[j++] = p2;
|
|
||||||
- qi.elements[j++] = qi.elements[i + 1];
|
|
||||||
+ isnewest = 0;
|
|
||||||
+ break;
|
|
||||||
+ }
|
|
||||||
+ if (!p2 && !solver_choicerulecheck3(solv, -p, &qcheck2))
|
|
||||||
+ {
|
|
||||||
+ isnewest = 0;
|
|
||||||
+ break;
|
|
||||||
}
|
|
||||||
- queue_truncate(&qi, j);
|
|
||||||
}
|
|
||||||
+ /* do extra checking */
|
|
||||||
+ for (i = j = 0; i < qi.count; i += 2)
|
|
||||||
+ {
|
|
||||||
+ p2 = qi.elements[i];
|
|
||||||
+ if (!p2)
|
|
||||||
+ continue;
|
|
||||||
+ if (isnewest && solver_choicerulecheck(solv, p2, r, &m, &qcheck))
|
|
||||||
+ {
|
|
||||||
+ /* oops, remove element p from q */
|
|
||||||
+ queue_removeelement(&q, qi.elements[i + 1]);
|
|
||||||
+ continue;
|
|
||||||
+ }
|
|
||||||
+ qi.elements[j++] = p2;
|
|
||||||
+ }
|
|
||||||
+ queue_truncate(&qi, j);
|
|
||||||
|
|
||||||
- if (!qi.count)
|
|
||||||
+ if (!q.count || !qi.count)
|
|
||||||
{
|
|
||||||
FOR_RULELITERALS(p, pp, r)
|
|
||||||
if (p > 0)
|
|
||||||
@@ -3468,15 +3560,6 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
- queue_empty(&q);
|
|
||||||
- /* split q from qi */
|
|
||||||
- for (i = j = 0; i < qi.count; i += 2)
|
|
||||||
- {
|
|
||||||
- queue_push(&q, qi.elements[i + 1]);
|
|
||||||
- qi.elements[j++] = qi.elements[i];
|
|
||||||
- }
|
|
||||||
- queue_truncate(&qi, j);
|
|
||||||
-
|
|
||||||
|
|
||||||
/* now check the update rules of the installed package.
|
|
||||||
* if all packages of the update rules are contained in
|
|
||||||
@@ -3496,7 +3579,6 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
break;
|
|
||||||
if (p)
|
|
||||||
break;
|
|
||||||
- /* speed improvement: only check each package once */
|
|
||||||
for (j = i + 1; j < qi.count; j++)
|
|
||||||
if (qi.elements[i] == qi.elements[j])
|
|
||||||
qi.elements[j] = 0;
|
|
||||||
@@ -3554,6 +3636,7 @@ solver_addchoicerules(Solver *solv)
|
|
||||||
queue_free(&q);
|
|
||||||
queue_free(&qi);
|
|
||||||
queue_free(&qcheck);
|
|
||||||
+ queue_free(&qcheck2);
|
|
||||||
queue_free(&infoq);
|
|
||||||
map_free(&m);
|
|
||||||
map_free(&mneg);
|
|
||||||
diff --git a/src/solver.c b/src/solver.c
|
|
||||||
index 28341d6d..23285ff2 100644
|
|
||||||
--- a/src/solver.c
|
|
||||||
+++ b/src/solver.c
|
|
||||||
@@ -2620,43 +2620,6 @@ resolve_orphaned(Solver *solv, int level, int disablerules, Queue *dq, int *reru
|
|
||||||
return level;
|
|
||||||
}
|
|
||||||
|
|
||||||
-int
|
|
||||||
-solver_check_unneeded_choicerules(Solver *solv)
|
|
||||||
-{
|
|
||||||
- Pool *pool = solv->pool;
|
|
||||||
- Rule *r, *or;
|
|
||||||
- Id p, pp, p2, pp2;
|
|
||||||
- int i;
|
|
||||||
- int havedisabled = 0;
|
|
||||||
-
|
|
||||||
- /* check if some choice rules could have been broken */
|
|
||||||
- for (i = solv->choicerules, r = solv->rules + i; i < solv->choicerules_end; i++, r++)
|
|
||||||
- {
|
|
||||||
- if (r->d < 0)
|
|
||||||
- continue;
|
|
||||||
- or = solv->rules + solv->choicerules_info[i - solv->choicerules];
|
|
||||||
- if (or->d < 0)
|
|
||||||
- continue;
|
|
||||||
- FOR_RULELITERALS(p, pp, or)
|
|
||||||
- {
|
|
||||||
- if (p < 0 || solv->decisionmap[p] <= 0)
|
|
||||||
- continue;
|
|
||||||
- FOR_RULELITERALS(p2, pp2, r)
|
|
||||||
- if (p2 == p)
|
|
||||||
- break;
|
|
||||||
- if (!p2)
|
|
||||||
- {
|
|
||||||
- /* did not find p in choice rule, disable it */
|
|
||||||
- POOL_DEBUG(SOLV_DEBUG_SOLVER, "disabling unneeded choice rule #%d\n", i);
|
|
||||||
- solver_disablechoicerules(solv, r);
|
|
||||||
- havedisabled = 1;
|
|
||||||
- break;
|
|
||||||
- }
|
|
||||||
- }
|
|
||||||
- }
|
|
||||||
- return havedisabled;
|
|
||||||
-}
|
|
||||||
-
|
|
||||||
/*-------------------------------------------------------------------
|
|
||||||
*
|
|
||||||
* solver_run_sat
|
|
||||||
@@ -2842,14 +2805,6 @@ solver_run_sat(Solver *solv, int disablerules, int doweak)
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
- if (solv->choicerules != solv->choicerules_end && solver_check_unneeded_choicerules(solv))
|
|
||||||
- {
|
|
||||||
- POOL_DEBUG(SOLV_DEBUG_SOLVER, "did choice rule minimization, rerunning solver\n");
|
|
||||||
- solver_reset(solv);
|
|
||||||
- level = 0; /* restart from scratch */
|
|
||||||
- continue;
|
|
||||||
- }
|
|
||||||
-
|
|
||||||
if (solv->solution_callback)
|
|
||||||
{
|
|
||||||
solv->solution_callback(solv, solv->solution_callback_data);
|
|
||||||
--
|
|
||||||
2.38.1
|
|
||||||
|
|
@ -0,0 +1,68 @@
|
|||||||
|
From 07a1a0fd83f108a0e9b1f801b52ff2bd26722097 Mon Sep 17 00:00:00 2001
|
||||||
|
From: =?UTF-8?q?Ale=C5=A1=20Mat=C4=9Bj?= <amatej@redhat.com>
|
||||||
|
Date: Thu, 27 Jan 2022 08:38:27 +0100
|
||||||
|
Subject: [PATCH] Allow accessing toolversion at runtime and increase it
|
||||||
|
|
||||||
|
---
|
||||||
|
src/libsolv.ver | 1 +
|
||||||
|
src/solvversion.c | 1 +
|
||||||
|
src/solvversion.h.in | 3 ++-
|
||||||
|
tools/common_write.c | 1 +
|
||||||
|
4 files changed, 5 insertions(+), 1 deletion(-)
|
||||||
|
|
||||||
|
diff --git a/src/libsolv.ver b/src/libsolv.ver
|
||||||
|
index 4c6fbf4f..89517f50 100644
|
||||||
|
--- a/src/libsolv.ver
|
||||||
|
+++ b/src/libsolv.ver
|
||||||
|
@@ -306,6 +306,7 @@ SOLV_1.0 {
|
||||||
|
solv_version_major;
|
||||||
|
solv_version_minor;
|
||||||
|
solv_version_patch;
|
||||||
|
+ solv_toolversion;
|
||||||
|
solvable_add_deparray;
|
||||||
|
solvable_add_idarray;
|
||||||
|
solvable_add_poolstr_array;
|
||||||
|
diff --git a/src/solvversion.c b/src/solvversion.c
|
||||||
|
index d66e1958..51d57a63 100644
|
||||||
|
--- a/src/solvversion.c
|
||||||
|
+++ b/src/solvversion.c
|
||||||
|
@@ -11,3 +11,4 @@ const char solv_version[] = LIBSOLV_VERSION_STRING;
|
||||||
|
int solv_version_major = LIBSOLV_VERSION_MAJOR;
|
||||||
|
int solv_version_minor = LIBSOLV_VERSION_MINOR;
|
||||||
|
int solv_version_patch = LIBSOLV_VERSION_PATCH;
|
||||||
|
+const char solv_toolversion[] = LIBSOLV_TOOLVERSION;
|
||||||
|
diff --git a/src/solvversion.h.in b/src/solvversion.h.in
|
||||||
|
index 43b566a1..da0ad743 100644
|
||||||
|
--- a/src/solvversion.h.in
|
||||||
|
+++ b/src/solvversion.h.in
|
||||||
|
@@ -23,6 +23,7 @@ extern const char solv_version[];
|
||||||
|
extern int solv_version_major;
|
||||||
|
extern int solv_version_minor;
|
||||||
|
extern int solv_version_patch;
|
||||||
|
+extern const char solv_toolversion[];
|
||||||
|
|
||||||
|
#cmakedefine LIBSOLV_FEATURE_LINKED_PKGS
|
||||||
|
#cmakedefine LIBSOLV_FEATURE_COMPLEX_DEPS
|
||||||
|
@@ -48,6 +49,6 @@ extern int solv_version_patch;
|
||||||
|
#cmakedefine LIBSOLVEXT_FEATURE_ZCHUNK_COMPRESSION
|
||||||
|
|
||||||
|
/* see tools/common_write.c for toolversion history */
|
||||||
|
-#define LIBSOLV_TOOLVERSION "1.1"
|
||||||
|
+#define LIBSOLV_TOOLVERSION "1.2"
|
||||||
|
|
||||||
|
#endif
|
||||||
|
diff --git a/tools/common_write.c b/tools/common_write.c
|
||||||
|
index 36f8dd89..8fda3e33 100644
|
||||||
|
--- a/tools/common_write.c
|
||||||
|
+++ b/tools/common_write.c
|
||||||
|
@@ -19,6 +19,7 @@
|
||||||
|
/* toolversion history
|
||||||
|
* 1.0: initial tool version
|
||||||
|
* 1.1: changed PRODUCT_ENDOFLIFE parsing
|
||||||
|
+ * 1.2: added UPDATE_COLLECTIONLIST to updateinfo
|
||||||
|
*/
|
||||||
|
|
||||||
|
static int
|
||||||
|
--
|
||||||
|
2.31.1
|
||||||
|
|
@ -1,23 +0,0 @@
|
|||||||
From 6087b30a65d1a742ff0ff75f00aedd39ded33bf6 Mon Sep 17 00:00:00 2001
|
|
||||||
From: Nicola Sella <nsella@redhat.com>
|
|
||||||
Date: Wed, 7 Dec 2022 16:53:58 +0100
|
|
||||||
Subject: [PATCH 2/3] Revert "Add complex_deps requirement to choice1b
|
|
||||||
testcase"
|
|
||||||
|
|
||||||
This reverts commit 9cb62e9db34cb62031cc5b0a444b4bff16d39db9.
|
|
||||||
---
|
|
||||||
test/testcases/choicerules/choice1b.t | 1 -
|
|
||||||
1 file changed, 1 deletion(-)
|
|
||||||
|
|
||||||
diff --git a/test/testcases/choicerules/choice1b.t b/test/testcases/choicerules/choice1b.t
|
|
||||||
index cf6051ce..fc47b722 100644
|
|
||||||
--- a/test/testcases/choicerules/choice1b.t
|
|
||||||
+++ b/test/testcases/choicerules/choice1b.t
|
|
||||||
@@ -1,4 +1,3 @@
|
|
||||||
-feature complex_deps
|
|
||||||
repo system 0 testtags <inline>
|
|
||||||
#>=Pkg: B 1 1 noarch
|
|
||||||
#>=Prv: P = 1
|
|
||||||
--
|
|
||||||
2.38.1
|
|
||||||
|
|
@ -1,314 +0,0 @@
|
|||||||
From 5fef9bb8c9899e64306a87ab89574f3afb9968de Mon Sep 17 00:00:00 2001
|
|
||||||
From: Nicola Sella <nsella@redhat.com>
|
|
||||||
Date: Wed, 7 Dec 2022 16:54:02 +0100
|
|
||||||
Subject: [PATCH 3/3] Revert "Add more choicerules tests"
|
|
||||||
|
|
||||||
This reverts commit ce9dda7d3e5b27f4cd883eb69e7ea5cace0a2828.
|
|
||||||
---
|
|
||||||
test/testcases/choicerules/choice1.t | 27 ---------------
|
|
||||||
test/testcases/choicerules/choice1b.t | 18 ----------
|
|
||||||
test/testcases/choicerules/choice2.t | 21 ------------
|
|
||||||
test/testcases/choicerules/choice2b.t | 47 ---------------------------
|
|
||||||
test/testcases/choicerules/choice3.t | 16 ---------
|
|
||||||
test/testcases/choicerules/choice3b.t | 31 ------------------
|
|
||||||
test/testcases/choicerules/choice4.t | 18 ----------
|
|
||||||
test/testcases/choicerules/choice5.t | 21 ------------
|
|
||||||
test/testcases/choicerules/choice6.t | 28 ----------------
|
|
||||||
9 files changed, 227 deletions(-)
|
|
||||||
delete mode 100644 test/testcases/choicerules/choice1.t
|
|
||||||
delete mode 100644 test/testcases/choicerules/choice1b.t
|
|
||||||
delete mode 100644 test/testcases/choicerules/choice2b.t
|
|
||||||
delete mode 100644 test/testcases/choicerules/choice3b.t
|
|
||||||
delete mode 100644 test/testcases/choicerules/choice5.t
|
|
||||||
delete mode 100644 test/testcases/choicerules/choice6.t
|
|
||||||
|
|
||||||
diff --git a/test/testcases/choicerules/choice1.t b/test/testcases/choicerules/choice1.t
|
|
||||||
deleted file mode 100644
|
|
||||||
index fbd5184a..00000000
|
|
||||||
--- a/test/testcases/choicerules/choice1.t
|
|
||||||
+++ /dev/null
|
|
||||||
@@ -1,27 +0,0 @@
|
|
||||||
-#
|
|
||||||
-#Rule #2:
|
|
||||||
-# !A-2-1.noarch [3] (w1)
|
|
||||||
-# B-2-1.noarch [4] (w2)
|
|
||||||
-# C-2-1.noarch [5]
|
|
||||||
-#
|
|
||||||
-# ==> Choice Rule
|
|
||||||
-# !A-2-1.noarch [3] (w1)
|
|
||||||
-# B-2-1.noarch [4] (w2)
|
|
||||||
-#
|
|
||||||
-repo system 0 testtags <inline>
|
|
||||||
-#>=Pkg: B 1 1 noarch
|
|
||||||
-#>=Prv: P = 1
|
|
||||||
-repo available 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 2 1 noarch
|
|
||||||
-#>=Req: P = 2
|
|
||||||
-#>=Pkg: B 2 1 noarch
|
|
||||||
-#>=Prv: P = 2
|
|
||||||
-#>=Pkg: C 2 1 noarch
|
|
||||||
-#>=Prv: P = 2
|
|
||||||
-system i686 rpm system
|
|
||||||
-
|
|
||||||
-job install name A
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-#>install A-2-1.noarch@available
|
|
||||||
-#>upgrade B-1-1.noarch@system B-2-1.noarch@available
|
|
||||||
diff --git a/test/testcases/choicerules/choice1b.t b/test/testcases/choicerules/choice1b.t
|
|
||||||
deleted file mode 100644
|
|
||||||
index fc47b722..00000000
|
|
||||||
--- a/test/testcases/choicerules/choice1b.t
|
|
||||||
+++ /dev/null
|
|
||||||
@@ -1,18 +0,0 @@
|
|
||||||
-repo system 0 testtags <inline>
|
|
||||||
-#>=Pkg: B 1 1 noarch
|
|
||||||
-#>=Prv: P = 1
|
|
||||||
-repo available 0 testtags <inline>
|
|
||||||
-#>=Pkg: X 1 1 noarch
|
|
||||||
-#>=Pkg: Y 1 1 noarch
|
|
||||||
-#>=Pkg: A 2 1 noarch
|
|
||||||
-#>=Req: P = 2 <IF> (X & Y)
|
|
||||||
-#>=Pkg: B 2 1 noarch
|
|
||||||
-#>=Prv: P = 2
|
|
||||||
-#>=Pkg: C 2 1 noarch
|
|
||||||
-#>=Prv: P = 2
|
|
||||||
-system i686 rpm system
|
|
||||||
-
|
|
||||||
-job install name A
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-#>install A-2-1.noarch@available
|
|
||||||
diff --git a/test/testcases/choicerules/choice2.t b/test/testcases/choicerules/choice2.t
|
|
||||||
index 1eb6c7c3..cb067b18 100644
|
|
||||||
--- a/test/testcases/choicerules/choice2.t
|
|
||||||
+++ b/test/testcases/choicerules/choice2.t
|
|
||||||
@@ -1,24 +1,3 @@
|
|
||||||
-#
|
|
||||||
-# Test that updating package B will update package A
|
|
||||||
-# instead of pulling in new package C
|
|
||||||
-#
|
|
||||||
-#Rule #5:
|
|
||||||
-# !A-2-2.noarch [5] (w1)
|
|
||||||
-# B-2-1.noarch [6] (w2)
|
|
||||||
-# C-2-1.noarch [8]
|
|
||||||
-#Rule #7:
|
|
||||||
-# !A-2-1.noarch [4] (w1)
|
|
||||||
-# B-2-1.noarch [6] (w2)
|
|
||||||
-# C-2-1.noarch [8]
|
|
||||||
-#Rule #8:
|
|
||||||
-# !A-1-1.noarch [2]I (w1)
|
|
||||||
-# B-1-1.noarch [3]I (w2)
|
|
||||||
-# C-1-1.noarch [7]
|
|
||||||
-#
|
|
||||||
-# ==> Choice Rule for #8:
|
|
||||||
-# !A-1-1.noarch [2]I (w1)
|
|
||||||
-# B-1-1.noarch [3]I (w2)
|
|
||||||
-#
|
|
||||||
repo system 0 testtags <inline>
|
|
||||||
#>=Pkg: A 1 1 noarch
|
|
||||||
#>=Req: P = 1
|
|
||||||
diff --git a/test/testcases/choicerules/choice2b.t b/test/testcases/choicerules/choice2b.t
|
|
||||||
deleted file mode 100644
|
|
||||||
index ae619f77..00000000
|
|
||||||
--- a/test/testcases/choicerules/choice2b.t
|
|
||||||
+++ /dev/null
|
|
||||||
@@ -1,47 +0,0 @@
|
|
||||||
-#
|
|
||||||
-# Test that updating package B will update package A
|
|
||||||
-# instead of pulling in new package C
|
|
||||||
-#
|
|
||||||
-#Rule #5:
|
|
||||||
-# !A-2-2.noarch [5] (w1)
|
|
||||||
-# B-2-1.noarch [6] (w2)
|
|
||||||
-# C-2-1.noarch [8]
|
|
||||||
-#Rule #7:
|
|
||||||
-# !A-2-1.noarch [4] (w1)
|
|
||||||
-# B-2-1.noarch [6] (w2)
|
|
||||||
-# C-2-1.noarch [8]
|
|
||||||
-#Rule #8:
|
|
||||||
-# !A-1-1.noarch [2]I (w1)
|
|
||||||
-# B-1-1.noarch [3]I (w2)
|
|
||||||
-# C-1-1.noarch [7]
|
|
||||||
-#
|
|
||||||
-# ==> Choice Rule for #8:
|
|
||||||
-# !A-1-1.noarch [2]I (w1)
|
|
||||||
-# B-1-1.noarch [3]I (w2)
|
|
||||||
-#
|
|
||||||
-repo system 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 1 1 noarch
|
|
||||||
-#>=Req: P = 1
|
|
||||||
-#>=Pkg: B 1 1 noarch
|
|
||||||
-#>=Prv: P = 1
|
|
||||||
-repo available 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 1 1 noarch
|
|
||||||
-#>=Req: P = 1
|
|
||||||
-#>=Pkg: B 1 1 noarch
|
|
||||||
-#>=Prv: P = 1
|
|
||||||
-#>=Pkg: A 2 1 noarch
|
|
||||||
-#>=Req: P = 2
|
|
||||||
-#>=Pkg: A 2 2 noarch
|
|
||||||
-#>=Req: P = 2
|
|
||||||
-#>=Pkg: B 2 1 noarch
|
|
||||||
-#>=Prv: P = 2
|
|
||||||
-#>=Pkg: C 1 1 noarch
|
|
||||||
-#>=Prv: P = 1
|
|
||||||
-#>=Pkg: C 2 1 noarch
|
|
||||||
-#>=Prv: P = 2
|
|
||||||
-system i686 rpm system
|
|
||||||
-
|
|
||||||
-job update name B
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-#>upgrade A-1-1.noarch@system A-2-2.noarch@available
|
|
||||||
-#>upgrade B-1-1.noarch@system B-2-1.noarch@available
|
|
||||||
diff --git a/test/testcases/choicerules/choice3.t b/test/testcases/choicerules/choice3.t
|
|
||||||
index 1b82e691..d5d41acc 100644
|
|
||||||
--- a/test/testcases/choicerules/choice3.t
|
|
||||||
+++ b/test/testcases/choicerules/choice3.t
|
|
||||||
@@ -1,19 +1,3 @@
|
|
||||||
-# Do not block an update because of a choice rule
|
|
||||||
-#
|
|
||||||
-#Rule #3:
|
|
||||||
-# !B-1-1.noarch [4] (w1)
|
|
||||||
-# A-1-1.noarch [2]I (w2)
|
|
||||||
-# Anew-2-1.noarch [6]
|
|
||||||
-#Rule #4:
|
|
||||||
-# !B-1-1.noarch [3]I (w1)
|
|
||||||
-# A-1-1.noarch [2]I (w2)
|
|
||||||
-# Anew-2-1.noarch [6]
|
|
||||||
-#
|
|
||||||
-# ==> No choice rule for Rule#4!
|
|
||||||
-# ==> Choice Rule for #3:
|
|
||||||
-# !B-1-1.noarch [4] (w1)
|
|
||||||
-# A-1-1.noarch [2]I (w2)
|
|
||||||
-#
|
|
||||||
repo system 0 testtags <inline>
|
|
||||||
#>=Pkg: A 1 1 noarch
|
|
||||||
#>=Prv: libA
|
|
||||||
diff --git a/test/testcases/choicerules/choice3b.t b/test/testcases/choicerules/choice3b.t
|
|
||||||
deleted file mode 100644
|
|
||||||
index fb9c7250..00000000
|
|
||||||
--- a/test/testcases/choicerules/choice3b.t
|
|
||||||
+++ /dev/null
|
|
||||||
@@ -1,31 +0,0 @@
|
|
||||||
-# Do not block an update because of a choice rule
|
|
||||||
-#
|
|
||||||
-#Rule #3:
|
|
||||||
-# !B-1-1.noarch [4] (w1)
|
|
||||||
-# A-1-1.noarch [2]I (w2)
|
|
||||||
-# Anew-2-1.noarch [6]
|
|
||||||
-#Rule #4:
|
|
||||||
-# !B-1-1.noarch [3]I (w1)
|
|
||||||
-# A-1-1.noarch [2]I (w2)
|
|
||||||
-# Anew-2-1.noarch [6]
|
|
||||||
-#
|
|
||||||
-# ==> No choice rule for Rule#4!
|
|
||||||
-# ==> Choice Rule for #3:
|
|
||||||
-# !B-1-1.noarch [4] (w1)
|
|
||||||
-# A-1-1.noarch [2]I (w2)
|
|
||||||
-#
|
|
||||||
-repo system 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 1 1 noarch
|
|
||||||
-#>=Prv: libA
|
|
||||||
-#>=Pkg: B 1 1 noarch
|
|
||||||
-#>=Req: libA
|
|
||||||
-repo available 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 2 1 noarch
|
|
||||||
-#>=Pkg: Anew 2 1 noarch
|
|
||||||
-#>=Prv: libA
|
|
||||||
-system i686 rpm system
|
|
||||||
-
|
|
||||||
-job update all packages
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-#>install Anew-2-1.noarch@available
|
|
||||||
-#>upgrade A-1-1.noarch@system A-2-1.noarch@available
|
|
||||||
diff --git a/test/testcases/choicerules/choice4.t b/test/testcases/choicerules/choice4.t
|
|
||||||
index 7378a569..1bf9f487 100644
|
|
||||||
--- a/test/testcases/choicerules/choice4.t
|
|
||||||
+++ b/test/testcases/choicerules/choice4.t
|
|
||||||
@@ -1,21 +1,3 @@
|
|
||||||
-# This tests that A is updated instead of Anew being installed
|
|
||||||
-#
|
|
||||||
-#Rule #4:
|
|
||||||
-# !B-2-2.noarch [11] (w1)
|
|
||||||
-# A-2-2.noarch [9] (w2)
|
|
||||||
-# Anew-2-2.noarch [10]
|
|
||||||
-#Rule #11:
|
|
||||||
-# !B-2-1.noarch [8] (w1)
|
|
||||||
-# A-2-1.noarch [6] (w2)
|
|
||||||
-# Anew-2-1.noarch [7]
|
|
||||||
-#
|
|
||||||
-#Choice Rule for #4:
|
|
||||||
-# !B-2-2.noarch [11] (w1)
|
|
||||||
-# A-2-2.noarch [9] (w2)
|
|
||||||
-#Choice Rule for #11
|
|
||||||
-# !B-2-1.noarch [8] (w1)
|
|
||||||
-# A-2-1.noarch [6] (w2)
|
|
||||||
-#
|
|
||||||
repo system 0 testtags <inline>
|
|
||||||
#>=Pkg: A 1 1 noarch
|
|
||||||
#>=Prv: libA = 1-1
|
|
||||||
diff --git a/test/testcases/choicerules/choice5.t b/test/testcases/choicerules/choice5.t
|
|
||||||
deleted file mode 100644
|
|
||||||
index 9f43c8a3..00000000
|
|
||||||
--- a/test/testcases/choicerules/choice5.t
|
|
||||||
+++ /dev/null
|
|
||||||
@@ -1,21 +0,0 @@
|
|
||||||
-#
|
|
||||||
-# test that a package split does not update unrelated packages
|
|
||||||
-#
|
|
||||||
-repo system 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 1 1 noarch
|
|
||||||
-#>=Prv: libA
|
|
||||||
-#>=Pkg: B 1 1 noarch
|
|
||||||
-#>=Req: libA
|
|
||||||
-repo available 0 testtags <inline>
|
|
||||||
-#>=Pkg: A 1 1 noarch
|
|
||||||
-#>=Prv: libA
|
|
||||||
-#>=Pkg: A 2 1 noarch
|
|
||||||
-#>=Pkg: Asplit 2 1 noarch
|
|
||||||
-#>=Prv: libA
|
|
||||||
-#>=Pkg: B 2 1 noarch
|
|
||||||
-#>=Req: libA
|
|
||||||
-system i686 rpm system
|
|
||||||
-job update name A
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-#>install Asplit-2-1.noarch@available
|
|
||||||
-#>upgrade A-1-1.noarch@system A-2-1.noarch@available
|
|
||||||
diff --git a/test/testcases/choicerules/choice6.t b/test/testcases/choicerules/choice6.t
|
|
||||||
deleted file mode 100644
|
|
||||||
index e860ae20..00000000
|
|
||||||
--- a/test/testcases/choicerules/choice6.t
|
|
||||||
+++ /dev/null
|
|
||||||
@@ -1,28 +0,0 @@
|
|
||||||
-#Rule #4:
|
|
||||||
-# !php-fpm-7.2.24-1.noarch [5] (w1)
|
|
||||||
-# glibc-2.17-325.noarch [2]I (w2)
|
|
||||||
-# libcrypt-4.1.1-6.noarch [7]
|
|
||||||
-#=> no choice rule for #4
|
|
||||||
-#
|
|
||||||
-repo @System 0 testtags <inline>
|
|
||||||
-#>=Pkg: glibc 2.17 325 noarch
|
|
||||||
-#>=Prv: libcrypt
|
|
||||||
-#>=Pkg: php 5.4.16 48 noarch
|
|
||||||
-repo available 0 testtags <inline>
|
|
||||||
-#>=Pkg: php 7.2.24 1 noarch
|
|
||||||
-#>=Rec: php-fpm = 7.2.24-1
|
|
||||||
-#>=Pkg: php-fpm 7.2.24 1 noarch
|
|
||||||
-#>=Req: libcrypt
|
|
||||||
-#>=Pkg: php-fpm 8.0.13 2 noarch
|
|
||||||
-#>=Req: libcrypt
|
|
||||||
-#>=Pkg: libcrypt 4.1.1 6 noarch
|
|
||||||
-#>=Req: libc
|
|
||||||
-#>=Pkg: glibc 2.28 181 noarch
|
|
||||||
-#>=Prv: libc
|
|
||||||
-system i686 rpm @System
|
|
||||||
-job update all packages
|
|
||||||
-result transaction,problems <inline>
|
|
||||||
-#>install libcrypt-4.1.1-6.noarch@available
|
|
||||||
-#>install php-fpm-7.2.24-1.noarch@available
|
|
||||||
-#>upgrade glibc-2.17-325.noarch@@System glibc-2.28-181.noarch@available
|
|
||||||
-#>upgrade php-5.4.16-48.noarch@@System php-7.2.24-1.noarch@available
|
|
||||||
--
|
|
||||||
2.38.1
|
|
||||||
|
|
Loading…
Reference in new issue