| @@ -219,7 +219,7 @@ static int test_cpucg_stats(const char *root) · 218 unmodified lines |
| 219 | if (user_usec <= 0) | 219 | if (user_usec <= 0) |
| 220 | goto cleanup; | 220 | goto cleanup; |
| 221 | | 221 | |
| 222 | if (!values_close(usage_usec, expected_usage_usec, 1)) | 222 | if (!values_close_report(usage_usec, expected_usage_usec, 1)) |
| 223 | goto cleanup; | 223 | goto cleanup; |
| 224 | | 224 | |
| 225 | ret = KSFT_PASS; | 225 | ret = KSFT_PASS; |
| @@ -291,7 +291,7 @@ static int test_cpucg_nice(const char *root) · 65 unmodified lines |
| 291 | | 291 | |
| 292 | user_usec = cg_read_key_long(cpucg, "cpu.stat", "user_usec"); | 292 | user_usec = cg_read_key_long(cpucg, "cpu.stat", "user_usec"); |
| 293 | nice_usec = cg_read_key_long(cpucg, "cpu.stat", "nice_usec"); | 293 | nice_usec = cg_read_key_long(cpucg, "cpu.stat", "nice_usec"); |
| 294 | if (!values_close(nice_usec, expected_nice_usec, 1)) | 294 | if (!values_close_report(nice_usec, expected_nice_usec, 1)) |
| 295 | goto cleanup; | 295 | goto cleanup; |
| 296 | | 296 | |
| 297 | ret = KSFT_PASS; | 297 | ret = KSFT_PASS; |
| @@ -404,7 +404,7 @@ overprovision_validate(const struct cpu_hogger *children, int num_children) · 106 unmodified lines |
| 404 | goto cleanup; | 404 | goto cleanup; |
| 405 | | 405 | |
| 406 | delta = children[i + 1].usage - children[i].usage; | 406 | delta = children[i + 1].usage - children[i].usage; |
| 407 | if (!values_close(delta, children[0].usage, 35)) | 407 | if (!values_close_report(delta, children[0].usage, 35)) |
| 408 | goto cleanup; | 408 | goto cleanup; |
| 409 | } | 409 | } |
| 410 | | 410 | |
| @@ -444,7 +444,7 @@ underprovision_validate(const struct cpu_hogger *children, int num_children) · 33 unmodified lines |
| 444 | int ret = KSFT_FAIL, i; | 444 | int ret = KSFT_FAIL, i; |
| 445 | | 445 | |
| 446 | for (i = 0; i < num_children - 1; i++) { | 446 | for (i = 0; i < num_children - 1; i++) { |
| 447 | if (!values_close(children[i + 1].usage, children[0].usage, 15)) | 447 | if (!values_close_report(children[i + 1].usage, children[0].usage, 15)) |
| 448 | goto cleanup; | 448 | goto cleanup; |
| 449 | } | 449 | } |
| 450 | | 450 | |
| @@ -573,16 +573,16 @@ run_cpucg_nested_weight_test(const char *root, bool overprovisioned) · 122 unmodified lines |
| 573 | | 573 | |
| 574 | nested_leaf_usage = leaf[1].usage + leaf[2].usage; | 574 | nested_leaf_usage = leaf[1].usage + leaf[2].usage; |
| 575 | if (overprovisioned) { | 575 | if (overprovisioned) { |
| 576 | if (!values_close(leaf[0].usage, nested_leaf_usage, 15)) | 576 | if (!values_close_report(leaf[0].usage, nested_leaf_usage, 15)) |
| 577 | goto cleanup; | 577 | goto cleanup; |
| 578 | } else if (!values_close(leaf[0].usage * 2, nested_leaf_usage, 15)) | 578 | } else if (!values_close_report(leaf[0].usage * 2, nested_leaf_usage, 15)) |
| 579 | goto cleanup; | 579 | goto cleanup; |
| 580 | | 580 | |
| 581 | | 581 | |
| 582 | child_usage = cg_read_key_long(child, "cpu.stat", "usage_usec"); | 582 | child_usage = cg_read_key_long(child, "cpu.stat", "usage_usec"); |
| 583 | if (child_usage <= 0) | 583 | if (child_usage <= 0) |
| 584 | goto cleanup; | 584 | goto cleanup; |
| 585 | if (!values_close(child_usage, nested_leaf_usage, 1)) | 585 | if (!values_close_report(child_usage, nested_leaf_usage, 1)) |
| 586 | goto cleanup; | 586 | goto cleanup; |
| 587 | | 587 | |
| 588 | ret = KSFT_PASS; | 588 | ret = KSFT_PASS; |
| @@ -691,7 +691,7 @@ static int test_cpucg_max(const char *root) · 102 unmodified lines |
| 691 | expected_usage_usec | 691 | expected_usage_usec |
| 692 | = n_periods * quota_usec + MIN(remainder_usec, quota_usec); | 692 | = n_periods * quota_usec + MIN(remainder_usec, quota_usec); |
| 693 | | 693 | |
| 694 | if (!values_close(usage_usec, expected_usage_usec, 10)) | 694 | if (!values_close_report(usage_usec, expected_usage_usec, 10)) |
| 695 | goto cleanup; | 695 | goto cleanup; |
| 696 | | 696 | |
| 697 | ret = KSFT_PASS; | 697 | ret = KSFT_PASS; |
| @@ -762,7 +762,7 @@ static int test_cpucg_max_nested(const char *root) · 64 unmodified lines |
| 762 | expected_usage_usec | 762 | expected_usage_usec |
| 763 | = n_periods * quota_usec + MIN(remainder_usec, quota_usec); | 763 | = n_periods * quota_usec + MIN(remainder_usec, quota_usec); |
| 764 | | 764 | |
| 765 | if (!values_close(usage_usec, expected_usage_usec, 10)) | 765 | if (!values_close_report(usage_usec, expected_usage_usec, 10)) |
| 766 | goto cleanup; | 766 | goto cleanup; |
| 767 | | 767 | |
| 768 | ret = KSFT_PASS; | 768 | ret = KSFT_PASS; |