003 File Manager
Current Path:
/usr/src/contrib/apr-util/test
usr
/
src
/
contrib
/
apr-util
/
test
/
📁
..
📄
Makefile.in
(2.97 KB)
📄
Makefile.win
(4.53 KB)
📄
NWGNUaputest
(4.86 KB)
📄
NWGNUmakefile
(4.27 KB)
📄
abts.c
(9.87 KB)
📄
abts.h
(3.26 KB)
📄
abts_tests.h
(1.32 KB)
📁
data
📄
dbd.c
(13.91 KB)
📄
nw_misc.c
(417 B)
📄
test_apu.h
(2.86 KB)
📄
testall.dsw
(10.12 KB)
📄
testbuckets.c
(16.62 KB)
📄
testcrypto.c
(54.67 KB)
📄
testdate.c
(6.86 KB)
📄
testdbd.c
(6.85 KB)
📄
testdbm.c
(6.02 KB)
📄
testldap.c
(6.93 KB)
📄
testmd4.c
(4.31 KB)
📄
testmd5.c
(3.79 KB)
📄
testmemcache.c
(18.59 KB)
📄
testpass.c
(6.37 KB)
📄
testqueue.c
(3.4 KB)
📄
testredis.c
(16.35 KB)
📄
testreslist.c
(7.75 KB)
📄
testrmm.c
(5.37 KB)
📄
testsiphash.c
(5.35 KB)
📄
teststrmatch.c
(3.11 KB)
📄
testuri.c
(10.09 KB)
📄
testutil.c
(1.82 KB)
📄
testutil.h
(2.39 KB)
📄
testuuid.c
(1.67 KB)
📄
testxlate.c
(4.09 KB)
📄
testxml.c
(5.73 KB)
Editing: testqueue.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; }
Upload File
Create Folder