Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 44) 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.h131 reference operator[](size_type n) {
132 DCHECK_LT(n, size_);
133 return array_[n];
136 const_reference operator[](size_type n) const {
137 DCHECK_LT(n, size_);
138 return array_[n];
Dswap_space.h163 pointer allocate(size_type n, SwapAllocator<void>::pointer hint ATTRIBUTE_UNUSED = nullptr) {
164 DCHECK_LE(n, max_size());
166 return reinterpret_cast<T*>(malloc(n * sizeof(T)));
168 return reinterpret_cast<T*>(swap_space_->Alloc(n * sizeof(T)));
171 void deallocate(pointer p, size_type n) { in deallocate() argument
175 swap_space_->Free(p, n * sizeof(T)); in deallocate()
/art/runtime/
Dmemory_region_test.cc24 const size_t n = 8; in TEST() local
25 uint8_t data[n] = { 0, 1, 2, 3, 4, 5, 6, 7 }; in TEST()
26 MemoryRegion region(&data, n); in TEST()
39 const size_t n = 8; in TEST() local
40 uint8_t data[n] = { 0, 0, 0, 0, 0, 0, 0, 0 }; in TEST()
41 MemoryRegion region(&data, n); in TEST()
52 uint8_t expected[n] = { 7, 6, 5, 4, 3, 2, 1, 0 }; in TEST()
53 for (size_t i = 0; i < n; ++i) { in TEST()
Dnth_caller_visitor.h31 n(n_in), in StackVisitor()
47 if (count == n) { in VisitFrame()
56 const size_t n; member
Dvmap_table.h36 uint16_t operator[](size_t n) const {
39 CHECK_LT(n, size);
41 for (size_t i = 0; i < n; ++i) {
Dutils.cc142 int64_t n = TEMP_FAILURE_RETRY(read(file.Fd(), &buf[0], buf.size())); in ReadFileToString() local
143 if (n == -1) { in ReadFileToString()
146 if (n == 0) { in ReadFileToString()
149 result->append(&buf[0], n); in ReadFileToString()
164 int64_t n = TEMP_FAILURE_RETRY(read(file.Fd(), &buf[filled_to], kBufSize - filled_to)); in PrintFileToLog() local
165 if (n <= 0) { in PrintFileToLog()
171 return n == 0; in PrintFileToLog()
176 for (; i < filled_to + n; ++i) { in PrintFileToLog()
182 if (i + 1 < filled_to + n) { in PrintFileToLog()
183 memmove(&buf[0], &buf[i + 1], filled_to + n - i - 1); in PrintFileToLog()
[all …]
/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/base/
Dbit_utils.h105 static constexpr T RoundDown(T x, typename std::decay<T>::type n) WARN_UNUSED;
108 static constexpr T RoundDown(T x, typename std::decay<T>::type n) { in RoundDown() argument
110 DCHECK_CONSTEXPR(IsPowerOfTwo(n), , T(0)) in RoundDown()
111 (x & -n); in RoundDown()
115 static constexpr T RoundUp(T x, typename std::remove_reference<T>::type n) WARN_UNUSED;
118 static constexpr T RoundUp(T x, typename std::remove_reference<T>::type n) { in RoundUp() argument
119 return RoundDown(x + n - 1, n); in RoundUp()
124 static inline T* AlignDown(T* x, uintptr_t n) WARN_UNUSED;
127 static inline T* AlignDown(T* x, uintptr_t n) { in AlignDown() argument
128 return reinterpret_cast<T*>(RoundDown(reinterpret_cast<uintptr_t>(x), n)); in AlignDown()
[all …]
Dstringpiece.cc37 StringPiece::size_type StringPiece::copy(char* buf, size_type n, size_type pos) const { in copy() argument
38 size_type ret = std::min(length_ - pos, n); in copy()
90 StringPiece StringPiece::substr(size_type pos, size_type n) const { in substr()
92 if (n > length_ - pos) n = length_ - pos; in substr()
93 return StringPiece(ptr_ + pos, n); in substr()
Dstringpiece.h95 void remove_prefix(size_type n) { in remove_prefix() argument
96 ptr_ += n; in remove_prefix()
97 length_ -= n; in remove_prefix()
100 void remove_suffix(size_type n) { in remove_suffix() argument
101 length_ -= n; in remove_suffix()
142 size_type copy(char* buf, size_type n, size_type pos = 0) const;
149 StringPiece substr(size_type pos, size_type n = npos) const;
Darena_containers.h157 pointer allocate(size_type n, ArenaAllocatorAdapter<void>::pointer hint = nullptr) {
159 DCHECK_LE(n, max_size());
160 return arena_allocator_->AllocArray<T>(n, ArenaAllocatorAdapterKind::Kind());
162 void deallocate(pointer p, size_type n) { in deallocate() argument
163 UNUSED(p, n); in deallocate()
Dscoped_arena_containers.h148 pointer allocate(size_type n, ScopedArenaAllocatorAdapter<void>::pointer hint = nullptr) {
150 DCHECK_LE(n, max_size());
152 return reinterpret_cast<T*>(arena_stack_->Alloc(n * sizeof(T),
155 void deallocate(pointer p, size_type n) { in deallocate() argument
157 UNUSED(n); in deallocate()
Dallocator.h133 pointer allocate(size_type n, const_pointer hint = 0) {
135 const size_t size = n * sizeof(T);
141 void deallocate(PT p, size_type n) { in deallocate() argument
142 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()
Dhash_set.h507 static size_t WriteToBytes(uint8_t* ptr, size_t offset, Elem n) { in WriteToBytes() argument
508 DCHECK_ALIGNED(ptr + offset, sizeof(n)); in WriteToBytes()
510 *reinterpret_cast<Elem*>(ptr + offset) = n; in WriteToBytes()
512 return offset + sizeof(n); in WriteToBytes()
/art/test/440-stmp/src/
DMain.java24 baz(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o); in bar()
28 float h, float i, float j, float k, float l, float m, float n, float o) { in baz() argument
29 System.out.println(a - b - c - d - e - f - g - h - i - j - k - l - m - n - o); in baz()
45 float n = 14.0f; field in Main
/art/test/444-checker-nce/src/
DMain.java148 Main n = new Main(); in phiFlowRemoveTest() local
151 n = m; in phiFlowRemoveTest()
154 return n.g(); in phiFlowRemoveTest()
172 Main n = new Main(); in phiFlowKeepTest() local
175 n = m; in phiFlowKeepTest()
178 return n.g(); in phiFlowKeepTest()
/art/test/450-checker-types/src/
DMain.java241 public void testInstanceOfInFor(int n) { in testInstanceOfInFor() argument
243 for (int i = 0; i < n; i++) { in testInstanceOfInFor()
306 public void testInstanceOfSubclassInFor(int n) { in testInstanceOfSubclassInFor() argument
308 for (int i = 0; i < n; i++) { in testInstanceOfSubclassInFor()
323 public void testInstanceOfTopInFor(int n) { in testInstanceOfTopInFor() argument
325 for (int i = 0; i < n; i++) { in testInstanceOfTopInFor()
/art/test/090-loop-formation/src/
DMain.java68 for (int n = 0; n < 2; n++) { in deeplyNested()
/art/test/137-cfi/
Dcfi.cc154 pid_t n = TEMP_FAILURE_RETRY(waitpid(tid, &status, __WALL | WNOHANG)); in wait_for_sigstop() local
155 if (n == -1) { in wait_for_sigstop()
158 } else if (n == tid) { in wait_for_sigstop()
162 PLOG(ERROR) << "unexpected waitpid response: n=" << n << ", status=" << std::hex << status; in wait_for_sigstop()
/art/runtime/gc/accounting/
Datomic_stack.h150 void PopBackCount(int32_t n) { in PopBackCount() argument
151 DCHECK_GE(Size(), static_cast<size_t>(n)); in PopBackCount()
152 back_index_.FetchAndSubSequentiallyConsistent(n); in PopBackCount()
/art/test/099-vmdebug/src/
DMain.java119 long n = Long.valueOf(s); in checkNumber() local
120 if (n < 0) { in checkNumber()
121 System.out.println("Got negative number " + n); in checkNumber()

12