| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| peak.h | 7 uint64_t cur_max; member in struct:peak_s
19 return peak->cur_max;
25 if (candidate_max > (int64_t)peak->cur_max) {
26 peak->cur_max = candidate_max;
33 peak->cur_max = 0;
|
| peak.h | 7 uint64_t cur_max; member in struct:peak_s
19 return peak->cur_max;
25 if (candidate_max > (int64_t)peak->cur_max) {
26 peak->cur_max = candidate_max;
33 peak->cur_max = 0;
|
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| peak.h | 7 uint64_t cur_max; member in struct:peak_s
19 return peak->cur_max;
25 if (candidate_max > (int64_t)peak->cur_max) {
26 peak->cur_max = candidate_max;
33 peak->cur_max = 0;
|
| peak.h | 7 uint64_t cur_max; member in struct:peak_s
19 return peak->cur_max;
25 if (candidate_max > (int64_t)peak->cur_max) {
26 peak->cur_max = candidate_max;
33 peak->cur_max = 0;
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| peak.h | 9 uint64_t cur_max; member in struct:peak_s
22 return peak->cur_max;
28 if (candidate_max > (int64_t)peak->cur_max) {
29 peak->cur_max = candidate_max;
36 peak->cur_max = 0;
|
| peak.h | 9 uint64_t cur_max; member in struct:peak_s
22 return peak->cur_max;
28 if (candidate_max > (int64_t)peak->cur_max) {
29 peak->cur_max = candidate_max;
36 peak->cur_max = 0;
|
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| peak.h | 9 uint64_t cur_max; member in struct:peak_s
22 return peak->cur_max;
28 if (candidate_max > (int64_t)peak->cur_max) {
29 peak->cur_max = candidate_max;
36 peak->cur_max = 0;
|
| peak.h | 9 uint64_t cur_max; member in struct:peak_s
22 return peak->cur_max;
28 if (candidate_max > (int64_t)peak->cur_max) {
29 peak->cur_max = candidate_max;
36 peak->cur_max = 0;
|
| /src/games/monop/ |
| prop.c | 160 int i, num_in, cur_max; local
168 cur_max = 0;
170 while (num_in > 1 || (cur_max == 0 && num_in > 0)) {
181 } else if (cur_bid <= cur_max) {
183 "to stay in\n", cur_max);
190 } while (cur_bid != 0 && cur_bid <= cur_max);
191 cur_max = (cur_bid ? cur_bid : cur_max);
194 if (cur_max != 0) {
197 printf("It goes to %s (%d) for $%d\n",play[i].name,i+1,cur_max);
[all...] |
| prop.c | 160 int i, num_in, cur_max; local
168 cur_max = 0;
170 while (num_in > 1 || (cur_max == 0 && num_in > 0)) {
181 } else if (cur_bid <= cur_max) {
183 "to stay in\n", cur_max);
190 } while (cur_bid != 0 && cur_bid <= cur_max);
191 cur_max = (cur_bid ? cur_bid : cur_max);
194 if (cur_max != 0) {
197 printf("It goes to %s (%d) for $%d\n",play[i].name,i+1,cur_max);
[all...] |
| monop.c | 320 int i, rl, cur_max; local
326 for (cur_max = i = 0; i < num_play; i++) {
328 if (rl > cur_max) {
330 cur_max = rl;
333 else if (rl == cur_max)
|
| monop.c | 320 int i, rl, cur_max; local
326 for (cur_max = i = 0; i < num_play; i++) {
328 if (rl > cur_max) {
330 cur_max = rl;
333 else if (rl == cur_max)
|
| /src/external/bsd/tre/dist/lib/ |
| tre-parse.h | 41 /* the CUR_MAX in use */
42 int cur_max; member in struct:__anon8201
|
| tre-parse.h | 41 /* the CUR_MAX in use */
42 int cur_max; member in struct:__anon8201
|
| /src/lib/libc/citrus/modules/ |
| citrus_utf1632.c | 66 unsigned int cur_max; member in struct:__anon293
78 #define _ENCODING_MB_CUR_MAX(_ei_) ((_ei_)->cur_max)
409 ei->cur_max = 6; /* endian + surrogate */
411 ei->cur_max = 8; /* endian + normal */
|
| citrus_utf1632.c | 66 unsigned int cur_max; member in struct:__anon293
78 #define _ENCODING_MB_CUR_MAX(_ei_) ((_ei_)->cur_max)
409 ei->cur_max = 6; /* endian + surrogate */
411 ei->cur_max = 8; /* endian + normal */
|
| /src/crypto/external/apache2/openssl/dist/ssl/ |
| priority_queue.c | 295 size_t new_max, cur_max; local
301 cur_max = pq->hmax;
302 if (pq->htop + n < cur_max)
305 new_max = compute_pqueue_growth(n + cur_max, cur_max);
322 pqueue_add_freelist(pq, cur_max);
|
| priority_queue.c | 295 size_t new_max, cur_max; local
301 cur_max = pq->hmax;
302 if (pq->htop + n < cur_max)
305 new_max = compute_pqueue_growth(n + cur_max, cur_max);
322 pqueue_add_freelist(pq, cur_max);
|
