/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicLineSegments.cpp | 34 double maxY = SkTMax(hodo2[1].y, hodo2[1].y); local 35 double dist = sqrt(maxX * maxX + maxY * maxY);
|
H A D | TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY; local 23 minX = maxX = minY = maxY = 0; 34 if (cubic[maxY].y < cubic[index].y) { 35 maxY = index; 39 && approximately_equal(cubic[maxY].y, cubic[minY].y);
|
H A D | QuadraticReduceOrder.cpp | 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { 87 bool useX = quad[maxX].x - quad[minX].x >= quad[maxY].y - quad[minY].y; 143 int index, minX, maxX, minY, maxY; local 145 minX = maxX = minY = maxY = 0; 157 if (quad[maxY].y < quad[index].y) { 158 maxY = index; 178 int result = check_linear(quad, reduceStyle, minX, maxX, minY, maxY, reduction); 66 check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, int minX, int maxX, int minY, int maxY, Quadratic& reduction) argument
|
/external/skia/experimental/Intersection/ |
H A D | CubicLineSegments.cpp | 34 double maxY = SkTMax(hodo2[1].y, hodo2[1].y); local 35 double dist = sqrt(maxX * maxX + maxY * maxY);
|
H A D | TestUtilities.cpp | 22 int index, minX, maxX, minY, maxY; local 23 minX = maxX = minY = maxY = 0; 34 if (cubic[maxY].y < cubic[index].y) { 35 maxY = index; 39 && approximately_equal(cubic[maxY].y, cubic[minY].y);
|
H A D | QuadraticReduceOrder.cpp | 67 int minX, int maxX, int minY, int maxY, Quadratic& reduction) { 87 bool useX = quad[maxX].x - quad[minX].x >= quad[maxY].y - quad[minY].y; 143 int index, minX, maxX, minY, maxY; local 145 minX = maxX = minY = maxY = 0; 157 if (quad[maxY].y < quad[index].y) { 158 maxY = index; 178 int result = check_linear(quad, reduceStyle, minX, maxX, minY, maxY, reduction); 66 check_linear(const Quadratic& quad, ReduceOrder_Styles reduceStyle, int minX, int maxX, int minY, int maxY, Quadratic& reduction) argument
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderRegion.cpp | 79 LayoutUnit maxY = isLastPortion ? std::max(flowThreadPortionRect.maxY(), flowThreadOverflow.maxY()) : flowThreadPortionRect.maxY(); local 82 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY); 87 LayoutUnit maxY = std::max(flowThreadPortionRect.y(), (flowThreadOverflow.maxY())); local 88 clipRect = LayoutRect(minX, minY, maxX - minX, maxY - minY);
|
H A D | RenderOverflow.h | 83 LayoutUnit maxY = std::max(rect.maxY(), m_layoutOverflow.maxY()); local 88 m_layoutOverflow.setHeight(maxY - minY); 90 m_layoutOverflow.setY(maxY - m_layoutOverflow.height()); 96 LayoutUnit maxY = std::max(rect.maxY(), m_visualOverflow.maxY()); local 100 m_visualOverflow.setHeight(maxY - m_visualOverflow.y());
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
H A D | RasterShape.h | 73 int maxY() const { return -m_offset + m_intervals.size(); } function in class:blink::RasterShapeIntervals
|
H A D | RasterShape.cpp | 82 for (int y = bounds().y(); y < bounds().maxY(); ++y) { 89 int marginY1 = std::min(maxY(), y + shapeMargin + 1); 100 if (marginY < bounds().maxY() && intervalAt(marginY).contains(intervalAtY)) 113 for (int y = minY(); y < maxY(); ++y) { 123 int maxY = bounds().maxY(); local 124 for (int y = bounds().y(); y < maxY; y++) { 130 for (; endY < maxY; endY++) { 162 if (y2 < intervals.bounds().y() || y1 >= intervals.bounds().maxY()) 166 y2 = std::min(y2, intervals.bounds().maxY()); [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkBitmapProcState_matrix_template.h | 29 const unsigned maxY = s.fBitmap->height() - 1; local 30 *xy++ = TileProc::Y(s, SkFractionalIntToFixed(fx), maxY); 93 int maxY = s.fBitmap->height() - 1; local 96 *xy++ = (TileProc::Y(s, SkFractionalIntToFixed(fy), maxY) << 16) | 108 int maxY = s.fBitmap->height() - 1; local 117 *xy++ = (TileProc::Y(s, srcXY[1], maxY) << 16) |
|
H A D | SkBitmapFilter.cpp | 30 const int maxY = s.fBitmap->height(); local 43 int y0 = SkClampMax(SkScalarCeilToInt(srcPt.fY-s.getBitmapFilter()->width()), maxY); 44 int y1 = SkClampMax(SkScalarFloorToInt(srcPt.fY+s.getBitmapFilter()->width()+1), maxY);
|
H A D | SkBitmapProcState_matrix.h | 68 const unsigned maxY = s.fBitmap->height() - 1; local 70 *xy++ = PACK_FILTER_Y_NAME(fy, maxY, s.fFilterOneY PREAMBLE_ARG_Y); 110 unsigned maxY = s.fBitmap->height() - 1; local 113 *xy++ = PACK_FILTER_Y_NAME(fy, maxY, oneY PREAMBLE_ARG_Y); 127 unsigned maxY = s.fBitmap->height() - 1; local 138 *xy++ = PACK_FILTER_Y_NAME(srcXY[1] - (oneY >> 1), maxY,
|
H A D | SkBitmapProcState_shaderproc.h | 40 const unsigned maxY = s.fBitmap->height() - 1; local 42 subY = TILEY_LOW_BITS(fy, maxY); 43 int y0 = TILEY_PROCF(fy, maxY); 44 int y1 = TILEY_PROCF((fy + s.fFilterOneY), maxY);
|
H A D | SkTileGrid.cpp | 46 // hence the "-1"s in the computations of maxX and maxY. 51 int maxY = SkMax32(0, SkMin32((dilatedBounds.bottom() - 1) / fInfo.fTileInterval.height(), local 55 for (int y = minY; y <= maxY; y++) {
|
/external/skia/src/core/ |
H A D | SkBitmapProcState_matrix_template.h | 29 const unsigned maxY = s.fBitmap->height() - 1; local 30 *xy++ = TileProc::Y(s, SkFractionalIntToFixed(fx), maxY); 93 int maxY = s.fBitmap->height() - 1; local 96 *xy++ = (TileProc::Y(s, SkFractionalIntToFixed(fy), maxY) << 16) | 108 int maxY = s.fBitmap->height() - 1; local 117 *xy++ = (TileProc::Y(s, srcXY[1], maxY) << 16) |
|
H A D | SkBitmapFilter.cpp | 30 const int maxY = s.fBitmap->height(); local 42 int y0 = SkClampMax(SkScalarCeilToInt(srcPt.fY-s.getBitmapFilter()->width()), maxY); 43 int y1 = SkClampMax(SkScalarFloorToInt(srcPt.fY+s.getBitmapFilter()->width()+1), maxY);
|
H A D | SkBitmapProcState_matrix.h | 68 const unsigned maxY = s.fBitmap->height() - 1; local 70 *xy++ = PACK_FILTER_Y_NAME(fy, maxY, s.fFilterOneY PREAMBLE_ARG_Y); 110 unsigned maxY = s.fBitmap->height() - 1; local 113 *xy++ = PACK_FILTER_Y_NAME(fy, maxY, oneY PREAMBLE_ARG_Y); 127 unsigned maxY = s.fBitmap->height() - 1; local 138 *xy++ = PACK_FILTER_Y_NAME(srcXY[1] - (oneY >> 1), maxY,
|
H A D | SkBitmapProcState_shaderproc.h | 40 const unsigned maxY = s.fBitmap->height() - 1; local 42 subY = TILEY_LOW_BITS(fy, maxY); 43 int y0 = TILEY_PROCF(fy, maxY); 44 int y1 = TILEY_PROCF((fy + s.fFilterOneY), maxY);
|
/external/chromium_org/android_webview/java/src/org/chromium/android_webview/ |
H A D | OverScrollGlow.java | 48 * @param maxY Maximum range for vertical scrolling 50 public void pullGlow(int x, int y, int oldX, int oldY, int maxX, int maxY) { argument 73 if (maxY > 0 || mHostView.getOverScrollMode() == View.OVER_SCROLL_ALWAYS) { 80 } else if (pulledToY > maxY) {
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | FloatPolygonTest.cpp | 66 static Vector<const FloatPolygonEdge*> sortedOverlappingEdges(const FloatPolygon& polygon, float minY, float maxY) argument 69 polygon.overlappingEdges(minY, maxY, result); 123 EXPECT_EQ(200, triangle.edgeAt(0).maxY()); 125 EXPECT_EQ(200, triangle.edgeAt(1).maxY()); 127 EXPECT_EQ(200, triangle.edgeAt(2).maxY());
|
H A D | Region.cpp | 83 int maxY = (span + 1)->y; local 87 if (maxY <= point.y()) 239 appendSpan(rect.maxY()); 355 int maxY = lastSpan->y; 378 ASSERT(minY <= maxY); 380 return IntRect(minX, minY, maxX - minX, maxY - minY);
|
H A D | FloatBox.h | 112 float maxY = std::max(bottom(), high.y()); local 120 m_height = maxY - minY;
|
H A D | FloatPolygon.h | 63 bool overlappingEdges(float minY, float maxY, Vector<const FloatPolygonEdge*>& result) const; 79 EdgeIntervalTree m_edgeTree; // Each EdgeIntervalTree node stores minY, maxY, and a ("UserData") pointer to a FloatPolygonEdge. 93 float maxY() const { return std::max(vertex1().y(), vertex2().y()); } function in class:blink::VertexPair
|
/external/qemu/distrib/sdl-1.2.15/src/events/ |
H A D | SDL_mouse.c | 106 void SDL_SetMouseRange(int maxX, int maxY) argument 109 SDL_MouseMaxY = (Sint16)maxY;
|