| /src/sys/dev/raidframe/ |
| rf_alloclist.h | 43 void *pointers[RF_POINTERS_PER_ALLOC_LIST_ELEMENT]; member in struct:RF_AllocListElem_s
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| sort.c | 44 /* POINTERS and WORK are both arrays of N pointers. When this
45 function returns POINTERS will be sorted in ascending order. */
47 void sort_pointers (size_t n, void **pointers, void **work)
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp
150 void **pointers; local
[all...] |
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| sort.c | 44 /* POINTERS and WORK are both arrays of N pointers. When this
45 function returns POINTERS will be sorted in ascending order. */
47 void sort_pointers (size_t n, void **pointers, void **work)
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp
150 void **pointers; local
[all...] |
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| sort.c | 44 /* POINTERS and WORK are both arrays of N pointers. When this
45 function returns POINTERS will be sorted in ascending order. */
47 void sort_pointers (size_t n, void **pointers, void **work)
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp
150 void **pointers; local
[all...] |
| /src/external/gpl3/gcc/dist/libiberty/ |
| sort.c | 44 /* POINTERS and WORK are both arrays of N pointers. When this
45 function returns POINTERS will be sorted in ascending order. */
47 void sort_pointers (size_t n, void **pointers, void **work)
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp
150 void **pointers; local
[all...] |
| /src/external/gpl3/gdb/dist/libiberty/ |
| sort.c | 44 /* POINTERS and WORK are both arrays of N pointers. When this
45 function returns POINTERS will be sorted in ascending order. */
47 void sort_pointers (size_t n, void **pointers, void **work)
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp
150 void **pointers; local
[all...] |
| /src/external/gpl3/gdb.old/dist/libiberty/ |
| sort.c | 44 /* POINTERS and WORK are both arrays of N pointers. When this
45 function returns POINTERS will be sorted in ascending order. */
47 void sort_pointers (size_t n, void **pointers, void **work)
105 bias = ((digit_t *) pointers) + j;
106 top = ((digit_t *) (pointers + n)) + j;
109 loop, COUNT[K] will contain the number of pointers whose Ith
116 /* Now, make COUNT[K] contain the number of pointers whose Ith
121 /* Now, drop the pointers into their correct locations. */
122 for (pointerp = pointers + n - 1; pointerp >= pointers; --pointerp
150 void **pointers; local
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/ |
| asan_mac_test.cc | 141 void *pointers[kNumPointers]; local
143 pointers[i] = malloc(i + 1);
146 free(pointers[i]);
|
| asan_interface_test.cc | 43 // and from the interior pointers (not returned by previous malloc).
396 std::vector<char *> pointers; local
401 pointers.push_back((char*)malloc(size));
405 EXPECT_FALSE(__sanitizer_get_ownership(&pointers));
408 EXPECT_TRUE(__sanitizer_get_ownership(pointers[idx]));
409 EXPECT_EQ(sizes[idx], __sanitizer_get_allocated_size(pointers[idx]));
411 for (size_t i = 0, n = pointers.size(); i < n; i++)
412 free(pointers[i]);
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.fortran/ |
| pointers.f90 | 16 program pointers program
109 end program pointers
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.fortran/ |
| pointers.f90 | 16 program pointers program
109 end program pointers
|
| /src/external/gpl3/gdb/dist/sim/mcore/ |
| interp.c | 1443 unsigned long pointers; local
1473 /* Claim some memory for the pointers and strings. */
1474 pointers = hi_stack - sizeof(int32_t) * (nenv+1+nargs+1);
1475 pointers &= ~3; /* must be 4-byte aligned */
1476 gr[0] = pointers;
1493 gr[PARM2] = pointers;
1498 wlat (pointers, strings);
1504 /* Bump the pointers. */
1506 pointers += 4;
1511 wlat (pointers, 0)
[all...] |
| /src/external/gpl3/gdb.old/dist/sim/mcore/ |
| interp.c | 1443 unsigned long pointers; local
1473 /* Claim some memory for the pointers and strings. */
1474 pointers = hi_stack - sizeof(int32_t) * (nenv+1+nargs+1);
1475 pointers &= ~3; /* must be 4-byte aligned */
1476 gr[0] = pointers;
1493 gr[PARM2] = pointers;
1498 wlat (pointers, strings);
1504 /* Bump the pointers. */
1506 pointers += 4;
1511 wlat (pointers, 0)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-ssa-warn-access.cc | 602 pointers reset BOUND to trigger the appropriate warning. */
2118 /* Check for uses of indeterminate pointers. */
2138 /* A pointer_query object to store information about pointers and
2148 /* True to run checks for uses of dangling pointers. */
3365 objects (null pointers are diagnosed in this case only
3467 /* Warn about null pointers with positive sizes. This is
3469 attribute nonnull when the function accepts null pointers
3494 /* Warn about null pointers for [static N] array arguments
3814 /* Proceed only when looking for uses of dangling pointers. */
4159 auto_vec<tree> pointers; local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-ssa-warn-access.cc | 604 pointers reset BOUND to trigger the appropriate warning. */
2144 /* Check for uses of indeterminate pointers. */
2164 /* A pointer_query object to store information about pointers and
2174 /* True to run checks for uses of dangling pointers. */
3393 objects (null pointers are diagnosed in this case only
3505 /* Warn about null pointers with positive sizes. This is
3507 attribute nonnull when the function accepts null pointers
3832 /* Proceed only when looking for uses of dangling pointers. */
4174 auto_vec<tree, 8> pointers; local
4175 pointers.quick_push (ptr)
[all...] |
