HomeSort by: relevance | last modified time | path
    Searched defs:sizes (Results 1 - 25 of 88) sorted by relevancy

1 2 3 4

  /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
bn_mp_prime_rabin_miller_trials.c 23 } sizes[] = { variable in typeref:struct:__anon831
39 for (x = 0; x < (int)(sizeof(sizes)/(sizeof(sizes[0]))); x++) {
40 if (sizes[x].k == size) {
41 return sizes[x].t;
42 } else if (sizes[x].k > size) {
43 return (x == 0) ? sizes[0].t : sizes[x - 1].t;
46 return sizes[x-1].t + 1;
  /src/external/bsd/jemalloc/dist/test/analyze/
sizes.c 6 * Print the sizes of various important core data structures. OK, I guess this
14 const char *sizes[] = {"bytes", "KB", "MB", "GB", "TB", "PB", "EB", local
16 size_t sizes_max = sizeof(sizes)/sizeof(sizes[0]);
27 printf("%-20s: %f %s\n", name, sz, sizes[ind]);
  /src/external/gpl3/gcc/dist/libgcc/
siditi-object.mk 3 # $(iter-labels) and $(iter-sizes) are also advanced.
11 $o-size := $(firstword $(iter-sizes))
12 iter-sizes := $(wordlist 2,$(words $(iter-sizes)),$(iter-sizes))
  /src/external/gpl3/gcc.old/dist/libgcc/
siditi-object.mk 3 # $(iter-labels) and $(iter-sizes) are also advanced.
11 $o-size := $(firstword $(iter-sizes))
12 iter-sizes := $(wordlist 2,$(words $(iter-sizes)),$(iter-sizes))
  /src/sys/dev/raidframe/
rf_alloclist.h 44 int sizes[RF_POINTERS_PER_ALLOC_LIST_ELEMENT]; member in struct:RF_AllocListElem_s
  /src/external/gpl3/gcc/dist/libgomp/config/nvptx/
libgomp-nvptx.h 39 uint64_t sizes; member in struct:rev_offload
  /src/sys/arch/ia64/ia64/
sal.c 90 static int sizes[6] = { local
178 p += sizes[*p];
  /src/tests/lib/libc/sys/
t_truncate.c 45 static const size_t sizes[] = { 8, 16, 512, 1024, 2048, 4094, 3000, 30 }; variable
62 for (i = 0; i < __arraycount(sizes); i++) {
66 ATF_REQUIRE(ftruncate(fd, sizes[i]) == 0);
69 (void)fprintf(stderr, "truncating to %zu bytes\n", sizes[i]);
71 if (sizes[i] != (size_t)st.st_size)
122 for (i = 0; i < __arraycount(sizes); i++) {
126 ATF_REQUIRE(truncate(path, sizes[i]) == 0);
129 (void)fprintf(stderr, "truncating to %zu bytes\n", sizes[i]);
131 if (sizes[i] != (size_t)st.st_size)
  /src/tests/net/in_cksum/
t_in_cksum.sh 29 sizes() { function
57 atf_set "descr" "Test in_cksum sizes aligned"
61 sizes 0
65 atf_set "descr" "Test in_cksum sizes unaligned"
69 sizes 1
  /src/external/bsd/jemalloc/dist/msvc/test_threads/
test_threads.cpp 29 static const int sizes[] = { 7, 16, 32, 60, 91, 100, 120, 144, 169, 199, 255, 400, 670, 900, 917, 1025, 3333, 5190, 13131, 49192, 99999, 123123, 255265, 2333111 }; local
30 static const int numSizes = (int)(sizeof(sizes) / sizeof(sizes[0]));
52 const int sz = sizes[x];
  /src/external/bsd/jemalloc.old/dist/msvc/test_threads/
test_threads.cpp 28 static const int sizes[] = { 7, 16, 32, 60, 91, 100, 120, 144, 169, 199, 255, 400, 670, 900, 917, 1025, 3333, 5190, 13131, 49192, 99999, 123123, 255265, 2333111 }; local
29 static const int numSizes = (int)(sizeof(sizes) / sizeof(sizes[0]));
51 const int sz = sizes[x];
  /src/external/gpl2/gettext/dist/gettext-runtime/gnulib-lib/
fwriteerror.c 118 static int sizes[] = local
129 for (i = 0; i < sizeof (sizes) / sizeof (sizes[0]); i++)
131 size_t size = sizes[i];
  /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
fwriteerror.c 118 static int sizes[] = local
129 for (i = 0; i < sizeof (sizes) / sizeof (sizes[0]); i++)
131 size_t size = sizes[i];
  /src/external/gpl2/gettext/dist/gettext-tools/libgettextpo/
fwriteerror.c 118 static int sizes[] = local
129 for (i = 0; i < sizeof (sizes) / sizeof (sizes[0]); i++)
131 size_t size = sizes[i];
  /src/external/lgpl3/gmp/dist/mpn/generic/
binvert.c 66 mp_size_t sizes[NPOWS], *sizp; local
71 sizp = sizes;
invertappr.c 157 mp_size_t sizes[NPOWS], *sizp; local
170 sizp = sizes;
273 if (sizp == sizes) { /* Get out of the cycle */
broot.c 78 mp_size_t sizes[GMP_LIMB_BITS * 2]; local
147 sizes[i++] = n;
156 mpn_powlo (rnp, ep, &kp1h, 1, sizes[i], tp);
160 mpn_mullo_n (ep, rnp, akm1, sizes[i]);
163 ASSERT (sizes[i] <= 2*rn);
164 mpn_pi1_bdiv_q_1 (rp + rn, ep + rn, sizes[i] - rn, k, kinv, 0);
165 mpn_neg (rp + rn, rp + rn, sizes[i] - rn);
166 rn = sizes[i];
  /src/libexec/talkd/
announce.c 101 int sizes[N_LINES]; local
112 sizes[i] = strlen(line_buf[i]);
113 max_size = max(max_size, sizes[i]);
119 sizes[i] = strlen(line_buf[i]);
120 max_size = max(max_size, sizes[i]);
127 sizes[i] = strlen(line_buf[i]);
128 max_size = max(max_size, sizes[i]);
132 sizes[i] = strlen(line_buf[i]);
133 max_size = max(max_size, sizes[i]);
136 sizes[i] = strlen(line_buf[i])
    [all...]
  /src/sys/external/bsd/drm2/drm/
drmfb.c 86 const struct drm_fb_helper_surface_size *const sizes = da->da_fb_sizes; local
106 prop_dictionary_set_uint32(dict, "width", sizes->surface_width);
107 prop_dictionary_set_uint32(dict, "height", sizes->surface_height);
108 prop_dictionary_set_uint8(dict, "depth", sizes->surface_bpp);
  /src/tests/lib/libc/
t_cdb.c 139 size_t i, sizes[] = { 0, 16, 64, 1024, 2048 }; local
140 for (i = 0; i < __arraycount(sizes); ++i) {
141 init_keys(sizes[i]);
142 write_database(sizes[i]);
143 check_database(sizes[i]);
  /src/crypto/external/apache2/openssl/dist/test/
bio_comp_test.c 25 static int sizes[NUM_SIZES] = { 64, 512, 2048, 16 * 1024 }; variable
83 int size = sizes[n % 4];
  /src/external/gpl2/groff/dist/src/libs/libgroff/
fontfile.cpp 54 int *font::sizes = 0; member in class:font
  /src/external/gpl3/gcc/dist/gcc/
graphite-optimize-isl.cc 78 isl_multi_val *sizes = isl_multi_val_zero (space); local
83 sizes = isl_multi_val_set_val (sizes, i,
89 node = isl_schedule_node_band_tile (node, sizes);
  /src/external/gpl3/gcc.old/dist/gcc/
graphite-optimize-isl.cc 78 isl_multi_val *sizes = isl_multi_val_zero (space); local
83 sizes = isl_multi_val_set_val (sizes, i,
89 node = isl_schedule_node_band_tile (node, sizes);
  /src/external/gpl3/gdb/dist/gdb/
bcache.c 66 /* A table of good hash table sizes. Whenever we grow, we pick the
67 next larger size from this table. sizes[i] is close to 1 << (i+10),
71 static const unsigned long sizes[] = {
88 for (unsigned long a_size : sizes)
70 static const unsigned long sizes[] = { local

Completed in 39 milliseconds

1 2 3 4