199 lines
5.5 KiB
Go
199 lines
5.5 KiB
Go
// Licensed to Elasticsearch B.V. under one or more contributor
|
|
// license agreements. See the NOTICE file distributed with
|
|
// this work for additional information regarding copyright
|
|
// ownership. Elasticsearch B.V. licenses this file to you 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 builder
|
|
|
|
import (
|
|
"encoding/json"
|
|
"fmt"
|
|
"sort"
|
|
"strconv"
|
|
"strings"
|
|
|
|
"github.com/elastic/beats/libbeat/common"
|
|
"github.com/elastic/beats/libbeat/logp"
|
|
)
|
|
|
|
// GetContainerID returns the id of a container
|
|
func GetContainerID(container common.MapStr) string {
|
|
id, _ := container["id"].(string)
|
|
return id
|
|
}
|
|
|
|
// GetContainerName returns the name of a container
|
|
func GetContainerName(container common.MapStr) string {
|
|
name, _ := container["name"].(string)
|
|
return name
|
|
}
|
|
|
|
// GetHintString takes a hint and returns its value as a string
|
|
func GetHintString(hints common.MapStr, key, config string) string {
|
|
if iface, err := hints.GetValue(fmt.Sprintf("%s.%s", key, config)); err == nil {
|
|
if str, ok := iface.(string); ok {
|
|
return str
|
|
}
|
|
}
|
|
|
|
return ""
|
|
}
|
|
|
|
// GetHintMapStr takes a hint and returns a MapStr
|
|
func GetHintMapStr(hints common.MapStr, key, config string) common.MapStr {
|
|
if iface, err := hints.GetValue(fmt.Sprintf("%s.%s", key, config)); err == nil {
|
|
if mapstr, ok := iface.(common.MapStr); ok {
|
|
return mapstr
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
// GetHintAsList takes a hint and returns the value as lists.
|
|
func GetHintAsList(hints common.MapStr, key, config string) []string {
|
|
if str := GetHintString(hints, key, config); str != "" {
|
|
return getStringAsList(str)
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
// GetProcessors gets processor definitions from the hints and returns a list of configs as a MapStr
|
|
func GetProcessors(hints common.MapStr, key string) []common.MapStr {
|
|
rawProcs := GetHintMapStr(hints, key, "processors")
|
|
if rawProcs == nil {
|
|
return nil
|
|
}
|
|
|
|
var words, nums []string
|
|
|
|
for key := range rawProcs {
|
|
if _, err := strconv.Atoi(key); err != nil {
|
|
words = append(words, key)
|
|
continue
|
|
} else {
|
|
nums = append(nums, key)
|
|
}
|
|
}
|
|
|
|
sort.Strings(nums)
|
|
|
|
var configs []common.MapStr
|
|
for _, key := range nums {
|
|
rawCfg, _ := rawProcs[key]
|
|
if config, ok := rawCfg.(common.MapStr); ok {
|
|
configs = append(configs, config)
|
|
}
|
|
}
|
|
|
|
for _, word := range words {
|
|
configs = append(configs, common.MapStr{
|
|
word: rawProcs[word],
|
|
})
|
|
}
|
|
|
|
return configs
|
|
}
|
|
|
|
func getStringAsList(input string) []string {
|
|
if input == "" {
|
|
return []string{}
|
|
}
|
|
list := strings.Split(input, ",")
|
|
|
|
for i := 0; i < len(list); i++ {
|
|
list[i] = strings.TrimSpace(list[i])
|
|
}
|
|
|
|
return list
|
|
}
|
|
|
|
// GetHintAsConfigs can read a hint in the form of a stringified JSON and return a common.MapStr
|
|
func GetHintAsConfigs(hints common.MapStr, key string) []common.MapStr {
|
|
if str := GetHintString(hints, key, "raw"); str != "" {
|
|
// check if it is a single config
|
|
if str[0] != '[' {
|
|
cfg := common.MapStr{}
|
|
if err := json.Unmarshal([]byte(str), &cfg); err != nil {
|
|
logp.Debug("autodiscover.builder", "unable to unmarshal json due to error: %v", err)
|
|
return nil
|
|
}
|
|
return []common.MapStr{cfg}
|
|
}
|
|
|
|
cfg := []common.MapStr{}
|
|
if err := json.Unmarshal([]byte(str), &cfg); err != nil {
|
|
logp.Debug("autodiscover.builder", "unable to unmarshal json due to error: %v", err)
|
|
return nil
|
|
}
|
|
return cfg
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// IsNoOp is a big red button to prevent spinning up Runners in case of issues.
|
|
func IsNoOp(hints common.MapStr, key string) bool {
|
|
if value, err := hints.GetValue(fmt.Sprintf("%s.disable", key)); err == nil {
|
|
noop, _ := strconv.ParseBool(value.(string))
|
|
return noop
|
|
}
|
|
|
|
return false
|
|
}
|
|
|
|
// GenerateHints parses annotations based on a prefix and sets up hints that can be picked up by individual Beats.
|
|
func GenerateHints(annotations common.MapStr, container, prefix string) common.MapStr {
|
|
hints := common.MapStr{}
|
|
if rawEntries, err := annotations.GetValue(prefix); err == nil {
|
|
if entries, ok := rawEntries.(common.MapStr); ok {
|
|
for key, rawValue := range entries {
|
|
// If there are top level hints like co.elastic.logs/ then just add the values after the /
|
|
// Only consider namespaced annotations
|
|
parts := strings.Split(key, "/")
|
|
if len(parts) == 2 {
|
|
hintKey := fmt.Sprintf("%s.%s", parts[0], parts[1])
|
|
// Insert only if there is no entry already. container level annotations take
|
|
// higher priority.
|
|
if _, err := hints.GetValue(hintKey); err != nil {
|
|
hints.Put(hintKey, rawValue)
|
|
}
|
|
} else if container != "" {
|
|
// Only consider annotations that are of type common.MapStr as we are looking for
|
|
// container level nesting
|
|
builderHints, ok := rawValue.(common.MapStr)
|
|
if !ok {
|
|
continue
|
|
}
|
|
|
|
// Check for <containerName>/ prefix
|
|
for hintKey, rawVal := range builderHints {
|
|
if strings.HasPrefix(hintKey, container) {
|
|
// Split the key to get part[1] to be the hint
|
|
parts := strings.Split(hintKey, "/")
|
|
if len(parts) == 2 {
|
|
// key will be the hint type
|
|
hintKey := fmt.Sprintf("%s.%s", key, parts[1])
|
|
hints.Put(hintKey, rawVal)
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return hints
|
|
}
|