Method and apparatus for ordered predicate phi in static...

Data processing: software development – installation – and managem – Software program development tool – Translation of code

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C717S141000, C717S142000, C717S158000, C717S159000

Reexamination Certificate

active

06898787

ABSTRACT:
A Φ function provides a mechanism for static single assignment in the presence of predicated code. Guards placed on each source operand of the Φ function indicate the condition under which the corresponding source operand is live and provide correct materialization of the Φ functions after code reordering. For control functions Φcrepresenting a confluence of live reaching definitions at a join point in the control flow graph, the guards indicate the basic block which is the source of the edge associated with the source operand. The Φcoperands are paired with the source basic block of the incoming edge(s) along which they are live. The operands are also ordered according to a topological ordering of their associated block. This ordering is maintained through subsequent code transformations. In the topological ordering, the source of the edge from which the definition was passed is defined. A predicate Φ function Φp, represents the confluence of definitions in a straight line of code in which some of the definitions have been predicated. For Φp, the guards on the source operands indicate the predicate under which the corresponding operand is live. The order of the operands is such that the Φpfunction can be fully materialized by inserting a copy from each source operand to the target variable, in the corresponding order, and each predicated by the associated predicate guard.

REFERENCES:
patent: 5448737 (1995-09-01), Burke et al.
patent: 6035124 (2000-03-01), Ng
patent: 6182284 (2001-01-01), Sreedhar et al.
patent: 6651247 (2003-11-01), Srinivasan
Balance, R., A. Maccabe, and K. Ottenstein;The Program Dependence Web: A Representation Supporting Control-, Data-, and Demand-Driven Interpretation of Imperative Languages;1990; ACM.
Cytron, R., J. Ferrante, B. Rosen, and M. Wegman;Efficiently Computing Static Single Assignment Form and the Control Dependence Graph;1991; ACM Transactions on Programming, vol. 13, No. 4.
Park, J. and M. Schlansker;On Predicated Execution;1991; Hewlett Packard Company.
Ramakrishna Rau, R., D. Yen, W. Yen, and R. Towle;The Cydra 5 Departmental Supercomputer;1989; IEEE.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for ordered predicate phi in static... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for ordered predicate phi in static..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for ordered predicate phi in static... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3431170

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.