Lines Matching defs:aPgno
63943 ht_slot *aIndex; /* i0, i1, i2... such that aPgno[iN] ascend */
63944 u32 *aPgno; /* Array of page numbers. */
63945 int nEntry; /* Nr. of entries in aPgno[] and aIndex[] */
63946 int iZero; /* Frame number associated with aPgno[0] */
64349 volatile u32 *aPgno; /* aPgno[1] is the page of first frame indexed */
64364 ** Finally, set pLoc->aPgno so that pLoc->aPgno[0] is the page number of the
64374 rc = walIndexPage(pWal, iHash, &pLoc->aPgno);
64377 if( pLoc->aPgno ){
64378 pLoc->aHash = (volatile ht_slot *)&pLoc->aPgno[HASHTABLE_NPAGE];
64380 pLoc->aPgno = &pLoc->aPgno[WALINDEX_HDR_SIZE/sizeof(u32)];
64435 int nByte; /* Number of bytes to zero in aPgno[] */
64465 /* Zero the entries in the aPgno array that correspond to frames with
64468 nByte = (int)((char *)sLoc.aHash - (char *)&sLoc.aPgno[iLimit]);
64470 memset((void *)&sLoc.aPgno[iLimit], 0, nByte);
64480 for(iKey=walHash(sLoc.aPgno[j]);sLoc.aHash[iKey];iKey=walNextHash(iKey)){
64512 ** entire hash table and aPgno[] array before proceeding.
64515 int nByte = (int)((u8*)&sLoc.aHash[HASHTABLE_NSLOT] - (u8*)sLoc.aPgno);
64517 memset((void*)sLoc.aPgno, 0, nByte);
64520 /* If the entry in aPgno[] is already set, then the previous writer
64526 if( sLoc.aPgno[idx-1] ){
64528 assert( !sLoc.aPgno[idx-1] );
64531 /* Write the aPgno[] array entry and the hash-table slot. */
64536 sLoc.aPgno[idx-1] = iPage;
64558 for(iKey=walHash(sLoc.aPgno[i]);
64965 u32 iPg = pSegment->aPgno[pSegment->aIndex[pSegment->iNext]];
65190 nEntry = (int)((u32*)sLoc.aHash - (u32*)sLoc.aPgno);
65198 walMergesort((u32 *)sLoc.aPgno, aTmp, aIndex, &nEntry);
65202 p->aSegment[i].aPgno = (u32 *)sLoc.aPgno;
66336 pgno = sLoc.aPgno[i-sLoc.iZero-1];
66546 ** (aPgno[iFrame]==pgno):
66569 if( iFrame<=iLast && iFrame>=pWal->minFrame && sLoc.aPgno[iH-1]==pgno ){
76530 Pgno aPgno[NB+2]; /* Page numbers of new pages before shuffling */
76961 aPgno[i] = apNew[i]->pgno;
77060 || pNew->pgno!=aPgno[iOld]