Home
last modified time | relevance | path

Searched full:queue (Results 1 – 25 of 2747) sorted by relevance

12345678910>>...110

/openbsd-src/gnu/usr.bin/perl/dist/Thread-Queue/lib/Thread/
H A DQueue.pm1 package Thread::Queue;
15 # Create a new queue possibly pre-populated with items
19 my @queue :shared = map { shared_clone($_) } @_;
20 my %self :shared = ( 'queue' => \@queue );
24 # Add items to the tail of a queue
32 Carp::croak("'enqueue' method called on queue that has been 'end'ed");
35 # Block if queue size exceeds any specified limit
36 my $queue = $$self{'queue'};
37 cond_wait(%$self) while ($$self{'LIMIT'} && (@$queue >= $$self{'LIMIT'}));
39 # Add items to queue, and then signal other threads
[all …]
/openbsd-src/share/man/man9/
H A Dmq_init.936 .Nd mbuf queue API
70 The mbuf queue API provides implementations of data structures and operations
84 Insertion of a new mbuf at the end of the queue.
86 Removal of an mbuf from the head of the queue.
88 Reinsertion of an mbuf at the head of the queue.
90 Removal of the entire chain of mbufs on the queue.
92 Insertion of the mbufs in an mbuf_list at the end of the queue.
94 Removal of all the mbufs on the queue as an mbuf_list.
98 Initialises the mbuf queue structure
102 The highest interrupt priority level the queue will be operated at is
[all …]
H A Difq_enqueue.932 .Nd interface send queue API
59 operations for the network stack to queue mbufs for a network driver
67 interface send queue.
68 If the queue rejects the packet, it will be freed with
74 interface send queue.
76 Free all the mbufs on the interface send queue
80 Return the number of mbufs on the interface send queue
84 may report that mbufs are on the queue, the current queue
90 Return if the interface send queue
95 send queue
[all …]
/openbsd-src/gnu/llvm/lldb/include/lldb/Target/
H A DQueue.h1 //===-- Queue.h ------------------------------------------------*- C++ -*-===//
22 // Queue:
23 // This class represents a libdispatch aka Grand Central Dispatch queue in the
28 // pthreads to execute the work items for the queues. A serial queue will be
30 // any work). A concurrent queue may be associated with multiple threads.
32 class Queue : public std::enable_shared_from_this<Queue> {
34 Queue(lldb::ProcessSP process_sp, lldb::queue_id_t queue_id,
37 ~Queue();
39 /// Get the QueueID for this Queue
41 /// A 64-bit ID number that uniquely identifies a queue at this particular
[all …]
H A DQueueList.h22 // This is the container for libdispatch aka Grand Central Dispatch Queue
42 /// Get the Queue at a given index number
45 /// The index number (0-based) of the queue.
47 /// The Queue at that index number.
65 /// Add a Queue to the QueueList
67 /// \param [in] queue
69 void AddQueue(lldb::QueueSP queue);
71 /// Find a queue in the QueueList by QueueID
77 /// A QueueSP to the queue requested, if it is present in the QueueList.
78 /// An empty QueueSP will be returned if this queue was not found.
[all …]
/openbsd-src/sys/dev/pci/drm/amd/amdkfd/
H A Dkfd_queue.c33 pr_debug("Printing queue properties:\n"); in print_queue_properties()
34 pr_debug("Queue Type: %u\n", q->type); in print_queue_properties()
35 pr_debug("Queue Size: %llu\n", q->queue_size); in print_queue_properties()
36 pr_debug("Queue percent: %u\n", q->queue_percent); in print_queue_properties()
37 pr_debug("Queue Address: 0x%llX\n", q->queue_address); in print_queue_properties()
38 pr_debug("Queue Id: %u\n", q->queue_id); in print_queue_properties()
39 pr_debug("Queue Process Vmid: %u\n", q->vmid); in print_queue_properties()
40 pr_debug("Queue Read Pointer: 0x%px\n", q->read_ptr); in print_queue_properties()
41 pr_debug("Queue Write Pointer: 0x%px\n", q->write_ptr); in print_queue_properties()
42 pr_debug("Queue Doorbell Pointer: 0x%p\n", q->doorbell_ptr); in print_queue_properties()
[all …]
H A Dkfd_kernel_queue.c38 /* Initialize a kernel queue, including allocations of GART memory
39 * needed for the queue.
51 pr_debug("Initializing queue type %d size %d\n", KFD_QUEUE_TYPE_HIQ, in kq_initialize()
71 pr_err("Invalid queue type %d\n", type); in kq_initialize()
141 if (init_queue(&kq->queue, &prop) != 0) in kq_initialize()
144 kq->queue->device = dev; in kq_initialize()
145 kq->queue->process = kfd_get_process(current); in kq_initialize()
147 kq->queue->mqd_mem_obj = kq->mqd_mgr->allocate_mqd(kq->mqd_mgr->dev, in kq_initialize()
148 &kq->queue->properties); in kq_initialize()
149 if (!kq->queue in kq_initialize()
[all...]
/openbsd-src/share/man/man3/
H A Dqueue.31 .\" $OpenBSD: queue.3,v 1.70 2022/03/29 18:15:52 naddy Exp $
2 .\" $NetBSD: queue.3,v 1.4 1995/07/03 00:25:36 mycroft Exp $
31 .\" @(#)queue.3 8.1 (Berkeley) 12/13/93
274 and few or no removals, or for implementing a LIFO queue.
296 large datasets and few or no removals, or for implementing a FIFO queue.
664 A simple queue is headed by a structure defined by the
668 simple queue and the other to the last element in the simple queue.
670 New elements can be added to the queue after an existing element,
671 at the head of the queue or at the tail of the queue.
683 is the type of the elements to be linked into the queue.
[all …]
/openbsd-src/sys/dev/pci/drm/include/drm/
H A Dspsc_queue.h30 /** SPSC lockless queue */
48 static inline void spsc_queue_init(struct spsc_queue *queue) in spsc_queue_init() argument
50 queue->head = NULL; in spsc_queue_init()
51 atomic_long_set(&queue->tail, (long)&queue->head); in spsc_queue_init()
52 atomic_set(&queue->job_count, 0); in spsc_queue_init()
55 static inline struct spsc_node *spsc_queue_peek(struct spsc_queue *queue) in spsc_queue_peek() argument
57 return queue->head; in spsc_queue_peek()
60 static inline int spsc_queue_count(struct spsc_queue *queue) in spsc_queue_count() argument
62 return atomic_read(&queue->job_count); in spsc_queue_count()
65 static inline bool spsc_queue_push(struct spsc_queue *queue, struct spsc_node *node) in spsc_queue_push() argument
[all …]
/openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dstl_queue.h1 // Queue implementation -*- C++ -*-
71 class queue; variable
74 inline bool operator==(const queue<_Tp,_Seq>&, const queue<_Tp,_Seq>&);
77 inline bool operator<(const queue<_Tp,_Seq>&, const queue<_Tp,_Seq>&);
93 * wrapper is what enforces strict first-in-first-out %queue behavior.
102 * @c pop, which are standard %queue/FIFO operations.
105 class queue
115 friend bool operator== (const queue<_Tp1, _Seq1>&,
116 const queue<_Tp1, _Seq1>&);
118 friend bool operator< (const queue<_Tp1, _Seq1>&,
[all …]
/openbsd-src/gnu/llvm/libcxx/include/
H A Dqueue14 queue synopsis
20 class queue
33 queue() = default;
34 ~queue() = default;
36 queue(const queue& q) = default;
37 queue(queue&& q) = default;
39 queue& operator=(const queue& q) = default;
40 queue& operator=(queue&& q) = default;
42 explicit queue(const container_type& c);
43 explicit queue(container_type&& c)
[all …]
/openbsd-src/gnu/llvm/lldb/source/Target/
H A DQueue.cpp1 //===-- Queue.cpp ---------------------------------------------------------===//
9 #include "lldb/Target/Queue.h"
18 Queue::Queue(ProcessSP process_sp, lldb::queue_id_t queue_id, in Queue() function in Queue
30 Queue::~Queue() = default;
32 queue_id_t Queue::GetID() { return m_queue_id; } in GetID()
34 const char *Queue::GetName() { in GetName()
38 uint32_t Queue::GetIndexID() { return m_queue_id; } in GetIndexID()
40 std::vector<lldb::ThreadSP> Queue::GetThreads() { in GetThreads()
53 void Queue::SetNumRunningWorkItems(uint32_t count) { in SetNumRunningWorkItems()
57 uint32_t Queue::GetNumRunningWorkItems() const { in GetNumRunningWorkItems()
[all …]
/openbsd-src/regress/sbin/pfctl/
H A Dpf68.loaded3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf17.optimized3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf17.loaded3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf4.loaded3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf47.optimized3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf47.loaded3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf68.optimized3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
H A Dpf81.loaded3 [ queue: qname= qid=0 pqname= pqid=0 ]
7 [ queue: qname= qid=0 pqname= pqid=0 ]
11 [ queue: qname= qid=0 pqname= pqid=0 ]
15 [ queue: qname= qid=0 pqname= pqid=0 ]
19 [ queue: qname= qid=0 pqname= pqid=0 ]
23 [ queue: qname= qid=0 pqname= pqid=0 ]
27 [ queue: qname= qid=0 pqname= pqid=0 ]
31 [ queue: qname= qid=0 pqname= pqid=0 ]
35 [ queue: qname= qid=0 pqname= pqid=0 ]
39 [ queue: qname= qid=0 pqname= pqid=0 ]
[all …]
/openbsd-src/gnu/usr.bin/perl/dist/Thread-Queue/t/
H A D11_limit.t18 use Thread::Queue;
24 my $q = Thread::Queue->new();
25 my $rpt = Thread::Queue->new();
28 # (1) Set queue limit, and report it
32 # (3) Fetch an item from queue
35 # Report queue count
46 is_deeply(\@items, [4, 3, 4, 3, 'go'], 'Queue reports');
49 # (2) Read queue limit from thread
51 is($item, $q->limit, 'Queue limit set');
55 # (5) Read queue count
[all …]
H A D06_insert.t13 use Thread::Queue;
25 my $q = Thread::Queue->new(1..10);
26 ok($q, 'New queue');
39 $q = Thread::Queue->new(1..10);
40 ok($q, 'New queue');
51 $q = Thread::Queue->new(1..10);
52 ok($q, 'New queue');
63 $q = Thread::Queue->new(1..10);
64 ok($q, 'New queue');
75 $q = Thread::Queue->new();
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/bits/
H A Dstl_queue.h1 // Queue implementation -*- C++ -*-
83 * wrapper is what enforces strict first-in-first-out %queue behavior. in _GLIBCXX_BEGIN_NAMESPACE()
92 * @c pop, which are standard %queue/FIFO operations. in _GLIBCXX_BEGIN_NAMESPACE()
95 class queue in _GLIBCXX_BEGIN_NAMESPACE()
106 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); in _GLIBCXX_BEGIN_NAMESPACE()
110 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&); in _GLIBCXX_BEGIN_NAMESPACE()
135 queue(const _Sequence& __c = _Sequence()) : c(__c) {} in _GLIBCXX_BEGIN_NAMESPACE()
138 * Returns true if the %queue is empty. in _GLIBCXX_BEGIN_NAMESPACE()
144 /** Returns the number of elements in the %queue. */ in _GLIBCXX_BEGIN_NAMESPACE()
151 * element of the %queue. in _GLIBCXX_BEGIN_NAMESPACE()
[all …]
/openbsd-src/usr.sbin/smtpd/
H A Dqueue_ram.c48 log_warn("warn: queue-ram: message not found"); in get_message()
60 log_warn("warn: queue-ram: calloc"); in queue_ram_message_create()
84 log_warnx("warn: queue-ram: msgid not found"); in queue_ram_message_commit()
90 log_warn("warn: queue-ram: fopen: %s", path); in queue_ram_message_commit()
94 log_warn("warn: queue-ram: fstat"); in queue_ram_message_commit()
102 log_warn("warn: queue-ram: malloc"); in queue_ram_message_commit()
110 log_warn("warn: queue-ram: fread"); in queue_ram_message_commit()
112 log_warnx("warn: queue-ram: bad read"); in queue_ram_message_commit()
115 stat_increment("queue.ram.message.size", msg->len); in queue_ram_message_commit()
130 log_warnx("warn: queue-ram: not found"); in queue_ram_message_delete()
[all …]
/openbsd-src/gnu/usr.bin/perl/cpan/CPAN/lib/CPAN/
H A DQueue.pm3 package CPAN::Queue::Item;
5 # CPAN::Queue::Item::new ;
28 package CPAN::Queue;
30 # One use of the queue is to determine if we should or shouldn't
39 # CPAN::Queue is the package where the queue is maintained. Dependencies
40 # often have high priority and must be brought to the head of the queue,
41 # possibly by jumping the queue if they are already there. My first code
43 # immediate treatment, I either unshifted it to the front of the queue,
44 # or, if it was already in the queue, I spliced and let it bypass the
46 # an item more than once into the queue. Why would you need that? Well,
[all …]

12345678910>>...110