Home
last modified time | relevance | path

Searched refs:queue (Results 1 – 25 of 247) sorted by relevance

12345678910

/minix3/external/bsd/bind/dist/lib/isc/include/isc/
H A Dqueue.h56 #define ISC_QUEUE_INIT(queue, link) \ argument
58 (void) isc_mutex_init(&(queue).taillock); \
59 (void) isc_mutex_init(&(queue).headlock); \
60 (queue).tail = (queue).head = NULL; \
63 #define ISC_QUEUE_EMPTY(queue) ISC_TF((queue).head == NULL) argument
65 #define ISC_QUEUE_DESTROY(queue) \ argument
67 ISC_QLINK_INSIST(ISC_QUEUE_EMPTY(queue)); \
68 (void) isc_mutex_destroy(&(queue).taillock); \
69 (void) isc_mutex_destroy(&(queue).headlock); \
98 #define ISC_QUEUE_PUSH(queue, elt, link) \ argument
[all …]
/minix3/minix/lib/libmthread/
H A Dqueue.c8 void mthread_queue_add(queue, thread) in mthread_queue_add() argument
9 mthread_queue_t *queue; /* Queue we want thread to append to */ in mthread_queue_add()
23 if (mthread_queue_isempty(queue)) {
24 queue->mq_head = queue->mq_tail = last;
26 queue->mq_tail->m_next = last;
27 queue->mq_tail = last; /* 'last' is the new last in line */
35 void mthread_queue_init(queue) in mthread_queue_init() argument
36 mthread_queue_t *queue; /* Queue that has to be initialized */ in mthread_queue_init()
40 queue->mq_head = queue->mq_tail = NULL;
47 int mthread_queue_isempty(queue) in mthread_queue_isempty() argument
[all …]
H A Drwlock.c19 r = mthread_mutex_init(&rwlock->queue, NULL);
25 mthread_mutex_destroy(&rwlock->queue);
49 return mthread_mutex_destroy(&rwlock->queue);
64 r = mthread_mutex_lock(&rwlock->queue);
68 r = mthread_mutex_unlock(&rwlock->queue);
89 r = mthread_mutex_lock(&rwlock->queue);
119 r = mthread_mutex_unlock(&rwlock->queue);
H A Dproto.h58 void mthread_dump_queue(mthread_queue_t *queue);
60 void mthread_queue_init(mthread_queue_t *queue);
61 void mthread_queue_add(mthread_queue_t *queue, mthread_thread_t thread);
62 mthread_thread_t mthread_queue_remove(mthread_queue_t *queue);
63 int mthread_queue_isempty(mthread_queue_t *queue);
/minix3/external/bsd/bind/dist/lib/isc/tests/
H A Dqueue_test.c59 item_queue_t queue; in ATF_TC_BODY() local
65 ISC_QUEUE_INIT(queue, qlink); in ATF_TC_BODY()
76 ATF_CHECK(ISC_QUEUE_EMPTY(queue)); in ATF_TC_BODY()
78 ISC_QUEUE_POP(queue, qlink, p); in ATF_TC_BODY()
82 ISC_QUEUE_PUSH(queue, &one, qlink); in ATF_TC_BODY()
85 ATF_CHECK(! ISC_QUEUE_EMPTY(queue)); in ATF_TC_BODY()
87 ISC_QUEUE_POP(queue, qlink, p); in ATF_TC_BODY()
90 ATF_CHECK(ISC_QUEUE_EMPTY(queue)); in ATF_TC_BODY()
93 ISC_QUEUE_PUSH(queue, p, qlink); in ATF_TC_BODY()
94 ATF_CHECK(! ISC_QUEUE_EMPTY(queue)); in ATF_TC_BODY()
[all …]
/minix3/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/queue/queue.defn/
H A Dtypes.pass.cpp31 : private std::queue<int>
49 static_assert((std::is_same<std::queue<int>::container_type, std::deque<int> >::value), ""); in main()
50 …static_assert((std::is_same<std::queue<double, std::vector<int> >::container_type, std::vector<int… in main()
51 … static_assert((std::is_same<std::queue<double, std::vector<int> >::value_type, int>::value), ""); in main()
52 … static_assert((std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), ""); in main()
53 …static_assert((std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::v… in main()
54 … static_assert((std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
55 static_assert((std::uses_allocator<std::queue<int>, std::allocator<int> >::value), ""); in main()
56 static_assert((!std::uses_allocator<std::queue<int, C>, std::allocator<int> >::value), ""); in main()
H A Dswap.pass.cpp29 std::queue<int> q1 = make<std::queue<int> >(5); in main()
30 std::queue<int> q2 = make<std::queue<int> >(10); in main()
31 std::queue<int> q1_save = q1; in main()
32 std::queue<int> q2_save = q2; in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/container.adaptors/queue/queue.defn/
H A Dtypes.pass.cpp31 : private std::queue<int>
49 static_assert((std::is_same<std::queue<int>::container_type, std::deque<int> >::value), ""); in main()
50 …static_assert((std::is_same<std::queue<double, std::vector<int> >::container_type, std::vector<int… in main()
51 … static_assert((std::is_same<std::queue<double, std::vector<int> >::value_type, int>::value), ""); in main()
52 … static_assert((std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), ""); in main()
53 …static_assert((std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::v… in main()
54 … static_assert((std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
55 static_assert((std::uses_allocator<std::queue<int>, std::allocator<int> >::value), ""); in main()
56 static_assert((!std::uses_allocator<std::queue<int, C>, std::allocator<int> >::value), ""); in main()
H A Dswap.pass.cpp29 std::queue<int> q1 = make<std::queue<int> >(5); in main()
30 std::queue<int> q2 = make<std::queue<int> >(10); in main()
31 std::queue<int> q1_save = q1; in main()
32 std::queue<int> q2_save = q2; in main()
/minix3/external/bsd/libc++/dist/libcxx/include/
H A Dqueue2 //===--------------------------- queue ------------------------------------===//
15 queue synopsis
21 class queue
34 queue() = default;
35 ~queue() = default;
37 queue(const queue& q) = default;
38 queue(queue&& q) = default;
40 queue& operator=(const queue& q) = default;
41 queue& operator=(queue&& q) = default;
43 explicit queue(const container_type& c);
[all …]
/minix3/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/queue/queue.special/
H A Dswap.pass.cpp30 std::queue<int> q1 = make<std::queue<int> >(5); in main()
31 std::queue<int> q2 = make<std::queue<int> >(10); in main()
32 std::queue<int> q1_save = q1; in main()
33 std::queue<int> q2_save = q2; in main()
/minix3/external/bsd/libc++/dist/libcxx/test/containers/container.adaptors/queue/queue.ops/
H A Deq.pass.cpp33 std::queue<int> q1 = make<std::queue<int> >(5); in main()
34 std::queue<int> q2 = make<std::queue<int> >(10); in main()
35 std::queue<int> q1_save = q1; in main()
36 std::queue<int> q2_save = q2; in main()
H A Dlt.pass.cpp39 std::queue<int> q1 = make<std::queue<int> >(5); in main()
40 std::queue<int> q2 = make<std::queue<int> >(10); in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/container.adaptors/queue/queue.special/
H A Dswap.pass.cpp30 std::queue<int> q1 = make<std::queue<int> >(5); in main()
31 std::queue<int> q2 = make<std::queue<int> >(10); in main()
32 std::queue<int> q1_save = q1; in main()
33 std::queue<int> q2_save = q2; in main()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/container.adaptors/queue/queue.ops/
H A Deq.pass.cpp33 std::queue<int> q1 = make<std::queue<int> >(5); in main()
34 std::queue<int> q2 = make<std::queue<int> >(10); in main()
35 std::queue<int> q1_save = q1; in main()
36 std::queue<int> q2_save = q2; in main()
H A Dlt.pass.cpp39 std::queue<int> q1 = make<std::queue<int> >(5); in main()
40 std::queue<int> q2 = make<std::queue<int> >(10); in main()
/minix3/minix/lib/libblockdriver/
H A Dmq.c25 static STAILQ_HEAD(queue, mq_cell) queue[MAX_DEVICES]; in STAILQ_HEAD() argument
40 STAILQ_INIT(&queue[i]);
68 STAILQ_INSERT_TAIL(&queue[device_id], cell, next); in mq_enqueue()
83 return STAILQ_EMPTY(&queue[device_id]); in mq_isempty()
99 cell = STAILQ_FIRST(&queue[device_id]); in mq_dequeue()
100 STAILQ_REMOVE_HEAD(&queue[device_id], next); in mq_dequeue()
/minix3/external/bsd/libc++/dist/libcxx/test/std/containers/sequences/deque/deque.modifiers/
H A Derase_iter_iter.invalidation.pass.cpp65 std::deque<int> queue; in main() local
67 queue.push_back(i); in main()
69 while (queue.size() > 1) in main()
71 for (size_t i = 1; i < queue.size(); ++i) in main()
73 del_at_start(queue, i); in main()
74 del_at_end (queue, i); in main()
76 queue.pop_back(); in main()
H A Dpop_back.invalidation.pass.cpp40 std::deque<int> queue; in main() local
42 queue.push_back(i); in main()
44 while (queue.size() > 1) in main()
46 test(queue); in main()
47 queue.pop_back(); in main()
H A Dpop_front.invalidation.pass.cpp40 std::deque<int> queue; in main() local
42 queue.push_back(i); in main()
44 while (queue.size() > 1) in main()
46 test(queue); in main()
47 queue.pop_back(); in main()
H A Derase_iter.invalidation.pass.cpp60 std::deque<int> queue; in main() local
62 queue.push_back(i); in main()
64 while (queue.size() > 1) in main()
66 del_at_start(queue); in main()
67 del_at_end(queue); in main()
68 queue.pop_back(); in main()
/minix3/minix/drivers/net/dpeth/
H A D8390.c217 unsigned int queue; in ns_send() local
219 queue = dep->de_sendq_head; in ns_send()
220 if (dep->de_sendq[queue].sq_filled) in ns_send()
223 (dep->de_user2nicf)(dep, dep->de_sendq[queue].sq_sendpage, data, size); in ns_send()
225 dep->de_sendq[queue].sq_filled = TRUE; in ns_send()
227 if (dep->de_sendq_tail == queue) { /* there it goes.. */ in ns_send()
228 ns_start_xmit(dep, size, dep->de_sendq[queue].sq_sendpage); in ns_send()
230 dep->de_sendq[queue].sq_size = size; in ns_send()
232 if (++queue == dep->de_sendq_nr) queue = 0; in ns_send()
233 dep->de_sendq_head = queue; in ns_send()
[all …]
/minix3/external/bsd/llvm/dist/llvm/utils/lit/lit/
H A Drun.py6 import Queue as queue namespace
8 import queue
51 self.queue = queue_impl()
53 self.queue.put(i)
55 self.queue.put(None)
66 return self.queue.get()
116 self.queue = multiprocessing.Queue()
121 self.queue.put((test_index, test.result))
126 self.queue.put(None)
135 item = self.queue.get()
[all …]
/minix3/sys/ufs/chfs/
H A Dchfs_nodeops.c348 TAILQ_FOREACH_SAFE(eb, &chmp->chm_free_queue, queue, tmpeb) { in chfs_mark_node_obsolete()
350 TAILQ_REMOVE(&chmp->chm_free_queue, cheb, queue); in chfs_mark_node_obsolete()
356 TAILQ_FOREACH_SAFE(eb, &chmp->chm_dirty_queue, queue, tmpeb) { in chfs_mark_node_obsolete()
358 TAILQ_REMOVE(&chmp->chm_dirty_queue, cheb, queue); in chfs_mark_node_obsolete()
365 TAILQ_FOREACH_SAFE(eb, &chmp->chm_very_dirty_queue, queue, tmpeb) { in chfs_mark_node_obsolete()
367 TAILQ_REMOVE(&chmp->chm_very_dirty_queue, cheb, queue); in chfs_mark_node_obsolete()
374 TAILQ_FOREACH_SAFE(eb, &chmp->chm_clean_queue, queue, tmpeb) { in chfs_mark_node_obsolete()
376 TAILQ_REMOVE(&chmp->chm_clean_queue, cheb, queue); in chfs_mark_node_obsolete()
386 cheb, queue); in chfs_mark_node_obsolete()
389 cheb, queue); in chfs_mark_node_obsolete()
[all …]
/minix3/crypto/external/bsd/openssl/dist/doc/crypto/
H A DERR_remove_state.pod5 ERR_remove_state - free a thread's error queue
15 ERR_remove_state() frees the error queue associated with thread B<pid>.
16 If B<pid> == 0, the current thread will have its error queue removed.
18 Since error queue data structures are allocated automatically for new

12345678910