From: Michael Schroeder Date: Wed, 15 Jul 2009 10:52:24 +0000 (+0200) Subject: - make solvable jump work out of subsearches X-Git-Tag: BASE-SuSE-Code-12_1-Branch~165^2~47 X-Git-Url: http://review.tizen.org/git/?a=commitdiff_plain;h=f3b9db9caa013d228acd0b8ae044c3f6ea15f3fb;p=platform%2Fupstream%2Flibsolv.git - make solvable jump work out of subsearches --- diff --git a/src/repodata.c b/src/repodata.c index 0879eaa..61dfe12 100644 --- a/src/repodata.c +++ b/src/repodata.c @@ -1542,12 +1542,18 @@ dataiterator_skip_attribute(Dataiterator *di) void dataiterator_skip_solvable(Dataiterator *di) { + di->nparents = 0; + di->rootlevel = 0; + di->keyname = di->keynames[0]; di->state = di_nextsolvable; } void dataiterator_skip_repo(Dataiterator *di) { + di->nparents = 0; + di->rootlevel = 0; + di->keyname = di->keynames[0]; di->state = di_nextrepo; } @@ -1556,6 +1562,7 @@ dataiterator_jump_to_solvid(Dataiterator *di, Id solvid) { di->nparents = 0; di->rootlevel = 0; + di->keyname = di->keynames[0]; if (solvid == SOLVID_POS) { di->repo = di->pool->pos.repo;