Searched defs:pCur (Results 1 - 6 of 6) sorted by relevance

/illumos-gate/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dapiutil.c349 Session_Struct_t *pCur; local
353 pCur = Anchor->SessListBeg;
355 if (! pCur) {
361 while (pCur->Next != NULL) {
362 pCur = pCur->Next;
364 pCur->Next = pSess;
365 pSess->Previous = pCur;
376 Session_Struct_t *pCur, *pTmp; local
380 pCur
[all...]
H A Dapi_interface.c395 Session_Struct_t *pCur, *pPrev; local
413 pCur = (Anchor ? Anchor->SessListBeg : NULL);
414 while (pCur) {
417 * There is a basic problem here. We are using th pCur
425 * the list and we just set pCur to the SessListBeg.
427 if (pCur->SltId == slotID) {
428 pPrev = pCur->Previous;
429 rv = C_CloseSession((CK_SESSION_HANDLE)pCur);
434 pCur = Anchor->SessListBeg;
436 pCur
[all...]
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dtest3.c520 BtCursor *pCur; local
533 rc = sqliteBtreeCursor(pBt, iTable, wrFlag, &pCur);
538 sprintf(zBuf,"0x%x", (int)pCur);
554 BtCursor *pCur; local
562 if( Tcl_GetInt(interp, argv[1], (int*)&pCur) ) return TCL_ERROR;
563 rc = sqliteBtreeCloseCursor(pCur);
582 BtCursor *pCur; local
592 if( Tcl_GetInt(interp, argv[1], (int*)&pCur) ) return TCL_ERROR;
593 rc = sqliteBtreeMoveto(pCur, argv[2], strlen(argv[2]), &res);
616 BtCursor *pCur; local
645 BtCursor *pCur; local
676 BtCursor *pCur; local
710 BtCursor *pCur; local
743 BtCursor *pCur; local
776 BtCursor *pCur; local
808 BtCursor *pCur; local
846 BtCursor *pCur; local
884 BtCursor *pCur; local
922 BtCursor *pCur; local
[all...]
H A Dbtree_rb.c138 RbtCursor* pCur,
144 static int memRbtreeNext(RbtCursor* pCur, int *pRes);
145 static int memRbtreeLast(RbtCursor* pCur, int *pRes);
146 static int memRbtreePrevious(RbtCursor* pCur, int *pRes);
151 ** as pCur points to. If any of those cursors were opened with
163 static int checkReadLocks(RbtCursor *pCur){ argument
165 assert( pCur->wrFlag );
166 for(p=pCur->pTree->pCursors; p; p=p->pShared){
167 if( p!=pCur ){
693 static int memRbtreeKeyCompare(RbtCursor* pCur, cons argument
723 RbtCursor *pCur; local
748 memRbtreeInsert( RbtCursor* pCur, const void *pKey, int nKey, const void *pDataInput, int nData ) argument
874 memRbtreeMoveto( RbtCursor* pCur, const void *pKey, int nKey, int *pRes ) argument
923 memRbtreeDelete(RbtCursor* pCur) 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
1168 memRbtreeKeySize(RbtCursor* pCur, int *pSize) argument
1178 memRbtreeKey(RbtCursor* pCur, int offset, int amt, char *zBuf) argument
1190 memRbtreeDataSize(RbtCursor* pCur, int *pSize) argument
1200 memRbtreeData(RbtCursor *pCur, int offset, int amt, char *zBuf) argument
1212 memRbtreeCloseCursor(RbtCursor* pCur) argument
1419 memRbtreeCursorDump(RbtCursor* pCur, int* aRes) argument
[all...]
H A Dbtree.c392 static int fileBtreeCloseCursor(BtCursor *pCur);
931 BtCursor *pCur; local
936 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
937 if( pCur->pPage && pCur->pPage->isInit==0 ){
938 sqlitepager_unref(pCur->pPage);
939 pCur
992 BtCursor *pCur; local
1044 BtCursor *pCur, *pRing; local
1107 fileBtreeCloseCursor(BtCursor *pCur) argument
1134 getTempCursor(BtCursor *pCur, BtCursor *pTempCur) argument
1147 releaseTempCursor(BtCursor *pCur) argument
1160 fileBtreeKeySize(BtCursor *pCur, int *pSize) argument
1183 getPayload(BtCursor *pCur, int offset, int amt, char *zBuf) argument
1249 fileBtreeKey(BtCursor *pCur, int offset, int amt, char *zBuf) argument
1271 fileBtreeDataSize(BtCursor *pCur, int *pSize) argument
1294 fileBtreeData(BtCursor *pCur, int offset, int amt, char *zBuf) argument
1332 fileBtreeKeyCompare( BtCursor *pCur, const void *pKey, int nKey, int nIgnore, int *pResult ) argument
1398 moveToChild(BtCursor *pCur, int newPgno) argument
1431 moveToParent(BtCursor *pCur) argument
1479 moveToRoot(BtCursor *pCur) argument
1498 moveToLeftmost(BtCursor *pCur) argument
1516 moveToRightmost(BtCursor *pCur) argument
1533 fileBtreeFirst(BtCursor *pCur, int *pRes) argument
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
2186 balance(Btree *pBt, MemPage *pPage, BtCursor *pCur) argument
2607 checkReadLocks(BtCursor *pCur) argument
2627 fileBtreeInsert( BtCursor *pCur, const void *pKey, int nKey, const void *pData, int nData ) argument
2695 fileBtreeDelete(BtCursor *pCur) argument
2850 BtCursor *pCur; local
2875 BtCursor *pCur; local
3130 fileBtreeCursorDump(BtCursor *pCur, int *aResult) argument
[all...]
/illumos-gate/usr/src/lib/libldap5/sources/ldap/common/
H A Dmemcache.c372 ldapmemcacheld *pCur = NULL; local
379 pCur = (c ? c->ldmemc_lds : NULL);
380 for (; pCur; pCur = pCur->ldmemcl_next) {
381 if (pCur->ldmemcl_ld == ld)
383 pPrev = pCur;
386 if (pCur) {
395 pPrev->ldmemcl_next = pCur->ldmemcl_next;
397 c->ldmemc_lds = pCur
[all...]

Completed in 120 milliseconds