Home
last modified time | relevance | path

Searched refs:entry (Results 176 - 200 of 2598) sorted by relevance

12345678910>>...104

/third_party/node/deps/zlib/google/
H A Dzip_reader_unittest.cc132 while (const zip::ZipReader::Entry* const entry = reader->Next()) { in LocateAndOpenEntry()
134 if (entry->path == path_in_zip) in LocateAndOpenEntry()
135 return entry; in LocateAndOpenEntry()
176 while (const ZipReader::Entry* const entry = reader.Next()) {
178 paths.push_back(entry->path);
249 while (const ZipReader::Entry* const entry = reader.Next()) { in TEST_F()
251 actual_contents.push_back(entry->path); in TEST_F()
270 while (const ZipReader::Entry* const entry = reader.Next()) { in TEST_F()
272 actual_contents.push_back(entry->path); in TEST_F()
288 const ZipReader::Entry* entry in TEST_F() local
306 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
317 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
377 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
388 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
407 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
423 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
442 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
458 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
469 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
854 const ZipReader::Entry* const entry = TEST_F() member in zip::ZipReader
[all...]
/third_party/node/deps/v8/src/objects/
H A Dordered-hash-table.h47 // item at kChainOffset is another entry
49 // entry in this hash bucket.
120 // use IsKey to check if this is a deleted entry.
121 Object KeyAt(InternalIndex entry) { in KeyAt() argument
122 DCHECK_LT(entry.as_int(), this->UsedCapacity()); in KeyAt()
123 return get(EntryToIndex(entry)); in KeyAt()
126 // Similar to KeyAt, but indicates whether the given entry is valid
128 inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_key);
221 Object entry = this->get(HashTableStartIndex() + bucket); in HashToEntryRaw() local
222 int entry_int = Smi::ToInt(entry); in HashToEntryRaw()
227 NextChainEntryRaw(int entry) NextChainEntryRaw() argument
236 EntryToIndexRaw(int entry) EntryToIndexRaw() argument
240 EntryToIndex(InternalIndex entry) EntryToIndex() argument
[all...]
/foundation/distributeddatamgr/pasteboard/framework/test/src/
H A Dpaste_data_record_test.cpp45 void CheckPlainUds(const std::shared_ptr<PasteDataEntry> entry);
46 void CheckFileUriUds(const std::shared_ptr<PasteDataEntry> entry);
47 void CheckPixelMapUds(const std::shared_ptr<PasteDataEntry> entry);
48 void CheckHtmlUds(const std::shared_ptr<PasteDataEntry> entry);
49 void CheckLinkUds(const std::shared_ptr<PasteDataEntry> entry);
126 for (auto const &entry : entries) { in CheckEntries()
127 if (entry->GetUtdId() == UDMF::UtdUtils::GetUtdIdFromUtdEnum(UDMF::PLAIN_TEXT)) { in CheckEntries()
128 CheckPlainUds(entry); in CheckEntries()
130 if (entry->GetUtdId() == UDMF::UtdUtils::GetUtdIdFromUtdEnum(UDMF::FILE_URI)) { in CheckEntries()
131 CheckFileUriUds(entry); in CheckEntries()
145 CheckPlainUds(const std::shared_ptr<PasteDataEntry> entry) CheckPlainUds() argument
160 CheckFileUriUds(const std::shared_ptr<PasteDataEntry> entry) CheckFileUriUds() argument
175 CheckHtmlUds(const std::shared_ptr<PasteDataEntry> entry) CheckHtmlUds() argument
190 CheckPixelMapUds(const std::shared_ptr<PasteDataEntry> entry) CheckPixelMapUds() argument
209 CheckLinkUds(const std::shared_ptr<PasteDataEntry> entry) CheckLinkUds() argument
[all...]
/third_party/mesa3d/src/gallium/drivers/d3d12/
H A Dd3d12_pipeline_state.cpp353 struct hash_entry *entry = _mesa_hash_table_search_pre_hashed(ctx->pso_cache, hash, in d3d12_get_gfx_pipeline_state() local
355 if (!entry) { in d3d12_get_gfx_pipeline_state()
367 entry = _mesa_hash_table_insert_pre_hashed(ctx->pso_cache, hash, &data->key, data); in d3d12_get_gfx_pipeline_state()
368 assert(entry); in d3d12_get_gfx_pipeline_state()
371 return ((struct d3d12_gfx_pso_entry *)(entry->data))->pso; in d3d12_get_gfx_pipeline_state()
381 delete_gfx_entry(struct hash_entry *entry) in delete_gfx_entry() argument
383 struct d3d12_gfx_pso_entry *data = (struct d3d12_gfx_pso_entry *)entry->data; in delete_gfx_entry()
389 remove_gfx_entry(struct d3d12_context *ctx, struct hash_entry *entry) in remove_gfx_entry() argument
391 struct d3d12_gfx_pso_entry *data = (struct d3d12_gfx_pso_entry *)entry->data; in remove_gfx_entry()
395 _mesa_hash_table_remove(ctx->pso_cache, entry); in remove_gfx_entry()
480 struct hash_entry *entry = _mesa_hash_table_search_pre_hashed(ctx->compute_pso_cache, hash, d3d12_get_compute_pipeline_state() local
508 delete_compute_entry(struct hash_entry *entry) delete_compute_entry() argument
516 remove_compute_entry(struct d3d12_context *ctx, struct hash_entry *entry) remove_compute_entry() argument
[all...]
H A Dd3d12_batch.cpp84 delete_bo(hash_entry *entry) in delete_bo() argument
86 struct d3d12_bo *bo = (struct d3d12_bo *)entry->key; in delete_bo()
91 delete_sampler_view(set_entry *entry) in delete_sampler_view() argument
93 struct pipe_sampler_view *pres = (struct pipe_sampler_view *)entry->key; in delete_sampler_view()
98 delete_surface(set_entry *entry) in delete_surface() argument
100 struct pipe_surface *surf = (struct pipe_surface *)entry->key; in delete_surface()
105 delete_object(set_entry *entry) in delete_object() argument
107 ID3D12Object *object = (ID3D12Object *)entry->key; in delete_object()
242 hash_entry *entry = _mesa_hash_table_search(batch->bos, bo); in d3d12_batch_has_references() local
243 if (entry in d3d12_batch_has_references()
254 hash_entry *entry = _mesa_hash_table_search(batch->bos, res->bo); d3d12_batch_reference_resource() local
268 struct set_entry *entry = _mesa_set_search(batch->sampler_views, sv); d3d12_batch_reference_sampler_view() local
288 struct set_entry *entry = _mesa_set_search(batch->objects, object); d3d12_batch_reference_object() local
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/ap/
H A Dneighbor_db.c71 struct hostapd_neighbor_entry *entry; in hostapd_neighbor_set() local
73 entry = hostapd_neighbor_get(hapd, bssid, ssid); in hostapd_neighbor_set()
74 if (!entry) in hostapd_neighbor_set()
75 entry = hostapd_neighbor_add(hapd); in hostapd_neighbor_set()
76 if (!entry) in hostapd_neighbor_set()
79 hostapd_neighbor_clear_entry(entry); in hostapd_neighbor_set()
81 os_memcpy(entry->bssid, bssid, ETH_ALEN); in hostapd_neighbor_set()
82 os_memcpy(&entry->ssid, ssid, sizeof(entry->ssid)); in hostapd_neighbor_set()
84 entry in hostapd_neighbor_set()
[all...]
/third_party/mesa3d/src/util/tests/
H A Dset_test.cpp32 struct set_entry *entry; in TEST() local
44 entry = _mesa_set_search(s, a); in TEST()
45 EXPECT_TRUE(entry); in TEST()
46 EXPECT_EQ(entry->key, a); in TEST()
48 _mesa_set_remove(s, entry); in TEST()
51 entry = _mesa_set_search(s, a); in TEST()
52 EXPECT_FALSE(entry); in TEST()
82 struct set_entry *entry; in TEST() local
92 entry = _mesa_set_search(s, c); in TEST()
93 EXPECT_TRUE(entry); in TEST()
161 struct set_entry *entry = _mesa_set_search_or_add(s, &c, &found); TEST() local
[all...]
/third_party/skia/infra/bots/gen_tasks_logic/
H A Dcompile_cas.go120 // add the given entry (given as a slice of path components) to the node.
121 func (n *node) add(entry []string) {
124 if entry[0] != n.name {
125 log.Fatalf("Failed to compute compile CAS inputs; attempting to add entry %v to node %q", entry, n.name)
127 entry = entry[1:]
129 // If the entry is now empty, this node is a leaf.
130 if len(entry) == 0 {
138 name := entry[
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/innerkitsimpl/kvdb/test/
H A Dsingle_store_impl_test.cpp217 Entry entry; in HWTEST_F() local
218 entry.key = std::to_string(i).append("_k"); in HWTEST_F()
219 entry.value = std::to_string(i).append("_v"); in HWTEST_F()
220 entries.push_back(entry); in HWTEST_F()
262 Entry entry; in HWTEST_F() local
263 entry.key = std::to_string(i).append("_k"); in HWTEST_F()
264 entry.value = std::to_string(i).append("_v"); in HWTEST_F()
265 entries.push_back(entry); in HWTEST_F()
458 Entry entry; in HWTEST_F() local
459 entry in HWTEST_F()
493 Entry entry; HWTEST_F() local
538 Entry entry; HWTEST_F() local
579 Entry entry; HWTEST_F() local
614 Entry entry; HWTEST_F() local
630 Entry entry; HWTEST_F() local
651 Entry entry; HWTEST_F() local
669 Entry entry; HWTEST_F() local
690 Entry entry; HWTEST_F() local
721 Entry entry; HWTEST_F() local
741 Entry entry; HWTEST_F() local
797 Entry entry; HWTEST_F() local
984 Entry entry; HWTEST_F() local
1044 Entry entry; HWTEST_F() local
1099 Entry entry; HWTEST_F() local
1312 Entry entry; HWTEST_F() local
1749 Entry entry; HWTEST_F() local
[all...]
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/test/mock/
H A Ddb_change_data_mock.cpp22 for (auto &entry : inserts) { in DBChangeDataMock()
23 entries_[INSERT].push_back(entry); in DBChangeDataMock()
25 for (auto &entry : updates) { in DBChangeDataMock()
26 entries_[UPDATE].push_back(entry); in DBChangeDataMock()
28 for (auto &entry : deletes) { in DBChangeDataMock()
29 entries_[DELETE].push_back(entry); in DBChangeDataMock()
53 bool DBChangeDataMock::AddEntry(DBEntry entry, int32_t type) in AddEntry() argument
55 entries_[type].push_back(std::move(entry)); in AddEntry()
/third_party/toybox/toys/posix/
H A Dwho.c31 struct utmpx *entry; in who_main() local
34 while ((entry = getutxent())) { in who_main()
35 if (FLAG(a) || entry->ut_type == USER_PROCESS) { in who_main()
36 time_t t = entry->ut_tv.tv_sec; in who_main()
40 printf("%s\t%s\t%s (%s)\n", entry->ut_user, entry->ut_line, in who_main()
41 toybuf, entry->ut_host); in who_main()
/third_party/typescript/tests/baselines/reference/
H A DquickinfoTypeAtReturnPositionsInaccurate.js32 let entry = this.entries[entryId];
34 entry.numExclusive(); // error - expected.
36 if (isNumClass(entry)) {
37 entry.numExclusive(); // works
38 return entry;
41 return entry; // type is Entries[EntryId] - all fine
139 var entry = this.entries[entryId];
140 entry.numExclusive(); // error - expected.
141 if (isNumClass(entry)) {
142 entry
[all...]
/third_party/icu/icu4c/source/common/
H A Ducnvmbcs.cpp111 * - Optional utf8Friendly data structures, with 64-entry stage 3 block
161 * Each entry is 32 bits wide, with two formats distinguished by
184 * All code points for a final state entry take up the same number of code
200 * the entry itself like with roundtrip mappings.
202 * the entry is for a pair of code units.
211 * The interpretation of the bits in each entry is as follows:
213 * Bit 31 not set, not a terminal entry ("transitional"):
217 * Bit 31 set, terminal ("final") entry:
309 * In all cases, the entry in stage 1 is directly the index of the block of
660 int32_t entry in enumToU() local
739 int32_t min, max, entry, nextState; getStateProp() local
1680 int32_t entry; ucnv_MBCSLoad() local
2045 int32_t entry; ucnv_MBCSSingleToUnicodeWithOffsets() local
2197 int32_t entry; ucnv_MBCSSingleToBMPWithOffsets() local
2408 int32_t b, entry; hasValidTrailBytes() local
2451 int32_t entry=row[b]; isSingleOrLead() local
2483 int32_t entry; ucnv_MBCSToUnicodeWithOffsets() local
2888 int32_t entry; ucnv_MBCSSingleGetNextUChar() local
2978 int32_t entry; ucnv_MBCSGetNextUChar() local
3274 int32_t i, entry; ucnv_MBCSSimpleGetNextUChar() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Ducnvmbcs.cpp111 * - Optional utf8Friendly data structures, with 64-entry stage 3 block
161 * Each entry is 32 bits wide, with two formats distinguished by
184 * All code points for a final state entry take up the same number of code
200 * the entry itself like with roundtrip mappings.
202 * the entry is for a pair of code units.
211 * The interpretation of the bits in each entry is as follows:
213 * Bit 31 not set, not a terminal entry ("transitional"):
217 * Bit 31 set, terminal ("final") entry:
309 * In all cases, the entry in stage 1 is directly the index of the block of
660 int32_t entry in enumToU() local
739 int32_t min, max, entry, nextState; getStateProp() local
1680 int32_t entry; ucnv_MBCSLoad() local
2045 int32_t entry; ucnv_MBCSSingleToUnicodeWithOffsets() local
2197 int32_t entry; ucnv_MBCSSingleToBMPWithOffsets() local
2408 int32_t b, entry; hasValidTrailBytes() local
2451 int32_t entry=row[b]; isSingleOrLead() local
2483 int32_t entry; ucnv_MBCSToUnicodeWithOffsets() local
2888 int32_t entry; ucnv_MBCSSingleGetNextUChar() local
2978 int32_t entry; ucnv_MBCSGetNextUChar() local
3274 int32_t i, entry; ucnv_MBCSSimpleGetNextUChar() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ducnvmbcs.cpp111 * - Optional utf8Friendly data structures, with 64-entry stage 3 block
161 * Each entry is 32 bits wide, with two formats distinguished by
184 * All code points for a final state entry take up the same number of code
200 * the entry itself like with roundtrip mappings.
202 * the entry is for a pair of code units.
211 * The interpretation of the bits in each entry is as follows:
213 * Bit 31 not set, not a terminal entry ("transitional"):
217 * Bit 31 set, terminal ("final") entry:
309 * In all cases, the entry in stage 1 is directly the index of the block of
660 int32_t entry in enumToU() local
739 int32_t min, max, entry, nextState; getStateProp() local
1680 int32_t entry; ucnv_MBCSLoad() local
2045 int32_t entry; ucnv_MBCSSingleToUnicodeWithOffsets() local
2197 int32_t entry; ucnv_MBCSSingleToBMPWithOffsets() local
2408 int32_t b, entry; hasValidTrailBytes() local
2451 int32_t entry=row[b]; isSingleOrLead() local
2483 int32_t entry; ucnv_MBCSToUnicodeWithOffsets() local
2888 int32_t entry; ucnv_MBCSSingleGetNextUChar() local
2978 int32_t entry; ucnv_MBCSGetNextUChar() local
3274 int32_t i, entry; ucnv_MBCSSimpleGetNextUChar() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/val/
H A Dval_cfg_test.cpp202 OpName %entry "entry" in TEST_P()
210 %entry = OpLabel in TEST_P()
227 // This motivates the need for the pseudo-entry node to have a node in TEST_P()
240 OpName %entry "entry" in TEST_P()
251 %entry = OpLabel in TEST_P()
272 Block entry("entry"); in TEST_P()
277 entry in TEST_P()
4312 auto entry = f->GetBlock(4).first; TEST_F() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/val/
H A Dval_cfg_test.cpp202 OpName %entry "entry" in TEST_P()
210 %entry = OpLabel in TEST_P()
227 // This motivates the need for the pseudo-entry node to have a node in TEST_P()
240 OpName %entry "entry" in TEST_P()
251 %entry = OpLabel in TEST_P()
272 Block entry("entry"); in TEST_P()
277 entry in TEST_P()
4312 auto entry = f->GetBlock(4).first; TEST_F() local
[all...]
/third_party/libexif/contrib/examples/
H A Dwrite-exif.c131 ExifEntry *entry; in init_tag() local
133 if (!((entry = exif_content_get_entry (exif->ifd[ifd], tag)))) { in init_tag()
134 /* Allocate a new entry */ in init_tag()
135 entry = exif_entry_new (); in init_tag()
136 assert(entry != NULL); /* catch an out of memory condition */ in init_tag()
137 entry->tag = tag; /* tag must be set before calling in init_tag()
141 exif_content_add_entry (exif->ifd[ifd], entry); in init_tag()
143 /* Allocate memory for the entry and fill with default data */ in init_tag()
144 exif_entry_initialize (entry, tag); in init_tag()
148 * unref'ing it; in this case, we know "entry" wo in init_tag()
165 ExifEntry *entry; create_tag() local
202 ExifEntry *entry; main() local
[all...]
/third_party/mesa3d/src/compiler/nir/
H A Dnir_lower_goto_ifs.c95 set_foreach(set, entry) { in print_block_set()
98 printf("%u", ((nir_block *)entry->key)->index); in print_block_set()
118 set_foreach(block_set, entry) in sorted_block_arr_for_set()
119 block_arr[i++] = (nir_block *)entry->key; in sorted_block_arr_for_set()
278 set_foreach(fork->paths[1].reachable, entry) in fork_reachable()
279 _mesa_set_add_pre_hashed(reachable, entry->hash, entry->key); in fork_reachable()
316 set_foreach(reach, entry) { in loop_routing_start()
317 if (_mesa_set_search(loop_path.reachable, entry->key)) in loop_routing_start()
319 if (_mesa_set_search(routing->regular.reachable, entry in loop_routing_start()
[all...]
/third_party/ltp/tools/sparse/sparse-src/
H A Dsparse.c43 static int context_increase(struct basic_block *bb, int entry) in context_increase() argument
56 int current = sum + entry; in context_increase()
70 static int imbalance(struct entrypoint *ep, struct basic_block *bb, int entry, int exit, const char *why) in imbalance() argument
79 static int check_bb_context(struct entrypoint *ep, struct basic_block *bb, int entry, int exit);
81 static int check_children(struct entrypoint *ep, struct basic_block *bb, int entry, int exit) in check_children() argument
90 return entry != exit ? imbalance(ep, bb, entry, exit, "wrong count at exit") : 0; in check_children()
93 if (check_bb_context(ep, child, entry, exit)) in check_children()
99 static int check_bb_context(struct entrypoint *ep, struct basic_block *bb, int entry, int exit) in check_bb_context() argument
103 if (bb->context == entry) in check_bb_context()
[all...]
/foundation/multimedia/media_library/frameworks/innerkitsimpl/media_library_helper/src/
H A Dacl.cpp103 void Acl::CompareInsertEntry(const AclXattrEntry &entry) in CompareInsertEntry() argument
105 if (entries.count(entry)) { in CompareInsertEntry()
106 auto it = entries.find(entry); in CompareInsertEntry()
109 if (entry.perm.IsReadable() || entry.perm.IsWritable() || entry.perm.IsExecutable()) { in CompareInsertEntry()
110 entries.insert(entry); in CompareInsertEntry()
114 int Acl::InsertEntry(const AclXattrEntry &entry) in InsertEntry() argument
120 CompareInsertEntry(entry); // must before ReCalcMaskPerm() in InsertEntry()
124 * In either case there's no or already one ACL_MASK entry i in InsertEntry()
248 InitSandboxEntry(AclXattrEntry &entry) InitSandboxEntry() argument
256 InitSandboxGroupEntry(AclXattrEntry& entry, uint32_t id, uint16_t access) InitSandboxGroupEntry() argument
324 AclXattrEntry entry = {}; EnableAcl() local
403 EntryInsert(AclXattrEntry& entry, const std::string& path, const char* aclAttrName) EntryInsert() argument
[all...]
/third_party/node/test/parallel/
H A Dtest-fs-realpath.js106 const entry = `${tmpDir}/symlink`;
109 [entry, `../${path.basename(tmpDir)}/cycles/root.js`],
118 const result = realpathSync(entry);
120 asynctest(realpath, [entry], callback, function(err, result) {
134 const entry = `${tmpAbsDir}/symlink`;
137 [entry, expected],
146 const result = realpathSync(entry);
148 asynctest(realpath, [entry], callback, function(err, result) {
172 const entry = path.join(targetsAbsDir,
174 try { fs.unlinkSync(entry); } catc
[all...]
/third_party/spirv-tools/test/val/
H A Dval_cfg_test.cpp200 OpName %entry "entry" in TEST_P()
208 %entry = OpLabel in TEST_P()
225 // This motivates the need for the pseudo-entry node to have a node in TEST_P()
238 OpName %entry "entry" in TEST_P()
249 %entry = OpLabel in TEST_P()
270 Block entry("entry"); in TEST_P()
275 entry in TEST_P()
4389 auto entry = f->GetBlock(4).first; TEST_F() local
[all...]
/third_party/mesa3d/src/hgl/
H A DGLRendererRoster.cpp102 renderer = item.entry(view, options); in GetRenderer()
140 BEntry entry(&directory, fABISubDirectory); in AddPath()
141 if (entry.IsDirectory()) { in AddPath()
142 status = directory.SetTo(&entry); in AddPath()
157 BEntry entry; in AddPath() local
159 entry.SetTo(&ref, true); in AddPath()
160 if (entry.InitCheck() == B_OK && !entry.IsFile()) in AddPath()
177 GLRendererRoster::AddRenderer(InstantiateRenderer entry, in AddRenderer() argument
181 item.entry in AddRenderer()
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DMapFieldLite.java101 public V put(Map.Entry<K, V> entry) { in put() argument
102 return put(entry.getKey(), entry.getValue()); in put()
143 for (Map.Entry<K, V> entry : a.entrySet()) { in equals()
144 if (!b.containsKey(entry.getKey())) { in equals()
147 if (!equals(entry.getValue(), b.get(entry.getKey()))) { in equals()
178 for (Map.Entry<K, V> entry : a.entrySet()) { in calculateHashCodeForMap()
180 calculateHashCodeForObject(entry.getKey()) ^ calculateHashCodeForObject(entry in calculateHashCodeForMap()
[all...]

Completed in 22 milliseconds

12345678910>>...104