| /external/skia/src/core/ |
| D | SkEdgeBuilder.cpp | 21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) { in CombineVertical()
67 const SkAnalyticEdge* edge, SkAnalyticEdge* last) { in CombineVertical()
113 bool SkEdgeBuilder::vertical_line(const SkEdge* edge) { in vertical_line()
117 bool SkEdgeBuilder::vertical_line(const SkAnalyticEdge* edge) { in vertical_line()
124 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine() local
142 SkEdge* edge = fAlloc.make<SkEdge>(); in addLine() local
164 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local
171 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local
182 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local
189 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local
[all …]
|
| D | SkScanPriv.h | 43 static inline void remove_edge(EdgeType* edge) { in remove_edge()
49 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { in insert_edge_after()
57 static void backward_insert_edge_based_on_x(EdgeType* edge) { in backward_insert_edge_based_on_x()
|
| D | SkScan_Path.cpp | 24 static void validate_sort(const SkEdge* edge) { in validate_sort()
36 #define validate_sort(edge) argument
71 static void validate_edges_for_y(const SkEdge* edge, int curr_y) { in validate_edges_for_y()
83 #define validate_edges_for_y(edge, curr_y) argument
189 static bool update_edge(SkEdge* edge, int last_y) { in update_edge()
430 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_path() local
684 static int build_tri_edges(SkEdge edge[], const SkPoint pts[], in build_tri_edges()
718 SkEdge* edge = sort_edges(list, count, &last); in sk_fill_triangle() local
|
| /external/v8/tools/clang/blink_gc_plugin/ |
| D | CheckFieldsVisitor.cpp | 37 void CheckFieldsVisitor::AtMember(Member* edge) { in AtMember()
50 void CheckFieldsVisitor::AtIterator(Iterator* edge) { in AtIterator()
58 void CheckFieldsVisitor::AtValue(Value* edge) { in AtValue()
112 void CheckFieldsVisitor::AtCollection(Collection* edge) { in AtCollection()
|
| D | CheckGCRootsVisitor.cpp | 25 void CheckGCRootsVisitor::VisitValue(Value* edge) { in VisitValue()
46 void CheckGCRootsVisitor::VisitPersistent(Persistent* edge) { in VisitPersistent()
50 void CheckGCRootsVisitor::AtCollection(Collection* edge) { in AtCollection()
|
| D | CheckFinalizerVisitor.cpp | 43 void MightBeCollectedVisitor::VisitMember(Member* edge) { in VisitMember()
57 void MightBeCollectedVisitor::VisitCollection(Collection* edge) { in VisitCollection()
|
| /external/v8/src/compiler/ |
| D | node-properties.cc | 89 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge()
97 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge()
105 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge()
113 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge()
121 bool NodeProperties::IsControlEdge(Edge edge) { in IsControlEdge()
131 for (Edge const edge : node->use_edges()) { in IsExceptionalCall() local
211 for (Edge edge : node->use_edges()) { in ReplaceUses() local
273 for (Edge const edge : node->use_edges()) { in CollectControlProjections() local
476 bool NodeProperties::IsInputRange(Edge edge, int first, int num) { in IsInputRange()
|
| D | graph-reducer.cc | 191 for (Edge edge : node->use_edges()) { in Replace() local
202 for (Edge edge : node->use_edges()) { in Replace() local
229 for (Edge edge : node->use_edges()) { in ReplaceWithValue() local
|
| D | graph-trimmer.cc | 33 for (Edge edge : live->use_edges()) { in TrimGraph() local
|
| D | verifier.h | 48 static void VerifyEdgeInputReplacement(const Edge& edge, in VerifyEdgeInputReplacement()
|
| D | control-equivalence.cc | 103 Edge edge = *entry.input; in RunUndirectedDFS() local
133 Edge edge = *entry.use; in RunUndirectedDFS() local
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
| D | PathProfiling.cpp | 394 const BLInstrumentationEdge& edge) { in operator <<()
519 for( BLEdgeIterator edge = _edges.begin(), end = _edges.end(); in getCallPhonyEdges() local
601 for(BLEdgeIterator edge = node->succBegin(), predEnd = node->predEnd(); in calculateSpanningTree() local
620 for(BLEdgeIterator edge = _edges.begin(), end = _edges.end(); in calculateSpanningTree() local
651 BallLarusEdge* edge; in unlinkPhony() local
682 for( BLEdgeIterator edge = _edges.begin(), end = _edges.end(); in generateDotGraph() local
781 void BLInstrumentationDag::unlinkEdge(BallLarusEdge* edge) { in unlinkEdge()
790 void BLInstrumentationDag::makeEdgeSpanning(BLInstrumentationEdge* edge) { in makeEdgeSpanning()
797 BLInstrumentationEdge* edge) { in pushInitializationFromEdge()
824 void BLInstrumentationDag::pushCountersFromEdge(BLInstrumentationEdge* edge) { in pushCountersFromEdge()
[all …]
|
| D | OptimalEdgeProfiling.cpp | 150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); in runOnModule() local
173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); in runOnModule() local
184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); in runOnModule() local
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| D | DFAOptimizer.java | 192 Transition edge = (Transition) d.transition(i); in optimizeExitBranches() local
221 Transition edge = (Transition) d.transition(i); in optimizeEOTBranches() local
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| D | ProfileEstimatorPass.cpp | 134 Edge edge = getEdge(*bbi,BB); in recurseBasicBlock() local
205 Edge edge = getEdge(Latch,0); in recurseBasicBlock() local
267 Edge edge = getEdge(BB,0); in recurseBasicBlock() local
273 Edge edge = getEdge(BB,*bbi); in recurseBasicBlock() local
341 Edge edge = getEdge(0,entry); in runOnFunction() local
|
| D | PathNumbering.cpp | 115 void BallLarusNode::addPredEdge(BallLarusEdge* edge) { in addPredEdge()
120 void BallLarusNode::removePredEdge(BallLarusEdge* edge) { in removePredEdge()
125 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) { in addSuccEdge()
130 void BallLarusNode::removeSuccEdge(BallLarusEdge* edge) { in removeSuccEdge()
255 for(BLEdgeIterator edge = _edges.begin(), end = _edges.end(); edge != end; in ~BallLarusDag() local
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| D | DOTGenerator.java | 133 Transition edge = (Transition) s.transition(i); in walkCreatingDFADOT() local
208 Transition edge = (Transition) s.transition(i); in walkRuleNFACreatingDOT() local
284 protected String getEdgeLabel(Transition edge) { in getEdgeLabel()
|
| D | FASerializer.java | 124 Transition edge = (Transition) s.transition(i); in walkFANormalizingStateNumbers() local
152 Transition edge = (Transition) s.transition(i); in walkSerializingFA() local
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| D | GraphvizGrapher.java | 166 protected void renderEdge(GraphvizEdge edge) { in renderEdge()
178 protected Map<String, String> getEdgeAttributes(GraphvizEdge edge) { in getEdgeAttributes()
288 @Override protected void newDependencyEdge(DependencyEdge edge) { in newDependencyEdge()
302 @Override protected void newBindingEdge(BindingEdge edge) { in newBindingEdge()
|
| /external/libavc/common/ |
| D | ih264_deblk_edge_filters.c | 115 WORD8 i = 0, edge; in ih264_deblk_luma_vert_bs4() local
236 WORD8 i = 0, edge; in ih264_deblk_luma_horz_bs4() local
358 WORD8 i = 0, edge; in ih264_deblk_chroma_vert_bs4_bp() local
450 WORD8 i = 0, edge; in ih264_deblk_chroma_horz_bs4_bp() local
543 WORD8 i = 0, edge; in ih264_deblk_luma_vert_bslt4() local
665 WORD8 i = 0, edge; in ih264_deblk_chroma_vert_bslt4_bp() local
779 WORD8 i = 0, edge; in ih264_deblk_luma_horz_bslt4() local
900 WORD8 i = 0, edge; in ih264_deblk_chroma_horz_bslt4_bp() local
1020 WORD8 i = 0, edge; in ih264_deblk_luma_vert_bs4_mbaff() local
1141 WORD8 edge; in ih264_deblk_chroma_vert_bs4_mbaff_bp() local
[all …]
|
| /external/libpcap/ |
| D | gencode.h | 238 struct edge { struct
244 struct edge *next; /* link list of incoming edges for a node */ argument
|
| /external/guice/extensions/grapher/test/com/google/inject/grapher/ |
| D | AbstractInjectorGrapherTest.java | 71 @Override protected void newDependencyEdge(DependencyEdge edge) { in newDependencyEdge()
76 @Override protected void newBindingEdge(BindingEdge edge) { in newBindingEdge()
|
| /external/pdfium/xfa/fwl/theme/ |
| D | cfwl_edittp.cpp | 27 CXFA_Edge edge = borderUI.GetEdge(0); in DrawBackground() local
|
| /external/skia/src/gpu/ |
| D | GrTessellator.cpp | 782 void remove_edge(Edge* edge, EdgeList* edges) { in remove_edge()
788 void insert_edge(Edge* edge, Edge* prev, EdgeList* edges) { in insert_edge()
813 void insert_edge_above(Edge* edge, Vertex* v, Comparator& c) { in insert_edge_above()
831 void insert_edge_below(Edge* edge, Vertex* v, Comparator& c) { in insert_edge_below()
849 void remove_edge_above(Edge* edge) { in remove_edge_above()
856 void remove_edge_below(Edge* edge) { in remove_edge_below()
863 void disconnect(Edge* edge) in disconnect()
891 void rewind_if_necessary(Edge* edge, EdgeList* activeEdges, Vertex** current, Comparator& c) { in rewind_if_necessary()
928 void set_top(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_top()
937 void set_bottom(Edge* edge, Vertex* v, EdgeList* activeEdges, Vertex** current, Comparator& c) { in set_bottom()
[all …]
|
| /external/v8/tools/turbolizer/ |
| D | graph-view.js | 190 edges.forEach(function(edge) { argument
207 edgeFrontier.forEach(function(edge) { argument
213 edgeFrontier.forEach(function(edge) { argument
322 element.__data__.inputs.forEach(function(edge) { argument
327 element.__data__.outputs.forEach(function(edge) { argument
678 this.visibleEdges.attr("d", function(edge){ argument
694 var visibleEdges = graph.visibleEdges.data(filteredEdges, function(edge) { argument
705 .attr("id", function(edge){ return "e," + edge.stringID(); }) argument
|