1.1 --- a/src/share/vm/opto/superword.hpp Fri Feb 27 08:34:19 2009 -0800
1.2 +++ b/src/share/vm/opto/superword.hpp Fri Feb 27 13:27:09 2009 -0800
1.3 @@ -308,7 +308,7 @@
1.4 void dependence_graph();
1.5 // Return a memory slice (node list) in predecessor order starting at "start"
1.6 void mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds);
1.7 - // Can s1 and s2 be in a pack with s1 immediately preceeding s2 and s1 aligned at "align"
1.8 + // Can s1 and s2 be in a pack with s1 immediately preceding s2 and s1 aligned at "align"
1.9 bool stmts_can_pack(Node* s1, Node* s2, int align);
1.10 // Does s exist in a pack at position pos?
1.11 bool exists_at(Node* s, uint pos);
