├── .gitignore
├── main.go
├── .travis.yml
├── strategy
├── first
│ ├── first_config.go
│ ├── first_config_test.go
│ ├── first_test.go
│ └── first.go
└── random
│ ├── random_test.go
│ └── random.go
├── dns
├── api.go
├── dns_test.go
└── lib.go
├── lb
├── config.go
├── generic_lb.go
├── roundrobin_test.go
├── lb.go
├── lb_test.go
└── roundrobin.go
├── strategy_test.go
├── README.md
└── LICENSE
/.gitignore:
--------------------------------------------------------------------------------
1 | demo
2 | dns-clb
3 |
--------------------------------------------------------------------------------
/main.go:
--------------------------------------------------------------------------------
1 | package main
2 |
3 | func main() {
4 | }
5 |
--------------------------------------------------------------------------------
/.travis.yml:
--------------------------------------------------------------------------------
1 | language: go
2 |
3 | go:
4 | - 1.7
5 | - 1.8
6 | - 1.9
7 | - tip
8 |
9 |
10 | install:
11 | - go get -t ./...
12 |
13 | script:
14 | - go test ./...
15 |
--------------------------------------------------------------------------------
/strategy/first/first_config.go:
--------------------------------------------------------------------------------
1 | package first
2 |
3 | import "github.com/benschw/srv-lb/lb"
4 |
5 | func Config() (*lb.Config, error) {
6 | config, err := lb.DefaultConfig()
7 |
8 | if err == nil {
9 | config.Strategy = FirstStrategy
10 | }
11 |
12 | return config, err
13 | }
14 |
--------------------------------------------------------------------------------
/strategy/first/first_config_test.go:
--------------------------------------------------------------------------------
1 | package first
2 |
3 | import (
4 | "testing"
5 |
6 | "github.com/stretchr/testify/assert"
7 | )
8 |
9 | func TestFirstConfig(t *testing.T) {
10 | cfg, err := Config()
11 |
12 | assert.NoError(t, err)
13 | assert.Equal(t, FirstStrategy, cfg.Strategy, "should be equal")
14 | }
15 |
--------------------------------------------------------------------------------
/dns/api.go:
--------------------------------------------------------------------------------
1 | package dns
2 |
3 | import (
4 | "fmt"
5 | "net"
6 | )
7 |
8 | type ByTarget []net.SRV
9 |
10 | func (a ByTarget) Len() int { return len(a) }
11 | func (a ByTarget) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
12 | func (a ByTarget) Less(i, j int) bool { return a[i].Target < a[j].Target }
13 |
14 | type Address struct {
15 | Address string
16 | Port uint16
17 | }
18 |
19 | func (a Address) String() string {
20 | return fmt.Sprintf("%s:%d", a.Address, a.Port)
21 | }
22 |
--------------------------------------------------------------------------------
/lb/config.go:
--------------------------------------------------------------------------------
1 | package lb
2 |
3 | import (
4 | "os"
5 |
6 | "github.com/benschw/srv-lb/dns"
7 | )
8 |
9 | type Config struct {
10 | Dns dns.Lookup
11 | Strategy StrategyType
12 | }
13 |
14 | func DefaultConfig() (*Config, error) {
15 | var dnsLib dns.Lookup
16 |
17 | if dnsHost := os.Getenv("SRVLB_HOST"); dnsHost != "" {
18 | dnsLib = dns.NewLookupLib(dnsHost)
19 | } else {
20 | lib, err := dns.NewDefaultLookupLib()
21 | if err != nil {
22 | return nil, err
23 | }
24 | dnsLib = lib
25 | }
26 |
27 | return &Config{
28 | Dns: dnsLib,
29 | Strategy: RoundRobinStrategy,
30 | }, nil
31 | }
32 |
--------------------------------------------------------------------------------
/strategy/first/first_test.go:
--------------------------------------------------------------------------------
1 | package first
2 |
3 | import (
4 | "testing"
5 |
6 | "github.com/benschw/srv-lb/dns"
7 | "github.com/stretchr/testify/assert"
8 | )
9 |
10 | func TestFirstLookup(t *testing.T) {
11 | lib, err := dns.NewDefaultLookupLib()
12 | assert.Nil(t, err)
13 |
14 | // given
15 | srvName := "foo.service.fligl.io"
16 | c := New(lib)
17 |
18 | // when
19 | address, err := c.Next(srvName)
20 |
21 | // then
22 | assert.Nil(t, err)
23 |
24 | if address.Port == 8001 && address.Address == "0.1.2.3" {
25 | return
26 | } else if address.Port == 8002 && address.Address == "4.5.6.7" {
27 | return
28 | } else {
29 | t.Errorf("port '%d' not expected with address: '%s'", address.Port, address.Address)
30 | }
31 |
32 | }
33 |
--------------------------------------------------------------------------------
/strategy/first/first.go:
--------------------------------------------------------------------------------
1 | package first
2 |
3 | import (
4 | "github.com/benschw/srv-lb/dns"
5 | "github.com/benschw/srv-lb/lb"
6 | )
7 |
8 | const FirstStrategy lb.StrategyType = "first"
9 |
10 | func New(lib dns.Lookup) lb.GenericLoadBalancer {
11 | return &FirstClb{lib}
12 | }
13 |
14 | type FirstClb struct {
15 | dnsLib dns.Lookup
16 | }
17 |
18 | func (lb *FirstClb) Next(name string) (dns.Address, error) {
19 | var add dns.Address
20 |
21 | srvs, err := lb.dnsLib.LookupSRV(name)
22 | if err != nil {
23 | return add, err
24 | }
25 |
26 | ip, err := lb.dnsLib.LookupA(srvs[0].Target)
27 | if err != nil {
28 | return add, err
29 | }
30 |
31 | return dns.Address{Address: ip, Port: srvs[0].Port}, nil
32 | }
33 |
34 | func init() {
35 | lb.RegisterStrategy(FirstStrategy, New)
36 | }
37 |
--------------------------------------------------------------------------------
/lb/generic_lb.go:
--------------------------------------------------------------------------------
1 | package lb
2 |
3 | import "github.com/benschw/srv-lb/dns"
4 |
5 | type StrategyType string
6 | type StrategyFactory func(dns.Lookup) GenericLoadBalancer
7 |
8 | var strategyReg map[StrategyType]StrategyFactory
9 |
10 | func RegisterStrategy(strategy StrategyType, factory StrategyFactory) {
11 | strategyReg[strategy] = factory
12 | }
13 |
14 | // Load balancer that can service request for any SRV record address
15 | type GenericLoadBalancer interface {
16 | Next(name string) (dns.Address, error)
17 | }
18 |
19 | func NewGeneric(cfg *Config) GenericLoadBalancer {
20 | if _, ok := strategyReg[cfg.Strategy]; !ok {
21 | panic("Unknown load balancer strategy")
22 | }
23 | return strategyReg[cfg.Strategy](cfg.Dns)
24 | }
25 |
26 | func init() {
27 | strategyReg = make(map[StrategyType]StrategyFactory)
28 | RegisterStrategy(RoundRobinStrategy, NewRoundRobinStrategy)
29 | }
30 |
--------------------------------------------------------------------------------
/lb/roundrobin_test.go:
--------------------------------------------------------------------------------
1 | package lb
2 |
3 | import (
4 | "fmt"
5 | "log"
6 | "testing"
7 |
8 | "github.com/benschw/srv-lb/dns"
9 | "github.com/stretchr/testify/assert"
10 | )
11 |
12 | var _ = fmt.Print // For debugging; delete when done.
13 | var _ = log.Print // For debugging; delete when done.
14 |
15 | func TestRoundRobinLookup(t *testing.T) {
16 | lib, err := dns.NewDefaultLookupLib()
17 | assert.Nil(t, err)
18 |
19 | // given
20 | srvName := "foo.service.fligl.io"
21 | c := NewRoundRobinStrategy(lib)
22 |
23 | // when
24 | address, err := c.Next(srvName)
25 |
26 | // then
27 | assert.Nil(t, err)
28 |
29 | if address.Port == 8001 && address.Address == "0.1.2.3" {
30 | return
31 | } else if address.Port == 8002 && address.Address == "4.5.6.7" {
32 | return
33 | } else {
34 | t.Errorf("port '%d' not expected with address: '%s'", address.Port, address.Address)
35 | }
36 |
37 | }
38 |
--------------------------------------------------------------------------------
/lb/lb.go:
--------------------------------------------------------------------------------
1 | package lb
2 |
3 | import "github.com/benschw/srv-lb/dns"
4 |
5 | // Load balancer that can service request for a configured SRV record address
6 | type LoadBalancer interface {
7 | Next() (dns.Address, error)
8 | }
9 |
10 | func New(cfg *Config, address string) LoadBalancer {
11 | return &SRVLoadBalancer{
12 | Lb: NewGeneric(cfg),
13 | Address: address,
14 | }
15 | }
16 |
17 | // Default implementation for load balancing on a SRV record
18 | type SRVLoadBalancer struct {
19 | Lb GenericLoadBalancer
20 | Address string
21 | }
22 |
23 | func (s *SRVLoadBalancer) Next() (dns.Address, error) {
24 | return s.Lb.Next(s.Address)
25 | }
26 |
27 | // Specify an address to always return (good for compatibility and in test)
28 | type StaticLoadBalancer struct {
29 | Address dns.Address
30 | }
31 |
32 | func (s *StaticLoadBalancer) Next() (dns.Address, error) {
33 | return s.Address, nil
34 | }
35 |
--------------------------------------------------------------------------------
/strategy/random/random_test.go:
--------------------------------------------------------------------------------
1 | package random
2 |
3 | import (
4 | "fmt"
5 | "log"
6 | "testing"
7 |
8 | "github.com/benschw/srv-lb/dns"
9 | "github.com/stretchr/testify/assert"
10 | )
11 |
12 | var _ = fmt.Print // For debugging; delete when done.
13 | var _ = log.Print // For debugging; delete when done.
14 |
15 | //strconv.FormatInt(int64(srv.Port), 10)
16 | func TestRandomLookup(t *testing.T) {
17 | lib, err := dns.NewDefaultLookupLib()
18 | assert.Nil(t, err)
19 |
20 | // given
21 | srvName := "foo.service.fligl.io"
22 | c := New(lib)
23 |
24 | // when
25 | address, err := c.Next(srvName)
26 |
27 | // then
28 | assert.Nil(t, err)
29 |
30 | if address.Port == 8001 && address.Address == "0.1.2.3" {
31 | return
32 | } else if address.Port == 8002 && address.Address == "4.5.6.7" {
33 | return
34 | } else {
35 | t.Errorf("port '%d' not expected with address: '%s'", address.Port, address.Address)
36 | }
37 | }
38 |
--------------------------------------------------------------------------------
/strategy/random/random.go:
--------------------------------------------------------------------------------
1 | package random
2 |
3 | import (
4 | "fmt"
5 | "math/rand"
6 |
7 | "github.com/benschw/srv-lb/dns"
8 | "github.com/benschw/srv-lb/lb"
9 | )
10 |
11 | const RandomStrategy lb.StrategyType = "random"
12 |
13 | func New(lib dns.Lookup) lb.GenericLoadBalancer {
14 | lb := new(RandomClb)
15 | lb.dnsLib = lib
16 | return lb
17 | }
18 |
19 | type RandomClb struct {
20 | dnsLib dns.Lookup
21 | }
22 |
23 | func (lb *RandomClb) Next(name string) (dns.Address, error) {
24 | add := dns.Address{}
25 |
26 | srvs, err := lb.dnsLib.LookupSRV(name)
27 | if err != nil {
28 | return add, err
29 | }
30 | if len(srvs) == 0 {
31 | return add, fmt.Errorf("no SRV records found")
32 | }
33 |
34 | // log.Printf("%+v", srvs)
35 | srv := srvs[rand.Intn(len(srvs))]
36 |
37 | ip, err := lb.dnsLib.LookupA(srv.Target)
38 | if err != nil {
39 | return add, err
40 | }
41 |
42 | return dns.Address{Address: ip, Port: srv.Port}, nil
43 | }
44 |
45 | func init() {
46 | lb.RegisterStrategy(RandomStrategy, New)
47 | }
48 |
--------------------------------------------------------------------------------
/lb/lb_test.go:
--------------------------------------------------------------------------------
1 | package lb
2 |
3 | import (
4 | "fmt"
5 | "sort"
6 |
7 | "github.com/benschw/srv-lb/dns"
8 | )
9 |
10 | type ByConnectionString []dns.Address
11 |
12 | func (a ByConnectionString) Len() int { return len(a) }
13 | func (a ByConnectionString) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
14 | func (a ByConnectionString) Less(i, j int) bool {
15 | if a[i].Address == a[j].Address {
16 | return a[i].Port < a[j].Port
17 | }
18 | return a[i].Address < a[j].Address
19 | }
20 |
21 | // Example load balancer with defaults
22 | func ExampleNew() {
23 | cfg, err := DefaultConfig()
24 | if err != nil {
25 | panic(err)
26 | }
27 | lb := New(cfg, "foo.service.fligl.io")
28 |
29 | add1, err := lb.Next()
30 | if err != nil {
31 | panic(err)
32 | }
33 | add2, err := lb.Next()
34 | if err != nil {
35 | panic(err)
36 | }
37 |
38 | adds := []dns.Address{add1, add2}
39 | sort.Sort(ByConnectionString(adds))
40 |
41 | fmt.Printf("%s\n%s", adds[0], adds[1])
42 | // Output:
43 | // 0.1.2.3:8001
44 | // 4.5.6.7:8002
45 | }
46 |
47 | // Example of using a generic load balancer
48 | func ExampleNewGeneric() {
49 | srvName := "foo.service.fligl.io"
50 | cfg, err := DefaultConfig()
51 | if err != nil {
52 | panic(err)
53 | }
54 | lb := NewGeneric(cfg)
55 |
56 | add1, err := lb.Next(srvName)
57 | if err != nil {
58 | panic(err)
59 | }
60 | add2, err := lb.Next(srvName)
61 | if err != nil {
62 | panic(err)
63 | }
64 |
65 | adds := []dns.Address{add1, add2}
66 | sort.Sort(ByConnectionString(adds))
67 |
68 | fmt.Printf("%s\n%s", adds[0], adds[1])
69 | // Output:
70 | // 0.1.2.3:8001
71 | // 4.5.6.7:8002
72 | }
73 |
--------------------------------------------------------------------------------
/strategy_test.go:
--------------------------------------------------------------------------------
1 | package main
2 |
3 | import (
4 | "sort"
5 | "testing"
6 |
7 | "github.com/benschw/srv-lb/dns"
8 | "github.com/benschw/srv-lb/lb"
9 | "github.com/benschw/srv-lb/strategy/first"
10 | "github.com/benschw/srv-lb/strategy/random"
11 | "github.com/stretchr/testify/assert"
12 | )
13 |
14 | type ByConnectionString []dns.Address
15 |
16 | func (a ByConnectionString) Len() int { return len(a) }
17 | func (a ByConnectionString) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
18 | func (a ByConnectionString) Less(i, j int) bool {
19 | if a[i].Address == a[j].Address {
20 | return a[i].Port < a[j].Port
21 | }
22 | return a[i].Address < a[j].Address
23 | }
24 |
25 | func TestRoundRobinStrategy(t *testing.T) {
26 | lib, err := dns.NewDefaultLookupLib()
27 | assert.Nil(t, err)
28 |
29 | //given
30 | c := lb.NewGeneric(&lb.Config{
31 | Dns: lib,
32 | Strategy: lb.RoundRobinStrategy,
33 | })
34 |
35 | // when
36 | srvName := "foo.service.fligl.io"
37 | add1, err1 := c.Next(srvName)
38 | add2, err2 := c.Next(srvName)
39 |
40 | // then
41 | assert.Nil(t, err1)
42 | assert.Nil(t, err2)
43 |
44 | adds := []dns.Address{add1, add2}
45 | sort.Sort(ByConnectionString(adds))
46 |
47 | expected := []dns.Address{dns.Address{Address: "0.1.2.3", Port: 8001}, dns.Address{Address: "4.5.6.7", Port: 8002}}
48 | assert.Equal(t, expected, adds, "unexpected results")
49 | }
50 |
51 | func TestRandomStrategy(t *testing.T) {
52 | lib, err := dns.NewDefaultLookupLib()
53 | assert.Nil(t, err)
54 |
55 | //given
56 | c := lb.NewGeneric(&lb.Config{
57 | Dns: lib,
58 | Strategy: random.RandomStrategy,
59 | })
60 |
61 | // when
62 | srvName := "foo.service.fligl.io"
63 | _, err = c.Next(srvName)
64 |
65 | // then
66 | assert.Nil(t, err)
67 | }
68 |
69 | func TestFirstStrategy(t *testing.T) {
70 | lib, err := dns.NewDefaultLookupLib()
71 | assert.Nil(t, err)
72 |
73 | //given
74 | c := lb.NewGeneric(&lb.Config{
75 | Dns: lib,
76 | Strategy: first.FirstStrategy,
77 | })
78 |
79 | // when
80 | srvName := "foo.service.fligl.io"
81 | add1, err1 := c.Next(srvName)
82 | add2, err2 := c.Next(srvName)
83 |
84 | // then
85 | assert.Nil(t, err1)
86 | assert.Nil(t, err2)
87 |
88 | assert.NotEqual(t, add1, add2)
89 | }
90 |
--------------------------------------------------------------------------------
/dns/dns_test.go:
--------------------------------------------------------------------------------
1 | package dns
2 |
3 | import (
4 | "net"
5 | "sort"
6 | "testing"
7 |
8 | "github.com/miekg/dns"
9 | "github.com/stretchr/testify/assert"
10 | )
11 |
12 | func TestLookupShouldFailWithBadNS(t *testing.T) {
13 | lib := NewLookupLib("foo:9999")
14 |
15 | _, err := lib.LookupA("foo")
16 |
17 | assert.NotNil(t, err)
18 | }
19 |
20 | func TestLookupShouldFailWithBadHost(t *testing.T) {
21 | lib := NewLookupLib("8.8.8.8:53")
22 |
23 | _, err := lib.LookupA("foo")
24 |
25 | assert.NotNil(t, err)
26 | }
27 |
28 | func TestLookupShouldResolveARecord(t *testing.T) {
29 | lib := NewLookupLib("8.8.8.8:53")
30 |
31 | address, err := lib.LookupA("github.com")
32 |
33 | assert.Nil(t, err)
34 |
35 | ip := net.ParseIP(address)
36 | assert.NotNil(t, ip.To4())
37 | }
38 |
39 | func TestClientConfigLookupA(t *testing.T) {
40 | lib, err := NewClientConfigLookupLib(&predictableClientConfig{})
41 | assert.Nil(t, err)
42 |
43 | address, err := lib.LookupA("github.com")
44 |
45 | assert.Nil(t, err)
46 |
47 | ip := net.ParseIP(address)
48 | assert.NotNil(t, ip.To4())
49 | }
50 |
51 | func TestDefaultLookupSRV(t *testing.T) {
52 | lib, err := NewClientConfigLookupLib(&predictableClientConfig{})
53 | assert.Nil(t, err)
54 |
55 | addresses, err := lib.LookupSRV("foo.service.fligl.io")
56 |
57 | assert.Nil(t, err)
58 |
59 | sort.Sort(ByTarget(addresses))
60 |
61 | assert.Equal(t, 2, len(addresses), "should be two results")
62 | assert.Equal(t, "foo1.fligl.io.", addresses[0].Target, "Unexpected Result")
63 | assert.Equal(t, "foo2.fligl.io.", addresses[1].Target, "Unexpected Result")
64 | }
65 |
66 | func TestLookUpShouldSkipBadNS(t *testing.T) {
67 | lib, err := NewClientConfigLookupLib(&firstNSBadClientConfig{})
68 |
69 | assert.Nil(t, err)
70 |
71 | address, err := lib.LookupA("github.com")
72 |
73 | assert.Nil(t, err)
74 |
75 | ip := net.ParseIP(address)
76 | assert.NotNil(t, ip.To4())
77 | }
78 |
79 | type predictableClientConfig struct{}
80 |
81 | func (c *predictableClientConfig) Get() (*dns.ClientConfig, error) {
82 | return &dns.ClientConfig{
83 | Servers: []string{"8.8.8.8", "8.8.4.4"},
84 | Port: "53",
85 | }, nil
86 | }
87 |
88 | type firstNSBadClientConfig struct{}
89 |
90 | func (c *firstNSBadClientConfig) Get() (*dns.ClientConfig, error) {
91 | return &dns.ClientConfig{
92 | Servers: []string{"foo", "8.8.8.8"},
93 | Port: "53",
94 | }, nil
95 | }
96 |
--------------------------------------------------------------------------------
/lb/roundrobin.go:
--------------------------------------------------------------------------------
1 | package lb
2 |
3 | import (
4 | "fmt"
5 | "net"
6 | "sort"
7 | "sync"
8 |
9 | "github.com/benschw/srv-lb/dns"
10 | )
11 |
12 | const RoundRobinStrategy StrategyType = "round-robin"
13 |
14 | func NewRoundRobinStrategy(lib dns.Lookup) GenericLoadBalancer {
15 | return &RoundRobinClb{
16 | dnsLib: lib,
17 | cache: NewCache(),
18 | }
19 | }
20 |
21 | type RoundRobinClb struct {
22 | dnsLib dns.Lookup
23 | cache *ResultCache
24 | }
25 |
26 | func (lb *RoundRobinClb) Next(name string) (dns.Address, error) {
27 | var add dns.Address
28 |
29 | srvs, err := lb.dnsLib.LookupSRV(name)
30 | if err != nil {
31 | return add, err
32 | }
33 |
34 | srv, err := lb.cache.Next(name, srvs)
35 | if err != nil {
36 | return add, err
37 | }
38 |
39 | ip, err := lb.dnsLib.LookupA(srv.Target)
40 | if err != nil {
41 | return add, err
42 | }
43 |
44 | return dns.Address{Address: ip, Port: srv.Port}, nil
45 | }
46 |
47 | type AddressResult struct {
48 | srvs []net.SRV
49 | i int
50 | }
51 |
52 | type ResultCache struct {
53 | m map[string]*AddressResult
54 | sync.RWMutex
55 | }
56 |
57 | func NewCache() *ResultCache {
58 | return &ResultCache{
59 | m: make(map[string]*AddressResult),
60 | }
61 | }
62 |
63 | func (s *ResultCache) Next(key string, srvs []net.SRV) (net.SRV, error) {
64 | s.Lock()
65 | defer s.Unlock()
66 |
67 | s.applyResults(key, srvs)
68 |
69 | return s.getNextResult(key)
70 | }
71 |
72 | func (s *ResultCache) applyResults(key string, srvs []net.SRV) {
73 | old, ok := s.m[key]
74 | if !ok {
75 | old = &AddressResult{
76 | srvs: make([]net.SRV, 0),
77 | i: 0,
78 | }
79 | s.m[key] = old
80 | }
81 | ordered, changed := s.mergeResults(old.srvs, srvs)
82 | if changed {
83 | s.m[key].srvs = ordered
84 | s.m[key].i = 0
85 | }
86 | }
87 |
88 | func (s *ResultCache) mergeResults(oldResults []net.SRV, newResults []net.SRV) ([]net.SRV, bool) {
89 | sort.Sort(dns.ByTarget(newResults))
90 |
91 | if len(oldResults) != len(newResults) {
92 | return newResults, true
93 | }
94 |
95 | for i, val := range oldResults {
96 | if newResults[i] != val {
97 | return newResults, true
98 | }
99 | }
100 |
101 | return newResults, false
102 | }
103 |
104 | func (s *ResultCache) getNextResult(key string) (net.SRV, error) {
105 | var srv net.SRV
106 |
107 | srvs := s.m[key].srvs
108 | i := s.m[key].i
109 |
110 | if len(srvs) == 0 {
111 | return srv, fmt.Errorf("no results found for '%s'", key)
112 | }
113 |
114 | if len(srvs) <= i {
115 | i = i % len(srvs)
116 | }
117 |
118 | srv = srvs[i]
119 | s.m[key].i = i + 1
120 |
121 | return srv, nil
122 | }
123 |
--------------------------------------------------------------------------------
/dns/lib.go:
--------------------------------------------------------------------------------
1 | package dns
2 |
3 | import (
4 | "errors"
5 | "fmt"
6 | "net"
7 |
8 | "github.com/miekg/dns"
9 | )
10 |
11 | type Lookup interface {
12 | LookupSRV(name string) ([]net.SRV, error)
13 | LookupA(name string) (string, error)
14 | }
15 |
16 | type ClientConfig interface {
17 | Get() (*dns.ClientConfig, error)
18 | }
19 |
20 | type ResolvConfClientConfig struct {
21 | File string
22 | }
23 |
24 | func (f *ResolvConfClientConfig) Get() (*dns.ClientConfig, error) {
25 | return dns.ClientConfigFromFile(f.File)
26 | }
27 |
28 | func NewDefaultLookupLib() (Lookup, error) {
29 | return NewClientConfigLookupLib(&ResolvConfClientConfig{"/etc/resolv.conf"})
30 | }
31 |
32 | func NewClientConfigLookupLib(cfg ClientConfig) (Lookup, error) {
33 | config, err := cfg.Get()
34 | if err != nil {
35 | return nil, err
36 | }
37 | l := new(lookupLib)
38 | l.servers = make([]string, len(config.Servers))
39 | for i, s := range config.Servers {
40 | l.servers[i] = s + ":" + config.Port
41 | }
42 | return l, nil
43 | }
44 |
45 | func NewLookupLib(serverString string) Lookup {
46 | l := new(lookupLib)
47 | l.servers = []string{serverString}
48 | return l
49 | }
50 |
51 | type lookupLib struct {
52 | servers []string
53 | }
54 |
55 | func (l *lookupLib) LookupSRV(name string) ([]net.SRV, error) {
56 | var srvs = make([]net.SRV, 0)
57 | answer, err := l.lookupType(name, "SRV")
58 | if err != nil {
59 | return srvs, err
60 | }
61 | return l.parseSRVAnswer(answer)
62 | }
63 |
64 | func (l *lookupLib) LookupA(name string) (string, error) {
65 | answer, err := l.lookupType(name, "A")
66 | if err != nil {
67 | return "", err
68 | }
69 | return l.parseAAnswer(answer)
70 | }
71 |
72 | func (l *lookupLib) parseSRVAnswer(answer *dns.Msg) ([]net.SRV, error) {
73 | var srvs = make([]net.SRV, 0)
74 | for _, v := range answer.Answer {
75 | if srv, ok := v.(*dns.SRV); ok {
76 | srvs = append(srvs, net.SRV{
77 | Priority: srv.Priority,
78 | Weight: srv.Weight,
79 | Port: srv.Port,
80 | Target: srv.Target,
81 | })
82 | }
83 | }
84 | return srvs, nil
85 | }
86 |
87 | func (l *lookupLib) parseAAnswer(answer *dns.Msg) (string, error) {
88 | if len(answer.Answer) == 0 {
89 | return "", fmt.Errorf("Answer Empty")
90 | }
91 | if a, ok := answer.Answer[0].(*dns.A); ok {
92 |
93 | return a.A.String(), nil
94 |
95 | // return string(a.A[:n]), nil
96 | }
97 | return "", fmt.Errorf("Could not parse A record")
98 | }
99 |
100 | func (l *lookupLib) lookupType(name string, recordType string) (*dns.Msg, error) {
101 | if len(l.servers) < 1 {
102 | return nil, errors.New("No DNS servers configured")
103 | }
104 |
105 | var err error
106 | for _, s := range l.servers {
107 | // try a connection with a udp connection first
108 | var msg *dns.Msg
109 | msg, err = lookup(s, name, recordType, "")
110 | if err == nil {
111 | return msg, nil
112 | }
113 | }
114 | // Returns the last error we encountered.
115 | return nil, err
116 | }
117 |
118 | func lookup(server, name string, recordType string, connType string) (*dns.Msg, error) {
119 | qType, ok := dns.StringToType[recordType]
120 | if !ok {
121 | return nil, fmt.Errorf("Invalid type '%s'", recordType)
122 | }
123 | name = dns.Fqdn(name)
124 |
125 | client := &dns.Client{Net: connType}
126 |
127 | msg := &dns.Msg{}
128 | msg.SetQuestion(name, qType)
129 |
130 | response, _, err := client.Exchange(msg, server)
131 |
132 | if err != nil {
133 | if connType == "" {
134 | // retry lookup with a tcp connection
135 | return lookup(server, name, recordType, "tcp")
136 | } else {
137 | return nil, fmt.Errorf("Couldn't resolve name '%s'", name)
138 | }
139 | }
140 |
141 | if msg.Id != response.Id {
142 | return nil, fmt.Errorf("DNS ID mismatch, request: %d, response: %d", msg.Id, response.Id)
143 | }
144 |
145 | return response, nil
146 | }
147 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | [](https://travis-ci.org/benschw/srv-lb)
2 | [](http://godoc.org/github.com/benschw/srv-lb/lb)
3 |
4 |
5 | # SRV Record Load Balancer library for Go
6 |
7 | _SRV-LB_ is a load balancer library designed for use with service discovery solutions
8 | that expose an interface through DNS SRV records
9 | (e.g. [consul](https://consul.io/) or [skyDNS](https://github.com/skynetservices/skydns))
10 |
11 |
12 | The library selects a `SRV` record answer according to specified load balancer algorithm,
13 | resolves its `A` record to an ip, and returns an `Address` structure:
14 |
15 | type Address struct {
16 | Address string
17 | Port uint16
18 | }
19 |
20 |
21 | To select a DNS server you can use the value from your system's `resolv.conf` (the default),
22 | specify it explicitly when configuring the library,
23 | or set it as an ENV variable (e.g. `SRVLB_HOST=127.0.0.1:8600` to connect to a local consul agent) at run time.
24 |
25 |
26 | The library defaults to use a "Round Robin" algorithm, but you can specify another or build your own (see below).
27 |
28 |
29 | ## Example:
30 | ### Default Load Balancer
31 |
32 | srvName := "foo.service.fligl.io"
33 | cfg, err := lb.DefaultConfig()
34 | if err != nil {
35 | panic(err)
36 | }
37 |
38 | l := lb.New(cfg, srvName)
39 |
40 | address, err := l.Next()
41 | if err != nil {
42 | panic(err)
43 | }
44 |
45 | fmt.Printf("%s", address.String())
46 | // Output: 0.1.2.3:8001
47 |
48 | - Uses dns server configured in `/etc/resolv.conf`
49 | - Uses round robin strategy
50 |
51 |
52 | ### or build a generic load balancer
53 |
54 | srvName := "foo.service.fligl.io"
55 | cfg, err := lb.DefaultConfig()
56 | if err != nil {
57 | panic(err)
58 | }
59 |
60 | l := lb.NewGeneric(cfg)
61 |
62 | address, err := l.Next(srvName)
63 | if err != nil {
64 | panic(err)
65 | }
66 |
67 | fmt.Printf("%s", address.String())
68 | // Output: 0.1.2.3:8001
69 |
70 | ### or configure explicitly
71 |
72 | srvName := "foo.service.fligl.io"
73 | cfg := &lb.Config{
74 | Dns: dns.NewLookupLib("127.0.0.1:8600"),
75 | Strategy: random.RandomStrategy,
76 | }
77 | l := lb.New(cfg, srvName)
78 |
79 | address, err := l.Next()
80 | if err != nil {
81 | panic(err)
82 | }
83 |
84 | fmt.Printf("%s", address.String())
85 | // Output: 0.1.2.3:8001
86 |
87 |
88 |
89 | ## Development
90 | tests are run against some fixture dns entries I set up on fligl.io (`dig foo.service.fligl.io SRV`).
91 |
92 | go get -u -t ./...
93 | go test ./...
94 |
95 |
96 | ## Build your own load balancing strategy
97 |
98 | `srv-lb` leverages go's `init()` function to allow you to use your own
99 | load balancer strategy without forking the core library. Below is a walkthrough
100 | of how to create your own "FancyLB" strategy. For a complete example,
101 | [see how the "random" strategy is implemented](https://github.com/benschw/srv-lb/blob/master/strategy/random/random.go).
102 |
103 | Of course, if your strategy would be generally usefull I would lolve a pull request!
104 |
105 | _The default strategy, `RoundRobin`, is registered slightly differently to avoid import cycles, so avoid using it as an example_
106 |
107 |
108 | Give your strategy a unique identifier
109 |
110 | const FancyStrategy lb.StrategyType = "fancy"
111 |
112 | Create a factory (and your implementation of `GenericLoadBalancer`)
113 |
114 | func New(lib dns.Lookup) lb.GenericLoadBalancer {
115 | return &FancyLB{Dns: lib}
116 | }
117 |
118 | Register it with the load balancer
119 |
120 | func init() {
121 | lb.RegisterStrategy(FancyStrategy, New)
122 | }
123 |
124 |
125 | And then specify it when constructing your load balancer
126 |
127 | cfg, _ := lb.DefaultConfig()
128 | cfg.Strategy = fancy.FancyStrategy
129 |
130 | l := lb.New(cfg, srvName)
131 |
132 |
133 | ## Projects Using SRV-LB
134 |
135 | - [chinchilla](https://github.com/benschw/chinchilla) - a rabbitmq to REST bridge
136 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------