• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/e2fsprogs/old_e2fsprogs/

Lines Matching refs:hash

5471 		 * update their parent's min and max hash values
5605 * processed first, so we know what hash version to use.
5847 ext2_dirhash_t hash = 0, prev_hash;
5873 prev_hash = hash;
5874 hash = i ? (ext2fs_le32_to_cpu(ent[i].hash) & ~1) : 0;
5883 if (hash < prev_hash &&
5893 if (hash < min_hash)
5894 min_hash = hash;
5895 if (hash > max_hash)
5896 max_hash = hash;
5897 dx_db->node_min_hash = hash;
5900 ext2fs_le32_to_cpu(ent[i+1].hash) & ~1;
5989 ext2_dirhash_t hash;
6232 fs->super->s_hash_seed, &hash, 0);
6233 if (hash < dx_db->min_hash)
6234 dx_db->min_hash = hash;
6235 if (hash > dx_db->max_hash)
6236 dx_db->max_hash = hash;
8804 /* Unsupported hash version in HTREE directory */
8806 N_("@h %i has an unsupported hash version (%N)\n"),
8857 N_("@a in @i %i has a hash (%N) which is @n (must be 0)\n"),
9195 /* Node in HTREE directory has bad min hash */
9197 N_("@p @h %d: node (%B) has bad min hash\n"),
9200 /* Node in HTREE directory has bad max hash */
9202 N_("@p @h %d: node (%B) has bad max hash\n"),
9236 N_("@p @h %d: node (%B) has an unordered hash table\n"),
10161 * rehash.c --- rebuild hash tree directories
10213 ext2_dirhash_t hash;
10292 ent->hash = ent->minor_hash = 0;
10298 &ent->hash, &ent->minor_hash);
10307 /* Used for sorting the hash entry */
10331 /* Used for sorting the hash entry */
10338 if (he_a->hash > he_b->hash)
10340 else if (he_a->hash < he_b->hash)
10514 &ent->hash, &ent->minor_hash);
10563 if (ent->hash == prev_hash)
10564 outdir->hashes[outdir->num-1] = ent->hash | 1;
10566 outdir->hashes[outdir->num-1] = ent->hash;
10579 prev_hash = ent->hash;
10675 root->hash =
10695 root->hash =
10708 dx_ent->hash =
11019 struct list_head hash;
11025 /* The revoke table is just a simple hash table of revoke records. */
11028 /* It is conceivable that we might want a larger hash table
11038 /* Borrowed from buffer.c: this is a tried and tested block hash function */
11039 static int hash(journal_t *journal, unsigned long block)
11061 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
11062 list_add(&record->hash, hash_list);
11069 /* Find a revoke record in the journal's hash table. */
11077 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
11080 while (&(record->hash) != hash_list) {
11083 record = (struct jbd_revoke_record_s *) record->hash.next;
11240 list_del(&record->hash);