Searched refs:pCell (Results 1 - 6 of 6) sorted by relevance

/freebsd-11-stable/stand/ficl/
H A Dstack.c329 CELL *pCell; local
335 pCell = pStack->sp - n - 1;
336 c = *pCell;
338 for (;n > 0; --n, pCell++)
340 *pCell = pCell[1];
343 *pCell = c;
347 pCell = pStack->sp - 1;
348 c = *pCell;
350 for (; n < 0; ++n, pCell
[all...]
H A Dfloat.c355 CELL *pCell; local
370 pCell = pVM->fStack->sp - d;
373 sprintf(pVM->pad,"%#f ",(*pCell++).f);
598 CELL *pCell; local
605 pCell = (CELL *)POPPTR();
606 PUSHFLOAT(pCell->f);
615 CELL *pCell; local
622 pCell = (CELL *)POPPTR();
623 pCell->f = POPFLOAT();
632 CELL *pCell; local
[all...]
H A Dtools.c628 CELL *pCell; local
636 pCell = pStk->base;
639 vmTextOut(pVM, ltoa((*pCell++).i, pVM->pad, pVM->base), 0);
652 CELL *pCell; local
661 pCell = pStk->base;
664 CELL c = *pCell++;
H A Dwords.c1092 CELL *pCell; local
1096 pCell = (CELL *)stackPopPtr(pVM->pStack);
1097 stackPush(pVM->pStack, *pCell);
1109 CELL *pCell; local
1113 pCell = (CELL *)stackPopPtr(pVM->pStack);
1114 stackPush(pVM->pStack, *pCell++);
1115 stackPush(pVM->pStack, *pCell);
1126 CELL *pCell; local
1130 pCell = (CELL *)stackPopPtr(pVM->pStack);
1131 *pCell
1142 CELL *pCell; local
1153 CELL *pCell; local
2757 CELL *pCell; local
2784 CELL *pCell; local
[all...]
/freebsd-11-stable/crypto/heimdal/lib/sqlite/
H A Dsqlite3.c47629 u8 *pCell; /* Pointers to the body of the overflow cell */ member in struct:MemPage::_OvflCell
47792 u8 *pCell; /* Pointer to the start of cell content */ member in struct:CellInfo
49156 btreeParseCellPtr( MemPage *pPage, u8 *pCell, CellInfo *pInfo ) argument
49238 cellSizePtr(MemPage *pPage, u8 *pCell) argument
49305 ptrmapPutOvflPtr(MemPage *pPage, u8 *pCell, int *pRC) argument
50952 u8 *pCell = findCell(pPage, i); local
51004 u8 *pCell = findCell(pPage, i); local
52744 u8 *pCell; /* Pointer to current cell in pPage */ local
53432 clearCell(MemPage *pPage, unsigned char *pCell) argument
53506 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
53721 insertCell( MemPage *pPage, int i, u8 *pCell, int sz, u8 *pTemp, Pgno iChild, int *pRC ) argument
53912 u8 *pCell = pPage->aOvfl[0].pCell; local
54524 u8 *pCell; local
55084 unsigned char *pCell; /* Pointer to cell to delete */ local
55357 unsigned char *pCell; local
55923 u8 *pCell; local
127581 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
127893 testRtreeGeom( Rtree *pRtree, RtreeConstraint *pConstraint, RtreeCell *pCell, int *pbRes ) argument
128511 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
128584 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
129106 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]]; local
129191 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
129476 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
129579 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
[all...]
/freebsd-11-stable/contrib/sqlite3/
H A Dsqlite3.c66071 btreeParseCellAdjustSizeForOverflow( MemPage *pPage, u8 *pCell, CellInfo *pInfo ) argument
66134 btreeParseCellPtrNoPayload( MemPage *pPage, u8 *pCell, CellInfo *pInfo ) argument
66151 btreeParseCellPtr( MemPage *pPage, u8 *pCell, CellInfo *pInfo ) argument
66219 btreeParseCellPtrIndex( MemPage *pPage, u8 *pCell, CellInfo *pInfo ) argument
66276 cellSizePtr(MemPage *pPage, u8 *pCell) argument
66324 cellSizePtrNoPayload(MemPage *pPage, u8 *pCell) argument
66362 ptrmapPutOvflPtr(MemPage *pPage, MemPage *pSrc, u8 *pCell,int *pRC) argument
68556 u8 *pCell = findCell(pPage, i); local
68607 u8 *pCell = findCell(pPage, i); local
70493 u8 *pCell; /* Pointer to current cell in pPage */ local
71379 clearCell( MemPage *pPage, unsigned char *pCell, CellInfo *pInfo ) argument
71462 fillInCell( MemPage *pPage, unsigned char *pCell, const BtreePayload *pX, int *pnSize ) argument
71708 insertCell( MemPage *pPage, int i, u8 *pCell, int sz, u8 *pTemp, Pgno iChild, int *pRC ) argument
71969 u8 *pCell = pCArray->apCell[i]; local
72112 u8 *pCell = pCArray->apCell[i]; local
72239 u8 *pCell = pCArray->apCell[i+iNew]; local
72304 u8 *pCell = pPage->apOvfl[0]; local
73063 u8 *pCell = b.apCell[i]; local
73099 u8 *pCell; local
74049 unsigned char *pCell; /* Pointer to cell to delete */ local
74393 unsigned char *pCell; local
75006 u8 *pCell; /* Cell content */ local
192000 nodeOverwriteCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iCell ) argument
193333 cellGrowth(Rtree *pRtree, RtreeCell *p, RtreeCell *pCell) argument
193374 ChooseLeaf( Rtree *pRtree, RtreeCell *pCell, int iHeight, RtreeNode **ppLeaf ) argument
193715 RtreeCell *pCell = &aCell[aaSorted[iBestDim][ii]]; local
193744 SplitNode( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
194033 Reinsert( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
194138 rtreeInsertCell( Rtree *pRtree, RtreeNode *pNode, RtreeCell *pCell, int iHeight ) argument
195295 rtreeCheckCellCoord( RtreeCheck *pCheck, i64 iNode, int iCell, u8 *pCell, u8 *pParent ) argument
195378 u8 *pCell = &aNode[4 + i*(8 + pCheck->nDim*2*4)]; local
204727 StatCell *pCell = &p->aCell[i]; local
204861 StatCell *pCell = &p->aCell[p->iCell]; local
[all...]

Completed in 1234 milliseconds