Lines Matching refs:pc
1497 int pc; /* Address of the i-th cell */ in defragmentPage() local
1558 pc = get2byte(pAddr); in defragmentPage()
1559 if( pc<iFree ){ put2byte(pAddr, pc+sz); } in defragmentPage()
1560 else if( pc<iFree2 ){ put2byte(pAddr, pc+sz2); } in defragmentPage()
1577 pc = get2byte(pAddr); in defragmentPage()
1578 testcase( pc==iCellFirst ); in defragmentPage()
1579 testcase( pc==iCellLast ); in defragmentPage()
1583 if( pc<iCellStart || pc>iCellLast ){ in defragmentPage()
1586 assert( pc>=iCellStart && pc<=iCellLast ); in defragmentPage()
1587 size = pPage->xCellSize(pPage, &src[pc]); in defragmentPage()
1589 if( cbrk<iCellStart || pc+size>usableSize ){ in defragmentPage()
1594 testcase( pc+size==usableSize ); in defragmentPage()
1596 memcpy(&data[cbrk], &src[pc], size); in defragmentPage()
1634 int pc = get2byte(pTmp); /* Address of a free slot */ in pageFindSlot() local
1639 assert( pc>0 ); in pageFindSlot()
1640 while( pc<=maxPC ){ in pageFindSlot()
1644 pTmp = &aData[pc+2]; in pageFindSlot()
1656 memcpy(&aData[iAddr], &aData[pc], 2); in pageFindSlot()
1658 return &aData[pc]; in pageFindSlot()
1659 }else if( x+pc > maxPC ){ in pageFindSlot()
1666 put2byte(&aData[pc+2], x); in pageFindSlot()
1668 return &aData[pc + x]; in pageFindSlot()
1670 iAddr = pc; in pageFindSlot()
1671 pTmp = &aData[pc]; in pageFindSlot()
1672 pc = get2byte(pTmp); in pageFindSlot()
1673 if( pc<=iAddr ){ in pageFindSlot()
1674 if( pc ){ in pageFindSlot()
1681 if( pc>maxPC+nByte-4 ){ in pageFindSlot()
1967 int pc; /* Address of a freeblock within pPage->aData[] */ in btreeComputeFreeSpace() local
1999 pc = get2byte(&data[hdr+1]); in btreeComputeFreeSpace()
2001 if( pc>0 ){ in btreeComputeFreeSpace()
2003 if( pc<top ){ in btreeComputeFreeSpace()
2010 if( pc>iCellLast ){ in btreeComputeFreeSpace()
2014 next = get2byte(&data[pc]); in btreeComputeFreeSpace()
2015 size = get2byte(&data[pc+2]); in btreeComputeFreeSpace()
2017 if( next<=pc+size+3 ) break; in btreeComputeFreeSpace()
2018 pc = next; in btreeComputeFreeSpace()
2024 if( pc+size>(unsigned int)usableSize ){ in btreeComputeFreeSpace()
2053 int pc; /* Address of a freeblock within pPage->aData[] */ in btreeCellSizeCheck() local
2065 pc = get2byteAligned(&data[cellOffset+i*2]); in btreeCellSizeCheck()
2066 testcase( pc==iCellFirst ); in btreeCellSizeCheck()
2067 testcase( pc==iCellLast ); in btreeCellSizeCheck()
2068 if( pc<iCellFirst || pc>iCellLast ){ in btreeCellSizeCheck()
2071 sz = pPage->xCellSize(pPage, &data[pc]); in btreeCellSizeCheck()
2072 testcase( pc+sz==usableSize ); in btreeCellSizeCheck()
2073 if( pc+sz>usableSize ){ in btreeCellSizeCheck()
6990 u32 pc; /* Offset to cell content of cell being deleted */ in dropCell() local
7006 pc = get2byte(ptr); in dropCell()
7008 testcase( pc==(u32)get2byte(&data[hdr+5]) ); in dropCell()
7009 testcase( pc+sz==pPage->pBt->usableSize ); in dropCell()
7010 if( pc+sz > pPage->pBt->usableSize ){ in dropCell()
7014 rc = freeSpace(pPage, pc, sz); in dropCell()
10409 u32 pc; /* Address of a cell */ in checkTreePage() local
10493 pc = get2byteAligned(pCellIdx); in checkTreePage()
10495 if( pc<contentOffset || pc>usableSize-4 ){ in checkTreePage()
10497 pc, contentOffset, usableSize-4); in checkTreePage()
10501 pCell = &data[pc]; in checkTreePage()
10503 if( pc+info.nSize>usableSize ){ in checkTreePage()
10522 assert( pc + info.nSize - 4 <= usableSize ); in checkTreePage()
10549 btreeHeapInsert(heap, (pc<<16)|(pc+info.nSize-1)); in checkTreePage()
10566 pc = get2byteAligned(&data[cellStart+i*2]); in checkTreePage()
10567 size = pPage->xCellSize(pPage, &data[pc]); in checkTreePage()
10568 btreeHeapInsert(heap, (pc<<16)|(pc+size-1)); in checkTreePage()