Subject: With 'COMPATIBLE', the value resulting from data conversion is the one closer to the two nearest representations, or the value away from zero if the value is halfway between them.

From: "Zuniga Joachim" <[email-masked]>
Date: Wed, 20 Jun 2007 09:30:07 +0300

LockLint provides subcommands for specifying assertions about the application.
Makefile Rules To modify your makefile to produce .
The term general race condition throughout this article means a race condition which is not data race type. It is extremely important for a meaningful analysis that LockLint have the correct call graph for the code to be analyzed. Downgraded means a transformation in the opposite direction. It tells LockLint that a hierarchical relationship exists between a readers-writer lock and a set of other locks. His focus is on the architecture and future technology of Sun Studio developer tools.
This problem may lead to a deadlock. VOLATILE imposes limits on optimization. Simply accessing a variable without first acquiring the appropriate lock can cause a data race.
However, the proper operation of LockLint requires that a given variable or lock be known by exactly one name. However, if the unnamed lock always refers to the same lock, use the declare one subcommand so that LockLint can report this type of potential deadlock. Program Knowledge Management LockLint acquires its information on the sources to be analyzed with a set of databases produced by the C compiler. With subcommands, the finest granularity you can achieve is to check an assertion on entry to a function.
Do this by using the declare root subcommand. Information about the function pointers in the currently loaded files is available through the funcptrs subcommand. This is treated analogously to the previous case; the index is ignored.
A general race condition is a much harder problem to detect than a data race condition.
Software development requires using the right set of tools, and this is especially true for parallel software.
Allocatable array components may appear in SEQUENCE types, but objects of such types are then prohibited from COMMON and EQUIVALENCE. This can assist in judging the appropriateness of the chosen granularity, that is, which variables are protected by which locks.
When a thread or a process causes a transitory state occurring on some program objects, avoid another concurrent thread or process operating on the same objects in parallel. Make assertions about the order in which locks should be acquired in order to avoid deadlocks, using the assert order subcommand.
Cycles and inconsistent lock-order acquisitions. For example, most of the members of struct BAR below are protected by the lock on struct foo, but one is protected by a global lock. Program Knowledge Management LockLint acquires its information on the sources to be analyzed with a set of databases produced by the C compiler.
Additionally, for parallel programs written in Sun Fortran,  it can be used to specify that the value of an entity might be changed by another thread than the current thread.
For example, one of the returns from a function may forget to unlock a lock acquired in the function.
If there are function pointer assignments that LockLint could not discover, they may be specified with the declare .
Here we extend the partition program example to demonstrate a general race problem. However there are several tools available today to handle the data race condition problem.
In fact, even if you are not using LockLint often, annotations are worthwhile just for this purpose. You may want to set up an alias for analyze that automatically does a save before analyzing.
This data race problem is quite subtle and hard to understand without a serious investigation.