| /external/cronet/base/task/sequence_manager/ |
| D | README.md | 4 The sequence manager provides a set of prioritized FIFO task queues, which
10 associated `TaskRunner`. `TaskQueue`s use distinct primitive FIFO queues, called
19 Task queues have a mechanism to allow efficient cross-thread posting with the
33 Each `TaskQueueImpl` maintains its own next wake-up as
44 associated with a wake-up is reached, `WakeUpQueue` is notified through
46 `TaskQueue`s whose wake-up can be resolved. This lets each `TaskQueue`s process
50 A delayed Task posted cross-thread generates an immediate Task to run
57 updates the next task queue wake-up. Once the delayed run time is reached,
58 possibly because the wake-up is resolved, the delayed task is moved to
66 TimeDomain::MaybeFastForwardToWakeUp(), and can use the signal to fast forward
|
| /external/aws-sdk-java-v2/.changes/2.17.x/ |
| D | 2.17.84.json | 3 "date": "2021-11-17",
21 …s to publish up to 10 messages per API request. The new API is valid for Standard and FIFO topics."
33 …ata loss with fast, reliable recovery of on-premises and cloud-based applications using affordable…
45 … on getting started. https://docs.aws.amazon.com/appconfig/latest/userguide/what-is-appconfig.html"
|
| /external/webrtc/modules/pacing/ |
| D | prioritized_packet_queue.h | 4 * Use of this source code is governed by a BSD-style license
40 // - audio, retransmissions, video / fec, padding
41 // For each packet type, we use one FIFO-queue per SSRC and emit from
42 // those queues in a round-robin fashion.
49 // as `packet->payload_size() + packet->padding_size()`.
71 // call - with any time spent in a paused state subtracted.
96 // For each priority level, packets are simply stored in a fifo queue.
107 // count for that priority level went from zero to non-zero.
146 // The first index into `stream_by_prio_` that is non-empty.
150 // the end. QueuedPacket instances have a iterators into this list for fast
|
| /external/python/cpython3/Doc/library/ |
| D | queue.rst | 1 :mod:`queue` --- A synchronized queue class
9 --------------
11 The :mod:`queue` module implements multi-producer, multi-consumer queues.
17 which the entries are retrieved. In a :abbr:`FIFO (first-in, first-out)`
19 :abbr:`LIFO (last-in, first-out)` queue, the most recently added entry is
29 :abbr:`FIFO (first-in, first-out)` queue type, :class:`SimpleQueue`, whose
37 Constructor for a :abbr:`FIFO (first-in, first-out)` queue. *maxsize* is
45 Constructor for a :abbr:`LIFO (last-in, first-out)` queue. *maxsize* is
76 Constructor for an unbounded :abbr:`FIFO (first-in, first-out)` queue.
84 Exception raised when non-blocking :meth:`~Queue.get` (or
[all …]
|
| /external/libdav1d/examples/ |
| D | dav1dplay.c | 43 (uint64_t)(((foff) * rd_ctx->spf) * 1000000000.0 + .5)
45 (uint64_t)(((ts) * rd_ctx->timebase) * 1000000000.0 + .5)
80 // Fifo
81 Dav1dPlayPtrFifo *fifo; member
115 " --input/-i $file: input file\n" in dp_settings_print_usage()
116 " --untimed/-u: ignore PTS, render as fast as possible\n" in dp_settings_print_usage()
117 " --threads $num: number of threads (default: 0)\n" in dp_settings_print_usage()
118 " --framedelay $num: maximum frame delay, capped at $threads (default: 0);\n" in dp_settings_print_usage()
119 " set to 1 for low-latency decoding\n" in dp_settings_print_usage()
120 " --highquality: enable high quality rendering\n" in dp_settings_print_usage()
[all …]
|
| /external/python/cpython2/Doc/library/ |
| D | queue.rst | 1 :mod:`Queue` --- A synchronized queue class
14 --------------
16 The :mod:`Queue` module implements multi-producer, multi-consumer queues.
24 which the entries are retrieved. In a FIFO queue, the first tasks added are
34 Constructor for a FIFO queue. *maxsize* is an integer that sets the upperbound
63 Exception raised when non-blocking :meth:`~Queue.get` (or
70 Exception raised when non-blocking :meth:`~Queue.put` (or
77 queues with fast atomic :func:`append` and :func:`popleft` operations that
84 -------------
|
| /external/trusty/arm-trusted-firmware/drivers/nxp/flexspi/nor/ |
| D | fspi.c | 1 // SPDX-License-Identifier: BSD-3-Clause
166 /* LUT Setup for READ Command 3-Byte low Frequency */ in fspi_setup_LUT()
169 /* LUT Setup for FAST READ Command 3-Byte/4-Byte high Frequency */ in fspi_setup_LUT()
271 __func__, (pc_rx_addr - fspi_flash_base_addr), pc_rx_buf); in xspi_ahb_read()
311 /* IP Control Register0 - SF Address to be read */ in xspi_ip_read()
314 /* IP Control Register1 - SEQID_READ operation, Size */ in xspi_ip_read()
338 return -XSPI_IP_READ_FAIL; in xspi_ip_read()
340 /* Will read in n iterations of each 8 FIFO's(WM level) */ in xspi_ip_read()
351 /* Read RX FIFO's(upto WM level) & copy to rxbuffer */ in xspi_ip_read()
353 /* Read FIFO Data Register */ in xspi_ip_read()
[all …]
|
| /external/arm-trusted-firmware/drivers/nxp/flexspi/nor/ |
| D | fspi.c | 1 // SPDX-License-Identifier: BSD-3-Clause
163 /* LUT Setup for READ Command 3-Byte low Frequency */ in fspi_setup_LUT()
166 /* LUT Setup for FAST READ Command 3-Byte/4-Byte high Frequency */ in fspi_setup_LUT()
268 __func__, (pc_rx_addr - fspi_flash_base_addr), pc_rx_buf); in xspi_ahb_read()
308 /* IP Control Register0 - SF Address to be read */ in xspi_ip_read()
311 /* IP Control Register1 - SEQID_READ operation, Size */ in xspi_ip_read()
335 return -XSPI_IP_READ_FAIL; in xspi_ip_read()
337 /* Will read in n iterations of each 8 FIFO's(WM level) */ in xspi_ip_read()
348 /* Read RX FIFO's(upto WM level) & copy to rxbuffer */ in xspi_ip_read()
350 /* Read FIFO Data Register */ in xspi_ip_read()
[all …]
|
| /external/cronet/base/allocator/partition_allocator/ |
| D | PartitionAlloc.md | 15 * [Chrome-External Builds](./external_builds.md): Further considerations
26 PartitionAlloc is designed to be extremely fast in its fast paths. The fast
28 branches. The number of operations in the fast paths is minimal, leading to the
32 per-partition basis. Separately, the thread cache consumes slots
36 However, even the fast path isn't the fastest, because it requires taking
37 a per-partition lock. Although we optimized the lock, there was still room for
69 PartitionAlloc records metadata in a dedicated, out-of-line region (not
81 64-bit systems, and 8B on 32-bit).
84 via `PartitionAlloc::AlignedAlloc()` or platform-specific APIs (such as
106 guard pages at the "front."](./src/partition_alloc/dot/super-page.png)
[all …]
|
| /external/mesa3d/src/gallium/drivers/svga/include/ |
| D | svga_reg.h | 2 * Copyright 1998-2015 VMware, Inc. All rights reserved.
27 * svga_reg.h --
59 * Legal values for the SVGA_REG_CURSOR_ON register in old-fashioned
116 #define SVGA_IRQFLAG_FIFO_PROGRESS 0x2 /* Made forward progress in the FIFO */
151 SVGA_REG_SYNC = 21, /* See "FIFO Synchronization Registers" */
152 SVGA_REG_BUSY = 22, /* See "FIFO Synchronization Registers" */
160 SVGA_REG_MEM_REGS = 30, /* Number of FIFO registers */
165 /* Legacy multi-monitor support */
180 SVGA_REG_TRACES = 45, /* Enable trace-based updates even when FIFO is on */
182 SVGA_REG_MEMORY_SIZE = 47, /* Total dedicated device memory excluding FIFO */
[all …]
|
| /external/mesa3d/docs/relnotes/ |
| D | 18.1.2.rst | 16 ----------------
20 a644df23937f4078a2bd9a54349f6315c1955f5e3a4ac272832da51dea4d3c11 mesa-18.1.1.tar.gz
21 070bf0648ba5b242d7303ceed32aed80842f4c0ba16e5acc1a650a46eadfb1f9 mesa-18.1.1.tar.xz
24 ------------
29 ---------
34 -------
38 - radv: Consolidate GFX9 merged shader lookup logic
39 - radv: Handle GFX9 merged shaders in radv_flush_constants()
40 - radeonsi: Fix crash on shaders using MSAA image load/store
41 - radv: Set active_stages the same whether or not shaders were cached
[all …]
|
| /external/e2fsprogs/tests/m_rootdir/ |
| D | expect | 42 Fast commit length: 0
47 Group 0: (Blocks 1-8192)
48 Primary superblock at 1, Group descriptors at 2-2
49 Reserved GDT blocks at 3-129
52 Inode table at 134-261 (+133)
54 Free blocks: 445-8192
55 Free inodes: 20-512
56 Group 1: (Blocks 8193-16383) [INODE_UNINIT]
57 Backup superblock at 8193, Group descriptors at 8194-8194
58 Reserved GDT blocks at 8195-8321
[all …]
|
| /external/e2fsprogs/tests/m_rootdir_acl/ |
| D | expect | 42 Fast commit length: 0
47 Group 0: (Blocks 1-8192)
48 Primary superblock at 1, Group descriptors at 2-2
49 Reserved GDT blocks at 3-129
52 Inode table at 134-389 (+133)
54 Free blocks: 698-8192
55 Free inodes: 22-512
56 Group 1: (Blocks 8193-16383) [INODE_UNINIT]
57 Backup superblock at 8193, Group descriptors at 8194-8194
58 Reserved GDT blocks at 8195-8321
[all …]
|
| /external/e2fsprogs/tests/d_special_files/ |
| D | expect | 2 mke2fs -Fq -b 1024 test.img 512
4 debugfs -R ''stat foo'' -w test.img
11 ctime: 0x50f560e0:00000000 -- Tue Jan 15 14:00:00 2013
12 atime: 0x50f560e0:00000000 -- Tue Jan 15 14:00:00 2013
13 mtime: 0x50f560e0:00000000 -- Tue Jan 15 14:00:00 2013
14 crtime: 0x50f560e0:00000000 -- Tue Jan 15 14:00:00 2013
16 Fast link dest: "bar"
18 debugfs -R ''stat foo2'' -w test.img
25 ctime: 0x50f560e0:00000000 -- Tue Jan 15 14:00:00 2013
26 atime: 0x50f560e0:00000000 -- Tue Jan 15 14:00:00 2013
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/src/scheduling/ |
| D | WorkQueue.kt | 2 …* Copyright 2016-2021 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen…
14 internal const val MASK = BUFFER_CAPACITY - 1 // 128 by default
16 internal const val TASK_STOLEN = -1L
17 internal const val NOTHING_TO_STEAL = -2L
34 * [WorkQueue] provides semi-FIFO order, but with priority for most recently submitted task assuming
35 …e and submitted) are communicating and sharing state thus making such communication extremely fast.
43 …* Indeed, it formally has ABA-problem, but the whole processing logic is written in the way that s…
60 * Negative sizes can be observed only when non-owner reads the size, which happens only
63 private val bufferSize: Int get() = producerIndex.value - consumerIndex.value
94 if (bufferSize == BUFFER_CAPACITY - 1) return task in addLast()
[all …]
|
| /external/cronet/base/test/ |
| D | sequenced_task_runner_test_template.h | 2 // Use of this source code is governed by a BSD-style license that can be
46 // Posts the non-nestable task |task|, and records its post event.
54 // Posts the delayed non-nestable task |task|, and records its post event.
59 // Posts |task_count| non-nestable tasks.
91 // The ordinal to be used for the next task-posting task (protected by
102 // Checks the non-nestable task invariants for all tasks in |events|.
128 // This test posts N non-nestable tasks in sequence, and expects them to run
129 // in FIFO order, with no part of any two tasks' execution
130 // overlapping. I.e. that each task starts only after the previously-posted
135 this->delegate_.StartTaskRunner(); in TYPED_TEST_P()
[all …]
|
| /external/mesa3d/docs/ |
| D | envvars.rst | 6 but they can sometimes be useful for debugging end-user issues.
9 ---------------------------
18 colon-separated list of paths to search for DRI drivers
42 -------------------------------
57 following comma-separated list of named flags, which adds extra
87 ``GL_EXT_foo -GL_EXT_bar`` will enable the ``GL_EXT_foo`` extension
95 or before year X will be reported. This is to work-around a bug in
96 some games where the extension string is copied into a fixed-size
98 buffer overrun can cause the game to crash. This is a work-around for
106 - The format should be ``MAJOR.MINOR[FC|COMPAT]``
[all …]
|
| /external/libchrome/base/test/ |
| D | sequenced_task_runner_test_template.h | 2 // Use of this source code is governed by a BSD-style license that can be
43 // Posts the non-nestable task |task|, and records its post event.
51 // Posts the delayed non-nestable task |task|, and records its post event.
56 // Posts |task_count| non-nestable tasks.
88 // The ordinal to be used for the next task-posting task (protected by
101 // Checks the non-nestable task invariants for all tasks in |events|.
127 // This test posts N non-nestable tasks in sequence, and expects them to run
128 // in FIFO order, with no part of any two tasks' execution
129 // overlapping. I.e. that each task starts only after the previously-posted
134 this->delegate_.StartTaskRunner(); in TYPED_TEST_P()
[all …]
|
| /external/cronet/base/debug/ |
| D | allocation_trace.h | 2 // Use of this source code is governed by a BSD-style license that can be
25 // allow for fast computation of modulo.
50 // any of the Initialize*-functions while another thread A is currently
68 // The stacktrace as taken by the Initialize*-functions.
103 // - In the recorder we only store pointers, we never allocate or free on
105 // - Storing is the hot path. base::raw_ptr::operator== may perform sanity
180 // The memory image of the recorder will be copied into the crash-handler.
189 // records have been used, old records will be overwritten (fifo-style).
193 // 1 - We atomically increment and calculate the effective index of the record
195 // 2 - If this entry is still being used (the recording thread didn't finish
[all …]
|
| /external/webrtc/sdk/android/native_unittests/audio_device/ |
| D | audio_device_unittest.cc | 4 * Use of this source code is governed by a BSD-style license
67 // Run the full-duplex test during this time (unit is in seconds).
71 // initial callbacks (avoids initial FIFO access).
76 // Length of round-trip latency measurements. Number of transmitted impulses
77 // is kImpulseFrequencyInHz * kMeasureLatencyTime - 1.
79 // Utilized in round-trip latency measurements to avoid capturing noise samples.
149 // Simple first in first out (FIFO) class that wraps a list of 16-bit audio
153 // data to play out. The number of buffers in the FIFO will stabilize under
173 // Increases the size of the FIFO by one element.
183 fifo_->push_back(memory); in Write()
[all …]
|
| /external/libnl/tools/ |
| D | clang-format.sh | 3 set -e
11 "include/linux-private"
19 "include/netlink/cache-api.h"
56 "include/netlink/netlink-compat.h"
57 "include/netlink/netlink-kernel.h"
85 "include/netlink/route/link/info-api.h"
112 "include/netlink/route/qdisc/fifo.h"
125 "include/netlink/route/tc-api.h"
136 "include/nl-priv-dynamic-core/cache-api.h"
137 "include/nl-priv-dynamic-core/object-api.h"
[all …]
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/common/src/sync/ |
| D | Semaphore.kt | 2 …* Copyright 2016-2021 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen… in <lambda>()
20 * Semaphore is fair and maintains a FIFO order of acquirers. in <lambda>()
33 * All suspending acquirers are processed in first-in-first-out (FIFO) order. in <lambda>()
38 …ill not resume successfully. See [suspendCancellableCoroutine] documentation for low-level details. in <lambda>()
81 public suspend inline fun <T> Semaphore.withPermit(action: () -> T): T { in Semaphore()
100 and use the value before the increment as a slot number. This way, each enqueue-dequeue pair
107 …+------+ `acquire` suspends +------+ `release` tries +--------+ // if `c…
108 …| NULL | -------------------> | cont | -------------------> | PERMIT | (cont RETRIEVED) // the c…
109 …+------+ +------+ to resume `cont` +--------+ // a per…
114 | `acquire` and puts +-----------+ `release` has +--------+
[all …]
|
| /external/iproute2/include/uapi/linux/ |
| D | if_link.h | 1 /* SPDX-License-Identifier: GPL-2.0 WITH Linux-syscall-note */
26 __u32 rx_fifo_errors; /* recv'r fifo overrun */
61 __u64 rx_fifo_errors; /* recv'r fifo overrun */
121 IFLA_WIRELESS, /* Wireless Extension event - see wireless.h */
137 IFLA_NUM_VF, /* Number of VFs if device is SR-IOV PF */
166 #define IFLA_MAX (__IFLA_MAX - 1)
178 #define IFLA_INET_MAX (__IFLA_INET_MAX - 1)
190 - Combination IFF_BROADCAST|IFF_POINTOPOINT is invalid
191 - If neither of these three flags are set;
194 - IFF_MULTICAST does not mean anything special:
[all …]
|
| /external/libopus/celt/ |
| D | entdec.c | 1 /* Copyright (c) 2001-2011 Timothy B. Terriberry
2 Copyright (c) 2008-2009 Xiph.Org Foundation */
8 - Redistributions of source code must retain the above copyright
11 - Redistributions in binary form must reproduce the above copyright
40 rediscovery of the FIFO arithmetic code introduced by \cite{Pas76}.
47 This only seems true when using near-infinite precision arithmetic so that
53 encoding for efficiency actually re-discovers many of the principles
64 title="Source coding algorithms for fast data compression",
86 pages="256--294",
92 return _this->offs<_this->storage?_this->buf[_this->offs++]:0; in ec_read_byte()
[all …]
|
| /external/libaom/aom_dsp/ |
| D | entdec.c | 2 * Copyright (c) 2001-2016, Alliance for Open Media. All rights reserved
18 rediscovery of the FIFO arithmetic code introduced by \cite{Pas76}.
25 This only seems true when using near-infinite precision arithmetic so that
31 encoding for efficiency actually re-discovers many of the principles
42 title="Source coding algorithms for fast data compression",
66 pages="256--294",
84 dif = dec->dif; in od_ec_dec_refill()
85 cnt = dec->cnt; in od_ec_dec_refill()
86 bptr = dec->bptr; in od_ec_dec_refill()
87 end = dec->end; in od_ec_dec_refill()
[all …]
|