Home
last modified time | relevance | path

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

12345678910

/third_party/skia/src/core/
H A 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 in combineVertical()
60 combineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last) combineVertical() argument
111 is_vertical(const Edge* edge) is_vertical() argument
120 SkEdge* edge = fAlloc.make<SkEdge>(); addLine() local
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); addLine() local
149 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); addQuad() local
155 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); addQuad() local
162 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); addCubic() local
168 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); addCubic() local
178 auto edge = (SkEdge*) arg_edge; addPolyLine() local
190 auto edge = (SkAnalyticEdge*) arg_edge; addPolyLine() local
235 char* edge = this->allocEdges(maxEdgeCount, &edgeSize); buildPoly() local
[all...]
H A 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 backward_insert_edge_based_on_x(EdgeType* edge) backward_insert_edge_based_on_x() argument
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Dplace-dep.js1 // Given a dep, a node that depends on it, and the edge representing that
29 this.edge = options.edge
50 this.current = this.edge.to
51 this.name = this.edge.name
54 // nothing to do if the edge is fine as it is
55 if (this.edge.to &&
56 !this.edge.error &&
58 !this.updateNames.includes(this.edge.name) &&
59 !this.auditReport?.isVulnerable(this.edge
[all...]
H A Dnode.js33 const Edge = require('./edge.js')
359 for (const edge of this.edgesOut.values()) {
360 edge.detach()
376 this.edgesIn.forEach(edge => edge.reload(true))
379 // node.explain(nodes seen already, edge we're trying to satisfy
380 // if edge is not specified, it lists every edge into the node.
381 explain (edge = null, seen = []) {
386 return this[_explanation] = this[_explain](edge, see
[all...]
/third_party/ninja/src/
H A Dgraphviz.cc34 Edge* edge = node->in_edge(); in AddTarget() local
36 if (!edge) { in AddTarget()
42 if (visited_edges_.find(edge) != visited_edges_.end()) in AddTarget()
44 visited_edges_.insert(edge); in AddTarget()
46 if (edge->dyndep_ && edge->dyndep_->dyndep_pending()) { in AddTarget()
48 if (!dyndep_loader_.LoadDyndeps(edge->dyndep_, &err)) { in AddTarget()
53 if (edge->inputs_.size() == 1 && edge->outputs_.size() == 1) { in AddTarget()
58 edge in AddTarget()
[all...]
H A Dgraph.cc85 Edge* edge = node->in_edge(); in RecomputeNodeDirty() local
86 if (!edge) { in RecomputeNodeDirty()
90 // This node has no in-edge; it is dirty if it is missing. in RecomputeNodeDirty()
94 EXPLAIN("%s has no in-edge and is missing", node->path().c_str()); in RecomputeNodeDirty()
99 // If we already finished this edge then we are done. in RecomputeNodeDirty()
100 if (edge->mark_ == Edge::VisitDone) in RecomputeNodeDirty()
103 // If we encountered this edge earlier in the call stack we have a cycle. in RecomputeNodeDirty()
107 // Mark the edge temporarily while in the call stack. in RecomputeNodeDirty()
108 edge->mark_ = Edge::VisitInStack; in RecomputeNodeDirty()
112 edge in RecomputeNodeDirty()
226 Edge* edge = node->in_edge(); VerifyDAG() local
264 RecomputeOutputsDirty(Edge* edge, Node* most_recent_input, bool* outputs_dirty, string* err) RecomputeOutputsDirty() argument
277 RecomputeOutputDirty(const Edge* edge, const Node* most_recent_input, const string& command, Node* output) RecomputeOutputDirty() argument
629 LoadDeps(Edge* edge, string* err) LoadDeps() argument
653 LoadDepFile(Edge* edge, const string& path, string* err) LoadDepFile() argument
716 ProcessDepfileDeps( Edge* edge, std::vector<StringPiece>* depfile_ins, std::string* err) ProcessDepfileDeps() argument
735 LoadDepsFromLog(Edge* edge, string* err) LoadDepsFromLog() argument
761 PreallocateSpace(Edge* edge, int count) PreallocateSpace() argument
[all...]
H A Dstate.cc26 void Pool::EdgeScheduled(const Edge& edge) { in EdgeScheduled() argument
28 current_use_ += edge.weight(); in EdgeScheduled()
31 void Pool::EdgeFinished(const Edge& edge) { in EdgeFinished() argument
33 current_use_ -= edge.weight(); in EdgeFinished()
36 void Pool::DelayEdge(Edge* edge) { in DelayEdge() argument
38 delayed_.insert(edge); in DelayEdge()
44 Edge* edge = *it; in RetrieveReadyEdges() local
45 if (current_use_ + edge->weight() > depth_) in RetrieveReadyEdges()
47 ready_queue->insert(edge); in RetrieveReadyEdges()
48 EdgeScheduled(*edge); in RetrieveReadyEdges()
87 Edge* edge = new Edge(); AddEdge() local
129 AddIn(Edge* edge, StringPiece path, uint64_t slash_bits) AddIn() argument
136 AddOut(Edge* edge, StringPiece path, uint64_t slash_bits) AddOut() argument
147 AddValidation(Edge* edge, StringPiece path, uint64_t slash_bits) AddValidation() argument
[all...]
H A Dbuild.cc52 virtual bool StartCommand(Edge* edge);
63 bool DryRunCommandRunner::StartCommand(Edge* edge) { in StartCommand() argument
64 finished_.push(edge); in StartCommand()
73 result->edge = finished_.front(); in WaitForCommand()
99 Edge* edge = node->in_edge(); in AddSubTarget() local
100 if (!edge) { in AddSubTarget()
105 // since there is no producing edge to add to the plan. in AddSubTarget()
116 if (edge->outputs_ready()) in AddSubTarget()
119 // If an entry in want_ does not already exist for edge, create an entry which in AddSubTarget()
122 want_.insert(make_pair(edge, kWantNothin in AddSubTarget()
152 EdgeWanted(const Edge* edge) EdgeWanted() argument
166 Edge* edge = *e; FindWork() local
182 Edge* edge = want_e->first; ScheduleWork() local
193 EdgeFinished(Edge* edge, EdgeResult result, string* err) EdgeFinished() argument
245 Edge* edge = want_e->first; EdgeMaybeReady() local
334 Edge* edge = oe->first; DyndepsLoaded() local
422 Edge* edge = n->in_edge(); RefreshDyndepDependents() local
437 Edge* edge = *oe; UnmarkDependents() local
512 StartCommand(Edge* edge) StartCommand() argument
662 Edge* edge = plan_.FindWork(); Build() local
809 GetContent(Edge* edge) GetContent() argument
823 StartEdge(Edge* edge, string* err) StartEdge() argument
873 Edge* edge = result->edge; FinishCommand() local
[all...]
H A Ddyndep.cc44 // Update each edge that specified this node as its dyndep binding. in LoadDyndeps()
48 Edge* const edge = *oe; in LoadDyndeps() local
49 if (edge->dyndep_ != node) in LoadDyndeps()
52 DyndepFile::iterator ddi = ddf->find(edge); in LoadDyndeps()
54 *err = ("'" + edge->outputs_[0]->path() + "' " in LoadDyndeps()
62 if (!UpdateEdge(edge, &dyndeps, err)) { in LoadDyndeps()
71 Edge* const edge = oe->first; in LoadDyndeps() local
73 "'" + edge->outputs_[0]->path() + "' whose build statement " in LoadDyndeps()
82 bool DyndepLoader::UpdateEdge(Edge* edge, Dyndeps const* dyndeps, in UpdateEdge() argument
84 // Add dyndep-discovered bindings to the edge in UpdateEdge()
[all...]
H A Dgraph_test.cc110 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
111 EXPECT_EQ(2, edge->outputs_.size()); in TEST_F()
112 EXPECT_EQ("out", edge->outputs_[0]->path()); in TEST_F()
113 EXPECT_EQ("out.imp", edge->outputs_[1]->path()); in TEST_F()
114 EXPECT_EQ(1, edge->implicit_outs_); in TEST_F()
115 EXPECT_EQ(edge, GetNode("out.imp")->in_edge()); in TEST_F()
152 Edge* edge = GetNode("out.imp")->in_edge(); in TEST_F() local
153 EXPECT_EQ(1, edge->outputs_.size()); in TEST_F()
154 EXPECT_EQ("out.imp", edge->outputs_[0]->path()); in TEST_F()
155 EXPECT_EQ(1, edge in TEST_F()
224 Edge* edge = GetNode("out 1")->in_edge(); TEST_F() local
255 Edge* edge = GetNode("a b")->in_edge(); TEST_F() local
315 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
327 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
339 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
440 Edge* edge = GetNode("a")->in_edge(); TEST_F() local
465 Edge* edge = GetNode("a")->in_edge(); TEST_F() local
492 Edge* edge = GetNode("a")->in_edge(); TEST_F() local
536 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
566 Edge* edge = GetNode("out1")->in_edge(); TEST_F() local
911 Edge* edge = GetNode("out")->in_edge(); TEST_F() local
[all...]
H A Dmanifest_parser_test.cc89 Edge* edge = state.GetNode("result", 0)->in_edge(); in TEST_F() local
90 EXPECT_TRUE(edge->GetBindingBool("restat")); in TEST_F()
91 EXPECT_FALSE(edge->GetBindingBool("generator")); in TEST_F()
142 Edge* edge = state.edges_[0]; in TEST_F() local
143 EXPECT_EQ("cat in\nin2 > out", edge->EvaluateCommand()); in TEST_F()
161 Edge* edge = state.edges_[0]; in TEST_F() local
163 edge->EvaluateCommand()); in TEST_F()
166 edge = state.edges_[1]; in TEST_F()
168 edge->EvaluateCommand()); in TEST_F()
394 Edge* edge in TEST_F() local
409 Edge* edge = node->in_edge(); TEST_F() local
955 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
964 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
973 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
984 Edge* edge = state.LookupNode("imp")->in_edge(); TEST_F() local
995 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
1006 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
1019 Edge* edge = state.LookupNode("foo")->in_edge(); TEST_F() local
1104 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1127 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1139 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1151 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
1163 Edge* edge = state.GetNode("result", 0)->in_edge(); TEST_F() local
[all...]
H A Dstatus.cc51 void StatusPrinter::EdgeAddedToPlan(const Edge* edge) { in EdgeAddedToPlan() argument
54 // Do we know how long did this edge take last time? in EdgeAddedToPlan()
55 if (edge->prev_elapsed_time_millis != -1) { in EdgeAddedToPlan()
58 eta_predictable_cpu_time_total_millis_ += edge->prev_elapsed_time_millis; in EdgeAddedToPlan()
60 edge->prev_elapsed_time_millis; in EdgeAddedToPlan()
65 void StatusPrinter::EdgeRemovedFromPlan(const Edge* edge) { in EdgeRemovedFromPlan() argument
68 // Do we know how long did this edge take last time? in EdgeRemovedFromPlan()
69 if (edge->prev_elapsed_time_millis != -1) { in EdgeRemovedFromPlan()
72 eta_predictable_cpu_time_total_millis_ -= edge->prev_elapsed_time_millis; in EdgeRemovedFromPlan()
74 edge in EdgeRemovedFromPlan()
79 BuildEdgeStarted(const Edge* edge, int64_t start_time_millis) BuildEdgeStarted() argument
414 PrintStatus(const Edge* edge, int64_t time_millis) PrintStatus() argument
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_navigator.cc33 // Adopts a reference on `rep`. Rep must be a valid data edge. Returns
70 CordRep* edge = node->Edge(index); in Skip() local
72 // Overall logic: Find an edge of at least the length we need to skip. in Skip()
75 // up the tree, and repeat until we either find the edge, or until we hit in Skip()
77 while (n >= edge->length) { in Skip()
78 n -= edge->length; in Skip()
84 edge = node->Edge(index); in Skip()
90 node = edge->btree(); in Skip()
94 edge = node->Edge(index); in Skip()
95 while (n >= edge in Skip()
111 CordRep* edge = node->Edge(index); Read() local
[all...]
H A Dcord_rep_btree_navigator.h41 // A navigator only keeps positional state on the 'current data edge', it does
49 // Returns the current leaf edge for the desired seek or skip position and
50 // the offset of that position inside that edge.
52 CordRep* edge; member
60 // edge of the tree.
72 // Returns the data edge of the current position.
76 // Resets this navigator to `tree`, returning the first data edge in the tree.
79 // Resets this navigator to `tree`, returning the last data edge in the tree.
82 // Resets this navigator to `tree` returning the data edge at position
83 // `offset` and the relative offset of `offset` into that data edge
193 CordRepBtree* edge = node_[height]; Seek() local
216 CordRepBtree* edge = node_[0]; Next() local
221 CordRepBtree* edge = node_[0]; Previous() local
227 CordRepBtree* edge; NextUp() local
245 CordRepBtree* edge; PreviousUp() local
[all...]
/third_party/mesa3d/src/gallium/auxiliary/tessellator/
H A Dtessellator.cpp566 // Clamp edge TessFactors in QuadProcessTessFactors()
637 int edge, axis; in QuadProcessTessFactors() local
640 for( edge = 0; edge < QUAD_EDGES; edge++ ) in QuadProcessTessFactors()
642 int edgeEven = isEven(outsideTessFactor[edge]); in QuadProcessTessFactors()
643 processedTessFactors.outsideTessFactorParity[edge] = edgeEven ? TESSELLATOR_PARITY_EVEN : TESSELLATOR_PARITY_ODD; in QuadProcessTessFactors()
654 for( edge = 0; edge < QUAD_EDGES; edge in QuadProcessTessFactors()
735 int edge; QuadGeneratePoints() local
864 int edge; QuadGenerateConnectivity() local
1145 int edge; TriProcessTessFactors() local
1241 int edge; TriGeneratePoints() local
1351 int edge; TriGenerateConnectivity() local
2198 int edge, axis; QuadHLSLProcessTessFactors() local
2442 int edge; TriHLSLProcessTessFactors() local
[all...]
/third_party/skia/third_party/externals/freetype/src/autofit/
H A Daflatin.c1619 /* we are already on an edge, try to locate its start */ in FT_LOCAL_DEF()
1683 /* points are different: we are just leaving an edge, thus */ in FT_LOCAL_DEF()
1838 /* if we are not on an edge, check whether the major direction */ in FT_LOCAL_DEF()
2182 * an edge in our table that corresponds to its position. in FT_LOCAL_DEF()
2184 * If no edge is found, we create and insert a new edge in the in FT_LOCAL_DEF()
2185 * sorted table. Otherwise, we simply add the segment to the edge's in FT_LOCAL_DEF()
2187 * edge's properties. in FT_LOCAL_DEF()
2189 * Note that the table of edges is sorted along the segment/edge in FT_LOCAL_DEF()
2194 /* assure that edge distanc in FT_LOCAL_DEF()
2225 AF_Edge edge = axis->edges + ee; FT_LOCAL_DEF() local
2242 AF_Edge edge; FT_LOCAL_DEF() local
2289 AF_Edge edge = axis->edges + ee; FT_LOCAL_DEF() local
2337 AF_Edge edge; FT_LOCAL_DEF() local
2502 AF_Edge edge = axis->edges; af_latin_hints_compute_blue_edges() local
2998 AF_Edge edge; af_latin_hint_edges() local
[all...]
H A Dafcjk.c1024 * an edge in our table that corresponds to its position. in af_cjk_hints_compute_edges()
1026 * If no edge is found, we create and insert a new edge in the in af_cjk_hints_compute_edges()
1027 * sorted table. Otherwise, we simply add the segment to the edge's in af_cjk_hints_compute_edges()
1029 * edge's properties. in af_cjk_hints_compute_edges()
1031 * Note that the edges table is sorted along the segment/edge in af_cjk_hints_compute_edges()
1050 /* look for an edge corresponding to the segment */ in af_cjk_hints_compute_edges()
1053 AF_Edge edge = axis->edges + ee; in af_cjk_hints_compute_edges() local
1057 if ( edge->dir != seg->dir ) in af_cjk_hints_compute_edges()
1060 dist = seg->pos - edge in af_cjk_hints_compute_edges()
1102 AF_Edge edge; af_cjk_hints_compute_edges() local
1157 AF_Edge edge; af_cjk_hints_compute_edges() local
1293 AF_Edge edge = axis->edges; af_cjk_hints_compute_blue_edges() local
1668 af_hint_normal_stem( AF_GlyphHints hints, AF_Edge edge, AF_Edge edge2, FT_Pos anchor, AF_Dimension dim ) af_hint_normal_stem() argument
1803 AF_Edge edge; af_cjk_hint_edges() local
2181 AF_Edge edge; af_cjk_align_edge_points() local
[all...]
/third_party/mesa3d/src/util/
H A Ddag.c33 struct dag_edge edge = { in append_edge() local
38 util_dynarray_append(&parent->edges, struct dag_edge, edge); in append_edge()
43 * Adds a directed edge from the parent node to the child.
45 * Both nodes should have been initialized with dag_init_node(). The edge
51 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) { in dag_add_edge()
52 if (edge->child == child && edge->data == data) in dag_add_edge()
60 * Adds a directed edge from the parent node to the child.
63 * already an existing edge, the data is updated to the maximum of the
71 util_dynarray_foreach(&parent->edges, struct dag_edge, edge) { in dag_add_edge_max_data()
88 dag_remove_edge(struct dag *dag, struct dag_edge *edge) dag_remove_edge() argument
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dbuild-ideal-tree.js340 for (const edge of node.edgesOut.values()) {
341 children.push(edge.to)
347 for (const edge of node.edgesOut.values()) {
348 if (!edge.valid) {
591 for (const edge of node.edgesIn) {
592 this.addTracker('idealTree', edge.from.name, edge.from.location)
593 this.#depsQueue.push(edge.from)
674 for (const edge of node.edgesIn) {
675 this.addTracker('idealTree', edge
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrTriangulator.cpp152 // If the edge's vertices differ by many orders of magnitude, the computed line equation can have
271 // If the intersection is on any interior edge, it needs to stay fully opaque or later in intersect()
276 // construction on the outer edge. in intersect()
279 // Could be two connectors crossing, or a connector crossing an outer edge. in intersect()
289 void GrTriangulator::EdgeList::insert(Edge* edge, Edge* prev, Edge* next) { in insert() argument
290 list_insert<Edge, &Edge::fLeft, &Edge::fRight>(edge, prev, next, &fHead, &fTail); in insert()
293 void GrTriangulator::EdgeList::remove(Edge* edge) { in remove() argument
294 TESS_LOG("removing edge %g -> %g\n", edge->fTop->fID, edge in remove()
299 addEdge(Edge* edge) addEdge() argument
689 remove_edge_above(Edge* edge) remove_edge_above() argument
697 remove_edge_below(Edge* edge) remove_edge_below() argument
736 rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, const Comparator& c) rewind_if_necessary() argument
774 setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, const Comparator& c) const setTop() argument
788 setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, const Comparator& c) const setBottom() argument
802 mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current, const Comparator& c) const mergeEdgesAbove() argument
823 mergeEdgesBelow(Edge* edge, Edge* other, EdgeList* activeEdges, Vertex** current, const Comparator& c) const mergeEdgesBelow() argument
860 mergeCollinearEdges(Edge* edge, EdgeList* activeEdges, Vertex** current, const Comparator& c) const mergeCollinearEdges() argument
881 splitEdge(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, const Comparator& c) const splitEdge() argument
960 Edge* edge = this->makeEdge(prev, next, type, c); makeConnectingEdge() local
[all...]
/third_party/skia/third_party/externals/freetype/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 in cf2_hint_init()
184 /* Now that ghost hints have been detected, adjust this edge for */ in cf2_hint_init()
310 CF2_Hint hint = &hintmap->edge[i]; in cf2_hintmap_dump()
349 csCoord >= hintmap->edge[i + 1].csCoord ) in cf2_hintmap_map()
353 while ( i > 0 && csCoord < hintmap->edge[i].csCoord ) in cf2_hintmap_map()
358 if ( i == 0 && csCoord < hintmap->edge[0].csCoord ) in cf2_hintmap_map()
360 /* special case for points below first edge: use uniform scale */ in cf2_hintmap_map()
362 hintmap->edge[0].csCoord ), in cf2_hintmap_map()
364 hintmap->edge[ in cf2_hintmap_map()
976 CF2_HintRec edge, invalid; cf2_hintmap_build() local
[all...]
/third_party/node/deps/v8/src/compiler/
H A Dnode-properties.cc26 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge() argument
27 Node* const node = edge.from(); in IsValueEdge()
28 return IsInputRange(edge, FirstValueIndex(node), in IsValueEdge()
34 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge() argument
35 Node* const node = edge.from(); in IsContextEdge()
36 return IsInputRange(edge, FirstContextIndex(node), in IsContextEdge()
42 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge() argument
43 Node* const node = edge.from(); in IsFrameStateEdge()
44 return IsInputRange(edge, FirstFrameStateIndex(node), in IsFrameStateEdge()
50 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge() argument
58 IsControlEdge(Edge edge) IsControlEdge() argument
636 IsInputRange(Edge edge, int first, int num) IsInputRange() argument
[all...]
H A Dwasm-escape-analysis.cc29 for (Edge edge : node->use_edges()) { in ReduceAllocateRaw()
30 if (NodeProperties::IsValueEdge(edge)) { in ReduceAllocateRaw()
31 if (edge.index() != 0 || in ReduceAllocateRaw()
32 (edge.from()->opcode() != IrOpcode::kStoreToObject && in ReduceAllocateRaw()
33 edge.from()->opcode() != IrOpcode::kInitializeImmutableInObject)) { in ReduceAllocateRaw()
36 value_edges.push_back(edge); in ReduceAllocateRaw()
41 for (Edge edge : value_edges) { in ReduceAllocateRaw()
42 DCHECK(NodeProperties::IsValueEdge(edge)); in ReduceAllocateRaw()
43 DCHECK_EQ(edge.index(), 0); in ReduceAllocateRaw()
44 Node* use = edge in ReduceAllocateRaw()
[all...]
/third_party/skia/third_party/externals/freetype/src/sdf/
H A Dftsdf.c80 * foreach edge in contour:
82 * // get shortest distance from point (x, y) to the edge
83 * d = get_min_dist(x, y, edge);
104 * each type of edge, check out the `get_min_distance_*' functions.
220 * Undefined edge, simply used to initialize and detect errors.
284 * Represent an edge of a contour.
288 * Start position of an edge. Valid for all types of edges.
291 * Etart position of an edge. Valid for all types of edges.
294 * A control point of the edge. Valid only for `SDF_EDGE_CONIC`
298 * Another control point of the edge
683 SDF_Edge* edge = NULL; sdf_line_to() local
726 SDF_Edge* edge = NULL; sdf_conic_to() local
768 SDF_Edge* edge = NULL; sdf_cubic_to() local
1233 SDF_Edge* edge = edges; split_sdf_shape() local
1352 SDF_Edge* edge = edge_list; sdf_shape_dump() local
2862 sdf_edge_get_min_distance( SDF_Edge* edge, FT_26D6_Vec point, SDF_Signed_Distance* out ) sdf_edge_get_min_distance() argument
[all...]
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverterTest.java47 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testSimple()
48 node = assertOutEdge(nfa, node, edge(2)); in testSimple()
61 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testWithOptionalEdge()
62 node = assertOutEdge(nfa, node, edge(2)); in testWithOptionalEdge()
75 Node node = assertOutEdge(nfa, INITIAL, edge(1)); in testWithEpsilon()
76 assertOutEdges(nfa, node, edge(2), epsilon()); in testWithEpsilon()
79 node = follow(nfa, node, edge(2)); in testWithEpsilon()
80 // The other is the normal edge that leads to the terminal. in testWithEpsilon()
95 assertOutEdges(nfa, INITIAL, edge(1), edge( in testMultiplePathsWithCommonTail()
121 SimpleEdge edge(int n) { edge() method in RangeTreeConverterTest
130 assertOutEdge(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) assertOutEdge() argument
148 follow(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) follow() argument
[all...]

Completed in 19 milliseconds

12345678910