mirror of https://github.com/docker/docs.git
add matching to constraints
Signed-off-by: Victor Vieux <vieux@docker.com>
This commit is contained in:
parent
efc56c18c2
commit
ba1688ccef
|
@ -2,8 +2,10 @@ package filter
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"fmt"
|
"fmt"
|
||||||
|
"regexp"
|
||||||
"strings"
|
"strings"
|
||||||
|
|
||||||
|
log "github.com/Sirupsen/logrus"
|
||||||
"github.com/docker/swarm/cluster"
|
"github.com/docker/swarm/cluster"
|
||||||
"github.com/samalba/dockerclient"
|
"github.com/samalba/dockerclient"
|
||||||
)
|
)
|
||||||
|
@ -27,18 +29,32 @@ func (f *LabelFilter) extractConstraints(env []string) map[string]string {
|
||||||
func (f *LabelFilter) Filter(config *dockerclient.ContainerConfig, nodes []*cluster.Node) ([]*cluster.Node, error) {
|
func (f *LabelFilter) Filter(config *dockerclient.ContainerConfig, nodes []*cluster.Node) ([]*cluster.Node, error) {
|
||||||
constraints := f.extractConstraints(config.Env)
|
constraints := f.extractConstraints(config.Env)
|
||||||
for k, v := range constraints {
|
for k, v := range constraints {
|
||||||
|
regex := "^" + strings.Replace(v, "*", ".*", -1) + "$"
|
||||||
|
log.Debugf("matching constraint: %s=%s", k, regex)
|
||||||
candidates := []*cluster.Node{}
|
candidates := []*cluster.Node{}
|
||||||
for _, node := range nodes {
|
for _, node := range nodes {
|
||||||
switch k {
|
switch k {
|
||||||
case "node":
|
case "node":
|
||||||
// "node" label is a special case pinning a container to a specific node.
|
// "node" label is a special case pinning a container to a specific node.
|
||||||
if strings.ToLower(node.ID) == v || strings.ToLower(node.Name) == v {
|
matchedID, err := regexp.MatchString(regex, strings.ToLower(node.ID))
|
||||||
|
if err != nil {
|
||||||
|
log.Error(err)
|
||||||
|
}
|
||||||
|
matchedName, err := regexp.MatchString(regex, strings.ToLower(node.Name))
|
||||||
|
if err != nil {
|
||||||
|
log.Error(err)
|
||||||
|
}
|
||||||
|
if matchedID || matchedName {
|
||||||
candidates = append(candidates, node)
|
candidates = append(candidates, node)
|
||||||
}
|
}
|
||||||
default:
|
default:
|
||||||
// By default match the node labels.
|
// By default match the node labels.
|
||||||
if label, ok := node.Labels[k]; ok {
|
if label, ok := node.Labels[k]; ok {
|
||||||
if strings.Contains(strings.ToLower(label), v) {
|
matched, err := regexp.MatchString(regex, strings.ToLower(label))
|
||||||
|
if err != nil {
|
||||||
|
log.Error(err)
|
||||||
|
}
|
||||||
|
if matched {
|
||||||
candidates = append(candidates, node)
|
candidates = append(candidates, node)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue