Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 35) sorted by relevance

12

/art/compiler/utils/
Dassembler_thumb_test_expected.cc.inc2 " 0: 0008 movs r0, r1\n",
3 " 2: 46c8 mov r8, r9\n",
4 " 4: 2001 movs r0, #1\n",
5 " 6: f04f 0809 mov.w r8, #9\n",
9 " 0: ea4f 0001 mov.w r0, r1\n",
10 " 4: ea4f 0809 mov.w r8, r9\n",
14 " 0: 0008 movs r0, r1\n",
15 " 2: 1888 adds r0, r1, r2\n",
16 " 4: 1c08 adds r0, r1, #0\n",
20 " 0: 0008 movs r0, r1\n",
[all …]
Darray_ref.h132 reference operator[](size_type n) {
133 DCHECK_LT(n, size_);
134 return array_[n];
137 const_reference operator[](size_type n) const {
138 DCHECK_LT(n, size_);
139 return array_[n];
Dswap_space.h164 pointer allocate(size_type n, SwapAllocator<void>::pointer hint = nullptr) {
165 DCHECK_LE(n, max_size());
167 return reinterpret_cast<T*>(malloc(n * sizeof(T)));
169 return reinterpret_cast<T*>(swap_space_->Alloc(n * sizeof(T)));
172 void deallocate(pointer p, size_type n) { in deallocate() argument
176 swap_space_->Free(p, n * sizeof(T)); in deallocate()
Dscoped_arena_containers.h142 pointer allocate(size_type n, ScopedArenaAllocatorAdapter<void>::pointer hint = nullptr) {
143 DCHECK_LE(n, max_size());
145 return reinterpret_cast<T*>(arena_stack_->Alloc(n * sizeof(T),
148 void deallocate(pointer p, size_type n) { in deallocate() argument
Darena_containers.h161 pointer allocate(size_type n, ArenaAllocatorAdapter<void>::pointer hint = nullptr) {
162 DCHECK_LE(n, max_size());
163 return reinterpret_cast<T*>(arena_allocator_->Alloc(n * sizeof(T),
166 void deallocate(pointer p, size_type n) { in deallocate() argument
/art/runtime/base/unix_file/
Drandom_access_file_utils.cc28 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()
Drandom_access_file_test.h57 int64_t n = 0; in ReadString() local
59 while ((n = f->Read(buf, sizeof(buf), offset)) > 0) { in ReadString()
60 s->append(buf, n); in ReadString()
61 offset += n; in ReadString()
63 return n != -1; in ReadString()
/art/test/101-fibonacci/src/
DMain.java37 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/
Dnth_caller_visitor.h29 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
Dutils.h89 template<int n, typename T>
91 COMPILE_ASSERT((n & (n - 1)) == 0, n_not_power_of_two); in IsAligned()
92 return (x & (n - 1)) == 0; in IsAligned()
95 template<int n, typename T>
97 return IsAligned<n>(reinterpret_cast<const uintptr_t>(x)); in IsAligned()
101 static inline bool IsAlignedParam(T x, int n) { in IsAlignedParam() argument
102 return (x & (n - 1)) == 0; in IsAlignedParam()
184 static constexpr T RoundDown(T x, typename TypeIdentity<T>::type n) WARN_UNUSED;
187 static constexpr T RoundDown(T x, typename TypeIdentity<T>::type n) {
189 DCHECK_CONSTEXPR(IsPowerOfTwo(n), , T(0))
[all …]
Dvmap_table.h36 uint16_t operator[](size_t n) const {
39 CHECK_LT(n, size);
41 for (size_t i = 0; i < n; ++i) {
Dprofiler.cc304 int n = ::write(fd, p, length); in WriteProfile() local
305 p += n; in WriteProfile()
306 length -= n; in WriteProfile()
725 int n = read(fd, buf, 1); // TODO: could speed this up but is it worth it? in ReadProfileLine() local
726 if (n != 1) { in ReadProfileLine()
Dutils.cc121 int64_t n = TEMP_FAILURE_RETRY(read(file->Fd(), &buf[0], buf.size())); in ReadFileToString() local
122 if (n == -1) { in ReadFileToString()
125 if (n == 0) { in ReadFileToString()
128 result->append(&buf[0], n); in ReadFileToString()
/art/runtime/base/
Dstringpiece.cc28 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()
Dstringpiece.h86 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;
Dallocator.h121 pointer allocate(size_type n, const_pointer hint = 0) {
122 const size_t size = n * sizeof(T);
128 void deallocate(PT p, size_type n) { in deallocate() argument
129 const size_t size = n * sizeof(T); in deallocate()
Dhash_set_test.cc176 size_t n = PRand(); in TEST_F() local
177 if (n % target_size == 0) { in TEST_F()
182 } else if (n % target_size < delta) { in TEST_F()
/art/runtime/gc/accounting/
Datomic_stack.h129 void PopBackCount(int32_t n) { in PopBackCount() argument
130 DCHECK_GE(Size(), static_cast<size_t>(n)); in PopBackCount()
131 back_index_.FetchAndSubSequentiallyConsistent(n); in PopBackCount()
/art/compiler/dex/quick/arm64/
Dtarget_arm64.cc280 unsigned n = (value >> 12) & 0x01; in DecodeLogicalImmediate() local
300 if (n == 1) { in DecodeLogicalImmediate()
861 int n = *num_fpr_used; in GetArgPhysicalReg() local
862 if (n < 8) { in GetArgPhysicalReg()
863 *num_fpr_used = n + 1; in GetArgPhysicalReg()
872 return RegStorage(RegStorage::kValid | reg_kind | RegStorage::kFloatingPoint | n); in GetArgPhysicalReg()
875 int n = *num_gpr_used; in GetArgPhysicalReg() local
876 if (n < 8) { in GetArgPhysicalReg()
877 *num_gpr_used = n + 1; in GetArgPhysicalReg()
880 return RegStorage::Solo64(n); in GetArgPhysicalReg()
[all …]
/art/test/107-int-math2/src/
DMain.java720 static int fibonacci(int n) { in fibonacci() argument
721 if (n == 0) { in fibonacci()
723 } else if (n == 1) { in fibonacci()
726 return fibonacci(n - 1) + fibonacci(n - 2); in fibonacci()
/art/disassembler/
Ddisassembler_arm.cc857 FpRegister n(instr, 16, 7); in DumpThumb32() local
861 args << d << ", " << n << ", " << m; in DumpThumb32()
864 args << d << ", " << n << ", " << m; in DumpThumb32()
867 args << d << ", " << n << ", " << m; in DumpThumb32()
870 args << d << ", " << n << ", " << m; in DumpThumb32()
981 FpRegister n(instr, 16, 7); in DumpThumb32() local
984 args << Rt << ", " << n; in DumpThumb32()
986 args << n << ", " << Rt; in DumpThumb32()
/art/compiler/utils/arm/
Dassembler_arm.cc843 int32_t n; in LeadingZeros() local
847 n = 32; in LeadingZeros()
851 n = n - count; in LeadingZeros()
856 return n - val; in LeadingZeros()
/art/compiler/dex/quick/arm/
Dutility_arm.cc100 int32_t n; in LeadingZeros() local
104 n = 32; in LeadingZeros()
108 n = n - count; in LeadingZeros()
113 return n - val; in LeadingZeros()
/art/oatdump/
Doatdump.cc1497 size_t n = method_outlier_size.size(); in DumpOutliers() local
1498 for (size_t i = 0; i < n; i++) { in DumpOutliers()
1506 size_t size_mean = sum_of_sizes / n; in DumpOutliers()
1507 size_t size_variance = (sum_of_sizes_squared - sum_of_sizes * size_mean) / (n - 1); in DumpOutliers()
1508 double expansion_mean = sum_of_expansion / n; in DumpOutliers()
1510 (sum_of_expansion_squared - sum_of_expansion * expansion_mean) / (n - 1); in DumpOutliers()
1518 for (size_t j = 0; j < n; j++) { in DumpOutliers()
1557 for (size_t j = 0; j < n; j++) { in DumpOutliers()
/art/compiler/
Dimage_writer.cc981 size_t n; in CopyAndFixupObjectsCallback() local
985 n = mirror::ArtMethod::SizeWithoutPointerFields(sizeof(void*)); in CopyAndFixupObjectsCallback()
987 n = obj->SizeOf(); in CopyAndFixupObjectsCallback()
989 DCHECK_LT(offset + n, image_writer->image_->Size()); in CopyAndFixupObjectsCallback()
990 memcpy(dst, src, n); in CopyAndFixupObjectsCallback()

12