Home
last modified time | relevance | path

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

/freebsd/sys/contrib/zlib/
H A Dinftrees.c9 #define MAXBITS 15 macro
53 unsigned short count[MAXBITS+1]; /* number of codes of each length */ in inflate_table()
54 unsigned short offs[MAXBITS+1]; /* offsets in table for each length */ in inflate_table()
102 for (len = 0; len <= MAXBITS; len++) in inflate_table()
109 for (max = MAXBITS; max >= 1; max--) in inflate_table()
127 for (len = 1; len <= MAXBITS; len++) { in inflate_table()
137 for (len = 1; len < MAXBITS; len++) in inflate_table()
/freebsd/crypto/libecc/src/arithmetic_tests/
H A DMakefile22 $(eval MAXBITS := $(shell ./arithmetic_tests -info | cut -d ' ' -f2))
23 python2 arithmetic_tests_generator.py stdout $(WORDSZ) $(MAXBITS) $(NUM_TESTS) | ./arithmetic_tests
/freebsd/sys/contrib/openzfs/module/lua/
H A Dltable.c42 #define MAXBITS 30 macro
44 #define MAXBITS (LUAI_BITSINT-2) macro
47 #define MAXASIZE (1 << MAXBITS)
233 for (lg=0, ttlg=1; lg<=MAXBITS; lg++, ttlg*=2) { /* for each slice */ in numusearray()
287 if (lsize > MAXBITS) in setnodevector()
344 int nums[MAXBITS+1]; /* nums[i] = number of keys with 2^(i-1) < k <= 2^i */ in rehash()
347 for (i=0; i<=MAXBITS; i++) nums[i] = 0; /* reset counts */ in rehash()