|
| 1 | +package plugin |
| 2 | + |
| 3 | +import ( |
| 4 | + "fmt" |
| 5 | + "log" |
| 6 | + "strings" |
| 7 | + |
| 8 | + "github.com/turbot/go-kit/helpers" |
| 9 | + "github.com/turbot/steampipe-plugin-sdk/grpc/proto" |
| 10 | + "github.com/turbot/steampipe-plugin-sdk/plugin/quals" |
| 11 | +) |
| 12 | + |
| 13 | +// KeyColumnQualMap is a map of KeyColumnQuals keyed by column name |
| 14 | +type KeyColumnQualMap map[string]*KeyColumnQuals |
| 15 | + |
| 16 | +// ToEqualsQualValueMap converts a KeyColumnQualMap to a column-qual value map, including only the |
| 17 | +func (m KeyColumnQualMap) ToEqualsQualValueMap() map[string]*proto.QualValue { |
| 18 | + res := make(map[string]*proto.QualValue, len(m)) |
| 19 | + for k, v := range m { |
| 20 | + if v.SingleEqualsQual() { |
| 21 | + res[k] = v.Quals[0].Value |
| 22 | + } |
| 23 | + } |
| 24 | + return res |
| 25 | +} |
| 26 | + |
| 27 | +func (m KeyColumnQualMap) String() string { |
| 28 | + strs := make([]string, len(m)) |
| 29 | + for _, k := range m { |
| 30 | + var values = make([]interface{}, len(k.Quals)) |
| 31 | + for i, v := range k.Quals { |
| 32 | + values[i] = v.Value |
| 33 | + } |
| 34 | + strs = append(strs, fmt.Sprintf("%s - %v", k.Name, values)) |
| 35 | + } |
| 36 | + return strings.Join(strs, "\n") |
| 37 | +} |
| 38 | + |
| 39 | +func (m KeyColumnQualMap) SatisfiesKeyColumns(columns KeyColumnSlice) (bool, KeyColumnSlice) { |
| 40 | + log.Printf("[WARN] SatisfiesKeyColumns %v", columns) |
| 41 | + |
| 42 | + if columns == nil { |
| 43 | + return true, nil |
| 44 | + } |
| 45 | + var unsatisfiedKeyColumns KeyColumnSlice |
| 46 | + satisfiedCount := map[string]int{ |
| 47 | + Required: 0, |
| 48 | + AnyOf: 0, |
| 49 | + Optional: 0, |
| 50 | + } |
| 51 | + unsatisfiedCount := map[string]int{ |
| 52 | + Required: 0, |
| 53 | + AnyOf: 0, |
| 54 | + Optional: 0, |
| 55 | + } |
| 56 | + |
| 57 | + for _, keyColumn := range columns { |
| 58 | + // look for this key column in our map |
| 59 | + k := m[keyColumn.Name] |
| 60 | + satisfied := k != nil && k.SatisfiesKeyColumn(keyColumn) |
| 61 | + if satisfied { |
| 62 | + satisfiedCount[keyColumn.Require]++ |
| 63 | + |
| 64 | + log.Printf("[TRACE] key column satisfied %v", keyColumn) |
| 65 | + |
| 66 | + } else { |
| 67 | + unsatisfiedCount[keyColumn.Require]++ |
| 68 | + unsatisfiedKeyColumns = append(unsatisfiedKeyColumns, keyColumn) |
| 69 | + log.Printf("[TRACE] key column NOT satisfied %v", keyColumn) |
| 70 | + // if this was NOT an optional key column, we are not satisfied |
| 71 | + } |
| 72 | + } |
| 73 | + |
| 74 | + // we are satisfied if: |
| 75 | + // all Required key columns are satisfied |
| 76 | + // either there is at least 1 satisfied AnyOf key columns, or there are no AnyOf columns |
| 77 | + res := unsatisfiedCount[Required] == 0 && (satisfiedCount[AnyOf] > 0 || unsatisfiedCount[AnyOf] == 0) |
| 78 | + |
| 79 | + log.Printf("[WARN] SatisfiesKeyColumns result: %v, satisfiedCount %v, unsatisfiedCount %v, unsatisfiedKeyColumns %v", res, satisfiedCount, unsatisfiedCount, unsatisfiedKeyColumns) |
| 80 | + return res, unsatisfiedKeyColumns |
| 81 | +} |
| 82 | + |
| 83 | +// ToQualMap converts the map into a simpler map of column to []Quals |
| 84 | +// this is needed to avoid the transform package needing to reference plugin |
| 85 | +func (m KeyColumnQualMap) ToQualMap() map[string]quals.QualSlice { |
| 86 | + var res = make(map[string]quals.QualSlice) |
| 87 | + for k, v := range m { |
| 88 | + res[k] = v.Quals |
| 89 | + } |
| 90 | + return res |
| 91 | +} |
| 92 | + |
| 93 | +// NewKeyColumnQualValueMap creates a KeyColumnQualMap from a qual map and a KeyColumnSlice |
| 94 | +func NewKeyColumnQualValueMap(qualMap map[string]*proto.Quals, keyColumns KeyColumnSlice) KeyColumnQualMap { |
| 95 | + res := KeyColumnQualMap{} |
| 96 | + |
| 97 | + for _, col := range keyColumns { |
| 98 | + matchingQuals := getMatchingQuals(col, qualMap) |
| 99 | + for _, q := range matchingQuals { |
| 100 | + // convert proto.Qual into a qual.Qual (which is easier to use) |
| 101 | + qual := quals.NewQual(q) |
| 102 | + |
| 103 | + // if there is already an entry for this column, add a value to the array |
| 104 | + if mapEntry, mapEntryExists := res[col.Name]; mapEntryExists { |
| 105 | + mapEntry.Quals = append(mapEntry.Quals, qual) |
| 106 | + res[col.Name] = mapEntry |
| 107 | + } else { |
| 108 | + // crate a new map entry for this column |
| 109 | + res[col.Name] = &KeyColumnQuals{ |
| 110 | + Name: col.Name, |
| 111 | + Quals: quals.QualSlice{qual}, |
| 112 | + } |
| 113 | + } |
| 114 | + } |
| 115 | + } |
| 116 | + return res |
| 117 | +} |
| 118 | + |
| 119 | +// look in a column-qual map for quals with column and operator matching the key column |
| 120 | +func getMatchingQuals(keyColumn *KeyColumn, qualMap map[string]*proto.Quals) []*proto.Qual { |
| 121 | + log.Printf("[TRACE] getMatchingQuals keyColumn %s qualMap %s", keyColumn, qualMap) |
| 122 | + |
| 123 | + quals, ok := qualMap[keyColumn.Name] |
| 124 | + if !ok { |
| 125 | + log.Printf("[TRACE] getMatchingQuals returning false - qualMap does not contain any quals for colums %s", keyColumn.Name) |
| 126 | + return nil |
| 127 | + } |
| 128 | + |
| 129 | + var res []*proto.Qual |
| 130 | + for _, q := range quals.Quals { |
| 131 | + operator := q.GetStringValue() |
| 132 | + if helpers.StringSliceContains(keyColumn.Operators, operator) { |
| 133 | + res = append(res, q) |
| 134 | + } |
| 135 | + } |
| 136 | + if len(res) > 0 { |
| 137 | + log.Printf("[TRACE] getMatchingQuals found %d quals matching key column %s", len(res), keyColumn) |
| 138 | + } else { |
| 139 | + log.Printf("[TRACE] getMatchingQuals returning false - qualMap does not contain any matching quals for quals for key column %s", keyColumn) |
| 140 | + } |
| 141 | + |
| 142 | + return res |
| 143 | +} |
0 commit comments