tag | line | file | source code |
dir_cache_entry | 33 | fs/dcache.c | struct dir_cache_entry * next; |
dir_cache_entry | 34 | fs/dcache.c | struct dir_cache_entry * prev; |
dir_cache_entry | 48 | fs/dcache.c | struct dir_cache_entry ** lru_head; |
dir_cache_entry | 49 | fs/dcache.c | struct dir_cache_entry * next_lru, * prev_lru; |
dir_cache_entry | 52 | fs/dcache.c | #define dcache_offset(x) ((unsigned long)&((struct dir_cache_entry*)0)->x) |
dir_cache_entry | 58 | fs/dcache.c | static struct dir_cache_entry level1_cache[DCACHE_SIZE]; |
dir_cache_entry | 59 | fs/dcache.c | static struct dir_cache_entry level2_cache[DCACHE_SIZE]; |
dir_cache_entry | 65 | fs/dcache.c | static struct dir_cache_entry * level1_head; |
dir_cache_entry | 66 | fs/dcache.c | static struct dir_cache_entry * level2_head; |
dir_cache_entry | 77 | fs/dcache.c | static inline void remove_lru(struct dir_cache_entry * de) |
dir_cache_entry | 79 | fs/dcache.c | struct dir_cache_entry * next = de->next_lru; |
dir_cache_entry | 80 | fs/dcache.c | struct dir_cache_entry * prev = de->prev_lru; |
dir_cache_entry | 86 | fs/dcache.c | static inline void add_lru(struct dir_cache_entry * de, struct dir_cache_entry *head) |
dir_cache_entry | 88 | fs/dcache.c | struct dir_cache_entry * prev = head->prev_lru; |
dir_cache_entry | 96 | fs/dcache.c | static inline void update_lru(struct dir_cache_entry * de) |
dir_cache_entry | 120 | fs/dcache.c | static inline void remove_hash(struct dir_cache_entry * de) |
dir_cache_entry | 122 | fs/dcache.c | struct dir_cache_entry * next = de->h.next; |
dir_cache_entry | 125 | fs/dcache.c | struct dir_cache_entry * prev = de->h.prev; |
dir_cache_entry | 132 | fs/dcache.c | static inline void add_hash(struct dir_cache_entry * de, struct hash_list * hash) |
dir_cache_entry | 134 | fs/dcache.c | struct dir_cache_entry * next = hash->next; |
dir_cache_entry | 136 | fs/dcache.c | de->h.prev = (struct dir_cache_entry *) hash; |
dir_cache_entry | 144 | fs/dcache.c | static inline struct dir_cache_entry * find_entry(struct inode * dir, const char * name, int len, struct hash_list * hash) |
dir_cache_entry | 146 | fs/dcache.c | struct dir_cache_entry * de = hash->next; |
dir_cache_entry | 148 | fs/dcache.c | for (de = hash->next ; de != (struct dir_cache_entry *) hash ; de = de->h.next) { |
dir_cache_entry | 168 | fs/dcache.c | static inline void move_to_level2(struct dir_cache_entry * old_de, struct hash_list * hash) |
dir_cache_entry | 170 | fs/dcache.c | struct dir_cache_entry * de; |
dir_cache_entry | 186 | fs/dcache.c | struct dir_cache_entry *de; |
dir_cache_entry | 202 | fs/dcache.c | struct dir_cache_entry *de; |
dir_cache_entry | 227 | fs/dcache.c | struct dir_cache_entry * p; |
dir_cache_entry | 262 | fs/dcache.c | (struct dir_cache_entry *) &hash_table[i]; |