OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:NMAX
(Results
1 - 4
of
4
) sorted by null
/frameworks/av/media/libstagefright/codecs/amrnb/common/src/
gmed_n.cpp
68
#define
NMAX
9 /* largest N used in median calculation */
108
valid for a odd number of gains (n <=
NMAX
).
127
// (n <=
NMAX
)
133
Word16 tmp[
NMAX
];
134
Word16 tmp2[
NMAX
];
191
Word16 tmp[
NMAX
];
192
Word16 tmp2[
NMAX
];
/external/chromium/sdch/open-vcdiff/src/
adler32.c
12
#define
NMAX
5552
13
/*
NMAX
is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
136
/* do length
NMAX
blocks -- requires just one modulo operation */
137
while (len >=
NMAX
) {
138
len -=
NMAX
;
139
n =
NMAX
/ 16; /*
NMAX
is divisible by 16 */
148
/* do remaining bytes (less than
NMAX
, still just one modulo) */
/external/qemu/distrib/zlib-1.2.3/
adler32.c
12
#define
NMAX
5552
13
/*
NMAX
is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
96
/* do length
NMAX
blocks -- requires just one modulo operation */
97
while (len >=
NMAX
) {
98
len -=
NMAX
;
99
n =
NMAX
/ 16; /*
NMAX
is divisible by 16 */
108
/* do remaining bytes (less than
NMAX
, still just one modulo) */
/external/zlib/
adler32.c
15
#define
NMAX
5552
16
/*
NMAX
is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
104
/* do length
NMAX
blocks -- requires just one modulo operation */
105
while (len >=
NMAX
) {
106
len -=
NMAX
;
107
n =
NMAX
/ 16; /*
NMAX
is divisible by 16 */
116
/* do remaining bytes (less than
NMAX
, still just one modulo) */
Completed in 1028 milliseconds