HomeSort by relevance Sort by last modified time
    Searched refs:aHash (Results 1 - 7 of 7) sorted by null

  /external/chromium_org/third_party/sqlite/src/src/
bitvec.c 63 /* Hashing function for the aHash representation.
82 ** If iSize>BITVEC_NBIT and iDivisor==0 then Bitvec.u.aHash[] is
95 u32 nSet; /* Number of bits that are set - only valid for aHash
104 u32 aHash[BITVEC_NINT]; /* Hash table representation */
145 while( p->u.aHash[h] ){
146 if( p->u.aHash[h]==i ) return 1;
188 if( !p->u.aHash[h] ){
198 if( p->u.aHash[h]==i ) return SQLITE_OK;
201 } while( p->u.aHash[h] );
209 u32 *aiValues = sqlite3StackAllocRaw(0, sizeof(p->u.aHash));
    [all...]
wal.c 208 ** where aHash[iMax]==P. If there is no iMax entry (if there exists
209 ** no hash slot such that aHash[i]==p) then page P is not in the
    [all...]
  /external/chromium_org/third_party/sqlite/src/tool/
mkkeywordhash.c 347 int aHash[1000]; /* 1000 is much bigger than nKeyword */
452 for(j=0; j<i; j++) aHash[j] = 0;
455 aHash[h] *= 2;
456 aHash[h]++;
458 for(j=count=0; j<i; j++) count += aHash[j];
466 for(i=0; i<bestSize; i++) aHash[i] = 0;
469 aKeywordTable[i].iNext = aHash[h];
470 aHash[h] = i+1;
518 printf(" static const unsigned char aHash[%d] = {\n", bestSize);
521 printf(" %3d,", aHash[i])
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/rtree/
rtree.c 134 /* Size of hash table Rtree.aHash. This hash table is not expected to
152 RtreeNode *aHash[HASHSIZE]; /* Hash table of in-memory nodes. */
397 ** in the Rtree.aHash table.
412 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext);
423 pNode->pNext = pRtree->aHash[iHash];
424 pRtree->aHash[iHash] = pNode;
433 pp = &pRtree->aHash[nodeHash(pNode->iNode)];
    [all...]
  /external/chromium_org/third_party/sqlite/amalgamation/
sqlite3.c     [all...]
  /external/sqlite/dist/orig/
sqlite3.c     [all...]
  /external/sqlite/dist/
sqlite3.c     [all...]

Completed in 840 milliseconds