Changeset 767:c47c16436f71 in freeDiameter for tests/testfifo.c

Timestamp:

Oct 24, 2011, 6:43:32 AM (13 years ago)

Author:

Sebastien Decugis <sdecugis@nict.go.jp>

Branch:

default

Phase:

public

Message:

Added a limit on fifo queues to avoid memory exaustion when messages are received faster than handled

File:

• tests/testfifo.c (modified) (6 diffs)

tests/testfifo.c

@@ -111 +111 @@
 }
 
+/* The test function, to be threaded */
+static int iter  = 0;
+static void * test_fct2(void * data)
+{
+        int i;
+        int * item;
+        struct test_data * td = (struct test_data *) data;
+        
+        for (i=0; i< td->nbr; i++) {
+                item = malloc(sizeof(int));
+                CHECK( 1, item ? 1 : 0 );
+                *item = i;
+                CHECK( 0, fd_fifo_post(td->queue, &item) );
+                iter++;
+        }
+        
+        return NULL;
+}
+
 
 /* Main test routine */
@@ -145 +164 @@
                 
                 /* Create the queue */
-                CHECK( 0, fd_fifo_new(&queue) );
+                CHECK( 0, fd_fifo_new(&queue, 0) );
                 
                 /* Check the count is 0 */
@@ -233 +252 @@
                 
                 /* Create the queue */
-                CHECK( 0, fd_fifo_new(&queue) );
+                CHECK( 0, fd_fifo_new(&queue, 0) );
                 
                 /* Create the barrier */
@@ -303 +322 @@
                 
                 /* Create the queue */
-                CHECK( 0, fd_fifo_new(&queue) );
+                CHECK( 0, fd_fifo_new(&queue, 0) );
                 
                 /* Create the barrier */
@@ -370 +389 @@
                 
                 /* Create the queue */
-                CHECK( 0, fd_fifo_new(&queue) );
+                CHECK( 0, fd_fifo_new(&queue, 0) );
                 
                 /* Prepare the test data */
@@ -442 +461 @@
         }
         
+        /* Test max queue limit */
+        {
+                struct fifo             *queue = NULL;
+                struct test_data         td;
+                pthread_t                th;
+                int *                   item, i;
+                
+                /* Create the queue */
+                CHECK( 0, fd_fifo_new(&queue, 10) );
+                
+                /* Initialize the test data structures */
+                td.queue = queue;
+                td.nbr = 15;
+                
+                CHECK( 0, pthread_create( &th, NULL, test_fct2, &td ) );
+                
+                usleep(1000); /* 1 millisec */
+                
+                CHECK( 10, iter );
+                
+                CHECK( 0, fd_fifo_tryget(queue, &item) );
+                CHECK( 0, *item);
+                free(item);
+                
+                usleep(1000); /* 1 millisec */
+                
+                CHECK( 11, iter );
+                
+                for (i=1; i<4; i++) {
+                        CHECK( 0, fd_fifo_get(queue, &item) );
+                        CHECK( i, *item);
+                        free(item);
+                }
+                
+                usleep(1000); /* 1 millisec */
+                
+                CHECK( 14, iter );
+                
+                /* fd_fifo_dump(0, "test", queue, NULL); */
+                
+                for (; i < td.nbr; i++) {
+                        CHECK( 0, fd_fifo_tryget(queue, &item) );
+                        CHECK( i, *item);
+                        free(item);
+                }
+                
+                CHECK( 0, pthread_join( th, NULL ) );
+                CHECK( 15, iter );
+                
+        }
+        
         /* Delete the messages */
         CHECK( 0, fd_msg_free( msg1 ) );