170 lines
4.0 KiB
C
170 lines
4.0 KiB
C
|
/*-
|
||
|
* BSD LICENSE
|
||
|
*
|
||
|
* Copyright (c) Intel Corporation.
|
||
|
* All rights reserved.
|
||
|
*
|
||
|
* Redistribution and use in source and binary forms, with or without
|
||
|
* modification, are permitted provided that the following conditions
|
||
|
* are met:
|
||
|
*
|
||
|
* * Redistributions of source code must retain the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer.
|
||
|
* * Redistributions in binary form must reproduce the above copyright
|
||
|
* notice, this list of conditions and the following disclaimer in
|
||
|
* the documentation and/or other materials provided with the
|
||
|
* distribution.
|
||
|
* * Neither the name of Intel Corporation nor the names of its
|
||
|
* contributors may be used to endorse or promote products derived
|
||
|
* from this software without specific prior written permission.
|
||
|
*
|
||
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
*/
|
||
|
|
||
|
#include "spdk_cunit.h"
|
||
|
#include "spdk/io_channel.h"
|
||
|
#include "spdk_internal/mock.h"
|
||
|
|
||
|
static uint32_t g_ut_num_threads;
|
||
|
|
||
|
int allocate_threads(int num_threads);
|
||
|
void free_threads(void);
|
||
|
void poll_threads(void);
|
||
|
int poll_thread(uintptr_t thread_id);
|
||
|
|
||
|
struct ut_msg {
|
||
|
spdk_thread_fn fn;
|
||
|
void *ctx;
|
||
|
TAILQ_ENTRY(ut_msg) link;
|
||
|
};
|
||
|
|
||
|
struct ut_thread {
|
||
|
struct spdk_thread *thread;
|
||
|
struct spdk_io_channel *ch;
|
||
|
TAILQ_HEAD(, ut_msg) msgs;
|
||
|
};
|
||
|
|
||
|
struct ut_thread *g_ut_threads;
|
||
|
|
||
|
static void
|
||
|
__send_msg(spdk_thread_fn fn, void *ctx, void *thread_ctx)
|
||
|
{
|
||
|
struct ut_thread *thread = thread_ctx;
|
||
|
struct ut_msg *msg;
|
||
|
|
||
|
msg = calloc(1, sizeof(*msg));
|
||
|
SPDK_CU_ASSERT_FATAL(msg != NULL);
|
||
|
|
||
|
msg->fn = fn;
|
||
|
msg->ctx = ctx;
|
||
|
TAILQ_INSERT_TAIL(&thread->msgs, msg, link);
|
||
|
}
|
||
|
|
||
|
static uintptr_t g_thread_id = MOCK_PASS_THRU;
|
||
|
|
||
|
static void
|
||
|
set_thread(uintptr_t thread_id)
|
||
|
{
|
||
|
g_thread_id = thread_id;
|
||
|
MOCK_SET(pthread_self, pthread_t, (pthread_t)thread_id);
|
||
|
}
|
||
|
|
||
|
int
|
||
|
allocate_threads(int num_threads)
|
||
|
{
|
||
|
struct spdk_thread *thread;
|
||
|
uint32_t i;
|
||
|
|
||
|
g_ut_num_threads = num_threads;
|
||
|
|
||
|
g_ut_threads = calloc(num_threads, sizeof(*g_ut_threads));
|
||
|
SPDK_CU_ASSERT_FATAL(g_ut_threads != NULL);
|
||
|
|
||
|
for (i = 0; i < g_ut_num_threads; i++) {
|
||
|
set_thread(i);
|
||
|
spdk_allocate_thread(__send_msg, &g_ut_threads[i], NULL);
|
||
|
thread = spdk_get_thread();
|
||
|
SPDK_CU_ASSERT_FATAL(thread != NULL);
|
||
|
g_ut_threads[i].thread = thread;
|
||
|
TAILQ_INIT(&g_ut_threads[i].msgs);
|
||
|
}
|
||
|
|
||
|
set_thread(MOCK_PASS_THRU);
|
||
|
return 0;
|
||
|
}
|
||
|
|
||
|
void
|
||
|
free_threads(void)
|
||
|
{
|
||
|
uint32_t i;
|
||
|
|
||
|
for (i = 0; i < g_ut_num_threads; i++) {
|
||
|
set_thread(i);
|
||
|
spdk_free_thread();
|
||
|
}
|
||
|
|
||
|
g_ut_num_threads = 0;
|
||
|
free(g_ut_threads);
|
||
|
g_ut_threads = NULL;
|
||
|
}
|
||
|
|
||
|
int
|
||
|
poll_thread(uintptr_t thread_id)
|
||
|
{
|
||
|
int count = 0;
|
||
|
struct ut_thread *thread = &g_ut_threads[thread_id];
|
||
|
struct ut_msg *msg;
|
||
|
uintptr_t original_thread_id;
|
||
|
|
||
|
CU_ASSERT(thread_id != (uintptr_t)MOCK_PASS_THRU);
|
||
|
CU_ASSERT(thread_id < g_ut_num_threads);
|
||
|
|
||
|
original_thread_id = g_thread_id;
|
||
|
set_thread(thread_id);
|
||
|
|
||
|
while (!TAILQ_EMPTY(&thread->msgs)) {
|
||
|
msg = TAILQ_FIRST(&thread->msgs);
|
||
|
TAILQ_REMOVE(&thread->msgs, msg, link);
|
||
|
|
||
|
msg->fn(msg->ctx);
|
||
|
count++;
|
||
|
free(msg);
|
||
|
}
|
||
|
|
||
|
set_thread(original_thread_id);
|
||
|
|
||
|
return count;
|
||
|
}
|
||
|
|
||
|
void
|
||
|
poll_threads(void)
|
||
|
{
|
||
|
bool msg_processed;
|
||
|
uint32_t i, count;
|
||
|
|
||
|
while (true) {
|
||
|
msg_processed = false;
|
||
|
|
||
|
for (i = 0; i < g_ut_num_threads; i++) {
|
||
|
count = poll_thread(i);
|
||
|
if (count > 0) {
|
||
|
msg_processed = true;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
if (!msg_processed) {
|
||
|
break;
|
||
|
}
|
||
|
}
|
||
|
}
|