/system/core/libunwindstack/tools/ |
H A D | unwind_info.cpp | 46 for (const auto& entry : interface->pt_loads()) { 47 uint64_t load_bias = entry.second.table_offset; 48 printf(" PC Range 0x%" PRIx64 " - 0x%" PRIx64 "\n", entry.second.offset + load_bias, 49 entry.second.table_size + load_bias); 60 uint64_t entry; local 61 if (!interface->FindEntry(pc, &entry)) { 62 printf(" Cannot find entry for address.\n"); 69 if (!arm.ExtractEntryData(entry)) { 101 printf("Failed to process cfa information for entry at 0x%" PRIx64 "\n", fde->pc_start);
|
/system/extras/simpleperf/scripts/ |
H A D | update.py | 126 for entry in install_list: 127 install_entry(branch, build, install_dir, entry) 130 def install_entry(branch, build, install_dir, entry): 132 target = entry.target 133 name = entry.name 134 install_path = os.path.join(install_dir, entry.install_path) 135 need_strip = entry.need_strip 167 """Program entry point."""
|
/system/security/keystore/ |
H A D | auth_token_table.cpp | 90 ALOGW("Auth token table filled up; replacing oldest entry"); 155 for (auto& entry : entries_) 156 if (entry.SatisfiesAuth(sids, auth_type) && entry.is_newer_than(newest_match)) 157 newest_match = &entry; 186 void AuthTokenTable::RemoveEntriesSupersededBy(const Entry& entry) { argument 187 entries_.erase(remove_if(entries_, [&](Entry& e) { return entry.Supersedes(e); }), 199 bool AuthTokenTable::IsSupersededBySomeEntry(const Entry& entry) { argument 201 [&](Entry& e) { return e.Supersedes(entry); }); 241 bool AuthTokenTable::Entry::Supersedes(const Entry& entry) cons [all...] |
H A D | grant_store.cpp | 52 [&](auto& entry) { 53 return success = entry.alias_ == alias && entry.owner_dir_name_ == owner_dir_name 54 && entry.owner_uid_ == owner_uid;
|
/system/core/liblog/ |
H A D | logger_read.c | 343 if (ret < (int)(sizeof(log_msg->entry.len) + sizeof(log_msg->entry.hdr_size))) { 344 if (ret >= (int)sizeof(log_msg->entry.len)) { 345 log_msg->entry.len = 0; 355 (log_msg->entry_v2.hdr_size > sizeof(log_msg->entry))) { 361 log_msg->entry.len = 0; 363 log_msg->entry.len = ret - log_msg->entry_v2.hdr_size; 399 if ((retval > 0) && !transp->logMsg.entry.len) { 428 if ((transp->ret > 0) && transp->logMsg.entry.len && 429 (!oldest || (oldest->logMsg.entry [all...] |
H A D | pmsg_reader.c | 281 struct logger_entry_v4 entry; member in union:content::__anon1576 342 size_t hdr_size = transp.logMsg.entry.hdr_size 343 ? transp.logMsg.entry.hdr_size 349 (hdr_size > sizeof(transp.logMsg.entry))) { 353 if ((transp.logMsg.entry.nsec % ANDROID_LOG_PMSG_FILE_SEQUENCE) || 354 ((transp.logMsg.entry.nsec / ANDROID_LOG_PMSG_FILE_SEQUENCE) >= 360 len = transp.logMsg.entry.len - sizeof(prio); 405 /* check if there is an existing entry */ 409 (names->id == transp.logMsg.entry.lid) && (names->prio == *msg)) { 414 /* We do not have an existing entry, creat [all...] |
/system/bt/stack/smp/ |
H A D | smp_br_main.cc | 288 * Description Handle events to the state machine. It looks up the entry 290 * If it is a valid entry, it gets the state table. Set the next 302 uint8_t action, entry; local 317 /* lookup entry / w event & curr_state */ 318 /* If entry is ignore, return. 321 ((entry = entry_table[event - 1][curr_state]) != SMP_BR_SM_IGNORE)) { 322 if (entry & SMP_BR_ALL_TABLE_MASK) { 323 entry &= ~SMP_BR_ALL_TABLE_MASK; 337 smp_set_br_state(state_table[entry - 1][SMP_BR_SME_NEXT_STATE]); 344 action = state_table[entry [all...] |
/system/core/libziparchive/ |
H A D | zip_archive_test.cc | 283 // An entry that doesn't exist. Should be a negative return code. 311 // An entry that's deflated. 323 // An entry that's stored. 345 // This is a zip file containing a single entry (ab.txt) that contains 380 ZipEntry entry; local 383 ASSERT_EQ(0, FindEntry(handle, empty_name, &entry)); 384 ASSERT_EQ(static_cast<uint32_t>(0), entry.uncompressed_length); 386 ASSERT_EQ(0, ExtractToMemory(handle, &entry, buffer, 1)); 390 ASSERT_EQ(0, ExtractEntryToFile(handle, &entry, tmp_output_file.fd)); 405 ZipEntry entry; local 464 ZipEntry entry; local 513 ZipArchiveStreamTest(ZipArchiveHandle& handle, const std::string& entry_name, bool raw, bool verified, ZipEntry* entry, std::vector<uint8_t>* read_data) argument 549 ZipEntry entry; local 564 ZipEntry entry; local 604 ZipEntry entry; local 615 ZipEntry entry; local 666 ZipEntry entry; local 680 std::vector<uint8_t> entry; local 694 std::vector<uint8_t> entry; local [all...] |
H A D | zip_archive.cc | 68 * We want "open" and "find entry by name" to be fast operations, and 82 * of the string length into the hash table entry. 132 ALOGV("Zip: Unable to find entry %.*s", name.name_length, name.name); 137 * Add a new entry to the hash table. 150 // We've found a duplicate entry. We don't accept it 151 ALOGW("Zip: Found duplicate entry %.*s", name.name_length, name.name); 310 * least one unused entry to avoid an infinite loop during creation. 316 ALOGW("Zip: unable to allocate the %u-entry hash_table, entry size: %zu", 344 ALOGW("Zip: bad LFH offset %" PRId64 " at entry 452 ValidateDataDescriptor(MappedZipFile& mapped_zip, ZipEntry* entry) argument 785 Create(int fd, const ZipEntry* entry) argument 868 InflateEntryToWriter(MappedZipFile& mapped_zip, const ZipEntry* entry, Writer* writer, uint64_t* crc_out) argument 971 CopyEntryToWriter(MappedZipFile& mapped_zip, const ZipEntry* entry, Writer* writer, uint64_t* crc_out) argument 1002 ExtractToWriter(ZipArchiveHandle handle, ZipEntry* entry, Writer* writer) argument 1037 ExtractToMemory(ZipArchiveHandle handle, ZipEntry* entry, uint8_t* begin, uint32_t size) argument 1042 ExtractEntryToFile(ZipArchiveHandle handle, ZipEntry* entry, int fd) argument 1090 ProcessZipEntryContents(ZipArchiveHandle handle, ZipEntry* entry, ProcessZipEntryFunction func, void* cookie) argument [all...] |
H A D | zip_writer_test.cc | 303 ZipWriter::FileEntry entry; local 304 EXPECT_LT(writer.GetLastEntry(&entry), 0); 310 ASSERT_EQ(0, writer.GetLastEntry(&entry)); 311 EXPECT_EQ("keep.txt", entry.path); 317 ASSERT_EQ(0, writer.GetLastEntry(&entry)); 318 EXPECT_EQ("drop.txt", entry.path); 322 ASSERT_EQ(0, writer.GetLastEntry(&entry)); 323 EXPECT_EQ("keep.txt", entry.path); 329 ASSERT_EQ(0, writer.GetLastEntry(&entry)); 330 EXPECT_EQ("replace.txt", entry 370 ZipWriter::FileEntry entry; local [all...] |
/system/libufdt/utils/src/ |
H A D | mkdtimg_core.c | 214 struct dt_table_entry entry; local 215 entry.dt_size = cpu_to_fdt32(fdt_size); 216 entry.dt_offset = cpu_to_fdt32(fdt_info->dt_offset); 217 entry.id = get_fdt32_from_number_or_prop(fdt, options->id); 218 entry.rev = get_fdt32_from_number_or_prop(fdt, options->rev); 219 entry.custom[0] = get_fdt32_from_number_or_prop(fdt, options->custom[0]); 220 entry.custom[1] = get_fdt32_from_number_or_prop(fdt, options->custom[1]); 221 entry.custom[2] = get_fdt32_from_number_or_prop(fdt, options->custom[2]); 222 entry.custom[3] = get_fdt32_from_number_or_prop(fdt, options->custom[3]); 224 fwrite(&entry, sizeo [all...] |
/system/core/fs_mgr/ |
H A D | fs_mgr_boot_config.cpp | 34 for (const auto& entry : android::base::Split(android::base::Trim(cmdline), " ")) { 35 std::vector<std::string> pieces = android::base::Split(entry, "=");
|
/system/media/camera/tests/ |
H A D | camera_metadata_tests.cpp | 300 camera_metadata_entry entry; local 303 index, &entry); 305 EXPECT_EQ(index, entry.index); 306 EXPECT_EQ(ANDROID_SENSOR_EXPOSURE_TIME, entry.tag); 307 EXPECT_EQ(TYPE_INT64, entry.type); 308 EXPECT_EQ((size_t)1, entry.count); 309 EXPECT_EQ(exposure_time, *entry.data.i64); 313 index, &entry); 315 EXPECT_EQ(index, entry.index); 316 EXPECT_EQ(ANDROID_SENSOR_SENSITIVITY, entry 411 camera_metadata_entry entry; local 866 camera_metadata_ro_entry_t entry; local 1001 camera_metadata_entry_t entry; local [all...] |
/system/extras/perfprofd/quipper/ |
H A D | perf_parser.cc | 34 // Kernel MMAP entry pid appears as -1 41 bool IsNullBranchStackEntry(const struct branch_entry& entry) { argument 42 return (!entry.from && !entry.to); 324 // Keeps track of whether the current entry is kernel or user. 328 uint64_t entry = callchain->ips[j]; local 329 // When a callchain context entry is found, do not attempt to symbolize it. 330 if (entry >= PERF_CONTEXT_MAX) { 334 if (entry == original_event_addr) { 339 entry, 374 const struct branch_entry& entry = branch_stack->entries[i]; local 386 struct branch_entry& entry = branch_stack->entries[i]; local [all...] |
/system/tools/hidl/ |
H A D | EnumType.cpp | 172 for (const auto &entry : type->values()) { 173 out << entry->name(); 175 std::string value = entry->cppValue(scalarType->getKind()); 181 std::string comment = entry->comment(); 369 for (const auto &entry : type->values()) { 373 << entry->name() 377 std::string value = entry->javaValue(scalarType->getKind()); 383 std::string comment = entry->comment(); 455 for (const auto &entry : type->values()) { 456 out << "enumerator: \"" << entry [all...] |
/system/media/camera/docs/ |
H A D | metadata_model.py | 24 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 1458 def entry(self): member in class:Clone [all...] |
/system/core/liblog/tests/ |
H A D | log_read_test.cpp | 60 EXPECT_EQ(log_msg.entry.pid, pid); 65 if (log_msg.entry.len != buf.length()) continue; 67 if (buf != std::string(log_msg.msg(), log_msg.entry.len)) continue;
|
H A D | log_wrap_test.cpp | 49 log_time start(log_msg.entry.sec, log_msg.entry.nsec);
|
/system/core/libziparchive/include/ziparchive/ |
H A D | zip_archive.h | 62 * Represents information about a zip entry in a zip file. 79 // Suggested Unix mode for this entry, from the zip archive if created on 83 // 1 if this entry contains a data descriptor segment, 0 89 // Data descriptor footer at the end of the file entry. 150 * Find an entry in the Zip archive, by name. |entryName| must be a null 153 * Returns 0 if an entry is found, and populates |data| with information 154 * about this entry. Returns negative values otherwise. 158 * if this file entry contains a data descriptor footer. To verify crc32s 159 * and length, a call to VerifyCrcAndLengths must be made after entry data 176 * entry name [all...] |
/system/core/bootstat/ |
H A D | boot_event_record_store.cpp | 125 struct dirent* entry; local 126 while ((entry = readdir(dir.get())) != NULL) { 128 if (entry->d_type != DT_REG) { 132 const std::string event = entry->d_name;
|
/system/core/libbacktrace/ |
H A D | ThreadEntry.h | 28 static void Remove(ThreadEntry* entry); 40 // time this entry is locked.
|
/system/core/init/ |
H A D | reboot.cpp | 81 explicit MountEntry(const mntent& entry) argument 82 : mnt_fsname_(entry.mnt_fsname), 83 mnt_dir_(entry.mnt_dir), 84 mnt_type_(entry.mnt_type), 85 mnt_opts_(entry.mnt_opts) {} 234 LOG(INFO) << "mount entry " << mentry->mnt_fsname << ":" << mentry->mnt_dir << " opts " 290 [](auto& entry) { return entry.Umount(false); })) { 293 for (auto& entry : block_devices) { 294 entry [all...] |
/system/core/libpixelflinger/codeflinger/ |
H A D | Arm64Disassembler.cpp | 280 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);
|
/system/security/keystore/include/keystore/ |
H A D | authorization_set.h | 119 * Returns the offset of the next entry that matches \p tag, starting from the element after \p 125 * Removes the entry at the specified index. Returns true if successful, false if the index was 164 auto entry = authorizationValue(ttag, param); local 165 if (entry.isOk() && entry.value() == value) return true; 176 auto entry = GetEntry(tag); local 177 if (entry.isOk()) return authorizationValue(tag, entry.value());
|
/system/keymaster/ |
H A D | keymaster_enforcement.cpp | 65 /* Increments key access count, adding an entry if the key has never been used. Returns 518 for (auto& entry : last_access_list_) 519 if (entry.keyid == keyid) { 520 *last_access_time = entry.access_time; 534 // Expire entry if possible. 554 for (auto& entry : access_count_list_) 555 if (entry.keyid == keyid) { 556 *count = entry.access_count; 563 for (auto& entry : access_count_list_) 564 if (entry [all...] |