Home
last modified time | relevance | path

Searched refs:nHash (Results 1 – 4 of 4) sorted by relevance

/external/pdfium/core/src/fxcrt/
Dfx_basic_maps.cpp73 FX_DWORD nHash; in Lookup() local
74 CAssoc* pAssoc = GetAssocAt(key, nHash); in Lookup()
83 FX_DWORD nHash; in GetValueAt() local
84 CAssoc* pAssoc = GetAssocAt(key, nHash); in GetValueAt()
92 FX_DWORD nHash; in operator []() local
94 if ((pAssoc = GetAssocAt(key, nHash)) == NULL) { in operator []()
100 pAssoc->pNext = m_pHashTable[nHash]; in operator []()
101 m_pHashTable[nHash] = pAssoc; in operator []()
106 CFX_MapPtrToPtr::GetAssocAt(void* key, FX_DWORD& nHash) const in GetAssocAt()
108 nHash = HashKey(key) % m_nHashTableSize; in GetAssocAt()
[all …]
/external/pdfium/fpdfsdk/src/javascript/
Dglobal.cpp611 const unsigned int nHash = JS_CalcHash(JS_GetTypeof(p)); in GET_VALUE_TYPE() local
613 if (nHash == JSCONST_nUndefHash) in GET_VALUE_TYPE()
615 if (nHash == JSCONST_nNullHash) in GET_VALUE_TYPE()
617 if (nHash == JSCONST_nStringHash) in GET_VALUE_TYPE()
619 if (nHash == JSCONST_nNumberHash) in GET_VALUE_TYPE()
621 if (nHash == JSCONST_nBoolHash) in GET_VALUE_TYPE()
623 if (nHash == JSCONST_nDateHash) in GET_VALUE_TYPE()
625 if (nHash == JSCONST_nObjectHash) in GET_VALUE_TYPE()
627 if (nHash == JSCONST_nFXobjHash) in GET_VALUE_TYPE()
/external/sqlite/dist/
Dsqlite3.c40029 unsigned int nHash; /* Number of slots in apHash[] */
40337 nNew = p->nHash*2;
40343 if( p->nHash ){ sqlite3BeginBenignMalloc(); }
40345 if( p->nHash ){ sqlite3EndBenignMalloc(); }
40348 for(i=0; i<p->nHash; i++){
40360 p->nHash = nNew;
40411 h = pPage->iKey % pCache->nHash;
40448 for(h=0; h<pCache->nHash; h++){
40551 if( pCache->nHash==0 ){
40640 if( pCache->nPage>=pCache->nHash ) pcache1ResizeHash(pCache);
[all …]
/external/sqlite/dist/orig/
Dsqlite3.c40011 unsigned int nHash; /* Number of slots in apHash[] */
40319 nNew = p->nHash*2;
40325 if( p->nHash ){ sqlite3BeginBenignMalloc(); }
40327 if( p->nHash ){ sqlite3EndBenignMalloc(); }
40330 for(i=0; i<p->nHash; i++){
40342 p->nHash = nNew;
40393 h = pPage->iKey % pCache->nHash;
40430 for(h=0; h<pCache->nHash; h++){
40533 if( pCache->nHash==0 ){
40622 if( pCache->nPage>=pCache->nHash ) pcache1ResizeHash(pCache);
[all …]