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

1234567891011

/external/replicaisland/tools/
H A DExtractPoints.js27 * edge calculation for debugging purposes.
75 var edge = new Object;
77 edge.startX = firstPoint.anchor[0];
78 edge.startY = firstPoint.anchor[1];
80 edge.endX = lastPoint.anchor[0];
81 edge.endY = lastPoint.anchor[1];
83 var normalX = -(edge.endY - edge.startY);
84 var normalY = edge.endX - edge
[all...]
/external/skia/src/core/
H A DSkEdgeBuilder.cpp21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { argument
22 if (last->fCurveCount || last->fDX || edge->fX != last->fX) {
25 if (edge->fWinding == last->fWinding) {
26 if (edge->fLastY + 1 == last->fFirstY) {
27 last->fFirstY = edge->fFirstY;
30 if (edge->fFirstY == last->fLastY + 1) {
31 last->fLastY = edge->fLastY;
36 if (edge->fFirstY == last->fFirstY) {
37 if (edge->fLastY == last->fLastY) {
40 if (edge
66 CombineVertical( const SkAnalyticEdge* edge, SkAnalyticEdge* last) argument
113 vertical_line(const SkEdge* edge) argument
117 vertical_line(const SkAnalyticEdge* edge) argument
129 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); local
147 SkEdge* edge = fAlloc.make<SkEdge>(); local
174 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); local
181 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); local
197 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); local
204 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); local
243 checkVertical(const SkEdge* edge, SkEdge** edgePtr) argument
248 checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr) argument
270 char* edge; local
[all...]
H A DSkEdgeBuilder.h44 // returns the number of built edges. The array of those edge pointers
63 Combine CombineVertical(const SkEdge* edge, SkEdge* last);
64 Combine CombineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last);
65 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr);
66 Combine checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr);
67 bool vertical_line(const SkEdge* edge);
68 bool vertical_line(const SkAnalyticEdge* edge);
94 inline void addPolyLine(SkPoint pts[], char* &edge, size_t edgeSize, char** &edgePtr, argument
97 if (((SkLine*)edge)->set(pts)) {
98 *edgePtr++ = edge;
[all...]
H A DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { argument
46 edge->fPrev->fNext = edge->fNext;
47 edge->fNext->fPrev = edge->fPrev;
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { argument
52 edge->fPrev = afterMe;
53 edge->fNext = afterMe->fNext;
54 afterMe->fNext->fPrev = edge;
55 afterMe->fNext = edge;
59 backward_insert_edge_based_on_x(EdgeType* edge) argument
[all...]
/external/skqp/src/core/
H A DSkEdgeBuilder.cpp21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { argument
22 if (last->fCurveCount || last->fDX || edge->fX != last->fX) {
25 if (edge->fWinding == last->fWinding) {
26 if (edge->fLastY + 1 == last->fFirstY) {
27 last->fFirstY = edge->fFirstY;
30 if (edge->fFirstY == last->fLastY + 1) {
31 last->fLastY = edge->fLastY;
36 if (edge->fFirstY == last->fFirstY) {
37 if (edge->fLastY == last->fLastY) {
40 if (edge
66 CombineVertical( const SkAnalyticEdge* edge, SkAnalyticEdge* last) argument
113 vertical_line(const SkEdge* edge) argument
117 vertical_line(const SkAnalyticEdge* edge) argument
129 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); local
147 SkEdge* edge = fAlloc.make<SkEdge>(); local
174 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); local
181 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); local
197 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); local
204 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); local
243 checkVertical(const SkEdge* edge, SkEdge** edgePtr) argument
248 checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr) argument
270 char* edge; local
[all...]
H A DSkEdgeBuilder.h44 // returns the number of built edges. The array of those edge pointers
63 Combine CombineVertical(const SkEdge* edge, SkEdge* last);
64 Combine CombineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last);
65 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr);
66 Combine checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr);
67 bool vertical_line(const SkEdge* edge);
68 bool vertical_line(const SkAnalyticEdge* edge);
94 inline void addPolyLine(SkPoint pts[], char* &edge, size_t edgeSize, char** &edgePtr, argument
97 if (((SkLine*)edge)->set(pts)) {
98 *edgePtr++ = edge;
[all...]
H A DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { argument
46 edge->fPrev->fNext = edge->fNext;
47 edge->fNext->fPrev = edge->fPrev;
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { argument
52 edge->fPrev = afterMe;
53 edge->fNext = afterMe->fNext;
54 afterMe->fNext->fPrev = edge;
55 afterMe->fNext = edge;
59 backward_insert_edge_based_on_x(EdgeType* edge) argument
[all...]
/external/v8/tools/clang/blink_gc_plugin/
H A DCheckGCRootsVisitor.cpp19 it->second.edge()->Accept(this);
25 void CheckGCRootsVisitor::VisitValue(Value* edge) { argument
27 if (edge->value()->record()->isUnion())
31 if (visiting_set_.find(edge->value()) != visiting_set_.end())
34 visiting_set_.insert(edge->value());
42 ContainsGCRoots(edge->value());
43 visiting_set_.erase(edge->value());
46 void CheckGCRootsVisitor::VisitPersistent(Persistent* edge) { argument
50 void CheckGCRootsVisitor::AtCollection(Collection* edge) { argument
51 if (edge
[all...]
H A DCheckFieldsVisitor.cpp32 current_->edge()->Accept(this);
37 void CheckFieldsVisitor::AtMember(Member* edge) { argument
50 void CheckFieldsVisitor::AtIterator(Iterator* edge) { argument
54 if (edge->IsUnsafe())
58 void CheckFieldsVisitor::AtValue(Value* edge) { argument
60 if (edge->value()->record()->isUnion())
63 if (!stack_allocated_host_ && edge->value()->IsStackAllocated()) {
69 edge->value()->IsGCDerived() &&
70 !edge->value()->IsGCMixin()) {
86 edge
112 AtCollection(Collection* edge) argument
[all...]
H A DCheckGCRootsVisitor.h28 void VisitValue(Value* edge) override;
29 void VisitPersistent(Persistent* edge) override;
30 void AtCollection(Collection* edge) override;
H A DCheckFinalizerVisitor.cpp20 void VisitMember(Member* edge) override;
21 void VisitCollection(Collection* edge) override;
43 void MightBeCollectedVisitor::VisitMember(Member* edge) { argument
45 if (edge->ptr()->IsValue()) {
46 Value* member = static_cast<Value*>(edge->ptr());
57 void MightBeCollectedVisitor::VisitCollection(Collection* edge) { argument
58 if (edge->on_heap() && !is_eagerly_finalized_) {
59 might_be_collected_ = !edge->is_root();
61 edge->AcceptMembers(this);
130 point->edge()
[all...]
H A DCheckFieldsVisitor.h43 void AtMember(Member* edge) override;
44 void AtValue(Value* edge) override;
45 void AtCollection(Collection* edge) override;
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DFASerializer.java97 // and then ordered by edge labels then by target state number :)
124 Transition edge = (Transition) s.transition(i);
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);
155 if ( edge.isAction() ) {
158 else if ( edge
[all...]
/external/v8/src/compiler/
H A Dgraph-trimmer.cc33 for (Edge edge : live->use_edges()) {
34 Node* const user = edge.from();
38 os << "DeadLink: " << *user << "(" << edge.index() << ") -> " << *live
41 edge.UpdateTo(nullptr);
H A Dnode-properties.cc89 bool NodeProperties::IsValueEdge(Edge edge) { argument
90 Node* const node = edge.from();
91 return IsInputRange(edge, FirstValueIndex(node),
97 bool NodeProperties::IsContextEdge(Edge edge) { argument
98 Node* const node = edge.from();
99 return IsInputRange(edge, FirstContextIndex(node),
105 bool NodeProperties::IsFrameStateEdge(Edge edge) { argument
106 Node* const node = edge.from();
107 return IsInputRange(edge, FirstFrameStateIndex(node),
113 bool NodeProperties::IsEffectEdge(Edge edge) { argument
121 IsControlEdge(Edge edge) argument
476 IsInputRange(Edge edge, int first, int num) argument
[all...]
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
H A DPathProfiling.cpp28 // v->w, insert edge ENTRY->w and edge v->EXIT.
33 // Chord - An edge not in the spanning tree.
108 // instrumentation that will end up on each edge.
115 // Sets the target node of this edge. Required to split edges.
118 // Get/set whether edge is in the spanning tree.
122 // Get/ set whether this edge will be instrumented with a path number
127 // Get/set whether this edge will be instrumented with a path counter
134 // Get/set the path number increment that this edge will be instrumented
142 // Get/set whether the edge ha
393 operator <<(raw_ostream& os, const BLInstrumentationEdge& edge) argument
651 BallLarusEdge* edge; local
781 unlinkEdge(BallLarusEdge* edge) argument
790 makeEdgeSpanning(BLInstrumentationEdge* edge) argument
796 pushInitializationFromEdge( BLInstrumentationEdge* edge) argument
824 pushCountersFromEdge(BLInstrumentationEdge* edge) argument
901 createIncrementConstant( BLInstrumentationEdge* edge) argument
1078 insertInstrumentationStartingAt(BLInstrumentationEdge* edge, BLInstrumentationDag* dag) argument
1402 splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag) argument
[all...]
/external/freetype/src/autofit/
H A Daflatin2.c790 /* already on an edge ?, backtrack to find its start */
1133 /* to find an edge in our table that corresponds to its position. */
1135 /* If no edge is found, we create and insert a new edge in the */
1136 /* sorted table. Otherwise, we simply add the segment to the edge's */
1138 /* edge's properties. */
1140 /* Note that the edges table is sorted along the segment/edge */
1181 /* look for an edge corresponding to the segment */
1184 AF_Edge edge = axis->edges + ee; local
1188 dist = seg->pos - edge
1201 AF_Edge edge; local
1256 AF_Edge edge; local
1414 AF_Edge edge = axis->edges; local
1867 AF_Edge edge; local
[all...]
H A Daflatin.c1565 /* we are already on an edge, try to locate its start */
1629 /* points are different: we are just leaving an edge, thus */
1784 /* if we are not on an edge, check whether the major direction */
2108 /* an edge in our table that corresponds to its position. */
2110 /* If no edge is found, we create and insert a new edge in the */
2111 /* sorted table. Otherwise, we simply add the segment to the edge's */
2113 /* edge's properties. */
2115 /* Note that the table of edges is sorted along the segment/edge */
2120 /* assure that edge distanc
2151 AF_Edge edge = axis->edges + ee; local
2168 AF_Edge edge; local
2215 AF_Edge edge = axis->edges + ee; local
2263 AF_Edge edge; local
2428 AF_Edge edge = axis->edges; local
2935 AF_Edge edge; local
[all...]
H A Dafcjk.c1007 /* an edge in our table that corresponds to its position. */
1009 /* If no edge is found, we create and insert a new edge in the */
1010 /* sorted table. Otherwise, we simply add the segment to the edge's */
1012 /* edge's properties. */
1014 /* Note that the edges table is sorted along the segment/edge */
1033 /* look for an edge corresponding to the segment */
1036 AF_Edge edge = axis->edges + ee; local
1040 if ( edge->dir != seg->dir )
1043 dist = seg->pos - edge
1085 AF_Edge edge; local
1140 AF_Edge edge; local
1273 AF_Edge edge = axis->edges; local
1659 af_hint_normal_stem( AF_GlyphHints hints, AF_Edge edge, AF_Edge edge2, FT_Pos anchor, AF_Dimension dim ) argument
1794 AF_Edge edge; local
2172 AF_Edge edge; local
[all...]
/external/opencv/cvaux/src/
H A Dcvsubdiv2.cpp59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local
61 if( edge && CV_IS_SET_ELEM( edge ))
65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j;
107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge )
109 CvSubdiv2DEdge t = edge;
120 while( t != edge && count < subdiv->quad_edges * 4 );
128 t = edge;
142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 ));
173 CvQuadEdge2D *edge local
[all...]
/external/tensorflow/tensorflow/compiler/jit/
H A Dbuild_xla_launch_ops_pass.cc91 for (const Edge* edge : node->in_edges()) {
92 if (edge->IsControlEdge()) {
93 graph->AddControlEdge(edge->src(), launch_node);
95 graph->AddEdge(edge->src(), edge->src_output(), launch_node,
96 edge->dst_input());
103 for (const Edge* edge : out_edges) {
104 Node* dst = edge->dst();
105 int src_output = edge->src_output();
106 int dst_input = edge
[all...]
/external/flatbuffers/tests/fuzzer/
H A Dbuild_run_verifier_test.sh17 clang++ -fsanitize-coverage=edge -fsanitize=address -std=c++11 -stdlib=libstdc++ -I.. -I../../include flatbuffers_verifier_fuzzer.cc libFuzzer.a -o fuzz_verifier
/external/mesa3d/src/gallium/drivers/nouveau/codegen/
H A Dnv50_ir_graph.cpp97 Edge *edge = new Edge(this, node, kind); local
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
[all...]
/external/pdfium/xfa/fxfa/
H A Dcxfa_ffline.cpp101 CXFA_Edge* edge = line->GetEdgeIfExists(); local
102 if (edge && !edge->IsVisible())
105 if (edge) {
106 lineColor = edge->GetColor();
107 iStrokeType = edge->GetStrokeType();
108 fLineWidth = edge->GetThickness();
109 iCap = edge->GetCapType();
/external/opencv/cv/src/
H A Dcvsubdivision2d.cpp78 CvQuadEdge2D *edge = 0; local
88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges );
91 memset( edge->pt, 0, sizeof( edge->pt ));
92 edgehandle = (CvSubdiv2DEdge) edge;
94 edge->next[0] = edgehandle;
95 edge->next[1] = edgehandle + 3;
96 edge->next[2] = edgehandle + 2;
97 edge->next[3] = edgehandle + 1;
143 cvSubdiv2DSetEdgePoints( CvSubdiv2DEdge edge, argument
254 CvSubdiv2DEdge edge = 0; local
734 CvSubdiv2DEdge edge; local
[all...]

Completed in 748 milliseconds

1234567891011