Lines Matching defs:aSortOrder
11089 ** Note that aSortOrder[] and aColl[] have nField+1 slots. There
11099 u8 *aSortOrder; /* Sort order for each column. */
11165 u8 *aSortOrder; /* for each column: True==DESC, False==ASC */
63257 assert( pKeyInfo->aSortOrder!=0 );
63273 if( pKeyInfo->aSortOrder[j] ){
65335 assert( pKeyInfo->aSortOrder!=0 );
65420 assert( pKeyInfo->aSortOrder!=0 );
65450 if( pKeyInfo->aSortOrder[i] ){
65698 assert( pPKey2->pKeyInfo->aSortOrder!=0 );
65812 if( pKeyInfo->aSortOrder[i] ){
66032 if( p->pKeyInfo->aSortOrder[0] ){
70105 bRev = pKeyInfo->aSortOrder[i];
79904 eType = IN_INDEX_INDEX_ASC + pIdx->aSortOrder[0];
87685 memcpy(zExtra, pIdx->aSortOrder, pIdx->nColumn);
87686 pIdx->aSortOrder = (u8*)zExtra;
88863 sizeof(u8)*nCol); /* Index.aSortOrder */
88870 p->aSortOrder = (u8*)pExtra;
89170 pIndex->aSortOrder[i] = (u8)requestedSortOrder;
89181 pIndex->aSortOrder[i] = pPk->aSortOrder[j];
90291 pKey->aSortOrder[i] = pIdx->aSortOrder[i];
96523 if( pSrc->aSortOrder[i]!=pDest->aSortOrder[i] ){
101966 memset(pKI->aSortOrder, 0, pKI->nField); /* Makes OP_Jump below testable */
102405 p->aSortOrder = (u8*)&p->aColl[N+X];
102484 pInfo->aSortOrder[i-iStart] = pItem->sortOrder;
103315 pRet->aSortOrder[i] = pOrderBy->a[i].sortOrder;
104247 pKeyDup->aSortOrder[i] = 0;
113431 && pLoop->u.btree.pIndex->aSortOrder[iEq]
114145 if( (nEq<pIdx->nKeyCol && bRev==(pIdx->aSortOrder[nEq]==SQLITE_SO_ASC))
116176 revIdx = pIndex->aSortOrder[j];
