Searched refs:chunk (Results 1 - 9 of 9) sorted by relevance
/art/compiler/utils/ |
H A D | swap_space.cc | 31 // The chunk size by which the swap file is increased and mapped. 55 inline void SwapSpace::InsertChunk(const SpaceChunk& chunk) { argument 56 DCHECK_NE(chunk.size, 0u); 57 auto insert_result = free_by_start_.insert(chunk); 59 free_by_size_.emplace(chunk.size, insert_result.first); 74 for (const SpaceChunk& chunk : free_by_start_) { 75 if (munmap(chunk.ptr, chunk.size) != 0) { 76 PLOG(ERROR) << "Failed to unmap swap space chunk at " 77 << static_cast<const void*>(chunk 199 SpaceChunk chunk = { reinterpret_cast<uint8_t*>(ptr), size }; local [all...] |
H A D | swap_space.h | 95 void InsertChunk(const SpaceChunk& chunk) REQUIRES(lock_); 102 // Map start of a free chunk to its size.
|
/art/runtime/native/ |
H A D | org_apache_harmony_dalvik_ddmc_DdmServer.cc | 36 ArrayRef<const uint8_t> chunk(reinterpret_cast<const uint8_t*>(&data[offset]), 38 Runtime::Current()->GetRuntimeCallbacks()->DdmPublishChunk(static_cast<uint32_t>(type), chunk); local
|
/art/compiler/ |
H A D | common_compiler_test.cc | 77 std::vector<uint8_t>* chunk = &header_code_and_maps_chunks_.back(); local 80 chunk->reserve(size + max_padding); 81 chunk->resize(sizeof(method_header)); 82 memcpy(&(*chunk)[0], &method_header, sizeof(method_header)); 83 chunk->insert(chunk->begin(), vmap_table.begin(), vmap_table.end()); 84 chunk->insert(chunk->begin(), method_info.begin(), method_info.end()); 85 chunk->insert(chunk [all...] |
/art/runtime/ |
H A D | monitor_pool.cc | 36 AllocateChunk(); // Get our first chunk. 44 // Do we need to allocate another chunk list? 59 // Allocate the chunk. 60 void* chunk = allocator_.allocate(kChunkSize); local 62 CHECK_NE(reinterpret_cast<uintptr_t>(nullptr), reinterpret_cast<uintptr_t>(chunk)); 64 CHECK_EQ(0U, reinterpret_cast<uintptr_t>(chunk) % kMonitorAlignment); 66 // Add the chunk. 67 monitor_chunks_[current_chunk_list_index_][num_chunks_] = reinterpret_cast<uintptr_t>(chunk); 71 Monitor* last = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(chunk) + 87 DCHECK(last == reinterpret_cast<Monitor*>(chunk)); [all...] |
H A D | debugger.cc | 4355 ScopedLocalRef<jobject> chunk( 4368 if (chunk.get() == nullptr) { 4373 * Pull the pieces out of the chunk. We copy the results into a 4388 chunk.get(), WellKnownClasses::org_apache_harmony_dalvik_ddmc_Chunk_data))); 4389 jint offset = env->GetIntField(chunk.get(), 4391 jint length = env->GetIntField(chunk.get(), 4393 *out_type = env->GetIntField(chunk.get(), 4424 * and includes the chunk type/length, followed by the data. 4427 * chunk. If this becomes inconvenient we will need to adapt. 4440 LOG(WARNING) << StringPrintf("bad chunk foun [all...] |
/art/test/1940-ddms-ext/ |
H A D | ddm_ext.cc | 55 jobject chunk) { 61 CHECK(chunk != nullptr); 72 jint type = env->GetIntField(chunk, type_field_id); 73 jint off = env->GetIntField(chunk, offset_field_id); 74 jint len = env->GetIntField(chunk, length_field_id); 76 env, reinterpret_cast<jbyteArray>(env->GetObjectField(chunk, data_field_id))); 53 Java_art_Test1940_processChunk(JNIEnv* env, jclass, jobject chunk) argument
|
/art/test/074-gc-thrash/src/ |
H A D | Main.java | 333 byte[] chunk; 341 chunk = new byte[100000]; 342 pretendToUse(chunk); 357 public void pretendToUse(byte[] chunk) {} argument
|
/art/compiler/optimizing/ |
H A D | loop_optimization.cc | 847 uint32_t chunk = vector_length_ * unroll; local 849 DCHECK(trip_count == 0 || (trip_count >= MaxNumberPeeled() + chunk)); 854 ((trip_count - vector_static_peeling_factor_) % chunk) != 0; 902 // vtc = stc - (stc - ptc) % chunk; 907 DCHECK(IsPowerOfTwo(chunk)); 919 graph_->GetConstant(induc_type, chunk - 1))); 955 // for ( ; i < vtc; i += chunk)
|
Completed in 395 milliseconds