int i;
pool_freewhatprovides(pool);
+ if (repo == pool->installed)
+ pool->installed = 0;
if (reuseids && repo->end == pool->nsolvables)
{
{
int d = repo->start - p;
b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
- memmove(b + d * size, b, n * size);
+ memmove((char*)b + d * size, b, n * size);
memset(b, 0, d * size);
n += d;
}
{
int d = p + count - repo->end;
b = sat_extend(b, n, d, size, REPO_SIDEDATA_BLOCK);
- memset(b + n * size, 0, d * size);
+ memset((char*)b + n * size, 0, d * size);
}
return b;
}
{
struct matchdata *md = cbdata;
- if (md->matcher.match && !datamatcher_match(&md->matcher, data, key, kv))
- return 0;
+ if (md->matcher.match)
+ {
+ if (!repodata_stringify(md->pool, data, key, kv, md->flags))
+ return 0;
+ if (!datamatcher_match(&md->matcher, kv->str))
+ return 0;
+ }
md->stop = md->callback(md->callback_data, s, data, key, kv);
return md->stop;
}
}
if (data->state == REPODATA_ERROR)
continue;
- repodata_search(data, p, keyname, repo_matchvalue, md);
+ repodata_search(data, p, keyname, md->flags, repo_matchvalue, md);
if (md->stop > SEARCH_NEXT_KEY)
break;
}
md.callback = callback;
md.callback_data = cbdata;
if (match)
- datamatcher_init(&md.matcher, md.pool, match, flags);
+ datamatcher_init(&md.matcher, match, flags);
repo_search_md(repo, p, keyname, &md);
if (match)
datamatcher_free(&md.matcher);
}
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- if (entry && (entry < data->start || entry >= data->end))
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
continue;
if (!repodata_precheck_keyname(data, keyname))
continue;
if (keyname == RPM_RPMDBID)
{
- if (repo->rpmdbid && entry && entry >= repo->start && entry < repo->end)
+ if (repo->rpmdbid && entry >= repo->start && entry < repo->end)
return repo->rpmdbid[entry - repo->start];
return notfound;
}
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- if (entry && (entry < data->start || entry >= data->end))
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
continue;
if (!repodata_precheck_keyname(data, keyname))
continue;
}
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- if (entry && (entry < data->start || entry >= data->end))
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
continue;
if (!repodata_precheck_keyname(data, keyname))
continue;
int i, j;
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- if (entry && (entry < data->start || entry >= data->end))
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
continue;
if (!repodata_precheck_keyname(data, keyname))
continue;
int i, j;
for (i = 0, data = repo->repodata; i < repo->nrepodata; i++, data++)
{
- if (entry && (entry < data->start || entry >= data->end))
+ if (entry != SOLVID_META && (entry < data->start || entry >= data->end))
continue;
if (!repodata_precheck_keyname(data, keyname))
continue;