Lines Matching refs:seek
439 * between increasing or decreasing by minimizing the seek distance between
442 * Trivial math assures that the unsorted average seek distance when doing
446 * average seek distance for (Q-1) random requests over S sectors is S/Q.
447 * The elevator sorting hence divides the seek distance by a factor Q/3.
449 * driver effectively reduces the seek distance by the predicted factor
2117 unsigned long maxsec = 0, minsec = ULONG_MAX, seek = 0, iseek = 0;
2161 seek += sl[n] - sl[n - 1];
2163 seek += sl[n - 1] - sl[n];
2170 seek += cursec - sl[0];
2172 seek += sl[0] - cursec;
2211 seeknosort += seek / 1024;