OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:MAX_BITS
(Results
1 - 7
of
7
) sorted by null
/external/smack/src/com/kenai/jbosh/
RequestIDSequence.java
34
private static final int
MAX_BITS
= 53;
50
private static final long MAX_INITIAL = (1L <<
MAX_BITS
) - MIN_INCREMENTS;
55
private static final long MASK = ~(Long.MAX_VALUE <<
MAX_BITS
);
/external/qemu/distrib/zlib-1.2.3/
trees.c
130
{static_ltree, extra_lbits, LITERALS+1, L_CODES,
MAX_BITS
};
133
{static_dtree, extra_dbits, 0, D_CODES,
MAX_BITS
};
247
ush bl_count[
MAX_BITS
+1];
293
for (bits = 0; bits <=
MAX_BITS
; bits++) bl_count[bits] = 0;
507
for (bits = 0; bits <=
MAX_BITS
; bits++) s->bl_count[bits] = 0;
582
ush next_code[
MAX_BITS
+1]; /* next code value for each bit length */
590
for (bits = 1; bits <=
MAX_BITS
; bits++) {
596
Assert (code + bl_count[
MAX_BITS
]-1 == (1<<
MAX_BITS
)-1,
[
all
...]
deflate.h
48
#define
MAX_BITS
15
49
/* All codes must not exceed
MAX_BITS
bits */
200
ush bl_count[
MAX_BITS
+1];
/external/zlib/src/
trees.c
126
{static_ltree, extra_lbits, LITERALS+1, L_CODES,
MAX_BITS
};
129
{static_dtree, extra_dbits, 0, D_CODES,
MAX_BITS
};
243
ush bl_count[
MAX_BITS
+1];
291
for (bits = 0; bits <=
MAX_BITS
; bits++) bl_count[bits] = 0;
505
for (bits = 0; bits <=
MAX_BITS
; bits++) s->bl_count[bits] = 0;
580
ush next_code[
MAX_BITS
+1]; /* next code value for each bit length */
588
for (bits = 1; bits <=
MAX_BITS
; bits++) {
594
Assert (code + bl_count[
MAX_BITS
]-1 == (1<<
MAX_BITS
)-1,
[
all
...]
deflate.h
48
#define
MAX_BITS
15
49
/* All codes must not exceed
MAX_BITS
bits */
203
ush bl_count[
MAX_BITS
+1];
/external/chromium_org/third_party/zlib/
deflate.h
48
#define
MAX_BITS
15
49
/* All codes must not exceed
MAX_BITS
bits */
205
ush bl_count[
MAX_BITS
+1];
trees.c
131
{static_ltree, extra_lbits, LITERALS+1, L_CODES,
MAX_BITS
};
134
{static_dtree, extra_dbits, 0, D_CODES,
MAX_BITS
};
248
ush bl_count[
MAX_BITS
+1];
296
for (bits = 0; bits <=
MAX_BITS
; bits++) bl_count[bits] = 0;
511
for (bits = 0; bits <=
MAX_BITS
; bits++) s->bl_count[bits] = 0;
586
ush next_code[
MAX_BITS
+1]; /* next code value for each bit length */
594
for (bits = 1; bits <=
MAX_BITS
; bits++) {
600
Assert (code + bl_count[
MAX_BITS
]-1 == (1<<
MAX_BITS
)-1,
[
all
...]
Completed in 1411 milliseconds