Method Insert

IDEHelper/Compiler/BfResolvedTypeUtils.h:2840–2911

	template <typename T>
	bool Insert(T* findType, LookupContext* ctx, BfResolvedTypeSet::EntryRef* entryPtr)
	{
		CheckRehash();

		int tryCount = 0;
		ctx->mFailed = false;

		BfHashFlags hashFlags = BfHashFlag_AllowRef;
		if ((ctx->mResolveFlags & (BfResolveTypeRefFlag_AllowGenericParamConstValue | BfResolveTypeRefFlag_AllowImplicitConstExpr)) != 0)
		{
			ctx->mResolveFlags = (BfResolveTypeRefFlags)(ctx->mResolveFlags & ~(BfResolveTypeRefFlag_AllowGenericParamConstValue | BfResolveTypeRefFlag_AllowImplicitConstExpr));
			hashFlags = (BfHashFlags)(hashFlags | BfHashFlag_AllowGenericParamConstValue);
		}

		int hashVal = Hash(findType, ctx, hashFlags);
		if ((ctx->mFailed) || (ctx->mHadVar))
		{
			return false;
		}

		while (true)
		{
			int startAllocSize = mAllocSize;
			int bucket = (hashVal & 0x7FFFFFFF) % mHashSize;
			auto startEntryIdx = mHashHeads[bucket];
			auto checkEntryIdx = startEntryIdx;
			bool needsRerun = false;

			while (checkEntryIdx != -1)
			{
				auto checkEntry = &mEntries[checkEntryIdx];

				// checkEntry->mType can be NULL if we're in the process of filling it in (and this Insert is from an element type)
				//  OR if the type resolution failed after node insertion
				if ((checkEntry->mValue != NULL) && (hashVal == checkEntry->mHashCode) && (Equals(checkEntry->mValue, findType, ctx)))
				{
					*entryPtr = EntryRef(this, checkEntryIdx);
					return false;
				}

				if ((mAllocSize != startAllocSize) || (startEntryIdx != mHashHeads[bucket]))
				{
					// It's possible for Equals to add types, buckets could be invalid or a new type could
					//  have been inserted at the start of our bucket
					needsRerun = true;
					break;
				}

				checkEntryIdx = checkEntry->mNext;

				tryCount++;
				// If this fires off, this may indicate that our hashes are equivalent but Equals fails
				if (tryCount >= 10)
				{
					NOP;
				}
				BF_ASSERT(tryCount < 10);
			}