sqliteHashFind
pTree = sqliteHashFind(&tree->tblHash, 0, n);
cur.pTree = sqliteHashFind( &pRbtree->tblHash, 0, pList->iTab );
cur.pTree = sqliteHashFind( &pRbtree->tblHash, 0, pList->iTab );
pCur->pTree = sqliteHashFind(&tree->tblHash, 0, iTable);
p = sqliteHashFind(&db->aDb[j].tblHash, zName, strlen(zName)+1);
p = sqliteHashFind(&db->aDb[j].idxHash, zName, strlen(zName)+1);
assert( sqliteHashFind(&db->aDb[pTable->iDb].aFKey,
pF2 = sqliteHashFind(&db->aDb[i].aFKey, pF1->zTo, nTo);
pFKey->pNextTo = sqliteHashFind(&db->aDb[p->iDb].aFKey, pFKey->zTo, nTo);
pFirst = p = (FuncDef*)sqliteHashFind(&db->aFunc, zName, nName);
FuncDef *p = sqliteHashFind(&db->aFunc, azTypeFuncs[i], n);
void *sqliteHashFind(const Hash*, const void *pKey, int nKey);
FuncDef *p = (FuncDef*)sqliteHashFind(&db->aFunc, zName, strlen(zName));
pLock = (struct lockInfo*)sqliteHashFind(&lockHash, &key1, sizeof(key1));
pOpen = (struct openCnt*)sqliteHashFind(&openHash, &key2, sizeof(key2));
pTrigger = sqliteHashFind(&(db->aDb[j].trigHash), zName, nName+1);
if( sqliteHashFind(&(db->aDb[iDb].trigHash), zName,pName->n+1) ){
pElem = sqliteHashFind(&p->agg.hash, zKey, nKey);
if( i>=0 && i<p->nSet && sqliteHashFind(&p->aSet[i].hash, pTos->z, pTos->n)){
sqliteHashFind(&p->aSet[i].hash, pTos->z, pTos->n)==0 ){