Lines Matching full:available

344 /* Count the number of available cells in a layout. */
365 /* Calculate how much size is available to be removed from a cell. */
372 	u_int			 available, minimum;
379 		/* Space available in this cell only. */
381 			available = lc->sx;
388 			available = lc->sy;
394 		if (available > minimum)
395 			available -= minimum;
397 			available = 0;
399 		/* Same type: total of available space in all child cells. */
400 		available = 0;
402 			available += layout_resize_check(w, lcchild, type);
404 		/* Different type: minimum of available space in child cells. */
407 			available = layout_resize_check(w, lcchild, type);
408 			if (available < minimum)
409 				minimum = available;
411 		available = minimum;
414 	return (available);
419  * expects the change to have already been bounded to the space available.
761 	u_int	new_size, min, max, available;
767 	/* How much is available in this parent? */
768 	available = layout_resize_check(w, lc, type);
776 		if (lc->sx - available > min)
777 			min = lc->sx - available;
780 		if (lc->sy - available > min)
781 			min = lc->sy - available;
800 	u_int			 new_size, available, previous, count, idx;
805 	available = size;
814 		if (available < (count * 2) - 1)
825 			    type, size, count - idx, available);
827 				if (new_size > available)
829 				available -= new_size;
831 				if (new_size + 1 > available)
833 				available -= new_size + 1;
856 	u_int			 previous, available, count, idx;
873 	/* And how much is available? */
874 	available = 0;
876 		available = lc->sx;
878 		available = lc->sy;
888 			    lc->type, lc->sx, count - idx, available);
889 			available -= (lcchild->sx + 1);
895 			    lc->type, lc->sy, count - idx, available);
896 			available -= (lcchild->sy + 1);