178 lines
4.5 KiB
C
178 lines
4.5 KiB
C
|
/*
|
||
|
* Copyright (C) 2019 by Sukchan Lee <acetcom@gmail.com>
|
||
|
*
|
||
|
* This file is part of Open5GS.
|
||
|
*
|
||
|
* This program is free software: you can redistribute it and/or modify
|
||
|
* it under the terms of the GNU Affero General Public License as published by
|
||
|
* the Free Software Foundation, either version 3 of the License, or
|
||
|
* (at your option) any later version.
|
||
|
*
|
||
|
* This program is distributed in the hope that it will be useful,
|
||
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
* GNU General Public License for more details.
|
||
|
*
|
||
|
* You should have received a copy of the GNU General Public License
|
||
|
* along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||
|
*/
|
||
|
|
||
|
#include "ogs-core.h"
|
||
|
#include "core/abts.h"
|
||
|
|
||
|
#define NUMBER_CONSUMERS 3
|
||
|
#define CONSUMER_ACTIVITY 4
|
||
|
#define NUMBER_PRODUCERS 4
|
||
|
#define PRODUCER_ACTIVITY 5
|
||
|
#define QUEUE_SIZE 100
|
||
|
|
||
|
static ogs_queue_t *queue;
|
||
|
|
||
|
static void consumer(void *data)
|
||
|
{
|
||
|
long sleeprate;
|
||
|
abts_case *tc = data;
|
||
|
int rv;
|
||
|
void *v;
|
||
|
|
||
|
sleeprate = 1000000/CONSUMER_ACTIVITY;
|
||
|
ogs_usleep((ogs_random32() % 4) * 1000000); /* sleep random seconds */
|
||
|
|
||
|
while (1) {
|
||
|
rv = ogs_queue_pop(queue, &v);
|
||
|
|
||
|
if (rv == OGS_ERROR)
|
||
|
continue;
|
||
|
|
||
|
if (rv == OGS_DONE)
|
||
|
break;
|
||
|
|
||
|
ABTS_TRUE(tc, v == NULL);
|
||
|
ABTS_TRUE(tc, rv == OGS_OK);
|
||
|
|
||
|
ogs_usleep(sleeprate); /* sleep this long to acheive our rate */
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static void producer(void *data)
|
||
|
{
|
||
|
long sleeprate;
|
||
|
abts_case *tc = data;
|
||
|
int rv;
|
||
|
|
||
|
sleeprate = 1000000/PRODUCER_ACTIVITY;
|
||
|
ogs_usleep((ogs_random32() % 4) * 1000000); /* sleep random seconds */
|
||
|
|
||
|
while (1)
|
||
|
{
|
||
|
rv = ogs_queue_push(queue, NULL);
|
||
|
|
||
|
if (rv == OGS_ERROR)
|
||
|
continue;
|
||
|
|
||
|
if (rv == OGS_DONE)
|
||
|
break;
|
||
|
|
||
|
ABTS_TRUE(tc, rv == OGS_OK);
|
||
|
|
||
|
ogs_usleep(sleeprate); /* sleep this long to acheive our rate */
|
||
|
}
|
||
|
}
|
||
|
|
||
|
static void test_queue_producer_consumer(abts_case *tc, void *data)
|
||
|
{
|
||
|
unsigned int i;
|
||
|
int rv;
|
||
|
ogs_thread_t *consumer_thread[NUMBER_CONSUMERS];
|
||
|
ogs_thread_t *producer_thread[NUMBER_PRODUCERS];
|
||
|
|
||
|
queue = ogs_queue_create(QUEUE_SIZE);
|
||
|
ABTS_PTR_NOTNULL(tc, queue);
|
||
|
|
||
|
for (i = 0; i < NUMBER_CONSUMERS; i++) {
|
||
|
consumer_thread[i] = ogs_thread_create(consumer, tc);
|
||
|
ABTS_PTR_NOTNULL(tc, consumer_thread[i]);
|
||
|
}
|
||
|
|
||
|
for (i = 0; i < NUMBER_PRODUCERS; i++) {
|
||
|
producer_thread[i] = ogs_thread_create(producer, tc);
|
||
|
ABTS_PTR_NOTNULL(tc, producer_thread[i]);
|
||
|
}
|
||
|
|
||
|
ogs_msleep(3000); /* sleep 3 seconds */
|
||
|
|
||
|
rv = ogs_queue_term(queue);
|
||
|
ABTS_INT_EQUAL(tc, OGS_OK, rv);
|
||
|
|
||
|
for (i = 0; i < NUMBER_CONSUMERS; i++) {
|
||
|
ogs_thread_destroy(consumer_thread[i]);
|
||
|
}
|
||
|
|
||
|
for (i = 0; i < NUMBER_PRODUCERS; i++) {
|
||
|
ogs_thread_destroy(producer_thread[i]);
|
||
|
}
|
||
|
|
||
|
ogs_queue_destroy(queue);
|
||
|
}
|
||
|
|
||
|
static void test_queue_timeout(abts_case *tc, void *data)
|
||
|
{
|
||
|
ogs_queue_t *q;
|
||
|
int rv;
|
||
|
ogs_time_t start;
|
||
|
unsigned int i;
|
||
|
void *value;
|
||
|
|
||
|
q = ogs_queue_create(5);
|
||
|
ABTS_PTR_NOTNULL(tc, q);
|
||
|
|
||
|
for (i = 0; i < 2; ++i) {
|
||
|
rv = ogs_queue_timedpush(q, NULL, ogs_time_from_msec(1));
|
||
|
ABTS_INT_EQUAL(tc, OGS_OK, rv);
|
||
|
}
|
||
|
for (i = 0; i < 3; ++i) {
|
||
|
rv = ogs_queue_trypush(q, NULL);
|
||
|
ABTS_INT_EQUAL(tc, OGS_OK, rv);
|
||
|
}
|
||
|
|
||
|
start = ogs_get_monotonic_time();
|
||
|
rv = ogs_queue_timedpush(q, NULL, ogs_time_from_msec(1));
|
||
|
ABTS_INT_EQUAL(tc, OGS_TIMEUP, rv);
|
||
|
ABTS_TRUE(tc, ogs_get_monotonic_time() - start >= ogs_time_from_msec(1));
|
||
|
|
||
|
rv = ogs_queue_trypush(q, NULL);
|
||
|
ABTS_INT_EQUAL(tc, OGS_RETRY, rv);
|
||
|
|
||
|
for (i = 0; i < 2; ++i) {
|
||
|
rv = ogs_queue_timedpop(q, &value, ogs_time_from_msec(1));
|
||
|
ABTS_INT_EQUAL(tc, OGS_OK, rv);
|
||
|
}
|
||
|
for (i = 0; i < 3; ++i) {
|
||
|
rv = ogs_queue_trypop(q, &value);
|
||
|
ABTS_INT_EQUAL(tc, OGS_OK, rv);
|
||
|
}
|
||
|
|
||
|
start = ogs_get_monotonic_time();
|
||
|
rv = ogs_queue_timedpop(q, &value, ogs_time_from_sec(1));
|
||
|
ABTS_INT_EQUAL(tc, OGS_TIMEUP, rv);
|
||
|
ABTS_TRUE(tc, ogs_get_monotonic_time() - start >= ogs_time_from_msec(1));
|
||
|
|
||
|
rv = ogs_queue_trypop(q, &value);
|
||
|
ABTS_INT_EQUAL(tc, OGS_RETRY, rv);
|
||
|
|
||
|
rv = ogs_queue_term(q);
|
||
|
ABTS_INT_EQUAL(tc, OGS_OK, rv);
|
||
|
|
||
|
ogs_queue_destroy(q);
|
||
|
}
|
||
|
|
||
|
abts_suite *test_queue(abts_suite *suite)
|
||
|
{
|
||
|
suite = ADD_SUITE(suite)
|
||
|
|
||
|
abts_run_test(suite, test_queue_producer_consumer, NULL);
|
||
|
abts_run_test(suite, test_queue_timeout, NULL);
|
||
|
|
||
|
return suite;
|
||
|
}
|