Lines Matching refs:Cell
98 typedef struct Cell Cell; typedef
249 struct Cell { struct
338 Cell *apCell[MX_CELL+2]; /* All data entires in sorted order */
410 static int cellSize(Btree *pBt, Cell *pCell){ in cellSize()
437 Cell *pCell = pPage->apCell[i]; in defragmentPage()
447 pPage->apCell[i] = (Cell*)&pPage->u.aDisk[pc]; in defragmentPage()
587 Cell *pCell; /* A pointer to a Cell in pPage->u.aDisk[] */ in initPage()
609 pCell = (Cell*)&pPage->u.aDisk[idx]; in initPage()
1159 Cell *pCell; in fileBtreeKeySize()
1270 Cell *pCell; in fileBtreeDataSize()
1293 Cell *pCell; in fileBtreeData()
1339 Cell *pCell; in fileBtreeKeyCompare()
1887 static int clearCell(Btree *pBt, Cell *pCell){ in clearCell()
1916 Cell *pCell, /* Populate this Cell structure */ in fillInCell()
2062 static void insertCell(Btree *pBt, MemPage *pPage, int i, Cell *pCell, int sz){ in insertCell()
2077 pPage->apCell[i] = (Cell*)&pPage->u.aDisk[idx]; in insertCell()
2203 Cell *apDiv[NB]; /* Divider cells in pParent */ in balance()
2204 Cell aTemp[NB]; /* Temporary holding area for apDiv[] */ in balance()
2208 Cell *apCell[(MX_CELL+2)*NB]; /* All cells from pages being balanced */ in balance()
2630 Cell newCell; in fileBtreeInsert()
2695 Cell *pCell; in fileBtreeDelete()
2733 Cell *pNext; in fileBtreeDelete()
2810 Cell *pCell; in clearDatabasePage()
2821 pCell = (Cell*)&pPage->u.aDisk[idx]; in clearDatabasePage()
2900 static int copyCell(Btree *pBtFrom, BTree *pBtTo, Cell *pCell){
2956 Cell *pCell;
2969 pCell = (Cell*)&pPage->u.aDisk[idx];
3057 Cell *pCell = (Cell*)&pPage->u.aDisk[idx]; in fileBtreePageDump()
3101 Cell *pCell = (Cell*)&pPage->u.aDisk[idx]; in fileBtreePageDump()
3340 Cell *pCell = pPage->apCell[i]; in checkTreePage()
3384 Cell *pCell = (Cell*)&pPage->u.aDisk[i]; in checkTreePage()