| /third_party/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 19 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 …]
|
| D | SkScanPriv.h | 45 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()
|
| D | SkScan_Path.cpp | 29 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/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_navigator.h | 52 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
|
| D | cord_rep_btree_reader.h | 176 const CordRep* edge = navigator_.InitFirst(tree); in Init() local
183 const CordRep* edge = navigator_.Next(); in Next() local
|
| D | cord_rep_btree_navigator.cc | 70 CordRep* edge = node->Edge(index); in Skip() local
111 CordRep* edge = node->Edge(index); in Read() local
|
| /third_party/ninja/src/ |
| D | state.cc | 26 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
87 Edge* edge = new Edge(); in AddEdge() local
129 void State::AddIn(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddIn()
135 bool State::AddOut(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddOut()
144 void State::AddValidation(Edge* edge, StringPiece path, uint64_t slash_bits) { in AddValidation()
|
| D | build.cc | 61 bool DryRunCommandRunner::StartCommand(Edge* edge) { in StartCommand()
97 Edge* edge = node->in_edge(); in AddSubTarget() local
145 void Plan::EdgeWanted(const Edge* edge) { in EdgeWanted()
155 Edge* edge = *e; in FindWork() local
171 Edge* edge = want_e->first; in ScheduleWork() local
182 bool Plan::EdgeFinished(Edge* edge, EdgeResult result, string* err) { in EdgeFinished()
234 Edge* edge = want_e->first; in EdgeMaybeReady() local
320 Edge* edge = oe->first; in DyndepsLoaded() local
408 Edge* edge = n->in_edge(); in RefreshDyndepDependents() local
423 Edge* edge = *oe; in UnmarkDependents() local
[all …]
|
| D | dyndep.cc | 48 Edge* const edge = *oe; in LoadDyndeps() local
71 Edge* const edge = oe->first; in LoadDyndeps() local
82 bool DyndepLoader::UpdateEdge(Edge* edge, Dyndeps const* dyndeps, in UpdateEdge()
|
| D | graph_test.cc | 110 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
152 Edge* edge = GetNode("out.imp")->in_edge(); in TEST_F() local
224 Edge* edge = GetNode("out 1")->in_edge(); in TEST_F() local
255 Edge* edge = GetNode("a b")->in_edge(); in TEST_F() local
315 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
327 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
339 Edge* edge = GetNode("out")->in_edge(); in TEST_F() local
440 Edge* edge = GetNode("a")->in_edge(); in TEST_F() local
465 Edge* edge = GetNode("a")->in_edge(); in TEST_F() local
492 Edge* edge = GetNode("a")->in_edge(); in TEST_F() local
[all …]
|
| D | graph.cc | 86 Edge* edge = node->in_edge(); in RecomputeNodeDirty() local
227 Edge* edge = node->in_edge(); in VerifyDAG() local
265 bool DependencyScan::RecomputeOutputsDirty(Edge* edge, Node* most_recent_input, in RecomputeOutputsDirty()
278 bool DependencyScan::RecomputeOutputDirty(const Edge* edge, in RecomputeOutputDirty()
598 bool ImplicitDepLoader::LoadDeps(Edge* edge, string* err) { in LoadDeps()
622 bool ImplicitDepLoader::LoadDepFile(Edge* edge, const string& path, in LoadDepFile()
686 Edge* edge, std::vector<StringPiece>* depfile_ins, std::string* err) { in ProcessDepfileDeps()
705 bool ImplicitDepLoader::LoadDepsFromLog(Edge* edge, string* err) { in LoadDepsFromLog()
732 vector<Node*>::iterator ImplicitDepLoader::PreallocateSpace(Edge* edge, in PreallocateSpace()
|
| D | manifest_parser_test.cc | 89 Edge* edge = state.GetNode("result", 0)->in_edge(); in TEST_F() local
142 Edge* edge = state.edges_[0]; in TEST_F() local
161 Edge* edge = state.edges_[0]; in TEST_F() local
394 Edge* edge = node->in_edge(); in TEST_F() local
409 Edge* edge = node->in_edge(); in TEST_F() local
955 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
964 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
973 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
984 Edge* edge = state.LookupNode("imp")->in_edge(); in TEST_F() local
995 Edge* edge = state.LookupNode("foo")->in_edge(); in TEST_F() local
[all …]
|
| D | status.cc | 48 void StatusPrinter::BuildEdgeStarted(const Edge* edge, in BuildEdgeStarted()
61 void StatusPrinter::BuildEdgeFinished(Edge* edge, int64_t end_time_millis, in BuildEdgeFinished()
230 void StatusPrinter::PrintStatus(const Edge* edge, int64_t time_millis) { in PrintStatus()
|
| D | missing_deps.cc | 51 Edge* edge, std::vector<StringPiece>* depfile_ins, std::string* err) { in ProcessDepfileDeps()
81 Edge* edge = node->in_edge(); in ProcessNode() local
111 Edge* edge = node->in_edge(); in ProcessNodeDeps() local
|
| /third_party/node/deps/v8/src/compiler/ |
| D | node-properties.cc | 26 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge()
34 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge()
42 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge()
50 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge()
58 bool NodeProperties::IsControlEdge(Edge edge) { in IsControlEdge()
68 for (Edge const edge : node->use_edges()) { in IsExceptionalCall() local
82 for (Edge const edge : node->use_edges()) { in FindSuccessfulControlProjection() local
181 for (Edge edge : node->use_edges()) { in ReplaceUses() local
248 for (Edge const edge : node->use_edges()) { in CollectValueProjections() local
265 for (Edge const edge : node->use_edges()) { in CollectControlProjections() local
[all …]
|
| D | wasm-escape-analysis.cc | 29 for (Edge edge : node->use_edges()) { in ReduceAllocateRaw() local
41 for (Edge edge : value_edges) { in ReduceAllocateRaw() local
|
| D | memory-optimizer.cc | 246 const Edge edge) { in AllocationTypeNeedsUpdateToOld()
279 for (Edge const edge : node->use_edges()) { in VisitAllocateRaw() local
292 for (Edge const edge : node->use_edges()) { in VisitAllocateRaw() local
459 for (Edge const edge : node->use_edges()) { in EnqueueUses() local
|
| D | graph-reducer.cc | 223 for (Edge edge : node->use_edges()) { in Replace() local
234 for (Edge edge : node->use_edges()) { in Replace() local
261 for (Edge edge : node->use_edges()) { in ReplaceWithValue() local
|
| /third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/ |
| D | place-dep.js | 89 edge: this.edge, property
327 edge: peerEdge, property
491 warnPeerConflict (edge, dep) { argument
499 failPeerConflict (edge, dep) { argument
506 explainPeerConflict (edge, dep) { argument
514 edge: edge.explain(), property
|
| D | printable.js | 130 constructor (edge) { argument
148 constructor (edge) { argument
168 constructor (edge) { argument
|
| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | SubgroupOptimizer.java | 90 private static int getEdgeWeight(DfaEdge edge) { in getEdgeWeight()
125 public void visit(DfaNode source, DfaEdge edge, DfaNode target) { in visit()
162 public void visit(DfaNode source, DfaEdge edge, DfaNode target) { in visit()
|
| /third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | RangeTreeConverterTest.java | 121 SimpleEdge edge(int n) { in edge() method in RangeTreeConverterTest
130 Node assertOutEdge(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) { in assertOutEdge()
148 Node follow(ValueGraph<Node, SimpleEdge> nfa, Node node, SimpleEdge edge) { in follow()
|
| /third_party/node/deps/npm/lib/commands/ |
| D | audit.js | 49 const mapper = async (edge) => { argument
237 getEdgeType (edge) { argument
244 getEdgeSpec (edge) { argument
271 getValidPackageInfo (edge) { argument
330 async getVerifiedInfo (edge) { argument
|
| /third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/ |
| D | esextcTessellationShaderVertexSpacing.cpp | 176 _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/skia/src/gpu/geometry/ |
| D | GrTriangulator.cpp | 289 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 …]
|