Data processing: software development – installation – and managem – Software program development tool – Translation of code
Reexamination Certificate
1997-04-07
2001-07-10
Powell, Mark R. (Department: 2122)
Data processing: software development, installation, and managem
Software program development tool
Translation of code
Reexamination Certificate
active
06260191
ABSTRACT:
TECHNICAL FIELD OF THE INVENTION
This invention relates to the compiling of code with memory references to volatile data and more particularly to a system and method permitting selective compiler optimization of code containing such references through use of keyword modifiers on volatile type declarations.
BACKGROUND OF THE INVENTION
The C and C++ language standards are among those that support the “volatile” type-qualifier for compiler operation. For example, as stated in the 1990 American National Standard for Information Systems—Programming Language C (hereinafter referred to as the “ANSI Standard”): “An object that has volatile-qualified type may be modified in ways unknown to the implementation or have other unknown side effects.”
A programmer may use the volatile type-qualifier for a variety of reasons, such as to enable accesses to shared memory, or to memory-mapped I/O locations (so as, for example, to communicate with external devices). Alternatively, the volatile type-qualifier may be used to enable access to locations that may be asynchronously accessed by an interrupt handler.
Accordingly, compilers, and more specifically compiler optimization phases, tend to be very conservative in the treatment of accesses to objects with volatile-qualified type in order to adhere to the standard and to accommodate the spectrum of applications of the volatile keyword. This conservative approach often results in a loss of compiler optimization opportunities and hence adversely affects run-time performance.
Compilers generally treat an access to a volatile type-qualified object in a universally inflexible manner. Specifically, for example,
a volatile load or store is never deleted or transformed into a register reference;
a volatile load or store is emitted with an “ordered” completer to ensure sequential run-time hardware execution on weakly ordered systems;
no memory reference instructions are scheduled across a volatile load or store; and
a volatile load or store is never moved to a location where it could be executed “speculatively.”
It is not always necessary to take such a universally inflexible approach. Sometimes selected optimizations could be allowed without endangering compilation integrity. These selected optimizations could help recover otherwise lost optimization opportunities and thereby enhance run-time performance.
Operating systems, in particular, have a need to declare a wide variety of data accesses as volatile in order to prevent incorrect compiler optimization of kernel code. However, this adversely affects performance, sometimes more than necessary. For instance, on weakly ordered systems, the volatile type-qualifier may be specified solely to ensure that the compiler emits a memory reference instruction to the volatile type-qualified object using a “strongly ordered” memory reference opcode or completer. In some programming applications, however, it may be perfectly acceptable for the compiler to perform certain selected optimizations, such as local register promotion on accesses using a “strongly ordered” completer, even though such transformations might not be safe to perform on all volatile references in general.
There is therefore a need for a regime of keywords that modify the general volatile type-qualifier, and whose selected use will permit (or not permit) certain optimization operations in compiling code containing references to volatile data.
SUMMARY OF THE INVENTION
These and other objects and features are achieved by one embodiment of the invention which comprises a system that enables a programmer to relax optimization constraints and requirements that are otherwise associated with volatile memory reference by default. Specifically, these relaxation “hints” can be expressed either as additional modifying type-qualifiers or as pragmas to loosen the restrictions associated with the volatile type-qualifier. By way of example (and without limitation), four (4) such relaxation hints are illustrated below that bring technical advantage to a corresponding volatile access described therewith:
a. relaxing asynchronicity of the access: a volatile access that is guaranteed to be synchronous allows local register promotion and eliminates redundant definition of volatile loads and stores.
b. relaxing strong ordering requirements: if the underlying hardware does not need to observe strong ordering constraints when executing a volatile memory access, the corresponding load or store need not be marked with the ordered completer, which in turn allows faster execution of such references at run-time.
c. relaxing constraints on compiler scheduling freedom: a volatile access that does not need to be executed sequentially relative to other non-volatile references can be scheduled better by the compiler.
d. relaxing constraints on control speculation freedom: a volatile access that does not refer to a memory-mapped I/O location can be re-ordered to execute speculatively ahead of controlling branches, again leading to potentially higher run-time performance.
Accordingly, one technical advantage of the invention is that a programmer is allowed to facilitate increased optimization of accesses to volatile type-qualified objects in contexts where it is safe and advantageous to do so.
Another technical advantage of the invention is that the system allows a programmer to selectively increase the aggressiveness of the compiler for certain code which would otherwise be compiled in a conservative (non-aggressive) manner.
The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and the specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims.
REFERENCES:
patent: 5335351 (1994-08-01), Aida et al.
patent: 5535391 (1996-07-01), Hejlsberg et al.
patent: 5586020 (1996-12-01), Isozaki
patent: 5606697 (1997-02-01), Ono
patent: 5742828 (1998-04-01), Canady et al.
patent: 5758164 (1998-05-01), Inoue
International Standard Programming LAnguage C+ +ISO.IEC 14882 First edition, Jan. 1998.*
Borland International, Inc., User's Guide: Borland C+ +Version 4.0, Chapter 3 -Compiling 43-82, 1993.*
Borland International, Inc., Programmer's Guide: Borland C+ +Version 4.0, pp. 2, 37, 48-58, 198-202, 1993.*
Kane, Gerry, “PA-RISC 2.0 Architecture”, Hewlett-Packard Company, pp. 7-84, 7-85, 7-142, 7-143 and G-1-G-14, 1996.*
Schatzman, B., “Unraveling Optimization in Microsoft C 6.0”; Dr. Dobbs Journal, Oct. 1990.*
“American National Standard for Information Systems—Programming Language—C,” Accredited Standards Committee X3, Information processing System, Feb. 14, 1990, pp. 65-67.
Hewlett--Packard Company
Ingberg Todd
Powell Mark R.
LandOfFree
User controlled relaxation of optimization constraints... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with User controlled relaxation of optimization constraints..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and User controlled relaxation of optimization constraints... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2456398