211     if (mNextFreeEntry == INVALID_ENTRY || mNextFreeEntry + entriesCount > ENTRY_COUNT) {  in writeItem()
449     if (end > ENTRY_COUNT) {  in updateFirstUsedEntry()
450         end = ENTRY_COUNT;  in updateFirstUsedEntry()
476     while (readEntryIndex < ENTRY_COUNT) {  in copyItems()
500         assert(end <= ENTRY_COUNT);  in copyItems()
531     for (size_t i = 0; i < ENTRY_COUNT; ++i) {  in mLoadEntryTable()
546         for (size_t i = 0; i < ENTRY_COUNT; ++i) {  in mLoadEntryTable()
557         while (mNextFreeEntry < ENTRY_COUNT) {  in mLoadEntryTable()
587         if (end > ENTRY_COUNT) {  in mLoadEntryTable()
588             end = ENTRY_COUNT;  in mLoadEntryTable()
677         for (size_t i = mFirstUsedEntry; i < ENTRY_COUNT; ++i) {  in mLoadEntryTable()
748     assert(index < ENTRY_COUNT);  in alterEntryState()
763     assert(end <= ENTRY_COUNT);  in alterEntryRangeState()
815     if (findBeginIndex >= ENTRY_COUNT) {  in findItem()
820     if (findBeginIndex > mFirstUsedEntry && findBeginIndex < ENTRY_COUNT) {  in findItem()
825     if (end > ENTRY_COUNT) {  in findItem()
826         end = ENTRY_COUNT;  in findItem()
831         if (cachedIndex < ENTRY_COUNT) {  in findItem()
976 …return ((mNextFreeEntry < (ENTRY_COUNT-1)) ? ((ENTRY_COUNT - mNextFreeEntry - 1) * ENTRY_SIZE): 0);  in getVarDataTailroom()
1010     for (size_t i = 0; i < ENTRY_COUNT; ++i) {  in debugDump()
1022                 if (item.span > 0 && item.span <= ENTRY_COUNT - i) {  in debugDump()
1039     nvsStats.total_entries += ENTRY_COUNT;  in calcEntries()
1044             nvsStats.free_entries += ENTRY_COUNT;  in calcEntries()
1050 …   nvsStats.free_entries += ENTRY_COUNT - mUsedEntryCount; // it's equivalent free + erase entries.  in calcEntries()