Home
last modified time | relevance | path

Searched refs:qcount (Results 1 – 2 of 2) sorted by relevance

/haiku/src/libs/libsolv/solv/
H A Drules.c1530 int qcount = q->count; in intersect_obsoletes() local
1533 if (qcount == qstart) in intersect_obsoletes()
1535 if (qcount == q->count) in intersect_obsoletes()
1537 else if (qcount == qstart + 1) in intersect_obsoletes()
1541 for (i = qcount; i < q->count; i++) in intersect_obsoletes()
1552 for (i = j = qstart; i < qcount; i++) in intersect_obsoletes()
1555 for (k = qcount; k < q->count; k++) in intersect_obsoletes()
1569 for (i = qcount; i < q->count; i++) in intersect_obsoletes()
1571 for (i = j = qstart; i < qcount; i++) in intersect_obsoletes()
H A Dsolver.c2109 int qcount; in solver_run_sat() local
2131 qcount = dq.count; in solver_run_sat()
2136 dq.count = qcount; in solver_run_sat()