HomeSort by relevance Sort by last modified time
    Searched refs:oat_dex_files_ (Results 1 - 5 of 5) sorted by null

  /art/dex2oat/linker/
oat_writer.cc 504 oat_dex_files_.emplace_back(/* OatDexFile */
544 oat_dex_files_.emplace_back(/* OatDexFile */
580 oat_dex_files_.emplace_back(/* OatDexFile */
593 if (oat_dex_files_.empty()) {
621 oat_dex_files_.emplace_back(/* OatDexFile */
632 locations.reserve(oat_dex_files_.size());
633 for (const OatDexFile& oat_dex_file : oat_dex_files_) {
669 oat_dex_files_.size() * sizeof(VdexFile::VdexChecksum);
672 dchecked_integral_cast<uint32_t>(oat_dex_files_.size()),
751 CHECK_EQ(dex_files_->size(), oat_dex_files_.size())
    [all...]
oat_writer.h 455 dchecked_vector<OatDexFile> oat_dex_files_; member in class:art::linker::OatWriter::CreateTypeLookupTable
  /art/oatdump/
oatdump.cc 391 oat_dex_files_(oat_file.GetOatDexFiles()),
518 for (size_t i = 0; i < oat_dex_files_.size(); i++) {
519 const OatFile::OatDexFile* oat_dex_file = oat_dex_files_[i];
574 for (size_t i = 0; i < oat_dex_files_.size(); i++) {
575 const DexFile* dex_file = OpenDexFile(oat_dex_files_[i], &error_msg);
593 for (size_t i = 0; i < oat_dex_files_.size(); i++) {
594 const OatFile::OatDexFile* oat_dex_file = oat_dex_files_[i];
618 if (oat_dex_files_.size() != vdex_dex_files.size()) {
620 << vdex_dex_files.size() << " vs " << oat_dex_files_.size() << '\n';
626 const OatFile::OatDexFile* oat_dex_file = oat_dex_files_[i]
1965 const std::vector<const OatFile::OatDexFile*> oat_dex_files_; member in class:art::OatDumper
    [all...]
  /art/runtime/
oat_file.cc     [all...]
oat_file.h 393 // for keys in oat_dex_files_ and the string_cache_ entries for the backing storage
401 Table oat_dex_files_; member in class:art::OatFile
406 // If the primary oat_dex_files_ lookup fails, use a secondary map. This map stores

Completed in 567 milliseconds