1 /* 2 * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 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 const bool print_sum = false; 33 const int log_level = 3; 34 const uint indent_level = 2; 35 36 WorkerDataArray<size_t> array(length, title, print_sum, log_level, indent_level); 37 assert(strncmp(array.title(), title, strlen(title)) == 0 , "Expected titles to match"); 38 assert(array.should_print_sum() == print_sum, "Expected should_print_sum to match print_sum"); 39 assert(array.log_level() == log_level, "Expected log levels to match"); 40 assert(array.indentation() == indent_level, "Expected indentation to match"); 41 42 const size_t expected[length] = {5, 3, 7}; 43 for (uint i = 0; i < length; i++) { 44 array.set(i, expected[i]); 45 } 46 for (uint i = 0; i < length; i++) { 47 assert(array.get(i) == expected[i], "Expected elements to match"); 48 } 49 50 assert(array.sum(length) == (5 + 3 + 7), "Expected sums to match"); 51 assert(array.minimum(length) == 3, "Expected mininum to match"); 52 assert(array.maximum(length) == 7, "Expected maximum to match"); 53 assert(array.diff(length) == (7 - 3), "Expected diffs to match"); 54 assert(array.average(length) == 5, "Expected averages to match"); 55 56 for (uint i = 0; i < length; i++) { 57 array.add(i, 1); 58 } 59 for (uint i = 0; i < length; i++) { 60 assert(array.get(i) == expected[i] + 1, "Expected add to increment values"); 61 } 62 } 63 #endif