The following operators can be used to better focus your queries.
( ) , AND, OR, NOT, W/#
? single char wildcard, not at start
* multi char wildcard, not at start
(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*
This guide provides a more detailed description of the syntax that is supported along with examples.
This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.
Concept Search - What can I type?
For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.
Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.
This is a method to allocate registers to global variables
through the entire program.
English (United States)
This text was extracted from a PDF file.
100% of the total text.
Page 1 of 1
A whole program register promotion method for global variables
This method allocates registers to global variables through the entire program. This requires interference graphs of local and global variables for all functions. It first simplify each graph using Briggs' coloring heuristic. It removes a node from the interferenfe graph and push it onto the stack.While removing and pushing nodes, it deffers processing global variable nodes as late as possible. By doing so, register-assignable global variables are pushed at the top of the stack. Next this method collects such stack-top global variables for each function and build another interference graph of such collected variables. Coloring this graph then determines which color goes which global variable. Next coloring for local variables in each method is attempted function by function. While popping a node and assigning a color to it, if the popped node is a stack-top global variable, the pre-determined color is used, otherwise a color is chosen by the original Briggs' heuristic and used for assignment.
Disclosed by International Business Machines Corporation