Mercurial > hg > graal-jvmci-8

comparison src/share/vm/opto/compile.hpp @ 1634:60a14ad85270

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6966411: escape.cpp:450 assert(base->Opcode() == Op_ConP Summary: Execute IGVN optimization before and after Escape Analysis Reviewed-by: never
author kvn
date Fri, 02 Jul 2010 17:30:30 -0700
parents c18cbe5936b8
children f95d63e2154a
comparison
equal deleted inserted replaced
1633:65b0c03b165d 1634:60a14ad85270
360 int macro_count() { return _macro_nodes->length(); } 360 int macro_count() { return _macro_nodes->length(); }
361 int predicate_count() { return _predicate_opaqs->length();} 361 int predicate_count() { return _predicate_opaqs->length();}
362 Node* macro_node(int idx) { return _macro_nodes->at(idx); } 362 Node* macro_node(int idx) { return _macro_nodes->at(idx); }
363 Node* predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);} 363 Node* predicate_opaque1_node(int idx) { return _predicate_opaqs->at(idx);}
364 ConnectionGraph* congraph() { return _congraph;} 364 ConnectionGraph* congraph() { return _congraph;}
365 void set_congraph(ConnectionGraph* congraph) { _congraph = congraph;}
365 void add_macro_node(Node * n) { 366 void add_macro_node(Node * n) {
366 //assert(n->is_macro(), "must be a macro node"); 367 //assert(n->is_macro(), "must be a macro node");
367 assert(!_macro_nodes->contains(n), " duplicate entry in expand list"); 368 assert(!_macro_nodes->contains(n), " duplicate entry in expand list");
368 _macro_nodes->append(n); 369 _macro_nodes->append(n);
369 } 370 }