| skipped 9 lines |
10 | 10 | | |
11 | 11 | | // GetStatistics returns all current statistics. |
12 | 12 | | // * This is a pointer, do not modify it! |
13 | | - | func (pe *Swamp) GetStatistics() *statistics { |
14 | | - | return pe.stats |
| 13 | + | func (p5 *Swamp) GetStatistics() *statistics { |
| 14 | + | return p5.stats |
15 | 15 | | } |
16 | 16 | | |
17 | 17 | | // RandomUserAgent retrieves a random user agent from our list in string form. |
18 | | - | func (pe *Swamp) RandomUserAgent() string { |
19 | | - | pe.mu.RLock() |
20 | | - | defer pe.mu.RUnlock() |
21 | | - | return entropy.RandomStrChoice(pe.swampopt.userAgents) |
| 18 | + | func (p5 *Swamp) RandomUserAgent() string { |
| 19 | + | p5.mu.RLock() |
| 20 | + | defer p5.mu.RUnlock() |
| 21 | + | return entropy.RandomStrChoice(p5.swampopt.userAgents) |
22 | 22 | | } |
23 | 23 | | |
24 | 24 | | // GetRandomEndpoint returns a random whatismyip style endpoint from our Swamp's options |
25 | | - | func (pe *Swamp) GetRandomEndpoint() string { |
26 | | - | pe.mu.RLock() |
27 | | - | defer pe.mu.RUnlock() |
28 | | - | return entropy.RandomStrChoice(pe.swampopt.checkEndpoints) |
| 25 | + | func (p5 *Swamp) GetRandomEndpoint() string { |
| 26 | + | p5.mu.RLock() |
| 27 | + | defer p5.mu.RUnlock() |
| 28 | + | return entropy.RandomStrChoice(p5.swampopt.checkEndpoints) |
29 | 29 | | } |
30 | 30 | | |
31 | 31 | | // GetStaleTime returns the duration of time after which a proxy will be considered "stale". |
32 | | - | func (pe *Swamp) GetStaleTime() time.Duration { |
33 | | - | pe.swampopt.RLock() |
34 | | - | defer pe.swampopt.RLock() |
35 | | - | return pe.swampopt.stale |
| 32 | + | func (p5 *Swamp) GetStaleTime() time.Duration { |
| 33 | + | p5.swampopt.RLock() |
| 34 | + | defer p5.swampopt.RLock() |
| 35 | + | return p5.swampopt.stale |
36 | 36 | | } |
37 | 37 | | |
38 | 38 | | // GetValidationTimeout returns the current value of validationTimeout. |
39 | | - | func (pe *Swamp) GetValidationTimeout() time.Duration { |
40 | | - | pe.swampopt.RLock() |
41 | | - | defer pe.swampopt.RLock() |
42 | | - | return pe.swampopt.validationTimeout |
| 39 | + | func (p5 *Swamp) GetValidationTimeout() time.Duration { |
| 40 | + | p5.swampopt.RLock() |
| 41 | + | defer p5.swampopt.RLock() |
| 42 | + | return p5.swampopt.validationTimeout |
43 | 43 | | } |
44 | 44 | | |
45 | 45 | | // GetValidationTimeoutStr returns the current value of validationTimeout (in seconds string). |
46 | | - | func (pe *Swamp) GetValidationTimeoutStr() string { |
47 | | - | pe.swampopt.RLock() |
48 | | - | defer pe.swampopt.RLock() |
49 | | - | timeout := pe.swampopt.validationTimeout |
| 46 | + | func (p5 *Swamp) GetValidationTimeoutStr() string { |
| 47 | + | p5.swampopt.RLock() |
| 48 | + | defer p5.swampopt.RLock() |
| 49 | + | timeout := p5.swampopt.validationTimeout |
50 | 50 | | return strconv.Itoa(int(timeout / time.Second)) |
51 | 51 | | } |
52 | 52 | | |
53 | 53 | | // GetServerTimeout returns the current value of serverTimeout. |
54 | | - | func (pe *Swamp) GetServerTimeout() time.Duration { |
55 | | - | pe.swampopt.RLock() |
56 | | - | defer pe.swampopt.RLock() |
57 | | - | return pe.swampopt.serverTimeout |
| 54 | + | func (p5 *Swamp) GetServerTimeout() time.Duration { |
| 55 | + | p5.swampopt.RLock() |
| 56 | + | defer p5.swampopt.RLock() |
| 57 | + | return p5.swampopt.serverTimeout |
58 | 58 | | } |
59 | 59 | | |
60 | 60 | | // GetServerTimeoutStr returns the current value of serverTimeout (in seconds string). |
61 | | - | func (pe *Swamp) GetServerTimeoutStr() string { |
62 | | - | pe.swampopt.RLock() |
63 | | - | defer pe.swampopt.RLock() |
64 | | - | timeout := pe.swampopt.serverTimeout |
| 61 | + | func (p5 *Swamp) GetServerTimeoutStr() string { |
| 62 | + | p5.swampopt.RLock() |
| 63 | + | defer p5.swampopt.RLock() |
| 64 | + | timeout := p5.swampopt.serverTimeout |
65 | 65 | | if timeout == time.Duration(0) { |
66 | 66 | | return "-1" |
67 | 67 | | } |
| skipped 1 lines |
69 | 69 | | } |
70 | 70 | | |
71 | 71 | | // GetMaxWorkers returns maximum amount of workers that validate proxies concurrently. Note this is read-only during runtime. |
72 | | - | func (pe *Swamp) GetMaxWorkers() int { |
73 | | - | return pe.pool.Cap() |
| 72 | + | func (p5 *Swamp) GetMaxWorkers() int { |
| 73 | + | return p5.pool.Cap() |
74 | 74 | | } |
75 | 75 | | |
76 | 76 | | // IsRunning returns true if our background goroutines defined in daemons.go are currently operational |
77 | | - | func (pe *Swamp) IsRunning() bool { |
78 | | - | return atomic.LoadInt32(&pe.runningdaemons) == 2 |
| 77 | + | func (p5 *Swamp) IsRunning() bool { |
| 78 | + | return atomic.LoadInt32(&p5.runningdaemons) == 2 |
79 | 79 | | } |
80 | 80 | | |
81 | 81 | | // GetRecyclingStatus retrieves the current recycling status, see EnableRecycling. |
82 | | - | func (pe *Swamp) GetRecyclingStatus() bool { |
83 | | - | pe.swampopt.RLock() |
84 | | - | defer pe.swampopt.RLock() |
85 | | - | return pe.swampopt.recycle |
| 82 | + | func (p5 *Swamp) GetRecyclingStatus() bool { |
| 83 | + | p5.swampopt.RLock() |
| 84 | + | defer p5.swampopt.RLock() |
| 85 | + | return p5.swampopt.recycle |
86 | 86 | | } |
87 | 87 | | |
88 | 88 | | // GetWorkers retrieves pond worker statistics: |
89 | 89 | | // - return MaxWorkers, RunningWorkers, IdleWorkers |
90 | | - | func (pe *Swamp) GetWorkers() (maxWorkers, runningWorkers, idleWorkers int) { |
91 | | - | pe.mu.RLock() |
92 | | - | defer pe.mu.RUnlock() |
93 | | - | return pe.pool.Cap(), pe.pool.Running(), pe.pool.Free() |
| 90 | + | func (p5 *Swamp) GetWorkers() (maxWorkers, runningWorkers, idleWorkers int) { |
| 91 | + | p5.mu.RLock() |
| 92 | + | defer p5.mu.RUnlock() |
| 93 | + | return p5.pool.Cap(), p5.pool.Running(), p5.pool.Free() |
94 | 94 | | } |
95 | 95 | | |
96 | 96 | | // GetRemoveAfter retrieves the removeafter policy, the amount of times a recycled proxy is marked as bad until it is removed entirely. |
97 | 97 | | // - returns -1 if recycling is disabled. |
98 | | - | func (pe *Swamp) GetRemoveAfter() int { |
99 | | - | pe.mu.RLock() |
100 | | - | defer pe.mu.RUnlock() |
101 | | - | if !pe.swampopt.recycle { |
| 98 | + | func (p5 *Swamp) GetRemoveAfter() int { |
| 99 | + | p5.mu.RLock() |
| 100 | + | defer p5.mu.RUnlock() |
| 101 | + | if !p5.swampopt.recycle { |
102 | 102 | | return -1 |
103 | 103 | | } |
104 | | - | return pe.swampopt.removeafter |
| 104 | + | return p5.swampopt.removeafter |
105 | 105 | | } |
106 | 106 | | |
107 | 107 | | // GetDialerBailout retrieves the dialer bailout policy. See SetDialerBailout for more info. |
108 | | - | func (pe *Swamp) GetDialerBailout() int { |
109 | | - | pe.mu.RLock() |
110 | | - | defer pe.mu.RUnlock() |
111 | | - | return pe.swampopt.dialerBailout |
| 108 | + | func (p5 *Swamp) GetDialerBailout() int { |
| 109 | + | p5.mu.RLock() |
| 110 | + | defer p5.mu.RUnlock() |
| 111 | + | return p5.swampopt.dialerBailout |
112 | 112 | | } |
113 | 113 | | |
114 | 114 | | // TODO: Document middleware concept |
115 | 115 | | |
116 | | - | func (pe *Swamp) GetDispenseMiddleware() func(*Proxy) (*Proxy, bool) { |
117 | | - | pe.mu.RLock() |
118 | | - | defer pe.mu.RUnlock() |
119 | | - | return pe.dispenseMiddleware |
| 116 | + | func (p5 *Swamp) GetDispenseMiddleware() func(*Proxy) (*Proxy, bool) { |
| 117 | + | p5.mu.RLock() |
| 118 | + | defer p5.mu.RUnlock() |
| 119 | + | return p5.dispenseMiddleware |
120 | 120 | | } |
121 | 121 | | |
122 | | - | func (pe *Swamp) GetShuffleStatus() bool { |
123 | | - | pe.mu.RLock() |
124 | | - | defer pe.mu.RUnlock() |
125 | | - | return pe.swampopt.shuffle |
| 122 | + | func (p5 *Swamp) GetShuffleStatus() bool { |
| 123 | + | p5.mu.RLock() |
| 124 | + | defer p5.mu.RUnlock() |
| 125 | + | return p5.swampopt.shuffle |
126 | 126 | | } |
127 | 127 | | |