1 files changed, 197 insertions, 0 deletions
diff --git a/ACE/tests/SV_Shared_Memory_Test.cpp b/ACE/tests/SV_Shared_Memory_Test.cpp
new file mode 100644
index 00000000000..bc505d1f57e
--- /dev/null
+++ b/ACE/tests/SV_Shared_Memory_Test.cpp
@@ -0,0 +1,197 @@
+
+//=============================================================================
+/**
+ *  @file    SV_Shared_Memory_Test.cpp
+ *
+ *  $Id$
+ *
+ *   This is a simple test of <ACE_SV_Shared_Memory> and
+ *   <ACE_Malloc> using the <ACE_Shared_Memory_Pool>.  The test
+ *   forks two processes and then executes client and server
+ *   allowing them to exchange data using shared memory. No user
+ *   input is required as far as command line arguments are
+ *   concerned.
+ *
+ *
+ *  @author Prashant Jain <pjain@cs.wustl.edu> and Douglas C. Schmidt <schmidt@cs.wustl.edu>
+ */
+//=============================================================================
+
+
+#include "test_config.h"
+#include "ace/Malloc_T.h"
+#include "ace/Shared_Memory_Pool.h"
+#include "ace/SV_Semaphore_Simple.h"
+#include "ace/SV_Semaphore_Complex.h"
+#include "ace/OS_NS_unistd.h"
+
+
+
+
+#if defined (ACE_HAS_SYSV_IPC) && !defined(ACE_LACKS_SYSV_SHMEM)
+
+// The shared memory allocator, which uses up the ACE_DEFAULT_SEM_KEY.
+// We hide the allocator inside this function so that it doesn't get
+// constructed until after the ACE_Object_Manager gets constructed,
+// even with ACE_HAS_NONSTATIC_OBJECT_MANAGER.
+
+static
+ACE_Malloc<ACE_SHARED_MEMORY_POOL, ACE_SV_Semaphore_Simple> &
+myallocator (void)
+{
+  static ACE_Malloc<ACE_SHARED_MEMORY_POOL,
+                    ACE_SV_Semaphore_Simple> myallocator;
+  return myallocator;
+}
+
+// Create some more keys that are different from the
+// ACE_DEFAULT_SEM_KEY used by the allocator.
+static const int SEM_KEY_1 = ACE_DEFAULT_SEM_KEY + 1;
+static const int SEM_KEY_2 = ACE_DEFAULT_SEM_KEY + 2;
+
+static const int SHMSZ = 27;
+static const char SHMDATA[SHMSZ] = "abcdefghijklmnopqrstuvwxyz";
+
+static ACE_SV_Semaphore_Complex *parent_mutex = 0;
+static ACE_SV_Semaphore_Complex *parent_synch = 0;
+
+static int
+parent (char *shm)
+{
+  // This for loop executes in a critical section proteced by
+  // <parent_mutex>.
+  for (int i = 0; i < SHMSZ; i++)
+    shm[i] = SHMDATA[i];
+
+  int result;
+  result = parent_mutex->release ();
+  ACE_TEST_ASSERT (result != -1);
+
+  result = parent_synch->acquire ();
+  ACE_TEST_ASSERT (result != -1);
+
+  result = myallocator ().remove ();
+  ACE_TEST_ASSERT (result != -1);
+
+  result = parent_mutex->remove ();
+  ACE_TEST_ASSERT (result != -1);
+
+  result = parent_synch->remove ();
+  ACE_TEST_ASSERT (result != -1);
+
+  return 0;
+}
+
+static int
+child (char *shm)
+{
+  int result;
+
+  ACE_SV_Semaphore_Complex mutex;
+
+  // This semaphore is initially created with a count of 0, i.e., it
+  // is "locked."
+  result = mutex.open (SEM_KEY_1,
+                       ACE_SV_Semaphore_Complex::ACE_CREATE,
+                       0);
+  ACE_TEST_ASSERT (result != -1);
+
+  ACE_SV_Semaphore_Complex synch;
+  // This semaphore is initially created with a count of 0, i.e., it
+  // is "locked."
+  result = synch.open (SEM_KEY_2,
+                       ACE_SV_Semaphore_Complex::ACE_CREATE,
+                       0);
+  ACE_TEST_ASSERT (result != -1);
+
+  // Perform "busy waiting" here until we acquire the semaphore.  This
+  // isn't really a good design -- it's just to illustrate that you
+  // can do non-blocking acquire() calls with the ACE System V
+  // semaphore wrappers.
+  while ((result = mutex.tryacquire ()) == -1)
+    if (errno == EAGAIN)
+      ACE_DEBUG ((LM_DEBUG,
+                  ACE_TEXT ("(%P) spinning in child!\n")));
+    else
+      {
+        ACE_ERROR ((LM_ERROR,
+                    ACE_TEXT ("(%P) child mutex.tryacquire")));
+        ACE_TEST_ASSERT (result != -1);
+      }
+
+  for (int i = 0; i < SHMSZ; i++)
+    ACE_TEST_ASSERT (SHMDATA[i] == shm[i]);
+
+  result = synch.release ();
+  ACE_TEST_ASSERT (result != -1);
+
+  return 0;
+}
+
+#endif /* ACE_HAS_SYSV_IPC */
+int
+run_main (int, ACE_TCHAR *[])
+{
+  ACE_START_TEST (ACE_TEXT ("SV_Shared_Memory_Test"));
+
+#if defined (ACE_HAS_SYSV_IPC) && !defined (ACE_LACKS_FORK) && \
+    !defined(ACE_LACKS_SYSV_SHMEM)
+
+  // Check whether allocator was initialized.
+  if (myallocator ().bad ())
+    {
+      ACE_ERROR_RETURN ((LM_ERROR,
+                         ACE_TEXT ("Unable to initialize allocator\n")),
+                         -1);
+    }
+
+  char *shm = reinterpret_cast<char *> (myallocator ().malloc (SHMSZ));
+
+  // Create the mutex and synch before spawning the child process, to
+  // avoid race condition between their creation in the parent and use
+  // in the child.
+  ACE_NEW_RETURN (parent_mutex,
+                  ACE_SV_Semaphore_Complex,
+                  -1);
+  ACE_NEW_RETURN (parent_synch,
+                  ACE_SV_Semaphore_Complex,
+                  -1);
+
+  // This semaphore is initially created with a count of 0, i.e., it
+  // is "locked."
+  int result = parent_mutex->open (SEM_KEY_1,
+                                   ACE_SV_Semaphore_Complex::ACE_CREATE,
+                                   0);
+  ACE_TEST_ASSERT (result != -1);
+
+  // This semaphore is initially created with a count of 0, i.e., it
+  // is "locked."
+  result = parent_synch->open (SEM_KEY_2,
+                               ACE_SV_Semaphore_Complex::ACE_CREATE,
+                               0);
+  ACE_TEST_ASSERT (result != -1);
+
+  switch (ACE_OS::fork (ACE_TEXT ("SV_Shared_Memory_Test.cpp")))
+    {
+    case -1:
+      ACE_ERROR_RETURN ((LM_ERROR,
+                         ACE_TEXT ("(%P) fork failed\n")),
+                        -1);
+      /* NOTREACHED */
+    case 0:
+      child (shm);
+      break;
+    default:
+      parent (shm);
+      delete parent_mutex;
+      delete parent_synch;
+      break;
+    }
+#else
+  ACE_ERROR ((LM_INFO,
+              ACE_TEXT ("SYSV IPC, SYSV SHMEM, or fork ")
+              ACE_TEXT ("are not supported on this platform\n")));
+#endif /* ACE_HAS_SYSV_IPC */
+  ACE_END_TEST;
+  return 0;
+}