OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The LUCI Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed under the Apache License, Version 2.0 |
3 // found in the LICENSE file. | 3 // that can be found in the LICENSE file. |
4 | 4 |
5 package dscache | 5 package dscache |
6 | 6 |
7 import ( | 7 import ( |
8 "sync" | 8 "sync" |
9 | 9 |
10 "github.com/luci/gae/service/datastore" | 10 "github.com/luci/gae/service/datastore" |
11 "github.com/luci/gae/service/memcache" | 11 "github.com/luci/gae/service/memcache" |
12 "github.com/luci/luci-go/common/errors" | 12 "github.com/luci/luci-go/common/errors" |
13 log "github.com/luci/luci-go/common/logging" | 13 log "github.com/luci/luci-go/common/logging" |
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
77 defer s.Unlock() | 77 defer s.Unlock() |
78 | 78 |
79 for i, li := range lockItems { | 79 for i, li := range lockItems { |
80 k := lockKeys[i] | 80 k := lockKeys[i] |
81 if _, ok := s.toDelete[k]; !ok { | 81 if _, ok := s.toDelete[k]; !ok { |
82 s.toLock = append(s.toLock, li) | 82 s.toLock = append(s.toLock, li) |
83 s.toDelete[k] = struct{}{} | 83 s.toDelete[k] = struct{}{} |
84 } | 84 } |
85 } | 85 } |
86 } | 86 } |
OLD | NEW |