headers/private/app/DirectMessageTarget.h
27
BMessageQueue* Queue() { return &fQueue; }
headers/private/util/DoublyLinkedQueue.h
131
const Queue *fQueue;
headers/private/util/DoublyLinkedQueue.h
36
Iterator(Queue *queue)
headers/private/util/DoublyLinkedQueue.h
86
Queue *fQueue;
headers/private/util/DoublyLinkedQueue.h
93
ConstIterator(const Queue *queue)
headers/tools/cppunit/TestApp.h
17
BMessageQueue &Queue();
src/add-ons/kernel/busses/usb/uhci.cpp
1133
Queue *queue = NULL;
src/add-ons/kernel/busses/usb/uhci.cpp
1155
UHCI::AddPendingTransfer(Transfer *transfer, Queue *queue,
src/add-ons/kernel/busses/usb/uhci.cpp
296
Queue::Queue(Stack *stack)
src/add-ons/kernel/busses/usb/uhci.cpp
316
Queue::~Queue()
src/add-ons/kernel/busses/usb/uhci.cpp
330
Queue::InitCheck()
src/add-ons/kernel/busses/usb/uhci.cpp
337
Queue::Lock()
src/add-ons/kernel/busses/usb/uhci.cpp
344
Queue::Unlock()
src/add-ons/kernel/busses/usb/uhci.cpp
351
Queue::LinkTo(Queue *other)
src/add-ons/kernel/busses/usb/uhci.cpp
368
Queue::TerminateByStrayDescriptor()
src/add-ons/kernel/busses/usb/uhci.cpp
405
Queue::AppendTransfer(uhci_qh *transfer, bool lock)
src/add-ons/kernel/busses/usb/uhci.cpp
434
Queue::RemoveTransfer(uhci_qh *transfer, bool lock)
src/add-ons/kernel/busses/usb/uhci.cpp
475
Queue::PhysicalAddress()
src/add-ons/kernel/busses/usb/uhci.cpp
482
Queue::PrintToStream()
src/add-ons/kernel/busses/usb/uhci.cpp
603
fQueues = new(std::nothrow) Queue *[fQueueCount];
src/add-ons/kernel/busses/usb/uhci.cpp
610
fQueues[i] = new(std::nothrow) Queue(fStack);
src/add-ons/kernel/busses/usb/uhci.cpp
855
Queue *queue = NULL;
src/add-ons/kernel/busses/usb/uhci.h
132
Queue *queue,
src/add-ons/kernel/busses/usb/uhci.h
232
Queue ** fQueues;
src/add-ons/kernel/busses/usb/uhci.h
30
class Queue {
src/add-ons/kernel/busses/usb/uhci.h
32
Queue(Stack *stack);
src/add-ons/kernel/busses/usb/uhci.h
33
~Queue();
src/add-ons/kernel/busses/usb/uhci.h
40
status_t LinkTo(Queue *other);
src/add-ons/kernel/busses/usb/uhci.h
67
Queue * queue;
src/add-ons/kernel/drivers/network/ether/marvell_yukon/dev/msk/if_mskreg.h
1212
#define RB_ADDR(Queue, Offs) (B16_RAM_REGS + (Queue) + (Offs))
src/add-ons/kernel/drivers/network/ether/marvell_yukon/dev/msk/if_mskreg.h
580
#define Q_ADDR(Queue, Offs) (B8_Q_REGS + (Queue) + (Offs))
src/add-ons/kernel/drivers/network/ether/marvell_yukon/dev/msk/if_mskreg.h
598
#define Y2_PREF_Q_ADDR(Queue, Offs) (Y2_B8_PREF_REGS + (Queue) + (Offs))
src/add-ons/kernel/file_systems/packagefs/package/CachedDataReader.cpp
426
otherLineLocker->Queue().Add(lineLocker);
src/add-ons/kernel/file_systems/packagefs/package/CachedDataReader.cpp
438
if (CacheLineLocker* nextLineLocker = lineLocker->Queue().RemoveHead()) {
src/add-ons/kernel/file_systems/packagefs/package/CachedDataReader.cpp
439
nextLineLocker->Queue().TakeFrom(&lineLocker->Queue());
src/add-ons/kernel/file_systems/packagefs/package/CachedDataReader.h
59
DoublyLinkedList<CacheLineLocker>& Queue()
src/kits/app/Looper.cpp
1046
&& fDirectTarget->Queue()->IsNextMessage(message)
src/kits/app/Looper.cpp
1062
fDirectTarget->Queue()->AddMessage(message);
src/kits/app/Looper.cpp
1203
BMessage* message = fDirectTarget->Queue()->NextMessage();
src/kits/app/Looper.cpp
132
while ((message = fDirectTarget->Queue()->NextMessage()) != NULL) {
src/kits/app/Looper.cpp
365
return fDirectTarget->Queue();
src/kits/app/Looper.cpp
374
if (!fDirectTarget->Queue()->IsEmpty())
src/kits/app/Message.cpp
2269
if (direct->Queue()->IsNextMessage(copy) && port_count(port) <= 0) {
src/kits/interface/Window.cpp
2945
fDirectTarget->Queue()->AddMessage(message);
src/kits/interface/Window.cpp
2995
BMessage* message = fDirectTarget->Queue()->NextMessage();
src/kits/package/solver/libsolv/LibsolvSolver.cpp
48
struct LibsolvSolver::SolvQueue : Queue {
src/libs/libsolv/ext/testcase.c
1307
Queue q;
src/libs/libsolv/ext/testcase.c
1341
Queue q;
src/libs/libsolv/ext/testcase.c
1424
Queue q;
src/libs/libsolv/ext/testcase.c
1494
Queue q;
src/libs/libsolv/ext/testcase.c
1508
Queue qr, qs;
src/libs/libsolv/ext/testcase.c
1529
Queue q;
src/libs/libsolv/ext/testcase.c
1861
testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp)
src/libs/libsolv/ext/testcase.c
2060
Queue q;
src/libs/libsolv/ext/testcase.c
736
Queue q;
src/libs/libsolv/ext/testcase.c
799
addselectionjob(Pool *pool, char **pieces, int npieces, Queue *jobqueue)
src/libs/libsolv/ext/testcase.c
804
Queue sel;
src/libs/libsolv/ext/testcase.h
32
extern Solver *testcase_read(Pool *pool, FILE *fp, char *testcase, Queue *job, char **resultp, int *resultflagsp);
src/libs/libsolv/solv/policy.c
110
prune_to_highest_prio_per_name(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
112
Queue pq;
src/libs/libsolv/solv/policy.c
148
prune_to_recommended(Solver *solv, Queue *plist)
src/libs/libsolv/solv/policy.c
264
prune_to_best_arch(const Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
302
Queue *plist;
src/libs/libsolv/solv/policy.c
316
Queue *plist = trj->plist;
src/libs/libsolv/solv/policy.c
397
prune_obsoleted(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
443
prune_obsoleted_2(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
492
move_installed_to_front(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
538
prune_to_best_version(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
602
prune_best_arch_name_version(const Solver *solv, Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
613
prune_installed_dup_packages(Solver *solv, Queue *plist)
src/libs/libsolv/solv/policy.c
645
policy_filter_unwanted(Solver *solv, Queue *plist, int mode)
src/libs/libsolv/solv/policy.c
80
prune_to_highest_prio(Pool *pool, Queue *plist)
src/libs/libsolv/solv/policy.c
839
policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
src/libs/libsolv/solv/policy.h
29
extern void policy_filter_unwanted(Solver *solv, Queue *plist, int mode);
src/libs/libsolv/solv/policy.h
33
extern void policy_findupdatepackages(Solver *solv, Solvable *s, Queue *qs, int allowall);
src/libs/libsolv/solv/pool.c
1141
Queue fileprovidesq;
src/libs/libsolv/solv/pool.c
1260
pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst)
src/libs/libsolv/solv/pool.c
1897
pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap)
src/libs/libsolv/solv/pool.c
2042
pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res)
src/libs/libsolv/solv/pool.c
2137
Queue q;
src/libs/libsolv/solv/pool.c
2168
pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts)
src/libs/libsolv/solv/pool.c
507
pool_queuetowhatprovides(Pool *pool, Queue *q)
src/libs/libsolv/solv/pool.c
707
Queue plist;
src/libs/libsolv/solv/pool.h
122
Queue pooljobs; /* fixed jobs, like USERINSTALLED/MULTIVERSION */
src/libs/libsolv/solv/pool.h
270
int solvable_trivial_installable_queue(Solvable *s, Queue *installed, Map *multiversionmap);
src/libs/libsolv/solv/pool.h
273
void pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap);
src/libs/libsolv/solv/pool.h
292
extern void pool_addfileprovides_queue(Pool *pool, Queue *idq, Queue *idqinst);
src/libs/libsolv/solv/pool.h
294
extern Id pool_queuetowhatprovides(Pool *pool, Queue *q);
src/libs/libsolv/solv/pool.h
333
void pool_trivial_installable(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res);
src/libs/libsolv/solv/pool.h
334
void pool_trivial_installable_multiversionmap(Pool *pool, Map *installedmap, Queue *pkgs, Queue *res, Map *multiversionmap);
src/libs/libsolv/solv/pool.h
344
void pool_add_fileconflicts_deps(Pool *pool, Queue *conflicts);
src/libs/libsolv/solv/pool.h
88
Queue vendormap; /* map vendor to vendorclasses mask */
src/libs/libsolv/solv/problems.c
1020
solver_findallproblemrules(Solver *solv, Id problem, Queue *rules)
src/libs/libsolv/solv/problems.c
178
refine_suggestion(Solver *solv, Id *problem, Id sug, Queue *refined, int essentialok)
src/libs/libsolv/solv/problems.c
183
Queue disabled;
src/libs/libsolv/solv/problems.c
359
Queue *job = dp;
src/libs/libsolv/solv/problems.c
380
convertsolution(Solver *solv, Id why, Queue *solutionq)
src/libs/libsolv/solv/problems.c
586
Queue redoq;
src/libs/libsolv/solv/problems.c
587
Queue problem, solution, problems_save;
src/libs/libsolv/solv/problems.c
817
solver_take_solutionelement(Solver *solv, Id p, Id rp, Id extrajobflags, Queue *job)
src/libs/libsolv/solv/problems.c
849
solver_take_solution(Solver *solv, Id problem, Id solution, Queue *job)
src/libs/libsolv/solv/problems.c
994
findallproblemrules_internal(Solver *solv, Id idx, Queue *rules, Map *rseen)
src/libs/libsolv/solv/problems.h
42
void solver_take_solutionelement(struct _Solver *solv, Id p, Id rp, Id extrajobflags, Queue *job);
src/libs/libsolv/solv/problems.h
43
void solver_take_solution(struct _Solver *solv, Id problem, Id solution, Queue *job);
src/libs/libsolv/solv/problems.h
46
void solver_findallproblemrules(struct _Solver *solv, Id problem, Queue *rules);
src/libs/libsolv/solv/queue.c
104
queue_insert(Queue *q, int pos, Id id)
src/libs/libsolv/solv/queue.c
115
queue_delete(Queue *q, int pos)
src/libs/libsolv/solv/queue.c
126
queue_insert2(Queue *q, int pos, Id id1, Id id2)
src/libs/libsolv/solv/queue.c
139
queue_delete2(Queue *q, int pos)
src/libs/libsolv/solv/queue.c
156
queue_insertn(Queue *q, int pos, int n, Id *elements)
src/libs/libsolv/solv/queue.c
183
queue_deleten(Queue *q, int pos, int n)
src/libs/libsolv/solv/queue.c
197
queue_prealloc(Queue *q, int n)
src/libs/libsolv/solv/queue.c
23
queue_init(Queue *q)
src/libs/libsolv/solv/queue.c
30
queue_init_clone(Queue *t, Queue *s)
src/libs/libsolv/solv/queue.c
46
queue_init_buffer(Queue *q, Id *buf, int size)
src/libs/libsolv/solv/queue.c
55
queue_free(Queue *q)
src/libs/libsolv/solv/queue.c
64
queue_alloc_one(Queue *q)
src/libs/libsolv/solv/queue.c
91
queue_alloc_one_head(Queue *q)
src/libs/libsolv/solv/queue.h
101
queue_truncate(Queue *q, int n)
src/libs/libsolv/solv/queue.h
110
extern void queue_init(Queue *q);
src/libs/libsolv/solv/queue.h
111
extern void queue_init_buffer(Queue *q, Id *buf, int size);
src/libs/libsolv/solv/queue.h
112
extern void queue_init_clone(Queue *t, Queue *s);
src/libs/libsolv/solv/queue.h
113
extern void queue_free(Queue *q);
src/libs/libsolv/solv/queue.h
115
extern void queue_insert(Queue *q, int pos, Id id);
src/libs/libsolv/solv/queue.h
116
extern void queue_insert2(Queue *q, int pos, Id id1, Id id2);
src/libs/libsolv/solv/queue.h
117
extern void queue_insertn(Queue *q, int pos, int n, Id *elements);
src/libs/libsolv/solv/queue.h
118
extern void queue_delete(Queue *q, int pos);
src/libs/libsolv/solv/queue.h
119
extern void queue_delete2(Queue *q, int pos);
src/libs/libsolv/solv/queue.h
120
extern void queue_deleten(Queue *q, int pos, int n);
src/libs/libsolv/solv/queue.h
121
extern void queue_prealloc(Queue *q, int n);
src/libs/libsolv/solv/queue.h
30
extern void queue_alloc_one(Queue *q); /* internal */
src/libs/libsolv/solv/queue.h
31
extern void queue_alloc_one_head(Queue *q); /* internal */
src/libs/libsolv/solv/queue.h
35
queue_empty(Queue *q)
src/libs/libsolv/solv/queue.h
48
queue_shift(Queue *q)
src/libs/libsolv/solv/queue.h
57
queue_pop(Queue *q)
src/libs/libsolv/solv/queue.h
66
queue_unshift(Queue *q, Id id)
src/libs/libsolv/solv/queue.h
75
queue_push(Queue *q, Id id)
src/libs/libsolv/solv/queue.h
84
queue_pushunique(Queue *q, Id id)
src/libs/libsolv/solv/queue.h
94
queue_push2(Queue *q, Id id1, Id id2)
src/libs/libsolv/solv/repo.c
1178
lookup_idarray_solvable(Repo *repo, Offset off, Queue *q)
src/libs/libsolv/solv/repo.c
1190
repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q)
src/libs/libsolv/solv/repo.c
1239
repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker)
src/libs/libsolv/solv/repo.c
1536
repo_set_idarray_solvable(Repo *repo, Queue *q)
src/libs/libsolv/solv/repo.c
1546
repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker)
src/libs/libsolv/solv/repo.c
1553
Queue q2;
src/libs/libsolv/solv/repo.c
1611
repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q)
src/libs/libsolv/solv/repo.h
146
int repo_lookup_idarray(Repo *repo, Id entry, Id keyname, Queue *q);
src/libs/libsolv/solv/repo.h
147
int repo_lookup_deparray(Repo *repo, Id entry, Id keyname, Queue *q, Id marker);
src/libs/libsolv/solv/repo.h
159
void repo_set_idarray(Repo *repo, Id p, Id keyname, Queue *q);
src/libs/libsolv/solv/repo.h
160
void repo_set_deparray(Repo *repo, Id p, Id keyname, Queue *q, Id marker);
src/libs/libsolv/solv/repo_write.c
1025
repo_write_filtered(Repo *repo, FILE *fp, int (*keyfilter)(Repo *repo, Repokey *key, void *kfdata), void *kfdata, Queue *keyq)
src/libs/libsolv/solv/repo_write.c
1950
repodata_write_filtered(Repodata *data, FILE *fp, int (*keyfilter)(Repo *repo, Repokey *key, void *kfdata), void *kfdata, Queue *keyq)
src/libs/libsolv/solv/repo_write.h
26
extern int repo_write_filtered(Repo *repo, FILE *fp, int (*keyfilter)(Repo *repo, Repokey *key, void *kfdata), void *kfdata, Queue *keyq);
src/libs/libsolv/solv/repo_write.h
29
extern int repodata_write_filtered(Repodata *data , FILE *fp, int (*keyfilter)(Repo *repo, Repokey *key, void *kfdata), void *kfdata, Queue *keyq);
src/libs/libsolv/solv/repodata.c
2572
repodata_set_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
src/libs/libsolv/solv/repodata.c
745
repodata_lookup_idarray(Repodata *data, Id solvid, Id keyname, Queue *q)
src/libs/libsolv/solv/repodata.h
212
int repodata_lookup_idarray(Repodata *data, Id solvid, Id keyname, Queue *q);
src/libs/libsolv/solv/repodata.h
255
void repodata_set_idarray(Repodata *data, Id solvid, Id keyname, Queue *q);
src/libs/libsolv/solv/rules.c
1068
Queue badq, allowedarchs;
src/libs/libsolv/solv/rules.c
1197
solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
src/libs/libsolv/solv/rules.c
1288
Queue *job = &solv->job;
src/libs/libsolv/solv/rules.c
1474
add_obsoletes(Solver *solv, Id p, Queue *q)
src/libs/libsolv/solv/rules.c
1527
intersect_obsoletes(Solver *solv, Id p, Queue *q, int qstart, Map *m)
src/libs/libsolv/solv/rules.c
1582
jobtodisablelist(Solver *solv, Id how, Id what, Queue *q)
src/libs/libsolv/solv/rules.c
1775
Queue *job = &solv->job;
src/libs/libsolv/solv/rules.c
1777
Queue allq;
src/libs/libsolv/solv/rules.c
1829
Queue *job = &solv->job;
src/libs/libsolv/solv/rules.c
1831
Queue q, allq;
src/libs/libsolv/solv/rules.c
1930
Queue *job = &solv->job;
src/libs/libsolv/solv/rules.c
1932
Queue allq;
src/libs/libsolv/solv/rules.c
2067
solver_allruleinfos(Solver *solv, Id rid, Queue *rq)
src/libs/libsolv/solv/rules.c
2133
Queue rq;
src/libs/libsolv/solv/rules.c
2262
solver_ruleliterals(Solver *solv, Id rid, Queue *q)
src/libs/libsolv/solv/rules.c
2307
Queue q;
src/libs/libsolv/solv/rules.c
2332
queue_removeelement(Queue *q, Id el)
src/libs/libsolv/solv/rules.c
2353
Queue q, qi;
src/libs/libsolv/solv/rules.c
2611
prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
src/libs/libsolv/solv/rules.c
2629
prune_to_dup_packages(Solver *solv, Id p, Queue *q)
src/libs/libsolv/solv/rules.c
2648
Queue q, q2;
src/libs/libsolv/solv/rules.c
2650
Queue r2pkg;
src/libs/libsolv/solv/rules.c
2789
dep_pkgcheck(Solver *solv, Id dep, Map *m, Queue *q)
src/libs/libsolv/solv/rules.c
2817
check_xsupp(Solver *solv, Queue *depq, Id dep)
src/libs/libsolv/solv/rules.c
2859
queue_contains(Queue *q, Id id)
src/libs/libsolv/solv/rules.c
2896
Queue *job = &solv->job;
src/libs/libsolv/solv/rules.c
2905
Queue iq, iqcopy, xsuppq;
src/libs/libsolv/solv/rules.c
3438
Queue *edges;
src/libs/libsolv/solv/rules.c
3450
Queue *edges = trj->edges;
src/libs/libsolv/solv/rules.c
3493
solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered)
src/libs/libsolv/solv/rules.c
3512
Queue edges;
src/libs/libsolv/solv/rules.c
3594
Queue iq;
src/libs/libsolv/solv/rules.c
405
Queue q;
src/libs/libsolv/solv/rules.c
466
Queue workq;
src/libs/libsolv/solv/rules.c
831
Queue qs;
src/libs/libsolv/solv/rules.c
857
finddistupgradepackages(Solver *solv, Solvable *s, Queue *qs, int allow_all)
src/libs/libsolv/solv/rules.c
891
addduppackages(Solver *solv, Solvable *s, Queue *qs)
src/libs/libsolv/solv/rules.c
893
Queue dupqs;
src/libs/libsolv/solv/rules.c
925
Queue qs;
src/libs/libsolv/solv/rules.h
133
extern int solver_allruleinfos(struct _Solver *solv, Id rid, Queue *rq);
src/libs/libsolv/solv/rules.h
136
extern void solver_ruleliterals(struct _Solver *solv, Id rid, Queue *q);
src/libs/libsolv/solv/selection.c
120
selection_flatten(Pool *pool, Queue *selection)
src/libs/libsolv/solv/selection.c
122
Queue q;
src/libs/libsolv/solv/selection.c
155
selection_filter_rel(Pool *pool, Queue *selection, Id relflags, Id relevr)
src/libs/libsolv/solv/selection.c
166
Queue q;
src/libs/libsolv/solv/selection.c
230
selection_addsrc(Pool *pool, Queue *selection, int flags)
src/libs/libsolv/solv/selection.c
232
Queue q;
src/libs/libsolv/solv/selection.c
278
selection_depglob(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
41
selection_prune(Pool *pool, Queue *selection)
src/libs/libsolv/solv/selection.c
447
selection_depglob_arch(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
476
selection_filelist(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
479
Queue q;
src/libs/libsolv/solv/selection.c
516
selection_rel(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
578
selection_filter_evr(Pool *pool, Queue *selection, char *evr)
src/libs/libsolv/solv/selection.c
581
Queue q;
src/libs/libsolv/solv/selection.c
659
selection_canon(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
758
selection_make(Pool *pool, Queue *selection, const char *name, int flags)
src/libs/libsolv/solv/selection.c
780
selection_filter(Pool *pool, Queue *sel1, Queue *sel2)
src/libs/libsolv/solv/selection.c
784
Queue q1;
src/libs/libsolv/solv/selection.c
81
selection_solvables(Pool *pool, Queue *selection, Queue *pkgs)
src/libs/libsolv/solv/selection.c
890
selection_add(Pool *pool, Queue *sel1, Queue *sel2)
src/libs/libsolv/solv/selection.h
36
extern int selection_make(Pool *pool, Queue *selection, const char *name, int flags);
src/libs/libsolv/solv/selection.h
37
extern void selection_filter(Pool *pool, Queue *sel1, Queue *sel2);
src/libs/libsolv/solv/selection.h
38
extern void selection_add(Pool *pool, Queue *sel1, Queue *sel2);
src/libs/libsolv/solv/selection.h
39
extern void selection_solvables(Pool *pool, Queue *selection, Queue *pkgs);
src/libs/libsolv/solv/solvable.c
542
solvable_trivial_installable_queue(Solvable *s, Queue *installed, Map *multiversionmap)
src/libs/libsolv/solv/solvable.c
673
pool_create_state_maps(Pool *pool, Queue *installed, Map *installedmap, Map *conflictsmap)
src/libs/libsolv/solv/solvable.c
79
solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q)
src/libs/libsolv/solv/solvable.c
819
solvable_set_idarray(Solvable *s, Id keyname, Queue *q)
src/libs/libsolv/solv/solvable.c
825
solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
src/libs/libsolv/solv/solvable.c
90
solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker)
src/libs/libsolv/solv/solvable.h
64
int solvable_lookup_idarray(Solvable *s, Id keyname, Queue *q);
src/libs/libsolv/solv/solvable.h
65
int solvable_lookup_deparray(Solvable *s, Id keyname, Queue *q, Id marker);
src/libs/libsolv/solv/solvable.h
75
void solvable_set_idarray(Solvable *s, Id keyname, Queue *q);
src/libs/libsolv/solv/solvable.h
76
void solvable_set_deparray(Solvable *s, Id keyname, Queue *q, Id marker);
src/libs/libsolv/solv/solver.c
113
Queue *q;
src/libs/libsolv/solv/solver.c
1361
selectandinstall(Solver *solv, int level, Queue *dq, int disablerules, Id ruleid)
src/libs/libsolv/solv/solver.c
1652
solv->cleandeps_mistakes = solv_calloc(1, sizeof(Queue));
src/libs/libsolv/solv/solver.c
1666
prune_to_update_targets(Solver *solv, Id *cp, Queue *q)
src/libs/libsolv/solv/solver.c
1694
Queue dq; /* local decisionqueue */
src/libs/libsolv/solv/solver.c
1695
Queue dqs; /* local decisionqueue for supplements */
src/libs/libsolv/solv/solver.c
213
solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
src/libs/libsolv/solv/solver.c
2534
removedisabledconflicts(Solver *solv, Queue *removed)
src/libs/libsolv/solv/solver.c
2634
undo_removedisabledconflicts(Solver *solv, Queue *removed)
src/libs/libsolv/solv/solver.c
2669
solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap)
src/libs/libsolv/solv/solver.c
2702
solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap)
src/libs/libsolv/solv/solver.c
2724
solv->cleandeps_updatepkgs = solv_calloc(1, sizeof(Queue));
src/libs/libsolv/solv/solver.c
2739
solv->update_targets = solv_calloc(1, sizeof(Queue));
src/libs/libsolv/solv/solver.c
2809
Queue *update_targets = solv->update_targets;
src/libs/libsolv/solv/solver.c
2921
solver_solve(Solver *solv, Queue *job)
src/libs/libsolv/solv/solver.c
2930
Queue q;
src/libs/libsolv/solv/solver.c
3390
solv->installsuppdepq = solv_calloc(1, sizeof(Queue));
src/libs/libsolv/solv/solver.c
3649
void solver_get_orphaned(Solver *solv, Queue *orphanedq)
src/libs/libsolv/solv/solver.c
3655
void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected)
src/libs/libsolv/solv/solver.c
3658
Queue redoq, disabledq;
src/libs/libsolv/solv/solver.c
3910
solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res)
src/libs/libsolv/solv/solver.c
3939
solver_get_decisionqueue(Solver *solv, Queue *decisionq)
src/libs/libsolv/solv/solver.c
3958
solver_get_decisionblock(Solver *solv, int level, Queue *decisionq)
src/libs/libsolv/solv/solver.c
4061
solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq)
src/libs/libsolv/solv/solver.c
4163
pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what)
src/libs/libsolv/solv/solver.c
831
Queue r;
src/libs/libsolv/solv/solver.h
101
Queue ruletojob; /* index into job queue: jobs for which a rule exits */
src/libs/libsolv/solv/solver.h
104
Queue decisionq; /* >0:install, <0:remove/conflict */
src/libs/libsolv/solv/solver.h
105
Queue decisionq_why; /* index of rule, Offset into rules */
src/libs/libsolv/solv/solver.h
119
Queue learnt_why;
src/libs/libsolv/solv/solver.h
120
Queue learnt_pool;
src/libs/libsolv/solv/solver.h
122
Queue branches;
src/libs/libsolv/solv/solver.h
125
Queue problems; /* list of lists of conflicting rules, < 0 for job rules */
src/libs/libsolv/solv/solver.h
126
Queue solutions; /* refined problem storage space */
src/libs/libsolv/solv/solver.h
128
Queue orphaned; /* orphaned packages (to be removed?) */
src/libs/libsolv/solv/solver.h
175
Queue *ruleinfoq; /* tmp space for solver_ruleinfo() */
src/libs/libsolv/solv/solver.h
177
Queue *cleandeps_updatepkgs; /* packages we update in cleandeps mode */
src/libs/libsolv/solv/solver.h
178
Queue *cleandeps_mistakes; /* mistakes we made */
src/libs/libsolv/solv/solver.h
180
Queue *update_targets; /* update to specific packages */
src/libs/libsolv/solv/solver.h
182
Queue *installsuppdepq; /* deps from the install namespace provides hack */
src/libs/libsolv/solv/solver.h
184
Queue addedmap_deduceq; /* deduce addedmap from rpm rules */
src/libs/libsolv/solv/solver.h
278
extern int solver_solve(Solver *solv, Queue *job);
src/libs/libsolv/solv/solver.h
284
extern void solver_get_decisionqueue(Solver *solv, Queue *decisionq);
src/libs/libsolv/solv/solver.h
286
extern void solver_get_decisionblock(Solver *solv, int level, Queue *decisionq);
src/libs/libsolv/solv/solver.h
288
extern void solver_get_orphaned(Solver *solv, Queue *orphanedq);
src/libs/libsolv/solv/solver.h
289
extern void solver_get_recommendations(Solver *solv, Queue *recommendationsq, Queue *suggestionsq, int noselected);
src/libs/libsolv/solv/solver.h
290
extern void solver_get_unneeded(Solver *solv, Queue *unneededq, int filtered);
src/libs/libsolv/solv/solver.h
293
extern void solver_describe_weakdep_decision(Solver *solv, Id p, Queue *whyq);
src/libs/libsolv/solv/solver.h
296
extern void solver_calculate_multiversionmap(Pool *pool, Queue *job, Map *multiversionmap);
src/libs/libsolv/solv/solver.h
297
extern void solver_calculate_noobsmap(Pool *pool, Queue *job, Map *multiversionmap); /* obsolete */
src/libs/libsolv/solv/solver.h
305
void solver_trivial_installable(Solver *solv, Queue *pkgs, Queue *res);
src/libs/libsolv/solv/solver.h
307
void pool_job2solvables(Pool *pool, Queue *pkgs, Id how, Id what);
src/libs/libsolv/solv/solver.h
31
Queue job; /* copy of the job we're solving */
src/libs/libsolv/solv/solver.h
48
Queue ruleassertions; /* Queue of all assertion rules */
src/libs/libsolv/solv/solver.h
92
Queue weakruleq; /* index into 'rules' for weak ones */
src/libs/libsolv/solv/solverdebug.c
306
Queue iq;
src/libs/libsolv/solv/solverdebug.c
307
Queue recommendations;
src/libs/libsolv/solv/solverdebug.c
308
Queue suggestions;
src/libs/libsolv/solv/solverdebug.c
309
Queue orphaned;
src/libs/libsolv/solv/solverdebug.c
451
Queue classes, pkgs;
src/libs/libsolv/solv/solverdebug.c
624
Queue q;
src/libs/libsolv/solv/solverdebug.c
786
Queue in, out;
src/libs/libsolv/solv/solverdebug.c
947
pool_selection2str(Pool *pool, Queue *selection, Id flagmask)
src/libs/libsolv/solv/solverdebug.h
43
extern const char *pool_selection2str(Pool *pool, Queue *selection, Id flagmask);
src/libs/libsolv/solv/transaction.c
1065
Queue reqq;
src/libs/libsolv/solv/transaction.c
113
Queue *ti;
src/libs/libsolv/solv/transaction.c
1372
Queue obsq;
src/libs/libsolv/solv/transaction.c
1425
addcycleedges(struct orderdata *od, Id *cycle, Queue *todo)
src/libs/libsolv/solv/transaction.c
1549
Queue *tr = &trans->steps;
src/libs/libsolv/solv/transaction.c
1556
Queue todo, obsq, samerepoq, uninstq;
src/libs/libsolv/solv/transaction.c
1895
transaction_order_add_choices(Transaction *trans, Id chosen, Queue *choices)
src/libs/libsolv/solv/transaction.c
1947
Queue obsq, *steps;
src/libs/libsolv/solv/transaction.c
203
Queue oq, rq;
src/libs/libsolv/solv/transaction.c
403
transaction_classify(Transaction *trans, int mode, Queue *classes)
src/libs/libsolv/solv/transaction.c
497
transaction_classify_pkgs(Transaction *trans, int mode, Id class, Id from, Id to, Queue *pkgs)
src/libs/libsolv/solv/transaction.c
542
create_transaction_info(Transaction *trans, Queue *decisionq)
src/libs/libsolv/solv/transaction.c
545
Queue *ti = &trans->transaction_info;
src/libs/libsolv/solv/transaction.c
62
transaction_all_obs_pkgs(Transaction *trans, Id p, Queue *pkgs)
src/libs/libsolv/solv/transaction.c
637
transaction_create_decisionq(Pool *pool, Queue *decisionq, Map *multiversionmap)
src/libs/libsolv/solv/transaction.c
66
Queue *ti = &trans->transaction_info;
src/libs/libsolv/solv/transaction.c
697
transaction_installedresult(Transaction *trans, Queue *installedq)
src/libs/libsolv/solv/transaction.c
867
Queue cycles;
src/libs/libsolv/solv/transaction.c
868
Queue cyclesdata;
src/libs/libsolv/solv/transaction.c
937
Queue ti;
src/libs/libsolv/solv/transaction.c
957
Queue ti;
src/libs/libsolv/solv/transaction.c
993
Queue ti1, ti2;
src/libs/libsolv/solv/transaction.h
103
extern void transaction_classify(Transaction *trans, int mode, Queue *classes);
src/libs/libsolv/solv/transaction.h
104
extern void transaction_classify_pkgs(Transaction *trans, int mode, Id type, Id from, Id to, Queue *pkgs);
src/libs/libsolv/solv/transaction.h
109
extern int transaction_installedresult(Transaction *trans, Queue *installedq);
src/libs/libsolv/solv/transaction.h
121
extern int transaction_order_add_choices(Transaction *trans, Id chosen, Queue *choices);
src/libs/libsolv/solv/transaction.h
31
Queue steps; /* the transaction steps */
src/libs/libsolv/solv/transaction.h
34
Queue transaction_info;
src/libs/libsolv/solv/transaction.h
88
extern Transaction *transaction_create_decisionq(struct _Pool *pool, Queue *decisionq, Map *multiversionmap);
src/libs/libsolv/solv/transaction.h
96
extern void transaction_all_obs_pkgs(Transaction *trans, Id p, Queue *pkgs);
src/servers/media/NotificationManager.h
44
Queue fNotificationQueue;
src/servers/media/Queue.cpp
23
Queue::Queue()
src/servers/media/Queue.cpp
31
Queue::~Queue()
src/servers/media/Queue.cpp
39
Queue::Terminate()
src/servers/media/Queue.cpp
53
Queue::AddItem(void* item)
src/servers/media/Queue.cpp
69
Queue::RemoveItem()
src/servers/media/Queue.h
13
class Queue : BLocker {
src/servers/media/Queue.h
15
Queue();
src/servers/media/Queue.h
16
~Queue();
src/tests/kits/storage/MimeTypeTest.cpp
3435
BMessageQueue &queue = fApplication->Handler().Queue();
src/tests/kits/storage/QueryTest.cpp
1341
BMessageQueue &queue = fApplication->Handler().Queue();
src/tests/kits/storage/TestApp.h
15
BMessageQueue &Queue();
src/tests/kits/storage/VolumeTest.cpp
530
BMessageQueue &queue = handler.Queue();
src/tests/kits/storage/VolumeTest.cpp
619
CHK(fApplication->Handler().Queue().IsEmpty());
src/tests/kits/storage/VolumeTest.cpp
620
CHK(handler2->Queue().IsEmpty());