// MIT License // Copyright (c) 2018 Andy Pan // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE // SOFTWARE. package ants import ( "sync" "sync/atomic" "time" ) type pf func(interface{}) // PoolWithFunc accept the tasks from client,it limits the total // of goroutines to a given number by recycling goroutines. type PoolWithFunc struct { // capacity of the pool. capacity int32 // running is the number of the currently running goroutines. running int32 // expiryDuration set the expired time (second) of every worker. expiryDuration time.Duration // workers is a slice that store the available workers. workers []*WorkerWithFunc // release is used to notice the pool to closed itself. release chan sig // lock for synchronous operation. lock sync.Mutex // cond for waiting to get a idle worker cond *sync.Cond // pf is the function for processing tasks. poolFunc pf once sync.Once // PanicHandler is used to handle panics from each worker goroutine. // if nil, panics will be thrown out again from worker goroutines. PanicHandler func(interface{}) } // clear expired workers periodically. func (p *PoolWithFunc) periodicallyPurge() { heartbeat := time.NewTicker(p.expiryDuration) defer heartbeat.Stop() for range heartbeat.C { currentTime := time.Now() p.lock.Lock() idleWorkers := p.workers if len(idleWorkers) == 0 && p.Running() == 0 && p.release != nil { p.lock.Unlock() return } n := -1 for i, w := range idleWorkers { if currentTime.Sub(w.recycleTime) <= p.expiryDuration { break } n = i w.args <- nil idleWorkers[i] = nil } if n > -1 { if n >= len(idleWorkers)-1 { p.workers = idleWorkers[:0] } else { p.workers = idleWorkers[n+1:] } } p.lock.Unlock() } } // NewPoolWithFunc generates an instance of ants pool with a specific function. func NewPoolWithFunc(size int, f pf) (*PoolWithFunc, error) { return NewTimingPoolWithFunc(size, DefaultCleanIntervalTime, f) } // NewTimingPoolWithFunc generates an instance of ants pool with a specific function and a custom timed task. func NewTimingPoolWithFunc(size, expiry int, f pf) (*PoolWithFunc, error) { if size <= 0 { return nil, ErrInvalidPoolSize } if expiry <= 0 { return nil, ErrInvalidPoolExpiry } p := &PoolWithFunc{ capacity: int32(size), expiryDuration: time.Duration(expiry) * time.Second, poolFunc: f, } p.cond = sync.NewCond(&p.lock) go p.periodicallyPurge() return p, nil } //--------------------------------------------------------------------------- // Serve submits a task to pool. func (p *PoolWithFunc) Serve(args interface{}) error { if p.release != nil { return ErrPoolClosed } p.getWorker().args <- args return nil } // Running returns the number of the currently running goroutines. func (p *PoolWithFunc) Running() int { return int(atomic.LoadInt32(&p.running)) } // Free returns a available goroutines to work. func (p *PoolWithFunc) Free() int { return int(atomic.LoadInt32(&p.capacity) - atomic.LoadInt32(&p.running)) } // Cap returns the capacity of this pool. func (p *PoolWithFunc) Cap() int { return int(atomic.LoadInt32(&p.capacity)) } // ReSize change the capacity of this pool. func (p *PoolWithFunc) ReSize(size int) { if size == p.Cap() { return } atomic.StoreInt32(&p.capacity, int32(size)) diff := p.Running() - size for i := 0; i < diff; i++ { p.getWorker().args <- nil } } // Release Closed this pool. func (p *PoolWithFunc) Release() error { p.once.Do(func() { p.release = make(chan sig) p.lock.Lock() idleWorkers := p.workers for i, w := range idleWorkers { w.args <- nil idleWorkers[i] = nil } p.workers = nil p.lock.Unlock() }) return nil } //--------------------------------------------------------------------------- // incRunning increases the number of the currently running goroutines. func (p *PoolWithFunc) incRunning() { atomic.AddInt32(&p.running, 1) } // decRunning decreases the number of the currently running goroutines. func (p *PoolWithFunc) decRunning() { atomic.AddInt32(&p.running, -1) } // getWorker returns a available worker to run the tasks. func (p *PoolWithFunc) getWorker() *WorkerWithFunc { var w *WorkerWithFunc waiting := false p.lock.Lock() defer p.lock.Unlock() idleWorkers := p.workers n := len(idleWorkers) - 1 if n < 0 { waiting = p.Running() >= p.Cap() } else { w = idleWorkers[n] idleWorkers[n] = nil p.workers = idleWorkers[:n] } if waiting { for { p.cond.Wait() l := len(p.workers) - 1 if l < 0 { continue } w = p.workers[l] p.workers[l] = nil p.workers = p.workers[:l] break } } else if w == nil { w = &WorkerWithFunc{ pool: p, args: make(chan interface{}, 1), } w.run() p.incRunning() } return w } // putWorker puts a worker back into free pool, recycling the goroutines. func (p *PoolWithFunc) putWorker(worker *WorkerWithFunc) { worker.recycleTime = time.Now() p.lock.Lock() p.workers = append(p.workers, worker) // Notify the invoker stuck in 'getWorker()' of there is an available worker in the worker queue. p.cond.Signal() p.lock.Unlock() }