drm2/radeon/radeon_state.c

1969 		     dev_priv->surfaces[surf_index].flags);
1971 		     dev_priv->surfaces[surf_index].lower);
1973 		     dev_priv->surfaces[surf_index].upper);
1983  * For example : we allocate three contiguous surfaces ABC. If B is
1984  * freed, we suddenly need two surfaces to store A and C, which might
2006 	/* make sure there is no overlap with existing surfaces */
2008 		if ((dev_priv->surfaces[i].refcount != 0) &&
2009 		    (((new_lower >= dev_priv->surfaces[i].lower) &&
2010 		      (new_lower < dev_priv->surfaces[i].upper)) ||
2011 		     ((new_lower < dev_priv->surfaces[i].lower) &&
2012 		      (new_upper > dev_priv->surfaces[i].lower)))) {
2029 		if ((dev_priv->surfaces[i].refcount == 1) &&
2030 		    (new->flags == dev_priv->surfaces[i].flags) &&
2031 		    (new_upper + 1 == dev_priv->surfaces[i].lower)) {
2038 			dev_priv->surfaces[i].refcount++;
2039 			dev_priv->surfaces[i].lower = s->lower;
2045 		if ((dev_priv->surfaces[i].refcount == 1) &&
2046 		    (new->flags == dev_priv->surfaces[i].flags) &&
2047 		    (new_lower == dev_priv->surfaces[i].upper + 1)) {
2054 			dev_priv->surfaces[i].refcount++;
2055 			dev_priv->surfaces[i].upper = s->upper;
2063 		if (dev_priv->surfaces[i].refcount == 0) {
2070 			dev_priv->surfaces[i].refcount = 1;
2071 			dev_priv->surfaces[i].lower = s->lower;
2072 			dev_priv->surfaces[i].upper = s->upper;
2073 			dev_priv->surfaces[i].flags = s->flags;
2095 				if (dev_priv->surfaces[s->surface_index].
2097 					dev_priv->surfaces[s->surface_index].
2100 				if (dev_priv->surfaces[s->surface_index].
2102 					dev_priv->surfaces[s->surface_index].
2105 				dev_priv->surfaces[s->surface_index].refcount--;
2106 				if (dev_priv->surfaces[s->surface_index].
2108 					dev_priv->surfaces[s->surface_index].
3182  *    - Free any alloced radeon surfaces.