1 write to m_locks
mscorlib (1)
system\Collections\Concurrent\ConcurrentDictionary.cs (1)
78
m_locks
= locks;
26 references to m_locks
mscorlib (26)
system\Collections\Concurrent\ConcurrentDictionary.cs (26)
294
m_budget = m_tables.m_buckets.Length / m_tables.
m_locks
.Length;
434
GetBucketAndLockNo(comparer.GetHashCode(key), out bucketNo, out lockNo, tables.m_buckets.Length, tables.
m_locks
.Length);
436
lock (tables.
m_locks
[lockNo])
507
GetBucketAndLockNo(comparer.GetHashCode(key), out bucketNo, out lockNoUnused, tables.m_buckets.Length, tables.
m_locks
.Length);
559
GetBucketAndLockNo(hashcode, out bucketNo, out lockNo, tables.m_buckets.Length, tables.
m_locks
.Length);
561
lock (tables.
m_locks
[lockNo])
622
Tables newTables = new Tables(new Node[DEFAULT_CAPACITY], m_tables.
m_locks
, new int[m_tables.m_countPerLock.Length], m_tables.m_comparer);
624
m_budget = Math.Max(1, newTables.m_buckets.Length / newTables.
m_locks
.Length);
666
for (int i = 0; i < m_tables.
m_locks
.Length && count >= 0; i++)
700
for (int i = 0; i < m_tables.
m_locks
.Length; i++)
818
GetBucketAndLockNo(hashcode, out bucketNo, out lockNo, tables.m_buckets.Length, tables.
m_locks
.Length);
831
Monitor.Enter(tables.
m_locks
[lockNo], ref lockTaken);
921
Monitor.Exit(tables.
m_locks
[lockNo]);
1689
for (int i = 0; i < tables.
m_locks
.Length && count >= 0; i++)
1864
AcquireLocks(1, tables.
m_locks
.Length, ref locksAcquired);
1866
object[] newLocks = tables.
m_locks
;
1869
if (m_growLockArray && tables.
m_locks
.Length < MAX_LOCK_NUMBER)
1871
newLocks = new object[tables.
m_locks
.Length * 2];
1872
Array.Copy(tables.
m_locks
, newLocks, tables.
m_locks
.Length);
1874
for (int i = tables.
m_locks
.Length; i < newLocks.Length; i++)
1977
AcquireLocks(1, m_tables.
m_locks
.Length, ref locksAcquired);
1978
Assert(locksAcquired == m_tables.
m_locks
.Length);
1989
object[] locks = m_tables.
m_locks
;
2023
Monitor.Exit(m_tables.
m_locks
[i]);
2200
m_serializationConcurrencyLevel = tables.
m_locks
.Length;