38 writes to

Microsoft.CodeAnalysis.Workspaces.MSBuild.BuildHost (38)

src\Dependencies\Collections\Internal\SegmentedArraySegment`1.cs (1)

29return ref Array[index + Start];

src\Dependencies\Collections\Segmented\ImmutableSegmentedList`1.cs (1)

137return ref self._list._items[index];

src\Dependencies\Collections\Segmented\ImmutableSegmentedList`1+ValueBuilder.cs (1)

69return ref ReadOnlyList._items[index];

src\Dependencies\Collections\Segmented\SegmentedArray.cs (2)

357array[firstIndex] = array[lastIndex]; 358array[lastIndex] = temp;

src\Dependencies\Collections\Segmented\SegmentedArray`1.cs (2)

135set => this[index] = value; 141set => this[index] = (T)value!;

src\Dependencies\Collections\Segmented\SegmentedDictionary`2.cs (8)

430entry = ref entries[i]; 462entry = ref entries[i]; 720ref var entry = ref entries[i]; 797ref var entry = ref entries[i]; 1028ref var entry = ref newEntries[newCount]; 1203ref var entry = ref _dictionary._entries[_index++]; 1458ref var entry = ref _dictionary._entries[_index++]; 1666ref var entry = ref _dictionary._entries[_index++];

src\Dependencies\Collections\Segmented\SegmentedHashSet`1.cs (14)

181ref var entry = ref entries[i]; 241ref var entry = ref entries[i]; 263ref var entry = ref entries[i]; 313ref var entry = ref entries[i]; 824ref var entry = ref entries[i]; 845ref var entry = ref entries[i]; 914ref var entry = ref entries[i]; 974ref var entry = ref entries[count]; 1045ref var entry = ref entries[i]; 1069ref var entry = ref entries[i]; 1108ref var entry = ref entries[index]; 1152ref var entry = ref entries[i]; 1198ref var entry = ref _entries[i]; 1414ref var entry = ref _hashSet._entries[_index++];

src\Dependencies\Collections\Segmented\SegmentedList`1.cs (9)

215_items[index] = value; 258array[size] = item; 274_items[size] = item; 326_items[targetIndex++] = item; 441list._items[i] = converter(_items[i]); 868_items[index] = item; 938_items[targetIndex++] = item; 1111_items[freeIndex++] = _items[current++]; 1145_items[_size] = default!;

101 references to

Microsoft.CodeAnalysis.Workspaces.MSBuild.BuildHost (101)

src\Compilers\Core\Portable\InternalUtilities\StringTable.cs (17)

296e = arr[idx].Text; 297int hash = arr[idx].HashCode; 331e = arr[idx].Text; 332int hash = arr[idx].HashCode; 366e = arr[idx].Text; 367int hash = arr[idx].HashCode; 401e = arr[idx].Text; 435e = arr[idx].Text; 436int hash = arr[idx].HashCode; 470e = arr[idx].Text; 471int hash = arr[idx].HashCode; 546if (arr[curIdx].Text == null) 561arr[idx].HashCode = hashCode; 562Volatile.Write(ref arr[idx].Text, text); 635if (arr[curIdx].Text == null) 650arr[idx].HashCode = hashCode; 651Volatile.Write(ref arr[idx].Text, text);

src\Dependencies\Collections\Internal\ArraySortHelper.cs (3)

93int order = comparer.Compare(array[i], value); 374if (array[i] == null) 380order = array[i].CompareTo(value!);

src\Dependencies\Collections\Segmented\SegmentedArray.cs (5)

247if (comparer.Equals(array[i], value)) 318if (EqualityComparer<T>.Default.Equals(array[i], value)) 327if (comparer.Equals(array[i], value)) 356var temp = array[firstIndex]; 357array[firstIndex] = array[lastIndex];

src\Dependencies\Collections\Segmented\SegmentedArray`1.cs (8)

130T IReadOnlyList<T>.this[int index] => this[index]; 134get => this[index]; 140get => this[index]; 320var result = comparer.Compare(this[i], o[i]); 344if (!comparer.Equals(this[i], o[i])) 361ret = HashCode.Combine(comparer.GetHashCode(this[i]!), ret);

src\Dependencies\Collections\Segmented\SegmentedDictionary`2.cs (44)

184if (oldEntries[i]._next >= -1) 186Add(oldEntries[i]._key, oldEntries[i]._value); 323if (entries[i]._next >= -1 && entries[i]._value == null) 334if (entries[i]._next >= -1 && EqualityComparer<TValue>.Default.Equals(entries[i]._value, value)) 348if (entries[i]._next >= -1 && defaultComparer.Equals(entries[i]._value, value)) 379if (entries[i]._next >= -1) 381array[index++] = new KeyValuePair<TKey, TValue>(entries[i]._key, entries[i]._value); 545if (entries[i]._hashCode == hashCode && EqualityComparer<TKey>.Default.Equals(entries[i]._key, key)) 549entries[i]._value = value; 561i = entries[i]._next; 584if (entries[i]._hashCode == hashCode && comparer!.Equals(entries[i]._key, key)) 588entries[i]._value = value; 600i = entries[i]._next; 616Debug.Assert((StartOfFreeList - entries[_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow"); 617_freeList = StartOfFreeList - entries[_freeList]._next; 661if (entries[i]._next >= -1) 663ref var bucket = ref GetBucket(entries[i]._hashCode); 664entries[i]._next = bucket - 1; // Value in _buckets is 1-based 731entries[last]._next = entry._next; 808entries[last]._next = entry._next; 911if (entries[i]._next >= -1) 913dictEntryArray[index++] = new DictionaryEntry(entries[i]._key, entries[i]._value); 931if (entries[i]._next >= -1) 933objects[index++] = new KeyValuePair<TKey, TValue>(entries[i]._key, entries[i]._value); 1025var hashCode = entries[i]._hashCode; 1026if (entries[i]._next >= -1) 1029entry = entries[i]; 1334if (entries[i]._next >= -1) 1335array[index++] = entries[i]._key; 1415if (entries[i]._next >= -1) 1416objects[index++] = entries[i]._key; 1542if (entries[i]._next >= -1) 1543array[index++] = entries[i]._value; 1623if (entries[i]._next >= -1) 1624objects[index++] = entries[i]._value!;

src\Dependencies\Collections\Segmented\SegmentedHashSet`1.cs (8)

323entries[last]._next = entry._next; 405actualValue = _entries[index]._value; 971var hashCode = oldEntries[i]._hashCode; // At this point, we know we have entries. 972if (oldEntries[i]._next >= -1) 975entry = oldEntries[i]; 1091Debug.Assert((StartOfFreeList - entries[_freeList]._next) >= -1, "shouldn't overflow because `next` cannot underflow"); 1092_freeList = StartOfFreeList - entries[_freeList]._next; 1286Remove(_entries[i]._value);

src\Dependencies\Collections\Segmented\SegmentedList`1.cs (16)

206return _items[index]; 441list._items[i] = converter(_items[i]); 585if (match(_items[i])) 587return _items[i]; 603if (match(_items[i])) 605list.Add(_items[i]); 637if (match(_items[i])) 652if (match(_items[i])) 654return _items[i]; 699if (match(_items[i])) 722action(_items[i]); 1096while (freeIndex < _size && !match(_items[freeIndex])) 1105while (current < _size && match(_items[current])) 1111_items[freeIndex++] = _items[current++]; 1311if (!match(_items[i])) 1344_current = localList._items[_index];