Home
last modified time | relevance | path

Searched refs:entry (Results 126 - 150 of 2221) sorted by relevance

12345678910>>...89

/test/xts/hats/hdf/camera/cameraHdi/v4l2/src/
H A Dcamera_ability_test.cpp35 camera_metadata_item_t entry; in GetSensorOrientation() local
36 int ret = OHOS::Camera::FindCameraMetadataItem(data, OHOS_SENSOR_ORIENTATION, &entry); in GetSensorOrientation()
41 sensorOrientation = *(entry.data.i32); in GetSensorOrientation()
50 camera_metadata_item_t entry; in GetFlashAvailable() local
51 int ret = OHOS::Camera::FindCameraMetadataItem(data, OHOS_ABILITY_FLASH_AVAILABLE, &entry); in GetFlashAvailable()
56 flashAvailable = *(entry.data.u8); in GetFlashAvailable()
65 camera_metadata_item_t entry; in GetAfAvailable() local
66 int ret = OHOS::Camera::FindCameraMetadataItem(data, OHOS_CONTROL_AF_AVAILABLE_MODES, &entry); in GetAfAvailable()
71 uint32_t count = entry.count; in GetAfAvailable()
75 afAvailable.push_back(*(entry in GetAfAvailable()
88 camera_metadata_item_t entry; GetZoomRatioRange() local
111 camera_metadata_item_t entry; GetJpegOrientation() local
[all...]
/third_party/skia/third_party/externals/swiftshader/src/Common/
H A DThread.cpp22 Entry entry = {threadFunction, parameters, &init}; in Thread() local
25 handle = CreateThread(NULL, 1024 * 1024, startFunction, &entry, 0, NULL); in Thread()
27 pthread_create(&handle, NULL, startFunction, &entry); in Thread()
56 Entry entry = *(Entry*)parameters; in startFunction() local
57 entry.init->signal(); in startFunction()
58 entry.threadFunction(entry.threadParameters); in startFunction()
64 Entry entry = *(Entry*)parameters; in startFunction() local
65 entry.init->signal(); in startFunction()
66 entry in startFunction()
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/transform_feedback/
H A DvktTransformFeedbackFuzzLayoutCase.cpp159 std::ostream& operator<< (std::ostream& stream, const BlockLayoutEntry& entry) in operator <<() argument
161 stream << entry.name << " { name = " << entry.name in operator <<()
162 << ", buffer = " << entry.xfbBuffer in operator <<()
163 << ", offset = " << entry.xfbOffset in operator <<()
164 << ", size = " << entry.xfbSize in operator <<()
165 << ", blockDeclarationNdx = " << entry.blockDeclarationNdx in operator <<()
166 << ", instanceNdx = " << entry.instanceNdx in operator <<()
169 for (std::vector<int>::const_iterator i = entry.activeInterfaceIndices.begin(); i != entry in operator <<()
180 operator <<(std::ostream& stream, const InterfaceLayoutEntry& entry) operator <<() argument
209 const InterfaceLayoutEntry& entry = layout.interfaces[layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; operator <<() local
461 createMask(void* maskBasePtr, const InterfaceLayoutEntry& entry, const void* basePtr0, const void* basePtr) createMask() argument
519 const InterfaceLayoutEntry& entry = layout.interfaces[layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; createMask() local
571 InterfaceLayoutEntry entry; computeXfbLayout() local
623 InterfaceLayoutEntry entry; computeXfbLayout() local
651 InterfaceLayoutEntry entry; computeXfbLayout() local
904 generateValue(const InterfaceLayoutEntry& entry, void* basePtr, de::Random& rnd) generateValue() argument
956 const InterfaceLayoutEntry& entry = layout.interfaces[layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; generateValues() local
1205 generateValueSrc(std::ostringstream& src, const InterfaceLayoutEntry& entry, const void* basePtr, int elementNdx) generateValueSrc() argument
1266 writeMatrixTypeSrc(int columnCount, int rowCount, std::string type, std::ostringstream& src, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry, bool vector) writeMatrixTypeSrc() argument
1341 generateTestSrcMatrixPerVec(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry) generateTestSrcMatrixPerVec() argument
1360 generateTestSrcMatrixPerElement(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry) generateTestSrcMatrixPerElement() argument
1380 generateSingleAssignment(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry, MatrixLoadFlags matrixLoadFlag) generateSingleAssignment() argument
1419 const InterfaceLayoutEntry& entry = layout.interfaces[interfaceLayoutNdx]; generateAssignment() local
1795 validateValue(const InterfaceLayoutEntry& entry, const void* basePtr0, const void* basePtr, const void* receivedBasePtr) validateValue() argument
1892 const InterfaceLayoutEntry& entry = m_layout.interfaces[m_layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; validateValues() local
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/transform_feedback/
H A DvktTransformFeedbackFuzzLayoutCase.cpp159 std::ostream& operator<< (std::ostream& stream, const BlockLayoutEntry& entry) in operator <<() argument
161 stream << entry.name << " { name = " << entry.name in operator <<()
162 << ", buffer = " << entry.xfbBuffer in operator <<()
163 << ", offset = " << entry.xfbOffset in operator <<()
164 << ", size = " << entry.xfbSize in operator <<()
165 << ", blockDeclarationNdx = " << entry.blockDeclarationNdx in operator <<()
166 << ", instanceNdx = " << entry.instanceNdx in operator <<()
169 for (std::vector<int>::const_iterator i = entry.activeInterfaceIndices.begin(); i != entry in operator <<()
180 operator <<(std::ostream& stream, const InterfaceLayoutEntry& entry) operator <<() argument
209 const InterfaceLayoutEntry& entry = layout.interfaces[layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; operator <<() local
461 createMask(void* maskBasePtr, const InterfaceLayoutEntry& entry, const void* basePtr0, const void* basePtr) createMask() argument
519 const InterfaceLayoutEntry& entry = layout.interfaces[layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; createMask() local
571 InterfaceLayoutEntry entry; computeXfbLayout() local
623 InterfaceLayoutEntry entry; computeXfbLayout() local
651 InterfaceLayoutEntry entry; computeXfbLayout() local
904 generateValue(const InterfaceLayoutEntry& entry, void* basePtr, de::Random& rnd) generateValue() argument
956 const InterfaceLayoutEntry& entry = layout.interfaces[layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; generateValues() local
1205 generateValueSrc(std::ostringstream& src, const InterfaceLayoutEntry& entry, const void* basePtr, int elementNdx) generateValueSrc() argument
1266 writeMatrixTypeSrc(int columnCount, int rowCount, std::string type, std::ostringstream& src, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry, bool vector) writeMatrixTypeSrc() argument
1341 generateTestSrcMatrixPerVec(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry) generateTestSrcMatrixPerVec() argument
1360 generateTestSrcMatrixPerElement(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry) generateTestSrcMatrixPerElement() argument
1380 generateSingleAssignment(std::ostringstream& src, glu::DataType elementType, const std::string& srcName, const void* basePtr, const InterfaceLayoutEntry& entry, MatrixLoadFlags matrixLoadFlag) generateSingleAssignment() argument
1419 const InterfaceLayoutEntry& entry = layout.interfaces[interfaceLayoutNdx]; generateAssignment() local
1795 validateValue(const InterfaceLayoutEntry& entry, const void* basePtr0, const void* basePtr, const void* receivedBasePtr) validateValue() argument
1892 const InterfaceLayoutEntry& entry = m_layout.interfaces[m_layout.blocks[blockNdx].activeInterfaceIndices[entryNdx]]; validateValues() local
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dheap-snapshot-generator.h161 void VerifyReference(HeapGraphEdge::Type type, HeapEntry* entry,
165 HeapEntry* entry, HeapSnapshotGenerator* generator,
168 HeapEntry* entry, HeapSnapshotGenerator* generator,
247 void AddLocation(HeapEntry* entry, int scriptId, int line, int col);
269 // backing storage, thus all entry pointers remain valid for the duration
407 void ExtractLocation(HeapEntry* entry, HeapObject object);
408 void ExtractLocationForJSFunction(HeapEntry* entry, JSFunction func);
409 void ExtractReferences(HeapEntry* entry, HeapObject obj);
410 void ExtractJSGlobalProxyReferences(HeapEntry* entry, JSGlobalProxy proxy);
411 void ExtractJSObjectReferences(HeapEntry* entry, JSObjec
592 FindHeapThingForHeapEntry(HeapEntry* entry) FindHeapThingForHeapEntry() argument
614 HeapEntry* entry = FindEntry(ptr); FindOrAddEntry() local
619 HeapEntry* entry = FindEntry(smi); FindOrAddEntry() local
[all...]
H A Dstrings-storage.cc33 base::HashMap::Entry* entry = GetEntry(src, len); in GetCopy() local
34 if (entry->value == nullptr) { in GetCopy()
38 entry->key = dst.begin(); in GetCopy()
41 entry->value = in GetCopy()
42 reinterpret_cast<void*>(reinterpret_cast<size_t>(entry->value) + 1); in GetCopy()
43 return reinterpret_cast<const char*>(entry->key); in GetCopy()
56 base::HashMap::Entry* entry = GetEntry(str, len); in AddOrDisposeString() local
57 if (entry->value == nullptr) { in AddOrDisposeString()
58 // New entry added. in AddOrDisposeString()
59 entry in AddOrDisposeString()
147 base::HashMap::Entry* entry = names_.Lookup(const_cast<char*>(str), hash); Release() local
[all...]
/third_party/node/deps/npm/node_modules/@sigstore/sign/dist/witness/tlog/
H A Dindex.js21 const entry_1 = require("./entry");
33 const entry = await this.tlog.createEntry(proposedEntry);
34 return toTransparencyLogEntry(entry);
38 function toTransparencyLogEntry(entry) {
39 const logID = Buffer.from(entry.logID, 'hex');
40 // Parse entry body so we can extract the kind and version.
41 const bodyJSON = util_1.encoding.base64Decode(entry.body);
43 const promise = entry?.verification?.signedEntryTimestamp
44 ? inclusionPromise(entry.verification.signedEntryTimestamp)
46 const proof = entry
[all...]
/third_party/protobuf/java/core/src/main/java/com/google/protobuf/
H A DLazyField.java92 private Entry<K, LazyField> entry; field in LazyField.LazyEntry
94 private LazyEntry(Entry<K, LazyField> entry) { in LazyEntry() argument
95 this.entry = entry; in LazyEntry()
100 return entry.getKey(); in getKey()
105 LazyField field = entry.getValue(); in getValue()
113 return entry.getValue(); in getField()
123 return entry.getValue().setValue((MessageLite) value); in setValue()
142 Entry<K, ?> entry = iterator.next(); in next()
143 if (entry in next()
[all...]
/third_party/node/test/wasi/c/
H A Dreaddir.c10 struct dirent* entry; in main() local
24 while (NULL != (entry = readdir(dir))) { in main()
25 if (strcmp(entry->d_name, "input.txt") == 0 || in main()
26 strcmp(entry->d_name, "input2.txt") == 0 || in main()
27 strcmp(entry->d_name, "notadir") == 0) { in main()
29 assert(entry->d_type == DT_REG); in main()
31 assert(entry->d_type == DT_UNKNOWN); in main()
33 } else if (strcmp(entry->d_name, "subdir") == 0) { in main()
35 assert(entry->d_type == DT_DIR); in main()
37 assert(entry in main()
[all...]
/third_party/mesa3d/src/util/tests/hash_table/
H A Ddelete_and_lookup.c51 struct hash_entry *entry; in main() local
61 entry = _mesa_hash_table_search(ht, str2); in main()
62 assert(strcmp(entry->key, str2) == 0); in main()
64 entry = _mesa_hash_table_search(ht, str1); in main()
65 assert(strcmp(entry->key, str1) == 0); in main()
67 _mesa_hash_table_remove(ht, entry); in main()
69 entry = _mesa_hash_table_search(ht, str1); in main()
70 assert(entry == NULL); in main()
72 entry = _mesa_hash_table_search(ht, str2); in main()
73 assert(strcmp(entry in main()
[all...]
/third_party/node/deps/v8/src/objects/
H A Dswiss-name-dictionary.h50 // entry in the hash table, the 7 lowest bits of the key's hash. The first
68 // The i-th entry in the enumeration table
69 // contains the number of the bucket representing the i-th entry of the
86 Isolate* isolate, Handle<SwissNameDictionary> table, InternalIndex entry);
100 inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_key);
102 inline Object KeyAt(InternalIndex entry);
103 inline Name NameAt(InternalIndex entry);
104 inline Object ValueAt(InternalIndex entry);
106 inline base::Optional<Object> TryValueAt(InternalIndex entry);
107 inline PropertyDetails DetailsAt(InternalIndex entry);
[all...]
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...]
/third_party/pulseaudio/src/modules/
H A Dmodule-stream-restore.c118 struct entry { struct
136 static struct entry* entry_new(void);
137 static void entry_free(struct entry *e);
138 static struct entry *entry_read(struct userdata *u, const char *name);
139 static bool entry_write(struct userdata *u, const char *name, const struct entry *e, bool replace);
140 static struct entry* entry_copy(const struct entry *e);
141 static void entry_apply(struct userdata *u, const char *name, struct entry *e);
147 #define ENTRY_OBJECT_NAME "entry"
226 { "entry", "
444 send_new_entry_signal(struct dbus_entry *entry) send_new_entry_signal() argument
455 send_entry_removed_signal(struct dbus_entry *entry) send_entry_removed_signal() argument
1291 struct entry *entry, *old = NULL; subscribe_callback() local
1544 struct entry *entry; update_preferred_device() local
2050 struct entry *entry; extension_cb() local
2226 struct entry *entry; clean_up_db() member
[all...]
/third_party/node/deps/undici/src/lib/fetch/
H A Dformdata.js47 // 2. Let entry be the result of creating an entry with
49 const entry = makeEntry(name, value, filename)
51 // 3. Append entry to this’s entry list.
52 this[kState].push(entry)
63 // is name from this’s entry list.
64 this[kState] = this[kState].filter(entry => entry.name !== name)
74 // 1. If there is no entry whos
[all...]
/third_party/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_qir_lower_uniforms.c50 struct hash_entry *entry; in add_uniform() local
53 entry = _mesa_hash_table_search(ht, key); in add_uniform()
54 if (entry) { in add_uniform()
55 entry->data++; in add_uniform()
64 struct hash_entry *entry; in remove_uniform() local
67 entry = _mesa_hash_table_search(ht, key); in remove_uniform()
68 assert(entry); in remove_uniform()
69 entry->data = (void *)(((uintptr_t) entry->data) - 1); in remove_uniform()
70 if (entry in remove_uniform()
[all...]
/third_party/node/test/node-api/test_reference_by_node_api_version/
H A Dtest.js52 for (const entry of allEntries) {
53 if (!isVersion8 || entry.canBeRefV8) {
54 const index = addon.createRef(entry.value);
56 assert.strictEqual(entry.value, refValue);
61 assert.throws(() => { addon.createRef(entry.value); },
73 allEntries.forEach((entry, index) => {
74 if (!isVersion8 || entry.canBeRefV8) {
75 if (entry.canBeWeak || entry.isAlwaysStrong) {
76 assert.strictEqual(addon.getRefValue(index), entry
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/reduce/
H A Dstructured_construct_to_block_reduction_opportunity_finder.cpp53 for (auto entry = regions.begin(); entry != regions.end();) { in GetAvailableOpportunities()
56 assert(&block != entry->first && in GetAvailableOpportunities()
59 if (entry->first->MergeBlockId() != block.id() && in GetAvailableOpportunities()
60 dominators->Dominates(entry->first, &block) && in GetAvailableOpportunities()
62 entry->first->GetMergeInst()->GetSingleWordInOperand(0), in GetAvailableOpportunities()
67 entry = regions.erase(entry); in GetAvailableOpportunities()
71 entry->second.insert(&block); in GetAvailableOpportunities()
74 ++entry; in GetAvailableOpportunities()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/reduce/
H A Dstructured_construct_to_block_reduction_opportunity_finder.cpp53 for (auto entry = regions.begin(); entry != regions.end();) { in GetAvailableOpportunities()
56 assert(&block != entry->first && in GetAvailableOpportunities()
59 if (entry->first->MergeBlockId() != block.id() && in GetAvailableOpportunities()
60 dominators->Dominates(entry->first, &block) && in GetAvailableOpportunities()
62 entry->first->GetMergeInst()->GetSingleWordInOperand(0), in GetAvailableOpportunities()
67 entry = regions.erase(entry); in GetAvailableOpportunities()
71 entry->second.insert(&block); in GetAvailableOpportunities()
74 ++entry; in GetAvailableOpportunities()
[all...]
/third_party/skia/src/ports/
H A DSkNDKConversions.cpp26 for (const auto& entry : gColorTypeTable) { in toAndroidBitmapFormat()
27 if (entry.colorType == colorType) { in toAndroidBitmapFormat()
28 return entry.format; in toAndroidBitmapFormat()
35 for (const auto& entry : gColorTypeTable) { in toColorType()
36 if (entry.format == format) { in toColorType()
37 return entry.colorType; in toColorType()
101 for (const auto& entry : gColorSpaceTable) { in toDataSpace()
102 if (nearly_equal(gamut, entry.gamut) && nearly_equal(fn, entry.transferFunction)) { in toDataSpace()
103 return entry in toDataSpace()
[all...]
/third_party/spirv-tools/source/reduce/
H A Dstructured_construct_to_block_reduction_opportunity_finder.cpp53 for (auto entry = regions.begin(); entry != regions.end();) { in GetAvailableOpportunities()
56 assert(&block != entry->first && in GetAvailableOpportunities()
59 if (entry->first->MergeBlockId() != block.id() && in GetAvailableOpportunities()
60 dominators->Dominates(entry->first, &block) && in GetAvailableOpportunities()
62 entry->first->GetMergeInst()->GetSingleWordInOperand(0), in GetAvailableOpportunities()
67 entry = regions.erase(entry); in GetAvailableOpportunities()
71 entry->second.insert(&block); in GetAvailableOpportunities()
74 ++entry; in GetAvailableOpportunities()
[all...]
/third_party/node/deps/v8/third_party/zlib/google/
H A Dzip_reader_unittest.cc130 while (const zip::ZipReader::Entry* const entry = reader->Next()) { in LocateAndOpenEntry()
132 if (entry->path == path_in_zip) in LocateAndOpenEntry()
133 return entry; in LocateAndOpenEntry()
174 while (const ZipReader::Entry* const entry = reader.Next()) {
176 paths.push_back(entry->path);
247 while (const ZipReader::Entry* const entry = reader.Next()) { in TEST_F()
249 actual_contents.push_back(entry->path); in TEST_F()
268 while (const ZipReader::Entry* const entry = reader.Next()) { in TEST_F()
270 actual_contents.push_back(entry->path); in TEST_F()
286 const ZipReader::Entry* entry in TEST_F() local
312 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
323 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
383 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
394 const ZipReader::Entry* entry = LocateAndOpenEntry(&reader, target_path); TEST_F() local
421 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
437 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
456 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
472 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
483 const ZipReader::Entry* entry = reader.Next(); TEST_F() local
868 const ZipReader::Entry* const entry = TEST_F() member in zip::ZipReader
[all...]
/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/benchmark/test/
H A Doutput_test.h159 #define CHECK_RESULT_VALUE_IMPL(entry, getfn, var_type, var_name, relationship, value) \
161 (entry.getfn< var_type >(var_name), (value)) << "\n" \
162 << __FILE__ << ":" << __LINE__ << ": " << (entry).name << ":\n" \
165 << "=" << (entry).getfn< var_type >(var_name) \
170 #define CHECK_FLOAT_RESULT_VALUE_IMPL(entry, getfn, var_type, var_name, relationship, value, eps_factor) \
172 (entry.getfn< var_type >(var_name), (value), (eps_factor) * (value)) << "\n" \
173 << __FILE__ << ":" << __LINE__ << ": " << (entry).name << ":\n" \
176 << "=" << (entry).getfn< var_type >(var_name) \
181 << "but delta was " << ((entry).getfn< var_type >(var_name) - (value)) \
182 << " (" << (((entry)
[all...]
/third_party/mesa3d/src/gallium/drivers/freedreno/a2xx/
H A Dfd2_query.c88 struct fd_batch_query_entry *entry = &data->query_entries[i]; variable
89 const struct fd_perfcntr_group *g = &screen->perfcntr_groups[entry->gid];
90 unsigned counter_idx = counters_per_group[entry->gid]++;
95 OUT_RING(ring, g->countables[entry->cid].selector);
102 struct fd_batch_query_entry *entry = &data->query_entries[i]; variable
103 const struct fd_perfcntr_group *g = &screen->perfcntr_groups[entry->gid];
104 unsigned counter_idx = counters_per_group[entry->gid]++;
129 struct fd_batch_query_entry *entry = &data->query_entries[i]; variable
130 const struct fd_perfcntr_group *g = &screen->perfcntr_groups[entry->gid];
131 unsigned counter_idx = counters_per_group[entry
192 struct fd_batch_query_entry *entry = &data->query_entries[i]; fd2_create_batch_query() local
[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...]

Completed in 17 milliseconds

12345678910>>...89