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

3
# TODO (temporary here, we'll move this into the Github issues once
G
guiquanz 已提交
4
#       redis-trib initial implementation is completed).
5
#
6 7 8 9 10 11 12 13 14 15 16 17 18 19
# - 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
G
guiquanz 已提交
20
#      fix this condition moving the entries in the same node.
21 22
#   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
ClusterHashSlots = 16384
28

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
        @info = {}
        @info[:host] = s[0]
        @info[:port] = s[1]
        @info[:slots] = {}
46 47
        @info[:migrating] = {}
        @info[:importing] = {}
48
        @dirty = false # True if we need to flush slots info into node.
49
        @friends = []
50 51
    end

52 53 54 55 56
    def friends
        @friends
    end

    def slots 
57
        @info[:slots]
58 59
    end

60 61 62 63
    def has_flag?(flag)
        @info[:flags].index(flag)
    end

64
    def to_s
65
        "#{@info[:host]}:#{@info[:port]}"
66 67
    end

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

83 84 85 86 87 88 89 90
    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

91 92 93
    def assert_empty
        if !(@r.cluster("info").split("\r\n").index("cluster_known_nodes:1")) ||
            (@r.info['db0'])
94
            puts "Error: Node #{self} is not empty. Either the node already knows other nodes (check with CLUSTER NODES) or contains some key in database 0."
95 96 97 98
            exit 1
        end
    end

99 100 101 102 103
    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
104 105 106
            split = n.split
            name,addr,flags,role,ping_sent,ping_recv,link_status = split[0..6]
            slots = split[7..-1]
107 108 109 110 111 112 113 114 115 116
            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")
117 118
                @info = @info.merge(info)
                @info[:slots] = {}
119 120
                slots.each{|s|
                    if s[0..0] == '['
121 122 123 124 125 126 127
                        if s[2..4] == "->-" # Migrating
                            slot,dst = s[1..-1].split("->-")
                            @info[:migrating][slot] = dst
                        elsif s[2..4] == "-<-" # Importing
                            slot,src = s[1..-1].split("-<-")
                            @info[:importing][slot] = src
                        end
128
                    elsif s.index("-")
129 130 131 132 133
                        start,stop = s.split("-")
                        self.add_slots((start.to_i)..(stop.to_i))
                    else
                        self.add_slots((s.to_i)..(s.to_i))
                    end
134
                } if slots
135
                @dirty = false
136 137 138
                @r.cluster("info").split("\n").each{|e|    
                    k,v=e.split(":")
                    k = k.to_sym
139
                    v.chop!
140 141 142 143 144 145
                    if k != :cluster_state
                        @info[k] = v.to_i
                    else
                        @info[k] = v
                    end
                }
146 147 148 149 150 151
            elsif o[:getfriends]
                @friends << info
            end
        }
    end

152 153
    def add_slots(slots)
        slots.each{|s|
154
            @info[:slots][s] = :new
155 156 157 158 159 160 161
        }
        @dirty = true
    end

    def flush_node_config
        return if !@dirty
        new = []
162
        @info[:slots].each{|s,val|
163 164
            if val == :new
                new << s
165
                @info[:slots][s] = true
166 167 168 169 170 171
            end
        }
        @r.cluster("addslots",*new)
        @dirty = false
    end

172
    def info_string
173
        # We want to display the hash slots assigned to this node
A
antirez 已提交
174
        # as ranges, like in: "1-5,8-9,20-25,30"
175 176 177 178 179 180
        #
        # 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]
181
        slots = @info[:slots].keys.sort
182

G
guiquanz 已提交
183
        # As we want to aggregate adjacent slots we convert all the
184 185
        # slot integers into ranges (with just one element)
        # So we have something like [1..1,2..2, ... and so forth.
A
antirez 已提交
186
        slots.map!{|x| x..x}
187

G
guiquanz 已提交
188
        # Finally we group ranges with adjacent elements.
189 190 191
        slots = slots.reduce([]) {|a,b|
            if !a.empty? && b.first == (a[-1].last)+1
                a[0..-2] + [(a[-1].first)..(b.last)]
192
            else
193
                a + [b]
194
            end
195 196 197 198 199 200 201
        }

        # 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}"
202
        }.join(",")
203

204
        "[#{@info[:cluster_state].upcase} #{(self.info[:flags]-["myself"]).join(",")}] #{self.info[:name]} #{self.to_s} slots:#{slots} (#{self.slots.length} slots)"
205
    end
206

207 208 209 210 211 212 213 214
    # Return a single string representing nodes and associated slots.
    # TODO: remove slaves from config when slaves will be handled
    # by Redis Cluster.
    def get_config_signature
        config = []
        @r.cluster("nodes").each_line{|l|
            s = l.split
            slots = s[7..-1].select {|x| x[0..0] != "["}
215
            next if slots.length == 0
216 217 218 219 220
            config << s[0]+":"+(slots.sort.join(","))
        }
        config.sort.join("|")
    end

221
    def info
222
        @info
223
    end
224 225 226 227 228
    
    def is_dirty?
        @dirty
    end

229 230 231 232 233 234
    def r
        @r
    end
end

class RedisTrib
235 236
    def initialize
        @nodes = []
237 238
        @fix = false
        @errors = []
239 240
    end

241 242 243 244 245 246 247 248
    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

249 250 251 252
    def add_node(node)
        @nodes << node
    end

253 254 255 256 257 258 259
    def get_node_by_name(name)
        @nodes.each{|n|
            return n if n.info[:name] == name.downcase
        }
        return nil
    end

260
    def check_cluster
261
        puts "Performing Cluster Check (using node #{@nodes[0]})"
262
        show_nodes
263
        check_config_consistency
264
        check_open_slots
265 266 267 268 269 270
        check_slots_coverage
    end

    # Merge slots of every known node. If the resulting slots are equal
    # to ClusterHashSlots, then all slots are served.
    def covered_slots
271 272 273 274
        slots = {}
        @nodes.each{|n|
            slots = slots.merge(n.slots)
        }
275 276 277 278 279
        slots
    end

    def check_slots_coverage
        slots = covered_slots
280 281
        if slots.length == ClusterHashSlots
            puts "[OK] All #{ClusterHashSlots} slots covered."
282
        else
283 284 285
            @errors <<
                "[ERR] Not all #{ClusterHashSlots} slots are covered by nodes."
            puts @errors[-1]
A
antirez 已提交
286
            fix_slots_coverage if @fix
287
        end
288 289
    end

290 291 292 293 294 295 296 297 298 299 300 301
    def check_open_slots
        open_slots = []
        @nodes.each{|n|
            if n.info[:migrating].size > 0
                puts "[WARNING] Node #{n} has slots in migrating state."
                open_slots += n.info[:migrating].keys
            elsif n.info[:importing].size > 0
                puts "[WARNING] Node #{n} has slots in importing state."
                open_slots += n.info[:importing].keys
            end
        }
        open_slots.uniq!
302
        if open_slots.length > 0
303 304 305 306 307 308 309
            puts "[WARNING] The following slots are open: #{open_slots.join(",")}"
        end
        if @fix
            open_slots.each{|slot| fix_open_slot slot}
        end
    end

310 311 312 313 314 315 316 317
    def nodes_with_keys_in_slot(slot)
        nodes = []
        @nodes.each{|n|
            nodes << n if n.r.cluster("getkeysinslot",slot,1).length > 0
        }
        nodes
    end

318
    def fix_slots_coverage
319 320 321 322 323 324 325 326 327 328 329 330
        not_covered = (0...ClusterHashSlots).to_a - covered_slots.keys
        puts "\nFixing slots coverage..."
        puts "List of not covered slots: " + not_covered.join(",")

        # For every slot, take action depending on the actual condition:
        # 1) No node has keys for this slot.
        # 2) A single node has keys for this slot.
        # 3) Multiple nodes have keys for this slot.
        slots = {}
        not_covered.each{|slot|
            nodes = nodes_with_keys_in_slot(slot)
            slots[slot] = nodes
331
            puts "Slot #{slot} has keys in #{nodes.length} nodes: #{nodes.join}"
332 333 334 335 336 337
        }

        none = slots.select {|k,v| v.length == 0}
        single = slots.select {|k,v| v.length == 1}
        multi = slots.select {|k,v| v.length > 1}

338 339 340 341 342 343 344 345 346 347 348 349 350 351
        # Handle case "1": keys in no node.
        if none.length > 0
            puts "The folowing uncovered slots have no keys across the cluster:"
            puts none.keys.join(",")
            yes_or_die "Fix these slots by covering with a random node?"
            none.each{|slot,nodes|
                node = @nodes.sample
                puts "Covering slot #{slot} with #{node}"
                node.r.cluster("addslots",slot)
            }
        end

        # Handle case "2": keys only in one node.
        if single.length > 0
352 353
            puts "The folowing uncovered slots have keys in just one node:"
            puts single.keys.join(",")
354
            yes_or_die "Fix these slots by covering with those nodes?"
355 356 357 358 359
            single.each{|slot,nodes|
                puts "Covering slot #{slot} with #{nodes[0]}"
                nodes[0].r.cluster("addslots",slot)
            }
        end
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376

        # Handle case "3": keys in multiple nodes.
        if multi.length > 0
            puts "The folowing uncovered slots have keys in multiple nodes:"
            puts multi.keys.join(",")
            yes_or_die "Fix these slots by moving keys into a single node?"
            multi.each{|slot,nodes|
                puts "Covering slot #{slot} moving keys to #{nodes[0]}"
                # TODO
                # 1) Set all nodes as "MIGRATING" for this slot, so that we
                # can access keys in the hash slot using ASKING.
                # 2) Move everything to node[0]
                # 3) Clear MIGRATING from nodes, and ADDSLOTS the slot to
                # node[0].
                raise "TODO: Work in progress"
            }
        end
377 378
    end

379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408
    # Slot 'slot' was found to be in importing or migrating state in one or
    # more nodes. This function fixes this condition by migrating keys where
    # it seems more sensible.
    def fix_open_slot(slot)
        migrating = []
        importing = []
        @nodes.each{|n|
            next if n.has_flag? "slave"
            if n.info[:migrating][slot]
                migrating << n
            elsif n.info[:importing][slot]
                importing << n
            elsif n.r.cluster("countkeysinslot",slot) > 0
                puts "Found keys about slot #{slot} in node #{n}!"
            end
        }
        puts "Fixing open slot 0:"
        puts "Set as migrating in: #{migrating.join(",")}"
        puts "Set as importing in: #{importing.join(",")}"

        # Case 1: The slot is in migrating state in one slot, and in
        #         importing state in 1 slot. That's trivial to address.
        if migrating.length == 1 && importing.length == 1
            puts "Moving slot zero to #{importing[1]}"
            move_slot(migrating[0],importing[0],0,:verbose=>true)
        else
            puts "Sorry, Redis-trib can't fix this slot yet (work in progress)"
        end
    end

409 410 411 412 413 414 415 416 417 418 419 420 421
    # Check if all the nodes agree about the cluster configuration
    def check_config_consistency
        signatures=[]
        @nodes.each{|n|
            signatures << n.get_config_signature
        }
        if signatures.uniq.length != 1
            puts "[ERR] Nodes don't agree about configuration!"
        else
            puts "[OK] All nodes agree about slots configuration."
        end
    end

422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441
    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|
442
            puts n.info_string
443 444 445 446
        }
    end

    def join_cluster
447 448 449 450 451 452 453 454 455 456
        # 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])
        }
457 458 459 460 461 462 463 464 465
    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
466
    end
467

468
    def load_cluster_info_from_node(nodeaddr)
469
        node = ClusterNode.new(nodeaddr)
470 471
        node.connect(:abort => true)
        node.assert_cluster
472
        node.load_info(:getfriends => true)
473
        add_node(node)
474
        node.friends.each{|f|
475 476 477
            next if f[:flags].index("noaddr") ||
                    f[:flags].index("disconnected") ||
                    f[:flags].index("fail")
478 479 480 481 482
            fnode = ClusterNode.new(f[:addr])
            fnode.connect()
            fnode.load_info()
            add_node(fnode)
        }
483 484
    end

485 486 487 488 489
    # 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 = []
490
        # Sort from bigger to smaller instance, for two reasons:
491 492 493 494 495 496
        # 1) If we take less slots than instances 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.
497
        sources = sources.sort{|a,b| b.slots.length <=> a.slots.length}
498 499 500
        source_tot_slots = sources.inject(0) {|sum,source|
            sum+source.slots.length
        }
501
        sources.each_with_index{|s,i|
502 503
            # Every node will provide a number of slots proportional to the
            # slots it has assigned.
504
            n = (numslots.to_f/source_tot_slots*s.slots.length)
505 506 507 508 509
            if i == 0
                n = n.ceil
            else
                n = n.floor
            end
510 511 512 513 514 515 516 517 518 519 520
            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|
521
            puts "    Moving slot #{e[:slot]} from #{e[:source].info[:name]}"
522 523 524
        }
    end

525
    def move_slot(source,target,slot,o={})
526 527
        # 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
528 529
        # 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.
530
        print "Moving slot #{slot} from #{source} to #{target}: "; STDOUT.flush
531
        target.r.cluster("setslot",slot,"importing",source.info[:name])
532
        source.r.cluster("setslot",slot,"migrating",target.info[:name])
533
        # Migrate all the keys from source to target using the MIGRATE command
534 535 536 537
        while true
            keys = source.r.cluster("getkeysinslot",slot,10)
            break if keys.length == 0
            keys.each{|key|
538
                source.r.migrate(target.info[:host],target.info[:port],key,0,1000)
539 540 541 542 543 544 545 546 547
                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])
        }
548 549
    end

550 551
    # redis-trib subcommands implementations

552 553 554 555 556 557 558
    def check_cluster_cmd
        load_cluster_info_from_node(ARGV[1])
        check_cluster
    end

    def fix_cluster_cmd
        @fix = true
559
        load_cluster_info_from_node(ARGV[1])
560 561 562
        check_cluster
    end

563 564
    def reshard_cluster_cmd
        load_cluster_info_from_node(ARGV[1])
565 566
        check_cluster
        if @errors.length != 0
567 568 569
            puts "Please fix your cluster problems before resharding."
            exit 1
        end
570
        numslots = 0
571 572
        while numslots <= 0 or numslots > ClusterHashSlots
            print "How many slots do you want to move (from 1 to #{ClusterHashSlots})? "
573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610
            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
611
        end
612 613 614 615 616 617
        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)
618
        puts "  Resharding plan:"
619
        show_reshard_table(reshard_table)
620 621 622 623
        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|
624
            move_slot(e[:source],target,e[:slot],:verbose=>true)
625
        }
626 627
    end

628 629 630 631 632 633
    def create_cluster_cmd
        puts "Creating cluster"
        ARGV[1..-1].each{|n|
            node = ClusterNode.new(n)
            node.connect(:abort => true)
            node.assert_cluster
634
            node.load_info
635 636 637 638 639 640 641 642 643 644 645 646 647
            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
648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667

    def addnode_cluster_cmd
        puts "Adding node #{ARGV[1]} to cluster #{ARGV[2]}"

        # Check the existing cluster
        load_cluster_info_from_node(ARGV[2])
        check_cluster

        # Add the new node
        new = ClusterNode.new(ARGV[1])
        new.connect(:abort => true)
        new.assert_cluster
        new.load_info
        new.assert_empty
        first = @nodes.first.info

        # Send CLUSTER MEET command to the new node
        puts "Send CLUSTER MEET to node #{new} to make it join the cluster."
        new.r.cluster("meet",first[:host],first[:port])
    end
A
antirez 已提交
668 669 670 671 672

    def help_cluster_cmd
        show_help
        exit 0
    end
673 674 675
end

COMMANDS={
676 677 678
    "create"  => ["create_cluster_cmd", -2, "host1:port1 ... hostN:portN"],
    "check"   => ["check_cluster_cmd", 2, "host:port"],
    "fix"     => ["fix_cluster_cmd", 2, "host:port"],
679
    "reshard" => ["reshard_cluster_cmd", 2, "host:port"],
A
antirez 已提交
680 681
    "addnode" => ["addnode_cluster_cmd", 3, "new_host:new_port existing_host:existing_port"],
    "help"    => ["help_cluster_cmd", 1, "(show this help)"]
682 683
}

A
antirez 已提交
684
def show_help
685
    puts "Usage: redis-trib <command> <arguments ...>"
A
antirez 已提交
686 687
    puts
    COMMANDS.each{|k,v|
688
        puts "  #{k.ljust(10)} #{v[2]}"
A
antirez 已提交
689 690
    }
    puts
A
antirez 已提交
691 692 693 694 695
end

# Sanity check
if ARGV.length == 0
    show_help
696 697 698 699 700 701 702 703 704 705 706 707 708
    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])