src/kits/package/solver/libsolv/LibsolvSolver.cpp

889

queue_push(fJobs, matchingPackages.elements[j]);

src/libs/libsolv/ext/testcase.c

2070

queue_push(&q, testcase_str2solvid(pool, pieces[i]));

src/libs/libsolv/ext/testcase.c

751

queue_push(&q, p);

src/libs/libsolv/solv/policy.c

118

queue_push(&pq, plist->elements[0]);

src/libs/libsolv/solv/policy.c

129

queue_push(&pq, plist->elements[i]);

src/libs/libsolv/solv/policy.c

910

queue_push(qs, p);

src/libs/libsolv/solv/policy.c

928

queue_push(qs, p);

src/libs/libsolv/solv/pool.c

1314

queue_push(idq, sf.ids[i]);

src/libs/libsolv/solv/pool.c

1317

queue_push(idqinst, sf.ids[i]);

src/libs/libsolv/solv/pool.c

2156

queue_push(&q, p);

src/libs/libsolv/solv/pool.c

2159

queue_push(&q, *pp);

src/libs/libsolv/solv/pool.c

2162

queue_push(&q, p);

src/libs/libsolv/solv/pool.c

737

queue_push(&plist, p); /* found it */

src/libs/libsolv/solv/pool.c

751

queue_push(&plist, p);

src/libs/libsolv/solv/pool.c

777

queue_push(&plist, SYSTEMSOLVABLE);

src/libs/libsolv/solv/pool.c

797

queue_push(&plist, p);

src/libs/libsolv/solv/pool.c

807

queue_push(&plist, p);

src/libs/libsolv/solv/pool.c

825

queue_push(&plist, p);

src/libs/libsolv/solv/pool.c

858

queue_push(&plist, p);

src/libs/libsolv/solv/pool.c

882

queue_push(&plist, p);

src/libs/libsolv/solv/pool.c

886

queue_push(&plist, SYSTEMSOLVABLE);

src/libs/libsolv/solv/poolvendor.c

77

queue_push(&pool->vendormap, vendor);

src/libs/libsolv/solv/poolvendor.c

78

queue_push(&pool->vendormap, mask);

src/libs/libsolv/solv/problems.c

200

queue_push(refined, sug);

src/libs/libsolv/solv/problems.c

267

queue_push(&disabled, v);

src/libs/libsolv/solv/problems.c

297

queue_push(refined, v); /* do not record feature rules */

src/libs/libsolv/solv/problems.c

388

queue_push(solutionq, SOLVER_SOLUTION_POOLJOB);

src/libs/libsolv/solv/problems.c

389

queue_push(solutionq, why);

src/libs/libsolv/solv/problems.c

393

queue_push(solutionq, SOLVER_SOLUTION_JOB);

src/libs/libsolv/solv/problems.c

394

queue_push(solutionq, why - solv->pooljobcnt);

src/libs/libsolv/solv/problems.c

415

queue_push(solutionq, SOLVER_SOLUTION_INFARCH);

src/libs/libsolv/solv/problems.c

416

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

436

queue_push(solutionq, SOLVER_SOLUTION_DISTUPGRADE);

src/libs/libsolv/solv/problems.c

437

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

456

queue_push(solutionq, SOLVER_SOLUTION_DISTUPGRADE);

src/libs/libsolv/solv/problems.c

457

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

481

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

482

queue_push(solutionq, mvrp);

src/libs/libsolv/solv/problems.c

485

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

486

queue_push(solutionq, rp);

src/libs/libsolv/solv/problems.c

504

queue_push(solutionq, 0);

src/libs/libsolv/solv/problems.c

505

queue_push(solutionq, solv->ruletojob.elements[-p - solv->jobrules] + 1);

src/libs/libsolv/solv/problems.c

511

queue_push(solutionq, SOLVER_SOLUTION_BEST);

src/libs/libsolv/solv/problems.c

512

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

528

queue_push(solutionq, SOLVER_SOLUTION_BEST); /* split, see above */

src/libs/libsolv/solv/problems.c

529

queue_push(solutionq, mvrp);

src/libs/libsolv/solv/problems.c

530

queue_push(solutionq, p);

src/libs/libsolv/solv/problems.c

531

queue_push(solutionq, 0);

src/libs/libsolv/solv/problems.c

536

queue_push(solutionq, SOLVER_SOLUTION_BEST);

src/libs/libsolv/solv/problems.c

537

queue_push(solutionq, rp);

src/libs/libsolv/solv/problems.c

555

queue_push(&solv->solutions, 0); /* dummy so idx is always nonzero */

src/libs/libsolv/solv/problems.c

557

queue_push(&solv->solutions, -1); /* unrefined */

src/libs/libsolv/solv/problems.c

562

queue_push(&solv->solutions, p);

src/libs/libsolv/solv/problems.c

572

queue_push(&solv->solutions, -1); /* unrefined */

src/libs/libsolv/solv/problems.c

600

queue_push(&redoq, p);

src/libs/libsolv/solv/problems.c

601

queue_push(&redoq, solv->decisionq_why.elements[i]);

src/libs/libsolv/solv/problems.c

602

queue_push(&redoq, solv->decisionmap[p > 0 ? p : -p]);

src/libs/libsolv/solv/problems.c

615

queue_push(&problem, v);

src/libs/libsolv/solv/problems.c

623

queue_push(&problem, 0); /* mark end for refine_suggestion */

src/libs/libsolv/solv/problems.c

638

queue_push(&solv->solutions, 0); /* reserve room for number of elements */

src/libs/libsolv/solv/problems.c

657

queue_push(&solv->solutions, 0);

src/libs/libsolv/solv/problems.c

672

queue_push(&solv->solutions, 0); /* add end marker */

src/libs/libsolv/solv/problems.c

673

queue_push(&solv->solutions, 0); /* add end marker */

src/libs/libsolv/solv/problems.c

674

queue_push(&solv->solutions, problem.elements[i]); /* just for bookkeeping */

src/libs/libsolv/solv/problems.c

675

queue_push(&solv->solutions, extraflags & SOLVER_CLEANDEPS); /* our extraflags */

src/libs/libsolv/solv/problems.c

690

queue_push(&solv->decisionq, p);

src/libs/libsolv/solv/problems.c

691

queue_push(&solv->decisionq_why, redoq.elements[i + 1]);

src/libs/libsolv/solv/queue.c

106

queue_push(q, id); /* make room */

src/libs/libsolv/solv/queue.c

128

queue_push(q, id1); /* make room */

src/libs/libsolv/solv/queue.c

129

queue_push(q, id2); /* make room */

src/libs/libsolv/solv/queue.h

90

queue_push(q, id);

src/libs/libsolv/solv/queue.h

96

queue_push(q, id1);

src/libs/libsolv/solv/queue.h

97

queue_push(q, id2);

src/libs/libsolv/solv/repo.c

1185

queue_push(q, *p);

src/libs/libsolv/solv/repo.c

1560

queue_push(&q2, marker);

src/libs/libsolv/solv/repo.c

1562

queue_push(&q2, q->elements[i]);

src/libs/libsolv/solv/repodata.c

761

queue_push(q, id);

src/libs/libsolv/solv/rules.c

1132

queue_push(&badq, p);

src/libs/libsolv/solv/rules.c

1494

queue_push(q, p2);

src/libs/libsolv/solv/rules.c

1513

queue_push(q, p2);

src/libs/libsolv/solv/rules.c

1709

queue_push(q, q->elements[j]);

src/libs/libsolv/solv/rules.c

2030

queue_push(solv->ruleinfoq, type);

src/libs/libsolv/solv/rules.c

2034

queue_push(solv->ruleinfoq, op < 0 ? -op : 0);

src/libs/libsolv/solv/rules.c

2035

queue_push(solv->ruleinfoq, ow2 < 0 ? -ow2 : 0);

src/libs/libsolv/solv/rules.c

2039

queue_push(solv->ruleinfoq, p < 0 ? -p : 0);

src/libs/libsolv/solv/rules.c

2040

queue_push(solv->ruleinfoq, w2 < 0 ? -w2 : 0);

src/libs/libsolv/solv/rules.c

2042

queue_push(solv->ruleinfoq, dep);

src/libs/libsolv/solv/rules.c

2078

queue_push(rq, type);

src/libs/libsolv/solv/rules.c

2079

queue_push(rq, from);

src/libs/libsolv/solv/rules.c

2080

queue_push(rq, to);

src/libs/libsolv/solv/rules.c

2081

queue_push(rq, dep);

src/libs/libsolv/solv/rules.c

2086

queue_push(rq, rid);

src/libs/libsolv/solv/rules.c

2141

queue_push(&rq, rid);

src/libs/libsolv/solv/rules.c

2272

queue_push(q, p);

src/libs/libsolv/solv/rules.c

2274

queue_push(q, -SYSTEMSOLVABLE); /* hmm, better to return an empty result? */

src/libs/libsolv/solv/rules.c

2319

queue_push(&q, p);

src/libs/libsolv/solv/rules.c

2402

queue_push(&q, p);

src/libs/libsolv/solv/rules.c

2428

queue_push(&qi, p2);

src/libs/libsolv/solv/rules.c

2432

queue_push(&q, p);

src/libs/libsolv/solv/rules.c

2465

queue_push(&qi, p2);

src/libs/libsolv/solv/rules.c

2469

queue_push(&q, p);

src/libs/libsolv/solv/rules.c

2558

queue_push(&solv->weakruleq, solv->nrules - 1);

src/libs/libsolv/solv/rules.c

2680

queue_push(&q, p2);

src/libs/libsolv/solv/rules.c

2690

queue_push(&r2pkg, -(solv->jobrules + j));

src/libs/libsolv/solv/rules.c

2717

queue_push(&q, p);

src/libs/libsolv/solv/rules.c

2719

queue_push(&q, p2);

src/libs/libsolv/solv/rules.c

2725

queue_push(&q, p2);

src/libs/libsolv/solv/rules.c

2745

queue_push(&q2, p2);

src/libs/libsolv/solv/rules.c

2757

queue_push(&r2pkg, p);

src/libs/libsolv/solv/rules.c

2813

queue_push(q, p);

src/libs/libsolv/solv/rules.c

3058

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3096

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3104

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3123

queue_push(&iq, solv->cleandeps_updatepkgs->elements[i]);

src/libs/libsolv/solv/rules.c

3196

queue_push(&iq, ip);

src/libs/libsolv/solv/rules.c

3238

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3263

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3285

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3293

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3305

queue_push(&iq, what);

src/libs/libsolv/solv/rules.c

3338

queue_push(&iq, ip);

src/libs/libsolv/solv/rules.c

3371

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3398

queue_push(&iq, p);

src/libs/libsolv/solv/rules.c

3507

queue_push(unneededq, i);

src/libs/libsolv/solv/rules.c

3564

queue_push(&edges, j + 1);

src/libs/libsolv/solv/rules.c

3570

queue_push(&edges, 0);

src/libs/libsolv/solv/rules.c

410

queue_push(&q, -n);

src/libs/libsolv/solv/rules.c

422

queue_push(&q, p);

src/libs/libsolv/solv/rules.c

487

queue_push(&workq, s - pool->solvables); /* push solvable Id to work queue */

src/libs/libsolv/solv/rules.c

536

queue_push(&workq, buddy);

src/libs/libsolv/solv/rules.c

605

queue_push(&workq, *dp);

src/libs/libsolv/solv/rules.c

742

queue_push(&workq, p);

src/libs/libsolv/solv/rules.c

752

queue_push(&workq, p);

src/libs/libsolv/solv/rules.c

966

queue_push(&solv->orphaned, s - pool->solvables); /* treat as orphaned */

src/libs/libsolv/solv/selection.c

100

queue_push(pkgs, p);

src/libs/libsolv/solv/selection.c

105

queue_push(pkgs, p);

src/libs/libsolv/solv/selection.c

181

queue_push(&q, p);

src/libs/libsolv/solv/selection.c

259

queue_push(&q, p);

src/libs/libsolv/solv/selection.c

501

queue_push(&q, di.solvid);

src/libs/libsolv/solv/selection.c

611

queue_push(&q, p);

src/libs/libsolv/solv/selection.c

837

queue_push(&q1, p);

src/libs/libsolv/solv/selection.c

850

queue_push(&q1, p);

src/libs/libsolv/solv/selection.c

894

queue_push(sel1, sel2->elements[i]);

src/libs/libsolv/solv/selection.c

92

queue_push(pkgs, p);

src/libs/libsolv/solv/solver.c

1042

queue_push(&solv->problems, why);

src/libs/libsolv/solv/solver.c

1089

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

1095

queue_push(&solv->learnt_pool, r - solv->rules);

src/libs/libsolv/solv/solver.c

1128

queue_push(&solv->learnt_pool, why);

src/libs/libsolv/solv/solver.c

1154

queue_push(&solv->problems, 0); /* mark end of this problem */

src/libs/libsolv/solv/solver.c

1187

queue_push(&solv->learnt_pool, 0);

src/libs/libsolv/solv/solver.c

1302

queue_push(&solv->decisionq, decision);

src/libs/libsolv/solv/solver.c

1303

queue_push(&solv->decisionq_why, -ruleid); /* <= 0 -> free decision */

src/libs/libsolv/solv/solver.c

1321

queue_push(&solv->learnt_why, why);

src/libs/libsolv/solv/solver.c

1331

queue_push(&solv->ruleassertions, r - solv->rules);

src/libs/libsolv/solv/solver.c

1335

queue_push(&solv->decisionq, p);

src/libs/libsolv/solv/solver.c

1336

queue_push(&solv->decisionq_why, r - solv->rules);

src/libs/libsolv/solv/solver.c

1387

queue_push(&solv->branches, dq->elements[i]);

src/libs/libsolv/solv/solver.c

1388

queue_push(&solv->branches, -level);

src/libs/libsolv/solv/solver.c

1442

queue_push(&solv->learnt_pool, 0); /* so that 0 does not describe a proof */

src/libs/libsolv/solv/solver.c

1655

queue_push(solv->cleandeps_mistakes, i);

src/libs/libsolv/solv/solver.c

1777

queue_push(&dq, l);

src/libs/libsolv/solv/solver.c

1871

queue_push(&dq, i);

src/libs/libsolv/solv/solver.c

1874

queue_push(&dq, p);

src/libs/libsolv/solv/solver.c

1903

queue_push(&dq, p);

src/libs/libsolv/solv/solver.c

2001

queue_push(&dq, r->p);

src/libs/libsolv/solv/solver.c

2002

queue_push(&dq, r->w2);

src/libs/libsolv/solv/solver.c

2022

queue_push(&dq, r->p);

src/libs/libsolv/solv/solver.c

2037

queue_push(&dq, p);

src/libs/libsolv/solv/solver.c

2160

queue_push(&dqs, i);

src/libs/libsolv/solv/solver.c

2350

queue_push(&solv->branches, dq.elements[i]);

src/libs/libsolv/solv/solver.c

2351

queue_push(&solv->branches, -level);

src/libs/libsolv/solv/solver.c

2444

queue_push(&dq, solv->branches.elements[j]);

src/libs/libsolv/solv/solver.c

2450

queue_push(&solv->branches, dq.elements[j]);

src/libs/libsolv/solv/solver.c

2563

queue_push(removed, -p);

src/libs/libsolv/solv/solver.c

2564

queue_push(removed, decisionmap[-p]);

src/libs/libsolv/solv/solver.c

2659

queue_push(&solv->weakruleq, i);

src/libs/libsolv/solv/solver.c

2714

queue_push(&solv->ruletojob, job);

src/libs/libsolv/solv/solver.c

2716

queue_push(&solv->weakruleq, solv->nrules - 1);

src/libs/libsolv/solv/solver.c

2842

queue_push(update_targets, 0); /* finish last set */

src/libs/libsolv/solv/solver.c

2867

queue_push(&solv->addedmap_deduceq, -p);

src/libs/libsolv/solv/solver.c

2872

queue_push(&solv->addedmap_deduceq, i);

src/libs/libsolv/solv/solver.c

2878

queue_push(&solv->addedmap_deduceq, i);

src/libs/libsolv/solv/solver.c

298

queue_push(&solv->decisionq, SYSTEMSOLVABLE);

src/libs/libsolv/solv/solver.c

299

queue_push(&solv->decisionq_why, 0);

src/libs/libsolv/solv/solver.c

3325

queue_push(&solv->orphaned, i);

src/libs/libsolv/solv/solver.c

3372

queue_push(&q, p);

src/libs/libsolv/solv/solver.c

3376

queue_push(&q, -SYSTEMSOLVABLE);

src/libs/libsolv/solv/solver.c

340

queue_push(&solv->decisionq, v);

src/libs/libsolv/solv/solver.c

341

queue_push(&solv->decisionq_why, r - solv->rules);

src/libs/libsolv/solv/solver.c

3542

queue_push(&solv->weakruleq, i);

src/libs/libsolv/solv/solver.c

3612

queue_push(&solv->ruleassertions, i);

src/libs/libsolv/solv/solver.c

3698

queue_push(&disabledq, i);

src/libs/libsolv/solv/solver.c

3784

queue_push(recommendationsq, i);

src/libs/libsolv/solv/solver.c

3849

queue_push(suggestionsq, i);

src/libs/libsolv/solv/solver.c

394

queue_push(&solv->problems, solv->learnt_pool.count);

src/libs/libsolv/solv/solver.c

395

queue_push(&solv->learnt_pool, ri);

src/libs/libsolv/solv/solver.c

396

queue_push(&solv->learnt_pool, 0);

src/libs/libsolv/solv/solver.c

3980

queue_push(decisionq, p);

src/libs/libsolv/solv/solver.c

399

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

405

queue_push(&solv->problems, v);

src/libs/libsolv/solv/solver.c

406

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

4108

queue_push(whyq, SOLVER_REASON_RECOMMENDED);

src/libs/libsolv/solv/solver.c

4141

queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);

src/libs/libsolv/solv/solver.c

4149

queue_push(whyq, SOLVER_REASON_SUPPLEMENTED);

src/libs/libsolv/solv/solver.c

4171

queue_push(pkgs, p);

src/libs/libsolv/solv/solver.c

4179

queue_push(pkgs, p);

src/libs/libsolv/solv/solver.c

4184

queue_push(pkgs, p);

src/libs/libsolv/solv/solver.c

423

queue_push(&solv->problems, solv->learnt_pool.count);

src/libs/libsolv/solv/solver.c

424

queue_push(&solv->learnt_pool, ri);

src/libs/libsolv/solv/solver.c

425

queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);

src/libs/libsolv/solv/solver.c

426

queue_push(&solv->learnt_pool, 0);

src/libs/libsolv/solv/solver.c

429

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

436

queue_push(&solv->problems, v);

src/libs/libsolv/solv/solver.c

437

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

452

queue_push(&solv->problems, solv->learnt_pool.count);

src/libs/libsolv/solv/solver.c

453

queue_push(&solv->learnt_pool, ri);

src/libs/libsolv/solv/solver.c

454

queue_push(&solv->learnt_pool, solv->decisionq_why.elements[i]);

src/libs/libsolv/solv/solver.c

455

queue_push(&solv->learnt_pool, 0);

src/libs/libsolv/solv/solver.c

458

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

483

queue_push(&solv->problems, v);

src/libs/libsolv/solv/solver.c

485

queue_push(&solv->problems, 0);

src/libs/libsolv/solv/solver.c

514

queue_push(&solv->decisionq, v);

src/libs/libsolv/solv/solver.c

515

queue_push(&solv->decisionq_why, r - solv->rules);

src/libs/libsolv/solv/solver.c

797

queue_push(&solv->decisionq, other_watch);

src/libs/libsolv/solv/solver.c

798

queue_push(&solv->decisionq_why, r - solv->rules);

src/libs/libsolv/solv/solver.c

850

queue_push(&solv->learnt_pool, c - solv->rules);

src/libs/libsolv/solv/solver.c

880

queue_push(&r, v); /* not level1 or conflict level, add to new rule */

src/libs/libsolv/solv/solver.c

939

queue_push(&solv->learnt_pool, 0);

src/libs/libsolv/solv/solverdebug.c

798

queue_push(&in, p);

src/libs/libsolv/solv/transaction.c

101

queue_push(pkgs, ti->elements[i + 1]);

src/libs/libsolv/solv/transaction.c

1329

queue_push(&od->cycles, od->cyclesdata.count); /* offset into data */

src/libs/libsolv/solv/transaction.c

1330

queue_push(&od->cycles, k / 2); /* cycle elements */

src/libs/libsolv/solv/transaction.c

1331

queue_push(&od->cycles, od->edgedata[cycle[l + 1] + 1]); /* broken edge */

src/libs/libsolv/solv/transaction.c

1338

queue_push(&od->cyclesdata, cycle[k]);

src/libs/libsolv/solv/transaction.c

1342

queue_push(&od->cyclesdata, 0); /* mark end */

src/libs/libsolv/solv/transaction.c

1452

queue_push(todo, j);

src/libs/libsolv/solv/transaction.c

1467

queue_push(todo, k);

src/libs/libsolv/solv/transaction.c

1631

queue_push(&todo, i);

src/libs/libsolv/solv/transaction.c

1657

queue_push(&todo, -i); /* end of edges marker */

src/libs/libsolv/solv/transaction.c

1658

queue_push(&todo, k);

src/libs/libsolv/solv/transaction.c

1682

queue_push(&todo, 0);

src/libs/libsolv/solv/transaction.c

1777

queue_push(&uninstq, i);

src/libs/libsolv/solv/transaction.c

1779

queue_push(&todo, i);

src/libs/libsolv/solv/transaction.c

1824

queue_push(&samerepoq, k);

src/libs/libsolv/solv/transaction.c

1837

queue_push(tr, te->p);

src/libs/libsolv/solv/transaction.c

1853

queue_push(&uninstq, od.invedgedata[j]);

src/libs/libsolv/solv/transaction.c

1855

queue_push(&samerepoq, od.invedgedata[j]);

src/libs/libsolv/solv/transaction.c

1857

queue_push(&todo, od.invedgedata[j]);

src/libs/libsolv/solv/transaction.c

1915

queue_push(choices, te->p);

src/libs/libsolv/solv/transaction.c

1933

queue_push(choices, te->p);

src/libs/libsolv/solv/transaction.c

442

queue_push(classes, SOLVER_TRANSACTION_ARCHCHANGE);

src/libs/libsolv/solv/transaction.c

443

queue_push(classes, 1);

src/libs/libsolv/solv/transaction.c

444

queue_push(classes, v);

src/libs/libsolv/solv/transaction.c

445

queue_push(classes, vq);

src/libs/libsolv/solv/transaction.c

462

queue_push(classes, SOLVER_TRANSACTION_VENDORCHANGE);

src/libs/libsolv/solv/transaction.c

463

queue_push(classes, 1);

src/libs/libsolv/solv/transaction.c

464

queue_push(classes, v);

src/libs/libsolv/solv/transaction.c

465

queue_push(classes, vq);

src/libs/libsolv/solv/transaction.c

513

queue_push(pkgs, p);

src/libs/libsolv/solv/transaction.c

525

queue_push(pkgs, p);

src/libs/libsolv/solv/transaction.c

533

queue_push(pkgs, p);

src/libs/libsolv/solv/transaction.c

684

queue_push(&trans->steps, p);

src/libs/libsolv/solv/transaction.c

691

queue_push(&trans->steps, p);

src/libs/libsolv/solv/transaction.c

713

queue_push(installedq, p);

src/libs/libsolv/solv/transaction.c

720

queue_push(installedq, p);

src/libs/libsolv/solv/transaction.c

81

queue_push(pkgs, q);