| /third_party/ltp/testcases/kernel/uevents/ |
| D | uevent02.c | 59 .msg = "add@/devices/virtual/net/ltp-tun0/queues/rx-0", in verify_uevent()
63 "DEVPATH=/devices/virtual/net/ltp-tun0/queues/rx-0", in verify_uevent()
64 "SUBSYSTEM=queues", in verify_uevent()
69 .msg = "add@/devices/virtual/net/ltp-tun0/queues/tx-0", in verify_uevent()
73 "DEVPATH=/devices/virtual/net/ltp-tun0/queues/tx-0", in verify_uevent()
74 "SUBSYSTEM=queues", in verify_uevent()
79 .msg = "remove@/devices/virtual/net/ltp-tun0/queues/rx-0", in verify_uevent()
83 "DEVPATH=/devices/virtual/net/ltp-tun0/queues/rx-0", in verify_uevent()
84 "SUBSYSTEM=queues", in verify_uevent()
89 .msg = "remove@/devices/virtual/net/ltp-tun0/queues/tx-0", in verify_uevent()
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/ipc/msgget/ |
| D | msgget03.c | 11 * ENOSPC - All possible message queues have been taken (MSGMNI)
25 static int *queues; variable
41 tst_res(TINFO, "Current environment %d message queues are already in use", in setup()
46 queues = SAFE_MALLOC((maxmsgs - used_cnt) * sizeof(int)); in setup()
52 queues[queue_cnt++] = res; in setup()
55 tst_res(TINFO, "The maximum number of message queues (%d) reached", in setup()
63 if (!queues) in cleanup()
67 SAFE_MSGCTL(queues[num], IPC_RMID, NULL); in cleanup()
69 free(queues); in cleanup()
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/synchronization/ |
| D | vktSynchronizationInternallySynchronizedObjectsTests.cpp | 82 vector<VkQueue> queues; member
84 } Queues; typedef in vkt::synchronization::__anon2b3974a60111::MultiQueues
90 Queues temp; in addQueueFamilyIndex()
95 temp.queues.resize(count); in addQueueFamilyIndex()
101 map<deUint32,Queues>::iterator it = m_queues.begin(); in getQueueFamilyIndex()
111 Queues & getQueues (const int index) in getQueues()
113 map<deUint32,Queues>::iterator it = m_queues.begin(); in getQueues()
122 Queues& queue = m_queues[getQueueFamilyIndex(queueFamilyIndexNdx)]; in getFreeQueue()
123 for (int queueNdx = 0; queueNdx < static_cast<int>(queue.queues.size()); ++queueNdx) in getFreeQueue()
130 returnQueues = queue.queues[queueNdx]; in getFreeQueue()
[all …]
|
| D | vktSynchronizationBasicSemaphoreTests.cpp | 327 struct Queues in basicMultiQueueCase() struct
342 Queues queues[COUNT] = in basicMultiQueueCase() local
365 if (NO_MATCH_FOUND == queues[FIRST].queueFamilyIndex) in basicMultiQueueCase()
366 queues[FIRST].queueFamilyIndex = queueNdx; in basicMultiQueueCase()
368 if (queues[FIRST].queueFamilyIndex != queueNdx || queueFamilyProperties[queueNdx].queueCount > 1u) in basicMultiQueueCase()
370 queues[SECOND].queueFamilyIndex = queueNdx; in basicMultiQueueCase()
375 …if (queues[FIRST].queueFamilyIndex == NO_MATCH_FOUND || queues[SECOND].queueFamilyIndex == NO_MATC… in basicMultiQueueCase()
376 TCU_THROW(NotSupportedError, "Queues couldn't be created"); in basicMultiQueueCase()
386 queueInfo.queueFamilyIndex = queues[queueNdx].queueFamilyIndex; in basicMultiQueueCase()
387 …queueInfo.queueCount = (queues[FIRST].queueFamilyIndex == queues[SECOND].queueFamilyIndex) ? 2 : 1; in basicMultiQueueCase()
[all …]
|
| /third_party/node/deps/npm/node_modules/tar/lib/ |
| D | path-reservations.js | 21 const queues = new Map() constant
41 // return the queues for each path the function cares about
49 paths: res.paths.map(path => queues.get(path)),
50 dirs: [...res.dirs].map(path => queues.get(path)),
55 // included in the first set for all its dir queues
79 const q = queues.get(path)
82 queues.delete(path)
93 const q = queues.get(dir)
96 queues.delete(dir)
129 const q = queues.get(path)
[all …]
|
| /third_party/ltp/testcases/kernel/syscalls/ipc/shmget/ |
| D | shmget03.c | 24 static int *queues; variable
44 queues = SAFE_MALLOC((maxshms - used_cnt) * sizeof(int)); in setup()
50 queues[queue_cnt++] = res; in setup()
60 if (!queues) in cleanup()
64 SAFE_SHMCTL(queues[num], IPC_RMID, NULL); in cleanup()
66 free(queues); in cleanup()
|
| /third_party/mesa3d/src/virtio/vulkan/ |
| D | vn_device.c | 86 struct vn_queue *queues = in vn_device_init_queues() local
87 vk_zalloc(alloc, sizeof(*queues) * count, VN_DEFAULT_ALIGN, in vn_device_init_queues()
89 if (!queues) in vn_device_init_queues()
98 result = vn_queue_init(dev, &queues[count], queue_info, j); in vn_device_init_queues()
108 vn_queue_fini(&queues[i]); in vn_device_init_queues()
109 vk_free(alloc, queues); in vn_device_init_queues()
114 dev->queues = queues; in vn_device_init_queues()
362 vn_queue_fini(&dev->queues[i]); in vn_DestroyDevice()
364 /* We must emit vkDestroyDevice before freeing dev->queues. Otherwise, in vn_DestroyDevice()
366 * the queues in the renderer. in vn_DestroyDevice()
[all …]
|
| /third_party/gstreamer/gstreamer/plugins/elements/ |
| D | gstmultiqueue.h | 60 /* number of queues */
63 /* The list of individual queues */
64 GList *queues; member
78 /* queues lock). Protects nbqueues, queues, global */
104 /* signals emitted when ALL queues are either full or empty */
|
| D | gstmultiqueue.c | 43 * * If more than one stream is used with the element, the streams' queues
75 * other queues.
77 * The #GstMultiQueue::underrun signal is emitted when all of the queues
79 * queues is filled.
235 * there is data in the queues. Normally, the byte and time limits are not hit
663 * no data in any of the queues inside the multiqueue instance (underrun). in gst_multi_queue_class_init()
676 * Reports that one of the queues in the multiqueue is full (overrun). in gst_multi_queue_class_init()
710 "Amount of data the queues can grow if one of them is empty (bytes, 0=disable)" in gst_multi_queue_class_init()
716 "Amount of buffers the queues can grow if one of them is empty (0=disable)" in gst_multi_queue_class_init()
722 "Amount of time the queues can grow if one of them is empty (in ns, 0=disable)" in gst_multi_queue_class_init()
[all …]
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/sparse_resources/ |
| D | vktSparseResourcesQueueBindSparseTests.cpp | 56 deUint32 numQueues; //! use 2 or more to sync between different queues
160 // Determine required queues and create a device that supports them in iterate()
262 // 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 …]
|
| /third_party/python/Doc/library/ |
| D | asyncio-queue.rst | 3 .. _asyncio-queues:
6 Queues title
9 **Source code:** :source:`Lib/asyncio/queues.py`
13 asyncio queues are designed to be similar to classes of the
14 :mod:`queue` module. Although asyncio queues are not thread-safe,
17 Note that methods of asyncio queues don't have a *timeout* parameter;
157 Queues can be used to distribute workload between several
|
| D | asyncio-api-index.rst | 76 Queues chapter
79 Queues should be used to distribute work amongst multiple asyncio Tasks,
102 * See also the :ref:`Queues documentation page <asyncio-queues>`.
|
| D | asyncio.rst | 28 database connection libraries, distributed task queues, etc.
42 * distribute tasks via :ref:`queues <asyncio-queues>`;
|
| /third_party/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
|
| /third_party/boost/libs/thread/doc/ |
| D | sync_queues_ref.qbk | 9 [section:synchronized_queues Synchronized Queues -- EXPERIMENTAL]
13 ….org/JTC1/SC22/WG21/docs/papers/2013/n3533.html [*N3533 - C++ Concurrent Queues]] C++1y proposal f…
19 Queues provide a mechanism for communicating data between components of a system.
21 … elements with other queue operations. So, concurrent pushes and pops on queues require a differen…
30 Concurrent queues are a well know mechanism for communicating data between different threads.
32 Concurrent queues have inherently copy/move semantics for the data handling operation. Reference-re…
46 [section:bounded_unbounded Bounded-Unbounded Queues]
52 [section:locking Locking/Lock-free Queues]
54 Locking queues can by nature block waiting for the queue to be non-empty or non-full.
56 …queues will have some trouble waiting for the queue to be non-empty or non-full queues. These queu…
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | queue.hpp | 46 * Synchronization of distributed queues occurs in the @ref empty and
67 * queues, so when that process finishes execution of the loop body
69 * may have nonempty local queues to execute. Once all local queues
202 /** Synchronize the distributed queue and determine if all queues
205 * \returns \c true when all local queues are empty, or false if at least
206 * one of the local queues is nonempty.
248 * This function will synchronize all of the local queues for a given
251 * synchronization of distributed queues occurs via the @c empty or @c
|
| /third_party/grpc/src/cpp/server/ |
| D | server_builder.cc | 278 // needs to create some completion queues to listen for incoming requests. in BuildAndStart()
279 // 'sync_server_cqs' are those internal completion queues. in BuildAndStart()
281 // This is different from the completion queues added to the server via in BuildAndStart()
282 // ServerBuilder's AddCompletionQueue() method (those completion queues in BuildAndStart()
313 // Create completion queues to listen to incoming rpc requests in BuildAndStart()
345 // Register all the completion queues with the server. i.e in BuildAndStart()
346 // 1. sync_server_cqs: internal completion queues created IF this is a sync in BuildAndStart()
348 // 2. cqs_: Completion queues added via AddCompletionQueue() call in BuildAndStart()
363 // listening to incoming channels. Such completion queues must be registered in BuildAndStart()
364 // as non-listening queues. In debug mode, these should have their server list in BuildAndStart()
[all …]
|
| /third_party/boost/boost/numeric/ublas/opencl/ |
| D | misc.hpp | 34 1, //number of command queues in a_sum()
47 1, //number of command queues in a_sum()
60 1, //number of command queues in a_sum()
73 1, //number of command queues in a_sum()
124 1, //number of command queues in norm_2()
137 1, //number of command queues in norm_2()
150 1, //number of command queues in norm_2()
163 1, //number of command queues in norm_2()
|
| /third_party/mesa3d/docs/relnotes/ |
| D | 17.3.3.rst | 67 - radv: fix events on compute queues.
69 - radv/gfx9: fix 3d image to image transfers on compute queues.
70 - radv/gfx9: fix 3d image clears on compute queues
71 - radv/gfx9: fix buffer to image for 3d images on compute queues
|
| /third_party/ffmpeg/libavfilter/ |
| D | framequeue.h | 39 * Structure to hold global options and statistics for frame queues.
42 * frame queues, including memory consumption caps.
77 * Pre-allocated bucket for queues of size 1.
133 * Must not be used with empty queues.
|
| /third_party/ltp/testcases/open_posix_testsuite/ |
| D | BUILD | 34 Message Queues
36 POSIX message queues have been available in FreeBSD since 6.x. Please add:
106 Message Queues
115 To build against the posix1b message queues, see the semaphores information for posix1b.
120 To build against the Michal Wronski/Krzysztof Benedyczak message queues,
|
| /third_party/flutter/engine/flutter/fml/ |
| D | task_runner.cc | 53 auto queues = MessageLoopTaskQueues::GetInstance(); in RunsTasksOnCurrentThread() local
54 if (queues->Owns(current_queue_id, loop_queue_id)) { in RunsTasksOnCurrentThread()
57 if (queues->Owns(loop_queue_id, current_queue_id)) { in RunsTasksOnCurrentThread()
|
| /third_party/vk-gl-cts/doc/testspecs/VK/ |
| D | sparse_resources.txt | 27 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
46 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
66 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
85 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
114 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
130 The test creates two queues - one supporting sparse binding operations, the second one supporting c…
|
| /third_party/grpc/include/grpcpp/ |
| D | server_impl.h | 168 /// \param sync_server_cqs The completion queues to use if the server is a
170 /// these queues
181 /// server completion queues passed via sync_server_cqs param.
197 /// \param cqs Completion queues for handling asynchronous services. The
198 /// caller is required to keep all completion queues live until the server is
200 /// \param num_cqs How many completion queues does \a cqs hold.
315 /// The following completion queues are ONLY used in case of Sync API
317 /// these completion queues to poll for new RPCs
|
| D | server.h | 162 /// \param sync_server_cqs The completion queues to use if the server is a
164 /// these queues
175 /// server completion queues passed via sync_server_cqs param.
191 /// \param cqs Completion queues for handling asynchronous services. The
192 /// caller is required to keep all completion queues live until the server is
194 /// \param num_cqs How many completion queues does \a cqs hold.
319 /// The following completion queues are ONLY used in case of Sync API
321 /// these completion queues to poll for new RPCs
|