提交 a82bfd04 编写于 作者: J Jiri Olsa 提交者: Arnaldo Carvalho de Melo

perf ui progress: Fix progress update

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: NJiri 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.orgSigned-off-by: NArnaldo Carvalho de Melo <acme@redhat.com>
上级 4d286c89
#include <linux/kernel.h>
#include "../cache.h" #include "../cache.h"
#include "progress.h" #include "progress.h"
...@@ -14,10 +15,14 @@ struct ui_progress_ops *ui_progress__ops = &null_progress__ops; ...@@ -14,10 +15,14 @@ struct ui_progress_ops *ui_progress__ops = &null_progress__ops;
void ui_progress__update(struct ui_progress *p, u64 adv) void ui_progress__update(struct ui_progress *p, u64 adv)
{ {
u64 last = p->curr;
p->curr += adv; p->curr += adv;
if (p->curr >= p->next) { if (p->curr >= p->next) {
p->next += p->step; u64 nr = DIV_ROUND_UP(p->curr - last, p->step);
p->next += nr * p->step;
ui_progress__ops->update(p); ui_progress__ops->update(p);
} }
} }
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册