Searched defs:pRes (Results 1 - 3 of 3) sorted by relevance
| /illumos-gate/usr/src/lib/libsqlite/src/ |
| H A D | btree_rb.c | 141 int *pRes
144 static int memRbtreeNext(RbtCursor* pCur, int *pRes);
145 static int memRbtreeLast(RbtCursor* pCur, int *pRes);
146 static int memRbtreePrevious(RbtCursor* pCur, int *pRes);
694 int nIgnore, int *pRes)
699 *pRes = -1;
702 *pRes = -1;
704 *pRes = key_compare(pCur->pNode->pKey, pCur->pNode->nKey-nIgnore,
864 ** *pRes<0 The cursor is left pointing at an entry that
868 ** *pRes
693 memRbtreeKeyCompare(RbtCursor* pCur, const void *pKey, int nKey, int nIgnore, int *pRes) argument
1074 memRbtreeFirst(RbtCursor* pCur, int *pRes) argument
1091 memRbtreeLast(RbtCursor* pCur, int *pRes) argument
1114 memRbtreeNext(RbtCursor* pCur, int *pRes) argument
1141 memRbtreePrevious(RbtCursor* pCur, int *pRes) argument
[all...] |
| H A D | pager.c | 315 ** that is read in *pRes. Return SQLITE_OK if everything worked, or an
322 static int read32bits(int format, OsFile *fd, u32 *pRes){ argument
331 *pRes = res;
|
| H A D | btree.c | 1319 ** The comparison result is written to *pRes as follows:
1321 ** *pRes<0 This means pCur<pKey
1323 ** *pRes==0 This means pCur==pKey for all nKey bytes
1325 ** *pRes>0 This means pCur>pKey
1530 ** on success. Set *pRes to 0 if the cursor actually points to something
1531 ** or set *pRes to 1 if the table is empty.
1533 static int fileBtreeFirst(BtCursor *pCur, int *pRes){ argument
1539 *pRes = 1;
1542 *pRes = 0;
1549 ** on success. Set *pRes t
1552 fileBtreeLast(BtCursor *pCur, int *pRes) argument
1592 fileBtreeMoveto(BtCursor *pCur, const void *pKey, int nKey, int *pRes) argument
1645 fileBtreeNext(BtCursor *pCur, int *pRes) argument
1700 fileBtreePrevious(BtCursor *pCur, int *pRes) argument
[all...] |
Completed in 57 milliseconds