Entry list for disk-order update. More...
#include <waa.h>
Data Fields | |
| struct estat * | first |
Pointer to packed struct estat array. | |
| int | count |
| Number of entries in array. | |
| struct waa__entry_blocks_t * | next |
| Pointers for linked list. | |
| struct waa__entry_blocks_t * | prev |
Entry list for disk-order update.
This structure is used to store a linked list of struct estat in (mostly) ascending inode order. It is used in waa__update_tree() to lstat() all (needed) entries in (hopefully) an order which minimizes the backtracking of the storage media. What this means is: The harddisk head should go straight in one direction, and avoid seeking as much as possible.
Definition at line 38 of file waa.h.
Number of entries in array.
Definition at line 45 of file waa.h.
Referenced by waa__input_tree(), waa__new_entry_block(), and waa__update_tree().
struct estat* waa__entry_blocks_t::first [read] |
Pointer to packed struct estat array.
Definition at line 40 of file waa.h.
Referenced by waa__input_tree(), waa__new_entry_block(), and waa__update_tree().
struct waa__entry_blocks_t* waa__entry_blocks_t::next [read] |
Pointers for linked list.
Definition at line 42 of file waa.h.
Referenced by waa__input_tree(), waa__new_entry_block(), and waa__update_tree().
struct waa__entry_blocks_t * waa__entry_blocks_t::prev [read] |
Definition at line 42 of file waa.h.
Referenced by waa__input_tree(), and waa__new_entry_block().
1.6.1