1
0
mirror of https://git.FreeBSD.org/src.git synced 2024-12-05 09:14:03 +00:00
freebsd/contrib/apr-util/test/testqueue.c
Peter Wemm 937a200089 Introduce svnlite so that we can check out our source code again.
This is actually a fully functional build except:
* All internal shared libraries are static linked to make sure there
  is no interference with ports (and to reduce build time).
* It does not have the python/perl/etc plugin or API support.
* By default, it installs as "svnlite" rather than "svn".
* If WITH_SVN added in make.conf, you get "svn".
* If WITHOUT_SVNLITE is in make.conf, this is completely disabled.

To be absolutely clear, this is not intended for any use other than
checking out freebsd source and committing, like we once did with cvs.

It should be usable for small scale local repositories that don't
need the python/perl plugin architecture.
2013-06-18 02:53:45 +00:00

136 lines
3.4 KiB
C

/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "apu.h"
#include "apr_queue.h"
#include "apr_thread_pool.h"
#include "apr_time.h"
#include "abts.h"
#include "testutil.h"
#if APR_HAS_THREADS
#define NUMBER_CONSUMERS 3
#define CONSUMER_ACTIVITY 4
#define NUMBER_PRODUCERS 4
#define PRODUCER_ACTIVITY 5
#define QUEUE_SIZE 100
static apr_queue_t *queue;
static void * APR_THREAD_FUNC consumer(apr_thread_t *thd, void *data)
{
long sleeprate;
abts_case *tc = data;
apr_status_t rv;
void *v;
sleeprate = 1000000/CONSUMER_ACTIVITY;
apr_sleep((rand() % 4) * 1000000); /* sleep random seconds */
while (1)
{
rv = apr_queue_pop(queue, &v);
if (rv == APR_EINTR)
continue;
if (rv == APR_EOF)
break;
ABTS_TRUE(tc, v == NULL);
ABTS_TRUE(tc, rv == APR_SUCCESS);
apr_sleep(sleeprate); /* sleep this long to acheive our rate */
}
return NULL;
}
static void * APR_THREAD_FUNC producer(apr_thread_t *thd, void *data)
{
long sleeprate;
abts_case *tc = data;
apr_status_t rv;
sleeprate = 1000000/PRODUCER_ACTIVITY;
apr_sleep((rand() % 4) * 1000000); /* sleep random seconds */
while (1)
{
rv = apr_queue_push(queue, NULL);
if (rv == APR_EINTR)
continue;
if (rv == APR_EOF)
break;
ABTS_TRUE(tc, rv == APR_SUCCESS);
apr_sleep(sleeprate); /* sleep this long to acheive our rate */
}
return NULL;
}
static void test_queue_producer_consumer(abts_case *tc, void *data)
{
unsigned int i;
apr_status_t rv;
apr_thread_pool_t *thrp;
/* XXX: non-portable */
srand((unsigned int)apr_time_now());
rv = apr_queue_create(&queue, QUEUE_SIZE, p);
ABTS_INT_EQUAL(tc, APR_SUCCESS, rv);
rv = apr_thread_pool_create(&thrp, 0, NUMBER_CONSUMERS + NUMBER_PRODUCERS, p);
ABTS_INT_EQUAL(tc, APR_SUCCESS, rv);
for (i = 0; i < NUMBER_CONSUMERS; i++) {
rv = apr_thread_pool_push(thrp, consumer, tc, 0, NULL);
ABTS_INT_EQUAL(tc, APR_SUCCESS, rv);
}
for (i = 0; i < NUMBER_PRODUCERS; i++) {
rv = apr_thread_pool_push(thrp, producer, tc, 0, NULL);
ABTS_INT_EQUAL(tc, APR_SUCCESS, rv);
}
apr_sleep(5000000); /* sleep 5 seconds */
rv = apr_queue_term(queue);
ABTS_INT_EQUAL(tc, APR_SUCCESS, rv);
rv = apr_thread_pool_destroy(thrp);
ABTS_INT_EQUAL(tc, APR_SUCCESS, rv);
}
#endif /* APR_HAS_THREADS */
abts_suite *testqueue(abts_suite *suite)
{
suite = ADD_SUITE(suite);
#if APR_HAS_THREADS
abts_run_test(suite, test_queue_producer_consumer, NULL);
#endif /* APR_HAS_THREADS */
return suite;
}