* Find the cpu with the least load via the least loaded path that has a * lowpri greater than pri pri. A pri of -1 indicates any priority is * acceptable. */
| 803 | * acceptable. |
| 804 | */ |
| 805 | static inline int |
| 806 | sched_lowest(const struct cpu_group *cg, cpuset_t mask, int pri, int maxload, |
| 807 | int prefer) |
| 808 | { |
| 809 | struct cpu_search low; |
| 810 | |
| 811 | low.cs_cpu = -1; |
| 812 | low.cs_prefer = prefer; |
| 813 | low.cs_mask = mask; |
| 814 | low.cs_pri = pri; |
| 815 | low.cs_limit = maxload; |
| 816 | cpu_search_lowest(cg, &low); |
| 817 | return low.cs_cpu; |
| 818 | } |
| 819 | |
| 820 | /* |
| 821 | * Find the cpu with the highest load via the highest loaded path. |
no test coverage detected