Home
last modified time | relevance | path

Searched refs:Points (Results 1 – 25 of 116) sorted by relevance

12345

/external/swiftshader/third_party/llvm-7.0/llvm/unittests/tools/llvm-exegesis/
DClusteringTest.cpp26 std::vector<InstructionBenchmark> Points(6); in TEST() local
29 Points[0].Measurements = {{"x", 0.01, ""}, {"y", 1.02, ""}, {"z", 1.98, "A"}}; in TEST()
30 Points[3].Measurements = {{"x", -0.01, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
32 Points[1].Measurements = {{"x", 1.01, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
33 Points[4].Measurements = {{"x", 0.99, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
35 Points[5].Measurements = {{"x", 0.0, ""}, {"y", 0.01, ""}, {"z", -0.02, ""}}; in TEST()
37 Points[2].Error = "oops"; in TEST()
44 auto Clustering = InstructionBenchmarkClustering::create(Points, 2, 0.25); in TEST()
66 std::vector<InstructionBenchmark> Points(6); in TEST() local
67 Points[0].Measurements = {{"x", 0.01, ""}, {"y", 1.02, ""}, {"z", 1.98, ""}}; in TEST()
[all …]
/external/syzkaller/tools/syz-benchcmp/
Dbenchcmp.go30 Points []Point member
63 g.Points = append(g.Points, pt)
68 if len(g.Points) == 0 {
71 sort.Sort(pointSlice(g.Points))
115 max := g.Points[len(g.Points)-1].Time
119 skip := sort.Search(len(g.Points), func(i int) bool {
120 return g.Points[i].Time > skipTime
122 g.Points = g.Points[skip:]
136 for _, pt := range g.Points {
144 for pti := len(g.Points) - 1; pti >= 0; pti-- {
[all …]
/external/mesa3d/src/mesa/main/
Deval.c362 free(map->Points); in map1()
363 map->Points = pnts; in map1()
461 free(map->Points); in map2()
462 map->Points = pnts; in map2()
513 data = map1d->Points; in _mesa_GetnMapdvARB()
517 data = map2d->Points; in _mesa_GetnMapdvARB()
603 data = map1d->Points; in _mesa_GetnMapfvARB()
607 data = map2d->Points; in _mesa_GetnMapfvARB()
695 data = map1d->Points; in _mesa_GetnMapivARB()
699 data = map2d->Points; in _mesa_GetnMapivARB()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/tools/sancov/
Dsancov.cpp161 std::vector<CoveragePoint> Points; member
378 const std::vector<CoveragePoint> &Points) { in operator <<() argument
382 for (const auto &Point : Points) { in operator <<()
447 W << C.Points; in operator <<()
462 std::map<std::string, CoveragePoint> Points; in read() local
481 yaml::SequenceNode *Points = in read() local
483 failIf(!Points, "expected array: " + InputFile); in read()
485 for (auto I = Points->begin(), E = Points->end(); I != E; ++I) { in read()
519 if (Points.find(PointId) == Points.end()) in read()
520 Points.insert(std::make_pair(PointId, CoveragePoint(PointId))); in read()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-exegesis/lib/
DClustering.cpp63 const std::vector<InstructionBenchmark> &Points, in InstructionBenchmarkClustering() argument
65 : Points_(Points), EpsilonSquared_(EpsilonSquared), in InstructionBenchmarkClustering()
158 const std::vector<InstructionBenchmark> &Points, const size_t MinPts, in create() argument
160 InstructionBenchmarkClustering Clustering(Points, Epsilon * Epsilon); in create()
164 if (Clustering.ErrorCluster_.PointIndices.size() == Points.size()) { in create()
DClustering.h29 create(const std::vector<InstructionBenchmark> &Points, size_t MinPts,
96 const std::vector<InstructionBenchmark> &Points, double EpsilonSquared);
DAnalysis.cpp199 const auto &Points = Clustering_.getPoints(); in makePointsPerSchedClass() local
200 for (size_t PointId = 0, E = Points.size(); PointId < E; ++PointId) { in makePointsPerSchedClass()
201 const InstructionBenchmark &Point = Points[PointId]; in makePointsPerSchedClass()
244 const auto &Points = Clustering_.getPoints(); in printSchedClassClustersHtml() local
249 Points[Clusters[0].getPointIds()[0]].Measurements) { in printSchedClassClustersHtml()
267 const auto &Point = Points[PointId]; in printSchedClassClustersHtml()
/external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-exegesis/
Dllvm-exegesis.cpp195 const std::vector<InstructionBenchmark> Points = in analysisMain() local
198 llvm::outs() << "Parsed " << Points.size() << " benchmark points\n"; in analysisMain()
199 if (Points.empty()) { in analysisMain()
208 llvm::TargetRegistry::lookupTarget(Points[0].LLVMTriple, Error); in analysisMain()
210 llvm::errs() << "unknown target '" << Points[0].LLVMTriple << "'\n"; in analysisMain()
214 Points, AnalysisNumPoints, AnalysisEpsilon)); in analysisMain()
/external/mesa3d/src/mesa/vbo/
Dvbo_exec_eval.c138 _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/dng_sdk/source/
Ddng_gain_map.cpp140 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()
Ddng_gain_map.h64 const dng_point & Points () const in Points() function
/external/deqp/doc/testspecs/GLES2/
Dfunctional.scissors.txt27 - Points
50 listed above. Points are tested in a somewhat limited fashion since
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/issues/issue177/
DPoints.java20 public class Points { class
/external/mesa3d/src/mesa/tnl/
Dt_vb_render.c86 tnl->Driver.Render.Points( ctx, start, count )
197 tnl->Driver.Render.Points( ctx, start, count )
282 assert(tnl->Driver.Render.Points); in run_render()
/external/skqp/docs/
DSkPath_Overview.bmh6 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
/external/skia/docs/
DSkPath_Overview.bmh6 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
/external/pdfium/core/fxcrt/css/
Dcfx_cssnumbervalue.h22 Points, enumerator
Dcfx_cssnumbervalue.cpp35 case CFX_CSSNumberType::Points: in Apply()
/external/googletest/googlemock/include/gmock/internal/custom/
DREADME.md1 # Customization Points
/external/grpc-grpc/examples/protos/
Droute_guide.proto44 // Accepts a stream of Points on a route being traversed, returning a
55 // Points are represented as latitude-longitude pairs in the E7 representation
/external/grpc-grpc-java/examples/src/main/proto/
Droute_guide.proto43 // Accepts a stream of Points on a route being traversed, returning a
54 // Points are represented as latitude-longitude pairs in the E7 representation
/external/grpc-grpc-java/examples/android/routeguide/app/src/main/proto/
Droute_guide.proto43 // Accepts a stream of Points on a route being traversed, returning a
54 // Points are represented as latitude-longitude pairs in the E7 representation
/external/deqp/framework/referencerenderer/
DrrPrimitiveTypes.hpp59 … { typedef pa::Point Type; typedef pa::Point BaseType; typedef pa::Points Assembler; };
/external/googletest/googletest/include/gtest/internal/custom/
DREADME.md1 # Customization Points
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/custom/
DREADME.md1 # Customization Points

12345