How to determine the correct pairs of function calls

Question

I am looking for a tool capable of detecting paired calls to paired functions in a nested manner, as shown below:

f()   // depth 0
   f()  //depth 1
   g()
g()

At each call depth there f()should be a call to g()form a pair of function calls. This is especially important when entering and exiting a critical section.

Answer 1

In C ++, one option is to wrap the calls f()and g()in the constructor and destructor of the class and just call these functions creates an instance of an instance of this class. For instance,

struct FAndGCaller
{
    FAndGCaller() { f(); }
    ~FAndGCaller() { g(); }
};

This can then be used in any scope block as follows:

{
    FAndGCaller call_f_then_later_g; // calls f()

} // calls g()

, , f() g() , .

(SBRM, Resource Assquisition, , RAII) .

Answer 2

for -loop .

#define SAVETHEDAY for (bool seen = ((void)f(), true); seen; seen = ((void)g(), false))

f g.

SAVETHEDAY {

    SAVETHEDAY {

    }
}

:

• .
• ++ C99.
• for -loop .

:

• break, return continue , g .
• ++ throw , g
• , - ().
• ++, , ,

continue , - . ++, for -variable, f g .

Answer 3

( ) , f(), . , g(), . . - , ( g(), f()).

, - C () ++, . , . , , clang ( ), , , , .

Answer 4

The Coccinelle tool for semantic search and correction of C code is designed for this kind of task (see also this LWN article on the tool).