Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | |
| 2 // Use of this source code is governed by a BSD-style license that can be | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 package memory | |
| 6 | |
| 7 import ( | |
| 8 "sync" | |
| 9 "time" | |
| 10 | |
| 11 "golang.org/x/net/context" | |
| 12 | |
| 13 "appengine/memcache" | |
| 14 | |
| 15 "infra/gae/libs/wrapper" | |
| 16 "infra/gae/libs/wrapper/unsafe" | |
| 17 ) | |
| 18 | |
| 19 type memcacheData struct { | |
| 20 lock sync.Mutex | |
| 21 items map[string]*unsafe.Item | |
| 22 casID uint64 | |
| 23 } | |
| 24 | |
| 25 // memcacheImpl binds the current connection's memcache data to an | |
| 26 // implementation of {wrapper.Memcache, wrapper.Testable}. | |
| 27 type memcacheImpl struct { | |
| 28 wrapper.Memcache | |
| 29 *wrapper.BrokenFeatures | |
| 30 | |
| 31 // TODO(riannucci): bind+use namespace too | |
| 32 | |
| 33 data *memcacheData | |
|
M-A Ruel
2015/05/25 18:21:10
Why a pointer?
iannucci
2015/05/27 19:33:32
because I want multiple goroutines to see + manipu
| |
| 34 timeNow func() time.Time | |
| 35 } | |
| 36 | |
| 37 // UseMC adds a wrapper.Memcache implementation to context, accessible | |
| 38 // by wrapper.GetMC(c) | |
| 39 func UseMC(c context.Context) context.Context { | |
| 40 lck := sync.Mutex{} | |
| 41 mcdMap := map[string]*memcacheData{} | |
| 42 | |
| 43 return wrapper.SetMCFactory(c, func(ic context.Context) wrapper.Memcache { | |
| 44 lck.Lock() | |
| 45 defer lck.Unlock() | |
| 46 | |
| 47 ns := curGID(ic).namespace | |
| 48 mcd, ok := mcdMap[ns] | |
| 49 if !ok { | |
| 50 mcd = &memcacheData{items: map[string]*unsafe.Item{}} | |
| 51 mcdMap[ns] = mcd | |
| 52 } | |
| 53 | |
| 54 return &memcacheImpl{ | |
| 55 wrapper.DummyMC(), | |
| 56 wrapper.NewBrokenFeatures(memcache.ErrServerError), | |
| 57 mcd, | |
| 58 func() time.Time { return wrapper.GetTimeNow(ic) }, | |
| 59 } | |
| 60 }) | |
| 61 } | |
| 62 | |
| 63 func (m *memcacheImpl) mkItem(i *memcache.Item) *unsafe.Item { | |
| 64 m.data.casID++ | |
| 65 var exp time.Duration | |
| 66 if i.Expiration != 0 { | |
| 67 exp = time.Duration(m.timeNow().Add(i.Expiration).UnixNano()) | |
| 68 } | |
| 69 newItem := unsafe.Item{ | |
| 70 Key: i.Key, | |
| 71 Value: make([]byte, len(i.Value)), | |
| 72 Flags: i.Flags, | |
| 73 Expiration: exp, | |
| 74 CasID: m.data.casID, | |
| 75 } | |
| 76 copy(newItem.Value, i.Value) | |
| 77 return &newItem | |
| 78 } | |
| 79 | |
| 80 func copyBack(i *unsafe.Item) *memcache.Item { | |
| 81 ret := &memcache.Item{ | |
| 82 Key: i.Key, | |
| 83 Value: make([]byte, len(i.Value)), | |
| 84 Flags: i.Flags, | |
| 85 } | |
| 86 copy(ret.Value, i.Value) | |
| 87 unsafe.MCSetCasID(ret, i.CasID) | |
| 88 | |
| 89 return ret | |
| 90 } | |
| 91 | |
| 92 func (m *memcacheImpl) retrieve(key string) (*unsafe.Item, bool) { | |
| 93 ret, ok := m.data.items[key] | |
| 94 if ok && ret.Expiration != 0 && ret.Expiration < time.Duration(m.timeNow ().UnixNano()) { | |
| 95 ret = nil | |
| 96 ok = false | |
| 97 delete(m.data.items, key) | |
| 98 } | |
| 99 return ret, ok | |
| 100 } | |
| 101 | |
| 102 // Add implements context.MCSingleReadWriter.Add. | |
| 103 func (m *memcacheImpl) Add(i *memcache.Item) error { | |
| 104 err := m.IsBroken() | |
|
M-A Ruel
2015/05/25 18:21:10
fits one line
same below
iannucci
2015/05/27 19:33:32
done (everywhere)
| |
| 105 if err != nil { | |
| 106 return err | |
| 107 } | |
| 108 | |
| 109 m.data.lock.Lock() | |
| 110 defer m.data.lock.Unlock() | |
| 111 | |
| 112 if _, ok := m.retrieve(i.Key); !ok { | |
| 113 m.data.items[i.Key] = m.mkItem(i) | |
| 114 return nil | |
| 115 } | |
| 116 return memcache.ErrNotStored | |
| 117 } | |
| 118 | |
| 119 // CompareAndSwap implements context.MCSingleReadWriter.CompareAndSwap. | |
| 120 func (m *memcacheImpl) CompareAndSwap(item *memcache.Item) error { | |
| 121 err := m.IsBroken() | |
| 122 if err != nil { | |
| 123 return err | |
| 124 } | |
| 125 | |
| 126 m.data.lock.Lock() | |
| 127 defer m.data.lock.Unlock() | |
| 128 | |
| 129 if cur, ok := m.retrieve(item.Key); ok { | |
| 130 if cur.CasID == unsafe.MCGetCasID(item) { | |
| 131 m.data.items[item.Key] = m.mkItem(item) | |
| 132 } else { | |
| 133 return memcache.ErrCASConflict | |
| 134 } | |
| 135 } else { | |
| 136 return memcache.ErrNotStored | |
| 137 } | |
| 138 return nil | |
| 139 } | |
| 140 | |
| 141 // Set implements context.MCSingleReadWriter.Set. | |
| 142 func (m *memcacheImpl) Set(i *memcache.Item) error { | |
| 143 err := m.IsBroken() | |
| 144 if err != nil { | |
| 145 return err | |
| 146 } | |
| 147 | |
| 148 m.data.items[i.Key] = m.mkItem(i) | |
| 149 return nil | |
| 150 } | |
| 151 | |
| 152 // Get implements context.MCSingleReadWriter.Get. | |
| 153 func (m *memcacheImpl) Get(key string) (*memcache.Item, error) { | |
| 154 err := m.IsBroken() | |
| 155 if err != nil { | |
| 156 return nil, err | |
| 157 } | |
| 158 | |
| 159 m.data.lock.Lock() | |
| 160 defer m.data.lock.Unlock() | |
| 161 | |
| 162 if val, ok := m.retrieve(key); ok { | |
| 163 return copyBack(val), nil | |
| 164 } | |
| 165 return nil, memcache.ErrCacheMiss | |
| 166 } | |
| 167 | |
| 168 // Delete implements context.MCSingleReadWriter.Delete. | |
| 169 func (m *memcacheImpl) Delete(key string) error { | |
| 170 err := m.IsBroken() | |
| 171 if err != nil { | |
| 172 return err | |
| 173 } | |
| 174 | |
| 175 m.data.lock.Lock() | |
| 176 defer m.data.lock.Unlock() | |
| 177 | |
| 178 if _, ok := m.retrieve(key); ok { | |
| 179 delete(m.data.items, key) | |
| 180 return nil | |
| 181 } | |
| 182 return memcache.ErrCacheMiss | |
| 183 } | |
| OLD | NEW |