| /titanic_51/usr/src/lib/libsqlite/src/ |
| H A D | btree.h | 104 #define btCOps(pCur) (*((BtCursorOps **)(pCur))) argument
124 #define sqliteBtreeMoveto(pCur, pKey, nKey, pRes)\ argument
126 #define sqliteBtreeDelete(pCur) (btCOps(pCur)->Delete(pCur)) argument
127 #define sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) \ argument
129 sqliteBtreeFirst(pCur,pRes) global() argument
130 sqliteBtreeLast(pCur,pRes) global() argument
131 sqliteBtreeNext(pCur,pRes) global() argument
132 sqliteBtreePrevious(pCur,pRes) global() argument
133 sqliteBtreeKeySize(pCur,pSize) global() argument
134 sqliteBtreeKey(pCur,offset,amt,zBuf) global() argument
136 sqliteBtreeKeyCompare(pCur,pKey,nKey,nIgnore,pRes) global() argument
138 sqliteBtreeDataSize(pCur,pSize) global() argument
139 sqliteBtreeData(pCur,offset,amt,zBuf) global() argument
141 sqliteBtreeCloseCursor(pCur) global() argument
153 sqliteBtreeCursorDump(pCur,aResult) global() argument
[all...] |
| H A D | btree_rb.c | 163 static int checkReadLocks(RbtCursor *pCur){ in checkReadLocks() argument
693 static int memRbtreeKeyCompare(RbtCursor* pCur, cons argument
723 RbtCursor *pCur; memRbtreeCursor() local
749 memRbtreeInsert(RbtCursor * pCur,const void * pKey,int nKey,const void * pDataInput,int nData) memRbtreeInsert() argument
875 memRbtreeMoveto(RbtCursor * pCur,const void * pKey,int nKey,int * pRes) memRbtreeMoveto() argument
923 memRbtreeDelete(RbtCursor * pCur) memRbtreeDelete() argument
1074 memRbtreeFirst(RbtCursor * pCur,int * pRes) memRbtreeFirst() argument
1091 memRbtreeLast(RbtCursor * pCur,int * pRes) memRbtreeLast() argument
1114 memRbtreeNext(RbtCursor * pCur,int * pRes) memRbtreeNext() argument
1141 memRbtreePrevious(RbtCursor * pCur,int * pRes) memRbtreePrevious() argument
1168 memRbtreeKeySize(RbtCursor * pCur,int * pSize) memRbtreeKeySize() argument
1178 memRbtreeKey(RbtCursor * pCur,int offset,int amt,char * zBuf) memRbtreeKey() argument
1190 memRbtreeDataSize(RbtCursor * pCur,int * pSize) memRbtreeDataSize() argument
1200 memRbtreeData(RbtCursor * pCur,int offset,int amt,char * zBuf) memRbtreeData() argument
1212 memRbtreeCloseCursor(RbtCursor * pCur) memRbtreeCloseCursor() argument
1419 memRbtreeCursorDump(RbtCursor * pCur,int * aRes) memRbtreeCursorDump() argument
[all...] |
| H A D | test3.c | 520 BtCursor *pCur; in btree_cursor() local
554 BtCursor *pCur; in btree_close_cursor() local
582 BtCursor *pCur; in btree_move_to() local
616 BtCursor *pCur; in btree_delete() local
645 BtCursor *pCur; btree_insert() local
676 BtCursor *pCur; btree_next() local
710 BtCursor *pCur; btree_prev() local
743 BtCursor *pCur; btree_first() local
776 BtCursor *pCur; btree_last() local
808 BtCursor *pCur; btree_key() local
846 BtCursor *pCur; btree_data() local
884 BtCursor *pCur; btree_payload_size() local
922 BtCursor *pCur; btree_cursor_dump() local
[all...] |
| H A D | btree.c | 931 BtCursor *pCur; in fileBtreeRollback() local
992 BtCursor *pCur; fileBtreeRollbackCkpt() local
1044 BtCursor *pCur, *pRing; fileBtreeCursor() local
1107 fileBtreeCloseCursor(BtCursor * pCur) fileBtreeCloseCursor() argument
1134 getTempCursor(BtCursor * pCur,BtCursor * pTempCur) getTempCursor() argument
1147 releaseTempCursor(BtCursor * pCur) releaseTempCursor() argument
1160 fileBtreeKeySize(BtCursor * pCur,int * pSize) fileBtreeKeySize() argument
1183 getPayload(BtCursor * pCur,int offset,int amt,char * zBuf) getPayload() argument
1249 fileBtreeKey(BtCursor * pCur,int offset,int amt,char * zBuf) fileBtreeKey() argument
1271 fileBtreeDataSize(BtCursor * pCur,int * pSize) fileBtreeDataSize() argument
1294 fileBtreeData(BtCursor * pCur,int offset,int amt,char * zBuf) fileBtreeData() argument
1333 fileBtreeKeyCompare(BtCursor * pCur,const void * pKey,int nKey,int nIgnore,int * pResult) fileBtreeKeyCompare() argument
1398 moveToChild(BtCursor * pCur,int newPgno) moveToChild() argument
1431 moveToParent(BtCursor * pCur) moveToParent() argument
1479 moveToRoot(BtCursor * pCur) moveToRoot() argument
1498 moveToLeftmost(BtCursor * pCur) moveToLeftmost() argument
1516 moveToRightmost(BtCursor * pCur) moveToRightmost() argument
1533 fileBtreeFirst(BtCursor * pCur,int * pRes) fileBtreeFirst() argument
1552 fileBtreeLast(BtCursor * pCur,int * pRes) fileBtreeLast() argument
1592 fileBtreeMoveto(BtCursor * pCur,const void * pKey,int nKey,int * pRes) fileBtreeMoveto() argument
1645 fileBtreeNext(BtCursor * pCur,int * pRes) fileBtreeNext() argument
1700 fileBtreePrevious(BtCursor * pCur,int * pRes) fileBtreePrevious() argument
2186 balance(Btree * pBt,MemPage * pPage,BtCursor * pCur) balance() argument
2607 checkReadLocks(BtCursor * pCur) checkReadLocks() argument
2628 fileBtreeInsert(BtCursor * pCur,const void * pKey,int nKey,const void * pData,int nData) fileBtreeInsert() argument
2695 fileBtreeDelete(BtCursor * pCur) fileBtreeDelete() argument
2850 BtCursor *pCur; fileBtreeClearTable() local
2875 BtCursor *pCur; fileBtreeDropTable() local
3130 fileBtreeCursorDump(BtCursor * pCur,int * aResult) fileBtreeCursorDump() argument
[all...] |
| /titanic_51/usr/src/lib/pkcs11/pkcs11_tpm/common/ |
| H A D | apiutil.c | 349 Session_Struct_t *pCur; local
376 Session_Struct_t *pCur, *pTmp; local
[all...] |
| H A D | api_interface.c | 395 Session_Struct_t *pCur, *pPrev; in C_CloseAllSessions() local
[all...] |
| /titanic_51/usr/src/lib/libldap5/sources/ldap/common/ |
| H A D | memcache.c | 372 ldapmemcacheld *pCur = NULL; in ldap_memcache_set() local
[all...] |