Lines Matching defs:brn

4968 	struct brevq_node *brn;
4974 	brn = kmem_zalloc(sizeof (*brn), KM_SLEEP);
4975 	brn->brn_deviname = i_ddi_strdup(deviname, KM_SLEEP);
4977 	brn->brn_child = child;
4978 	brn->brn_sibling = *brevqp;
4979 	*brevqp = brn;
4981 	return (brn);
4990 	struct brevq_node *brn, *next_brn;
4992 	for (brn = brevq; brn != NULL; brn = next_brn) {
4993 		next_brn = brn->brn_sibling;
4994 		ASSERT(brn->brn_child == NULL);
4995 		kmem_free(brn->brn_deviname, strlen(brn->brn_deviname) + 1);
4996 		kmem_free(brn, sizeof (*brn));
5009 	struct brevq_node *brn;
5013 	for (brn = brevq; brn != NULL; brn = brn->brn_sibling) {
5014 		(void) strcpy(p, brn->brn_deviname);
5045 	struct brevq_node *brn;
5052 	for (brn = brevq; brn != NULL; brn = brn->brn_sibling) {
5053 		if (brn->brn_child) {
5054 			(void) strcpy(p, brn->brn_deviname);
5056 			log_and_free_brevq(path, brn->brn_child);
5057 			brn->brn_child = NULL;
5070 	struct brevq_node *brevq, *brn, *prev_brn, *next_brn;
5079 	for (brn = brevq; brn != NULL; brn = next_brn) {
5080 		next_brn = brn->brn_sibling;
5085 				if (strcmp(path, brn->brn_deviname) == 0)
5093 			 * is not going be generated on brn->brn_child.
5095 			 * brn->brn_child log them and remove the brn
5098 			if (brn->brn_child) {
5100 				(void) strcat(path, brn->brn_deviname);
5101 				log_and_free_brevq(path, brn->brn_child);
5109 			kmem_free(brn->brn_deviname,
5110 			    strlen(brn->brn_deviname) + 1);
5111 			kmem_free(brn, sizeof (*brn));
5115 			 * queued on brn->brn_child since brn->brn_child
5118 			if (brn->brn_child) {
5119 				free_brevq(brn->brn_child);
5120 				brn->brn_child = NULL;
5122 			prev_brn = brn;
7671 	struct brevq_node	*brn;
7696 			brn = brevq_enqueue(hdl->mtc_brevqp, dip, NULL);
7698 			brn = NULL;
7723 		mcd->mtc_brn = brn;