raft: use const firstId to track ids

etcdserver/server_test.go

@@ -16,6 +16,11 @@ import (
 func TestClusterOf1(t *testing.T) { testServer(t, 1) }
 func TestClusterOf3(t *testing.T) { testServer(t, 3) }
 
+// firstId is the id of the first raft machine in the array.
+// It implies the way to set id for raft machines:
+// The id of n-th machine is firstId+n, and machine with machineId is at machineId-firstId place in the array.
+const firstId int64 = 0x1000
+
 func testServer(t *testing.T, ns int64) {
 	ctx, cancel := context.WithCancel(context.Background())
 	defer cancel()
@@ -25,17 +30,17 @@ func testServer(t *testing.T, ns int64) {
 	send := func(msgs []raftpb.Message) {
 		for _, m := range msgs {
 			t.Logf("m = %+v\n", m)
-			ss[m.To-0x1000].Node.Step(ctx, m)
+			ss[m.To-firstId].Node.Step(ctx, m)
 		}
 	}
 
 	peers := make([]int64, ns)
 	for i := int64(0); i < ns; i++ {
-		peers[i] = 0x1000 + i
+		peers[i] = firstId + i
 	}
 
 	for i := int64(0); i < ns; i++ {
-		id := 0x1000 + i
+		id := firstId + i
 		n := raft.Start(id, peers, 10, 1)
 		tk := time.NewTicker(10 * time.Millisecond)
 		defer tk.Stop()

raft/raft_test.go

@@ -10,6 +10,13 @@ import (
 	pb "github.com/coreos/etcd/raft/raftpb"
 )
 
+// firstId is the id of the first raft machine in the array.
+// It implies the way to set id for raft machines:
+// The id of n-th machine is firstId+n, and machine with machineId is at machineId-firstId place in the array.
+// This is how newNetwork sets ids for raft machines.
+// TODO: use more flexible ways to set it
+const firstId int64 = 0x1000
+
 // nextEnts returns the appliable entries and updates the applied index
 func (r *raft) nextEnts() (ents []pb.Entry) {
 	ents = r.raftLog.nextEnts()
@@ -41,8 +48,8 @@ func TestLeaderElection(t *testing.T) {
 	}
 
 	for i, tt := range tests {
-		tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
-		sm := tt.network.peers[0x1000].(*raft)
+		tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
+		sm := tt.network.peers[firstId].(*raft)
 		if sm.state != tt.state {
 			t.Errorf("#%d: state = %s, want %s", i, sm.state, tt.state)
 		}
@@ -61,23 +68,23 @@ func TestLogReplication(t *testing.T) {
 		{
 			newNetwork(nil, nil, nil),
 			[]pb.Message{
-				{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}},
+				{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}},
 			},
 			2,
 		},
 		{
 			newNetwork(nil, nil, nil),
 			[]pb.Message{
-				{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}},
-				{From: none, To: 0x1001, Type: msgHup},
-				{From: none, To: 0x1001, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}},
+				{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}},
+				{From: none, To: firstId + 1, Type: msgHup},
+				{From: none, To: firstId + 1, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}},
 			},
 			4,
 		},
 	}
 
 	for i, tt := range tests {
-		tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+		tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 
 		for _, m := range tt.msgs {
 			tt.send(m)
@@ -113,11 +120,11 @@ func TestLogReplication(t *testing.T) {
 
 func TestSingleNodeCommit(t *testing.T) {
 	tt := newNetwork(nil)
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
 
-	sm := tt.peers[0x1000].(*raft)
+	sm := tt.peers[firstId].(*raft)
 	if sm.raftLog.committed != 3 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 3)
 	}
@@ -128,17 +135,17 @@ func TestSingleNodeCommit(t *testing.T) {
 // filtered.
 func TestCannotCommitWithoutNewTermEntry(t *testing.T) {
 	tt := newNetwork(nil, nil, nil, nil, nil)
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 
 	// 0 cannot reach 2,3,4
-	tt.cut(0x1000, 0x1002)
-	tt.cut(0x1000, 0x1003)
-	tt.cut(0x1000, 0x1004)
+	tt.cut(firstId, firstId+2)
+	tt.cut(firstId, firstId+3)
+	tt.cut(firstId, firstId+4)
 
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
 
-	sm := tt.peers[0x1000].(*raft)
+	sm := tt.peers[firstId].(*raft)
 	if sm.raftLog.committed != 1 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 1)
 	}
@@ -149,10 +156,10 @@ func TestCannotCommitWithoutNewTermEntry(t *testing.T) {
 	tt.ignore(msgApp)
 
 	// elect 1 as the new leader with term 2
-	tt.send(pb.Message{From: none, To: 0x1001, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId + 1, Type: msgHup})
 
 	// no log entries from previous term should be committed
-	sm = tt.peers[0x1001].(*raft)
+	sm = tt.peers[firstId+1].(*raft)
 	if sm.raftLog.committed != 1 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 1)
 	}
@@ -162,14 +169,14 @@ func TestCannotCommitWithoutNewTermEntry(t *testing.T) {
 	// send out a heartbeat
 	// after append a ChangeTerm entry from the current term, all entries
 	// should be committed
-	tt.send(pb.Message{From: none, To: 0x1001, Type: msgBeat})
+	tt.send(pb.Message{From: none, To: firstId + 1, Type: msgBeat})
 
 	if sm.raftLog.committed != 4 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 4)
 	}
 
 	// still be able to append a entry
-	tt.send(pb.Message{From: none, To: 0x1001, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId + 1, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
 
 	if sm.raftLog.committed != 5 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 5)
@@ -180,17 +187,17 @@ func TestCannotCommitWithoutNewTermEntry(t *testing.T) {
 // when leader changes, no new proposal comes in.
 func TestCommitWithoutNewTermEntry(t *testing.T) {
 	tt := newNetwork(nil, nil, nil, nil, nil)
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 
 	// 0 cannot reach 2,3,4
-	tt.cut(0x1000, 0x1002)
-	tt.cut(0x1000, 0x1003)
-	tt.cut(0x1000, 0x1004)
+	tt.cut(firstId, firstId+2)
+	tt.cut(firstId, firstId+3)
+	tt.cut(firstId, firstId+4)
 
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: []byte("some data")}}})
 
-	sm := tt.peers[0x1000].(*raft)
+	sm := tt.peers[firstId].(*raft)
 	if sm.raftLog.committed != 1 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 1)
 	}
@@ -201,7 +208,7 @@ func TestCommitWithoutNewTermEntry(t *testing.T) {
 	// elect 1 as the new leader with term 2
 	// after append a ChangeTerm entry from the current term, all entries
 	// should be committed
-	tt.send(pb.Message{From: none, To: 0x1001, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId + 1, Type: msgHup})
 
 	if sm.raftLog.committed != 4 {
 		t.Errorf("committed = %d, want %d", sm.raftLog.committed, 4)
@@ -214,13 +221,13 @@ func TestDuelingCandidates(t *testing.T) {
 	c := newRaft(-1, nil, 0, 0)
 
 	nt := newNetwork(a, b, c)
-	nt.cut(0x1000, 0x1002)
+	nt.cut(firstId, firstId+2)
 
-	nt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
-	nt.send(pb.Message{From: none, To: 0x1002, Type: msgHup})
+	nt.send(pb.Message{From: none, To: firstId, Type: msgHup})
+	nt.send(pb.Message{From: none, To: firstId + 2, Type: msgHup})
 
 	nt.recover()
-	nt.send(pb.Message{From: none, To: 0x1002, Type: msgHup})
+	nt.send(pb.Message{From: none, To: firstId + 2, Type: msgHup})
 
 	wlog := &raftLog{ents: []pb.Entry{{}, pb.Entry{Data: nil, Term: 1, Index: 1}}, committed: 1}
 	tests := []struct {
@@ -242,7 +249,7 @@ func TestDuelingCandidates(t *testing.T) {
 			t.Errorf("#%d: term = %d, want %d", i, g, tt.term)
 		}
 		base := ltoa(tt.raftLog)
-		if sm, ok := nt.peers[int64(0x1000+i)].(*raft); ok {
+		if sm, ok := nt.peers[firstId+int64(i)].(*raft); ok {
 			l := ltoa(sm.raftLog)
 			if g := diffu(base, l); g != "" {
 				t.Errorf("#%d: diff:\n%s", i, g)
@@ -255,19 +262,19 @@ func TestDuelingCandidates(t *testing.T) {
 
 func TestCandidateConcede(t *testing.T) {
 	tt := newNetwork(nil, nil, nil)
-	tt.isolate(0x1000)
+	tt.isolate(firstId)
 
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
-	tt.send(pb.Message{From: none, To: 0x1002, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId + 2, Type: msgHup})
 
 	// heal the partition
 	tt.recover()
 
 	data := []byte("force follower")
 	// send a proposal to 2 to flush out a msgApp to 0
-	tt.send(pb.Message{From: none, To: 0x1002, Type: msgProp, Entries: []pb.Entry{{Data: data}}})
+	tt.send(pb.Message{From: none, To: firstId + 2, Type: msgProp, Entries: []pb.Entry{{Data: data}}})
 
-	a := tt.peers[0x1000].(*raft)
+	a := tt.peers[firstId].(*raft)
 	if g := a.state; g != stateFollower {
 		t.Errorf("state = %s, want %s", g, stateFollower)
 	}
@@ -289,9 +296,9 @@ func TestCandidateConcede(t *testing.T) {
 
 func TestSingleNodeCandidate(t *testing.T) {
 	tt := newNetwork(nil)
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 
-	sm := tt.peers[0x1000].(*raft)
+	sm := tt.peers[firstId].(*raft)
 	if sm.state != stateLeader {
 		t.Errorf("state = %d, want %d", sm.state, stateLeader)
 	}
@@ -300,11 +307,11 @@ func TestSingleNodeCandidate(t *testing.T) {
 func TestOldMessages(t *testing.T) {
 	tt := newNetwork(nil, nil, nil)
 	// make 0 leader @ term 3
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
-	tt.send(pb.Message{From: none, To: 0x1001, Type: msgHup})
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId + 1, Type: msgHup})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 	// pretend we're an old leader trying to make progress
-	tt.send(pb.Message{From: none, To: 0x1000, Type: msgApp, Term: 1, Entries: []pb.Entry{{Term: 1}}})
+	tt.send(pb.Message{From: none, To: firstId, Type: msgApp, Term: 1, Entries: []pb.Entry{{Term: 1}}})
 
 	l := &raftLog{
 		ents: []pb.Entry{
@@ -358,8 +365,8 @@ func TestProposal(t *testing.T) {
 		data := []byte("somedata")
 
 		// promote 0 the leader
-		send(pb.Message{From: none, To: 0x1000, Type: msgHup})
-		send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{Data: data}}})
+		send(pb.Message{From: none, To: firstId, Type: msgHup})
+		send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{Data: data}}})
 
 		wantLog := newLog()
 		if tt.success {
@@ -376,7 +383,7 @@ func TestProposal(t *testing.T) {
 				t.Logf("#%d: empty log", i)
 			}
 		}
-		sm := tt.network.peers[0x1000].(*raft)
+		sm := tt.network.peers[firstId].(*raft)
 		if g := sm.Term; g != 1 {
 			t.Errorf("#%d: term = %d, want %d", i, g, 1)
 		}
@@ -392,10 +399,10 @@ func TestProposalByProxy(t *testing.T) {
 
 	for i, tt := range tests {
 		// promote 0 the leader
-		tt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+		tt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 
 		// propose via follower
-		tt.send(pb.Message{From: none, To: 0x1001, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}})
+		tt.send(pb.Message{From: none, To: firstId + 1, Type: msgProp, Entries: []pb.Entry{{Data: []byte("somedata")}}})
 
 		wantLog := &raftLog{ents: []pb.Entry{{}, {Data: nil, Term: 1, Index: 1}, {Term: 1, Data: data, Index: 2}}, committed: 2}
 		base := ltoa(wantLog)
@@ -409,7 +416,7 @@ func TestProposalByProxy(t *testing.T) {
 				t.Logf("#%d: empty log", i)
 			}
 		}
-		sm := tt.peers[0x1000].(*raft)
+		sm := tt.peers[firstId].(*raft)
 		if g := sm.Term; g != 1 {
 			t.Errorf("#%d: term = %d, want %d", i, g, 1)
 		}
@@ -464,7 +471,7 @@ func TestStepIgnoreOldTermMsg(t *testing.T) {
 	fakeStep := func(r *raft, m pb.Message) {
 		called = true
 	}
-	sm := newRaft(0x1000, []int64{0x1000}, 0, 0)
+	sm := newRaft(firstId, []int64{firstId}, 0, 0)
 	sm.step = fakeStep
 	sm.Term = 2
 	sm.Step(pb.Message{Type: msgApp, Term: sm.Term - 1})
@@ -556,15 +563,15 @@ func TestRecvMsgVote(t *testing.T) {
 		{stateFollower, 3, 2, none, 2},
 		{stateFollower, 3, 3, none, 2},
 
-		{stateFollower, 3, 2, 0x1001, 2},
-		{stateFollower, 3, 2, 0x1000, -1},
+		{stateFollower, 3, 2, firstId + 1, 2},
+		{stateFollower, 3, 2, firstId, -1},
 
-		{stateLeader, 3, 3, 0x1000, -1},
-		{stateCandidate, 3, 3, 0x1000, -1},
+		{stateLeader, 3, 3, firstId, -1},
+		{stateCandidate, 3, 3, firstId, -1},
 	}
 
 	for i, tt := range tests {
-		sm := newRaft(0x1000, []int64{0x1000}, 0, 0)
+		sm := newRaft(firstId, []int64{firstId}, 0, 0)
 		sm.state = tt.state
 		switch tt.state {
 		case stateFollower:
@@ -577,7 +584,7 @@ func TestRecvMsgVote(t *testing.T) {
 		sm.State = pb.State{Vote: tt.voteFor}
 		sm.raftLog = &raftLog{ents: []pb.Entry{{}, {Term: 2}, {Term: 2}}}
 
-		sm.Step(pb.Message{Type: msgVote, From: 0x1001, Index: tt.i, LogTerm: tt.term})
+		sm.Step(pb.Message{Type: msgVote, From: firstId + 1, Index: tt.i, LogTerm: tt.term})
 
 		msgs := sm.ReadMessages()
 		if g := len(msgs); g != 1 {
@@ -604,11 +611,11 @@ func TestStateTransition(t *testing.T) {
 
 		{stateCandidate, stateFollower, true, 0, none},
 		{stateCandidate, stateCandidate, true, 1, none},
-		{stateCandidate, stateLeader, true, 0, 0x1000},
+		{stateCandidate, stateLeader, true, 0, firstId},
 
 		{stateLeader, stateFollower, true, 1, none},
 		{stateLeader, stateCandidate, false, 1, none},
-		{stateLeader, stateLeader, true, 0, 0x1000},
+		{stateLeader, stateLeader, true, 0, firstId},
 	}
 
 	for i, tt := range tests {
@@ -621,7 +628,7 @@ func TestStateTransition(t *testing.T) {
 				}
 			}()
 
-			sm := newRaft(0x1000, []int64{0x1000}, 0, 0)
+			sm := newRaft(firstId, []int64{firstId}, 0, 0)
 			sm.state = tt.from
 
 			switch tt.to {
@@ -660,7 +667,7 @@ func TestAllServerStepdown(t *testing.T) {
 	tterm := int64(3)
 
 	for i, tt := range tests {
-		sm := newRaft(0x1000, []int64{0x1000, 0x1001, 0x1002}, 0, 0)
+		sm := newRaft(firstId, []int64{firstId, firstId + 1, firstId + 2}, 0, 0)
 		switch tt.state {
 		case stateFollower:
 			sm.becomeFollower(1, none)
@@ -672,7 +679,7 @@ func TestAllServerStepdown(t *testing.T) {
 		}
 
 		for j, msgType := range tmsgTypes {
-			sm.Step(pb.Message{From: 0x1001, Type: msgType, Term: tterm, LogTerm: tterm})
+			sm.Step(pb.Message{From: firstId + 1, Type: msgType, Term: tterm, LogTerm: tterm})
 
 			if sm.state != tt.wstate {
 				t.Errorf("#%d.%d state = %v , want %v", i, j, sm.state, tt.wstate)
@@ -683,7 +690,7 @@ func TestAllServerStepdown(t *testing.T) {
 			if int64(len(sm.raftLog.ents)) != tt.windex {
 				t.Errorf("#%d.%d index = %v , want %v", i, j, len(sm.raftLog.ents), tt.windex)
 			}
-			wlead := int64(0x1001)
+			wlead := int64(firstId + 1)
 			if msgType == msgVote {
 				wlead = none
 			}
@@ -708,12 +715,12 @@ func TestLeaderAppResp(t *testing.T) {
 	for i, tt := range tests {
 		// sm term is 1 after it becomes the leader.
 		// thus the last log term must be 1 to be committed.
-		sm := newRaft(0x1000, []int64{0x1000, 0x1001, 0x1002}, 0, 0)
+		sm := newRaft(firstId, []int64{firstId, firstId + 1, firstId + 2}, 0, 0)
 		sm.raftLog = &raftLog{ents: []pb.Entry{{}, {Term: 0}, {Term: 1}}}
 		sm.becomeCandidate()
 		sm.becomeLeader()
 		sm.ReadMessages()
-		sm.Step(pb.Message{From: 0x1001, Type: msgAppResp, Index: tt.index, Term: sm.Term})
+		sm.Step(pb.Message{From: firstId + 1, Type: msgAppResp, Index: tt.index, Term: sm.Term})
 		msgs := sm.ReadMessages()
 
 		if len(msgs) != tt.wmsgNum {
@@ -743,7 +750,7 @@ func TestRecvMsgBeat(t *testing.T) {
 	}
 
 	for i, tt := range tests {
-		sm := newRaft(0x1000, []int64{0x1000, 0x1001, 0x1002}, 0, 0)
+		sm := newRaft(firstId, []int64{firstId, firstId + 1, firstId + 2}, 0, 0)
 		sm.raftLog = &raftLog{ents: []pb.Entry{{}, {Term: 0}, {Term: 1}}}
 		sm.Term = 1
 		sm.state = tt.state
@@ -755,7 +762,7 @@ func TestRecvMsgBeat(t *testing.T) {
 		case stateLeader:
 			sm.step = stepLeader
 		}
-		sm.Step(pb.Message{From: none, To: 0x1000, Type: msgBeat})
+		sm.Step(pb.Message{From: none, To: firstId, Type: msgBeat})
 
 		msgs := sm.ReadMessages()
 		if len(msgs) != tt.wMsg {
@@ -773,10 +780,10 @@ func TestRestore(t *testing.T) {
 	s := pb.Snapshot{
 		Index: defaultCompactThreshold + 1,
 		Term:  defaultCompactThreshold + 1,
-		Nodes: []int64{0x1000, 0x1001, 0x1002},
+		Nodes: []int64{firstId, firstId + 1, firstId + 2},
 	}
 
-	sm := newRaft(0x1000, []int64{0x1000, 0x1001}, 0, 0)
+	sm := newRaft(firstId, []int64{firstId, firstId + 1}, 0, 0)
 	if ok := sm.restore(s); !ok {
 		t.Fatal("restore fail, want succeed")
 	}
@@ -807,9 +814,9 @@ func TestProvideSnap(t *testing.T) {
 	s := pb.Snapshot{
 		Index: defaultCompactThreshold + 1,
 		Term:  defaultCompactThreshold + 1,
-		Nodes: []int64{0x1000, 0x1001},
+		Nodes: []int64{firstId, firstId + 1},
 	}
-	sm := newRaft(0x1000, []int64{0x1000}, 0, 0)
+	sm := newRaft(firstId, []int64{firstId}, 0, 0)
 	// restore the statemachin from a snapshot
 	// so it has a compacted log and a snapshot
 	sm.restore(s)
@@ -817,7 +824,7 @@ func TestProvideSnap(t *testing.T) {
 	sm.becomeCandidate()
 	sm.becomeLeader()
 
-	sm.Step(pb.Message{From: none, To: 0x1000, Type: msgBeat})
+	sm.Step(pb.Message{From: none, To: firstId, Type: msgBeat})
 	msgs := sm.ReadMessages()
 	if len(msgs) != 1 {
 		t.Errorf("len(msgs) = %d, want 1", len(msgs))
@@ -829,9 +836,9 @@ func TestProvideSnap(t *testing.T) {
 
 	// force set the next of node 1, so that
 	// node 1 needs a snapshot
-	sm.prs[0x1001].next = sm.raftLog.offset
+	sm.prs[firstId+1].next = sm.raftLog.offset
 
-	sm.Step(pb.Message{From: 0x1001, To: 0x1000, Type: msgAppResp, Index: -1})
+	sm.Step(pb.Message{From: firstId + 1, To: firstId, Type: msgAppResp, Index: -1})
 	msgs = sm.ReadMessages()
 	if len(msgs) != 1 {
 		t.Errorf("len(msgs) = %d, want 1", len(msgs))
@@ -846,11 +853,11 @@ func TestRestoreFromSnapMsg(t *testing.T) {
 	s := pb.Snapshot{
 		Index: defaultCompactThreshold + 1,
 		Term:  defaultCompactThreshold + 1,
-		Nodes: []int64{0x1000, 0x1001},
+		Nodes: []int64{firstId, firstId + 1},
 	}
-	m := pb.Message{Type: msgSnap, From: 0x1000, Term: 0x1001, Snapshot: s}
+	m := pb.Message{Type: msgSnap, From: firstId, Term: firstId + 1, Snapshot: s}
 
-	sm := newRaft(0x1001, []int64{0x1000, 0x1001}, 0, 0)
+	sm := newRaft(firstId+1, []int64{firstId, firstId + 1}, 0, 0)
 	sm.Step(m)
 
 	if !reflect.DeepEqual(sm.raftLog.snapshot, s) {
@@ -860,26 +867,26 @@ func TestRestoreFromSnapMsg(t *testing.T) {
 
 func TestSlowNodeRestore(t *testing.T) {
 	nt := newNetwork(nil, nil, nil)
-	nt.send(pb.Message{From: none, To: 0x1000, Type: msgHup})
+	nt.send(pb.Message{From: none, To: firstId, Type: msgHup})
 
-	nt.isolate(0x1002)
+	nt.isolate(firstId + 2)
 	for j := 0; j < defaultCompactThreshold+1; j++ {
-		nt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{}}})
+		nt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{}}})
 	}
-	lead := nt.peers[0x1000].(*raft)
+	lead := nt.peers[firstId].(*raft)
 	lead.nextEnts()
 	lead.compact(nil)
 
 	nt.recover()
-	nt.send(pb.Message{From: none, To: 0x1000, Type: msgBeat})
+	nt.send(pb.Message{From: none, To: firstId, Type: msgBeat})
 
-	follower := nt.peers[0x1002].(*raft)
+	follower := nt.peers[firstId+2].(*raft)
 	if !reflect.DeepEqual(follower.raftLog.snapshot, lead.raftLog.snapshot) {
 		t.Errorf("follower.snap = %+v, want %+v", follower.raftLog.snapshot, lead.raftLog.snapshot)
 	}
 
 	committed := follower.raftLog.lastIndex()
-	nt.send(pb.Message{From: none, To: 0x1000, Type: msgProp, Entries: []pb.Entry{{}}})
+	nt.send(pb.Message{From: none, To: firstId, Type: msgProp, Entries: []pb.Entry{{}}})
 	if follower.raftLog.committed != committed+1 {
 		t.Errorf("follower.comitted = %d, want %d", follower.raftLog.committed, committed+1)
 	}
@@ -910,7 +917,7 @@ func newNetwork(peers ...Interface) *network {
 	size := len(peers)
 	peerAddrs := make([]int64, size)
 	for i := 0; i < size; i++ {
-		peerAddrs[i] = int64(0x1000 + i)
+		peerAddrs[i] = firstId + int64(i)
 	}
 
 	npeers := make(map[int64]Interface, size)
@@ -962,7 +969,7 @@ func (nw *network) cut(one, other int64) {
 
 func (nw *network) isolate(id int64) {
 	for i := 0; i < len(nw.peers); i++ {
-		nid := int64(0x1000 + i)
+		nid := firstId + int64(i)
 		if nid != id {
 			nw.drop(id, nid, 1.0)
 			nw.drop(nid, id, 1.0)