/art/runtime/ |
H A D | memory_region.cc | 29 CHECK_GT(from.size(), 0U); 30 CHECK_GE(this->size(), from.size()); 31 CHECK_LE(offset, this->size() - from.size()); 33 from.pointer(), from.size());
|
H A D | memory_region.h | 34 MemoryRegion(void* pointer, uword size) : pointer_(pointer), size_(size) {} argument 37 size_t size() const { return size_; } function in class:art::MemoryRegion 62 void Subregion(const MemoryRegion& from, uintptr_t offset, uintptr_t size) { argument 63 CHECK_GE(from.size(), size); 64 CHECK_LE(offset, from.size() - size); 66 size_ = size; 72 size_ = (region.size() [all...] |
H A D | dex_file_verifier.h | 27 static bool Verify(const DexFile* dex_file, const byte* begin, size_t size); 30 DexFileVerifier(const DexFile* dex_file, const byte* begin, size_t size) argument 31 : dex_file_(dex_file), begin_(begin), size_(size), 44 uint32_t ReadUnsignedLittleEndian(uint32_t size);
|
H A D | dex_method_iterator.h | 36 CHECK_NE(0U, dex_files_.size()); 45 if (dex_file_index_ == dex_files_.size()) { 129 CHECK_LT(dex_file_index_, dex_files_.size());
|
/art/runtime/base/unix_file/ |
H A D | null_file_test.cc | 51 ASSERT_EQ(content.size(), f.Write(content.data(), content.size(), 0)); 59 ASSERT_EQ(-EINVAL, f.Write(content.data(), content.size(), -128)); 61 ASSERT_EQ(content.size(), f.Write(content.data(), content.size(), 0)); 62 ASSERT_EQ(content.size(), f.Write(content.data(), content.size(), 128));
|
H A D | random_access_file_test.h | 74 ASSERT_EQ(content.size(), file->Write(content.data(), content.size(), 0)); 80 const int buf_size = content.size() + 10; 86 ASSERT_EQ(content.size(), file->Read(buf.get(), buf_size, 0)); 87 ASSERT_EQ(std::string(buf.get(), content.size()), content); 91 ASSERT_LT(short_request, content.size()); 112 ASSERT_EQ(content.size(), file->Write(content.data(), content.size(), 0)); 113 ASSERT_EQ(content.size(), file->GetLength()); 146 ASSERT_EQ(content.size(), fil [all...] |
H A D | random_access_file_utils.cc | 29 while ((n = src.Read(&buf[0], buf.size(), offset)) > 0) {
|
H A D | mapped_file_test.cc | 68 EXPECT_EQ(kContent.size(), file.size()); 89 EXPECT_EQ(kContent.size(), file.size()); 91 EXPECT_EQ(0, memcmp(kContent.c_str(), file.data(), file.size())); 101 EXPECT_EQ(1, file.size()); 114 EXPECT_TRUE(file.MapReadWrite(kContent.size())); 116 EXPECT_EQ(kContent.size(), file.size()); 118 memcpy(file.data(), kContent.c_str(), kContent.size()); [all...] |
/art/compiler/ |
H A D | vector_output_stream.cc | 24 : OutputStream(location), offset_(vector.size()), vector_(vector) {} 39 new_offset = vector_.size() + offset;
|
H A D | elf_stripper.cc | 89 CHECK_NE(0U, section_headers.size()); 90 CHECK_EQ(section_headers.size(), section_headers_original_indexes.size()); 94 for (size_t i = 1; i < section_headers.size(); i++) { 115 size_t section_headers_size_in_bytes = section_headers.size() * sizeof(llvm::ELF::Elf32_Shdr); 119 elf_file->GetHeader().e_shnum = section_headers.size();
|
H A D | oat_writer.cc | 83 CHECK_EQ(dex_files_->size(), oat_dex_files_.size()); 101 offset += image_file_location_.size(); 107 for (size_t i = 0; i != dex_files_->size(); ++i) { 119 for (size_t i = 0; i != dex_files_->size(); ++i) { 137 for (size_t i = 0; i != dex_files_->size(); ++i) { 187 offset += field->size(); 212 for (size_t i = 0; i != dex_files_->size(); ++i) { 243 CHECK_EQ(oat_classes_[oat_class_index]->method_offsets_.size(), 305 uint32_t code_size = code.size() * sizeo [all...] |
H A D | output_stream_test.cc | 54 EXPECT_EQ(sizeof(expected), actual.size()); 55 EXPECT_EQ(0, memcmp(expected, &actual[0], actual.size())); 69 bool readSuccess = in->ReadFully(&actual[0], actual.size()); 84 bool readSuccess = in->ReadFully(&actual[0], actual.size());
|
H A D | vector_output_stream.h | 35 if (static_cast<size_t>(offset_) == vector_.size()) { 52 if (new_offset > static_cast<off_t>(vector_.size())) {
|
/art/runtime/base/ |
H A D | stringpiece.h | 52 : ptr_(str.data()), length_(static_cast<int>(str.size())) { } 60 int size() const { return length_; } function in class:art::StringPiece 98 return std::string(data(), size()); 106 return std::string(data(), size()); 162 int len = x.size(); 163 if (len != y.size()) { 193 std::min(x.size(), y.size())); 194 return ((r < 0) || ((r == 0) && (x.size() < y.size()))); [all...] |
H A D | bounded_fifo.h | 25 // A bounded fifo is a fifo which has a bounded size. The power of two version uses a bit mask to 42 return size() == 0; 45 size_t size() const { function in class:art::BoundedFifoPowerOfTwo
|
H A D | histogram-inl.h | 57 if (frequency_.size() >= max_buckets_) { 58 CHECK(IsAligned<2>(frequency_.size())); 61 const size_t limit = frequency_.size() / 2; 67 while (frequency_.size() > limit) { 107 return frequency_.size(); 147 for (size_t bin_idx = 0; bin_idx < data.freq_.size(); ++bin_idx) { 180 for (size_t idx = 0; idx < frequency_.size(); idx++) { 191 DCHECK_GT(data.perc_.size(), 0ull); 193 for (size_t idx = 0; idx < data.perc_.size(); idx++) {
|
H A D | stl_util.h | 85 for (size_t i = 0; i < v.size(); ++i) { 87 if (i < v.size() - 1) {
|
/art/compiler/sea_ir/ir/ |
H A D | regions_test.cc | 40 EXPECT_EQ(1U, succs->size()); 43 EXPECT_EQ(1U, preds->size()); 48 EXPECT_EQ(2U, succs->size()); 52 EXPECT_EQ(1U, preds->size()); 55 EXPECT_EQ(1U, preds->size());
|
/art/runtime/verifier/ |
H A D | reg_type_cache.cc | 60 DCHECK_EQ(entries_.size(), primitive_count_); 163 for (size_t i = primitive_count_; i < entries_.size(); i++) { 185 entry = new PreciseReferenceType(klass, descriptor, entries_.size()); 187 entry = new ReferenceType(klass, descriptor, entries_.size()); 196 RegType* entry = new UnresolvedReferenceType(descriptor, entries_.size()); 214 for (size_t i = primitive_count_; i < entries_.size(); i++) { 223 entry = new PreciseReferenceType(klass, descriptor, entries_.size()); 225 entry = new ReferenceType(klass, descriptor, entries_.size()); 233 CHECK_LE(primitive_count_, entries_.size()); 235 if (entries_.size() [all...] |
/art/runtime/arch/mips/ |
H A D | asm_support_mips.S | 33 .size \name, .-\name
|
/art/compiler/dex/ |
H A D | arena_allocator.cc | 45 Arena::Arena(size_t size) argument 50 map_ = MemMap::MapAnonymous("dalvik-arena", NULL, size, PROT_READ | PROT_WRITE); 54 memory_ = reinterpret_cast<uint8_t*>(calloc(1, size)); 55 size_ = size; 91 Arena* ArenaPool::AllocArena(size_t size) { argument 96 if (free_arenas_ != nullptr && LIKELY(free_arenas_->Size() >= size)) { 102 ret = new Arena(size); 181 << num_allocations_ << ", avg size: " << bytes_allocated / num_allocations_ << "\n";
|
/art/runtime/hprof/ |
H A D | hprof.cc | 624 // U4: size of identifiers. We're using addresses as IDs, so make sure a pointer fits. 697 size_t size; local 701 case 'L': ret = hprof_basic_object; size = 4; break; 702 case 'Z': ret = hprof_basic_boolean; size = 1; break; 703 case 'C': ret = hprof_basic_char; size = 2; break; 704 case 'F': ret = hprof_basic_float; size = 4; break; 705 case 'D': ret = hprof_basic_double; size = 8; break; 706 case 'B': ret = hprof_basic_byte; size = 1; break; 707 case 'S': ret = hprof_basic_short; size = 2; break; 709 case 'I': ret = hprof_basic_int; size 722 size_t size; local 927 size_t size; local 971 size_t size; local 1014 size_t size; local [all...] |
/art/compiler/dex/quick/mips/ |
H A D | utility_mips.cc | 337 int scale, OpSize size) { 345 DCHECK((size == kWord) || (size == kSingle)); 346 size = kSingle; 348 if (size == kSingle) 349 size = kWord; 359 switch (size) { 389 int scale, OpSize size) { 397 DCHECK((size == kWord) || (size 336 LoadBaseIndexed(int rBase, int r_index, int r_dest, int scale, OpSize size) argument 388 StoreBaseIndexed(int rBase, int r_index, int r_src, int scale, OpSize size) argument 434 LoadBaseDispBody(int rBase, int displacement, int r_dest, int r_dest_hi, OpSize size, int s_reg) argument 532 LoadBaseDisp(int rBase, int displacement, int r_dest, OpSize size, int s_reg) argument 543 StoreBaseDispBody(int rBase, int displacement, int r_src, int r_src_hi, OpSize size) argument 625 StoreBaseDisp(int rBase, int displacement, int r_src, OpSize size) argument 645 StoreBaseIndexedDisp(int rBase, int r_index, int scale, int displacement, int r_src, int r_src_hi, OpSize size, int s_reg) argument 657 LoadBaseIndexedDisp(int rBase, int r_index, int scale, int displacement, int r_dest, int r_dest_hi, OpSize size, int s_reg) argument [all...] |
/art/compiler/dex/quick/arm/ |
H A D | utility_arm.cc | 640 int scale, OpSize size) { 649 DCHECK((size == kWord) || (size == kSingle)); 651 size = kSingle; 654 DCHECK((size == kLong) || (size == kDouble)); 657 size = kDouble; 660 if (size == kSingle) 661 size = kWord; 664 switch (size) { 639 LoadBaseIndexed(int rBase, int r_index, int r_dest, int scale, OpSize size) argument 703 StoreBaseIndexed(int rBase, int r_index, int r_src, int scale, OpSize size) argument 768 LoadBaseDispBody(int rBase, int displacement, int r_dest, int r_dest_hi, OpSize size, int s_reg) argument 888 LoadBaseDisp(int rBase, int displacement, int r_dest, OpSize size, int s_reg) argument 899 StoreBaseDispBody(int rBase, int displacement, int r_src, int r_src_hi, OpSize size) argument 1002 StoreBaseDisp(int rBase, int displacement, int r_src, OpSize size) argument 1042 StoreBaseIndexedDisp(int rBase, int r_index, int scale, int displacement, int r_src, int r_src_hi, OpSize size, int s_reg) argument 1054 LoadBaseIndexedDisp(int rBase, int r_index, int scale, int displacement, int r_dest, int r_dest_hi, OpSize size, int s_reg) argument [all...] |
/art/runtime/native/ |
H A D | org_apache_harmony_dalvik_ddmc_DdmServer.cc | 28 DCHECK_LE(offset + length, static_cast<int32_t>(data.size()));
|