X-Git-Url: http://git.sourceforge.jp/view?a=blobdiff_plain;f=gcc%2Fdf-core.c;h=7f89fccdfb358682e9561884c43426f363a96548;hb=138fbfd03489528c7f71b4c9e755fb1da3e0e277;hp=f0c62c91c1efb61232578e05a1c3f68232b2da18;hpb=aa7aac1f6a7a61e7adb8b5cddc9edd600e927e20;p=pf3gnuchains%2Fgcc-fork.git

diff --git a/gcc/df-core.c b/gcc/df-core.c
index f0c62c91c1e..7f89fccdfb3 100644
--- a/gcc/df-core.c
+++ b/gcc/df-core.c
@@ -164,7 +164,7 @@ incremental algorithms.
 As for the bit vector problems, there is no interface to give a set of
 blocks over with to resolve the iteration.  In general, restarting a
 dataflow iteration is difficult and expensive.  Again, the best way to
-keep the dataflow infomation up to data (if this is really what is
+keep the dataflow information up to data (if this is really what is
 needed) it to formulate a problem specific solution.
 
 There are fine grained calls for creating and deleting references from