void testValues() { f = 2; double result; difftime(anytime(), anytime()); //@ assert f == 2; //@ assert vacuous: \false; }
// This test function was contributed with Bugzilla #2447 to test validity // of ACE_Timer_Heap timer IDs around the boundary of having to enlarge // the heap. static void test_unique_timer_heap_ids (void) { Example_Handler eh; ACE_Timer_Heap timer_heap (44); ACE_Time_Value anytime(1); ACE_Bounded_Set<long> timer_ids (max_iterations); long timer_id = -1; bool all_unique = true; for (int i = 0; i < 100; ++i) { timer_id = timer_heap.schedule (&eh, 0, anytime); if (timer_id == -1) { ACE_ERROR ((LM_ERROR, ACE_TEXT ("Schedule timer %d %p\n"), i, ACE_TEXT ("test_unique_timer_heap_ids"))); continue; } ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Schedule timer %d. Timer id = %d\n"), i, timer_id)); if (1 == timer_ids.insert (timer_id)) { ACE_ERROR ((LM_ERROR, ACE_TEXT ("Pass %d, id %d is not unique\n"), i, timer_id)); all_unique = false; } if (i == 0 || i == 1 || i == 47 || i == 48) { ACE_DEBUG ((LM_DEBUG, ACE_TEXT ("Free Timer %d. Timer Id = %d\n"), i, timer_id)); timer_heap.cancel (timer_id); if (timer_id == -1) ACE_ERROR ((LM_ERROR, ACE_TEXT ("%p\n"), ACE_TEXT ("Failed to cancel timer"))); timer_ids.remove (timer_id); } } if (all_unique) ACE_DEBUG ((LM_INFO, ACE_TEXT ("All timer ids were unique.\n"))); return; }
void runSuccess() { difftime(anytime(), anytime()); }