Changeset 974:2091bf698fb1 in freeDiameter for libfdproto/fifo.c

Timestamp:

Mar 15, 2013, 2:14:35 AM (11 years ago)

Author:

Thomas Klausner <tk@giga.or.at>

Branch:

default

Phase:

public

Message:

Remove newlines from fd_log_debug, TRACE_DEBUG, TRACE_ERROR, and TRACE_DEBUG_ERROR
(as far as sed could find them)
with manual fixing afterwards.

File:

• libfdproto/fifo.c (modified) (2 diffs)

libfdproto/fifo.c

@@ -115 +115 @@
                 return;
         
-        fd_log_debug("Dumping queue '%s' (%p):\n", name ?: "?", queue);
+        fd_log_debug("Dumping queue '%s' (%p):", name ?: "?", queue);
         if (!CHECK_FIFO( queue )) {
-                fd_log_debug("  Queue invalid!\n");
+                fd_log_debug("  Queue invalid!");
                 if (queue)
-                        fd_log_debug("  (%x != %x)\n", queue->eyec, FIFO_EYEC);
+                        fd_log_debug("  (%x != %x)", queue->eyec, FIFO_EYEC);
                 return;
         }
         
         CHECK_POSIX_DO(  pthread_mutex_lock( &queue->mtx ), /* continue */  );
-        fd_log_debug("   %d elements in queue / %d threads waiting\n", queue->count, queue->thrs);
-        fd_log_debug("   %d elements max / %d threads waiting to push\n", queue->max, queue->thrs_push);
-        fd_log_debug("   thresholds: %d / %d (h:%d), cb: %p,%p (%p), highest: %d\n",
+        fd_log_debug("   %d elements in queue / %d threads waiting", queue->count, queue->thrs);
+        fd_log_debug("   %d elements max / %d threads waiting to push", queue->max, queue->thrs_push);
+        fd_log_debug("   thresholds: %d / %d (h:%d), cb: %p,%p (%p), highest: %d",
                         queue->high, queue->low, queue->highest, 
                         queue->h_cb, queue->l_cb, queue->data,
@@ -135 +135 @@
                 int i = 0;
                 for (li = queue->list.next; li != &queue->list; li = li->next) {
-                        fd_log_debug("  [%i] item %p in fifo %p:\n", i++, li->o, queue);
+                        fd_log_debug("  [%i] item %p in fifo %p:", i++, li->o, queue);
                         (*dump_item)(level, li->o);
                 }