Lines Matching refs:m_blocksize
46 protected int m_blocksize;
94 //m_blocksize = blocksize;
97 m_blocksize=1<<m_SHIFT;
98 m_MASK=m_blocksize-1;
101 m_map0=new int[m_blocksize];
150 if(indexRelativeToCache >= 0 && indexRelativeToCache < m_blocksize) {
155 // total of m_blocksize squared elements, which at the default
173 block=m_map[index]=new int[m_blocksize];
176 // Cache the current row of m_map. Next m_blocksize-1
192 if(m_firstFree+numberOfElements<m_blocksize)
213 block=m_map[index]=new int[m_blocksize];
214 int copied=(m_blocksize-offset < numberOfElements)
215 ? m_blocksize-offset : numberOfElements;
234 if(newlen>m_blocksize)
239 m_map[i]=new int[m_blocksize];
271 block=m_map[index]=new int[m_blocksize];
287 int copylen=m_blocksize-offset-1;
292 block=m_map[index]=new int[m_blocksize];
296 push=block[m_blocksize-1];
356 int copylen=m_blocksize-offset-1;
359 block=m_map[index]=new int[m_blocksize];
366 block[m_blocksize-1]=(next!=null) ? next[0] : 0;
369 block[m_blocksize-1]=0;
389 if(at<m_blocksize)
406 block=m_map[index]=new int[m_blocksize];
439 if(i<m_blocksize)
482 for(int offset=boffset;offset<m_blocksize;++offset)
484 return offset+bindex*m_blocksize;
492 return offset+maxindex*m_blocksize;
533 return offset+index*m_blocksize;
