| 1 |
// Copyright 2002 - 2008, 2010, 2011 National Technology Engineering |
| 2 |
// Solutions of Sandia, LLC (NTESS). Under the terms of Contract |
| 3 |
// DE-NA0003525 with NTESS, the U.S. Government retains certain rights |
| 4 |
// in this software. |
| 5 |
// |
| 6 |
// Redistribution and use in source and binary forms, with or without |
| 7 |
// modification, are permitted provided that the following conditions are |
| 8 |
// met: |
| 9 |
// |
| 10 |
// * Redistributions of source code must retain the above copyright |
| 11 |
// notice, this list of conditions and the following disclaimer. |
| 12 |
// |
| 13 |
// * Redistributions in binary form must reproduce the above |
| 14 |
// copyright notice, this list of conditions and the following |
| 15 |
// disclaimer in the documentation and/or other materials provided |
| 16 |
// with the distribution. |
| 17 |
// |
| 18 |
// * Neither the name of NTESS nor the names of its contributors |
| 19 |
// may be used to endorse or promote products derived from this |
| 20 |
// software without specific prior written permission. |
| 21 |
// |
| 22 |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 23 |
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 24 |
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 25 |
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 26 |
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 27 |
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 28 |
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 29 |
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 30 |
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 31 |
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 32 |
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 33 |
// |
| 34 |
|
| 35 |
#include <string> |
| 36 |
#include <gtest/gtest.h> |
| 37 |
#include <stk_util/parallel/Parallel.hpp> |
| 38 |
#include <stk_util/parallel/CommBufferV.hpp> |
| 39 |
#include <stk_unit_test_utils/timer.hpp> |
| 40 |
|
| 41 |
TEST(PerfCommBufferV, pack_unpack) |
| 42 |
{ |
| 43 |
stk::ParallelMachine comm = MPI_COMM_WORLD; |
| 44 |
if (stk::parallel_machine_size(comm) != 1) { GTEST_SKIP(); } |
| 45 |
|
| 46 |
const unsigned NUM_RUNS = 5; |
| 47 |
|
| 48 |
stk::unit_test_util::BatchTimer batchTimer(comm); |
| 49 |
batchTimer.initialize_batch_timer(); |
| 50 |
|
| 51 |
for(unsigned r=0; r<NUM_RUNS; ++r) { |
| 52 |
batchTimer.start_batch_timer(); |
| 53 |
|
| 54 |
#ifndef NDEBUG |
| 55 |
const int n = 10000; |
| 56 |
#else |
| 57 |
const int n = 1000000; |
| 58 |
#endif |
| 59 |
std::vector<stk::CommBufferV> buffers(n); |
| 60 |
|
| 61 |
const int npacks = 100; |
| 62 |
int int1 = 9; |
| 63 |
double double1 = 99.9; |
| 64 |
|
| 65 |
for(int i=0; i<n; ++i) { |
| 66 |
stk::CommBufferV& buf = buffers[i]; |
| 67 |
for(int j=0; j<npacks; ++j) { |
| 68 |
buf.pack<double>(double1); |
| 69 |
buf.pack<int>(int1); |
| 70 |
buf.pack<double>(double1); |
| 71 |
buf.pack<int>(int1); |
| 72 |
} |
| 73 |
} |
| 74 |
|
| 75 |
for(int i=0; i<n; ++i) { |
| 76 |
stk::CommBufferV& buf = buffers[i]; |
| 77 |
for(int j=0; j<npacks; ++j) { |
| 78 |
buf.unpack<double>(double1); |
| 79 |
buf.unpack<int>(int1); |
| 80 |
buf.unpack<double>(double1); |
| 81 |
buf.unpack<int>(int1); |
| 82 |
} |
| 83 |
} |
| 84 |
|
| 85 |
batchTimer.stop_batch_timer(); |
| 86 |
} |
| 87 |
|
| 88 |
batchTimer.print_batch_timing(NUM_RUNS); |
| 89 |
} |
| 90 |
|