| /device/linaro/bootloader/edk2/StdLib/LibC/gdtoa/ |
| ldtoa.c | 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
70 int be, kind;
local
77 be = (int)(u.extu_ext.ext_exp - (LDBL_MAX_EXP - 1) - (LDBL_MANT_DIG - 1));
93 be++;
106 ret = gdtoa(&fpi, be, (ULong *)bits, &kind, mode, ndigits, decpt, rve);
|
| dtoa.c | 16 not be used in advertising or publicity pertaining to
22 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
50 * 3. Under the assumption that input will be rounded nearest,
111 ndigits can be negative.
127 int bbits, b2, b5, be, dig, i, ieps, ilim0,
local
200 b = d2b(dval(d), &be, &bbits);
226 * We want k to be too large rather than too small.
249 i = bbits + be + (Bias + (P-1) - 1);
441 if (be >= 0 && k <= Int_max) {
454 /* If FLT_ROUNDS == 2, L will usually be high by 1 */
[all...] |
| gdtoa.c | 6 The full text of the license may be found at
25 not be used in advertising or publicity pertaining to
31 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
59 ULong *be, *x, *x0;
local
74 be = bits + (((unsigned int)nbits - 1) >> kshift);
81 } while(++bits <= be);
108 * 3. Under the assumption that input will be rounded nearest,
131 (FPI *fpi, int be, ULong *bits, int *kindp, int mode, int ndigits, int *decpt, char **rve)
151 ndigits can be negative.
205 be0 = be;
[all...] |
| /external/annotation-tools/scene-lib/src/annotations/toys/ |
| SimplerAnnotation.java | 6 BalanceEnum be(); method in interface:SimplerAnnotation
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| ldtoa.c | 18 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
61 int be, kind; local
75 be = p->ext_exp - (LDBL_MAX_EXP - 1) - (LDBL_MANT_DIG - 1);
90 be++;
102 ret = gdtoa(&fpi, be, vbits, &kind, mode, ndigits, decpt, rve);
|
| dtoa.c | 14 not be used in advertising or publicity pertaining to
20 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
47 * 3. Under the assumption that input will be rounded nearest,
102 ndigits can be negative.
118 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local
200 b = d2b(dval(&d), &be, &bbits);
226 * We want k to be too large rather than too small.
249 i = bbits + be + (Bias + (P-1) - 1);
442 if (be >= 0 && k <= Int_max) {
455 /* If FLT_ROUNDS == 2, L will usually be high by 1 *
[all...] |
| gdtoa.c | 14 not be used in advertising or publicity pertaining to
20 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
43 ULong *be, *x, *x0; local
58 be = bits + ((nbits - 1) >> kshift);
65 } while(++bits <= be);
92 * 3. Under the assumption that input will be rounded nearest,
116 (fpi, be, bits, kindp, mode, ndigits, decpt, rve)
117 FPI *fpi; int be; ULong *bits;
120 (FPI *fpi, int be, ULong *bits, int *kindp, int mode, int ndigits, int *decpt, char **rve)
128 be = exponent: value = (integer represented by bits) * (2 to the power of be)
[all...] |
| /external/syslinux/com32/sysdump/ |
| main.c | 34 static void dump_all(struct upload_backend *be, const char *argv[])
36 cpio_init(be, argv);
38 cpio_writefile(be, "sysdump", version, sizeof version-1);
40 dump_memory_map(be);
41 dump_memory(be);
42 dump_dmi(be);
43 dump_acpi(be);
44 dump_cpuid(be);
45 dump_pci(be);
46 dump_vesa_tables(be);
62 struct upload_backend **bep, *be; local
73 struct upload_backend **bep, *be; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| encodeintra.c | 5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
48 BLOCK *be = &x->block[ib]; local
58 vp8_subtract_b(be, b, 16);
60 x->short_fdct4x4(be->src_diff, be->coeff, 32);
62 x->quantize_b(be, b);
|
| /prebuilts/tools/common/m2/repository/org/apache/ant/ant-testutil/1.8.2/ |
| ant-testutil-1.8.2.jar | |
| /external/libvpx/libvpx/vp8/encoder/mips/msa/ |
| encodeopt_msa.c | 5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
42 BLOCK *be; local
59 be = &mb->block[2 * loop_cnt];
61 coeff_ptr = be->coeff;
69 be = &mb->block[2 * loop_cnt + 1];
71 coeff_ptr = be->coeff;
108 BLOCK *be; local
119 be = &mb->block[loop_cnt]
[all...] |
| /external/ppp/pppd/plugins/pppoatm/ |
| pppoatm.c | 110 struct atm_backend_ppp be; local
111 be.backend_num = ATM_BACKEND_PPP;
113 be.encaps = PPPOATM_ENCAPS_VC;
115 be.encaps = PPPOATM_ENCAPS_LLC;
117 be.encaps = PPPOATM_ENCAPS_AUTODETECT;
118 if (ioctl(fd, ATM_SETBACKEND, &be) < 0)
125 atm_backend_t be = ATM_BACKEND_RAW;
127 (void) ioctl(fd, ATM_SETBACKEND, &be);
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| TreeTraverserTest.java | 109 static final BinaryTree be = new BinaryTree('e', null, bf); field in class:TreeTraverserTest
110 static final BinaryTree bd = new BinaryTree('d', bb, be);
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| TreeTraverserTest.java | 111 static final BinaryTree be = new BinaryTree('e', null, bf); field in class:TreeTraverserTest
112 static final BinaryTree bd = new BinaryTree('d', bb, be);
|
| /external/swiftshader/third_party/LLVM/lib/MC/ |
| MCELFStreamer.cpp | 122 // In the future it might be worth trying to make these operations more well
225 // FIXME: Should this be caught and done earlier?
288 const MCBinaryExpr *be = cast<MCBinaryExpr>(expr); local
289 fixSymbolsInTLSFixups(be->getLHS());
290 fixSymbolsInTLSFixups(be->getRHS());
|
| /external/webrtc/webrtc/modules/audio_processing/aec/ |
| aec_resampler.c | 5 * that can be found in the LICENSE file in the root of the source
6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
74 float be, tnew; local
89 be = 1 + skew;
95 tnew = be * mm + obj->position;
104 tnew = be * mm + obj->position;
109 obj->position += (*size_out) * be - size;
|
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/internal/ |
| diyfp.h | 139 const uint64_t be = (e == kDpDenormalExponent && (f & kDpHiddenBit) == 0) ? 0 : local
141 u.u64 = (f & kDpSignificandMask) | (be << kDpSignificandSize);
224 double dk = (-61 - e) * 0.30102999566398114 + 347; // dk must be positive, so can do ceiling in positive
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| AbsoluteLayoutRule.java | 105 Rect be = elements[0].getBounds(); local
107 if (be.isValid()) {
111 int offsetX = x - be.x + (feedback.dragBounds != null ? feedback.dragBounds.x : 0);
112 int offsetY = y - be.y + (feedback.dragBounds != null ? feedback.dragBounds.y : 0);
172 Rect be = element.getBounds();
187 if (be.isValid()) {
188 offset = new Point(x - be.x, y - be.y);
190 } else if (offset != null && be.isValid()) {
191 x = offset.x + be.x
[all...] |
| /build/soong/python/ |
| python_test.go | 44 "pkg_path: %q must be a relative path contained in par file."
48 "found two files to be placed at the same runfiles location %q." +
|
| /packages/apps/Settings/src/com/android/settings/fuelgauge/ |
| BatteryEntry.java | 75 BatteryEntry be; local
84 be = mRequestQueue.remove(0);
86 be.loadNameAndIcon();
|
| /external/clang/test/CodeGenCXX/ |
| dynamic-cast-hint.cpp | 45 volatile E *be = dynamic_cast<E *>(b); local
|
| /external/e2fsprogs/lib/ext2fs/ |
| crc32c.c | 903 uint32_t be, le; local
[all...] |
| /external/fio/ |
| libfio.c | 14 * This program is distributed in the hope that it will be useful,
322 int le = 0, be = 0; local
326 be = 1;
331 if (be)
340 if (!le && !be)
352 * We need these to be properly 64-bit aligned, otherwise we
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| TailoredSet.java | 30 * Every mapping in the tailoring needs to be compared to the base,
35 * It might be simpler to re-parse the rule string, but:
74 // Also, ICU4C requires handleCE32() to be public because it is used by the callback
147 // They might be useful for saving space,
165 // We might be comparing a tailoring CE which is a copy of
244 Entry te = null, be = null; local
257 be = basePrefixes.next();
258 bp = be.chars.toString();
260 be = null;
276 assert (be != null)
301 Entry te = null, be = null; local
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| TailoredSet.java | 29 * Every mapping in the tailoring needs to be compared to the base,
34 * It might be simpler to re-parse the rule string, but:
72 // Also, ICU4C requires handleCE32() to be public because it is used by the callback
145 // They might be useful for saving space,
163 // We might be comparing a tailoring CE which is a copy of
242 Entry te = null, be = null; local
255 be = basePrefixes.next();
256 bp = be.chars.toString();
258 be = null;
274 assert (be != null)
299 Entry te = null, be = null; local
[all...] |
