comparison gcc/tree-ssa-uncprop.c @ 63:b7f97abdc517 gcc-4.6-20100522

update gcc from gcc-4.5.0 to gcc-4.6
author ryoma <e075725@ie.u-ryukyu.ac.jp>
date Mon, 24 May 2010 12:47:05 +0900
parents 77e2b8dfacca
children f6334be47118
comparison
equal deleted inserted replaced
56:3c8a44c06a95 63:b7f97abdc517
1 /* Routines for discovering and unpropagating edge equivalences. 1 /* Routines for discovering and unpropagating edge equivalences.
2 Copyright (C) 2005, 2007, 2008 Free Software Foundation, Inc. 2 Copyright (C) 2005, 2007, 2008, 2010
3 Free Software Foundation, Inc.
3 4
4 This file is part of GCC. 5 This file is part of GCC.
5 6
6 GCC is free software; you can redistribute it and/or modify 7 GCC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by 8 it under the terms of the GNU General Public License as published by
21 #include "system.h" 22 #include "system.h"
22 #include "coretypes.h" 23 #include "coretypes.h"
23 #include "tm.h" 24 #include "tm.h"
24 #include "tree.h" 25 #include "tree.h"
25 #include "flags.h" 26 #include "flags.h"
26 #include "rtl.h"
27 #include "tm_p.h" 27 #include "tm_p.h"
28 #include "ggc.h"
29 #include "basic-block.h" 28 #include "basic-block.h"
30 #include "output.h" 29 #include "output.h"
31 #include "expr.h" 30 #include "expr.h"
32 #include "function.h" 31 #include "function.h"
33 #include "diagnostic.h" 32 #include "diagnostic.h"
34 #include "timevar.h" 33 #include "timevar.h"
35 #include "tree-dump.h" 34 #include "tree-dump.h"
36 #include "tree-flow.h" 35 #include "tree-flow.h"
37 #include "domwalk.h" 36 #include "domwalk.h"
38 #include "real.h"
39 #include "tree-pass.h" 37 #include "tree-pass.h"
40 #include "tree-ssa-propagate.h" 38 #include "tree-ssa-propagate.h"
41 #include "langhooks.h" 39 #include "langhooks.h"
42 40
43 /* The basic structure describing an equivalency created by traversing 41 /* The basic structure describing an equivalency created by traversing
454 gimple_seq phis = phi_nodes (e->dest); 452 gimple_seq phis = phi_nodes (e->dest);
455 gimple_stmt_iterator gsi; 453 gimple_stmt_iterator gsi;
456 454
457 /* If there are no PHI nodes in this destination, then there is 455 /* If there are no PHI nodes in this destination, then there is
458 no sense in recording any equivalences. */ 456 no sense in recording any equivalences. */
459 if (!phis) 457 if (gimple_seq_empty_p (phis))
460 continue; 458 continue;
461 459
462 /* Record any equivalency associated with E. */ 460 /* Record any equivalency associated with E. */
463 if (e->aux) 461 if (e->aux)
464 { 462 {