|
| 1 | +// Copyright 2017 The Go Authors. All rights reserved. |
| 2 | +// Use of this source code is governed by a BSD-style |
| 3 | +// license that can be found in the LICENSE file. |
| 4 | + |
| 5 | +package gps |
| 6 | + |
| 7 | +import ( |
| 8 | + "github.com/golang/dep/internal/gps/pkgtree" |
| 9 | +) |
| 10 | + |
| 11 | +// A multiCache manages two cache levels, ephemeral in-memory and persistent on-disk. |
| 12 | +// |
| 13 | +// The in-memory cache is always checked first, with the on-disk used as a fallback. |
| 14 | +// Values read from disk are set in-memory when an appropriate method exists. |
| 15 | +// |
| 16 | +// Set values are cached both in-memory and on-disk. |
| 17 | +type multiCache struct { |
| 18 | + mem, disk singleSourceCache |
| 19 | +} |
| 20 | + |
| 21 | +func (c *multiCache) setManifestAndLock(r Revision, ai ProjectAnalyzerInfo, m Manifest, l Lock) { |
| 22 | + c.mem.setManifestAndLock(r, ai, m, l) |
| 23 | + c.disk.setManifestAndLock(r, ai, m, l) |
| 24 | +} |
| 25 | + |
| 26 | +func (c *multiCache) getManifestAndLock(r Revision, ai ProjectAnalyzerInfo) (Manifest, Lock, bool) { |
| 27 | + m, l, ok := c.mem.getManifestAndLock(r, ai) |
| 28 | + if ok { |
| 29 | + return m, l, true |
| 30 | + } |
| 31 | + |
| 32 | + m, l, ok = c.disk.getManifestAndLock(r, ai) |
| 33 | + if ok { |
| 34 | + c.mem.setManifestAndLock(r, ai, m, l) |
| 35 | + return m, l, true |
| 36 | + } |
| 37 | + |
| 38 | + return nil, nil, false |
| 39 | +} |
| 40 | + |
| 41 | +func (c *multiCache) setPackageTree(r Revision, ptree pkgtree.PackageTree) { |
| 42 | + c.mem.setPackageTree(r, ptree) |
| 43 | + c.disk.setPackageTree(r, ptree) |
| 44 | +} |
| 45 | + |
| 46 | +func (c *multiCache) getPackageTree(r Revision) (pkgtree.PackageTree, bool) { |
| 47 | + ptree, ok := c.mem.getPackageTree(r) |
| 48 | + if ok { |
| 49 | + return ptree, true |
| 50 | + } |
| 51 | + |
| 52 | + ptree, ok = c.disk.getPackageTree(r) |
| 53 | + if ok { |
| 54 | + c.mem.setPackageTree(r, ptree) |
| 55 | + return ptree, true |
| 56 | + } |
| 57 | + |
| 58 | + return pkgtree.PackageTree{}, false |
| 59 | +} |
| 60 | + |
| 61 | +func (c *multiCache) markRevisionExists(r Revision) { |
| 62 | + c.mem.markRevisionExists(r) |
| 63 | + c.disk.markRevisionExists(r) |
| 64 | +} |
| 65 | + |
| 66 | +func (c *multiCache) setVersionMap(pvs []PairedVersion) { |
| 67 | + c.mem.setVersionMap(pvs) |
| 68 | + c.disk.setVersionMap(pvs) |
| 69 | +} |
| 70 | + |
| 71 | +func (c *multiCache) getVersionsFor(rev Revision) ([]UnpairedVersion, bool) { |
| 72 | + uvs, ok := c.mem.getVersionsFor(rev) |
| 73 | + if ok { |
| 74 | + return uvs, true |
| 75 | + } |
| 76 | + |
| 77 | + return c.disk.getVersionsFor(rev) |
| 78 | +} |
| 79 | + |
| 80 | +func (c *multiCache) getAllVersions() []PairedVersion { |
| 81 | + pvs := c.mem.getAllVersions() |
| 82 | + if pvs != nil { |
| 83 | + return pvs |
| 84 | + } |
| 85 | + |
| 86 | + pvs = c.disk.getAllVersions() |
| 87 | + if pvs != nil { |
| 88 | + c.mem.setVersionMap(pvs) |
| 89 | + return pvs |
| 90 | + } |
| 91 | + |
| 92 | + return nil |
| 93 | +} |
| 94 | + |
| 95 | +func (c *multiCache) getRevisionFor(uv UnpairedVersion) (Revision, bool) { |
| 96 | + rev, ok := c.mem.getRevisionFor(uv) |
| 97 | + if ok { |
| 98 | + return rev, true |
| 99 | + } |
| 100 | + |
| 101 | + return c.disk.getRevisionFor(uv) |
| 102 | +} |
| 103 | + |
| 104 | +func (c *multiCache) toRevision(v Version) (Revision, bool) { |
| 105 | + rev, ok := c.mem.toRevision(v) |
| 106 | + if ok { |
| 107 | + return rev, true |
| 108 | + } |
| 109 | + |
| 110 | + return c.disk.toRevision(v) |
| 111 | +} |
| 112 | + |
| 113 | +func (c *multiCache) toUnpaired(v Version) (UnpairedVersion, bool) { |
| 114 | + uv, ok := c.mem.toUnpaired(v) |
| 115 | + if ok { |
| 116 | + return uv, true |
| 117 | + } |
| 118 | + |
| 119 | + return c.disk.toUnpaired(v) |
| 120 | +} |
0 commit comments