Compiler reordering around mutex boundaries?

Posted by shojtsy on Stack Overflow See other posts from Stack Overflow or by shojtsy
Published on 2010-04-22T22:38:45Z Indexed on 2010/04/22 22:43 UTC
Read the original article Hit count: 212

Filed under:

compiler-optimization

|

memory-barriers

|

c++

Suppose I have my own non-inline functions LockMutex and UnlockMutex, which are using some proper mutex - such as boost - inside. How will the compiler know not to reorder other operations with regard to calls to the LockMutex and UnlockMutex? It can not possibly know how will I implement these functions in some other compilation unit.

void SomeClass::store(int i)
{
  LockMutex(_m);
  _field = i;  // could the compiler move this around?
  UnlockMutex(_m);
}

ps: One is supposed to use instances of classes for holding locks to guarantee unlocking. I have left this out to simplify the example.

© Stack Overflow or respective owner

Related posts about compiler-optimization

Can compiler optimization introduce bugs ?

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, Today I had a discussion with a friend of mine and we debated for a couple of hours about "compiler optimization". I defended the point that sometimes, a compiler optimization might introduce bugs or at least, undesired behavior. My friend totally disagreed, saying that "compiler are built… >>> More
Compiler optimization causing the performance to slow down

as seen on Stack Overflow - Search for 'Stack Overflow'
I have one strange problem. I have following piece of code: template<clss index, class policy> inline int CBase<index,policy>::func(const A& test_in, int* srcPtr ,int* dstPtr) { int width = test_in.width(); int height = test_in.height(); double d = 0.0; //here is the… >>> More
Compiler optimization of reference variables

as seen on Stack Overflow - Search for 'Stack Overflow'
I often use references to simplify the appearance of code: vec3f& vertex = _vertices[index]; // Calculate the vertex position vertex[0] = startx + col * colWidth; vertex[1] = starty + row * rowWidth; vertex[2] = 0.0f; Will compilers recognize and optimize this so it is essentially the following… >>> More
Compiler optimization of repeated accessor calls

as seen on Stack Overflow - Search for 'Stack Overflow'
I've found recently that for some types of financial calculations that the following pattern is much easier to follow and test especially in situations where we may need to get numbers from various stages of the computation. public class nonsensical_calculator { ... double _rate; int… >>> More
Compiler optimization of references

as seen on Stack Overflow - Search for 'Stack Overflow'
I often use references to simplify the appearance of code: vec3f& vertex = _vertices[index]; // Calculate the vertex position vertex[0] = startx + col * colWidth; vertex[1] = starty + row * rowWidth; vertex[2] = 0.0f; Will compilers recognize and optimize this so it is essentially the following… >>> More

Related posts about memory-barriers

Memory barriers in userspace? (Linux, x86-64)

as seen on Stack Overflow - Search for 'Stack Overflow'
It is easy to set memory barriers on the kernel side: the macros mb, wmb, rmb, etc. are always in place thanks to the Linux kernel headers. How to accomplish this on the user side? >>> More
How do JVM's implicit memory barriers behave when chaining constructors

as seen on Stack Overflow - Search for 'Stack Overflow'
Referring to my earlier question on incompletely constructed objects, I have a second question. As Jon Skeet pointed out, there's an implicit memory barrier in the end of a constructor that makes sure that final fields are visible to all threads. But what if a constructor calls another constructor;… >>> More
Are memory barriers necessary for atomic reference counting shared immutable data?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have some immutable data structures that I would like to manage using reference counts, sharing them across threads on an SMP system. Here's what the release code looks like: void avocado_release(struct avocado *p) { if (atomic_dec(p->refcount) == 0) { free(p->pit); free(p->juicy_innards); … >>> More
Implicit Memory Barriers

as seen on Stack Overflow - Search for 'Stack Overflow'
let's say i have variables A, B and C that two threads (T1, T2) share. i have the following code: //T1 //~~ A = 1; B = 1; C = 1; InterlockedExchange(ref Foo, 1); //T2 (executes AFTER T1 calls InterlockedExchange) //~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ InterlockedExchange(ref… >>> More
Fastest inline-assembly spinlock

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm writing a multithreaded application in c++, where performance is critical. I need to use a lot of locking while copying small structures between threads, for this I have chosen to use spinlocks. I have done some research and speed testing on this and I found that most implementations are roughly… >>> More