Searched refs:aSort (Results 1 – 1 of 1) sorted by relevance
1279 ShmChunkLoc *aSort; in treeRepairList() local1285 aSort = lsmMallocZeroRc(db->pEnv, nByte, &rc); in treeRepairList()1293 aSort[i-1].pShm = p; in treeRepairList()1294 aSort[i-1].iLoc = i; in treeRepairList()1308 ShmChunkLoc *aSpace = &aSort[nSort]; in treeRepairList()1310 if( aSort[i].pShm ){ in treeRepairList()1311 assert( shm_sequence_ge(aSort[i].pShm->iShmid, iPrevShmid) ); in treeRepairList()1312 assert( aSpace[aSort[i].pShm->iShmid - iPrevShmid].pShm==0 ); in treeRepairList()1313 aSpace[aSort[i].pShm->iShmid - iPrevShmid] = aSort[i]; in treeRepairList()1325 lsmFree(db->pEnv, aSort); in treeRepairList()