1.1 --- a/src/share/vm/opto/buildOopMap.cpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/buildOopMap.cpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -55,7 +55,7 @@
1.4 // breadth-first approach but it was worse (showed O(n^2) in the
1.5 // pick-next-block code).
1.6 //
1.7 -// The relevent data is kept in a struct of arrays (it could just as well be
1.8 +// The relevant data is kept in a struct of arrays (it could just as well be
1.9 // an array of structs, but the struct-of-arrays is generally a little more
1.10 // efficient). The arrays are indexed by register number (including
1.11 // stack-slots as registers) and so is bounded by 200 to 300 elements in
