| /external/chromium_org/third_party/WebKit/Source/core/rendering/shapes/ |
| PolygonShape.cpp | 46 const FloatPolygonEdge* edge; member in struct:WebCore::EdgeIntersection
63 const FloatPolygonEdge& edge = *edgePointer; local
65 if (edge.minY() > y || edge.maxY() < y)
68 const FloatPoint& vertex1 = edge.vertex1();
69 const FloatPoint& vertex2 = edge.vertex2();
77 intersectionX = edge.minX();
78 } else if (y == edge.minY()) {
81 } else if (y == edge.maxY()) {
89 result.edge = edgePointer
414 const FloatPolygonEdge* edge = edges[i]; local
456 const FloatPolygonEdge& edge = *(edges[i]); local
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| FASerializer.java | 97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i); local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin'
128 // to it, but don't "draw" an edge.
129 if ( edge instanceof RuleClosureTransition ) {
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState);
150 // depth first walk each transition, printing its edge first
152 Transition edge = (Transition) s.transition(i); local
155 if ( edge.isAction() ) {
158 else if ( edge.isEpsilon() )
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkScan_Path.cpp | 28 static void validate_sort(const SkEdge* edge) {
31 while (edge->fFirstY != SK_MaxS32) {
32 edge->validate();
33 SkASSERT(y <= edge->fFirstY);
35 y = edge->fFirstY;
36 edge = edge->fNext;
40 #define validate_sort(edge)
43 static inline void remove_edge(SkEdge* edge) {
44 edge->fPrev->fNext = edge->fNext
470 SkEdge* edge = sort_edges(list, count, &last); local
674 SkEdge* edge = sort_edges(list, count, &last); local
[all...] |
| SkEdgeBuilder.cpp | 26 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
27 if (edge->setLine(pts[0], pts[1], fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
36 if (edge->setQuadratic(pts, fShiftUp)) {
37 fList.push(edge);
39 // TODO: unallocate edge from storage...
44 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
45 if (edge->setCubic(pts, NULL, fShiftUp))
100 SkEdge* edge = reinterpret_cast<SkEdge*>(storage); local
[all...] |
| /external/skia/src/core/ |
| SkScan_Path.cpp | 28 static void validate_sort(const SkEdge* edge) {
31 while (edge->fFirstY != SK_MaxS32) {
32 edge->validate();
33 SkASSERT(y <= edge->fFirstY);
35 y = edge->fFirstY;
36 edge = edge->fNext;
40 #define validate_sort(edge)
43 static inline void remove_edge(SkEdge* edge) {
44 edge->fPrev->fNext = edge->fNext
470 SkEdge* edge = sort_edges(list, count, &last); local
674 SkEdge* edge = sort_edges(list, count, &last); local
[all...] |
| /dalvik/dx/tests/072-dex-switch-edge-cases/ |
| info.txt | 2 a bunch of switch op edge cases get converted reasonably.
|
| /dalvik/dx/tests/086-ssa-edge-split/ |
| info.txt | 1 This is a test case for the edge-splitting algorthim used in the conversion to SSA form.
|
| /external/bison/doc/figs/ |
| example-shift.dot | 4 edge [fontname=courier]
|
| /external/chromium_org/ash/wm/workspace/ |
| magnetism_matcher.cc | 21 // primary edge of |primary|. |edges| is a bitmask of the allowed
56 MagnetismEdge edge)
58 edge_(edge) {
74 // Close enough, but only attach if some portion of the edge is visible.
143 MatchedEdge* edge) {
146 edge->primary_edge = matchers_[i]->edge();
147 AttachToSecondaryEdge(bounds, edge->primary_edge,
148 &(edge->secondary_edge));
165 MagnetismEdge edge,
[all...] |
| snap_sizer.h | 27 enum Edge {
42 Edge edge,
47 static void SnapWindow(aura::Window* window, Edge edge);
62 // Returns the target bounds based on the edge and the provided |size_index|.
78 // Returns the target bounds based on the edge and |size_index_|.
81 // Returns true if the specified point is along the edge of the screen.
87 const Edge edge_;
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| EdgeProfiling.cpp | 1 //===- EdgeProfiling.cpp - Insert counters for edge profiling -------------===//
10 // This pass instruments the specified program with counters for edge profiling.
11 // Edge profiling can give a reasonable approximation of the hot paths through a
15 // edge in the program, instead of using control flow information to prune the
19 #define DEBUG_TYPE "insert-edge-profiling"
43 return "Edge Profiler";
49 INITIALIZE_PASS(EdgeProfiler, "insert-edge-profiling",
50 "Insert instrumentation for edge profiling", false, false)
57 errs() << "WARNING: cannot insert edge profiling into a module"
66 // Reserve space for (0,entry) edge
[all...] |
| /external/llvm/test/Transforms/SCCP/ |
| switch.ll | 3 ; Make sure we always consider the default edge executable for a switch
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| ImageFilterEdge.java | 24 private static final String SERIALIZATION_NAME = "EDGE";
26 mName = "Edge";
31 representation.setName("Edge");
34 representation.setTextId(R.string.edge);
|
| /external/chromium/chrome/browser/resources/shared/js/cr/ui/ |
| position_util.js | 24 * The popup's right edge is aligned with the left edge of the anchor.
25 * The popup's top edge is aligned with the top edge of the anchor's top
26 * edge.
31 * The popop's left edge is aligned with the right edge of the anchor.
32 * The popup's top edge is aligned with the top edge of the anchor's top
33 * edge
[all...] |
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afcjk.c | 916 /* an edge in our table that corresponds to its position. */
918 /* If no edge is found, we create and insert a new edge in the */
919 /* sorted table. Otherwise, we simply add the segment to the edge's */
921 /* edge's properties. */
923 /* Note that the edges table is sorted along the segment/edge */
942 /* look for an edge corresponding to the segment */
945 AF_Edge edge = axis->edges + ee; local
949 if ( edge->dir != seg->dir )
952 dist = seg->pos - edge->fpos
993 AF_Edge edge; local
1046 AF_Edge edge; local
1175 AF_Edge edge = axis->edges; local
1676 AF_Edge edge; local
2019 AF_Edge edge; local
[all...] |
| afhints.c | 66 /* Get new edge for given axis, direction, and position. */
76 AF_Edge edge = NULL; local
84 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
104 edge = edges + axis->num_edges;
106 while ( edge > edges )
108 if ( edge[-1].fpos < fpos )
111 /* we want the edge with same position and minor direction */
113 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
116 edge[0] = edge[-1]
359 AF_Edge edge; local
827 AF_Edge edge = seg->edge; local
853 AF_Edge edge = seg->edge; local
908 AF_Edge edge; local
[all...] |
| /external/freetype/src/autofit/ |
| afcjk.c | 920 /* an edge in our table that corresponds to its position. */
922 /* If no edge is found, we create and insert a new edge in the */
923 /* sorted table. Otherwise, we simply add the segment to the edge's */
925 /* edge's properties. */
927 /* Note that the edges table is sorted along the segment/edge */
946 /* look for an edge corresponding to the segment */
949 AF_Edge edge = axis->edges + ee; local
953 if ( edge->dir != seg->dir )
956 dist = seg->pos - edge->fpos
998 AF_Edge edge; local
1051 AF_Edge edge; local
1180 AF_Edge edge = axis->edges; local
1681 AF_Edge edge; local
2024 AF_Edge edge; local
[all...] |
| afhints.c | 77 /* Get new edge for given axis, direction, and position. */
87 AF_Edge edge = NULL; local
95 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
115 edge = edges + axis->num_edges;
117 while ( edge > edges )
119 if ( edge[-1].fpos < fpos )
122 /* we want the edge with same position and minor direction */
124 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
127 edge[0] = edge[-1]
379 AF_Edge edge; local
849 AF_Edge edge = seg->edge; local
875 AF_Edge edge = seg->edge; local
930 AF_Edge edge; local
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 129 "Attempt to add duplicate edge.");
138 "Edge cost dimensions do not match node costs dimensions.");
151 /// and edge data, only graph structure and costs.
158 /// edge data, only graph structure and costs.
177 /// \brief Add an edge between the given nodes with the given costs.
180 /// @return Edge iterator for the added edge.
221 /// \brief Get an edge's cost matrix.
222 /// @param eItr Edge iterator.
223 /// @return Edge cost matrix
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/src/com/android/ide/eclipse/adt/internal/editors/layout/refactoring/testdata/ |
| completion12-expected-completion75.txt | 10 android:paddingLeft : Sets the padding, in pixels, of the left edge; see padding. [dimension]
11 android:paddingTop : Sets the padding, in pixels, of the top edge; see padding. [dimension]
12 android:paddingRight : Sets the padding, in pixels, of the right edge; see padding. [dimension]
13 android:paddingBottom : Sets the padding, in pixels, of the bottom edge; see padding. [dimension]
14 android:paddingStart : Sets the padding, in pixels, of the start edge; see padding. [dimension]
15 android:paddingEnd : Sets the padding, in pixels, of the end edge; see padding. [dimension]
71 android:layout_toLeftOf : Positions the right edge of this view to the left of the given anchor view ID. [reference]
72 android:layout_toRightOf : Positions the left edge of this view to the right of the given anchor view ID. [reference]
73 android:layout_above : Positions the bottom edge of this view above the given anchor view ID. [reference]
74 android:layout_below : Positions the top edge of this view below the given anchor view ID. [reference
[all...] |
| /external/freetype/src/cff/ |
| cf2hints.c | 60 size_t j; /* index of upper hint map edge */
142 * non-Adobe font tool. The Type 2 spec allows edge (ghost) hints
184 /* Now that ghost hints have been detected, adjust this edge for */
323 csCoord >= hintmap->edge[i + 1].csCoord )
327 while ( i > 0 && csCoord < hintmap->edge[i].csCoord )
332 if ( i == 0 && csCoord < hintmap->edge[0].csCoord )
334 /* special case for points below first edge: use uniform scale */
335 return FT_MulFix( csCoord - hintmap->edge[0].csCoord,
337 hintmap->edge[0].dsCoord;
343 * Use edge[i], the highest entry where csCoord >= entry[i].csCoor
870 CF2_HintRec edge, invalid; local
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/ |
| omxVCM4P10_DeblockChroma_I.c | 36 * vertical edge, internal vertical edge, external
37 * horizontal edge, internal horizontal edge }
39 * vertical edge, internal vertical edge, external horizontal edge,
40 * internal horizontal edge }
42 * above edge of each 4x2 or 2x4 block, arranged in vertical block order
|
| omxVCM4P10_DeblockLuma_I.c | 38 * vertical edge, internal vertical edge, external horizontal
39 * edge, internal horizontal edge }
41 * vertical edge, internal vertical edge, external horizontal edge,
42 * internal horizontal edge }
44 * the left or above edge of each 4x4 block, arranged in vertical block order
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p10/src/ |
| omxVCM4P10_DeblockChroma_I.c | 36 * vertical edge, internal vertical edge, external
37 * horizontal edge, internal horizontal edge }
39 * vertical edge, internal vertical edge, external horizontal edge,
40 * internal horizontal edge }
42 * above edge of each 4x2 or 2x4 block, arranged in vertical block order
|
| omxVCM4P10_DeblockLuma_I.c | 38 * vertical edge, internal vertical edge, external horizontal
39 * edge, internal horizontal edge }
41 * vertical edge, internal vertical edge, external horizontal edge,
42 * internal horizontal edge }
44 * the left or above edge of each 4x4 block, arranged in vertical block order
|
