Home
last modified time | relevance | path

Searched refs:MAXBITS (Results 1 – 3 of 3) sorted by relevance

/f-stack/freebsd/contrib/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
58 unsigned short count[MAXBITS+1]; /* number of codes of each length */
59 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */
107 for (len = 0; len <= MAXBITS; len++)
114 for (max = MAXBITS; max >= 1; max--)
132 for (len = 1; len <= MAXBITS; len++) {
142 for (len = 1; len < MAXBITS; len++)
/f-stack/freebsd/contrib/openzfs/module/lua/
H A Dltable.c43 #define MAXBITS 30 macro
45 #define MAXBITS (LUAI_BITSINT-2) macro
48 #define MAXASIZE (1 << MAXBITS)
234 for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */ in numusearray()
288 if (lsize > MAXBITS) in setnodevector()
345 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ in rehash()
348 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ in rehash()
/f-stack/app/redis-5.0.5/deps/lua/src/
H A Dltable.c42 #define MAXBITS 26 macro
44 #define MAXBITS (LUAI_BITSINT-2) macro
47 #define MAXASIZE (1 << MAXBITS)
227 for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */ in numusearray()
281 if (lsize > MAXBITS) in setnodevector()
335 int nums[MAXBITS+1]; /* nums[i] = number of keys between 2^(i-1) and 2^i */ in rehash()
338 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ in rehash()