7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/g1/workerDataArray.inline.hpp"
27
28 #ifndef PRODUCT
29 void WorkerDataArray_test() {
30 const uint length = 3;
31 const char* title = "Test array";
32
33 WorkerDataArray<size_t> array(length, title);
34 assert(strncmp(array.title(), title, strlen(title)) == 0 , "Expected titles to match");
35
36 const size_t expected[length] = {5, 3, 7};
37 for (uint i = 0; i < length; i++) {
38 array.set(i, expected[i]);
39 }
40 for (uint i = 0; i < length; i++) {
41 assert(array.get(i) == expected[i], "Expected elements to match");
42 }
43
44 assert(array.sum(length) == (5 + 3 + 7), "Expected sums to match");
45 assert(array.minimum(length) == 3, "Expected mininum to match");
46 assert(array.maximum(length) == 7, "Expected maximum to match");
47 assert(array.diff(length) == (7 - 3), "Expected diffs to match");
48 assert(array.average(length) == 5, "Expected averages to match");
49
50 for (uint i = 0; i < length; i++) {
51 array.add(i, 1);
52 }
53 for (uint i = 0; i < length; i++) {
54 assert(array.get(i) == expected[i] + 1, "Expected add to increment values");
55 }
56 }
57 #endif
|
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "gc/g1/workerDataArray.inline.hpp"
27 #include "utilities/ostream.hpp"
28
29 template <>
30 void WorkerDataArray<double>::WDAPrinter::summary(outputStream* out, const char* title, double min, double avg, double max, double diff, double sum, bool print_sum) {
31 out->print("%-25s Min: %4.1lf, Avg: %4.1lf, Max: %4.1lf, Diff: %4.1lf", title, min * MILLIUNITS, avg * MILLIUNITS, max * MILLIUNITS, diff* MILLIUNITS);
32 if (print_sum) {
33 out->print_cr(", Sum: %4.1lf", sum * MILLIUNITS);
34 } else {
35 out->cr();
36 }
37 }
38
39 template <>
40 void WorkerDataArray<size_t>::WDAPrinter::summary(outputStream* out, const char* title, size_t min, double avg, size_t max, size_t diff, size_t sum, bool print_sum) {
41 out->print("%-25s Min: " SIZE_FORMAT ", Avg: %4.1lf, Max: " SIZE_FORMAT ", Diff: " SIZE_FORMAT, title, min, avg, max, diff);
42 if (print_sum) {
43 out->print_cr(", Sum: " SIZE_FORMAT, sum);
44 } else {
45 out->cr();
46 }
47 }
48
49 template <>
50 void WorkerDataArray<double>::WDAPrinter::details(const WorkerDataArray<double>* phase, outputStream* out, uint active_threads) {
51 out->print("%-25s", "");
52 for (uint i = 0; i < active_threads; ++i) {
53 out->print(" %4.1lf", phase->get(i) * 1000.0);
54 }
55 out->cr();
56 }
57
58 template <>
59 void WorkerDataArray<size_t>::WDAPrinter::details(const WorkerDataArray<size_t>* phase, outputStream* out, uint active_threads) {
60 out->print("%-25s", "");
61 for (uint i = 0; i < active_threads; ++i) {
62 out->print(" " SIZE_FORMAT, phase->get(i));
63 }
64 out->cr();
65 }
66
67 #ifndef PRODUCT
68 void WorkerDataArray_test() {
69 const uint length = 3;
70 const char* title = "Test array";
71
72 WorkerDataArray<size_t> array(length, title);
73 assert(strncmp(array.title(), title, strlen(title)) == 0 , "Expected titles to match");
74
75 const size_t expected[length] = {5, 3, 7};
76 for (uint i = 0; i < length; i++) {
77 array.set(i, expected[i]);
78 }
79 for (uint i = 0; i < length; i++) {
80 assert(array.get(i) == expected[i], "Expected elements to match");
81 }
82
83 assert(array.sum(length) == (5 + 3 + 7), "Expected sums to match");
84 assert(array.average(length) == 5.0, "Expected averages to match");
85
86 for (uint i = 0; i < length; i++) {
87 array.add(i, 1);
88 }
89 for (uint i = 0; i < length; i++) {
90 assert(array.get(i) == expected[i] + 1, "Expected add to increment values");
91 }
92 }
93 #endif
|