Searched refs:pRes (Results 1 - 5 of 5) sorted by relevance

/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/
H A Dmemcache.c197 static int memcache_free_entry(LDAPMemCache *cache, ldapmemcacheRes *pRes);
198 static int memcache_expired(LDAPMemCache *cache, ldapmemcacheRes *pRes,
200 static int memcache_add_to_list(LDAPMemCache *cache, ldapmemcacheRes *pRes,
202 static int memcache_add_res_to_list(ldapmemcacheRes *pRes, LDAPMessage *pMsg,
204 static int memcache_free_from_list(LDAPMemCache *cache, ldapmemcacheRes *pRes,
209 static int memcache_append(LDAP *ld, int msgid, LDAPMessage *pRes);
210 static int memcache_append_last(LDAP *ld, int msgid, LDAPMessage *pRes);
999 ldapmemcacheRes *pRes;
1007 (void*)&key, (void*)(&pRes), NULL);
1012 *ppRes = pRes
[all...]
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree.h74 int (*Moveto)(BtCursor*, const void *pKey, int nKey, int *pRes);
78 int (*First)(BtCursor*, int *pRes);
79 int (*Last)(BtCursor*, int *pRes);
80 int (*Next)(BtCursor*, int *pRes);
81 int (*Previous)(BtCursor*, int *pRes);
85 int nIgnore, int *pRes);
124 #define sqliteBtreeMoveto(pCur, pKey, nKey, pRes)\
125 (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes))
129 #define sqliteBtreeFirst(pCur, pRes) (btCOps(pCur)->First(pCur, pRes))
[all...]
H A Dbtree_rb.c141 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 Dbtree.c1319 ** 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...]
H A Dpager.c315 ** 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;

Completed in 78 milliseconds