Home
last modified time | relevance | path

Searched refs:count (Results 1 – 25 of 110) sorted by relevance

12345

/art/runtime/
Dthread_pool_test.cc29 explicit CountTask(AtomicInteger* count) : count_(count), verbose_(false) {} in CountTask() argument
64 AtomicInteger count(0); in TEST_F() local
67 thread_pool.AddTask(self, new CountTask(&count)); in TEST_F()
73 EXPECT_EQ(num_tasks, count.LoadSequentiallyConsistent()); in TEST_F()
79 AtomicInteger count(0); in TEST_F() local
82 thread_pool.AddTask(self, new CountTask(&count)); in TEST_F()
86 EXPECT_EQ(0, count.LoadSequentiallyConsistent()); in TEST_F()
98 while (count.LoadSequentiallyConsistent() != num_tasks && in TEST_F()
107 TreeTask(ThreadPool* const thread_pool, AtomicInteger* count, int depth) in TreeTask() argument
109 count_(count), in TreeTask()
[all …]
Dnative_bridge_art_interface.cc67 uint32_t count = 0; in GetNativeMethods() local
71 if (count < method_count) { in GetNativeMethods()
72 methods[count].name = m->GetName(); in GetNativeMethods()
73 methods[count].signature = m->GetShorty(); in GetNativeMethods()
74 methods[count].fnPtr = m->GetEntryPointFromJni(); in GetNativeMethods()
75 count++; in GetNativeMethods()
84 if (count < method_count) { in GetNativeMethods()
85 methods[count].name = m->GetName(); in GetNativeMethods()
86 methods[count].signature = m->GetShorty(); in GetNativeMethods()
87 methods[count].fnPtr = m->GetEntryPointFromJni(); in GetNativeMethods()
[all …]
Dbarrier.cc24 Barrier::Barrier(int count) in Barrier() argument
25 : count_(count), in Barrier()
39 void Barrier::Init(Thread* self, int count) { in Init() argument
41 SetCountLocked(self, count); in Init()
79 void Barrier::SetCountLocked(Thread* self, int count) { in SetCountLocked() argument
80 count_ = count; in SetCountLocked()
Dnth_caller_visitor.h31 count(0), caller(NULL) {} in StackVisitor()
44 if (count == n) { in VisitFrame()
48 count++; in VisitFrame()
55 size_t count; member
Dbarrier.h38 explicit Barrier(int count);
61 void Init(Thread* self, int count);
64 void SetCountLocked(Thread* self, int count) EXCLUSIVE_LOCKS_REQUIRED(lock_);
Dbarrier_test.cc89 CheckPassTask(Barrier* barrier, AtomicInteger* count, size_t subtasks) in CheckPassTask() argument
91 count_(count), in CheckPassTask()
116 AtomicInteger count(0); in TEST_F() local
120 thread_pool.AddTask(self, new CheckPassTask(&barrier, &count, num_sub_tasks)); in TEST_F()
127 EXPECT_EQ(count.LoadRelaxed(), expected_total_tasks); in TEST_F()
Ddex_file_verifier.h45 bool CheckListSize(const void* start, size_t count, size_t element_size, const char* label);
75 bool CheckIntraSectionIterate(size_t offset, uint32_t count, uint16_t type);
76 bool CheckIntraIdSection(size_t offset, uint32_t count, uint16_t type);
77 bool CheckIntraDataSection(size_t offset, uint32_t count, uint16_t type);
98 bool CheckInterSectionIterate(size_t offset, uint32_t count, uint16_t type);
Dprofiler.cc434 is_filtered = filtered_methods_.count(method_full_name) != 0; in ProcessMethod()
591 uint32_t count = meth_iter.second; in Write() local
597 count += pi->second.count_; in Write()
600 os << StringPrintf("%s/%u/%u\n", method_name.c_str(), count, method_size); in Write()
617 uint32_t count = node->GetCount(); in Write() local
619 total_count += count; in Write()
632 new_context_map[std::make_pair(dexpc, context_sig)] = count; in Write()
641 uint32_t count = context_i.second; in Write() local
644 new_context_map[context_i.first] = count; in Write()
646 ci->second += count; in Write()
[all …]
/art/runtime/native/
Djava_lang_System.cc48 const jint count = length; in System_arraycopy() local
76 if (UNLIKELY(srcPos < 0) || UNLIKELY(dstPos < 0) || UNLIKELY(count < 0) || in System_arraycopy()
77 UNLIKELY(srcPos > srcArray->GetLength() - count) || in System_arraycopy()
78 UNLIKELY(dstPos > dstArray->GetLength() - count)) { in System_arraycopy()
83 count); in System_arraycopy()
100 dstArray->AsByteSizedArray()->Memmove(dstPos, srcArray->AsByteSizedArray(), srcPos, count); in System_arraycopy()
105 … dstArray->AsShortSizedArray()->Memmove(dstPos, srcArray->AsShortSizedArray(), srcPos, count); in System_arraycopy()
110 dstArray->AsIntArray()->Memmove(dstPos, srcArray->AsIntArray(), srcPos, count); in System_arraycopy()
115 dstArray->AsLongArray()->Memmove(dstPos, srcArray->AsLongArray(), srcPos, count); in System_arraycopy()
120 dstObjArray->AssignableMemmove(dstPos, srcObjArray, srcPos, count); in System_arraycopy()
[all …]
/art/runtime/mirror/
Darray-inl.h222 static inline void ArrayBackwardCopy(T* d, const T* s, int32_t count) { in ArrayBackwardCopy() argument
223 d += count; in ArrayBackwardCopy()
224 s += count; in ArrayBackwardCopy()
225 for (int32_t i = 0; i < count; ++i) { in ArrayBackwardCopy()
235 static inline void ArrayForwardCopy(T* d, const T* s, int32_t count) { in ArrayForwardCopy() argument
236 for (int32_t i = 0; i < count; ++i) { in ArrayForwardCopy()
245 int32_t count) { in Memmove() argument
246 if (UNLIKELY(count == 0)) { in Memmove()
251 DCHECK_GT(count, 0); in Memmove()
254 DCHECK_LE(dst_pos, GetLength() - count); in Memmove()
[all …]
Dobject_array-inl.h119 int32_t src_pos, int32_t count) { in AssignableMemmove() argument
121 for (int i = 0; i < count; ++i) { in AssignableMemmove()
132 const bool copy_forward = (src != this) || (dst_pos < src_pos) || (dst_pos - src_pos >= count); in AssignableMemmove()
135 for (int i = 0; i < count; ++i) { in AssignableMemmove()
142 for (int i = count - 1; i >= 0; --i) { in AssignableMemmove()
149 dstAsIntArray->Memmove(dst_pos, srcAsIntArray, src_pos, count); in AssignableMemmove()
151 Runtime::Current()->GetHeap()->WriteBarrierArray(this, dst_pos, count); in AssignableMemmove()
153 for (int i = 0; i < count; ++i) { in AssignableMemmove()
162 int32_t src_pos, int32_t count) { in AssignableMemcpy() argument
164 for (int i = 0; i < count; ++i) { in AssignableMemcpy()
[all …]
/art/runtime/arch/
Dmemcmp16.h35 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) { in MemCmp16() argument
42 for (size_t i = 0; i < count; i++) { in MemCmp16()
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);
Dmemcmp16.cc22 int32_t memcmp16_generic_static(const uint16_t* s0, const uint16_t* s1, size_t count) { in memcmp16_generic_static() argument
23 for (size_t i = 0; i < count; i++) { in memcmp16_generic_static()
35 int32_t MemCmp16Testing(const uint16_t* s0, const uint16_t* s1, size_t count) { in MemCmp16Testing() argument
36 return MemCmp16(s0, s1, count); in MemCmp16Testing()
/art/test/023-many-interfaces/
Diface-gen.c11 static int createFiles(int count) in createFiles() argument
16 for (i = 0; i < count; i++) { in createFiles()
35 for (i = 0; i < count; i++) { in createFiles()
36 fprintf(fp, " Interface%03d%s\n", i, (i == count-1) ? "" : ","); in createFiles()
39 for (i = 1; i < count; i += 2) { in createFiles()
/art/test/023-many-interfaces/src/
DManyInterfaces.java302 static void testIface001(Interface001 iface, int count) { in testIface001() argument
303 while (count-- != 0) { in testIface001()
311 static void testIface049(Interface049 iface, int count) { in testIface049() argument
312 while (count-- != 0) { in testIface049()
320 static void testIface099(Interface099 iface, int count) { in testIface099() argument
321 while (count-- != 0) { in testIface099()
329 static void testVirt001(ManyInterfaces obj, int count) { in testVirt001() argument
330 while (count-- != 0) { in testVirt001()
338 static void testVirt049(ManyInterfaces obj, int count) { in testVirt049() argument
339 while (count-- != 0) { in testVirt049()
[all …]
/art/compiler/dex/
Dmir_graph_test.cc58 void DoPrepareBasicBlocks(const BBDef* defs, size_t count) { in DoPrepareBasicBlocks() argument
61 ASSERT_LT(3u, count); // null, entry, exit and at least one bytecode block. in DoPrepareBasicBlocks()
65 for (size_t i = 0u; i != count; ++i) { in DoPrepareBasicBlocks()
100 cu_.mir_graph->num_blocks_ = count; in DoPrepareBasicBlocks()
101 ASSERT_EQ(count, cu_.mir_graph->block_list_.Size()); in DoPrepareBasicBlocks()
108 template <size_t count>
109 void PrepareBasicBlocks(const BBDef (&defs)[count]) { in PrepareBasicBlocks() argument
110 DoPrepareBasicBlocks(defs, count); in PrepareBasicBlocks()
130 void DoCheckOrder(const BasicBlockId* ids, size_t count) { in DoCheckOrder() argument
131 ASSERT_EQ(count, cu_.mir_graph->GetTopologicalSortOrder()->Size()); in DoCheckOrder()
[all …]
Dmir_optimization_test.cc78 void DoPrepareSFields(const SFieldDef* defs, size_t count) { in DoPrepareSFields() argument
80 cu_.mir_graph->sfield_lowering_infos_.Resize(count); in DoPrepareSFields()
81 for (size_t i = 0u; i != count; ++i) { in DoPrepareSFields()
96 template <size_t count>
97 void PrepareSFields(const SFieldDef (&defs)[count]) { in PrepareSFields() argument
98 DoPrepareSFields(defs, count); in PrepareSFields()
101 void DoPrepareBasicBlocks(const BBDef* defs, size_t count) { in DoPrepareBasicBlocks() argument
104 ASSERT_LT(3u, count); // null, entry, exit and at least one bytecode block. in DoPrepareBasicBlocks()
108 for (size_t i = 0u; i != count; ++i) { in DoPrepareBasicBlocks()
143 cu_.mir_graph->num_blocks_ = count; in DoPrepareBasicBlocks()
[all …]
Dmir_field_info.cc33 MirIFieldLoweringInfo* field_infos, size_t count) { in Resolve() argument
36 DCHECK_NE(count, 0u); in Resolve()
37 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve()
55 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve()
77 MirSFieldLoweringInfo* field_infos, size_t count) { in Resolve() argument
80 DCHECK_NE(count, 0u); in Resolve()
81 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve()
102 for (auto it = field_infos, end = field_infos + count; it != end; ++it) { in Resolve()
/art/runtime/base/
Dhash_set_test.cc82 static constexpr size_t count = 1000; in TEST_F() local
84 for (size_t i = 0; i < count; ++i) { in TEST_F()
94 for (size_t i = 1; i < count; i += 2) { in TEST_F()
101 for (size_t i = 1; i < count; i += 2) { in TEST_F()
105 for (size_t i = 0; i < count; i += 2) { in TEST_F()
115 static constexpr size_t count = 1000; in TEST_F() local
117 for (size_t i = 0; i < count; ++i) { in TEST_F()
127 for (size_t i = 0; i < count; ++i) { in TEST_F()
137 for (size_t i = 0; i < count; ++i) { in TEST_F()
145 static constexpr size_t count = 1000; in TEST_F() local
[all …]
Dhex_dump.cc71 size_t count = std::min(byte_count, 16 - gap); in Dump() local
82 for (i = gap ; i < count + gap; i++) { in Dump()
104 byte_count -= count; in Dump()
105 offset += count; in Dump()
/art/test/050-sync-test/src/
DMain.java118 int count = mCount; in output() local
128 count++; in output()
129 mCount = count; in output()
137 private static int count = 0; field in SleepyThread
143 setName("thread#" + count); in SleepyThread()
144 count++; in SleepyThread()
/art/test/004-NativeAllocations/src/
DMain.java57 int count = 16; in main() local
58 int size = (int)(maxMem / 2 / count); in main()
60 NativeAllocation[] allocations = new NativeAllocation[count]; in main()
62 allocations[i % count] = new NativeAllocation(size); in main()
/art/test/004-StackWalk/
Dstack_walk_jni.cc103 extern "C" JNIEXPORT jint JNICALL Java_Main_stackmap(JNIEnv*, jobject, jint count) { in Java_Main_stackmap() argument
105 CHECK_EQ(count, 0); in Java_Main_stackmap()
112 return count + 1; in Java_Main_stackmap()
115 extern "C" JNIEXPORT jint JNICALL Java_Main_refmap2(JNIEnv*, jobject, jint count) { in Java_Main_refmap2() argument
123 return count + 1; in Java_Main_refmap2()
/art/test/303-verification-stress/
Dclasses-gen.c11 static int createFiles(int count, int array_size) in createFiles() argument
17 for (i = 0; i < count; i++) { in createFiles()
46 for (i = 0; i < count; i++) { in createFiles()
/art/test/044-proxy/src/
DNarrowingTest.java35 int count = 0; in main()
40 if (count == 0) { in main()
41 count++; in main()

12345