MANAGING ALIASING CONSTRAINTS
    1.
    发明专利

    公开(公告)号:CA2746136C

    公开(公告)日:2018-05-29

    申请号:CA2746136

    申请日:2011-07-12

    Abstract: An illustrative embodiment of a computer-implemented process for managing aliasing constraints, identifies an object to form an identified object, identifies a scope of the identified object to form an identified scope, and assigns a unique value to the identified object within the identified scope. The computer-implemented process further demarcates an entrance to the identified scope, demarcates an exit to the identified scope, optimizes the identified object using a property of the identified scope and associated aliasing information, tracks the identified object state to form tracked state information; and uses the tracked state information to update the identified object.

    METHOD AND SYSTEM FOR OPTIMIZING A SOFTWARE PROGRAM USING INTERPROCEDURAL CODE MOTION

    公开(公告)号:CA2447443A1

    公开(公告)日:2005-04-29

    申请号:CA2447443

    申请日:2003-10-29

    Applicant: IBM CANADA

    Abstract: Disclosed is an interprocedural compilation technique for moving upward exposed expressions across procedure boundaries to potentially improve performance i n the execution of compiled software program code. Intermediate representations of a software program, including a call graph, a control flow graph, a data flow graph and a post-dominate tree, may be generated and used. In an embodiment, a software program compiler may be configured to carry out a depth-first traversal of each procedure in the software program, as represented by nodes in a call graph intermediate representation of the software program. Candidate upward exposed expressions are identified in callee procedures, and selected for possible interprocedural code motion. In an embodiment, a procedure interface descriptor is built for each callee procedure by defining a new formal parameter for each upward exposed expression moved, replacing each upward exposed expression with the new formal parameter, and identifying any dead parameters resulting from removal of the upward exposed expression.

    MANAGING ALIASING CONSTRAINTS
    3.
    发明专利

    公开(公告)号:CA2746136A1

    公开(公告)日:2013-01-12

    申请号:CA2746136

    申请日:2011-07-12

    Applicant: IBM CANADA

    Abstract: An illustrative embodiment of a computer-implemented process for managing aliasing constraints, identifies an object to form an identified object, identifies a scope of the identified object to form an identified scope, and assigns a unique value to the identified object within the identified scope. The computer-implemented process further demarcates an entrance to the identified scope, demarcates an exit to the identified scope, optimizes the identified object using a property of the identified scope and associated aliasing information, tracks the identified object state to form tracked state information; and uses the tracked state information to update the identified object.

    MAY-CONSTANT PROPAGATION
    4.
    发明专利

    公开(公告)号:CA2684441C

    公开(公告)日:2012-06-05

    申请号:CA2684441

    申请日:2009-09-22

    Applicant: IBM CANADA

    Abstract: An illustrative embodiment provides a computer-implemented process for may--constant propagation, obtains a source code, and generates a set of associated data structures from the source code and a set of may-constant data structures. The computer--implemented process identifies a candidate code for may-constant propagation to form an identified candidate code, updates the set of may-constant data structures, and selects an identified candidate code using information in the may-constant data structures, including probability, to form a selected candidate code. The computer-implemented process further identifies a code region associated with the selected candidate code to form an identified code region and modifies the identified code region including the selected candidate code.

    MAY-CONSTANT PROPAGATION
    5.
    发明专利

    公开(公告)号:CA2684441A1

    公开(公告)日:2010-02-04

    申请号:CA2684441

    申请日:2009-09-22

    Applicant: IBM CANADA

    Abstract: An illustrative embodiment provides a computer-implemented process for may--constant propagation, obtains a source code, and generates a set of associated data structures from the source code and a set of may-constant data structures. T he computer--implemented process identifies a candidate code for may-constant propagation to form an identified candidate code, updates the set of may-constant data structures, and selects an identified candidate code using information in the may-constant data structures, including probability, to form a selected candidate code. The computer-implemented process further identifies a code region associated with the selected candidate code to form an identified code region and modifies the identified code region including the selected candidate code.

    DATA SPLITTING FOR MULTI-INSTANTIATED OBJECTS

    公开(公告)号:CA2820230A1

    公开(公告)日:2015-01-09

    申请号:CA2820230

    申请日:2013-07-09

    Applicant: IBM CANADA

    Abstract: An illustrative embodiment of a computer-implemented process for data splitting for multi-instantiated objects receives a portion of source code for compilation having a dynamic object to split using object size array data splitting and replaces all memory allocations for the dynamic object with a total size of an object size array and object field arrays including a predetermined padding. The embodiment further inserts statements in the source code after the memory allocations to populate the object size array with a value of a number of elements of the object size array and updates a stride for load and store operations using dynamic pointers. The embodiment further modifies field references by adding a distance between the object size array and the object field array to respective address operations.

Patent Agency Ranking