// 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 ( "math" "sync" "sync/atomic" ) type sig struct{} type f func() error // Pool accept the tasks from client,it limits the total // of goroutines to a given number by recycling goroutines. type Pool struct { // capacity of the pool. capacity int32 // running is the number of the currently running goroutines. running int32 // freeSignal is used to notice pool there are available // workers which can be sent to work. freeSignal chan sig // workers is a slice that store the available workers. workers []*Worker // release is used to notice the pool to closed itself. release chan sig // lock for synchronous operation lock sync.Mutex once sync.Once } // NewPool generates a instance of ants pool func NewPool(size int) (*Pool, error) { if size <= 0 { return nil, ErrPoolSizeInvalid } p := &Pool{ capacity: int32(size), freeSignal: make(chan sig, math.MaxInt32), release: make(chan sig, 1), } return p, nil } //------------------------------------------------------------------------- // Submit submit a task to pool func (p *Pool) Submit(task f) error { if len(p.release) > 0 { return ErrPoolClosed } w := p.getWorker() w.sendTask(task) return nil } // Running returns the number of the currently running goroutines func (p *Pool) Running() int { return int(atomic.LoadInt32(&p.running)) } // Free returns the available goroutines to work func (p *Pool) Free() int { return int(atomic.LoadInt32(&p.capacity) - atomic.LoadInt32(&p.running)) } // Cap returns the capacity of this pool func (p *Pool) Cap() int { return int(atomic.LoadInt32(&p.capacity)) } // Release Closed this pool func (p *Pool) Release() error { p.once.Do(func() { p.release <- sig{} running := p.Running() for i := 0; i < running; i++ { p.getWorker().stop() } }) return nil } // ReSize change the capacity of this pool func (p *Pool) ReSize(size int) { if size < p.Cap() { diff := p.Cap() - size for i := 0; i < diff; i++ { p.getWorker().stop() } } else if size == p.Cap() { return } atomic.StoreInt32(&p.capacity, int32(size)) } //------------------------------------------------------------------------- // getWorker returns a available worker to run the tasks. func (p *Pool) getWorker() *Worker { var w *Worker waiting := false p.lock.Lock() workers := p.workers n := len(workers) - 1 if n < 0 { if p.running >= p.capacity { waiting = true } else { p.running++ } } else { w = workers[n] workers[n] = nil p.workers = workers[:n] } p.lock.Unlock() if waiting { <-p.freeSignal for { p.lock.Lock() workers = p.workers l := len(workers) - 1 if l < 0 { p.lock.Unlock() continue } w = workers[l] workers[l] = nil p.workers = workers[:l] p.lock.Unlock() break } } else if w == nil { w = &Worker{ pool: p, task: make(chan f), } w.run() } return w } // putWorker puts a worker back into free pool, recycling the goroutines. func (p *Pool) putWorker(worker *Worker) { p.lock.Lock() p.workers = append(p.workers, worker) p.lock.Unlock() p.freeSignal <- sig{} }