Searched refs:_max (Results 1 - 25 of 30) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/memory/
H A DresourceArea.hpp95 char *_hwm, *_max; member in class:ResourceMark
102 _max= _area->_max;
121 _area(r), _chunk(r->_chunk), _hwm(r->_hwm), _max(r->_max) {
141 _area->_max = _max;
144 if (ZapResourceArea) memset(_hwm, badResourceValue, _max - _hwm);
192 char *_hwm, *_max; member in class:DeoptResourceMark
199 _max
[all...]
H A DresourceArea.cpp82 Arena::free_malloced_objects(_chunk, _hwm, _max, _area->_hwm);
86 Arena::free_malloced_objects(_chunk, _hwm, _max, _area->_hwm);
H A Dallocation.cpp380 _max = _chunk->top();
388 _max = _chunk->top();
397 copy->_max = _max;
474 size_t sum = _chunk->length() - (_max-_hwm); // Size leftover in this Chunk
501 _max = _chunk->top();
540 (c_old+corrected_new_size <= _max) ) { // Still fits where it sits
600 if (_hwm + x > _max) {
H A Dallocation.hpp291 char *_hwm, *_max; // High water mark and max in current chunk member in class:Arena
339 if (_hwm + x > _max) {
354 if (_hwm + x > _max) {
376 if (_hwm + x > _max) {
422 _hwm = _max = NULL;
/openjdk7/hotspot/src/share/vm/utilities/
H A DintHisto.cpp28 IntHistogram::IntHistogram(int est, int max) : _max(max), _tot(0) {
35 if (outcome > _max) outcome = _max;
57 if (_elements->length()-1 == _max) {
58 int cnt = _elements->at(_max);
60 _max, cnt, (double)cnt/tot_d);
H A DgrowableArray.hpp84 int _max; // maximum length member in class:GenericGrowableArray
110 _max = initial_size;
116 assert(_len >= 0 && _len <= _max, "initial_len too big");
129 _max = initial_size;
130 assert(_len >= 0 && _len <= _max, "initial_len too big");
146 return (void*)resource_allocate_bytes(thread, elementSize * _max);
162 for (int i = 0; i < _max; i++) ::new ((void*)&_data[i]) E();
168 for (int i = 0; i < _max; i++) ::new ((void*)&_data[i]) E();
176 for (; i < _max; i++) ::new ((void*)&_data[i]) E();
183 for (; i < _max;
[all...]
H A DgrowableArray.cpp59 assert(_max >= 0, "integer overflow");
60 size_t byte_size = elementSize * (size_t) _max;
H A DintHisto.hpp52 int _max; member in class:IntHistogram
/openjdk7/hotspot/src/share/vm/adlc/
H A Darena.cpp62 _max = _chunk->top();
69 _max = _chunk->top();
74 : _chunk(a->_chunk), _hwm(a->_hwm), _max(a->_max), _first(a->_first) {
81 size_t sum = _chunk->_len - (_max-_hwm); // Size leftover in this Chunk
102 _max = _chunk->top();
131 (c_old+new_size <= _max) ) { // Still fits where it sits
148 _hwm = _max = NULL;
H A Darena.hpp102 char *_hwm, *_max; // High water mark and max in current chunk member in class:Arena
119 if (_hwm + x > _max) {
131 if (_hwm + x > _max) {
H A Ddict2.cpp42 int _cnt, _max; // Size of bucket member in class:bucket
113 int j = b->_max; // Trim new bucket to nearest power of 2
116 nb->_max = j<<1;
118 nb->_keyvals = (const void**)_arena->Amalloc_4( sizeof(void *)*nb->_max*2 );
145 _bin[i]._keyvals=(const void**)_arena->Amalloc_4( sizeof(void *)*_bin[i]._max*2);
195 if( b->_cnt == b->_max ) { // Must grow bucket?
197 b->_max = 2; // Initial bucket size
198 b->_keyvals = (const void**)_arena->Amalloc_4( sizeof(void *)*b->_max*2 );
200 b->_keyvals = (const void**)_arena->Arealloc( b->_keyvals, sizeof(void *)*b->_max*2, sizeof(void *)*b->_max*
[all...]
H A Dforms.cpp42 NameList::NameList() : _cur(0), _max(4), _iter(0), _justReset(true) {
43 _names = (const char**)malloc(_max*sizeof(char*));
51 if (_cur == _max) _names =(const char**)realloc(_names,(_max *=2)*sizeof(char*));
62 // _max = 4; Already allocated
H A Dforms.hpp326 int _max; // Number of spaces allocated member in class:NameList
/openjdk7/hotspot/src/share/vm/runtime/
H A Dhandles.cpp113 _max = _area->_max;
139 handles = _max - _hwm; // add rest in first chunk
144 handles -= area->_max - area->_hwm; // adjust for last trunk not full
167 area->_max = _max;
171 memset(_hwm, badHandleValue, _max - _hwm);
H A Dhandles.inline.hpp93 area->_max = _max;
H A Dhandles.hpp313 char *_hwm, *_max; // saved arena info member in class:HandleMark
/openjdk7/hotspot/src/share/vm/opto/
H A DphaseX.hpp56 uint _max; // Size of table (power of 2) member in class:NodeHash
78 assert( _inserts < _max, "hash table overflow" );
82 // Return 75% of _max, rounded up.
83 uint insert_limit() const { return _max - (_max>>2); }
87 uint size() const { return _max; }
90 assert(table_index < _max, "Must be within table");
124 uint _max;
128 { return (i<_max) ? _types[i] : (Type*)NULL; }
131 Type_Array(Arena *a) : _a(a), _max(
[all...]
H A Dnode.cpp314 _cnt = _max = req;
476 Node *n = (Node*)compile->node_arena()->Amalloc_D(size_of() + _max*sizeof(Node*));
566 _cnt = _max; // forget req/prec distinction
568 for( i = 0; i < _max; i++ ) {
574 int edge_size = _max*sizeof(void*);
628 _max = _cnt = _outmax = _outcnt = 0;
636 uint new_max = _max;
638 _max = 4;
651 _in = (Node**)arena->Arealloc(_in, _max*sizeof(Node*), new_max*sizeof(Node*));
652 Copy::zero_to_bytes(&_in[_max], (new_ma
[all...]
H A DphaseX.cpp43 _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
45 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ), // (Node**)_a->Amalloc(_max * sizeof(Node*)) ),
52 memset(_table,0,sizeof(Node*)*_max);
57 _max( round_up(est_max_size < NODE_HASH_MINIMUM_SIZE ? NODE_HASH_MINIMUM_SIZE : est_max_size) ),
59 _table( NEW_ARENA_ARRAY( _a , Node* , _max ) ),
67 memset(_table,0,sizeof(Node*)*_max);
94 uint key = hash & (_max-1);
118 key = (key + stride/*7*/) & (_max-1); // Stride through table with relative prime
139 uint key = hash & (_max
[all...]
H A Dnode.hpp273 // are required, from _cnt to _max-1 are precedence edges.
276 node_idx_t _max; // Actual length of input array. member in class:Node
300 uint len() const { return _max; }
354 Node* in(uint i) const { assert(i < _max, err_msg_res("oob: i=%d, _max=%d", i, _max)); return _in[i]; }
1301 uint _max; member in class:Node_Array
1305 Node_Array(Arena *a) : _a(a), _max(OptoNodeListSize) {
1312 Node_Array(Node_Array *na) : _a(na->_a), _max(na->_max), _node
[all...]
H A Dblock.cpp958 UnionFind::UnionFind( uint max ) : _cnt(max), _max(max), _indices(NEW_RESOURCE_ARRAY(uint,max)) {
964 if( from_idx >= _max ) {
967 _indices = REALLOC_RESOURCE_ARRAY( uint, _indices, _max, size );
968 _max = size;
1008 if( idx >= _max ) return idx;
1024 assert( src < _max, "oob" );
1025 assert( dst < _max, "oob" );
H A Dchaitin.hpp195 uint _cnt, _max; member in class:LRG_List
/openjdk7/hotspot/src/share/vm/libadt/
H A Ddict.cpp56 uint _cnt, _max; // Size of bucket member in class:bucket
149 uint j = b->_max; // Trim new bucket to nearest power of 2
152 nb->_max = j<<1;
154 nb->_keyvals = (void**)_arena->Amalloc_4( sizeof(void *)*nb->_max*2 );
181 _bin[i]._keyvals=(void**)_arena->Amalloc_4( sizeof(void *)*_bin[i]._max*2);
236 if( b->_cnt == b->_max ) { // Must grow bucket?
238 b->_max = 2; // Initial bucket size
239 b->_keyvals = (void**)_arena->Amalloc_4(sizeof(void*) * b->_max * 2);
241 b->_keyvals = (void**)_arena->Arealloc(b->_keyvals, sizeof(void*) * b->_max * 2, sizeof(void*) * b->_max *
[all...]
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkIntrinsics.cpp43 case vmIntrinsics::_max:
93 case vmIntrinsics::_max:
/openjdk7/hotspot/src/share/vm/classfile/
H A DvmSymbols.cpp519 case _max:

Completed in 94 milliseconds

12