2018-05-20 18:57:48 +03:00
|
|
|
// MIT License
|
|
|
|
|
2018-05-20 16:25:59 +03:00
|
|
|
// Copyright (c) 2018 Andy Pan
|
2018-05-20 18:57:48 +03:00
|
|
|
|
2018-05-20 16:25:59 +03:00
|
|
|
// 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
|
2018-05-20 18:57:48 +03:00
|
|
|
// 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:
|
2018-05-20 16:25:59 +03:00
|
|
|
//
|
2018-05-20 18:57:48 +03:00
|
|
|
// The above copyright notice and this permission notice shall be included in all
|
2018-05-20 16:25:59 +03:00
|
|
|
// copies or substantial portions of the Software.
|
|
|
|
//
|
2018-05-20 18:57:48 +03:00
|
|
|
// 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.
|
2018-05-20 16:25:59 +03:00
|
|
|
|
2018-05-19 10:22:14 +03:00
|
|
|
package ants_test
|
2018-05-19 07:33:29 +03:00
|
|
|
|
2018-05-19 10:22:14 +03:00
|
|
|
import (
|
2018-05-20 11:22:56 +03:00
|
|
|
"runtime"
|
2018-05-20 16:29:38 +03:00
|
|
|
"sync"
|
|
|
|
"testing"
|
2018-05-22 13:00:15 +03:00
|
|
|
|
|
|
|
"github.com/panjf2000/ants"
|
2018-05-19 10:22:14 +03:00
|
|
|
)
|
|
|
|
|
2018-05-23 06:17:00 +03:00
|
|
|
var n = 10000000
|
2018-05-19 10:22:14 +03:00
|
|
|
|
2018-05-20 06:51:14 +03:00
|
|
|
//func demoFunc() {
|
|
|
|
// var n int
|
|
|
|
// for i := 0; i < 1000000; i++ {
|
|
|
|
// n += i
|
|
|
|
// }
|
|
|
|
//}
|
2018-05-19 14:51:33 +03:00
|
|
|
|
2018-05-19 14:08:31 +03:00
|
|
|
//func demoFunc() {
|
|
|
|
// var n int
|
|
|
|
// for i := 0; i < 10000; i++ {
|
|
|
|
// n += i
|
|
|
|
// }
|
|
|
|
// fmt.Printf("finish task with result:%d\n", n)
|
|
|
|
//}
|
2018-05-19 10:22:14 +03:00
|
|
|
|
2018-05-22 06:17:19 +03:00
|
|
|
func demoFunc() {
|
|
|
|
//time.Sleep(time.Millisecond)
|
|
|
|
var n int
|
|
|
|
for i := 0; i < 1000000; i++ {
|
|
|
|
n += i
|
2018-05-20 06:51:14 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-22 07:01:00 +03:00
|
|
|
//func TestDefaultPool(t *testing.T) {
|
|
|
|
// var wg sync.WaitGroup
|
|
|
|
// for i := 0; i < n; i++ {
|
|
|
|
// wg.Add(1)
|
|
|
|
// ants.Push(func() {
|
|
|
|
// demoFunc()
|
|
|
|
// wg.Done()
|
|
|
|
// })
|
|
|
|
// }
|
|
|
|
// wg.Wait()
|
|
|
|
//
|
|
|
|
// //t.Logf("pool capacity:%d", ants.Cap())
|
|
|
|
// //t.Logf("free workers number:%d", ants.Free())
|
|
|
|
//
|
|
|
|
// t.Logf("running workers number:%d", ants.Running())
|
|
|
|
// mem := runtime.MemStats{}
|
|
|
|
// runtime.ReadMemStats(&mem)
|
|
|
|
// t.Logf("memory usage:%d", mem.TotalAlloc/1024)
|
|
|
|
//}
|
|
|
|
|
|
|
|
//func TestNoPool(t *testing.T) {
|
|
|
|
// var wg sync.WaitGroup
|
|
|
|
// for i := 0; i < n; i++ {
|
|
|
|
// wg.Add(1)
|
|
|
|
// go func() {
|
|
|
|
// demoFunc()
|
|
|
|
// wg.Done()
|
|
|
|
// }()
|
|
|
|
// }
|
|
|
|
//
|
|
|
|
// wg.Wait()
|
|
|
|
// mem := runtime.MemStats{}
|
|
|
|
// runtime.ReadMemStats(&mem)
|
|
|
|
// t.Logf("memory usage:%d", mem.TotalAlloc/1024)
|
|
|
|
//}
|
|
|
|
|
|
|
|
func TestAntsPoolWithFunc(t *testing.T) {
|
2018-05-20 06:51:14 +03:00
|
|
|
var wg sync.WaitGroup
|
2018-05-22 13:00:15 +03:00
|
|
|
p, _ := ants.NewPoolWithFunc(50000, func(i interface{}) error {
|
2018-05-22 07:01:00 +03:00
|
|
|
demoPoolFunc(i)
|
|
|
|
wg.Done()
|
|
|
|
return nil
|
|
|
|
})
|
2018-05-19 10:22:14 +03:00
|
|
|
for i := 0; i < n; i++ {
|
2018-05-20 06:51:14 +03:00
|
|
|
wg.Add(1)
|
2018-05-22 07:01:00 +03:00
|
|
|
p.Serve(n)
|
2018-05-19 10:22:14 +03:00
|
|
|
}
|
2018-05-20 06:51:14 +03:00
|
|
|
wg.Wait()
|
2018-05-19 10:22:14 +03:00
|
|
|
|
2018-05-19 21:52:39 +03:00
|
|
|
//t.Logf("pool capacity:%d", ants.Cap())
|
|
|
|
//t.Logf("free workers number:%d", ants.Free())
|
2018-05-19 10:22:14 +03:00
|
|
|
|
2018-05-22 07:01:00 +03:00
|
|
|
t.Logf("running workers number:%d", p.Running())
|
2018-05-19 15:16:33 +03:00
|
|
|
mem := runtime.MemStats{}
|
|
|
|
runtime.ReadMemStats(&mem)
|
2018-05-23 06:17:00 +03:00
|
|
|
t.Logf("memory usage:%d", mem.TotalAlloc/GiB)
|
2018-05-19 10:22:14 +03:00
|
|
|
}
|
|
|
|
|
2018-05-22 06:17:19 +03:00
|
|
|
func TestNoPool(t *testing.T) {
|
2018-05-20 11:22:56 +03:00
|
|
|
var wg sync.WaitGroup
|
|
|
|
for i := 0; i < n; i++ {
|
|
|
|
wg.Add(1)
|
2018-05-22 06:17:19 +03:00
|
|
|
go func() {
|
2018-05-22 07:01:00 +03:00
|
|
|
demoPoolFunc(n)
|
2018-05-20 11:22:56 +03:00
|
|
|
wg.Done()
|
2018-05-22 06:17:19 +03:00
|
|
|
}()
|
2018-05-20 11:22:56 +03:00
|
|
|
}
|
|
|
|
|
2018-05-22 06:17:19 +03:00
|
|
|
wg.Wait()
|
2018-05-20 11:22:56 +03:00
|
|
|
mem := runtime.MemStats{}
|
|
|
|
runtime.ReadMemStats(&mem)
|
2018-05-23 06:17:00 +03:00
|
|
|
t.Logf("memory usage:%d", mem.TotalAlloc/GiB)
|
2018-05-20 11:22:56 +03:00
|
|
|
}
|
2018-05-22 06:17:19 +03:00
|
|
|
|
|
|
|
//func TestCustomPool(t *testing.T) {
|
|
|
|
// p, _ := ants.NewPool(30000)
|
|
|
|
// var wg sync.WaitGroup
|
|
|
|
// for i := 0; i < n; i++ {
|
|
|
|
// wg.Add(1)
|
|
|
|
// p.Push(func() {
|
|
|
|
// demoFunc()
|
|
|
|
// //demoFunc()
|
|
|
|
// wg.Done()
|
|
|
|
// })
|
|
|
|
// }
|
|
|
|
// wg.Wait()
|
|
|
|
//
|
|
|
|
// //t.Logf("pool capacity:%d", p.Cap())
|
|
|
|
// //t.Logf("free workers number:%d", p.Free())
|
|
|
|
//
|
|
|
|
// t.Logf("running workers number:%d", p.Running())
|
|
|
|
// mem := runtime.MemStats{}
|
|
|
|
// runtime.ReadMemStats(&mem)
|
|
|
|
// t.Logf("memory usage:%d", mem.TotalAlloc/1024)
|
|
|
|
//}
|