| /external/jemalloc_new/test/unit/ |
| D | qr.c | 5 /* Number of ring entries, in [2..26]. */
18 init_entries(ring_t *entries) { in init_entries() argument
22 qr_new(&entries[i], link); in init_entries()
23 entries[i].id = 'a' + i; in init_entries()
28 test_independent_entries(ring_t *entries) { in test_independent_entries() argument
34 qr_foreach(t, &entries[i], link) { in test_independent_entries()
43 qr_reverse_foreach(t, &entries[i], link) { in test_independent_entries()
51 t = qr_next(&entries[i], link); in test_independent_entries()
52 assert_ptr_eq(t, &entries[i], in test_independent_entries()
57 t = qr_prev(&entries[i], link); in test_independent_entries()
[all …]
|
| D | ql.c | 5 /* Number of ring entries, in [2..26]. */
47 init_entries(list_t *entries, unsigned nentries) { in init_entries() argument
51 entries[i].id = 'a' + i; in init_entries()
52 ql_elm_new(&entries[i], link); in init_entries()
57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) { in test_entries_list() argument
61 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list()
62 assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id, in test_entries_list()
67 assert_c_eq(t->id, entries[i].id, "Element id mismatch"); in test_entries_list()
73 assert_c_eq(t->id, entries[nentries-i-1].id, in test_entries_list()
79 t = ql_next(head, &entries[i], link); in test_entries_list()
[all …]
|
| /external/MPAndroidChart/MPChartLib/src/test/java/com/github/mikephil/charting/test/ |
| D | AxisRendererTest.java | 25 float[] entries = yAxis.mEntries; in testComputeAxisValues() local
27 assertEquals(6, entries.length); in testComputeAxisValues()
28 assertEquals(20, entries[1] - entries[0], 0.01); // interval 20 in testComputeAxisValues()
29 assertEquals(0, entries[0], 0.01); in testComputeAxisValues()
30 assertEquals(100, entries[entries.length - 1], 0.01); in testComputeAxisValues()
38 entries = yAxis.mEntries; in testComputeAxisValues()
40 assertEquals(3, entries.length); in testComputeAxisValues()
41 assertEquals(50, entries[1] - entries[0], 0.01); // interval 50 in testComputeAxisValues()
42 assertEquals(0, entries[0], 0.01); in testComputeAxisValues()
43 assertEquals(100, entries[entries.length - 1], 0.01); in testComputeAxisValues()
[all …]
|
| /external/mesa3d/src/gfxstream/scripts/ |
| D | generate-dispatch-headers.sh | 30 scripts/gen-entries.py --mode=$mode $entries_file --output=$output_path
53 functions_header $ENTRIES_DIR/render_egl.entries $HEADER_OUT_DIR/RenderEGL_functions.h
54 functions_header $ENTRIES_DIR/render_egl_extensions.entries $HEADER_OUT_DIR/RenderEGL_extensions_fu…
55 functions_header $ENTRIES_DIR/render_egl_snapshot.entries $HEADER_OUT_DIR/RenderEGL_snapshot_functi…
57 funcargs_header $ENTRIES_DIR/gles1_extensions.entries $HEADER_OUT_DIR/gles1_extensions_functions.h
58 funcargs_header $ENTRIES_DIR/gles1_only.entries $HEADER_OUT_DIR/gles1_only_functions.h
59 funcargs_header $ENTRIES_DIR/gles2_extensions.entries $HEADER_OUT_DIR/gles2_extensions_functions.h
60 funcargs_header $ENTRIES_DIR/gles2_only.entries $HEADER_OUT_DIR/gles2_only_functions.h
61 funcargs_header $ENTRIES_DIR/gles31_only.entries $HEADER_OUT_DIR/gles31_only_functions.h
62 funcargs_header $ENTRIES_DIR/gles3_extensions.entries $HEADER_OUT_DIR/gles3_extensions_functions.h
[all …]
|
| /external/exoplayer/tree_8e57d3715f9092d5ec54ebe2e538f34bfcc34479/library/common/src/main/java/com/google/android/exoplayer2/metadata/ |
| D | Metadata.java | 27 /** A collection of metadata entries. */
55 * Entry} entries attempt to populate the same {@link MediaMetadata} field, then the last one in
63 private final Entry[] entries; field in Metadata
66 * @param entries The metadata entries.
68 public Metadata(Entry... entries) { in Metadata() argument
69 this.entries = entries; in Metadata()
73 * @param entries The metadata entries.
75 public Metadata(List<? extends Entry> entries) { in Metadata() argument
76 this.entries = entries.toArray(new Entry[0]); in Metadata()
80 entries = new Metadata.Entry[in.readInt()]; in Metadata()
[all …]
|
| /external/exoplayer/tree_15dc86382f17a24a3e881e52e31a810c1ea44b49/library/common/src/main/java/com/google/android/exoplayer2/metadata/ |
| D | Metadata.java | 27 /** A collection of metadata entries. */
55 * Entry} entries attempt to populate the same {@link MediaMetadata} field, then the last one in
63 private final Entry[] entries; field in Metadata
65 /** @param entries The metadata entries. */
66 public Metadata(Entry... entries) { in Metadata() argument
67 this.entries = entries; in Metadata()
70 /** @param entries The metadata entries. */
71 public Metadata(List<? extends Entry> entries) { in Metadata() argument
72 this.entries = entries.toArray(new Entry[0]); in Metadata()
76 entries = new Metadata.Entry[in.readInt()]; in Metadata()
[all …]
|
| /external/webrtc/api/ |
| D | rtp_packet_infos.h | 52 explicit RtpPacketInfos(const vector_type& entries) in RtpPacketInfos() argument
53 : data_(Data::Create(entries)) {} in RtpPacketInfos()
55 explicit RtpPacketInfos(vector_type&& entries) in RtpPacketInfos() argument
56 : data_(Data::Create(std::move(entries))) {} in RtpPacketInfos()
63 const_reference operator[](size_type pos) const { return entries()[pos]; }
65 const_reference at(size_type pos) const { return entries().at(pos); } in at()
66 const_reference front() const { return entries().front(); } in front()
67 const_reference back() const { return entries().back(); } in back()
69 const_iterator begin() const { return entries().begin(); } in begin()
70 const_iterator end() const { return entries().end(); } in end()
[all …]
|
| /external/google-fruit/include/fruit/impl/component_storage/ |
| D | partial_component_storage.defn.h | 34 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
35 (void)entries; in addBindings()
52 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
53 previous_storage.addBindings(entries); in addBindings()
70 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
71 previous_storage.addBindings(entries); in addBindings()
89 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
90 entries.push_back(InjectorStorage::createComponentStorageEntryForBindInstance<C, C>(instance)); in addBindings()
91 previous_storage.addBindings(entries); in addBindings()
109 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
[all …]
|
| /external/icing/icing/result/ |
| D | snippet-retriever_test.cc | 70 for (const SnippetProto::EntryProto& entry : snippet.entries()) { in GetPropertyPaths()
183 EXPECT_THAT(snippet.entries(), SizeIs(1)); in TEST_F()
184 EXPECT_THAT(snippet.entries(0).property_name(), Eq("body")); in TEST_F()
186 GetString(&document, snippet.entries(0).property_name()); in TEST_F()
187 EXPECT_THAT(GetWindows(content, snippet.entries(0)), ElementsAre("")); in TEST_F()
209 EXPECT_THAT(snippet.entries(), SizeIs(1)); in TEST_F()
210 EXPECT_THAT(snippet.entries(0).property_name(), Eq("body")); in TEST_F()
212 GetString(&document, snippet.entries(0).property_name()); in TEST_F()
213 EXPECT_THAT(GetWindows(content, snippet.entries(0)), ElementsAre("three")); in TEST_F()
235 EXPECT_THAT(snippet.entries(), SizeIs(1)); in TEST_F()
[all …]
|
| /external/autotest/utils/ |
| D | summarize_loadtest.py | 53 help='Dump all filtered entries.')
68 def summarize_entries(entries, skip=set()): argument
69 """Summarize a list of entries."""
78 'COUNT': len(entries),
80 summary.update({key: summarize_tags(entries, key) for key in TAG_KEYS
82 summary.update({key: summarize_values(entries, key) for key in VALUE_KEYS
86 def summarize_tags(entries, key): argument
88 tags = {str(entry[key]) for entry in entries}
91 def summarize_values(entries, key): argument
93 if entries is None or len(entries) == 0:
[all …]
|
| /external/cronet/net/log/ |
| D | net_log_unittest.cc | 44 auto entries = net_log_observer.GetEntries(); in TEST() local
45 EXPECT_EQ(0u, entries.size()); in TEST()
61 entries = net_log_observer.GetEntries(); in TEST()
62 ASSERT_EQ(2u, entries.size()); in TEST()
64 EXPECT_EQ(NetLogEventType::CANCELLED, entries[0].type); in TEST()
65 EXPECT_EQ(NetLogSourceType::NONE, entries[0].source.type); in TEST()
66 EXPECT_NE(NetLogSource::kInvalidId, entries[0].source.id); in TEST()
67 EXPECT_EQ(ticks0, entries[0].source.start_time); in TEST()
68 EXPECT_EQ(NetLogEventPhase::NONE, entries[0].phase); in TEST()
69 EXPECT_EQ(ticks0, entries[0].time); in TEST()
[all …]
|
| D | test_net_log_util.cc | 15 // Takes the list of entries and an offset, and returns an index into the array.
18 size_t GetIndex(const std::vector<NetLogEntry>& entries, int offset) { in GetIndex() argument
25 if (abs_offset > entries.size()) in GetIndex()
26 return entries.size(); in GetIndex()
27 return entries.size() - abs_offset; in GetIndex()
33 const std::vector<NetLogEntry>& entries, in LogContainsEvent() argument
37 size_t index = GetIndex(entries, offset); in LogContainsEvent()
38 if (index >= entries.size()) in LogContainsEvent()
40 const NetLogEntry& entry = entries[index]; in LogContainsEvent()
56 const std::vector<NetLogEntry>& entries, in LogContainsBeginEvent() argument
[all …]
|
| /external/googleapis/google/logging/v2/ |
| D | logging.proto | 48 // Deletes all the log entries in a log for the _Default Log Bucket. The log
49 // reappears if it receives new entries. Log entries written shortly before
50 // the delete operation might not be deleted. Entries received after the
63 // Writes log entries to Logging. This API method is the
64 // only way to send log entries to Logging. This method
67 // A single request may contain log entries for a maximum of 1000
73 post: "/v2/entries:write"
76 option (google.api.method_signature) = "log_name,resource,labels,entries";
79 // Lists log entries. Use this method to retrieve log entries that originated
81 // entries, see [Exporting
[all …]
|
| /external/rust/crates/indexmap/src/map/ |
| D | core.rs | 22 use crate::{Bucket, Entries, HashValue};
28 /// entries is a dense vec of entries in their order.
29 entries: Vec<Bucket<K, V>>, field
33 fn get_hash<K, V>(entries: &[Bucket<K, V>]) -> impl Fn(&usize) -> u64 + '_ { in get_hash()
34 move |&i| entries[i].hash.get() in get_hash()
40 entries: &'a [Bucket<K, V>], in equivalent()
42 move |&i| Q::equivalent(key, &entries[i].key) in equivalent()
66 let mut entries = Vec::with_capacity(indices.capacity()); in clone() localVariable
67 entries.clone_from(&self.entries); in clone()
68 IndexMapCore { indices, entries } in clone()
[all …]
|
| /external/google-breakpad/src/common/ |
| D | dwarf_cfi_to_module_unittest.cc | 86 vector<Module::StackFrameEntry*> entries; member
95 module.GetStackFrameEntries(&entries); in TEST_F()
96 EXPECT_EQ(1U, entries.size()); in TEST_F()
97 EXPECT_EQ(0xa21069698096fc98ULL, entries[0]->address); in TEST_F()
98 EXPECT_EQ(0xb440ce248169c8d6ULL, entries[0]->size); in TEST_F()
99 EXPECT_EQ(0U, entries[0]->initial_rules.size()); in TEST_F()
100 EXPECT_EQ(0U, entries[0]->rule_changes.size()); in TEST_F()
107 module.GetStackFrameEntries(&entries); in TEST_F()
108 EXPECT_EQ(1U, entries.size()); in TEST_F()
109 EXPECT_EQ(0x75b8806bb09eab78ULL, entries[0]->address); in TEST_F()
[all …]
|
| /external/skia/src/gpu/graphite/dawn/ |
| D | DawnResourceProvider.cpp | 109 // We need total of 4 entries in the uniform buffer bind group. in make_ubo_bind_group_key()
110 // Unused entries will be assigned zero values. in make_ubo_bind_group_key()
346 std::array<wgpu::BindGroupLayoutEntry, 4> entries; in getOrCreateUniformBuffersBindGroupLayout() local
347 entries[0].binding = DawnGraphicsPipeline::kIntrinsicUniformBufferIndex; in getOrCreateUniformBuffersBindGroupLayout()
348 entries[0].visibility = wgpu::ShaderStage::Vertex | wgpu::ShaderStage::Fragment; in getOrCreateUniformBuffersBindGroupLayout()
349 entries[0].buffer.type = wgpu::BufferBindingType::Uniform; in getOrCreateUniformBuffersBindGroupLayout()
350 entries[0].buffer.hasDynamicOffset = true; in getOrCreateUniformBuffersBindGroupLayout()
351 entries[0].buffer.minBindingSize = 0; in getOrCreateUniformBuffersBindGroupLayout()
353 entries[1].binding = DawnGraphicsPipeline::kRenderStepUniformBufferIndex; in getOrCreateUniformBuffersBindGroupLayout()
354 entries[1].visibility = wgpu::ShaderStage::Vertex | wgpu::ShaderStage::Fragment; in getOrCreateUniformBuffersBindGroupLayout()
[all …]
|
| /external/pigweed/pw_tokenizer/py/pw_tokenizer/ |
| D | tokens.py | 136 def __init__(self, entries: Iterable[TokenizedStringEntry] = ()):
144 self.add(entries)
178 def entries(self) -> ValuesView[TokenizedStringEntry]: member in Database
184 for token, entries in self.token_to_entries.items():
185 if len(entries) > 1:
186 yield token, entries
193 """Marks entries missing from all_entries as having been removed.
195 The entries are assumed to represent the complete set of entries for the
196 database. Entries currently in the database not present in the provided
197 entries are marked with a removal date but remain in the database.
[all …]
|
| /external/starlark-go/starlarkstruct/ |
| D | struct.go | 58 entries: make(entries, 0, len(kwargs)),
63 s.entries = append(s.entries, entry{k, v})
65 sort.Sort(s.entries)
77 entries: make(entries, 0, len(d)),
80 s.entries = append(s.entries, entry{k, v})
82 sort.Sort(s.entries)
103 entries entries // sorted by name member
110 type entries []entry type
112 func (a entries) Len() int { return len(a) }
113 func (a entries) Less(i, j int) bool { return a[i].name < a[j].name }
[all …]
|
| /external/llvm-libc/test/include/sys/ |
| D | queue_test.cpp | 23 SLIST_ENTRY(Entry) entries; in TEST()
36 SLIST_FOREACH(e, &head, entries) { v.append(e->c); } in TEST()
42 SLIST_INSERT_HEAD(&head, &e1, entries); in TEST()
47 SLIST_INSERT_AFTER(&e1, &e2, entries); in TEST()
54 SLIST_INSERT_HEAD(&head2, &e3, entries); in TEST()
62 SLIST_CONCAT(&head2, &head, Entry, entries); in TEST()
66 SLIST_CONCAT(&head, &head2, Entry, entries); in TEST()
71 SLIST_FOREACH_SAFE(e, &head, entries, tmp) { in TEST()
73 SLIST_REMOVE(&head, e, Entry, entries); in TEST()
81 SLIST_REMOVE_HEAD(&head, entries); in TEST()
[all …]
|
| /external/marisa-trie/tests/ |
| D | trie-test.cc | 234 marisa::grimoire::Vector<marisa::grimoire::trie::Entry> entries; in TestTextTail() local
236 tail.build(entries, &offsets, MARISA_TEXT_TAIL); in TestTextTail()
248 entries.push_back(entry); in TestTextTail()
250 tail.build(entries, &offsets, MARISA_TEXT_TAIL); in TestTextTail()
258 ASSERT(offsets.size() == entries.size()); in TestTextTail()
263 entries.clear(); in TestTextTail()
265 entries.push_back(entry); in TestTextTail()
267 entries.push_back(entry); in TestTextTail()
269 entries.push_back(entry); in TestTextTail()
271 entries.push_back(entry); in TestTextTail()
[all …]
|
| /external/iproute2/man/man8/ |
| D | lnstat.8 | 66 .B # lnstat -k arp_cache:entries,rt_cache:in_hit,arp_cache:destroys
81 .B # lnstat -c -1 -i 1 -f rt_cache -k entries,in_hit,in_slow_tot
82 Display statistics for keys entries, in_hit and in_slow_tot of field rt_cache every second.
89 .B entries
90 Number of entries in the neighbor table.
93 How many neighbor entries have been allocated.
96 How many neighbor entries have been removed.
124 How many neighbor table entries were discarded due to lookup failure.
135 .B entries
136 Number of entries in conntrack table.
[all …]
|
| /external/wayland/src/ |
| D | wayland-util.c | 199 struct wl_array *entries; in wl_map_insert_new() local
204 entries = &map->client_entries; in wl_map_insert_new()
207 entries = &map->server_entries; in wl_map_insert_new()
212 start = entries->data; in wl_map_insert_new()
216 entry = wl_array_add(entries, sizeof *entry); in wl_map_insert_new()
219 start = entries->data; in wl_map_insert_new()
249 struct wl_array *entries; in wl_map_insert_at() local
252 entries = &map->client_entries; in wl_map_insert_at()
254 entries = &map->server_entries; in wl_map_insert_at()
263 count = entries->size / sizeof *start; in wl_map_insert_at()
[all …]
|
| /external/cpuinfo/src/x86/cache/ |
| D | descriptor.c | 38 * "Instruction TLB: 4 KByte pages, 4-way set associative, 32 entries" in cpuinfo_x86_decode_cache_descriptor()
40 * "Instruction TLB: 4-KB Pages, 4-way set associative, 32 entries" in cpuinfo_x86_decode_cache_descriptor()
43 .entries = 32, in cpuinfo_x86_decode_cache_descriptor()
51 * "Instruction TLB: 4 MByte pages, fully associative, 2 entries" in cpuinfo_x86_decode_cache_descriptor()
53 * "Instruction TLB: 4-MB Pages, fully associative, 2 entries" in cpuinfo_x86_decode_cache_descriptor()
56 .entries = 2, in cpuinfo_x86_decode_cache_descriptor()
64 * "Data TLB: 4 KByte pages, 4-way set associative, 64 entries" in cpuinfo_x86_decode_cache_descriptor()
66 * "Data TLB: 4-KB Pages, 4-way set associative, 64 entries" in cpuinfo_x86_decode_cache_descriptor()
69 .entries = 64, in cpuinfo_x86_decode_cache_descriptor()
77 * "Data TLB: 4 MByte pages, 4-way set associative, 8 entries" in cpuinfo_x86_decode_cache_descriptor()
[all …]
|
| /external/clang/lib/CodeGen/ |
| D | SwiftCallingConv.cpp | 262 // Fast path: we can just add entries to the end. in addEntry()
263 if (Entries.empty() || Entries.back().End <= begin) { in addEntry()
264 Entries.push_back({begin, end, type}); in addEntry()
269 // TODO: do a binary search if Entries is big enough for it to matter. in addEntry()
270 size_t index = Entries.size() - 1; in addEntry()
272 if (Entries[index - 1].End <= begin) break; in addEntry()
278 if (Entries[index].Begin >= end) { in addEntry()
282 Entries.insert(Entries.begin() + index, {begin, end, type}); in addEntry()
291 if (Entries[index].Begin == begin && Entries[index].End == end) { in addEntry()
293 if (Entries[index].Type == type) return; in addEntry()
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | ObjectCountHashMap.java | 36 * a traditional {@code HashMap} implementation which stores keys and count values as map entries,
76 // used to indicate blank table entries
84 /** The keys of the entries in the map. */
87 /** The values of the entries in the map. */
95 * The hashtable. Its values are indexes to the keys, values, and entries arrays.
105 * Contains the logical entries, in the range of [0, size()). The high 32 bits of each long is the
107 * next entry in the bucket chain). The pointers in [size(), entries.length) are all "null"
110 @VisibleForTesting transient long[] entries; field in ObjectCountHashMap
153 this.entries = newEntries(expectedSize); in init()
273 if (minCapacity > entries.length) { in ensureCapacity()
[all …]
|