/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/ |
polygon.h | 32 struct polygon; 37 struct polygon *polygon_create(int size); 38 struct polygon *polygon_create_from_data(float *data, int size); 39 void polygon_destroy(struct polygon *poly); 41 void polygon_resize(struct polygon *poly, int new_size); 42 int polygon_size(struct polygon *poly); 44 int polygon_vertex_count(struct polygon *poly); 45 float * polygon_data(struct polygon *poly); 47 void polygon_vertex_append(struct polygon *p, 49 void polygon_append_polygon(struct polygon *dst [all...] |
polygon.c | 27 #include "polygon.h" 52 struct polygon struct 70 static void polygon_print(struct polygon *poly) 74 debug_printf("Polygon %p, size = %d\n", poly, poly->num_verts); 84 struct polygon * polygon_create(int size) 86 struct polygon *poly = (struct polygon*)malloc(sizeof(struct polygon)); 97 struct polygon * polygon_create_from_data(float *data, int size) 99 struct polygon *poly = polygon_create(size) [all...] |
bezier.h | 30 struct polygon; 56 struct polygon *bezier_to_polygon(struct bezier *bez); 58 struct polygon *poly);
|
arc.h | 32 struct polygon; 63 struct polygon *poly,
|
path.h | 33 struct polygon;
|
/external/mesa3d/src/gallium/state_trackers/vega/ |
polygon.h | 32 struct polygon; 37 struct polygon *polygon_create(int size); 38 struct polygon *polygon_create_from_data(float *data, int size); 39 void polygon_destroy(struct polygon *poly); 41 void polygon_resize(struct polygon *poly, int new_size); 42 int polygon_size(struct polygon *poly); 44 int polygon_vertex_count(struct polygon *poly); 45 float * polygon_data(struct polygon *poly); 47 void polygon_vertex_append(struct polygon *p, 49 void polygon_append_polygon(struct polygon *dst [all...] |
polygon.c | 27 #include "polygon.h" 52 struct polygon struct 70 static void polygon_print(struct polygon *poly) 74 debug_printf("Polygon %p, size = %d\n", poly, poly->num_verts); 84 struct polygon * polygon_create(int size) 86 struct polygon *poly = (struct polygon*)malloc(sizeof(struct polygon)); 97 struct polygon * polygon_create_from_data(float *data, int size) 99 struct polygon *poly = polygon_create(size) [all...] |
bezier.h | 30 struct polygon; 56 struct polygon *bezier_to_polygon(struct bezier *bez); 58 struct polygon *poly);
|
arc.h | 32 struct polygon; 63 struct polygon *poly,
|
path.h | 33 struct polygon;
|
/frameworks/base/libs/hwui/ |
ShadowTessellator.cpp | 145 * Calculate the centroid of a 2d polygon. 147 * @param poly The polygon, which is represented in a Vector2 array. 148 * @param polyLength The length of the polygon in terms of number of vertices. 149 * @return the centroid of the polygon. 191 * Test whether the polygon is order in clockwise. 193 * @param polygon the polygon as a Vector2 array 194 * @param len the number of points of the polygon 196 bool ShadowTessellator::isClockwise(const Vector2* polygon, int len) { 197 if (len < 2 || polygon == NULL) [all...] |
ShadowTessellator.h | 83 static bool isClockwise(const Vector2* polygon, int len); 99 * @param polygon The vertex array to be reversed. 102 static void reverseVertexArray(Vertex* polygon, int len);
|
SpotShadow.h | 42 int polyLength, const Vector2* polygon, const Vector2& centroid, 93 static void makeClockwise(Vector2* polygon, int len); 94 static void reverse(Vector2* polygon, int len); 103 static bool testConvex(const Vector2* polygon, int polygonLength,
|
SpotShadow.cpp | 26 // When the polygon is about 90 vertices, the penumbra + umbra can reach 270 rays. 27 // That is consider pretty fine tessllated polygon so far. 40 // For the whole polygon, the sum of all the deltas b/t normals is 2 * M_PI, 66 * For each polygon's vertex, the light center will project it to the receiver 141 * @param pointsLength the number of vertices of the polygon. 151 * @param pointsLength the number of vertices of the polygon. 153 * @return the number of points in the polygon 0 if no intersection 229 * @param poly1 The 1st polygon, as a Vector2 array. 230 * @param poly1Length The number of vertices of 1st polygon. 231 * @param poly2 The 2nd and output polygon, as a Vector2 array [all...] |
/external/clang/test/Sema/ |
flexible-array-init.c | 43 struct polygon { struct 47 struct polygon poly = {
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
FloatPolygonTest.cpp | 49 const FloatPolygon& polygon() const { return *m_polygon; } function in class:WebCore::FloatPolygonTestValue 66 static Vector<const FloatPolygonEdge*> sortedOverlappingEdges(const FloatPolygon& polygon, float minY, float maxY) 69 polygon.overlappingEdges(minY, maxY, result); 90 const FloatPolygon& triangle = triangleTestValue.polygon(); 186 const FloatPolygon& triangle = triangleTestValue.polygon(); 213 const FloatPolygon& triangle = triangleTestValue.polygon(); 229 const FloatPolygon& emptyPolygon = emptyPolygonTestValue.polygon(); \ 268 const FloatPolygon& trapezoid = trapezoidTestValue.polygon(); 283 * Test FloatPolygon::contains() with a non-convex rectilinear polygon. The polygon has the same shap [all...] |
FloatPolygon.cpp | 64 static unsigned findNextEdgeVertexIndex(const FloatPolygon& polygon, unsigned vertexIndex1, bool clockwise) 66 unsigned nVertices = polygon.numberOfVertices(); 69 while (vertexIndex2 && areCoincidentPoints(polygon.vertexAt(vertexIndex1), polygon.vertexAt(vertexIndex2))) 74 if (!areCollinearPoints(polygon.vertexAt(vertexIndex1), polygon.vertexAt(vertexIndex2), polygon.vertexAt(vertexIndex3)))
|
FloatPolygon.h | 126 const FloatPolygon* polygon() const { return m_polygon; } function in class:WebCore::FloatPolygonEdge 132 // Edge vertex index1 is less than index2, except the last edge, where index2 is 0. When a polygon edge
|
/external/chromium_org/chrome/browser/ui/views/ |
dropdown_bar_host.cc | 218 // |w| is used to make it easier to create the part of the polygon that curves 227 // This polygon array represents the outline of the background image for the 230 const Path::Point polygon[] = { local 236 // Find the largest x and y value in the polygon. 238 for (size_t i = 0; i < arraysize(polygon); i++) { 239 max_x = std::max(max_x, static_cast<int>(polygon[i].x)); 240 max_y = std::max(max_y, static_cast<int>(polygon[i].y)); 243 // We then create the polygon and use SetWindowRgn to force the window to draw 245 Path path(polygon, arraysize(polygon)); [all...] |
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
QuickDraw_Graphics_Suite.py | 160 class polygon(aetools.ComponentItem): class in inherits:aetools.ComponentItem 161 """polygon - A polygon """ 164 """point list - the list of points that define the polygon """ 168 polygons = polygon 286 polygon._superclassnames = [] 287 polygon._privpropdict = { 290 polygon._privelemdict = { 365 'cpgn' : polygon,
|
/external/chromium_org/third_party/WebKit/Source/core/css/ |
BasicShapeFunctions.cpp | 96 const BasicShapePolygon* polygon = static_cast<const BasicShapePolygon*>(basicShape); local 99 polygonValue->setWindRule(polygon->windRule()); 100 const Vector<Length>& values = polygon->values(); 236 RefPtr<BasicShapePolygon> polygon = BasicShapePolygon::create(); local 238 polygon->setWindRule(polygonValue->windRule()); 241 polygon->appendPoint(convertToLength(state, values.at(i).get()), convertToLength(state, values.at(i + 1).get())); 243 basicShape = polygon.release();
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
dot.stg | 72 node [fontsize=11, shape = <if(useBox)>polygon,sides=4,peripheries=2<else>doublecircle, fixedsize=true, width=.6<endif>]; <name>
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/indices/ |
u_unfilled_gen.py | 38 'polygon') 168 def polygon(intype, outtype): function 169 preamble(intype, outtype, prim='polygon') 200 polygon(intype, outtype)
|
/external/mesa3d/src/gallium/auxiliary/indices/ |
u_unfilled_gen.py | 38 'polygon') 168 def polygon(intype, outtype): function 169 preamble(intype, outtype, prim='polygon') 200 polygon(intype, outtype)
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
Shape.cpp | 131 const BasicShapePolygon* polygon = static_cast<const BasicShapePolygon*>(basicShape); local 132 const Vector<Length>& values = polygon->values(); 142 shape = createPolygonShape(vertices.release(), polygon->windRule());
|