Searched refs:queue (Results 26 - 50 of 738) sorted by relevance

1234567891011>>

/macosx-10.10/BerkeleyDB-21/db/test_micro/source/
H A Db_workload.h57 * 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...]
/macosx-10.10/Security-57031.1.35/Security/libsecurity_codesigning/antlr2/src/
H A DInputBuffer.cpp20 while (queue.entries() < amount + markerOffset)
23 queue.append(getChar());
34 for(unsigned int i = markerOffset; i < queue.entries(); i++)
35 ret += queue.elementAt(i);
48 ret += queue.elementAt(i);
75 //assert(queue.entries() >= markerOffset);
76 return (unsigned int)queue.entries() - markerOffset;
H A DTokenBuffer.cpp47 while (queue.entries() < (amount + markerOffset))
50 queue.append(input.nextToken());
58 return queue.elementAt(markerOffset+i-1)->getType();
65 return queue.elementAt(markerOffset+i-1);
91 return (unsigned int)queue.entries() - markerOffset;
/macosx-10.10/libdispatch-442.1.4/dispatch/
H A Dintrospection.h44 * Interposable hook function called when a dispatch queue was created.
46 * @param queue
47 * The newly created dispatch queue.
53 dispatch_introspection_hook_queue_create(dispatch_queue_t queue);
59 * Interposable hook function called when a dispatch queue is about to be
62 * @param queue
63 * The dispatch queue about to be destroyed.
69 dispatch_introspection_hook_queue_destroy(dispatch_queue_t queue);
76 * a dispatch queue.
78 * @param queue
[all...]
/macosx-10.10/dtrace-147/DTTk/Bin/
H A Ddispqlen.d3 * dispqlen.d - dispatcher queue length by CPU.
10 * NOTES: The dispatcher queue length is an indication of CPU saturation.
12 * utilised when the dispatcher queue reports a length of zero.
44 @queue[cpu] =
50 printa(" CPU %d%@d\n", @queue);
/macosx-10.10/dtrace-147/DTTk/Cpu/
H A Ddispqlen.d3 * dispqlen.d - dispatcher queue length by CPU.
10 * NOTES: The dispatcher queue length is an indication of CPU saturation.
12 * utilised when the dispatcher queue reports a length of zero.
44 @queue[cpu] =
50 printa(" CPU %d%@d\n", @queue);
/macosx-10.10/ruby-106/ruby/lib/minitest/
H A Dparallel_each.rb15 @queue = Queue.new # *sigh*... the Queue api sucks sooo much...
17 list.each { |i| @queue << i }
18 N.times { @queue << nil }
29 while job = @queue.pop
/macosx-10.10/ruby-106/ruby/sample/drb/
H A Ddqin.rb12 queue = DRbObject.new(nil, there)
13 queue.push(DQEntry.new(DRb.uri))
H A Ddqout.rb12 queue = DRbObject.new(nil, there)
13 entry = queue.pop
/macosx-10.10/postfix-255/postfix/src/oqmgr/
H A Dqmgr_defer.c14 /* void qmgr_defer_todo(queue, dsn)
15 /* QMGR_QUEUE *queue;
29 /* and by qmgr_active_done(): in-core queue entries will disappear,
31 /* disappear, bounces may be sent, new in-core queues, queue entries
34 /* qmgr_defer_transport() calls qmgr_defer_todo() for each queue
41 /* .IP queue
42 /* Specifies a queue with delivery requests for a specific next-hop
85 QMGR_QUEUE *queue; local
95 for (queue = transport->queue_list.next; queue; queu
103 qmgr_defer_todo(QMGR_QUEUE *queue, DSN *dsn) argument
[all...]
H A Dqmgr_error.c5 /* look up/create error/retry queue
23 /* qmgr_error_queue() looks up an error queue for the specified
24 /* service and problem. The result is null if the queue is not
83 /* qmgr_error_queue - look up error queue for specified service and problem */
88 QMGR_QUEUE *queue; local
98 * Find or create queue.
101 if ((queue = qmgr_queue_find(transport, nexthop)) == 0)
102 queue = qmgr_queue_create(transport, nexthop, nexthop);
104 if (QMGR_QUEUE_THROTTLED(queue))
110 return (queue);
[all...]
H A Dqmgr_scan.c5 /* queue scanning
19 /* This module implements queue scans. A queue scan always runs
21 /* can request that a queue scan be restarted once it completes.
23 /* qmgr_scan_create() creates a context for scanning the named queue,
24 /* but does not start a queue scan.
26 /* qmgr_scan_next() returns the base name of the next queue file.
28 /* automagically restarts a queue scan when a scan request had
31 /* qmgr_scan_request() records a request for the next queue scan. The
39 /* immediately when a queue sca
176 qmgr_scan_create(const char *queue) argument
[all...]
/macosx-10.10/postfix-255/postfix/src/qmgr/
H A Dqmgr_defer.c14 /* void qmgr_defer_todo(queue, dsn)
15 /* QMGR_QUEUE *queue;
29 /* and by qmgr_active_done(): in-core queue entries will disappear,
31 /* disappear, bounces may be sent, new in-core queues, queue entries
34 /* qmgr_defer_transport() calls qmgr_defer_todo() for each queue
41 /* .IP queue
42 /* Specifies a queue with delivery requests for a specific next-hop
90 QMGR_QUEUE *queue; local
100 for (queue = transport->queue_list.next; queue; queu
108 qmgr_defer_todo(QMGR_QUEUE *queue, DSN *dsn) argument
[all...]
H A Dqmgr_error.c5 /* look up/create error/retry queue
23 /* qmgr_error_queue() looks up an error queue for the specified
24 /* service and problem. The result is null if the queue is not
83 /* qmgr_error_queue - look up error queue for specified service and problem */
88 QMGR_QUEUE *queue; local
98 * Find or create queue.
101 if ((queue = qmgr_queue_find(transport, nexthop)) == 0)
102 queue = qmgr_queue_create(transport, nexthop, nexthop);
104 if (QMGR_QUEUE_THROTTLED(queue))
110 return (queue);
[all...]
H A Dqmgr_scan.c5 /* queue scanning
19 /* This module implements queue scans. A queue scan always runs
21 /* can request that a queue scan be restarted once it completes.
23 /* qmgr_scan_create() creates a context for scanning the named queue,
24 /* but does not start a queue scan.
26 /* qmgr_scan_next() returns the base name of the next queue file.
28 /* automagically restarts a queue scan when a scan request had
31 /* qmgr_scan_request() records a request for the next queue scan. The
39 /* immediately when a queue sca
176 qmgr_scan_create(const char *queue) argument
[all...]
/macosx-10.10/WebCore-7600.1.25/replay/
H A DReplayingInputCursor.cpp64 NondeterministicInputBase* ReplayingInputCursor::loadInput(InputQueue queue, const AtomicString& type) argument
66 NondeterministicInputBase* input = uncheckedLoadInput(queue);
76 NondeterministicInputBase* ReplayingInputCursor::uncheckedLoadInput(InputQueue queue) argument
78 if (m_positions[static_cast<size_t>(queue)] >= m_storage.queueSize(queue)) {
79 String queueString = EncodingTraits<InputQueue>::encodeValue(queue).convertTo<String>();
80 LOG_ERROR("%-30s ERROR No more inputs remain for determinism queue %s, but one was requested.", "[ReplayingInputCursor]", queueString.ascii().data());
84 return m_storage.load(queue, m_positions[static_cast<size_t>(queue)]++);
/macosx-10.10/postfix-255/postfix/src/cleanup/
H A Dcleanup_milter.in10d8 open test-queue-file10.tmp
H A Dcleanup_milter.in10e6 open test-queue-file10.tmp
/macosx-10.10/ntp-92/ntpd/
H A Dntp_data_structures.c19 * Define a priority queue in which the relative priority of the elements
25 queue *create_priority_queue(int (*get_order)(void *, void *))
27 queue *my_queue = (queue *) emalloc(sizeof(queue));
35 /* Define a function to "destroy" a priority queue, freeing-up
39 void destroy_queue(queue *my_queue)
43 /* Empty out the queue elements if they are not already empty */
50 /* Now free the queue */
56 * of the queue
[all...]
/macosx-10.10/xnu-2782.1.97/osfmk/vm/
H A Dvm_purgeable.c54 token_idx_t token_free_idx = 0; /* head of free queue */
57 * be added onto token queue */
82 static token_idx_t vm_purgeable_token_remove_first(purgeable_q_t queue);
84 static void vm_purgeable_stats_helper(vm_purgeable_stat_t *stat, purgeable_q_t queue, int group, task_t target_task);
94 vm_purgeable_token_check_queue(purgeable_q_t queue) argument
97 token_idx_t token = queue->token_q_head;
117 assert(queue->token_q_unripe);
119 assert(token == queue->token_q_unripe);
125 assert(queue->token_q_tail == token);
132 assert(queue
150 vm_purgeable_token_add(purgeable_q_t queue) argument
308 vm_purgeable_token_remove_first(purgeable_q_t queue) argument
366 vm_purgeable_token_remove_last(purgeable_q_t queue) argument
432 vm_purgeable_token_delete_first(purgeable_q_t queue) argument
448 vm_purgeable_token_delete_last(purgeable_q_t queue) argument
499 purgeable_q_t queue = &purgeable_queues[i]; local
558 vm_purgeable_token_remove_ripe(purgeable_q_t queue) argument
590 vm_purgeable_token_choose_and_delete_ripe(purgeable_q_t queue, purgeable_q_t queue2) argument
681 vm_purgeable_object_find_and_lock( purgeable_q_t queue, int group, boolean_t pick_ripe) argument
794 purgeable_q_t queue; local
865 purgeable_q_t queue, queue2; local
987 vm_purgeable_object_add(vm_object_t object, purgeable_q_t queue, int group) argument
1044 purgeable_q_t queue; local
1105 vm_purgeable_stats_helper(vm_purgeable_stat_t *stat, purgeable_q_t queue, int group, task_t target_task) argument
1125 purgeable_q_t queue; local
1150 vm_purgeable_volatile_queue_disown( purgeable_q_t queue, int group, task_t task) argument
1318 vm_purgeable_queue_purge_task_owned( purgeable_q_t queue, int group, task_t task) argument
1405 purgeable_q_t queue; local
[all...]
/macosx-10.10/tcl-105/tcl_ext/tcllib/tcllib/modules/struct/queue/
H A Dq.c1 /* struct::queue - critcl - layer 1 definitions
17 q->queue = Tcl_NewListObj (0,NULL);
21 Tcl_IncrRefCount (q->queue);
30 /* Delete a queue in toto.
34 Tcl_DecrRefCount (q->queue);
H A Dds.h1 /* struct::queue - critcl - layer 1 declarations
20 * the queue */
22 Tcl_Obj* queue; /* List object holding the main queue */ member in struct:Q
24 int at; /* Index of next element to return from the main queue */
/macosx-10.10/Security-57031.1.35/Security/libsecurity_codesigning/antlr2/antlr/
H A DInputBuffer.hpp51 queue.clear();
81 return queue.elementAt(markerOffset + i - 1);
119 // Circular queue
120 CircularQueue<int> queue; member in class:antlr::InputBuffer
137 queue.removeItems( numToConsume );
/macosx-10.10/xnu-2782.1.97/bsd/sys/
H A Dcallout.h73 #include <sys/queue.h>
/macosx-10.10/Security-57031.1.35/Security/sec/securityd/
H A DSecCAIssuerRequest.h30 dispatch_queue_t queue, void *context, void (*callback)(void *, CFArrayRef));

Completed in 225 milliseconds

1234567891011>>