Switch node authorizer index to refcounts

This commit is contained in:
Jordan Liggitt 2020-02-10 13:24:13 -05:00
parent 6d335372b2
commit 3e0c0792d7
4 changed files with 76 additions and 76 deletions

View File

@ -259,7 +259,7 @@ func (g *Graph) addEdgeToDestinationIndex_locked(e graph.Edge) {
} }
// fast-add the new edge to an existing index // fast-add the new edge to an existing index
if destinationEdge, ok := e.(*destinationEdge); ok { if destinationEdge, ok := e.(*destinationEdge); ok {
index.mark(destinationEdge.DestinationID()) index.increment(destinationEdge.DestinationID())
} }
} }
@ -290,20 +290,17 @@ func (g *Graph) recomputeDestinationIndex_locked(n graph.Node) {
if index == nil { if index == nil {
index = newIntSet() index = newIntSet()
} else { } else {
index.startNewGeneration() index.reset()
} }
// populate the index // populate the index
g.graph.VisitFrom(n, func(dest graph.Node) bool { g.graph.VisitFrom(n, func(dest graph.Node) bool {
if destinationEdge, ok := g.graph.EdgeBetween(n, dest).(*destinationEdge); ok { if destinationEdge, ok := g.graph.EdgeBetween(n, dest).(*destinationEdge); ok {
index.mark(destinationEdge.DestinationID()) index.increment(destinationEdge.DestinationID())
} }
return true return true
}) })
// remove existing items no longer in the list
index.sweep()
if len(index.members) < g.destinationEdgeThreshold { if len(index.members) < g.destinationEdgeThreshold {
delete(g.destinationEdgeIndex, n.ID()) delete(g.destinationEdgeIndex, n.ID())
} else { } else {

View File

@ -247,8 +247,8 @@ func TestIndex(t *testing.T) {
actual := map[string][]string{} actual := map[string][]string{}
for from, to := range g.destinationEdgeIndex { for from, to := range g.destinationEdgeIndex {
sortedValues := []string{} sortedValues := []string{}
for member := range to.members { for member, count := range to.members {
sortedValues = append(sortedValues, toString(member)) sortedValues = append(sortedValues, fmt.Sprintf("%s=%d", toString(member), count))
} }
sort.Strings(sortedValues) sort.Strings(sortedValues)
actual[toString(from)] = sortedValues actual[toString(from)] = sortedValues
@ -280,10 +280,10 @@ func TestIndex(t *testing.T) {
"serviceAccount:ns/sa1": {"pod:ns/pod1", "pod:ns/pod2", "pod:ns/pod3"}, "serviceAccount:ns/sa1": {"pod:ns/pod1", "pod:ns/pod2", "pod:ns/pod3"},
}) })
expectIndex(map[string][]string{ expectIndex(map[string][]string{
"configmap:ns/cm1": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm1": {"node:node1=1", "node:node2=1", "node:node3=1"},
"configmap:ns/cm2": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm2": {"node:node1=1", "node:node2=1", "node:node3=1"},
"configmap:ns/cm3": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm3": {"node:node1=1", "node:node2=1", "node:node3=1"},
"serviceAccount:ns/sa1": {"node:node1", "node:node2", "node:node3"}, "serviceAccount:ns/sa1": {"node:node1=1", "node:node2=1", "node:node3=1"},
}) })
// delete one to drop below the threshold // delete one to drop below the threshold
@ -317,10 +317,10 @@ func TestIndex(t *testing.T) {
"serviceAccount:ns/sa1": {"pod:ns/pod1", "pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"}, "serviceAccount:ns/sa1": {"pod:ns/pod1", "pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"},
}) })
expectIndex(map[string][]string{ expectIndex(map[string][]string{
"configmap:ns/cm1": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm1": {"node:node1=2", "node:node2=1", "node:node3=1"},
"configmap:ns/cm2": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm2": {"node:node1=2", "node:node2=1", "node:node3=1"},
"configmap:ns/cm3": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm3": {"node:node1=2", "node:node2=1", "node:node3=1"},
"serviceAccount:ns/sa1": {"node:node1", "node:node2", "node:node3"}, "serviceAccount:ns/sa1": {"node:node1=2", "node:node2=1", "node:node3=1"},
}) })
// delete one to remain above the threshold // delete one to remain above the threshold
@ -338,10 +338,10 @@ func TestIndex(t *testing.T) {
"serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"}, "serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"},
}) })
expectIndex(map[string][]string{ expectIndex(map[string][]string{
"configmap:ns/cm1": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm1": {"node:node1=1", "node:node2=1", "node:node3=1"},
"configmap:ns/cm2": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm2": {"node:node1=1", "node:node2=1", "node:node3=1"},
"configmap:ns/cm3": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm3": {"node:node1=1", "node:node2=1", "node:node3=1"},
"serviceAccount:ns/sa1": {"node:node1", "node:node2", "node:node3"}, "serviceAccount:ns/sa1": {"node:node1=1", "node:node2=1", "node:node3=1"},
}) })
// Set node->configmap references // Set node->configmap references
@ -363,10 +363,10 @@ func TestIndex(t *testing.T) {
"serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"}, "serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"},
}) })
expectIndex(map[string][]string{ expectIndex(map[string][]string{
"configmap:ns/cm1": {"node:node1", "node:node2", "node:node3", "node:node4"}, "configmap:ns/cm1": {"node:node1=2", "node:node2=2", "node:node3=2", "node:node4=1"},
"configmap:ns/cm2": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm2": {"node:node1=1", "node:node2=1", "node:node3=1"},
"configmap:ns/cm3": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm3": {"node:node1=1", "node:node2=1", "node:node3=1"},
"serviceAccount:ns/sa1": {"node:node1", "node:node2", "node:node3"}, "serviceAccount:ns/sa1": {"node:node1=1", "node:node2=1", "node:node3=1"},
}) })
// Update node->configmap reference // Update node->configmap reference
@ -385,10 +385,10 @@ func TestIndex(t *testing.T) {
"serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"}, "serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"},
}) })
expectIndex(map[string][]string{ expectIndex(map[string][]string{
"configmap:ns/cm1": {"node:node1", "node:node2", "node:node3", "node:node4"}, "configmap:ns/cm1": {"node:node1=1", "node:node2=2", "node:node3=2", "node:node4=1"},
"configmap:ns/cm2": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm2": {"node:node1=2", "node:node2=1", "node:node3=1"},
"configmap:ns/cm3": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm3": {"node:node1=1", "node:node2=1", "node:node3=1"},
"serviceAccount:ns/sa1": {"node:node1", "node:node2", "node:node3"}, "serviceAccount:ns/sa1": {"node:node1=1", "node:node2=1", "node:node3=1"},
}) })
// Remove node->configmap reference // Remove node->configmap reference
@ -408,9 +408,9 @@ func TestIndex(t *testing.T) {
"serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"}, "serviceAccount:ns/sa1": {"pod:ns/pod2", "pod:ns/pod3", "pod:ns/pod4"},
}) })
expectIndex(map[string][]string{ expectIndex(map[string][]string{
"configmap:ns/cm1": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm1": {"node:node1=1", "node:node2=2", "node:node3=2"},
"configmap:ns/cm2": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm2": {"node:node1=1", "node:node2=1", "node:node3=1"},
"configmap:ns/cm3": {"node:node1", "node:node2", "node:node3"}, "configmap:ns/cm3": {"node:node1=1", "node:node2=1", "node:node3=1"},
"serviceAccount:ns/sa1": {"node:node1", "node:node2", "node:node3"}, "serviceAccount:ns/sa1": {"node:node1=1", "node:node2=1", "node:node3=1"},
}) })
} }

View File

@ -16,47 +16,47 @@ limitations under the License.
package node package node
// intSet maintains a set of ints, and supports promoting and culling the previous generation. // intSet maintains a map of id to refcounts
// this allows tracking a large, mostly-stable set without constantly reallocating the entire set.
type intSet struct { type intSet struct {
currentGeneration byte // members is a map of id to refcounts
members map[int]byte members map[int]int
} }
func newIntSet() *intSet { func newIntSet() *intSet {
return &intSet{members: map[int]byte{}} return &intSet{members: map[int]int{}}
} }
// has returns true if the specified int is in the set. // has returns true if the specified id has a positive refcount.
// it is safe to call concurrently, but must not be called concurrently with any of the other methods. // it is safe to call concurrently, but must not be called concurrently with any of the other methods.
func (s *intSet) has(i int) bool { func (s *intSet) has(i int) bool {
if s == nil { if s == nil {
return false return false
} }
_, present := s.members[i] return s.members[i] > 0
return present
} }
// startNewGeneration begins a new generation. // reset removes all ids, effectively setting their refcounts to 0.
// it must be followed by a call to mark() for every member of the generation,
// then a call to sweep() to remove members not present in the generation.
// it is not thread-safe. // it is not thread-safe.
func (s *intSet) startNewGeneration() { func (s *intSet) reset() {
s.currentGeneration++ for k := range s.members {
}
// mark indicates the specified int belongs to the current generation.
// it is not thread-safe.
func (s *intSet) mark(i int) {
s.members[i] = s.currentGeneration
}
// sweep removes items not in the current generation.
// it is not thread-safe.
func (s *intSet) sweep() {
for k, v := range s.members {
if v != s.currentGeneration {
delete(s.members, k) delete(s.members, k)
} }
}
// increment adds one to the refcount of the specified id.
// it is not thread-safe.
func (s *intSet) increment(i int) {
s.members[i]++
}
// decrement removes one from the refcount of the specified id,
// and removes the id if the resulting refcount is <= 0.
// it will not track refcounts lower than zero.
// it is not thread-safe.
func (s *intSet) decrement(i int) {
if s.members[i] <= 1 {
delete(s.members, i)
} else {
s.members[i]--
} }
} }

View File

@ -30,33 +30,36 @@ func TestIntSet(t *testing.T) {
assert.False(t, i.has(3)) assert.False(t, i.has(3))
assert.False(t, i.has(4)) assert.False(t, i.has(4))
i.startNewGeneration() i.reset()
i.mark(1) i.increment(1) // to 1
i.mark(2) i.increment(2) // to 1
i.sweep()
assert.True(t, i.has(1)) assert.True(t, i.has(1))
assert.True(t, i.has(2)) assert.True(t, i.has(2))
assert.False(t, i.has(3)) assert.False(t, i.has(3))
assert.False(t, i.has(4)) assert.False(t, i.has(4))
i.startNewGeneration() i.decrement(1) // to 0
i.mark(2) i.increment(3) // to 1
i.mark(3)
i.sweep()
assert.False(t, i.has(1)) assert.False(t, i.has(1)) // removed
assert.True(t, i.has(2)) assert.True(t, i.has(2)) // still present
assert.True(t, i.has(3)) assert.True(t, i.has(3)) // added
assert.False(t, i.has(4)) assert.False(t, i.has(4)) // not yet present
i.startNewGeneration() i.decrement(2) // to 0
i.mark(3) i.increment(3) // to 2
i.mark(4) i.decrement(3) // to 1
i.sweep() i.increment(4) // to 1
assert.False(t, i.has(1)) assert.False(t, i.has(1))
assert.False(t, i.has(2)) assert.False(t, i.has(2))
assert.True(t, i.has(3)) assert.True(t, i.has(3))
assert.True(t, i.has(4)) assert.True(t, i.has(4))
i.reset()
assert.False(t, i.has(1))
assert.False(t, i.has(2))
assert.False(t, i.has(3))
assert.False(t, i.has(4))
} }