| tag | line | file | source code |
| hash_pos | 32 | fs/affs/amigaffs.c | affs_find_next_hash_entry(int hsize, void *dir_data, ULONG *hash_pos) |
| hash_pos | 37 | fs/affs/amigaffs.c | for (i = *hash_pos; i < hsize; i++) |
| hash_pos | 42 | fs/affs/amigaffs.c | *hash_pos = i; |
| hash_pos | 76 | fs/affs/dir.c | ULONG hash_pos; |
| hash_pos | 122 | fs/affs/dir.c | hash_pos = (filp->f_pos - 2) >> 16; |
| hash_pos | 126 | fs/affs/dir.c | hash_pos++; |
| hash_pos | 127 | fs/affs/dir.c | filp->f_pos = ((hash_pos << 16) | chain_pos) + 2; |
| hash_pos | 133 | fs/affs/dir.c | while (hash_pos < AFFS_I2HSIZE(inode) && |
| hash_pos | 134 | fs/affs/dir.c | !((struct dir_front *)dir_bh->b_data)->hashtable[hash_pos]) |
| hash_pos | 135 | fs/affs/dir.c | hash_pos++; |
| hash_pos | 136 | fs/affs/dir.c | if (hash_pos >= AFFS_I2HSIZE(inode)) |
| hash_pos | 139 | fs/affs/dir.c | i = htonl(((struct dir_front *)dir_bh->b_data)->hashtable[hash_pos]); |
| hash_pos | 150 | fs/affs/dir.c | pd_debug("AFFS: hash_pos=%lu chain_pos=%lu\n", hash_pos, chain_pos); |
| hash_pos | 176 | fs/affs/dir.c | hash_pos++; |
| hash_pos | 180 | fs/affs/dir.c | filp->f_pos = ((hash_pos << 16) | chain_pos) + 2; |
| hash_pos | 29 | include/linux/affs_fs.h | extern int affs_find_next_hash_entry(int bsize, void *dir_data, ULONG *hash_pos); |