//
// Copyright (c) Microsoft. All rights reserved.
// Licensed under the MIT license. See LICENSE file in the project root for full license information.
//


#ifndef _SYNCBLK_INL_
#define _SYNCBLK_INL_

#ifndef DACCESS_COMPILE

FORCEINLINE AwareLock::EnterHelperResult AwareLock::EnterHelper(Thread* pCurThread)
{
    CONTRACTL {
        SO_TOLERANT;
        NOTHROW;
        GC_NOTRIGGER;
        MODE_ANY;
    } CONTRACTL_END;

    for (;;)
    {
        LONG state = m_MonitorHeld.LoadWithoutBarrier();

        if (state == 0)
        {
            if (InterlockedCompareExchangeAcquire((LONG*)&m_MonitorHeld, 1, 0) == 0)
            {
                m_HoldingThread = pCurThread;
                m_Recursion = 1;
                pCurThread->IncLockCount();
                return AwareLock::EnterHelperResult_Entered;
            }
        }
        else
        {
            if (GetOwningThread() == pCurThread) /* monitor is held, but it could be a recursive case */
            {
                m_Recursion++;
                return AwareLock::EnterHelperResult_Entered;
            }

            return AwareLock::EnterHelperResult_Contention;
        }
    }
}

FORCEINLINE AwareLock::EnterHelperResult ObjHeader::EnterObjMonitorHelper(Thread* pCurThread)
{
    CONTRACTL {
        SO_TOLERANT;
        NOTHROW;
        GC_NOTRIGGER;
        MODE_COOPERATIVE;
    } CONTRACTL_END;

    DWORD tid = pCurThread->GetThreadId();

    LONG oldvalue = m_SyncBlockValue.LoadWithoutBarrier();
            
    if ((oldvalue & (BIT_SBLK_IS_HASH_OR_SYNCBLKINDEX + 
                    BIT_SBLK_SPIN_LOCK + 
                    SBLK_MASK_LOCK_THREADID + 
                    SBLK_MASK_LOCK_RECLEVEL)) == 0)
    {
        if (tid > SBLK_MASK_LOCK_THREADID)
        {
            return AwareLock::EnterHelperResult_UseSlowPath;
        }

        LONG newvalue = oldvalue | tid;
        if (InterlockedCompareExchangeAcquire((LONG*)&m_SyncBlockValue, newvalue, oldvalue) == oldvalue)
        {
            pCurThread->IncLockCount();
            return AwareLock::EnterHelperResult_Entered;
        }
    }
    else
    if (oldvalue & BIT_SBLK_IS_HASH_OR_SYNCBLKINDEX)
    {
         // If we have a hash code already, we need to create a sync block
         if (oldvalue & BIT_SBLK_IS_HASHCODE)
         {
             return AwareLock::EnterHelperResult_UseSlowPath;
         }

         SyncBlock *syncBlock = g_pSyncTable [oldvalue & MASK_SYNCBLOCKINDEX].m_SyncBlock;
         _ASSERTE(syncBlock != NULL);

         return syncBlock->m_Monitor.EnterHelper(pCurThread);
    }
    else
    {
        // The header is transitioning - treat this as if the lock was taken
        if (oldvalue & BIT_SBLK_SPIN_LOCK)
        {
            return AwareLock::EnterHelperResult_Contention;
        }

        // Here we know we have the "thin lock" layout, but the lock is not free.
        // It could still be the recursion case - compare the thread id to check
        if (tid == (DWORD) (oldvalue & SBLK_MASK_LOCK_THREADID))
        {
            // Ok, the thread id matches, it's the recursion case.
            // Bump up the recursion level and check for overflow
            LONG newvalue = oldvalue + SBLK_LOCK_RECLEVEL_INC;

            if ((newvalue & SBLK_MASK_LOCK_RECLEVEL) == 0)
            {
                return AwareLock::EnterHelperResult_UseSlowPath;
            }

            if (InterlockedCompareExchangeAcquire((LONG*)&m_SyncBlockValue, newvalue, oldvalue) == oldvalue)
            {
                return AwareLock::EnterHelperResult_Entered;
            }
        }
    }

    return AwareLock::EnterHelperResult_Contention;
}

inline AwareLock::EnterHelperResult ObjHeader::EnterObjMonitorHelperSpin(Thread* pCurThread)
{
    CONTRACTL {
        SO_TOLERANT;
        NOTHROW;
        GC_NOTRIGGER;
        MODE_COOPERATIVE;
    } CONTRACTL_END;

    if (1 == g_SystemInfo.dwNumberOfProcessors)
    {
        return AwareLock::EnterHelperResult_Contention;
    }

    DWORD spincount = g_SpinConstants.dwInitialDuration;

    for (;;)
    {
        //
        // exponential backoff
        //
        for (DWORD i = 0; i < spincount; i++)
        {
            YieldProcessor();
        }

        AwareLock::EnterHelperResult result = EnterObjMonitorHelper(pCurThread);
        if (result != AwareLock::EnterHelperResult_Contention)
        {
            return result;
        }

        spincount *= g_SpinConstants.dwBackoffFactor;
        if (spincount > g_SpinConstants.dwMaximumDuration)
        {
            break;
        }
    }

    return AwareLock::EnterHelperResult_Contention;
}

// Helper encapsulating the core logic for releasing monitor. Returns what kind of 
// follow up action is necessary. This is FORCEINLINE to make it provide a very efficient implementation.
FORCEINLINE AwareLock::LeaveHelperAction AwareLock::LeaveHelper(Thread* pCurThread)
{
    CONTRACTL {
        SO_TOLERANT;
        NOTHROW;
        GC_NOTRIGGER;
        MODE_ANY;
    } CONTRACTL_END;

    if (m_HoldingThread != pCurThread)
        return AwareLock::LeaveHelperAction_Error;

    _ASSERTE((size_t)m_MonitorHeld & 1);
    _ASSERTE(m_Recursion >= 1);

#if defined(_DEBUG) && defined(TRACK_SYNC)
    // The best place to grab this is from the ECall frame
    Frame   *pFrame = pCurThread->GetFrame();
    int      caller = (pFrame && pFrame != FRAME_TOP ? (int) pFrame->GetReturnAddress() : -1);
    pCurThread->m_pTrackSync->LeaveSync(caller, this);
#endif

    if (--m_Recursion != 0)
    {
        return AwareLock::LeaveHelperAction_None;
    }

    m_HoldingThread->DecLockCount();
    m_HoldingThread = NULL;

    for (;;)
    {
        // Read existing lock state
        LONG state = m_MonitorHeld.LoadWithoutBarrier();

        // Clear lock bit.
        if (InterlockedCompareExchangeRelease((LONG*)&m_MonitorHeld, state - 1, state) == state)
        {
            // If wait count is non-zero on successful clear, we must signal the event.
            if (state & ~1)
            {
                return AwareLock::LeaveHelperAction_Signal;
            }
            break;
        }
    }

    return AwareLock::LeaveHelperAction_None;
}

// Helper encapsulating the core logic for releasing monitor. Returns what kind of 
// follow up action is necessary. This is FORCEINLINE to make it provide a very efficient implementation.
FORCEINLINE AwareLock::LeaveHelperAction ObjHeader::LeaveObjMonitorHelper(Thread* pCurThread)
{
    CONTRACTL {
        SO_TOLERANT;
        NOTHROW;
        GC_NOTRIGGER;
        MODE_COOPERATIVE;
    } CONTRACTL_END;

    DWORD syncBlockValue = m_SyncBlockValue.LoadWithoutBarrier();

    if ((syncBlockValue & (BIT_SBLK_SPIN_LOCK + BIT_SBLK_IS_HASH_OR_SYNCBLKINDEX)) == 0)
    {
        if ((syncBlockValue & SBLK_MASK_LOCK_THREADID) != pCurThread->GetThreadId())
        {
            // This thread does not own the lock.
            return AwareLock::LeaveHelperAction_Error;                
        }

        if (syncBlockValue & SBLK_MASK_LOCK_RECLEVEL)
        {
            // recursion and ThinLock
            DWORD newValue = syncBlockValue - SBLK_LOCK_RECLEVEL_INC;
            if (InterlockedCompareExchangeRelease((LONG*)&m_SyncBlockValue, newValue, syncBlockValue) != (LONG)syncBlockValue)
            {
                return AwareLock::LeaveHelperAction_Yield;
            }
        }
        else
        {
            // We are leaving the lock
            DWORD newValue = (syncBlockValue & (~SBLK_MASK_LOCK_THREADID));
            if (InterlockedCompareExchangeRelease((LONG*)&m_SyncBlockValue, newValue, syncBlockValue) != (LONG)syncBlockValue)
            {
                return AwareLock::LeaveHelperAction_Yield;
            }
            pCurThread->DecLockCount();
        }

        return AwareLock::LeaveHelperAction_None;
    }

    if ((syncBlockValue & (BIT_SBLK_SPIN_LOCK + BIT_SBLK_IS_HASH_OR_SYNCBLKINDEX + BIT_SBLK_IS_HASHCODE)) == BIT_SBLK_IS_HASH_OR_SYNCBLKINDEX)
    {
        SyncBlock *syncBlock = g_pSyncTable [syncBlockValue & MASK_SYNCBLOCKINDEX].m_SyncBlock;
        _ASSERTE(syncBlock != NULL);

        return syncBlock->m_Monitor.LeaveHelper(pCurThread);
    }

    if (syncBlockValue & BIT_SBLK_SPIN_LOCK)
    {
        return AwareLock::LeaveHelperAction_Contention;        
    }

    // This thread does not own the lock.
    return AwareLock::LeaveHelperAction_Error;
}

#endif // DACCESS_COMPILE

// Provide access to the object associated with this awarelock, so client can
// protect it.
inline OBJECTREF AwareLock::GetOwningObject()
{
    LIMITED_METHOD_CONTRACT;
    SUPPORTS_DAC;

    // gcc on mac needs these intermediate casts to avoid some ambiuous overloading in the DAC case
    PTR_SyncTableEntry table = SyncTableEntry::GetSyncTableEntry();
    return (OBJECTREF)(Object*)(PTR_Object)table[(m_dwSyncIndex & ~SyncBlock::SyncBlockPrecious)].m_Object;
}

#endif  // _SYNCBLK_INL_