HomeSort by relevance Sort by last modified time
    Searched defs:by (Results 1 - 25 of 51) sorted by null

1 2 3

  /external/clang/test/Modules/Inputs/include_next/y/
b.h 1 enum { by = 4 }; enumerator in enum:__anon17578
  /external/libaom/libaom/av1/common/
cdef_block.h 39 uint8_t by; member in struct:__anon26488
cdef_block.c 35 "predicted" block where each pixel is replaced by the average along a line
46 /* Instead of dividing by n between 2 and 8, we multiply by 3*5*7*8/n.
104 /* We'd normally divide by 840, but dividing by 1024 is close enough
184 int by; local
201 by = dlist[bi].by;
208 in[((by << bsizey) + iy) * CDEF_BSTRIDE + (bx << bsizex) + ix];
216 by = dlist[bi].by
    [all...]
  /external/lzma/CPP/7zip/UI/FileManager/
ComboDialog.cpp 46 int bx1, bx2, by; local
47 GetItemSizes(IDCANCEL, bx1, by);
48 GetItemSizes(IDOK, bx2, by);
49 int y = ySize - my - by;
54 MoveItem(IDCANCEL, x, y, bx1, by);
55 MoveItem(IDOK, x - mx - bx2, y, bx2, by);
  /external/skia/tests/
PathOpsSimplifyDegenerateThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
17 int by = state.fB >> 2; local
37 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by));
46 pathStr.appendf(" path.lineTo(%d, %d);\n", bx, by);
74 int by = b >> 2; local
78 bool abcIsATriangle = (bx - ax) * (cy - ay) != (by - ay) * (cx - ax);
PathOpsSimplifyTrianglesThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
18 int by = state.fB >> 2; local
40 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by));
49 pathStr.appendf(" path.lineTo(%d, %d);\n", bx, by);
79 int by = b >> 2; local
86 if ((bx - ax) * (cy - ay) == (by - ay) * (cx - ax)) {
PathOpsSimplifyQuadThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
21 int by = state.fB >> 2; local
41 path.quadTo(SkIntToScalar(bx), SkIntToScalar(by),
55 pathStr.appendf(" path.quadTo(%d, %d, %d, %d);\n", bx, by, cx, cy);
PathOpsSimplifyQuadralateralsThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
21 int by = state.fB >> 2; local
41 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by));
55 pathStr.appendf(" path.lineTo(%d, %d);\n", bx, by);
PathOpsQuadLineIntersectionThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
72 // find a point on a quad by choosing a t from 0 to 1
84 int by = state.fB >> 2; local
87 QuadPts q = {{{(double) ax, (double) ay}, {(double) bx, (double) by},
  /external/skqp/tests/
PathOpsSimplifyDegenerateThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
17 int by = state.fB >> 2; local
37 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by));
46 pathStr.appendf(" path.lineTo(%d, %d);\n", bx, by);
74 int by = b >> 2; local
78 bool abcIsATriangle = (bx - ax) * (cy - ay) != (by - ay) * (cx - ax);
PathOpsSimplifyTrianglesThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
18 int by = state.fB >> 2; local
40 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by));
49 pathStr.appendf(" path.lineTo(%d, %d);\n", bx, by);
79 int by = b >> 2; local
86 if ((bx - ax) * (cy - ay) == (by - ay) * (cx - ax)) {
PathOpsSimplifyQuadThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
21 int by = state.fB >> 2; local
41 path.quadTo(SkIntToScalar(bx), SkIntToScalar(by),
55 pathStr.appendf(" path.quadTo(%d, %d, %d, %d);\n", bx, by, cx, cy);
PathOpsSimplifyQuadralateralsThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
21 int by = state.fB >> 2; local
41 path.lineTo(SkIntToScalar(bx), SkIntToScalar(by));
55 pathStr.appendf(" path.lineTo(%d, %d);\n", bx, by);
PathOpsQuadLineIntersectionThreadedTest.cpp 4 * Use of this source code is governed by a BSD-style license that can be
72 // find a point on a quad by choosing a t from 0 to 1
84 int by = state.fB >> 2; local
87 QuadPts q = {{{(double) ax, (double) ay}, {(double) bx, (double) by},
  /build/make/common/
strings.mk 10 # Unless required by applicable law or agreed to in writing, software
110 define uniq-pairs-by-first-component
  /external/skia/src/core/
SkSafeMath.h 4 * Use of this source code is governed by a BSD-style license that can be
73 uint64_t by = y; local
74 uint64_t result = bx * by;
  /external/skqp/src/core/
SkSafeMath.h 4 * Use of this source code is governed by a BSD-style license that can be
73 uint64_t by = y; local
74 uint64_t result = bx * by;
  /external/skia/src/pathops/
SkPathOpsConic.cpp 4 * Use of this source code is governed by a BSD-style license that can be
158 double by = 2 * dy - (ay + cy) / 2; local
163 SkDConic dst = {{{{ax / az, ay / az}, {bx / bz, by / bz}, {cx / cz, cy / cz}}
  /external/skqp/src/pathops/
SkPathOpsConic.cpp 4 * Use of this source code is governed by a BSD-style license that can be
158 double by = 2 * dy - (ay + cy) / 2; local
163 SkDConic dst = {{{{ax / az, ay / az}, {bx / bz, by / bz}, {cx / cz, cy / cz}}
  /cts/tests/tests/renderscript/src/android/renderscript/cts/
YuvTest.java 10 * Unless required by applicable law or agreed to in writing, software
25 byte [] by; field in class:YuvTest
62 by = new byte[w*h];
66 for (int i=0; i < by.length; i++) {
67 by[i] = (byte)r.nextInt(256);
81 ay.copyFrom(by);
105 tmp[i++] = by[j];
156 tmp[i++] = by[j];
207 tmp[i++] = by[j];
259 tmp[i++] = by[j]
    [all...]
  /cts/tests/tests/rscpp/src/android/cts/rscpp/
RSYuvTest.java 10 * Unless required by applicable law or agreed to in writing, software
33 byte [] by; field in class:RSYuvTest
52 by = new byte[w*h];
56 for (int i=0; i < by.length; i++) {
57 by[i] = (byte)r.nextInt(256);
71 ay.copyFrom(by);
91 tmp[i++] = by[j];
130 tmp[i++] = by[j];
169 tmp[i++] = by[j];
  /external/mesa3d/src/gallium/state_trackers/xvmc/tests/
test_rendering.c 149 int mbx, mby, bx, by; local
216 for (by = 0; by < MACROBLOCK_HEIGHT_IN_BLOCKS; ++by)
233 for (by = 0; by < MACROBLOCK_HEIGHT_IN_BLOCKS / 2; ++by)
  /external/pdfium/third_party/libopenjpeg20/
mct.c 27 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
227 const __m128i by = _mm_set1_epi32(934); local
266 lo = _mm_mul_epi32(lo, by);
267 hi = _mm_mul_epi32(hi, by);
  /external/skia/src/gpu/ccpr/
GrCCFiller.cpp 4 * Use of this source code is governed by a BSD-style license that can be
28 // Batches decide what to draw by looking where the previous one ended. Define initial batches
29 // that "end" at the beginning of the data. These will not be drawn, but will only be be read by
189 float by = vertices[i].fPos.fY - vertices[i + 2].fPos.fY; local
190 float wind = ax*by - ay*bx;
299 // megabuffer and lay them all out side-by-side. We can offset the "baseInstance" parameter in
  /external/skqp/src/gpu/ccpr/
GrCCFiller.cpp 4 * Use of this source code is governed by a BSD-style license that can be
28 // Batches decide what to draw by looking where the previous one ended. Define initial batches
29 // that "end" at the beginning of the data. These will not be drawn, but will only be be read by
189 float by = vertices[i].fPos.fY - vertices[i + 2].fPos.fY; local
190 float wind = ax*by - ay*bx;
299 // megabuffer and lay them all out side-by-side. We can offset the "baseInstance" parameter in

Completed in 350 milliseconds

1 2 3