mirror of
https://github.com/torvalds/linux
synced 2024-10-24 04:06:04 +00:00
a82bfd041d
We currently update the 'next' variable only with a single step value. But it's possible the 'adv' update is bigger than single 'step' value. This would leave 'next' value under counted and force unnecessary ui_progress__ops->update calls. Calculate the amount of steps we need for 'adv' update and increase the 'next' with that amounts of steps. Signed-off-by: Jiri Olsa <jolsa@kernel.org> Cc: David Ahern <dsahern@gmail.com> Cc: Namhyung Kim <namhyung@kernel.org> Cc: Peter Zijlstra <a.p.zijlstra@chello.nl> Link: http://lkml.kernel.org/r/20170908120510.22515-3-jolsa@kernel.org Signed-off-by: Arnaldo Carvalho de Melo <acme@redhat.com>
44 lines
813 B
C
44 lines
813 B
C
#include <linux/kernel.h>
|
|
#include "../cache.h"
|
|
#include "progress.h"
|
|
|
|
static void null_progress__update(struct ui_progress *p __maybe_unused)
|
|
{
|
|
}
|
|
|
|
static struct ui_progress_ops null_progress__ops =
|
|
{
|
|
.update = null_progress__update,
|
|
};
|
|
|
|
struct ui_progress_ops *ui_progress__ops = &null_progress__ops;
|
|
|
|
void ui_progress__update(struct ui_progress *p, u64 adv)
|
|
{
|
|
u64 last = p->curr;
|
|
|
|
p->curr += adv;
|
|
|
|
if (p->curr >= p->next) {
|
|
u64 nr = DIV_ROUND_UP(p->curr - last, p->step);
|
|
|
|
p->next += nr * p->step;
|
|
ui_progress__ops->update(p);
|
|
}
|
|
}
|
|
|
|
void ui_progress__init(struct ui_progress *p, u64 total, const char *title)
|
|
{
|
|
p->curr = 0;
|
|
p->next = p->step = total / 16 ?: 1;
|
|
p->total = total;
|
|
p->title = title;
|
|
|
|
}
|
|
|
|
void ui_progress__finish(void)
|
|
{
|
|
if (ui_progress__ops->finish)
|
|
ui_progress__ops->finish();
|
|
}
|