/external/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 156 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local 162 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local 175 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local 181 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local 197 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 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
|
/external/skqp/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 156 SkQuadraticEdge* edge = fAlloc.make<SkQuadraticEdge>(); in addQuad() local 162 SkAnalyticQuadraticEdge* edge = fAlloc.make<SkAnalyticQuadraticEdge>(); in addQuad() local 175 SkCubicEdge* edge = fAlloc.make<SkCubicEdge>(); in addCubic() local 181 SkAnalyticCubicEdge* edge = fAlloc.make<SkAnalyticCubicEdge>(); in addCubic() local 197 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 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
|
/external/v8/tools/clang/blink_gc_plugin/ |
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 | CheckFieldsVisitor.cpp | 55 void CheckFieldsVisitor::AtIterator(Iterator* edge) { in AtIterator() 63 void CheckFieldsVisitor::AtValue(Value* edge) { in AtValue() 116 void CheckFieldsVisitor::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 | 90 bool NodeProperties::IsValueEdge(Edge edge) { in IsValueEdge() 98 bool NodeProperties::IsContextEdge(Edge edge) { in IsContextEdge() 106 bool NodeProperties::IsFrameStateEdge(Edge edge) { in IsFrameStateEdge() 114 bool NodeProperties::IsEffectEdge(Edge edge) { in IsEffectEdge() 122 bool NodeProperties::IsControlEdge(Edge edge) { in IsControlEdge() 132 for (Edge const edge : node->use_edges()) { in IsExceptionalCall() local 146 for (Edge const edge : node->use_edges()) { in FindSuccessfulControlProjection() local 227 for (Edge edge : node->use_edges()) { in ReplaceUses() local 289 for (Edge const edge : node->use_edges()) { in CollectValueProjections() local 306 for (Edge const edge : node->use_edges()) { in CollectControlProjections() local [all …]
|
D | graph-reducer.cc | 196 for (Edge edge : node->use_edges()) { in Replace() local 207 for (Edge edge : node->use_edges()) { in Replace() local 234 for (Edge edge : node->use_edges()) { in ReplaceWithValue() local
|
/external/tensorflow/tensorflow/core/nccl/ |
D | nccl_rewrite.cc | 46 for (const auto& edge : node->in_edges()) { in ReplaceReduce() local 52 for (const auto& edge : node->out_edges()) { in ReplaceReduce() local 60 for (const auto& edge : node->in_edges()) { in ReplaceReduce() local 126 for (const auto& edge : node->out_edges()) { in ReplaceBroadcast() local 172 for (const auto& edge : node->in_edges()) { in ReplaceBroadcast() 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/tensorflow/tensorflow/compiler/jit/ |
D | encapsulate_xla_computations_pass.cc | 83 DataType EdgeType(const Edge* edge) { in EdgeType() 89 for (const Edge* edge : node.in_edges()) { in AddControlInputs() local 98 for (const Edge* edge : node.out_edges()) { in AddControlOutputs() local 282 const Edge* edge = in_edges[i]; in BuildXlaLaunchOps() local 290 const Edge* edge = in_edges[pos]; in BuildXlaLaunchOps() 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/tool/src/main/java/org/antlr/analysis/ |
D | DFAOptimizer.java | 192 Transition edge = d.transition(i); in optimizeExitBranches() local 221 Transition edge = d.transition(i); in optimizeEOTBranches() local
|
/external/antlr/tool/src/main/java/org/antlr/tool/ |
D | DOTGenerator.java | 133 Transition edge = s.transition(i); in walkCreatingDFADOT() local 208 Transition edge = s.transition(i); in walkRuleNFACreatingDOT() local 284 protected String getEdgeLabel(Transition edge) { in getEdgeLabel()
|
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
D | GraphvizGrapher.java | 167 protected void renderEdge(GraphvizEdge edge) { in renderEdge() 185 protected Map<String, String> getEdgeAttributes(GraphvizEdge edge) { in getEdgeAttributes() 298 protected void newDependencyEdge(DependencyEdge edge) { in newDependencyEdge() 313 protected void newBindingEdge(BindingEdge edge) { in newBindingEdge()
|
/external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
D | vectorization_utils.cc | 56 for (auto edge : old_src.first->out_edges()) { in ReplaceEdgeSources() local 61 for (auto edge : edges_to_replace) { in ReplaceEdgeSources() local 232 for (auto edge : op_node->in_edges()) { in AddConversionMapping() local 255 auto edge = input_edges[i]; in AddConversionMapping() local 551 for (const auto& edge : tensor.first->in_edges()) { in AddUnstackedTensorMappingsHelper() local 581 for (const auto& edge : tensor.first->in_edges()) { in AddUnstackedTensorMappingsHelper() local
|
/external/tensorflow/tensorflow/core/common_runtime/ |
D | memory_types.cc | 115 static string GetTensorName(const Edge* edge) { in GetTensorName() 122 const string& device_name, bool host, const Edge* edge) { in Send() 136 const string& device_name, bool host, const Edge* edge) { in Recv() 153 const Edge* edge; in EnsureMemoryTypes() member
|
/external/tensorflow/tensorflow/core/framework/ |
D | graph_to_functiondef.cc | 155 Edge const* edge; in GraphToFunctionDef() local 191 const Edge* edge = in_edges[i]; in GraphToFunctionDef() local 203 for (const Edge* edge : control_edges) { in GraphToFunctionDef() local
|
/external/tensorflow/tensorflow/core/graph/ |
D | quantize_training.cc | 50 const Edge* edge; member 111 for (const Edge* edge : node->in_edges()) { in FindType() local 121 for (const Edge* edge : node->in_edges()) { in FindType() local 237 for (const Edge* edge : save_op->out_edges()) { in ConnectVariablesToSaveOp() local 503 const EdgeToConvert& edge, in MakeInputMinMax() 537 const string& quant_op_type, const EdgeToConvert& edge, in MakeQuantizeOp() 574 for (const EdgeToConvert edge : target_edges) { in ProcessTargetEdges() local 627 for (const Edge* edge : node->in_edges()) { in DoQuantizeTraining() local
|
/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 …]
|