Home
last modified time | relevance | path

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

12345678910>>...42

/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...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/moduletest/src/
H A Ddistributeddb_nb_predicate_query_test.cpp96 const vector<string> &schemasValue, vector<Entry> &entries, const std::string schemaDefine) in PrepareSchemaDBAndData()
116 entries.push_back({keys[index], value}); in PrepareSchemaDBAndData()
120 EXPECT_EQ(DistributedDBNbTestTools::Put(*delegate, entries[index].key, entries[index].value), OK); in PrepareSchemaDBAndData()
128 vector<Entry> entries; in CheckSchemaQuery() local
130 DBStatus statusGot = delegate->GetEntries(queryNeedCheck, entries); in CheckSchemaQuery()
132 MST_LOG("GetEntries entries result: %d, statusGot: %d", result, statusGot); in CheckSchemaQuery()
133 for (unsigned long index = 0; index < entries.size(); index++) { in CheckSchemaQuery()
135 result = (entries[index].key == expectEntry[index].key) && result; in CheckSchemaQuery()
136 MST_LOG("check entries[ in CheckSchemaQuery()
95 PrepareSchemaDBAndData(KvStoreNbDelegate *&delegate, KvStoreDelegateManager *&manager, const vector<string> &schemasValue, vector<Entry> &entries, const std::string schemaDefine) PrepareSchemaDBAndData() argument
170 vector<Entry> entries; CheckSchemaQueryForOrderBy() local
204 vector<Entry> entries; CheckSchemaNotExist() local
273 vector<Entry> entries; HWTEST_F() local
393 vector<Entry> entries; HWTEST_F() local
427 CheckSchemaBoolNotExist(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaBoolNotExist() argument
479 CheckSchemaBoolExist(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaBoolExist() argument
525 vector<Entry> entries; HWTEST_F() local
608 vector<Entry> entries; HWTEST_F() local
655 CheckSchemaExceptionValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaExceptionValue() argument
715 CheckSchemaIntValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaIntValue() argument
786 vector<Entry> entries; HWTEST_F() local
904 vector<Entry> entries; HWTEST_F() local
950 vector<Entry> entries; HWTEST_F() local
1024 vector<Entry> entries; HWTEST_F() local
1058 CheckSchemaDoubleExceptionValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaDoubleExceptionValue() argument
1113 CheckSchemaDoubleValue(KvStoreNbDelegate *&delegate, vector<Entry> &entries) CheckSchemaDoubleValue() argument
1168 vector<Entry> entries; HWTEST_F() local
1243 vector<Entry> entries; HWTEST_F() local
1300 vector<Entry> entries; HWTEST_F() local
1353 vector<Entry> entries; HWTEST_F() local
1417 vector<Entry> entries; HWTEST_F() local
1483 vector<Entry> entries; HWTEST_F() local
1561 vector<Entry> entries; HWTEST_F() local
1613 vector<Entry> entries; HWTEST_F() local
1682 vector<Entry> entries; HWTEST_F() local
1746 vector<Entry> entries; HWTEST_F() local
1807 vector<Entry> entries; HWTEST_F() local
1840 vector<Entry> entries; HWTEST_F() local
1927 vector<Entry> entries; HWTEST_F() local
[all...]
H A Ddistributeddb_nb_observer_test.cpp234 * @tc.steps: step2. put one entries (KEY_1, VALUE_1) to local db. in CheckObserverAllLocalValue()
245 * @tc.steps: step3. update one entries (KEY_2, VALUE_2) of local db. in CheckObserverAllLocalValue()
325 * @tc.steps: step2. put one entries (KEY_1, VALUE_1) to local db. in CheckObserverAllNativeValue()
334 * @tc.steps: step3. update one entries (KEY_2, VALUE_2) of local db. in CheckObserverAllNativeValue()
444 * @tc.steps: step3. put one entries (KEY_2, VALUE_2) to local db. in HWTEST_F()
455 * @tc.steps: step4. delete one entries from local db where key = KEY_2. in HWTEST_F()
466 * @tc.steps: step5. put one entries (KEY_1, VALUE_1) to sync db. in HWTEST_F()
477 * @tc.steps: step6. delete one entries from sync db where key = KEY_1. in HWTEST_F()
515 * @tc.steps: step2. delete one entries from local db where key = KEY_1. in HWTEST_F()
525 * @tc.steps: step3. delete one entries fro in HWTEST_F()
1281 CheckPressureForLocalRepeat(KvStoreObserverImpl &observerLocal, KvStoreObserverImpl &observerSync, vector< vector<DistributedDB::Entry> > &entries) CheckPressureForLocalRepeat() argument
1376 CheckPressureForNativeRepeat(KvStoreObserverImpl &observerLocal, KvStoreObserverImpl &observerSync, vector< vector<DistributedDB::Entry> > &entries) CheckPressureForNativeRepeat() argument
1609 CheckPressureAfterClose(KvStoreObserverImpl &observerLocal, KvStoreObserverImpl &observerSync, vector< vector<DistributedDB::Entry> > &entries) CheckPressureAfterClose() argument
1701 CheckPressureAfterReopen(KvStoreObserverImpl &observerLocal, KvStoreObserverImpl &observerSync, vector< vector<DistributedDB::Entry> > &entries) CheckPressureAfterReopen() argument
1914 CheckPressureAcrossDatabase(vector<KvStoreNbDelegate *> &nbDelegateVec, KvStoreObserverImpl *observerLocals, KvStoreObserverImpl *observerSyncs, vector< vector<DistributedDB::Entry> > &entries, unsigned int &opCnt) CheckPressureAcrossDatabase() argument
[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/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/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/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/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/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/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/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/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...]
/foundation/filemanagement/storage_service/services/storage_daemon/file_sharing/src/
H A Dacl.cpp28 for (const auto &e : entries) { in ReCalcMaskPerm()
38 return entries.empty(); in IsEmpty()
43 if (!entries.count(ACL_TAG::USER_OBJ) || !entries.count(ACL_TAG::GROUP_OBJ) || in IsValid()
44 !entries.count(ACL_TAG::OTHER)) { in IsValid()
47 if (maskDemand && !entries.count(ACL_TAG::MASK)) { in IsValid()
55 if (entries.count(entry)) { in CompareInsertEntry()
56 auto it = entries.find(entry); in CompareInsertEntry()
57 entries.erase(it); in CompareInsertEntry()
60 entries in CompareInsertEntry()
[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/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...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/unittest/common/storage/
H A Ddistributeddb_relational_get_data_test.cpp243 void ExpectMissQueryCnt(const std::vector<SingleVerKvEntry *> &entries, size_t expectCount) in ExpectMissQueryCnt() argument
246 for (auto iter = entries.begin(); iter != entries.end(); ++iter) { in ExpectMissQueryCnt()
251 if (nextOne != entries.end()) { in ExpectMissQueryCnt()
385 std::vector<SingleVerKvEntry *> entries; in HWTEST_F() local
388 int errCode = store->GetSyncData(query, SyncTimeRange {}, sizeInfo, token, entries); in HWTEST_F()
389 auto count = entries.size(); in HWTEST_F()
390 SingleVerKvEntry::Release(entries); in HWTEST_F()
393 errCode = store->GetSyncDataNext(entries, token, sizeInfo); in HWTEST_F()
394 count += entries in HWTEST_F()
439 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
493 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
573 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
617 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
703 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
789 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
863 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
933 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1037 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1122 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1187 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1278 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1339 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1471 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1717 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
[all...]
H A Ddistributeddb_storage_transaction_data_test.cpp95 static int RunSyncMergeForOneCommit(std::vector<MultiVerKvEntry *> &entries) in RunSyncMergeForOneCommit() argument
103 int errCode = g_naturalStore->PutCommitData(multiVerCommit, entries, "deviceB"); in RunSyncMergeForOneCommit()
114 for (auto &item : entries) { in RunSyncMergeForOneCommit()
120 entries.clear(); in RunSyncMergeForOneCommit()
186 std::vector<MultiVerKvEntry *> &entries) in PushOneEntry()
212 entries.push_back(entry); in PushOneEntry()
547 std::vector<Entry> entries; in HWTEST_F() local
548 entries.push_back(KV_ENTRY_1); in HWTEST_F()
549 entries.push_back(KV_ENTRY_2); in HWTEST_F()
551 EXPECT_EQ(g_naturalStoreConnection->PutBatch(option, entries), E_O in HWTEST_F()
185 PushOneEntry(uint64_t opr, uint64_t timestamp, const Key &key, const Value &value, std::vector<MultiVerKvEntry *> &entries) PushOneEntry() argument
577 std::vector<Entry> entries; HWTEST_F() local
683 std::vector<Entry> entries; HWTEST_F() local
719 std::vector<Entry> entries; HWTEST_F() local
757 std::vector<Entry> entries; HWTEST_F() local
861 std::vector<Entry> entries; HWTEST_F() local
895 std::vector<Entry> entries; HWTEST_F() local
1015 std::vector<MultiVerKvEntry *> entries; HWTEST_F() local
1061 std::vector<MultiVerKvEntry *> entries; HWTEST_F() local
1207 std::vector<MultiVerKvEntry *> entries; HWTEST_F() local
1265 std::vector<MultiVerKvEntry *> entries; global() local
1324 std::vector<MultiVerKvEntry *> entries; HWTEST_F() local
1362 std::vector<MultiVerKvEntry *> entries; PutFirstSyncCommitData() local
1394 std::vector<MultiVerKvEntry *> entries; PutSecondSyncCommitData() local
1455 ReleaseKvEntries(std::vector<MultiVerKvEntry *> &entries) ReleaseKvEntries() argument
1492 std::vector<MultiVerKvEntry *> entries; HWTEST_F() local
1538 std::vector<MultiVerKvEntry *> entries; HWTEST_F() local
[all...]
H A Ddistributeddb_storage_query_sync_test.cpp61 void ReleaseKvEntries(std::vector<SingleVerKvEntry *> &entries) in ReleaseKvEntries() argument
63 for (auto &itemEntry : entries) { in ReleaseKvEntries()
67 entries.clear(); in ReleaseKvEntries()
167 std::vector<Entry> entries; in SetUp() local
170 g_schemaConnect->GetEntries(option, Query::Select(), entries); in SetUp()
171 ASSERT_FALSE(entries.empty()); in SetUp()
216 std::vector<SingleVerKvEntry *> entries; in HWTEST_F() local
218 EXPECT_EQ(g_store->GetSyncData(queryObj, SyncTimeRange{}, specInfo, token, entries), E_OK); in HWTEST_F()
219 EXPECT_EQ(entries.size(), 1UL); in HWTEST_F()
220 ReleaseKvEntries(entries); in HWTEST_F()
256 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
325 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
388 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
453 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
520 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
568 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
664 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
736 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
931 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1003 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1084 std::vector<SingleVerKvEntry *> entries; HWTEST_F() local
1262 std::vector<Entry> entries; HWTEST_F() local
[all...]
/foundation/graphic/graphic_2d/frameworks/opengl_wrapper/src/EGL/
H A Degl_wrapper_layer.cpp55 EglWrapperFuncPointer *curr, char const * const *entries) in UpdateApiEntries()
58 while (*entries) { in UpdateApiEntries()
59 char const *name = *entries; in UpdateApiEntries()
68 entries++; in UpdateApiEntries()
73 char const * const *entries, EglWrapperFuncPointer *curr) in SetupFuncMaps()
76 while (*entries) { in SetupFuncMaps()
77 const char *name = *entries; in SetupFuncMaps()
84 entries++; in SetupFuncMaps()
231 char const * const *entries; in SetupLayerFuncTbl() local
234 entries in SetupLayerFuncTbl()
54 UpdateApiEntries(LayerSetupFunc func, EglWrapperFuncPointer *curr, char const * const *entries) UpdateApiEntries() argument
72 SetupFuncMaps(FunctionTable &table, char const * const *entries, EglWrapperFuncPointer *curr) SetupFuncMaps() argument
[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...]
/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...]
/foundation/distributeddatamgr/kv_store/frameworks/common/test/
H A Dconcurrent_map_test.cpp75 [](const decltype(values_)::map_type &entries) { in HWTEST_F()
76 return (entries.find("test") == entries.end()); in HWTEST_F()
81 [](const decltype(values_)::map_type &entries) { in HWTEST_F()
82 return (entries.find("test") == entries.end()); in HWTEST_F()
87 [](decltype(values_)::map_type &entries) { in HWTEST_F()
88 auto it = entries.find("test"); in HWTEST_F()
89 if (it != entries.end()) { in HWTEST_F()
90 entries in HWTEST_F()
[all...]
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/test/
H A Dudmf_run_time_store_test.cpp117 * @tc.desc: check for legal parameters, sum size of all entries is smaller than 512M.
139 vector<Entry> entries; in HWTEST_F() local
140 status = store->GetEntries(KEY_PREFIX, entries); in HWTEST_F()
142 EXPECT_EQ(129, entries.size()); in HWTEST_F()
150 * @tc.desc: check for legal parameters, sum size of all entries is equal to 512M.
172 vector<Entry> entries; in HWTEST_F() local
173 status = store->GetEntries(KEY_PREFIX, entries); in HWTEST_F()
175 EXPECT_EQ(1, entries.size()); in HWTEST_F()
183 * @tc.desc: test rollback, sum size of all entries is larger to 512M.
206 vector<Entry> entries; in HWTEST_F() local
237 vector<Entry> entries; HWTEST_F() local
278 vector<Entry> entries; HWTEST_F() local
317 vector<Entry> entries; HWTEST_F() local
357 vector<Entry> entries; HWTEST_F() local
473 vector<Entry> entries; HWTEST_F() local
509 vector<Entry> entries; HWTEST_F() local
[all...]

Completed in 15 milliseconds

12345678910>>...42