Searched defs:bits (Results 1 - 8 of 8) sorted by relevance

/glassfish-3.1.2/installer/src/cpp/share/launcher/zlib-1.1.4/
H A Dmaketree.c26 #define bits word.what.Bits macro
44 printf(" {{{%u,%u}},%u}", t[i].exop, t[i].bits, t[i].base);
H A Dinffast.c17 #define bits word.what.Bits macro
36 uInt e; /* extra bits or operation */
38 uInt k; /* bits in bit buffer */
59 GRABBITS(20) /* max bits for literal/length code */
62 DUMPBITS(t->bits)
71 DUMPBITS(t->bits)
74 /* get extra bits for length */
81 GRABBITS(15); /* max bits for distance code */
84 DUMPBITS(t->bits)
87 /* get extra bits t
[all...]
H A Dinfblock.c16 #define bits word.what.Bits macro
28 3. There is an implied maximum of 7 bits for the bit length table and
29 15 bits for the actual data.
37 zero distance codes, which is sent as one code of zero bits in
42 cannot be used though, since there is no length base or extra bits
44 However, static trees define 32 codes (all 5 bits) to fill out the
48 8. The five bits following the block type is really the number of
50 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
127 uInt k; /* bits in bit buffer */
195 b = k = 0; /* dump bits */
[all...]
H A Dinfcodes.c15 #define bits word.what.Bits macro
41 uInt need; /* bits needed */
45 uInt get; /* bits to get for extra */
51 Byte lbits; /* ltree bits decoded per branch */
52 Byte dbits; /* dtree bits decoder per branch */
88 uInt e; /* extra bits or operation */
90 uInt k; /* bits in bit buffer */
125 DUMPBITS(t->bits)
172 DUMPBITS(t->bits)
H A Dinftrees.c26 #define bits word.what.Bits macro
30 uIntf *, /* code lengths in bits */
34 const uIntf *, /* list of extra bits for non-simple codes */
36 uIntf *, /* maximum lookup bits (returns actual) */
46 local const uInt cplext[31] = { /* Extra bits for literal codes 257..285 */
53 local const uInt cpdext[30] = { /* Extra bits for distance codes */
71 below. lbits is the number of bits the first level table for literal/
76 bits is used, or when the shortest code is *longer* than the requested
77 table size, in which case the length of the shortest code in bits is
83 bits
[all...]
H A Dtrees.c47 /* Bit length codes must not exceed MAX_BL_BITS bits */
53 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
56 /* repeat a zero length 3-10 times (3 bits of repeat count) */
59 /* repeat a zero length 11-138 times (7 bits of repeat count) */
61 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
64 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
67 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
77 /* Number of bits used within bi_buf. (bi_buf might be implemented on
78 * more than 16 bits on some systems.)
99 * 5 bits
244 int bits; /* bit counter */ local
503 int bits; /* bit length */ local
585 int bits; /* bit index */ local
[all...]
/glassfish-3.1.2/deployment/common/src/main/java/com/sun/enterprise/deployment/deploy/shared/
H A DMemoryMappedArchive.java90 public MemoryMappedArchive(byte[] bits) { argument
91 file = bits;
/glassfish-3.1.2/ejb/ejb-container/src/main/java/com/sun/ejb/containers/
H A DTimerSchedule.java641 * Populate the BitSet where true bits represent set values.
644 private void parseNumbersOrNames(String s, BitSet bits, argument
649 bits.set(0, size);
652 bits.set(conversionTable.get(i));
663 processRange(s0, bits, start, size, field);
665 bits.set(getNumericValue(s0, start, size, field));
673 processRange(s, bits, start, size, field);
687 bits.set(i);
694 bits.set(getNumericValue(s, start, size, field));
701 private void processRange(String s, BitSet bits, in argument
843 skipToNextValue(Calendar date, BitSet bits, int field, int highfiled) argument
1049 setDaysOfWeek(BitSet bits, Calendar date, String s) argument
1069 setBitsRange(BitSet bits, int begin, int end, int start, int size) argument
[all...]

Completed in 998 milliseconds