| /src/common/lib/libc/arch/sh3/string/ |
| memset.S | 57 cmp/hs REG_TMP1,REG_LEN /* if (len >= 28) goto large; */
58 bt/s large
198 large: label
|
| memset.S | 57 cmp/hs REG_TMP1,REG_LEN /* if (len >= 28) goto large; */
58 bt/s large
198 large: label
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| arena_structs.h | 68 * Extant large allocations.
72 edata_list_active_t large; member in struct:arena_s
73 /* Synchronizes all large allocation/update/deallocation. */
|
| arena_structs.h | 68 * Extant large allocations.
72 edata_list_active_t large; member in struct:arena_s
73 /* Synchronizes all large allocation/update/deallocation. */
|
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| arena_structs.h | 68 * Extant large allocations.
72 edata_list_active_t large; member in struct:arena_s
73 /* Synchronizes all large allocation/update/deallocation. */
|
| arena_structs.h | 68 * Extant large allocations.
72 edata_list_active_t large; member in struct:arena_s
73 /* Synchronizes all large allocation/update/deallocation. */
|
| arena_structs_b.h | 119 * PRNG state for cache index randomization of large allocation base
148 * Extant large allocations.
152 extent_list_t large; member in struct:arena_s
153 /* Synchronizes all large allocation/update/deallocation. */
|
| /src/external/bsd/jemalloc/dist/test/unit/ |
| tcache_max.c | 144 size_t large; local
145 sz = sizeof(large);
146 assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large, &sz, NULL,
149 test_tcache_bytes_alloc(large - 1);
150 test_tcache_bytes_alloc(large);
151 test_tcache_bytes_alloc(large + 1);
|
| tcache_max.c | 144 size_t large; local
145 sz = sizeof(large);
146 assert_d_eq(mallctl("arenas.lextent.0.size", (void *)&large, &sz, NULL,
149 test_tcache_bytes_alloc(large - 1);
150 test_tcache_bytes_alloc(large);
151 test_tcache_bytes_alloc(large + 1);
|
| arena_decay.c | 53 * Test the standard APIs using a large size class, since we can't
116 * Test the *allocx() APIs using large and small size classes, with
171 * Test tcache fill/flush interactions for large and small size classes,
270 * Allocate a bunch of large objects, pause the clock, deallocate every
275 size_t large; local
277 expect_d_eq(mallctl("arenas.lextent.0.size", (void *)&large, &sz, NULL,
285 ps[i] = do_mallocx(large, flags);
|
| stats.c | 46 expect_d_eq(mallctl("stats.arenas.0.large.allocated",
50 expect_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
52 expect_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
54 expect_d_eq(mallctl("stats.arenas.0.large.nrequests",
62 "nmalloc should be at least as large as ndalloc");
72 void *little, *large; local
82 large = mallocx((1U << SC_LG_LARGE_MINCLASS),
84 expect_ptr_not_null(large, "Unexpected mallocx() failure");
87 dallocx(large, 0);
183 "nmalloc should be at least as large as ndalloc")
[all...] |
| arena_decay.c | 53 * Test the standard APIs using a large size class, since we can't
116 * Test the *allocx() APIs using large and small size classes, with
171 * Test tcache fill/flush interactions for large and small size classes,
270 * Allocate a bunch of large objects, pause the clock, deallocate every
275 size_t large; local
277 expect_d_eq(mallctl("arenas.lextent.0.size", (void *)&large, &sz, NULL,
285 ps[i] = do_mallocx(large, flags);
|
| stats.c | 46 expect_d_eq(mallctl("stats.arenas.0.large.allocated",
50 expect_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
52 expect_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
54 expect_d_eq(mallctl("stats.arenas.0.large.nrequests",
62 "nmalloc should be at least as large as ndalloc");
72 void *little, *large; local
82 large = mallocx((1U << SC_LG_LARGE_MINCLASS),
84 expect_ptr_not_null(large, "Unexpected mallocx() failure");
87 dallocx(large, 0);
183 "nmalloc should be at least as large as ndalloc")
[all...] |
| /src/external/bsd/jemalloc.old/dist/test/unit/ |
| stats.c | 43 assert_d_eq(mallctl("stats.arenas.0.large.allocated",
47 assert_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
49 assert_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
51 assert_d_eq(mallctl("stats.arenas.0.large.nrequests",
59 "nmalloc should be at least as large as ndalloc");
69 void *little, *large; local
79 large = mallocx((1U << LG_LARGE_MINCLASS), MALLOCX_ARENA(0));
80 assert_ptr_not_null(large, "Unexpected mallocx() failure");
83 dallocx(large, 0);
179 "nmalloc should be at least as large as ndalloc")
[all...] |
| stats.c | 43 assert_d_eq(mallctl("stats.arenas.0.large.allocated",
47 assert_d_eq(mallctl("stats.arenas.0.large.nmalloc", (void *)&nmalloc,
49 assert_d_eq(mallctl("stats.arenas.0.large.ndalloc", (void *)&ndalloc,
51 assert_d_eq(mallctl("stats.arenas.0.large.nrequests",
59 "nmalloc should be at least as large as ndalloc");
69 void *little, *large; local
79 large = mallocx((1U << LG_LARGE_MINCLASS), MALLOCX_ARENA(0));
80 assert_ptr_not_null(large, "Unexpected mallocx() failure");
83 dallocx(large, 0);
179 "nmalloc should be at least as large as ndalloc")
[all...] |
| /src/common/dist/zlib/examples/ |
| enough.c | 92 exceed the capacity of an eight-byte integer with a large number of symbols
93 and a large maximum code length, so multiple-precision arithmetic would need
227 int large; // largest code table so far member in struct:__anon50
376 if (mem >= g.large) {
379 if (mem > g.large) {
380 g.large = mem;
461 g.large = 1 << g.root; // base table
479 printf("maximum of %d table entries for root = %d\n", g.large, g.root);
|
| enough.c | 92 exceed the capacity of an eight-byte integer with a large number of symbols
93 and a large maximum code length, so multiple-precision arithmetic would need
227 int large; // largest code table so far member in struct:__anon50
376 if (mem >= g.large) {
379 if (mem > g.large) {
380 g.large = mem;
461 g.large = 1 << g.root; // base table
479 printf("maximum of %d table entries for root = %d\n", g.large, g.root);
|
| /src/tests/usr.bin/xlint/lint1/ |
| msg_348.c | 157 enum large { enum
158 /* expect+1: warning: constant -0x10000000000 too large for 'int' [56] */
160 /* expect+1: warning: constant 0x10000000000 too large for 'int' [56] */
166 large_name(enum large large)
172 return name[large];
|
| msg_348.c | 157 enum large { enum
158 /* expect+1: warning: constant -0x10000000000 too large for 'int' [56] */
160 /* expect+1: warning: constant 0x10000000000 too large for 'int' [56] */
166 large_name(enum large large)
172 return name[large];
|
| /src/external/bsd/cron/dist/ |
| cron.c | 36 enum timejump { negative, small, medium, large }; enumerator in enum:timejump
157 wakeupKind = large;
|
| cron.c | 36 enum timejump { negative, small, medium, large }; enumerator in enum:timejump
157 wakeupKind = large;
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| arena_structs_b.h | 119 * PRNG state for cache index randomization of large allocation base
148 * Extant large allocations.
152 extent_list_t large; member in struct:arena_s
153 /* Synchronizes all large allocation/update/deallocation. */
|
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| arena_structs_b.h | 119 * PRNG state for cache index randomization of large allocation base
148 * Extant large allocations.
152 extent_list_t large; member in struct:arena_s
153 /* Synchronizes all large allocation/update/deallocation. */
|
| /src/external/gpl3/binutils/dist/zlib/examples/ |
| enough.c | 92 exceed the capacity of an eight-byte integer with a large number of symbols
93 and a large maximum code length, so multiple-precision arithmetic would need
227 int large; // largest code table so far member in struct:__anon8637
376 if (mem >= g.large) {
379 if (mem > g.large) {
380 g.large = mem;
461 g.large = 1 << g.root; // base table
479 printf("maximum of %d table entries for root = %d\n", g.large, g.root);
|
| /src/external/gpl3/binutils.old/dist/zlib/examples/ |
| enough.c | 92 exceed the capacity of an eight-byte integer with a large number of symbols
93 and a large maximum code length, so multiple-precision arithmetic would need
227 int large; // largest code table so far member in struct:__anon10084
376 if (mem >= g.large) {
379 if (mem > g.large) {
380 g.large = mem;
461 g.large = 1 << g.root; // base table
479 printf("maximum of %d table entries for root = %d\n", g.large, g.root);
|
