Home | History | Annotate | Download | only in utils

Lines Matching defs:entryCount

79     const int valueEntryIndex = allocateTable(2 /* entryCount */);
170     const int valueEntryIndex = allocateTable(2 /* entryCount */);
189 bool TrieMap::freeTable(const int tableIndex, const int entryCount) {
190     if (!writeField0(readEmptyTableLink(entryCount), tableIndex)) {
193     return writeEmptyTableLink(tableIndex, entryCount);
197  * Allocate table with entryCount-entries. Reuse freed table if possible.
199 int TrieMap::allocateTable(const int entryCount) {
200     if (entryCount > 0 && entryCount <= MAX_NUM_OF_ENTRIES_IN_ONE_LEVEL) {
201         const int tableIndex = readEmptyTableLink(entryCount);
203             if (!writeEmptyTableLink(readField0(tableIndex), entryCount)) {
212     if (!mBuffer.extend(entryCount * ENTRY_SIZE)) {
317         const int newTableIndex = allocateTable(1 /* entryCount */);
331     const int newTableIndex = allocateTable(2 /* entryCount */);
361     const int entryCount = popCount(bitmap);
362     const int newTableIndex = allocateTable(entryCount + 1);
368     for (int i = 0; i < entryCount; ++i) {
381     if (entryCount > 0) {
382         return freeTable(tableIndex, entryCount);