先简单看一篇关于GCC原子性操作的概念东西吧,见
http://blog.csdn.net/summerhust/article/details/7406683
再来看一看陈硕老师封装的原子类,很简单,拿来直接用了。(PS:我去掉了namespace)
下面是线程安全的
// Use of this source code is governed by a BSD-style license
// that can be found in the License file.
//
// Author: Shuo Chen (chenshuo at chenshuo dot com)
#ifndef MUDUO_BASE_ATOMIC_H
#define MUDUO_BASE_ATOMIC_H
#include <boost/noncopyable.hpp>
#include <stdint.h>
template<typename T>
class AtomicIntegerT : boost::noncopyable
{
public:
AtomicIntegerT()
: value_(0)
{
}
// uncomment if you need copying and assignment
//
// AtomicIntegerT(const AtomicIntegerT& that)
// : value_(that.get())
// {}
//
// AtomicIntegerT& operator=(const AtomicIntegerT& that)
// {
// getAndSet(that.get());
// return *this;
// }
T get()
{
//if is 0 ,then 0 retrun value,原子性操作,线程安全的
return __sync_val_compare_and_swap(&value_, 0, 0);
}
T getAndAdd(T x)
{
//返回的是没有修改的value的值
return __sync_fetch_and_add(&value_, x);
}
T addAndGet(T x)
{
//+x不会引起race condition,因为是局部变量
return getAndAdd(x) + x;
}
T incrementAndGet()
{
return addAndGet(1);
}
T decrementAndGet()
{
return addAndGet(-1);
}
void add(T x)
{
getAndAdd(x);
}
void increment()
{
incrementAndGet();
}
void decrement()
{
decrementAndGet();
}
T getAndSet(T newValue)
{
return __sync_lock_test_and_set(&value_, newValue);
}
private:
/*volatile变量
C和C++中的volatile并不是用来解决多线程竞争问题的?
而是用来修饰一些因为程序不可控因素导致变化的变量,比如访问底层硬件设备的变量,
以提醒编译器不要对该变量的访问擅自进行优化
*/
volatile T value_;
};
typedef detail::AtomicIntegerT<int32_t> AtomicInt32;
typedef detail::AtomicIntegerT<int64_t> AtomicInt64;
#endif // MUDUO_BASE_ATOMIC_H
附带上的测试程序
#include <muduo/base/Atomic.h>
#include <assert.h>
int main()
{
{
AtomicInt64 a0;
assert(a0.get() == 0);
assert(a0.getAndAdd(1) == 0);
assert(a0.get() == 1);
assert(a0.addAndGet(2) == 3);
assert(a0.get() == 3);
assert(a0.incrementAndGet() == 4);
assert(a0.get() == 4);
a0.increment();
assert(a0.get() == 5);
assert(a0.addAndGet(-3) == 2);
assert(a0.getAndSet(100) == 2);
assert(a0.get() == 100);
}
{
AtomicInt32 a1;
assert(a1.get() == 0);
assert(a1.getAndAdd(1) == 0);
assert(a1.get() == 1);
assert(a1.addAndGet(2) == 3);
assert(a1.get() == 3);
assert(a1.incrementAndGet() == 4);
assert(a1.get() == 4);
a1.increment();
assert(a1.get() == 5);
assert(a1.addAndGet(-3) == 2);
assert(a1.getAndSet(100) == 2);
assert(a1.get() == 100);
}
}