dev/drm/radeon_state.c

1931 		     dev_priv->surfaces[surf_index].flags);
1933 		     dev_priv->surfaces[surf_index].lower);
1935 		     dev_priv->surfaces[surf_index].upper);
1945  * For example : we allocate three contigous surfaces ABC. If B is
1946  * freed, we suddenly need two surfaces to store A and C, which might
1968 	/* make sure there is no overlap with existing surfaces */
1970 		if ((dev_priv->surfaces[i].refcount != 0) &&
1971 		    (((new_lower >= dev_priv->surfaces[i].lower) &&
1972 		      (new_lower < dev_priv->surfaces[i].upper)) ||
1973 		     ((new_lower < dev_priv->surfaces[i].lower) &&
1974 		      (new_upper > dev_priv->surfaces[i].lower)))) {
1991 		if ((dev_priv->surfaces[i].refcount == 1) &&
1992 		    (new->flags == dev_priv->surfaces[i].flags) &&
1993 		    (new_upper + 1 == dev_priv->surfaces[i].lower)) {
2000 			dev_priv->surfaces[i].refcount++;
2001 			dev_priv->surfaces[i].lower = s->lower;
2007 		if ((dev_priv->surfaces[i].refcount == 1) &&
2008 		    (new->flags == dev_priv->surfaces[i].flags) &&
2009 		    (new_lower == dev_priv->surfaces[i].upper + 1)) {
2016 			dev_priv->surfaces[i].refcount++;
2017 			dev_priv->surfaces[i].upper = s->upper;
2025 		if (dev_priv->surfaces[i].refcount == 0) {
2032 			dev_priv->surfaces[i].refcount = 1;
2033 			dev_priv->surfaces[i].lower = s->lower;
2034 			dev_priv->surfaces[i].upper = s->upper;
2035 			dev_priv->surfaces[i].flags = s->flags;
2057 				if (dev_priv->surfaces[s->surface_index].
2059 					dev_priv->surfaces[s->surface_index].
2062 				if (dev_priv->surfaces[s->surface_index].
2064 					dev_priv->surfaces[s->surface_index].
2067 				dev_priv->surfaces[s->surface_index].refcount--;
2068 				if (dev_priv->surfaces[s->surface_index].
2070 					dev_priv->surfaces[s->surface_index].
3153  *    - Free any alloced radeon surfaces.