10412   u32 *heap = 0;           /* Min-heap used for checking cell coverage */  in checkTreePage()  local
10481     heap = pCheck->heap;  in checkTreePage()
10482     heap[0] = 0;  in checkTreePage()
10549       btreeHeapInsert(heap, (pc<<16)|(pc+info.nSize-1));  in checkTreePage()
10562       heap = pCheck->heap;  in checkTreePage()
10563       heap[0] = 0;  in checkTreePage()
10568         btreeHeapInsert(heap, (pc<<16)|(pc+size-1));  in checkTreePage()
10583       btreeHeapInsert(heap, (((u32)i)<<16)|(i+size-1));  in checkTreePage()
10610     while( btreeHeapPull(heap,&x) ){  in checkTreePage()
10626     if( heap[0]==0 && nFrag!=data[hdr+7] ){  in checkTreePage()
10706   sCheck.heap = 0;  in sqlite3BtreeIntegrityCheck()
10718   sCheck.heap = (u32*)sqlite3PageMalloc( pBt->pageSize );  in sqlite3BtreeIntegrityCheck()
10719   if( sCheck.heap==0 ){  in sqlite3BtreeIntegrityCheck()
10799   sqlite3PageFree(sCheck.heap);  in sqlite3BtreeIntegrityCheck()