1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69
70. 70
71. 71
72. 72
73. 73
74. 74
75. 75
76. 76
77. 77
78. 78
79. 79
80. 80
81. 81
82. 82
83. 83
84. 84
85. 85
86. 86
87. 87

//  Copyright (c) 2016 Couchbase, Inc.
//
// 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 registry

import (
	"fmt"
	"sync"
)

var ErrAlreadyDefined = fmt.Errorf("item already defined")

type CacheBuild func(name string, config map[string]interface{}, cache *Cache) (interface{}, error)

type ConcurrentCache struct {
	mutex sync.RWMutex
	data  map[string]interface{}
}

func NewConcurrentCache() *ConcurrentCache {
	return &ConcurrentCache{
		data: make(map[string]interface{}),
	}
}

func (c *ConcurrentCache) ItemNamed(name string, cache *Cache, build CacheBuild) (interface{}, error) {
	c.mutex.RLock()
	item, cached := c.data[name]
	if cached {
		c.mutex.RUnlock()
		return item, nil
	}
	// give up read lock
	c.mutex.RUnlock()
	// try to build it
	newItem, err := build(name, nil, cache)
	if err != nil {
		return nil, err
	}
	// acquire write lock
	c.mutex.Lock()
	defer c.mutex.Unlock()
	// check again because it could have been created while trading locks
	item, cached = c.data[name]
	if cached {
		return item, nil
	}
	c.data[name] = newItem
	return newItem, nil
}

func (c *ConcurrentCache) DefineItem(name string, typ string, config map[string]interface{}, cache *Cache, build CacheBuild) (interface{}, error) {
	c.mutex.RLock()
	_, cached := c.data[name]
	if cached {
		c.mutex.RUnlock()
		return nil, ErrAlreadyDefined
	}
	// give up read lock so others lookups can proceed
	c.mutex.RUnlock()
	// really not there, try to build it
	newItem, err := build(typ, config, cache)
	if err != nil {
		return nil, err
	}
	// now we've built it, acquire lock
	c.mutex.Lock()
	defer c.mutex.Unlock()
	// check again because it could have been created while trading locks
	_, cached = c.data[name]
	if cached {
		return nil, ErrAlreadyDefined
	}
	c.data[name] = newItem
	return newItem, nil
}