include/linux/cpufreq.h

720  * @idx:	the table entry currently being processed
723 #define cpufreq_for_each_entry_idx(pos, table, idx)	\
724 	for (pos = table, idx = 0; pos->frequency != CPUFREQ_TABLE_END; \
725 		pos++, idx++)
745  * @idx:	the table entry currently being processed
748 #define cpufreq_for_each_valid_entry_idx(pos, table, idx)		\
749 	cpufreq_for_each_entry_idx(pos, table, idx)			\
760  * @idx: the table entry currently being processed.
764 #define cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies)	\
765 	cpufreq_for_each_valid_entry_idx(pos, table, idx)			\
800 	int idx, best = -1;
802 	cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies) {
806 			return idx;
808 		best = idx;
822 	int idx, best = -1;
824 	cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies) {
828 			return idx;
831 			best = idx;
837 			return idx;
868 	int idx, best = -1;
870 	cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies) {
874 			return idx;
877 			best = idx;
883 			return idx;
899 	int idx, best = -1;
901 	cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies) {
905 			return idx;
907 		best = idx;
936 	int idx, best = -1;
938 	cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies) {
942 			return idx;
945 			best = idx;
951 			return idx;
955 			return idx;
971 	int idx, best = -1;
973 	cpufreq_for_each_efficient_entry_idx(pos, table, idx, efficiencies) {
977 			return idx;
980 			best = idx;
986 			return idx;
990 			return idx;
1013 static inline bool cpufreq_is_in_limits(struct cpufreq_policy *policy, int idx)
1017 	if (idx < 0)
1020 	freq = policy->freq_table[idx].frequency;
1031 	int idx;
1042 		idx = cpufreq_table_find_index_l(policy, target_freq,
1046 		idx = cpufreq_table_find_index_h(policy, target_freq,
1050 		idx = cpufreq_table_find_index_c(policy, target_freq,
1059 	if (!cpufreq_is_in_limits(policy, idx) && efficiencies) {
1064 	return idx;