Searched refs:ptrs (Results 1 - 25 of 31) sorted by relevance

12

/external/clang/test/CodeGen/
H A D2002-07-31-SubregFailure.c6 } ptrs; typedef in typeref:union:__anon18521
9 ptrs abase;
H A Ddebug-info.c31 void *ptrs[]; member in struct:foo
/external/libcxxabi/test/
H A Dtest_fallback_malloc.cpp22 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/
H A Dpointer-trace.c19 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/
H A Dpagemap.h220 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[i
[all...]
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dpagemap.h423 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[i
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dtufmtts.cpp143 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[
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkDataTable.cpp88 SkDataTable* SkDataTable::NewCopyArrays(const void * const * ptrs, argument
107 memcpy(elem, ptrs[i], sizes[i]);
/external/skia/src/core/
H A DSkDataTable.cpp88 SkDataTable* SkDataTable::NewCopyArrays(const void * const * ptrs, argument
107 memcpy(elem, ptrs[i], sizes[i]);
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/
H A Donyxd_int.h46 const unsigned char *ptrs[MAX_PARTITIONS]; member in struct:__anon13079
H A Ddecodeframe.c829 const unsigned char *first_fragment_end = pbi->fragments.ptrs[0] +
843 const unsigned char *fragment_end = pbi->fragments.ptrs[fragment_idx] +
851 pbi->fragments.ptrs[0] + 3 * (num_token_partitions - 1);
859 pbi->fragments.ptrs[fragment_idx] = pbi->fragments.ptrs[0] +
869 pbi->fragments.ptrs[fragment_idx],
882 pbi->fragments.ptrs[fragment_idx] =
883 pbi->fragments.ptrs[fragment_idx - 1] + partition_size;
893 pbi->fragments.ptrs[partition_idx],
985 const unsigned char *data = pbi->fragments.ptrs[
[all...]
/external/chromium_org/third_party/skia/include/core/
H A DSkDataTable.h74 * @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/
H A Donyxd_int.h46 const unsigned char *ptrs[MAX_PARTITIONS]; member in struct:__anon24870
H A Ddecodeframe.c820 const unsigned char *first_fragment_end = pbi->fragments.ptrs[0] +
834 const unsigned char *fragment_end = pbi->fragments.ptrs[fragment_idx] +
842 pbi->fragments.ptrs[0] + 3 * (num_token_partitions - 1);
850 pbi->fragments.ptrs[fragment_idx] = pbi->fragments.ptrs[0] +
860 pbi->fragments.ptrs[fragment_idx],
873 pbi->fragments.ptrs[fragment_idx] =
874 pbi->fragments.ptrs[fragment_idx - 1] + partition_size;
884 pbi->fragments.ptrs[partition_idx],
976 const unsigned char *data = pbi->fragments.ptrs[
[all...]
/external/skia/include/core/
H A DSkDataTable.h74 * @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/chromium_org/third_party/libvpx/source/libvpx/vp8/
H A Dvp8_dx_iface.c294 vpx_memset((void*)ctx->fragments.ptrs, 0, sizeof(ctx->fragments.ptrs));
302 ctx->fragments.ptrs[ctx->fragments.count] = data;
316 ctx->fragments.ptrs[0] = data;
353 res = vp8_peek_si_internal(ctx->fragments.ptrs[0], ctx->fragments.sizes[0],
/external/lldb/examples/darwin/heap_find/heap/
H A Dheap_find.cpp671 ranges_callback (task_t task, void *baton, unsigned type, vm_range_t *ptrs, unsigned count) argument
675 info->range_callback (task, info->baton, type, ptrs->address, ptrs->size);
676 ptrs++;
/external/libvpx/libvpx/vp8/
H A Dvp8_dx_iface.c324 vpx_memset((void*)ctx->fragments.ptrs, 0, sizeof(ctx->fragments.ptrs));
332 ctx->fragments.ptrs[ctx->fragments.count] = data;
346 ctx->fragments.ptrs[0] = data;
376 res = vp8_peek_si_internal(ctx->fragments.ptrs[0], ctx->fragments.sizes[0],
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/
H A Dheap-checker_unittest.cc788 typename Alloc::pointer ptrs[kSize]; local
795 ptrs[i] = p;
798 allocator.deallocate(ptrs[i], i*3+1);
799 ptrs[i] = NULL;
H A Dtcmalloc_unittest.cc755 void* ptrs[kNum]; local
757 ptrs[i] = malloc(size);
758 uintptr_t p = reinterpret_cast<uintptr_t>(ptrs[i]);
768 free(ptrs[i]);
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/
H A Dheap-checker_unittest.cc788 typename Alloc::pointer ptrs[kSize]; local
795 ptrs[i] = p;
798 allocator.deallocate(ptrs[i], i*3+1);
799 ptrs[i] = NULL;
H A Dtcmalloc_unittest.cc755 void* ptrs[kNum]; local
757 ptrs[i] = malloc(size);
758 uintptr_t p = reinterpret_cast<uintptr_t>(ptrs[i]);
768 free(ptrs[i]);
/external/javassist/src/main/javassist/bytecode/
H A DCodeIterator.java1111 boolean exclusive, ArrayList jumps, Pointers ptrs)
1116 ptrs.shiftPc(where, gapLength, exclusive);
1131 ptrs.shiftPc(p, delta, false);
1144 ptrs.shiftPc(p, diff, false);
1110 insertGap2w(byte[] code, int where, int gapLength, boolean exclusive, ArrayList jumps, Pointers ptrs) argument
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_allocator_test.cc619 char *ptrs[kCount]; local
625 ptrs[i] = p;
628 InternalFree(ptrs[i]);
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/x86/
H A Drecon_sse2.asm382 ; set up left ptrs ans subtract topleft
394 ; set up dest ptrs
936 ; set up left ptrs ans subtract topleft
949 ; set up dest ptrs

Completed in 988 milliseconds

12