redis-trib.rb 15.2 KB
Newer Older
1 2
#!/usr/bin/env ruby

3 4
# TODO (temporary here, we'll move this into the Github issues once
#       redis-trib initial implementation is complted).
5
#
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
# - Make sure that if the rehashing fails in the middle redis-trib will try
#   to recover.
# - When redis-trib performs a cluster check, if it detects a slot move in
#   progress it should prompt the user to continue the move from where it
#   stopped.
# - Gracefully handle Ctrl+C in move_slot to prompt the user if really stop
#   while rehashing, and performing the best cleanup possible if the user
#   forces the quit.
# - When doing "fix" set a global Fix to true, and prompt the user to
#   fix the problem if automatically fixable every time there is something
#   to fix. For instance:
#   1) If there is a node that pretend to receive a slot, or to migrate a
#      slot, but has no entries in that slot, fix it.
#   2) If there is a node having keys in slots that are not owned by it
#      fix this condiiton moving the entries in the same node.
#   3) Perform more possibly slow tests about the state of the cluster.
#   4) When aborted slot migration is detected, fix it.
23

24 25 26
require 'rubygems'
require 'redis'

27 28
ClusterHashSlots = 4096

29 30 31 32
def xputs(s)
    printf s
    STDOUT.flush
end
33

34 35 36
class ClusterNode
    def initialize(addr)
        s = addr.split(":")
37
        if s.length != 2
A
antirez 已提交
38
            puts "Invalid node name #{addr}"
39 40
            exit 1
        end
41
        @r = nil
42 43 44 45 46
        @info = {}
        @info[:host] = s[0]
        @info[:port] = s[1]
        @info[:slots] = {}
        @dirty = false # True if we need to flush slots info into node.
47
        @friends = []
48 49
    end

50 51 52 53 54
    def friends
        @friends
    end

    def slots 
55
        @info[:slots]
56 57
    end

58
    def to_s
59
        "#{@info[:host]}:#{@info[:port]}"
60 61
    end

62
    def connect(o={})
63
        return if @r
64
        xputs "Connecting to node #{self}: "
65
        begin
66
            @r = Redis.new(:host => @info[:host], :port => @info[:port])
67
            @r.ping
68 69
        rescue
            puts "ERROR"
70
            puts "Sorry, can't connect to node #{self}"
71 72
            exit 1 if o[:abort]
            @r = nil
73 74 75 76
        end
        puts "OK"
    end

77 78 79 80 81 82 83 84
    def assert_cluster
        info = @r.info
        if !info["cluster_enabled"] || info["cluster_enabled"].to_i == 0
            puts "Error: Node #{self} is not configured as a cluster node."
            exit 1
        end
    end

85 86 87 88 89 90 91 92
    def assert_empty
        if !(@r.cluster("info").split("\r\n").index("cluster_known_nodes:1")) ||
            (@r.info['db0'])
            puts "Error: Node #{self} is not empty. Either the node already knows other nodes (check with nodes-info) or contains some key in database 0."
            exit 1
        end
    end

93 94 95 96 97
    def load_info(o={})
        self.connect
        nodes = @r.cluster("nodes").split("\n")
        nodes.each{|n|
            # name addr flags role ping_sent ping_recv link_status slots
98 99 100
            split = n.split
            name,addr,flags,role,ping_sent,ping_recv,link_status = split[0..6]
            slots = split[7..-1]
101 102 103 104 105 106 107 108 109 110
            info = {
                :name => name,
                :addr => addr,
                :flags => flags.split(","),
                :role => role,
                :ping_sent => ping_sent.to_i,
                :ping_recv => ping_recv.to_i,
                :link_status => link_status
            }
            if info[:flags].index("myself")
111 112
                @info = @info.merge(info)
                @info[:slots] = {}
113 114 115 116
                slots.each{|s|
                    if s[0..0] == '['
                        # Fixme: for now skipping migration entries
                    elsif s.index("-")
117 118 119 120 121
                        start,stop = s.split("-")
                        self.add_slots((start.to_i)..(stop.to_i))
                    else
                        self.add_slots((s.to_i)..(s.to_i))
                    end
122
                } if slots
123
                @dirty = false
124 125 126
                @r.cluster("info").split("\n").each{|e|    
                    k,v=e.split(":")
                    k = k.to_sym
127
                    v.chop!
128 129 130 131 132 133
                    if k != :cluster_state
                        @info[k] = v.to_i
                    else
                        @info[k] = v
                    end
                }
134 135 136 137 138 139
            elsif o[:getfriends]
                @friends << info
            end
        }
    end

140 141
    def add_slots(slots)
        slots.each{|s|
142
            @info[:slots][s] = :new
143 144 145 146 147 148 149
        }
        @dirty = true
    end

    def flush_node_config
        return if !@dirty
        new = []
150
        @info[:slots].each{|s,val|
151 152
            if val == :new
                new << s
153
                @info[:slots][s] = true
154 155 156 157 158 159
            end
        }
        @r.cluster("addslots",*new)
        @dirty = false
    end

160
    def info_string
161
        # We want to display the hash slots assigned to this node
A
antirez 已提交
162
        # as ranges, like in: "1-5,8-9,20-25,30"
163 164 165 166 167 168
        #
        # Note: this could be easily written without side effects,
        # we use 'slots' just to split the computation into steps.
        
        # First step: we want an increasing array of integers
        # for instance: [1,2,3,4,5,8,9,20,21,22,23,24,25,30]
169
        slots = @info[:slots].keys.sort
170 171 172 173

        # As we want to aggregate adiacent slots we convert all the
        # slot integers into ranges (with just one element)
        # So we have something like [1..1,2..2, ... and so forth.
A
antirez 已提交
174
        slots.map!{|x| x..x}
175 176 177 178 179

        # Finally we group ranges with adiacent elements.
        slots = slots.reduce([]) {|a,b|
            if !a.empty? && b.first == (a[-1].last)+1
                a[0..-2] + [(a[-1].first)..(b.last)]
180
            else
181
                a + [b]
182
            end
183 184 185 186 187 188 189
        }

        # Now our task is easy, we just convert ranges with just one
        # element into a number, and a real range into a start-end format.
        # Finally we join the array using the comma as separator.
        slots = slots.map{|x|
            x.count == 1 ? x.first.to_s : "#{x.first}-#{x.last}"
190
        }.join(",")
191

192
        "[#{@info[:cluster_state].upcase}] #{self.info[:name]} #{self.to_s} slots:#{slots} (#{self.slots.length} slots)"
193
    end
194 195

    def info
196
        @info
197
    end
198 199 200 201 202
    
    def is_dirty?
        @dirty
    end

203 204 205 206 207 208
    def r
        @r
    end
end

class RedisTrib
209 210 211 212
    def initialize
        @nodes = []
    end

213 214 215 216 217 218 219 220
    def check_arity(req_args, num_args)
        if ((req_args > 0 and num_args != req_args) ||
           (req_args < 0 and num_args < req_args.abs))
           puts "Wrong number of arguments for specified sub command"
           exit 1
        end
    end

221 222 223 224
    def add_node(node)
        @nodes << node
    end

225 226 227 228 229 230 231
    def get_node_by_name(name)
        @nodes.each{|n|
            return n if n.info[:name] == name.downcase
        }
        return nil
    end

232
    def check_cluster
233
        puts "Performing Cluster Check (using node #{@nodes[0]})"
234
        errors = []
235
        show_nodes
236 237 238 239 240 241 242 243
        # Check if all the slots are covered
        slots = {}
        @nodes.each{|n|
            slots = slots.merge(n.slots)
        }
        if slots.length == 4096
            puts "[OK] All 4096 slots covered."
        else
244 245
            errors << "[ERR] Not all 4096 slots are covered by nodes."
            puts errors[-1]
246
        end
247
        return errors
248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269
    end

    def alloc_slots
        slots_per_node = ClusterHashSlots/@nodes.length
        i = 0
        @nodes.each{|n|
            first = i*slots_per_node
            last = first+slots_per_node-1
            last = ClusterHashSlots-1 if i == @nodes.length-1
            n.add_slots first..last
            i += 1
        }
    end

    def flush_nodes_config
        @nodes.each{|n|
            n.flush_node_config
        }
    end

    def show_nodes
        @nodes.each{|n|
270
            puts n.info_string
271 272 273 274
        }
    end

    def join_cluster
275 276 277 278 279 280 281 282 283 284
        # We use a brute force approach to make sure the node will meet
        # each other, that is, sending CLUSTER MEET messages to all the nodes
        # about the very same node.
        # Thanks to gossip this information should propagate across all the
        # cluster in a matter of seconds.
        first = false
        @nodes.each{|n|
            if !first then first = n.info; next; end # Skip the first node
            n.r.cluster("meet",first[:host],first[:port])
        }
285 286 287 288 289 290 291 292 293
    end

    def yes_or_die(msg)
        print "#{msg} (type 'yes' to accept): "
        STDOUT.flush
        if !(STDIN.gets.chomp.downcase == "yes")
            puts "Aborting..."
            exit 1
        end
294
    end
295

296
    def load_cluster_info_from_node(nodeaddr)
297 298 299
        node = ClusterNode.new(ARGV[1])
        node.connect(:abort => true)
        node.assert_cluster
300
        node.load_info(:getfriends => true)
301
        add_node(node)
302 303 304 305 306 307
        node.friends.each{|f|
            fnode = ClusterNode.new(f[:addr])
            fnode.connect()
            fnode.load_info()
            add_node(fnode)
        }
308 309
    end

310 311 312 313 314
    # Given a list of source nodes return a "resharding plan"
    # with what slots to move in order to move "numslots" slots to another
    # instance.
    def compute_reshard_table(sources,numslots)
        moved = []
315 316 317 318 319 320 321
        # Sort from bigger to smaller instance, for two reasons:
        # 1) If we take less slots than instanes it is better to start getting from
        #    the biggest instances.
        # 2) We take one slot more from the first instance in the case of not perfect
        #    divisibility. Like we have 3 nodes and need to get 10 slots, we take
        #    4 from the first, and 3 from the rest. So the biggest is always the first.
        sources = sources.sort{|a,b| b.slots.length <=> a.slots.length}
322
        source_tot_slots = sources.inject(0) {|sum,source| sum+source.slots.length}
323
        sources.each_with_index{|s,i|
324 325
            # Every node will provide a number of slots proportional to the
            # slots it has assigned.
326
            n = (numslots.to_f/source_tot_slots*s.slots.length)
327 328 329 330 331
            if i == 0
                n = n.ceil
            else
                n = n.floor
            end
332 333 334 335 336 337 338 339 340 341 342
            s.slots.keys.sort[(0...n)].each{|slot|
                if moved.length < numslots
                    moved << {:source => s, :slot => slot}
                end
            }
        }
        return moved
    end

    def show_reshard_table(table)
        table.each{|e|
343
            puts "    Moving slot #{e[:slot]} from #{e[:source].info[:name]}"
344 345 346
        }
    end

347
    def move_slot(source,target,slot,o={})
348 349 350 351
        # We start marking the slot as importing in the destination node,
        # and the slot as migrating in the target host. Note that the order of
        # the operations is important, as otherwise a client may be redirected to
        # the target node that does not yet know it is importing this slot.
352
        print "Moving slot #{slot} from #{source.info_string}: "; STDOUT.flush
353 354
        target.r.cluster("setslot",slot,"importing",source.info[:name])
        source.r.cluster("setslot",slot,"migrating",source.info[:name])
355
        # Migrate all the keys from source to target using the MIGRATE command
356 357 358 359
        while true
            keys = source.r.cluster("getkeysinslot",slot,10)
            break if keys.length == 0
            keys.each{|key|
360
                source.r.migrate(target.info[:host],target.info[:port],key,0,1000)
361 362 363 364 365 366 367 368 369
                print "." if o[:verbose]
                STDOUT.flush
            }
        end
        puts
        # Set the new node as the owner of the slot in all the known nodes.
        @nodes.each{|n|
            n.r.cluster("setslot",slot,"node",target.info[:name])
        }
370 371
    end

372 373 374 375
    # redis-trib subcommands implementations

    def check_cluster_cmd   
        load_cluster_info_from_node(ARGV[1])
376 377 378
        check_cluster
    end

379 380 381 382 383 384 385
    def reshard_cluster_cmd
        load_cluster_info_from_node(ARGV[1])
        errors = check_cluster
        if errors.length != 0
            puts "Please fix your cluster problems before resharding."
            exit 1
        end
386 387
        numslots = 0
        while numslots <= 0 or numslots > 4096
388
            print "How many slots do you want to move (from 1 to 4096)? "
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426
            numslots = STDIN.gets.to_i
        end
        target = nil
        while not target
            print "What is the receiving node ID? "
            target = get_node_by_name(STDIN.gets.chop)
            if not target
                puts "The specified node is not known, please retry."
            end
        end
        sources = []
        puts "Please enter all the source node IDs."
        puts "  Type 'all' to use all the nodes as source nodes for the hash slots."
        puts "  Type 'done' once you entered all the source nodes IDs."
        while true
            print "Source node ##{sources.length+1}:"
            line = STDIN.gets.chop
            src = get_node_by_name(line)
            if line == "done"
                if sources.length == 0
                    puts "No source nodes given, operation aborted"
                    exit 1
                else
                    break
                end
            elsif line == "all"
                @nodes.each{|n|
                    next if n.info[:name] == target.info[:name]
                    sources << n
                }
                break
            elsif not src
                puts "The specified node is not known, please retry."
            elsif src.info[:name] == target.info[:name]
                puts "It is not possible to use the target node as source node."
            else
                sources << src
            end
427
        end
428 429 430 431 432 433
        puts "\nReady to move #{numslots} slots."
        puts "  Source nodes:"
        sources.each{|s| puts "    "+s.info_string}
        puts "  Destination node:"
        puts "    #{target.info_string}"
        reshard_table = compute_reshard_table(sources,numslots)
434
        puts "  Resharding plan:"
435
        show_reshard_table(reshard_table)
436 437 438 439
        print "Do you want to proceed with the proposed reshard plan (yes/no)? "
        yesno = STDIN.gets.chop
        exit(1) if (yesno != "yes")
        reshard_table.each{|e|
440
            move_slot(e[:source],target,e[:slot],:verbose=>true)
441
        }
442 443
    end

444 445 446 447 448 449
    def create_cluster_cmd
        puts "Creating cluster"
        ARGV[1..-1].each{|n|
            node = ClusterNode.new(n)
            node.connect(:abort => true)
            node.assert_cluster
450
            node.load_info
451 452 453 454 455 456 457 458 459 460 461 462 463
            node.assert_empty
            add_node(node)
        }
        puts "Performing hash slots allocation on #{@nodes.length} nodes..."
        alloc_slots
        show_nodes
        yes_or_die "Can I set the above configuration?"
        flush_nodes_config
        puts "** Nodes configuration updated"
        puts "** Sending CLUSTER MEET messages to join the cluster"
        join_cluster
        check_cluster
    end
464 465 466
end

COMMANDS={
467
    "create" => ["create_cluster_cmd", -2, "host1:port host2:port ... hostN:port"],
468 469
    "check" =>  ["check_cluster_cmd", 2, "host:port"],
    "reshard" =>  ["reshard_cluster_cmd", 2, "host:port"]
470 471 472 473 474
}

# Sanity check
if ARGV.length == 0
    puts "Usage: redis-trib <command> <arguments ...>"
A
antirez 已提交
475 476 477 478 479
    puts
    COMMANDS.each{|k,v|
        puts "  #{k.ljust(20)} #{v[2]}"
    }
    puts
480 481 482 483 484 485 486 487 488 489 490 491 492
    exit 1
end

rt = RedisTrib.new
cmd_spec = COMMANDS[ARGV[0].downcase]
if !cmd_spec
    puts "Unknown redis-trib subcommand '#{ARGV[0]}'"
    exit 1
end
rt.check_arity(cmd_spec[1],ARGV.length)

# Dispatch
rt.send(cmd_spec[0])