/* * Copyright © 2010 Intel Corporation * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice (including the next * paragraph) shall be included in all copies or substantial portions of the * Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE * SOFTWARE. * * Authors: * Chris Wilson * */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #include "sna.h" #include "sna_render.h" #define xFixedToDouble(f) pixman_fixed_to_double(f) bool sna_gradient_is_opaque(const PictGradient *gradient) { int n; for (n = 0; n < gradient->nstops; n++) { if (gradient->stops[n].color.alpha < 0xff00) return false; } return true; } static int sna_gradient_sample_width(PictGradient *gradient) { int n, width; width = 0; for (n = 1; n < gradient->nstops; n++) { xFixed dx = gradient->stops[n].x - gradient->stops[n-1].x; int delta, max, ramp; if (dx == 0) return 1024; max = gradient->stops[n].color.red - gradient->stops[n-1].color.red; if (max < 0) max = -max; delta = gradient->stops[n].color.green - gradient->stops[n-1].color.green; if (delta < 0) delta = -delta; if (delta > max) max = delta; delta = gradient->stops[n].color.blue - gradient->stops[n-1].color.blue; if (delta < 0) delta = -delta; if (delta > max) max = delta; delta = gradient->stops[n].color.alpha - gradient->stops[n-1].color.alpha; if (delta < 0) delta = -delta; if (delta > max) max = delta; ramp = 256 * max / dx; if (ramp > width) width = ramp; } if (width == 0) return 1; width = (width + 7) & -8; return min(width, 1024); } static bool _gradient_color_stops_equal(PictGradient *pattern, struct sna_gradient_cache *cache) { if (cache->nstops != pattern->nstops) return false; return memcmp(cache->stops, pattern->stops, sizeof(PictGradientStop)*cache->nstops) == 0; } struct kgem_bo * sna_render_get_gradient(struct sna *sna, PictGradient *pattern) { struct sna_render *render = &sna->render; struct sna_gradient_cache *cache; pixman_image_t *gradient, *image; pixman_point_fixed_t p1, p2; int i, width; struct kgem_bo *bo; DBG(("%s: %dx[%f:%x ... %f:%x ... %f:%x]\n", __FUNCTION__, pattern->nstops, pattern->stops[0].x / 65536., pattern->stops[0].color.alpha >> 8 << 24 | pattern->stops[0].color.red >> 8 << 16 | pattern->stops[0].color.green >> 8 << 8 | pattern->stops[0].color.blue >> 8 << 0, pattern->stops[pattern->nstops/2].x / 65536., pattern->stops[pattern->nstops/2].color.alpha >> 8 << 24 | pattern->stops[pattern->nstops/2].color.red >> 8 << 16 | pattern->stops[pattern->nstops/2].color.green >> 8 << 8 | pattern->stops[pattern->nstops/2].color.blue >> 8 << 0, pattern->stops[pattern->nstops-1].x / 65536., pattern->stops[pattern->nstops-1].color.alpha >> 8 << 24 | pattern->stops[pattern->nstops-1].color.red >> 8 << 16 | pattern->stops[pattern->nstops-1].color.green >> 8 << 8 | pattern->stops[pattern->nstops-1].color.blue >> 8 << 0)); for (i = 0; i < render->gradient_cache.size; i++) { cache = &render->gradient_cache.cache[i]; if (_gradient_color_stops_equal(pattern, cache)) { DBG(("%s: old --> %d\n", __FUNCTION__, i)); return kgem_bo_reference(cache->bo); } } width = sna_gradient_sample_width(pattern); DBG(("%s: sample width = %d\n", __FUNCTION__, width)); if (width == 0) return NULL; p1.x = 0; p1.y = 0; p2.x = width << 16; p2.y = 0; gradient = pixman_image_create_linear_gradient(&p1, &p2, (pixman_gradient_stop_t *)pattern->stops, pattern->nstops); if (gradient == NULL) return NULL; pixman_image_set_filter(gradient, PIXMAN_FILTER_BILINEAR, NULL, 0); pixman_image_set_repeat(gradient, PIXMAN_REPEAT_PAD); image = pixman_image_create_bits(PIXMAN_a8r8g8b8, width, 1, NULL, 0); if (image == NULL) { pixman_image_unref(gradient); return NULL; } pixman_image_composite(PIXMAN_OP_SRC, gradient, NULL, image, 0, 0, 0, 0, 0, 0, width, 1); pixman_image_unref(gradient); DBG(("%s: [0]=%x, [%d]=%x [%d]=%x\n", __FUNCTION__, pixman_image_get_data(image)[0], width/2, pixman_image_get_data(image)[width/2], width-1, pixman_image_get_data(image)[width-1])); bo = kgem_create_linear(&sna->kgem, width*4, 0); if (!bo) { pixman_image_unref(image); return NULL; } bo->pitch = 4*width; kgem_bo_write(&sna->kgem, bo, pixman_image_get_data(image), 4*width); pixman_image_unref(image); if (render->gradient_cache.size < GRADIENT_CACHE_SIZE) i = render->gradient_cache.size++; else i = rand () % GRADIENT_CACHE_SIZE; cache = &render->gradient_cache.cache[i]; if (cache->nstops < pattern->nstops) { PictGradientStop *newstops; newstops = malloc(sizeof(PictGradientStop) * pattern->nstops); if (newstops == NULL) return bo; free(cache->stops); cache->stops = newstops; } memcpy(cache->stops, pattern->stops, sizeof(PictGradientStop) * pattern->nstops); cache->nstops = pattern->nstops; if (cache->bo) kgem_bo_destroy(&sna->kgem, cache->bo); cache->bo = kgem_bo_reference(bo); return bo; } void sna_render_flush_solid(struct sna *sna) { struct sna_solid_cache *cache = &sna->render.solid_cache; DBG(("sna_render_flush_solid(size=%d)\n", cache->size)); assert(cache->dirty); assert(cache->size); assert(cache->size <= 1024); kgem_bo_write(&sna->kgem, cache->cache_bo, cache->color, cache->size*sizeof(uint32_t)); cache->dirty = 0; } static void sna_render_finish_solid(struct sna *sna, bool force) { struct sna_solid_cache *cache = &sna->render.solid_cache; struct kgem_bo *old; int i; DBG(("sna_render_finish_solid(force=%d, domain=%d, busy=%d, dirty=%d, size=%d)\n", force, cache->cache_bo->domain, cache->cache_bo->rq != NULL, cache->dirty, cache->size)); if (!force && cache->cache_bo->domain != DOMAIN_GPU) return; if (cache->dirty) sna_render_flush_solid(sna); for (i = 0; i < cache->size; i++) { if (cache->bo[i] == NULL) continue; kgem_bo_destroy(&sna->kgem, cache->bo[i]); cache->bo[i] = NULL; } DBG(("sna_render_finish_solid reset\n")); old = cache->cache_bo; cache->cache_bo = kgem_create_linear(&sna->kgem, sizeof(cache->color), 0); if (cache->cache_bo == NULL) { cache->cache_bo = old; old = NULL; } if (force) cache->size = 0; if (cache->last < cache->size) { cache->bo[cache->last] = kgem_create_proxy(&sna->kgem, cache->cache_bo, cache->last*sizeof(uint32_t), sizeof(uint32_t)); if (cache->bo[cache->last]) cache->bo[cache->last]->pitch = 4; else cache->last = 1024; } if (old) kgem_bo_destroy(&sna->kgem, old); } struct kgem_bo * sna_render_get_solid(struct sna *sna, uint32_t color) { struct sna_solid_cache *cache = &sna->render.solid_cache; int i; DBG(("%s: %08x\n", __FUNCTION__, color)); if ((color & 0xffffff) == 0) /* alpha only */ return kgem_bo_reference(sna->render.alpha_cache.bo[color>>24]); if (color == 0xffffffff) { DBG(("%s(white)\n", __FUNCTION__)); return kgem_bo_reference(sna->render.alpha_cache.bo[255+7]); } if ((color >> 24) == 0xff) { int v = 0; if (((color >> 16) & 0xff) == 0) v |= 0; else if (((color >> 16) & 0xff) == 0xff) v |= 1 << 2; else v = -1; if (((color >> 8) & 0xff) == 0) v |= 0; else if (((color >> 8) & 0xff) == 0xff) v |= 1 << 1; else v = -1; if (((color >> 0) & 0xff) == 0) v |= 0; else if (((color >> 0) & 0xff) == 0xff) v |= 1 << 0; else v = -1; if (v >= 0) { DBG(("%s(primary (%d,%d,%d): %d)\n", __FUNCTION__, v & 4, v & 2, v & 1, v)); return kgem_bo_reference(sna->render.alpha_cache.bo[255+v]); } } if (cache->color[cache->last] == color) { DBG(("sna_render_get_solid(%d) = %x (last)\n", cache->last, color)); return kgem_bo_reference(cache->bo[cache->last]); } for (i = 0; i < cache->size; i++) { if (cache->color[i] == color) { if (cache->bo[i] == NULL) { DBG(("sna_render_get_solid(%d) = %x (recreate)\n", i, color)); goto create; } else { DBG(("sna_render_get_solid(%d) = %x (old)\n", i, color)); goto done; } } } sna_render_finish_solid(sna, i == ARRAY_SIZE(cache->color)); i = cache->size++; assert(i < ARRAY_SIZE(cache->color)); cache->color[i] = color; cache->dirty = 1; DBG(("sna_render_get_solid(%d) = %x (new)\n", i, color)); create: cache->bo[i] = kgem_create_proxy(&sna->kgem, cache->cache_bo, i*sizeof(uint32_t), sizeof(uint32_t)); cache->bo[i]->pitch = 4; done: cache->last = i; return kgem_bo_reference(cache->bo[i]); } static bool sna_alpha_cache_init(struct sna *sna) { struct sna_alpha_cache *cache = &sna->render.alpha_cache; uint32_t color[256 + 7]; int i; DBG(("%s\n", __FUNCTION__)); cache->cache_bo = kgem_create_linear(&sna->kgem, sizeof(color), 0); if (!cache->cache_bo) return false; for (i = 0; i < 256; i++) { color[i] = i << 24; cache->bo[i] = kgem_create_proxy(&sna->kgem, cache->cache_bo, sizeof(uint32_t)*i, sizeof(uint32_t)); if (cache->bo[i] == NULL) return false; cache->bo[i]->pitch = 4; } /* primary */ for (i = 1; i < 8; i++) { int j = 255+i; color[j] = 0xff << 24; if (i & 1) color[j] |= 0xff << 0; if (i & 2) color[j] |= 0xff << 8; if (i & 4) color[j] |= 0xff << 16; cache->bo[j] = kgem_create_proxy(&sna->kgem, cache->cache_bo, sizeof(uint32_t)*j, sizeof(uint32_t)); if (cache->bo[j] == NULL) return false; cache->bo[j]->pitch = 4; } return kgem_bo_write(&sna->kgem, cache->cache_bo, color, sizeof(color)); } static bool sna_solid_cache_init(struct sna *sna) { struct sna_solid_cache *cache = &sna->render.solid_cache; DBG(("%s\n", __FUNCTION__)); cache->cache_bo = kgem_create_linear(&sna->kgem, 4096, 0); if (!cache->cache_bo) return false; cache->last = 0; cache->color[cache->last] = 0; cache->dirty = 0; cache->size = 0; return true; } bool sna_gradients_create(struct sna *sna) { DBG(("%s\n", __FUNCTION__)); if (unlikely(sna->kgem.wedged)) return true; if (!sna_alpha_cache_init(sna)) return false; if (!sna_solid_cache_init(sna)) return false; return true; } void sna_gradients_close(struct sna *sna) { int i; DBG(("%s\n", __FUNCTION__)); for (i = 0; i < 256; i++) { if (sna->render.alpha_cache.bo[i]) { kgem_bo_destroy(&sna->kgem, sna->render.alpha_cache.bo[i]); sna->render.alpha_cache.bo[i] = NULL; } } if (sna->render.alpha_cache.cache_bo) { kgem_bo_destroy(&sna->kgem, sna->render.alpha_cache.cache_bo); sna->render.alpha_cache.cache_bo = NULL; } if (sna->render.solid_cache.cache_bo) kgem_bo_destroy(&sna->kgem, sna->render.solid_cache.cache_bo); for (i = 0; i < sna->render.solid_cache.size; i++) { if (sna->render.solid_cache.bo[i]) kgem_bo_destroy(&sna->kgem, sna->render.solid_cache.bo[i]); } sna->render.solid_cache.cache_bo = 0; sna->render.solid_cache.size = 0; sna->render.solid_cache.dirty = 0; for (i = 0; i < sna->render.gradient_cache.size; i++) { struct sna_gradient_cache *cache = &sna->render.gradient_cache.cache[i]; if (cache->bo) kgem_bo_destroy(&sna->kgem, cache->bo); free(cache->stops); cache->stops = NULL; cache->nstops = 0; } sna->render.gradient_cache.size = 0; }