HomeSort by relevance Sort by last modified time
    Searched refs:ptrs (Results 1 - 25 of 55) sorted by null

1 2 3

  /external/clang/test/CodeGen/
2002-07-31-SubregFailure.c 6 } ptrs; typedef in typeref:union:__anon23139
9 ptrs abase;
debug-info.c 31 void *ptrs[]; member in struct:foo
  /external/libcxxabi/test/
test_fallback_malloc.cpp 22 container ptrs; local
26 ptrs.push_back ( p );
27 return ptrs;
31 container ptrs; local
35 ptrs.push_back ( p );
39 return ptrs;
43 container ptrs; local
50 ptrs.push_back ( p );
53 return ptrs;
70 container ptrs; local
101 container ptrs; local
135 container ptrs; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/
test_fallback_malloc.cpp 22 container ptrs; local
26 ptrs.push_back ( p );
27 return ptrs;
31 container ptrs; local
35 ptrs.push_back ( p );
39 return ptrs;
43 container ptrs; local
50 ptrs.push_back ( p );
53 return ptrs;
70 container ptrs; local
101 container ptrs; local
135 container ptrs; local
    [all...]
  /external/valgrind/main/memcheck/tests/
pointer-trace.c 19 char **volatile ptrs; local
24 /* I _think_ the point of this is to fill ptrs with a pointer
48 ptrs = malloc(nptrs * sizeof(char *));
50 ptrs[i] = (char *)((long)i << stepbits);
82 free(ptrs);
86 ptrs = malloc(1000);
  /external/chromium_org/third_party/tcmalloc/vendor/src/
pagemap.h 220 Node* ptrs[INTERIOR_LENGTH]; member in struct:TCMalloc_PageMap3::Node
252 root_->ptrs[i1] == NULL || root_->ptrs[i1]->ptrs[i2] == NULL) {
255 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
263 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
276 if (root_->ptrs[i1] == NULL) {
279 root_->ptrs[i1] = n
    [all...]
  /external/chromium_org/third_party/tcmalloc/chromium/src/
pagemap.h 423 Node* ptrs[INTERIOR_LENGTH]; member in struct:TCMalloc_PageMap3::Node
455 root_->ptrs[i1] == NULL || root_->ptrs[i1]->ptrs[i2] == NULL) {
458 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
466 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
479 if (root_->ptrs[i1] == NULL) {
482 root_->ptrs[i1] = n
    [all...]
  /art/runtime/gc/space/
zygote_space.h 55 size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) OVERRIDE;
87 static void SweepCallback(size_t num_ptrs, mirror::Object** ptrs, void* arg);
zygote_space.cc 94 size_t ZygoteSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
104 void ZygoteSpace::SweepCallback(size_t num_ptrs, mirror::Object** ptrs, void* arg) {
115 bitmap->Clear(ptrs[i]);
121 card_table->MarkCard(ptrs[i]);
dlmalloc_space.cc 173 size_t DlMallocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
174 DCHECK(ptrs != NULL);
179 mirror::Object* ptr = ptrs[i];
183 __builtin_prefetch(reinterpret_cast<char*>(ptrs[i + look_ahead]) - sizeof(size_t));
191 RegisterRecentFree(ptrs[i]);
198 if (!Contains(ptrs[i])) {
200 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
202 size_t size = mspace_usable_size(ptrs[i]);
203 memset(ptrs[i], 0xEF, size);
211 mspace_bulk_free(mspace_, reinterpret_cast<void**>(ptrs), num_ptrs)
    [all...]
rosalloc_space.cc 186 size_t RosAllocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
187 DCHECK(ptrs != nullptr);
192 __builtin_prefetch(reinterpret_cast<char*>(ptrs[i + kPrefetchLookAhead]));
195 verify_bytes += AllocationSizeNonvirtual(ptrs[i], nullptr);
202 RegisterRecentFree(ptrs[i]);
209 if (!Contains(ptrs[i])) {
211 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
213 size_t size = rosalloc_->UsableSize(ptrs[i]);
214 memset(ptrs[i], 0xEF, size);
220 const size_t bytes_freed = rosalloc_->BulkFree(self, reinterpret_cast<void**>(ptrs), num_ptrs)
    [all...]
valgrind_malloc_space-inl.h 85 size_t ValgrindMallocSpace<S, A>::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
88 freed += Free(self, ptrs[i]);
89 ptrs[i] = nullptr;
valgrind_malloc_space.h 43 size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) OVERRIDE
malloc_space.h 67 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs)
189 static void SweepCallback(size_t num_ptrs, mirror::Object** ptrs, void* arg)
large_object_space.cc 164 size_t LargeObjectSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
168 CHECK(Contains(ptrs[i]));
170 total += Free(self, ptrs[i]);
491 void LargeObjectSpace::SweepCallback(size_t num_ptrs, mirror::Object** ptrs, void* arg) {
501 bitmap->Clear(ptrs[i]);
505 context->freed.bytes += space->FreeList(self, num_ptrs, ptrs);
  /external/icu/icu4c/source/test/intltest/
tufmtts.cpp 143 MeasureUnit **ptrs = new MeasureUnit *[TimeUnit::UTIMEUNIT_FIELD_COUNT]; local
145 ptrs[TimeUnit::UTIMEUNIT_YEAR] = MeasureUnit::createYear(status);
146 ptrs[TimeUnit::UTIMEUNIT_MONTH] = MeasureUnit::createMonth(status);
147 ptrs[TimeUnit::UTIMEUNIT_DAY] = MeasureUnit::createDay(status);
148 ptrs[TimeUnit::UTIMEUNIT_WEEK] = MeasureUnit::createWeek(status);
149 ptrs[TimeUnit::UTIMEUNIT_HOUR] = MeasureUnit::createHour(status);
150 ptrs[TimeUnit::UTIMEUNIT_MINUTE] = MeasureUnit::createMinute(status);
151 ptrs[TimeUnit::UTIMEUNIT_SECOND] = MeasureUnit::createSecond(status);
163 MeasureUnit(*ptr) == *ptrs[j]);
170 delete ptrs[i]
    [all...]
  /cts/suite/audio_quality/lib/include/task/
TaskProcess.h 51 UniquePtr<void_ptr, DefaultDelete<void_ptr[]> > & ptrs,
  /external/chromium_org/third_party/skia/src/core/
SkDataTable.cpp 88 SkDataTable* SkDataTable::NewCopyArrays(const void * const * ptrs,
107 memcpy(elem, ptrs[i], sizes[i]);
  /external/skia/src/core/
SkDataTable.cpp 88 SkDataTable* SkDataTable::NewCopyArrays(const void * const * ptrs,
107 memcpy(elem, ptrs[i], sizes[i]);
  /external/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/
onyxd_int.h 46 const unsigned char *ptrs[MAX_PARTITIONS]; member in struct:__anon17704
  /external/chromium_org/third_party/skia/include/core/
SkDataTable.h 74 * @param ptrs array of points to each element to be copied into the table.
76 * ptrs[] array.
77 * @param count the number of array elements in ptrs[] and sizes[] to copy.
79 static SkDataTable* NewCopyArrays(const void * const * ptrs,
  /external/libvpx/libvpx/vp8/decoder/
onyxd_int.h 46 const unsigned char *ptrs[MAX_PARTITIONS]; member in struct:__anon29481
  /external/skia/include/core/
SkDataTable.h 74 * @param ptrs array of points to each element to be copied into the table.
76 * ptrs[] array.
77 * @param count the number of array elements in ptrs[] and sizes[] to copy.
79 static SkDataTable* NewCopyArrays(const void * const * ptrs,
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/decoder/
onyxd_int.h 46 const unsigned char *ptrs[MAX_PARTITIONS]; member in struct:__anon40664
  /cts/suite/audio_quality/lib/src/task/
TaskProcess.cpp 55 UniquePtr<void_ptr, DefaultDelete<void_ptr[]> > & ptrs,
63 ptrs.reset(new void_ptr[N]);
64 if (ptrs.get() == NULL) {
69 bzero(ptrs.get(), N * sizeof(void_ptr));
81 void_ptr* voidPtrs = ptrs.get();

Completed in 707 milliseconds

1 2 3