mirror of
https://github.com/MariaDB/server.git
synced 2025-01-29 18:20:07 +01:00
220 lines
7.7 KiB
C++
220 lines
7.7 KiB
C++
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
|
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
|
#ident "$Id$"
|
|
/*
|
|
COPYING CONDITIONS NOTICE:
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
it under the terms of version 2 of the GNU General Public License as
|
|
published by the Free Software Foundation, and provided that the
|
|
following conditions are met:
|
|
|
|
* Redistributions of source code must retain this COPYING
|
|
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
|
|
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
|
|
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
|
|
GRANT (below).
|
|
|
|
* Redistributions in binary form must reproduce this COPYING
|
|
CONDITIONS NOTICE, the COPYRIGHT NOTICE (below), the
|
|
DISCLAIMER (below), the UNIVERSITY PATENT NOTICE (below), the
|
|
PATENT MARKING NOTICE (below), and the PATENT RIGHTS
|
|
GRANT (below) in the documentation and/or other materials
|
|
provided with the distribution.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301, USA.
|
|
|
|
COPYRIGHT NOTICE:
|
|
|
|
TokuDB, Tokutek Fractal Tree Indexing Library.
|
|
Copyright (C) 2007-2013 Tokutek, Inc.
|
|
|
|
DISCLAIMER:
|
|
|
|
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.
|
|
|
|
UNIVERSITY PATENT NOTICE:
|
|
|
|
The technology is licensed by the Massachusetts Institute of
|
|
Technology, Rutgers State University of New Jersey, and the Research
|
|
Foundation of State University of New York at Stony Brook under
|
|
United States of America Serial No. 11/760379 and to the patents
|
|
and/or patent applications resulting from it.
|
|
|
|
PATENT MARKING NOTICE:
|
|
|
|
This software is covered by US Patent No. 8,185,551.
|
|
|
|
PATENT RIGHTS GRANT:
|
|
|
|
"THIS IMPLEMENTATION" means the copyrightable works distributed by
|
|
Tokutek as part of the Fractal Tree project.
|
|
|
|
"PATENT CLAIMS" means the claims of patents that are owned or
|
|
licensable by Tokutek, both currently or in the future; and that in
|
|
the absence of this license would be infringed by THIS
|
|
IMPLEMENTATION or by using or running THIS IMPLEMENTATION.
|
|
|
|
"PATENT CHALLENGE" shall mean a challenge to the validity,
|
|
patentability, enforceability and/or non-infringement of any of the
|
|
PATENT CLAIMS or otherwise opposing any of the PATENT CLAIMS.
|
|
|
|
Tokutek hereby grants to you, for the term and geographical scope of
|
|
the PATENT CLAIMS, a non-exclusive, no-charge, royalty-free,
|
|
irrevocable (except as stated in this section) patent license to
|
|
make, have made, use, offer to sell, sell, import, transfer, and
|
|
otherwise run, modify, and propagate the contents of THIS
|
|
IMPLEMENTATION, where such license applies only to the PATENT
|
|
CLAIMS. This grant does not include claims that would be infringed
|
|
only as a consequence of further modifications of THIS
|
|
IMPLEMENTATION. If you or your agent or licensee institute or order
|
|
or agree to the institution of patent litigation against any entity
|
|
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
|
THIS IMPLEMENTATION constitutes direct or contributory patent
|
|
infringement, or inducement of patent infringement, then any rights
|
|
granted to you under this License shall terminate as of the date
|
|
such litigation is filed. If you or your agent or exclusive
|
|
licensee institute or order or agree to the institution of a PATENT
|
|
CHALLENGE, then Tokutek may terminate any rights granted to you
|
|
under this License.
|
|
*/
|
|
|
|
#ident "Copyright (c) 2007-2013 Tokutek Inc. All rights reserved."
|
|
|
|
#include "test.h"
|
|
#include <util/threadpool.h>
|
|
|
|
#include <memory.h>
|
|
#include <toku_os.h>
|
|
#include <toku_portability.h>
|
|
#include <portability/toku_pthread.h>
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
|
|
#include <string.h>
|
|
#include <errno.h>
|
|
#if defined(HAVE_MALLOC_H)
|
|
# include <malloc.h>
|
|
#elif defined(HAVE_SYS_MALLOC_H)
|
|
# include <sys/malloc.h>
|
|
#endif
|
|
|
|
struct my_threadpool {
|
|
THREADPOOL threadpool;
|
|
toku_mutex_t mutex;
|
|
toku_cond_t wait;
|
|
int closed;
|
|
int counter;
|
|
};
|
|
|
|
static void
|
|
my_threadpool_init (struct my_threadpool *my_threadpool, int max_threads) {
|
|
int r;
|
|
r = toku_thread_pool_create(&my_threadpool->threadpool, max_threads); assert(r == 0);
|
|
assert(my_threadpool != 0);
|
|
toku_mutex_init(&my_threadpool->mutex, 0);
|
|
toku_cond_init(&my_threadpool->wait, 0);
|
|
my_threadpool->closed = 0;
|
|
my_threadpool->counter = 0;
|
|
}
|
|
|
|
static void
|
|
my_threadpool_destroy (struct my_threadpool *my_threadpool, int max_threads) {
|
|
toku_mutex_lock(&my_threadpool->mutex);
|
|
my_threadpool->closed = 1;
|
|
toku_cond_broadcast(&my_threadpool->wait);
|
|
toku_mutex_unlock(&my_threadpool->mutex);
|
|
|
|
if (verbose) printf("current %d\n", toku_thread_pool_get_current_threads(my_threadpool->threadpool));
|
|
toku_thread_pool_destroy(&my_threadpool->threadpool); assert(my_threadpool->threadpool == 0);
|
|
assert(my_threadpool->counter == max_threads);
|
|
toku_mutex_destroy(&my_threadpool->mutex);
|
|
toku_cond_destroy(&my_threadpool->wait);
|
|
}
|
|
|
|
static void *
|
|
my_thread_f (void *arg) {
|
|
struct my_threadpool *CAST_FROM_VOIDP(my_threadpool, arg);
|
|
toku_mutex_lock(&my_threadpool->mutex);
|
|
my_threadpool->counter++;
|
|
while (!my_threadpool->closed) {
|
|
toku_cond_wait(&my_threadpool->wait, &my_threadpool->mutex);
|
|
}
|
|
toku_mutex_unlock(&my_threadpool->mutex);
|
|
if (verbose) printf("%lu:%s:exit\n", (unsigned long)toku_os_gettid(), __FUNCTION__);
|
|
return arg;
|
|
}
|
|
|
|
static void *my_malloc_always_fails(size_t n UU()) {
|
|
errno = ENOMEM;
|
|
return NULL;
|
|
}
|
|
|
|
static int
|
|
usage (void) {
|
|
printf("threadpool-test: [-v] [-malloc-fail] [N]\n");
|
|
printf("-malloc-fail simulate malloc failures\n");
|
|
printf("N max number of threads in the thread pool\n");
|
|
return 1;
|
|
}
|
|
|
|
int
|
|
test_main (int argc, const char *argv[]) {
|
|
int max_threads = 1;
|
|
int do_malloc_fail = 0;
|
|
|
|
int i;
|
|
for (i=1; i<argc; i++) {
|
|
const char *arg = argv[i];
|
|
if (strcmp(arg, "-h") == 0 || strcmp(arg, "-help") == 0) {
|
|
return usage();
|
|
} else if (strcmp(arg, "-v") == 0) {
|
|
verbose++;
|
|
continue;
|
|
} else if (strcmp(arg, "-q") == 0) {
|
|
verbose = 0;
|
|
continue;
|
|
} else if (strcmp(arg, "-malloc-fail") == 0) {
|
|
do_malloc_fail = 1;
|
|
continue;
|
|
} else
|
|
max_threads = atoi(arg);
|
|
}
|
|
|
|
struct my_threadpool my_threadpool;
|
|
THREADPOOL threadpool;
|
|
|
|
ZERO_STRUCT(my_threadpool);
|
|
my_threadpool_init(&my_threadpool, max_threads);
|
|
threadpool = my_threadpool.threadpool;
|
|
if (verbose) printf("test threadpool_set_busy\n");
|
|
for (i=0; i<2*max_threads; i++) {
|
|
assert(toku_thread_pool_get_current_threads(threadpool) == (i >= max_threads ? max_threads : i));
|
|
int n = 1;
|
|
toku_thread_pool_run(threadpool, 0, &n, my_thread_f, &my_threadpool);
|
|
}
|
|
assert(toku_thread_pool_get_current_threads(threadpool) == max_threads);
|
|
my_threadpool_destroy(&my_threadpool, max_threads);
|
|
|
|
if (do_malloc_fail) {
|
|
if (verbose) printf("test threadpool_create with malloc failure\n");
|
|
// test threadpool malloc fails causes ENOMEM
|
|
|
|
toku_set_func_malloc(my_malloc_always_fails);
|
|
int r;
|
|
threadpool = NULL;
|
|
r = toku_thread_pool_create(&threadpool, 0); assert(r == ENOMEM);
|
|
r = toku_thread_pool_create(&threadpool, 1); assert(r == ENOMEM);
|
|
toku_set_func_malloc(NULL);
|
|
}
|
|
|
|
return 0;
|
|
}
|