Lines Matching defs:hash
61 * We keep two hash tables of revoke records. One hashtable belongs to the
63 * belongs to the committing transaction. Accesses to the second hash table
70 * All users operating on the hash table belonging to the running transaction
72 * switching hash tables under them. For operations on the lists of entries in
73 * the hash table j_revoke_lock is used.
75 * Finally, also replay code uses the hash tables but at this moment no one else
92 #include <linux/hash.h>
104 struct list_head hash;
110 /* The revoke table is just a simple hash table of revoke records. */
113 /* It is conceivable that we might want a larger hash table
131 static inline int hash(journal_t *journal, unsigned long long block)
151 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
153 list_add(&record->hash, hash_list);
158 /* Find a revoke record in the journal's hash table. */
166 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
170 while (&(record->hash) != hash_list) {
175 record = (struct jbd2_revoke_record_s *) record->hash.next;
320 * the hash tables without an attached journal_head.
350 BUFFER_TRACE(bh, "found on hash");
450 list_del(&record->hash);
528 * revoke hash, deleting the entries as we go.
557 list_del(&record->hash);
739 list_del(&record->hash);