gcc/gcc/graphds.c - Issue 3050029: [gcc] GCC 4.5.0=>4.5.1

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Unified Diff: gcc/gcc/graphds.c

Issue 3050029: [gcc] GCC 4.5.0=>4.5.1 (Closed) Base URL: ssh://git@gitrw.chromium.org:9222/nacl-toolchain.git

Patch Set: Created 10 years, 5 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

Index: gcc/gcc/graphds.c

diff --git a/gcc/gcc/graphds.c b/gcc/gcc/graphds.c

index 7dcb04c139bcfa062e999ecf2727673c2e231e7a..4ee71dff904d485fd501540042c338290a0d8ef3 100644

--- a/gcc/gcc/graphds.c

+++ b/gcc/gcc/graphds.c

@@ -266,7 +266,7 @@ graphds_dfs (struct graph *g, int *qs, int nq, VEC (int, heap) **qt,

numbers assigned by the previous pass. If SUBGRAPH is not NULL, it

specifies the subgraph of G whose strongly connected components we want

to determine.

After running this function, v->component is the number of the strongly

connected component for each vertex of G. Returns the number of the

sccs of G. */

@@ -409,7 +409,7 @@ graphds_domtree (struct graph *g, int entry,

/* We use a slight modification of the standard iterative algorithm, as

described in

K. D. Cooper, T. J. Harvey and K. Kennedy: A Simple, Fast Dominance

Algorithm

« no previous file with comments | « gcc/gcc/gimple-pretty-print.c ('k') | gcc/gcc/graphite.h » ('j') | no next file with comments »