Searched refs:seeking (Results 1 – 13 of 13) sorted by relevance
46 seeking, enumerator487 fs->state = seeking; in act()493 case seeking: in act()522 fs->state = seeking; in act()686 case seeking: in swim3_interrupt()694 if (fs->state == seeking) in swim3_interrupt()
36 write) which are serviced in increasing sector order. To limit extra seeking,
411 This specifies, given in Kbytes, the maximum "distance" for backward seeking.422 This parameter is used to compute the cost of backward seeking. If the424 request, then the seeking cost of two requests is considered equivalent.
86 Lookup requires hashing the filename, then seeking across i_sibling pointers
97 and minimise the amount of head seeking when reading a large amount
87 else stop seeking. The struct :c:type:`v4l2_tuner`
205 for hardware frequency seeking.
78 for frequency seeking, either by using hardware functionality as in radio-si470x
13 format that does not rely on seeking to adjust data offsets. This
14 disk (this could involve a lot of seeking or a lot of small
176 the attached memory is done by seeking to the desired address, and calling
190 commands such as seeking between file or set marks and implicit tape
864 the lock of every object in __cache_add() when seeking
