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.cpp68 FX_DWORD nHash; in Lookup() local
69 CAssoc* pAssoc = GetAssocAt(key, nHash); in Lookup()
77 FX_DWORD nHash; in GetValueAt() local
78 CAssoc* pAssoc = GetAssocAt(key, nHash); in GetValueAt()
85 FX_DWORD nHash; in operator []() local
87 if ((pAssoc = GetAssocAt(key, nHash)) == NULL) { in operator []()
93 pAssoc->pNext = m_pHashTable[nHash]; in operator []()
94 m_pHashTable[nHash] = pAssoc; in operator []()
99 FX_DWORD& nHash) const { in GetAssocAt()
100 nHash = HashKey(key) % m_nHashTableSize; in GetAssocAt()
[all …]
/external/pdfium/fpdfsdk/src/javascript/
Dglobal.cpp499 const unsigned int nHash = JS_CalcHash(FXJS_GetTypeof(p)); in GET_VALUE_TYPE() local
501 if (nHash == JSCONST_nUndefHash) in GET_VALUE_TYPE()
503 if (nHash == JSCONST_nNullHash) in GET_VALUE_TYPE()
505 if (nHash == JSCONST_nStringHash) in GET_VALUE_TYPE()
507 if (nHash == JSCONST_nNumberHash) in GET_VALUE_TYPE()
509 if (nHash == JSCONST_nBoolHash) in GET_VALUE_TYPE()
511 if (nHash == JSCONST_nDateHash) in GET_VALUE_TYPE()
513 if (nHash == JSCONST_nObjectHash) in GET_VALUE_TYPE()
515 if (nHash == JSCONST_nFXobjHash) in GET_VALUE_TYPE()
/external/sqlite/dist/
Dsqlite3.c41304 unsigned int nHash; /* Number of slots in apHash[] */
41660 nNew = p->nHash*2;
41666 if( p->nHash ){ sqlite3BeginBenignMalloc(); }
41668 if( p->nHash ){ sqlite3EndBenignMalloc(); }
41671 for(i=0; i<p->nHash; i++){
41683 p->nHash = nNew;
41728 h = pPage->iKey % pCache->nHash;
41772 for(h=0; h<pCache->nHash; h++){
41897 if( pCache->nHash==0 ){
41986 if( pCache->nPage>=pCache->nHash ) pcache1ResizeHash(pCache);
[all …]
/external/sqlite/dist/orig/
Dsqlite3.c41286 unsigned int nHash; /* Number of slots in apHash[] */
41642 nNew = p->nHash*2;
41648 if( p->nHash ){ sqlite3BeginBenignMalloc(); }
41650 if( p->nHash ){ sqlite3EndBenignMalloc(); }
41653 for(i=0; i<p->nHash; i++){
41665 p->nHash = nNew;
41710 h = pPage->iKey % pCache->nHash;
41754 for(h=0; h<pCache->nHash; h++){
41879 if( pCache->nHash==0 ){
41968 if( pCache->nPage>=pCache->nHash ) pcache1ResizeHash(pCache);
[all …]