// This program tests the relative speeds of various object allocation strategies.
int main(int argc, char ** argv)
{
CompleteSetupSystem css; // required!
const uint32 NUM_OBJECTS = 10000000;
Queue<MessageRef> tempQ;
if (tempQ.EnsureSize(NUM_OBJECTS, true) != B_NO_ERROR) return 10;
int whichTest = (argc>1) ? atoi(argv[1]) : -1;
uint64 startTime = GetRunTime64();
switch(whichTest)
{
case 1:
{
// See how long it takes to allocate an array of objects
(void) new Message[NUM_OBJECTS];
}
break;
case 2:
{
// As above, but with deletion also
delete [] new Message[NUM_OBJECTS];
}
break;
case 3:
{
// See how long it takes to allocate each object individually
for (uint32 i=0; i<NUM_OBJECTS; i++) tempQ[i].SetRef(new Message);
}
break;
case 4:
{
// As above, but we delete the item after allocating it
for (uint32 i=0; i<NUM_OBJECTS; i++) tempQ[i].SetRef(new Message);
for (uint32 i=0; i<NUM_OBJECTS; i++) tempQ[i].Reset();
}
break;
case 5:
{
// See how long it takes to allocate each object individually
for (uint32 i=0; i<NUM_OBJECTS; i++) tempQ[i] = GetMessageFromPool();
}
break;
case 6:
{
// As above, but then we clear the queue
for (uint32 i=0; i<NUM_OBJECTS; i++) tempQ[i] = GetMessageFromPool();
tempQ.Clear();
}
break;
case 7:
{
// As above, but we only use one object at a time
for (uint32 i=0; i<NUM_OBJECTS; i++) (void) GetMessageFromPool();
}
break;
default:
printf("Usage: testpools <testnum> (where testnum is between 1 and 6)\n");
break;
}
uint64 endTime = GetRunTime64();
printf("Test duration for " UINT32_FORMAT_SPEC " objects was " UINT64_FORMAT_SPEC "ms \n", NUM_OBJECTS, (endTime-startTime)/1000);
if ((argc > 2)&&(strcmp(argv[2], "hold") == 0))
{
printf("Holding indefinitely, so that you can look at OS reported memory usage...\n");
while(1) Snooze64(SecondsToMicros(10));
}
return 0;
}
// This program exercises the Queue class.
int main(void)
{
CompleteSetupSystem css; // needed for string-count stats
#ifdef TEST_SWAP_METHOD
while(1)
{
char qs1[512]; printf("Enter q1: "); fflush(stdout); if (fgets(qs1, sizeof(qs1), stdin) == NULL) qs1[0] = '\0';
char qs2[512]; printf("Enter q2: "); fflush(stdout); if (fgets(qs2, sizeof(qs2), stdin) == NULL) qs2[0] = '\0';
Queue<int> q1, q2;
StringTokenizer t1(qs1), t2(qs2);
const char * s;
while((s = t1()) != NULL) q1.AddTail(atoi(s));
while((s = t2()) != NULL) q2.AddTail(atoi(s));
printf("T1Before="); PrintToStream(q1);
printf("T2Before="); PrintToStream(q2);
q1.SwapContents(q2);
printf("T1After="); PrintToStream(q1);
printf("T2After="); PrintToStream(q2);
}
#endif
#ifdef MUSCLE_USE_CPLUSPLUS11
{
Queue<int> q {1,2,3,4,5};
if (q.GetNumItems() != 5) {printf("Oh no, initialize list constructor didn't work!\n"); exit(10);}
q = {6,7,8,9,10,11};
if (q.GetNumItems() != 6) {printf("Oh no, initialize list assignment operator didn't work!\n"); exit(10);}
}
#endif
// Test muscleSwap()
{
Queue<String> q1, q2;
q1.AddTail("q1");
q2.AddTail("q2");
muscleSwap(q1, q2);
if ((q1.GetNumItems() != 1)||(q2.GetNumItems() != 1)||(q1[0] != "q2")||(q2[0] != "q1"))
{
printf("Oh no, muscleSwap is broken for Message objects!\n");
exit(10);
}
printf("muscleSwap() worked!\n");
}
const int testSize = 15;
Queue<int> q;
int vars[] = {5,6,7,8,9,10,11,12,13,14,15};
printf("ADDTAIL TEST\n");
{
for (int i=0; i<testSize; i++)
{
TEST(q.AddTail(i));
printf("len=" UINT32_FORMAT_SPEC"/" UINT32_FORMAT_SPEC"\n", q.GetNumItems(), q.GetNumAllocatedItemSlots());
}
}
printf("AddTail array\n");
q.AddTailMulti(vars, ARRAYITEMS(vars));
PrintToStream(q);
printf("AddHead array\n");
q.AddHeadMulti(vars, ARRAYITEMS(vars));
PrintToStream(q);
printf("REPLACEITEMAT TEST\n");
{
for (int i=0; i<testSize; i++)
{
TEST(q.ReplaceItemAt(i, i+10));
PrintToStream(q);
}
}
printf("INSERTITEMAT TEST\n");
{
for (int i=0; i<testSize; i++)
{
TEST(q.InsertItemAt(i,i));
PrintToStream(q);
}
}
printf("REMOVEITEMAT TEST\n");
{
for (int i=0; i<testSize; i++)
{
TEST(q.RemoveItemAt(i));
PrintToStream(q);
}
}
// Check that C++11's move semantics aren't stealing values they shouldn't
{
Queue<String> q;
String myStr = "Magic";
q.AddTail(myStr);
if (myStr != "Magic")
{
printf("Error, AddTail() stole my string!\n");
exit(10);
}
}
printf("SORT TEST 1\n");
{
q.Clear();
for (int i=0; i<testSize; i++)
{
int next = rand()%255;
TEST(q.AddTail(next));
printf("Added item %i = %i\n", i, q[i]);
}
printf("sorting ints...\n");
q.Sort();
for (int j=0; j<testSize; j++) printf("Now item %i = %i\n", j, q[j]);
}
printf("SORT TEST 2\n");
{
Queue<String> q2;
for (int i=0; i<testSize; i++)
{
int next = rand()%255;
char buf[64];
sprintf(buf, "%i", next);
TEST(q2.AddTail(buf));
printf("Added item %i = %s\n", i, q2[i].Cstr());
}
printf("sorting strings...\n");
q2.Sort();
for (int j=0; j<testSize; j++) printf("Now item %i = %s\n", j, q2[j].Cstr());
}
printf("REMOVE DUPLICATES test\n");
{
Queue<int> q;
const int vars[] = {9,2,3,5,8,3,5,6,6,7,2,3,4,6,8,9,3,5,6,4,3,2,1};
if (q.AddTailMulti(vars, ARRAYITEMS(vars)) == B_NO_ERROR)
{
q.RemoveDuplicateItems();
for (uint32 i=0; i<q.GetNumItems(); i++) printf("%u ", q[i]); printf("\n");
}
}
{
const uint32 NUM_ITEMS = 1000000;
const uint32 NUM_RUNS = 3;
Queue<int> q; (void) q.EnsureSize(NUM_ITEMS, true);
double tally = 0.0;
for (uint32 t=0; t<NUM_RUNS; t++)
{
printf("SORT SPEED TEST ROUND " UINT32_FORMAT_SPEC"/" UINT32_FORMAT_SPEC":\n", t+1, NUM_RUNS);
srand(0); for (uint32 i=0; i<NUM_ITEMS; i++) q[i] = rand(); // we want this to be repeatable, hence srand(0)
uint64 startTime = GetRunTime64();
q.Sort();
uint64 elapsed = (GetRunTime64()-startTime);
double itemsPerSecond = ((double)NUM_ITEMS*((double)MICROS_PER_SECOND))/(elapsed);
printf(" It took " UINT64_FORMAT_SPEC" microseconds to sort " UINT32_FORMAT_SPEC" items, so we sorted %f items per second\n", elapsed, NUM_ITEMS, itemsPerSecond);
tally += itemsPerSecond;
}
printf("GRAND AVERAGE ITEMS PER SECOND WAS %f items per second\n", tally/NUM_RUNS);
}
PrintAndClearStringCopyCounts("Before String Sort Tests");
{
const uint32 NUM_ITEMS = 1000000;
const uint32 NUM_RUNS = 3;
Queue<String> q; (void) q.EnsureSize(NUM_ITEMS, true);
double tally = 0.0;
for (uint32 t=0; t<NUM_RUNS; t++)
{
printf("STRING SORT SPEED TEST ROUND " UINT32_FORMAT_SPEC"/" UINT32_FORMAT_SPEC":\n", t+1, NUM_RUNS);
srand(0); for (uint32 i=0; i<NUM_ITEMS; i++) q[i] = String("FooBarBaz-%1").Arg(rand()).Pad(500); // we want this to be repeatable, hence srand(0)
uint64 startTime = GetRunTime64();
q.Sort();
uint64 elapsed = (GetRunTime64()-startTime);
double itemsPerSecond = ((double)NUM_ITEMS*((double)MICROS_PER_SECOND))/(elapsed);
printf(" It took " UINT64_FORMAT_SPEC" microseconds to sort " UINT32_FORMAT_SPEC" items, so we sorted %f items per second\n", elapsed, NUM_ITEMS, itemsPerSecond);
tally += itemsPerSecond;
}
printf("STRING GRAND AVERAGE ITEMS PER SECOND WAS %f items per second\n", tally/NUM_RUNS);
}
PrintAndClearStringCopyCounts("After String Sort Tests");
printf("REVERSE TEST\n");
{
q.Clear();
for (int i=0; i<testSize; i++) TEST(q.AddTail(i));
q.ReverseItemOrdering();
for (int j=0; j<testSize; j++) printf("After reverse, %i->%i\n", j, q[j]);
}
printf("CONCAT TEST 1\n");
{
q.Clear();
Queue<int> q2;
for (int i=0; i<testSize; i++)
{
TEST(q.AddTail(i));
TEST(q2.AddTail(i+100));
}
q.AddTailMulti(q2);
for (uint32 j=0; j<q.GetNumItems(); j++) printf("After concat, " UINT32_FORMAT_SPEC"->%i\n", j, q[j]);
}
printf("CONCAT TEST 2\n");
{
q.Clear();
Queue<int> q2;
for (int i=0; i<testSize; i++)
{
TEST(q.AddTail(i));
TEST(q2.AddTail(i+100));
}
q.AddHeadMulti(q2);
for (uint32 j=0; j<q.GetNumItems(); j++) printf("After concat, " UINT32_FORMAT_SPEC"->%i\n", j, q[j]);
}
{
printf("GetArrayPointer() test\n");
uint32 len = 0;
int * a;
for (uint32 i=0; (a = q.GetArrayPointer(i, len)) != NULL; i++)
{
printf("SubArray " UINT32_FORMAT_SPEC": " UINT32_FORMAT_SPEC" items: ", i, len);
for (uint32 j=0; j<len; j++) printf("%i, ", a[j]);
printf("\n");
}
}
printf("\nStress-testing Queue::Normalize()... this may take a minute\n");
for (uint32 i=0; i<20000; i++)
{
Queue<int> q;
int counter = 0;
for (uint32 j=0; j<i; j++)
{
switch(rand()%6)
{
case 0: case 1: q.AddTail(counter++); break;
case 2: case 3: q.AddHead(counter++); break;
case 4: q.RemoveHead(); break;
case 5: q.RemoveTail(); break;
}
}
int * compareArray = new int[q.GetNumItems()];
for (uint32 j=0; j<q.GetNumItems(); j++) compareArray[j] = q[j];
q.Normalize();
const int * a = q.HeadPointer();
if (memcmp(compareArray, a, q.GetNumItems()*sizeof(int)))
{
printf("ERROR IN NORMALIZE!\n");
for (uint32 i=0; i<q.GetNumItems(); i++) printf(" Expected %i, got %i (qi=%i at " UINT32_FORMAT_SPEC"/" UINT32_FORMAT_SPEC")\n", compareArray[i], a[i], q[i], i, q.GetNumItems());
MCRASH("ERROR IN NORMALIZE!");
}
delete [] compareArray;
}
printf("Queue test complete.\n");
return 0;
}
