1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
4 * Ceph - scalable distributed file system
6 * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>
8 * This is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License version 2.1, as published by the Free Software
11 * Foundation. See file COPYING.
15 #include "include/compat.h"
16 #include "include/types.h"
17 #include "include/buffer.h"
18 #include "osd/osd_types.h"
21 #include "HashIndex.h"
23 #include "common/errno.h"
24 #include "common/debug.h"
25 #define dout_context cct
26 #define dout_subsys ceph_subsys_filestore
28 const string
HashIndex::SUBDIR_ATTR
= "contents";
29 const string
HashIndex::SETTINGS_ATTR
= "settings";
30 const string
HashIndex::IN_PROGRESS_OP_TAG
= "in_progress_op";
32 /// hex digit to integer value
33 int hex_to_int(char c
)
35 if (c
>= '0' && c
<= '9')
37 if (c
>= 'A' && c
<= 'F')
42 /// int value to hex digit
43 char int_to_hex(int v
)
51 /// reverse bits in a nibble (0..15)
52 int reverse_nibble_bits(int in
)
62 /// reverse nibble bits in a hex digit
63 char reverse_hexdigit_bits(char c
)
65 return int_to_hex(reverse_nibble_bits(hex_to_int(c
)));
68 /// reverse nibble bits in a hex string
69 string
reverse_hexdigit_bits_string(string s
)
71 for (unsigned i
=0; i
<s
.size(); ++i
)
72 s
[i
] = reverse_hexdigit_bits(s
[i
]);
76 /// compare hex digit (as length 1 string) bitwise
77 bool cmp_hexdigit_bitwise(const string
& l
, const string
& r
)
79 assert(l
.length() == 1 && r
.length() == 1);
80 int lv
= hex_to_int(l
[0]);
81 int rv
= hex_to_int(r
[0]);
84 return reverse_nibble_bits(lv
) < reverse_nibble_bits(rv
);
87 /// compare hex digit string bitwise
88 bool cmp_hexdigit_string_bitwise(const string
& l
, const string
& r
)
90 string ll
= reverse_hexdigit_bits_string(l
);
91 string rr
= reverse_hexdigit_bits_string(r
);
95 int HashIndex::cleanup() {
97 int r
= get_attr_path(vector
<string
>(), IN_PROGRESS_OP_TAG
, bl
);
99 // No in progress operations!
102 bufferlist::iterator i
= bl
.begin();
103 InProgressOp
in_progress(i
);
105 r
= get_info(in_progress
.path
, &info
);
107 return end_split_or_merge(in_progress
.path
);
112 if (in_progress
.is_split())
113 return complete_split(in_progress
.path
, info
);
114 else if (in_progress
.is_merge())
115 return complete_merge(in_progress
.path
, info
);
116 else if (in_progress
.is_col_split()) {
117 for (vector
<string
>::iterator i
= in_progress
.path
.begin();
118 i
!= in_progress
.path
.end();
120 vector
<string
> path(in_progress
.path
.begin(), i
);
121 int r
= reset_attr(path
);
131 int HashIndex::reset_attr(
132 const vector
<string
> &path
)
135 int r
= path_exists(path
, &exists
);
140 map
<string
, ghobject_t
> objects
;
141 vector
<string
> subdirs
;
142 r
= list_objects(path
, 0, 0, &objects
);
145 r
= list_subdirs(path
, &subdirs
);
150 info
.hash_level
= path
.size();
151 info
.objs
= objects
.size();
152 info
.subdirs
= subdirs
.size();
153 return set_info(path
, info
);
156 int HashIndex::col_split_level(
159 const vector
<string
> &path
,
164 /* For each subdir, move, recurse, or ignore based on comparing the low order
165 * bits of the hash represented by the subdir path with inbits, match passed
168 vector
<string
> subdirs
;
169 int r
= from
.list_subdirs(path
, &subdirs
);
172 map
<string
, ghobject_t
> objects
;
173 r
= from
.list_objects(path
, 0, 0, &objects
);
178 for (vector
<string
>::iterator i
= subdirs
.begin();
183 vector
<string
> sub_path(path
.begin(), path
.end());
184 sub_path
.push_back(*i
);
185 path_to_hobject_hash_prefix(sub_path
, &bits
, &hash
);
187 if (hobject_t::match_hash(hash
, bits
, match
)) {
197 if (*mkdirred
> path
.size())
198 *mkdirred
= path
.size();
199 } // else, skip, doesn't need to be moved or recursed into
201 if (hobject_t::match_hash(hash
, inbits
, match
)) {
204 } // else, skip, doesn't need to be moved or recursed into
207 /* Then, do the same for each object */
208 map
<string
, ghobject_t
> objs_to_move
;
209 for (map
<string
, ghobject_t
>::iterator i
= objects
.begin();
212 if (i
->second
.match(inbits
, match
)) {
213 objs_to_move
.insert(*i
);
217 if (objs_to_move
.empty() && to_move
.empty())
220 // Make parent directories as needed
221 while (*mkdirred
< path
.size()) {
224 vector
<string
> creating_path(path
.begin(), path
.begin()+*mkdirred
);
225 r
= to
.path_exists(creating_path
, &exists
);
233 info
.hash_level
= creating_path
.size();
234 if (*mkdirred
< path
.size() - 1)
236 r
= to
.start_col_split(creating_path
);
239 r
= to
.create_path(creating_path
);
242 r
= to
.set_info(creating_path
, info
);
245 r
= to
.end_split_or_merge(creating_path
);
250 subdir_info_s from_info
;
251 subdir_info_s to_info
;
252 r
= from
.get_info(path
, &from_info
);
255 r
= to
.get_info(path
, &to_info
);
259 from
.start_col_split(path
);
260 to
.start_col_split(path
);
263 for (set
<string
>::iterator i
= to_move
.begin();
268 r
= move_subdir(from
, to
, path
, *i
);
273 for (map
<string
, ghobject_t
>::iterator i
= objs_to_move
.begin();
274 i
!= objs_to_move
.end();
278 r
= move_object(from
, to
, path
, *i
);
284 r
= to
.set_info(path
, to_info
);
287 r
= from
.set_info(path
, from_info
);
290 from
.end_split_or_merge(path
);
291 to
.end_split_or_merge(path
);
295 int HashIndex::_split(
298 CollectionIndex
* dest
) {
299 assert(collection_version() == dest
->collection_version());
300 unsigned mkdirred
= 0;
301 return col_split_level(
303 *static_cast<HashIndex
*>(dest
),
310 int HashIndex::split_dirs(const vector
<string
> &path
, int target_level
) {
311 dout(20) << __func__
<< " " << path
<< " target level: "
312 << target_level
<< dendl
;
314 int r
= get_info(path
, &info
);
316 dout(10) << "error looking up info for " << path
<< ": "
317 << cpp_strerror(r
) << dendl
;
321 if (must_split(info
, target_level
)) {
322 dout(1) << __func__
<< " " << path
<< " has " << info
.objs
323 << " objects, " << info
.hash_level
324 << " level, starting split in pg " << coll() << "." << dendl
;
325 r
= initiate_split(path
, info
);
327 dout(10) << "error initiating split on " << path
<< ": "
328 << cpp_strerror(r
) << dendl
;
332 r
= complete_split(path
, info
);
333 dout(1) << __func__
<< " " << path
<< " split completed in pg " << coll() << "."
336 dout(10) << "error completing split on " << path
<< ": "
337 << cpp_strerror(r
) << dendl
;
342 vector
<string
> subdirs
;
343 r
= list_subdirs(path
, &subdirs
);
345 dout(10) << "error listing subdirs of " << path
<< ": "
346 << cpp_strerror(r
) << dendl
;
349 for (vector
<string
>::const_iterator it
= subdirs
.begin();
350 it
!= subdirs
.end(); ++it
) {
351 vector
<string
> subdir_path(path
);
352 subdir_path
.push_back(*it
);
353 r
= split_dirs(subdir_path
, target_level
);
362 int HashIndex::apply_layout_settings(int target_level
) {
364 dout(10) << __func__
<< " split multiple = " << split_multiplier
365 << " merge threshold = " << merge_threshold
366 << " split rand factor = " << cct
->_conf
->filestore_split_rand_factor
367 << " target level = " << target_level
369 int r
= write_settings();
372 return split_dirs(path
, target_level
);
375 int HashIndex::_init() {
378 int r
= set_info(path
, info
);
381 return write_settings();
384 int HashIndex::write_settings() {
385 if (cct
->_conf
->filestore_split_rand_factor
> 0) {
386 settings
.split_rand_factor
= rand() % cct
->_conf
->filestore_split_rand_factor
;
388 settings
.split_rand_factor
= 0;
393 return add_attr_path(path
, SETTINGS_ATTR
, bl
);
396 int HashIndex::read_settings() {
399 int r
= get_attr_path(path
, SETTINGS_ATTR
, bl
);
403 derr
<< __func__
<< " error reading settings: " << cpp_strerror(r
) << dendl
;
406 bufferlist::iterator it
= bl
.begin();
408 dout(20) << __func__
<< " split_rand_factor = " << settings
.split_rand_factor
<< dendl
;
412 /* LFNIndex virtual method implementations */
413 int HashIndex::_created(const vector
<string
> &path
,
414 const ghobject_t
&oid
,
415 const string
&mangled_name
) {
418 r
= get_info(path
, &info
);
422 r
= set_info(path
, info
);
426 if (must_split(info
)) {
427 dout(1) << __func__
<< " " << path
<< " has " << info
.objs
428 << " objects, starting split in pg " << coll() << "." << dendl
;
429 int r
= initiate_split(path
, info
);
432 r
= complete_split(path
, info
);
433 dout(1) << __func__
<< " " << path
<< " split completed in pg " << coll() << "."
441 int HashIndex::_remove(const vector
<string
> &path
,
442 const ghobject_t
&oid
,
443 const string
&mangled_name
) {
445 r
= remove_object(path
, oid
);
449 r
= get_info(path
, &info
);
453 r
= set_info(path
, info
);
456 if (must_merge(info
)) {
457 r
= initiate_merge(path
, info
);
460 return complete_merge(path
, info
);
466 int HashIndex::_lookup(const ghobject_t
&oid
,
467 vector
<string
> *path
,
468 string
*mangled_name
,
470 vector
<string
> path_comp
;
471 get_path_components(oid
, &path_comp
);
472 vector
<string
>::iterator next
= path_comp
.begin();
475 int r
= path_exists(*path
, &exists
);
484 if (next
== path_comp
.end())
486 path
->push_back(*(next
++));
488 return get_mangled_name(*path
, oid
, mangled_name
, hardlink
);
491 int HashIndex::_collection_list_partial(const ghobject_t
&start
,
492 const ghobject_t
&end
,
494 vector
<ghobject_t
> *ls
,
501 dout(20) << __func__
<< " start:" << start
<< " end:" << end
<< "-" << max_count
<< " ls.size " << ls
->size() << dendl
;
502 return list_by_hash(path
, end
, max_count
, next
, ls
);
505 int HashIndex::prep_delete() {
506 return recursive_remove(vector
<string
>());
509 int HashIndex::_pre_hash_collection(uint32_t pg_num
, uint64_t expected_num_objs
) {
512 subdir_info_s root_info
;
513 // Make sure there is neither objects nor sub-folders
514 // in this collection
515 ret
= get_info(path
, &root_info
);
519 // Do the folder splitting first
520 ret
= pre_split_folder(pg_num
, expected_num_objs
);
523 // Initialize the folder info starting from root
524 return init_split_folder(path
, 0);
527 int HashIndex::pre_split_folder(uint32_t pg_num
, uint64_t expected_num_objs
)
529 // If folder merging is enabled (by setting the threshold positive),
531 if (merge_threshold
> 0)
533 const coll_t c
= coll();
534 // Do not split if the expected number of objects in this collection is zero (by default)
535 if (expected_num_objs
== 0)
538 // Calculate the number of leaf folders (which actually store files)
539 // need to be created
540 const uint64_t objs_per_folder
= ((uint64_t)(abs(merge_threshold
)) * (uint64_t)split_multiplier
+ settings
.split_rand_factor
) * 16;
541 uint64_t leavies
= expected_num_objs
/ objs_per_folder
;
543 if (leavies
== 0 || expected_num_objs
== objs_per_folder
)
547 if (!c
.is_pg_prefix(&spgid
))
549 const ps_t ps
= spgid
.pgid
.ps();
551 // the most significant bits of pg_num
552 const int pg_num_bits
= calc_num_bits(pg_num
- 1);
554 // calculate the number of levels we only create one sub folder
555 int num
= pg_num_bits
/ 4;
556 // pg num's hex value is like 1xxx,xxxx,xxxx but not 1111,1111,1111,
557 // so that splitting starts at level 3
558 if (pg_num_bits
% 4 == 0 && pg_num
< ((uint32_t)1 << pg_num_bits
)) {
563 // Start with creation that only has one subfolder
564 vector
<string
> paths
;
567 ps_t v
= tmp_id
& 0x0000000f;
568 paths
.push_back(to_hex(v
));
569 ret
= create_path(paths
);
570 if (ret
< 0 && ret
!= -EEXIST
)
572 tmp_id
= tmp_id
>> 4;
575 // Starting from here, we can split by creating multiple subfolders
576 const int left_bits
= pg_num_bits
- dump_num
* 4;
577 // this variable denotes how many bits (for this level) that can be
578 // used for sub folder splitting
579 int split_bits
= 4 - left_bits
;
580 // the below logic is inspired by rados.h#ceph_stable_mod,
581 // it basically determines how many sub-folders should we
582 // create for splitting
583 assert(pg_num_bits
> 0); // otherwise BAD_SHIFT
584 if (((1 << (pg_num_bits
- 1)) | ps
) >= pg_num
) {
587 const uint32_t subs
= (1 << split_bits
);
588 // Calculate how many levels we create starting from here
591 while (leavies
> 1) {
593 leavies
= leavies
>> 4;
595 for (uint32_t i
= 0; i
< subs
; ++i
) {
596 assert(split_bits
<= 4); // otherwise BAD_SHIFT
597 int v
= tmp_id
| (i
<< ((4 - split_bits
) % 4));
598 paths
.push_back(to_hex(v
));
599 ret
= create_path(paths
);
600 if (ret
< 0 && ret
!= -EEXIST
)
602 ret
= recursive_create_path(paths
, level
);
610 int HashIndex::init_split_folder(vector
<string
> &path
, uint32_t hash_level
)
612 // Get the number of sub directories for the current path
613 vector
<string
> subdirs
;
614 int ret
= list_subdirs(path
, &subdirs
);
618 info
.subdirs
= subdirs
.size();
619 info
.hash_level
= hash_level
;
620 ret
= set_info(path
, info
);
623 ret
= fsync_dir(path
);
627 // Do the same for subdirs
628 vector
<string
>::const_iterator iter
;
629 for (iter
= subdirs
.begin(); iter
!= subdirs
.end(); ++iter
) {
630 path
.push_back(*iter
);
631 ret
= init_split_folder(path
, hash_level
+ 1);
639 int HashIndex::recursive_create_path(vector
<string
>& path
, int level
)
643 for (int i
= 0; i
< 16; ++i
) {
644 path
.push_back(to_hex(i
));
645 int ret
= create_path(path
);
646 if (ret
< 0 && ret
!= -EEXIST
)
648 ret
= recursive_create_path(path
, level
- 1);
656 int HashIndex::recursive_remove(const vector
<string
> &path
) {
657 return _recursive_remove(path
, true);
660 int HashIndex::_recursive_remove(const vector
<string
> &path
, bool top
) {
661 vector
<string
> subdirs
;
662 dout(20) << __func__
<< " path=" << path
<< dendl
;
663 int r
= list_subdirs(path
, &subdirs
);
666 map
<string
, ghobject_t
> objects
;
667 r
= list_objects(path
, 0, 0, &objects
);
670 if (!objects
.empty())
672 vector
<string
> subdir(path
);
673 for (vector
<string
>::iterator i
= subdirs
.begin();
676 subdir
.push_back(*i
);
677 r
= _recursive_remove(subdir
, false);
685 return remove_path(path
);
688 int HashIndex::start_col_split(const vector
<string
> &path
) {
690 InProgressOp
op_tag(InProgressOp::COL_SPLIT
, path
);
692 int r
= add_attr_path(vector
<string
>(), IN_PROGRESS_OP_TAG
, bl
);
695 return fsync_dir(vector
<string
>());
698 int HashIndex::start_split(const vector
<string
> &path
) {
700 InProgressOp
op_tag(InProgressOp::SPLIT
, path
);
702 int r
= add_attr_path(vector
<string
>(), IN_PROGRESS_OP_TAG
, bl
);
705 return fsync_dir(vector
<string
>());
708 int HashIndex::start_merge(const vector
<string
> &path
) {
710 InProgressOp
op_tag(InProgressOp::MERGE
, path
);
712 int r
= add_attr_path(vector
<string
>(), IN_PROGRESS_OP_TAG
, bl
);
715 return fsync_dir(vector
<string
>());
718 int HashIndex::end_split_or_merge(const vector
<string
> &path
) {
719 return remove_attr_path(vector
<string
>(), IN_PROGRESS_OP_TAG
);
722 int HashIndex::get_info(const vector
<string
> &path
, subdir_info_s
*info
) {
724 int r
= get_attr_path(path
, SUBDIR_ATTR
, buf
);
727 bufferlist::iterator bufiter
= buf
.begin();
728 info
->decode(bufiter
);
729 assert(path
.size() == (unsigned)info
->hash_level
);
733 int HashIndex::set_info(const vector
<string
> &path
, const subdir_info_s
&info
) {
735 assert(path
.size() == (unsigned)info
.hash_level
);
737 return add_attr_path(path
, SUBDIR_ATTR
, buf
);
740 bool HashIndex::must_merge(const subdir_info_s
&info
) {
741 return (info
.hash_level
> 0 &&
742 merge_threshold
> 0 &&
743 info
.objs
< (unsigned)merge_threshold
&&
747 bool HashIndex::must_split(const subdir_info_s
&info
, int target_level
) {
748 // target_level is used for ceph-objectstore-tool to split dirs offline.
749 // if it is set (defalult is 0) and current hash level < target_level,
750 // this dir would be split no matters how many objects it has.
751 return (info
.hash_level
< (unsigned)MAX_HASH_LEVEL
&&
752 ((target_level
> 0 && info
.hash_level
< (unsigned)target_level
) ||
753 (info
.objs
> ((unsigned)(abs(merge_threshold
) * split_multiplier
+ settings
.split_rand_factor
) * 16))));
756 int HashIndex::initiate_merge(const vector
<string
> &path
, subdir_info_s info
) {
757 return start_merge(path
);
760 int HashIndex::complete_merge(const vector
<string
> &path
, subdir_info_s info
) {
761 vector
<string
> dst
= path
;
763 subdir_info_s dstinfo
;
765 r
= path_exists(path
, &exists
);
768 r
= get_info(dst
, &dstinfo
);
772 r
= move_objects(path
, dst
);
778 r
= remove_path(path
);
782 if (must_merge(dstinfo
)) {
783 r
= initiate_merge(dst
, dstinfo
);
789 return complete_merge(dst
, dstinfo
);
794 return end_split_or_merge(path
);
797 int HashIndex::initiate_split(const vector
<string
> &path
, subdir_info_s info
) {
798 return start_split(path
);
801 int HashIndex::complete_split(const vector
<string
> &path
, subdir_info_s info
) {
802 int level
= info
.hash_level
;
803 map
<string
, ghobject_t
> objects
;
804 vector
<string
> dst
= path
;
807 r
= list_objects(path
, 0, 0, &objects
);
810 vector
<string
> subdirs_vec
;
811 r
= list_subdirs(path
, &subdirs_vec
);
815 subdirs
.insert(subdirs_vec
.begin(), subdirs_vec
.end());
816 map
<string
, map
<string
, ghobject_t
> > mapped
;
817 map
<string
, ghobject_t
> moved
;
819 for (map
<string
, ghobject_t
>::iterator i
= objects
.begin();
822 vector
<string
> new_path
;
823 get_path_components(i
->second
, &new_path
);
824 mapped
[new_path
[level
]][i
->first
] = i
->second
;
826 for (map
<string
, map
<string
, ghobject_t
> >::iterator i
= mapped
.begin();
829 dst
[level
] = i
->first
;
830 /* If the info already exists, it must be correct,
831 * we may be picking up a partially finished split */
833 // subdir has already been fully copied
834 if (subdirs
.count(i
->first
) && !get_info(dst
, &temp
)) {
835 for (map
<string
, ghobject_t
>::iterator j
= i
->second
.begin();
836 j
!= i
->second
.end();
838 moved
[j
->first
] = j
->second
;
840 objects
.erase(j
->first
);
846 subdir_info_s info_new
;
847 info_new
.objs
= i
->second
.size();
848 info_new
.subdirs
= 0;
849 info_new
.hash_level
= level
+ 1;
850 if (must_merge(info_new
) && !subdirs
.count(i
->first
)) {
855 // Subdir doesn't yet exist
856 if (!subdirs
.count(i
->first
)) {
858 r
= create_path(dst
);
861 } // else subdir has been created but only partially copied
863 for (map
<string
, ghobject_t
>::iterator j
= i
->second
.begin();
864 j
!= i
->second
.end();
866 moved
[j
->first
] = j
->second
;
868 objects
.erase(j
->first
);
869 r
= link_object(path
, dst
, j
->second
, j
->first
);
870 // May be a partially finished split
871 if (r
< 0 && r
!= -EEXIST
) {
880 // Presence of info must imply that all objects have been copied
881 r
= set_info(dst
, info_new
);
891 r
= remove_objects(path
, moved
, &objects
);
894 info
.objs
= objects
.size();
895 r
= reset_attr(path
);
901 return end_split_or_merge(path
);
904 void HashIndex::get_path_components(const ghobject_t
&oid
,
905 vector
<string
> *path
) {
906 char buf
[MAX_HASH_LEVEL
+ 1];
907 snprintf(buf
, sizeof(buf
), "%.*X", MAX_HASH_LEVEL
, (uint32_t)oid
.hobj
.get_nibblewise_key());
909 // Path components are the hex characters of oid.hobj.hash, least
911 for (int i
= 0; i
< MAX_HASH_LEVEL
; ++i
) {
912 path
->push_back(string(&buf
[i
], 1));
916 string
HashIndex::get_hash_str(uint32_t hash
) {
917 char buf
[MAX_HASH_LEVEL
+ 1];
918 snprintf(buf
, sizeof(buf
), "%.*X", MAX_HASH_LEVEL
, hash
);
920 for (int i
= 0; i
< MAX_HASH_LEVEL
; ++i
) {
921 retval
.push_back(buf
[MAX_HASH_LEVEL
- 1 - i
]);
926 string
HashIndex::get_path_str(const ghobject_t
&oid
) {
927 assert(!oid
.is_max());
928 return get_hash_str(oid
.hobj
.get_hash());
931 uint32_t HashIndex::hash_prefix_to_hash(string prefix
) {
932 while (prefix
.size() < sizeof(uint32_t) * 2) {
933 prefix
.push_back('0');
936 sscanf(prefix
.c_str(), "%x", &hash
);
938 hash
= ((hash
& 0x0f0f0f0f) << 4) | ((hash
& 0xf0f0f0f0) >> 4);
939 hash
= ((hash
& 0x00ff00ff) << 8) | ((hash
& 0xff00ff00) >> 8);
940 hash
= ((hash
& 0x0000ffff) << 16) | ((hash
& 0xffff0000) >> 16);
944 int HashIndex::get_path_contents_by_hash_bitwise(
945 const vector
<string
> &path
,
946 const ghobject_t
*next_object
,
947 set
<string
, CmpHexdigitStringBitwise
> *hash_prefixes
,
948 set
<pair
<string
, ghobject_t
>, CmpPairBitwise
> *objects
)
950 map
<string
, ghobject_t
> rev_objects
;
952 r
= list_objects(path
, 0, 0, &rev_objects
);
956 for (map
<string
, ghobject_t
>::iterator i
= rev_objects
.begin();
957 i
!= rev_objects
.end();
959 if (next_object
&& i
->second
< *next_object
)
961 string hash_prefix
= get_path_str(i
->second
);
962 hash_prefixes
->insert(hash_prefix
);
963 objects
->insert(pair
<string
, ghobject_t
>(hash_prefix
, i
->second
));
965 vector
<string
> subdirs
;
966 r
= list_subdirs(path
, &subdirs
);
970 // sort subdirs bitwise (by reversing hex digit nibbles)
971 std::sort(subdirs
.begin(), subdirs
.end(), cmp_hexdigit_bitwise
);
973 // Local to this function, we will convert the prefix strings
974 // (previously simply the reversed hex digits) to also have each
975 // digit's nibbles reversed. This will make the strings sort
978 for (vector
<string
>::const_iterator i
= path
.begin();
981 cur_prefix
.append(reverse_hexdigit_bits_string(*i
));
983 string next_object_string
;
985 next_object_string
= reverse_hexdigit_bits_string(get_path_str(*next_object
));
986 for (vector
<string
>::iterator i
= subdirs
.begin();
989 string candidate
= cur_prefix
+ reverse_hexdigit_bits_string(*i
);
991 if (next_object
->is_max())
993 if (candidate
< next_object_string
.substr(0, candidate
.size()))
996 // re-reverse the hex digit nibbles for the caller
997 hash_prefixes
->insert(reverse_hexdigit_bits_string(candidate
));
1002 int HashIndex::list_by_hash(const vector
<string
> &path
,
1003 const ghobject_t
&end
,
1006 vector
<ghobject_t
> *out
)
1009 return list_by_hash_bitwise(path
, end
, max_count
, next
, out
);
1012 int HashIndex::list_by_hash_bitwise(
1013 const vector
<string
> &path
,
1014 const ghobject_t
& end
,
1017 vector
<ghobject_t
> *out
)
1019 vector
<string
> next_path
= path
;
1020 next_path
.push_back("");
1021 set
<string
, CmpHexdigitStringBitwise
> hash_prefixes
;
1022 set
<pair
<string
, ghobject_t
>, CmpPairBitwise
> objects
;
1023 int r
= get_path_contents_by_hash_bitwise(path
,
1029 for (set
<string
, CmpHexdigitStringBitwise
>::iterator i
= hash_prefixes
.begin();
1030 i
!= hash_prefixes
.end();
1032 dout(20) << __func__
<< " prefix " << *i
<< dendl
;
1033 set
<pair
<string
, ghobject_t
>, CmpPairBitwise
>::iterator j
= objects
.lower_bound(
1034 make_pair(*i
, ghobject_t()));
1035 if (j
== objects
.end() || j
->first
!= *i
) {
1036 *(next_path
.rbegin()) = *(i
->rbegin());
1037 ghobject_t next_recurse
;
1039 next_recurse
= *next
;
1040 r
= list_by_hash_bitwise(next_path
,
1048 if (!next_recurse
.is_max()) {
1050 *next
= next_recurse
;
1054 while (j
!= objects
.end() && j
->first
== *i
) {
1055 if (max_count
> 0 && out
->size() == (unsigned)max_count
) {
1060 if (j
->second
>= end
) {
1065 if (!next
|| j
->second
>= *next
) {
1066 dout(20) << __func__
<< " prefix " << *i
<< " ob " << j
->second
<< dendl
;
1067 out
->push_back(j
->second
);
1074 *next
= ghobject_t::get_max();