ChangeLogTag: Thu May 29 10:15:00 UTC 2008 Simon Massey <sma at prismtech dot com>

2 files changed, 8 insertions, 21 deletions

diff --git a/ACE/ChangeLog b/ACE/ChangeLog
index d9e66f21cde..6f2d5620215 100644
--- a/ACE/ChangeLog
+++ b/ACE/ChangeLog
@@ -1,21 +1,8 @@
-Wed May 28 18:13:15 UTC 2008  J.T. Conklin  <jtc@acorntoolworks.com>
+Thu May 29 10:15:00 UTC 2008  Simon Massey  <sma at prismtech dot com>
 
-        * ace/INET_Addr.cpp:
-        * ace/INET_Addr.h:
-
-          Changed ACE_INET_Addr::get_host_addr(char *, int) to be thread
-          safe by calling ACE_OS::inet_ntop() instead of
-          ACE_OS::inet_ntoa().
-
-          Changed ACE_INET_Addr::get_host_addr(void) to call
-          INET_Addr::get_host_addr(char *, size) with a static buffer.
+        * tests/Bug_3332_Regression_Test.cpp:
 
-          Removed the special cases for VxWorks in both of the above
-          methods which called inet_ntoa_b() which, according to comments,
-          was for efficency and thread safety.  These are are now as
-          efficent and thread safe (or not, in the case of ACE_INET_Addr::
-          get_host_addr(void)) as any other target platform, but no longer
-          need a string buffer member in every ACE_INET_Addr instance.
+          Remove signed/unsigned comparison warnings.
 
 Wed May 28 13:46:00 UTC 2008  Simon Massey  <sma at prismtech dot com>
 
diff --git a/ACE/tests/Bug_3332_Regression_Test.cpp b/ACE/tests/Bug_3332_Regression_Test.cpp
index 8f0711ec7b6..68605f8be6e 100644
--- a/ACE/tests/Bug_3332_Regression_Test.cpp
+++ b/ACE/tests/Bug_3332_Regression_Test.cpp
@@ -58,7 +58,7 @@ run_main (int, ACE_TCHAR *[])
   ACE_RB_Tree<char, int, ACE_Less_Than<char>, ACE_Null_Mutex> tree;
 
   ACE_DEBUG ((LM_DEBUG, "Creating Tree\n"));
-  {for (int i= 0; i < sizeof(nodes)/sizeof(Nodes); ++i)
+  {for (size_t i= 0u; i < sizeof(nodes)/sizeof(Nodes); ++i)
   {
     if (0 != tree.bind (nodes[i].key, nodes[i].value, nodes[i].node))
     {
@@ -70,7 +70,7 @@ run_main (int, ACE_TCHAR *[])
   if (!result)
   {
     ACE_DEBUG ((LM_DEBUG, "Validating Tree\n"));
-    {for (int i= 0; i < sizeof(nodes)/sizeof(Nodes); ++i)
+    {for (size_t i= 0u; i < sizeof(nodes)/sizeof(Nodes); ++i)
     {
       ACE_RB_Tree_Node<char, int> *node;
 
@@ -84,7 +84,7 @@ run_main (int, ACE_TCHAR *[])
         ACE_DEBUG ((LM_ERROR, ": entry %c=%d has ALREADY moved from %@ to %@\n", nodes[i].key, nodes[i].value, nodes[i].node, node));
         result = 3;
       }
-      else for (int j= i+1; j < sizeof(nodes)/sizeof(Nodes); ++j)
+      else for (size_t j= i+1u; j < sizeof(nodes)/sizeof(Nodes); ++j)
       {
         if (nodes[i].node == nodes[j].node)
         {
@@ -96,7 +96,7 @@ run_main (int, ACE_TCHAR *[])
 
     if (!result)
     {
-      {for (int i= 0; i < sizeof(nodes)/sizeof(Nodes); ++i)
+      {for (size_t i= 0u; i < sizeof(nodes)/sizeof(Nodes); ++i)
       {
         ACE_DEBUG ((LM_DEBUG, "Deleting node %c=%d @ %@\n", nodes[i].key, nodes[i].value, nodes[i].node));
         if (tree.unbind (nodes[i].key))
@@ -113,7 +113,7 @@ run_main (int, ACE_TCHAR *[])
             ACE_DEBUG ((LM_ERROR, ": Found %c=%d @ %@ in tree\n", node->key(), node->item(), node));
             result = 6;
           }
-          else {for (int j= i+1; j < sizeof(nodes)/sizeof(Nodes); ++j)
+          else {for (size_t j= i+1u; j < sizeof(nodes)/sizeof(Nodes); ++j)
           {
             if (tree.find (nodes[j].key, node))
             {