libavcodec/rectangle.h

   1 /*
   2  * rectangle filling function
   3  * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
   4  *
   5  * This file is part of Libav.
   6  *
   7  * Libav is free software; you can redistribute it and/or
   8  * modify it under the terms of the GNU Lesser General Public
   9  * License as published by the Free Software Foundation; either
  10  * version 2.1 of the License, or (at your option) any later version.
  11  *
  12  * Libav is distributed in the hope that it will be useful,
  13  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  15  * Lesser General Public License for more details.
  16  *
  17  * You should have received a copy of the GNU Lesser General Public
  18  * License along with Libav; if not, write to the Free Software
  19  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20  */
  21
  22 /**
  23  * @file
  24  * useful rectangle filling function
  25  * @author Michael Niedermayer <michaelni@gmx.at>
  26  */
  27
  28 #ifndef AVCODEC_RECTANGLE_H
  29 #define AVCODEC_RECTANGLE_H
  30
  31 #include <assert.h>
  32 #include "config.h"
  33 #include "libavutil/common.h"
  34
  35 /**
  36  * fill a rectangle.
  37  * @param h height of the rectangle, should be a constant
  38  * @param w width of the rectangle, should be a constant
  39  * @param size the size of val (1, 2 or 4), should be a constant
  40  */
  41 static av_always_inline void fill_rectangle(void *vp, int w, int h, int stride, uint32_t val, int size){
  42     uint8_t *p= (uint8_t*)vp;
  43     assert(size==1 || size==2 || size==4);
  44     assert(w<=4);
  45
  46     w      *= size;
  47     stride *= size;
  48
  49     assert((stride&(w-1))==0);
  50     if(w==2){
  51         const uint16_t v= size==4 ? val : val*0x0101;
  52         *(uint16_t*)(p + 0*stride)= v;
  53         if(h==1) return;
  54         *(uint16_t*)(p + 1*stride)= v;
  55         if(h==2) return;
  56         *(uint16_t*)(p + 2*stride)= v;
  57         *(uint16_t*)(p + 3*stride)= v;
  58     }else if(w==4){
  59         const uint32_t v= size==4 ? val : size==2 ? val*0x00010001 : val*0x01010101;
  60         *(uint32_t*)(p + 0*stride)= v;
  61         if(h==1) return;
  62         *(uint32_t*)(p + 1*stride)= v;
  63         if(h==2) return;
  64         *(uint32_t*)(p + 2*stride)= v;
  65         *(uint32_t*)(p + 3*stride)= v;
  66     }else if(w==8){
  67     //gcc can't optimize 64bit math on x86_32
  68 #if HAVE_FAST_64BIT
  69         const uint64_t v=  size==2 ? val*0x0001000100010001ULL : val*0x0100000001ULL;
  70         *(uint64_t*)(p + 0*stride)= v;
  71         if(h==1) return;
  72         *(uint64_t*)(p + 1*stride)= v;
  73         if(h==2) return;
  74         *(uint64_t*)(p + 2*stride)= v;
  75         *(uint64_t*)(p + 3*stride)= v;
  76     }else if(w==16){
  77         const uint64_t v= val*0x0100000001ULL;
  78         *(uint64_t*)(p + 0+0*stride)= v;
  79         *(uint64_t*)(p + 8+0*stride)= v;
  80         *(uint64_t*)(p + 0+1*stride)= v;
  81         *(uint64_t*)(p + 8+1*stride)= v;
  82         if(h==2) return;
  83         *(uint64_t*)(p + 0+2*stride)= v;
  84         *(uint64_t*)(p + 8+2*stride)= v;
  85         *(uint64_t*)(p + 0+3*stride)= v;
  86         *(uint64_t*)(p + 8+3*stride)= v;
  87 #else
  88         const uint32_t v= size==2 ? val*0x00010001 : val;
  89         *(uint32_t*)(p + 0+0*stride)= v;
  90         *(uint32_t*)(p + 4+0*stride)= v;
  91         if(h==1) return;
  92         *(uint32_t*)(p + 0+1*stride)= v;
  93         *(uint32_t*)(p + 4+1*stride)= v;
  94         if(h==2) return;
  95         *(uint32_t*)(p + 0+2*stride)= v;
  96         *(uint32_t*)(p + 4+2*stride)= v;
  97         *(uint32_t*)(p + 0+3*stride)= v;
  98         *(uint32_t*)(p + 4+3*stride)= v;
  99     }else if(w==16){
 100         *(uint32_t*)(p + 0+0*stride)= val;
 101         *(uint32_t*)(p + 4+0*stride)= val;
 102         *(uint32_t*)(p + 8+0*stride)= val;
 103         *(uint32_t*)(p +12+0*stride)= val;
 104         *(uint32_t*)(p + 0+1*stride)= val;
 105         *(uint32_t*)(p + 4+1*stride)= val;
 106         *(uint32_t*)(p + 8+1*stride)= val;
 107         *(uint32_t*)(p +12+1*stride)= val;
 108         if(h==2) return;
 109         *(uint32_t*)(p + 0+2*stride)= val;
 110         *(uint32_t*)(p + 4+2*stride)= val;
 111         *(uint32_t*)(p + 8+2*stride)= val;
 112         *(uint32_t*)(p +12+2*stride)= val;
 113         *(uint32_t*)(p + 0+3*stride)= val;
 114         *(uint32_t*)(p + 4+3*stride)= val;
 115         *(uint32_t*)(p + 8+3*stride)= val;
 116         *(uint32_t*)(p +12+3*stride)= val;
 117 #endif
 118     }else
 119         assert(0);
 120     assert(h==4);
 121 }
 122
 123 #endif /* AVCODEC_RECTANGLE_H */