293   RtreeNode *aNode[RTREE_CACHE_SZ]; /* Rtree node cache */  member
1109   for(ii=0; ii<RTREE_CACHE_SZ; ii++) nodeRelease(pRtree, pCsr->aNode[ii]);  in resetCursor()
1422       nodeRelease(RTREE_OF_CURSOR(p), p->aNode[i]);  in rtreeSearchPointSwap()
1423       p->aNode[i] = 0;  in rtreeSearchPointSwap()
1425       RtreeNode *pTemp = p->aNode[i];  in rtreeSearchPointSwap()
1426       p->aNode[i] = p->aNode[j];  in rtreeSearchPointSwap()
1427       p->aNode[j] = pTemp;  in rtreeSearchPointSwap()
1447   if( pCur->aNode[ii]==0 ){  in rtreeNodeOfFirstSearchPoint()
1450     *pRC = nodeAcquire(RTREE_OF_CURSOR(pCur), id, 0, &pCur->aNode[ii]);  in rtreeNodeOfFirstSearchPoint()
1452   return pCur->aNode[ii];  in rtreeNodeOfFirstSearchPoint()
1512         assert( pCur->aNode[ii]==0 );  in rtreeSearchPointNew()
1513         pCur->aNode[ii] = pCur->aNode[0];  in rtreeSearchPointNew()
1515         nodeRelease(RTREE_OF_CURSOR(pCur), pCur->aNode[0]);  in rtreeSearchPointNew()
1517       pCur->aNode[0] = 0;  in rtreeSearchPointNew()
1538     printf(" %p\n", pCur->aNode[idx]);
1565   if( p->aNode[i] ){  in rtreeSearchPointPop()
1566     nodeRelease(RTREE_OF_CURSOR(p), p->aNode[i]);  in rtreeSearchPointPop()
1567     p->aNode[i] = 0;  in rtreeSearchPointPop()
1577       p->aNode[1] = p->aNode[n+1];  in rtreeSearchPointPop()
1578       p->aNode[n+1] = 0;  in rtreeSearchPointPop()
1868       pCsr->aNode[0] = pLeaf;  in rtreeFilter()
1939       pCsr->aNode[0] = pRoot;  in rtreeFilter()
4183   u8 *aNode = 0;  in rtreeCheckNode()  local
4189   aNode = rtreeCheckGetNode(pCheck, iNode, &nNode);  in rtreeCheckNode()
4190   if( aNode ){  in rtreeCheckNode()
4199         iDepth = readInt16(aNode);  in rtreeCheckNode()
4202           sqlite3_free(aNode);  in rtreeCheckNode()
4206       nCell = readInt16(&aNode[2]);  in rtreeCheckNode()
4214           u8 *pCell = &aNode[4 + i*(8 + pCheck->nDim*2*4)];  in rtreeCheckNode()
4229     sqlite3_free(aNode);  in rtreeCheckNode()