[C-MPI-commits] SF.net SVN: c-mpi:[202] src

[<jmw...@us...>]

Revision: 202
          http://c-mpi.svn.sourceforge.net/c-mpi/?rev=202&view=rev
Author:   jmwozniak
Date:     2011-05-03 15:55:18 +0000 (Tue, 03 May 2011)

Log Message:
-----------
Cleanup output

Modified Paths:
--------------
    src/adts/list.c
    src/kda-2/conn-A.c
    src/kda-2/kademlia.c

Modified: src/adts/list.c
===================================================================
--- src/adts/list.c	2011-05-02 22:55:48 UTC (rev 201)
+++ src/adts/list.c	2011-05-03 15:55:18 UTC (rev 202)
@@ -529,7 +529,6 @@
   while (head && head != good)
   {
     struct list_item* next = head->next;
-    printf("free: %i \n", *(int*) head->data);
     free(head);
     target->size--;
     head = next;
@@ -582,7 +581,6 @@
 /**
    Remove and return all elements from the list where
    cmp(data,arg) == 0.
-   @return true if one or more items were deleted.
 */
 struct list*
 list_pop_where(struct list* target,
@@ -618,7 +616,6 @@
   while (head && head != good)
   {
     struct list_item* next = head->next;
-    printf("free: %i \n", *(int*) head->data);
     list_append(result, head);
     target->size--;
     head = next;

Modified: src/kda-2/conn-A.c
===================================================================
--- src/kda-2/conn-A.c	2011-05-02 22:55:48 UTC (rev 201)
+++ src/kda-2/conn-A.c	2011-05-03 15:55:18 UTC (rev 202)
@@ -43,7 +43,7 @@
     free(result);
     KDA_Neighbor neighbor;
     KDA_Neighbor_make_id(other_id, node, &neighbor);
-    bool added = neighbor_add(&neighbor);
+    neighbor_add(&neighbor);
     MPIRPC_Node dummy = {0};
     KDA_Join(dummy, &neighbor);
   }

Modified: src/kda-2/kademlia.c
===================================================================
--- src/kda-2/kademlia.c	2011-05-02 22:55:48 UTC (rev 201)
+++ src/kda-2/kademlia.c	2011-05-03 15:55:18 UTC (rev 202)
@@ -810,8 +810,8 @@
 
   op->k_closest = KDA_Closest(op->object_id);
 
-  printf("local closest: \n");
-  ilist_dump(KDA_Neighbor_id_tostring, op->k_closest);
+  DEBUG(printf("local closest: \n");
+        ilist_dump(KDA_Neighbor_id_tostring, op->k_closest););
 
   return KDA_Find_node_again(op);
 }
@@ -1037,7 +1037,6 @@
         item = item->next)
     {
       KDA_Neighbor* neighbor = item->data;
-      char* string = KDA_Neighbor_name(neighbor);
       MPIRPC_Block(neighbor->node, "shutdown", NULL);
     }
   DONE;


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.