Home
last modified time | relevance | path

Searched refs:pMin (Results 1 – 3 of 3) sorted by relevance

/sqlite-3.40.0/src/
H A Danalyze.c599 StatSample *pMin = &p->a[p->iMin]; in sampleInsert() local
600 tRowcnt *anEq = pMin->anEq; in sampleInsert()
601 tRowcnt *anLt = pMin->anLt; in sampleInsert()
602 tRowcnt *anDLt = pMin->anDLt; in sampleInsert()
603 sampleClear(p->db, pMin); in sampleInsert()
604 memmove(pMin, &pMin[1], sizeof(p->a[0])*(p->nSample-p->iMin-1)); in sampleInsert()
/sqlite-3.40.0/ext/wasm/
H A Dtester1.js1672 const pMin = w.scopedAlloc(16);
1673 const pMax = pMin + 8;
1675 w.setMemValue(pMin, 0, ptrType64);
1684 w.xCall('sqlite3_wasm_test_int64_minmax', pMin, pMax);
1685 T.assert(g64(pMin) === minMaxI64[0], "int64 mismatch").
1688 w.setMemValue(pMin, minMaxI64[0], ptrType64);
1689 T.assert(g64(pMin) === minMaxI64[0]).
1690 assert(minMaxI64[0] === db.selectValue("select ?",g64(pMin))).
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c1258 ShmChunk *pMin = 0; in treeRepairList() local
1265 if( p && (pMin==0 || shm_sequence_ge(pMin->iShmid, p->iShmid)) ){ in treeRepairList()
1266 pMin = p; in treeRepairList()
1286 iPrevShmid = pMin->iShmid; in treeRepairList()
1290 iPrevShmid = pMin->iShmid-1; in treeRepairList()