Searched refs:nData (Results 1 - 7 of 7) sorted by relevance

/PHP_5_3/ext/sqlite/libsqlite/src/
H A Dbtree.c191 u16 nData; /* Number of bytes of data */ member in struct:CellHdr
201 #define NDATA(b,h) (SWAB16(b,h.nData) + h.nDataHi*65536)
1913 const void *pData,int nData /* The data */
1927 pCell->h.nData = SWAB16(pBt, nData & 0xffff);
1928 pCell->h.nDataHi = nData >> 16;
1963 nPayload = nData;
2615 ** and the data is given by (pData,nData). The cursor is used only to
2622 const void *pData, int nData /* The data of the new record */
2634 if( !pBt->inTrans || nKey+nData
[all...]
H A Dbtree.h74 const void *pData, int nData);
124 #define sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) \
125 (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData))
H A Dbtree_rb.c60 int nData; member in struct:BtRollbackOp
123 int nData; member in struct:BtRbNode
739 * and the data is given by (pData,nData). The cursor is used only to
750 int nData
766 pData = sqliteMallocRaw(nData);
768 memcpy(pData, pDataInput, nData);
789 pNode->nData = nData;
842 pOp->nData = pCur->pNode->nData;
[all...]
H A Dtable.c34 long nData; member in struct:TabResult
57 if( p->nData + need >= p->nAlloc ){
84 p->azResult[p->nData++] = z;
108 p->azResult[p->nData++] = z;
143 res.nData = 1;
153 res.azResult[0] = (char*)res.nData;
173 if( res.nAlloc>res.nData ){
175 azNew = realloc( res.azResult, sizeof(char*)*(res.nData+1) );
180 res.nAlloc = res.nData+1;
H A Dvdbe.c2958 pC->nData = pTos->n;
2963 pC->pData = sqliteMallocRaw( pC->nData );
2965 memcpy(pC->pData, pTos->z, pC->nData);
3090 pTos->n = pC->nData;
3147 payloadSize = pC->nData;
3927 pSorter->nData = pNos->n;
4088 pTos->n = pSorter->nData;
H A DvdbeInt.h77 int nData; /* Number of bytes in pData */ member in struct:Cursor
91 int nData; /* Number of bytes in the data */ member in struct:Sorter
/PHP_5_3/ext/sqlite3/libsqlite/
H A Dsqlite3.c8047 const void *pData, int nData,
47049 u32 nData; /* Number of bytes of data */ member in struct:CellInfo
52751 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
54182 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument
61826 bindText( sqlite3_stmt *pStmt, int i, const void *zData, int nData, void (*xDel)(void*), u8 encoding ) argument
61860 sqlite3_bind_blob( sqlite3_stmt *pStmt, int i, const void *zData, int nData, void (*xDel)(void*) ) argument
61901 sqlite3_bind_text( sqlite3_stmt *pStmt, int i, const char *zData, int nData, void (*xDel)(void*) ) argument
61911 sqlite3_bind_text16( sqlite3_stmt *pStmt, int i, const void *zData, int nData, void (*xDel)(void*) ) argument
63019 u64 nData; /* Number of bytes of data space */ member in struct:vdbeExecUnion::OP_MakeRecord_stack_vars
94972 int nData; /* Slots used in azResult[]. (nRow+1)*nColumn */ member in struct:TabResult
119692 int nData; member in struct:PendingList
119783 int nData; /* Bytes of data in aData */ member in struct:SegmentWriter
119814 int nData; /* Bytes of valid data so far */ member in struct:SegmentNode
121359 int nData = pTree->nData; /* Current size of node in bytes */ local
121562 int nData; local
127098 rtreeUpdate( sqlite3_vtab *pVtab, int nData, sqlite3_value **azData, sqlite_int64 *pRowid ) argument
[all...]

Completed in 158 milliseconds