代码拉取完成,页面将自动刷新
同步操作将从 HoperunHarmony/stress-ng 强制同步,此操作会覆盖自 Fork 仓库以来所做的任何修改,且无法恢复!!!
确定后同步将在后台操作,完成时将刷新页面,请耐心等待。
/*
* Copyright (C) 2013-2021 Canonical, Ltd.
* Copyright (C) 2022 Colin Ian King.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "stress-ng.h"
#define MIN_TSEARCH_SIZE (1 * KB)
#define MAX_TSEARCH_SIZE (4 * MB)
#define DEFAULT_TSEARCH_SIZE (64 * KB)
static const stress_help_t help[] = {
{ NULL, "tsearch N", "start N workers that exercise a tree search" },
{ NULL, "tsearch-ops N", "stop after N tree search bogo operations" },
{ NULL, "tsearch-size N", "number of 32 bit integers to tsearch" },
{ NULL, NULL, NULL }
};
/*
* stress_set_tsearch_size()
* set tsearch size from given option string
*/
static int stress_set_tsearch_size(const char *opt)
{
uint64_t tsearch_size;
tsearch_size = stress_get_uint64(opt);
stress_check_range("tsearch-size", tsearch_size,
MIN_TSEARCH_SIZE, MAX_TSEARCH_SIZE);
return stress_set_setting("tsearch-size", TYPE_ID_UINT64, &tsearch_size);
}
/*
* cmp()
* sort on int32 values
*/
static int cmp(const void *p1, const void *p2)
{
const int32_t *i1 = (const int32_t *)p1;
const int32_t *i2 = (const int32_t *)p2;
if (*i1 > *i2)
return 1;
else if (*i1 < *i2)
return -1;
else
return 0;
}
/*
* stress_tsearch()
* stress tsearch
*/
static int stress_tsearch(const stress_args_t *args)
{
uint64_t tsearch_size = DEFAULT_TSEARCH_SIZE;
int32_t *data;
size_t i, n;
if (!stress_get_setting("tsearch-size", &tsearch_size)) {
if (g_opt_flags & OPT_FLAGS_MAXIMIZE)
tsearch_size = MAX_TSEARCH_SIZE;
if (g_opt_flags & OPT_FLAGS_MINIMIZE)
tsearch_size = MIN_TSEARCH_SIZE;
}
n = (size_t)tsearch_size;
if ((data = calloc(n, sizeof(*data))) == NULL) {
pr_fail("%s: calloc failed, out of memory\n", args->name);
return EXIT_NO_RESOURCE;
}
stress_set_proc_state(args->name, STRESS_STATE_RUN);
do {
void *root = NULL;
/* Step #1, populate tree */
for (i = 0; i < n; i++) {
data[i] = (int32_t)(((stress_mwc32() & 0xfff) << 20) ^ i);
if (tsearch(&data[i], &root, cmp) == NULL) {
size_t j;
pr_err("%s: cannot allocate new "
"tree node\n", args->name);
for (j = 0; j < i; j++)
tdelete(&data[j], &root, cmp);
goto abort;
}
}
/* Step #2, find */
for (i = 0; keep_stressing_flag() && i < n; i++) {
void **result;
result = tfind(&data[i], &root, cmp);
if (g_opt_flags & OPT_FLAGS_VERIFY) {
if (!result) {
pr_fail("%s: element %zu could not be found\n",
args->name, i);
} else {
int32_t *val;
val = *result;
if (*val != data[i]) {
pr_fail("%s: element "
"%zu found %" PRIu32
", expecting %" PRIu32 "\n",
args->name, i, *val, data[i]);
}
}
}
}
/* Step #3, delete */
for (i = 0; i < n; i++) {
void **result;
result = tdelete(&data[i], &root, cmp);
if ((g_opt_flags & OPT_FLAGS_VERIFY) && (result == NULL)) {
pr_fail("%s: element %zu could not be found\n",
args->name, i);
}
}
inc_counter(args);
} while (keep_stressing(args));
abort:
stress_set_proc_state(args->name, STRESS_STATE_DEINIT);
free(data);
return EXIT_SUCCESS;
}
static const stress_opt_set_func_t opt_set_funcs[] = {
{ OPT_tsearch_size, stress_set_tsearch_size },
{ 0, NULL }
};
stressor_info_t stress_tsearch_info = {
.stressor = stress_tsearch,
.class = CLASS_CPU_CACHE | CLASS_CPU | CLASS_MEMORY,
.opt_set_funcs = opt_set_funcs,
.verify = VERIFY_OPTIONAL,
.help = help
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。