Home
last modified time | relevance | path

Searched refs:tableSize (Results 1 – 10 of 10) sorted by relevance

/OK3568_Linux_fs/external/recovery/minzip/
H A DHash.c62 pHashTable->tableSize = roundUpPower2(initialSize); in mzHashTableCreate()
66 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable)); in mzHashTableCreate()
84 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) { in mzHashTableClear()
120 for (count = i = 0; i < pHashTable->tableSize; i++) { in countTombStones()
150 for (i = 0; i < pHashTable->tableSize; i++) { in resizeHash()
168 pHashTable->tableSize = newSize; in resizeHash()
187 assert(pHashTable->tableSize > 0); in mzHashTableLookup()
192 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize - 1)]; in mzHashTableLookup()
193 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; in mzHashTableLookup()
205 if (pHashTable->tableSize == 1) in mzHashTableLookup()
[all …]
H A DHash.h61 int tableSize; /* must be power of 2 */ member
109 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); in mzHashTableMemUsage()
156 int lim = pIter->pHashTable->tableSize; in mzHashIterNext()
172 return (pIter->idx >= pIter->pHashTable->tableSize); in mzHashIterDone()
176 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize); in mzHashIterData()
/OK3568_Linux_fs/external/rk_pcba_test/pcba_minui/minzip/
H A DHash.c61 pHashTable->tableSize = roundUpPower2(initialSize); in mzHashTableCreate()
65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable)); in mzHashTableCreate()
83 for (i = 0; i < pHashTable->tableSize; i++, pEnt++) { in mzHashTableClear()
119 for (count = i = 0; i < pHashTable->tableSize; i++) { in countTombStones()
149 for (i = 0; i < pHashTable->tableSize; i++) { in resizeHash()
167 pHashTable->tableSize = newSize; in resizeHash()
186 assert(pHashTable->tableSize > 0); in mzHashTableLookup()
191 pEntry = &pHashTable->pEntries[itemHash & (pHashTable->tableSize-1)]; in mzHashTableLookup()
192 pEnd = &pHashTable->pEntries[pHashTable->tableSize]; in mzHashTableLookup()
205 if (pHashTable->tableSize == 1) in mzHashTableLookup()
[all …]
H A DHash.h62 int tableSize; /* must be power of 2 */ member
108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); in mzHashTableMemUsage()
154 int lim = pIter->pHashTable->tableSize; in mzHashIterNext()
168 return (pIter->idx >= pIter->pHashTable->tableSize); in mzHashIterDone()
171 assert(pIter->idx >= 0 && pIter->idx < pIter->pHashTable->tableSize); in mzHashIterData()
/OK3568_Linux_fs/kernel/lib/zstd/
H A Dfse_compress.c94 U32 const tableSize = 1 << tableLog; in FSE_buildCTable_wksp() local
95 U32 const tableMask = tableSize - 1; in FSE_buildCTable_wksp()
98 void *const FSCT = ((U32 *)ptr) + 1 /* header */ + (tableLog ? tableSize >> 1 : 1); in FSE_buildCTable_wksp()
100 U32 const step = FSE_TABLESTEP(tableSize); in FSE_buildCTable_wksp()
101 U32 highThreshold = tableSize - 1; in FSE_buildCTable_wksp()
136 cumul[maxSymbolValue + 1] = tableSize + 1; in FSE_buildCTable_wksp()
160 for (u = 0; u < tableSize; u++) { in FSE_buildCTable_wksp()
162 …tableU16[cumul[s]++] = (U16)(tableSize + u); /* TableU16 : sorted by symbol order; gives next stat… in FSE_buildCTable_wksp()
210 const int tableSize = 1 << tableLog; in FSE_writeNCount_generic() local
225 remaining = tableSize + 1; /* +1 for extra accuracy */ in FSE_writeNCount_generic()
[all …]
H A Dfse_decompress.c95 U32 const tableSize = 1 << tableLog; in FSE_buildDTable_wksp() local
96 U32 highThreshold = tableSize - 1; in FSE_buildDTable_wksp()
130 U32 const tableMask = tableSize - 1; in FSE_buildDTable_wksp()
131 U32 const step = FSE_TABLESTEP(tableSize); in FSE_buildDTable_wksp()
149 for (u = 0; u < tableSize; u++) { in FSE_buildDTable_wksp()
153 tableDecode[u].newState = (U16)((nextState << tableDecode[u].nbBits) - tableSize); in FSE_buildDTable_wksp()
186 const unsigned tableSize = 1 << nbBits; in FSE_buildDTable_raw() local
187 const unsigned tableMask = tableSize - 1; in FSE_buildDTable_raw()
H A Dfse.h573 #define FSE_TABLESTEP(tableSize) ((tableSize >> 1) + (tableSize >> 3) + 3) argument
/OK3568_Linux_fs/kernel/arch/arc/kernel/
H A Dunwind.c261 unsigned long tableSize = table->size, hdrSize; in init_unwind_hdr() local
281 if (tableSize & (sizeof(*fde) - 1)) in init_unwind_hdr()
285 tableSize > sizeof(*fde) && tableSize - sizeof(*fde) >= *fde; in init_unwind_hdr()
286 tableSize -= sizeof(*fde) + *fde, fde += 1 + *fde / sizeof(*fde)) { in init_unwind_hdr()
311 if (tableSize || !n) in init_unwind_hdr()
332 for (fde = table->address, tableSize = table->size, n = 0; in init_unwind_hdr()
333 tableSize; in init_unwind_hdr()
334 tableSize -= sizeof(*fde) + *fde, fde += 1 + *fde / sizeof(*fde)) { in init_unwind_hdr()
936 unsigned long tableSize; in arc_unwind() local
942 tableSize = sizeof(unsigned long); in arc_unwind()
[all …]
/OK3568_Linux_fs/external/xserver/render/
H A Dglyph.c127 CARD32 tableSize = hash->hashSet->size; in FindGlyphRef() local
130 elt = signature % tableSize; in FindGlyphRef()
158 if (elt >= tableSize) in FindGlyphRef()
159 elt -= tableSize; in FindGlyphRef()
475 CARD32 i, tableSize = glyphSet->hash.hashSet->size; in FreeGlyphSet() local
479 for (i = 0; i < tableSize; i++) { in FreeGlyphSet()
/OK3568_Linux_fs/recovery/
HDrootfs.cpio.gz107070100A8AEB0000041ED0000000000000000000000116841B48100000000000000FD0000000200000000000000000000000200000000.�07070100A8B07C000081A40000000000000000000000016841263500000000000000FD0000000200000000000000000000000900000000.gitkeep��07070100A8B07D000081A40000000000000000000000016841263500000000000000FD0000000200000000000000000000000B00000000.skip_fsck����07070100A8AEB10000A1FF0000000000000000000000016841B0B600000007000000FD0000000200000000000000000000000400000000bin���usr/bin�07070100A8B07E000081A400000000000000000000000168412635000001CC000000FD0000000200000000000000000000001100000000busybox. ...