Home
last modified time | relevance | path

Searched defs:edge (Results 1 – 25 of 49) sorted by relevance

12

/external/dropbear/libtomcrypt/src/pk/asn1/der/set/
Dder_encode_setof.c20 struct edge { struct
27 struct edge *A = (struct edge *)a, *B = (struct edge *)b; in qsort_helper() argument
/external/bison/src/
Dvcg.h322 struct edge struct
327 enum edge_type type; argument
333 /* Targetname is the title of the target node of the edge. argument
337 /* Label specifies the label of the edge. It is drawn if argument
342 /* Linestyle specifies the style the edge is drawn. Possibilities are: argument
351 /* Thickness is the thickness of an edge. argument
355 /* Class specifies the folding class of the edge. Nodes reachable by argument
361 /* color is the color of the edge. argument
365 /* textcolor is the color of the label of the edge. arrowcolor, argument
391 /* arrowstyle, backarrowstyle Each edge has two arrow heads: the one argument
[all …]
Dlalr.c173 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); in initialize_F() local
232 goto_number *edge = xnmalloc (ngotos + 1, sizeof *edge); in build_relations() local
/external/opencv/cvaux/src/
Dcvsubdiv2.cpp59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); in icvSubdiv2DCheck() local
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge ) in draw_subdiv_facet()
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i ); in icvDrawMosaic() local
/external/skia/src/core/
DSkEdgeBuilder.cpp17 SkEdge* edge = typedAllocThrow<SkEdge>(fAlloc); in addLine() local
26 SkQuadraticEdge* edge = typedAllocThrow<SkQuadraticEdge>(fAlloc); in addQuad() local
35 SkCubicEdge* edge = typedAllocThrow<SkCubicEdge>(fAlloc); in addCubic() local
DSkScan_Path.cpp33 static void validate_sort(const SkEdge* edge) { in validate_sort()
45 #define validate_sort(edge) argument
48 static inline void remove_edge(SkEdge* edge) { in remove_edge()
95 static void validate_edges_for_y(const SkEdge* edge, int curr_y) { in validate_edges_for_y()
107 #define validate_edges_for_y(edge, curr_y) argument
274 static int build_edges(SkEdge edge[], const SkPath& path, in build_edges()
486 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_path() local
641 static int build_tri_edges(SkEdge edge[], const SkPoint pts[], in build_tri_edges()
675 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_triangle() local
DSkClampRange.cpp23 static int chop(int64_t x0, SkFixed edge, int64_t x1, int64_t dx, int count) { in chop()
/external/quake/quake/src/WinQuake/
Dr_edge.cpp336 void R_LeadingEdgeBackwards (edge_t *edge) in R_LeadingEdgeBackwards()
416 void R_TrailingEdge (surf_t *surf, edge_t *edge) in R_TrailingEdge()
460 void R_LeadingEdge (edge_t *edge) in R_LeadingEdge()
590 edge_t *edge; in R_GenerateSpans() local
629 edge_t *edge; in R_GenerateSpansBackward() local
/external/quake/quake/src/QW/client/
Dr_edge.c336 void R_LeadingEdgeBackwards (edge_t *edge) in R_LeadingEdgeBackwards()
416 void R_TrailingEdge (surf_t *surf, edge_t *edge) in R_TrailingEdge()
460 void R_LeadingEdge (edge_t *edge) in R_LeadingEdge()
590 edge_t *edge; in R_GenerateSpans() local
629 edge_t *edge; in R_GenerateSpansBackward() local
/external/llvm/lib/Transforms/Instrumentation/
DPathProfiling.cpp394 const BLInstrumentationEdge& edge) { in operator <<()
519 for( BLEdgeIterator edge = _edges.begin(), end = _edges.end(); in getCallPhonyEdges() local
601 for(BLEdgeIterator edge = node->succBegin(), predEnd = node->predEnd(); in calculateSpanningTree() local
620 for(BLEdgeIterator edge = _edges.begin(), end = _edges.end(); in calculateSpanningTree() local
651 BallLarusEdge* edge; in unlinkPhony() local
682 for( BLEdgeIterator edge = _edges.begin(), end = _edges.end(); in generateDotGraph() local
781 void BLInstrumentationDag::unlinkEdge(BallLarusEdge* edge) { in unlinkEdge()
790 void BLInstrumentationDag::makeEdgeSpanning(BLInstrumentationEdge* edge) { in makeEdgeSpanning()
797 BLInstrumentationEdge* edge) { in pushInitializationFromEdge()
824 void BLInstrumentationDag::pushCountersFromEdge(BLInstrumentationEdge* edge) { in pushCountersFromEdge()
[all …]
DOptimalEdgeProfiling.cpp150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); in runOnModule() local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); in runOnModule() local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); in runOnModule() local
/external/llvm/lib/Analysis/
DProfileEstimatorPass.cpp134 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock() local
205 Edge edge = getEdge(Latch,0); in recurseBasicBlock() local
267 Edge edge = getEdge(BB,0); in recurseBasicBlock() local
273 Edge edge = getEdge(BB,*bbi); in recurseBasicBlock() local
341 Edge edge = getEdge(0,entry); in runOnFunction() local
DPathNumbering.cpp115 void BallLarusNode::addPredEdge(BallLarusEdge* edge) { in addPredEdge()
120 void BallLarusNode::removePredEdge(BallLarusEdge* edge) { in removePredEdge()
125 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) { in addSuccEdge()
130 void BallLarusNode::removeSuccEdge(BallLarusEdge* edge) { in removeSuccEdge()
255 for(BLEdgeIterator edge = _edges.begin(), end = _edges.end(); edge != end; in ~BallLarusDag() local
/external/opencv/cv/src/
Dcvsubdivision2d.cpp78 CvQuadEdge2D *edge = 0; in cvSubdiv2DMakeEdge() local
143 cvSubdiv2DSetEdgePoints( CvSubdiv2DEdge edge, in cvSubdiv2DSetEdgePoints()
164 cvSubdiv2DDeleteEdge( CvSubdiv2D * subdiv, CvSubdiv2DEdge edge ) in cvSubdiv2DDeleteEdge()
220 cvSubdiv2DSwapEdges( CvSubdiv2DEdge edge ) in cvSubdiv2DSwapEdges()
240 icvIsRightOf( CvPoint2D32f& pt, CvSubdiv2DEdge edge ) in icvIsRightOf()
254 CvSubdiv2DEdge edge = 0; in cvSubdiv2DLocate() local
734 CvSubdiv2DEdge edge; in cvFindNearestPoint2D() local
/external/webkit/Source/WebCore/platform/graphics/
DIntRect.h113 void shiftXEdgeTo(int edge) in shiftXEdgeTo()
119 void shiftMaxXEdgeTo(int edge) in shiftMaxXEdgeTo()
124 void shiftYEdgeTo(int edge) in shiftYEdgeTo()
130 void shiftMaxYEdgeTo(int edge) in shiftMaxYEdgeTo()
/external/libpcap/
Dgencode.h221 struct edge { struct
227 struct edge *next; /* link list of incoming edges for a node */ argument
/external/freetype/src/autofit/
Dafcjk.c945 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges() local
993 AF_Edge edge; in af_cjk_hints_compute_edges() local
1046 AF_Edge edge; in af_cjk_hints_compute_edges() local
1175 AF_Edge edge = axis->edges; in af_cjk_hints_compute_blue_edges() local
1544 AF_Edge edge, in af_hint_normal_stem()
1676 AF_Edge edge; in af_cjk_hint_edges() local
2019 AF_Edge edge; in af_cjk_align_edge_points() local
Dafhints.c76 AF_Edge edge = NULL; in af_axis_hints_new_edge() local
359 AF_Edge edge; in af_glyph_hints_dump_edges() local
827 AF_Edge edge = seg->edge; in af_glyph_hints_align_edge_points() local
853 AF_Edge edge = seg->edge; in af_glyph_hints_align_edge_points() local
908 AF_Edge edge; in af_glyph_hints_align_strong_points() local
Daflatin.c1122 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges() local
1139 AF_Edge edge; in af_latin_hints_compute_edges() local
1195 AF_Edge edge; in af_latin_hints_compute_edges() local
1358 AF_Edge edge = axis->edges; in af_latin_hints_compute_blue_edges() local
1807 AF_Edge edge; in af_latin_hint_edges() local
Daflatin2.c1134 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges() local
1151 AF_Edge edge; in af_latin2_hints_compute_edges() local
1205 AF_Edge edge; in af_latin2_hints_compute_edges() local
1363 AF_Edge edge = axis->edges; in af_latin2_hints_compute_blue_edges() local
1813 AF_Edge edge; in af_latin2_hint_edges() local
/external/llvm/lib/CodeGen/
DSplitter.cpp74 void splitOutgoing(MachineLoop::Edge &edge) { outSplits.insert(edge); } in splitOutgoing()
161 MachineLoop::Edge edge = *osItr; in applyOutgoing() local
540 bool LoopSplitter::isCriticalEdge(MachineLoop::Edge &edge) { in isCriticalEdge()
547 bool LoopSplitter::canSplitEdge(MachineLoop::Edge &edge) { in canSplitEdge()
559 MachineBasicBlock& LoopSplitter::splitEdge(MachineLoop::Edge &edge, in splitEdge()
/external/webkit/Source/WebCore/inspector/front-end/
DDetailedHeapshotGridNodes.js260 WebInspector.HeapSnapshotObjectNode = function(tree, edge) argument
280 function(edge) { argument
286 _childHashForEntity: function(edge) argument
367 function(edge) { argument
373 _childHashForEntity: function(edge) argument
/external/qemu/distrib/sdl-1.2.12/src/video/bwindow/
DSDL_sysevents.cc194 BPoint edge; in DispatchMessage() local
/external/opencv/cxcore/src/
Dcxdatastructs.cpp2979 CvGraphEdge *edge = vtx->first; in cvGraphRemoveVtxByPtr() local
3014 CvGraphEdge *edge = vtx->first; in cvGraphRemoveVtx() local
3036 CvGraphEdge *edge = 0; in cvFindGraphEdgeByPtr() local
3075 CvGraphEdge *edge = 0; in cvFindGraphEdge() local
3107 CvGraphEdge *edge = 0; in cvGraphAddEdgeByPtr() local
3211 CvGraphEdge *edge, *next_edge, *prev_edge; in cvGraphRemoveEdgeByPtr() local
3294 CvGraphEdge *edge; in cvGraphVtxDegreeByPtr() local
3321 CvGraphEdge *edge; in cvGraphVtxDegree() local
3350 CvGraphEdge* edge; member
3528 CvGraphEdge* edge; in cvNextGraphItem() local
[all …]
/external/skia/gpu/src/
DGrTesselatedPathRenderer.cpp112 GrDrawTarget::Edge edge(tangent.fX * scale, in computeEdgesAndOffsetVertices() local
120 GrDrawTarget::Edge edge = edges->at(i); in computeEdgesAndOffsetVertices() local

12