| /bionic/libm/src/ |
| s_copysignl.c | 40 ux.bits.sign = uy.bits.sign;
|
| s_nan.c | 63 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
75 int bitpos; /* index into words (in bits) */
87 /* Scan backwards, filling in the bits in words[] as we go. */
104 uint32_t bits[2]; member in union:__anon675
107 _scan_nan(u.bits, 2, s);
109 u.bits[1] |= 0x7ff80000;
111 u.bits[0] |= 0x7ff80000;
121 uint32_t bits[1]; member in union:__anon676
124 _scan_nan(u.bits, 1, s);
125 u.bits[0] |= 0x7fc00000
[all...] |
| s_nexttowardf.c | 36 (uy.bits.exp == LDBL_INFNAN_EXP &&
37 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl) != 0))
41 SET_FLOAT_WORD(x,(uy.bits.sign<<31)|1);/* return +-minsubnormal */
|
| /external/elfutils/backends/ |
| i386_regs.c | 40 int *bits, int *type)
49 *bits = 32;
61 *bits = 80;
66 *bits = 128;
71 *bits = 64;
78 *bits = 16;
128 *bits = 16;
131 *bits = 16;
|
| alpha_corenote.c | 41 { .offset = 0, .regno = 0, .count = 31, .bits = 64 }, /* r0-r30 */
42 { .offset = 32 * 8, .regno = 64, .count = 1, .bits = 64 }, /* pc */
43 { .offset = 33 * 8, .regno = 66, .count = 1, .bits = 64 }, /* unique */
49 { .offset = 0, .regno = 32, .count = 32, .bits = 64 }, /* f0-f30, fpcr */
|
| /external/linux-tools-perf/util/include/linux/ |
| types.h | 10 #define DECLARE_BITMAP(name,bits) \
11 unsigned long name[BITS_TO_LONGS(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:__anon10959
[all...] |
| /external/zlib/contrib/infback9/ |
| inftree9.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:__anon15807
[all...] |
| infback9.c | 56 unsigned sym, bits, low, size; local
69 bits = 9;
70 inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
76 bits = 5;
77 inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
94 printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits,
105 printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits,
120 bits = 0; \
143 hold += (unsigned long)(*next++) << bits; \
144 bits += 8;
235 unsigned bits; \/* bits in bit buffer *\/ local
[all...] |
| /external/zlib/ |
| 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:__anon15823
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/gnu/ |
| stubs.h | 4 #include <bits/wordsize.h>
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/gnu/ |
| stubs.h | 4 #include <bits/wordsize.h>
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/gnu/ |
| stubs.h | 4 #include <bits/wordsize.h>
|
| /external/webrtc/src/common_audio/signal_processing/include/ |
| spl_inl.h | 82 int bits; local
85 bits = 16;
87 bits = 0;
89 if (0x0000FF00 & (n >> bits)) bits += 8;
90 if (0x000000F0 & (n >> bits)) bits += 4;
91 if (0x0000000C & (n >> bits)) bits += 2;
92 if (0x00000002 & (n >> bits)) bits += 1
[all...] |
| /external/llvm/lib/Support/ |
| Disassembler.cpp | 49 unsigned bits; local
51 bits = 32;
53 bits = 64;
60 ud_set_mode(&ud_obj, bits);
65 << std::setw(bits/4);
|
| /external/webp/src/dec/ |
| bits.c | 12 #include "bits.h"
62 uint32_t VP8GetValue(VP8BitReader* const br, int bits) {
64 while (bits-- > 0) {
65 v |= VP8GetBit(br, 0x80) << bits;
70 int32_t VP8GetSignedValue(VP8BitReader* const br, int bits) {
71 const int value = VP8GetValue(br, bits);
|
| /external/qemu/distrib/sdl-1.2.12/src/video/bwindow/ |
| SDL_sysmouse.cc | 33 /* Convert bits to padded bytes */
34 #define PADDED_BITS(bits) ((bits+7)/8)
38 char *bits; member in struct:WMcursor
65 cursor->bits = (char *)SDL_malloc(4+2*((allowed_x/8)*allowed_y));
66 if ( cursor->bits == NULL ) {
71 cursor->bits[0] = allowed_y; /* Size of the cursor */
72 cursor->bits[1] = 1; /* Bit depth of cursor */
73 cursor->bits[2] = hot_y;
74 cursor->bits[3] = hot_x
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 50 int bits = checkPositiveAndMakeMultipleOf32(minimumBits); local
52 if (bits == 32) {
54 } else if (bits <= 128) {
58 int hashFunctionsNeeded = (bits + 127) / 128;
150 * If {@code hashCode} has enough bits, returns {@code hashCode.asLong()}, otherwise
155 return (hashCode.bits() < 64) ? UnsignedInts.toLong(hashCode.asInt()) : hashCode.asLong();
223 int bits = iterator.next().bits(); local
224 byte[] resultBytes = new byte[bits / 8];
249 byte[] resultBytes = new byte[iterator.next().bits() / 8]
271 final int bits; field in class:Hashing.ConcatenatedHashFunction
293 public int bits() { method in class:Hashing.ConcatenatedHashFunction
[all...] |
| /external/speex/include/speex/ |
| speex_stereo.h | 71 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
72 void speex_encode_stereo(float *data, int frame_size, SpeexBits *bits);
74 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
75 void speex_encode_stereo_int(spx_int16_t *data, int frame_size, SpeexBits *bits);
84 int speex_std_stereo_request_handler(SpeexBits *bits, void *state, void *data);
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| Bitmap.h | 59 FixedArray<WordType, words> bits; member in class:WTF::Bitmap
71 return !!(bits[n / wordSize] & (one << (n % wordSize)));
77 bits[n / wordSize] |= (one << (n % wordSize));
85 bool result = bits[index] & mask;
86 bits[index] |= mask;
93 bits[n / wordSize] &= ~(one << (n % wordSize));
99 memset(bits.data(), 0, sizeof(bits));
105 if (!~bits[start / wordSize])
139 result += WTF::bitCount(bits[i])
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| bits2prm.cpp | 83 no_of_bits = number of bits associated with value
84 bitstream = pointer to buffer where bits are read
102 Purpose : Read "no_of_bits" bits from the array bitstream[]
119 Word16 no_of_bits, // input : number of bits associated with value
120 Word16 *bitstream // output: address where bits are written
163 Word16 no_of_bits, /* input : number of bits associated with value */
164 Word16 *bitstream /* input: address where bits are read from */
190 bits[] = pointer to serial bits of type Word16
210 the received serial bits in a frame
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| prm2bits.cpp | 92 no_of_bits = number of bits associated with value of type Word16
95 bitstream = pointer to address where bits are written of type Word16
111 PURPOSE: convert integer to binary and write the bits to the array
112 bitstream[]. The most significant bits are written first.
129 Word16 no_of_bits, // input : number of bits associated with value
130 Word16 *bitstream // output: address where bits are written
180 Word16 no_of_bits, /* input : number of bits associated with value */
181 Word16 *bitstream /* output: address where bits are written */
209 bits[] = pointer to serial bits of type Word1
[all...] |
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| pvmp3_crc.cpp | 45 int32 neededBits, number of bits to read from the bit stream
124 int32 neededBits, /* number of bits to read from the bit stream */
128 uint32 bits = getNbits(inputStream, neededBits); local
132 calculate_crc(bits, neededBits, crc);
134 return(bits);
|
| /external/icu4c/test/perf/unisetperf/draft/ |
| bitset.cpp | 86 BitSet(const UnicodeSet &set, UErrorCode &errorCode) : bits(shortBits), restSet(set.clone()) {
133 // Set bits for the start of the range.
150 bits=(int64_t *)uprv_malloc(bitHash->countKeys()*8);
152 if(bits!=NULL) {
153 bitHash->invert(bits);
155 bits=shortBits;
160 latin1Set[0]=(uint32_t)bits[0];
161 latin1Set[1]=(uint32_t)(bits[0]>>32);
162 latin1Set[2]=(uint32_t)bits[1];
163 latin1Set[3]=(uint32_t)(bits[1]>>32)
192 int64_t *bits; member in class:BitSet
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| MiniEnumSet.java | 31 private long bits; field in class:MiniEnumSet
48 * The bits yet to be returned for bits. As values from the current index are returned,
49 * their bits are zeroed out.
51 private long currentBits = bits;
103 bits = 0;
110 long oldBits = bits;
113 bits = newBits;
130 long oldBits = bits;
131 long newBits = oldBits | miniSet.bits;
[all...] |
