| /art/runtime/base/unix_file/ |
| D | random_access_file_utils.cc | 28 int64_t n; in CopyFile() local
29 while ((n = src.Read(&buf[0], buf.size(), offset)) > 0) { in CopyFile()
30 if (dst->Write(&buf[0], n, offset) != n) { in CopyFile()
33 offset += n; in CopyFile()
35 return n >= 0; in CopyFile()
|
| D | random_access_file_test.h | 55 int64_t n = 0; in ReadString() local
57 while ((n = f->Read(buf, sizeof(buf), offset)) > 0) { in ReadString()
58 s->append(buf, n); in ReadString()
59 offset += n; in ReadString()
61 return n != -1; in ReadString()
|
| /art/test/101-fibonacci/src/ |
| D | Main.java | 37 static int fibonacci(int n) { in fibonacci() argument
38 if ((n == 0) || (n == 1)) { in fibonacci()
39 return n; in fibonacci()
41 return fibonacci(n - 1) + (fibonacci(n - 2)); in fibonacci()
|
| /art/runtime/ |
| D | nth_caller_visitor.h | 29 NthCallerVisitor(Thread* thread, size_t n, bool include_runtime_and_upcalls = false)
30 : StackVisitor(thread, NULL), n(n), include_runtime_and_upcalls_(include_runtime_and_upcalls), in StackVisitor()
44 if (count == n) { in VisitFrame()
53 const size_t n; member
|
| D | utils.h | 55 template<int n, typename T>
57 COMPILE_ASSERT((n & (n - 1)) == 0, n_not_power_of_two); in IsAligned()
58 return (x & (n - 1)) == 0; in IsAligned()
61 template<int n, typename T>
63 return IsAligned<n>(reinterpret_cast<const uintptr_t>(x)); in IsAligned()
123 static inline T RoundDown(T x, int n) {
124 CHECK(IsPowerOfTwo(n));
125 return (x & -n);
129 static inline T RoundUp(T x, int n) {
130 return RoundDown(x + n - 1, n);
|
| D | vmap_table.h | 32 uint16_t operator[](size_t n) const {
35 CHECK_LT(n, size);
37 for (size_t i = 0; i < n; ++i) {
|
| D | utils.cc | 111 int64_t n = TEMP_FAILURE_RETRY(read(file->Fd(), &buf[0], buf.size())); in ReadFileToString() local
112 if (n == -1) { in ReadFileToString()
115 if (n == 0) { in ReadFileToString()
118 result->append(&buf[0], n); in ReadFileToString()
|
| D | dex_file.cc | 72 int n = TEMP_FAILURE_RETRY(read(fd, magic, sizeof(*magic))); in OpenAndReadMagic() local
73 if (n != sizeof(*magic)) { in OpenAndReadMagic()
|
| /art/runtime/native/ |
| D | java_lang_System.cc | 68 void MemmoveWords(void* dst, const void* src, size_t n) { in MemmoveWords() argument
69 DCHECK_EQ((((uintptr_t) dst | (uintptr_t) src | n) & 0x01), 0U); in MemmoveWords()
78 if (n == 0 || d == s) { in MemmoveWords()
88 if (LIKELY((d < s) || ((size_t)(d - s) >= n))) { in MemmoveWords()
102 copyCount = n; in MemmoveWords()
106 n -= copyCount; in MemmoveWords()
117 copyCount = n / sizeof(uint32_t); in MemmoveWords()
125 if ((n & 0x02) != 0) { in MemmoveWords()
130 d += n; in MemmoveWords()
131 s += n; in MemmoveWords()
[all …]
|
| D | dalvik_system_DexFile.cc | 73 const char& operator[](size_t n) const { in operator []()
74 return mUtfChars[n]; in operator []()
|
| /art/runtime/base/ |
| D | stringpiece.cc | 28 int StringPiece::copy(char* buf, size_type n, size_type pos) const { in copy() argument
29 int ret = std::min(length_ - pos, n); in copy()
82 StringPiece StringPiece::substr(size_type pos, size_type n) const { in substr()
84 if (n > length_ - pos) n = length_ - pos; in substr()
85 return StringPiece(ptr_ + pos, n); in substr()
|
| D | stringpiece.h | 86 void remove_prefix(int n) { in remove_prefix() argument
87 ptr_ += n; in remove_prefix()
88 length_ -= n; in remove_prefix()
91 void remove_suffix(int n) { in remove_suffix() argument
92 length_ -= n; in remove_suffix()
148 int copy(char* buf, size_type n, size_type pos = 0) const;
155 StringPiece substr(size_type pos, size_type n = npos) const;
|
| /art/runtime/gc/accounting/ |
| D | gc_allocator.h | 61 pointer allocate(size_type n, const_pointer hint = 0) {
62 return reinterpret_cast<pointer>(RegisterGCAllocation(n * sizeof(T)));
66 void deallocate(PT p, size_type n) { in deallocate() argument
67 RegisterGCDeAllocation(p, n * sizeof(T)); in deallocate()
|
| D | atomic_stack.h | 102 void PopBackCount(int32_t n) { in PopBackCount() argument
103 DCHECK_GE(Size(), static_cast<size_t>(n)); in PopBackCount()
104 back_index_.fetch_sub(n); in PopBackCount()
|
| /art/test/107-int-math2/src/ |
| D | Main.java | 702 static int fibonacci(int n) { in fibonacci() argument
703 if (n == 0) { in fibonacci()
705 } else if (n == 1) { in fibonacci()
708 return fibonacci(n - 1) + fibonacci(n - 2); in fibonacci()
|
| /art/compiler/dex/quick/arm/ |
| D | utility_arm.cc | 100 int n; in LeadingZeros() local
104 n = 32; in LeadingZeros()
108 n = n - count; in LeadingZeros()
113 return n - val; in LeadingZeros()
|
| /art/oatdump/ |
| D | oatdump.cc | 1163 size_t n = method_outlier_size.size(); in DumpOutliers() local
1164 for (size_t i = 0; i < n; i++) { in DumpOutliers()
1172 size_t size_mean = sum_of_sizes / n; in DumpOutliers()
1173 size_t size_variance = (sum_of_sizes_squared - sum_of_sizes * size_mean) / (n - 1); in DumpOutliers()
1174 double expansion_mean = sum_of_expansion / n; in DumpOutliers()
1176 (sum_of_expansion_squared - sum_of_expansion * expansion_mean) / (n - 1); in DumpOutliers()
1184 for (size_t j = 0; j < n; j++) { in DumpOutliers()
1223 for (size_t j = 0; j < n; j++) { in DumpOutliers()
|
| /art/compiler/ |
| D | image_writer.cc | 485 size_t n = obj->SizeOf(); in CopyAndFixupObjectsCallback() local
486 DCHECK_LT(offset + n, image_writer->image_->Size()); in CopyAndFixupObjectsCallback()
487 memcpy(dst, src, n); in CopyAndFixupObjectsCallback()
|
| /art/runtime/gc/collector/ |
| D | mark_sweep.cc | 966 const size_t n = thread_count * 2; in RecursiveMark() local
969 uintptr_t delta = (end - begin) / n; in RecursiveMark()
|