代码拉取完成,页面将自动刷新
同步操作将从 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_LSEARCH_SIZE (1 * KB)
#define MAX_LSEARCH_SIZE (1 * MB)
#define DEFAULT_LSEARCH_SIZE (8 * KB)
static const stress_help_t help[] = {
{ NULL, "lsearch N", "start N workers that exercise a linear search" },
{ NULL, "lsearch-ops N", "stop after N linear search bogo operations" },
{ NULL, "lsearch-size N", "number of 32 bit integers to lsearch" },
{ NULL, NULL, NULL }
};
/*
* stress_set_lsearch_size()
* set lsearch size from given option string
*/
static int stress_set_lsearch_size(const char *opt)
{
uint64_t lsearch_size;
lsearch_size = stress_get_uint64(opt);
stress_check_range("lsearch-size", lsearch_size,
MIN_LSEARCH_SIZE, MAX_LSEARCH_SIZE);
return stress_set_setting("lsearch-size", TYPE_ID_UINT64, &lsearch_size);
}
/*
* cmp()
* lsearch int32 comparison for sorting
*/
static int cmp(const void *p1, const void *p2)
{
return (int)(*(const int32_t *)p1 - *(const int32_t *)p2);
}
/*
* stress_lsearch()
* stress lsearch
*/
static int stress_lsearch(const stress_args_t *args)
{
int32_t *data, *root;
size_t i, max;
uint64_t lsearch_size = DEFAULT_LSEARCH_SIZE;
if (!stress_get_setting("lsearch-size", &lsearch_size)) {
if (g_opt_flags & OPT_FLAGS_MAXIMIZE)
lsearch_size = MAX_LSEARCH_SIZE;
if (g_opt_flags & OPT_FLAGS_MINIMIZE)
lsearch_size = MIN_LSEARCH_SIZE;
}
max = (size_t)lsearch_size;
if ((data = calloc(max, sizeof(*data))) == NULL) {
pr_fail("%s: malloc failed, out of memory\n", args->name);
return EXIT_NO_RESOURCE;
}
if ((root = calloc(max, sizeof(*data))) == NULL) {
free(data);
pr_fail("%s: malloc failed, out of memory\n", args->name);
return EXIT_NO_RESOURCE;
}
stress_set_proc_state(args->name, STRESS_STATE_RUN);
do {
size_t n = 0;
/* Step #1, populate with data */
for (i = 0; keep_stressing_flag() && i < max; i++) {
void *ptr;
data[i] = (int32_t)(((stress_mwc32() & 0xfff) << 20) ^ i);
ptr = lsearch(&data[i], root, &n, sizeof(*data), cmp);
(void)ptr;
}
/* Step #2, find */
for (i = 0; keep_stressing_flag() && i < n; i++) {
int32_t *result;
result = lfind(&data[i], root, &n, sizeof(*data), cmp);
if (g_opt_flags & OPT_FLAGS_VERIFY) {
if (result == NULL)
pr_fail("%s: element %zu could not be found\n", args->name, i);
else if (*result != data[i])
pr_fail("%s: element %zu found %" PRIu32 ", expecting %" PRIu32 "\n",
args->name, i, *result, data[i]);
}
}
inc_counter(args);
} while (keep_stressing(args));
stress_set_proc_state(args->name, STRESS_STATE_DEINIT);
free(root);
free(data);
return EXIT_SUCCESS;
}
static const stress_opt_set_func_t opt_set_funcs[] = {
{ OPT_lsearch_size, stress_set_lsearch_size },
{ 0, NULL }
};
stressor_info_t stress_lsearch_info = {
.stressor = stress_lsearch,
.class = CLASS_CPU_CACHE | CLASS_CPU | CLASS_MEMORY,
.opt_set_funcs = opt_set_funcs,
.verify = VERIFY_OPTIONAL,
.help = help
};
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。