forked from purpleidea/mgmt
-
Notifications
You must be signed in to change notification settings - Fork 0
/
rrstrategy.go
84 lines (71 loc) · 2.5 KB
/
rrstrategy.go
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
77
78
79
80
81
82
83
84
// Mgmt
// Copyright (C) 2013-2018+ James Shubin and the project contributors
// Written by James Shubin <james@shubin.ca> and the project contributors
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
package scheduler // TODO: i'd like this to be a separate package, but cycles!
import (
"fmt"
"sort"
"github.com/purpleidea/mgmt/util"
)
func init() {
Register("rr", func() Strategy { return &rrStrategy{} }) // must register the func and name
}
type rrStrategy struct {
// some stored state
hosts []string
}
// Schedule returns hosts in round robin style from the available hostnames.
func (obj *rrStrategy) Schedule(hostnames map[string]string, opts *schedulerOptions) ([]string, error) {
if len(hostnames) <= 0 {
return nil, fmt.Errorf("strategy: cannot schedule from zero hosts")
}
if opts.maxCount <= 0 {
return nil, fmt.Errorf("strategy: cannot schedule with a max of zero")
}
// always get a deterministic list of current hosts first...
sortedHosts := []string{}
for key := range hostnames {
sortedHosts = append(sortedHosts, key)
}
sort.Strings(sortedHosts)
if obj.hosts == nil {
obj.hosts = []string{} // initialize if needed
}
// add any new hosts we learned about, to the end of the list
for _, x := range sortedHosts {
if !util.StrInList(x, obj.hosts) {
obj.hosts = append(obj.hosts, x)
}
}
// remove any hosts we previouly knew about from the list
for ix := len(obj.hosts) - 1; ix >= 0; ix-- {
if !util.StrInList(obj.hosts[ix], sortedHosts) {
// delete entry at this index
obj.hosts = append(obj.hosts[:ix], obj.hosts[ix+1:]...)
}
}
// get the maximum number of hosts to return
max := len(obj.hosts) // can't return more than we have
if opts.maxCount < max { // found a smaller limit
max = opts.maxCount
}
result := []string{}
// now return the number of needed hosts from the list
for i := 0; i < max; i++ {
result = append(result, obj.hosts[i])
}
return result, nil
}