semaphore-tests.cc File Reference

#include <iostream>
#include <boost/date_time/posix_time/posix_time.hpp>
#include <boost/test/unit_test.hpp>
#include <boost/thread.hpp>
#include <scroom/function-additor.hh>
#include <scroom/semaphore.hh>
#include "helpers.hh"

Include dependency graph for semaphore-tests.cc:

Functions
void	test_count_equals (Semaphore *s, int i)
	BOOST_AUTO_TEST_CASE (try_P)
	BOOST_AUTO_TEST_CASE (count_equals_0)
	BOOST_AUTO_TEST_CASE (count_equals_1)
	BOOST_AUTO_TEST_CASE (count_equals_2)
	BOOST_AUTO_TEST_CASE (inc_count_1)
	BOOST_AUTO_TEST_CASE (inc_count_2)
	BOOST_AUTO_TEST_CASE (inc_count_3)
	BOOST_AUTO_TEST_CASE (pass_many)
	BOOST_AUTO_TEST_CASE (p_with_timeout)
	BOOST_AUTO_TEST_CASE (p_without_timeout)

Function Documentation

BOOST_AUTO_TEST_CASE() [1/10]

BOOST_AUTO_TEST_CASE

(

count_equals_0

)

{
  Semaphore s(0);
  test_count_equals(&s, 0);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [2/10]

BOOST_AUTO_TEST_CASE

(

count_equals_1

)

{
  Semaphore s(1);
  test_count_equals(&s, 1);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [3/10]

BOOST_AUTO_TEST_CASE

(

count_equals_2

)

{
  Semaphore s(2);
  test_count_equals(&s, 2);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [4/10]

BOOST_AUTO_TEST_CASE

(

inc_count_1

)

{
  Semaphore s(0);
  s.V();
  test_count_equals(&s, 1);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [5/10]

BOOST_AUTO_TEST_CASE

(

inc_count_2

)

{
  Semaphore s(0);
  s.V();
  s.V();
  test_count_equals(&s, 2);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [6/10]

BOOST_AUTO_TEST_CASE

(

inc_count_3

)

{
  Semaphore s(0);
  s.V();
  s.V();
  s.V();
  test_count_equals(&s, 3);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [7/10]

BOOST_AUTO_TEST_CASE

(

p_with_timeout

)

{
  Semaphore s(0);
  BOOST_REQUIRE(!s.P(millisec(250)));
  test_count_equals(&s, 0);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [8/10]

BOOST_AUTO_TEST_CASE

(

p_without_timeout

)

{
  Semaphore s(1);
  BOOST_REQUIRE(s.P(millisec(250)));
  BOOST_REQUIRE(!s.P(millisec(250)));
  test_count_equals(&s, 0);
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [9/10]

BOOST_AUTO_TEST_CASE

(

pass_many

)

{
  Semaphore     s(0);
  boost::thread t(5 * pass(&s));
  boost::this_thread::sleep(millisec(50));
  s.V();
  boost::this_thread::sleep(millisec(100));
  s.V();
  boost::this_thread::sleep(millisec(50));
  s.V();
  boost::this_thread::sleep(millisec(100));
  s.V();
  boost::this_thread::sleep(millisec(50));
  s.V();
  t.timed_join(millisec(250));
  bool const success = boost::thread::id() == t.get_id();
  BOOST_REQUIRE(success);
  if(!success)
  {
    t.interrupt();
    t.timed_join(millisec(250));
    BOOST_REQUIRE(boost::thread::id() == t.get_id());
  }
}

Here is the call graph for this function:

BOOST_AUTO_TEST_CASE() [10/10]

BOOST_AUTO_TEST_CASE

(

try_P

)

{
  Semaphore s1(0);
  BOOST_REQUIRE(!s1.try_P());
  Semaphore s2(1);
  BOOST_REQUIRE(s2.try_P());
  BOOST_REQUIRE(!s2.try_P());
}

Here is the call graph for this function:

test_count_equals()

void test_count_equals	(	Semaphore *	s,
		int	i
	)

{
  for(int actual = 0; actual < i; actual++)
  {
    BOOST_REQUIRE_MESSAGE(s->try_P(), "Could only decrement " << actual << " times, instead of " << i);
  }
  BOOST_REQUIRE_MESSAGE(!s->try_P(), "Can decrement " << (i + 1) << " times, instead of " << i);
}

Referenced by BOOST_AUTO_TEST_CASE().

Here is the call graph for this function:

Here is the caller graph for this function: