Cross Reference: /openjdk7/hotspot/src/share/vm/libadt/vectset.cpp

Lines Matching refs:size
61   size = 2;                     // Small initial size
62   data = (uint32 *)_set_arena->Amalloc(size*sizeof(uint32));
87   size = s.size;                // Use new size
88   data = (uint32*)s._set_arena->Amalloc(size*sizeof(uint32)); // Make array of required size
89   memcpy( data, s.data, size*sizeof(uint32) ); // Fill the array
93 // Expand the existing set to a bigger size
97   uint x = size;
99   data = (uint32 *)_set_arena->Arealloc(data, size*sizeof(uint32), x*sizeof(uint32));
100   memset((char *)(data + size), 0, (x - size)*sizeof(uint32));
101   size = x;
111   if( word >= size )            // Need to grow set?
122   if( word >= size )              // Beyond the last?
134   if( s.size < size ) size = s.size; // Get smaller size
137   for( uint i=0; i<size; i++)   // For data in set
154   register uint cnt = ((size<s.size)?size:s.size);
159   if( size < s.size ) {         // Is set 2 larger than set 1?
161     grow(s.size*sizeof(uint32)*8);
162     memcpy(&data[cnt], u2, (s.size - cnt)*sizeof(uint32));
179   register uint cnt = ((size<s.size)?size:s.size);
206   register uint cnt = ((size<s.size)?size:s.size);
218   if( size < s.size ) {
219     for( ; i<s.size; i++ )      // For data in larger set
222     for( ; i<size; i++ )        // For data in larger set
252   register uint small_size = ((size<s.size)?size:s.size);
294   if( word >= size )              // Beyond the last?
305   for( i=0; i<size; i++ )
318   if( size > 100 ) {            // Reclaim storage only if huge
319     FREE_RESOURCE_ARRAY(uint32,data,size);
320     size = 2;                   // Small initial size
321     data = NEW_RESOURCE_ARRAY(uint32,size);
323   memset( data, 0, size*sizeof(uint32) );
330   uint sum = 0;                 // Cumulative size so far.
332   for( uint32 i = 0; i < (size<<2); i++) // While have bytes to process
333     sum += bitsInByte[*currByte++];      // Add bits in current byte to size.
347   uint lim = ((size<4)?size:4);
386     for( i++; (i<s->size) && (!s->data[i]); i++ ); // Skip to non-zero word
387   } while( i<s->size );