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

1 2

  /external/clang/test/CodeGen/
2002-07-31-SubregFailure.c 6 } ptrs; typedef in typeref:union:__anon18176
9 ptrs abase;
debug-info.c 31 void *ptrs[]; member in struct:foo
  /external/chromium_org/chrome_frame/
exception_barrier.cc 35 EXCEPTION_POINTERS ptrs = { exception_record, context }; local
39 WriteMinidumpForException(&ptrs);
51 EXCEPTION_POINTERS ptrs = { exception_record, context }; local
58 traits.WriteDump(&ptrs);
75 EXCEPTION_POINTERS ptrs = { exception_record, context }; local
76 handler(&ptrs);
exception_barrier.h 176 typedef void (CALLBACK* CustomExceptionHandler)(EXCEPTION_POINTERS* ptrs);
  /external/chromium_org/third_party/WebKit/Source/wtf/
TCPageMap.h 193 Node* ptrs[INTERIOR_LENGTH]; member in struct:TCMalloc_PageMap3::Node
225 return reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3];
233 reinterpret_cast<Leaf*>(root_->ptrs[i1]->ptrs[i2])->values[i3] = v;
242 if (root_->ptrs[i1] == NULL) {
245 root_->ptrs[i1] = n;
249 if (root_->ptrs[i1]->ptrs[i2] == NULL) {
253 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf)
    [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...]
  /external/kernel-headers/original/linux/
percpu.h 21 void *ptrs[NR_CPUS]; member in struct:percpu_data
32 (__typeof__(ptr))__p->ptrs[(cpu)]; \
  /art/runtime/gc/space/
dlmalloc_space.cc 96 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
99 freed += Free(self, ptrs[i]);
365 size_t DlMallocSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
366 DCHECK(ptrs != NULL);
371 mirror::Object* ptr = ptrs[i];
375 __builtin_prefetch(reinterpret_cast<char*>(ptrs[i + look_ahead]) - sizeof(size_t));
383 RegisterRecentFree(ptrs[i]);
390 if (!Contains(ptrs[i])) {
392 LOG(ERROR) << "FreeList[" << i << "] (" << ptrs[i] << ") not in bounds of heap " << *this;
394 size_t size = mspace_usable_size(ptrs[i])
    [all...]
large_object_space.cc 98 size_t LargeObjectSpace::FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) {
102 CHECK(Contains(ptrs[i]));
104 total += Free(self, ptrs[i]);
dlmalloc_space.h 62 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs);
space.h 169 virtual size_t FreeList(Thread* self, size_t num_ptrs, mirror::Object** ptrs) = 0;
  /cts/suite/audio_quality/lib/include/task/
TaskProcess.h 51 UniquePtr<void_ptr, DefaultDelete<void_ptr[]> > & ptrs,
  /dalvik/vm/alloc/
HeapBitmap.h 78 typedef void BitmapSweepCallback(size_t numPtrs, void **ptrs, void *arg);
HeapSource.h 119 * Frees the first numPtrs objects in the ptrs list and returns the
124 size_t dvmHeapSourceFreeList(size_t numPtrs, void **ptrs);
HeapSource.cpp 1065 * Frees the first numPtrs objects in the ptrs list and returns the
1070 size_t dvmHeapSourceFreeList(size_t numPtrs, void **ptrs)
1078 assert(ptrs != NULL);
1079 assert(*ptrs != NULL);
1080 Heap* heap = ptr2heap(gHs, *ptrs);
1091 assert(ptrs[i] != NULL);
1092 assert(ptr2heap(gHs, ptrs[i]) == heap);
1093 countFree(heap, ptrs[i], &numBytes);
1095 // Bulk free ptrs
    [all...]
  /external/libvpx/libvpx/vp8/decoder/
onyxd_int.h 42 const unsigned char *ptrs[MAX_PARTITIONS]; member in struct:__anon23024
decodframe.c 836 const unsigned char *first_fragment_end = pbi->fragments.ptrs[0] +
850 const unsigned char *fragment_end = pbi->fragments.ptrs[fragment_idx] +
858 pbi->fragments.ptrs[0] + 3 * (num_token_partitions - 1);
866 pbi->fragments.ptrs[fragment_idx] = pbi->fragments.ptrs[0] +
876 pbi->fragments.ptrs[fragment_idx],
889 pbi->fragments.ptrs[fragment_idx] =
890 pbi->fragments.ptrs[fragment_idx - 1] + partition_size;
900 pbi->fragments.ptrs[partition_idx],
    [all...]
  /external/chromium_org/third_party/skia/include/core/
SkDataTable.h 75 * @param ptrs array of points to each element to be copied into the table.
77 * ptrs[] array.
78 * @param count the number of array elements in ptrs[] and sizes[] to copy.
80 static SkDataTable* NewCopyArrays(const void * const * ptrs,
  /external/skia/include/core/
SkDataTable.h 75 * @param ptrs array of points to each element to be copied into the table.
77 * ptrs[] array.
78 * @param count the number of array elements in ptrs[] and sizes[] to copy.
80 static SkDataTable* NewCopyArrays(const void * const * ptrs,
  /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();
  /dalvik/vm/alloc/TEST/HeapBitmapTest/
main.c 317 xorCallback(size_t numPtrs, void **ptrs, const void *finger, void *arg)
320 assert(ptrs != NULL);
325 assert(ptrs[i] < finger);
327 (uintptr_t)ptrs[i], (uintptr_t)finger);
  /external/chromium_org/third_party/skia/src/core/
SkDataTable.cpp 150 SkDataTable* SkDataTable::NewCopyArrays(const void * const * ptrs,
169 memcpy(elem, ptrs[i], sizes[i]);
  /external/skia/src/core/
SkDataTable.cpp 150 SkDataTable* SkDataTable::NewCopyArrays(const void * const * ptrs,
169 memcpy(elem, ptrs[i], sizes[i]);

Completed in 779 milliseconds

1 2