swift 2.23.3__py3-none-any.whl → 2.35.0__py3-none-any.whl

swift/container/sharder.py

@@ -12,32 +12,38 @@
 # implied.
 # See the License for the specific language governing permissions and
 # limitations under the License.
-
+import collections
 import errno
 import json
+import logging
+import operator
+from optparse import OptionParser
 import time
 from collections import defaultdict
+from operator import itemgetter
 from random import random
 
 import os
-import six
-from six.moves.urllib.parse import quote
+from urllib.parse import quote
 from eventlet import Timeout
+from contextlib import contextmanager
 
 from swift.common import internal_client
-from swift.common.constraints import check_drive
+from swift.common.constraints import check_drive, AUTO_CREATE_ACCOUNT_PREFIX
 from swift.common.direct_client import (direct_put_container,
                                         DirectClientException)
-from swift.common.exceptions import DeviceUnavailable
+from swift.common.daemon import run_daemon
+from swift.common.request_helpers import USE_REPLICATION_NETWORK_HEADER
 from swift.common.ring.utils import is_local_device
 from swift.common.swob import str_to_wsgi
 from swift.common.utils import get_logger, config_true_value, \
     dump_recon_cache, whataremyips, Timestamp, ShardRange, GreenAsyncPile, \
-    config_float_value, config_positive_int_value, \
-    quorum_size, parse_override_options, Everything, config_auto_int_value
+    config_positive_int_value, quorum_size, parse_override_options, \
+    Everything, config_auto_int_value, ShardRangeList, config_percent_value, \
+    node_to_string, parse_options
 from swift.container.backend import ContainerBroker, \
     RECORD_TYPE_SHARD, UNSHARDED, SHARDING, SHARDED, COLLAPSED, \
-    SHARD_UPDATE_STATES
+    SHARD_UPDATE_STATES, sift_shard_ranges, SHARD_UPDATE_STAT_STATES
 from swift.container.replicator import ContainerReplicator
 
 
@@ -45,6 +51,8 @@ CLEAVE_SUCCESS = 0
 CLEAVE_FAILED = 1
 CLEAVE_EMPTY = 2
 
+DEFAULT_PERIODIC_WARNINGS_INTERVAL = 24 * 3600
+
 
 def sharding_enabled(broker):
     # NB all shards will by default have been created with
@@ -56,7 +64,7 @@ def sharding_enabled(broker):
     # if broker has been marked deleted it will have lost sysmeta, but we still
     # need to process the broker (for example, to shrink any shard ranges) so
     # fallback to checking if it has any shard ranges
-    if broker.get_shard_ranges():
+    if broker.has_other_shard_ranges():
         return True
     return False
 
@@ -76,61 +84,166 @@ def make_shard_ranges(broker, shard_data, shards_account_prefix):
     return shard_ranges
 
 
-def find_missing_ranges(shard_ranges):
+def _find_discontinuity(paths, start):
+    # select the path that reaches furthest from start into the namespace
+    start_paths = [path for path in paths if path.lower == start]
+    start_paths.sort(key=lambda p: p.upper)
+    longest_start_path = start_paths[-1]
+    # search for paths that end further into the namespace (note: these must
+    # have a lower that differs from the start_path upper, otherwise they would
+    # be part of the start_path longer!)
+    end_paths = [path for path in paths
+                 if path.upper > longest_start_path.upper]
+    if end_paths:
+        # select those that begin nearest the start of the namespace
+        end_paths.sort(key=lambda p: p.lower)
+        end_paths = [p for p in end_paths if p.lower == end_paths[0].lower]
+        # select the longest of those
+        end_paths.sort(key=lambda p: p.upper)
+        longest_end_path = end_paths[-1]
+    else:
+        longest_end_path = None
+    return longest_start_path, longest_end_path
+
+
+def find_paths_with_gaps(shard_ranges, within_range=None):
     """
-    Find any ranges in the entire object namespace that are not covered by any
-    shard range in the given list.
+    Find gaps in the shard ranges and pairs of shard range paths that lead to
+    and from those gaps. For each gap a single pair of adjacent paths is
+    selected. The concatenation of all selected paths and gaps will span the
+    entire namespace with no overlaps.
+
+    :param shard_ranges: a list of instances of ShardRange.
+    :param within_range: an optional ShardRange that constrains the search
+        space; the method will only return gaps within this range. The default
+        is the entire namespace.
+    :return: A list of tuples of ``(start_path, gap_range, end_path)`` where
+        ``start_path`` is a list of ShardRanges leading to the gap,
+        ``gap_range`` is a ShardRange synthesized to describe the namespace
+        gap, and ``end_path`` is a list of ShardRanges leading from the gap.
+        When gaps start or end at the namespace minimum or maximum bounds,
+        ``start_path`` and ``end_path`` may be 'null' paths that contain a
+        single ShardRange covering either the minimum or maximum of the
+        namespace.
+    """
+    timestamp = Timestamp.now()
+    within_range = within_range or ShardRange('entire/namespace', timestamp)
+    shard_ranges = ShardRangeList(shard_ranges)
+    # note: find_paths results do not include shrinking ranges
+    paths = find_paths(shard_ranges)
+    # add paths covering no namespace at start and end of namespace to ensure
+    # that a start_path and end_path is always found even when there is a gap
+    # at the start or end of the namespace
+    null_start = ShardRange('null/start', timestamp,
+                            lower=ShardRange.MIN,
+                            upper=ShardRange.MIN,
+                            state=ShardRange.FOUND)
+    null_end = ShardRange('null/end', timestamp,
+                          lower=ShardRange.MAX,
+                          upper=ShardRange.MAX,
+                          state=ShardRange.FOUND)
+    paths.extend([ShardRangeList([null_start]), ShardRangeList([null_end])])
+    paths_with_gaps = []
+    start = null_start.lower
+    while True:
+        start_path, end_path = _find_discontinuity(paths, start)
+        if end_path is None:
+            # end of namespace reached
+            break
+        start = end_path.lower
+        if start_path.upper > end_path.lower:
+            # overlap
+            continue
+        gap_range = ShardRange('gap/index_%06d' % len(paths_with_gaps),
+                               timestamp,
+                               lower=start_path.upper,
+                               upper=end_path.lower)
+        if gap_range.overlaps(within_range):
+            paths_with_gaps.append((start_path, gap_range, end_path))
+    return paths_with_gaps
 
-    :param shard_ranges: A list of :class:`~swift.utils.ShardRange`
-    :return: a list of missing ranges
+
+def _is_parent_or_child(shard_range, other, time_period):
     """
-    gaps = []
-    if not shard_ranges:
-        return ((ShardRange.MIN, ShardRange.MAX),)
-    if shard_ranges[0].lower > ShardRange.MIN:
-        gaps.append((ShardRange.MIN, shard_ranges[0].lower))
-    for first, second in zip(shard_ranges, shard_ranges[1:]):
-        if first.upper < second.lower:
-            gaps.append((first.upper, second.lower))
-    if shard_ranges[-1].upper < ShardRange.MAX:
-        gaps.append((shard_ranges[-1].upper, ShardRange.MAX))
-    return gaps
-
-
-def find_overlapping_ranges(shard_ranges):
+    Test if shard range ``shard_range`` is the parent or a child of another
+    shard range ``other`` within past time period ``time_period``. This method
+    is limited to work only within the scope of the same user-facing account
+    (with and without shard prefix).
+
+    :param shard_range: an instance of ``ShardRange``.
+    :param other: an instance of ``ShardRange``.
+    :param time_period: the specified past time period in seconds. Value of
+        0 means all time in the past.
+    :return: True if ``shard_range`` is the parent or a child of ``other``
+        within past time period, False otherwise, assuming that they are within
+         the same account.
+    """
+    exclude_age = (time.time() - float(time_period)) if time_period > 0 else 0
+    if shard_range.is_child_of(other) and shard_range.timestamp >= exclude_age:
+        return True
+    if other.is_child_of(shard_range) and other.timestamp >= exclude_age:
+        return True
+    return False
+
+
+def find_overlapping_ranges(
+        shard_ranges, exclude_parent_child=False, time_period=0):
     """
     Find all pairs of overlapping ranges in the given list.
 
     :param shard_ranges: A list of :class:`~swift.utils.ShardRange`
+    :param exclude_parent_child: If True then overlapping pairs that have a
+        parent-child relationship within the past time period
+        ``time_period`` are excluded from the returned set. Default is
+        False.
+    :param time_period: the specified past time period in seconds. Value of
+        0 means all time in the past.
     :return: a set of tuples, each tuple containing ranges that overlap with
         each other.
     """
     result = set()
-    for shard_range in shard_ranges:
-        overlapping = [sr for sr in shard_ranges
-                       if shard_range != sr and shard_range.overlaps(sr)]
+    for i, shard_range in enumerate(shard_ranges):
+        if exclude_parent_child:
+            overlapping = [
+                sr for sr in shard_ranges[i + 1:]
+                if shard_range.name != sr.name and shard_range.overlaps(sr) and
+                not _is_parent_or_child(shard_range, sr, time_period)]
+        else:
+            overlapping = [
+                sr for sr in shard_ranges[i + 1:]
+                if shard_range.name != sr.name and shard_range.overlaps(sr)]
         if overlapping:
             overlapping.append(shard_range)
-            overlapping.sort()
+            overlapping.sort(key=ShardRange.sort_key)
             result.add(tuple(overlapping))
 
     return result
 
 
 def is_sharding_candidate(shard_range, threshold):
+    # note: use *object* count as the condition for sharding: tombstones will
+    # eventually be reclaimed so should not trigger sharding
     return (shard_range.state == ShardRange.ACTIVE and
             shard_range.object_count >= threshold)
 
 
+def is_shrinking_candidate(shard_range, shrink_threshold, expansion_limit,
+                           states=None):
+    # typically shrink_threshold < expansion_limit but check both just in case
+    # note: use *row* count (objects plus tombstones) as the condition for
+    # shrinking to avoid inadvertently moving large numbers of tombstones into
+    # an acceptor
+    states = states or (ShardRange.ACTIVE,)
+    return (shard_range.state in states and
+            shard_range.row_count < shrink_threshold and
+            shard_range.row_count <= expansion_limit)
+
+
 def find_sharding_candidates(broker, threshold, shard_ranges=None):
     # this should only execute on root containers; the goal is to find
     # large shard containers that should be sharded.
     # First cut is simple: assume root container shard usage stats are good
     # enough to make decision.
-    # TODO: object counts may well not be the appropriate metric for
-    # deciding to shrink because a shard with low object_count may have a
-    # large number of deleted object rows that will need to be merged with
-    # a neighbour. We may need to expose row count as well as object count.
     if shard_ranges is None:
         shard_ranges = broker.get_shard_ranges(states=[ShardRange.ACTIVE])
     candidates = []
@@ -144,63 +257,376 @@ def find_sharding_candidates(broker, threshold, shard_ranges=None):
     return candidates
 
 
-def find_shrinking_candidates(broker, shrink_threshold, merge_size):
+def find_shrinking_candidates(broker, shrink_threshold, expansion_limit):
+    # this is only here to preserve a legacy public function signature;
+    # superseded by find_compactible_shard_sequences
+    merge_pairs = {}
+    # restrict search to sequences with one donor
+    results = find_compactible_shard_sequences(broker, shrink_threshold,
+                                               expansion_limit, 1, -1,
+                                               include_shrinking=True)
+    for sequence in results:
+        # map acceptor -> donor list
+        merge_pairs[sequence[-1]] = sequence[-2]
+    return merge_pairs
+
+
+def find_compactible_shard_sequences(broker,
+                                     shrink_threshold,
+                                     expansion_limit,
+                                     max_shrinking,
+                                     max_expanding,
+                                     include_shrinking=False):
+    """
+    Find sequences of shard ranges that could be compacted into a single
+    acceptor shard range.
+
+    This function does not modify shard ranges.
+
+    :param broker: A :class:`~swift.container.backend.ContainerBroker`.
+    :param shrink_threshold: the number of rows below which a shard may be
+        considered for shrinking into another shard
+    :param expansion_limit: the maximum number of rows that an acceptor shard
+        range should have after other shard ranges have been compacted into it
+    :param max_shrinking: the maximum number of shard ranges that should be
+        compacted into each acceptor; -1 implies unlimited.
+    :param max_expanding: the maximum number of acceptors to be found (i.e. the
+        maximum number of sequences to be returned); -1 implies unlimited.
+    :param include_shrinking: if True then existing compactible sequences are
+        included in the results; default is False.
+    :returns: A list of :class:`~swift.common.utils.ShardRangeList` each
+        containing a sequence of neighbouring shard ranges that may be
+        compacted; the final shard range in the list is the acceptor
+    """
     # this should only execute on root containers that have sharded; the
     # goal is to find small shard containers that could be retired by
     # merging with a neighbour.
     # First cut is simple: assume root container shard usage stats are good
     # enough to make decision; only merge with upper neighbour so that
     # upper bounds never change (shard names include upper bound).
-    # TODO: object counts may well not be the appropriate metric for
-    # deciding to shrink because a shard with low object_count may have a
-    # large number of deleted object rows that will need to be merged with
-    # a neighbour. We may need to expose row count as well as object count.
     shard_ranges = broker.get_shard_ranges()
     own_shard_range = broker.get_own_shard_range()
-    if len(shard_ranges) == 1:
-        # special case to enable final shard to shrink into root
-        shard_ranges.append(own_shard_range)
 
-    merge_pairs = {}
-    for donor, acceptor in zip(shard_ranges, shard_ranges[1:]):
-        if donor in merge_pairs:
-            # this range may already have been made an acceptor; if so then
-            # move on. In principle it might be that even after expansion
-            # this range and its donor(s) could all be merged with the next
-            # range. In practice it is much easier to reason about a single
-            # donor merging into a single acceptor. Don't fret - eventually
-            # all the small ranges will be retired.
+    def sequence_complete(sequence):
+        # a sequence is considered complete if any of the following are true:
+        #  - the final shard range has more objects than the shrink_threshold,
+        #    so should not be shrunk (this shard will be the acceptor)
+        #  - the max number of shard ranges to be compacted (max_shrinking) has
+        #    been reached
+        #  - the total number of objects in the sequence has reached the
+        #    expansion_limit
+        if (sequence and
+                (not is_shrinking_candidate(
+                    sequence[-1], shrink_threshold, expansion_limit,
+                    states=(ShardRange.ACTIVE, ShardRange.SHRINKING)) or
+                 0 < max_shrinking < len(sequence) or
+                 sequence.row_count >= expansion_limit)):
+            return True
+        return False
+
+    compactible_sequences = []
+    index = 0
+    expanding = 0
+    while ((max_expanding < 0 or expanding < max_expanding) and
+           index < len(shard_ranges)):
+        if not is_shrinking_candidate(
+                shard_ranges[index], shrink_threshold, expansion_limit,
+                states=(ShardRange.ACTIVE, ShardRange.SHRINKING)):
+            # this shard range cannot be the start of a new or existing
+            # compactible sequence, move on
+            index += 1
+            continue
+
+        # start of a *possible* sequence
+        sequence = ShardRangeList([shard_ranges[index]])
+        for shard_range in shard_ranges[index + 1:]:
+            # attempt to add contiguous shard ranges to the sequence
+            if sequence.upper < shard_range.lower:
+                # found a gap! break before consuming this range because it
+                # could become the first in the next sequence
+                break
+
+            if shard_range.state not in (ShardRange.ACTIVE,
+                                         ShardRange.SHRINKING):
+                # found? created? sharded? don't touch it
+                break
+
+            if shard_range.state == ShardRange.SHRINKING:
+                # already shrinking: add to sequence unconditionally
+                sequence.append(shard_range)
+            elif (sequence.row_count + shard_range.row_count
+                  <= expansion_limit):
+                # add to sequence: could be a donor or acceptor
+                sequence.append(shard_range)
+                if sequence_complete(sequence):
+                    break
+            else:
+                break
+
+        index += len(sequence)
+        if (index == len(shard_ranges) and
+                len(shard_ranges) == len(sequence) and
+                not sequence_complete(sequence) and
+                sequence.includes(own_shard_range)):
+            # special case: only one sequence has been found, which consumes
+            # all shard ranges, encompasses the entire namespace, has no more
+            # than expansion_limit records and whose shard ranges are all
+            # shrinkable; all the shards in the sequence can be shrunk to the
+            # root, so append own_shard_range to the sequence to act as an
+            # acceptor; note: only shrink to the root when *all* the remaining
+            # shard ranges can be simultaneously shrunk to the root.
+            sequence.append(own_shard_range)
+
+        if len(sequence) < 2 or sequence[-1].state not in (ShardRange.ACTIVE,
+                                                           ShardRange.SHARDED):
+            # this sequence doesn't end with a suitable acceptor shard range
             continue
-        if (acceptor.name != own_shard_range.name and
-                acceptor.state != ShardRange.ACTIVE):
-            # don't shrink into a range that is not yet ACTIVE
+
+        # all valid sequences are counted against the max_expanding allowance
+        # even if the sequence is already shrinking
+        expanding += 1
+        if (all([sr.state != ShardRange.SHRINKING for sr in sequence]) or
+                include_shrinking):
+            compactible_sequences.append(sequence)
+
+    return compactible_sequences
+
+
+def finalize_shrinking(broker, acceptor_ranges, donor_ranges, timestamp):
+    """
+    Update donor shard ranges to shrinking state and merge donors and acceptors
+    to broker.
+
+    :param broker: A :class:`~swift.container.backend.ContainerBroker`.
+    :param acceptor_ranges: A list of :class:`~swift.common.utils.ShardRange`
+        that are to be acceptors.
+    :param donor_ranges: A list of :class:`~swift.common.utils.ShardRange`
+        that are to be donors; these will have their state and timestamp
+        updated.
+    :param timestamp: timestamp to use when updating donor state
+    """
+    for donor in donor_ranges:
+        if donor.update_state(ShardRange.SHRINKING):
+            # Set donor state to shrinking state_timestamp defines new epoch
+            donor.epoch = donor.state_timestamp = timestamp
+    broker.merge_shard_ranges(acceptor_ranges + donor_ranges)
+
+
+def process_compactible_shard_sequences(broker, sequences):
+    """
+    Transform the given sequences of shard ranges into a list of acceptors and
+    a list of shrinking donors. For each given sequence the final ShardRange in
+    the sequence (the acceptor) is expanded to accommodate the other
+    ShardRanges in the sequence (the donors). The donors and acceptors are then
+    merged into the broker.
+
+    :param broker: A :class:`~swift.container.backend.ContainerBroker`.
+    :param sequences: A list of :class:`~swift.common.utils.ShardRangeList`
+    """
+    timestamp = Timestamp.now()
+    acceptor_ranges = []
+    shrinking_ranges = []
+    for sequence in sequences:
+        donors = sequence[:-1]
+        shrinking_ranges.extend(donors)
+        # Update the acceptor container with its expanded bounds to prevent it
+        # treating objects cleaved from the donor as misplaced.
+        acceptor = sequence[-1]
+        if acceptor.expand(donors):
+            # Update the acceptor container with its expanded bounds to prevent
+            # it treating objects cleaved from the donor as misplaced.
+            acceptor.timestamp = timestamp
+        if acceptor.update_state(ShardRange.ACTIVE):
+            # Ensure acceptor state is ACTIVE (when acceptor is root)
+            acceptor.state_timestamp = timestamp
+        acceptor_ranges.append(acceptor)
+    finalize_shrinking(broker, acceptor_ranges, shrinking_ranges, timestamp)
+
+
+def find_paths(shard_ranges):
+    """
+    Returns a list of all continuous paths through the shard ranges. An
+    individual path may not necessarily span the entire namespace, but it will
+    span a continuous namespace without gaps.
+
+    :param shard_ranges: A list of :class:`~swift.common.utils.ShardRange`.
+    :return: A list of :class:`~swift.common.utils.ShardRangeList`.
+    """
+    # A node is a point in the namespace that is used as a bound of any shard
+    # range. Shard ranges form the edges between nodes.
+
+    # First build a dict mapping nodes to a list of edges that leave that node
+    # (in other words, shard ranges whose lower bound equals the node)
+    node_successors = collections.defaultdict(list)
+    for shard_range in shard_ranges:
+        if shard_range.state == ShardRange.SHRINKING:
+            # shrinking shards are not a viable edge in any path
             continue
-        if donor.state not in (ShardRange.ACTIVE, ShardRange.SHRINKING):
-            # found? created? sharded? don't touch it
+        node_successors[shard_range.lower].append(shard_range)
+
+    paths = []
+
+    def clone_path(other=None):
+        # create a new path, possibly cloning another path, and add it to the
+        # list of all paths through the shards
+        path = ShardRangeList() if other is None else ShardRangeList(other)
+        paths.append(path)
+        return path
+
+    # we need to keep track of every path that ends at each node so that when
+    # we visit the node we can extend those paths, or clones of them, with the
+    # edges that leave the node
+    paths_to_node = collections.defaultdict(list)
+
+    # visit the nodes in ascending order by name...
+    for node, edges in sorted(node_successors.items()):
+        if not edges:
+            # this node is a dead-end, so there's no path updates to make
             continue
+        if not paths_to_node[node]:
+            # this is either the first node to be visited, or it has no paths
+            # leading to it, so we need to start a new path here
+            paths_to_node[node].append(clone_path([]))
+        for path_to_node in paths_to_node[node]:
+            # extend each path that arrives at this node with all of the
+            # possible edges that leave the node; if more than edge leaves the
+            # node then we will make clones of the path to the node and extend
+            # those clones, adding to the collection of all paths though the
+            # shards
+            for i, edge in enumerate(edges):
+                if i == len(edges) - 1:
+                    # the last edge is used to extend the original path to the
+                    # node; there is nothing special about the last edge, but
+                    # doing this last means the original path to the node can
+                    # be cloned for all other edges before being modified here
+                    path = path_to_node
+                else:
+                    # for all but one of the edges leaving the node we need to
+                    # make a clone the original path
+                    path = clone_path(path_to_node)
+                # extend the path with the edge
+                path.append(edge)
+                # keep track of which node this path now arrives at
+                paths_to_node[edge.upper].append(path)
+    return paths
 
-        proposed_object_count = donor.object_count + acceptor.object_count
-        if (donor.state == ShardRange.SHRINKING or
-                (donor.object_count < shrink_threshold and
-                 proposed_object_count < merge_size)):
-            # include previously identified merge pairs on presumption that
-            # following shrink procedure is idempotent
-            merge_pairs[acceptor] = donor
-            if donor.update_state(ShardRange.SHRINKING):
-                # Set donor state to shrinking so that next cycle won't use
-                # it as an acceptor; state_timestamp defines new epoch for
-                # donor and new timestamp for the expanded acceptor below.
-                donor.epoch = donor.state_timestamp = Timestamp.now()
-            if acceptor.lower != donor.lower:
-                # Update the acceptor container with its expanding state to
-                # prevent it treating objects cleaved from the donor
-                # as misplaced.
-                acceptor.lower = donor.lower
-                acceptor.timestamp = donor.state_timestamp
-    return merge_pairs
+
+def rank_paths(paths, shard_range_to_span):
+    """
+    Sorts the given list of paths such that the most preferred path is the
+    first item in the list.
+
+    :param paths: A list of :class:`~swift.common.utils.ShardRangeList`.
+    :param shard_range_to_span: An instance of
+        :class:`~swift.common.utils.ShardRange` that describes the namespace
+        that would ideally be spanned by a path. Paths that include this
+        namespace will be preferred over those that do not.
+    :return: A sorted list of :class:`~swift.common.utils.ShardRangeList`.
+    """
+    def sort_key(path):
+        # defines the order of preference for paths through shards
+        return (
+            # complete path for the namespace
+            path.includes(shard_range_to_span),
+            # most cleaving progress
+            path.find_lower(lambda sr: sr.state not in (
+                ShardRange.CLEAVED, ShardRange.ACTIVE)),
+            # largest object count
+            path.object_count,
+            # fewest timestamps
+            -1 * len(path.timestamps),
+            # newest timestamp
+            sorted(path.timestamps)[-1]
+        )
+
+    paths.sort(key=sort_key, reverse=True)
+    return paths
+
+
+def combine_shard_ranges(new_shard_ranges, existing_shard_ranges):
+    """
+    Combines new and existing shard ranges based on most recent state.
+
+    :param new_shard_ranges: a list of ShardRange instances.
+    :param existing_shard_ranges: a list of ShardRange instances.
+    :return: a list of ShardRange instances.
+    """
+    new_shard_ranges = [dict(sr) for sr in new_shard_ranges]
+    existing_shard_ranges = [dict(sr) for sr in existing_shard_ranges]
+    to_add, to_delete = sift_shard_ranges(
+        new_shard_ranges,
+        dict((sr['name'], sr) for sr in existing_shard_ranges))
+    result = [ShardRange.from_dict(existing)
+              for existing in existing_shard_ranges
+              if existing['name'] not in to_delete]
+    result.extend([ShardRange.from_dict(sr) for sr in to_add])
+    return sorted([sr for sr in result if not sr.deleted],
+                  key=ShardRange.sort_key)
+
+
+def update_own_shard_range_stats(broker, own_shard_range):
+    """
+    Update the ``own_shard_range`` with the up-to-date object stats from
+    the ``broker``.
+
+    Note: this method does not persist the updated ``own_shard_range``;
+    callers should use ``broker.merge_shard_ranges`` if the updated stats
+    need to be persisted.
+
+    :param broker: an instance of ``ContainerBroker``.
+    :param own_shard_range: and instance of ``ShardRange``.
+    :returns: ``own_shard_range`` with up-to-date ``object_count``
+        and ``bytes_used``.
+    """
+    info = broker.get_info()
+    own_shard_range.update_meta(
+        info['object_count'], info['bytes_used'])
+    return own_shard_range
 
 
 class CleavingContext(object):
+    """
+    Encapsulates metadata associated with the process of cleaving a retiring
+    DB. This metadata includes:
+
+    * ``ref``: The unique part of the key that is used when persisting a
+      serialized ``CleavingContext`` as sysmeta in the DB. The unique part of
+      the key is based off the DB id. This ensures that each context is
+      associated with a specific DB file. The unique part of the key is
+      included in the ``CleavingContext`` but should not be modified by any
+      caller.
+
+    * ``cursor``: the upper bound of the last shard range to have been
+      cleaved from the retiring DB.
+
+    * ``max_row``: the retiring DB's max row; this is updated to the value of
+      the retiring DB's ``max_row`` every time a ``CleavingContext`` is
+      loaded for that DB, and may change during the process of cleaving the
+      DB.
+
+    * ``cleave_to_row``: the value of ``max_row`` at the moment when cleaving
+      starts for the DB. When cleaving completes (i.e. the cleave cursor has
+      reached the upper bound of the cleaving namespace), ``cleave_to_row``
+      is compared to the current ``max_row``: if the two values are not equal
+      then rows have been added to the DB which may not have been cleaved, in
+      which case the ``CleavingContext`` is ``reset`` and cleaving is
+      re-started.
+
+    * ``last_cleave_to_row``: the minimum DB row from which cleaving should
+      select objects to cleave; this is initially set to None i.e. all rows
+      should be cleaved. If the ``CleavingContext`` is ``reset`` then the
+      ``last_cleave_to_row`` is set to the current value of
+      ``cleave_to_row``, which in turn is set to the current value of
+      ``max_row`` by a subsequent call to ``start``. The repeated cleaving
+      therefore only selects objects in rows greater than the
+      ``last_cleave_to_row``, rather than cleaving the whole DB again.
+
+    * ``ranges_done``: the number of shard ranges that have been cleaved from
+      the retiring DB.
+
+    * ``ranges_todo``: the number of shard ranges that are yet to be
+      cleaved from the retiring DB.
+    """
     def __init__(self, ref, cursor='', max_row=None, cleave_to_row=None,
                  last_cleave_to_row=None, cleaving_done=False,
                  misplaced_done=False, ranges_done=0, ranges_todo=0):
@@ -230,18 +656,13 @@ class CleavingContext(object):
         return '%s(%s)' % (self.__class__.__name__, ', '.join(
             '%s=%r' % prop for prop in self))
 
-    def _encode(cls, value):
-        if value is not None and six.PY2 and isinstance(value, six.text_type):
-            return value.encode('utf-8')
-        return value
-
     @property
     def cursor(self):
         return self._cursor
 
     @cursor.setter
     def cursor(self, value):
-        self._cursor = self._encode(value)
+        self._cursor = value
 
     @property
     def marker(self):
@@ -254,37 +675,33 @@ class CleavingContext(object):
     @classmethod
     def load_all(cls, broker):
         """
-        Returns all cleaving contexts stored in the broker.
+        Returns all cleaving contexts stored in the broker's DB.
 
-        :param broker:
+        :param broker: an instance of :class:`ContainerBroker`
         :return: list of tuples of (CleavingContext, timestamp)
         """
         brokers = broker.get_brokers()
         sysmeta = brokers[-1].get_sharding_sysmeta_with_timestamps()
 
+        contexts = []
         for key, (val, timestamp) in sysmeta.items():
-            # If the value is of length 0, then the metadata is
+            # If the value is blank, then the metadata is
             # marked for deletion
-            if key.startswith("Context-") and len(val) > 0:
+            if key.startswith("Context-") and val:
                 try:
-                    yield cls(**json.loads(val)), timestamp
+                    contexts.append((cls(**json.loads(val)), timestamp))
                 except ValueError:
                     continue
+        return contexts
 
     @classmethod
     def load(cls, broker):
         """
-        Returns a context dict for tracking the progress of cleaving this
-        broker's retiring DB. The context is persisted in sysmeta using a key
-        that is based off the retiring db id and max row. This form of
-        key ensures that a cleaving context is only loaded for a db that
-        matches the id and max row when the context was created; if a db is
-        modified such that its max row changes then a different context, or no
-        context, will be loaded.
-
-        :return: A dict to which cleave progress metadata may be added. The
-            dict initially has a key ``ref`` which should not be modified by
-            any caller.
+        Returns a CleavingContext tracking the cleaving progress of the given
+        broker's DB.
+
+        :param broker: an instances of :class:`ContainerBroker`
+        :return: An instance of :class:`CleavingContext`.
         """
         brokers = broker.get_brokers()
         ref = cls._make_ref(brokers[0])
@@ -295,6 +712,12 @@ class CleavingContext(object):
         return cls(**data)
 
     def store(self, broker):
+        """
+        Persists the serialized ``CleavingContext`` as sysmeta in the given
+        broker's DB.
+
+        :param broker: an instances of :class:`ContainerBroker`
+        """
         broker.set_sharding_sysmeta('Context-' + self.ref,
                                     json.dumps(dict(self)))
 
@@ -316,8 +739,7 @@ class CleavingContext(object):
     def range_done(self, new_cursor):
         self.ranges_done += 1
         self.ranges_todo -= 1
-        if new_cursor is not None:
-            self.cursor = new_cursor
+        self.cursor = new_cursor
 
     def done(self):
         return all((self.misplaced_done, self.cleaving_done,
@@ -329,51 +751,108 @@ class CleavingContext(object):
         broker.set_sharding_sysmeta('Context-' + self.ref, '')
 
 
-DEFAULT_SHARD_CONTAINER_THRESHOLD = 1000000
-DEFAULT_SHARD_SHRINK_POINT = 25
-DEFAULT_SHARD_MERGE_POINT = 75
+class ContainerSharderConf(object):
+    def __init__(self, conf=None):
+        conf = conf if conf else {}
 
+        def get_val(key, validator, default):
+            """
+            Get a value from conf and validate it.
+
+            :param key: key to lookup value in the ``conf`` dict.
+            :param validator: A function that will passed the value from the
+                ``conf`` dict and should return the value to be set. This
+                function should raise a ValueError if the ``conf`` value if not
+                valid.
+            :param default: value to use if ``key`` is not found in ``conf``.
+            :raises: ValueError if the value read from ``conf`` is invalid.
+            :returns: the configuration value.
+            """
+            try:
+                return validator(conf.get(key, default))
+            except ValueError as err:
+                raise ValueError('Error setting %s: %s' % (key, err))
+
+        self.shard_container_threshold = get_val(
+            'shard_container_threshold', config_positive_int_value, 1000000)
+        self.max_shrinking = get_val(
+            'max_shrinking', int, 1)
+        self.max_expanding = get_val(
+            'max_expanding', int, -1)
+        self.shard_scanner_batch_size = get_val(
+            'shard_scanner_batch_size', config_positive_int_value, 10)
+        self.cleave_batch_size = get_val(
+            'cleave_batch_size', config_positive_int_value, 2)
+        self.cleave_row_batch_size = get_val(
+            'cleave_row_batch_size', config_positive_int_value, 10000)
+        self.broker_timeout = get_val(
+            'broker_timeout', config_positive_int_value, 60)
+        self.recon_candidates_limit = get_val(
+            'recon_candidates_limit', int, 5)
+        self.recon_sharded_timeout = get_val(
+            'recon_sharded_timeout', int, 43200)
+        self.container_sharding_timeout = get_val(
+            'container_sharding_timeout', int, 172800)
+        self.conn_timeout = get_val(
+            'conn_timeout', float, 5)
+        self.auto_shard = get_val(
+            'auto_shard', config_true_value, False)
+        # deprecated percent options still loaded...
+        self.shrink_threshold = get_val(
+            'shard_shrink_point', self.percent_of_threshold, 10)
+        self.expansion_limit = get_val(
+            'shard_shrink_merge_point', self.percent_of_threshold, 75)
+        # ...but superseded by absolute options if present in conf
+        self.shrink_threshold = get_val(
+            'shrink_threshold', int, self.shrink_threshold)
+        self.expansion_limit = get_val(
+            'expansion_limit', int, self.expansion_limit)
+        self.rows_per_shard = get_val(
+            'rows_per_shard', config_positive_int_value,
+            max(self.shard_container_threshold // 2, 1))
+        self.minimum_shard_size = get_val(
+            'minimum_shard_size', config_positive_int_value,
+            max(self.rows_per_shard // 5, 1))
+
+    def percent_of_threshold(self, val):
+        return int(config_percent_value(val) * self.shard_container_threshold)
 
-class ContainerSharder(ContainerReplicator):
+    @classmethod
+    def validate_conf(cls, namespace):
+        ops = {'<': operator.lt,
+               '<=': operator.le}
+        checks = (('minimum_shard_size', '<=', 'rows_per_shard'),
+                  ('shrink_threshold', '<=', 'minimum_shard_size'),
+                  ('rows_per_shard', '<', 'shard_container_threshold'),
+                  ('expansion_limit', '<', 'shard_container_threshold'))
+        for key1, op, key2 in checks:
+            try:
+                val1 = getattr(namespace, key1)
+                val2 = getattr(namespace, key2)
+            except AttributeError:
+                # swift-manage-shard-ranges uses a subset of conf options for
+                # each command so only validate those actually in the namespace
+                continue
+            if not ops[op](val1, val2):
+                raise ValueError('%s (%d) must be %s %s (%d)'
+                                 % (key1, val1, op, key2, val2))
+
+
+DEFAULT_SHARDER_CONF = vars(ContainerSharderConf())
+
+
+class ContainerSharder(ContainerSharderConf, ContainerReplicator):
     """Shards containers."""
+    log_route = 'container-sharder'
 
     def __init__(self, conf, logger=None):
-        logger = logger or get_logger(conf, log_route='container-sharder')
-        super(ContainerSharder, self).__init__(conf, logger=logger)
-        self.shards_account_prefix = (
-            (conf.get('auto_create_account_prefix') or '.') + 'shards_')
-
-        def percent_value(key, default):
-            try:
-                value = conf.get(key, default)
-                return config_float_value(value, 0, 100) / 100.0
-            except ValueError as err:
-                raise ValueError("%s: %s" % (str(err), key))
-
-        self.shard_shrink_point = percent_value('shard_shrink_point',
-                                                DEFAULT_SHARD_SHRINK_POINT)
-        self.shrink_merge_point = percent_value('shard_shrink_merge_point',
-                                                DEFAULT_SHARD_MERGE_POINT)
-        self.shard_container_threshold = config_positive_int_value(
-            conf.get('shard_container_threshold',
-                     DEFAULT_SHARD_CONTAINER_THRESHOLD))
-        self.shrink_size = (self.shard_container_threshold *
-                            self.shard_shrink_point)
-        self.merge_size = (self.shard_container_threshold *
-                           self.shrink_merge_point)
-        self.split_size = self.shard_container_threshold // 2
-        self.scanner_batch_size = config_positive_int_value(
-            conf.get('shard_scanner_batch_size', 10))
-        self.cleave_batch_size = config_positive_int_value(
-            conf.get('cleave_batch_size', 2))
-        self.cleave_row_batch_size = config_positive_int_value(
-            conf.get('cleave_row_batch_size', 10000))
-        self.auto_shard = config_true_value(conf.get('auto_shard', False))
+        logger = logger or get_logger(conf, log_route=self.log_route)
+        ContainerReplicator.__init__(self, conf, logger=logger)
+        ContainerSharderConf.__init__(self, conf)
+        ContainerSharderConf.validate_conf(self)
+        self.shards_account_prefix = (AUTO_CREATE_ACCOUNT_PREFIX + 'shards_')
         self.sharding_candidates = []
-        self.recon_candidates_limit = int(
-            conf.get('recon_candidates_limit', 5))
-        self.broker_timeout = config_positive_int_value(
-            conf.get('broker_timeout', 60))
+        self.shrinking_candidates = []
         replica_count = self.ring.replica_count
         quorum = quorum_size(replica_count)
         self.shard_replication_quorum = config_auto_int_value(
@@ -395,7 +874,6 @@ class ContainerSharder(ContainerReplicator):
             self.existing_shard_replication_quorum = replica_count
 
         # internal client
-        self.conn_timeout = float(conf.get('conn_timeout', 5))
         request_tries = config_positive_int_value(
             conf.get('request_tries', 3))
         internal_client_conf_path = conf.get('internal_client_conf_path',
@@ -405,7 +883,9 @@ class ContainerSharder(ContainerReplicator):
                 internal_client_conf_path,
                 'Swift Container Sharder',
                 request_tries,
-                allow_modify_pipeline=False)
+                use_replication_network=True,
+                global_conf={'log_name': '%s-ic' % conf.get(
+                    'log_name', self.log_route)})
         except (OSError, IOError) as err:
             if err.errno != errno.ENOENT and \
                     not str(err).endswith(' not found'):
@@ -413,7 +893,67 @@ class ContainerSharder(ContainerReplicator):
             raise SystemExit(
                 'Unable to load internal client from config: %r (%s)' %
                 (internal_client_conf_path, err))
+        self.stats_interval = float(conf.get('stats_interval', '3600'))
         self.reported = 0
+        self.periodic_warnings_interval = float(
+            conf.get('periodic_warnings_interval',
+                     DEFAULT_PERIODIC_WARNINGS_INTERVAL))
+        self.periodic_warnings_start = time.time()
+        self.periodic_warnings = set()
+
+    def _get_broker_details(self, broker):
+        try:
+            db_file = broker.db_file
+        except Exception:  # noqa
+            db_file = ''
+        try:
+            path = broker.path
+        except Exception:  # noqa
+            path = ''
+        return db_file, path
+
+    def _format_log_msg(self, broker, msg, *args):
+        # make best effort to include broker properties...
+        db_file, path = self._get_broker_details(broker)
+        if args:
+            msg = msg % args
+        return '%s, path: %s, db: %s' % (msg, quote(path), db_file)
+
+    def _log(self, level, broker, msg, *args):
+        if not self.logger.isEnabledFor(level):
+            return
+
+        self.logger.log(level, self._format_log_msg(broker, msg, *args))
+
+    def debug(self, broker, msg, *args, **kwargs):
+        self._log(logging.DEBUG, broker, msg, *args, **kwargs)
+
+    def info(self, broker, msg, *args, **kwargs):
+        self._log(logging.INFO, broker, msg, *args, **kwargs)
+
+    def warning(self, broker, msg, *args, **kwargs):
+        self._log(logging.WARNING, broker, msg, *args, **kwargs)
+
+    def periodic_warning(self, broker, msg, *args, **kwargs):
+        now = time.time()
+        if now - self.periodic_warnings_start >= \
+                self.periodic_warnings_interval:
+            self.periodic_warnings.clear()
+            self.periodic_warnings_start = now
+
+        db_file, path = self._get_broker_details(broker)
+        key = (db_file, msg)
+        if key not in self.periodic_warnings:
+            self.periodic_warnings.add(key)
+            self._log(logging.WARNING, broker, msg, *args, **kwargs)
+
+    def error(self, broker, msg, *args, **kwargs):
+        self._log(logging.ERROR, broker, msg, *args, **kwargs)
+
+    def exception(self, broker, msg, *args, **kwargs):
+        if not self.logger.isEnabledFor(logging.ERROR):
+            return
+        self.logger.exception(self._format_log_msg(broker, msg, *args))
 
     def _zero_stats(self):
         """Zero out the stats."""
@@ -422,6 +962,7 @@ class ContainerSharder(ContainerReplicator):
         # stats are maintained under the 'sharding' key in self.stats
         self.stats['sharding'] = defaultdict(lambda: defaultdict(int))
         self.sharding_candidates = []
+        self.shrinking_candidates = []
 
     def _append_stat(self, category, key, value):
         if not self.stats['sharding'][category][key]:
@@ -442,11 +983,15 @@ class ContainerSharder(ContainerReplicator):
         else:
             self.stats['sharding'][category][key] = max(current, value)
 
-    def _increment_stat(self, category, key, step=1, statsd=False):
-        self.stats['sharding'][category][key] += step
-        if statsd:
-            statsd_key = '%s_%s' % (category, key)
-            self.logger.increment(statsd_key)
+    def _increment_stat(self, category, key, statsd=False):
+        self._update_stat(category, key, step=1, statsd=statsd)
+
+    def _update_stat(self, category, key, step=1, statsd=False):
+        if step:
+            self.stats['sharding'][category][key] += step
+            if statsd:
+                statsd_key = '%s_%s' % (category, key)
+                self.logger.update_stats(statsd_key, step)
 
     def _make_stats_info(self, broker, node, own_shard_range):
         try:
@@ -465,40 +1010,90 @@ class ContainerSharder(ContainerReplicator):
 
     def _identify_sharding_candidate(self, broker, node):
         own_shard_range = broker.get_own_shard_range()
+        update_own_shard_range_stats(broker, own_shard_range)
         if is_sharding_candidate(
                 own_shard_range, self.shard_container_threshold):
             self.sharding_candidates.append(
                 self._make_stats_info(broker, node, own_shard_range))
 
-    def _transform_sharding_candidate_stats(self):
-        category = self.stats['sharding']['sharding_candidates']
-        candidates = self.sharding_candidates
+    def _identify_shrinking_candidate(self, broker, node):
+        sequences = find_compactible_shard_sequences(
+            broker, self.shrink_threshold, self.expansion_limit,
+            self.max_shrinking, self.max_expanding)
+        # compactible_ranges are all apart from final acceptor in each sequence
+        compactible_ranges = sum(len(seq) - 1 for seq in sequences)
+
+        if compactible_ranges:
+            own_shard_range = broker.get_own_shard_range()
+            update_own_shard_range_stats(broker, own_shard_range)
+            shrink_candidate = self._make_stats_info(
+                broker, node, own_shard_range)
+            # The number of ranges/donors that can be shrunk if the
+            # tool is used with the current max_shrinking, max_expanding
+            # settings.
+            shrink_candidate['compactible_ranges'] = compactible_ranges
+            self.shrinking_candidates.append(shrink_candidate)
+
+    def _transform_candidate_stats(self, category, candidates, sort_keys):
         category['found'] = len(candidates)
-        candidates.sort(key=lambda c: c['object_count'], reverse=True)
+        candidates.sort(key=itemgetter(*sort_keys), reverse=True)
         if self.recon_candidates_limit >= 0:
             category['top'] = candidates[:self.recon_candidates_limit]
         else:
             category['top'] = candidates
 
     def _record_sharding_progress(self, broker, node, error):
+        db_state = broker.get_db_state()
+        if db_state not in (UNSHARDED, SHARDING, SHARDED):
+            return
         own_shard_range = broker.get_own_shard_range()
-        if (broker.get_db_state() in (UNSHARDED, SHARDING) and
-                own_shard_range.state in (ShardRange.SHARDING,
-                                          ShardRange.SHARDED)):
-            info = self._make_stats_info(broker, node, own_shard_range)
-            info['state'] = own_shard_range.state_text
-            info['db_state'] = broker.get_db_state()
-            states = [ShardRange.FOUND, ShardRange.CREATED,
-                      ShardRange.CLEAVED, ShardRange.ACTIVE]
-            shard_ranges = broker.get_shard_ranges(states=states)
-            state_count = {}
-            for state in states:
-                state_count[ShardRange.STATES[state]] = 0
-            for shard_range in shard_ranges:
-                state_count[shard_range.state_text] += 1
-            info.update(state_count)
-            info['error'] = error and str(error)
-            self._append_stat('sharding_in_progress', 'all', info)
+        if own_shard_range.state not in ShardRange.CLEAVING_STATES:
+            return
+
+        if db_state == SHARDED:
+            contexts = CleavingContext.load_all(broker)
+            if not contexts:
+                return
+            context_ts = max(float(ts) for c, ts in contexts)
+            if context_ts + self.recon_sharded_timeout \
+                    < float(Timestamp.now()):
+                # last context timestamp too old for the
+                # broker to be recorded
+                return
+
+        update_own_shard_range_stats(broker, own_shard_range)
+        info = self._make_stats_info(broker, node, own_shard_range)
+        info['state'] = own_shard_range.state_text
+        info['db_state'] = broker.get_db_state()
+        states = [ShardRange.FOUND, ShardRange.CREATED,
+                  ShardRange.CLEAVED, ShardRange.ACTIVE]
+        shard_ranges = broker.get_shard_ranges(states=states)
+        state_count = {}
+        for state in states:
+            state_count[ShardRange.STATES[state]] = 0
+        for shard_range in shard_ranges:
+            state_count[shard_range.state_text] += 1
+        info.update(state_count)
+        info['error'] = error and str(error)
+        self._append_stat('sharding_in_progress', 'all', info)
+
+        if broker.sharding_required() and (
+                own_shard_range.epoch is not None) and (
+                float(own_shard_range.epoch) +
+                self.container_sharding_timeout <
+                time.time()):
+            # Note: There is no requirement that own_shard_range.epoch equals
+            # the time at which the own_shard_range was merged into the
+            # container DB, which predicates sharding starting. But s-m-s-r and
+            # auto-sharding do set epoch and then merge, so we use it to tell
+            # whether sharding has been taking too long or not.
+            self.warning(
+                broker, 'Cleaving has not completed in %.2f seconds since %s. '
+                'DB state: %s, own_shard_range state: %s, state count of '
+                'shard ranges: %s' %
+                (time.time() - float(own_shard_range.epoch),
+                 own_shard_range.epoch.isoformat, db_state,
+                 own_shard_range.state_text, str(state_count)))
 
     def _report_stats(self):
         # report accumulated stats since start of one sharder cycle
@@ -509,7 +1104,7 @@ class ContainerSharder(ContainerReplicator):
             ('created', default_stats),
             ('cleaved', default_stats + ('min_time', 'max_time',)),
             ('misplaced', default_stats + ('found', 'placed', 'unplaced')),
-            ('audit_root', default_stats),
+            ('audit_root', default_stats + ('has_overlap', 'num_overlap')),
             ('audit_shard', default_stats),
         )
 
@@ -522,7 +1117,16 @@ class ContainerSharder(ContainerReplicator):
             msg = ' '.join(['%s:%s' % (k, str(stats[k])) for k in keys])
             self.logger.info('Since %s %s - %s', last_report, category, msg)
 
-        self._transform_sharding_candidate_stats()
+        # transform the sharding and shrinking candidate states
+        # first sharding
+        category = self.stats['sharding']['sharding_candidates']
+        self._transform_candidate_stats(category, self.sharding_candidates,
+                                        sort_keys=('object_count',))
+
+        # next shrinking
+        category = self.stats['sharding']['shrinking_candidates']
+        self._transform_candidate_stats(category, self.shrinking_candidates,
+                                        sort_keys=('compactible_ranges',))
 
         dump_recon_cache(
             {'sharding_stats': self.stats,
@@ -532,7 +1136,7 @@ class ContainerSharder(ContainerReplicator):
         self.reported = now
 
     def _periodic_report_stats(self):
-        if (time.time() - self.reported) >= 3600:  # once an hour
+        if (time.time() - self.reported) >= self.stats_interval:
             self._report_stats()
 
     def _check_node(self, node):
@@ -560,65 +1164,67 @@ class ContainerSharder(ContainerReplicator):
         params = params or {}
         params.setdefault('format', 'json')
         headers = {'X-Backend-Record-Type': 'shard',
+                   'X-Backend-Record-Shard-Format': 'full',
                    'X-Backend-Override-Deleted': 'true',
                    'X-Backend-Include-Deleted': str(include_deleted)}
         if newest:
             headers['X-Newest'] = 'true'
         try:
-            try:
-                resp = self.int_client.make_request(
-                    'GET', path, headers, acceptable_statuses=(2,),
-                    params=params)
-            except internal_client.UnexpectedResponse as err:
-                self.logger.warning("Failed to get shard ranges from %s: %s",
-                                    quote(broker.root_path), err)
-                return None
-            record_type = resp.headers.get('x-backend-record-type')
-            if record_type != 'shard':
-                err = 'unexpected record type %r' % record_type
-                self.logger.error("Failed to get shard ranges from %s: %s",
-                                  quote(broker.root_path), err)
-                return None
-
-            try:
-                data = json.loads(resp.body)
-                if not isinstance(data, list):
-                    raise ValueError('not a list')
-                return [ShardRange.from_dict(shard_range)
-                        for shard_range in data]
-            except (ValueError, TypeError, KeyError) as err:
-                self.logger.error(
-                    "Failed to get shard ranges from %s: invalid data: %r",
-                    quote(broker.root_path), err)
+            resp = self.int_client.make_request(
+                'GET', path, headers, acceptable_statuses=(2,),
+                params=params)
+        except internal_client.UnexpectedResponse as err:
+            self.warning(broker, "Failed to get shard ranges from %s: %s",
+                         quote(broker.root_path), err)
+            return None
+        record_type = resp.headers.get('x-backend-record-type')
+        if record_type != 'shard':
+            err = 'unexpected record type %r' % record_type
+            self.error(broker, "Failed to get shard ranges from %s: %s",
+                               quote(broker.root_path), err)
             return None
-        finally:
-            self.logger.txn_id = None
 
-    def _put_container(self, node, part, account, container, headers, body):
+        try:
+            data = json.loads(resp.body)
+            if not isinstance(data, list):
+                raise ValueError('not a list')
+            return [ShardRange.from_dict(shard_range)
+                    for shard_range in data]
+        except (ValueError, TypeError, KeyError) as err:
+            self.error(broker,
+                       "Failed to get shard ranges from %s: invalid data: %r",
+                       quote(broker.root_path), err)
+        return None
+
+    def _put_container(self, broker, node, part, account, container, headers,
+                       body):
         try:
             direct_put_container(node, part, account, container,
                                  conn_timeout=self.conn_timeout,
                                  response_timeout=self.node_timeout,
                                  headers=headers, contents=body)
         except DirectClientException as err:
-            self.logger.warning(
-                'Failed to put shard ranges to %s:%s/%s: %s',
-                node['ip'], node['port'], node['device'], err.http_status)
+            self.warning(broker,
+                         'Failed to put shard ranges to %s %s/%s: %s',
+                         node_to_string(node, replication=True),
+                         quote(account), quote(container), err.http_status)
         except (Exception, Timeout) as err:
-            self.logger.exception(
-                'Failed to put shard ranges to %s:%s/%s: %s',
-                node['ip'], node['port'], node['device'], err)
+            self.exception(broker,
+                           'Failed to put shard ranges to %s %s/%s: %s',
+                           node_to_string(node, replication=True),
+                           quote(account), quote(container), err)
         else:
             return True
         return False
 
-    def _send_shard_ranges(self, account, container, shard_ranges,
+    def _send_shard_ranges(self, broker, account, container, shard_ranges,
                            headers=None):
         body = json.dumps([dict(sr, reported=0)
                            for sr in shard_ranges]).encode('ascii')
         part, nodes = self.ring.get_nodes(account, container)
         headers = headers or {}
         headers.update({'X-Backend-Record-Type': RECORD_TYPE_SHARD,
+                        USE_REPLICATION_NETWORK_HEADER: 'True',
                         'User-Agent': 'container-sharder %s' % os.getpid(),
                         'X-Timestamp': Timestamp.now().normal,
                         'Content-Length': len(body),
@@ -626,7 +1232,7 @@ class ContainerSharder(ContainerReplicator):
 
         pool = GreenAsyncPile(len(nodes))
         for node in nodes:
-            pool.spawn(self._put_container, node, part, account,
+            pool.spawn(self._put_container, broker, node, part, account,
                        container, headers, body)
 
         results = pool.waitall(None)
@@ -642,20 +1248,19 @@ class ContainerSharder(ContainerReplicator):
         :param shard_range: a :class:`~swift.common.utils.ShardRange`
         :param root_path: the path of the shard's root container
         :param policy_index: the storage policy index
-        :returns: a tuple of ``(part, broker, node_id)`` where ``part`` is the
-            shard container's partition, ``broker`` is an instance of
+        :returns: a tuple of ``(part, broker, node_id, put_timestamp)`` where
+            ``part`` is the shard container's partition,
+            ``broker`` is an instance of
             :class:`~swift.container.backend.ContainerBroker`,
-            ``node_id`` is the id of the selected node.
+            ``node_id`` is the id of the selected node,
+            ``put_timestamp`` is the put_timestamp if the broker needed to
+            be initialized.
         """
         part = self.ring.get_part(shard_range.account, shard_range.container)
         node = self.find_local_handoff_for_part(part)
-        put_timestamp = Timestamp.now().internal
-        if not node:
-            raise DeviceUnavailable(
-                'No mounted devices found suitable for creating shard broker '
-                'for %s in partition %s' % (quote(shard_range.name), part))
 
-        shard_broker = ContainerBroker.create_broker(
+        put_timestamp = Timestamp.now().internal
+        shard_broker, initialized = ContainerBroker.create_broker(
             os.path.join(self.root, node['device']), part, shard_range.account,
             shard_range.container, epoch=shard_range.epoch,
             storage_policy_index=policy_index, put_timestamp=put_timestamp)
@@ -675,6 +1280,7 @@ class ContainerSharder(ContainerReplicator):
             'X-Container-Sysmeta-Sharding':
                 ('True', Timestamp.now().internal)})
 
+        put_timestamp = put_timestamp if initialized else None
         return part, shard_broker, node['id'], put_timestamp
 
     def _audit_root_container(self, broker):
@@ -684,121 +1290,196 @@ class ContainerSharder(ContainerReplicator):
         warnings = []
         own_shard_range = broker.get_own_shard_range()
 
-        if own_shard_range.state in (ShardRange.SHARDING, ShardRange.SHARDED):
+        if own_shard_range.state in ShardRange.SHARDING_STATES:
             shard_ranges = [sr for sr in broker.get_shard_ranges()
                             if sr.state != ShardRange.SHRINKING]
-            missing_ranges = find_missing_ranges(shard_ranges)
-            if missing_ranges:
+            paths_with_gaps = find_paths_with_gaps(shard_ranges)
+            if paths_with_gaps:
                 warnings.append(
                     'missing range(s): %s' %
-                    ' '.join(['%s-%s' % (lower, upper)
-                              for lower, upper in missing_ranges]))
+                    ' '.join(['%s-%s' % (gap.lower, gap.upper)
+                              for (_, gap, _) in paths_with_gaps]))
 
         for state in ShardRange.STATES:
             if state == ShardRange.SHRINKING:
                 # Shrinking is how we resolve overlaps; we've got to
                 # allow multiple shards in that state
                 continue
-            shard_ranges = broker.get_shard_ranges(states=state)
-            overlaps = find_overlapping_ranges(shard_ranges)
-            for overlapping_ranges in overlaps:
+            shard_ranges = broker.get_shard_ranges(states=[state])
+            # Transient overlaps can occur during the period immediately after
+            # sharding if a root learns about new child shards before it learns
+            # that the parent has sharded. These overlaps are normally
+            # corrected as an up-to-date version of the parent shard range is
+            # replicated to the root. Parent-child overlaps are therefore
+            # ignored for a reclaim age after the child was created. After
+            # that, parent-child overlaps may indicate that there is
+            # permanently stale parent shard range data, perhaps from a node
+            # that has been offline, so these are reported.
+            overlaps = find_overlapping_ranges(
+                shard_ranges, exclude_parent_child=True,
+                time_period=self.reclaim_age)
+            if overlaps:
+                self._increment_stat('audit_root', 'has_overlap')
+                self._update_stat('audit_root', 'num_overlap',
+                                  step=len(overlaps))
+                all_overlaps = ', '.join(
+                    [' '.join(['%s-%s' % (sr.lower, sr.upper)
+                               for sr in overlapping_ranges])
+                     for overlapping_ranges in sorted(list(overlaps))])
                 warnings.append(
-                    'overlapping ranges in state %s: %s' %
-                    (ShardRange.STATES[state],
-                     ' '.join(['%s-%s' % (sr.lower, sr.upper)
-                               for sr in overlapping_ranges])))
+                    'overlapping ranges in state %r: %s' %
+                    (ShardRange.STATES[state], all_overlaps))
+
+        # We've seen a case in production where the roots own_shard_range
+        # epoch is reset to None, and state set to ACTIVE (like re-defaulted)
+        # Epoch it important to sharding so we want to detect if this happens
+        # 1. So we can alert, and 2. to see how common it is.
+        if own_shard_range.epoch is None and broker.db_epoch:
+            warnings.append('own_shard_range reset to None should be %s'
+                            % broker.db_epoch)
 
         if warnings:
-            self.logger.warning(
-                'Audit failed for root %s (%s): %s',
-                broker.db_file, quote(broker.path), ', '.join(warnings))
+            self.warning(broker, 'Audit failed for root: %s',
+                         ', '.join(warnings))
             self._increment_stat('audit_root', 'failure', statsd=True)
             return False
 
         self._increment_stat('audit_root', 'success', statsd=True)
         return True
 
-    def _audit_shard_container(self, broker):
-        self._increment_stat('audit_shard', 'attempted')
-        warnings = []
-        errors = []
-        if not broker.account.startswith(self.shards_account_prefix):
-            warnings.append('account not in shards namespace %r' %
-                            self.shards_account_prefix)
-
-        own_shard_range = broker.get_own_shard_range(no_default=True)
-
-        shard_ranges = own_shard_range_from_root = None
-        if own_shard_range:
-            # Get the root view of the world, at least that part of the world
-            # that overlaps with this shard's namespace
-            shard_ranges = self._fetch_shard_ranges(
-                broker, newest=True,
-                params={'marker': str_to_wsgi(own_shard_range.lower_str),
-                        'end_marker': str_to_wsgi(own_shard_range.upper_str)},
-                include_deleted=True)
-            if shard_ranges:
-                for shard_range in shard_ranges:
-                    # look for this shard range in the list of shard ranges
-                    # received from root; the root may have different lower and
-                    # upper bounds for this shard (e.g. if this shard has been
-                    # expanded in the root to accept a shrinking shard) so we
-                    # only match on name.
-                    if shard_range.name == own_shard_range.name:
-                        own_shard_range_from_root = shard_range
-                        break
-                else:
-                    # this is not necessarily an error - some replicas of the
-                    # root may not yet know about this shard container
-                    warnings.append('root has no matching shard range')
-            elif not own_shard_range.deleted:
-                warnings.append('unable to get shard ranges from root')
-            # else, our shard range is deleted, so root may have reclaimed it
-        else:
-            errors.append('missing own shard range')
-
-        if warnings:
-            self.logger.warning(
-                'Audit warnings for shard %s (%s): %s',
-                broker.db_file, quote(broker.path), ', '.join(warnings))
-
-        if errors:
-            self.logger.warning(
-                'Audit failed for shard %s (%s) - skipping: %s',
-                broker.db_file, quote(broker.path), ', '.join(errors))
-            self._increment_stat('audit_shard', 'failure', statsd=True)
-            return False
+    def _merge_shard_ranges_from_root(self, broker, shard_ranges,
+                                      own_shard_range):
+        """
+        Merge appropriate items from the given ``shard_ranges`` into the
+        ``broker``. The selection of items that are merged will depend upon the
+        state of the shard.
 
-        if own_shard_range_from_root:
-            # iff we find our own shard range in the root response, merge it
-            # and reload own shard range (note: own_range_from_root may not
-            # necessarily be 'newer' than the own shard range we already have,
-            # but merging will get us to the 'newest' state)
-            self.logger.debug('Updating own shard range from root')
-            broker.merge_shard_ranges(own_shard_range_from_root)
-            orig_own_shard_range = own_shard_range
-            own_shard_range = broker.get_own_shard_range()
-            if (orig_own_shard_range != own_shard_range or
-                    orig_own_shard_range.state != own_shard_range.state):
-                self.logger.debug(
-                    'Updated own shard range from %s to %s',
-                    orig_own_shard_range, own_shard_range)
-            if own_shard_range.state in (ShardRange.SHRINKING,
-                                         ShardRange.SHRUNK):
-                # If the up-to-date state is shrinking, save off *all* shards
-                # returned because these may contain shards into which this
-                # shard is to shrink itself; shrinking is the only case when we
-                # want to learn about *other* shard ranges from the root.
-                # We need to include shrunk state too, because one replica of a
-                # shard may already have moved the own_shard_range state to
-                # shrunk while another replica may still be in the process of
-                # shrinking.
-                other_shard_ranges = [sr for sr in shard_ranges
-                                      if sr is not own_shard_range_from_root]
-                self.logger.debug('Updating %s other shard range(s) from root',
-                                  len(other_shard_ranges))
-                broker.merge_shard_ranges(other_shard_ranges)
+        :param broker: A :class:`~swift.container.backend.ContainerBroker`.
+        :param shard_ranges: A list of instances of
+            :class:`~swift.common.utils.ShardRange` describing the shard ranges
+            fetched from the root container.
+        :param own_shard_range: A :class:`~swift.common.utils.ShardRange`
+            describing the shard's own shard range.
+        :return: a tuple of ``own_shard_range, own_shard_range_from_root``. The
+            returned``own_shard_range`` will have been updated if the matching
+            ``own_shard_range_from_root`` has newer data.
+            ``own_shard_range_from_root`` will be None if no such matching
+            shard range is found in ``shard_ranges``.
+        """
+        own_shard_range_from_root = None
+        children_shard_ranges = []
+        other_shard_ranges = []
+        for shard_range in shard_ranges:
+            # look for this shard range in the list of shard ranges received
+            # from root; the root may have different lower and upper bounds for
+            # this shard (e.g. if this shard has been expanded in the root to
+            # accept a shrinking shard) so we only match on name.
+            if shard_range.name == own_shard_range.name:
+                # If we find our own shard range in the root response, merge
+                # it and reload own shard range (note: own_range_from_root may
+                # not necessarily be 'newer' than the own shard range we
+                # already have, but merging will get us to the 'newest' state)
+                self.debug(broker, 'Updating own shard range from root')
+                own_shard_range_from_root = shard_range
+                broker.merge_shard_ranges(own_shard_range_from_root)
+                orig_own_shard_range = own_shard_range
+                own_shard_range = broker.get_own_shard_range()
+                if (orig_own_shard_range != own_shard_range or
+                        orig_own_shard_range.state != own_shard_range.state):
+                    self.info(broker,
+                              'Updated own shard range from %s to %s',
+                              orig_own_shard_range, own_shard_range)
+            elif shard_range.is_child_of(own_shard_range):
+                children_shard_ranges.append(shard_range)
+            else:
+                other_shard_ranges.append(shard_range)
+
+        if children_shard_ranges and not broker.is_sharded():
+            # Merging shard ranges from the root is only necessary until this
+            # DB is fully cleaved and reaches SHARDED DB state, after which it
+            # is useful for debugging for the set of sub-shards to which a
+            # shards has sharded to be frozen.
+            self.debug(broker, 'Updating %d children shard ranges from root',
+                       len(children_shard_ranges))
+            broker.merge_shard_ranges(children_shard_ranges)
+
+        if (other_shard_ranges
+                and own_shard_range.state in ShardRange.CLEAVING_STATES
+                and not broker.is_sharded()):
+            # Other shard ranges returned from the root may need to be merged
+            # for the purposes of sharding or shrinking this shard:
+            #
+            # Shrinking states: If the up-to-date state is shrinking, the
+            # shards fetched from root may contain shards into which this shard
+            # is to shrink itself. Shrinking is initiated by modifying multiple
+            # neighboring shard range states *in the root*, rather than
+            # modifying a shard directly. We therefore need to learn about
+            # *other* neighboring shard ranges from the root, possibly
+            # including the root itself. We need to include shrunk state too,
+            # because one replica of a shard may already have moved the
+            # own_shard_range state to shrunk while another replica may still
+            # be in the process of shrinking.
+            #
+            # Sharding states: Normally a shard will shard to its own children.
+            # However, in some circumstances a shard may need to shard to other
+            # non-children sub-shards. For example, a shard range repair may
+            # cause a child sub-shard to be deleted and its namespace covered
+            # by another 'acceptor' shard.
+            #
+            # Therefore, if the up-to-date own_shard_range state indicates that
+            # sharding or shrinking is in progress, then other shard ranges
+            # will be merged, with the following caveats: we never expect a
+            # shard to shard to any ancestor shard range including the root,
+            # but containers might ultimately *shrink* to root; we never want
+            # to cleave to a container that is itself sharding or shrinking;
+            # the merged shard ranges should not result in gaps or overlaps in
+            # the namespace of this shard.
+            #
+            # Note: the search for ancestors is guaranteed to find the parent
+            # and root *if they are present*, but if any ancestor is missing
+            # then there is a chance that older generations in the
+            # other_shard_ranges will not be filtered and could be merged. That
+            # is only a problem if they are somehow still in ACTIVE state, and
+            # no overlap is detected, so the ancestor is merged.
+            ancestor_names = [
+                sr.name for sr in own_shard_range.find_ancestors(shard_ranges)]
+            filtered_other_shard_ranges = [
+                sr for sr in other_shard_ranges
+                if (sr.name not in ancestor_names
+                    and (sr.state not in ShardRange.CLEAVING_STATES
+                         or sr.deleted))
+            ]
+            if own_shard_range.state in ShardRange.SHRINKING_STATES:
+                root_shard_range = own_shard_range.find_root(
+                    other_shard_ranges)
+                if (root_shard_range and
+                        root_shard_range.state == ShardRange.ACTIVE):
+                    filtered_other_shard_ranges.append(root_shard_range)
+            existing_shard_ranges = broker.get_shard_ranges()
+            combined_shard_ranges = combine_shard_ranges(
+                filtered_other_shard_ranges, existing_shard_ranges)
+            overlaps = find_overlapping_ranges(combined_shard_ranges)
+            paths_with_gaps = find_paths_with_gaps(
+                combined_shard_ranges, own_shard_range)
+            if not (overlaps or paths_with_gaps):
+                # only merge if shard ranges appear to be *good*
+                self.debug(broker,
+                           'Updating %s other shard range(s) from root',
+                           len(filtered_other_shard_ranges))
+                broker.merge_shard_ranges(filtered_other_shard_ranges)
+
+        return own_shard_range, own_shard_range_from_root
+
+    def _delete_shard_container(self, broker, own_shard_range):
+        """
+        Mark a shard container as deleted if it was sharded or shrunk more than
+        reclaim_age in the past. (The DB file will be removed by the replicator
+        after a further reclaim_age.)
 
+        :param broker: A :class:`~swift.container.backend.ContainerBroker`.
+        :param own_shard_range: A :class:`~swift.common.utils.ShardRange`
+            describing the shard's own shard range.
+        """
         delete_age = time.time() - self.reclaim_age
         deletable_states = (ShardRange.SHARDED, ShardRange.SHRUNK)
         if (own_shard_range.state in deletable_states and
@@ -806,21 +1487,79 @@ class ContainerSharder(ContainerReplicator):
                 own_shard_range.timestamp < delete_age and
                 broker.empty()):
             broker.delete_db(Timestamp.now().internal)
-            self.logger.debug('Deleted shard container %s (%s)',
-                              broker.db_file, quote(broker.path))
+            self.debug(broker, 'Marked shard container as deleted')
 
-        self._increment_stat('audit_shard', 'success', statsd=True)
-        return True
+    def _do_audit_shard_container(self, broker):
+        warnings = []
+        if not broker.account.startswith(self.shards_account_prefix):
+            warnings.append('account not in shards namespace %r' %
+                            self.shards_account_prefix)
+
+        own_shard_range = broker.get_own_shard_range(no_default=True)
+
+        if not own_shard_range:
+            self.warning(broker, 'Audit failed for shard: missing own shard '
+                                 'range (skipping)')
+            return False, warnings
+
+        # Get the root view of the world, at least that part of the world
+        # that overlaps with this shard's namespace. The
+        # 'states=auditing' parameter will cause the root to include
+        # its own shard range in the response, which is necessary for the
+        # particular case when this shard should be shrinking to the root
+        # container; when not shrinking to root, but to another acceptor,
+        # the root range should be in sharded state and will not interfere
+        # with cleaving, listing or updating behaviour.
+        shard_ranges = self._fetch_shard_ranges(
+            broker, newest=True,
+            params={'marker': str_to_wsgi(own_shard_range.lower_str),
+                    'end_marker': str_to_wsgi(own_shard_range.upper_str),
+                    'states': 'auditing'},
+            include_deleted=True)
+        if shard_ranges:
+            own_shard_range, own_shard_range_from_root = \
+                self._merge_shard_ranges_from_root(
+                    broker, shard_ranges, own_shard_range)
+            if not own_shard_range_from_root:
+                # this is not necessarily an error - some replicas of the
+                # root may not yet know about this shard container, or the
+                # shard's own shard range could become deleted and
+                # reclaimed from the root under rare conditions
+                warnings.append('root has no matching shard range')
+        elif not own_shard_range.deleted:
+            warnings.append('unable to get shard ranges from root')
+        # else, our shard range is deleted, so root may have reclaimed it
+
+        self._delete_shard_container(broker, own_shard_range)
+
+        return True, warnings
+
+    def _audit_shard_container(self, broker):
+        self._increment_stat('audit_shard', 'attempted')
+        success, warnings = self._do_audit_shard_container(broker)
+        if warnings:
+            self.warning(broker, 'Audit warnings for shard: %s',
+                         ', '.join(warnings))
+        self._increment_stat(
+            'audit_shard', 'success' if success else 'failure', statsd=True)
+        return success
 
     def _audit_cleave_contexts(self, broker):
         now = Timestamp.now()
         for context, last_mod in CleavingContext.load_all(broker):
-            if Timestamp(last_mod).timestamp + self.reclaim_age < \
-                    now.timestamp:
+            last_mod = Timestamp(last_mod)
+            is_done = context.done() and last_mod.timestamp + \
+                self.recon_sharded_timeout < now.timestamp
+            is_stale = last_mod.timestamp + self.reclaim_age < now.timestamp
+            if is_done or is_stale:
                 context.delete(broker)
 
     def _audit_container(self, broker):
         if broker.is_deleted():
+            if broker.is_old_enough_to_reclaim(time.time(), self.reclaim_age) \
+                    and not broker.is_empty_enough_to_reclaim():
+                self.periodic_warning(
+                    broker, 'Reclaimable db stuck waiting for shrinking')
             # if the container has been marked as deleted, all metadata will
             # have been erased so no point auditing. But we want it to pass, in
             # case any objects exist inside it.
@@ -830,18 +1569,32 @@ class ContainerSharder(ContainerReplicator):
             return self._audit_root_container(broker)
         return self._audit_shard_container(broker)
 
-    def yield_objects(self, broker, src_shard_range, since_row=None):
+    def yield_objects(self, broker, src_shard_range, since_row=None,
+                      batch_size=None):
         """
-        Iterates through all objects in ``src_shard_range`` in name order
-        yielding them in lists of up to CONTAINER_LISTING_LIMIT length.
+        Iterates through all object rows in ``src_shard_range`` in name order
+        yielding them in lists of up to ``batch_size`` in length. All batches
+        of rows that are not marked deleted are yielded before all batches of
+        rows that are marked deleted.
 
         :param broker: A :class:`~swift.container.backend.ContainerBroker`.
         :param src_shard_range: A :class:`~swift.common.utils.ShardRange`
             describing the source range.
-        :param since_row: include only items whose ROWID is greater than
-            the given row id; by default all rows are included.
-        :return: a generator of tuples of (list of objects, broker info dict)
+        :param since_row: include only object rows whose ROWID is greater than
+            the given row id; by default all object rows are included.
+        :param batch_size: The maximum number of object rows to include in each
+            yielded batch; defaults to cleave_row_batch_size.
+        :return: a generator of tuples of (list of rows, broker info dict)
         """
+        if (src_shard_range.lower == ShardRange.MAX or
+                src_shard_range.upper == ShardRange.MIN):
+            # this is an unexpected condition but handled with an early return
+            # just in case, because:
+            #   lower == ShardRange.MAX  ->  marker == ''
+            # which could result in rows being erroneously yielded.
+            return
+
+        batch_size = batch_size or self.cleave_row_batch_size
         for include_deleted in (False, True):
             marker = src_shard_range.lower_str
             while True:
@@ -849,87 +1602,82 @@ class ContainerSharder(ContainerReplicator):
                 info['max_row'] = broker.get_max_row()
                 start = time.time()
                 objects = broker.get_objects(
-                    self.cleave_row_batch_size,
+                    limit=batch_size,
                     marker=marker,
                     end_marker=src_shard_range.end_marker,
                     include_deleted=include_deleted,
                     since_row=since_row)
+                self.debug(broker, 'got %s rows (deleted=%s) in %ss',
+                           len(objects), include_deleted, time.time() - start)
                 if objects:
-                    self.logger.debug('got %s objects from %s in %ss',
-                                      len(objects), broker.db_file,
-                                      time.time() - start)
                     yield objects, info
 
-                if len(objects) < self.cleave_row_batch_size:
+                if len(objects) < batch_size:
                     break
                 marker = objects[-1]['name']
 
     def yield_objects_to_shard_range(self, broker, src_shard_range,
                                      dest_shard_ranges):
         """
-        Iterates through all objects in ``src_shard_range`` to place them in
-        destination shard ranges provided by the ``next_shard_range`` function.
-        Yields tuples of (object list, destination shard range in which those
-        objects belong). Note that the same destination shard range may be
-        referenced in more than one yielded tuple.
+        Iterates through all object rows in ``src_shard_range`` to place them
+        in destination shard ranges provided by the ``dest_shard_ranges``
+        function. Yields tuples of ``(batch of object rows, destination shard
+        range in which those object rows belong, broker info)``.
+
+        If no destination shard range exists for a batch of object rows then
+        tuples are yielded of ``(batch of object rows, None, broker info)``.
+        This indicates to the caller that there are a non-zero number of object
+        rows for which no destination shard range was found.
+
+        Note that the same destination shard range may be referenced in more
+        than one yielded tuple.
 
         :param broker: A :class:`~swift.container.backend.ContainerBroker`.
         :param src_shard_range: A :class:`~swift.common.utils.ShardRange`
             describing the source range.
         :param dest_shard_ranges: A function which should return a list of
-            destination shard ranges in name order.
-        :return: a generator of tuples of
-            (object list, shard range, broker info dict)
+            destination shard ranges sorted in the order defined by
+            :meth:`~swift.common.utils.ShardRange.sort_key`.
+        :return: a generator of tuples of ``(object row list, shard range,
+            broker info dict)``  where ``shard_range`` may be ``None``.
         """
-        dest_shard_range_iter = dest_shard_range = None
-        for objs, info in self.yield_objects(broker, src_shard_range):
-            if not objs:
-                return
+        # calling dest_shard_ranges() may result in a request to fetch shard
+        # ranges, so first check that the broker actually has misplaced object
+        # rows in the source namespace
+        for _ in self.yield_objects(broker, src_shard_range, batch_size=1):
+            break
+        else:
+            return
 
-            def next_or_none(it):
-                try:
-                    return next(it)
-                except StopIteration:
-                    return None
-
-            if dest_shard_range_iter is None:
-                dest_shard_range_iter = iter(dest_shard_ranges())
-                dest_shard_range = next_or_none(dest_shard_range_iter)
-
-            unplaced = False
-            last_index = next_index = 0
-            for obj in objs:
-                if dest_shard_range is None:
-                    # no more destinations: yield remainder of batch and bail
-                    # NB there may be more batches of objects but none of them
-                    # will be placed so no point fetching them
-                    yield objs[last_index:], None, info
-                    return
-                if obj['name'] <= dest_shard_range.lower:
-                    unplaced = True
-                elif unplaced:
-                    # end of run of unplaced objects, yield them
-                    yield objs[last_index:next_index], None, info
-                    last_index = next_index
-                    unplaced = False
-                while (dest_shard_range and
-                       obj['name'] > dest_shard_range.upper):
-                    if next_index != last_index:
-                        # yield the objects in current dest_shard_range
-                        yield (objs[last_index:next_index],
-                               dest_shard_range,
-                               info)
-                    last_index = next_index
-                    dest_shard_range = next_or_none(dest_shard_range_iter)
-                next_index += 1
-
-            if next_index != last_index:
-                # yield tail of current batch of objects
-                # NB there may be more objects for the current
-                # dest_shard_range in the next batch from yield_objects
-                yield (objs[last_index:next_index],
-                       None if unplaced else dest_shard_range,
-                       info)
+        dest_shard_range_iter = iter(dest_shard_ranges())
+        src_shard_range_marker = src_shard_range.lower
+        for dest_shard_range in dest_shard_range_iter:
+            if dest_shard_range.upper <= src_shard_range.lower:
+                continue
+
+            if dest_shard_range.lower > src_shard_range_marker:
+                # no destination for a sub-namespace of the source namespace
+                sub_src_range = src_shard_range.copy(
+                    lower=src_shard_range_marker, upper=dest_shard_range.lower)
+                for objs, info in self.yield_objects(broker, sub_src_range):
+                    yield objs, None, info
+
+            sub_src_range = src_shard_range.copy(
+                lower=max(dest_shard_range.lower, src_shard_range.lower),
+                upper=min(dest_shard_range.upper, src_shard_range.upper))
+            for objs, info in self.yield_objects(broker, sub_src_range):
+                yield objs, dest_shard_range, info
+
+            src_shard_range_marker = dest_shard_range.upper
+            if dest_shard_range.upper >= src_shard_range.upper:
+                # the entire source namespace has been traversed
+                break
+        else:
+            # dest_shard_ranges_iter was exhausted before reaching the end of
+            # the source namespace
+            sub_src_range = src_shard_range.copy(lower=src_shard_range_marker)
+            for objs, info in self.yield_objects(broker, sub_src_range):
+                yield objs, None, info
 
     def _post_replicate_hook(self, broker, info, responses):
         # override superclass behaviour
@@ -939,11 +1687,15 @@ class ContainerSharder(ContainerReplicator):
                               dest_broker, node_id, info):
         success, responses = self._replicate_object(
             part, dest_broker.db_file, node_id)
+        replication_successes = responses.count(True)
         quorum = quorum_size(self.ring.replica_count)
-        if not success and responses.count(True) < quorum:
-            self.logger.warning(
-                'Failed to sufficiently replicate misplaced objects: %s in %s '
-                '(not removing)', dest_shard_range, quote(broker.path))
+        if not success and replication_successes < quorum:
+            self.warning(
+                broker, 'Failed to sufficiently replicate misplaced objects '
+                        'shard %s in state %s: %s successes, %s required '
+                        '(not removing objects), shard db: %s',
+                dest_shard_range.name, dest_shard_range.state_text,
+                replication_successes, quorum, dest_broker.db_file)
             return False
 
         if broker.get_info()['id'] != info['id']:
@@ -961,9 +1713,9 @@ class ContainerSharder(ContainerReplicator):
             success = True
 
         if not success:
-            self.logger.warning(
-                'Refused to remove misplaced objects: %s in %s',
-                dest_shard_range, quote(broker.path))
+            self.warning(broker, 'Refused to remove misplaced objects for '
+                                 'dest %s in state %s',
+                         dest_shard_range.name, dest_shard_range.state_text)
         return success
 
     def _move_objects(self, src_broker, src_shard_range, policy_index,
@@ -981,16 +1733,19 @@ class ContainerSharder(ContainerReplicator):
                 continue
 
             if dest_shard_range.name == src_broker.path:
-                self.logger.debug(
-                    'Skipping source as misplaced objects destination')
+                self.debug(src_broker,
+                           'Skipping source as misplaced objects destination')
                 # in shrinking context, the misplaced objects might actually be
                 # correctly placed if the root has expanded this shard but this
                 # broker has not yet been updated
                 continue
 
             if dest_shard_range not in dest_brokers:
-                part, dest_broker, node_id, _junk = self._get_shard_broker(
-                    dest_shard_range, src_broker.root_path, policy_index)
+                part, dest_broker, node_id, put_timestamp = \
+                    self._get_shard_broker(
+                        dest_shard_range, src_broker.root_path, policy_index)
+                stat = 'db_exists' if put_timestamp is None else 'db_created'
+                self._increment_stat('misplaced', stat, statsd=True)
                 # save the broker info that was sampled prior to the *first*
                 # yielded objects for this destination
                 destination = {'part': part,
@@ -1004,20 +1759,20 @@ class ContainerSharder(ContainerReplicator):
             placed += len(objs)
 
         if unplaced:
-            self.logger.warning(
-                'Failed to find destination for at least %s misplaced objects '
-                'in %s', unplaced, quote(src_broker.path))
+            self.warning(src_broker, 'Failed to find destination for at least '
+                                     '%s misplaced objects', unplaced)
 
         # TODO: consider executing the replication jobs concurrently
         for dest_shard_range, dest_args in dest_brokers.items():
-            self.logger.debug('moving misplaced objects found in range %s' %
-                              dest_shard_range)
+            self.debug(src_broker,
+                       'moving misplaced objects found in range %s',
+                       dest_shard_range)
             success &= self._replicate_and_delete(
                 src_broker, dest_shard_range, **dest_args)
 
-        self._increment_stat('misplaced', 'placed', step=placed)
-        self._increment_stat('misplaced', 'unplaced', step=unplaced)
-        return success, placed + unplaced
+        self._update_stat('misplaced', 'placed', step=placed, statsd=True)
+        self._update_stat('misplaced', 'unplaced', step=unplaced, statsd=True)
+        return success, placed, unplaced
 
     def _make_shard_range_fetcher(self, broker, src_shard_range):
         # returns a function that will lazy load shard ranges on demand;
@@ -1058,12 +1813,12 @@ class ContainerSharder(ContainerReplicator):
 
     def _make_misplaced_object_bounds(self, broker):
         bounds = []
-        state = broker.get_db_state()
-        if state == SHARDED:
+        db_state = broker.get_db_state()
+        if db_state == SHARDED:
             # Anything in the object table is treated as a misplaced object.
             bounds.append(('', ''))
 
-        if not bounds and state == SHARDING:
+        if not bounds and db_state == SHARDING:
             # Objects outside of this container's own range are misplaced.
             # Objects in already cleaved shard ranges are also misplaced.
             cleave_context = CleavingContext.load(broker)
@@ -1091,8 +1846,7 @@ class ContainerSharder(ContainerReplicator):
         :return: True if all misplaced objects were sufficiently replicated to
             their correct shard containers, False otherwise
         """
-        self.logger.debug('Looking for misplaced objects in %s (%s)',
-                          quote(broker.path), broker.db_file)
+        self.debug(broker, 'Looking for misplaced objects')
         self._increment_stat('misplaced', 'attempted')
         src_broker = src_broker or broker
         if src_bounds is None:
@@ -1100,22 +1854,27 @@ class ContainerSharder(ContainerReplicator):
         # (ab)use ShardRange instances to encapsulate source namespaces
         src_ranges = [ShardRange('dont/care', Timestamp.now(), lower, upper)
                       for lower, upper in src_bounds]
-        self.logger.debug('misplaced object source bounds %s' % src_bounds)
+        self.debug(broker, 'misplaced object source bounds %s', src_bounds)
         policy_index = broker.storage_policy_index
         success = True
-        num_found = 0
+        num_placed = num_unplaced = 0
         for src_shard_range in src_ranges:
-            part_success, part_num_found = self._move_objects(
+            part_success, part_placed, part_unplaced = self._move_objects(
                 src_broker, src_shard_range, policy_index,
                 self._make_shard_range_fetcher(broker, src_shard_range))
             success &= part_success
-            num_found += part_num_found
+            num_placed += part_placed
+            num_unplaced += part_unplaced
 
-        if num_found:
+        if num_placed or num_unplaced:
+            # the found stat records the number of DBs in which any misplaced
+            # rows were found, not the total number of misplaced rows
             self._increment_stat('misplaced', 'found', statsd=True)
-            self.logger.debug('Moved %s misplaced objects' % num_found)
-        self._increment_stat('misplaced', 'success' if success else 'failure')
-        self.logger.debug('Finished handling misplaced objects')
+            self.debug(broker, 'Placed %s misplaced objects (%s unplaced)',
+                       num_placed, num_unplaced)
+        self._increment_stat('misplaced', 'success' if success else 'failure',
+                             statsd=True)
+        self.debug(broker, 'Finished handling misplaced objects')
         return success
 
     def _find_shard_ranges(self, broker):
@@ -1131,27 +1890,26 @@ class ContainerSharder(ContainerReplicator):
         own_shard_range = broker.get_own_shard_range()
         shard_ranges = broker.get_shard_ranges()
         if shard_ranges and shard_ranges[-1].upper >= own_shard_range.upper:
-            self.logger.debug('Scan for shard ranges already completed for %s',
-                              quote(broker.path))
+            self.debug(broker, 'Scan for shard ranges already completed')
             return 0
 
-        self.logger.info('Starting scan for shard ranges on %s',
-                         quote(broker.path))
+        self.info(broker, 'Starting scan for shard ranges')
         self._increment_stat('scanned', 'attempted')
 
         start = time.time()
         shard_data, last_found = broker.find_shard_ranges(
-            self.split_size, limit=self.scanner_batch_size,
-            existing_ranges=shard_ranges)
+            self.rows_per_shard, limit=self.shard_scanner_batch_size,
+            existing_ranges=shard_ranges,
+            minimum_shard_size=self.minimum_shard_size)
         elapsed = time.time() - start
 
         if not shard_data:
             if last_found:
-                self.logger.info("Already found all shard ranges")
+                self.info(broker, "Already found all shard ranges")
                 self._increment_stat('scanned', 'success', statsd=True)
             else:
                 # we didn't find anything
-                self.logger.warning("No shard ranges found")
+                self.warning(broker, "No shard ranges found")
                 self._increment_stat('scanned', 'failure', statsd=True)
             return 0
 
@@ -1159,14 +1917,14 @@ class ContainerSharder(ContainerReplicator):
             broker, shard_data, self.shards_account_prefix)
         broker.merge_shard_ranges(shard_ranges)
         num_found = len(shard_ranges)
-        self.logger.info(
-            "Completed scan for shard ranges: %d found", num_found)
-        self._increment_stat('scanned', 'found', step=num_found)
+        self.info(broker, "Completed scan for shard ranges: %d found",
+                  num_found)
+        self._update_stat('scanned', 'found', step=num_found)
         self._min_stat('scanned', 'min_time', round(elapsed / num_found, 3))
         self._max_stat('scanned', 'max_time', round(elapsed / num_found, 3))
 
         if last_found:
-            self.logger.info("Final shard range reached.")
+            self.info(broker, "Final shard range reached.")
         self._increment_stat('scanned', 'success', statsd=True)
         return num_found
 
@@ -1174,7 +1932,7 @@ class ContainerSharder(ContainerReplicator):
         # Create shard containers that are ready to receive redirected object
         # updates. Do this now, so that redirection can begin immediately
         # without waiting for cleaving to complete.
-        found_ranges = broker.get_shard_ranges(states=ShardRange.FOUND)
+        found_ranges = broker.get_shard_ranges(states=[ShardRange.FOUND])
         created_ranges = []
         for shard_range in found_ranges:
             self._increment_stat('created', 'attempted')
@@ -1193,16 +1951,15 @@ class ContainerSharder(ContainerReplicator):
             # may think they are in fact roots, but it cleans up well enough
             # once everyone's upgraded.
             success = self._send_shard_ranges(
-                shard_range.account, shard_range.container,
+                broker, shard_range.account, shard_range.container,
                 [shard_range], headers=headers)
             if success:
-                self.logger.debug('PUT new shard range container for %s',
-                                  shard_range)
+                self.debug(broker, 'PUT new shard range container for %s',
+                           shard_range)
                 self._increment_stat('created', 'success', statsd=True)
             else:
-                self.logger.error(
-                    'PUT of new shard container %r failed for %s.',
-                    shard_range, quote(broker.path))
+                self.error(broker, 'PUT of new shard container %r failed',
+                           shard_range)
                 self._increment_stat('created', 'failure', statsd=True)
                 # break, not continue, because elsewhere it is assumed that
                 # finding and cleaving shard ranges progresses linearly, so we
@@ -1214,32 +1971,17 @@ class ContainerSharder(ContainerReplicator):
         if created_ranges:
             broker.merge_shard_ranges(created_ranges)
             if not broker.is_root_container():
-                self._send_shard_ranges(
-                    broker.root_account, broker.root_container, created_ranges)
-            self.logger.info(
-                "Completed creating shard range containers: %d created.",
-                len(created_ranges))
+                self._send_shard_ranges(broker, broker.root_account,
+                                        broker.root_container, created_ranges)
+            self.info(broker, "Completed creating %d shard range containers",
+                      len(created_ranges))
         return len(created_ranges)
 
-    def _cleave_shard_range(self, broker, cleaving_context, shard_range):
-        self.logger.info("Cleaving '%s' from row %s into %s for %r",
-                         quote(broker.path),
-                         cleaving_context.last_cleave_to_row,
-                         quote(shard_range.name), shard_range)
-        self._increment_stat('cleaved', 'attempted')
+    def _cleave_shard_broker(self, broker, cleaving_context, shard_range,
+                             own_shard_range, shard_broker, put_timestamp,
+                             shard_part, node_id):
+        result = CLEAVE_SUCCESS
         start = time.time()
-        policy_index = broker.storage_policy_index
-        try:
-            shard_part, shard_broker, node_id, put_timestamp = \
-                self._get_shard_broker(shard_range, broker.root_path,
-                                       policy_index)
-        except DeviceUnavailable as duex:
-            self.logger.warning(str(duex))
-            self._increment_stat('cleaved', 'failure', statsd=True)
-            return CLEAVE_FAILED
-
-        own_shard_range = broker.get_own_shard_range()
-
         # only cleave from the retiring db - misplaced objects handler will
         # deal with any objects in the fresh db
         source_broker = broker.get_brokers()[0]
@@ -1258,21 +2000,15 @@ class ContainerSharder(ContainerReplicator):
                     since_row=sync_from_row):
                 shard_broker.merge_items(objects)
             if objects is None:
-                self.logger.info("Cleaving '%s': %r - zero objects found",
-                                 quote(broker.path), shard_range)
+                self.info(broker, "Cleaving %r - zero objects found",
+                          shard_range)
                 if shard_broker.get_info()['put_timestamp'] == put_timestamp:
                     # This was just created; don't need to replicate this
                     # SR because there was nothing there. So cleanup and
                     # remove the shard_broker from its hand off location.
-                    self.delete_db(shard_broker)
-                    cleaving_context.range_done(shard_range.upper_str)
-                    if shard_range.upper >= own_shard_range.upper:
-                        # cleaving complete
-                        cleaving_context.cleaving_done = True
-                    cleaving_context.store(broker)
                     # Because nothing was here we wont count it in the shard
                     # batch count.
-                    return CLEAVE_EMPTY
+                    result = CLEAVE_EMPTY
                 # Else, it wasn't newly created by us, and
                 # we don't know what's in it or why. Let it get
                 # replicated and counted in the batch count.
@@ -1288,20 +2024,25 @@ class ContainerSharder(ContainerReplicator):
                 [{'sync_point': source_max_row, 'remote_id': source_db_id}] +
                 source_broker.get_syncs())
         else:
-            self.logger.debug("Cleaving '%s': %r - shard db already in sync",
-                              quote(broker.path), shard_range)
+            self.debug(broker, "Cleaving %r - shard db already in sync",
+                       shard_range)
 
         replication_quorum = self.existing_shard_replication_quorum
-        if shard_range.includes(own_shard_range):
-            # When shrinking, include deleted own (donor) shard range in
-            # the replicated db so that when acceptor next updates root it
-            # will atomically update its namespace *and* delete the donor.
-            # Don't do this when sharding a shard because the donor
-            # namespace should not be deleted until all shards are cleaved.
-            if own_shard_range.update_state(ShardRange.SHRUNK):
-                own_shard_range.set_deleted()
-                broker.merge_shard_ranges(own_shard_range)
-            shard_broker.merge_shard_ranges(own_shard_range)
+        if own_shard_range.state in ShardRange.SHRINKING_STATES:
+            if shard_range.includes(own_shard_range):
+                # When shrinking to a single acceptor that completely encloses
+                # this shard's namespace, include deleted own (donor) shard
+                # range in the replicated db so that when acceptor next updates
+                # root it will atomically update its namespace *and* delete the
+                # donor. This reduces the chance of a temporary listing gap if
+                # this shard fails to update the root with its SHRUNK/deleted
+                # state. Don't do this when sharding a shard or shrinking to
+                # multiple acceptors because in those cases the donor namespace
+                # should not be deleted until *all* shards are cleaved.
+                if own_shard_range.update_state(ShardRange.SHRUNK):
+                    own_shard_range.set_deleted()
+                    broker.merge_shard_ranges(own_shard_range)
+                shard_broker.merge_shard_ranges(own_shard_range)
         elif shard_range.state == ShardRange.CREATED:
             # The shard range object stats may have changed since the shard
             # range was found, so update with stats of objects actually
@@ -1310,51 +2051,74 @@ class ContainerSharder(ContainerReplicator):
             info = shard_broker.get_info()
             shard_range.update_meta(
                 info['object_count'], info['bytes_used'])
+            # Update state to CLEAVED; only do this when sharding, not when
+            # shrinking
             shard_range.update_state(ShardRange.CLEAVED)
             shard_broker.merge_shard_ranges(shard_range)
             replication_quorum = self.shard_replication_quorum
 
-        self.logger.info(
-            'Replicating new shard container %s for %s',
-            quote(shard_broker.path), shard_broker.get_own_shard_range())
-
-        success, responses = self._replicate_object(
-            shard_part, shard_broker.db_file, node_id)
+        if result == CLEAVE_EMPTY:
+            self.delete_db(shard_broker)
+        else:  # result == CLEAVE_SUCCESS:
+            self.info(broker, 'Replicating new shard container %s for %s',
+                      quote(shard_broker.path), own_shard_range)
+
+            success, responses = self._replicate_object(
+                shard_part, shard_broker.db_file, node_id)
+
+            replication_successes = responses.count(True)
+            if (not success and (not responses or
+                                 replication_successes < replication_quorum)):
+                # insufficient replication or replication not even attempted;
+                # break because we don't want to progress the cleave cursor
+                # until each shard range has been successfully cleaved
+                self.warning(
+                    broker, 'Failed to sufficiently replicate cleaved shard '
+                            '%s in state %s: %s successes, %s required, '
+                            'shard db: %s',
+                    shard_broker.path, shard_range.state_text,
+                    replication_successes, replication_quorum,
+                    shard_broker.db_file)
+                self._increment_stat('cleaved', 'failure', statsd=True)
+                result = CLEAVE_FAILED
+            else:
+                elapsed = round(time.time() - start, 3)
+                self._min_stat('cleaved', 'min_time', elapsed)
+                self._max_stat('cleaved', 'max_time', elapsed)
+                self.info(broker, 'Cleaved %s in %gs', shard_range,
+                          elapsed)
+                self._increment_stat('cleaved', 'success', statsd=True)
+
+        if result in (CLEAVE_SUCCESS, CLEAVE_EMPTY):
+            broker.merge_shard_ranges(shard_range)
+            cleaving_context.range_done(shard_range.upper_str)
+            if shard_range.upper >= own_shard_range.upper:
+                # cleaving complete
+                cleaving_context.cleaving_done = True
+            cleaving_context.store(broker)
+        return result
 
-        replication_successes = responses.count(True)
-        if (not success and (not responses or
-                             replication_successes < replication_quorum)):
-            # insufficient replication or replication not even attempted;
-            # break because we don't want to progress the cleave cursor
-            # until each shard range has been successfully cleaved
-            self.logger.warning(
-                'Failed to sufficiently replicate cleaved shard %s for %s: '
-                '%s successes, %s required.', shard_range, quote(broker.path),
-                replication_successes, replication_quorum)
-            self._increment_stat('cleaved', 'failure', statsd=True)
-            return CLEAVE_FAILED
-
-        elapsed = round(time.time() - start, 3)
-        self._min_stat('cleaved', 'min_time', elapsed)
-        self._max_stat('cleaved', 'max_time', elapsed)
-        broker.merge_shard_ranges(shard_range)
-        cleaving_context.range_done(shard_range.upper_str)
-        if shard_range.upper >= own_shard_range.upper:
-            # cleaving complete
-            cleaving_context.cleaving_done = True
-        cleaving_context.store(broker)
-        self.logger.info(
-            'Cleaved %s for shard range %s in %gs.',
-            quote(broker.path), shard_range, elapsed)
-        self._increment_stat('cleaved', 'success', statsd=True)
-        return CLEAVE_SUCCESS
+    def _cleave_shard_range(self, broker, cleaving_context, shard_range,
+                            own_shard_range):
+        self.info(broker, "Cleaving from row %s into %s for %r",
+                  cleaving_context.last_cleave_to_row,
+                  quote(shard_range.name), shard_range)
+        self._increment_stat('cleaved', 'attempted')
+        policy_index = broker.storage_policy_index
+        shard_part, shard_broker, node_id, put_timestamp = \
+            self._get_shard_broker(shard_range, broker.root_path,
+                                   policy_index)
+        stat = 'db_exists' if put_timestamp is None else 'db_created'
+        self._increment_stat('cleaved', stat, statsd=True)
+        return self._cleave_shard_broker(
+            broker, cleaving_context, shard_range, own_shard_range,
+            shard_broker, put_timestamp, shard_part, node_id)
 
     def _cleave(self, broker):
         # Returns True if misplaced objects have been moved and the entire
         # container namespace has been successfully cleaved, False otherwise
         if broker.is_sharded():
-            self.logger.debug('Passing over already sharded container %s',
-                              quote(broker.path))
+            self.debug(broker, 'Passing over already sharded container')
             return True
 
         cleaving_context = CleavingContext.load(broker)
@@ -1362,9 +2126,8 @@ class ContainerSharder(ContainerReplicator):
             # ensure any misplaced objects in the source broker are moved; note
             # that this invocation of _move_misplaced_objects is targetted at
             # the *retiring* db.
-            self.logger.debug(
-                'Moving any misplaced objects from sharding container: %s',
-                quote(broker.path))
+            self.debug(broker,
+                       'Moving any misplaced objects from sharding container')
             bounds = self._make_default_misplaced_object_bounds(broker)
             cleaving_context.misplaced_done = self._move_misplaced_objects(
                 broker, src_broker=broker.get_brokers()[0],
@@ -1372,60 +2135,78 @@ class ContainerSharder(ContainerReplicator):
             cleaving_context.store(broker)
 
         if cleaving_context.cleaving_done:
-            self.logger.debug('Cleaving already complete for container %s',
-                              quote(broker.path))
+            self.debug(broker, 'Cleaving already complete for container')
             return cleaving_context.misplaced_done
 
-        ranges_todo = broker.get_shard_ranges(marker=cleaving_context.marker)
+        shard_ranges = broker.get_shard_ranges(marker=cleaving_context.marker)
+        # Ignore shrinking shard ranges: we never want to cleave objects to a
+        # shrinking shard. Shrinking shard ranges are to be expected in a root;
+        # shrinking shard ranges (other than own shard range) are not normally
+        # expected in a shard but can occur if there is an overlapping shard
+        # range that has been discovered from the root.
+        ranges_todo = [sr for sr in shard_ranges
+                       if sr.state != ShardRange.SHRINKING]
         if cleaving_context.cursor:
-            # always update ranges_todo in case more ranges have been found
-            # since last visit
+            # always update ranges_todo in case shard ranges have changed since
+            # last visit
             cleaving_context.ranges_todo = len(ranges_todo)
-            self.logger.debug('Continuing to cleave (%s done, %s todo): %s',
-                              cleaving_context.ranges_done,
-                              cleaving_context.ranges_todo,
-                              quote(broker.path))
+            self.debug(broker, 'Continuing to cleave (%s done, %s todo)',
+                       cleaving_context.ranges_done,
+                       cleaving_context.ranges_todo)
         else:
             cleaving_context.start()
+            own_shard_range = broker.get_own_shard_range()
+            cleaving_context.cursor = own_shard_range.lower_str
             cleaving_context.ranges_todo = len(ranges_todo)
-            self.logger.debug('Starting to cleave (%s todo): %s',
-                              cleaving_context.ranges_todo, quote(broker.path))
+            self.info(broker, 'Starting to cleave (%s todo)',
+                      cleaving_context.ranges_todo)
+
+        own_shard_range = broker.get_own_shard_range(no_default=True)
+        if own_shard_range is None:
+            # A default should never be SHRINKING or SHRUNK but because we
+            # may write own_shard_range back to broker, let's make sure
+            # it can't be defaulted.
+            self.warning(broker, 'Failed to get own_shard_range')
+            ranges_todo = []  # skip cleaving
 
         ranges_done = []
         for shard_range in ranges_todo:
-            if shard_range.state == ShardRange.SHRINKING:
-                # Ignore shrinking shard ranges: we never want to cleave
-                # objects to a shrinking shard. Shrinking shard ranges are to
-                # be expected in a root; shrinking shard ranges (other than own
-                # shard range) are not normally expected in a shard but can
-                # occur if there is an overlapping shard range that has been
-                # discovered from the root.
-                cleaving_context.range_done(None)  # don't move the cursor
-                continue
-            elif shard_range.state in (ShardRange.CREATED,
-                                       ShardRange.CLEAVED,
-                                       ShardRange.ACTIVE):
-                cleave_result = self._cleave_shard_range(
-                    broker, cleaving_context, shard_range)
-                if cleave_result == CLEAVE_SUCCESS:
-                    ranges_done.append(shard_range)
-                    if len(ranges_done) == self.cleave_batch_size:
-                        break
-                elif cleave_result == CLEAVE_FAILED:
-                    break
-                # else, no errors, but no rows found either. keep going,
-                # and don't count it against our batch size
-            else:
-                self.logger.info('Stopped cleave at unready %s', shard_range)
+            if cleaving_context.cleaving_done:
+                # note: there may still be ranges_todo, for example: if this
+                # shard is shrinking and has merged a root shard range in
+                # sharded state along with an active acceptor shard range, but
+                # the root range is irrelevant
                 break
 
-        if not ranges_done:
-            # _cleave_shard_range always store()s the context on success; make
-            # sure we *also* do that if we hit a failure right off the bat
-            cleaving_context.store(broker)
-        self.logger.debug(
-            'Cleaved %s shard ranges for %s',
-            len(ranges_done), quote(broker.path))
+            if len(ranges_done) == self.cleave_batch_size:
+                break
+
+            if shard_range.lower > cleaving_context.cursor:
+                self.info(broker, 'Stopped cleave at gap: %r - %r' %
+                          (cleaving_context.cursor, shard_range.lower))
+                break
+
+            if shard_range.state not in (ShardRange.CREATED,
+                                         ShardRange.CLEAVED,
+                                         ShardRange.ACTIVE):
+                self.info(broker, 'Stopped cleave at unready %s', shard_range)
+                break
+
+            cleave_result = self._cleave_shard_range(
+                broker, cleaving_context, shard_range, own_shard_range)
+
+            if cleave_result == CLEAVE_SUCCESS:
+                ranges_done.append(shard_range)
+            elif cleave_result == CLEAVE_FAILED:
+                break
+            # else: CLEAVE_EMPTY: no errors, but no rows found either. keep
+            # going, and don't count it against our batch size
+
+        # _cleave_shard_range always store()s the context on success; *also* do
+        # that here in case we hit a failure right off the bat or ended loop
+        # with skipped ranges
+        cleaving_context.store(broker)
+        self.debug(broker, 'Cleaved %s shard ranges', len(ranges_done))
         return (cleaving_context.misplaced_done and
                 cleaving_context.cleaving_done)
 
@@ -1435,18 +2216,23 @@ class ContainerSharder(ContainerReplicator):
             # Move all CLEAVED shards to ACTIVE state and if a shard then
             # delete own shard range; these changes will be simultaneously
             # reported in the next update to the root container.
-            modified_shard_ranges = broker.get_shard_ranges(
-                states=ShardRange.CLEAVED)
-            for sr in modified_shard_ranges:
-                sr.update_state(ShardRange.ACTIVE)
-            own_shard_range = broker.get_own_shard_range()
-            if own_shard_range.state in (ShardRange.SHRINKING,
-                                         ShardRange.SHRUNK):
-                next_state = ShardRange.SHRUNK
-            else:
-                next_state = ShardRange.SHARDED
-            own_shard_range.update_state(next_state)
+            own_shard_range = broker.get_own_shard_range(no_default=True)
+            if own_shard_range is None:
+                # This is more of a belts and braces, not sure we could even
+                # get this far with without an own_shard_range. But because
+                # we will be writing own_shard_range back, we need to make sure
+                self.warning(broker, 'Failed to get own_shard_range')
+                return False
             own_shard_range.update_meta(0, 0)
+            if own_shard_range.state in ShardRange.SHRINKING_STATES:
+                own_shard_range.update_state(ShardRange.SHRUNK)
+                modified_shard_ranges = []
+            else:
+                own_shard_range.update_state(ShardRange.SHARDED)
+                modified_shard_ranges = broker.get_shard_ranges(
+                    states=[ShardRange.CLEAVED])
+                for sr in modified_shard_ranges:
+                    sr.update_state(ShardRange.ACTIVE)
             if (not broker.is_root_container() and not
                     own_shard_range.deleted):
                 own_shard_range = own_shard_range.copy(
@@ -1454,16 +2240,12 @@ class ContainerSharder(ContainerReplicator):
             modified_shard_ranges.append(own_shard_range)
             broker.merge_shard_ranges(modified_shard_ranges)
             if broker.set_sharded_state():
-                cleaving_context.delete(broker)
                 return True
             else:
-                self.logger.warning(
-                    'Failed to remove retiring db file for %s',
-                    quote(broker.path))
+                self.warning(broker, 'Failed to remove retiring db file')
         else:
-            self.logger.warning(
-                'Repeat cleaving required for %r with context: %s',
-                broker.db_files[0], dict(cleaving_context))
+            self.warning(broker, 'Repeat cleaving required, context: %s',
+                         dict(cleaving_context))
             cleaving_context.reset()
             cleaving_context.store(broker)
 
@@ -1473,106 +2255,138 @@ class ContainerSharder(ContainerReplicator):
         candidates = find_sharding_candidates(
             broker, self.shard_container_threshold, shard_ranges)
         if candidates:
-            self.logger.debug('Identified %s sharding candidates',
-                              len(candidates))
+            self.debug(broker, 'Identified %s sharding candidates',
+                       len(candidates))
             broker.merge_shard_ranges(candidates)
 
     def _find_and_enable_shrinking_candidates(self, broker):
         if not broker.is_sharded():
-            self.logger.warning('Cannot shrink a not yet sharded container %s',
-                                quote(broker.path))
+            self.warning(broker, 'Cannot shrink a not yet sharded container')
             return
 
-        merge_pairs = find_shrinking_candidates(
-            broker, self.shrink_size, self.merge_size)
-        self.logger.debug('Found %s shrinking candidates' % len(merge_pairs))
+        compactible_sequences = find_compactible_shard_sequences(
+            broker, self.shrink_threshold, self.expansion_limit,
+            self.max_shrinking, self.max_expanding, include_shrinking=True)
+        self.debug(broker, 'Found %s compactible sequences of length(s) %s' %
+                   (len(compactible_sequences),
+                    [len(s) for s in compactible_sequences]))
+        process_compactible_shard_sequences(broker, compactible_sequences)
         own_shard_range = broker.get_own_shard_range()
-        for acceptor, donor in merge_pairs.items():
-            self.logger.debug('shrinking shard range %s into %s in %s' %
-                              (donor, acceptor, broker.db_file))
-            broker.merge_shard_ranges([acceptor, donor])
+        for sequence in compactible_sequences:
+            acceptor = sequence[-1]
+            donors = ShardRangeList(sequence[:-1])
+            self.debug(broker,
+                       'shrinking %d objects from %d shard ranges into %s' %
+                       (donors.object_count, len(donors), acceptor))
             if acceptor.name != own_shard_range.name:
-                self._send_shard_ranges(
-                    acceptor.account, acceptor.container, [acceptor])
-                acceptor.increment_meta(donor.object_count, donor.bytes_used)
-            else:
-                # no need to change namespace or stats
-                acceptor.update_state(ShardRange.ACTIVE,
-                                      state_timestamp=Timestamp.now())
+                self._send_shard_ranges(broker, acceptor.account,
+                                        acceptor.container, [acceptor])
+                acceptor.increment_meta(donors.object_count, donors.bytes_used)
             # Now send a copy of the expanded acceptor, with an updated
-            # timestamp, to the donor container. This forces the donor to
+            # timestamp, to each donor container. This forces each donor to
             # asynchronously cleave its entire contents to the acceptor and
             # delete itself. The donor will pass its own deleted shard range to
             # the acceptor when cleaving. Subsequent updates from the donor or
             # the acceptor will then update the root to have the  deleted donor
             # shard range.
-            self._send_shard_ranges(
-                donor.account, donor.container, [donor, acceptor])
+            for donor in donors:
+                self._send_shard_ranges(broker, donor.account,
+                                        donor.container, [donor, acceptor])
 
     def _update_root_container(self, broker):
         own_shard_range = broker.get_own_shard_range(no_default=True)
-        if not own_shard_range or own_shard_range.reported:
+        if not own_shard_range:
+            return
+
+        # Don't update the osr stats including tombstones unless its CLEAVED+
+        if own_shard_range.state in SHARD_UPDATE_STAT_STATES:
+            # do a reclaim *now* in order to get best estimate of tombstone
+            # count that is consistent with the current object_count
+            reclaimer = self._reclaim(broker)
+            tombstones = reclaimer.get_tombstone_count()
+            self.debug(broker, 'tombstones = %d', tombstones)
+            # shrinking candidates are found in the root DB so that's the only
+            # place we need up to date tombstone stats.
+            own_shard_range.update_tombstones(tombstones)
+            update_own_shard_range_stats(broker, own_shard_range)
+
+            if not own_shard_range.reported:
+                broker.merge_shard_ranges(own_shard_range)
+
+        # we can't use `state not in SHARD_UPDATE_STAT_STATES` to return
+        # because there are cases we still want to update root even if the
+        # stats are wrong. Such as it's a new shard or something else has
+        # decided to remove the latch to update root.
+        if own_shard_range.reported:
             return
 
-        # persist the reported shard metadata
-        broker.merge_shard_ranges(own_shard_range)
         # now get a consistent list of own and other shard ranges
         shard_ranges = broker.get_shard_ranges(
             include_own=True,
             include_deleted=True)
         # send everything
-        if self._send_shard_ranges(
-                broker.root_account, broker.root_container, shard_ranges):
+        if self._send_shard_ranges(broker, broker.root_account,
+                                   broker.root_container, shard_ranges,
+                                   {'Referer': quote(broker.path)}):
             # on success, mark ourselves as reported so we don't keep
             # hammering the root
             own_shard_range.reported = True
             broker.merge_shard_ranges(own_shard_range)
+            self.debug(broker, 'updated root objs=%d, tombstones=%s',
+                       own_shard_range.object_count,
+                       own_shard_range.tombstones)
 
     def _process_broker(self, broker, node, part):
         broker.get_info()  # make sure account/container are populated
-        state = broker.get_db_state()
-        self.logger.debug('Starting processing %s state %s',
-                          quote(broker.path), state)
+        db_state = broker.get_db_state()
+        is_deleted = broker.is_deleted()
+        self.debug(broker, 'Starting processing, state %s%s', db_state,
+                   ' (deleted)' if is_deleted else '')
 
         if not self._audit_container(broker):
             return
 
         # now look and deal with misplaced objects.
+        move_start_ts = time.time()
         self._move_misplaced_objects(broker)
+        self.logger.timing_since(
+            'sharder.sharding.move_misplaced', move_start_ts)
 
-        if broker.is_deleted():
-            # This container is deleted so we can skip it. We still want
-            # deleted containers to go via misplaced items because they may
-            # have new objects sitting in them that may need to move.
-            return
+        is_leader = node['index'] == 0 and self.auto_shard and not is_deleted
 
-        is_leader = node['index'] == 0 and self.auto_shard
-        if state in (UNSHARDED, COLLAPSED):
+        if db_state in (UNSHARDED, COLLAPSED):
             if is_leader and broker.is_root_container():
                 # bootstrap sharding of root container
+                own_shard_range = broker.get_own_shard_range()
+                update_own_shard_range_stats(broker, own_shard_range)
                 self._find_and_enable_sharding_candidates(
-                    broker, shard_ranges=[broker.get_own_shard_range()])
+                    broker, shard_ranges=[own_shard_range])
 
             own_shard_range = broker.get_own_shard_range()
-            if own_shard_range.state in (ShardRange.SHARDING,
-                                         ShardRange.SHRINKING,
-                                         ShardRange.SHARDED,
-                                         ShardRange.SHRUNK):
-                if broker.get_shard_ranges():
+            if own_shard_range.state in ShardRange.CLEAVING_STATES:
+                if broker.has_other_shard_ranges():
                     # container has been given shard ranges rather than
-                    # found them e.g. via replication or a shrink event
+                    # found them e.g. via replication or a shrink event,
+                    # or manually triggered cleaving.
+                    db_start_ts = time.time()
                     if broker.set_sharding_state():
-                        state = SHARDING
+                        db_state = SHARDING
+                        self.info(broker, 'Kick off container cleaving, '
+                                          'own shard range in state %r',
+                                  own_shard_range.state_text)
+                    self.logger.timing_since(
+                        'sharder.sharding.set_state', db_start_ts)
                 elif is_leader:
                     if broker.set_sharding_state():
-                        state = SHARDING
+                        db_state = SHARDING
                 else:
-                    self.logger.debug(
-                        'Own shard range in state %r but no shard ranges '
-                        'and not leader; remaining unsharded: %s',
-                        own_shard_range.state_text, quote(broker.path))
+                    self.debug(broker,
+                               'Own shard range in state %r but no shard '
+                               'ranges and not leader; remaining unsharded',
+                               own_shard_range.state_text)
 
-        if state == SHARDING:
+        if db_state == SHARDING:
+            cleave_start_ts = time.time()
             if is_leader:
                 num_found = self._find_shard_ranges(broker)
             else:
@@ -1587,38 +2401,53 @@ class ContainerSharder(ContainerReplicator):
 
             # always try to cleave any pending shard ranges
             cleave_complete = self._cleave(broker)
+            self.logger.timing_since(
+                'sharder.sharding.cleave', cleave_start_ts)
 
             if cleave_complete:
-                self.logger.info('Completed cleaving of %s',
-                                 quote(broker.path))
                 if self._complete_sharding(broker):
-                    state = SHARDED
+                    db_state = SHARDED
                     self._increment_stat('visited', 'completed', statsd=True)
+                    self.info(broker, 'Completed cleaving, DB set to sharded '
+                                      'state')
+                    self.logger.timing_since(
+                        'sharder.sharding.completed',
+                        float(broker.get_own_shard_range().epoch))
                 else:
-                    self.logger.debug('Remaining in sharding state %s',
-                                      quote(broker.path))
+                    self.info(broker, 'Completed cleaving, DB remaining in '
+                                      'sharding state')
+
+        if not broker.is_deleted():
+            if db_state == SHARDED and broker.is_root_container():
+                # look for shrink stats
+                send_start_ts = time.time()
+                self._identify_shrinking_candidate(broker, node)
+                if is_leader:
+                    self._find_and_enable_shrinking_candidates(broker)
+                    self._find_and_enable_sharding_candidates(broker)
+                for shard_range in broker.get_shard_ranges(
+                        states=[ShardRange.SHARDING]):
+                    self._send_shard_ranges(broker, shard_range.account,
+                                            shard_range.container,
+                                            [shard_range])
+                self.logger.timing_since(
+                    'sharder.sharding.send_sr', send_start_ts)
 
-        if state == SHARDED and broker.is_root_container():
-            if is_leader:
-                self._find_and_enable_shrinking_candidates(broker)
-                self._find_and_enable_sharding_candidates(broker)
-            for shard_range in broker.get_shard_ranges(
-                    states=[ShardRange.SHARDING]):
-                self._send_shard_ranges(
-                    shard_range.account, shard_range.container,
-                    [shard_range])
-
-        if not broker.is_root_container():
-            # Update the root container with this container's shard range
-            # info; do this even when sharded in case previous attempts
-            # failed; don't do this if there is no own shard range. When
-            # sharding a shard, this is when the root will see the new
-            # shards move to ACTIVE state and the sharded shard
-            # simultaneously become deleted.
-            self._update_root_container(broker)
-
-        self.logger.debug('Finished processing %s state %s',
-                          quote(broker.path), broker.get_db_state())
+            if not broker.is_root_container():
+                # Update the root container with this container's shard range
+                # info; do this even when sharded in case previous attempts
+                # failed; don't do this if there is no own shard range. When
+                # sharding a shard, this is when the root will see the new
+                # shards move to ACTIVE state and the sharded shard
+                # simultaneously become deleted.
+                update_start_ts = time.time()
+                self._update_root_container(broker)
+                self.logger.timing_since(
+                    'sharder.sharding.update_root', update_start_ts)
+
+        self.debug(broker,
+                   'Finished processing, state %s%s',
+                   broker.get_db_state(), ' (deleted)' if is_deleted else '')
 
     def _one_shard_cycle(self, devices_to_shard, partitions_to_shard):
         """
@@ -1642,9 +2471,9 @@ class ContainerSharder(ContainerReplicator):
             self.logger.info('(Override partitions: %s)',
                              ', '.join(str(p) for p in partitions_to_shard))
         self._zero_stats()
-        self._local_device_ids = set()
+        self._local_device_ids = {}
         dirs = []
-        self.ips = whataremyips(bind_ip=self.bind_ip)
+        self.ips = whataremyips(self.bind_ip)
         for node in self.ring.devs:
             device_path = self._check_node(node)
             if not device_path:
@@ -1653,7 +2482,7 @@ class ContainerSharder(ContainerReplicator):
             if os.path.isdir(datadir):
                 # Populate self._local_device_ids so we can find devices for
                 # shard containers later
-                self._local_device_ids.add(node['id'])
+                self._local_device_ids[node['id']] = node
                 if node['device'] not in devices_to_shard:
                     continue
                 part_filt = self._partition_dir_filter(
@@ -1661,7 +2490,7 @@ class ContainerSharder(ContainerReplicator):
                     partitions_to_shard)
                 dirs.append((datadir, node, part_filt))
         if not dirs:
-            self.logger.warning('Found no data dirs!')
+            self.logger.info('Found no containers directories')
         for part, path, node in self.roundrobin_datadirs(dirs):
             # NB: get_part_nodes always provides an 'index' key;
             # this will be used in leader selection
@@ -1686,42 +2515,47 @@ class ContainerSharder(ContainerReplicator):
                     self._increment_stat('visited', 'skipped')
             except (Exception, Timeout) as err:
                 self._increment_stat('visited', 'failure', statsd=True)
-                self.logger.exception(
-                    'Unhandled exception while processing %s: %s', path, err)
+                self.exception(broker, 'Unhandled exception while processing: '
+                                       '%s', err)
                 error = err
             try:
                 self._record_sharding_progress(broker, node, error)
             except (Exception, Timeout) as error:
-                self.logger.exception(
-                    'Unhandled exception while dumping progress for %s: %s',
-                    path, error)
+                self.exception(broker, 'Unhandled exception while dumping '
+                                       'progress: %s', error)
             self._periodic_report_stats()
 
         self._report_stats()
 
+    @contextmanager
     def _set_auto_shard_from_command_line(self, **kwargs):
+        conf_auto_shard = self.auto_shard
         auto_shard = kwargs.get('auto_shard', None)
         if auto_shard is not None:
             self.auto_shard = config_true_value(auto_shard)
+        try:
+            yield
+        finally:
+            self.auto_shard = conf_auto_shard
 
     def run_forever(self, *args, **kwargs):
         """Run the container sharder until stopped."""
-        self._set_auto_shard_from_command_line(**kwargs)
-        self.reported = time.time()
-        time.sleep(random() * self.interval)
-        while True:
-            begin = time.time()
-            try:
-                self._one_shard_cycle(devices_to_shard=Everything(),
-                                      partitions_to_shard=Everything())
-            except (Exception, Timeout):
-                self.logger.increment('errors')
-                self.logger.exception('Exception in sharder')
-            elapsed = time.time() - begin
-            self.logger.info(
-                'Container sharder cycle completed: %.02fs', elapsed)
-            if elapsed < self.interval:
-                time.sleep(self.interval - elapsed)
+        with self._set_auto_shard_from_command_line(**kwargs):
+            self.reported = time.time()
+            time.sleep(random() * self.interval)
+            while True:
+                begin = time.time()
+                try:
+                    self._one_shard_cycle(devices_to_shard=Everything(),
+                                          partitions_to_shard=Everything())
+                except (Exception, Timeout):
+                    self.logger.increment('errors')
+                    self.logger.exception('Exception in sharder')
+                elapsed = time.time() - begin
+                self.logger.info(
+                    'Container sharder cycle completed: %.02fs', elapsed)
+                if elapsed < self.interval:
+                    time.sleep(self.interval - elapsed)
 
     def run_once(self, *args, **kwargs):
         """Run the container sharder once."""
@@ -1729,10 +2563,32 @@ class ContainerSharder(ContainerReplicator):
         override_options = parse_override_options(once=True, **kwargs)
         devices_to_shard = override_options.devices or Everything()
         partitions_to_shard = override_options.partitions or Everything()
-        self._set_auto_shard_from_command_line(**kwargs)
-        begin = self.reported = time.time()
-        self._one_shard_cycle(devices_to_shard=devices_to_shard,
-                              partitions_to_shard=partitions_to_shard)
-        elapsed = time.time() - begin
-        self.logger.info(
-            'Container sharder "once" mode completed: %.02fs', elapsed)
+        with self._set_auto_shard_from_command_line(**kwargs):
+            begin = self.reported = time.time()
+            self._one_shard_cycle(devices_to_shard=devices_to_shard,
+                                  partitions_to_shard=partitions_to_shard)
+            elapsed = time.time() - begin
+            self.logger.info(
+                'Container sharder "once" mode completed: %.02fs', elapsed)
+
+
+def main():
+    parser = OptionParser("%prog CONFIG [options]")
+    parser.add_option('-d', '--devices',
+                      help='Shard containers only on given devices. '
+                           'Comma-separated list. '
+                           'Only has effect if --once is used.')
+    parser.add_option('-p', '--partitions',
+                      help='Shard containers only in given partitions. '
+                           'Comma-separated list. '
+                           'Only has effect if --once is used.')
+    parser.add_option('--no-auto-shard', action='store_false',
+                      dest='auto_shard', default=None,
+                      help='Disable auto-sharding. Overrides the auto_shard '
+                           'value in the config file.')
+    conf_file, options = parse_options(parser=parser, once=True)
+    run_daemon(ContainerSharder, conf_file, **options)
+
+
+if __name__ == '__main__':
+    main()