| /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/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/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/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/sys/dev/raidframe/ |
| rf_alloclist.h | 43 void *pointers[RF_POINTERS_PER_ALLOC_LIST_ELEMENT]; member in struct:RF_AllocListElem_s
|
| rf_alloclist.c | 34 * such structure contains a fixed-size array of pointers. Calling
97 l->pointers[l->numPointers] = p;
113 RF_ASSERT(p->pointers[i]);
114 RF_Free(p->pointers[i], p->sizes[i]);
|
| /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/bsd/ntp/dist/sntp/libopts/ |
| tokenize.c | 127 * high and we'll squander the space for a few extra pointers.
180 * An array of @code{tkn_ct + 1} pointers to substring tokens, with
|
| /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/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/sys/arch/sparc64/doc/ |
| TODO | 8 - change run-time checks for cpu type to function pointers
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_malloc_mac.inc | 288 // Should enumerate all the pointers we have. Seems like a lot of work.
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc64/p7/ |
| copyi.asm | 48 C * Consider using 4 pointers, schedule ptr update early wrt use.
|
| /src/external/lgpl3/gmp/dist/mpn/x86/ |
| cnd_aors_n.asm | 90 C put operand pointers just beyond their last limb
|
| aors_n.asm | 89 shll $2,%eax C adjustment for pointers...
138 shll $2,%eax C adjustment for pointers...
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/ |
| sqr_diag_addlsh1.asm | 53 C When playing with pointers, set this to $2 to fall back to conservative
|
| /src/external/lgpl3/gmp/dist/mpn/x86/fat/ |
| fat_entry.asm | 116 dnl functions are the initial values for the pointers in __gmpn_cpuvec.
124 dnl that all the __gmpn_cpuvec pointers go to real routines. So there's no
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/fat/ |
| fat_entry.asm | 122 dnl functions are the initial values for the pointers in __gmpn_cpuvec.
130 dnl that all the __gmpn_cpuvec pointers go to real routines. So there's no
|
| /src/sys/arch/sun3/sun3/ |
| locore.s | 125 addl #NBSG,%a0 | increment pointers
|
| /src/doc/ |
| TODO.compat-module | 41 pointers, preventing them from being unloaded (via modunload) while
|
| /src/external/lgpl3/gmp/dist/mpn/s390_32/esame/ |
| sqr_basecase.asm | 44 C * Update counters and pointers more straightforwardly, possibly lowering
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/coreisbr/ |
| mul_2.asm | 59 C When playing with pointers, set this to $2 to fall back to conservative
|
