Searched refs:entry (Results 26 - 50 of 70) sorted by relevance

123

/system/media/camera/docs/
H A Dcamera_metadata_tag_info.mako50 % for entry in remove_synthetic(find_unique_entries(sec)):
51 [ ${entry.name | csym} - ${path_name(sec) | csym}_START ] =
52 { ${'"%s",' %(entry.name_short) | pad(40)} ${entry.type | ctype_enum,ljust(11)} },
73 % for idx,entry in enumerate(remove_synthetic(find_unique_entries(sec))):
74 case ${entry.name | csym}: {
75 % if entry.enum:
77 % for val in entry.enum.values:
78 case ${entry.name | csym}_${val.name}:
H A Dmetadata_model.py24 Entry: A node corresponding to <entry> elements.
26 MergedEntry: A node corresponding to either <entry> or <clone> elements.
31 Enum: A class corresponding an <enum> element within an <entry>
193 A node corresponding to a <metadata> entry.
209 # kind => { name => entry }
290 def insert_entry(self, entry):
292 Insert an entry into the metadata.
295 entry: A key-value dictionary describing an entry. Refer to
299 Subsequent calls to insert_entry with the same entry
1417 def entry(self): member in class:Clone
[all...]
H A Dmetadata_template.mako59 % for entry in node.entries:
60 ${insert_entry(entry)}
72 <clone entry="${prop.name}" kind="${prop.target_kind}">
88 <entry name="${prop.name_short}" type="${prop.type}"
179 </entry>
/system/keymaster/
H A Dgoogle_keymaster.cpp213 OpTableEntry* entry = FindOperation(request.op_handle); local
214 if (entry == NULL) {
219 response->error = entry->operation->Update(request.input, &response->output);
222 DeleteOperation(entry);
228 OpTableEntry* entry = FindOperation(request.op_handle); local
229 if (entry == NULL) {
234 response->error = entry->operation->Finish(request.signature, &response->output);
235 DeleteOperation(entry);
239 OpTableEntry* entry = FindOperation(op_handle); local
240 if (entry
419 keymaster_blob_t entry; local
469 DeleteOperation(OpTableEntry* entry) argument
[all...]
/system/core/fastbootd/commands/
H A Dpartitions.h112 int GPT_delete_entry(struct GPT_entry_table *table, struct GPT_entry_raw *entry);
114 void GPT_add_entry(struct GPT_entry_table *table, struct GPT_entry_raw *entry);
116 struct GPT_entry_raw *GPT_get_pointer(struct GPT_entry_table *table, struct GPT_entry_raw *entry);
126 int GPT_parse_entry(char *string, struct GPT_entry_raw *entry);
H A Dpartitions.c67 static void GPT_entry_clear(struct GPT_entry_raw *entry) argument
69 memset(entry, 0, sizeof(*entry));
123 // Mapping entry table
177 D(ERR, "GPT entry not valid");
262 static int GPT_check_overlap(struct GPT_entry_table *table, struct GPT_entry_raw *entry);
264 struct GPT_entry_raw *entry,
279 D(ERR, "Couldn't find entry");
286 int GPT_delete_entry(struct GPT_entry_table *table, struct GPT_entry_raw *entry) argument
288 struct GPT_entry_raw *raw = GPT_get_pointer(table, entry);
302 GPT_add_entry(struct GPT_entry_table *table, struct GPT_entry_raw *entry) argument
334 GPT_get_pointer(struct GPT_entry_table *table, struct GPT_entry_raw *entry) argument
454 GPT_check_overlap_except(struct GPT_entry_table *table, struct GPT_entry_raw *entry, struct GPT_entry_raw *exclude) argument
481 GPT_check_overlap(struct GPT_entry_table *table, struct GPT_entry_raw *entry) argument
510 add_key_value(const char *key, const char *value, struct GPT_entry_raw *entry) argument
547 GPT_parse_entry(char *string, struct GPT_entry_raw *entry) argument
652 struct GPT_entry_raw *entry; local
[all...]
H A Dboot.c82 long kexec_load(unsigned int entry, unsigned long nr_segments, argument
84 return syscall(__NR_kexec_load, entry, nr_segments, segment, flags);
98 unsigned entry = START_ADDRESS + KEXEC_ARM_ZIMAGE_OFFSET; local
133 entry = second_phys;
137 rv = kexec_load(entry, segment_count, segment, KEXEC_ARCH_DEFAULT);
/system/core/include/log/
H A Dlogprint.h104 * entry allocated by caller. Pointers will point directly into buf
106 * Returns 0 on success and -1 on invalid wire format (entry will be
110 AndroidLogEntry *entry);
119 AndroidLogEntry *entry, const EventTagMap* map, char* messageBuf,
148 const AndroidLogEntry *entry);
/system/core/include/utils/
H A DBasicHashtable.h33 // may need to seek further along the chain to find the entry.
36 // The present flag indicates that the bucket contains an initialized entry value.
41 // hash code of the entry's key.
48 // Storage for the entry begins here.
49 char entry[0]; member in struct:android::BasicHashtableImpl::Bucket
70 size_t add(hash_t hash, const void* __restrict__ entry);
74 const size_t mBucketSize; // number of bytes per bucket including the entry
75 const bool mHasTrivialDestructor; // true if the entry type does not require destruction
93 virtual void initializeBucketEntry(Bucket& bucket, const void* __restrict__ entry) const = 0;
157 * TEntry: The entry typ
293 add(hash_t hash, const TEntry& entry) argument
389 memcpy(&entryFor(bucket), entry, sizeof(TEntry)); local
[all...]
/system/core/liblog/tests/
H A Dlibc_test.cpp59 ASSERT_EQ(log_msg.entry.pid, pid);
61 if ((log_msg.entry.len != (4 + 1 + 4))
120 ASSERT_EQ(log_msg.entry.pid, pid);
/system/core/libziparchive/
H A Dzip_archive_test.cc120 // An entry that doesn't exist. Should be a negative return code.
130 // An entry that's deflated.
140 // An entry that's stored.
186 ZipEntry entry; local
187 ASSERT_EQ(0, FindEntry(handle, "empty.txt", &entry));
188 ASSERT_EQ(static_cast<uint32_t>(0), entry.uncompressed_length);
190 ASSERT_EQ(0, ExtractToMemory(handle, &entry, buffer, 1));
195 ASSERT_EQ(0, ExtractEntryToFile(handle, &entry, output_fd));
233 ZipEntry entry; local
234 ASSERT_EQ(0, FindEntry(handle, "a.txt", &entry));
[all...]
H A Dzip_archive.cc104 // The "general purpose bit flags" for this entry. The only
108 // The compression method for this entry, one of |kCompressStored|
111 // The file modification time and date for this entry.
114 // The CRC-32 checksum for this entry.
116 // The compressed size (in bytes) of this entry.
118 // The uncompressed size (in bytes) of this entry.
120 // The length of the entry file name in bytes. The file name
124 // will appear immediately after the entry file name.
126 // The length of the entry comment (in bytes). This data will
129 // The start disk for this entry
715 UpdateEntryFromDataDescriptor(int fd, ZipEntry *entry) argument
973 InflateToFile(int fd, const ZipEntry* entry, uint8_t* begin, uint32_t length, uint64_t* crc_out) argument
1079 ExtractToMemory(ZipArchiveHandle handle, ZipEntry* entry, uint8_t* begin, uint32_t size) argument
1116 ExtractEntryToFile(ZipArchiveHandle handle, ZipEntry* entry, int fd) argument
[all...]
/system/core/include/ziparchive/
H A Dzip_archive.h41 * Represents information about a zip entry in a zip file.
53 // 1 if this entry contains a data descriptor segment, 0
59 // Data descriptor footer at the end of the file entry.
115 * Find an entry in the Zip archive, by name. |entryName| must be a null
118 * Returns 0 if an entry is found, and populates |data| with information
119 * about this entry. Returns negative values otherwise.
123 * if this file entry contains a data descriptor footer. To verify crc32s
124 * and length, a call to VerifyCrcAndLengths must be made after entry data
139 * entry names that start with |prefix|.
155 * Uncompress and write an entry t
[all...]
/system/media/camera/tests/
H A Dcamera_metadata_tests.cpp298 camera_metadata_entry entry; local
301 index, &entry);
303 EXPECT_EQ(index, (int)entry.index);
304 EXPECT_EQ(ANDROID_SENSOR_EXPOSURE_TIME, entry.tag);
305 EXPECT_EQ(TYPE_INT64, entry.type);
306 EXPECT_EQ((size_t)1, entry.count);
307 EXPECT_EQ(exposure_time, *entry.data.i64);
311 index, &entry);
313 EXPECT_EQ(index, entry.index);
314 EXPECT_EQ(ANDROID_SENSOR_SENSITIVITY, entry
409 camera_metadata_entry entry; local
870 camera_metadata_ro_entry_t entry; local
1005 camera_metadata_entry_t entry; local
[all...]
/system/media/camera/include/system/
H A Dcamera_metadata.h75 * A reference to a metadata entry in a buffer.
79 * number of entries in data of the entry's type, not a count of bytes.
97 * A read-only reference to a metadata entry in a buffer. Identical to
116 * Size in bytes of each entry type
122 * Human-readable name of each entry type
128 * Main definitions for the metadata entry and array structures
136 * has a fixed capacity for entries and for extra data. A new entry uses up one
137 * entry slot, and possibly some amount of data capacity; the function
139 * capacity that would be used up by an entry.
163 * and extra data. The entry_capacity is measured in entry count
[all...]
/system/core/libpixelflinger/codeflinger/
H A DArm64Disassembler.cpp280 disasm_table_entry_t *entry = NULL; local
283 entry = &disasm_table[i];
284 if((code & entry->mask) == entry->value)
298 uint32_t length = strlen(entry->instr_template);
302 get_token(entry->instr_template, index, token);
H A DCodeCache.h96 : entry(a), when(w) { }
97 sp<Assembly> entry; member in struct:android::CodeCache::cache_entry_t
/system/core/init/
H A Dproperty_service.c441 struct dirent* entry; local
448 while ((entry = readdir(dir)) != NULL) {
449 if (strncmp("persist.", entry->d_name, strlen("persist.")))
452 if (entry->d_type != DT_REG)
456 fd = openat(dir_fd, entry->d_name, O_RDONLY | O_NOFOLLOW);
459 entry->d_name, errno);
463 ERROR("fstat on property file \"%s\" failed errno: %d\n", entry->d_name, errno);
475 entry->d_name, (unsigned int)sb.st_uid, (unsigned int)sb.st_gid,
484 property_set(entry->d_name, value);
487 entry
[all...]
/system/core/libutils/tests/
H A DBasicHashtable_test.cpp145 static void getKeyValue(const TEntry& entry, int* key, int* value);
147 template <> void getKeyValue(const SimpleEntry& entry, int* key, int* value) { argument
148 *key = entry.key;
149 *value = entry.value;
152 template <> void getKeyValue(const ComplexEntry& entry, int* key, int* value) { argument
153 *key = entry.key.k;
154 *value = entry.value.v;
397 const SimpleEntry& entry = h.entryAt(index); local
398 ASSERT_GE(entry.key, 0);
399 ASSERT_LT(entry
[all...]
/system/core/logd/
H A DLogBuffer.cpp185 LogTimeEntry *entry = (*t); local
186 if (entry->owned_Locked()) {
187 if (!entry->mNonBlock) {
191 if (!end_set || (end <= entry->mEnd)) {
192 end = entry->mEnd;
243 LogTimeEntry *entry = (*t); local
244 if (entry->owned_Locked()
245 && (!oldest || (oldest->mStart > entry->mStart))) {
246 oldest = entry;
H A DLogReader.cpp32 // When we are notified a new log entry is available, inform
169 LogTimeEntry *entry = (*it); local
170 if (entry->mClient == cli) {
172 entry->release_Locked();
/system/extras/tests/sdcard/
H A Dsysutil.cpp414 struct dirent *entry; local
417 while((entry = readdir(dir)))
419 if (0 == strcmp(entry->d_name, ".")
420 || 0 == strcmp(entry->d_name, "..")
421 || 0 == strcmp(entry->d_name, "lost+found"))
427 strcat(name_buffer, entry->d_name);
/system/core/logd/tests/
H A Dlogd_test.cpp360 switch(msg->entry.hdr_size) {
374 fprintf(stderr, "hdr_size=%u ", msg->entry.hdr_size);
377 msg->entry.pid, msg->entry.tid, msg->entry.sec, msg->entry.nsec);
386 lid = msg->entry.lid;
409 unsigned int len = msg->entry.len;
/system/core/libbacktrace/
H A DBacktraceThread.h41 static void Remove(ThreadEntry* entry);
53 // time this entry is locked.
/system/core/liblog/
H A Dfake_log_device.c203 int entry = 0; local
263 logState->tagSet[entry].minPriority = minPrio;
264 strcpy(logState->tagSet[entry].tag, tagName);
265 TRACE("+++ entry %d: %s:%d\n",
266 entry,
267 logState->tagSet[entry].tag,
268 logState->tagSet[entry].minPriority);
269 entry++;

Completed in 810 milliseconds

123