Searched refs:count (Results 1 - 25 of 199) sorted by relevance

12345678

/art/benchmark/string-indexof/src/
H A DStringIndexOfBenchmark.java20 public void timeIndexOf0(int count) { argument
23 for (int i = 0; i < count; ++i) {
28 public void timeIndexOf1(int count) { argument
31 for (int i = 0; i < count; ++i) {
36 public void timeIndexOf2(int count) { argument
39 for (int i = 0; i < count; ++i) {
44 public void timeIndexOf3(int count) { argument
47 for (int i = 0; i < count; ++i) {
52 public void timeIndexOf4(int count) { argument
55 for (int i = 0; i < count;
60 timeIndexOf7(int count) argument
68 timeIndexOf8(int count) argument
76 timeIndexOfF(int count) argument
84 timeIndexOfG(int count) argument
92 timeIndexOfV(int count) argument
100 timeIndexOfW(int count) argument
108 timeIndexOf_(int count) argument
[all...]
/art/test/674-hotness-compiled/
H A Drun17 ${RUN} "$@" -Xcompiler-option --count-hotness-in-compiled-code
/art/test/080-oom-fragmentation/src/
H A DMain.java22 int count = 0;
25 holder[count++] = new Object[1025]; // A bit over one page.
28 for (int i = 0; i < count; ++i) {
/art/benchmark/type-check/src/
H A DTypeCheckBenchmark.java18 public void timeCheckCastLevel1ToLevel1(int count) { argument
20 for (int i = 0; i < count; ++i) {
25 public void timeCheckCastLevel2ToLevel1(int count) { argument
27 for (int i = 0; i < count; ++i) {
32 public void timeCheckCastLevel3ToLevel1(int count) { argument
34 for (int i = 0; i < count; ++i) {
39 public void timeCheckCastLevel9ToLevel1(int count) { argument
41 for (int i = 0; i < count; ++i) {
46 public void timeCheckCastLevel9ToLevel2(int count) { argument
48 for (int i = 0; i < count;
53 timeInstanceOfLevel1ToLevel1(int count) argument
64 timeInstanceOfLevel2ToLevel1(int count) argument
75 timeInstanceOfLevel3ToLevel1(int count) argument
86 timeInstanceOfLevel9ToLevel1(int count) argument
97 timeInstanceOfLevel9ToLevel2(int count) argument
[all...]
/art/runtime/arch/
H A Dmemcmp16.cc22 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 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) { 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/165-lock-owner-proxy/src/
H A DMain.java65 int count = totalOperations;
66 while (count > 0) {
69 inf.foo(10000 - count, 11000 - count, 12000 - count, 13000 - count,
70 14000 - count, 15000 - count);
76 count--;
83 int count
[all...]
/art/test/023-many-interfaces/
H A Diface-gen.c11 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/test/626-const-class-linking/src/
H A DRacyMisbehavingLoader.java26 private int count; field in class:RacyMisbehavingLoader
31 public RacyMisbehavingLoader(ClassLoader parent, int count, boolean throw_error) { argument
33 this.count = count;
44 if (index == 2 * count) {
62 int my_index = syncWithOtherInstances(count);
69 syncWithOtherInstances(2 * count);
H A DRacyLoader.java26 private int count; field in class:RacyLoader
30 public RacyLoader(ClassLoader parent, int count) { argument
32 this.count = count;
51 int my_index = syncWithOtherInstances(count);
53 syncWithOtherInstances(2 * count);
/art/runtime/
H A Dmanaged_stack.cc28 size_t count = 0; local
36 count += current_frame->NumberOfVRegs();
40 return count;
H A Dnth_caller_visitor.h33 count(0),
48 if (count == n) {
53 count++;
60 size_t count; member in struct:art::NthCallerVisitor
H A Dthread_pool_test.cc30 explicit CountTask(AtomicInteger* count) : count_(count), verbose_(false) {} argument
65 AtomicInteger count(0);
68 thread_pool.AddTask(self, new CountTask(&count));
74 EXPECT_EQ(num_tasks, count.LoadSequentiallyConsistent());
80 AtomicInteger count(0);
83 thread_pool.AddTask(self, new CountTask(&count));
87 EXPECT_EQ(0, count.LoadSequentiallyConsistent());
106 AtomicInteger count(0);
109 thread_pool.AddTask(self, new CountTask(&count));
127 TreeTask(ThreadPool* const thread_pool, AtomicInteger* count, int depth) argument
[all...]
H A Dbarrier.cc28 Barrier::Barrier(int count) argument
29 : count_(count),
46 void Barrier::Init(Thread* self, int count) { argument
48 SetCountLocked(self, count);
56 // Increment the count. If it becomes zero after the increment
60 // Pass function is called by the last thread, the count will
98 void Barrier::SetCountLocked(Thread* self, int count) { argument
99 count_ = count;
100 if (count == 0) {
108 CHECK_EQ(count_, 0) << "Attempted to destroy barrier with non zero count";
[all...]
H A Dbarrier.h21 // 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.
43 explicit Barrier(int count);
46 // Pass through the barrier, decrement the count but do not block.
49 // Wait on the barrier, decrement the count.
58 // Increment the count by delta, wait on condition if count is non zero. If LockHandling is
63 // Increment the count b
[all...]
H A Dnative_bridge_art_interface.cc64 uint32_t count = 0; local
67 if (count < method_count) {
68 methods[count].name = m.GetName();
69 methods[count].signature = m.GetShorty();
70 methods[count].fnPtr = m.GetEntryPointFromJni();
71 count++;
78 return count;
/art/runtime/native/
H A Djava_lang_System.cc52 // The API is defined in terms of length, but length is somewhat overloaded so we use count.
53 const jint count = length; local
81 if (UNLIKELY(srcPos < 0) || UNLIKELY(dstPos < 0) || UNLIKELY(count < 0) ||
82 UNLIKELY(srcPos > srcArray->GetLength() - count) ||
83 UNLIKELY(dstPos > dstArray->GetLength() - count)) {
87 count);
104 dstArray->AsByteSizedArray()->Memmove(dstPos, srcArray->AsByteSizedArray(), srcPos, count);
109 dstArray->AsShortSizedArray()->Memmove(dstPos, srcArray->AsShortSizedArray(), srcPos, count);
113 dstArray->AsIntArray()->Memmove(dstPos, srcArray->AsIntArray(), srcPos, count);
117 dstArray->AsFloatArray()->Memmove(dstPos, srcArray->AsFloatArray(), srcPos, count);
171 System_arraycopyTUnchecked(JNIEnv* env, jobject javaSrc, jint srcPos, jobject javaDst, jint dstPos, jint count) argument
185 System_arraycopyCharUnchecked(JNIEnv* env, jclass, jcharArray javaSrc, jint srcPos, jcharArray javaDst, jint dstPos, jint count) argument
191 System_arraycopyByteUnchecked(JNIEnv* env, jclass, jbyteArray javaSrc, jint srcPos, jbyteArray javaDst, jint dstPos, jint count) argument
197 System_arraycopyShortUnchecked(JNIEnv* env, jclass, jshortArray javaSrc, jint srcPos, jshortArray javaDst, jint dstPos, jint count) argument
203 System_arraycopyIntUnchecked(JNIEnv* env, jclass, jintArray javaSrc, jint srcPos, jintArray javaDst, jint dstPos, jint count) argument
209 System_arraycopyLongUnchecked(JNIEnv* env, jclass, jlongArray javaSrc, jint srcPos, jlongArray javaDst, jint dstPos, jint count) argument
215 System_arraycopyFloatUnchecked(JNIEnv* env, jclass, jfloatArray javaSrc, jint srcPos, jfloatArray javaDst, jint dstPos, jint count) argument
221 System_arraycopyDoubleUnchecked(JNIEnv* env, jclass, jdoubleArray javaSrc, jint srcPos, jdoubleArray javaDst, jint dstPos, jint count) argument
227 System_arraycopyBooleanUnchecked(JNIEnv* env, jclass, jbooleanArray javaSrc, jint srcPos, jbooleanArray javaDst, jint dstPos, jint count) argument
[all...]
/art/runtime/interpreter/mterp/arm/
H A Dheader.S162 .macro FETCH_ADVANCE_INST count
163 ldrh rINST, [rPC, #((\count)*2)]!
170 .macro PREFETCH_ADVANCE_INST dreg, sreg, count
171 ldrh \dreg, [\sreg, #((\count)*2)]!
179 .macro PREFETCH_INST count
180 ldrh rINST, [rPC, #((\count)*2)]
184 .macro ADVANCE count
185 add rPC, #((\count)*2)
208 .macro FETCH reg, count
209 ldrh \reg, [rPC, #((\count)*
[all...]
/art/test/444-checker-nce/src/
H A DMain.java97 public Main forRemoveTest(int count) { argument
100 for (int i = 0; i < count; i++) {
113 public Main forKeepTest(int count) { argument
116 for (int i = 0; i < count; i++) {
131 public Main phiFlowRemoveTest(int count) { argument
134 for (int i = 0; i < count; i++) {
140 for (int i = 0; i < count; i++) {
153 public Main phiFlowKeepTest(int count) { argument
156 for (int i = 0; i < count; i++) {
164 for (int i = 0; i < count;
174 scopeRemoveTest(int count, Main a) argument
192 scopeKeepTest(int count, Main a) argument
[all...]
/art/test/004-StackWalk/
H A Dstack_walk_jni.cc79 extern "C" JNIEXPORT jint JNICALL Java_Main_stackmap(JNIEnv*, jobject, jint count) { argument
81 CHECK_EQ(count, 0);
88 return count + 1;
91 extern "C" JNIEXPORT jint JNICALL Java_Main_refmap2(JNIEnv*, jobject, jint count) { argument
99 return count + 1;
/art/test/303-verification-stress/
H A Dclasses-gen.c11 static int createFiles(int count, int array_size) argument
17 for (i = 0; i < count; i++) {
46 for (i = 0; i < count; i++) {
/art/test/669-moveable-string-class-equals/src/
H A DMain.java50 for (int count = 0; count != 128 * 1024; ++count) {
/art/test/911-get-stack-trace/src/art/
H A DFrames.java41 int count = getFrameCount(t);
42 System.out.println(count);
48 for (int i = 0; i < count; i++) {
52 System.out.println(Arrays.toString(getFrameLocation(t, count)));
74 int count = getFrameCount(t);
75 System.out.println(count);
81 for (int i = 0; i < count; i++) {
85 System.out.println(Arrays.toString(getFrameLocation(t, count)));
112 int count = getFrameCount(t);
113 System.out.println(count);
[all...]
/art/libartbase/base/
H A Dhex_dump.cc71 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;
/art/tools/ahat/src/main/com/android/ahat/heapdump/
H A DAhatArrayInstance.java269 String asString(int offset, int count, int maxChars) { argument
274 if (count == 0) {
278 if (0 <= maxChars && maxChars < count) {
279 count = maxChars;
282 int end = offset + count - 1;
284 return new String(mCharArray, offset, count);
293 String asAsciiString(int offset, int count, int maxChars) { argument
298 if (count == 0) {
302 if (0 <= maxChars && maxChars < count) {
303 count
317 asMaybeCompressedString(int offset, int count, int maxChars) argument
[all...]

Completed in 5170 milliseconds

12345678