forked from elastic/package-registry
-
Notifications
You must be signed in to change notification settings - Fork 0
/
search.go
265 lines (219 loc) · 6.75 KB
/
search.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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
// Copyright Elasticsearch B.V. and/or licensed to Elasticsearch B.V. under one
// or more contributor license agreements. Licensed under the Elastic License;
// you may not use this file except in compliance with the Elastic License.
package main
import (
"context"
"encoding/json"
"fmt"
"net/http"
"sort"
"strconv"
"strings"
"time"
"github.com/Masterminds/semver/v3"
"github.com/pkg/errors"
"go.elastic.co/apm"
"github.com/elastic/package-registry/util"
)
func searchHandler(packagesBasePaths []string, cacheTime time.Duration) func(w http.ResponseWriter, r *http.Request) {
return func(w http.ResponseWriter, r *http.Request) {
filter, err := newSearchFilterFromParams(r)
if err != nil {
badRequest(w, err.Error())
return
}
packages, err := util.GetPackages(r.Context(), packagesBasePaths)
if err != nil {
notFoundError(w, errors.Wrapf(err, "fetching package failed"))
return
}
packages = filter.FilterPackages(r.Context(), packages)
packagesList := filter.Filter(r.Context(), packages)
data, err := getPackageOutput(r.Context(), packagesList)
if err != nil {
notFoundError(w, err)
return
}
cacheHeaders(w, cacheTime)
jsonHeader(w)
fmt.Fprint(w, string(data))
}
}
type searchFilter struct {
Category string
Package string
KibanaVersion *semver.Version
AllVersions bool
Internal bool
Experimental bool
}
func newSearchFilterFromParams(r *http.Request) (searchFilter, error) {
var filter searchFilter
query := r.URL.Query()
if len(query) == 0 {
return filter, nil
}
var err error
if v := query.Get("kibana.version"); v != "" {
filter.KibanaVersion, err = semver.NewVersion(v)
if err != nil {
return filter, fmt.Errorf("invalid Kibana version '%s': %w", v, err)
}
}
if v := query.Get("category"); v != "" {
filter.Category = v
}
if v := query.Get("package"); v != "" {
filter.Package = v
}
if v := query.Get("all"); v != "" {
// Default is false, also on error
filter.AllVersions, err = strconv.ParseBool(v)
if err != nil {
return filter, fmt.Errorf("invalid 'all' query param: '%s'", v)
}
}
if v := query.Get("internal"); v != "" {
// In case of error, keep it false
filter.Internal, err = strconv.ParseBool(v)
if err != nil {
return filter, fmt.Errorf("invalid 'internal' query param: '%s'", v)
}
}
if v := query.Get("experimental"); v != "" {
// In case of error, keep it false
filter.Experimental, err = strconv.ParseBool(v)
if err != nil {
return filter, fmt.Errorf("invalid 'experimental' query param: '%s'", v)
}
}
return filter, nil
}
func (filter searchFilter) FilterPackages(ctx context.Context, packages util.Packages) util.Packages {
span, ctx := apm.StartSpan(ctx, "FilterPackages", "app")
defer span.End()
if filter.AllVersions {
return packages
}
packageList := map[string]util.Package{}
// Get unique list of newest packages
for _, p := range packages {
if filter.KibanaVersion != nil {
if valid := p.HasKibanaVersion(filter.KibanaVersion); !valid {
continue
}
}
// Check if the version exists and if it should be added or not.
// If the package in the list is newer or equal, do nothing.
if pp, ok := packageList[p.Name]; ok && pp.IsNewerOrEqual(p) {
continue
}
// Otherwise delete and later add the new one.
packageList[p.Name] = p
}
var filtered util.Packages
for _, p := range packageList {
filtered = append(filtered, p)
}
return filtered
}
func (filter searchFilter) Filter(ctx context.Context, packages util.Packages) map[string]map[string]util.Package {
span, ctx := apm.StartSpan(ctx, "Filter", "app")
defer span.End()
packagesList := map[string]map[string]util.Package{}
for _, p := range packages {
// Filter by category first as this could heavily reduce the number of packages
// It must happen before the version filtering as there only the newest version
// is exposed and there could be an older package with more versions.
if filter.Category != "" && !p.HasCategory(filter.Category) && !p.HasPolicyTemplateWithCategory(filter.Category) {
continue
}
// Skip internal packages
if p.Internal && !filter.Internal {
continue
}
// Skip experimental packages if flag is not specified
if p.Release == util.ReleaseExperimental && !filter.Experimental {
continue
}
if filter.KibanaVersion != nil {
if valid := p.HasKibanaVersion(filter.KibanaVersion); !valid {
continue
}
}
// If package Query is set, all versions of this package are returned
if filter.Package != "" && filter.Package != p.Name {
continue
}
addPackage := true
if !filter.AllVersions {
// Check if the version exists and if it should be added or not.
for name, versions := range packagesList {
if name != p.Name {
continue
}
for _, pp := range versions {
// If the package in the list is newer or equal, do nothing.
if pp.IsNewerOrEqual(p) {
addPackage = false
continue
}
// Otherwise delete and later add the new one.
delete(packagesList[pp.Name], pp.Version)
}
}
}
if addPackage {
if _, ok := packagesList[p.Name]; !ok {
packagesList[p.Name] = map[string]util.Package{}
}
if filter.Category != "" && !p.HasCategory(filter.Category) {
// It means that package's policy template has the category
p = filterPolicyTemplates(p, filter.Category)
}
if _, ok := packagesList[p.Name][p.Version]; !ok {
packagesList[p.Name][p.Version] = p
}
}
}
return packagesList
}
func filterPolicyTemplates(p util.Package, category string) util.Package {
var updatedPolicyTemplates []util.PolicyTemplate
var updatedBasePolicyTemplates []util.BasePolicyTemplate
for i, pt := range p.PolicyTemplates {
if util.StringsContains(pt.Categories, category) {
updatedPolicyTemplates = append(updatedPolicyTemplates, pt)
updatedBasePolicyTemplates = append(updatedBasePolicyTemplates, p.BasePackage.BasePolicyTemplates[i])
}
}
p.PolicyTemplates = updatedPolicyTemplates
p.BasePackage.BasePolicyTemplates = updatedBasePolicyTemplates
return p
}
func getPackageOutput(ctx context.Context, packagesList map[string]map[string]util.Package) ([]byte, error) {
span, ctx := apm.StartSpan(ctx, "GetPackageOutput", "app")
defer span.End()
separator := "@"
// Packages need to be sorted to be always outputted in the same order
var keys []string
for key, k := range packagesList {
for v := range k {
keys = append(keys, key+separator+v)
}
}
sort.Strings(keys)
var output []util.BasePackage
for _, k := range keys {
parts := strings.Split(k, separator)
m := packagesList[parts[0]][parts[1]]
data := m.BasePackage
output = append(output, data)
}
// Instead of return `null` in case of an empty array, return []
if len(output) == 0 {
return []byte("[]"), nil
}
return json.MarshalIndent(output, "", " ")
}