Lines Matching refs:elements
842 if (!MAPTST(m, qs.elements[i])) in solver_addrpmrulesforupdaters()
843 solver_addrpmrulesforsolvable(solv, pool->solvables + qs.elements[i], m); in solver_addrpmrulesforupdaters()
879 Solvable *ns = pool->solvables + qs->elements[i]; in finddistupgradepackages()
904 p = dupqs.elements[i]; in addduppackages()
946 if (MAPTST(&solv->multiversion, qs.elements[i])) in solver_addupdaterule()
949 Solvable *ps = pool->solvables + qs.elements[i]; in solver_addupdaterule()
953 qs.elements[j++] = qs.elements[i]; in solver_addupdaterule()
1108 if (allowedarchs.count == 1 && bests && allowedarchs.elements[0] == bests->arch) in solver_addinfarchrules()
1124 aa = allowedarchs.elements[j]; in solver_addinfarchrules()
1140 p = badq.elements[j]; in solver_addinfarchrules()
1299 how = job->elements[i]; in solver_createdupmaps()
1300 select = job->elements[i] & SOLVER_SELECTMASK; in solver_createdupmaps()
1301 what = job->elements[i + 1]; in solver_createdupmaps()
1542 if (q->elements[i] == q->elements[qstart]) in intersect_obsoletes()
1554 Id ip = q->elements[i]; in intersect_obsoletes()
1556 if (q->elements[k] == ip) in intersect_obsoletes()
1558 q->elements[j++] = ip; in intersect_obsoletes()
1570 MAPSET(m, q->elements[i] - installed->start); in intersect_obsoletes()
1572 if (MAPTST(m, q->elements[i] - installed->start)) in intersect_obsoletes()
1574 MAPCLR(m, q->elements[i] - installed->start); in intersect_obsoletes()
1575 q->elements[j++] = q->elements[i]; in intersect_obsoletes()
1641 if (q->elements[i + 1] == s->name) in jobtodisablelist()
1661 if (q->elements[i + 1] == s->name) in jobtodisablelist()
1709 queue_push(q, q->elements[j]); in jobtodisablelist()
1712 q->elements[j] = DISABLE_UPDATE; in jobtodisablelist()
1713 q->elements[j + 1] = q->elements[i++]; in jobtodisablelist()
1722 Solvable *is = pool->solvables + q->elements[i + 1]; in jobtodisablelist()
1749 q->elements[j + 1] = q->elements[i + 1]; in jobtodisablelist()
1789 j = solv->ruletojob.elements[i - solv->jobrules]; in solver_disablepolicyrules()
1793 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq); in solver_disablepolicyrules()
1805 Id type = allq.elements[i], arg = allq.elements[i + 1]; in solver_disablepolicyrules()
1837 jobtodisablelist(solv, job->elements[jobidx - 1], job->elements[jobidx], &q); in solver_reenablepolicyrules()
1851 if (q.elements[j] == DISABLE_UPDATE) in solver_reenablepolicyrules()
1853 Id p = q.elements[j + 1]; in solver_reenablepolicyrules()
1857 q.elements[k++] = q.elements[j]; in solver_reenablepolicyrules()
1858 q.elements[k++] = q.elements[j + 1]; in solver_reenablepolicyrules()
1875 j = solv->ruletojob.elements[i - solv->jobrules]; in solver_reenablepolicyrules()
1879 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq); in solver_reenablepolicyrules()
1885 Id type = q.elements[j], arg = q.elements[j + 1]; in solver_reenablepolicyrules()
1887 if (allq.elements[ai] == type && allq.elements[ai + 1] == arg) in solver_reenablepolicyrules()
1891 q.elements[k++] = q.elements[j]; in solver_reenablepolicyrules()
1892 q.elements[k++] = q.elements[j + 1]; in solver_reenablepolicyrules()
1908 Id type = q.elements[j], arg = q.elements[j + 1]; in solver_reenablepolicyrules()
1943 j = solv->ruletojob.elements[i - solv->jobrules]; in solver_reenablepolicyrules_cleandeps()
1947 jobtodisablelist(solv, job->elements[j], job->elements[j + 1], &allq); in solver_reenablepolicyrules_cleandeps()
1950 if (allq.elements[i] == DISABLE_UPDATE && allq.elements[i + 1] == pkg) in solver_reenablepolicyrules_cleandeps()
1972 r = solv->rules + solv->ruleinfoq->elements[0]; in addrpmruleinfo()
2097 solv_sort(rq->elements, rq->count / 4, 4 * sizeof(Id), solver_allruleinfos_cmp, 0); in solver_allruleinfos()
2103 if (rq->elements[i] == rq->elements[j - 4] && in solver_allruleinfos()
2104 rq->elements[i + 1] == rq->elements[j - 3] && in solver_allruleinfos()
2105 rq->elements[i + 2] == rq->elements[j - 2] && in solver_allruleinfos()
2106 rq->elements[i + 3] == rq->elements[j - 1]) in solver_allruleinfos()
2109 rq->elements[j++] = rq->elements[i]; in solver_allruleinfos()
2110 rq->elements[j++] = rq->elements[i + 1]; in solver_allruleinfos()
2111 rq->elements[j++] = rq->elements[i + 2]; in solver_allruleinfos()
2112 rq->elements[j++] = rq->elements[i + 3]; in solver_allruleinfos()
2152 qt = rq.elements[i]; in solver_ruleinfo()
2153 qp = rq.elements[i + 1]; in solver_ruleinfo()
2154 qo = rq.elements[i + 2]; in solver_ruleinfo()
2155 qd = rq.elements[i + 3]; in solver_ruleinfo()
2172 Id jidx = solv->ruletojob.elements[rid - solv->jobrules]; in solver_ruleinfo()
2176 *top = solv->job.elements[jidx]; in solver_ruleinfo()
2178 *depp = solv->job.elements[jidx + 1]; in solver_ruleinfo()
2181 …if ((solv->job.elements[jidx] & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLV… in solver_ruleinfo()
2183 …if ((solv->job.elements[jidx] & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_INSTALL|SOLVER_SOLV… in solver_ruleinfo()
2185 …if ((solv->job.elements[jidx] & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVAB… in solver_ruleinfo()
2187 …if ((solv->job.elements[jidx] & (SOLVER_JOBMASK|SOLVER_SELECTMASK)) == (SOLVER_ERASE|SOLVER_SOLVAB… in solver_ruleinfo()
2282 return solv->ruletojob.elements[rid - solv->jobrules] + 1; in solver_rule2jobidx()
2295 idx = solv->ruletojob.elements[rid - solv->jobrules]; in solver_rule2job()
2297 *whatp = solv->job.elements[idx + 1]; in solver_rule2job()
2298 return solv->job.elements[idx]; in solver_rule2job()
2323 if (MAPTST(m, q.elements[i])) in solver_choicerulecheck()
2336 if (q->elements[i] == el) in queue_removeelement()
2341 if (q->elements[i] != el) in queue_removeelement()
2342 q->elements[j++] = q->elements[i]; in queue_removeelement()
2486 p2 = qi.elements[i]; in solver_addchoicerules()
2492 queue_removeelement(&q, qi.elements[i + 1]); in solver_addchoicerules()
2495 qi.elements[j++] = p2; in solver_addchoicerules()
2513 if (!qi.elements[i]) in solver_addchoicerules()
2515 ur = solv->rules + solv->updaterules + (qi.elements[i] - pool->installed->start); in solver_addchoicerules()
2517 ur = solv->rules + solv->featurerules + (qi.elements[i] - pool->installed->start); in solver_addchoicerules()
2526 if (qi.elements[i] == qi.elements[j]) in solver_addchoicerules()
2527 qi.elements[j] = 0; in solver_addchoicerules()
2546 if (q.elements[i] != pool->whatprovidesdata[lastaddedd + i]) in solver_addchoicerules()
2617 p = q->elements[i]; in prune_to_update_targets()
2621 q->elements[j++] = p; in prune_to_update_targets()
2634 Id p = q->elements[i]; in prune_to_dup_packages()
2636 q->elements[j++] = p; in prune_to_dup_packages()
2667 …if ((solv->job.elements[i] & (SOLVER_JOBMASK | SOLVER_FORCEBEST)) == (SOLVER_INSTALL | SOLVER_FORC… in solver_addbestrules()
2672 if (solv->ruletojob.elements[j] == i) in solver_addbestrules()
2727 if (solv->update_targets && solv->update_targets->elements[p - installed->start]) in solver_addbestrules()
2728 …prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - … in solver_addbestrules()
2746 if (solv->update_targets && solv->update_targets->elements[p - installed->start]) in solver_addbestrules()
2747 …prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[p - … in solver_addbestrules()
2752 queue_pushunique(&q, q2.elements[j]); in solver_addbestrules()
2763 memcpy(solv->bestrules_pkg, r2pkg.elements, r2pkg.count * sizeof(Id)); in solver_addbestrules()
2848 if (depq->elements[i] == dep || depq->elements[i] == rd->name) in check_xsupp()
2863 if (q->elements[i] == id) in queue_contains()
2919 how = job->elements[i]; in solver_createcleandepsmap()
2922 what = job->elements[i + 1]; in solver_createcleandepsmap()
2933 what = job->elements[i + 1]; in solver_createcleandepsmap()
3033 i = solv->ruletojob.elements[rid - solv->jobrules]; in solver_createcleandepsmap()
3034 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS) in solver_createcleandepsmap()
3055 i = solv->ruletojob.elements[rid - solv->jobrules]; in solver_createcleandepsmap()
3056 how = job->elements[i]; in solver_createcleandepsmap()
3064 i = solv->ruletojob.elements[rid - solv->jobrules]; in solver_createcleandepsmap()
3065 if ((job->elements[i] & SOLVER_CLEANDEPS) == SOLVER_CLEANDEPS) in solver_createcleandepsmap()
3100 if (iq.elements[i] == p) in solver_createcleandepsmap()
3123 queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]); in solver_createcleandepsmap()
3132 p = iq.elements[i]; in solver_createcleandepsmap()
3188 Id pqp = iq.elements[i]; in solver_createcleandepsmap()
3299 how = job->elements[i]; in solver_createcleandepsmap()
3302 what = job->elements[i + 1]; in solver_createcleandepsmap()
3409 MAPSET(&im, solv->cleandeps_updatepkgs->elements[i]); in solver_createcleandepsmap()
3412 MAPSET(&im, solv->cleandeps_mistakes->elements[i]); in solver_createcleandepsmap()
3415 MAPSET(&im, iqcopy.elements[i]); in solver_createcleandepsmap()
3456 for (i = edges->elements[node]; (nnode = edges->elements[i]) != 0; i++) in trj_visit()
3461 if (!edges->elements[edges->elements[nnode]]) in trj_visit()
3543 Solvable *s = pool->solvables + unneededq->elements[i]; in solver_get_unneeded()
3544 edges.elements[i + 1] = edges.count; in solver_get_unneeded()
3558 if (p == unneededq->elements[j]) in solver_get_unneeded()
3562 if (num && edges.elements[edges.count - 1] == j + 1) in solver_get_unneeded()
3577 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]); in solver_get_unneeded()
3578 for (j = edges.elements[i + 1]; edges.elements[j]; j++) in solver_get_unneeded()
3579 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1])); in solver_get_unneeded()
3586 Solvable *s = pool->solvables + unneededq->elements[i]; in solver_get_unneeded()
3600 Id p = iq.elements[k]; in solver_get_unneeded()
3602 …if (p == unneededq->elements[i] || sp->repo != installed || !MAPTST(&cleandepsmap, p - installed->… in solver_get_unneeded()
3605 if (p == unneededq->elements[j]) in solver_get_unneeded()
3608 queue_insert(&edges, edges.elements[j + 1] + nrequires[j], i + 1); in solver_get_unneeded()
3611 edges.elements[k]++; in solver_get_unneeded()
3623 printf(" %s (%d requires):\n", pool_solvid2str(pool, unneededq->elements[i]), nrequires[i]); in solver_get_unneeded()
3624 for (j = edges.elements[i + 1]; edges.elements[j]; j++) in solver_get_unneeded()
3625 printf(" - %s\n", pool_solvid2str(pool, unneededq->elements[edges.elements[j] - 1])); in solver_get_unneeded()
3650 edges.elements[i + 1] += nrequires[i]; in solver_get_unneeded()
3651 if (!unneededq->elements[i]) in solver_get_unneeded()
3662 if (edges.elements[edges.elements[i]]) in solver_get_unneeded()
3677 unneededq->elements[i] = 0; in solver_get_unneeded()
3685 if (unneededq->elements[i]) in solver_get_unneeded()
3686 unneededq->elements[j++] = unneededq->elements[i]; in solver_get_unneeded()