OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:nbits
(Results
126 - 150
of
195
) sorted by null
1
2
3
4
5
6
7
8
/external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/
bitalloc.c
61
OI_UINT16
nbits
= frame->nrof_blocks * frame->bitpool;
local
63
OI_UINT16 result =
nbits
;
68
if (frame->mode == SBC_DUAL_CHANNEL) { result +=
nbits
; }
/external/chromium_org/third_party/skia/src/core/
SkMath.cpp
85
int
nbits
= SkCLZ(numer) - 1;
local
87
int bits = shift_bias -
nbits
+ dbits;
97
numer <<=
nbits
;
local
/external/skia/src/core/
SkMath.cpp
85
int
nbits
= SkCLZ(numer) - 1;
local
87
int bits = shift_bias -
nbits
+ dbits;
97
numer <<=
nbits
;
local
/bionic/libc/upstream-openbsd/lib/libc/gdtoa/
gdtoa.h
89
int
nbits
;
member in struct:FPI
/ndk/sources/android/support/src/stdio/
strtod.c
399
int
nbits
;
member in struct:FPI
1690
copybits(bits, fpi.
nbits
, bb);
3217
int big, esign, havedig, irv, j, k, n, n0,
nbits
, up, zret;
local
[
all
...]
/external/elfutils/0.153/libcpu/
i386_parse.c
2997
int
nbits
= 0;
local
[
all
...]
i386_parse.y
1285
int
nbits
= 0;
1293
if (++
nbits
== 8)
1304
byte = mask =
nbits
= 0;
1314
while (
nbits
+ remaining > 8)
1317
mask << (8 -
nbits
), byte << (8 -
nbits
));
1318
remaining =
nbits
+ remaining - 8;
1319
byte = mask =
nbits
= 0;
1325
nbits
+= remaining;
1326
if (
nbits
== 8
[
all
...]
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/
BitSet.cs
54
* We will often need to do a mod operator (i mod
nbits
). Its
56
* same as (i & (
nbits
-1)). Since mod is slow, we use a
83
* <param name="
nbits
">The size of the bitset in bits</param>
85
public BitSet(int
nbits
) {
86
_bits = new ulong[((
nbits
- 1) >> LOG_BITS) + 1];
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/
BitSet.cs
56
* We will often need to do a mod operator (i mod
nbits
). Its
58
* same as (i & (
nbits
-1)). Since mod is slow, we use a
89
* <param name="
nbits
">The size of the bitset in bits</param>
91
public BitSet( int
nbits
)
93
_bits = new ulong[( (
nbits
- 1 ) >> LOG_BITS ) + 1];
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/
BitSet.java
40
/* We will often need to do a mod operator (i mod
nbits
). Its
42
* same as (i & (
nbits
-1)). Since mod is slow, we use a
70
* @param
nbits
The size of the bitset in bits
72
public BitSet(int
nbits
) {
73
bits = new long[((
nbits
- 1) >> LOG_BITS) + 1];
/external/openssl/crypto/dsa/
dsa.h
272
#define EVP_PKEY_CTX_set_dsa_paramgen_bits(ctx,
nbits
) \
274
EVP_PKEY_CTRL_DSA_PARAMGEN_BITS,
nbits
, NULL)
/external/openssl/include/openssl/
dsa.h
272
#define EVP_PKEY_CTX_set_dsa_paramgen_bits(ctx,
nbits
) \
274
EVP_PKEY_CTRL_DSA_PARAMGEN_BITS,
nbits
, NULL)
/frameworks/av/media/libstagefright/codecs/amrwb/src/
dec_gain2_amr_wb.cpp
48
int16
nbits
, (i) : number of bits (6 or 7)
171
int16
nbits
, /* (i) : number of bits (6 or 7) */
327
if (
nbits
== 6)
pvamrwbdecoder_acelp.h
252
int16
nbits
, /* (i) : number of bits (6 or 7) */
/frameworks/av/media/libstagefright/codecs/amrwbenc/src/
q_gain2.c
71
Word16
nbits
, /* (i) : number of bits (6 or 7) */
92
if (
nbits
== 6)
/external/aac/libAACdec/src/
block.cpp
292
const int
nbits
= (IsLongBlock(&pAacDecoderChannelInfo->icsInfo) == 1) ? 5 : 3;
local
294
int sect_esc_val = (1 <<
nbits
) - 1 ;
309
sect_len_incr = FDKreadBits(bs,
nbits
);
313
sect_len_incr = FDKreadBits(bs,
nbits
);
/external/chromium_org/third_party/smhasher/src/
KeysetTest.h
139
const int
nbits
= nbytes * 8;
local
143
for(int i = start; i <
nbits
; i++)
/frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
acelp.h
394
Word16
nbits
, /* (i) : number of bits (6 or 7) */
406
Word16
nbits
, /* (i) : number of bits (6 or 7) */
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/
perfect.c
74
/* compute p(x), where p is a permutation of 0..(1<<
nbits
)-1 */
78
ub4
nbits
) /* input, number of bits in range */
81
int mask = ((ub4)1<<
nbits
)-1; /* all ones */
82
int const2 = 1+
nbits
/2;
83
int const3 = 1+
nbits
/3;
84
int const4 = 1+
nbits
/4;
85
int const5 = 1+
nbits
/5;
[
all
...]
/hardware/broadcom/wlan/bcmdhd/dhdutil/include/
bcmutils.h
675
#define
NBITS
(type) (sizeof(type) * 8)
676
#define NBITVAL(
nbits
) (1 << (
nbits
))
677
#define MAXBITVAL(
nbits
) ((1 << (
nbits
)) - 1)
678
#define NBITMASK(
nbits
) MAXBITVAL(
nbits
)
/external/zopfli/src/zopflipng/lodepng/
lodepng_util.cpp
301
unsigned long readBitsFromStream(size_t& bitp, const unsigned char* bits, size_t
nbits
)
304
for(size_t i = 0; i <
nbits
; i++) result += (readBitFromStream(bitp, bits)) << i;
630
unsigned long readBitsFromReversedStream(size_t& bitp, const unsigned char* bits, unsigned long
nbits
)
633
for(size_t i =
nbits
- 1; i <
nbits
; i--) result += ((readBitFromReversedStream(bitp, bits)) << i);
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_long.py
97
nbits
= 0
99
while
nbits
< nbits_lo:
101
bits = min(bits, nbits_hi -
nbits
)
103
nbits
=
nbits
+ bits
108
self.assertTrue(nbits_lo <=
nbits
<= nbits_hi)
[
all
...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_long.py
97
nbits
= 0
99
while
nbits
< nbits_lo:
101
bits = min(bits, nbits_hi -
nbits
)
103
nbits
=
nbits
+ bits
108
self.assertTrue(nbits_lo <=
nbits
<= nbits_hi)
[
all
...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
BitSet.java
57
/* We will often need to do a mod operator (i mod
nbits
). Its
59
* same as (i & (
nbits
-1)). Since mod is slow, we use a
78
* @param
nbits
The size of the bitset in bits
80
public BitSet(int
nbits
) {
81
bits = new long[((
nbits
- 1) >> LOG_BITS) + 1];
/external/pdfium/core/src/fxcodec/libjpeg/
fpdfapi_jdhuff.c
298
int
nbits
)
299
/* Load up the bit buffer to a depth of at least
nbits
*/
370
if (
nbits
> bits_left) {
Completed in 9824 milliseconds
1
2
3
4
5
6
7
8