Lines Matching defs:aCell
67850 u8 nOverflow; /* Number of overflow cell bodies in aCell[] */
68070 ** MemPage.aCell[] of the entry.
75682 ** Allocating a new entry in pPage->aCell[] implies that
76511 int nxDiv; /* Next divider slot in pParent->aCell[] */
203114 RtreeCell *aCell,
203124 x1 = MAX(DCOORD(p->aCoord[jj]), DCOORD(aCell[ii].aCoord[jj]));
203125 x2 = MIN(DCOORD(p->aCoord[jj+1]), DCOORD(aCell[ii].aCoord[jj+1]));
203165 RtreeCell *aCell = 0;
203188 sqlite3_free(aCell);
203334 ** Arguments aIdx, aCell and aSpare all point to arrays of size
203337 ** in aIdx according to dimension iDim of the cells in aCell. The
203349 RtreeCell *aCell,
203362 SortByDimension(pRtree, aLeft, nLeft, iDim, aCell, aSpare);
203363 SortByDimension(pRtree, aRight, nRight, iDim, aCell, aSpare);
203368 RtreeDValue xleft1 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2]);
203369 RtreeDValue xleft2 = DCOORD(aCell[aLeft[iLeft]].aCoord[iDim*2+1]);
203370 RtreeDValue xright1 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2]);
203371 RtreeDValue xright2 = DCOORD(aCell[aRight[iRight]].aCoord[iDim*2+1]);
203389 RtreeDValue xleft1 = aCell[aIdx[jj-1]].aCoord[iDim*2];
203390 RtreeDValue xleft2 = aCell[aIdx[jj-1]].aCoord[iDim*2+1];
203391 RtreeDValue xright1 = aCell[aIdx[jj]].aCoord[iDim*2];
203392 RtreeDValue xright2 = aCell[aIdx[jj]].aCoord[iDim*2+1];
203405 RtreeCell *aCell,
203435 SortByDimension(pRtree, aaSorted[ii], nCell, ii, aCell, aSpare);
203456 memcpy(&left, &aCell[aaSorted[ii][0]], sizeof(RtreeCell));
203457 memcpy(&right, &aCell[aaSorted[ii][nCell-1]], sizeof(RtreeCell));
203460 cellUnion(pRtree, &left, &aCell[aaSorted[ii][kk]]);
203462 cellUnion(pRtree, &right, &aCell[aaSorted[ii][kk]]);
203486 memcpy(pBboxLeft, &aCell[aaSorted[iBestDim][0]], sizeof(RtreeCell));
203487 memcpy(pBboxRight, &aCell[aaSorted[iBestDim][iBestSplit]], sizeof(RtreeCell));
203491 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]];
203536 RtreeCell *aCell;
203548 aCell = sqlite3_malloc64((sizeof(RtreeCell)+sizeof(int))*(nCell+1));
203549 if( !aCell ){
203553 aiUsed = (int *)&aCell[nCell+1];
203556 nodeGetCell(pRtree, pNode, i, &aCell[i]);
203559 memcpy(&aCell[nCell], pCell, sizeof(RtreeCell));
203582 rc = splitNodeStartree(pRtree, aCell, nCell, pLeft, pRight,
203658 sqlite3_free(aCell);
203824 RtreeCell *aCell;
203841 aCell = (RtreeCell *)sqlite3_malloc64(n * (
203842 sizeof(RtreeCell) + /* aCell array */
203847 if( !aCell ){
203850 aOrder = (int *)&aCell[n];
203856 memcpy(&aCell[ii], pCell, sizeof(RtreeCell));
203858 nodeGetCell(pRtree, pNode, ii, &aCell[ii]);
203862 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2]);
203863 aCenterCoord[iDim] += DCOORD(aCell[ii].aCoord[iDim*2+1]);
203873 RtreeDValue coord = (DCOORD(aCell[ii].aCoord[iDim*2+1]) -
203874 DCOORD(aCell[ii].aCoord[iDim*2]));
203883 RtreeCell *p = &aCell[aOrder[ii]];
203901 RtreeCell *p = &aCell[aOrder[ii]];
203913 sqlite3_free(aCell);
214296 StatCell *aCell; /* Array of parsed cells */
214490 if( p->aCell ){
214492 sqlite3_free(p->aCell[i].aOvfl);
214494 sqlite3_free(p->aCell);
214497 p->aCell = 0;
214623 p->aCell = sqlite3_malloc64((p->nCell+1) * sizeof(StatCell));
214624 if( p->aCell==0 ) return SQLITE_NOMEM_BKPT;
214625 memset(p->aCell, 0, (p->nCell+1) * sizeof(StatCell));
214628 StatCell *pCell = &p->aCell[i];
214794 StatCell *pCell = &p->aCell[p->iCell];
214845 p[1].iPgno = p->aCell[p->iCell].iChildPg;
214893 nPayload += p->aCell[i].nLocal;