/external/clang/test/Modules/Inputs/include_next/x/subdir/ |
b.h | 2 enum { bx = 3 }; enumerator in enum:__anon9163
|
/external/llvm/test/MC/ARM/ |
dwarf-cfi-initial-state.s | 7 bx lr label
|
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/arm/ |
eabi_attr_1.s | 4 bx lr label
|
/toolchain/binutils/binutils-2.25/ld/testsuite/ld-arm/ |
armv4-bx.s | 6 bx lr label 7 bx r0 label
|
script-type.s | 6 bx lr label 19 bx lr label
|
arm-pic-veneer.s | 13 bx lr label
|
gc-unwind.s | 7 bx lr label 20 bx lr label 33 bx lr label
|
arm-be8.s | 6 bx lr label 11 bx lr label
|
/external/v8/test/webkit/fast/js/kde/ |
eval.js | 33 var bx = b.x // rule out side effects of eval() in shouldBe() test function variable 34 shouldBe("bx", "99");
|
/external/boringssl/src/crypto/poly1305/ |
poly1305_arm_asm.S | 1521 bx lr label 2013 bx lr label [all...] |
/prebuilts/go/darwin-x86/test/ken/ |
slicearray.go | 11 var bx [10]byte var 21 by = bx[0:] 32 by = bx[lb:hb] 34 by = bx[lb:10] 36 by = bx[lb:] 38 by = bx[:hb] 40 by = bx[0:hb] 42 by = bx[0:10] 44 by = bx[0:] 46 by = bx[:10 [all...] |
sliceslice.go | 11 var bx []byte var 23 by = bx[lb:hb] 25 by = bx[lb:10] 27 by = bx[lb:] 29 by = bx[:hb] 31 by = bx[0:hb] 33 by = bx[0:10] 35 by = bx[0:] 37 by = bx[:10] 39 by = bx[: [all...] |
/prebuilts/go/linux-x86/test/ken/ |
slicearray.go | 11 var bx [10]byte var 21 by = bx[0:] 32 by = bx[lb:hb] 34 by = bx[lb:10] 36 by = bx[lb:] 38 by = bx[:hb] 40 by = bx[0:hb] 42 by = bx[0:10] 44 by = bx[0:] 46 by = bx[:10 [all...] |
sliceslice.go | 11 var bx []byte var 23 by = bx[lb:hb] 25 by = bx[lb:10] 27 by = bx[lb:] 29 by = bx[:hb] 31 by = bx[0:hb] 33 by = bx[0:10] 35 by = bx[0:] 37 by = bx[:10] 39 by = bx[: [all...] |
/bionic/libc/arch-mips/string/ |
mips_strlen.c | 43 if ((bx.b.B##__x) == 0) break;\ 111 bitfields_t bx; local 112 bx.v = x;
|
/external/skia/tests/ |
PathOpsSimplifyTrianglesThreadedTest.cpp | 21 int bx = state.fB & 0x03; local 43 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by)); 53 str += sprintf(str, " path.lineTo(%d, %d);\n", bx, by); 82 int bx = b & 0x03; local 90 if ((bx - ax) * (cy - ay) == (by - ay) * (cx - ax)) {
|
PathOpsSimplifyDegenerateThreadedTest.cpp | 20 int bx = state.fB & 0x03; local 40 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by)); 50 str += sprintf(str, " path.lineTo(%d, %d);\n", bx, by); 77 int bx = b & 0x03; local 82 bool abcIsATriangle = (bx - ax) * (cy - ay) != (by - ay) * (cx - ax);
|
PathOpsSimplifyQuadThreadedTest.cpp | 21 int bx = state.fB & 0x03; local 42 path.quadTo(SkIntToScalar(bx), SkIntToScalar(by), 58 str += sprintf(str, " path.quadTo(%d, %d, %d, %d);\n", bx, by, cx, cy);
|
PathOpsSimplifyQuadralateralsThreadedTest.cpp | 21 int bx = state.fB & 0x03; local 42 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by)); 55 str += sprintf(str, " path.lineTo(%d, %d);\n", bx, by);
|
PathOpsQuadLineIntersectionThreadedTest.cpp | 79 int bx = state.fB & 0x03; local 83 SkDQuad quad = {{{(double) ax, (double) ay}, {(double) bx, (double) by},
|
/bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
dmisc.c | 117 ULong *bx, *bxe, q, *sx, *sxe; local 136 bx = b->x; 137 bxe = bx + n; 150 y = *bx - (ys & 0xffffffffUL) - borrow; 152 *bx++ = y & 0xffffffffUL; 159 y = (*bx & 0xffff) - (ys & 0xffff) - borrow; 161 z = (*bx >> 16) - (zs & 0xffff) - borrow; 163 Storeinc(bx, z, y); 167 y = *bx - (ys & 0xffff) - borrow; 169 *bx++ = y & 0xffff [all...] |
/frameworks/base/core/java/android/gesture/ |
GestureStroke.java | 54 RectF bx = null; local 64 if (bx == null) { 65 bx = new RectF(); 66 bx.top = p.y; 67 bx.left = p.x; 68 bx.right = p.x; 69 bx.bottom = p.y; 73 bx.union(p.x, p.y); 80 boundingBox = bx;
|
/external/boringssl/src/crypto/curve25519/asm/ |
x25519-asm-arm.S | 2118 bx lr label [all...] |
/external/skia/src/pathops/ |
SkPathOpsConic.cpp | 108 = (a + c) / 4 + (bx * unknownW) / 2 153 double bx = 2 * dx - (ax + cx) / 2; local 156 SkDConic dst = {{{{ax / az, ay / az}, {bx / bz, by / bz}, {cx / cz, cy / cz}}},
|
/external/v8/tools/ |
generate-ten-powers.scm | 46 (*bx x (exptbx #z2 (fixnum->bignum by))))) 51 (/bx x (exptbx #z2 (fixnum->bignum by))))) 62 (+bx n 65 (-bx (bit-lshbx #z1 69 (+bx n 74 (exact? (=bx n (bit-lshbx cut shift)))) 75 (if (<=bx cut max-container) 79 (define (rounded-/bx x y) 81 ((down) (/bx x y)) 82 ((up) (+bx (/bx x y) #z1) [all...] |