| /external/dropbear/libtommath/etc/ |
| 2kprime.1 | 1 256-bits (k = 36113) = 115792089237316195423570985008687907853269984665640564039457584007913129603823
2 512-bits (k = 38117) = 13407807929942597099574024998205846127479365820592393377723561443721764030073546976801874298166903427690031858186486050853753882811946569946433649006045979
|
| /external/speex/libspeex/ |
| bits.c | 48 EXPORT void speex_bits_init(SpeexBits *bits)
50 bits->chars = (char*)speex_alloc(MAX_CHARS_PER_FRAME);
51 if (!bits->chars)
54 bits->buf_size = MAX_CHARS_PER_FRAME;
56 bits->owner=1;
58 speex_bits_reset(bits);
61 EXPORT void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size)
63 bits->chars = (char*)buff;
64 bits->buf_size = buf_size;
66 bits->owner=0
[all...] |
| speex_callbacks.c | 43 EXPORT int speex_inband_handler(SpeexBits *bits, SpeexCallback *callback_list, void *state)
47 /*speex_bits_advance(bits, 5);*/
48 id=speex_bits_unpack_unsigned(bits, 4);
53 return callback->func(bits, state, callback->data);
55 /*If callback is not registered, skip the right number of bits*/
70 speex_bits_advance(bits, adv);
75 EXPORT int speex_std_mode_request_handler(SpeexBits *bits, void *state, void *data)
78 m = speex_bits_unpack_unsigned(bits, 4);
83 EXPORT int speex_std_low_mode_request_handler(SpeexBits *bits, void *state, void *data)
86 m = speex_bits_unpack_unsigned(bits, 4)
[all...] |
| /dalvik/dx/src/com/android/dx/util/_tests/ |
| _Bits.java | 19 import com.android.dx.util.Bits;
24 * Test the class {@code com.android.dx.util.Bits}.
29 assertEquals(label(0), 0, Bits.makeBitSet(0).length);
32 assertEquals(label(i), 1, Bits.makeBitSet(i).length);
36 assertEquals(label(i), 2, Bits.makeBitSet(i).length);
44 assertEquals(label(i), expect, Bits.makeBitSet(i).length);
55 Bits.getMax(new int[expect]));
60 int[] bits = Bits.makeBitSet(100); local
63 assertFalse(label(i), Bits.get(bits, i))
68 int[] bits = Bits.makeBitSet(100); local
79 int[] bits = Bits.makeBitSet(100); local
92 int[] bits = Bits.makeBitSet(50); local
109 int[] bits = Bits.makeBitSet(100); local
137 int[] bits = Bits.makeBitSet(100); local
152 int[] bits = Bits.makeBitSet(100); local
177 int[] bits = Bits.makeBitSet(i); local
196 int[] bits = Bits.makeBitSet(i); local
219 int[] bits = new int[100]; local
227 int[] bits = new int[100]; local
235 int[] bits = new int[100]; local
243 int[] bits = new int[100]; local
254 int[] bits = new int[100]; local
265 int[] bits = new int[100]; local
276 int[] bits = new int[100]; local
284 int[] bits = new int[100]; local
295 int[] bits = new int[100]; local
[all...] |
| /dalvik/dx/tests/029-unit-Bits/ |
| info.txt | 1 Unit test for com.android.dx.util.Bits.
|
| /dalvik/dx/src/com/android/dx/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| Bits.java | 22 public final class Bits {
26 private Bits() {
31 * Constructs a bit set to contain bits up to the given index (exclusive).
44 * @param bits {@code non-null;} bit set in question
47 public static int getMax(int[] bits) {
48 return bits.length * 0x20;
54 * @param bits {@code non-null;} bit set to operate on
58 public static boolean get(int[] bits, int idx) {
61 return (bits[arrayIdx] & bit) != 0;
67 * @param bits {@code non-null;} bit set to operate o
[all...] |
| /external/elfutils/libelf/ |
| abstract.h | 19 #define Ehdr(Bits, Ext) \
20 START (Bits, Ehdr, Ext##Ehdr) \
23 TYPE_NAME (ElfW2(Bits, Ext##Half), e_type) \
24 TYPE_NAME (ElfW2(Bits, Ext##Half), e_machine) \
25 TYPE_NAME (ElfW2(Bits, Ext##Word), e_version) \
26 TYPE_NAME (ElfW2(Bits, Ext##Addr), e_entry) \
27 TYPE_NAME (ElfW2(Bits, Ext##Off), e_phoff) \
28 TYPE_NAME (ElfW2(Bits, Ext##Off), e_shoff) \
29 TYPE_NAME (ElfW2(Bits, Ext##Word), e_flags) \
30 TYPE_NAME (ElfW2(Bits, Ext##Half), e_ehsize)
[all...] |
| gelf_xlate.c | 46 bit. We need only functions for 16, 32, and 64 bits. The
65 #define FUNDAMENTAL(NAME, Name, Bits) \
66 INLINE2 (ELFW2(Bits,FSZ_##NAME), ElfW2(Bits,cvt_##Name), ElfW2(Bits,Name))
105 #define START(Bits, Name, EName) \
107 ElfW2 (Bits, cvt_##Name) (void *dest, const void *src, size_t len, \
109 { ElfW2(Bits, Name) *tdest = (ElfW2(Bits, Name) *) dest; \
110 ElfW2(Bits, Name) *tsrc = (ElfW2(Bits, Name) *) src;
[all...] |
| /dalvik/dx/src/com/android/dx/rop/cst/ |
| CstLiteral64.java | 24 /** the value as {@code long} bits */
25 private final long bits; field in class:CstLiteral64
30 * @param bits the value as {@code long} bits
32 /*package*/ CstLiteral64(long bits) {
33 this.bits = bits;
41 bits == ((CstLiteral64) other).bits;
47 return (int) bits ^ (int) (bits >> 32)
[all...] |
| CstLiteral32.java | 24 /** the value as {@code int} bits */
25 private final int bits; field in class:CstLiteral32
30 * @param bits the value as {@code int} bits
32 /*package*/ CstLiteral32(int bits) {
33 this.bits = bits;
41 bits == ((CstLiteral32) other).bits;
47 return bits;
[all...] |
| CstLiteralBits.java | 36 * Gets the value as {@code int} bits. If this instance contains
37 * more bits than fit in an {@code int}, then this returns only
38 * the low-order bits.
40 * @return the bits
45 * Gets the value as {@code long} bits. If this instance contains
46 * fewer bits than fit in a {@code long}, then the result of this
49 * @return the bits
54 * Returns true if this value can fit in 16 bits with sign-extension.
56 * @return true if the sign-extended lower 16 bits are the same as
64 int bits = getIntBits() local
79 int bits = getIntBits(); local
[all...] |
| /dalvik/libcore/luni/src/main/native/ |
| java_lang_Float.c | 14 unsigned int bits; member in union:__anon624
23 static int IsNaN(unsigned bits)
25 return ((bits >= 0x7f800001U && bits <= 0x7fffffffU)
26 || (bits >= 0xff800001U && bits <= 0xffffffffU));
41 if (IsNaN(f.bits))
42 f.bits = NaN;
44 return f.bits;
56 return f.bits;
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/crypto/params/ |
| RC2Parameters.java | 9 private int bits; field in class:RC2Parameters
19 int bits)
22 this.bits = bits;
34 return bits;
|
| /external/giflib/ |
| gif_hash.h | 35 #define HT_SIZE 8192 /* 12bits = 4096 or twice as big! */
36 #define HT_KEY_MASK 0x1FFF /* 13bits keys */
37 #define HT_KEY_NUM_BITS 13 /* 13bits keys */
38 #define HT_MAX_KEY 8191 /* 13bits - 1, maximal code possible */
39 #define HT_MAX_CODE 4095 /* Biggest code possible in 12 bits. */
41 /* The 32 bits of the long are divided into two parts for the key & code: */
42 /* 1. The code is 12 bits as our compression algorithm is limited to 12bits */
43 /* 2. The key is 12 bits Prefix code + 8 bit new char or 20 bits. *
[all...] |
| /bionic/libm/src/ |
| s_ceill.c | 36 uint64_t o = u.bits.manh; \
37 u.bits.manh += (c); \
38 if (u.bits.manh < o) \
39 u.bits.exp++; \
44 uint64_t o = u.bits.manh; \
45 u.bits.manh += (c); \
46 if (u.bits.manh < o) { \
47 u.bits.exp++; \
48 u.bits.manh |= 1llu << (LDBL_MANH_SIZE - 1); \
59 int e = u.bits.exp - LDBL_MAX_EXP + 1
[all...] |
| s_floorl.c | 36 uint64_t o = u.bits.manh; \
37 u.bits.manh += (c); \
38 if (u.bits.manh < o) \
39 u.bits.exp++; \
44 uint64_t o = u.bits.manh; \
45 u.bits.manh += (c); \
46 if (u.bits.manh < o) { \
47 u.bits.exp++; \
48 u.bits.manh |= 1llu << (LDBL_MANH_SIZE - 1); \
59 int e = u.bits.exp - LDBL_MAX_EXP + 1
[all...] |
| s_nextafterl.c | 44 if ((ux.bits.exp == 0x7fff &&
45 ((ux.bits.manh&~LDBL_NBIT)|ux.bits.manl) != 0) ||
46 (uy.bits.exp == 0x7fff &&
47 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl) != 0))
51 ux.bits.manh = 0; /* return +-minsubnormal */
52 ux.bits.manl = 1;
53 ux.bits.sign = uy.bits.sign
[all...] |
| /frameworks/base/core/java/com/android/internal/util/ |
| BitwiseOutputStream.java | 32 // The current position offset, in bits, from the msb in byte 0.
73 * @param bits additional bits to be accommodated
75 private void possExpand(int bits) {
76 if ((mPos + bits) < mEnd) return;
77 byte[] newBuf = new byte[(mPos + bits) >>> 2];
88 * @param bits the amount of data to write (gte 0, lte 8)
89 * @param data to write, will be masked to expose only bits param from lsb
91 public void write(int bits, int data) throws AccessException {
92 if ((bits < 0) || (bits > 8))
[all...] |
| BitwiseInputStream.java | 32 // The current position offset, in bits, from the msb in byte 0.
71 * @param bits the amount of data to read (gte 0, lte 8)
74 public int read(int bits) throws AccessException {
76 int offset = 16 - (mPos & 0x07) - bits; // &7==%8
77 if ((bits < 0) || (bits > 8) || ((mPos + bits) > mEnd)) {
79 "(pos " + mPos + ", end " + mEnd + ", bits " + bits + ")");
84 data &= (-1 >>> (32 - bits));
[all...] |
| /external/dropbear/libtomcrypt/src/prngs/ |
| rng_make_prng.c | 15 portable way to get secure random bits to feed a PRNG (Tom St Denis)
20 @param bits Number of bits of entropy desired (64 ... 1024)
26 int rng_make_prng(int bits, int wprng, prng_state *prng,
39 if (bits < 64 || bits > 1024) {
47 bits = ((bits/8)+((bits&7)!=0?1:0)) * 2;
48 if (rng_get_bytes(buf, (unsigned long)bits, callback) != (unsigned long)bits)
[all...] |
| /external/speex/include/speex/ |
| speex_bits.h | 51 int nbBits; /**< Total number of bits stored in the stream*/
62 void speex_bits_init(SpeexBits *bits);
65 void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size);
67 /** Sets the bits in a SpeexBits struct to use data from an existing buffer (for decoding without copying data) */
68 void speex_bits_set_bit_buffer(SpeexBits *bits, void *buff, int buf_size);
71 void speex_bits_destroy(SpeexBits *bits);
73 /** Resets bits to initial value (just after initialization, erasing content)*/
74 void speex_bits_reset(SpeexBits *bits);
77 void speex_bits_rewind(SpeexBits *bits);
80 void speex_bits_read_from(SpeexBits *bits, char *bytes, int len)
[all...] |
| /external/kernel-headers/original/linux/ |
| nodemask.h | 22 * void nodes_setall(mask) set all bits
23 * void nodes_clear(mask) clear all bits
36 * int nodes_empty(mask) Is mask empty (no bits sets)?
37 * int nodes_full(mask) Is mask full (all bits sets)?
38 * int nodes_weight(mask) Hamming weight - number of set bits
49 * NODE_MASK_ALL Initializer - all bits set
50 * NODE_MASK_NONE Initializer - no bits set
88 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
94 set_bit(node, dstp->bits);
100 clear_bit(node, dstp->bits);
[all...] |
| /external/iptables/extensions/ |
| libipt_tos.man | 1 This module matches the 8 bits of Type of Service field in the IP
2 header (ie. including the precedence bits).
|
| /external/qemu/distrib/zlib-1.2.3/ |
| inftrees.h | 14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bits in this part of the code * member in struct:__anon4526
[all...] |
