Home
last modified time | relevance | path

Searched refs:edge (Results 1 – 25 of 897) sorted by relevance

12345678910>>...36

/external/replicaisland/tools/
DExtractPoints.js75 var edge = new Object; variable
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.startX;
90 edge.normalX = normalX;
91 edge.normalY = normalY;
102 totalX += edge.endX;
[all …]
/external/skia/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical() argument
20 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in combineVertical()
23 if (edge->fWinding == last->fWinding) { in combineVertical()
24 if (edge->fLastY + 1 == last->fFirstY) { in combineVertical()
25 last->fFirstY = edge->fFirstY; in combineVertical()
28 if (edge->fFirstY == last->fLastY + 1) { in combineVertical()
29 last->fLastY = edge->fLastY; in combineVertical()
34 if (edge->fFirstY == last->fFirstY) { in combineVertical()
35 if (edge->fLastY == last->fLastY) { in combineVertical()
38 if (edge->fLastY < last->fLastY) { in combineVertical()
[all …]
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge() argument
46 edge->fPrev->fNext = edge->fNext; in remove_edge()
47 edge->fNext->fPrev = edge->fPrev; in remove_edge()
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after() argument
52 edge->fPrev = afterMe; in insert_edge_after()
53 edge->fNext = afterMe->fNext; in insert_edge_after()
54 afterMe->fNext->fPrev = edge; in insert_edge_after()
55 afterMe->fNext = edge; in insert_edge_after()
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x() argument
60 SkFixed x = edge->fX; in backward_insert_edge_based_on_x()
[all …]
DSkScan_Path.cpp29 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
32 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
33 edge->validate(); in validate_sort()
34 SkASSERT(y <= edge->fFirstY); in validate_sort()
36 y = edge->fFirstY; in validate_sort()
37 edge = edge->fNext; in validate_sort()
41 #define validate_sort(edge) argument
76 static void validate_edges_for_y(const SkEdge* edge, int curr_y) { in validate_edges_for_y() argument
77 while (edge->fFirstY <= curr_y) { in validate_edges_for_y()
78 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
[all …]
/external/skqp/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical() argument
20 if (last->fCurveCount || last->fDX || edge->fX != last->fX) { in combineVertical()
23 if (edge->fWinding == last->fWinding) { in combineVertical()
24 if (edge->fLastY + 1 == last->fFirstY) { in combineVertical()
25 last->fFirstY = edge->fFirstY; in combineVertical()
28 if (edge->fFirstY == last->fLastY + 1) { in combineVertical()
29 last->fLastY = edge->fLastY; in combineVertical()
34 if (edge->fFirstY == last->fFirstY) { in combineVertical()
35 if (edge->fLastY == last->fLastY) { in combineVertical()
38 if (edge->fLastY < last->fLastY) { in combineVertical()
[all …]
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge() argument
46 edge->fPrev->fNext = edge->fNext; in remove_edge()
47 edge->fNext->fPrev = edge->fPrev; in remove_edge()
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after() argument
52 edge->fPrev = afterMe; in insert_edge_after()
53 edge->fNext = afterMe->fNext; in insert_edge_after()
54 afterMe->fNext->fPrev = edge; in insert_edge_after()
55 afterMe->fNext = edge; in insert_edge_after()
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x() argument
60 SkFixed x = edge->fX; in backward_insert_edge_based_on_x()
[all …]
DSkScan_Path.cpp29 static void validate_sort(const SkEdge* edge) { in validate_sort() argument
32 while (edge->fFirstY != SK_MaxS32) { in validate_sort()
33 edge->validate(); in validate_sort()
34 SkASSERT(y <= edge->fFirstY); in validate_sort()
36 y = edge->fFirstY; in validate_sort()
37 edge = edge->fNext; in validate_sort()
41 #define validate_sort(edge) argument
76 static void validate_edges_for_y(const SkEdge* edge, int curr_y) { in validate_edges_for_y() argument
77 while (edge->fFirstY <= curr_y) { in validate_edges_for_y()
78 SkASSERT(edge->fPrev && edge->fNext); in validate_edges_for_y()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/Analysis/BranchProbabilityInfo/
Dbasic.ll9 ; CHECK: edge entry -> body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
20 ; CHECK: edge body -> exit probability is 0x04000000 / 0x80000000 = 3.12%
21 ; CHECK: edge body -> body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
32 ; CHECK: edge entry -> then probability is 0x78787878 / 0x80000000 = 94.12% [HOT edge]
33 ; CHECK: edge entry -> else probability is 0x07878788 / 0x80000000 = 5.88%
37 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
41 ; CHECK: edge else -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
57 ; CHECK: edge entry -> case_a probability is 0x06666666 / 0x80000000 = 5.00%
58 ; CHECK: edge entry -> case_b probability is 0x06666666 / 0x80000000 = 5.00%
59 ; CHECK: edge entry -> case_c probability is 0x66666666 / 0x80000000 = 80.00%
[all …]
Dloop.ll14 ; CHECK: edge entry -> do.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
20 ; CHECK: edge do.body -> do.body1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
28 ; CHECK: edge do.body1 -> do.body1 probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
29 ; CHECK: edge do.body1 -> do.end probability is 0x04000000 / 0x80000000 = 3.12%
36 ; CHECK: edge do.end -> do.body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
37 ; CHECK: edge do.end -> do.end5 probability is 0x04000000 / 0x80000000 = 3.12%
48 ; CHECK: edge entry -> for.body.lr.ph probability is 0x50000000 / 0x80000000 = 62.50%
49 ; CHECK: edge entry -> for.end6 probability is 0x30000000 / 0x80000000 = 37.50%
54 ; CHECK: edge for.body.lr.ph -> for.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
60 ; CHECK: edge for.body -> for.body3 probability is 0x50000000 / 0x80000000 = 62.50%
[all …]
Dlibfunc_call.ll22 ; CHECK: edge entry -> then probability is 0x30000000 / 0x80000000 = 37.50%
23 ; CHECK: edge entry -> else probability is 0x50000000 / 0x80000000 = 62.50%
27 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
31 ; CHECK: edge else -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
44 ; CHECK: edge entry -> then probability is 0x50000000 / 0x80000000 = 62.50%
45 ; CHECK: edge entry -> else probability is 0x30000000 / 0x80000000 = 37.50%
49 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
53 ; CHECK: edge else -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
66 ; CHECK: edge entry -> then probability is 0x40000000 / 0x80000000 = 50.00%
67 ; CHECK: edge entry -> else probability is 0x40000000 / 0x80000000 = 50.00%
[all …]
Dnoreturn.ll12 ; CHECK: edge entry -> exit probability is 0x7fffffff / 0x80000000 = 100.00% [HOT edge]
13 ; CHECK: edge entry -> abort probability is 0x00000001 / 0x80000000 = 0.00%
30 ; CHECK: edge entry -> exit probability is 0x7ffffffc / 0x80000000 = 100.00% [HOT edge]
31 ; CHECK: edge entry -> case_a probability is 0x00000001 / 0x80000000 = 0.00%
32 ; CHECK: edge entry -> case_b probability is 0x00000001 / 0x80000000 = 0.00%
33 ; CHECK: edge entry -> case_c probability is 0x00000001 / 0x80000000 = 0.00%
34 ; CHECK: edge entry -> case_d probability is 0x00000001 / 0x80000000 = 0.00%
59 ; CHECK: edge entry -> exit probability is 0x7fffffff / 0x80000000 = 100.00% [HOT edge]
60 ; CHECK: edge entry -> dom probability is 0x00000001 / 0x80000000 = 0.00%
65 ; CHECK: edge dom -> idom1 probability is 0x40000000 / 0x80000000 = 50.00%
[all …]
/external/llvm/test/Analysis/BranchProbabilityInfo/
Dloop.ll13 ; CHECK: edge entry -> do.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
19 ; CHECK: edge do.body -> do.body1 probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
27 ; CHECK: edge do.body1 -> do.body1 probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
28 ; CHECK: edge do.body1 -> do.end probability is 0x04000000 / 0x80000000 = 3.12%
35 ; CHECK: edge do.end -> do.body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
36 ; CHECK: edge do.end -> do.end5 probability is 0x04000000 / 0x80000000 = 3.12%
47 ; CHECK: edge entry -> for.body.lr.ph probability is 0x50000000 / 0x80000000 = 62.50%
48 ; CHECK: edge entry -> for.end6 probability is 0x30000000 / 0x80000000 = 37.50%
53 ; CHECK: edge for.body.lr.ph -> for.body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
59 ; CHECK: edge for.body -> for.body3 probability is 0x50000000 / 0x80000000 = 62.50%
[all …]
Dbasic.ll8 ; CHECK: edge entry -> body probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
19 ; CHECK: edge body -> exit probability is 0x04000000 / 0x80000000 = 3.12%
20 ; CHECK: edge body -> body probability is 0x7c000000 / 0x80000000 = 96.88% [HOT edge]
31 ; CHECK: edge entry -> then probability is 0x78787878 / 0x80000000 = 94.12% [HOT edge]
32 ; CHECK: edge entry -> else probability is 0x07878788 / 0x80000000 = 5.88%
36 ; CHECK: edge then -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
40 ; CHECK: edge else -> exit probability is 0x80000000 / 0x80000000 = 100.00% [HOT edge]
56 ; CHECK: edge entry -> case_a probability is 0x06666666 / 0x80000000 = 5.00%
57 ; CHECK: edge entry -> case_b probability is 0x06666666 / 0x80000000 = 5.00%
58 ; CHECK: edge entry -> case_c probability is 0x66666666 / 0x80000000 = 80.00%
[all …]
/external/freetype/src/autofit/
Daflatin2.c1184 AF_Edge edge = axis->edges + ee; in af_latin2_hints_compute_edges() local
1188 dist = seg->pos - edge->fpos; in af_latin2_hints_compute_edges()
1192 if ( dist < edge_distance_threshold && edge->dir == seg->dir ) in af_latin2_hints_compute_edges()
1194 found = edge; in af_latin2_hints_compute_edges()
1201 AF_Edge edge; in af_latin2_hints_compute_edges() local
1207 memory, &edge ); in af_latin2_hints_compute_edges()
1212 FT_ZERO( edge ); in af_latin2_hints_compute_edges()
1214 edge->first = seg; in af_latin2_hints_compute_edges()
1215 edge->last = seg; in af_latin2_hints_compute_edges()
1216 edge->dir = seg->dir; in af_latin2_hints_compute_edges()
[all …]
Daflatin.c2170 AF_Edge edge = axis->edges + ee; in af_latin_hints_compute_edges() local
2174 dist = seg->pos - edge->fpos; in af_latin_hints_compute_edges()
2178 if ( dist < edge_distance_threshold && edge->dir == seg->dir ) in af_latin_hints_compute_edges()
2180 found = edge; in af_latin_hints_compute_edges()
2187 AF_Edge edge; in af_latin_hints_compute_edges() local
2195 memory, &edge ); in af_latin_hints_compute_edges()
2200 FT_ZERO( edge ); in af_latin_hints_compute_edges()
2202 edge->first = seg; in af_latin_hints_compute_edges()
2203 edge->last = seg; in af_latin_hints_compute_edges()
2204 edge->dir = seg->dir; in af_latin_hints_compute_edges()
[all …]
Dafcjk.c1060 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges() local
1064 if ( edge->dir != seg->dir ) in af_cjk_hints_compute_edges()
1067 dist = seg->pos - edge->fpos; in af_cjk_hints_compute_edges()
1080 AF_Segment seg1 = edge->first; in af_cjk_hints_compute_edges()
1096 } while ( ( seg1 = seg1->edge_next ) != edge->first ); in af_cjk_hints_compute_edges()
1103 found = edge; in af_cjk_hints_compute_edges()
1109 AF_Edge edge; in af_cjk_hints_compute_edges() local
1116 memory, &edge ); in af_cjk_hints_compute_edges()
1121 FT_ZERO( edge ); in af_cjk_hints_compute_edges()
1123 edge->first = seg; in af_cjk_hints_compute_edges()
[all …]
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
DPathProfiling.cpp241 void unlinkEdge(BallLarusEdge* edge);
244 void makeEdgeSpanning(BLInstrumentationEdge* edge);
247 void pushInitializationFromEdge(BLInstrumentationEdge* edge);
250 void pushCountersFromEdge(BLInstrumentationEdge* edge);
288 ConstantInt* createIncrementConstant(BLInstrumentationEdge* edge);
331 BLInstrumentationEdge* edge,
336 bool splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag);
391 const BLInstrumentationEdge& edge)
394 const BLInstrumentationEdge& edge) { in operator <<() argument
395 os << "[" << edge.getSource()->getName() << " -> " in operator <<()
[all …]
/external/skia/src/gpu/
DGrTessellator.cpp443 void insert(Edge* edge, Edge* prev, Edge* next) { in insert()
444 list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); in insert()
449 void remove(Edge* edge) { in remove()
450 list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail); in remove()
463 bool contains(Edge* edge) const { in contains()
464 return edge->fLeft || edge->fRight || fHead == edge; in contains()
469 Event(Edge* edge, bool isOuterBoundary, const SkPoint& point, uint8_t alpha) in Event()
470 : fEdge(edge), fIsOuterBoundary(isOuterBoundary), fPoint(point), fAlpha(alpha) in Event()
521 MonotonePoly(Edge* edge, Side side) in MonotonePoly()
527 this->addEdge(edge); in MonotonePoly()
[all …]
/external/skqp/src/gpu/
DGrTessellator.cpp443 void insert(Edge* edge, Edge* prev, Edge* next) { in insert()
444 list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); in insert()
449 void remove(Edge* edge) { in remove()
450 list_remove<Edge, &Edge::fLeft, &Edge::fRight>(edge, &fHead, &fTail); in remove()
463 bool contains(Edge* edge) const { in contains()
464 return edge->fLeft || edge->fRight || fHead == edge; in contains()
469 Event(Edge* edge, bool isOuterBoundary, const SkPoint& point, uint8_t alpha) in Event()
470 : fEdge(edge), fIsOuterBoundary(isOuterBoundary), fPoint(point), fAlpha(alpha) in Event()
521 MonotonePoly(Edge* edge, Side side) in MonotonePoly()
527 this->addEdge(edge); in MonotonePoly()
[all …]
/external/antlr/tool/src/main/java/org/antlr/tool/
DFASerializer.java124 Transition edge = s.transition(i); in walkFANormalizingStateNumbers() local
125 walkFANormalizingStateNumbers(edge.target); // keep walkin' in walkFANormalizingStateNumbers()
129 if ( edge instanceof RuleClosureTransition ) { in walkFANormalizingStateNumbers()
130 walkFANormalizingStateNumbers(((RuleClosureTransition) edge).followState); in walkFANormalizingStateNumbers()
152 Transition edge = s.transition(i); in walkSerializingFA() local
155 if ( edge.isAction() ) { in walkSerializingFA()
158 else if ( edge.isEpsilon() ) { in walkSerializingFA()
161 else if ( edge.isSemanticPredicate() ) { in walkSerializingFA()
162 buf.append("-{").append(edge.label.getSemanticContext()).append("}?->"); in walkSerializingFA()
166 if ( edge.target instanceof DFAState ) { in walkSerializingFA()
[all …]
/external/mesa3d/src/gallium/drivers/nouveau/codegen/
Dnv50_ir_graph.cpp97 Edge *edge = new Edge(this, node, kind); in attach() local
101 edge->next[0] = this->out; in attach()
102 edge->prev[0] = this->out->prev[0]; in attach()
103 edge->prev[0]->next[0] = edge; in attach()
104 this->out->prev[0] = edge; in attach()
106 this->out = edge; in attach()
109 edge->next[1] = node->in; in attach()
110 edge->prev[1] = node->in->prev[1]; in attach()
111 edge->prev[1]->next[1] = edge; in attach()
112 node->in->prev[1] = edge; in attach()
[all …]
/external/tensorflow/tensorflow/core/graph/
Dgraph_partition.cc124 bool NeedSameDeviceSendRecv(const Edge* edge, const GraphInfo& info) { in NeedSameDeviceSendRecv() argument
125 if (edge->IsControlEdge()) { in NeedSameDeviceSendRecv()
129 const Node* src = edge->src(); in NeedSameDeviceSendRecv()
130 const Node* dst = edge->dst(); in NeedSameDeviceSendRecv()
132 int src_port = edge->src_output(); in NeedSameDeviceSendRecv()
133 int dst_port = edge->dst_input(); in NeedSameDeviceSendRecv()
146 bool IsDstInputOnHost(const Edge* edge, const GraphInfo& info) { in IsDstInputOnHost() argument
147 const Node* dst = edge->dst(); in IsDstInputOnHost()
148 int dst_port = edge->dst_input(); in IsDstInputOnHost()
150 if (edge->IsControlEdge()) return false; in IsDstInputOnHost()
[all …]
Dquantize_training.cc50 const Edge* edge; member
59 : edge(e), in EdgeToConvert()
111 for (const Edge* edge : node->in_edges()) { in FindType() local
112 if (edge->src_output() != Graph::kControlSlot && edge->dst_input() == 0) { in FindType()
113 FindType(graph, edge->src(), signed_input, range_given, input_min, in FindType()
121 for (const Edge* edge : node->in_edges()) { in FindType() local
122 if (edge->src_output() != Graph::kControlSlot) { in FindType()
123 FindType(graph, edge->src(), signed_input, range_given, input_min, in FindType()
237 for (const Edge* edge : save_op->out_edges()) { in ConnectVariablesToSaveOp() local
238 graph->AddControlEdge(new_save_op, edge->dst()); in ConnectVariablesToSaveOp()
[all …]
/external/freetype/src/psaux/
Dpshints.c313 CF2_Hint hint = &hintmap->edge[i]; in cf2_hintmap_dump()
352 csCoord >= hintmap->edge[i + 1].csCoord ) in cf2_hintmap_map()
356 while ( i > 0 && csCoord < hintmap->edge[i].csCoord ) in cf2_hintmap_map()
361 if ( i == 0 && csCoord < hintmap->edge[0].csCoord ) in cf2_hintmap_map()
365 hintmap->edge[0].csCoord ), in cf2_hintmap_map()
367 hintmap->edge[0].dsCoord ); in cf2_hintmap_map()
376 hintmap->edge[i].csCoord ), in cf2_hintmap_map()
377 hintmap->edge[i].scale ), in cf2_hintmap_map()
378 hintmap->edge[i].dsCoord ); in cf2_hintmap_map()
416 FT_Bool isPair = cf2_hint_isPair( &hintmap->edge[i] ); in cf2_hintmap_adjustHints()
[all …]
/external/v8/src/compiler/
Dnode-properties.cc90 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge() argument
91 Node* const node = edge.from(); in IsValueEdge()
92 return IsInputRange(edge, FirstValueIndex(node), in IsValueEdge()
98 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge() argument
99 Node* const node = edge.from(); in IsContextEdge()
100 return IsInputRange(edge, FirstContextIndex(node), in IsContextEdge()
106 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge() argument
107 Node* const node = edge.from(); in IsFrameStateEdge()
108 return IsInputRange(edge, FirstFrameStateIndex(node), in IsFrameStateEdge()
114 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge() argument
[all …]

12345678910>>...36