48 /* 1d or 2d area */
50 	bool is2d;		/* whether area is 1d or 2d */
53 	struct tcm_pt  p1;  member
118  *			but it must support 0 (1), 32 and 64.
119  *			0 value is equivalent to 1.
139 		 (align & (align - 1))) ? -EINVAL :  in tcm_reserve_2d()
153  * Reserves a 1D area in the container.
228 		slice->p0.y != slice->p1.y &&  in tcm_slice()
229 		(slice->p0.x || (slice->p1.x != slice->tcm->width - 1))) {  in tcm_slice()
231 		slice->p1.x = slice->tcm->width - 1;  in tcm_slice()
232 		slice->p1.y = (slice->p0.x) ? slice->p0.y : slice->p1.y - 1;  in tcm_slice()
235 		parent->p0.y = slice->p1.y + 1;  in tcm_slice()
247 		area->p1.x < area->tcm->width &&  in tcm_area_is_valid()
248 		area->p1.y < area->tcm->height &&  in tcm_area_is_valid()
249 		area->p0.y <= area->p1.y &&  in tcm_area_is_valid()
250 		/* 1D coordinate relationship + p0.x check */  in tcm_area_is_valid()
254 		  area->p1.x + area->p1.y * area->tcm->width) ||  in tcm_area_is_valid()
257 		  area->p0.x <= area->p1.x));  in tcm_area_is_valid()
266 		return p->x >= a->p0.x && p->x <= a->p1.x &&  in __tcm_is_in()
267 		       p->y >= a->p0.y && p->y <= a->p1.y;  in __tcm_is_in()
271 		       i <= a->p1.x + a->p1.y * a->tcm->width;  in __tcm_is_in()
278 	return area->p1.x - area->p0.x + 1;  in __tcm_area_width()
284 	return area->p1.y - area->p0.y + 1;  in __tcm_area_height()
292 		(area->p1.x - area->p0.x + 1) + (area->p1.y - area->p0.y) *  in __tcm_sizeof()
300 /* limit a 1D area to the first N pages */
308 	a->p1.x = (a->p0.x + num_pg - 1) % a->tcm->width;  in tcm_1d_limit()
309 	a->p1.y = a->p0.y + ((a->p0.x + num_pg - 1) / a->tcm->width);  in tcm_1d_limit()