On Wed, Sep 19, 2001 at 02:40:38AM -0700, Greg Stein wrote:
> Understood. I meant "there is more cleanup that can be done."


The following patch cleans up the fdqueue a bit more. It implements Greg's
suggestions above (getting rid of redundant variables, etc), as well as
converting the simple ap_queue_full/ap_queue_empty tests into macros.
This also reinstates the "not_full" condition, which turned out to
be useful afterall in cases where we wanted to prevent the listener
thread from accepting further connections until the worker queue has
room for more.

I've also made another attempt at reducing the amount of code in
the critical sections that manage the queue, so we can reduce mutex
contention. (Comments?)

*Note: This patch does not yet fix the problem of connections that are
sitting in the queue when the server does a graceful restart. This problem
will be addressed in a forthcomming patch.

-aaron


Index: server/mpm/worker/fdqueue.c
===================================================================
RCS file: /home/cvspublic/httpd-2.0/server/mpm/worker/fdqueue.c,v
retrieving revision 1.7
diff -u -r1.7 fdqueue.c
--- server/mpm/worker/fdqueue.c 2001/09/18 23:09:12     1.7
+++ server/mpm/worker/fdqueue.c 2001/09/22 00:53:14
@@ -62,19 +62,13 @@
  * Detects when the fd_queue_t is full. This utility function is expected
  * to be called from within critical sections, and is not threadsafe.
  */
-static int ap_queue_full(fd_queue_t *queue)
-{
-    return (queue->blanks <= 0);
-}
+#define ap_queue_full(queue) ((queue)->tail == (queue)->bounds)
 
 /**
  * Detects when the fd_queue_t is empty. This utility function is expected
  * to be called from within critical sections, and is not threadsafe.
  */
-static int ap_queue_empty(fd_queue_t *queue)
-{
-    return (queue->blanks >= queue->bounds - 1);
-}
+#define ap_queue_empty(queue) ((queue)->tail == 0)
 
 /**
  * Callback routine that is called to destroy this
@@ -88,6 +82,7 @@
      * XXX: We should at least try to signal an error here, it is
      * indicative of a programmer error. -aaron */
     pthread_cond_destroy(&queue->not_empty);
+    pthread_cond_destroy(&queue->not_full);
     pthread_mutex_destroy(&queue->one_big_mutex);
 
     return FD_QUEUE_SUCCESS;
@@ -99,21 +94,20 @@
 int ap_queue_init(fd_queue_t *queue, int queue_capacity, apr_pool_t *a) 
 {
     int i;
-    int bounds;
 
     if (pthread_mutex_init(&queue->one_big_mutex, NULL) != 0)
         return FD_QUEUE_FAILURE;
     if (pthread_cond_init(&queue->not_empty, NULL) != 0)
         return FD_QUEUE_FAILURE;
+    if (pthread_cond_init(&queue->not_full, NULL) != 0)
+        return FD_QUEUE_FAILURE;
 
-    bounds = queue_capacity + 1;
     queue->tail = 0;
-    queue->data = apr_palloc(a, bounds * sizeof(fd_queue_elem_t));
-    queue->bounds = bounds;
-    queue->blanks = queue_capacity;
+    queue->data = apr_palloc(a, queue_capacity * sizeof(fd_queue_elem_t));
+    queue->bounds = queue_capacity;
 
     /* Set all the sockets in the queue to NULL */
-    for (i = 0; i < bounds; ++i)
+    for (i = 0; i < queue_capacity; ++i)
         queue->data[i].sd = NULL;
 
     apr_pool_cleanup_register(a, queue, ap_queue_destroy, apr_pool_cleanup_null);
@@ -128,23 +122,19 @@
  */
 int ap_queue_push(fd_queue_t *queue, apr_socket_t *sd, apr_pool_t *p) 
 {
+    fd_queue_elem_t *elem;
+
     if (pthread_mutex_lock(&queue->one_big_mutex) != 0) {
         return FD_QUEUE_FAILURE;
     }
 
-    /* If the caller didn't allocate enough slots and tries to push
-     * too many, too bad. */
-    if (ap_queue_full(queue)) {
-        if (pthread_mutex_unlock(&queue->one_big_mutex) != 0) {
-            return FD_QUEUE_FAILURE;
-        }
-        return FD_QUEUE_OVERFLOW;
+    while (ap_queue_full(queue)) {
+        pthread_cond_wait(&queue->not_full, &queue->one_big_mutex);
     }
 
-    queue->data[queue->tail].sd = sd;
-    queue->data[queue->tail].p = p;
-    queue->tail++;
-    queue->blanks--;
+    elem = &queue->data[queue->tail++];
+    elem->sd = sd;
+    elem->p = p;
 
     pthread_cond_signal(&queue->not_empty);
 
@@ -181,13 +171,16 @@
         }
     } 
     
-    queue->tail--;
-    elem = &queue->data[queue->tail];
+    elem = &queue->data[--queue->tail];
     *sd = elem->sd;
     *p = elem->p;
     elem->sd = NULL;
     elem->p = NULL;
-    queue->blanks++;
+
+    /* signal not_full if we were full before this pop */
+    if (queue->tail == queue->bounds - 1) {
+        pthread_cond_signal(&queue->not_full);
+    }
 
     if (pthread_mutex_unlock(&queue->one_big_mutex) != 0) {
         return FD_QUEUE_FAILURE;
@@ -202,6 +195,9 @@
         return FD_QUEUE_FAILURE;
     }
     pthread_cond_broadcast(&queue->not_empty);
+    /* We shouldn't have multiple threads sitting in not_full, but
+     * broadcast just in case. */
+    pthread_cond_broadcast(&queue->not_full);
     if (pthread_mutex_unlock(&queue->one_big_mutex) != 0) {
         return FD_QUEUE_FAILURE;
     }
Index: server/mpm/worker/fdqueue.h
===================================================================
RCS file: /home/cvspublic/httpd-2.0/server/mpm/worker/fdqueue.h,v
retrieving revision 1.7
diff -u -r1.7 fdqueue.h
--- server/mpm/worker/fdqueue.h 2001/09/18 23:09:12     1.7
+++ server/mpm/worker/fdqueue.h 2001/09/22 00:53:14
@@ -72,7 +72,6 @@
 #define FD_QUEUE_FAILURE -1 /* Needs to be an invalid file descriptor because
                                of queue_pop semantics */
 #define FD_QUEUE_EINTR APR_EINTR
-#define FD_QUEUE_OVERFLOW -2
 
 struct fd_queue_elem_t {
     apr_socket_t      *sd;
@@ -87,6 +86,7 @@
     int                blanks;
     pthread_mutex_t    one_big_mutex;
     pthread_cond_t     not_empty;
+    pthread_cond_t     not_full;
     int                cancel_state;
 };
 typedef struct fd_queue_t fd_queue_t;

Reply via email to