Mercurial > hg > truffle

comparison src/share/vm/opto/superword.hpp @ 605:98cb887364d3

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6810672: Comment typos Summary: I have collected some typos I have found while looking at the code. Reviewed-by: kvn, never
author twisti
date Fri, 27 Feb 2009 13:27:09 -0800
parents a61af66fc99e
children 78af5ae8e731
comparison
equal deleted inserted replaced
604:ec59443af135 605:98cb887364d3
306 bool ref_is_alignable(SWPointer& p); 306 bool ref_is_alignable(SWPointer& p);
307 // Construct dependency graph. 307 // Construct dependency graph.
308 void dependence_graph(); 308 void dependence_graph();
309 // Return a memory slice (node list) in predecessor order starting at "start" 309 // Return a memory slice (node list) in predecessor order starting at "start"
310 void mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds); 310 void mem_slice_preds(Node* start, Node* stop, GrowableArray<Node*> &preds);
311 // Can s1 and s2 be in a pack with s1 immediately preceeding s2 and s1 aligned at "align" 311 // Can s1 and s2 be in a pack with s1 immediately preceding s2 and s1 aligned at "align"
312 bool stmts_can_pack(Node* s1, Node* s2, int align); 312 bool stmts_can_pack(Node* s1, Node* s2, int align);
313 // Does s exist in a pack at position pos? 313 // Does s exist in a pack at position pos?
314 bool exists_at(Node* s, uint pos); 314 bool exists_at(Node* s, uint pos);
315 // Is s1 immediately before s2 in memory? 315 // Is s1 immediately before s2 in memory?
316 bool are_adjacent_refs(Node* s1, Node* s2); 316 bool are_adjacent_refs(Node* s1, Node* s2);