Loading drivers/power/qcom/lpm-stats.c +6 −3 Original line number Diff line number Diff line /* Copyright (c) 2012-2016, The Linux Foundation. All rights reserved. /* Copyright (c) 2012-2016, 2018, The Linux Foundation. All rights reserved. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 and Loading Loading @@ -682,11 +682,14 @@ static void cleanup_stats(struct lpm_stats *stats) { struct list_head *centry = NULL; struct lpm_stats *pos = NULL; struct lpm_stats *n = NULL; centry = &stats->child; list_for_each_entry_reverse(pos, centry, sibling) { if (!list_empty(&pos->child)) list_for_each_entry_safe_reverse(pos, n, centry, sibling) { if (!list_empty(&pos->child)) { cleanup_stats(pos); continue; } list_del_init(&pos->child); Loading Loading
drivers/power/qcom/lpm-stats.c +6 −3 Original line number Diff line number Diff line /* Copyright (c) 2012-2016, The Linux Foundation. All rights reserved. /* Copyright (c) 2012-2016, 2018, The Linux Foundation. All rights reserved. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 and Loading Loading @@ -682,11 +682,14 @@ static void cleanup_stats(struct lpm_stats *stats) { struct list_head *centry = NULL; struct lpm_stats *pos = NULL; struct lpm_stats *n = NULL; centry = &stats->child; list_for_each_entry_reverse(pos, centry, sibling) { if (!list_empty(&pos->child)) list_for_each_entry_safe_reverse(pos, n, centry, sibling) { if (!list_empty(&pos->child)) { cleanup_stats(pos); continue; } list_del_init(&pos->child); Loading