Method block_alloc

tests/unittests/unittests.cpp:1007–1205

	}
	
	bool block_alloc()
	{
		typedef TestTraits<2> Traits;
		typedef TestTraits<2, 32, true> RecycleTraits;
		Traits::reset();
		
		// Explicit
		{
			ConcurrentQueue<int, Traits> q(7);
			ASSERT_OR_FAIL(q.initialBlockPoolSize == 4);
			
			ASSERT_OR_FAIL(Traits::malloc_count() == 1);
			ASSERT_OR_FAIL(Traits::free_count() == 0);
			
			{
				ProducerToken tok(q);
				ASSERT_OR_FAIL(Traits::malloc_count() == 3);		// one for producer, one for its block index
				ASSERT_OR_FAIL(Traits::free_count() == 0);
				
				// Enqueue one item too many (force extra block allocation)
				for (int i = 0; i != 9; ++i) {
					ASSERT_OR_FAIL(q.enqueue(tok, i));
				}
				
				ASSERT_OR_FAIL(Traits::malloc_count() == 4);
				ASSERT_OR_FAIL(Traits::free_count() == 0);
				
				// Still room for one more...
				ASSERT_OR_FAIL(q.enqueue(tok, 9));
				ASSERT_OR_FAIL(Traits::malloc_count() == 4);
				ASSERT_OR_FAIL(Traits::free_count() == 0);
				
				// No more room without further allocations
				ASSERT_OR_FAIL(!q.try_enqueue(tok, 10));
				ASSERT_OR_FAIL(Traits::malloc_count() == 4);
				ASSERT_OR_FAIL(Traits::free_count() == 0);
				
				// Check items were enqueued properly
				int item;
				for (int i = 0; i != 10; ++i) {
					ASSERT_OR_FAIL(q.try_dequeue_from_producer(tok, item));
					ASSERT_OR_FAIL(item == i);
				}
				
				// Queue should be empty, but not freed
				ASSERT_OR_FAIL(!q.try_dequeue_from_producer(tok, item));
				ASSERT_OR_FAIL(Traits::free_count() == 0);
			}
			// Explicit producers are recycled, so block should still be allocated
			ASSERT_OR_FAIL(Traits::free_count() == 0);
		}
		
		ASSERT_OR_FAIL(Traits::malloc_count() == 4);
		ASSERT_OR_FAIL(Traits::free_count() == 4);
		
		// Implicit
		Traits::reset();
		{