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

1 2 3 4 5 6 7 8 91011>>

  /src/external/bsd/jemalloc/dist/src/
prof_stats.c 12 prof_stats_enter(tsd_t *tsd, szind_t ind) {
14 assert(ind < SC_NSIZES);
24 prof_stats_inc(tsd_t *tsd, szind_t ind, size_t size) {
26 prof_stats_enter(tsd, ind);
27 prof_stats_live[ind].req_sum += size;
28 prof_stats_live[ind].count++;
29 prof_stats_accum[ind].req_sum += size;
30 prof_stats_accum[ind].count++;
35 prof_stats_dec(tsd_t *tsd, szind_t ind, size_t size) {
37 prof_stats_enter(tsd, ind);
    [all...]
  /src/sys/arch/ia64/stand/common/
merge_help.awk 13 ind = 0;
34 ind++;
35 if (ind == 1)
37 first = ind;
38 help[ind, "T"] = T;
39 help[ind, "S"] = S;
40 help[ind, "link"] = -1;
52 help[j, "link"] = ind;
53 help[ind, "link"] = -1;
55 help[ind, "link"] = i
    [all...]
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
prof_stats.h 12 void prof_stats_inc(tsd_t *tsd, szind_t ind, size_t size);
13 void prof_stats_dec(tsd_t *tsd, szind_t ind, size_t size);
14 void prof_stats_get_live(tsd_t *tsd, szind_t ind, prof_stats_t *stats);
15 void prof_stats_get_accum(tsd_t *tsd, szind_t ind, prof_stats_t *stats);
ecache.h 16 unsigned ind; member in struct:ecache_s
32 ecache_nextents_get(ecache_t *ecache, pszind_t ind) {
33 return eset_nextents_get(&ecache->eset, ind) +
34 eset_nextents_get(&ecache->guarded_eset, ind);
39 ecache_nbytes_get(ecache_t *ecache, pszind_t ind) {
40 return eset_nbytes_get(&ecache->eset, ind) +
41 eset_nbytes_get(&ecache->guarded_eset, ind);
46 return ecache->ind;
50 unsigned ind, bool delay_coalesce);
  /src/external/bsd/jemalloc/include/jemalloc/internal/
base_inlines.h 6 return base->ind;
prof_stats.h 12 void prof_stats_inc(tsd_t *tsd, szind_t ind, size_t size);
13 void prof_stats_dec(tsd_t *tsd, szind_t ind, size_t size);
14 void prof_stats_get_live(tsd_t *tsd, szind_t ind, prof_stats_t *stats);
15 void prof_stats_get_accum(tsd_t *tsd, szind_t ind, prof_stats_t *stats);
ecache.h 16 unsigned ind; member in struct:ecache_s
32 ecache_nextents_get(ecache_t *ecache, pszind_t ind) {
33 return eset_nextents_get(&ecache->eset, ind) +
34 eset_nextents_get(&ecache->guarded_eset, ind);
39 ecache_nbytes_get(ecache_t *ecache, pszind_t ind) {
40 return eset_nbytes_get(&ecache->eset, ind) +
41 eset_nbytes_get(&ecache->guarded_eset, ind);
46 return ecache->ind;
50 unsigned ind, bool delay_coalesce);
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
base_inlines.h 6 return base->ind;
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
base_inlines.h 6 return base->ind;
  /src/external/gpl3/gcc.old/dist/libgcc/config/libbid/
bid_round.c 126 int ind; local
145 ind = x - 1; // 0 <= ind <= 16
146 C = C + midpoint64[ind];
147 // kx ~= 10^(-x), kx = Kx64[ind] * 2^(-Ex), 0 <= ind <= 16
150 __mul_64x64_to_128MACH (P128, C, Kx64[ind]);
154 shift = Ex64m64[ind]; // in [3, 56]
156 fstar.w[1] = P128.w[1] & mask64[ind];
158 // the top Ex bits of 10^(-x) are T* = ten2mxtrunc64[ind], e.g
229 int ind; local
410 int ind; local
676 int ind; local
    [all...]
bid128_round_integral.c 43 int q, ind, shift; variable
227 ind = -exp; // 1 <= ind <= 34; ind is a synonym for 'x'
228 // chop off ind digits from the lower part of C1
231 if (ind <= 19) {
232 C1.w[0] = C1.w[0] + midpoint64[ind - 1];
234 C1.w[0] = C1.w[0] + midpoint128[ind - 20].w[0];
235 C1.w[1] = C1.w[1] + midpoint128[ind - 20].w[1];
244 // kx = 10^(-x) = ten2mk128[ind - 1
    [all...]
bid_from_int.c 87 unsigned int q, ind; local
110 ind = 1; // number of digits to remove for q = 17
113 ind = 2; // number of digits to remove for q = 18
116 ind = 3; // number of digits to remove for q = 19
121 q, ind, C, &res, &incr_exp,
125 ind++;
130 // general correction from RN to RA, RM, RP, RZ; result uses ind for exp
146 ind = ind + 1;
157 ind = ind - 1
192 unsigned int q, ind; local
    [all...]
bid64_round_integral.c 52 int q, ind, shift; local
173 ind = -exp; // 1 <= ind <= 16; ind is a synonym for 'x'
174 // chop off ind digits from the lower part of C1
177 C1 = C1 + midpoint64[ind - 1];
183 // kx = 10^(-x) = ten2mk64[ind - 1]
186 __mul_64x64_to_128 (P128, C1, ten2mk64[ind - 1]);
198 if (ind - 1 <= 2) { // 0 <= ind - 1 <= 2 => shift =
513 int q, ind, shift; local
663 int q, ind, shift; local
815 int q, ind, shift; local
967 int q, ind, shift; local
1108 int q, ind, shift; local
    [all...]
bid128_to_int64.c 41 int q, ind, shift; variable
206 ind = q - 1;
207 if (ind <= 18) { // 0 <= ind <= 18
208 if ((C1.w[1] == 0) && (C1.w[0] <= midpoint64[ind])) {
215 } else { // 19 <= ind <= 33
216 if ((C1.w[1] < midpoint128[ind - 19].w[1])
217 || ((C1.w[1] == midpoint128[ind - 19].w[1])
218 && (C1.w[0] <= midpoint128[ind - 19].w[0]))) {
230 ind = -exp; // 1 <= ind <= 33; ind is a synonym for 'x
    [all...]
  /src/external/bsd/ntp/dist/libntp/
hextolfp.c 24 char *ind = NULL; local
40 (ind = strchr(digits, *cp)) != NULL) {
42 dec_i += ((ind - digits) > 15)
43 ? (u_long)(ind - digits - 6)
44 : (u_long)(ind - digits);
48 if ((cp - cpstart) < 8 || ind == NULL)
55 (ind = strchr(digits, *cp)) != NULL) {
57 dec_f += ((ind - digits) > 15)
58 ? (u_long)(ind - digits - 6)
59 : (u_long)(ind - digits)
    [all...]
  /src/external/gpl3/binutils/dist/gprofng/src/
DbeCacheMap.h 56 int ind = get_hash (key); local
57 table[ind].key = key;
58 table[ind].value = val;
64 int ind = get_hash (key); local
65 if (table[ind].key == key)
66 return table[ind].value;
73 int ind = get_hash (key); local
74 ITEM *v = table[ind].value;
75 table[ind].value = (ITEM *) NULL;
  /src/external/gpl3/binutils.old/dist/gprofng/src/
DbeCacheMap.h 56 int ind = get_hash (key); local
57 table[ind].key = key;
58 table[ind].value = val;
64 int ind = get_hash (key); local
65 if (table[ind].key == key)
66 return table[ind].value;
73 int ind = get_hash (key); local
74 ITEM *v = table[ind].value;
75 table[ind].value = (ITEM *) NULL;
  /src/external/bsd/jemalloc/dist/test/unit/
prof_stats.c 6 test_combinations(szind_t ind, size_t sizes_array[N_PTRS],
13 if (ind < SC_NBINS) {
15 "prof.stats.bins.%u.live", (unsigned)ind);
17 "prof.stats.bins.%u.accum", (unsigned)ind);
20 "prof.stats.lextents.%u.live", (unsigned)(ind - SC_NBINS));
22 "prof.stats.lextents.%u.accum", (unsigned)(ind - SC_NBINS));
46 assert(TEST_MALLOC_SIZE(p) == sz_index2size(ind));
93 test_szind_wrapper(szind_t ind) {
96 for (size_t i = 0, sz = sz_index2size(ind) - N_PTRS; i < N_PTRS;
101 test_combinations(ind, sizes_array, flags_array)
    [all...]
sz.c 12 pszind_t ind = sz_psz2ind(psz); local
13 expect_zu_eq(ind, i, "Got %u as sz_psz2ind of %zu", ind,
44 pszind_t ind = sz_psz2ind(psz); local
45 sc_t gt_sc = data.sc[ind + base_ind];
49 "Got %u as sz_psz2ind of %zu", ind, psz);
50 sc_t le_sc = data.sc[ind + base_ind + 1];
54 "Got %u as sz_psz2ind of %zu", ind, psz);
  /src/external/bsd/jemalloc/dist/test/analyze/
sizes.c 18 size_t ind = 0; local
20 while (sz >= 1024 && ind < sizes_max - 1) {
22 ind++;
24 if (ind == 0) {
27 printf("%-20s: %f %s\n", name, sz, sizes[ind]);
  /src/external/gpl3/binutils/dist/libiberty/
xatexit.c 52 int ind; /* next index in this table */ member in struct:xatexit
76 if (p->ind >= XATEXIT_SIZE)
80 p->ind = 0;
84 p->fns[p->ind++] = fn;
97 for (n = p->ind; --n >= 0;)
  /src/external/gpl3/binutils.old/dist/libiberty/
xatexit.c 52 int ind; /* next index in this table */ member in struct:xatexit
76 if (p->ind >= XATEXIT_SIZE)
80 p->ind = 0;
84 p->fns[p->ind++] = fn;
97 for (n = p->ind; --n >= 0;)
  /src/external/gpl3/gcc.old/dist/libiberty/
xatexit.c 52 int ind; /* next index in this table */ member in struct:xatexit
76 if (p->ind >= XATEXIT_SIZE)
80 p->ind = 0;
84 p->fns[p->ind++] = fn;
97 for (n = p->ind; --n >= 0;)
  /src/sys/opencrypto/
criov.c 129 int ind, len; local
131 ind = 0;
132 while (loc >= 0 && ind < uio->uio_iovcnt) {
133 len = uio->uio_iov[ind].iov_len;
136 return (ind);
139 ind++;
142 if (ind > 0 && loc == 0) {
143 ind--;
144 *off = uio->uio_iov[ind].iov_len;
145 return (ind);
155 int rval, ind, uiolen; local
    [all...]
  /src/lib/libterminfo/
ti.c 41 ssize_t ind; local
48 ind = _ti_flagindex(id);
49 if (ind != -1)
50 return term->flags[ind];
72 ssize_t ind; local
79 ind = _ti_numindex(id);
80 if (ind != -1) {
81 if (!VALID_NUMERIC(term->nums[ind]))
83 return term->nums[ind];
109 ssize_t ind; local
    [all...]

Completed in 49 milliseconds

1 2 3 4 5 6 7 8 91011>>