Lines Matching full:best
639 # a delta and determining the best possible assignment of interrupts to CPUs.
656 # be between 0 (best) and 1 (major bad). goodness is determined by evaluating
665 # then we return best-case, since what's to complain about?
1060 # find_goal() and its helper do_find_goal() are used to find the best
1065 # identified as part of the set of interrupts which best meet the goal.
1069 # The best fit is determined by performing a depth-first search. do_find_goal
1075 # 1) What is the best goal-fit if I include ivecs[index]?
1076 # 2) What is the best goal-fit if I exclude ivecs[index]?
1082 # It then compares the two results, decide which one best meets the goals,
1083 # and returns the result. The return value is the best-fit's interrupt load,
1084 # followed by a list of all the interrupts which make up that best-fit.
1089 # array if including all remaining interrupts will still leave the best-fit
1102 @goals = (); # the empty set will best meet the goal
1165 # Evaluate the "with" option, i.e. the best matching goal which
1180 # Evaluate the "without" option, i.e. the best matching goal which
1189 # best fits the goal. If one is greater than goal and the other is
1205 # Return the load of our best case scenario, followed by all the ivecs