Home
last modified time | relevance | path

Searched refs:entries (Results 1 - 25 of 786) sorted by relevance

12345678910>>...32

/third_party/node/test/fixtures/wpt/user-timing/
H A Dmark.any.js6 function match_entries(entries, index)
8 var entry = entries[index];
38 const entries = self.performance.getEntriesByName("mark");
39 assert_equals(entries.length, 1);
48 const entries = self.performance.getEntriesByName("mark");
49 assert_equals(entries.length, 2);
55 const entries = self.performance.getEntriesByName("mark");
56 assert_equals(entries[index].name, "mark", "Entry has the proper name");
60 const entries = self.performance.getEntriesByName("mark");
61 assert_approx_equals(entries[inde
[all...]
/third_party/libexif/libexif/huawei/
H A Dexif-mnote-data-huawei.c46 if (n->entries) { in exif_mnote_data_huawei_clear()
48 if (n->entries[i].data) { in exif_mnote_data_huawei_clear()
49 exif_mem_free(d->mem, n->entries[i].data); in exif_mnote_data_huawei_clear()
50 n->entries[i].data = NULL; in exif_mnote_data_huawei_clear()
51 n->entries[i].size = 0; in exif_mnote_data_huawei_clear()
54 if (n->entries[i].md) { in exif_mnote_data_huawei_clear()
55 exif_mnote_data_huawei_clear((ExifMnoteDataHuawei *) n->entries[i].md); in exif_mnote_data_huawei_clear()
56 exif_mem_free(d->mem, n->entries[i].md); in exif_mnote_data_huawei_clear()
57 n->entries[i].md = NULL; in exif_mnote_data_huawei_clear()
61 exif_mem_free (d->mem, n->entries); in exif_mnote_data_huawei_clear()
266 MnoteHuaweiEntry* entries = exif_mem_alloc (ne->mem, sizeof (MnoteHuaweiEntry) * count); exif_mnote_data_huawei_load_data() local
707 MnoteHuaweiEntry *entries = exif_mem_realloc (ne->mem, exif_mnote_data_add_entry() local
833 MnoteHuaweiEntry *entries = n->entries; print_huawei_md() local
[all...]
/third_party/libexif/libexif/canon/
H A Dexif-mnote-data-canon.c46 if (n->entries) { in exif_mnote_data_canon_clear()
48 if (n->entries[i].data) { in exif_mnote_data_canon_clear()
49 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_canon_clear()
50 n->entries[i].data = NULL; in exif_mnote_data_canon_clear()
52 exif_mem_free (d->mem, n->entries); in exif_mnote_data_canon_clear()
53 n->entries = NULL; in exif_mnote_data_canon_clear()
74 to = from + mnote_canon_entry_count_values (&dc->entries[*m]); in exif_mnote_data_canon_get_tags()
92 return mnote_canon_entry_get_value (&dc->entries[m], s, val, maxlen); in exif_mnote_data_canon_get_value()
107 if (n->entries[i].components && (n->entries[ in exif_mnote_data_canon_set_byte_order()
[all...]
/third_party/libexif/libexif/apple/
H A Dexif-mnote-data-apple.c42 if (d->entries) { in exif_mnote_data_apple_free()
44 if (d->entries[i].data) { in exif_mnote_data_apple_free()
45 exif_mem_free(md->mem, d->entries[i].data); in exif_mnote_data_apple_free()
48 exif_mem_free(md->mem, d->entries); in exif_mnote_data_apple_free()
49 d->entries = NULL; in exif_mnote_data_apple_free()
107 d->entries = exif_mem_alloc(md->mem, sizeof(MnoteAppleEntry) * tcount); in exif_mnote_data_apple_load()
108 if (!d->entries) { in exif_mnote_data_apple_load()
113 memset(d->entries, 0, sizeof(MnoteAppleEntry) * tcount); in exif_mnote_data_apple_load()
121 d->entries[i].tag = exif_get_short(buf + ofs, d->order); in exif_mnote_data_apple_load()
122 d->entries[ in exif_mnote_data_apple_load()
[all...]
/third_party/rust/crates/rustix/tests/fs/
H A Dreaddir.rs16 let entries = read_entries(&mut dir); in dir_entries()
17 assert_eq!(entries.len(), 0, "no files in directory"); in dir_entries()
21 let entries = read_entries(&mut dir); in dir_entries()
23 entries.get("file1").is_some(), in dir_entries()
25 entries in dir_entries()
27 assert_eq!(entries.len(), 1); in dir_entries()
30 let entries = read_entries(&mut dir); in dir_entries()
32 entries.get("file1").is_some(), in dir_entries()
34 entries in dir_entries()
37 entries in dir_entries()
[all...]
/third_party/libexif/libexif/pentax/
H A Dexif-mnote-data-pentax.c41 if (n->entries) { in exif_mnote_data_pentax_clear()
43 if (n->entries[i].data) { in exif_mnote_data_pentax_clear()
44 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_pentax_clear()
45 n->entries[i].data = NULL; in exif_mnote_data_pentax_clear()
47 exif_mem_free (d->mem, n->entries); in exif_mnote_data_pentax_clear()
48 n->entries = NULL; in exif_mnote_data_pentax_clear()
68 return mnote_pentax_entry_get_value (&n->entries[i], val, maxlen); in exif_mnote_data_pentax_get_value()
92 * Allocate enough memory for header, the number of entries, entries, in exif_mnote_data_pentax_save()
141 * such, just has a fixed number of entries equa in exif_mnote_data_pentax_save()
[all...]
/third_party/libexif/libexif/fuji/
H A Dexif-mnote-data-fuji.c45 if (n->entries) { in exif_mnote_data_fuji_clear()
47 if (n->entries[i].data) { in exif_mnote_data_fuji_clear()
48 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_fuji_clear()
49 n->entries[i].data = NULL; in exif_mnote_data_fuji_clear()
51 exif_mem_free (d->mem, n->entries); in exif_mnote_data_fuji_clear()
52 n->entries = NULL; in exif_mnote_data_fuji_clear()
75 mnote_fuji_tag_get_name (n->entries[i].tag)); in exif_mnote_data_fuji_get_value()
77 return mnote_fuji_entry_get_value (&n->entries[i], val, maxlen); in exif_mnote_data_fuji_get_value()
92 * Allocate enough memory for all entries and the number in exif_mnote_data_fuji_save()
93 * of entries in exif_mnote_data_fuji_save()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DuseObjectValuesAndEntries1.js8 var entries = Object.entries(o); // [string, number][]
11 var entries1 = Object.entries(1); // [string, any][]
14 var entries2 = Object.entries({ a: true, b: 2 }); // [string, number|boolean][]
17 var entries3 = Object.entries({}); // [string, {}][]
21 var entries4 = Object.entries(a); // [string, string][]
25 var entries5 = Object.entries(E); // [string, any][]
30 var entries6 = Object.entries(i); // [string, any][]
39 var entries = Object.entries(
[all...]
/third_party/pulseaudio/src/tests/
H A Dhashmap-test.c83 /* remove_all_test checks that pa_hashmap_remove_all really removes all entries
88 struct int_entry entries[1000]; in START_TEST() local
92 entries[i].key = i; in START_TEST()
93 entries[i].value = i; in START_TEST()
99 pa_hashmap_put(map, &entries[i].key, &entries[i]); in START_TEST()
121 struct int_entry entries[1000]; in START_TEST() local
127 entries[i].key = i; in START_TEST()
129 entries[i].value = i; in START_TEST()
136 if ((put_ret = pa_hashmap_put(map, &entries[ in START_TEST()
173 struct int_entry entries[1000]; START_TEST() local
[all...]
/third_party/rust/crates/nix/src/
H A Dmacros.rs107 entries: [$($entries:tt)*],
113 $($entries)*
123 entries: [$($entries:tt)*],
131 $($entries)*
152 $entries:tt,
161 entries: $entries,
174 $entries
[all...]
/third_party/toybox/toys/posix/
H A Dxargs.c42 long entries, bytes;
47 // If !entry count TT.bytes and TT.entries, stopping at max.
67 if (TT.n && TT.entries >= TT.n) in handle_entries()
82 if (entry) entry[TT.entries] = save; in handle_entries()
83 ++TT.entries; in handle_entries()
89 if ((TT.s && TT.bytes >= TT.s) || (TT.n && TT.entries >= TT.n)) return data; in handle_entries()
90 if (entry) entry[TT.entries] = data; in handle_entries()
91 TT.entries++; in handle_entries()
100 int entries, bytes, done = 0, ran_once = 0, status; in xargs_main() local
121 // count entries in xargs_main()
[all...]
/third_party/libexif/libexif/olympus/
H A Dexif-mnote-data-olympus.c53 if (n->entries) { in exif_mnote_data_olympus_clear()
55 if (n->entries[i].data) { in exif_mnote_data_olympus_clear()
56 exif_mem_free (d->mem, n->entries[i].data); in exif_mnote_data_olympus_clear()
57 n->entries[i].data = NULL; in exif_mnote_data_olympus_clear()
59 exif_mem_free (d->mem, n->entries); in exif_mnote_data_olympus_clear()
60 n->entries = NULL; in exif_mnote_data_olympus_clear()
83 mnote_olympus_tag_get_name (n->entries[i].tag)); in exif_mnote_data_olympus_get_value()
85 return mnote_olympus_entry_get_value (&n->entries[i], val, maxlen); in exif_mnote_data_olympus_get_value()
111 * Allocate enough memory for all entries and the number of entries in exif_mnote_data_olympus_save()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/pipebuffer/
H A Dpb_validate.c58 struct pb_validate_entry *entries; member
84 struct pb_validate_entry *entry = &vl->entries[entry_idx - 1]; in pb_validate_add_buffer()
103 new_entries = (struct pb_validate_entry *)REALLOC(vl->entries, in pb_validate_add_buffer()
112 vl->entries = new_entries; in pb_validate_add_buffer()
115 assert(!vl->entries[vl->used].buf); in pb_validate_add_buffer()
116 pb_reference(&vl->entries[vl->used].buf, buf); in pb_validate_add_buffer()
117 vl->entries[vl->used].flags = flags; in pb_validate_add_buffer()
135 ret = callback(vl->entries[i].buf, data); in pb_validate_foreach()
150 ret = pb_validate(vl->entries[i].buf, vl, vl->entries[ in pb_validate_validate()
[all...]
/third_party/node/test/parallel/
H A Dtest-perf-hooks-resourcetiming.js93 const entries = performance.getEntries();
94 assert.strictEqual(entries.length, 1);
95 assert(entries[0] instanceof PerformanceResourceTiming);
99 const entries = performance.getEntriesByType('resource');
100 assert.strictEqual(entries.length, 1);
101 assert(entries[0] instanceof PerformanceResourceTiming);
105 const entries = performance.getEntriesByName(resource.name);
106 assert.strictEqual(entries.length, 1);
107 assert(entries[0] instanceof PerformanceResourceTiming);
232 const entries
[all...]
H A Dtest-performance-resourcetimingbufferfull.js59 const entries = performance.getEntriesByType('resource');
60 assert.strictEqual(entries.length, 1);
61 assert.strictEqual(entries[0].startTime, 2);
89 const entries = performance.getEntriesByType('resource');
90 assert.strictEqual(entries.length, 2);
91 assert.strictEqual(entries[0].startTime, 4);
92 assert.strictEqual(entries[1].startTime, 5);
120 const entries = performance.getEntriesByType('resource');
121 assert.strictEqual(entries.length, 2);
122 assert.strictEqual(entries[
[all...]
/third_party/mesa3d/src/util/tests/
H A Dset_test.cpp39 EXPECT_EQ(s->entries, 2); in TEST()
42 EXPECT_EQ(s->entries, 2); in TEST()
49 EXPECT_EQ(s->entries, 1); in TEST()
55 EXPECT_EQ(s->entries, 0); in TEST()
63 EXPECT_EQ(s->entries, 2); in TEST()
64 unsigned count = s->entries; in TEST()
67 EXPECT_EQ(s->entries, count--); in TEST()
70 EXPECT_EQ(s->entries, 0); in TEST()
97 EXPECT_EQ(s->entries, 2); in TEST()
100 EXPECT_EQ(clone->entries, in TEST()
[all...]
/third_party/mesa3d/src/mapi/
H A Dmapi_abi.py40 # number of dynamic entries
137 """Parse a GLAPI XML file for ABI entries."""
181 entries = sorted(entry_dict.values())
183 return entries
185 def abi_sanity_check(entries):
186 if not entries:
190 last_slot = entries[-1].slot
193 if entries[i].slot != slot:
194 raise Exception('entries are not ordered by slots')
195 if entries[
[all...]
/third_party/libexif/libexif/
H A Dexif-content.c107 exif_entry_unref (content->entries[i]); in exif_content_free()
108 exif_mem_free (mem, content->entries); in exif_content_free()
132 printf ("%sDumping exif content (%u entries)...\n", buf, in exif_content_dump()
135 exif_entry_dump (content->entries[i], indent + 1); in exif_content_dump()
141 ExifEntry **entries; in exif_content_add_entry() local
153 entries = exif_mem_realloc (c->priv->mem, in exif_content_add_entry()
154 c->entries, sizeof (ExifEntry*) * (c->count + 1)); in exif_content_add_entry()
155 if (!entries) return; in exif_content_add_entry()
157 entries[c->count++] = entry; in exif_content_add_entry()
158 c->entries in exif_content_add_entry()
[all...]
/third_party/mesa3d/src/gallium/auxiliary/util/
H A Du_log.c35 struct page_entry *entries; member
165 struct page_entry *new_entries = REALLOC(page->entries, in u_log_chunk()
166 page->max_entries * sizeof(*page->entries), in u_log_chunk()
167 new_max_entries * sizeof(*page->entries)); in u_log_chunk()
171 page->entries = new_entries; in u_log_chunk()
175 page->entries[page->num_entries].type = type; in u_log_chunk()
176 page->entries[page->num_entries].data = data; in u_log_chunk()
224 if (page->entries[i].type->destroy) in u_log_page_destroy()
225 page->entries[i].type->destroy(page->entries[ in u_log_page_destroy()
[all...]
/third_party/protobuf/js/compatibility_tests/v3.1.0/
H A Dmaps_test.js44 * Helper: check that the given map has exactly this set of (sorted) entries.
46 * @param {!Array<!Array<?>>} entries
48 function checkMapEquals(map, entries) {
50 assertEquals(arr.length, entries.length);
52 assertElementsEquals(arr[i], entries[i]);
151 var entries = toArray(msg.getMapStringMsgMap().entries());
152 assertEquals(entries.length, 2);
153 entries.forEach(function(entry) {
186 var it = m.entries();
[all...]
/third_party/rust/crates/syn/src/
H A Dbuffer.rs18 // Group entries contain the offset to the matching End entry.
23 // End entries contain the offset (negative) to the start of the buffer.
33 entries: Box<[Entry]>,
37 fn recursive_new(entries: &mut Vec<Entry>, stream: TokenStream) { in recursive_new()
40 TokenTree::Ident(ident) => entries.push(Entry::Ident(ident)), in recursive_new()
41 TokenTree::Punct(punct) => entries.push(Entry::Punct(punct)), in recursive_new()
42 TokenTree::Literal(literal) => entries.push(Entry::Literal(literal)), in recursive_new()
44 let group_start_index = entries.len(); in recursive_new()
45 entries.push(Entry::End(0)); // we replace this below in recursive_new()
46 Self::recursive_new(entries, grou in recursive_new()
67 let mut entries = Vec::new(); new2() variables
[all...]
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dx_name.c96 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL) in x509_name_ex_new()
107 sk_X509_NAME_ENTRY_free(ret->entries); in x509_name_ex_new()
122 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free); in x509_name_ex_free()
157 STACK_OF(X509_NAME_ENTRY) *entries; in x509_name_ex_d2i()
183 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); in x509_name_ex_d2i()
184 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { in x509_name_ex_d2i()
185 entry = sk_X509_NAME_ENTRY_value(entries, j); in x509_name_ex_d2i()
187 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) in x509_name_ex_d2i()
189 (void)sk_X509_NAME_ENTRY_set(entries, j, NULL); in x509_name_ex_d2i()
243 STACK_OF(X509_NAME_ENTRY) *entries in x509_name_encode()
[all...]
/third_party/openssl/crypto/x509/
H A Dx_name.c96 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL) in x509_name_ex_new()
107 sk_X509_NAME_ENTRY_free(ret->entries); in x509_name_ex_new()
122 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free); in x509_name_ex_free()
157 STACK_OF(X509_NAME_ENTRY) *entries; in x509_name_ex_d2i()
183 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i); in x509_name_ex_d2i()
184 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) { in x509_name_ex_d2i()
185 entry = sk_X509_NAME_ENTRY_value(entries, j); in x509_name_ex_d2i()
187 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry)) in x509_name_ex_d2i()
189 (void)sk_X509_NAME_ENTRY_set(entries, j, NULL); in x509_name_ex_d2i()
243 STACK_OF(X509_NAME_ENTRY) *entries in x509_name_encode()
[all...]
/third_party/eudev/src/libudev/
H A Dlibudev-list.c131 cmp = strcmp(name, list->entries[i]->name); in list_search()
153 entry = list->entries[i]; in udev_list_entry_add()
188 struct udev_list_entry **entries; in udev_list_entry_add() local
194 entries = realloc(list->entries, (list->entries_max + add) * sizeof(struct udev_list_entry *)); in udev_list_entry_add()
195 if (entries == NULL) { in udev_list_entry_add()
201 list->entries = entries; in udev_list_entry_add()
210 udev_list_entry_insert_before(entry, list->entries[i]); in udev_list_entry_add()
215 memmove(&list->entries[ in udev_list_entry_add()
[all...]
/third_party/mesa3d/src/util/
H A Du_worklist.c40 w->entries = rzalloc_array(mem_ctx, unsigned *, num_entries); in u_worklist_init()
47 ralloc_free(w->entries); in u_worklist_fini()
66 w->entries[w->start] = index; in u_worklist_push_head_index()
75 return w->entries[w->start]; in u_worklist_peek_head_index()
88 BITSET_CLEAR(w->present, *(w->entries[head])); in u_worklist_pop_head_index()
89 return w->entries[head]; in u_worklist_pop_head_index()
105 w->entries[tail] = index; in u_worklist_push_tail_index()
116 return w->entries[tail]; in u_worklist_peek_tail_index()
128 BITSET_CLEAR(w->present, *(w->entries[tail])); in u_worklist_pop_tail_index()
129 return w->entries[tai in u_worklist_pop_tail_index()
[all...]

Completed in 10 milliseconds

12345678910>>...32