Lines Matching defs:bc_level

263  *	The array bc_level is sorted in strictly ascending order.
267  *	(bc_level != NULL) && (bc_level_count > 0)
270 	uint8_t		*bc_level;		/* Array of levels */
714 		bc->bc_current = bc->bc_level[bc->bc_level_count - 1];
722 			kmem_free(bc->bc_level,
723 			    bc->bc_level_count * sizeof(*bc->bc_level));
761 		kmem_free(bc->bc_level,
762 		    bc->bc_level_count * sizeof(*bc->bc_level));
1099 	max = bc->bc_level[bc->bc_level_count - 1];
1103 		acpidisp_array_search(bc->bc_level, bc->bc_level_count, cur,
1131 	min = bc->bc_level[0];
1135 		acpidisp_array_search(bc->bc_level, bc->bc_level_count, cur,
1164 	if (bc->bc_current >= bc->bc_level[bc->bc_level_count - 1]) {
1165 		bc->bc_current = bc->bc_level[0];
1167 		acpidisp_array_search(bc->bc_level, bc->bc_level_count,
1192 	bc->bc_current = bc->bc_level[0];
1458 	acpidisp_array_search(bc->bc_level, bc->bc_level_count, val, &lo, &up);
1691 	bc->bc_level = kmem_zalloc(bc->bc_level_count * sizeof(*bc->bc_level),
1695 	 * Fill the array bc->bc_level with an insertion sort.
1706 		for (j = count; --j >= 0 && bc->bc_level[j] > level; );
1707 		if (j >= 0 && bc->bc_level[j] == level)
1713 			bc->bc_level[k] = bc->bc_level[k-1];
1716 		bc->bc_level[j] = level;
1729 	 * Resize the array bc->bc_level if needed.
1733 		(void)memcpy(levelp, bc->bc_level, count * sizeof(*levelp));
1734 		kmem_free(bc->bc_level,
1735 		    bc->bc_level_count * sizeof(*bc->bc_level));
1736 		bc->bc_level = levelp;
1748 		if (bc->bc_level != NULL)
1749 			kmem_free(bc->bc_level,
1750 			    bc->bc_level_count * sizeof(*bc->bc_level));
1920 	test_brightness = bc->bc_level[bc->bc_level_count - 1];
1922 		test_brightness = bc->bc_level[0];
2031 	ranger(bc->bc_level, bc->bc_level_count, aprint_verbose);