Searched refs:_cost (Results 1 - 7 of 7) sorted by relevance
/openjdk7/hotspot/src/share/vm/adlc/ |
H A D | archDesc.hpp | 45 NameList _cost; member in class:ChainList 67 const char *_cost; member in class:MatchList 75 MatchList(MatchList *nxt, Predicate *prd): _next(nxt), _pred(prd), _cost(NULL){ 81 : _next(nxt), _pred(prd), _cost(cost), _opcode(opcode), 87 const char *get_cost(void) { return _cost == NULL ? "0" :_cost; }
|
H A D | archDesc.cpp | 78 _cost.addName(cost); 88 _cost.reset(); 95 const char *c = _cost.iter();
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | chaitin.cpp | 74 tty->print("Cost:%4.2g Area:%4.2g Score:%4.2g ",_cost,_area, score()); 109 double score = raw_score( _cost, _area); 119 if( _cost >= _area*3.0 ) // Tiny area relative to cost 122 if( (_cost+_cost) >= _area*3.0 ) // Small area relative to cost 555 lrgs(fp_lrg)._cost += 1e12; // Cost is infinite 1069 double cost = lrgs(lo_score)._cost; 1088 double icost = lrgs(i)._cost;
|
H A D | matcher.cpp | 1373 s->_cost[i] < cost && // low cost and 1375 cost = s->_cost[mincost=i]; 2379 //memset(_cost, -1, sizeof(_cost)); 2390 memset(_cost, -3, sizeof(_cost)); 2413 assert(_cost[i] != max_juint, "cost must be a valid value"); 2416 ruleName[i], _cost[i], ruleName[_rule[i]] );
|
H A D | chaitin.hpp | 57 double _cost; // 2 for loads/1 for stores times block freq member in class:LRG
|
H A D | coalesce.cpp | 886 lrgs(lr1)._cost += lrgs(lr2)._cost;
|
H A D | ifg.cpp | 565 lrgs(r)._cost += n->rematerialize() ? 0 : b->_freq; 763 lrg._cost += (def->rematerialize() ? b->_freq : (b->_freq + b->_freq));
|
Completed in 266 milliseconds