Home
last modified time | relevance | path

Searched refs:rpmrules_end (Results 1 – 4 of 4) sorted by relevance

/haiku/src/libs/libsolv/solv/
H A Dsolver.h52 Id rpmrules_end; /* [Offset] rpm rules end */ member
H A Dsolver.c419 if (solv->decisionq_why.elements[i] < solv->rpmrules_end) in makeruledecisions()
1014 if (why < solv->rpmrules_end) in analyze_unsolvable_rule()
2653 for (i = 1, r = solv->rules + i; i < solv->rpmrules_end; i++, r++) in weaken_solvable_deps()
2855 for (i = 2, j = solv->rpmrules_end - 1; i < pool->nsolvables && j > 0; j--) in addedmap2deduceq()
2891 for (j = solv->rpmrules_end - 1; j > 0; j--) in deduceq2addedmap()
3069 initialnrules = solv->rpmrules_end ? solv->rpmrules_end : 1; in solver_solve()
3075 solv->rpmrules_end = 0; in solver_solve()
3252 solv->rpmrules_end = solv->nrules; /* mark end of rpm rules */ in solver_solve()
3581 …infarch rules, %d dup rules, %d choice rules, %d best rules\n", solv->rpmrules_end - 1, solv->upda… in solver_solve()
H A Drules.c277 if (!solv->rpmrules_end) /* we add rpm rules */ in solver_addrule()
305 if (n == 1 && p > d && !solv->rpmrules_end) in solver_addrule()
2074 if (rid <= 0 || rid >= solv->rpmrules_end) in solver_allruleinfos()
2131 if (rid > 0 && rid < solv->rpmrules_end) in solver_ruleinfo()
2240 if (rid > 0 && rid < solv->rpmrules_end) in solver_ruleclass()
2369 solv->choicerules_ref = solv_calloc(solv->rpmrules_end, sizeof(Id)); in solver_addchoicerules()
2384 for (rid = 1; rid < solv->rpmrules_end ; rid++) in solver_addchoicerules()
H A Dproblems.c911 assert(rid < solv->rpmrules_end); in findproblemrule_internal()