test-pool.cpp

Go to the documentation of this file.

/********************************************************************
 * Copyright (C) 2011 by Verimag                                    *
 * Initial author: Matthieu Moy                                     *
 * This file must not be distributed outside Verimag                *
 ********************************************************************/

#include "thread-queue.h"
#include "task-manager.h"
#include "thread-pool.h"
#include "assert.h"
#include <boost/thread.hpp>
#include <boost/lexical_cast.hpp>
#include <boost/bind.hpp>
#include <unistd.h>
#include <iostream>
#include "utils/io-lock.h"
#include "utils/measure-time.h"
#include "utils/atomic-variable.h"
#include <systemc>
#include "utils/big-lock.h"

using namespace std;
using namespace sc_core;

atomic_variable<int> count_f(0);

void f() {
        count_f++;
}
void g() {
        count_f--;
}

void send_requests(int n, boost::function<void()> fn) {
        for (int i = 0; i < n; i++) {
                big_lock<0> l;
                sync_task t(fn);
                l.unlock();
                thread_pool::get_instance()->queue(&t);
                t.wait_nosc();
        }
}


void test_pool(int nb_producers, int nb_req, boost::function<void()> fn) {
        boost::thread **ta = new boost::thread *[nb_producers];
        //measure_time t("pool (" + boost::lexical_cast<string>(nb_producers) + " producers)");
        
        for (int i = 0; i < nb_producers; ++i)
                ta[i] = new boost::thread(send_requests, nb_req, fn);
        for (int i = 0; i < nb_producers; ++i)
                ta[i]->join();
        delete [] ta;
}


const int N = 10;

int sc_main (int argc, char **argv) {
        (void)argc; (void)argv;
        thread_pool::get_instance();
        L_COUT << "Increase count" << endl;
        for (int i = 1; i <= N; ++i)
                for (int j = 1; j <= N; ++j) {
                        count_f.write(0);
                        test_pool(i, j, boost::bind(f));
                        assert(count_f.read() == i * j);
                }
        L_COUT << "Mixed ++ and --" << endl;
        for (int i = 1; i <= N; ++i)
                for (int j = 1; j <= N; ++j) {
                        count_f.write(0);
                        boost::function<void()> bf = boost::bind(g);
                        boost::thread t(send_requests, i*j, bf);
                        test_pool(i, j, boost::bind(f));
                        t.join();
                        assert(count_f.read() == 0);
                }
        L_COUT << "Done." << endl;
        return 0;
}