range_perm_cache.go 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203
  1. // Copyright 2016 The etcd Authors
  2. //
  3. // Licensed under the Apache License, Version 2.0 (the "License");
  4. // you may not use this file except in compliance with the License.
  5. // You may obtain a copy of the License at
  6. //
  7. // http://www.apache.org/licenses/LICENSE-2.0
  8. //
  9. // Unless required by applicable law or agreed to in writing, software
  10. // distributed under the License is distributed on an "AS IS" BASIS,
  11. // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12. // See the License for the specific language governing permissions and
  13. // limitations under the License.
  14. package auth
  15. import (
  16. "bytes"
  17. "sort"
  18. "github.com/coreos/etcd/auth/authpb"
  19. "github.com/coreos/etcd/mvcc/backend"
  20. )
  21. // isSubset returns true if a is a subset of b
  22. func isSubset(a, b *rangePerm) bool {
  23. switch {
  24. case len(a.end) == 0 && len(b.end) == 0:
  25. // a, b are both keys
  26. return bytes.Equal(a.begin, b.begin)
  27. case len(b.end) == 0:
  28. // b is a key, a is a range
  29. return false
  30. case len(a.end) == 0:
  31. return 0 <= bytes.Compare(a.begin, b.begin) && bytes.Compare(a.begin, b.end) <= 0
  32. default:
  33. return 0 <= bytes.Compare(a.begin, b.begin) && bytes.Compare(a.end, b.end) <= 0
  34. }
  35. }
  36. // removeSubsetRangePerms removes any rangePerms that are subsets of other rangePerms.
  37. func removeSubsetRangePerms(perms []*rangePerm) []*rangePerm {
  38. // TODO(mitake): currently it is O(n^2), we need a better algorithm
  39. newp := make([]*rangePerm, 0)
  40. for i := range perms {
  41. subset := false
  42. for j := range perms {
  43. if i != j && isSubset(perms[i], perms[j]) {
  44. subset = true
  45. break
  46. }
  47. }
  48. if subset {
  49. continue
  50. }
  51. newp = append(newp, perms[i])
  52. }
  53. return newp
  54. }
  55. // mergeRangePerms merges adjacent rangePerms.
  56. func mergeRangePerms(perms []*rangePerm) []*rangePerm {
  57. merged := make([]*rangePerm, 0)
  58. perms = removeSubsetRangePerms(perms)
  59. sort.Sort(RangePermSliceByBegin(perms))
  60. i := 0
  61. for i < len(perms) {
  62. begin, next := i, i
  63. for next+1 < len(perms) && bytes.Compare(perms[next].end, perms[next+1].begin) != -1 {
  64. next++
  65. }
  66. merged = append(merged, &rangePerm{begin: perms[begin].begin, end: perms[next].end})
  67. i = next + 1
  68. }
  69. return merged
  70. }
  71. func getMergedPerms(tx backend.BatchTx, userName string) *unifiedRangePermissions {
  72. user := getUser(tx, userName)
  73. if user == nil {
  74. plog.Errorf("invalid user name %s", userName)
  75. return nil
  76. }
  77. var readPerms, writePerms []*rangePerm
  78. for _, roleName := range user.Roles {
  79. role := getRole(tx, roleName)
  80. if role == nil {
  81. continue
  82. }
  83. for _, perm := range role.KeyPermission {
  84. rp := &rangePerm{begin: perm.Key, end: perm.RangeEnd}
  85. switch perm.PermType {
  86. case authpb.READWRITE:
  87. readPerms = append(readPerms, rp)
  88. writePerms = append(writePerms, rp)
  89. case authpb.READ:
  90. readPerms = append(readPerms, rp)
  91. case authpb.WRITE:
  92. writePerms = append(writePerms, rp)
  93. }
  94. }
  95. }
  96. return &unifiedRangePermissions{
  97. readPerms: mergeRangePerms(readPerms),
  98. writePerms: mergeRangePerms(writePerms),
  99. }
  100. }
  101. func checkKeyPerm(cachedPerms *unifiedRangePermissions, key, rangeEnd []byte, permtyp authpb.Permission_Type) bool {
  102. var tocheck []*rangePerm
  103. switch permtyp {
  104. case authpb.READ:
  105. tocheck = cachedPerms.readPerms
  106. case authpb.WRITE:
  107. tocheck = cachedPerms.writePerms
  108. default:
  109. plog.Panicf("unknown auth type: %v", permtyp)
  110. }
  111. requiredPerm := &rangePerm{begin: key, end: rangeEnd}
  112. for _, perm := range tocheck {
  113. if isSubset(requiredPerm, perm) {
  114. return true
  115. }
  116. }
  117. return false
  118. }
  119. func (as *authStore) isRangeOpPermitted(tx backend.BatchTx, userName string, key, rangeEnd []byte, permtyp authpb.Permission_Type) bool {
  120. // assumption: tx is Lock()ed
  121. _, ok := as.rangePermCache[userName]
  122. if !ok {
  123. perms := getMergedPerms(tx, userName)
  124. if perms == nil {
  125. plog.Errorf("failed to create a unified permission of user %s", userName)
  126. return false
  127. }
  128. as.rangePermCache[userName] = perms
  129. }
  130. return checkKeyPerm(as.rangePermCache[userName], key, rangeEnd, permtyp)
  131. }
  132. func (as *authStore) clearCachedPerm() {
  133. as.rangePermCache = make(map[string]*unifiedRangePermissions)
  134. }
  135. func (as *authStore) invalidateCachedPerm(userName string) {
  136. delete(as.rangePermCache, userName)
  137. }
  138. type unifiedRangePermissions struct {
  139. // readPerms[i] and readPerms[j] (i != j) don't overlap
  140. readPerms []*rangePerm
  141. // writePerms[i] and writePerms[j] (i != j) don't overlap, too
  142. writePerms []*rangePerm
  143. }
  144. type rangePerm struct {
  145. begin, end []byte
  146. }
  147. type RangePermSliceByBegin []*rangePerm
  148. func (slice RangePermSliceByBegin) Len() int {
  149. return len(slice)
  150. }
  151. func (slice RangePermSliceByBegin) Less(i, j int) bool {
  152. switch bytes.Compare(slice[i].begin, slice[j].begin) {
  153. case 0: // begin(i) == begin(j)
  154. return bytes.Compare(slice[i].end, slice[j].end) == -1
  155. case -1: // begin(i) < begin(j)
  156. return true
  157. default:
  158. return false
  159. }
  160. }
  161. func (slice RangePermSliceByBegin) Swap(i, j int) {
  162. slice[i], slice[j] = slice[j], slice[i]
  163. }