/osnet-11/usr/src/lib/pkcs11/pkcs11_tpm/common/ |
H A D | apiutil.c | 345 Session_Struct_t *pCur; local 349 pCur = Anchor->SessListBeg; 351 if (! pCur) { 357 while (pCur->Next != NULL) { 358 pCur = pCur->Next; 360 pCur->Next = pSess; 361 pSess->Previous = pCur; 372 Session_Struct_t *pCur, *pTmp; local 376 pCur [all...] |
H A D | api_interface.c | 394 Session_Struct_t *pCur, *pPrev; local 412 pCur = (Anchor ? Anchor->SessListBeg : NULL); 413 while (pCur) { 416 * There is a basic problem here. We are using th pCur 424 * the list and we just set pCur to the SessListBeg. 426 if (pCur->SltId == slotID) { 427 pPrev = pCur->Previous; 428 rv = C_CloseSession((CK_SESSION_HANDLE)pCur); 433 pCur = Anchor->SessListBeg; 435 pCur [all...] |
/osnet-11/usr/src/lib/libsqlite/src/ |
H A D | test3.c | 520 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 D | btree_rb.c | 138 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 D | btree.c | 392 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...] |
/osnet-11/usr/src/lib/libldap5/sources/ldap/common/ |
H A D | memcache.c | 372 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...] |