Lines Matching refs:get2byte
44 #define get2byteNotZero(X) (((((int)get2byte(X))-1)&0xffff)+1)
1520 assert( nCell==get2byte(&data[hdr+3]) || CORRUPT_DB ); in defragmentPage()
1530 int iFree = get2byte(&data[hdr+1]); in defragmentPage()
1533 int iFree2 = get2byte(&data[iFree]); in defragmentPage()
1539 int sz = get2byte(&data[iFree+2]); in defragmentPage()
1540 int top = get2byte(&data[hdr+5]); in defragmentPage()
1546 sz2 = get2byte(&data[iFree2+2]); in defragmentPage()
1558 pc = get2byte(pAddr); in defragmentPage()
1569 iCellStart = get2byte(&data[hdr+5]); in defragmentPage()
1577 pc = get2byte(pAddr); in defragmentPage()
1634 int pc = get2byte(pTmp); /* Address of a free slot */ in pageFindSlot()
1645 size = get2byte(pTmp); in pageFindSlot()
1672 pc = get2byte(pTmp); in pageFindSlot()
1726 top = get2byte(pTmp); in allocateSpace()
1826 while( (iFreeBlk = get2byte(&data[iPtr]))<iStart ){ in freeSpace()
1847 iEnd = iFreeBlk + get2byte(&data[iFreeBlk+2]); in freeSpace()
1852 iFreeBlk = get2byte(&data[iFreeBlk]); in freeSpace()
1860 int iPtrEnd = iPtr + get2byte(&data[iPtr+2]); in freeSpace()
1872 x = get2byte(pTmp); in freeSpace()
1999 pc = get2byte(&data[hdr+1]); in btreeComputeFreeSpace()
2014 next = get2byte(&data[pc]); in btreeComputeFreeSpace()
2015 size = get2byte(&data[pc+2]); in btreeComputeFreeSpace()
2117 pPage->nCell = get2byte(&data[3]); in btreeInitPage()
7006 pc = get2byte(ptr); in dropCell()
7008 testcase( pc==(u32)get2byte(&data[hdr+5]) ); in dropCell()
7127 assert( get2byte(&data[pPage->hdrOffset+3])==pPage->nCell || CORRUPT_DB ); in insertCell()
7299 j = get2byte(&aData[hdr+5]); in rebuildPage()
7790 assert( get2byte(&aFrom[iFromHdr+5]) <= (int)pBt->usableSize ); in copyNodeContent()
7793 iData = get2byte(&aFrom[iFromHdr+5]); in copyNodeContent()
10458 nCell = get2byte(&data[hdr+3]); in checkTreePage()
10577 i = get2byte(&data[hdr+1]); in checkTreePage()
10581 size = get2byte(&data[i+2]); in checkTreePage()
10588 j = get2byte(&data[i]); in checkTreePage()