队列访问加锁的问题

[UnrealImagecoffee]

一个 环形 队列， 多线程 访问， 需要 加锁 吗？？
是在 类里 加锁 还是在 定义 变量的 时候 加锁

[DentistryDoctor]

如果都是只读，不用加锁；否则需要加锁。

类里 加锁 还是在 定义 变量的 时候 加锁?这句话是什么意思？

[会思考的草]

如果在类里面加锁，需要判断线程ID，这样也可以。

[mynamelj]

/**********************************************************************
* Copyright (C) 2005 IWANTFLY studio
* Module Name: CCriticalQueue
* Description:
* Create Data: 2005-11-18 Update Data: 2005-11-18
* Author: LiJiun
* E-Mail: mailto:[e-mail]
*
*********************************************************************/
#pragma once
#include <deque>

class CriticalSection
{
public:
CriticalSection()
{
::InitializeCriticalSection(&m_sect);
}
virtual ~CriticalSection()
{
::DeleteCriticalSection(&m_sect);
}
public:
void Unlock()
{
::LeaveCriticalSection(&m_sect);
}
void Lock()
{
::EnterCriticalSection(&m_sect);
}
protected:
CRITICAL_SECTION m_sect;
};


template <class _Ty,
class _Container = std::deque <_Ty> >
class CCriticalQueue
{
public:
typedef _Container container_type;
typedef typename _Container::value_type value_type;
typedef typename _Container::size_type size_type;

CCriticalQueue() : c()
{
}

explicit CCriticalQueue(const _Container& _Cont)
: c(_Cont)
{ // construct by copying specified container
}

~CCriticalQueue()
{
}

bool empty() const
{ // test if queue is empty
return (c.empty());
}

size_type size() const
{ // return length of queue
return (c.size());
}

value_type& front()
{ // return first element of mutable queue
return (c.front());
}

const value_type& front() const
{ // return first element of nonmutable queue
return (c.front());
}

value_type& back()
{ // return last element of mutable queue
return (c.back());
}

const value_type& back() const
{ // return last element of nonmutable queue
return (c.back());
}

void push(const value_type& _Val)
{ // insert element at beginning
m_CriticalSection.Lock();
c.push_back(_Val);
m_CriticalSection.Unlock();
}

void pop()
{ // erase element at end
m_CriticalSection.Lock();
c.pop_front();
m_CriticalSection.Unlock();
}

bool _Eq(const CCriticalQueue<_Ty, _Container>& _Right) const
{ // test for queue equality
return (c == _Right.c);
}

bool _Lt(const CCriticalQueue<_Ty, _Container>& _Right) const
{ // test if this < _Right for queues
return (c < _Right.c);
}
protected:
_Container c; // the underlying container
CriticalSection m_CriticalSection;

};

template<class _Ty,
class _Container> inline
bool operator==(const CCriticalQueue<_Ty, _Container>& _Left,
const CCriticalQueue<_Ty, _Container>& _Right)
{ // test for queue equality
return (_Left._Eq(_Right));
}

template<class _Ty,
class _Container> inline
bool operator!=(const CCriticalQueue<_Ty, _Container>& _Left,
const CCriticalQueue<_Ty, _Container>& _Right)
{ // test for queue inequality
return (!(_Left == _Right));
}

template<class _Ty,
class _Container> inline
bool operator<(const CCriticalQueue<_Ty, _Container>& _Left,
const CCriticalQueue<_Ty, _Container>& _Right)
{ // test if _Left < _Right for queues
return (_Left._Lt(_Right));
}

template<class _Ty,
class _Container> inline
bool operator>(const CCriticalQueue<_Ty, _Container>& _Left,
const CCriticalQueue<_Ty, _Container>& _Right)
{ // test if _Left > _Right for queues
return (_Right < _Left);
}

template<class _Ty,
class _Container> inline
bool operator<=(const CCriticalQueue<_Ty, _Container>& _Left,
const CCriticalQueue<_Ty, _Container>& _Right)
{ // test if _Left <= _Right for queues
return (!(_Right < _Left));
}

template<class _Ty,
class _Container> inline
bool operator>=(const CCriticalQueue<_Ty, _Container>& _Left,
const CCriticalQueue<_Ty, _Container>& _Right)
{ // test if _Left >= _Right for queues
return (!(_Left < _Right));
}

[UnrealImagecoffee]

楼上 是我 需要的 谢谢