Searched defs:pTmp (Results 1 - 9 of 9) sorted by relevance
/illumos-gate/usr/src/lib/pkcs11/pkcs11_tpm/common/ |
H A D | apiutil.c | 376 Session_Struct_t *pCur, *pTmp; local 390 pTmp = pSess->Next; 392 if (pTmp) { 393 pTmp->Previous = NULL; 414 pTmp = pSess->Next; 415 pCur->Next = pTmp; 416 if (pTmp) { 417 pTmp->Previous = pCur;
|
/illumos-gate/usr/src/uts/common/io/bnxe/ |
H A D | bnxe_hw.c | 46 BnxeMemDma * pTmp; local 51 pTmp = (BnxeMemDma *)d_list_peek_head(&pUM->memDmaListSaved); 52 while (pTmp) 55 pTmp, pTmp->pDmaVirt, pTmp->size); 56 for (i = 0; i < pTmp->size; i++) 58 if (((u8_t *)pTmp->pDmaVirt)[i] != 0x0) 61 pTmp, i); 65 pTmp 816 struct ecore_mcast_list_elem * pTmp; local 1841 BnxeMemDma * pTmp; local [all...] |
H A D | bnxe_intr.c | 79 BnxeMemDma * pTmp; local 103 pTmp = (BnxeMemDma *)d_list_peek_head(&pUM->memDmaList); 104 while (pTmp) 106 if (pTmp->physAddr.as_ptr == physAddr.as_ptr) 111 pTmp = (BnxeMemDma *)d_list_next_entry(&pTmp->link); 114 if (pTmp == NULL) 119 pUM->statusBlocks[idx] = pTmp; 124 pTmp = (BnxeMemDma *)d_list_peek_head(&pUM->memDmaList); 125 while (pTmp) [all...] |
H A D | bnxe_rx.c | 744 u8_t * pTmp; local 763 if ((pTmp = kmem_zalloc(BnxeRxPktDescrSize(pUM), 770 pRxPkt = (um_rxpacket_t *)(pTmp + SIZEOF_SIG);
|
H A D | bnxe_tx.c | 416 caddr_t pTmp; local 433 pTmp = pTxPkt->pCbBuf; 442 bcopy(pMblk->b_rptr, pTmp, msgSize); 443 pTmp += msgSize;
|
H A D | bnxe_fcoe.c | 1567 void * pTmp; local 1582 pTmp = (void *)((u8_t *)pUM->lm_dev.context_info->array[SW_CID(cid)].cid_resc.mapped_cid_bar_addr + DPM_TRIGER_TYPE); 1585 if ((pMap != pTmp) || (accHandle != tmpAcc))
|
H A D | bnxe_mm.c | 504 u32_t * pTmp; local 527 for (i = 0, pTmp = (u32_t *)pBuf; 529 i += 4, pTmp++) 531 *pTmp = BNXE_MAGIC; 535 for (i = 0, pTmp = (u32_t *)((char *)pBuf + memSize - BNXE_MEM_CHECK_LEN); 537 i += 4, pTmp++) 539 *pTmp = BNXE_MAGIC; 733 u32_t * pTmp; local 747 for (i = 0, pTmp = (u32_t *)pBuf; 749 i += 4, pTmp [all...] |
/illumos-gate/usr/src/lib/libsqlite/src/ |
H A D | trigger.c | 23 TriggerStep * pTmp = pTriggerStep; local 26 if( pTmp->target.dyn ) sqliteFree((char*)pTmp->target.z); 27 sqliteExprDelete(pTmp->pWhere); 28 sqliteExprListDelete(pTmp->pExprList); 29 sqliteSelectDelete(pTmp->pSelect); 30 sqliteIdListDelete(pTmp->pIdList); 32 sqliteFree(pTmp);
|
H A D | btree_rb.c | 880 BtRbNode *pTmp = 0; local 886 pTmp = pCur->pNode; 898 * pCur->pNode to pTmp, which is either NULL (if the tree is empty) or the 900 * between pTmp and the searched for key is already stored in *pRes. pTmp is 902 if( !pCur->pNode ) pCur->pNode = pTmp; 963 BtRbNode *pTmp; local 976 pTmp = pZ; 978 pCur->pNode = pTmp; 1046 BtRbNode *pTmp local 1282 BtRollbackOp *pTmp = pOp->pNext; local 1322 BtRollbackOp *pTmp; local [all...] |
Completed in 92 milliseconds