| /openjdk7/hotspot/src/share/vm/libadt/ |
| H A D | dict.hpp | 50 uint32 _cnt; // Number of key-value pairs in hash table member in class:Dict
70 uint32 Size(void) const { return _cnt; }
|
| H A D | dict.cpp | 56 uint _cnt, _max; // Size of bucket member in class:bucket
83 _cnt = 0; // Dictionary is empty
104 _cnt = 0; // Dictionary is empty
113 tty->print("~Dict %d/%d: ",_cnt,_size);
115 tty->print("%d ",_bin[i]._cnt);
125 _cnt = 0; // Empty contents
127 _bin[i]._cnt = 0; // Empty buckets, but leave allocated
150 while( j > b->_cnt ) j >>= 1; // above old bucket _cnt
157 for( j=0; j<b->_cnt;
[all...] |
| /openjdk7/hotspot/src/share/vm/adlc/ |
| H A D | dict2.hpp | 49 int _cnt; // Number of key-value pairs in hash table member in class:Dict
70 int Size(void) const { return _cnt; }
|
| H A D | dict2.cpp | 42 int _cnt, _max; // Size of bucket member in class:bucket
76 _cnt = 0; // Dictionary is empty
89 _cnt = 0; // Empty contents
91 _bin[i]._cnt = 0; // Empty buckets, but leave allocated
114 while( j > b->_cnt ) j >>= 1; // above old bucket _cnt
121 for( j=0; j<b->_cnt; j++ ) { // Rehash all keys in this bucket
126 nb->_cnt = nbcnt = nbcnt+1;
127 b->_cnt--; // Remove key/value from lo bucket
128 b->_keyvals[j+j ] = b->_keyvals[b->_cnt
[all...] |
| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | chaitin.hpp | 195 uint _cnt, _max; member in class:LRG_List
207 assert( nidx < _cnt, "oob" );
212 uint Size() const { return _cnt; }
|
| H A D | block.hpp | 78 uint _cnt; member in class:Block_List
79 Block_List() : Block_Array(Thread::current()->resource_area()), _cnt(0) {}
80 void push( Block *b ) { map(_cnt++,b); }
81 Block *pop() { return _blocks[--_cnt]; }
82 Block *rpop() { Block *b = _blocks[0]; _blocks[0]=_blocks[--_cnt]; return b;}
85 uint size() const { return _cnt; }
86 void reset() { _cnt = 0; }
478 uint _cnt, _max; member in class:UnionFind
491 assert( from_idx < _cnt, "oob" );
496 uint Size() const { return _cnt; }
[all...] |
| H A D | type.hpp | 512 TypeTuple( uint cnt, const Type **fields ) : Type(Tuple), _cnt(cnt), _fields(fields) { }
520 const uint _cnt; // Count of fields member in class:TypeTuple
524 uint cnt() const { return _cnt; }
526 assert(i < _cnt, "oob");
530 assert(i < _cnt, "oob");
|
| H A D | callnode.hpp | 520 float _cnt; // Estimate of number of times called member in class:CallNode
527 _cnt(COUNT_UNKNOWN),
535 const float cnt() const { return _cnt; }
540 void set_cnt(float c) { _cnt = c; }
|
| H A D | machnode.hpp | 714 float _cnt; // Estimate of number of times called member in class:MachCallNode
719 const float cnt() const { return _cnt; }
724 void set_cnt(float c) { _cnt = c; }
|
| H A D | memnode.hpp | 1137 int _cnt; member in class:MergeMemStream
1161 _cnt = mm->req();
1183 assert(!_mem || _idx >= _cnt || match_memory(_mem, _mm, _idx),
1295 if (++_idx < _cnt) {
|
| H A D | node.hpp | 272 // duplicated; they have no embedded NULLs. Edges from 0 to _cnt-1
273 // are required, from _cnt to _max-1 are precedence edges.
274 node_idx_t _cnt; // Total number of required Node inputs. member in class:Node
299 uint req() const { return _cnt; }
387 assert( i < _cnt, err_msg_res("oob: i=%d, _cnt=%d", i, _cnt));
399 assert( i < _cnt, "oob");
471 assert( i >= _cnt, "not a precedence edge");
1330 uint _cnt; member in class:Node_List
[all...] |