Lines Matching refs:elements
144 if (q->elements[i] == dep || q->elements[i] == rd->name) in solver_check_installsuppdepq_dep()
177 extraflags &= solv->job.elements[-v - 1]; in autouninstall()
247 whyp = solv->learnt_pool.elements + solv->learnt_why.elements[i - solv->learntrules]; in enabledisablelearntrules()
308 v = solv->decisionq.elements[--solv->decisionq.count]; in makeruledecisions()
317 ri = solv->ruleassertions.elements[ii]; in makeruledecisions()
382 if (solv->decisionq.elements[i] == -v) in makeruledecisions()
402 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1); in makeruledecisions()
414 assert(solv->decisionq_why.elements[i] > 0); in makeruledecisions()
419 if (solv->decisionq_why.elements[i] < solv->rpmrules_end) in makeruledecisions()
425 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]); in makeruledecisions()
433 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1); in makeruledecisions()
454 queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]); in makeruledecisions()
482 v = -(solv->ruletojob.elements[i - solv->jobrules] + 1); in makeruledecisions()
487 …if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1… in makeruledecisions()
491 solver_disableproblem(solv, solv->problems.elements[i]); in makeruledecisions()
503 ri = solv->ruleassertions.elements[ii]; in makeruledecisions()
537 v = -(solv->ruletojob.elements[ri - solv->jobrules] + 1); in makeruledecisions()
660 pkg = -solv->decisionq.elements[solv->propagate_index++]; in propagate()
894 v = solv->decisionq.elements[--idx]; in analyze()
910 v = r.elements[i]; in analyze()
918 why = solv->decisionq_why.elements[idx]; in analyze()
927 else if (r.count == 1 && r.elements[0] < 0) in analyze()
928 *dr = r.elements[0]; in analyze()
936 solver_printruleelement(solv, SOLV_DEBUG_ANALYZE, 0, r.elements[i]); in analyze()
966 v = solv->decisionq.elements[i]; in solver_reset()
1005 … for (i = solv->learnt_why.elements[why - solv->learntrules]; solv->learnt_pool.elements[i]; i++) in analyze_unsolvable_rule()
1006 if (solv->learnt_pool.elements[i] > 0) in analyze_unsolvable_rule()
1007 analyze_unsolvable_rule(solv, solv->rules + solv->learnt_pool.elements[i], lastweakp, rseen); in analyze_unsolvable_rule()
1018 why = -(solv->ruletojob.elements[why - solv->jobrules] + 1); in analyze_unsolvable_rule()
1037 if (solv->problems.elements[i] == 0) /* end of last problem reached? */ in analyze_unsolvable_rule()
1039 else if (solv->problems.elements[i] == why) in analyze_unsolvable_rule()
1121 v = solv->decisionq.elements[--idx]; in analyze_unsolvable()
1125 why = solv->decisionq_why.elements[idx]; in analyze_unsolvable()
1162 v = -(solv->ruletojob.elements[lastweak - solv->jobrules] + 1); in analyze_unsolvable()
1176 …if (solv->allowuninstall && (v = autouninstall(solv, solv->problems.elements + oldproblemcount + 1… in analyze_unsolvable()
1188 solv->problems.elements[oldproblemcount] = oldlearntpoolcount; in analyze_unsolvable()
1195 solver_disableproblem(solv, solv->problems.elements[i]); in analyze_unsolvable()
1221 v = solv->decisionq.elements[solv->decisionq.count - 1]; in revert()
1231 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] <= -level) in revert()
1234 while (solv->branches.count && solv->branches.elements[solv->branches.count - 1] >= 0) in revert()
1376 if (solver_is_supplementing(solv, pool->solvables + dq->elements[i])) in selectandinstall()
1378 dq->elements[0] = dq->elements[i]; in selectandinstall()
1387 queue_push(&solv->branches, dq->elements[i]); in selectandinstall()
1390 p = dq->elements[0]; in selectandinstall()
1672 p = q->elements[i]; in prune_to_update_targets()
1676 q->elements[j++] = p; in prune_to_update_targets()
1784 !(solv->job.elements[solv->ruletojob.elements[i - solv->jobrules]] & SOLVER_ORUPDATE)) in solver_run_sat()
1789 Solvable *s = pool->solvables + dq.elements[j]; in solver_run_sat()
1792 dq.elements[k++] = dq.elements[j]; in solver_run_sat()
1793 if (solv->updatemap.size && MAPTST(&solv->updatemap, dq.elements[j] - solv->installed->start)) in solver_run_sat()
1875 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start]) in solver_run_sat()
1876 …prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - … in solver_run_sat()
1880 p = dq.elements[0]; in solver_run_sat()
1907 if (dq.count && solv->update_targets && solv->update_targets->elements[i - installed->start]) in solver_run_sat()
1908 …prune_to_update_targets(solv, solv->update_targets->elements + solv->update_targets->elements[i - … in solver_run_sat()
2057 …if (pool->solvables[dq.elements[j]].repo == installed && MAPTST(&solv->cleandepsmap, dq.elements[j… in solver_run_sat()
2061 dq.elements[0] = dq.elements[j]; in solver_run_sat()
2188 if (!MAPTST(&obsmap, dqs.elements[i])) in solver_run_sat()
2189 dqs.elements[j++] = dqs.elements[i]; in solver_run_sat()
2192 if (!MAPTST(&obsmap, dq.elements[i])) in solver_run_sat()
2193 dq.elements[j++] = dq.elements[i]; in solver_run_sat()
2205 p = solv->decisionq.elements[i]; in solver_run_sat()
2216 p = dqs.elements[i]; in solver_run_sat()
2221 dqs.elements[j++] = p; in solver_run_sat()
2223 dqs.elements[j++] = p; in solver_run_sat()
2229 p = solv->decisionq.elements[i]; in solver_run_sat()
2246 p = dqs.elements[i]; in solver_run_sat()
2257 dqs.elements[j++] = p; in solver_run_sat()
2266 queue_pushunique(&dq, dqs.elements[i]); in solver_run_sat()
2277 p = dq.elements[0]; in solver_run_sat()
2294 MAPSET(&dqmap, dq.elements[i]); in solver_run_sat()
2299 p = dqs.elements[i]; in solver_run_sat()
2322 p = solv->decisionq.elements[i]; in solver_run_sat()
2350 queue_push(&solv->branches, dq.elements[i]); in solver_run_sat()
2353 p = dq.elements[0]; in solver_run_sat()
2379 p = solv->orphaned.elements[i]; in solver_run_sat()
2401 p = solv->orphaned.elements[i]; in solver_run_sat()
2434 int l = -solv->branches.elements[i]; in solver_run_sat()
2438 if (solv->branches.elements[i - 1] < 0) in solver_run_sat()
2440 p = solv->branches.elements[i]; in solver_run_sat()
2444 queue_push(&dq, solv->branches.elements[j]); in solver_run_sat()
2450 queue_push(&solv->branches, dq.elements[j]); in solver_run_sat()
2452 why = -solv->decisionq_why.elements[solv->decisionq_why.count]; in solver_run_sat()
2472 p = solv->branches.elements[i]; in solver_run_sat()
2484 p = solv->branches.elements[lasti]; in solver_run_sat()
2485 solv->branches.elements[lasti] = 0; in solver_run_sat()
2491 why = -solv->decisionq_why.elements[solv->decisionq_why.count]; in solver_run_sat()
2546 p = solv->decisionq.elements[i]; in removedisabledconflicts()
2549 why = solv->decisionq_why.elements[i]; in removedisabledconflicts()
2638 solv->decisionmap[removed->elements[i]] = removed->elements[i + 1]; in undo_removedisabledconflicts()
2676 how = job->elements[i]; in solver_calculate_multiversionmap()
2679 what = job->elements[i + 1]; in solver_calculate_multiversionmap()
2820 …solv_sort(update_targets->elements, update_targets->count >> 1, 2 * sizeof(Id), transform_update_t… in transform_update_targets()
2825 if ((p = update_targets->elements[i]) != lastp) in transform_update_targets()
2830 update_targets->elements[j++] = 0; /* finish old set */ in transform_update_targets()
2831 update_targets->elements[p - installed->start] = j; /* start new set */ in transform_update_targets()
2835 if ((q = update_targets->elements[i + 1]) != lastq) in transform_update_targets()
2837 update_targets->elements[j++] = q; in transform_update_targets()
2866 …if (!solv->addedmap_deduceq.count || solv->addedmap_deduceq.elements[solv->addedmap_deduceq.count … in addedmap2deduceq()
2905 p = solv->addedmap_deduceq.elements[j]; in deduceq2addedmap()
2959 queue_insertn(&solv->job, 0, pool->pooljobs.count, pool->pooljobs.elements); in solver_solve()
3082 how = job->elements[i]; in solver_solve()
3083 what = job->elements[i + 1]; in solver_solve()
3191 how = job->elements[i]; in solver_solve()
3192 what = job->elements[i + 1]; in solver_solve()
3353 how = job->elements[i]; in solver_solve()
3354 what = job->elements[i + 1]; in solver_solve()
3588 p = solv->weakruleq.elements[i]; in solver_solve()
3727 why = solv->decisionq_why.elements[i]; in solver_get_recommendations()
3730 p = solv->decisionq.elements[i]; in solver_get_recommendations()
3739 p = solv->decisionq.elements[i]; in solver_get_recommendations()
3804 p = solv->decisionq.elements[i]; in solver_get_recommendations()
3861 solver_enablerule(solv, solv->rules + disabledq.elements[i]); in solver_get_recommendations()
3918 if (res->elements[i] != -1) in solver_trivial_installable()
3920 Solvable *s = pool->solvables + pkgs->elements[i]; in solver_trivial_installable()
3922 res->elements[i] = -1; in solver_trivial_installable()
3951 p = solv->decisionq.elements[solv->decisionq.count - 1]; in solver_get_lastdecisionblocklevel()
3966 p = solv->decisionq.elements[i]; in solver_get_decisionblock()
3976 p = solv->decisionq.elements[i]; in solver_get_decisionblock()
3998 if (solv->decisionq.elements[i] == pp) in solver_describe_decision()
4002 why = solv->decisionq_why.elements[i]; in solver_describe_decision()
4073 if (solv->decisionq.elements[decisionno] == p) in solver_describe_weakdep_decision()
4122 p2 = solv->decisionq.elements[i]; in solver_describe_weakdep_decision()
4155 p2 = solv->decisionq.elements[i]; in solver_describe_weakdep_decision()