Lines Matching defs:entry

226 	 * Allocate an QP context entry.  This will be filled in with all
268 * If this will be a user-mappable QP, then allocate an entry for
589 * allocated entry into the "userland resources database". This will
1057 tavor_qpn_entry_t *entry;
1126 * If this was a user-mappable QP, then we need to remove its entry
1240 entry = qp->qp_qpn_hdl;
1243 *qpnh = (ibc_qpn_hdl_t)entry;
1298 * Grab the temporary QPC entry from QP software state
1540 tavor_qpn_entry_t *entry;
1547 * a previously added entry that has a matching QPC index. If
1548 * no matching entry is found, then allocate, initialize, and
1549 * add an entry to the AVL tree.
1550 * If a matching entry is found, then increment its QPN counter
1555 entry = (tavor_qpn_entry_t *)avl_find(&state->ts_qpn_avl,
1557 if (entry == NULL) {
1559 * Allocate and initialize a QPN entry, then insert
1562 entry = (tavor_qpn_entry_t *)kmem_zalloc(
1564 if (entry == NULL) {
1569 _NOTE(NOW_INVISIBLE_TO_OTHER_THREADS(*entry))
1571 entry->qpn_indx = qpc->tr_indx;
1572 entry->qpn_refcnt = 0;
1573 entry->qpn_counter = 0;
1575 avl_insert(&state->ts_qpn_avl, entry, where);
1579 * Make the AVL tree entry point to the QP context resource that
1582 entry->qpn_qpc = qpc;
1585 * Setup the QP handle to point to the AVL tree entry. Then
1586 * generate the new QP number from the entry's QPN counter value
1589 qp->qp_qpn_hdl = entry;
1590 qp->qp_qpnum = ((entry->qpn_counter <<
1598 entry->qpn_counter++;
1599 entry->qpn_refcnt++;
1612 tavor_qp_release_qpn(tavor_state_t *state, tavor_qpn_entry_t *entry, int flags)
1616 ASSERT(entry != NULL);
1635 entry->qpn_refcnt--;
1643 if (entry->qpn_refcnt == 0) {
1644 if (entry->qpn_qpc != NULL) {
1645 tavor_rsrc_free(state, &entry->qpn_qpc);
1649 * If the current entry has served it's useful
1654 if (entry->qpn_counter >= (1 <<
1656 avl_remove(&state->ts_qpn_avl, entry);
1657 kmem_free(entry, sizeof (tavor_qpn_entry_t));
1673 if (entry->qpn_counter < (1 <<
1675 tavor_rsrc_free(state, &entry->qpn_qpc);
1691 tavor_qpn_entry_t *entry, *query;
1695 entry = (tavor_qpn_entry_t *)e;
1698 if (query->qpn_indx < entry->qpn_indx) {
1701 } else if (query->qpn_indx > entry->qpn_indx) {
1740 tavor_qpn_entry_t *entry;
1750 while ((entry = (tavor_qpn_entry_t *)avl_destroy_nodes(
1752 kmem_free(entry, sizeof (tavor_qpn_entry_t));