Searched hist:f3c4ebe65ea149ec892f94474233cfebe9cbe299 (Results 1 – 6 of 6) sorted by relevance
| /linux/include/linux/ceph/ |
| H A D | ceph_fs.h | diff f3c4ebe65ea149ec892f94474233cfebe9cbe299 Fri Apr 29 05:27:30 CEST 2016 Yan, Zheng <zyan@redhat.com> ceph: using hash value to compose dentry offset
If MDS sorts dentries in dirfrag in hash order, we use hash value to
compose dentry offset. dentry offset is:
(0xff << 52) | ((24 bits hash) << 28) |
(the nth entry hash hash collision)
This offset is stable across directory fragmentation. This alos means
there is no need to reset readdir offset if directory get fragmented
in the middle of readdir.
Signed-off-by: Yan, Zheng <zyan@redhat.com>
|
| /linux/fs/ceph/ |
| H A D | mds_client.h | diff f3c4ebe65ea149ec892f94474233cfebe9cbe299 Fri Apr 29 05:27:30 CEST 2016 Yan, Zheng <zyan@redhat.com> ceph: using hash value to compose dentry offset
If MDS sorts dentries in dirfrag in hash order, we use hash value to
compose dentry offset. dentry offset is:
(0xff << 52) | ((24 bits hash) << 28) |
(the nth entry hash hash collision)
This offset is stable across directory fragmentation. This alos means
there is no need to reset readdir offset if directory get fragmented
in the middle of readdir.
Signed-off-by: Yan, Zheng <zyan@redhat.com>
|
| H A D | dir.c | diff f3c4ebe65ea149ec892f94474233cfebe9cbe299 Fri Apr 29 05:27:30 CEST 2016 Yan, Zheng <zyan@redhat.com> ceph: using hash value to compose dentry offset
If MDS sorts dentries in dirfrag in hash order, we use hash value to
compose dentry offset. dentry offset is:
(0xff << 52) | ((24 bits hash) << 28) |
(the nth entry hash hash collision)
This offset is stable across directory fragmentation. This alos means
there is no need to reset readdir offset if directory get fragmented
in the middle of readdir.
Signed-off-by: Yan, Zheng <zyan@redhat.com>
|
| H A D | super.h | diff f3c4ebe65ea149ec892f94474233cfebe9cbe299 Fri Apr 29 05:27:30 CEST 2016 Yan, Zheng <zyan@redhat.com> ceph: using hash value to compose dentry offset
If MDS sorts dentries in dirfrag in hash order, we use hash value to
compose dentry offset. dentry offset is:
(0xff << 52) | ((24 bits hash) << 28) |
(the nth entry hash hash collision)
This offset is stable across directory fragmentation. This alos means
there is no need to reset readdir offset if directory get fragmented
in the middle of readdir.
Signed-off-by: Yan, Zheng <zyan@redhat.com>
|
| H A D | mds_client.c | diff f3c4ebe65ea149ec892f94474233cfebe9cbe299 Fri Apr 29 05:27:30 CEST 2016 Yan, Zheng <zyan@redhat.com> ceph: using hash value to compose dentry offset
If MDS sorts dentries in dirfrag in hash order, we use hash value to
compose dentry offset. dentry offset is:
(0xff << 52) | ((24 bits hash) << 28) |
(the nth entry hash hash collision)
This offset is stable across directory fragmentation. This alos means
there is no need to reset readdir offset if directory get fragmented
in the middle of readdir.
Signed-off-by: Yan, Zheng <zyan@redhat.com>
|
| H A D | inode.c | diff f3c4ebe65ea149ec892f94474233cfebe9cbe299 Fri Apr 29 05:27:30 CEST 2016 Yan, Zheng <zyan@redhat.com> ceph: using hash value to compose dentry offset
If MDS sorts dentries in dirfrag in hash order, we use hash value to
compose dentry offset. dentry offset is:
(0xff << 52) | ((24 bits hash) << 28) |
(the nth entry hash hash collision)
This offset is stable across directory fragmentation. This alos means
there is no need to reset readdir offset if directory get fragmented
in the middle of readdir.
Signed-off-by: Yan, Zheng <zyan@redhat.com>
|