2 writes to _buckets
System.Private.CoreLib (2)
src\runtime\src\coreclr\nativeaot\Common\src\System\Collections\Concurrent\ConcurrentUnifierWKeyed.cs (2)
172_buckets = new int[_initialCapacity]; 182_buckets = buckets;
16 references to _buckets
System.Private.CoreLib (16)
src\runtime\src\coreclr\nativeaot\Common\src\System\Collections\Concurrent\ConcurrentUnifierWKeyed.cs (16)
174_buckets[i] = -1; 192int bucket = ComputeBucket(hashCode, _buckets.Length); 193int i = Volatile.Read(ref _buckets[bucket]); 217int bucket = ComputeBucket(hashCode, _buckets.Length); 221_entries[newEntryIdx]._next = _buckets[bucket]; 227Volatile.Write(ref _buckets[bucket], newEntryIdx); 248for (int bucket = 0; bucket < _buckets.Length; bucket++) 250for (int entry = _buckets[bucket]; entry != -1; entry = _entries[entry]._next) 262newSize = _buckets.Length; 266newSize = HashHelpers.GetPrime(_buckets.Length * 2); 282for (int bucket = 0; bucket < _buckets.Length; bucket++) 284for (int entry = _buckets[bucket]; entry != -1; entry = _entries[entry]._next) 328for (int bucket = 0; bucket < _buckets.Length; bucket++) 330int walk1 = _buckets[bucket]; 331int walk2 = _buckets[bucket]; // walk2 advances two elements at a time - if walk1 ever meets walk2, we've detected a cycle. 347int storedBucket = ComputeBucket(_entries[walk1]._hashCode, _buckets.Length);