| /external/llvm-project/llvm/unittests/tools/llvm-exegesis/ |
| D | ClusteringTest.cpp | 31 std::vector<InstructionBenchmark> Points(6); in TEST() local
34 Points[0].Measurements = { in TEST()
36 Points[3].Measurements = { in TEST()
39 Points[1].Measurements = { in TEST()
41 Points[4].Measurements = { in TEST()
44 Points[5].Measurements = { in TEST()
47 Points[2].Error = "oops"; in TEST()
50 Points, InstructionBenchmarkClustering::ModeE::Dbscan, 2, 0.25); in TEST()
72 std::vector<InstructionBenchmark> Points(6); in TEST() local
73 Points[0].Measurements = { in TEST()
[all …]
|
| /external/llvm-project/clang-tools-extra/clangd/unittests/ |
| D | PrintASTTests.cpp | 37 Visitor(std::vector<Position> Points) : Points(std::move(Points)) {} in TEST_P()
39 if (TemplateArgsAtPoints.size() == Points.size()) in TEST_P()
43 if (Pos != Points[TemplateArgsAtPoints.size()]) in TEST_P()
49 const std::vector<Position> Points; in TEST_P() member
|
| /external/mesa3d/src/mesa/main/ |
| D | eval.c | 362 free(map->Points); in map1()
363 map->Points = pnts; in map1()
462 free(map->Points); in map2()
463 map->Points = pnts; in map2()
514 data = map1d->Points; in _mesa_GetnMapdvARB()
518 data = map2d->Points; in _mesa_GetnMapdvARB()
604 data = map1d->Points; in _mesa_GetnMapfvARB()
608 data = map2d->Points; in _mesa_GetnMapfvARB()
696 data = map1d->Points; in _mesa_GetnMapivARB()
700 data = map2d->Points; in _mesa_GetnMapivARB()
[all …]
|
| /external/llvm-project/llvm/lib/Testing/Support/ |
| D | Annotations.cpp | 36 Points[Name.getValueOr("")].push_back(Code.size()); in Annotations()
68 auto I = Points.find(Name); in point()
69 require(I != Points.end() && I->getValue().size() == 1, in point()
75 auto I = Points.find(Name); in points()
76 if (I == Points.end()) in points()
|
| /external/llvm-project/llvm/tools/sancov/ |
| D | sancov.cpp | 161 std::vector<CoveragePoint> Points; member
299 const std::vector<CoveragePoint> &Points) { in operator <<() argument
302 for (const auto &Point : Points) { in operator <<()
351 W.attributeObject("point-symbol-info", [&] { W << C.Points; }); in operator <<()
366 std::map<std::string, CoveragePoint> Points; in read() local
385 yaml::SequenceNode *Points = in read() local
387 failIf(!Points, "expected array: " + InputFile); in read()
389 for (auto I = Points->begin(), E = Points->end(); I != E; ++I) { in read()
423 if (Points.find(PointId) == Points.end()) in read()
424 Points.insert(std::make_pair(PointId, CoveragePoint(PointId))); in read()
[all …]
|
| /external/rust/crates/criterion-plot/src/ |
| D | curve.rs | 186 Points { enumerator
208 Curve::Points { .. } => Style::Points, in style()
220 Points, enumerator
231 Style::Points => "points", in display()
256 | Curve::Points { x, y } in plot()
|
| D | prelude.rs | 4 pub use crate::curve::Curve::{Dots, Impulses, Lines, LinesPoints, Points, Steps};
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Testing/Support/ |
| D | Annotations.cpp | 36 Points[Name.getValueOr("")].push_back(Code.size()); in Annotations()
68 auto I = Points.find(Name); in point()
69 require(I != Points.end() && I->getValue().size() == 1, in point()
75 auto P = Points.lookup(Name); in points()
|
| /external/llvm-project/llvm/tools/llvm-exegesis/lib/ |
| D | Analysis.cpp | 217 const auto &Points = Clustering_.getPoints(); in makePointsPerSchedClass() local
218 for (size_t PointId = 0, E = Points.size(); PointId < E; ++PointId) { in makePointsPerSchedClass()
219 const InstructionBenchmark &Point = Points[PointId]; in makePointsPerSchedClass()
298 const auto &Points = Clustering_.getPoints(); in printSchedClassClustersHtml() local
303 Points[Clusters[0].getPointIds()[0]].Measurements) { in printSchedClassClustersHtml()
319 printPointHtml(Points[PointId], OS); in printSchedClassClustersHtml()
434 const auto &Points = Clustering_.getPoints(); in printClusterRawHtml() local
444 for (const auto &Measurement : Points[Cluster.PointIndices[0]].Measurements) { in printClusterRawHtml()
454 printPointHtml(Points[PointId], OS); in printClusterRawHtml()
456 for (const auto &Measurement : Points[PointId].Measurements) { in printClusterRawHtml()
|
| D | Clustering.cpp | 90 const std::vector<InstructionBenchmark> &Points, in InstructionBenchmarkClustering() argument
92 : Points_(Points), in InstructionBenchmarkClustering()
318 const std::vector<InstructionBenchmark> &Points, const ModeE Mode, in create() argument
322 Points, AnalysisClusteringEpsilon * AnalysisClusteringEpsilon); in create()
326 if (Clustering.ErrorCluster_.PointIndices.size() == Points.size()) { in create()
|
| D | Clustering.h | 33 create(const std::vector<InstructionBenchmark> &Points, ModeE Mode,
123 const std::vector<InstructionBenchmark> &Points,
|
| /external/llvm-project/clang/lib/Tooling/ |
| D | InterpolatingCompilationDatabase.cpp | 398 auto Award = [&](int Points, ArrayRef<SubstringAndIndex> Range) { in scoreCandidates() argument
400 Candidates[Entry.second] += Points; in scoreCandidates()
424 int Points; in pickWinner() member
434 S.Points = Candidate.second; in pickWinner()
438 if (S.Points < Best.Points) in pickWinner()
440 if (S.Points == Best.Points) { in pickWinner()
459 return {Best.Index, Best.Points}; in pickWinner()
|
| /external/llvm-project/polly/test/ScheduleOptimizer/ |
| D | rectangular-tiling.ll | 28 ; CHECK: // 1st level tiling - Points
41 ; TWOLEVEL: // 1st level tiling - Points
45 ; TWOLEVEL: // 2nd level tiling - Points
54 ; TWO-PLUS-REGISTER: // 1st level tiling - Points
58 ; TWO-PLUS-REGISTER: // 2nd level tiling - Points
62 ; TWO-PLUS-REGISTER: // Register tiling - Points
|
| /external/mesa3d/src/mesa/vbo/ |
| D | vbo_exec_eval.c | 138 _math_horner_bezier_curve(map->Points, &data[0].f, uu, in vbo_exec_do_EvalCoord1f()
157 _math_horner_bezier_curve(map->Points, vertex, uu, in vbo_exec_do_EvalCoord1f()
185 _math_horner_bezier_surf(map->Points, in vbo_exec_do_EvalCoord2f()
211 _math_de_casteljau_surf(map->Points, vertex, du, dv, uu, vv, in vbo_exec_do_EvalCoord2f()
236 _math_horner_bezier_surf(map->Points, vertex, uu, vv, in vbo_exec_do_EvalCoord2f()
|
| /external/llvm-project/llvm/tools/llvm-exegesis/ |
| D | llvm-exegesis.cpp | 410 const std::vector<InstructionBenchmark> Points = ExitOnFileError( in analysisMain() local
413 outs() << "Parsed " << Points.size() << " benchmark points\n"; in analysisMain()
414 if (Points.empty()) { in analysisMain()
423 TargetRegistry::lookupTarget(Points[0].LLVMTriple, Error); in analysisMain()
425 errs() << "unknown target '" << Points[0].LLVMTriple << "'\n"; in analysisMain()
433 Points, AnalysisClusteringAlgorithm, AnalysisDbscanNumPoints, in analysisMain()
|
| /external/dng_sdk/source/ |
| D | dng_gain_map.cpp | 140 if (fMap.Points ().v < 1) in dng_gain_map_interpolator()
144 uint32 lastRow = static_cast<uint32> (fMap.Points ().v - 1); in dng_gain_map_interpolator()
207 if (fMap.Points ().h < 1) in ResetColumn()
211 uint32 lastCol = static_cast<uint32> (fMap.Points ().h - 1); in ResetColumn()
|
| /external/rust/crates/criterion/src/plot/gnuplot_backend/ |
| D | iteration_times.rs | 33 Points { in iteration_times_figure()
117 Points { in iteration_times_comparison_figure()
129 Points { in iteration_times_comparison_figure()
|
| /external/angle/src/libANGLE/renderer/d3d/ |
| D | RendererD3D.cpp | 49 if (drawMode == gl::PrimitiveMode::Points) in skipDraw()
163 mode == gl::PrimitiveMode::Points; in InstancedPointSpritesActive()
|
| /external/deqp/doc/testspecs/GLES2/ |
| D | functional.scissors.txt | 27 - Points
50 listed above. Points are tested in a somewhat limited fashion since
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue177/ |
| D | Points.java | 20 public class Points { class
|
| /external/pdfium/core/fxcrt/css/ |
| D | cfx_cssnumbervalue.h | 22 Points, enumerator
|
| D | cfx_cssnumbervalue.cpp | 35 case CFX_CSSNumberType::Points: in Apply()
|
| /external/googletest/googlemock/include/gmock/internal/custom/ |
| D | README.md | 1 # Customization Points
|
| /external/skia/modules/svg/include/ |
| D | SkSVGPoly.h | 25 SVG_ATTR(Points, SkSVGPointsType, SkSVGPointsType())
|
| /external/skqp/docs/ |
| D | SkPath_Overview.bmh | 6 Each Line and Curve are described by Verb, Points, and optional Path_Conic_Weight.
15 Lines and Curves with as many Verbs and Points required
82 Contour contains one or more Verbs, and as many Points as
|