github/kubernetes
1
0
Fork 0
mirror of https://github.com/k3s-io/kubernetes.git synced 2025-07-27 05:27:21 +00:00
Code Issues Projects Releases Wiki Activity

matchPredicate does not fit findByClaim()

Browse Source 
matchPredicate has two args which are type of PV,and is not used in function findByClaim(),remove it
This commit is contained in:
NickrenREN 2017-03-07 16:15:55 +08:00 committed by NickrenREN
parent 31db570a00
commit 67a55a4b02
2 changed files with 11 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
pkg/controller/volume/persistentvolume/index.go
View File

@ -68,11 +68,8 @@ func (pvIndex *persistentVolumeOrderedIndex) listByAccessModes(modes []v1.Persis
return volumes, nil return volumes, nil
} }
// matchPredicate is a function that indicates that a persistent volume matches another
type matchPredicate func(compareThis, toThis *v1.PersistentVolume) bool
// find returns the nearest PV from the ordered list or nil if a match is not found // find returns the nearest PV from the ordered list or nil if a match is not found
func (pvIndex *persistentVolumeOrderedIndex) findByClaim(claim *v1.PersistentVolumeClaim, matchPredicate matchPredicate) (*v1.PersistentVolume, error) { func (pvIndex *persistentVolumeOrderedIndex) findByClaim(claim *v1.PersistentVolumeClaim) (*v1.PersistentVolume, error) {
// PVs are indexed by their access modes to allow easier searching. Each // PVs are indexed by their access modes to allow easier searching. Each
// index is the string representation of a set of access modes. There is a // index is the string representation of a set of access modes. There is a
// finite number of possible sets and PVs will only be indexed in one of // finite number of possible sets and PVs will only be indexed in one of
@ -170,16 +167,7 @@ func (pvIndex *persistentVolumeOrderedIndex) findByClaim(claim *v1.PersistentVol
// findBestMatchForClaim is a convenience method that finds a volume by the claim's AccessModes and requests for Storage // findBestMatchForClaim is a convenience method that finds a volume by the claim's AccessModes and requests for Storage
func (pvIndex *persistentVolumeOrderedIndex) findBestMatchForClaim(claim *v1.PersistentVolumeClaim) (*v1.PersistentVolume, error) { func (pvIndex *persistentVolumeOrderedIndex) findBestMatchForClaim(claim *v1.PersistentVolumeClaim) (*v1.PersistentVolume, error) {
return pvIndex.findByClaim(claim, matchStorageCapacity) return pvIndex.findByClaim(claim)
}
// matchStorageCapacity is a matchPredicate used to sort and find volumes
func matchStorageCapacity(pvA, pvB *v1.PersistentVolume) bool {
aQty := pvA.Spec.Capacity[v1.ResourceStorage]
bQty := pvB.Spec.Capacity[v1.ResourceStorage]
aSize := aQty.Value()
bSize := bQty.Value()
return aSize <= bSize
} }
// allPossibleMatchingAccessModes returns an array of AccessMode arrays that // allPossibleMatchingAccessModes returns an array of AccessMode arrays that

9
pkg/controller/volume/persistentvolume/index_test.go
View File

@ -689,3 +689,12 @@ func (c byCapacity) Swap(i, j int) {
func (c byCapacity) Len() int { func (c byCapacity) Len() int {
return len(c.volumes) return len(c.volumes)
} }
// matchStorageCapacity is a matchPredicate used to sort and find volumes
func matchStorageCapacity(pvA, pvB *v1.PersistentVolume) bool {
aQty := pvA.Spec.Capacity[v1.ResourceStorage]
bQty := pvB.Spec.Capacity[v1.ResourceStorage]
aSize := aQty.Value()
bSize := bQty.Value()
return aSize <= bSize
}