/art/runtime/arch/ |
H A D | memcmp16.cc | 22 int32_t memcmp16_generic_static(const uint16_t* s0, const uint16_t* s1, size_t count); 23 int32_t memcmp16_generic_static(const uint16_t* s0, const uint16_t* s1, size_t count) { argument 24 for (size_t i = 0; i < count; i++) { 36 int32_t MemCmp16Testing(const uint16_t* s0, const uint16_t* s1, size_t count) { argument 37 return MemCmp16(s0, s1, count);
|
H A D | memcmp16.h | 35 extern "C" uint32_t __memcmp16(const uint16_t* s0, const uint16_t* s1, size_t count); 41 static inline int32_t MemCmp16(const uint16_t* s0, const uint16_t* s1, size_t count) { argument 42 for (size_t i = 0; i < count; i++) { 50 extern "C" int32_t memcmp16_generic_static(const uint16_t* s0, const uint16_t* s1, size_t count); 60 int32_t MemCmp16Testing(const uint16_t* s0, const uint16_t* s1, size_t count);
|
/art/test/023-many-interfaces/ |
H A D | iface-gen.c | 11 static int createFiles(int count) argument 16 for (i = 0; i < count; i++) { 35 for (i = 0; i < count; i++) { 36 fprintf(fp, " Interface%03d%s\n", i, (i == count-1) ? "" : ","); 39 for (i = 1; i < count; i += 2) {
|
/art/runtime/ |
H A D | thread_pool_test.cc | 29 explicit CountTask(AtomicInteger* count) : count_(count), verbose_(false) {} argument 64 AtomicInteger count(0); 67 thread_pool.AddTask(self, new CountTask(&count)); 73 EXPECT_EQ(num_tasks, count.LoadSequentiallyConsistent()); 79 AtomicInteger count(0); 82 thread_pool.AddTask(self, new CountTask(&count)); 86 EXPECT_EQ(0, count.LoadSequentiallyConsistent()); 103 TreeTask(ThreadPool* const thread_pool, AtomicInteger* count, int depth) argument 105 count_(count), [all...] |
H A D | barrier.cc | 25 Barrier::Barrier(int count) argument 26 : count_(count), 40 void Barrier::Init(Thread* self, int count) { argument 42 SetCountLocked(self, count); 49 // Increment the count. If it becomes zero after the increment 53 // Pass function is called by the last thread, the count will 82 void Barrier::SetCountLocked(Thread* self, int count) { argument 83 count_ = count; 84 if (count == 0) { 90 CHECK_EQ(count_, 0) << "Attempted to destroy barrier with non zero count"; [all...] |
H A D | barrier.h | 21 // latch API, it is possible to initialize the latch to a count of zero, repeatedly call 22 // Pass() or Wait(), and only then set the count using the Increment() method. Threads at 23 // a Wait() are only awoken if the count reaches zero AFTER the decrement is applied. 25 // decrementing the count, and thus nobody can spuriosly wake up on the initial zero. 38 explicit Barrier(int count); 41 // Pass through the barrier, decrement the count but do not block. 44 // Wait on the barrier, decrement the count. 53 // Increment the count by delta, wait on condition if count is non zero. 56 // Increment the count b [all...] |
H A D | native_bridge_art_interface.cc | 65 uint32_t count = 0; local 68 if (count < method_count) { 69 methods[count].name = m.GetName(); 70 methods[count].signature = m.GetShorty(); 71 methods[count].fnPtr = m.GetEntryPointFromJni(); 72 count++; 80 if (count < method_count) { 81 methods[count].name = m.GetName(); 82 methods[count].signature = m.GetShorty(); 83 methods[count] [all...] |
H A D | nth_caller_visitor.h | 33 count(0), 47 if (count == n) { 51 count++; 58 size_t count; member in struct:art::NthCallerVisitor
|
H A D | art_field.cc | 53 for (size_t i = 0, count = klass->NumInstanceFields(); i < count; ++i) { 66 for (size_t i = 0, count = klass->NumStaticFields(); i < count; ++i) {
|
H A D | barrier_test.cc | 89 CheckPassTask(Barrier* barrier, AtomicInteger* count, size_t subtasks) argument 91 count_(count), 116 AtomicInteger count(0); 120 thread_pool.AddTask(self, new CheckPassTask(&barrier, &count, num_sub_tasks)); 127 EXPECT_EQ(count.LoadRelaxed(), expected_total_tasks);
|
/art/test/004-NativeAllocations/src/ |
H A D | Main.java | 64 int count = 16; 65 int size = (int)(maxMem / 2 / count); 67 NativeAllocation[] allocations = new NativeAllocation[count]; 69 allocations[i % count] = new NativeAllocation(size, false); 76 allocations[i % count] = new NativeAllocation(size, true); 81 allocations[i % count] = new NativeAllocation(size, true);
|
/art/runtime/native/ |
H A D | java_lang_System.cc | 48 // The API is defined in terms of length, but length is somewhat overloaded so we use count. 49 const jint count = length; local 77 if (UNLIKELY(srcPos < 0) || UNLIKELY(dstPos < 0) || UNLIKELY(count < 0) || 78 UNLIKELY(srcPos > srcArray->GetLength() - count) || 79 UNLIKELY(dstPos > dstArray->GetLength() - count)) { 83 count); 100 dstArray->AsByteSizedArray()->Memmove(dstPos, srcArray->AsByteSizedArray(), srcPos, count); 105 dstArray->AsShortSizedArray()->Memmove(dstPos, srcArray->AsShortSizedArray(), srcPos, count); 110 dstArray->AsIntArray()->Memmove(dstPos, srcArray->AsIntArray(), srcPos, count); 115 dstArray->AsLongArray()->Memmove(dstPos, srcArray->AsLongArray(), srcPos, count); 156 System_arraycopyTUnchecked(JNIEnv* env, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 170 System_arraycopyCharUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 176 System_arraycopyByteUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 182 System_arraycopyShortUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 188 System_arraycopyIntUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 194 System_arraycopyLongUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 200 System_arraycopyFloatUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 206 System_arraycopyDoubleUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument 212 System_arraycopyBooleanUnchecked(JNIEnv* env, jclass, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument [all...] |
/art/test/444-checker-nce/src/ |
H A D | Main.java | 106 public Main forRemoveTest(int count) { argument 109 for (int i = 0; i < count; i++) { 122 public Main forKeepTest(int count) { argument 125 for (int i = 0; i < count; i++) { 140 public Main phiFlowRemoveTest(int count) { argument 143 for (int i = 0; i < count; i++) { 149 for (int i = 0; i < count; i++) { 162 public Main phiFlowKeepTest(int count) { argument 165 for (int i = 0; i < count; i++) { 173 for (int i = 0; i < count; 186 scopeRemoveTest(int count, Main a) argument 204 scopeKeepTest(int count, Main a) argument [all...] |
/art/test/004-StackWalk/ |
H A D | stack_walk_jni.cc | 78 extern "C" JNIEXPORT jint JNICALL Java_Main_stackmap(JNIEnv*, jobject, jint count) { argument 80 CHECK_EQ(count, 0); 87 return count + 1; 90 extern "C" JNIEXPORT jint JNICALL Java_Main_refmap2(JNIEnv*, jobject, jint count) { argument 98 return count + 1;
|
/art/test/303-verification-stress/ |
H A D | classes-gen.c | 11 static int createFiles(int count, int array_size) argument 17 for (i = 0; i < count; i++) { 46 for (i = 0; i < count; i++) {
|
/art/compiler/optimizing/ |
H A D | optimization.cc | 24 void HOptimization::MaybeRecordStat(MethodCompilationStat compilation_stat, size_t count) const { 26 stats_->RecordStat(compilation_stat, count);
|
/art/runtime/mirror/ |
H A D | array-inl.h | 256 static inline void ArrayBackwardCopy(T* d, const T* s, int32_t count) { argument 257 d += count; 258 s += count; 259 for (int32_t i = 0; i < count; ++i) { 269 static inline void ArrayForwardCopy(T* d, const T* s, int32_t count) { argument 270 for (int32_t i = 0; i < count; ++i) { 279 int32_t count) { 280 if (UNLIKELY(count == 0)) { 285 DCHECK_GT(count, 0); 288 DCHECK_LE(dst_pos, GetLength() - count); 278 Memmove(int32_t dst_pos, PrimitiveArray<T>* src, int32_t src_pos, int32_t count) argument 338 Memcpy(int32_t dst_pos, PrimitiveArray<T>* src, int32_t src_pos, int32_t count) argument [all...] |
H A D | object_array-inl.h | 124 int32_t src_pos, int32_t count) { 126 for (int i = 0; i < count; ++i) { 137 const bool copy_forward = (src != this) || (dst_pos < src_pos) || (dst_pos - src_pos >= count); 140 for (int i = 0; i < count; ++i) { 147 for (int i = count - 1; i >= 0; --i) { 154 dstAsIntArray->Memmove(dst_pos, srcAsIntArray, src_pos, count); 156 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count); 158 for (int i = 0; i < count; ++i) { 167 int32_t src_pos, int32_t count) { 169 for (int i = 0; i < count; 123 AssignableMemmove(int32_t dst_pos, ObjectArray<T>* src, int32_t src_pos, int32_t count) argument 166 AssignableMemcpy(int32_t dst_pos, ObjectArray<T>* src, int32_t src_pos, int32_t count) argument 198 AssignableCheckingMemcpy(int32_t dst_pos, ObjectArray<T>* src, int32_t src_pos, int32_t count, bool throw_exception) argument [all...] |
H A D | string-inl.h | 38 // Sets string count in the allocation code path to ensure it is guarded by a CAS. 41 explicit SetStringCountVisitor(int32_t count) : count_(count) { argument 55 // Sets string count and value in the allocation code path to ensure it is guarded by a CAS. 58 SetStringCountAndBytesVisitor(int32_t count, Handle<ByteArray> src_array, int32_t offset, argument 60 : count_(count), src_array_(src_array), offset_(offset), high_byte_(high_byte) { 82 // Sets string count and value in the allocation code path to ensure it is guarded by a CAS. 85 SetStringCountAndValueVisitorFromCharArray(int32_t count, Handle<CharArray> src_array, argument 87 count_(count), src_array_(src_array), offset_(offset) { 105 // Sets string count an 108 SetStringCountAndValueVisitorFromString(int32_t count, Handle<String> src_string, int32_t offset) argument 133 int32_t count = GetField32(OFFSET_OF_OBJECT_MEMBER(String, count_)); local [all...] |
/art/runtime/base/ |
H A D | hex_dump.cc | 71 size_t count = std::min(byte_count, 16 - gap); local 72 // CHECK_NE(count, 0U); 73 // CHECK_LE(count + gap, 16U); 82 for (i = gap ; i < count + gap; i++) { 104 byte_count -= count; 105 offset += count;
|
H A D | hash_set_test.cc | 82 static constexpr size_t count = 1000; local 84 for (size_t i = 0; i < count; ++i) { 94 for (size_t i = 1; i < count; i += 2) { 101 for (size_t i = 1; i < count; i += 2) { 105 for (size_t i = 0; i < count; i += 2) { 115 static constexpr size_t count = 1000; local 117 for (size_t i = 0; i < count; ++i) { 127 for (size_t i = 0; i < count; ++i) { 137 for (size_t i = 0; i < count; ++i) { 145 static constexpr size_t count local [all...] |
/art/test/050-sync-test/src/ |
H A D | Main.java | 118 int count = mCount; 128 count++; 129 mCount = count; 137 private static int count = 0; field in class:SleepyThread 143 setName("thread#" + count); 144 count++;
|
/art/test/044-proxy/src/ |
H A D | NarrowingTest.java | 35 int count = 0; 40 if (count == 0) { 41 count++;
|
/art/runtime/jit/ |
H A D | jit_instrumentation.cc | 76 void JitInstrumentationCache::AddSamples(Thread* self, ArtMethod* method, size_t count) { argument 91 it->second += count; 94 sample_count = count; 95 samples_.insert(std::make_pair(method_id, count)); 98 if (sample_count >= hot_method_threshold_ && sample_count - count < hot_method_threshold_) {
|
/art/test/023-many-interfaces/src/ |
H A D | ManyInterfaces.java | 302 static void testIface001(Interface001 iface, int count) { argument 303 while (count-- != 0) { 311 static void testIface049(Interface049 iface, int count) { argument 312 while (count-- != 0) { 320 static void testIface099(Interface099 iface, int count) { argument 321 while (count-- != 0) { 329 static void testVirt001(ManyInterfaces obj, int count) { argument 330 while (count-- != 0) { 338 static void testVirt049(ManyInterfaces obj, int count) { argument 339 while (count 347 testVirt099(ManyInterfaces obj, int count) argument 356 testInstance001(Object obj, int count) argument 380 testInstance049(Object obj, int count) argument 404 testInstance099(Object obj, int count) argument [all...] |