| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| strtof.c | 42 ULong bits[1]; local
52 k = strtodg(s, sp, fpi, &exp, bits);
61 u.L[0] = (bits[0] & 0x7fffff) | ((exp + 0x7f + 23) << 23);
65 u.L[0] = bits[0];
|
| strtord.c | 36 ULtod(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
38 ULtod(ULong *L, ULong *bits, Long exp, int k)
48 L[_1] = bits[0];
49 L[_0] = bits[1];
54 L[_1] = bits[0];
55 L[_0] = (bits[1] & ~0x100000) | ((exp + 0x3ff + 52) << 20);
83 ULong bits[2]; local
93 k = strtodg(s, sp, fpi, &exp, bits);
94 ULtod((ULong*)d, bits, exp, k)
[all...] |
| strtorQ.c | 54 ULtoQ(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
56 ULtoQ(ULong *L, ULong *bits, Long exp, int k)
67 L[_3] = bits[0];
68 L[_2] = bits[1];
69 L[_1] = bits[2];
70 L[_0] = (bits[3] & ~0x10000) | ((exp + 0x3fff + 112) << 16);
74 L[_3] = bits[0];
75 L[_2] = bits[1];
76 L[_1] = bits[2]
107 ULong bits[4]; local
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_nan.c | 42 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
54 int bitpos; /* index into words (in bits) */
66 /* Scan backwards, filling in the bits in words[] as we go. */
83 uint32_t bits[2]; member in union:__anon1073
86 _scan_nan(u.bits, 2, s);
88 u.bits[1] |= 0x7ff80000;
90 u.bits[0] |= 0x7ff80000;
100 uint32_t bits[1]; member in union:__anon1074
103 _scan_nan(u.bits, 1, s);
104 u.bits[0] |= 0x7fc00000
[all...] |
| /external/aac/libMpegTPEnc/src/ |
| tpenc_adif.cpp | 160 int bits = 0; local
162 bits += 8*4; /* ADIF ID */
164 bits += 1; /* Copyright present */
167 bits += 72; /* Copyright ID */
169 bits += 26;
171 bits += 4; /* Number of PCE's */
174 bits += 20;
178 bits = transportEnc_GetPCEBits(adif->cm, 0, bits);
180 return bits;
[all...] |
| /external/chromium_org/base/ |
| bits.h | 14 namespace bits { namespace in namespace:base
44 } // namespace bits
|
| /external/chromium_org/content/browser/indexed_db/ |
| indexed_db_value.h | 24 bits.swap(value.bits);
28 bool empty() const { return bits.empty(); }
30 bits.clear();
35 return bits.size() + blob_info.size() * sizeof(IndexedDBBlobInfo);
38 std::string bits; member in struct:content::IndexedDBValue
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_mpi.c | 65 int bits; local
70 bits=BN_num_bits(a);
71 num=(bits+7)/8;
72 if (bits > 0)
74 ext=((bits & 0x07) == 0);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/bin/tests/ |
| bin-rip.asm | 0 bits 64
1 bits 64 label
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/objfmts/win64/tests/ |
| win64-dataref2.asm | 0 bits 64
1 bits 64 label
|
| /external/chromium_org/ui/base/dragdrop/ |
| drag_utils_win.cc | 42 // responsibility to release the |bits| buffer.
47 void* bits; local
50 DIB_RGB_COLORS, &bits, NULL, 0);
51 if (!bitmap || !bits)
56 bits, sk_bitmap.getPixels(), sk_bitmap.height() * sk_bitmap.rowBytes());
|
| /external/chromium_org/v8/test/cctest/ |
| test-double.cc | 58 // The 52 mantissa bits, plus the implicit 1 in bit 52 as a UINT64.
98 uint64_t bits = V8_2PART_UINT64_C(0x000FFFFF, FFFFFFFF); local
99 CHECK(Double(bits).IsDenormal());
100 bits = V8_2PART_UINT64_C(0x00100000, 00000000);
101 CHECK(!Double(bits).IsDenormal());
109 uint64_t bits = V8_2PART_UINT64_C(0xFFF12345, 00000000); local
110 CHECK(Double(bits).IsSpecial());
|
| /external/eigen/doc/special_examples/ |
| Tutorial_sparse_example_details.cpp | 39 Eigen::Array<unsigned char,Eigen::Dynamic,Eigen::Dynamic> bits = (x*255).cast<unsigned char>(); local
40 QImage img(bits.data(), n,n,QImage::Format_Indexed8);
|
| /external/elfutils/0.153/libdwfl/ |
| dwfl_module_register_names.c | 58 int bits, int type);
82 int bits = -1; local
85 &prefix, &setname, &bits, &type);
95 result = (*func) (arg, regno, setname, prefix, name, bits, type);
|
| /external/guava/guava/src/com/google/common/hash/ |
| HashFunction.java | 37 * length (given by {@link #bits}). For example, {@link Hashing#sha1} produces a
38 * 160-bit number, while {@link Hashing#murmur3_32()} yields only 32 bits. Because a
71 * hash code's bits as possible. The result is that, for example, when choosing a
72 * bucket in a hash table of size 2^8, <i>any</i> eight bits could be consistently
113 * <p>Java's baked-in concept of hash codes is constrained to 32 bits, and provides no
193 * Returns the number of bits (a multiple of 32) that each hash code produced by this
196 int bits(); method in interface:HashFunction
|
| /external/openssl/crypto/bn/ |
| bn_mpi.c | 65 int bits; local
70 bits=BN_num_bits(a);
71 num=(bits+7)/8;
72 if (bits > 0)
74 ext=((bits & 0x07) == 0);
|
| /external/pixman/demos/ |
| clip-in.c | 19 uint32_t *bits = malloc (WIDTH * HEIGHT * 4); local
28 pixman_image_t *dest_img = pixman_image_create_bits (PIXMAN_a8r8g8b8, WIDTH, HEIGHT, bits, 4 * WIDTH);
30 memset (bits, 0xff, WIDTH * HEIGHT * 4);
47 free (bits);
|
| trap-test.c | 18 uint32_t *bits = malloc (WIDTH * HEIGHT * 4); local
22 memset (bits, 0xff, WIDTH * HEIGHT * 4);
34 dest_img = pixman_image_create_bits (PIXMAN_a8r8g8b8, WIDTH, HEIGHT, bits, WIDTH * 4);
46 free (bits);
|
| tri-test.c | 25 uint32_t *bits = malloc (WIDTH * HEIGHT * 4); local
29 bits[i] = (i / HEIGHT) * 0x01010000;
32 dest_img = pixman_image_create_bits (PIXMAN_a8r8g8b8, WIDTH, HEIGHT, bits, WIDTH * 4);
45 free (bits);
|
| /external/pixman/test/ |
| a1-trap-test.c | 18 uint32_t *bits = malloc (WIDTH * HEIGHT * 4); local
22 memset (bits, 0xff, WIDTH * HEIGHT * 4);
36 PIXMAN_a8r8g8b8, WIDTH, HEIGHT, bits, WIDTH * 4);
44 assert (bits[0] == 0xffff0000);
45 assert (bits[1] == 0xffffffff);
46 assert (bits[1 * WIDTH + 0] == 0xffffffff);
47 assert (bits[1 * WIDTH + 1] == 0xffffffff);
|
| /libcore/luni/src/main/native/ |
| java_lang_Double.cpp | 28 uint64_t bits; member in union:Double
35 return d.bits;
40 d.bits = val;
|
| java_lang_Float.cpp | 28 unsigned int bits; member in union:Float
35 return f.bits;
40 f.bits = val;
|
| /dalvik/dexgen/src/com/android/dexgen/rop/cst/ |
| CstDouble.java | 39 * @param bits the {@code double} value as {@code long} bits
41 public static CstDouble make(long bits) {
46 return new CstDouble(bits);
52 * @param bits the {@code double} value as {@code long} bits
54 private CstDouble(long bits) {
55 super(bits);
61 long bits = getLongBits(); local
62 return "double{0x" + Hex.u8(bits) + " / "
[all...] |
| CstFloat.java | 40 * @param bits the {@code float} value as {@code int} bits
42 public static CstFloat make(int bits) {
47 return new CstFloat(bits);
53 * @param bits the {@code float} value as {@code int} bits
55 private CstFloat(int bits) {
56 super(bits);
62 int bits = getIntBits(); local
63 return "float{0x" + Hex.u4(bits) + " / "
[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...] |
