apply.go 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692
  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 etcdserver
  15. import (
  16. "bytes"
  17. "fmt"
  18. "sort"
  19. "github.com/coreos/etcd/auth"
  20. pb "github.com/coreos/etcd/etcdserver/etcdserverpb"
  21. "github.com/coreos/etcd/lease"
  22. "github.com/coreos/etcd/mvcc"
  23. "github.com/coreos/etcd/mvcc/mvccpb"
  24. "github.com/coreos/etcd/pkg/types"
  25. "github.com/gogo/protobuf/proto"
  26. )
  27. const (
  28. // noTxn is an invalid txn ID.
  29. // To apply with independent Range, Put, Delete, you can pass noTxn
  30. // to apply functions instead of a valid txn ID.
  31. noTxn = -1
  32. )
  33. type applyResult struct {
  34. resp proto.Message
  35. err error
  36. // physc signals the physical effect of the request has completed in addition
  37. // to being logically reflected by the node. Currently only used for
  38. // Compaction requests.
  39. physc <-chan struct{}
  40. }
  41. // applierV3 is the interface for processing V3 raft messages
  42. type applierV3 interface {
  43. Put(txnID int64, p *pb.PutRequest) (*pb.PutResponse, error)
  44. Range(txnID int64, r *pb.RangeRequest) (*pb.RangeResponse, error)
  45. DeleteRange(txnID int64, dr *pb.DeleteRangeRequest) (*pb.DeleteRangeResponse, error)
  46. Txn(rt *pb.TxnRequest) (*pb.TxnResponse, error)
  47. Compaction(compaction *pb.CompactionRequest) (*pb.CompactionResponse, <-chan struct{}, error)
  48. LeaseGrant(lc *pb.LeaseGrantRequest) (*pb.LeaseGrantResponse, error)
  49. LeaseRevoke(lc *pb.LeaseRevokeRequest) (*pb.LeaseRevokeResponse, error)
  50. Alarm(*pb.AlarmRequest) (*pb.AlarmResponse, error)
  51. AuthEnable() (*pb.AuthEnableResponse, error)
  52. AuthDisable() (*pb.AuthDisableResponse, error)
  53. Authenticate(r *pb.AuthenticateRequest) (*pb.AuthenticateResponse, error)
  54. UserAdd(ua *pb.AuthUserAddRequest) (*pb.AuthUserAddResponse, error)
  55. UserDelete(ua *pb.AuthUserDeleteRequest) (*pb.AuthUserDeleteResponse, error)
  56. UserChangePassword(ua *pb.AuthUserChangePasswordRequest) (*pb.AuthUserChangePasswordResponse, error)
  57. UserGrant(ua *pb.AuthUserGrantRequest) (*pb.AuthUserGrantResponse, error)
  58. UserGet(ua *pb.AuthUserGetRequest) (*pb.AuthUserGetResponse, error)
  59. UserRevoke(ua *pb.AuthUserRevokeRequest) (*pb.AuthUserRevokeResponse, error)
  60. RoleAdd(ua *pb.AuthRoleAddRequest) (*pb.AuthRoleAddResponse, error)
  61. RoleGrant(ua *pb.AuthRoleGrantRequest) (*pb.AuthRoleGrantResponse, error)
  62. RoleGet(ua *pb.AuthRoleGetRequest) (*pb.AuthRoleGetResponse, error)
  63. }
  64. type applierV3backend struct {
  65. s *EtcdServer
  66. }
  67. func (s *EtcdServer) applyV3Request(r *pb.InternalRaftRequest) *applyResult {
  68. ar := &applyResult{}
  69. switch {
  70. case r.Range != nil:
  71. if s.AuthStore().IsRangePermitted(r.Header, string(r.Range.Key)) {
  72. ar.resp, ar.err = s.applyV3.Range(noTxn, r.Range)
  73. } else {
  74. ar.err = auth.ErrPermissionDenied
  75. }
  76. case r.Put != nil:
  77. if s.AuthStore().IsPutPermitted(r.Header, string(r.Put.Key)) {
  78. ar.resp, ar.err = s.applyV3.Put(noTxn, r.Put)
  79. } else {
  80. ar.err = auth.ErrPermissionDenied
  81. }
  82. case r.DeleteRange != nil:
  83. ar.resp, ar.err = s.applyV3.DeleteRange(noTxn, r.DeleteRange)
  84. case r.Txn != nil:
  85. ar.resp, ar.err = s.applyV3.Txn(r.Txn)
  86. case r.Compaction != nil:
  87. ar.resp, ar.physc, ar.err = s.applyV3.Compaction(r.Compaction)
  88. case r.LeaseGrant != nil:
  89. ar.resp, ar.err = s.applyV3.LeaseGrant(r.LeaseGrant)
  90. case r.LeaseRevoke != nil:
  91. ar.resp, ar.err = s.applyV3.LeaseRevoke(r.LeaseRevoke)
  92. case r.Alarm != nil:
  93. ar.resp, ar.err = s.applyV3.Alarm(r.Alarm)
  94. case r.AuthEnable != nil:
  95. ar.resp, ar.err = s.applyV3.AuthEnable()
  96. case r.AuthDisable != nil:
  97. ar.resp, ar.err = s.applyV3.AuthDisable()
  98. case r.Authenticate != nil:
  99. ar.resp, ar.err = s.applyV3.Authenticate(r.Authenticate)
  100. case r.AuthUserAdd != nil:
  101. ar.resp, ar.err = s.applyV3.UserAdd(r.AuthUserAdd)
  102. case r.AuthUserDelete != nil:
  103. ar.resp, ar.err = s.applyV3.UserDelete(r.AuthUserDelete)
  104. case r.AuthUserChangePassword != nil:
  105. ar.resp, ar.err = s.applyV3.UserChangePassword(r.AuthUserChangePassword)
  106. case r.AuthUserGrant != nil:
  107. ar.resp, ar.err = s.applyV3.UserGrant(r.AuthUserGrant)
  108. case r.AuthUserGet != nil:
  109. ar.resp, ar.err = s.applyV3.UserGet(r.AuthUserGet)
  110. case r.AuthUserRevoke != nil:
  111. ar.resp, ar.err = s.applyV3.UserRevoke(r.AuthUserRevoke)
  112. case r.AuthRoleAdd != nil:
  113. ar.resp, ar.err = s.applyV3.RoleAdd(r.AuthRoleAdd)
  114. case r.AuthRoleGrant != nil:
  115. ar.resp, ar.err = s.applyV3.RoleGrant(r.AuthRoleGrant)
  116. case r.AuthRoleGet != nil:
  117. ar.resp, ar.err = s.applyV3.RoleGet(r.AuthRoleGet)
  118. default:
  119. panic("not implemented")
  120. }
  121. return ar
  122. }
  123. func (a *applierV3backend) Put(txnID int64, p *pb.PutRequest) (*pb.PutResponse, error) {
  124. resp := &pb.PutResponse{}
  125. resp.Header = &pb.ResponseHeader{}
  126. var (
  127. rev int64
  128. err error
  129. )
  130. if txnID != noTxn {
  131. rev, err = a.s.KV().TxnPut(txnID, p.Key, p.Value, lease.LeaseID(p.Lease))
  132. if err != nil {
  133. return nil, err
  134. }
  135. } else {
  136. leaseID := lease.LeaseID(p.Lease)
  137. if leaseID != lease.NoLease {
  138. if l := a.s.lessor.Lookup(leaseID); l == nil {
  139. return nil, lease.ErrLeaseNotFound
  140. }
  141. }
  142. rev = a.s.KV().Put(p.Key, p.Value, leaseID)
  143. }
  144. resp.Header.Revision = rev
  145. return resp, nil
  146. }
  147. func (a *applierV3backend) DeleteRange(txnID int64, dr *pb.DeleteRangeRequest) (*pb.DeleteRangeResponse, error) {
  148. resp := &pb.DeleteRangeResponse{}
  149. resp.Header = &pb.ResponseHeader{}
  150. var (
  151. n int64
  152. rev int64
  153. err error
  154. )
  155. if isGteRange(dr.RangeEnd) {
  156. dr.RangeEnd = []byte{}
  157. }
  158. if txnID != noTxn {
  159. n, rev, err = a.s.KV().TxnDeleteRange(txnID, dr.Key, dr.RangeEnd)
  160. if err != nil {
  161. return nil, err
  162. }
  163. } else {
  164. n, rev = a.s.KV().DeleteRange(dr.Key, dr.RangeEnd)
  165. }
  166. resp.Deleted = n
  167. resp.Header.Revision = rev
  168. return resp, nil
  169. }
  170. func (a *applierV3backend) Range(txnID int64, r *pb.RangeRequest) (*pb.RangeResponse, error) {
  171. resp := &pb.RangeResponse{}
  172. resp.Header = &pb.ResponseHeader{}
  173. var (
  174. kvs []mvccpb.KeyValue
  175. rev int64
  176. err error
  177. )
  178. if isGteRange(r.RangeEnd) {
  179. r.RangeEnd = []byte{}
  180. }
  181. limit := r.Limit
  182. if r.SortOrder != pb.RangeRequest_NONE {
  183. // fetch everything; sort and truncate afterwards
  184. limit = 0
  185. }
  186. if limit > 0 {
  187. // fetch one extra for 'more' flag
  188. limit = limit + 1
  189. }
  190. if txnID != noTxn {
  191. kvs, rev, err = a.s.KV().TxnRange(txnID, r.Key, r.RangeEnd, limit, r.Revision)
  192. if err != nil {
  193. return nil, err
  194. }
  195. } else {
  196. kvs, rev, err = a.s.KV().Range(r.Key, r.RangeEnd, limit, r.Revision)
  197. if err != nil {
  198. return nil, err
  199. }
  200. }
  201. if r.SortOrder != pb.RangeRequest_NONE {
  202. var sorter sort.Interface
  203. switch {
  204. case r.SortTarget == pb.RangeRequest_KEY:
  205. sorter = &kvSortByKey{&kvSort{kvs}}
  206. case r.SortTarget == pb.RangeRequest_VERSION:
  207. sorter = &kvSortByVersion{&kvSort{kvs}}
  208. case r.SortTarget == pb.RangeRequest_CREATE:
  209. sorter = &kvSortByCreate{&kvSort{kvs}}
  210. case r.SortTarget == pb.RangeRequest_MOD:
  211. sorter = &kvSortByMod{&kvSort{kvs}}
  212. case r.SortTarget == pb.RangeRequest_VALUE:
  213. sorter = &kvSortByValue{&kvSort{kvs}}
  214. }
  215. switch {
  216. case r.SortOrder == pb.RangeRequest_ASCEND:
  217. sort.Sort(sorter)
  218. case r.SortOrder == pb.RangeRequest_DESCEND:
  219. sort.Sort(sort.Reverse(sorter))
  220. }
  221. }
  222. if r.Limit > 0 && len(kvs) > int(r.Limit) {
  223. kvs = kvs[:r.Limit]
  224. resp.More = true
  225. }
  226. resp.Header.Revision = rev
  227. for i := range kvs {
  228. resp.Kvs = append(resp.Kvs, &kvs[i])
  229. }
  230. return resp, nil
  231. }
  232. func (a *applierV3backend) Txn(rt *pb.TxnRequest) (*pb.TxnResponse, error) {
  233. ok := true
  234. for _, c := range rt.Compare {
  235. if _, ok = a.applyCompare(c); !ok {
  236. break
  237. }
  238. }
  239. var reqs []*pb.RequestUnion
  240. if ok {
  241. reqs = rt.Success
  242. } else {
  243. reqs = rt.Failure
  244. }
  245. if err := a.checkRequestLeases(reqs); err != nil {
  246. return nil, err
  247. }
  248. if err := a.checkRequestRange(reqs); err != nil {
  249. return nil, err
  250. }
  251. revision := a.s.KV().Rev()
  252. // When executing the operations of txn, we need to hold the txn lock.
  253. // So the reader will not see any intermediate results.
  254. txnID := a.s.KV().TxnBegin()
  255. defer func() {
  256. err := a.s.KV().TxnEnd(txnID)
  257. if err != nil {
  258. panic(fmt.Sprint("unexpected error when closing txn", txnID))
  259. }
  260. }()
  261. resps := make([]*pb.ResponseUnion, len(reqs))
  262. changedKV := false
  263. for i := range reqs {
  264. if reqs[i].GetRequestRange() == nil {
  265. changedKV = true
  266. }
  267. resps[i] = a.applyUnion(txnID, reqs[i])
  268. }
  269. if changedKV {
  270. revision += 1
  271. }
  272. txnResp := &pb.TxnResponse{}
  273. txnResp.Header = &pb.ResponseHeader{}
  274. txnResp.Header.Revision = revision
  275. txnResp.Responses = resps
  276. txnResp.Succeeded = ok
  277. return txnResp, nil
  278. }
  279. // applyCompare applies the compare request.
  280. // It returns the revision at which the comparison happens. If the comparison
  281. // succeeds, the it returns true. Otherwise it returns false.
  282. func (a *applierV3backend) applyCompare(c *pb.Compare) (int64, bool) {
  283. ckvs, rev, err := a.s.KV().Range(c.Key, nil, 1, 0)
  284. if err != nil {
  285. if err == mvcc.ErrTxnIDMismatch {
  286. panic("unexpected txn ID mismatch error")
  287. }
  288. return rev, false
  289. }
  290. var ckv mvccpb.KeyValue
  291. if len(ckvs) != 0 {
  292. ckv = ckvs[0]
  293. } else {
  294. // Use the zero value of ckv normally. However...
  295. if c.Target == pb.Compare_VALUE {
  296. // Always fail if we're comparing a value on a key that doesn't exist.
  297. // We can treat non-existence as the empty set explicitly, such that
  298. // even a key with a value of length 0 bytes is still a real key
  299. // that was written that way
  300. return rev, false
  301. }
  302. }
  303. // -1 is less, 0 is equal, 1 is greater
  304. var result int
  305. switch c.Target {
  306. case pb.Compare_VALUE:
  307. tv, _ := c.TargetUnion.(*pb.Compare_Value)
  308. if tv != nil {
  309. result = bytes.Compare(ckv.Value, tv.Value)
  310. }
  311. case pb.Compare_CREATE:
  312. tv, _ := c.TargetUnion.(*pb.Compare_CreateRevision)
  313. if tv != nil {
  314. result = compareInt64(ckv.CreateRevision, tv.CreateRevision)
  315. }
  316. case pb.Compare_MOD:
  317. tv, _ := c.TargetUnion.(*pb.Compare_ModRevision)
  318. if tv != nil {
  319. result = compareInt64(ckv.ModRevision, tv.ModRevision)
  320. }
  321. case pb.Compare_VERSION:
  322. tv, _ := c.TargetUnion.(*pb.Compare_Version)
  323. if tv != nil {
  324. result = compareInt64(ckv.Version, tv.Version)
  325. }
  326. }
  327. switch c.Result {
  328. case pb.Compare_EQUAL:
  329. if result != 0 {
  330. return rev, false
  331. }
  332. case pb.Compare_GREATER:
  333. if result != 1 {
  334. return rev, false
  335. }
  336. case pb.Compare_LESS:
  337. if result != -1 {
  338. return rev, false
  339. }
  340. }
  341. return rev, true
  342. }
  343. func (a *applierV3backend) applyUnion(txnID int64, union *pb.RequestUnion) *pb.ResponseUnion {
  344. switch tv := union.Request.(type) {
  345. case *pb.RequestUnion_RequestRange:
  346. if tv.RequestRange != nil {
  347. resp, err := a.Range(txnID, tv.RequestRange)
  348. if err != nil {
  349. panic("unexpected error during txn")
  350. }
  351. return &pb.ResponseUnion{Response: &pb.ResponseUnion_ResponseRange{ResponseRange: resp}}
  352. }
  353. case *pb.RequestUnion_RequestPut:
  354. if tv.RequestPut != nil {
  355. resp, err := a.Put(txnID, tv.RequestPut)
  356. if err != nil {
  357. panic("unexpected error during txn")
  358. }
  359. return &pb.ResponseUnion{Response: &pb.ResponseUnion_ResponsePut{ResponsePut: resp}}
  360. }
  361. case *pb.RequestUnion_RequestDeleteRange:
  362. if tv.RequestDeleteRange != nil {
  363. resp, err := a.DeleteRange(txnID, tv.RequestDeleteRange)
  364. if err != nil {
  365. panic("unexpected error during txn")
  366. }
  367. return &pb.ResponseUnion{Response: &pb.ResponseUnion_ResponseDeleteRange{ResponseDeleteRange: resp}}
  368. }
  369. default:
  370. // empty union
  371. return nil
  372. }
  373. return nil
  374. }
  375. func (a *applierV3backend) Compaction(compaction *pb.CompactionRequest) (*pb.CompactionResponse, <-chan struct{}, error) {
  376. resp := &pb.CompactionResponse{}
  377. resp.Header = &pb.ResponseHeader{}
  378. ch, err := a.s.KV().Compact(compaction.Revision)
  379. if err != nil {
  380. return nil, ch, err
  381. }
  382. // get the current revision. which key to get is not important.
  383. _, resp.Header.Revision, _ = a.s.KV().Range([]byte("compaction"), nil, 1, 0)
  384. return resp, ch, err
  385. }
  386. func (a *applierV3backend) LeaseGrant(lc *pb.LeaseGrantRequest) (*pb.LeaseGrantResponse, error) {
  387. l, err := a.s.lessor.Grant(lease.LeaseID(lc.ID), lc.TTL)
  388. resp := &pb.LeaseGrantResponse{}
  389. if err == nil {
  390. resp.ID = int64(l.ID)
  391. resp.TTL = l.TTL
  392. resp.Header = &pb.ResponseHeader{Revision: a.s.KV().Rev()}
  393. }
  394. return resp, err
  395. }
  396. func (a *applierV3backend) LeaseRevoke(lc *pb.LeaseRevokeRequest) (*pb.LeaseRevokeResponse, error) {
  397. err := a.s.lessor.Revoke(lease.LeaseID(lc.ID))
  398. return &pb.LeaseRevokeResponse{Header: &pb.ResponseHeader{Revision: a.s.KV().Rev()}}, err
  399. }
  400. func (a *applierV3backend) Alarm(ar *pb.AlarmRequest) (*pb.AlarmResponse, error) {
  401. resp := &pb.AlarmResponse{}
  402. oldCount := len(a.s.alarmStore.Get(ar.Alarm))
  403. switch ar.Action {
  404. case pb.AlarmRequest_GET:
  405. resp.Alarms = a.s.alarmStore.Get(ar.Alarm)
  406. case pb.AlarmRequest_ACTIVATE:
  407. m := a.s.alarmStore.Activate(types.ID(ar.MemberID), ar.Alarm)
  408. if m == nil {
  409. break
  410. }
  411. resp.Alarms = append(resp.Alarms, m)
  412. activated := oldCount == 0 && len(a.s.alarmStore.Get(m.Alarm)) == 1
  413. if !activated {
  414. break
  415. }
  416. switch m.Alarm {
  417. case pb.AlarmType_NOSPACE:
  418. plog.Warningf("alarm raised %+v", m)
  419. a.s.applyV3 = newApplierV3Capped(a)
  420. default:
  421. plog.Errorf("unimplemented alarm activation (%+v)", m)
  422. }
  423. case pb.AlarmRequest_DEACTIVATE:
  424. m := a.s.alarmStore.Deactivate(types.ID(ar.MemberID), ar.Alarm)
  425. if m == nil {
  426. break
  427. }
  428. resp.Alarms = append(resp.Alarms, m)
  429. deactivated := oldCount > 0 && len(a.s.alarmStore.Get(ar.Alarm)) == 0
  430. if !deactivated {
  431. break
  432. }
  433. switch m.Alarm {
  434. case pb.AlarmType_NOSPACE:
  435. plog.Infof("alarm disarmed %+v", ar)
  436. a.s.applyV3 = newQuotaApplierV3(a.s, &applierV3backend{a.s})
  437. default:
  438. plog.Errorf("unimplemented alarm deactivation (%+v)", m)
  439. }
  440. default:
  441. return nil, nil
  442. }
  443. return resp, nil
  444. }
  445. type applierV3Capped struct {
  446. applierV3
  447. q backendQuota
  448. }
  449. // newApplierV3Capped creates an applyV3 that will reject Puts and transactions
  450. // with Puts so that the number of keys in the store is capped.
  451. func newApplierV3Capped(base applierV3) applierV3 { return &applierV3Capped{applierV3: base} }
  452. func (a *applierV3Capped) Put(txnID int64, p *pb.PutRequest) (*pb.PutResponse, error) {
  453. return nil, ErrNoSpace
  454. }
  455. func (a *applierV3Capped) Txn(r *pb.TxnRequest) (*pb.TxnResponse, error) {
  456. if a.q.Cost(r) > 0 {
  457. return nil, ErrNoSpace
  458. }
  459. return a.applierV3.Txn(r)
  460. }
  461. func (a *applierV3Capped) LeaseGrant(lc *pb.LeaseGrantRequest) (*pb.LeaseGrantResponse, error) {
  462. return nil, ErrNoSpace
  463. }
  464. func (a *applierV3backend) AuthEnable() (*pb.AuthEnableResponse, error) {
  465. a.s.AuthStore().AuthEnable()
  466. return &pb.AuthEnableResponse{}, nil
  467. }
  468. func (a *applierV3backend) AuthDisable() (*pb.AuthDisableResponse, error) {
  469. a.s.AuthStore().AuthDisable()
  470. return &pb.AuthDisableResponse{}, nil
  471. }
  472. func (a *applierV3backend) Authenticate(r *pb.AuthenticateRequest) (*pb.AuthenticateResponse, error) {
  473. return a.s.AuthStore().Authenticate(r.Name, r.Password)
  474. }
  475. func (a *applierV3backend) UserAdd(r *pb.AuthUserAddRequest) (*pb.AuthUserAddResponse, error) {
  476. return a.s.AuthStore().UserAdd(r)
  477. }
  478. func (a *applierV3backend) UserDelete(r *pb.AuthUserDeleteRequest) (*pb.AuthUserDeleteResponse, error) {
  479. return a.s.AuthStore().UserDelete(r)
  480. }
  481. func (a *applierV3backend) UserChangePassword(r *pb.AuthUserChangePasswordRequest) (*pb.AuthUserChangePasswordResponse, error) {
  482. return a.s.AuthStore().UserChangePassword(r)
  483. }
  484. func (a *applierV3backend) UserGrant(r *pb.AuthUserGrantRequest) (*pb.AuthUserGrantResponse, error) {
  485. return a.s.AuthStore().UserGrant(r)
  486. }
  487. func (a *applierV3backend) UserGet(r *pb.AuthUserGetRequest) (*pb.AuthUserGetResponse, error) {
  488. return a.s.AuthStore().UserGet(r)
  489. }
  490. func (a *applierV3backend) UserRevoke(r *pb.AuthUserRevokeRequest) (*pb.AuthUserRevokeResponse, error) {
  491. return a.s.AuthStore().UserRevoke(r)
  492. }
  493. func (a *applierV3backend) RoleAdd(r *pb.AuthRoleAddRequest) (*pb.AuthRoleAddResponse, error) {
  494. return a.s.AuthStore().RoleAdd(r)
  495. }
  496. func (a *applierV3backend) RoleGrant(r *pb.AuthRoleGrantRequest) (*pb.AuthRoleGrantResponse, error) {
  497. return a.s.AuthStore().RoleGrant(r)
  498. }
  499. func (a *applierV3backend) RoleGet(r *pb.AuthRoleGetRequest) (*pb.AuthRoleGetResponse, error) {
  500. return a.s.AuthStore().RoleGet(r)
  501. }
  502. type quotaApplierV3 struct {
  503. applierV3
  504. q Quota
  505. }
  506. func newQuotaApplierV3(s *EtcdServer, app applierV3) applierV3 {
  507. return &quotaApplierV3{app, NewBackendQuota(s)}
  508. }
  509. func (a *quotaApplierV3) Put(txnID int64, p *pb.PutRequest) (*pb.PutResponse, error) {
  510. ok := a.q.Available(p)
  511. resp, err := a.applierV3.Put(txnID, p)
  512. if err == nil && !ok {
  513. err = ErrNoSpace
  514. }
  515. return resp, err
  516. }
  517. func (a *quotaApplierV3) Txn(rt *pb.TxnRequest) (*pb.TxnResponse, error) {
  518. ok := a.q.Available(rt)
  519. resp, err := a.applierV3.Txn(rt)
  520. if err == nil && !ok {
  521. err = ErrNoSpace
  522. }
  523. return resp, err
  524. }
  525. func (a *quotaApplierV3) LeaseGrant(lc *pb.LeaseGrantRequest) (*pb.LeaseGrantResponse, error) {
  526. ok := a.q.Available(lc)
  527. resp, err := a.applierV3.LeaseGrant(lc)
  528. if err == nil && !ok {
  529. err = ErrNoSpace
  530. }
  531. return resp, err
  532. }
  533. type kvSort struct{ kvs []mvccpb.KeyValue }
  534. func (s *kvSort) Swap(i, j int) {
  535. t := s.kvs[i]
  536. s.kvs[i] = s.kvs[j]
  537. s.kvs[j] = t
  538. }
  539. func (s *kvSort) Len() int { return len(s.kvs) }
  540. type kvSortByKey struct{ *kvSort }
  541. func (s *kvSortByKey) Less(i, j int) bool {
  542. return bytes.Compare(s.kvs[i].Key, s.kvs[j].Key) < 0
  543. }
  544. type kvSortByVersion struct{ *kvSort }
  545. func (s *kvSortByVersion) Less(i, j int) bool {
  546. return (s.kvs[i].Version - s.kvs[j].Version) < 0
  547. }
  548. type kvSortByCreate struct{ *kvSort }
  549. func (s *kvSortByCreate) Less(i, j int) bool {
  550. return (s.kvs[i].CreateRevision - s.kvs[j].CreateRevision) < 0
  551. }
  552. type kvSortByMod struct{ *kvSort }
  553. func (s *kvSortByMod) Less(i, j int) bool {
  554. return (s.kvs[i].ModRevision - s.kvs[j].ModRevision) < 0
  555. }
  556. type kvSortByValue struct{ *kvSort }
  557. func (s *kvSortByValue) Less(i, j int) bool {
  558. return bytes.Compare(s.kvs[i].Value, s.kvs[j].Value) < 0
  559. }
  560. func (a *applierV3backend) checkRequestLeases(reqs []*pb.RequestUnion) error {
  561. for _, requ := range reqs {
  562. tv, ok := requ.Request.(*pb.RequestUnion_RequestPut)
  563. if !ok {
  564. continue
  565. }
  566. preq := tv.RequestPut
  567. if preq == nil || lease.LeaseID(preq.Lease) == lease.NoLease {
  568. continue
  569. }
  570. if l := a.s.lessor.Lookup(lease.LeaseID(preq.Lease)); l == nil {
  571. return lease.ErrLeaseNotFound
  572. }
  573. }
  574. return nil
  575. }
  576. func (a *applierV3backend) checkRequestRange(reqs []*pb.RequestUnion) error {
  577. for _, requ := range reqs {
  578. tv, ok := requ.Request.(*pb.RequestUnion_RequestRange)
  579. if !ok {
  580. continue
  581. }
  582. greq := tv.RequestRange
  583. if greq == nil || greq.Revision == 0 {
  584. continue
  585. }
  586. if greq.Revision > a.s.KV().Rev() {
  587. return mvcc.ErrFutureRev
  588. }
  589. if greq.Revision < a.s.KV().FirstRev() {
  590. return mvcc.ErrCompacted
  591. }
  592. }
  593. return nil
  594. }
  595. func compareInt64(a, b int64) int {
  596. switch {
  597. case a < b:
  598. return -1
  599. case a > b:
  600. return 1
  601. default:
  602. return 0
  603. }
  604. }
  605. // isGteRange determines if the range end is a >= range. This works around grpc
  606. // sending empty byte strings as nil; >= is encoded in the range end as '\0'.
  607. func isGteRange(rangeEnd []byte) bool {
  608. return len(rangeEnd) == 1 && rangeEnd[0] == 0
  609. }