HomeSort by: relevance | last modified time | path
    Searched defs:n_alloc (Results 1 - 9 of 9) sorted by relevancy

  /src/external/lgpl3/mpfr/dist/src/
pool.c 34 static MPFR_THREAD_ATTR int n_alloc = 0; variable
40 if (MPFR_LIKELY (n_alloc > 0))
45 MPFR_ASSERTD (n_alloc <= numberof (mpz_tab));
46 memcpy (z, &mpz_tab[--n_alloc], sizeof (mpz_t));
67 if (MPFR_LIKELY (n_alloc > 0 && n <= MPFR_POOL_MAX_SIZE * GMP_NUMB_BITS))
72 MPFR_ASSERTD (n_alloc <= numberof (mpz_tab));
73 memcpy (z, &mpz_tab[--n_alloc], sizeof (mpz_t));
90 if (MPFR_LIKELY (n_alloc < numberof (mpz_tab) &&
94 MPFR_ASSERTD (n_alloc >= 0);
95 memcpy (&mpz_tab[n_alloc++], z, sizeof (mpz_t))
    [all...]
  /src/external/bsd/libfido2/dist/src/fido/
credman.h 63 size_t n_alloc; /* number of allocated entries */ member in struct:fido_credman_rp
69 size_t n_alloc; /* number of allocated entries */ member in struct:fido_credman_rk
bio.h 58 size_t n_alloc; /* number of allocated entries */ member in struct:fido_bio_template_array
  /src/lib/librefuse/refuse/
chan.c 60 size_t n_alloc; member in struct:refuse_chan_storage
116 for (idx = 0; idx < (int)storage.n_alloc; idx++) {
124 storage.n_alloc = (storage.n_alloc + 8) * 2;
125 storage.vec = realloc(storage.vec, sizeof(struct fuse_chan*) * storage.n_alloc);
133 memset(&storage.vec[idx+1], 0, sizeof(struct fuse_chan*) * (storage.n_alloc - (size_t)idx - 1));
153 if (idx >= 0 && idx < (int)storage.n_alloc) {
175 if (idx >= 0 && idx < (int)storage.n_alloc) {
201 for (idx = 0; idx < (int)storage.n_alloc; idx++) {
  /src/external/bsd/flex/dist/src/
buf.c 236 int n_alloc = 0;
245 n_alloc = n_elem + buf->nelts;
248 if ((((size_t) n_alloc * buf->elt_size) % 512) != 0
250 n_alloc += (int)
252 (((size_t) n_alloc * buf->elt_size) % 512)) /
257 allocate_array ((int) n_alloc, buf->elt_size);
260 reallocate_array (buf->elts, (int) n_alloc,
263 buf->nmax = n_alloc;
235 int n_alloc = 0; local
  /src/external/bsd/jemalloc.old/dist/test/unit/
san.c 31 unsigned n_alloc = 0; local
32 while (n_alloc < MAX_SMALL_ALLOCATIONS) {
35 small_alloc[n_alloc] = ptr;
45 n_alloc++;
65 for (unsigned i = 0; i < n_alloc + 1; i++) {
uaf.c 194 check_allocated_intact(void **allocated, size_t n_alloc) {
195 for (unsigned i = 0; i < n_alloc; i++) {
198 for (unsigned j = 0; j < n_alloc; j++) {
218 size_t n_alloc = san_uaf_align * 2; local
219 void **allocated = mallocx(n_alloc * sizeof(void *), flags);
222 for (unsigned i = 0; i < n_alloc; i++) {
230 *(void **)allocated[0] = allocated[n_alloc - 1];
231 expect_true(check_allocated_intact(allocated, n_alloc),
234 for (unsigned i = 0; i < n_alloc; i++) {
238 expect_false(check_allocated_intact(allocated, n_alloc),
    [all...]
  /src/external/bsd/jemalloc/dist/test/unit/
san.c 31 unsigned n_alloc = 0; local
32 while (n_alloc < MAX_SMALL_ALLOCATIONS) {
35 small_alloc[n_alloc] = ptr;
45 n_alloc++;
66 for (unsigned i = 0; i < n_alloc + 1; i++) {
uaf.c 197 check_allocated_intact(void **allocated, size_t n_alloc) {
198 for (unsigned i = 0; i < n_alloc; i++) {
201 for (unsigned j = 0; j < n_alloc; j++) {
221 size_t n_alloc = san_uaf_align * 2; local
222 void **allocated = mallocx(n_alloc * sizeof(void *), flags);
225 for (unsigned i = 0; i < n_alloc; i++) {
233 *(void **)allocated[0] = allocated[n_alloc - 1];
234 expect_true(check_allocated_intact(allocated, n_alloc),
237 for (unsigned i = 0; i < n_alloc; i++) {
241 expect_false(check_allocated_intact(allocated, n_alloc),
    [all...]

Completed in 22 milliseconds