/external/chromium_org/gpu/config/ |
H A D | gpu_control_list.cc | 1440 base::DictionaryValue* problem = new base::DictionaryValue(); local 1442 problem->SetString("description", entry->description()); 1447 problem->Set("crBugs", cr_bugs); 1453 problem->Set("webkitBugs", webkit_bugs); 1457 problem->Set("affectedGpuSettings", features); 1460 problem->SetString("tag", tag); 1462 problem_list->Append(problem);
|
/external/chromium_org/components/metrics/ |
H A D | metrics_service.cc | 159 // side, but are not expected to be a significant problem. 459 base::HistogramBase::Inconsistency problem) { 461 problem, base::HistogramBase::NEVER_EXCEEDED_VALUE); 465 base::HistogramBase::Inconsistency problem) { 467 problem, base::HistogramBase::NEVER_EXCEEDED_VALUE); 1101 // Error 400 indicates a problem with the log, not with the server, so 1207 // session visible. The problem is that we always notify using the orginal 458 InconsistencyDetected( base::HistogramBase::Inconsistency problem) argument 464 UniqueInconsistencyDetected( base::HistogramBase::Inconsistency problem) argument
|
H A D | metrics_service.h | 158 base::HistogramBase::Inconsistency problem) OVERRIDE; 160 base::HistogramBase::Inconsistency problem) OVERRIDE;
|
/external/chromium_org/content/browser/gpu/ |
H A D | compositor_util.cc | 346 base::DictionaryValue* problem = new base::DictionaryValue(); local 347 problem->SetString("description", 349 problem->Set("crBugs", new base::ListValue()); 350 problem->Set("webkitBugs", new base::ListValue()); 353 problem->Set("affectedGpuSettings", disabled_features); 354 problem->SetString("tag", "disabledFeatures"); 355 problem_list->Insert(0, problem); 362 base::DictionaryValue* problem = new base::DictionaryValue(); local 363 problem->SetString( 365 problem [all...] |
/external/chromium_org/content/browser/resources/gpu/ |
H A D | info_view.js | 195 var problem = gpuInfo.featureStatus.problems[i]; 196 var problemEl = this.createProblemEl_(problem); 258 createProblemEl_: function(problem) { 264 desc.textContent = problem.description; 268 if (problem.crBugs.length + problem.webkitBugs.length > 0) { 278 for (j = 0; j < problem.crBugs.length; ++j) { 286 var bugid = parseInt(problem.crBugs[j]); 293 for (j = 0; j < problem.webkitBugs.length; ++j) { 301 var bugid = parseInt(problem [all...] |
/external/chromium_org/chrome/browser/resources/media/ |
H A D | webrtc_logs.js | 71 'URL (if applicable) where the problem occurred:', 73 'Can you reproduce this problem?', 75 'What steps will reproduce this problem? (or if it\'s not ' + 76 'reproducible, what were you doing just before the problem)?',
|
/external/chromium_org/ |
H A D | PRESUBMIT.py | 808 problem[0], problem[1], problem[2]) for problem in problems])]
|
/external/chromium_org/base/metrics/ |
H A D | histogram_delta_serialization.cc | 19 // Silently returns when seeing any data problem in the pickle. 97 HistogramBase::Inconsistency problem) { 98 inconsistencies_histogram_->Add(problem); 102 HistogramBase::Inconsistency problem) { 103 inconsistencies_unique_histogram_->Add(problem); 96 InconsistencyDetected( HistogramBase::Inconsistency problem) argument 101 UniqueInconsistencyDetected( HistogramBase::Inconsistency problem) argument
|
H A D | histogram_delta_serialization.h | 44 HistogramBase::Inconsistency problem) OVERRIDE; 46 HistogramBase::Inconsistency problem) OVERRIDE;
|
H A D | histogram_flattener.h | 29 virtual void InconsistencyDetected(HistogramBase::Inconsistency problem) = 0; 34 HistogramBase::Inconsistency problem) = 0;
|
H A D | histogram_snapshot_manager_unittest.cc | 27 HistogramBase::Inconsistency problem) OVERRIDE { 32 HistogramBase::Inconsistency problem) OVERRIDE {
|
/external/ceres-solver/examples/ |
H A D | bundle_adjuster.cc | 31 // An example of solving a dynamically sized problem with various 39 // The problem being solved here is known as a Bundle Adjustment 40 // problem in computer vision. Given a set of 3d points X_1, ..., X_n, 50 // The problem used here comes from a collection of bundle adjustment 250 void BuildProblem(BALProblem* bal_problem, Problem* problem) { argument 289 problem->AddResidualBlock(cost_function, 295 problem->AddResidualBlock(cost_function, loss_function, camera, point); 303 problem->SetParameterization(cameras + camera_block_size * i, 311 Problem problem; local 319 BuildProblem(&bal_problem, &problem); [all...] |
H A D | circle_fit.cc | 47 // There are closed form solutions [1] to this problem which you may want to 128 Problem problem; local 143 problem.AddResidualBlock(cost, loss, &x, &y, &m); 149 // Build and solve the problem. 154 Solve(options, &problem, &summary);
|
H A D | curve_fitting.c | 160 ceres_problem_t* problem; local 165 problem = ceres_create_problem(); 170 problem, 181 ceres_solve(problem); 182 ceres_free_problem(problem);
|
H A D | curve_fitting.cc | 143 Problem problem; local 145 problem.AddResidualBlock( 158 Solve(options, &problem, &summary);
|
H A D | denoising.cc | 88 // Creates a Fields of Experts MAP inference problem. 91 Problem* problem, 100 problem->AddResidualBlock(cost_function, 129 problem->AddResidualBlock(cost_function[alpha_index], 137 // Solves the FoE problem using Ceres and post-processes it to make sure the 139 void SolveProblem(Problem* problem, PGMImage<double>* solution) { argument 157 ceres::Solve(options, problem, &summary); 209 ceres::Problem problem; local 210 CreateProblem(foe, image, &problem, &solution); 212 SolveProblem(&problem, 89 CreateProblem(const FieldsOfExperts& foe, const PGMImage<double>& image, Problem* problem, PGMImage<double>* solution) argument [all...] |
H A D | ellipse_approximation.cc | 360 ceres::Problem* problem, 365 ceres::Solve(options, problem, &summary); 410 ceres::Problem problem; local 421 problem.AddResidualBlock( 429 problem.AddResidualBlock( 443 CHECK(SolveWithFullReport(options, &problem, true)); 448 CHECK(SolveWithFullReport(options, &problem, false)); 359 SolveWithFullReport(ceres::Solver::Options options, ceres::Problem* problem, bool dynamic_sparsity) argument
|
H A D | helloworld.cc | 64 // Build the problem. 65 Problem problem; local 71 problem.AddResidualBlock(cost_function, NULL, &x); 77 Solve(options, &problem, &summary);
|
H A D | helloworld_analytic_diff.cc | 69 // For this simple problem it is overkill to check if jacobians[0] 89 // Build the problem. 90 Problem problem; local 94 problem.AddResidualBlock(cost_function, NULL, &x); 100 Solve(options, &problem, &summary);
|
H A D | helloworld_numeric_diff.cc | 60 // Build the problem. 61 Problem problem; local 67 problem.AddResidualBlock(cost_function, NULL, &x); 73 Solve(options, &problem, &summary);
|
H A D | libmv_bundle_adjuster.cc | 26 // the command line and runs the bundle adjuster on the problem. 28 // File with problem a binary file, for which it is crucial to know in which 79 // line, camera intrinsics will be refined if markers in the problem are 87 // There're existing problem files dumped from blender stored in folder 349 // Reads a bundle adjustment problem from the file. 351 // file_name denotes from which file to read the problem. 361 // the problem. Only used for reprojection error calculation, stay 656 ceres::Problem problem(problem_options); 694 problem.AddResidualBlock(new ceres::AutoDiffCostFunction< 706 problem [all...] |
H A D | libmv_homography.cc | 336 ceres::Problem problem; local 343 problem.AddResidualBlock( 364 ceres::Solve(solver_options, &problem, &summary);
|
H A D | more_garbow_hillstrom.cc | 50 // A problem is considered solved if of the log relative error of its 276 Problem problem; local 277 problem.AddResidualBlock(TestProblem::Create(), NULL, x); 279 problem.SetParameterLowerBound(x, i, TestProblem::lower_bounds[i]); 280 problem.SetParameterUpperBound(x, i, TestProblem::upper_bounds[i]); 290 Solve(options, &problem, &summary); 311 Problem problem; local 312 problem.AddResidualBlock(TestProblem::Create(), NULL, x); 321 Solve(options, &problem, &summary);
|
H A D | nist.cc | 39 // The problem data themselves can be found at 44 // Medium and Hard. For each problem there are two starting guesses, 48 // A problem is considered successfully solved, if every components of 419 // Each NIST problem comes with multiple starting points, so we 420 // construct the problem from scratch for each case and solve it. 425 ceres::Problem problem; local 427 problem.AddResidualBlock( 436 Solve(options, &problem, &summary);
|
H A D | powell.cc | 110 Problem problem; local 111 // Add residual terms to the problem using the using the autodiff 114 problem.AddResidualBlock(new AutoDiffCostFunction<F1, 1, 1, 1>(new F1), 117 problem.AddResidualBlock(new AutoDiffCostFunction<F2, 1, 1, 1>(new F2), 120 problem.AddResidualBlock(new AutoDiffCostFunction<F3, 1, 1, 1>(new F3), 123 problem.AddResidualBlock(new AutoDiffCostFunction<F4, 1, 1, 1>(new F4), 145 Solve(options, &problem, &summary);
|