File: logs.go

package info (click to toggle)
golang-github-canonicalltd-raft-test 0.0~git20180628.c3345b5-1
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 284 kB
  • sloc: makefile: 2
file content (76 lines) | stat: -rw-r--r-- 2,019 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
// Copyright 2017 Canonical Ltd.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

package network

import (
	"fmt"
	"strings"

	"github.com/hashicorp/raft"
)

// Return a string representation of the given log entries.
func stringifyLogs(logs []*raft.Log) string {
	n := len(logs)
	description := fmt.Sprintf("%d ", n)
	if n == 1 {
		description += "entry"
	} else {
		description += "entries"
	}

	if n > 0 {
		entries := make([]string, n)
		for i, log := range logs {
			name := "Other"
			switch log.Type {
			case raft.LogCommand:
				name = "Command"
			case raft.LogNoop:
				name = "Noop"
			}
			entries[i] = fmt.Sprintf("%s:term=%d,index=%d", name, log.Term, log.Index)
		}
		description += fmt.Sprintf(" [%s]", strings.Join(entries, " "))
	}

	return description
}

// This function takes a set of log entries that have been successfully
// appended to a peer and filters out any log entry with an older term relative
// to the others.
//
// The returned entries are guaranted to have the same term and that term is
// the highest among the ones in this batch.
func filterLogsWithOlderTerms(logs []*raft.Log) []*raft.Log {
	// Find the highest term.
	var highestTerm uint64
	for _, log := range logs {
		if log.Term > highestTerm {
			highestTerm = log.Term
		}
	}

	// Discard any log with an older term than the highest one.
	filteredLogs := make([]*raft.Log, 0)
	for _, log := range logs {
		if log.Term == highestTerm {
			filteredLogs = append(filteredLogs, log)
		}
	}

	return filteredLogs
}