/macosx-10.10/postfix-255/postfix/src/oqmgr/ |
H A D | qmgr_queue.c | 16 /* void qmgr_queue_done(queue) 17 /* QMGR_QUEUE *queue; 26 /* void qmgr_queue_throttle(queue, dsn) 27 /* QMGR_QUEUE *queue; 30 /* void qmgr_queue_unthrottle(queue) 31 /* QMGR_QUEUE *queue; 33 /* void qmgr_queue_suspend(queue, delay) 34 /* QMGR_QUEUE *queue; 38 /* Each queue corresponds to a specific transport and destination. 39 /* Each queue ha 132 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local 160 qmgr_queue_suspend(QMGR_QUEUE *queue, int delay) argument 184 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local 198 qmgr_queue_unthrottle(QMGR_QUEUE *queue) argument 278 qmgr_queue_throttle(QMGR_QUEUE *queue, DSN *dsn) argument 355 QMGR_QUEUE *queue; local 374 qmgr_queue_done(QMGR_QUEUE *queue) argument 410 QMGR_QUEUE *queue; local [all...] |
H A D | qmgr_enable.c | 9 /* void qmgr_enable_queue(queue) 10 /* QMGR_QUEUE *queue; 79 QMGR_QUEUE *queue; local 90 for (queue = transport->queue_list.next; queue; queue = next) { 91 next = queue->peers.next; 92 qmgr_enable_queue(queue); 96 /* qmgr_enable_queue - enable and possibly delete queue */ 98 void qmgr_enable_queue(QMGR_QUEUE *queue) argument [all...] |
H A D | qmgr_entry.c | 5 /* per-site queue entries 9 /* QMGR_ENTRY *qmgr_entry_create(queue, message) 10 /* QMGR_QUEUE *queue; 17 /* QMGR_ENTRY *qmgr_entry_select(queue) 18 /* QMGR_QUEUE *queue; 20 /* void qmgr_entry_unselect(queue, entry) 21 /* QMGR_QUEUE *queue; 31 /* qmgr_entry_create() creates an entry for the named queue and 32 /* message, and appends the entry to the queue's todo list. 36 /* qmgr_entry_done() discards a per-site queue entr 102 qmgr_entry_select(QMGR_QUEUE *queue) argument 170 qmgr_entry_unselect(QMGR_QUEUE *queue, QMGR_ENTRY *entry) argument 215 QMGR_QUEUE *queue = entry->queue; local 304 qmgr_entry_create(QMGR_QUEUE *queue, QMGR_MESSAGE *message) argument [all...] |
/macosx-10.10/postfix-255/postfix/src/qmgr/ |
H A D | qmgr_queue.c | 16 /* void qmgr_queue_done(queue) 17 /* QMGR_QUEUE *queue; 23 /* void qmgr_queue_throttle(queue, dsn) 24 /* QMGR_QUEUE *queue; 27 /* void qmgr_queue_unthrottle(queue) 28 /* QMGR_QUEUE *queue; 30 /* void qmgr_queue_suspend(queue, delay) 31 /* QMGR_QUEUE *queue; 35 /* Each queue corresponds to a specific transport and destination. 36 /* Each queue ha 138 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local 177 qmgr_queue_suspend(QMGR_QUEUE *queue, int delay) argument 201 QMGR_QUEUE *queue = (QMGR_QUEUE *) context; local 215 qmgr_queue_unthrottle(QMGR_QUEUE *queue) argument 295 qmgr_queue_throttle(QMGR_QUEUE *queue, DSN *dsn) argument 370 qmgr_queue_done(QMGR_QUEUE *queue) argument 406 QMGR_QUEUE *queue; local [all...] |
H A D | qmgr_enable.c | 9 /* void qmgr_enable_queue(queue) 10 /* QMGR_QUEUE *queue; 79 QMGR_QUEUE *queue; local 90 for (queue = transport->queue_list.next; queue; queue = next) { 91 next = queue->peers.next; 92 qmgr_enable_queue(queue); 96 /* qmgr_enable_queue - enable and possibly delete queue */ 98 void qmgr_enable_queue(QMGR_QUEUE *queue) argument [all...] |
H A D | qmgr_peer.c | 9 /* QMGR_PEER *qmgr_peer_create(job, queue) 11 /* QMGR_QUEUE *queue; 13 /* QMGR_PEER *qmgr_peer_find(job, queue) 15 /* QMGR_QUEUE *queue; 17 /* QMGR_PEER *qmgr_peer_obtain(job, queue) 19 /* QMGR_QUEUE *queue; 30 /* It is similar to per-transport queue structure, but groups 78 QMGR_PEER *qmgr_peer_create(QMGR_JOB *job, QMGR_QUEUE *queue) argument 83 peer->queue = queue; 98 QMGR_QUEUE *queue = peer->queue; local 115 qmgr_peer_find(QMGR_JOB *job, QMGR_QUEUE *queue) argument 122 qmgr_peer_obtain(QMGR_JOB *job, QMGR_QUEUE *queue) argument 136 QMGR_QUEUE *queue; local [all...] |
H A D | qmgr_entry.c | 5 /* per-site queue entries 17 /* QMGR_ENTRY *qmgr_entry_select(queue) 18 /* QMGR_QUEUE *queue; 20 /* void qmgr_entry_unselect(queue, entry) 21 /* QMGR_QUEUE *queue; 32 /* and appends the entry to the peer's list and its queue's todo list. 36 /* qmgr_entry_done() discards a per-site queue entry. The 38 /* of the site's `busy' list (i.e. queue entries that have been 40 /* of the site's `todo' list (i.e. queue entries awaiting selection 46 /* qmgr_entry_done() triggers cleanup of the per-site queue whe 114 QMGR_QUEUE *queue; local 185 QMGR_QUEUE *queue = entry->queue; local 252 QMGR_QUEUE *queue = entry->queue; local 363 QMGR_QUEUE *queue = peer->queue; local [all...] |
/macosx-10.10/apr-32/apr-util/apr-util/misc/ |
H A D | apr_queue.c | 48 unsigned int bounds;/**< max size of queue */ 73 #define apr_queue_full(queue) ((queue)->nelts == (queue)->bounds) 79 #define apr_queue_empty(queue) ((queue)->nelts == 0) 87 apr_queue_t *queue = data; local 91 apr_thread_cond_destroy(queue->not_empty); 92 apr_thread_cond_destroy(queue->not_full); 93 apr_thread_mutex_destroy(queue 106 apr_queue_t *queue; local 251 apr_queue_size(apr_queue_t *queue) argument [all...] |
/macosx-10.10/libstdcxx-104.1/include/c++/4.2.1/backward/ |
H A D | queue.h | 32 #include <queue> 34 using std::queue;
|
/macosx-10.10/xnu-2782.1.97/bsd/man/man3/ |
H A D | Makefile | 10 queue.3 \ 25 queue.3 CIRCLEQ_ENTRY.3 \ 26 queue.3 CIRCLEQ_HEAD.3 \ 27 queue.3 CIRCLEQ_INIT.3 \ 28 queue.3 CIRCLEQ_INSERT_AFTER.3 \ 29 queue.3 CIRCLEQ_INSERT_BEFORE.3 \ 30 queue.3 CIRCLEQ_INSERT_HEAD.3 \ 31 queue.3 CIRCLEQ_INSERT_TAIL.3 \ 32 queue.3 CIRCLEQ_REMOVE.3 \ 33 queue [all...] |
/macosx-10.10/IOKitUser-1050.1.21/hid.subproj/ |
H A D | IOHIDQueue.c | 90 IOHIDQueueRef queue = NULL; local 96 queue = (IOHIDQueueRef)_CFRuntimeCreateInstance(allocator, IOHIDQueueGetTypeID(), size, NULL); 98 if (!queue) 101 offset = queue; 104 return queue; 112 IOHIDQueueRef queue = (IOHIDQueueRef)object; local 114 if ( queue->elements ) { 115 CFRelease(queue->elements); 116 queue->elements = NULL; 119 if ( queue 143 IOHIDQueueRef queue = (IOHIDQueueRef)context; local 179 IOHIDQueueRef queue = NULL; local 217 IOHIDQueueGetDevice( IOHIDQueueRef queue) argument 227 IOHIDQueueGetDepth( IOHIDQueueRef queue) argument 239 IOHIDQueueSetDepth( IOHIDQueueRef queue, CFIndex depth) argument 249 IOHIDQueueAddElement( IOHIDQueueRef queue, IOHIDElementRef element) argument 265 IOHIDQueueRemoveElement( IOHIDQueueRef queue, IOHIDElementRef element) argument 278 IOHIDQueueContainsElement( IOHIDQueueRef queue, IOHIDElementRef element) argument 296 IOHIDQueueStart( IOHIDQueueRef queue) argument 304 IOHIDQueueStop( IOHIDQueueRef queue) argument 312 IOHIDQueueScheduleWithRunLoop( IOHIDQueueRef queue, CFRunLoopRef runLoop, CFStringRef runLoopMode) argument 345 IOHIDQueueUnscheduleFromRunLoop( IOHIDQueueRef queue, CFRunLoopRef runLoop, CFStringRef runLoopMode) argument 369 IOHIDQueueRegisterValueAvailableCallback( IOHIDQueueRef queue, IOHIDCallback callback, void * context) argument 396 IOHIDQueueCopyNextValue( IOHIDQueueRef queue) argument 405 IOHIDQueueCopyNextValueWithTimeout( IOHIDQueueRef queue, CFTimeInterval timeout) argument 423 _IOHIDQueueCopyElements(IOHIDQueueRef queue) argument [all...] |
H A D | IOHIDQueue.h | 32 IOHIDQueue defines an object used to queue values from input parsed items 46 placed on a queue if there is a change in value. 81 @param depth The number of values that can be handled by the queue. 95 @abstract Obtain the device associated with the queue. 96 @param queue IOHIDQueue to be queried. 101 IOHIDQueueRef queue) 107 @abstract Obtain the depth of the queue. 108 @param queue IOHIDQueue to be queried. 109 @result Returns the queue depth. 113 IOHIDQueueRef queue) [all...] |
/macosx-10.10/swig-12/Lib/ruby/ |
H A D | std_queue.i | 9 struct traits_asptr<std::queue<T> > { 10 static int asptr(VALUE obj, std::queue<T> **vec) { 11 return traits_asptr_stdseq<std::queue<T> >::asptr(obj, vec); 16 struct traits_from<std::queue<T> > { 17 static VALUE from(const std::queue<T> & vec) { 18 return traits_from_stdseq<std::queue<T> >::from(vec); 24 %rename("delete") std::queue::__delete__; 25 %rename("reject!") std::queue::reject_bang; 26 %rename("map!") std::queue::map_bang; 27 %rename("empty?") std::queue [all...] |
/macosx-10.10/ntp-92/include/ |
H A D | ntp_data_structures.h | 17 /* Structures for storing a priority queue 33 } queue; typedef in typeref:struct:Queue 39 queue *create_priority_queue(int (*get_order)(void *, void *)); 40 void destroy_queue(queue *my_queue); 44 int empty(queue *my_queue); 45 void *queue_head(queue *my_queue); 46 queue *enqueue(queue *my_queue, void *my_node); 47 void *dequeue(queue *my_queue); 48 int get_no_of_elements(queue *my_queu [all...] |
H A D | ntp_config.h | 96 queue *flags; 103 queue *peerflags; 120 queue *crypto_cmd_list; 125 queue *trusted_key_list; 131 queue * options; 148 queue *options; 152 queue *init_opts; 153 queue *servers; 164 queue *peers; 165 queue *unpeer [all...] |
/macosx-10.10/apr-32/apr-util/apr-util/include/ |
H A D | apr_queue.h | 22 * @brief Thread Safe FIFO bounded queue 23 * @note Since most implementations of the queue are backed by a condition 39 * @defgroup APR_Util_FIFO Thread Safe FIFO bounded queue 50 * create a FIFO queue 51 * @param queue The new queue 52 * @param queue_capacity maximum size of the queue 53 * @param a pool to allocate queue from 55 APU_DECLARE(apr_status_t) apr_queue_create(apr_queue_t **queue, 60 * push/add an object to the queue, blockin 113 APU_DECLARE(unsigned int) apr_queue_size(apr_queue_t *queue); variable 120 APU_DECLARE(apr_status_t) apr_queue_interrupt_all(apr_queue_t *queue); variable 128 APU_DECLARE(apr_status_t) apr_queue_term(apr_queue_t *queue); variable [all...] |
/macosx-10.10/postfix-255/postfix/src/cleanup/ |
H A D | cleanup_milter.in10a | 4 # one region at the end of the queue file with the remainder of the 7 open test-queue-file10.tmp
|
H A D | cleanup_milter.in10b | 7 open test-queue-file10.tmp
|
H A D | cleanup_milter.in10c | 9 open test-queue-file10.tmp
|
H A D | cleanup_milter.in11 | 5 open test-queue-file11.tmp
|
/macosx-10.10/apache-793/httpd/server/mpm/worker/ |
H A D | fdqueue.c | 201 * it reaches into the queue and accesses "next" which can change. 243 #define ap_queue_full(queue) ((queue)->nelts == (queue)->bounds) 249 #define ap_queue_empty(queue) ((queue)->nelts == 0) 257 fd_queue_t *queue = data; local 262 apr_thread_cond_destroy(queue->not_empty); 263 apr_thread_mutex_destroy(queue->one_big_mutex); 271 apr_status_t ap_queue_init(fd_queue_t *queue, in argument 305 ap_queue_push(fd_queue_t *queue, apr_socket_t *sd, apr_pool_t *p) argument 340 ap_queue_pop(fd_queue_t *queue, apr_socket_t **sd, apr_pool_t **p) argument 385 ap_queue_interrupt_all(fd_queue_t *queue) argument 396 ap_queue_term(fd_queue_t *queue) argument [all...] |
/macosx-10.10/swig-12/Lib/std/ |
H A D | std_queue.i | 5 * @brief A wrapping of std::queue for Ruby. 14 %define %std_queue_methods(queue...) 15 queue(); 16 queue( const _Sequence& ); 26 %define %std_queue_methods_val(queue...) 27 %std_queue_methods(queue) 31 // std::queue 36 // -- f(std::queue<T>), f(const std::queue<T>&): 38 // previously wrapped std::queue< [all...] |
/macosx-10.10/apache-793/httpd/server/mpm/event/ |
H A D | fdqueue.c | 256 * it reaches into the queue and accesses "next" which can change. 298 #define ap_queue_full(queue) ((queue)->nelts == (queue)->bounds) 304 #define ap_queue_empty(queue) ((queue)->nelts == 0 && APR_RING_EMPTY(&queue->timers ,timer_event_t, link)) 312 fd_queue_t *queue = data; local 317 apr_thread_cond_destroy(queue->not_empty); 318 apr_thread_mutex_destroy(queue 326 ap_queue_init(fd_queue_t * queue, int queue_capacity, apr_pool_t * a) argument 365 ap_queue_push(fd_queue_t * queue, apr_socket_t * sd, event_conn_state_t * ecs, apr_pool_t * p) argument 396 ap_queue_push_timer(fd_queue_t * queue, timer_event_t *te) argument 423 ap_queue_pop_something(fd_queue_t * queue, apr_socket_t ** sd, event_conn_state_t ** ecs, apr_pool_t ** p, timer_event_t ** te_out) argument 479 ap_queue_interrupt_all(fd_queue_t * queue) argument 490 ap_queue_term(fd_queue_t * queue) argument [all...] |
/macosx-10.10/xnu-2782.1.97/osfmk/kern/ |
H A D | call_entry.h | 36 #include <kern/queue.h> 47 queue_head_t *queue; member in struct:call_entry 65 (entry)->queue = NULL; \ 75 queue_t queue) 77 queue_t old_queue = entry->queue; 82 enqueue_tail(queue, qe(entry)); 84 entry->queue = queue; 93 queue_t old_queue = entry->queue; 98 entry->queue 73 call_entry_enqueue_tail( call_entry_t entry, queue_t queue) argument 104 call_entry_enqueue_deadline( call_entry_t entry, queue_head_t *queue, uint64_t deadline) argument [all...] |
/macosx-10.10/BerkeleyDB-21/db/build_vxworks/test_micro/ |
H A D | b_workload.h | 57 * to the start and the end of the queue. 68 #define BENCH_Q_TAIL_INSERT(queue, buf) do { \ 73 if (queue.head == NULL) \ 74 queue.head = queue.tail = entry; \ 76 queue.tail->next = entry; \ 77 queue.tail = entry; \ 81 #define BENCH_Q_POP(queue, buf) do { \ 82 struct bench_qentry *popped = queue.head; \ 85 if (queue [all...] |