| /external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
| der_encode_setof.c | 20 struct edge { struct
27 struct edge *A = (struct edge *)a, *B = (struct edge *)b;
66 struct edge *edges;
|
| /external/skia/src/core/ |
| SkEdgeBuilder.cpp | 17 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); local
18 if (edge->setLine(pts[0], pts[1], NULL, fShiftUp)) {
19 fList.push(edge);
21 // TODO: unallocate edge from storage...
26 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); local
27 if (edge->setQuadratic(pts, fShiftUp)) {
28 fList.push(edge);
30 // TODO: unallocate edge from storage...
35 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); local
36 if (edge->setCubic(pts, NULL, fShiftUp))
[all...] |
| SkScan_Path.cpp | 33 static void validate_sort(const SkEdge* edge)
37 while (edge->fFirstY != SK_MaxS32)
39 edge->validate();
40 SkASSERT(y <= edge->fFirstY);
42 y = edge->fFirstY;
43 edge = edge->fNext;
47 #define validate_sort(edge)
50 static inline void remove_edge(SkEdge* edge)
52 edge->fPrev->fNext = edge->fNext
516 SkEdge* edge = sort_edges(list, count, &last); local
675 SkEdge* edge = sort_edges(list, count, &last); local
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/bwindow/ |
| SDL_sysevents.cc | 194 BPoint edge; local
195 GetXYOffset(edge.x, edge.y);
196 edge.x += x;
197 edge.y += y;
198 ConvertToScreen(&edge);
199 set_mouse_position((int)edge.x, (int)edge.y);
|
| /external/bison/src/ |
| lalr.c | 173 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
193 edge[nedges++] = map_goto (stateno, sym);
201 memcpy (reads[i], edge, nedges * sizeof edge[0]);
213 free (edge);
232 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); local
274 edge[nedges++] = map_goto (states1[--length],
289 includes[i][j] = edge[j]
[all...] |
| vcg.h | 177 hidden by folding or edge classes) does not have fixed specified
191 ignored, if they are in conflict with near edge specifications.
294 | Edge attributs list. Structure that describes an edge. |
297 /* VCG Edge type. */
322 /* The struct edge itself. */ struct
323 struct edge
326 /* Edge type.
327 Default is normal edge. */
330 /* Sourcename is the title of the source node of the edge
439 typedef struct edge edge; typedef in typeref:struct:edge
924 edge edge; member in struct:graph
[all...] |
| /external/quake/quake/src/QW/client/ |
| r_edge.c | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
169 sentinel at the end (actually, this is the active edge table starting at
270 // pull the edge out of the edge list
274 // find out where the edge goes in the edge list
282 // put the edge back into the edge lis
590 edge_t *edge; local
629 edge_t *edge; local
[all...] |
| r_draw.c | 82 edge_t *edge, *pcheck; local
169 // create the edge
179 return; // horizontal edge
184 edge = edge_p++;
186 edge->owner = r_pedge;
188 edge->nearzi = lzi0;
192 // trailing edge (go from p1 to p2)
196 edge->surfs[0] = surface_p - surfaces;
197 edge->surfs[1] = 0;
204 // leading edge (go from p2 to p1
[all...] |
| /external/quake/quake/src/WinQuake/ |
| r_edge.cpp | 31 this breaks spans at every edge, even hidden ones (bad)
71 void R_LeadingEdge (edge_t *edge);
72 void R_LeadingEdgeBackwards (edge_t *edge);
73 void R_TrailingEdge (surf_t *surf, edge_t *edge);
169 sentinel at the end (actually, this is the active edge table starting at
270 // pull the edge out of the edge list
274 // find out where the edge goes in the edge list
282 // put the edge back into the edge list
590 edge_t *edge; local
629 edge_t *edge; local
[all...] |
| r_draw.cpp | 82 edge_t *edge, *pcheck;
local
169 // create the edge
179 return; // horizontal edge
184 edge = edge_p++;
186 edge->owner = r_pedge;
188 edge->nearzi = lzi0;
192 // trailing edge (go from p1 to p2)
196 edge->surfs[0] = surface_p - surfaces;
197 edge->surfs[1] = 0;
204 // leading edge (go from p2 to p1)
[all...] |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/scene/ |
| ViewHierarchyLoader.java | 104 final String edge = parent.name + lastNode.name; local
105 scene.addEdge(edge);
106 scene.setEdgeSource(edge, parent);
107 scene.setEdgeTarget(edge, lastNode);
|
| /cts/tests/tests/widget/src/android/widget/cts/ |
| HorizontalScrollViewTest.java | 573 int edge = mScrollView.getHorizontalFadingEdgeLength(); local
579 rect = new Rect(edge, 0, PAGE_WIDTH, 0);
583 rect = new Rect(edge + 1, 0, PAGE_WIDTH, 0);
584 assertEquals(edge, mScrollView.computeScrollDeltaToGetChildRectOnScreen(rect));
633 int edge = mScrollView.getHorizontalFadingEdgeLength();
644 assertEquals(ITEM_WIDTH - mScrollView.getWidth() + edge, mScrollView.getScrollX());
|
| ScrollViewTest.java | 600 int edge = mScrollView.getVerticalFadingEdgeLength(); local
606 rect = new Rect(0, edge, 0, mPageHeight);
610 rect = new Rect(0, edge + 1, 0, mPageHeight);
611 assertEquals(edge, mScrollView.computeScrollDeltaToGetChildRectOnScreen(rect));
661 int edge = mScrollView.getVerticalFadingEdgeLength();
675 assertEquals(edge, mScrollView.getScrollY());
|
| /external/freetype/src/autofit/ |
| afcjk.c | 351 /* an edge in our table that corresponds to its position. */
353 /* If no edge is found, we create and insert a new edge in the */
354 /* sorted table. Otherwise, we simply add the segment to the edge's */
356 /* edge's properties. */
358 /* Note that the edges table is sorted along the segment/edge */
377 /* look for an edge corresponding to the segment */
380 AF_Edge edge = axis->edges + ee; local
384 if ( edge->dir != seg->dir )
387 dist = seg->pos - edge->fpos
428 AF_Edge edge; local
481 AF_Edge edge; local
1024 AF_Edge edge; local
1280 AF_Edge edge; local
[all...] |
| afhints.c | 72 AF_Edge edge = NULL; local
80 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
100 edge = edges + axis->num_edges;
102 while ( edge > edges )
104 if ( edge[-1].fpos < fpos )
107 /* we want the edge with same position and minor direction */
109 if ( edge[-1].fpos == fpos && dir == axis->major_dir )
112 edge[0] = edge[-1];
113 edge--
274 AF_Edge edge; local
688 AF_Edge edge = seg->edge; local
715 AF_Edge edge = seg->edge; local
770 AF_Edge edge; local
[all...] |
| afhints.h | 89 /* edge hint flags */
124 FT_Byte flags; /* edge/segment flags for this segment */
131 AF_Edge edge; /* the segment's parent edge */ member in struct:AF_SegmentRec_
132 AF_Segment edge_next; /* link to next segment in parent edge */
140 AF_Point first; /* first point in edge segment */
141 AF_Point last; /* last point in edge segment */
153 FT_Byte flags; /* edge flags */
154 FT_Char dir; /* edge direction */
156 AF_Width blue_edge; /* non-NULL if this is a blue edge */
[all...] |
| aflatin.c | 724 /* we are already on an edge, try to locate its start */
758 /* we are just leaving an edge; record a new segment! */
1004 /* to find an edge in our table that corresponds to its position. */
1006 /* If no edge is found, we create and insert a new edge in the */
1007 /* sorted table. Otherwise, we simply add the segment to the edge's */
1009 /* edge's properties. */
1011 /* Note that the edges table is sorted along the segment/edge */
1039 /* look for an edge corresponding to the segment */
1042 AF_Edge edge = axis->edges + ee local
1059 AF_Edge edge; local
1114 AF_Edge edge; local
1268 AF_Edge edge = axis->edges; local
1707 AF_Edge edge; local
[all...] |
| aflatin2.c | 720 /* already on an edge ?, backtrack to find its start */
1068 /* to find an edge in our table that corresponds to its position. */
1070 /* If no edge is found, we create and insert a new edge in the */
1071 /* sorted table. Otherwise, we simply add the segment to the edge's */
1073 /* edge's properties. */
1075 /* Note that the edges table is sorted along the segment/edge */
1115 /* look for an edge corresponding to the segment */
1118 AF_Edge edge = axis->edges + ee; local
1135 AF_Edge edge; local
1188 AF_Edge edge; local
1342 AF_Edge edge = axis->edges; local
1792 AF_Edge edge; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/avc/common/src/ |
| deblock.cpp | 60 //static void GetStrength(AVCCommonObj *video, uint8 *Strength, AVCMacroblock* MbP, AVCMacroblock* MbQ, int dir, int edge);
293 int edge, QP, QPC; local
317 /* NOTE: edge=0 and edge=1~3 are separate cases because of the difference of MbP, index A and indexB calculation */
318 /* for edge = 1~3, MbP, indexA and indexB remain the same, and thus there is no need to re-calculate them for each edge */
322 /* 1.VERTICAL EDGE + MB BOUNDARY (edge = 0) */
326 //GetStrength(video, Strength, MbP, MbQ, 0, 0); // Strength for 4 blks in 1 stripe, 0 => vertical edge
372 /* 2.VERTICAL EDGE (no boundary), the edges are all inside a MB *
[all...] |
| /external/libpcap/ |
| gencode.h | 221 struct edge { struct
227 struct edge *next; /* link list of incoming edges for a node */
240 struct edge et;
241 struct edge ef;
246 struct edge *in_edges;
|
| /hardware/broadcom/wlan/bcm4329/src/shared/ |
| siutils.c | 1385 uint32 edge = si_gpioevent(sih, GPIO_REGEVT, 0, 0); local
[all...] |
| /packages/apps/Gallery/src/com/android/camera/ |
| CropImage.java | 631 int edge = hv.getHit(event.getX(), event.getY()); local
632 if (edge != HighlightView.GROW_NONE) {
657 int edge = hv.getHit(event.getX(), event.getY()); local
658 if (edge != HighlightView.GROW_NONE) {
659 mMotionEdge = edge;
664 (edge == HighlightView.MOVE)
709 // the edge of the screen causes scrolling but it means
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| tree-flow.h | 37 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
547 edge ep_edge;
682 /* Location to track pending stmt for edge insertion. */
710 extern edge find_taken_edge (basic_block, tree);
719 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
720 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
722 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
| tree-flow.h | 37 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
547 edge ep_edge;
682 /* Location to track pending stmt for edge insertion. */
710 extern edge find_taken_edge (basic_block, tree);
719 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
720 extern bool gimple_duplicate_sese_region (edge, edge, basic_block *, unsigned,
722 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned
[all...] |
| /system/core/libpixelflinger/ |
| trap.cpp | 604 // the following routine fills a triangle via edge stepping, which
631 struct Edge
633 int32_t x; // edge position in 16.16 coordinates
640 edge_dump( Edge* edge )
643 edge->y_top, edge->y_top/float(TRI_ONE),
644 edge->y_bot, edge->y_bot/float(TRI_ONE),
645 edge->x, edge->x/float(FIXED_ONE)
672 Edge* edge = edges + *pcount; local
862 AAEdge* edge = edges + *pcount; local
[all...] |
