Loading drivers/platform/msm/msm_bus/msm_bus_rules.c +7 −2 Original line number Diff line number Diff line /* Copyright (c) 2014-2016, The Linux Foundation. All rights reserved. /* Copyright (c) 2014-2017, 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 @@ -435,8 +435,10 @@ void print_all_rules(void) { struct rule_node_info *node_it = NULL; mutex_lock(&msm_bus_rules_lock); list_for_each_entry(node_it, &node_list, link) print_rules(node_it); mutex_unlock(&msm_bus_rules_lock); } void print_rules_buf(char *buf, int max_buf) Loading @@ -446,6 +448,7 @@ void print_rules_buf(char *buf, int max_buf) int i; int cnt = 0; mutex_lock(&msm_bus_rules_lock); list_for_each_entry(node_it, &node_list, link) { cnt += scnprintf(buf + cnt, max_buf - cnt, "\n Now printing rules for Node %d cur_rule %d\n", Loading Loading @@ -483,6 +486,7 @@ void print_rules_buf(char *buf, int max_buf) node_rule->rule_ops.combo_op); } } mutex_unlock(&msm_bus_rules_lock); } static int copy_rule(struct bus_rule_type *src, struct rules_def *node_rule, Loading Loading @@ -870,11 +874,12 @@ bool msm_rule_are_rules_registered(void) { bool ret = false; mutex_lock(&msm_bus_rules_lock); if (list_empty(&node_list)) ret = false; else ret = true; mutex_unlock(&msm_bus_rules_lock); return ret; } Loading
drivers/platform/msm/msm_bus/msm_bus_rules.c +7 −2 Original line number Diff line number Diff line /* Copyright (c) 2014-2016, The Linux Foundation. All rights reserved. /* Copyright (c) 2014-2017, 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 @@ -435,8 +435,10 @@ void print_all_rules(void) { struct rule_node_info *node_it = NULL; mutex_lock(&msm_bus_rules_lock); list_for_each_entry(node_it, &node_list, link) print_rules(node_it); mutex_unlock(&msm_bus_rules_lock); } void print_rules_buf(char *buf, int max_buf) Loading @@ -446,6 +448,7 @@ void print_rules_buf(char *buf, int max_buf) int i; int cnt = 0; mutex_lock(&msm_bus_rules_lock); list_for_each_entry(node_it, &node_list, link) { cnt += scnprintf(buf + cnt, max_buf - cnt, "\n Now printing rules for Node %d cur_rule %d\n", Loading Loading @@ -483,6 +486,7 @@ void print_rules_buf(char *buf, int max_buf) node_rule->rule_ops.combo_op); } } mutex_unlock(&msm_bus_rules_lock); } static int copy_rule(struct bus_rule_type *src, struct rules_def *node_rule, Loading Loading @@ -870,11 +874,12 @@ bool msm_rule_are_rules_registered(void) { bool ret = false; mutex_lock(&msm_bus_rules_lock); if (list_empty(&node_list)) ret = false; else ret = true; mutex_unlock(&msm_bus_rules_lock); return ret; }