diff options
author | Stephen Boyd <sboyd@kernel.org> | 2019-08-27 01:47:29 +0200 |
---|---|---|
committer | Stephen Boyd <sboyd@kernel.org> | 2019-09-20 00:26:36 +0200 |
commit | 7f4804665b58ced5d09848785d835af0f7a51b3e (patch) | |
tree | 51f9dc10b1f6f30793c8ea65b412cfb60645c23b /drivers/clk/clk.c | |
parent | clk: Use seq_puts() in possible_parent_show() (diff) | |
download | linux-7f4804665b58ced5d09848785d835af0f7a51b3e.tar.xz linux-7f4804665b58ced5d09848785d835af0f7a51b3e.zip |
clk: Drop !clk checks in debugfs dumping
These recursive functions have checks for !clk being passed in, but the
callers are always looping through lists and therefore the pointers
can't be NULL. Drop the checks to simplify the code.
Signed-off-by: Stephen Boyd <sboyd@kernel.org>
Link: https://lkml.kernel.org/r/20190826234729.145593-1-sboyd@kernel.org
Diffstat (limited to 'drivers/clk/clk.c')
-rw-r--r-- | drivers/clk/clk.c | 12 |
1 files changed, 0 insertions, 12 deletions
diff --git a/drivers/clk/clk.c b/drivers/clk/clk.c index b6f50db759a4..7783c25fb407 100644 --- a/drivers/clk/clk.c +++ b/drivers/clk/clk.c @@ -2849,9 +2849,6 @@ static struct hlist_head *orphan_list[] = { static void clk_summary_show_one(struct seq_file *s, struct clk_core *c, int level) { - if (!c) - return; - seq_printf(s, "%*s%-*s %7d %8d %8d %11lu %10lu %5d %6d\n", level * 3 + 1, "", 30 - level * 3, c->name, @@ -2866,9 +2863,6 @@ static void clk_summary_show_subtree(struct seq_file *s, struct clk_core *c, { struct clk_core *child; - if (!c) - return; - clk_summary_show_one(s, c, level); hlist_for_each_entry(child, &c->children, child_node) @@ -2900,9 +2894,6 @@ static void clk_dump_one(struct seq_file *s, struct clk_core *c, int level) { unsigned long min_rate, max_rate; - if (!c) - return; - clk_core_get_boundaries(c, &min_rate, &max_rate); /* This should be JSON format, i.e. elements separated with a comma */ @@ -2923,9 +2914,6 @@ static void clk_dump_subtree(struct seq_file *s, struct clk_core *c, int level) { struct clk_core *child; - if (!c) - return; - clk_dump_one(s, c, level); hlist_for_each_entry(child, &c->children, child_node) { |