Searched refs:seeking (Results 1 – 7 of 7) sorted by relevance
50 seeking, enumerator520 fs->state = seeking; in act()526 case seeking: in act()555 fs->state = seeking; in act()724 case seeking: in swim3_interrupt()732 if (fs->state == seeking) in swim3_interrupt()
37 write) which are serviced in increasing sector order. To limit extra seeking,
41 This specifies, given in Kbytes, the maximum "distance" for backward seeking.51 This parameter is used to compute the cost of backward seeking. If the53 request, then the seeking cost of two requests is considered equivalent.
80 Lookup requires hashing the filename, then seeking across i_sibling pointers
89 and minimise the amount of head seeking when reading a large amount
61 for frequency seeking, either by using hardware functionality as in radio-si470x
177 the attached memory is done by seeking to the desired address, and calling