Searched refs:edge (Results 1 - 25 of 192) sorted by relevance

12345678

/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Ddag.c28 * Adds a directed edge from the parent node to the child.
30 * Both nodes should have been initialized with dag_init_node(). The edge
36 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) {
37 if (edge->child == child && edge->data == data)
43 struct dag_edge edge = { local in function:dag_add_edge
48 util_dynarray_append(&parent->edges, struct dag_edge, edge);
52 /* Removes a single edge from the graph, promoting the child to a DAG head.
59 dag_remove_edge(struct dag *dag, struct dag_edge *edge) argument
61 if (!edge
[all...]
H A Ddag.h37 /* User-defined data associated with the edge. */
44 /* Array struct edge to the children. */
56 void dag_remove_edge(struct dag *dag, struct dag_edge *edge);
/xsrc/external/mit/MesaLib/dist/src/util/
H A Ddag.c28 * Adds a directed edge from the parent node to the child.
30 * Both nodes should have been initialized with dag_init_node(). The edge
36 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) {
37 if (edge->child == child && edge->data == data)
43 struct dag_edge edge = { local in function:dag_add_edge
48 util_dynarray_append(&parent->edges, struct dag_edge, edge);
52 /* Removes a single edge from the graph, promoting the child to a DAG head.
59 dag_remove_edge(struct dag *dag, struct dag_edge *edge) argument
61 if (!edge
[all...]
H A Ddag.h37 /* User-defined data associated with the edge. */
44 /* Array struct edge to the children. */
56 void dag_remove_edge(struct dag *dag, struct dag_edge *edge);
/xsrc/external/mit/freetype/dist/src/autofit/
H A Daflatin2.c791 /* already on an edge ?, backtrack to find its start */
1134 * to find an edge in our table that corresponds to its position.
1136 * If no edge is found, we create and insert a new edge in the
1137 * sorted table. Otherwise, we simply add the segment to the edge's
1139 * edge's properties.
1141 * Note that the edges table is sorted along the segment/edge
1182 /* look for an edge corresponding to the segment */
1185 AF_Edge edge = axis->edges + ee; local in function:af_latin2_hints_compute_edges
1189 dist = seg->pos - edge
1202 AF_Edge edge; local in function:af_latin2_hints_compute_edges
1257 AF_Edge edge; local in function:af_latin2_hints_compute_edges
1415 AF_Edge edge = axis->edges; local in function:af_latin2_hints_compute_blue_edges
1868 AF_Edge edge; local in function:af_latin2_hint_edges
[all...]
H A Daflatin.c1624 /* we are already on an edge, try to locate its start */
1688 /* points are different: we are just leaving an edge, thus */
1843 /* if we are not on an edge, check whether the major direction */
2162 * an edge in our table that corresponds to its position.
2164 * If no edge is found, we create and insert a new edge in the
2165 * sorted table. Otherwise, we simply add the segment to the edge's
2167 * edge's properties.
2169 * Note that the table of edges is sorted along the segment/edge
2174 /* assure that edge distanc
2205 AF_Edge edge = axis->edges + ee; local in function:af_latin_hints_compute_edges
2222 AF_Edge edge; local in function:af_latin_hints_compute_edges
2269 AF_Edge edge = axis->edges + ee; local in function:af_latin_hints_compute_edges
2317 AF_Edge edge; local in function:af_latin_hints_compute_edges
2482 AF_Edge edge = axis->edges; local in function:af_latin_hints_compute_blue_edges
2989 AF_Edge edge; local in function:af_latin_hint_edges
[all...]
H A Dafcjk.c1030 * an edge in our table that corresponds to its position.
1032 * If no edge is found, we create and insert a new edge in the
1033 * sorted table. Otherwise, we simply add the segment to the edge's
1035 * edge's properties.
1037 * Note that the edges table is sorted along the segment/edge
1056 /* look for an edge corresponding to the segment */
1059 AF_Edge edge = axis->edges + ee; local in function:af_cjk_hints_compute_edges
1063 if ( edge->dir != seg->dir )
1066 dist = seg->pos - edge
1108 AF_Edge edge; local in function:af_cjk_hints_compute_edges
1163 AF_Edge edge; local in function:af_cjk_hints_compute_edges
1299 AF_Edge edge = axis->edges; local in function:af_cjk_hints_compute_blue_edges
1685 af_hint_normal_stem(AF_GlyphHints hints,AF_Edge edge,AF_Edge edge2,FT_Pos anchor,AF_Dimension dim) argument
1820 AF_Edge edge; local in function:af_cjk_hint_edges
2198 AF_Edge edge; local in function:af_cjk_align_edge_points
[all...]
H A Dafhints.c95 /* Get new edge for given axis, direction, and position, */
96 /* without initializing the edge itself. */
107 AF_Edge edge = NULL; local in function:af_axis_hints_new_edge
123 FT_Int big_max = (FT_Int)( FT_INT_MAX / sizeof ( *edge ) );
153 edge = edges + axis->num_edges;
155 while ( edge > edges )
157 if ( top_to_bottom_hinting ? ( edge[-1].fpos > fpos )
158 : ( edge[-1].fpos < fpos ) )
161 /* we want the edge with same position and minor direction */
163 if ( edge[
585 AF_Edge edge; local in function:af_glyph_hints_dump_edges
1232 AF_Edge edge = seg->edge; local in function:af_glyph_hints_align_edge_points
1258 AF_Edge edge = seg->edge; local in function:af_glyph_hints_align_edge_points
1313 AF_Edge edge; local in function:af_glyph_hints_align_strong_points
[all...]
/xsrc/external/mit/libXrender/dist/src/
H A DPoly.c32 XLineFixed edge; member in struct:_Edge
43 return e1->edge.p1.y - e2->edge.p1.y;
105 y = edges[0].edge.p1.y;
114 if (e->edge.p1.y > y)
116 /* move this edge into the active list */
126 e->current_x = XRenderComputeX (&e->edge, y);
140 en->edge.p2.x < e->edge.p2.x))
177 next_y = active->edge
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/swr/rasterizer/core/
H A Dtessellator.cpp548 // Clamp edge TessFactors
619 int edge, axis; local in function:CHWTessellator::QuadProcessTessFactors
622 for( edge = 0; edge < QUAD_EDGES; edge++ )
624 int edgeEven = isEven(outsideTessFactor[edge]);
625 processedTessFactors.outsideTessFactorParity[edge] = edgeEven ? TESSELLATOR_PARITY_EVEN : TESSELLATOR_PARITY_ODD;
636 for( edge = 0; edge < QUAD_EDGES; edge
670 for(int edge = 0; edge < QUAD_EDGES; edge++ ) local in function:CHWTessellator::QuadProcessTessFactors
685 for(int edge = 0; edge < QUAD_EDGES; edge++ ) local in function:CHWTessellator::QuadProcessTessFactors
717 int edge; local in function:CHWTessellator::QuadGeneratePoints
846 int edge; local in function:CHWTessellator::QuadGenerateConnectivity
1127 int edge; local in function:CHWTessellator::TriProcessTessFactors
1223 int edge; local in function:CHWTessellator::TriGeneratePoints
1333 int edge; local in function:CHWTessellator::TriGenerateConnectivity
2242 int edge, axis; local in function:CHLSLTessellator::QuadHLSLProcessTessFactors
2482 int edge; local in function:CHLSLTessellator::TriHLSLProcessTessFactors
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/tessellator/
H A Dtessellator.cpp566 // Clamp edge TessFactors
637 int edge, axis; local in function:CHWTessellator::QuadProcessTessFactors
640 for( edge = 0; edge < QUAD_EDGES; edge++ )
642 int edgeEven = isEven(outsideTessFactor[edge]);
643 processedTessFactors.outsideTessFactorParity[edge] = edgeEven ? TESSELLATOR_PARITY_EVEN : TESSELLATOR_PARITY_ODD;
654 for( edge = 0; edge < QUAD_EDGES; edge
688 for(int edge = 0; edge < QUAD_EDGES; edge++ ) local in function:CHWTessellator::QuadProcessTessFactors
703 for(int edge = 0; edge < QUAD_EDGES; edge++ ) local in function:CHWTessellator::QuadProcessTessFactors
735 int edge; local in function:CHWTessellator::QuadGeneratePoints
864 int edge; local in function:CHWTessellator::QuadGenerateConnectivity
1145 int edge; local in function:CHWTessellator::TriProcessTessFactors
1241 int edge; local in function:CHWTessellator::TriGeneratePoints
1351 int edge; local in function:CHWTessellator::TriGenerateConnectivity
2198 int edge, axis; local in function:CHLSLTessellator::QuadHLSLProcessTessFactors
2442 int edge; local in function:CHLSLTessellator::TriHLSLProcessTessFactors
[all...]
/xsrc/external/mit/pixman/dist/pixman/
H A Dpixman-edge.c35 #define RENDER_EDGE_STEP_SMALL(edge) \
37 edge->x += edge->stepx_small; \
38 edge->e += edge->dx_small; \
39 if (edge->e > 0) \
41 edge->e -= edge->dy; \
42 edge->x += edge
[all...]
/xsrc/external/mit/xf86-video-intel/dist/test/
H A Drender-triangle.c7 enum edge { enum
12 static void set_edge(Display *dpy, Picture p, enum edge edge) argument
16 a.poly_edge = edge;
40 static const char *edge_name(enum edge edge) argument
42 switch (edge) {
88 enum edge edge,
98 set_edge(t->out.dpy, out.picture, edge);
86 edge_test(struct test * t,enum mask mask,enum edge edge,enum target target) argument
169 enum edge edge; local in function:main
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp97 Edge *edge = new Edge(this, node, kind); local in function:nv50_ir::Graph::Node::attach
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
104 this->out->prev[0] = edge;
106 this->out = edge;
109 edge->next[1] = node->in;
110 edge->prev[1] = node->in->prev[1];
111 edge
366 Graph::Edge *edge; local in function:nv50_ir::Graph::classifyDFS
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp97 Edge *edge = new Edge(this, node, kind); local in function:nv50_ir::Graph::Node::attach
101 edge->next[0] = this->out;
102 edge->prev[0] = this->out->prev[0];
103 edge->prev[0]->next[0] = edge;
104 this->out->prev[0] = edge;
106 this->out = edge;
109 edge->next[1] = node->in;
110 edge->prev[1] = node->in->prev[1];
111 edge
365 Graph::Edge *edge; local in function:nv50_ir::Graph::classifyDFS
[all...]
/xsrc/external/mit/xorg-server.old/dist/mi/
H A Dmifillarc.h106 #define MIARCSLICESTEP(edge) \
107 edge.x -= edge.stepx; \
108 edge.e -= edge.dx; \
109 if (edge.e <= 0) \
111 edge.x -= edge.deltax; \
112 edge.e += edge
[all...]
H A Dmifillarc.c141 miSliceEdgePtr edge,
157 xady = k + y * edge->dx;
159 edge->x = - ((-xady) / edge->dy + 1);
161 edge->x = (xady - 1) / edge->dy;
162 edge->e = xady - edge->x * edge->dy;
163 if ((top && (edge
139 miGetArcEdge(xArc * arc,miSliceEdgePtr edge,int k,Bool top,Bool left) argument
263 miGetPieEdge(xArc * arc,int angle,miSliceEdgePtr edge,Bool top,Bool left) argument
[all...]
/xsrc/external/mit/xorg-server/dist/mi/
H A Dmifillarc.h105 #define MIARCSLICESTEP(edge) \
106 edge.x -= edge.stepx; \
107 edge.e -= edge.dx; \
108 if (edge.e <= 0) \
110 edge.x -= edge.deltax; \
111 edge.e += edge
[all...]
H A Dmifillarc.c129 miGetArcEdge(xArc * arc, miSliceEdgePtr edge, int k, Bool top, Bool left) argument
141 xady = k + y * edge->dx;
143 edge->x = -((-xady) / edge->dy + 1);
145 edge->x = (xady - 1) / edge->dy;
146 edge->e = xady - edge->x * edge->dy;
147 if ((top && (edge
242 miGetPieEdge(xArc * arc,int angle,miSliceEdgePtr edge,Bool top,Bool left) argument
[all...]
/xsrc/external/mit/freetype/dist/src/psaux/
H A Dpshints.c60 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 */
310 CF2_Hint hint = &hintmap->edge[i];
349 csCoord >= hintmap->edge[i + 1].csCoord )
353 while ( i > 0 && csCoord < hintmap->edge[i].csCoord )
358 if ( i == 0 && csCoord < hintmap->edge[0].csCoord )
360 /* special case for points below first edge: use uniform scale */
362 hintmap->edge[0].csCoord ),
364 hintmap->edge[
969 CF2_HintRec edge, invalid; local in function:cf2_hintmap_build
[all...]
/xsrc/external/mit/xf86-video-intel/dist/src/sna/
H A Dsna_trapezoids_precise.c148 struct edge { struct
149 struct edge *next, *prev;
162 /* The clipped y of the top of the edge. */
165 /* y2-y1 after orienting the edge downwards. */
179 /* Array of edges all starting in the same bucket. An edge is put
180 * into bucket EDGE_BUCKET_INDEX(edge->ytop, polygon->ymin) when
182 struct edge **y_buckets;
183 struct edge *y_buckets_embedded[64];
185 struct edge edges_embedded[32];
186 struct edge *edge
508 polygon_add_edge(struct polygon * polygon,const xTrapezoid * t,const xLineFixed * edge,int dir,int dx,int dy) argument
893 fill_buckets(struct active_list * active,struct edge * edge,int ymin,struct edge ** buckets) argument
913 struct edge *edge = active->head.next; local in function:nonzero_subrow
1043 struct edge *edge; local in function:step_edges
1387 struct edge *edge = active->head.next; local in function:inplace_subrow
[all...]
H A Dsna_trapezoids_imprecise.c135 struct edge { struct
136 struct edge *next, *prev;
148 /* The clipped y of the top of the edge. */
151 /* y2-y1 after orienting the edge downwards. */
165 /* Array of edges all starting in the same bucket. An edge is put
166 * into bucket EDGE_BUCKET_INDEX(edge->ytop, polygon->ymin) when
168 struct edge **y_buckets;
169 struct edge *y_buckets_embedded[64];
171 struct edge edges_embedded[32];
172 struct edge *edge
468 polygon_add_edge(struct polygon * polygon,const xTrapezoid * t,const xLineFixed * edge,int dir,int dx,int dy) argument
811 fill_buckets(struct active_list * active,struct edge * edge,struct edge ** buckets) argument
839 struct edge *edge = active->head.next; local in function:nonzero_subrow
982 struct edge *edge; local in function:step_edges
1378 struct edge *edge = active->head.next; local in function:inplace_subrow
[all...]
/xsrc/external/mit/xf86-video-intel-2014/dist/src/sna/
H A Dsna_trapezoids_precise.c148 struct edge { struct
149 struct edge *next, *prev;
162 /* The clipped y of the top of the edge. */
165 /* y2-y1 after orienting the edge downwards. */
179 /* Array of edges all starting in the same bucket. An edge is put
180 * into bucket EDGE_BUCKET_INDEX(edge->ytop, polygon->ymin) when
182 struct edge **y_buckets;
183 struct edge *y_buckets_embedded[64];
185 struct edge edges_embedded[32];
186 struct edge *edge
508 polygon_add_edge(struct polygon * polygon,const xTrapezoid * t,const xLineFixed * edge,int dir,int dx,int dy) argument
893 fill_buckets(struct active_list * active,struct edge * edge,int ymin,struct edge ** buckets) argument
913 struct edge *edge = active->head.next; local in function:nonzero_subrow
1033 struct edge *edge; local in function:step_edges
1377 struct edge *edge = active->head.next; local in function:inplace_subrow
[all...]
/xsrc/external/mit/xorg-server.old/dist/hw/xfree86/common/
H A Dxf86Cursor.c280 * - move all other pointers to the nearest edge on the screen (or leave
343 FindEdge(xf86EdgePtr edge, int val) argument
345 while(edge && (edge->end <= val))
346 edge = edge->next;
348 if(edge && (edge->start <= val))
349 return edge;
362 xf86EdgePtr edge; local in function:xf86CursorOffScreen
488 AddEdge(xf86EdgePtr edge,short min,short max,short dx,short dy,short screen) argument
[all...]
/xsrc/external/mit/xorg-server/dist/hw/xfree86/common/
H A Dxf86Cursor.c271 * - move all other pointers to the nearest edge on the screen (or leave
329 FindEdge(xf86EdgePtr edge, int val) argument
331 while (edge && (edge->end <= val))
332 edge = edge->next;
334 if (edge && (edge->start <= val))
335 return edge;
348 xf86EdgePtr edge; local in function:xf86CursorOffScreen
469 AddEdge(xf86EdgePtr edge,short min,short max,short dx,short dy,short screen) argument
[all...]

Completed in 26 milliseconds

12345678