b8670fb231
* refine code of unsafeHashTable * refine unsafeHashTable * concurrentMapHashTable is ok * update comments * add comments * add comments * update make slickes * update according to comments * add comments * update according to comments from liyuan * remove useless estRows * update test because the output of INL_hash_join does not promose order * update testConcurrentMap * update imports * update test Co-authored-by: ti-srebot <66930949+ti-srebot@users.noreply.github.com>
66 lines
1.7 KiB
Go
66 lines
1.7 KiB
Go
// Copyright 2020 PingCAP, Inc.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package executor
|
|
|
|
import (
|
|
"sync"
|
|
|
|
. "github.com/pingcap/check"
|
|
"github.com/pingcap/tidb/util/chunk"
|
|
)
|
|
|
|
// TestConcurrentMap first inserts 1000 entries, then checks them
|
|
func (cm *pkgTestSuite) TestConcurrentMap(c *C) {
|
|
m := newConcurrentMap()
|
|
const iterations = 1000
|
|
const mod = 111
|
|
wg := &sync.WaitGroup{}
|
|
wg.Add(2)
|
|
// Using go routines insert 1000 entires into the map.
|
|
go func() {
|
|
defer wg.Done()
|
|
for i := 0; i < iterations/2; i++ {
|
|
// Add entry to map.
|
|
m.Insert(uint64(i%mod), &entry{chunk.RowPtr{ChkIdx: uint32(i), RowIdx: uint32(i)}, nil})
|
|
}
|
|
}()
|
|
|
|
go func() {
|
|
defer wg.Done()
|
|
for i := iterations / 2; i < iterations; i++ {
|
|
// Add entry to map.
|
|
m.Insert(uint64(i%mod), &entry{chunk.RowPtr{ChkIdx: uint32(i), RowIdx: uint32(i)}, nil})
|
|
}
|
|
}()
|
|
wg.Wait()
|
|
|
|
// check whether i exist in the map, surely
|
|
for i := 0; i < iterations; i++ {
|
|
found := false
|
|
for en, ok := m.Get(uint64(i % mod)); en != nil; en = en.next {
|
|
c.Assert(ok, IsTrue)
|
|
if en.ptr.RowIdx == uint32(i) && en.ptr.ChkIdx == uint32(i) {
|
|
found = true
|
|
}
|
|
}
|
|
c.Assert(found, IsTrue)
|
|
}
|
|
// test some unexpected cases
|
|
_, ok := m.Get(uint64(mod))
|
|
c.Assert(ok, IsFalse)
|
|
|
|
_, ok = m.Get(uint64(mod + 1))
|
|
c.Assert(ok, IsFalse)
|
|
}
|