mirror of https://github.com/k3s-io/k3s
93 lines
2.2 KiB
Go
93 lines
2.2 KiB
Go
// +build !providerless
|
|
|
|
/*
|
|
Copyright 2019 The Kubernetes Authors.
|
|
|
|
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 azure
|
|
|
|
import (
|
|
"sync"
|
|
"time"
|
|
|
|
utilerrors "k8s.io/apimachinery/pkg/util/errors"
|
|
)
|
|
|
|
// lockMap used to lock on entries
|
|
type lockMap struct {
|
|
sync.Mutex
|
|
mutexMap map[string]*sync.Mutex
|
|
}
|
|
|
|
// NewLockMap returns a new lock map
|
|
func newLockMap() *lockMap {
|
|
return &lockMap{
|
|
mutexMap: make(map[string]*sync.Mutex),
|
|
}
|
|
}
|
|
|
|
// LockEntry acquires a lock associated with the specific entry
|
|
func (lm *lockMap) LockEntry(entry string) {
|
|
lm.Lock()
|
|
// check if entry does not exists, then add entry
|
|
if _, exists := lm.mutexMap[entry]; !exists {
|
|
lm.addEntry(entry)
|
|
}
|
|
|
|
lm.Unlock()
|
|
lm.lockEntry(entry)
|
|
}
|
|
|
|
// UnlockEntry release the lock associated with the specific entry
|
|
func (lm *lockMap) UnlockEntry(entry string) {
|
|
lm.Lock()
|
|
defer lm.Unlock()
|
|
|
|
if _, exists := lm.mutexMap[entry]; !exists {
|
|
return
|
|
}
|
|
lm.unlockEntry(entry)
|
|
}
|
|
|
|
func (lm *lockMap) addEntry(entry string) {
|
|
lm.mutexMap[entry] = &sync.Mutex{}
|
|
}
|
|
|
|
func (lm *lockMap) lockEntry(entry string) {
|
|
lm.mutexMap[entry].Lock()
|
|
}
|
|
|
|
func (lm *lockMap) unlockEntry(entry string) {
|
|
lm.mutexMap[entry].Unlock()
|
|
}
|
|
|
|
// aggregateGoroutinesWithDelay aggregates goroutines and runs them
|
|
// in parallel with delay before starting each goroutine
|
|
func aggregateGoroutinesWithDelay(delay time.Duration, funcs ...func() error) utilerrors.Aggregate {
|
|
errChan := make(chan error, len(funcs))
|
|
|
|
for _, f := range funcs {
|
|
go func(f func() error) { errChan <- f() }(f)
|
|
time.Sleep(delay)
|
|
}
|
|
errs := make([]error, 0)
|
|
for i := 0; i < cap(errChan); i++ {
|
|
if err := <-errChan; err != nil {
|
|
errs = append(errs, err)
|
|
}
|
|
}
|
|
return utilerrors.NewAggregate(errs)
|
|
}
|