2002-02-21 21:22:00 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2002, TransGaming Technologies Inc.
|
2002-03-10 00:29:33 +01:00
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
2006-05-18 14:49:52 +02:00
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
2002-02-21 21:22:00 +01:00
|
|
|
*/
|
|
|
|
|
2014-06-21 14:22:28 +02:00
|
|
|
#include "config.h"
|
|
|
|
#include "wine/port.h"
|
|
|
|
|
2003-09-06 01:08:26 +02:00
|
|
|
#include <stdarg.h>
|
|
|
|
|
2002-03-10 00:29:33 +01:00
|
|
|
#include "wine/debug.h"
|
2003-09-06 01:08:26 +02:00
|
|
|
#include "windef.h"
|
2002-02-21 21:22:00 +01:00
|
|
|
#include "winbase.h"
|
2014-06-21 14:22:28 +02:00
|
|
|
#include "winternl.h"
|
|
|
|
#include "msvcrt.h"
|
|
|
|
#include "cppexcept.h"
|
2008-12-17 14:45:18 +01:00
|
|
|
#include "mtdll.h"
|
2014-06-21 14:22:28 +02:00
|
|
|
#include "cxx.h"
|
2002-02-21 21:22:00 +01:00
|
|
|
|
2002-03-10 00:29:33 +01:00
|
|
|
WINE_DEFAULT_DEBUG_CHANNEL(msvcrt);
|
2002-02-21 21:22:00 +01:00
|
|
|
|
|
|
|
typedef struct
|
|
|
|
{
|
2002-06-01 01:06:46 +02:00
|
|
|
BOOL bInit;
|
2002-02-21 21:22:00 +01:00
|
|
|
CRITICAL_SECTION crit;
|
|
|
|
} LOCKTABLEENTRY;
|
|
|
|
|
|
|
|
static LOCKTABLEENTRY lock_table[ _TOTAL_LOCKS ];
|
|
|
|
|
|
|
|
static inline void msvcrt_mlock_set_entry_initialized( int locknum, BOOL initialized )
|
|
|
|
{
|
|
|
|
lock_table[ locknum ].bInit = initialized;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void msvcrt_initialize_mlock( int locknum )
|
|
|
|
{
|
|
|
|
InitializeCriticalSection( &(lock_table[ locknum ].crit) );
|
2007-03-10 22:09:17 +01:00
|
|
|
lock_table[ locknum ].crit.DebugInfo->Spare[0] = (DWORD_PTR)(__FILE__ ": LOCKTABLEENTRY.crit");
|
2002-06-01 01:06:46 +02:00
|
|
|
msvcrt_mlock_set_entry_initialized( locknum, TRUE );
|
2002-02-21 21:22:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void msvcrt_uninitialize_mlock( int locknum )
|
|
|
|
{
|
2007-03-10 22:09:17 +01:00
|
|
|
lock_table[ locknum ].crit.DebugInfo->Spare[0] = 0;
|
2002-02-21 21:22:00 +01:00
|
|
|
DeleteCriticalSection( &(lock_table[ locknum ].crit) );
|
|
|
|
msvcrt_mlock_set_entry_initialized( locknum, FALSE );
|
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
* msvcrt_init_mt_locks (internal)
|
|
|
|
*
|
2002-06-01 01:06:46 +02:00
|
|
|
* Initialize the table lock. All other locks will be initialized
|
2002-02-21 21:22:00 +01:00
|
|
|
* upon first use.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void msvcrt_init_mt_locks(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
TRACE( "initializing mtlocks\n" );
|
|
|
|
|
|
|
|
/* Initialize the table */
|
|
|
|
for( i=0; i < _TOTAL_LOCKS; i++ )
|
|
|
|
{
|
|
|
|
msvcrt_mlock_set_entry_initialized( i, FALSE );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Initialize our lock table lock */
|
2002-06-01 01:06:46 +02:00
|
|
|
msvcrt_initialize_mlock( _LOCKTAB_LOCK );
|
2002-02-21 21:22:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
* _lock (MSVCRT.@)
|
|
|
|
*/
|
2006-06-13 11:21:19 +02:00
|
|
|
void CDECL _lock( int locknum )
|
2002-02-21 21:22:00 +01:00
|
|
|
{
|
|
|
|
TRACE( "(%d)\n", locknum );
|
|
|
|
|
|
|
|
/* If the lock doesn't exist yet, create it */
|
|
|
|
if( lock_table[ locknum ].bInit == FALSE )
|
|
|
|
{
|
|
|
|
/* Lock while we're changing the lock table */
|
|
|
|
_lock( _LOCKTAB_LOCK );
|
|
|
|
|
|
|
|
/* Check again if we've got a bit of a race on lock creation */
|
|
|
|
if( lock_table[ locknum ].bInit == FALSE )
|
|
|
|
{
|
|
|
|
TRACE( ": creating lock #%d\n", locknum );
|
|
|
|
msvcrt_initialize_mlock( locknum );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Unlock ourselves */
|
|
|
|
_unlock( _LOCKTAB_LOCK );
|
|
|
|
}
|
|
|
|
|
2002-06-01 01:06:46 +02:00
|
|
|
EnterCriticalSection( &(lock_table[ locknum ].crit) );
|
2002-02-21 21:22:00 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
* _unlock (MSVCRT.@)
|
|
|
|
*
|
|
|
|
* NOTE: There is no error detection to make sure the lock exists and is acquired.
|
|
|
|
*/
|
2006-06-13 11:21:19 +02:00
|
|
|
void CDECL _unlock( int locknum )
|
2002-02-21 21:22:00 +01:00
|
|
|
{
|
|
|
|
TRACE( "(%d)\n", locknum );
|
|
|
|
|
|
|
|
LeaveCriticalSection( &(lock_table[ locknum ].crit) );
|
|
|
|
}
|
2014-06-21 14:22:28 +02:00
|
|
|
|
|
|
|
#if _MSVCR_VER >= 100
|
|
|
|
typedef enum
|
|
|
|
{
|
|
|
|
SPINWAIT_INIT,
|
|
|
|
SPINWAIT_SPIN,
|
|
|
|
SPINWAIT_YIELD,
|
|
|
|
SPINWAIT_DONE
|
|
|
|
} SpinWait_state;
|
|
|
|
|
|
|
|
typedef void (__cdecl *yield_func)(void);
|
|
|
|
|
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
ULONG spin;
|
|
|
|
ULONG unknown;
|
|
|
|
SpinWait_state state;
|
|
|
|
yield_func yield_func;
|
|
|
|
} SpinWait;
|
|
|
|
|
|
|
|
/* ?_Value@_SpinCount@details@Concurrency@@SAIXZ */
|
|
|
|
unsigned int __cdecl SpinCount__Value(void)
|
|
|
|
{
|
|
|
|
static unsigned int val = -1;
|
|
|
|
|
|
|
|
TRACE("()\n");
|
|
|
|
|
|
|
|
if(val == -1) {
|
|
|
|
SYSTEM_INFO si;
|
|
|
|
|
|
|
|
GetSystemInfo(&si);
|
|
|
|
val = si.dwNumberOfProcessors>1 ? 4000 : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return val;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ??0?$_SpinWait@$00@details@Concurrency@@QAE@P6AXXZ@Z */
|
|
|
|
/* ??0?$_SpinWait@$00@details@Concurrency@@QEAA@P6AXXZ@Z */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait_ctor_yield, 8)
|
|
|
|
SpinWait* __thiscall SpinWait_ctor_yield(SpinWait *this, yield_func yf)
|
|
|
|
{
|
|
|
|
TRACE("(%p %p)\n", this, yf);
|
|
|
|
|
|
|
|
this->state = SPINWAIT_INIT;
|
|
|
|
this->unknown = 1;
|
|
|
|
this->yield_func = yf;
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ??0?$_SpinWait@$0A@@details@Concurrency@@QAE@P6AXXZ@Z */
|
|
|
|
/* ??0?$_SpinWait@$0A@@details@Concurrency@@QEAA@P6AXXZ@Z */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait_ctor, 8)
|
|
|
|
SpinWait* __thiscall SpinWait_ctor(SpinWait *this, yield_func yf)
|
|
|
|
{
|
|
|
|
TRACE("(%p %p)\n", this, yf);
|
|
|
|
|
|
|
|
this->state = SPINWAIT_INIT;
|
|
|
|
this->unknown = 0;
|
|
|
|
this->yield_func = yf;
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ??_F?$_SpinWait@$00@details@Concurrency@@QAEXXZ */
|
|
|
|
/* ??_F?$_SpinWait@$00@details@Concurrency@@QEAAXXZ */
|
|
|
|
/* ??_F?$_SpinWait@$0A@@details@Concurrency@@QAEXXZ */
|
|
|
|
/* ??_F?$_SpinWait@$0A@@details@Concurrency@@QEAAXXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait_dtor, 4)
|
|
|
|
void __thiscall SpinWait_dtor(SpinWait *this)
|
|
|
|
{
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?_DoYield@?$_SpinWait@$00@details@Concurrency@@IAEXXZ */
|
|
|
|
/* ?_DoYield@?$_SpinWait@$00@details@Concurrency@@IEAAXXZ */
|
|
|
|
/* ?_DoYield@?$_SpinWait@$0A@@details@Concurrency@@IAEXXZ */
|
|
|
|
/* ?_DoYield@?$_SpinWait@$0A@@details@Concurrency@@IEAAXXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait__DoYield, 4)
|
|
|
|
void __thiscall SpinWait__DoYield(SpinWait *this)
|
|
|
|
{
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
|
|
|
|
if(this->unknown)
|
|
|
|
this->yield_func();
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?_NumberOfSpins@?$_SpinWait@$00@details@Concurrency@@IAEKXZ */
|
|
|
|
/* ?_NumberOfSpins@?$_SpinWait@$00@details@Concurrency@@IEAAKXZ */
|
|
|
|
/* ?_NumberOfSpins@?$_SpinWait@$0A@@details@Concurrency@@IAEKXZ */
|
|
|
|
/* ?_NumberOfSpins@?$_SpinWait@$0A@@details@Concurrency@@IEAAKXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait__NumberOfSpins, 4)
|
|
|
|
ULONG __thiscall SpinWait__NumberOfSpins(SpinWait *this)
|
|
|
|
{
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?_SetSpinCount@?$_SpinWait@$00@details@Concurrency@@QAEXI@Z */
|
|
|
|
/* ?_SetSpinCount@?$_SpinWait@$00@details@Concurrency@@QEAAXI@Z */
|
|
|
|
/* ?_SetSpinCount@?$_SpinWait@$0A@@details@Concurrency@@QAEXI@Z */
|
|
|
|
/* ?_SetSpinCount@?$_SpinWait@$0A@@details@Concurrency@@QEAAXI@Z */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait__SetSpinCount, 8)
|
|
|
|
void __thiscall SpinWait__SetSpinCount(SpinWait *this, unsigned int spin)
|
|
|
|
{
|
|
|
|
TRACE("(%p %d)\n", this, spin);
|
|
|
|
|
|
|
|
this->spin = spin;
|
|
|
|
this->state = spin ? SPINWAIT_SPIN : SPINWAIT_YIELD;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?_Reset@?$_SpinWait@$00@details@Concurrency@@IAEXXZ */
|
|
|
|
/* ?_Reset@?$_SpinWait@$00@details@Concurrency@@IEAAXXZ */
|
|
|
|
/* ?_Reset@?$_SpinWait@$0A@@details@Concurrency@@IAEXXZ */
|
|
|
|
/* ?_Reset@?$_SpinWait@$0A@@details@Concurrency@@IEAAXXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait__Reset, 4)
|
|
|
|
void __thiscall SpinWait__Reset(SpinWait *this)
|
|
|
|
{
|
|
|
|
SpinWait__SetSpinCount(this, SpinCount__Value());
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?_ShouldSpinAgain@?$_SpinWait@$00@details@Concurrency@@IAE_NXZ */
|
|
|
|
/* ?_ShouldSpinAgain@?$_SpinWait@$00@details@Concurrency@@IEAA_NXZ */
|
|
|
|
/* ?_ShouldSpinAgain@?$_SpinWait@$0A@@details@Concurrency@@IAE_NXZ */
|
|
|
|
/* ?_ShouldSpinAgain@?$_SpinWait@$0A@@details@Concurrency@@IEAA_NXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait__ShouldSpinAgain, 4)
|
|
|
|
MSVCRT_bool __thiscall SpinWait__ShouldSpinAgain(SpinWait *this)
|
|
|
|
{
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
|
|
|
|
this->spin--;
|
|
|
|
return this->spin > 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?_SpinOnce@?$_SpinWait@$00@details@Concurrency@@QAE_NXZ */
|
|
|
|
/* ?_SpinOnce@?$_SpinWait@$00@details@Concurrency@@QEAA_NXZ */
|
|
|
|
/* ?_SpinOnce@?$_SpinWait@$0A@@details@Concurrency@@QAE_NXZ */
|
|
|
|
/* ?_SpinOnce@?$_SpinWait@$0A@@details@Concurrency@@QEAA_NXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(SpinWait__SpinOnce, 4)
|
|
|
|
MSVCRT_bool __thiscall SpinWait__SpinOnce(SpinWait *this)
|
|
|
|
{
|
|
|
|
switch(this->state) {
|
|
|
|
case SPINWAIT_INIT:
|
|
|
|
SpinWait__Reset(this);
|
|
|
|
/* fall through */
|
|
|
|
case SPINWAIT_SPIN:
|
|
|
|
#ifdef __i386__
|
|
|
|
__asm__ __volatile__( "rep;nop" : : : "memory" );
|
|
|
|
#else
|
|
|
|
__asm__ __volatile__( "" : : : "memory" );
|
|
|
|
#endif
|
|
|
|
|
|
|
|
this->spin--;
|
|
|
|
if(!this->spin)
|
|
|
|
this->state = this->unknown ? SPINWAIT_YIELD : SPINWAIT_DONE;
|
|
|
|
return TRUE;
|
|
|
|
case SPINWAIT_YIELD:
|
|
|
|
this->state = SPINWAIT_DONE;
|
|
|
|
this->yield_func();
|
|
|
|
return TRUE;
|
|
|
|
default:
|
|
|
|
SpinWait__Reset(this);
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
2014-06-24 11:57:37 +02:00
|
|
|
|
2014-06-24 11:57:47 +02:00
|
|
|
static HANDLE keyed_event;
|
|
|
|
|
2014-06-26 13:46:09 +02:00
|
|
|
/* keep in sync with msvcp90/msvcp90.h */
|
2014-06-24 11:57:47 +02:00
|
|
|
typedef struct cs_queue
|
|
|
|
{
|
|
|
|
struct cs_queue *next;
|
2014-06-24 11:57:53 +02:00
|
|
|
#if _MSVCR_VER >= 110
|
|
|
|
BOOL free;
|
|
|
|
int unknown;
|
|
|
|
#endif
|
2014-06-24 11:57:47 +02:00
|
|
|
} cs_queue;
|
|
|
|
|
2014-06-24 11:57:37 +02:00
|
|
|
typedef struct
|
|
|
|
{
|
2014-06-24 11:57:47 +02:00
|
|
|
ULONG_PTR unk_thread_id;
|
|
|
|
cs_queue unk_active;
|
|
|
|
#if _MSVCR_VER >= 110
|
|
|
|
void *unknown[2];
|
|
|
|
#else
|
|
|
|
void *unknown[1];
|
|
|
|
#endif
|
|
|
|
cs_queue *head;
|
2014-06-24 11:57:37 +02:00
|
|
|
void *tail;
|
|
|
|
} critical_section;
|
|
|
|
|
|
|
|
/* ??0critical_section@Concurrency@@QAE@XZ */
|
|
|
|
/* ??0critical_section@Concurrency@@QEAA@XZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_ctor, 4)
|
|
|
|
critical_section* __thiscall critical_section_ctor(critical_section *this)
|
|
|
|
{
|
2014-06-24 11:57:47 +02:00
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
|
|
|
|
if(!keyed_event) {
|
|
|
|
HANDLE event;
|
|
|
|
|
|
|
|
NtCreateKeyedEvent(&event, GENERIC_READ|GENERIC_WRITE, NULL, 0);
|
|
|
|
if(InterlockedCompareExchangePointer(&keyed_event, event, NULL) != NULL)
|
|
|
|
NtClose(event);
|
|
|
|
}
|
|
|
|
|
|
|
|
this->unk_thread_id = 0;
|
|
|
|
this->head = this->tail = NULL;
|
2014-06-24 11:57:37 +02:00
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ??1critical_section@Concurrency@@QAE@XZ */
|
|
|
|
/* ??1critical_section@Concurrency@@QEAA@XZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_dtor, 4)
|
|
|
|
void __thiscall critical_section_dtor(critical_section *this)
|
|
|
|
{
|
2014-06-24 11:57:47 +02:00
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __cdecl spin_wait_yield(void)
|
|
|
|
{
|
|
|
|
Sleep(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void spin_wait_for_next_cs(cs_queue *q)
|
|
|
|
{
|
|
|
|
SpinWait sw;
|
|
|
|
|
|
|
|
if(q->next) return;
|
|
|
|
|
|
|
|
SpinWait_ctor(&sw, &spin_wait_yield);
|
|
|
|
SpinWait__Reset(&sw);
|
|
|
|
while(!q->next)
|
|
|
|
SpinWait__SpinOnce(&sw);
|
|
|
|
SpinWait_dtor(&sw);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void cs_set_head(critical_section *cs, cs_queue *q)
|
|
|
|
{
|
|
|
|
cs->unk_thread_id = GetCurrentThreadId();
|
|
|
|
cs->unk_active.next = q->next;
|
|
|
|
cs->head = &cs->unk_active;
|
2014-06-24 11:57:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ?lock@critical_section@Concurrency@@QAEXXZ */
|
|
|
|
/* ?lock@critical_section@Concurrency@@QEAAXXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_lock, 4)
|
|
|
|
void __thiscall critical_section_lock(critical_section *this)
|
|
|
|
{
|
2014-06-24 11:57:47 +02:00
|
|
|
cs_queue q, *last;
|
|
|
|
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
|
|
|
|
if(this->unk_thread_id == GetCurrentThreadId()) {
|
|
|
|
FIXME("throw exception\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2014-06-24 11:57:53 +02:00
|
|
|
memset(&q, 0, sizeof(q));
|
2014-06-24 11:57:47 +02:00
|
|
|
last = InterlockedExchangePointer(&this->tail, &q);
|
|
|
|
if(last) {
|
|
|
|
last->next = &q;
|
|
|
|
NtWaitForKeyedEvent(keyed_event, &q, 0, NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
this->unk_active.next = NULL;
|
|
|
|
if(InterlockedCompareExchangePointer(&this->tail, &this->unk_active, &q) != &q)
|
|
|
|
spin_wait_for_next_cs(&q);
|
|
|
|
cs_set_head(this, &q);
|
2014-06-24 11:57:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ?try_lock@critical_section@Concurrency@@QAE_NXZ */
|
|
|
|
/* ?try_lock@critical_section@Concurrency@@QEAA_NXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_try_lock, 4)
|
|
|
|
MSVCRT_bool __thiscall critical_section_try_lock(critical_section *this)
|
|
|
|
{
|
2014-06-24 11:57:47 +02:00
|
|
|
cs_queue q;
|
|
|
|
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
|
|
|
|
if(this->unk_thread_id == GetCurrentThreadId()) {
|
|
|
|
FIXME("throw exception\n");
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
2014-06-24 11:57:53 +02:00
|
|
|
memset(&q, 0, sizeof(q));
|
2014-06-24 11:57:47 +02:00
|
|
|
if(!InterlockedCompareExchangePointer(&this->tail, &q, NULL)) {
|
|
|
|
this->unk_active.next = NULL;
|
|
|
|
if(InterlockedCompareExchangePointer(&this->tail, &this->unk_active, &q) != &q)
|
|
|
|
spin_wait_for_next_cs(&q);
|
|
|
|
|
|
|
|
cs_set_head(this, &q);
|
|
|
|
return TRUE;
|
|
|
|
}
|
2014-06-24 11:57:37 +02:00
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ?unlock@critical_section@Concurrency@@QAEXXZ */
|
|
|
|
/* ?unlock@critical_section@Concurrency@@QEAAXXZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_unlock, 4)
|
|
|
|
void __thiscall critical_section_unlock(critical_section *this)
|
|
|
|
{
|
2014-06-24 11:57:47 +02:00
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
|
|
|
|
this->unk_thread_id = 0;
|
|
|
|
this->head = NULL;
|
|
|
|
if(InterlockedCompareExchangePointer(&this->tail, NULL, &this->unk_active)
|
|
|
|
== &this->unk_active) return;
|
|
|
|
spin_wait_for_next_cs(&this->unk_active);
|
|
|
|
|
2014-06-24 11:57:53 +02:00
|
|
|
#if _MSVCR_VER >= 110
|
|
|
|
while(1) {
|
|
|
|
cs_queue *next;
|
|
|
|
|
|
|
|
if(!InterlockedExchange(&this->unk_active.next->free, TRUE))
|
|
|
|
break;
|
|
|
|
|
|
|
|
next = this->unk_active.next;
|
|
|
|
if(InterlockedCompareExchangePointer(&this->tail, NULL, next) == next)
|
|
|
|
return;
|
|
|
|
spin_wait_for_next_cs(next);
|
|
|
|
|
|
|
|
this->unk_active.next = next->next;
|
|
|
|
HeapFree(GetProcessHeap(), 0, next);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2014-06-24 11:57:47 +02:00
|
|
|
NtReleaseKeyedEvent(keyed_event, this->unk_active.next, 0, NULL);
|
2014-06-24 11:57:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ?native_handle@critical_section@Concurrency@@QAEAAV12@XZ */
|
|
|
|
/* ?native_handle@critical_section@Concurrency@@QEAAAEAV12@XZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_native_handle, 4)
|
|
|
|
critical_section* __thiscall critical_section_native_handle(critical_section *this)
|
|
|
|
{
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
return this;
|
|
|
|
}
|
2014-06-24 11:57:43 +02:00
|
|
|
|
2014-06-24 11:57:53 +02:00
|
|
|
#if _MSVCR_VER >= 110
|
|
|
|
/* ?try_lock_for@critical_section@Concurrency@@QAE_NI@Z */
|
|
|
|
/* ?try_lock_for@critical_section@Concurrency@@QEAA_NI@Z */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_try_lock_for, 8)
|
|
|
|
MSVCRT_bool __thiscall critical_section_try_lock_for(
|
|
|
|
critical_section *this, unsigned int timeout)
|
|
|
|
{
|
|
|
|
cs_queue *q, *last;
|
|
|
|
|
|
|
|
TRACE("(%p %d)\n", this, timeout);
|
|
|
|
|
|
|
|
if(this->unk_thread_id == GetCurrentThreadId()) {
|
|
|
|
FIXME("throw exception\n");
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!(q = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, sizeof(*q))))
|
|
|
|
return critical_section_try_lock(this);
|
|
|
|
|
|
|
|
last = InterlockedExchangePointer(&this->tail, q);
|
|
|
|
if(last) {
|
|
|
|
LARGE_INTEGER to;
|
|
|
|
NTSTATUS status;
|
|
|
|
FILETIME ft;
|
|
|
|
|
|
|
|
last->next = q;
|
|
|
|
GetSystemTimeAsFileTime(&ft);
|
|
|
|
to.QuadPart = ((LONGLONG)ft.dwHighDateTime<<32) +
|
|
|
|
ft.dwLowDateTime + (LONGLONG)timeout*10000;
|
|
|
|
status = NtWaitForKeyedEvent(keyed_event, q, 0, &to);
|
|
|
|
if(status == STATUS_TIMEOUT) {
|
|
|
|
if(!InterlockedExchange(&q->free, TRUE))
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
this->unk_active.next = NULL;
|
|
|
|
if(InterlockedCompareExchangePointer(&this->tail, &this->unk_active, q) != q)
|
|
|
|
spin_wait_for_next_cs(q);
|
|
|
|
|
|
|
|
cs_set_head(this, q);
|
|
|
|
HeapFree(GetProcessHeap(), 0, q);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2014-06-24 11:57:43 +02:00
|
|
|
typedef struct
|
|
|
|
{
|
|
|
|
critical_section *cs;
|
|
|
|
void *unknown[3];
|
|
|
|
} critical_section_scoped_lock;
|
|
|
|
|
|
|
|
/* ??0scoped_lock@critical_section@Concurrency@@QAE@AAV12@@Z */
|
|
|
|
/* ??0scoped_lock@critical_section@Concurrency@@QEAA@AEAV12@@Z */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_scoped_lock_ctor, 8)
|
|
|
|
critical_section_scoped_lock* __thiscall critical_section_scoped_lock_ctor(
|
|
|
|
critical_section_scoped_lock *this, critical_section *cs)
|
|
|
|
{
|
|
|
|
TRACE("(%p %p)\n", this, cs);
|
|
|
|
this->cs = cs;
|
|
|
|
critical_section_lock(this->cs);
|
|
|
|
return this;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* ??1scoped_lock@critical_section@Concurrency@@QAE@XZ */
|
|
|
|
/* ??1scoped_lock@critical_section@Concurrency@@QEAA@XZ */
|
|
|
|
DEFINE_THISCALL_WRAPPER(critical_section_scoped_lock_dtor, 4)
|
|
|
|
void __thiscall critical_section_scoped_lock_dtor(critical_section_scoped_lock *this)
|
|
|
|
{
|
|
|
|
TRACE("(%p)\n", this);
|
|
|
|
critical_section_unlock(this->cs);
|
|
|
|
}
|
2014-06-21 14:22:28 +02:00
|
|
|
#endif
|
2014-06-24 11:57:47 +02:00
|
|
|
|
|
|
|
/**********************************************************************
|
|
|
|
* msvcrt_free_locks (internal)
|
|
|
|
*
|
|
|
|
* Uninitialize all mt locks. Assume that neither _lock or _unlock will
|
|
|
|
* be called once we're calling this routine (ie _LOCKTAB_LOCK can be deleted)
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void msvcrt_free_locks(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
TRACE( ": uninitializing all mtlocks\n" );
|
|
|
|
|
|
|
|
/* Uninitialize the table */
|
|
|
|
for( i=0; i < _TOTAL_LOCKS; i++ )
|
|
|
|
{
|
|
|
|
if( lock_table[ i ].bInit )
|
|
|
|
{
|
|
|
|
msvcrt_uninitialize_mlock( i );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
#if _MSVCR_VER >= 100
|
|
|
|
if(keyed_event)
|
|
|
|
NtClose(keyed_event);
|
|
|
|
#endif
|
|
|
|
}
|