1.1 --- a/src/share/vm/opto/node.hpp Fri Feb 27 08:34:19 2009 -0800 1.2 +++ b/src/share/vm/opto/node.hpp Fri Feb 27 13:27:09 2009 -0800 1.3 @@ -257,7 +257,7 @@ 1.4 Node **_in; // Array of use-def references to Nodes 1.5 Node **_out; // Array of def-use references to Nodes 1.6 1.7 - // Input edges are split into two catagories. Required edges are required 1.8 + // Input edges are split into two categories. Required edges are required 1.9 // for semantic correctness; order is important and NULLs are allowed. 1.10 // Precedence edges are used to help determine execution order and are 1.11 // added, e.g., for scheduling purposes. They are unordered and not 1.12 @@ -854,7 +854,7 @@ 1.13 1.14 // If the hash function returns the special sentinel value NO_HASH, 1.15 // the node is guaranteed never to compare equal to any other node. 1.16 - // If we accidently generate a hash with value NO_HASH the node 1.17 + // If we accidentally generate a hash with value NO_HASH the node 1.18 // won't go into the table and we'll lose a little optimization. 1.19 enum { NO_HASH = 0 }; 1.20 virtual uint hash() const;