/external/chromium_org/third_party/sqlite/src/src/ |
legacy.c | 50 int nCol; 66 nCol = sqlite3_column_count(pStmt); 77 azCols = sqlite3DbMallocZero(db, 2*nCol*sizeof(const char*) + 1); 81 for(i=0; i<nCol; i++){ 90 azVals = &azCols[nCol]; 91 for(i=0; i<nCol; i++){ 99 if( xCallback(pArg, nCol, azVals, azCols) ){
|
table.c | 44 static int sqlite3_get_table_cb(void *pArg, int nCol, char **argv, char **colv){ 54 need = nCol*2; 56 need = nCol; 70 p->nColumn = nCol; 71 for(i=0; i<nCol; i++){ 76 }else if( p->nColumn!=nCol ){ 88 for(i=0; i<nCol; i++){
|
fkey.c | 190 int nCol = pFKey->nCol; /* Number of columns in parent key */ 206 if( nCol==1 ){ 219 assert( nCol>1 ); 220 aiCol = (int *)sqlite3DbMallocRaw(pParse->db, nCol*sizeof(int)); 226 if( pIdx->nColumn==nCol && pIdx->onError!=OE_None ){ 238 for(i=0; i<nCol; i++) aiCol[i] = pFKey->aCol[i].iFrom; 248 for(i=0; i<nCol; i++){ 263 for(j=0; j<nCol; j++){ 269 if( j==nCol ) break [all...] |
update.c | 67 assert( i<pTab->nCol ); 168 aXRef = sqlite3DbMallocRaw(db, sizeof(int) * pTab->nCol ); 170 for(i=0; i<pTab->nCol; i++) aXRef[i] = -1; 198 for(j=0; j<pTab->nCol; j++){ 208 if( j>=pTab->nCol ){ 281 pParse->nMem += pTab->nCol; 287 pParse->nMem += pTab->nCol; 396 for(i=0; i<pTab->nCol; i++){ 424 for(i=0; i<pTab->nCol; i++){ 449 sqlite3VdbeAddOp2(v, OP_Affinity, regNew, pTab->nCol); [all...] |
delete.c | 513 pParse->nMem += (1 + pTab->nCol); 518 for(iCol=0; iCol<pTab->nCol; iCol++){ 623 int nCol; 625 nCol = pIdx->nColumn; 626 regBase = sqlite3GetTempRange(pParse, nCol+1); 627 sqlite3VdbeAddOp2(v, OP_Rowid, iCur, regBase+nCol); 628 for(j=0; j<nCol; j++){ 631 sqlite3VdbeAddOp2(v, OP_SCopy, regBase+nCol, regBase+j); 638 sqlite3VdbeAddOp3(v, OP_MakeRecord, regBase, nCol+1, regOut); 641 sqlite3ReleaseTempRange(pParse, regBase, nCol+1) [all...] |
insert.c | 33 sqlite3VdbeChangeP4(v, -1, SQLITE_INT_TO_PTR(pTab->nCol), P4_INT32); 112 zColAff = (char *)sqlite3DbMallocRaw(0, pTab->nCol+1); 118 for(i=0; i<pTab->nCol; i++){ 121 zColAff[pTab->nCol] = '\0'; 685 for(i=0; i<pTab->nCol; i++){ 689 if( pColumn==0 && nColumn && nColumn!=(pTab->nCol-nHidden) ){ 692 pTabList, 0, pTab->nCol-nHidden, nColumn); 716 for(j=0; j<pTab->nCol; j++){ 725 if( j>=pTab->nCol ){ 799 pParse->nMem += pTab->nCol + 1 [all...] |
analyze.c | 166 int nCol; 170 nCol = pIdx->nColumn; 172 if( iMem+1+(nCol*2)>pParse->nMem ){ 173 pParse->nMem = iMem+1+(nCol*2); 216 ** iMem+1 .. iMem+nCol: 218 ** left-most N columns only, where N is between 1 and nCol, 221 ** iMem+nCol+1 .. Mem+2*nCol: 224 ** Cells iMem through iMem+nCol are initialized to 0. The others are 227 for(i=0; i<=nCol; i++) [all...] |
build.c | 491 for(i=0; i<pTable->nCol; i++, pCol++){ 957 if( p->nCol+1>db->aLimit[SQLITE_LIMIT_COLUMN] ){ 964 for(i=0; i<p->nCol; i++){ 971 if( (p->nCol & 0x7)==0 ){ 973 aNew = sqlite3DbRealloc(db,p->aCol,(p->nCol+8)*sizeof(p->aCol[0])); 980 pCol = &p->aCol[p->nCol]; 989 p->nCol++; [all...] |
alter.c | 643 pCol = &pNew->aCol[pNew->nCol-1]; 793 pNew->nCol = pTab->nCol; 794 assert( pNew->nCol>0 ); 795 nAlloc = (((pNew->nCol-1)/8)*8)+8; 796 assert( nAlloc>=pNew->nCol && nAlloc%8==0 && nAlloc-pNew->nCol<8 ); 803 memcpy(pNew->aCol, pTab->aCol, sizeof(Column)*pNew->nCol); 804 for(i=0; i<pNew->nCol; i++){
|
auth.c | 171 assert( iCol<pTab->nCol ); 174 assert( pTab->iPKey<pTab->nCol );
|
vdbeblob.c | 199 for(iCol=0; iCol<pTab->nCol; iCol++) { 204 if( iCol==pTab->nCol ){ 228 for(j=0; j<pFKey->nCol; j++){ 297 sqlite3VdbeChangeP4(v, 3+flags, SQLITE_INT_TO_PTR(pTab->nCol+1),P4_INT32); 298 sqlite3VdbeChangeP2(v, 7, pTab->nCol);
|
test8.c | 82 int nCol; /* Number of columns in the real table */ 83 int *aIndex; /* Array of size nCol. True if column has an index */ 84 char **aCol; /* Array of size nCol. Column names */ 152 ** nCol column names. The caller is responsible for calling sqlite3_free 165 int nCol = 0; 183 nCol = sqlite3_column_count(pStmt); 188 nBytes = sizeof(char *) * nCol; 189 for(ii=0; ii<nCol; ii++){ 206 zSpace = (char *)(&aCol[nCol]); 207 for(ii=0; ii<nCol; ii++) [all...] |
select.c | 186 for(i=0; i<pTab->nCol; i++){ 346 for(j=0; j<pRightTab->nCol; j++){ [all...] |
tclsqlite.c | [all...] |
resolve.c | 169 assert( pTab->nCol>0 ); 190 for(j=0, pCol=pTab->aCol; j<pTab->nCol; j++, pCol++){ 246 for(iCol=0; iCol<pTab->nCol; iCol++){ 255 if( iCol>=pTab->nCol && sqlite3IsRowid(zCol) ){ 258 if( iCol<pTab->nCol ){ [all...] |
vtab.c | 492 for(iCol=0; iCol<pTab->nCol; iCol++){ 669 pTab->nCol = pParse->pNewTable->nCol; 670 pParse->pNewTable->nCol = 0;
|
where.c | [all...] |
pragma.c | 880 for(i=0, pCol=pTab->aCol; i<pTab->nCol; i++, pCol++){ 918 assert( pTab->nCol>cnum ); [all...] |
expr.c | 52 assert( pExpr->pTab && j<pExpr->pTab->nCol ); [all...] |
main.c | [all...] |
sqliteInt.h | [all...] |
/external/chromium_org/third_party/sqlite/src/ext/fts3/ |
fts3_expr.c | 88 int nCol; /* Number of entries in azCol[] */ 453 for(ii=0; ii<pParse->nCol; ii++){ 693 ** array, which is assumed to contain nCol entries, should contain the names 706 int nCol, /* Number of entries in azCol[] */ 716 sParse.nCol = nCol; 862 int nCol; 895 nCol = argc-2; 896 azCol = (char **)sqlite3_malloc(nCol*sizeof(char *)); 901 for(ii=0; ii<nCol; ii++) [all...] |
fts3_snippet.c | 26 #define FTS3_MATCHINFO_AVGLENGTH 'a' /* nCol values */ 27 #define FTS3_MATCHINFO_LENGTH 'l' /* nCol values */ 28 #define FTS3_MATCHINFO_LCS 's' /* nCol values */ 29 #define FTS3_MATCHINFO_HITS 'x' /* 3*nCol*nPhrase values */ 88 int nCol; /* Number of columns in table */ 807 ** for(iCol=0; iCol<nCol; iCol++){ 808 ** aMatchinfo[3*iPhrase*nCol + 3*iCol + 1] = X; 809 ** aMatchinfo[3*iPhrase*nCol + 3*iCol + 2] = Y; 832 u32 *aOut = &p->aMatchinfo[3*iPhrase*p->nCol]; 851 for(iCol=0; iCol<p->nCol; iCol++) [all...] |
fts3.c | 836 int nCol = 0; /* Number of columns in the FTS table */ 914 aCol[nCol++] = z; 919 if( nCol==0 ){ 923 nCol = 1; 935 nCol * sizeof(char *) + /* azColumn */ 946 p->nColumn = nCol; [all...] |
/external/chromium_org/third_party/sqlite/src/ext/rtree/ |
viewrtree.tcl | 42 set nCol [expr [llength [db eval "pragma table_info($name)"]]/6] 43 if {$nCol != 5} {
|