8008ce25e9
This patch adds some pthread and C++11 std::thread unit tests. Change-Id: I9706b542e5fa927a87c6e8ae2a6330fab7bb5d72 Reviewed-on: https://gem5-review.googlesource.com/8221 Reviewed-by: Jason Lowe-Power <jason@lowepower.com> Maintainer: Brandon Potter <Brandon.Potter@amd.com>
92 lines
3.0 KiB
C++
92 lines
3.0 KiB
C++
/*
|
|
* Copyright (c) 2018, Cornell University
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or
|
|
* without modification, are permitted provided that the following
|
|
* conditions are met:
|
|
*
|
|
* Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
*
|
|
* Redistributions in binary form must reproduce the above
|
|
* copyright notice, this list of conditions and the following
|
|
* disclaimer in the documentation and/or other materials provided
|
|
* with the distribution.
|
|
*
|
|
* Neither the name of Cornell University nor the names of its
|
|
* contributors may be used to endorse or promote products derived
|
|
* from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
|
|
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
|
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
|
|
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
* Authors: Moyang Wang
|
|
*/
|
|
|
|
#include <cstdlib>
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <thread>
|
|
#include <vector>
|
|
|
|
//------------------------------------------------------------------------
|
|
// Test std::thread
|
|
//------------------------------------------------------------------------
|
|
// Create n threads, run them in parallel and wait for them in the master
|
|
// thread.
|
|
// Each child thread writes its thread id to an output array
|
|
|
|
#define MAX_N_WORKER_THREADS 10
|
|
|
|
int main( int argc, char* argv[] )
|
|
{
|
|
int n_worker_threads = 0;
|
|
|
|
std::vector< std::thread > threads;
|
|
std::vector<int> outputs( MAX_N_WORKER_THREADS, 0 );
|
|
|
|
for ( int tid = 0; tid < MAX_N_WORKER_THREADS; ++tid ) {
|
|
try {
|
|
threads.push_back( std::thread( [&] (size_t thread_id ) {
|
|
std::cout << "Hello from thread " << thread_id
|
|
<< std::endl;
|
|
outputs[thread_id] = thread_id;
|
|
}, tid ) );
|
|
} catch ( const std::system_error& err ) {
|
|
break;
|
|
}
|
|
n_worker_threads++;
|
|
}
|
|
|
|
std::cout << "Hello from master thread" << std::endl;
|
|
|
|
// sync up all threads
|
|
for (int i = 0; i < n_worker_threads; ++i) {
|
|
threads[i].join();
|
|
}
|
|
|
|
if (n_worker_threads < 1) {
|
|
return EXIT_FAILURE;
|
|
}
|
|
|
|
for ( int i = 0; i < n_worker_threads; ++i ) {
|
|
if ( outputs[i] != i ) {
|
|
return EXIT_FAILURE;
|
|
}
|
|
}
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|