HomeSort by: relevance | last modified time | path
    Searched refs:allocs (Results 1 - 25 of 26) sorted by relevancy

1 2

  /src/external/bsd/jemalloc/dist/test/stress/
fill_flush.c 12 void *volatile allocs[NALLOCS]; variable
19 allocs[i] = p;
22 sdallocx(allocs[i], SMALL_ALLOC_SIZE, 0);
31 allocs[i] = p;
32 sdallocx(allocs[i], SMALL_ALLOC_SIZE, 0);
48 allocs[i] = p;
51 sdallocx(allocs[i], LARGE_ALLOC_SIZE, 0);
60 allocs[i] = p;
61 sdallocx(allocs[i], LARGE_ALLOC_SIZE, 0);
  /src/external/bsd/jemalloc.old/dist/test/stress/
fill_flush.c 12 void *volatile allocs[NALLOCS]; variable
19 allocs[i] = p;
22 sdallocx(allocs[i], SMALL_ALLOC_SIZE, 0);
31 allocs[i] = p;
32 sdallocx(allocs[i], SMALL_ALLOC_SIZE, 0);
48 allocs[i] = p;
51 sdallocx(allocs[i], LARGE_ALLOC_SIZE, 0);
60 allocs[i] = p;
61 sdallocx(allocs[i], LARGE_ALLOC_SIZE, 0);
  /src/external/gpl3/gcc/dist/libbacktrace/
allocfail.sh 41 allocs=$(./allocfail 2>&1)
42 if [ "$allocs" = "" ]; then
50 # allocs: 80495
64 echo "allocs: $allocs"
70 while [ $i -le $allocs ]; do
80 # The test-case would run too long if we would excercise all allocs.
  /src/external/gpl3/gcc.old/dist/libbacktrace/
allocfail.sh 41 allocs=$(./allocfail 2>&1)
42 if [ "$allocs" = "" ]; then
50 # allocs: 80495
64 echo "allocs: $allocs"
70 while [ $i -le $allocs ]; do
80 # The test-case would run too long if we would excercise all allocs.
  /src/external/gpl3/gdb/dist/libbacktrace/
allocfail.sh 41 allocs=$(./allocfail 2>&1)
42 if [ "$allocs" = "" ]; then
50 # allocs: 80495
64 echo "allocs: $allocs"
70 while [ $i -le $allocs ]; do
80 # The test-case would run too long if we would excercise all allocs.
  /src/external/gpl3/gdb.old/dist/libbacktrace/
allocfail.sh 41 allocs=$(./allocfail 2>&1)
42 if [ "$allocs" = "" ]; then
50 # allocs: 80495
64 echo "allocs: $allocs"
70 while [ $i -le $allocs ]; do
80 # The test-case would run too long if we would excercise all allocs.
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/scripts/
unbalanced_allocs.py 38 def ProcessFree(line, f, allocs):
44 if addr in allocs:
45 del allocs[addr]
50 def ProcessMalloc(line, f, allocs):
52 return ProcessFree(line, f, allocs)
55 assert not addr in allocs
58 allocs[addr] = (line, stack)
65 allocs = {}
72 for _, (l, s) in allocs.items():
76 line = ProcessMalloc(line, f, allocs)
    [all...]
  /src/external/bsd/jemalloc/dist/test/unit/
edata_cache.c 105 edata_t *allocs[EDATA_CACHE_FAST_FILL * 2]; local
113 allocs[i] = edata_cache_get(TSDN_NULL, &ec);
116 edata_cache_put(TSDN_NULL, &ec, allocs[i]);
121 allocs[0] = edata_cache_fast_get(TSDN_NULL, &ecf);
126 allocs[i] = edata_cache_fast_get(TSDN_NULL, &ecf);
127 expect_ptr_not_null(allocs[i], "");
143 allocs[i] = edata_cache_get(TSDN_NULL, &ec);
144 expect_ptr_not_null(allocs[i], "");
147 edata_cache_put(TSDN_NULL, &ec, allocs[i]);
150 allocs[0] = edata_cache_fast_get(TSDN_NULL, &ecf)
    [all...]
sec.c 168 * 11 allocs apiece of 1-PAGE and 2-PAGE objects means that we should be
190 expect_zu_eq(0, ta.alloc_count, "Should be using batch allocs");
243 * 10-allocs apiece of 1-PAGE and 2-PAGE objects means that we should be
253 edata_t *allocs[NALLOCS]; local
258 allocs[i] = pai_alloc(tsdn, &sec.pai, PAGE, PAGE,
261 expect_ptr_not_null(allocs[i], "Unexpected alloc failure");
274 pai_dalloc(tsdn, &sec.pai, allocs[i], &deferred_work_generated);
310 edata_t *allocs[NALLOCS]; local
315 allocs[i] = pai_alloc(tsdn, &sec.pai, PAGE, PAGE,
318 expect_ptr_not_null(allocs[i], "Unexpected alloc failure")
499 edata_t *allocs[FLUSH_PAGES]; local
542 edata_t *allocs[2 * FLUSH_PAGES]; local
593 edata_t *allocs[FLUSH_PAGES]; local
    [all...]
hpa.c 260 edata_t *allocs[NALLOCS]; local
266 allocs[i] = pai_alloc(tsdn, &shard->pai, PAGE, PAGE,
269 expect_ptr_not_null(allocs[i], "Unexpected alloc failure");
277 allocs[i] = edata_list_active_first(&allocs_list);
278 edata_list_active_remove(&allocs_list, allocs[i]);
285 void *orig_base = edata_base_get(allocs[0]);
286 expect_contiguous(allocs, NALLOCS);
292 edata_list_active_append(&allocs_list, allocs[i]);
297 pai_dalloc(tsdn, &shard->pai, allocs[i],
303 allocs[i] = pai_alloc(tsdn, &shard->pai, PAGE, PAGE
    [all...]
  /src/external/bsd/jemalloc.old/dist/test/unit/
edata_cache.c 105 edata_t *allocs[EDATA_CACHE_FAST_FILL * 2]; local
113 allocs[i] = edata_cache_get(TSDN_NULL, &ec);
116 edata_cache_put(TSDN_NULL, &ec, allocs[i]);
121 allocs[0] = edata_cache_fast_get(TSDN_NULL, &ecf);
126 allocs[i] = edata_cache_fast_get(TSDN_NULL, &ecf);
127 expect_ptr_not_null(allocs[i], "");
143 allocs[i] = edata_cache_get(TSDN_NULL, &ec);
144 expect_ptr_not_null(allocs[i], "");
147 edata_cache_put(TSDN_NULL, &ec, allocs[i]);
150 allocs[0] = edata_cache_fast_get(TSDN_NULL, &ecf)
    [all...]
sec.c 168 * 11 allocs apiece of 1-PAGE and 2-PAGE objects means that we should be
190 expect_zu_eq(0, ta.alloc_count, "Should be using batch allocs");
243 * 10-allocs apiece of 1-PAGE and 2-PAGE objects means that we should be
253 edata_t *allocs[NALLOCS]; local
258 allocs[i] = pai_alloc(tsdn, &sec.pai, PAGE, PAGE,
261 expect_ptr_not_null(allocs[i], "Unexpected alloc failure");
274 pai_dalloc(tsdn, &sec.pai, allocs[i], &deferred_work_generated);
310 edata_t *allocs[NALLOCS]; local
315 allocs[i] = pai_alloc(tsdn, &sec.pai, PAGE, PAGE,
318 expect_ptr_not_null(allocs[i], "Unexpected alloc failure")
499 edata_t *allocs[FLUSH_PAGES]; local
542 edata_t *allocs[2 * FLUSH_PAGES]; local
593 edata_t *allocs[FLUSH_PAGES]; local
    [all...]
hpa.c 260 edata_t *allocs[NALLOCS]; local
266 allocs[i] = pai_alloc(tsdn, &shard->pai, PAGE, PAGE,
269 expect_ptr_not_null(allocs[i], "Unexpected alloc failure");
277 allocs[i] = edata_list_active_first(&allocs_list);
278 edata_list_active_remove(&allocs_list, allocs[i]);
285 void *orig_base = edata_base_get(allocs[0]);
286 expect_contiguous(allocs, NALLOCS);
292 edata_list_active_append(&allocs_list, allocs[i]);
297 pai_dalloc(tsdn, &shard->pai, allocs[i],
303 allocs[i] = pai_alloc(tsdn, &shard->pai, PAGE, PAGE
    [all...]
  /src/crypto/external/cpl/trousers/dist/src/tspi/daa/big_integer/
bi_openssl.c 116 allocs = list_new();
117 if( allocs == NULL) {
158 list_ptr list = allocs;
169 list_freeall( allocs);
170 allocs = list_new();
171 if( allocs == NULL) {
bi_gmp.c 180 allocs = list_new();
181 if( allocs == NULL) {
237 list_ptr list = allocs;
248 list_freeall( allocs);
249 allocs = list_new();
250 if( allocs == NULL) {
bi.c 38 list_ptr allocs = NULL; variable
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/experimental/allocator/building_blocks/
free_tree.d 365 void[][] allocs;
367 allocs ~= a.allocate(s);
368 foreach_reverse (b; allocs)
374 allocs = null;
376 allocs ~= a.allocate(s);
  /src/crypto/external/cpl/trousers/dist/src/include/daa/
bi_gmp.h 65 list_add( allocs, ret);
74 list_add( allocs, ret);
bi_openssl.h 176 list_add( allocs, result);
186 list_add( allocs, result);
bi.h 29 extern list_ptr allocs;
  /src/crypto/external/cpl/trousers/dist/src/tspi/daa/daa_issuer/
prime_gen.c 59 if (allocs == NULL) {
  /src/external/gpl3/gcc/dist/gcc/analyzer/
sm-malloc.cc 1790 for (tree allocs = attrs;
1791 (allocs = lookup_attribute ("malloc", allocs));
1792 allocs = TREE_CHAIN (allocs))
1794 tree args = TREE_VALUE (allocs);
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
sm-malloc.cc 1528 for (tree allocs = attrs;
1529 (allocs = lookup_attribute ("malloc", allocs));
1530 allocs = TREE_CHAIN (allocs))
1532 tree args = TREE_VALUE (allocs);
  /src/external/gpl3/gcc/dist/gcc/
gimple-ssa-warn-access.cc 1596 for (tree allocs = attrs;
1597 (allocs = lookup_attribute ("malloc", allocs));
1598 allocs = TREE_CHAIN (allocs))
1600 tree args = TREE_VALUE (allocs);
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-ssa-warn-access.cc 1583 for (tree allocs = attrs;
1584 (allocs = lookup_attribute ("malloc", allocs));
1585 allocs = TREE_CHAIN (allocs))
1587 tree args = TREE_VALUE (allocs);

Completed in 80 milliseconds

1 2