This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [lto][patch] Fixed version of a previous patch


On Tue, Feb 24, 2009 at 07:57, Rafael Espindola <espindola@google.com> wrote:

> gcc/
> 2009-02-19  Rafael Avila de Espindola  <espindola@google.com>
>
>        * ipa.c (cgraph_remove_unreachable_nodes): Search all clones.
>        * lto-cgraph.c: Include lto-util.h
>        (maybe_redirect_inlined_node): Remove.
>        (output_edge): Don't worry about an edge poiting to a node not in know
>        by the encoder.
>        (output_node): Output the decl number instead of the master node
>        number in the case of a clone.
>        (output_cgraph_verify_node): Don't check that the master is in the set.
>        (output_cgraph): Don't output the current master for each decl. The
>        first node output will be the master in ltrans.
>        (input_node): If a clone, read the decl number and use that decls'
>        master node.
>        (input_cgraph_1): Update call to input_node.
>        * lto-function-out.c (lto_output): Proces each function once. Don't
>        care if the node is the master.
>
> gcc/lto/
> 2009-02-19  Rafael Avila de Espindola  <espindola@google.com>
>
>        * lto.c (lto_add_inline_clones): Don't add the master clone. Check
>        for a decl in the original bitmap, not a node.
>        (lto_add_all_inlinees): Remove original nodes that are not needed.
>        (lto_scan_statics_in_cgraph_node): Don't care if the node is the master.
>
> gcc/testsuite/
> 2009-02-19  Rafael Avila de Espindola  <espindola@google.com>
>
>        * gcc.dg/lto/20090218-2_0.c: New.
>        * gcc.dg/lto/20090218-2_1.c: New.

All builds finished successfully.  Committed.


Diego.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]