| /external/deqp/external/vulkancts/modules/vulkan/synchronization/ |
| D | vktSynchronizationBasicSemaphoreTests.cpp | 158 struct Queues in basicMultiQueueCase() struct
174 Queues queues[COUNT] = in basicMultiQueueCase() local
197 if (NO_MATCH_FOUND == queues[FIRST].queueFamilyIndex) in basicMultiQueueCase()
198 queues[FIRST].queueFamilyIndex = queueNdx; in basicMultiQueueCase()
200 if (queues[FIRST].queueFamilyIndex != queueNdx || queueFamilyProperties[queueNdx].queueCount > 1u) in basicMultiQueueCase()
202 queues[SECOND].queueFamilyIndex = queueNdx; in basicMultiQueueCase()
207 …if (queues[FIRST].queueFamilyIndex == NO_MATCH_FOUND || queues[SECOND].queueFamilyIndex == NO_MATC… in basicMultiQueueCase()
208 TCU_THROW(NotSupportedError, "Queues couldn't be created"); in basicMultiQueueCase()
218 queueInfo.queueFamilyIndex = queues[queueNdx].queueFamilyIndex; in basicMultiQueueCase()
219 …queueInfo.queueCount = (queues[FIRST].queueFamilyIndex == queues[SECOND].queueFamilyIndex) ? 2 : … in basicMultiQueueCase()
[all …]
|
| D | vktSynchronizationInternallySynchronizedObjectsTests.cpp | 80 vector<VkQueue> queues; member
82 } Queues; typedef in vkt::synchronization::__anone698e8e60111::MultiQueues
88 Queues temp; in addQueueFamilyIndex()
93 temp.queues.resize(count); in addQueueFamilyIndex()
99 map<deUint32,Queues>::iterator it = m_queues.begin(); in getQueueFamilyIndex()
109 Queues & getQueues (const int index) in getQueues()
111 map<deUint32,Queues>::iterator it = m_queues.begin(); in getQueues()
120 Queues& queue = m_queues[getQueueFamilyIndex(queueFamilyIndexNdx)]; in getFreeQueue()
121 for (int queueNdx = 0; queueNdx < static_cast<int>(queue.queues.size()); ++queueNdx) in getFreeQueue()
128 returnQueues = queue.queues[queueNdx]; in getFreeQueue()
[all …]
|
| /external/ltp/testcases/kernel/syscalls/ipc/msgget/ |
| D | msgget03.c | 21 * message queues.
36 static int *queues; variable
61 queues = SAFE_MALLOC(maxmsgs * sizeof(int)); in setup()
64 queues[num] = -1; in setup()
68 queues[num] = res; in setup()
71 tst_res(TINFO, "The maximum number of message queues (%d) reached", in setup()
79 if (!queues) in cleanup()
83 if (queues[num] != -1) in cleanup()
84 SAFE_MSGCTL(queues[num], IPC_RMID, NULL); in cleanup()
87 free(queues); in cleanup()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | QueuesTest.java | 36 * Tests for {@link Queues}.
43 * All the following tests relate to BlockingQueue methods in Queues.
74 ? Queues.drain(q, buffer, maxElements, timeout, unit) in drain()
75 : Queues.drainUninterruptibly(q, buffer, maxElements, timeout, unit); in drain()
109 assertEquals(0, Queues.drain(q, ImmutableList.of(), 1, 10, TimeUnit.MILLISECONDS)); in testDrainTimesOut()
163 int elements = Queues.drain(q, buf, -1, Long.MAX_VALUE, TimeUnit.NANOSECONDS); in testNegativeMaxElements()
169 Queues.drain(q, buf, 1, Long.MAX_VALUE, TimeUnit.NANOSECONDS); in testNegativeMaxElements()
181 Queues.drain(q, ImmutableList.of(), 100, Long.MAX_VALUE, TimeUnit.NANOSECONDS); in testDrain_throws()
204 Queues.drainUninterruptibly(q, buf, 100, Long.MAX_VALUE, TimeUnit.NANOSECONDS); in testDrainUninterruptibly_doesNotThrow()
213 Queues.newLinkedBlockingDeque(0); in testNewLinkedBlockingDequeCapacity()
[all …]
|
| /external/libchrome/base/task/sequence_manager/ |
| D | sequence_manager_impl.h | 59 // The task queue manager provides N task queues and a selector interface for
61 // sub queues:
68 // the incoming task queue (if any) are moved here. The work queues are
161 // Task queues with newly available work on the incoming queue.
206 // List of task queues managed by this SequenceManager.
207 // - active_queues contains queues that are still running tasks.
210 // - queues_to_gracefully_shutdown contains queues which should be deleted
212 // - queues_to_delete contains soon-to-be-deleted queues, because some
213 // internal scheduling code does not expect queues to be pulled
249 // reloads any empty work queues.
[all …]
|
| D | work_queue_sets.h | 34 // O(log num queues)
37 // O(log num queues)
40 // O(log num queues)
43 // O(log num queues)
46 // O(log num queues)
49 // If empty it's O(1) amortized, otherwise it's O(log num queues)
53 // O(log num queues)
|
| D | task_queue.h | 80 // Queues with control priority will run before any other queue, and will
81 // explicitly starve other queues. Typically this should only be used for
82 // private queues which perform control operations.
87 // neither of the lower priority queues can be completely starved by higher
88 // priority tasks. All three of these queues will always take priority over
94 // Queues with normal priority are the default.
98 // Queues with best effort priority will only be run if all other queues are
99 // empty. They can be starved by the other queues.
|
| D | task_queue_selector.h | 22 // of particular task queues.
69 // Returns true if all the enabled work queues are empty. Returns false
120 // task from the set of queues of |priority|, or false if all queues of that
137 // from the set of queues of |priority|, or false if all queues of that
|
| /external/tensorflow/tensorflow/python/estimator/inputs/queues/ |
| D | __init__.py | 15 """queues python module.
26 from tensorflow_estimator.python.estimator.inputs import queues
30 queues.__all__ = [s for s in dir(queues) if not s.startswith('__')]
32 from tensorflow_estimator.python.estimator.inputs.queues import *
|
| /external/deqp/external/vulkancts/modules/vulkan/sparse_resources/ |
| D | vktSparseResourcesQueueBindSparseTests.cpp | 56 deUint32 numQueues; //! use 2 or more to sync between different queues
165 // Determine required queues and create a device that supports them in iterate()
267 // Submit to queues in iterate()
353 …{ "multi_queue_wait_one", { 2u, 1u, 0u, false, true, }, "sparse and other queues, wait for se… in populateTestGroup()
354 …{ "multi_queue_wait_many", { 2u, 2u, 0u, false, true, }, "sparse and other queues, wait for s… in populateTestGroup()
355 …{ "multi_queue_signal_one", { 2u, 0u, 1u, false, true, }, "sparse and other queues, signal se… in populateTestGroup()
356 …{ "multi_queue_signal_many", { 2u, 0u, 2u, false, true, }, "sparse and other queues, signal se… in populateTestGroup()
357 …{ "multi_queue_wait_one_signal_one", { 2u, 1u, 1u, false, true, }, "sparse and other queues, wai… in populateTestGroup()
358 …{ "multi_queue_wait_many_signal_many", { 2u, 2u, 2u, false, true, }, "sparse and other queues, w… in populateTestGroup()
359 …{ 2u, 1u, 1u, false, true, }, "sparse and other queues, wait for and signal semaphore(s) on other … in populateTestGroup()
[all …]
|
| /external/swiftshader/src/Vulkan/ |
| D | VkDevice.cpp | 27 : physicalDevice(info->pPhysicalDevice), queues(reinterpret_cast<Queue*>(mem)) in Device()
43 …new (&queues[queueID]) Queue(queueCreateInfo.queueFamilyIndex, queueCreateInfo.pQueuePriorities[j]… in Device()
63 queues[i].destroy(); in destroy()
66 vk::deallocate(queues, pAllocator); in destroy()
84 return queues[queueIndex]; in getQueue()
96 queues[i].waitIdle(); in waitIdle()
|
| /external/grpc-grpc/src/cpp/server/ |
| D | server_builder.cc | 233 // needs to create some completion queues to listen for incoming requests. in BuildAndStart()
234 // 'sync_server_cqs' are those internal completion queues. in BuildAndStart()
236 // This is different from the completion queues added to the server via in BuildAndStart()
237 // ServerBuilder's AddCompletionQueue() method (those completion queues in BuildAndStart()
257 // Create completion queues to listen to incoming rpc requests in BuildAndStart()
280 // Register all the completion queues with the server. i.e in BuildAndStart()
281 // 1. sync_server_cqs: internal completion queues created IF this is a sync in BuildAndStart()
283 // 2. cqs_: Completion queues added via AddCompletionQueue() call in BuildAndStart()
294 // listening to incoming channels. Such completion queues must be registered in BuildAndStart()
295 // as non-listening queues in BuildAndStart()
[all …]
|
| /external/perfetto/src/trace_processor/ |
| D | trace_sorter.cc | 59 // order. This function is a "extract min from N sorted queues", with some
62 // Upon each iteration this function finds the first two queues (if any) that
64 // min_ts of the 2nd. Imagine the queues are as follows:
74 // to avoid re-scanning all the queues all the times) but doesn't seem worth it.
87 // The top-2 min(ts) among all queues. in SortAndExtractEventsBeyondWindow()
110 // All the queues have events that start after the window (i.e. they are in SortAndExtractEventsBeyondWindow()
140 // Ftrace queues start at offset 1. So queues_[1] = cpu[0] and so on. in SortAndExtractEventsBeyondWindow()
147 // No events can be extracted from any of the queues. This means that in SortAndExtractEventsBeyondWindow()
148 // either we hit the window or all queues are empty. in SortAndExtractEventsBeyondWindow()
|
| /external/eigen/unsupported/test/ |
| D | cxx11_eventcount.cpp | 77 // fake queues. Ensure that it does not crash, consumers don't deadlock and
88 TestQueue queues[kQueues]; in test_stress_eventcount() local
92 producers.emplace_back(new std::thread([&ec, &queues]() { in test_stress_eventcount()
96 if (queues[idx].Push()) { in test_stress_eventcount()
108 consumers.emplace_back(new std::thread([&ec, &queues, &waiters, i]() { in test_stress_eventcount()
113 if (queues[idx].Pop()) continue; in test_stress_eventcount()
118 if (!queues[q].Empty()) { in test_stress_eventcount()
|
| /external/iproute2/man/man8/ |
| D | tc-mqprio.8 | 15 .B ] [ queues
26 exposed queues.
32 parameter and hashed across the indicated queues in the
96 queues
101 contiguous range of queues.
|
| D | tc-skbedit.8 | 26 transmit queues the packet is to be sent out. The number of available transmit
27 queues is reflected by sysfs entries within
28 .I /sys/class/net/<interface>/queues
|
| /external/grpc-grpc/include/grpcpp/ |
| D | server.h | 134 /// \param sync_server_cqs The completion queues to use if the server is a
136 /// these queues
147 /// server completion queues passed via sync_server_cqs param.
156 /// \param cqs Completion queues for handling asynchronous services. The
157 /// caller is required to keep all completion queues live until the server is
159 /// \param num_cqs How many completion queues does \a cqs hold.
196 /// The following completion queues are ONLY used in case of Sync API
198 /// these completion queues to poll for new RPCs
|
| /external/python/cpython3/Doc/library/ |
| D | asyncio-queue.rst | 3 .. _asyncio-queues:
6 Queues title
9 asyncio queues are designed to be similar to classes of the
10 :mod:`queue` module. Although asyncio queues are not thread-safe,
13 Note that methods of asyncio queues don't have a *timeout* parameter;
145 Queues can be used to distribute workload between several
|
| /external/u-boot/tools/ |
| D | genboardscfg.py | 220 def read_queues(queues, params_list): argument
221 """Read the queues and append the data to the paramers list"""
222 for q in queues:
243 queues = []
252 queues.append(q)
257 # Data in the queues should be retrieved preriodically.
258 # Otherwise, the queues would become full and subprocesses would get stuck.
260 read_queues(queues, params_list)
261 # sleep for a while until the queues are filled
270 read_queues(queues, params_list)
|
| /external/tensorflow/tensorflow/contrib/training/python/training/ |
| D | bucket_ops.py | 88 This function is implemented using several queues. A `QueueRunner` for the
89 queues is added to the current `Graph`'s `QUEUE_RUNNER` collection.
111 `batch_size` is returned when the queues are closed and there are not enough
121 batch_size: The new batch size pulled from the queue (all queues will have
139 batches to be smaller if there are insufficient items left in the queues.
144 shared_name: (Optional). If set, the queues will be shared under the given
218 # top_queue is a PaddingFIFOQueue even if the bucket queues are regular FIFO
219 # queues because if we use allow_smaller_final_batch, shapes will
230 """Return an op that enqueues conditionally in one of the queues."""
327 batch_size: The new batch size pulled from the queue (all queues will have
[all …]
|
| /external/iptables/extensions/ |
| D | libxt_NFQUEUE.man | 17 This specifies a range of queues to use. Packets are then balanced across the given queues.
19 queues x, x+1, .. x+n and use "\-\-queue\-balance \fIx\fP\fB:\fP\fIx+n\fP".
32 the queues. The idea is that you can improve performance if there's a queue
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| D | ListenerCallQueue.java | 22 import com.google.common.collect.Queues;
51 /** Helper method to add this callback to all the queues. */
52 void enqueueOn(Iterable<ListenerCallQueue<L>> queues) { in enqueueOn() argument
53 for (ListenerCallQueue<L> queue : queues) { in enqueueOn()
62 @GuardedBy("this") private final Queue<Callback<L>> waitQueue = Queues.newArrayDeque();
|
| /external/autotest/client/site_tests/security_SysVIPC/ |
| D | security_SysVIPC.py | 101 # Also check Message Queues. Since we currently expect
103 queues = utils.system_output('ipcs -q | grep ^0', ignore_status=True)
104 if queues:
106 logging.error('Unexpected message queues found:')
107 logging.error(queues)
|
| /external/perfetto/src/traced/probes/ftrace/test/data/android_flounder_lte_LRX16F_3.10.40/events/mac80211/drv_flush/ |
| D | format | 11 field:u32 queues; offset:44; size:4; signed:0;
13 print fmt: "%s queues:0x%x drop:%d", REC->wiphy_name, REC->queues, REC->drop
|
| /external/u-boot/drivers/nvme/ |
| D | nvme.c | 215 return nvme_submit_sync_cmd(dev->queues[NVME_ADMIN_Q], cmd, in nvme_submit_admin_cmd()
245 dev->queues[qid] = nvmeq; in nvme_alloc_queue()
308 struct nvme_queue *nvmeq = dev->queues[i]; in nvme_free_queues()
310 dev->queues[i] = NULL; in nvme_free_queues()
356 nvmeq = dev->queues[NVME_ADMIN_Q]; in nvme_configure_admin_queue()
384 nvme_init_queue(dev->queues[NVME_ADMIN_Q], 0); in nvme_configure_admin_queue()
550 if (nvme_create_queue(dev->queues[i], i)) in nvme_create_io_queues()
566 /* Free previously allocated queues */ in nvme_setup_io_queues()
718 status = nvme_submit_sync_cmd(dev->queues[NVME_IO_Q], in nvme_blk_rw()
784 ndev->queues = malloc(NVME_Q_NUM * sizeof(struct nvme_queue *)); in nvme_probe()
[all …]
|