Home
last modified time | relevance | path

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

123456789

/third_party/skia/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical()
60 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
111 static bool is_vertical(const Edge* edge) { in is_vertical()
120 SkEdge* edge = fAlloc.make<SkEdge>(); in addLine() local
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine() local
149 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local
155 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local
162 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local
168 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local
178 auto edge = (SkEdge*) arg_edge; in addPolyLine() local
[all …]
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge()
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
DSkScan_Path.cpp29 static void validate_sort(const SkEdge* edge) { 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()
88 #define validate_edges_for_y(edge, curr_y) argument
193 static bool update_edge(SkEdge* edge, int last_y) { in update_edge()
436 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_path() local
686 static int build_tri_edges(SkEdge edge[], const SkPoint pts[], in build_tri_edges()
720 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_triangle() local
/third_party/flutter/skia/src/core/
DSkEdgeBuilder.cpp19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) { in combineVertical()
60 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
111 static bool is_vertical(const Edge* edge) { in is_vertical()
120 SkEdge* edge = fAlloc.make<SkEdge>(); in addLine() local
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine() local
149 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local
155 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local
162 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local
168 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local
178 auto edge = (SkEdge*) arg_edge; in addPolyLine() local
[all …]
DSkScanPriv.h45 static inline void remove_edge(EdgeType* edge) { in remove_edge()
51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
59 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
DSkScan_Path.cpp29 static void validate_sort(const SkEdge* edge) { 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()
88 #define validate_edges_for_y(edge, curr_y) argument
194 static bool update_edge(SkEdge* edge, int last_y) { in update_edge()
437 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_path() local
682 static int build_tri_edges(SkEdge edge[], const SkPoint pts[], in build_tri_edges()
716 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_triangle() local
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
Dcord_rep_btree_navigator.h52 CordRep* edge; member
193 CordRepBtree* edge = node_[height]; in Seek() local
216 CordRepBtree* edge = node_[0]; in Next() local
221 CordRepBtree* edge = node_[0]; in Previous() local
227 CordRepBtree* edge; in NextUp() local
245 CordRepBtree* edge; in PreviousUp() local
Dcord_rep_btree_reader.h176 const CordRep* edge = navigator_.InitFirst(tree); in Init() local
183 const CordRep* edge = navigator_.Next(); in Next() local
Dcord_rep_btree_navigator.cc70 CordRep* edge = node->Edge(index); in Skip() local
111 CordRep* edge = node->Edge(index); in Read() local
/third_party/ninja/src/
Dstate.cc26 void Pool::EdgeScheduled(const Edge& edge) { in EdgeScheduled()
31 void Pool::EdgeFinished(const Edge& edge) { in EdgeFinished()
36 void Pool::DelayEdge(Edge* edge) { in DelayEdge()
44 Edge* edge = *it; in RetrieveReadyEdges() local
95 Edge* edge = new Edge(); in AddEdge() local
137 void State::AddIn(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddIn()
143 bool State::AddOut(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddOut()
Dbuild.cc62 bool DryRunCommandRunner::StartCommand(Edge* edge) { in StartCommand()
99 void BuildStatus::BuildEdgeStarted(const Edge* edge) { in BuildEdgeStarted()
112 void BuildStatus::BuildEdgeFinished(Edge* edge, in BuildEdgeFinished()
293 void BuildStatus::PrintStatus(const Edge* edge, EdgeStatus status) { in PrintStatus()
328 Edge* edge = node->in_edge(); in AddSubTarget() local
376 void Plan::EdgeWanted(const Edge* edge) { in EdgeWanted()
386 Edge* edge = *e; in FindWork() local
402 Edge* edge = want_e->first; in ScheduleWork() local
413 bool Plan::EdgeFinished(Edge* edge, EdgeResult result, string* err) { in EdgeFinished()
465 Edge* edge = want_e->first; in EdgeMaybeReady() local
[all …]
Ddyndep.cc46 Edge* const edge = *oe; in LoadDyndeps() local
69 Edge* const edge = oe->first; in LoadDyndeps() local
80 bool DyndepLoader::UpdateEdge(Edge* edge, Dyndeps const* dyndeps, in UpdateEdge()
Dgraph_test.cc108 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
150 Edge* edge = GetNode("out.imp")->in_edge(); in TEST_F() local
220 Edge* edge = GetNode("a b")->in_edge(); in TEST_F() local
280 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
292 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
304 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
405 Edge* edge = GetNode("a")->in_edge(); in TEST_F() local
430 Edge* edge = GetNode("a")->in_edge(); in TEST_F() local
457 Edge* edge = GetNode("a")->in_edge(); in TEST_F() local
501 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
[all …]
Dmanifest_parser_test.cc87 Edge* edge = state.GetNode("result", 0)->in_edge(); in TEST_F() local
140 Edge* edge = state.edges_[0]; in TEST_F() local
159 Edge* edge = state.edges_[0]; in TEST_F() local
393 Edge* edge = node->in_edge(); in TEST_F() local
408 Edge* edge = node->in_edge(); in TEST_F() local
954 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
963 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
973 Edge* edge = state.LookupNode("imp")->in_edge(); in TEST_F() local
984 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
995 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
[all …]
Dgraph.cc42 Edge* edge = node->in_edge(); in RecomputeDirty() local
175 Edge* edge = node->in_edge(); in VerifyDAG() local
213 bool DependencyScan::RecomputeOutputsDirty(Edge* edge, Node* most_recent_input, in RecomputeOutputsDirty()
226 bool DependencyScan::RecomputeOutputDirty(const Edge* edge, in RecomputeOutputDirty()
502 bool ImplicitDepLoader::LoadDeps(Edge* edge, string* err) { in LoadDeps()
526 bool ImplicitDepLoader::LoadDepFile(Edge* edge, const string& path, in LoadDepFile()
610 bool ImplicitDepLoader::LoadDepsFromLog(Edge* edge, string* err) { in LoadDepsFromLog()
637 vector<Node*>::iterator ImplicitDepLoader::PreallocateSpace(Edge* edge, in PreallocateSpace()
Dbuild_test.cc42 Edge* edge = plan_.FindWork(); in FindWorkSorted() local
64 Edge* edge = plan_.FindWork(); in TEST_F() local
101 Edge* edge; in TEST_F() local
133 Edge* edge; in TEST_F() local
175 Edge* edge; in TEST_F() local
211 Edge* edge = plan_.FindWork(); in TestPoolWithDepthOne() local
293 Edge *edge = edges[i]; in TEST_F() local
300 Edge* edge = edges[4]; in TEST_F() local
368 Edge* edge = NULL; in TEST_F() local
441 Edge* edge = plan_.FindWork(); in TEST_F() local
[all …]
Dstate_test.cc34 Edge* edge = state.AddEdge(rule); in TEST() local
/third_party/parse5/scripts/generate-named-entity-data/
Dradix-tree.js65 static _shortenEdgeAndAddNewNode(edge, newFilter, data) { argument
95 …static _branchEdgeWithNewData(edge, commonPrefix, newDataKey, oldNodeKey, newDataSuffix, oldNodeSu… argument
117 static _splitEdgeWithNewData(edge, commonPrefix, oldNodeKey, oldNodeSuffix, data) { argument
124 static _tryAddDataIntoEdge(edge, cps, i, data) { argument
/third_party/boost/libs/graph/test/
Dbidir_remove_edge.cpp22 typedef boost::graph_traits< graph >::edge_descriptor edge; in main() typedef
39 typedef boost::graph_traits< graph >::edge_descriptor edge; in main() typedef
Ddominator_tree_test.cpp18 typedef pair< int, int > edge; typedef
33 typedef DominatorCorrectnessTestSet::edge edge; in main() typedef
/third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/
DesextcTessellationShaderVertexSpacing.cpp176 _tess_edge& edge = *edges_iterator; in getEdgesForIsolinesTessellation() local
428 _tess_edge& edge = *(edge_ptrs[n_edge]); in getEdgesForQuadsTessellation() local
486 _tess_edge& edge = *(edge_ptrs[n_edge]); in getEdgesForQuadsTessellation() local
505 _tess_edge& edge = *(edge_ptrs[n_edge]); in getEdgesForQuadsTessellation() local
726 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; in getEdgesForTrianglesTessellation() local
836 const std::vector<_tess_coordinate_cartesian>& edge = *edge_ptrs[n_edge_ptr]; in getEdgesForTrianglesTessellation() local
1111 const _tess_edge& edge = *edges_iterator; in verifyEdges() local
/third_party/mesa3d/src/util/
Ddag.c43 struct dag_edge edge = { in dag_add_edge() local
59 dag_remove_edge(struct dag *dag, struct dag_edge *edge) in dag_remove_edge()
/third_party/skia/src/gpu/geometry/
DGrTriangulator.cpp289 void GrTriangulator::EdgeList::insert(Edge* edge, Edge* prev, Edge* next) { in insert()
293 void GrTriangulator::EdgeList::remove(Edge* edge) { in remove()
299 void GrTriangulator::MonotonePoly::addEdge(Edge* edge) { in addEdge()
628 void EdgeList::insert(Edge* edge, Edge* prev) { in insert()
689 static void remove_edge_above(Edge* edge) { in remove_edge_above()
697 static void remove_edge_below(Edge* edge) { in remove_edge_below()
736 static void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, in rewind_if_necessary()
774 void GrTriangulator::setTop(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setTop()
788 void GrTriangulator::setBottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, in setBottom()
802 void GrTriangulator::mergeEdgesAbove(Edge* edge, Edge* other, EdgeList* activeEdges, in mergeEdgesAbove()
[all …]
/third_party/spirv-tools/source/opt/
Dpropagator.h249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Dpropagator.h249 bool MarkEdgeExecutable(const Edge& edge) { in MarkEdgeExecutable()
254 bool IsEdgeExecutable(const Edge& edge) const { in IsEdgeExecutable()

123456789