HomeSort by: relevance | last modified time | path
    Searched refs:CHUNKS (Results 1 - 5 of 5) sorted by relevancy

  /src/external/mpl/bind/dist/lib/isc/
histo.c 44 * The chunks array has a static size for simplicity, fixed as the
55 #define CHUNKS 64
59 #define EXPONENTS(hg) (CHUNKS - DENORMALS(hg))
76 hg_chunk_t chunk[CHUNKS];
112 for (uint c = 0; c < CHUNKS; c++) {
153 * of the value (in other words, chunks are spaced exponentially);
162 * between 0 and 63, which is why there are up to 64 chunks. In
175 * the first two chunks have one value per bucket.) The values in
496 hg_bucket_t *chunk[CHUNKS];
497 uint64_t total[CHUNKS];
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
internal-fn.h 69 DEF(CHUNKS), DEF(STEP), DEF(OFFSET), DEF(BOUND)
  /src/external/gpl3/gcc/dist/gcc/
internal-fn.h 73 DEF(CHUNKS), DEF(STEP), DEF(OFFSET), DEF(BOUND)
  /src/external/bsd/libevent/dist/test/
regress_http.c 413 static char const* const CHUNKS[] = {
432 evbuffer_add_printf(evb, "%s", CHUNKS[state->i]);
436 if (++state->i < (int) (sizeof(CHUNKS)/sizeof(CHUNKS[0]))) {
3474 * Makes a request and reads the response in chunks.
  /src/external/bsd/ntp/dist/sntp/libevent/test/
regress_http.c 410 static char const* const CHUNKS[] = {
429 evbuffer_add_printf(evb, "%s", CHUNKS[state->i]);
433 if (++state->i < (int) (sizeof(CHUNKS)/sizeof(CHUNKS[0]))) {
3471 * Makes a request and reads the response in chunks.

Completed in 25 milliseconds