const char *
pool_solvable2str(Pool *pool, Solvable *s)
{
const char *n, *e, *a;
int nl, el, al;
char *p;
n = pool_id2str(pool, s->name);
e = s->evr ? pool_id2str(pool, s->evr) : "";
/* XXX: may want to skip the epoch here */
a = s->arch ? pool_id2str(pool, s->arch) : "";
nl = strlen(n);
el = strlen(e);
al = strlen(a);
if (pool->havedistepoch)
{
/* strip the distepoch from the evr */
const char *de = strrchr(e, '-');
if (de && (de = strchr(de, ':')) != 0)
el = de - e;
}
p = pool_alloctmpspace(pool, nl + el + al + 3);
strcpy(p, n);
if (el)
{
p[nl++] = '-';
strncpy(p + nl, e, el);
p[nl + el] = 0;
}
if (al)
{
p[nl + el] = pool->disttype == DISTTYPE_HAIKU ? '-' : '.';
strcpy(p + nl + el + 1, a);
}
if (pool->disttype == DISTTYPE_CONDA && solvable_lookup_type(s, SOLVABLE_BUILDFLAVOR))
{
Queue flavorq;
int i;
queue_init(&flavorq);
solvable_lookup_idarray(s, SOLVABLE_BUILDFLAVOR, &flavorq);
for (i = 0; i < flavorq.count; i++)
p = pool_tmpappend(pool, p, "-", pool_id2str(pool, flavorq.elements[i]));
queue_free(&flavorq);
}
return p;
}
static const char *
solvable_lookup_str_joinarray(Solvable *s, Id keyname, const char *joinstr)
{
Queue q;
Id qbuf[10];
char *str = 0;
queue_init_buffer(&q, qbuf, sizeof(qbuf)/sizeof(*qbuf));
if (solvable_lookup_idarray(s, keyname, &q) && q.count)
{
Pool *pool = s->repo->pool;
int i;
str = pool_tmpjoin(pool, pool_id2str(pool, q.elements[0]), 0, 0);
for (i = 1; i < q.count; i++)
str = pool_tmpappend(pool, str, joinstr, pool_id2str(pool, q.elements[i]));
}
queue_free(&q);
return str;
}