forked from cilium/cilium
-
Notifications
You must be signed in to change notification settings - Fork 7
/
selectorcache.go
814 lines (719 loc) · 28.7 KB
/
selectorcache.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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
// Copyright 2019 Authors of Cilium
//
// Licensed 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 policy
import (
"sort"
"strings"
"sync/atomic"
"unsafe"
"github.com/cilium/cilium/api/v1/models"
"github.com/cilium/cilium/pkg/identity"
"github.com/cilium/cilium/pkg/identity/cache"
k8sConst "github.com/cilium/cilium/pkg/k8s/apis/cilium.io"
"github.com/cilium/cilium/pkg/labels"
"github.com/cilium/cilium/pkg/lock"
"github.com/cilium/cilium/pkg/logging/logfields"
"github.com/cilium/cilium/pkg/policy/api"
"github.com/sirupsen/logrus"
)
// CachedSelector represents an identity selector owned by the selector cache
type CachedSelector interface {
// GetSelections returns the cached set of numeric identities
// selected by the CachedSelector. The retuned slice must NOT
// be modified, as it is shared among multiple users.
GetSelections() []identity.NumericIdentity
// Selects return 'true' if the CachedSelector selects the given
// numeric identity.
Selects(nid identity.NumericIdentity) bool
// IsWildcard returns true if the endpoint selector selects
// all endpoints.
IsWildcard() bool
// String returns the string representation of this selector.
// Used as a map key.
String() string
}
// CachedSelectorSlice is a slice of CachedSelectors that can be sorted.
type CachedSelectorSlice []CachedSelector
func (s CachedSelectorSlice) Len() int { return len(s) }
func (s CachedSelectorSlice) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
func (s CachedSelectorSlice) Less(i, j int) bool {
return strings.Compare(s[i].String(), s[j].String()) < 0
}
// SelectsAllEndpoints returns whether the CachedSelectorSlice selects all
// endpoints, which is true if the wildcard endpoint selector is present in the
// slice.
func (s CachedSelectorSlice) SelectsAllEndpoints() bool {
for _, selector := range s {
if selector.IsWildcard() {
return true
}
}
return false
}
// Insert in a sorted order? Returns true if inserted, false if cs was already in
func (s *CachedSelectorSlice) Insert(cs CachedSelector) bool {
for _, selector := range *s {
if selector == cs {
return false
}
}
*s = append(*s, cs)
return true
}
// CachedSelectionUser inserts selectors into the cache and gets update
// callbacks whenever the set of selected numeric identities change for
// the CachedSelectors pushed by it.
type CachedSelectionUser interface {
// IdentitySelectionUpdated implementations MUST NOT call back
// to the name manager or the selector cache while executing this function!
//
// The caller is responsible for making sure the same identity is not
// present in both 'added' and 'deleted'.
IdentitySelectionUpdated(selector CachedSelector, selections, added, deleted []identity.NumericIdentity)
}
// identitySelector is the internal interface for all selectors in the
// selector cache.
//
// identitySelector represents the mapping of an EndpointSelector
// to a slice of identities. These mappings are updated via two
// different processes:
//
// 1. When policy rules are changed these are added and/or deleted
// depending on what selectors the rules contain. Cached selections of
// new identitySelectors are pre-populated from the set of currently
// known identities.
//
// 2. When reachacble identities appear or disappear, either via local
// allocation (CIDRs), or via the KV-store (remote endpoints). In this
// case all existing identitySelectors are walked through and their
// cached selections are updated as necessary.
//
// In both of the above cases the set of existing identitySelectors is
// write locked.
//
// To minimize the upkeep the identity selectors are shared across
// all IdentityPolicies, so that only one copy exists for each
// identitySelector. Users of the SelectorCache take care of creating
// identitySelectors as needed by identity policies. The set of
// identitySelectors is read locked during an IdentityPolicy update so
// that the the policy is always updated using a coherent set of
// cached selections.
//
// identitySelector is used as a map key, so it must not be implemented by a
// map, slice, or a func, or a runtime panic will be triggered. In all
// cases below identitySelector is being implemented by structs.
type identitySelector interface {
CachedSelector
addUser(CachedSelectionUser) (added bool)
// Called with NameManager and SelectorCache locks held
removeUser(CachedSelectionUser, identityNotifier) (last bool)
// This may be called while the NameManager lock is held
notifyUsers(added, deleted []identity.NumericIdentity)
numUsers() int
}
// scIdentity is the information we need about a an identity that rules can select
type scIdentity struct {
NID identity.NumericIdentity
lbls labels.LabelArray
namespace string // value of the namespace label, or ""
}
// scIdentityCache is a cache of Identities keyed by the numeric identity
type scIdentityCache map[identity.NumericIdentity]scIdentity
func newIdentity(nid identity.NumericIdentity, lbls labels.LabelArray) scIdentity {
return scIdentity{
NID: nid,
lbls: lbls,
namespace: lbls.Get(labels.LabelSourceK8sKeyPrefix + k8sConst.PodNamespaceLabel),
}
}
func getIdentityCache(ids cache.IdentityCache) scIdentityCache {
idCache := make(map[identity.NumericIdentity]scIdentity, len(ids))
for nid, lbls := range ids {
idCache[nid] = newIdentity(nid, lbls)
}
return idCache
}
// SelectorCache caches identities, identity selectors, and the
// subsets of identities each selector selects.
type SelectorCache struct {
mutex lock.RWMutex
// idCache contains all known identities as informed by the
// kv-store and the local identity facility via our
// UpdateIdentities() function.
idCache scIdentityCache
// map key is the string representation of the selector being cached.
selectors map[string]identitySelector
localIdentityNotifier identityNotifier
}
// GetModel returns the API model of the SelectorCache.
func (sc *SelectorCache) GetModel() models.SelectorCache {
sc.mutex.RLock()
defer sc.mutex.RUnlock()
selCacheMdl := make(models.SelectorCache, 0, len(sc.selectors))
for selector, idSel := range sc.selectors {
selections := idSel.GetSelections()
ids := make([]int64, 0, len(selections))
for i := range selections {
ids = append(ids, int64(selections[i]))
}
selMdl := &models.SelectorIdentityMapping{
Selector: selector,
Identities: ids,
Users: int64(idSel.numUsers()),
}
selCacheMdl = append(selCacheMdl, selMdl)
}
return selCacheMdl
}
// NewSelectorCache creates a new SelectorCache with the given identities.
func NewSelectorCache(ids cache.IdentityCache) *SelectorCache {
return &SelectorCache{
idCache: getIdentityCache(ids),
selectors: make(map[string]identitySelector),
}
}
// SetLocalIdentityNotifier injects the provided identityNotifier into the
// SelectorCache. Currently, this is used to inject the FQDN subsystem into
// the SelectorCache so the SelectorCache can notify the FQDN subsystem when
// it should be aware of a given FQDNSelector for which CIDR identities need
// to be provided upon DNS lookups which corespond to said FQDNSelector.
func (sc *SelectorCache) SetLocalIdentityNotifier(pop identityNotifier) {
sc.localIdentityNotifier = pop
}
var (
// Empty slice of numeric identities used for all selectors that select nothing
emptySelection []identity.NumericIdentity
// wildcardSelectorKey is used to compare if a key is for a wildcard
wildcardSelectorKey = api.WildcardEndpointSelector.LabelSelector.String()
)
type selectorManager struct {
key string
selections unsafe.Pointer // *[]identity.NumericIdentity
users map[CachedSelectionUser]struct{}
cachedSelections map[identity.NumericIdentity]struct{}
}
// Equal is used by checker.Equals, and only considers the identity of the selector,
// ignoring the internal state!
func (s *selectorManager) Equal(b *selectorManager) bool {
return s.key == b.key
}
//
// CachedSelector implementation (== Public API)
//
// No locking needed.
//
// GetSelections returns the set of numeric identities currently
// selected. The cached selections can be concurrently updated. In
// that case GetSelections() will return either the old or new version
// of the selections. If the old version is returned, the user is
// guaranteed to receive a notification including the update.
func (s *selectorManager) GetSelections() []identity.NumericIdentity {
return *(*[]identity.NumericIdentity)(atomic.LoadPointer(&s.selections))
}
// Selects return 'true' if the CachedSelector selects the given
// numeric identity.
func (s *selectorManager) Selects(nid identity.NumericIdentity) bool {
if s.IsWildcard() {
return true
}
nids := s.GetSelections()
idx := sort.Search(len(nids), func(i int) bool { return nids[i] >= nid })
return idx < len(nids) && nids[idx] == nid
}
// IsWildcard returns true if the endpoint selector selects all
// endpoints.
func (s *selectorManager) IsWildcard() bool {
return s.key == wildcardSelectorKey
}
// String returns the map key for this selector
func (s *selectorManager) String() string {
return s.key
}
//
// identitySelector implementation (== internal API)
//
// lock must be held
func (s *selectorManager) addUser(user CachedSelectionUser) (added bool) {
if _, exists := s.users[user]; exists {
return false
}
s.users[user] = struct{}{}
return true
}
// lock must be held
func (s *selectorManager) removeUser(user CachedSelectionUser, dnsProxy identityNotifier) (last bool) {
delete(s.users, user)
return len(s.users) == 0
}
// locks must be held for the dnsProxy and the SelectorCache
func (f *fqdnSelector) removeUser(user CachedSelectionUser, dnsProxy identityNotifier) (last bool) {
delete(f.users, user)
if len(f.users) == 0 {
dnsProxy.UnregisterForIdentityUpdatesLocked(f.selector)
return true
}
return false
}
// lock must be held
//
// The caller is responsible for making sure the same identity is not
// present in both 'added' and 'deleted'.
func (s *selectorManager) notifyUsers(added, deleted []identity.NumericIdentity) {
for user := range s.users {
user.IdentitySelectionUpdated(s, s.GetSelections(), added, deleted)
}
}
// lock must be held
func (s *selectorManager) numUsers() int {
return len(s.users)
}
// updateSelections updates the immutable slice representation of the
// cached selections after the cached selections have been changed.
//
// lock must be held
func (s *selectorManager) updateSelections() {
selections := make([]identity.NumericIdentity, len(s.cachedSelections))
i := 0
for nid := range s.cachedSelections {
selections[i] = nid
i++
}
// Sort the numeric identities so that the map iteration order
// does not matter. This makes testing easier, but may help
// identifying changes easier also otherwise.
sort.Slice(selections, func(i, j int) bool {
return selections[i] < selections[j]
})
s.setSelections(&selections)
}
func (s *selectorManager) setSelections(selections *[]identity.NumericIdentity) {
if len(*selections) > 0 {
atomic.StorePointer(&s.selections, unsafe.Pointer(selections))
} else {
atomic.StorePointer(&s.selections, unsafe.Pointer(&emptySelection))
}
}
type fqdnSelector struct {
selectorManager
selector api.FQDNSelector
}
// identityNotifier provides a means for other subsystems to be made aware of a
// given FQDNSelector (currently pkg/fqdn) so that said subsystems can notify
// the SelectorCache about new IPs (via CIDR Identities) which correspond to
// said FQDNSelector. This is necessary since there is nothing intrinsic to a
// CIDR Identity that says that it corresponds to a given FQDNSelector; this
// relationship is contained only via DNS responses, which are handled
// externally.
type identityNotifier interface {
// Lock must be held during any calls to RegisterForIdentityUpdatesLocked or
// UnregisterForIdentityUpdatesLocked.
Lock()
// Unlock must be called after calls to RegisterForIdentityUpdatesLocked or
// UnregisterForIdentityUpdatesLocked are done.
Unlock()
// RegisterForIdentityUpdatesLocked exposes this FQDNSelector so that identities
// for IPs contained in a DNS response that matches said selector can be
// propagated back to the SelectorCache via `UpdateFQDNSelector`. When called,
// implementers (currently `pkg/fqdn/RuleGen`) should iterate over all DNS
// names that they are aware of, and see if they match the FQDNSelector.
// All IPs which correspond to the DNS names which match this Selector will
// be returned as CIDR identities, as other DNS Names which have already
// been resolved may match this FQDNSelector.
// Once this function is called, the SelectorCache will be updated any time
// new IPs are resolved for DNS names which match this FQDNSelector.
// This function is only called when the SelectorCache has been made aware
// of this FQDNSelector for the first time, since we only need to get the
// set of CIDR identities which match this FQDNSelector already from the
// identityNotifier on the first pass; any subsequent updates will eventually
// call `UpdateFQDNSelector`.
RegisterForIdentityUpdatesLocked(selector api.FQDNSelector) (identities []identity.NumericIdentity)
// UnregisterForIdentityUpdatesLocked removes this FQDNSelector from the set of
// FQDNSelectors which are being tracked by the identityNotifier. The result
// of this is that no more updates for IPs which correspond to said selector
// are propagated back to the SelectorCache via `UpdateFQDNSelector`.
// This occurs when there are no more users of a given FQDNSelector for the
// SelectorCache.
UnregisterForIdentityUpdatesLocked(selector api.FQDNSelector)
}
type labelIdentitySelector struct {
selectorManager
selector api.EndpointSelector
namespaces []string // allowed namespaces, or ""
}
// xxxMatches returns true if the CachedSelector matches given labels.
// This is slow, but only used for policy tracing, so it's OK.
func (l *labelIdentitySelector) xxxMatches(labels labels.LabelArray) bool {
return l.selector.Matches(labels)
}
func (l *labelIdentitySelector) matchesNamespace(ns string) bool {
if len(l.namespaces) > 0 {
if ns != "" {
for i := range l.namespaces {
if ns == l.namespaces[i] {
return true
}
}
}
// namespace required, but no match
return false
}
// no namespace required, match
return true
}
func (l *labelIdentitySelector) matches(identity scIdentity) bool {
return l.matchesNamespace(identity.namespace) && l.selector.Matches(identity.lbls)
}
//
// CachedSelector implementation (== Public API)
//
// No locking needed.
//
// UpdateFQDNSelector updates the mapping of fqdnKey (the FQDNSelector from a
// policy rule as a string) to to the provided list of identities. If the contents
// of the cachedSelections differ from those in the identities slice, all
// users are notified.
func (sc *SelectorCache) UpdateFQDNSelector(fqdnSelec api.FQDNSelector, identities []identity.NumericIdentity) {
sc.mutex.Lock()
sc.updateFQDNSelector(fqdnSelec, identities)
sc.mutex.Unlock()
}
func (sc *SelectorCache) updateFQDNSelector(fqdnSelec api.FQDNSelector, identities []identity.NumericIdentity) {
fqdnKey := fqdnSelec.String()
var fqdnSel *fqdnSelector
selector, exists := sc.selectors[fqdnKey]
if !exists || selector == nil {
fqdnSel = &fqdnSelector{
selectorManager: selectorManager{
key: fqdnKey,
users: make(map[CachedSelectionUser]struct{}),
cachedSelections: make(map[identity.NumericIdentity]struct{}),
},
selector: fqdnSelec,
}
sc.selectors[fqdnKey] = fqdnSel
} else {
fqdnSel = selector.(*fqdnSelector)
}
// Convert identity slice to map for comparison with cachedSelections map.
idsAsMap := make(map[identity.NumericIdentity]struct{}, len(identities))
for _, v := range identities {
idsAsMap[v] = struct{}{}
}
// Note that 'added' and 'deleted' are guaranteed to be
// disjoint, as one of them is left as nil, or an identity
// being in 'identities' is a precondition for an
// identity to be appended to 'added', while the inverse is
// true for 'deleted'.
var added, deleted []identity.NumericIdentity
/* TODO - the FQDN side should expose what was changed (IPs added, and removed)
* not all IPs corresponding to an FQDN - this will make this diff much
* cheaper, but will require more plumbing on the FQDN side. for now, this
* is good enough.
*
* Case 1: identities did correspond to this FQDN, but no longer do. Reset
* the map
*/
if len(identities) == 0 && len(fqdnSel.cachedSelections) != 0 {
// Need to update deleted to be all in cached selections
for k := range fqdnSel.cachedSelections {
deleted = append(deleted, k)
}
fqdnSel.cachedSelections = make(map[identity.NumericIdentity]struct{})
} else if len(identities) != 0 && len(fqdnSel.cachedSelections) == 0 {
// Case 2: identities now correspond to this FQDN, but didn't before.
// We don't have to do any comparison of the maps to see what changed
// and what didn't.
added = identities
fqdnSel.cachedSelections = idsAsMap
} else {
// Case 3: Something changed resulting in some identities being added
// and / or removed. Figure out what these sets are (new identities
// added, or identities deleted).
for k := range fqdnSel.cachedSelections {
// If identity in cached selectors isn't in identities which were
// passed in, mark it as being deleted, and remove it from
// cachedSelectors.
if _, ok := idsAsMap[k]; !ok {
deleted = append(deleted, k)
delete(fqdnSel.cachedSelections, k)
}
}
// Now iterate over the provided identities to update the
// cachedSelections accordingly, and so we can see which identities
// were actually added (removing those which were added already).
for _, allowedIdentity := range identities {
if _, ok := fqdnSel.cachedSelections[allowedIdentity]; !ok {
// This identity was actually added and not already in the map.
added = append(added, allowedIdentity)
fqdnSel.cachedSelections[allowedIdentity] = struct{}{}
}
}
}
// Note: we don't need to go through the identity cache to see what
// identities match" this selector. This has to be updated via whatever is
// getting the CIDR identities which correspond to this FQDNSelector. This
// is the primary difference here between FQDNSelector and IdentitySelector.
fqdnSel.updateSelections()
fqdnSel.notifyUsers(added, deleted) // disjoint sets, see the comment above
}
// AddFQDNSelector adds the given api.FQDNSelector in to the selector cache. If
// an identical EndpointSelector has already been cached, the corresponding
// CachedSelector is returned, otherwise one is created and added to the cache.
func (sc *SelectorCache) AddFQDNSelector(user CachedSelectionUser, fqdnSelec api.FQDNSelector) (cachedSelector CachedSelector, added bool) {
key := fqdnSelec.String()
// Lock NameManager before the SelectorCache
sc.localIdentityNotifier.Lock()
defer sc.localIdentityNotifier.Unlock()
// If the selector already exists, use it.
sc.mutex.Lock()
fqdnSel, exists := sc.selectors[key]
if exists {
added := fqdnSel.addUser(user)
sc.mutex.Unlock()
return fqdnSel, added
}
sc.mutex.Unlock()
// Create the new selector. Pulling the identities it selects could
// cause allocation of new CIDR identities, so we do this while not
// holding the 'sc.mutex'.
newFQDNSel := &fqdnSelector{
selectorManager: selectorManager{
key: key,
users: make(map[CachedSelectionUser]struct{}),
cachedSelections: make(map[identity.NumericIdentity]struct{}),
},
selector: fqdnSelec,
}
// Make the FQDN subsystem aware of this selector and fetch identities
// that the FQDN subsystem is aware of.
//
// If the same 'fqdnSelec' is registered twice here from different
// goroutines, we do *NOT* need to unregister the second one because
// 'fqdnSelec' is just a struct passed by value. The call below doesn't
// retain any references/pointers.
//
// If this is called twice, one of the results will arbitrarily contain
// a real slice of ids, while the other will receive nil. We must fold
// them together below.
ids := sc.localIdentityNotifier.RegisterForIdentityUpdatesLocked(newFQDNSel.selector)
// Do not go through the identity cache to see what identities "match" this
// selector. This has to be updated via whatever is getting the CIDR identities
// which correspond go this FQDNSelector.
// Alternatively , we could go through the CIDR identities in the cache
// provided they have some 'field' which shows which FQDNs they correspond
// to? This would require we keep some set in the Identity for the CIDR.
// Is this feasible?
// Note: No notifications are sent for the existing
// identities. Caller must use GetSelections() to get the
// current selections after adding a selector. This way the
// behavior is the same between the two cases here (selector
// is already cached, or is a new one).
sc.mutex.Lock()
defer sc.mutex.Unlock()
// Check whether the selectorCache was updated while 'newFQDNSel' was
// being registered without the 'sc.mutex'. If so, use it. Otherwise
// we can use the one we just created/configured above.
if sel, exists := sc.selectors[key]; exists {
newFQDNSel = sel.(*fqdnSelector)
} else {
sc.selectors[key] = newFQDNSel
}
// Add the ids from the slice above to the FQDN selector in the cache.
// This could plausibly happen twice, once with an empty 'ids' slice
// and once with the real 'ids' slice. Either way, they are added to
// the selector that is stored in 'sc.selectors[]'
for _, id := range ids {
newFQDNSel.cachedSelections[id] = struct{}{}
}
newFQDNSel.updateSelections()
return newFQDNSel, newFQDNSel.addUser(user)
}
// FindCachedIdentitySelector finds the given api.EndpointSelector in the
// selector cache, returning nil if one can not be found.
func (sc *SelectorCache) FindCachedIdentitySelector(selector api.EndpointSelector) CachedSelector {
key := selector.CachedString()
sc.mutex.Lock()
idSel := sc.selectors[key]
sc.mutex.Unlock()
return idSel
}
// AddIdentitySelector adds the given api.EndpointSelector in to the
// selector cache. If an identical EndpointSelector has already been
// cached, the corresponding CachedSelector is returned, otherwise one
// is created and added to the cache.
func (sc *SelectorCache) AddIdentitySelector(user CachedSelectionUser, selector api.EndpointSelector) (cachedSelector CachedSelector, added bool) {
// The key returned here may be different for equivalent
// labelselectors, if the selector's requirements are stored
// in different orders. When this happens we'll be tracking
// essentially two copies of the same selector.
key := selector.CachedString()
sc.mutex.Lock()
defer sc.mutex.Unlock()
idSel, exists := sc.selectors[key]
if exists {
return idSel, idSel.addUser(user)
}
// Selectors are never modified once a rule is placed in the policy repository,
// so no need to deep copy.
newIDSel := &labelIdentitySelector{
selectorManager: selectorManager{
key: key,
users: make(map[CachedSelectionUser]struct{}),
cachedSelections: make(map[identity.NumericIdentity]struct{}),
},
selector: selector,
}
// check is selector has a namespace match or requirement
if namespaces, ok := selector.GetMatch(labels.LabelSourceK8sKeyPrefix + k8sConst.PodNamespaceLabel); ok {
newIDSel.namespaces = namespaces
}
// Add the initial user
newIDSel.users[user] = struct{}{}
// Find all matching identities from the identity cache.
for numericID, identity := range sc.idCache {
if newIDSel.matches(identity) {
newIDSel.cachedSelections[numericID] = struct{}{}
}
}
// Create the immutable slice representation of the selected
// numeric identities
newIDSel.updateSelections()
// Note: No notifications are sent for the existing
// identities. Caller must use GetSelections() to get the
// current selections after adding a selector. This way the
// behavior is the same between the two cases here (selector
// is already cached, or is a new one).
sc.selectors[key] = newIDSel
return newIDSel, true
}
// lock must be held
func (sc *SelectorCache) removeSelectorLocked(selector CachedSelector, user CachedSelectionUser) {
key := selector.String()
sel, exists := sc.selectors[key]
if exists {
if sel.removeUser(user, sc.localIdentityNotifier) {
delete(sc.selectors, key)
}
}
}
// RemoveSelector removes CachedSelector for the user.
func (sc *SelectorCache) RemoveSelector(selector CachedSelector, user CachedSelectionUser) {
sc.localIdentityNotifier.Lock()
sc.mutex.Lock()
sc.removeSelectorLocked(selector, user)
sc.mutex.Unlock()
sc.localIdentityNotifier.Unlock()
}
// RemoveSelectors removes CachedSelectorSlice for the user.
func (sc *SelectorCache) RemoveSelectors(selectors CachedSelectorSlice, user CachedSelectionUser) {
sc.localIdentityNotifier.Lock()
sc.mutex.Lock()
for _, selector := range selectors {
sc.removeSelectorLocked(selector, user)
}
sc.mutex.Unlock()
sc.localIdentityNotifier.Unlock()
}
// ChangeUser changes the CachedSelectionUser that gets updates on the
// updates on the cached selector.
func (sc *SelectorCache) ChangeUser(selector CachedSelector, from, to CachedSelectionUser) {
key := selector.String()
sc.mutex.Lock()
idSel, exists := sc.selectors[key]
if exists {
// Add before remove so that the count does not dip to zero in between,
// as this causes FQDN unregistration (if applicable).
idSel.addUser(to)
// ignoring the return value as we have just added a user above
idSel.removeUser(from, sc.localIdentityNotifier)
}
sc.mutex.Unlock()
}
// UpdateIdentities propagates identity updates to selectors
//
// The caller is responsible for making sure the same identity is not
// present in both 'added' and 'deleted'.
func (sc *SelectorCache) UpdateIdentities(added, deleted cache.IdentityCache) {
sc.mutex.Lock()
defer sc.mutex.Unlock()
// Update idCache so that newly added selectors get
// prepopulated with all matching numeric identities.
for numericID := range deleted {
if old, exists := sc.idCache[numericID]; exists {
log.WithFields(logrus.Fields{logfields.Identity: numericID, logfields.Labels: old.lbls}).Debug("UpdateIdentities: Deleting identity")
delete(sc.idCache, numericID)
} else {
log.WithFields(logrus.Fields{logfields.Identity: numericID}).Warning("UpdateIdentities: Skipping Delete of a non-existing identity")
delete(deleted, numericID)
}
}
for numericID, lbls := range added {
if old, exists := sc.idCache[numericID]; exists {
// Skip if no change. Not skipping if label
// order is different, but identity labels are
// sorted for the kv-store, so there should
// not be too many false negatives.
if lbls.Same(old.lbls) {
log.WithFields(logrus.Fields{logfields.Identity: numericID}).Debug("UpdateIdentities: Skipping add of an existing identical identity")
delete(added, numericID)
continue
}
log.WithFields(logrus.Fields{logfields.Identity: numericID, logfields.Labels: old.lbls, logfields.Labels + "(new)": lbls}).Warning("UpdateIdentities: Updating an existing identity")
} else {
log.WithFields(logrus.Fields{logfields.Identity: numericID, logfields.Labels: lbls}).Debug("UpdateIdentities: Adding a new identity")
}
sc.idCache[numericID] = newIdentity(numericID, lbls)
}
if len(deleted)+len(added) > 0 {
// Iterate through all locally used identity selectors and
// update the cached numeric identities as required.
for _, sel := range sc.selectors {
var adds, dels []identity.NumericIdentity
switch idSel := sel.(type) {
case *labelIdentitySelector:
for numericID := range deleted {
if _, exists := idSel.cachedSelections[numericID]; exists {
dels = append(dels, numericID)
delete(idSel.cachedSelections, numericID)
}
}
for numericID := range added {
if _, exists := idSel.cachedSelections[numericID]; !exists {
if idSel.matches(sc.idCache[numericID]) {
adds = append(adds, numericID)
idSel.cachedSelections[numericID] = struct{}{}
}
}
}
if len(dels)+len(adds) > 0 {
idSel.updateSelections()
idSel.notifyUsers(adds, dels)
}
case *fqdnSelector:
// This is a no-op right now. We don't encode in the identities
// which FQDNs they correspond to.
}
}
}
}
// RemoveIdentitiesFQDNSelectors removes all identities from being mapped to the
// set of FQDNSelectors.
func (sc *SelectorCache) RemoveIdentitiesFQDNSelectors(fqdnSels []api.FQDNSelector) {
sc.mutex.Lock()
noIdentities := []identity.NumericIdentity{}
for i := range fqdnSels {
sc.updateFQDNSelector(fqdnSels[i], noIdentities)
}
sc.mutex.Unlock()
}