Lines Matching defs:aTo
76421 u8 * const aTo = pTo->aData;
76434 memcpy(&aTo[iData], &aFrom[iData], pBt->usableSize-iData);
76435 memcpy(&aTo[iToHdr], &aFrom[iFromHdr], pFrom->cellOffset + 2*pFrom->nCell);
161339 int nTo, nFrom; /* Number of valid entries in aTo[] and aFrom[] */
161341 WherePath *aTo; /* The nTo best paths at the current level */
161343 WherePath *pTo; /* An element of aTo[] that we are working on */
161370 /* Allocate and initialize space for aTo, aFrom and aSortCost[] */
161375 aTo = (WherePath*)pSpace;
161376 aFrom = aTo+mxChoice;
161379 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
161492 for(jj=0, pTo=aTo; jj<nTo; jj++, pTo++){
161520 /* Increase the size of the aTo set by one */
161526 pTo = &aTo[jj];
161535 /* Control reaches here if best-so-far path pTo=aTo[jj] covers the
161591 mxCost = aTo[0].rCost;
161592 mxUnsorted = aTo[0].nRow;
161593 for(jj=1, pTo=&aTo[1]; jj<mxChoice; jj++, pTo++){
161609 for(ii=0, pTo=aTo; ii<nTo; ii++, pTo++){
161622 /* Swap the roles of aFrom and aTo for the next generation */
161623 pFrom = aTo;
161624 aTo = aFrom;