mirror of
https://github.com/AsahiLinux/u-boot
synced 2024-12-05 02:51:00 +00:00
2896839483
A hlist is headed by just a single pointer, so can only be traversed forwards, and insertions can only happen at the head (or before/after an existing list member). But each list node still consists of two pointers, so arbitrary elements can still be removed in O(1). This is precisely what we need for the cyclic_list - we never need to traverse it backwards, and the order the callbacks appear in the list should really not matter. One advantage, and the main reason for doing this switch, is that an empty list is represented by a NULL head pointer, so unlike a list_head, it does not need separate C code to initialize - a memset(,0,) of the containing structure is sufficient. This is mostly mechanical: - The iterators are updated with an h prefix, and the type of the temporary variable changed to struct hlist_node*. - Adding/removing is now just hlist_add_head (and not tail) and hlist_del(). - struct members and function return values updated. Signed-off-by: Rasmus Villemoes <rasmus.villemoes@prevas.dk> Reviewed-by: Stefan Roese <sr@denx.de> Tested-by: Stefan Roese <sr@denx.de> Tested-by: Tim Harvey <tharvey@gateworks.com> # imx8mm-venice-*
85 lines
2.2 KiB
C
85 lines
2.2 KiB
C
// SPDX-License-Identifier: GPL-2.0+
|
|
/*
|
|
* A general-purpose cyclic execution infrastructure, to allow "small"
|
|
* (run-time wise) functions to be executed at a specified frequency.
|
|
* Things like LED blinking or watchdog triggering are examples for such
|
|
* tasks.
|
|
*
|
|
* Copyright (C) 2022 Stefan Roese <sr@denx.de>
|
|
*/
|
|
|
|
#include <common.h>
|
|
#include <command.h>
|
|
#include <cyclic.h>
|
|
#include <div64.h>
|
|
#include <malloc.h>
|
|
#include <linux/delay.h>
|
|
|
|
struct cyclic_demo_info {
|
|
uint delay_us;
|
|
};
|
|
|
|
static void cyclic_demo(void *ctx)
|
|
{
|
|
struct cyclic_demo_info *info = ctx;
|
|
|
|
/* Just a small dummy delay here */
|
|
udelay(info->delay_us);
|
|
}
|
|
|
|
static int do_cyclic_demo(struct cmd_tbl *cmdtp, int flag, int argc,
|
|
char *const argv[])
|
|
{
|
|
struct cyclic_demo_info *info;
|
|
struct cyclic_info *cyclic;
|
|
uint time_ms;
|
|
|
|
if (argc < 3)
|
|
return CMD_RET_USAGE;
|
|
|
|
info = malloc(sizeof(struct cyclic_demo_info));
|
|
if (!info) {
|
|
printf("out of memory\n");
|
|
return CMD_RET_FAILURE;
|
|
}
|
|
|
|
time_ms = simple_strtoul(argv[1], NULL, 0);
|
|
info->delay_us = simple_strtoul(argv[2], NULL, 0);
|
|
|
|
/* Register demo cyclic function */
|
|
cyclic = cyclic_register(cyclic_demo, time_ms * 1000, "cyclic_demo",
|
|
info);
|
|
if (!cyclic)
|
|
printf("Registering of cyclic_demo failed\n");
|
|
|
|
printf("Registered function \"%s\" to be executed all %dms\n",
|
|
"cyclic_demo", time_ms);
|
|
|
|
return 0;
|
|
}
|
|
|
|
static int do_cyclic_list(struct cmd_tbl *cmdtp, int flag, int argc,
|
|
char *const argv[])
|
|
{
|
|
struct cyclic_info *cyclic;
|
|
struct hlist_node *tmp;
|
|
u64 cnt, freq;
|
|
|
|
hlist_for_each_entry_safe(cyclic, tmp, cyclic_get_list(), list) {
|
|
cnt = cyclic->run_cnt * 1000000ULL * 100ULL;
|
|
freq = lldiv(cnt, timer_get_us() - cyclic->start_time_us);
|
|
printf("function: %s, cpu-time: %lld us, frequency: %lld.%02d times/s\n",
|
|
cyclic->name, cyclic->cpu_time_us,
|
|
lldiv(freq, 100), do_div(freq, 100));
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static char cyclic_help_text[] =
|
|
"cyclic demo <cycletime_ms> <delay_us> - register cyclic demo function\n"
|
|
"cyclic list - list cyclic functions\n";
|
|
|
|
U_BOOT_CMD_WITH_SUBCMDS(cyclic, "Cyclic", cyclic_help_text,
|
|
U_BOOT_SUBCMD_MKENT(demo, 3, 1, do_cyclic_demo),
|
|
U_BOOT_SUBCMD_MKENT(list, 1, 1, do_cyclic_list));
|