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

// Copyright 2017 The Gitea Authors. All rights reserved.
// SPDX-License-Identifier: MIT

package openid

import (
	"sync"
	"time"

	"github.com/yohcop/openid-go"
)

type timedDiscoveredInfo struct {
	info openid.DiscoveredInfo
	time time.Time
}

type timedDiscoveryCache struct {
	cache map[string]timedDiscoveredInfo
	ttl   time.Duration
	mutex *sync.Mutex
}

func newTimedDiscoveryCache(ttl time.Duration) *timedDiscoveryCache {
	return &timedDiscoveryCache{cache: map[string]timedDiscoveredInfo{}, ttl: ttl, mutex: &sync.Mutex{}}
}

func (s *timedDiscoveryCache) Put(id string, info openid.DiscoveredInfo) {
	s.mutex.Lock()
	defer s.mutex.Unlock()

	s.cache[id] = timedDiscoveredInfo{info: info, time: time.Now()}
}

// Delete timed-out cache entries
func (s *timedDiscoveryCache) cleanTimedOut() {
	now := time.Now()
	for k, e := range s.cache {
		diff := now.Sub(e.time)
		if diff > s.ttl {
			delete(s.cache, k)
		}
	}
}

func (s *timedDiscoveryCache) Get(id string) openid.DiscoveredInfo {
	s.mutex.Lock()
	defer s.mutex.Unlock()

	// Delete old cached while we are at it.
	s.cleanTimedOut()

	if info, has := s.cache[id]; has {
		return info.info
	}
	return nil
}