1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
|
// Copyright 2019 The Hugo Authors. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package page
import (
"sync"
)
type pageCacheEntry struct {
in []Pages
out Pages
}
func (entry pageCacheEntry) matches(pageLists []Pages) bool {
if len(entry.in) != len(pageLists) {
return false
}
for i, p := range pageLists {
if !pagesEqual(p, entry.in[i]) {
return false
}
}
return true
}
type pageCache struct {
sync.RWMutex
m map[string][]pageCacheEntry
}
func newPageCache() *pageCache {
return &pageCache{m: make(map[string][]pageCacheEntry)}
}
func (c *pageCache) clear() {
c.Lock()
defer c.Unlock()
c.m = make(map[string][]pageCacheEntry)
}
// get/getP gets a Pages slice from the cache matching the given key and
// all the provided Pages slices.
// If none found in cache, a copy of the first slice is created.
//
// If an apply func is provided, that func is applied to the newly created copy.
//
// The getP variant' apply func takes a pointer to Pages.
//
// The cache and the execution of the apply func is protected by a RWMutex.
func (c *pageCache) get(key string, apply func(p Pages), pageLists ...Pages) (Pages, bool) {
return c.getP(key, func(p *Pages) {
if apply != nil {
apply(*p)
}
}, pageLists...)
}
func (c *pageCache) getP(key string, apply func(p *Pages), pageLists ...Pages) (Pages, bool) {
c.RLock()
if cached, ok := c.m[key]; ok {
for _, entry := range cached {
if entry.matches(pageLists) {
c.RUnlock()
return entry.out, true
}
}
}
c.RUnlock()
c.Lock()
defer c.Unlock()
// double-check
if cached, ok := c.m[key]; ok {
for _, entry := range cached {
if entry.matches(pageLists) {
return entry.out, true
}
}
}
p := pageLists[0]
pagesCopy := append(Pages(nil), p...)
if apply != nil {
apply(&pagesCopy)
}
entry := pageCacheEntry{in: pageLists, out: pagesCopy}
if v, ok := c.m[key]; ok {
c.m[key] = append(v, entry)
} else {
c.m[key] = []pageCacheEntry{entry}
}
return pagesCopy, false
}
// pagesEqual returns whether p1 and p2 are equal.
func pagesEqual(p1, p2 Pages) bool {
if p1 == nil && p2 == nil {
return true
}
if p1 == nil || p2 == nil {
return false
}
if p1.Len() != p2.Len() {
return false
}
if p1.Len() == 0 {
return true
}
for i := 0; i < len(p1); i++ {
if p1[i] != p2[i] {
return false
}
}
return true
}
|
