Cross Reference: /illumos-gate/usr/src/uts/common/io/ib/adapters/hermon/hermon

Lines Matching defs:entry
249 	 * Allocate an QP context entry.  This will be filled in with all
297 	 * If this will be a user-mappable QP, then allocate an entry for
700 	 * allocated entry into the "userland resources database".  This will
1865 	hermon_qpn_entry_t	*entry;
1934 	 * If this was a user-mappable QP, then we need to remove its entry
2065 			entry = qp->qp_qpn_hdl;
2068 			*qpnh = (ibc_qpn_hdl_t)entry;
2120 	 * Grab the temporary QPC entry from QP software state
2408 	hermon_qpn_entry_t	*entry;
2413 	 * a previously added entry that has a matching QPC index.  If
2414 	 * no matching entry is found, then allocate, initialize, and
2415 	 * add an entry to the AVL tree.
2416 	 * If a matching entry is found, then increment its QPN counter
2421 	entry = (hermon_qpn_entry_t *)avl_find(&state->hs_qpn_avl,
2423 	if (entry == NULL) {
2425 		 * Allocate and initialize a QPN entry, then insert
2428 		entry = (hermon_qpn_entry_t *)kmem_zalloc(
2430 		if (entry == NULL) {
2434 		_NOTE(NOW_INVISIBLE_TO_OTHER_THREADS(*entry))
2436 		entry->qpn_indx	   = qpc->hr_indx;
2437 		entry->qpn_refcnt  = 0;
2438 		entry->qpn_counter = 0;
2440 		avl_insert(&state->hs_qpn_avl, entry, where);
2444 	 * Make the AVL tree entry point to the QP context resource that
2447 	entry->qpn_qpc = qpc;
2450 	 * Setup the QP handle to point to the AVL tree entry.  Then
2451 	 * generate the new QP number from the entry's QPN counter value
2454 	qp->qp_qpn_hdl	= entry;
2455 	qp->qp_qpnum	= ((entry->qpn_counter <<
2464 	entry->qpn_counter++;
2465 	entry->qpn_refcnt++;
2478 hermon_qp_release_qpn(hermon_state_t *state, hermon_qpn_entry_t *entry,
2481 	ASSERT(entry != NULL);
2500 		entry->qpn_refcnt--;
2508 		if (entry->qpn_refcnt == 0) {
2509 			if (entry->qpn_qpc != NULL) {
2510 				hermon_rsrc_free(state, &entry->qpn_qpc);
2514 			 * If the current entry has served it's useful
2519 			if (entry->qpn_counter >= (1 <<
2521 				avl_remove(&state->hs_qpn_avl, entry);
2522 				kmem_free(entry, sizeof (hermon_qpn_entry_t));
2538 		if (entry->qpn_counter < (1 <<
2540 			hermon_rsrc_free(state, &entry->qpn_qpc);
2554 	hermon_qpn_entry_t	*entry, *query;
2556 	entry = (hermon_qpn_entry_t *)e;
2559 	if (query->qpn_indx < entry->qpn_indx) {
2561 	} else if (query->qpn_indx > entry->qpn_indx) {
2594 	hermon_qpn_entry_t	*entry;
2602 	while ((entry = (hermon_qpn_entry_t *)avl_destroy_nodes(
2604 		kmem_free(entry, sizeof (hermon_qpn_entry_t));