Pierre Ossman | 6e5cd5d | 2014-02-28 11:54:34 +0100 | [diff] [blame] | 1 | /* Copyright 2009-2014 Pierre Ossman for Cendio AB |
Pierre Ossman | 67b2b2f | 2009-03-06 10:12:55 +0000 | [diff] [blame] | 2 | * |
| 3 | * This is free software; you can redistribute it and/or modify |
| 4 | * it under the terms of the GNU General Public License as published by |
| 5 | * the Free Software Foundation; either version 2 of the License, or |
| 6 | * (at your option) any later version. |
| 7 | * |
| 8 | * This software is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 11 | * GNU General Public License for more details. |
| 12 | * |
| 13 | * You should have received a copy of the GNU General Public License |
| 14 | * along with this software; if not, write to the Free Software |
| 15 | * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, |
| 16 | * USA. |
| 17 | */ |
| 18 | |
| 19 | namespace rfb { |
| 20 | |
| 21 | |
| 22 | inline Pixel PixelFormat::pixelFromBuffer(const rdr::U8* buffer) const |
| 23 | { |
| 24 | Pixel p; |
| 25 | |
| 26 | p = 0; |
| 27 | |
| 28 | if (bigEndian) { |
| 29 | switch (bpp) { |
| 30 | case 32: |
| 31 | p |= ((Pixel)*(buffer++)) << 24; |
| 32 | p |= ((Pixel)*(buffer++)) << 16; |
| 33 | case 16: |
| 34 | p |= ((Pixel)*(buffer++)) << 8; |
| 35 | case 8: |
| 36 | p |= *buffer; |
| 37 | } |
| 38 | } else { |
| 39 | p |= buffer[0]; |
| 40 | if (bpp >= 16) { |
| 41 | p |= ((Pixel)buffer[1]) << 8; |
Pierre Ossman | 67e7b29 | 2009-03-09 09:52:54 +0000 | [diff] [blame] | 42 | if (bpp == 32) { |
Pierre Ossman | 67b2b2f | 2009-03-06 10:12:55 +0000 | [diff] [blame] | 43 | p |= ((Pixel)buffer[2]) << 16; |
Pierre Ossman | 67e7b29 | 2009-03-09 09:52:54 +0000 | [diff] [blame] | 44 | p |= ((Pixel)buffer[3]) << 24; |
| 45 | } |
Pierre Ossman | 67b2b2f | 2009-03-06 10:12:55 +0000 | [diff] [blame] | 46 | } |
| 47 | } |
| 48 | |
| 49 | return p; |
| 50 | } |
| 51 | |
| 52 | |
Pierre Ossman | 19501b8 | 2009-03-31 14:06:53 +0000 | [diff] [blame] | 53 | inline void PixelFormat::bufferFromPixel(rdr::U8* buffer, Pixel p) const |
| 54 | { |
| 55 | if (bigEndian) { |
| 56 | switch (bpp) { |
| 57 | case 32: |
| 58 | *(buffer++) = (p >> 24) & 0xff; |
| 59 | *(buffer++) = (p >> 16) & 0xff; |
| 60 | case 16: |
| 61 | *(buffer++) = (p >> 8) & 0xff; |
| 62 | case 8: |
| 63 | *(buffer++) = (p >> 0) & 0xff; |
| 64 | } |
| 65 | } else { |
| 66 | buffer[0] = (p >> 0) & 0xff; |
| 67 | if (bpp >= 16) { |
| 68 | buffer[1] = (p >> 8) & 0xff; |
| 69 | if (bpp == 32) { |
| 70 | buffer[2] = (p >> 16) & 0xff; |
| 71 | buffer[3] = (p >> 24) & 0xff; |
| 72 | } |
| 73 | } |
| 74 | } |
| 75 | } |
| 76 | |
| 77 | |
Pierre Ossman | 8b874e4 | 2014-01-20 17:23:51 +0100 | [diff] [blame^] | 78 | inline Pixel PixelFormat::pixelFromRGB(rdr::U16 red, rdr::U16 green, rdr::U16 blue, ColourMap* cm) const |
| 79 | { |
| 80 | if (trueColour) { |
| 81 | Pixel p; |
| 82 | |
| 83 | /* We don't need to mask since we shift out unwanted bits */ |
| 84 | p = ((Pixel)red >> (16 - redBits)) << redShift; |
| 85 | p |= ((Pixel)green >> (16 - greenBits)) << greenShift; |
| 86 | p |= ((Pixel)blue >> (16 - blueBits)) << blueShift; |
| 87 | } else if (cm) { |
| 88 | // Try to find the closest pixel by Cartesian distance |
| 89 | int colours = 1 << depth; |
| 90 | int diff = 256 * 256 * 4; |
| 91 | int col = 0; |
| 92 | for (int i=0; i<colours; i++) { |
| 93 | int r, g, b; |
| 94 | cm->lookup(i, &r, &g, &b); |
| 95 | int rd = (r-red) >> 8; |
| 96 | int gd = (g-green) >> 8; |
| 97 | int bd = (b-blue) >> 8; |
| 98 | int d = rd*rd + gd*gd + bd*bd; |
| 99 | if (d < diff) { |
| 100 | col = i; |
| 101 | diff = d; |
| 102 | } |
| 103 | } |
| 104 | return col; |
| 105 | } else { |
| 106 | // XXX just return 0 for colour map? |
| 107 | return 0; |
| 108 | } |
| 109 | } |
| 110 | |
| 111 | |
| 112 | inline Pixel PixelFormat::pixelFromRGB(rdr::U8 red, rdr::U8 green, rdr::U8 blue, ColourMap* cm) const |
| 113 | { |
| 114 | if (trueColour) { |
| 115 | Pixel p; |
| 116 | |
| 117 | p = ((Pixel)red >> (8 - redBits)) << redShift; |
| 118 | p |= ((Pixel)green >> (8 - greenBits)) << greenShift; |
| 119 | p |= ((Pixel)blue >> (8 - blueBits)) << blueShift; |
| 120 | |
| 121 | return p; |
| 122 | } else { |
| 123 | return pixelFromRGB((rdr::U16)(red << 8 | red), |
| 124 | (rdr::U16)(green << 8 | green), |
| 125 | (rdr::U16)(blue << 8 | blue), cm); |
| 126 | } |
| 127 | } |
| 128 | |
| 129 | |
Pierre Ossman | 67b2b2f | 2009-03-06 10:12:55 +0000 | [diff] [blame] | 130 | inline void PixelFormat::rgbFromPixel(Pixel p, ColourMap* cm, rdr::U16 *r, rdr::U16 *g, rdr::U16 *b) const |
| 131 | { |
| 132 | if (trueColour) { |
Pierre Ossman | 6e5cd5d | 2014-02-28 11:54:34 +0100 | [diff] [blame] | 133 | int mb, rb, gb, bb; |
| 134 | |
| 135 | /* Bit replication is much cheaper than multiplication and division */ |
| 136 | |
| 137 | mb = minBits; |
| 138 | rb = redBits; |
| 139 | gb = greenBits; |
| 140 | bb = blueBits; |
| 141 | |
| 142 | *r = (p >> redShift) << (16 - rb); |
| 143 | *g = (p >> greenShift) << (16 - gb); |
| 144 | *b = (p >> blueShift) << (16 - bb); |
| 145 | |
| 146 | while (mb < 16) { |
| 147 | *r = *r | (*r >> rb); |
| 148 | *g = *g | (*g >> gb); |
| 149 | *b = *b | (*b >> bb); |
| 150 | mb <<= 1; |
| 151 | rb <<= 1; |
| 152 | gb <<= 1; |
| 153 | bb <<= 1; |
| 154 | } |
Pierre Ossman | 67b2b2f | 2009-03-06 10:12:55 +0000 | [diff] [blame] | 155 | } else if (cm) { |
| 156 | int ir, ig, ib; |
| 157 | cm->lookup(p, &ir, &ig, &ib); |
| 158 | *r = ir; |
| 159 | *g = ig; |
| 160 | *b = ib; |
| 161 | } else { |
| 162 | // XXX just return 0 for colour map? |
| 163 | *r = 0; |
| 164 | *g = 0; |
| 165 | *b = 0; |
| 166 | } |
| 167 | } |
| 168 | |
| 169 | |
| 170 | inline void PixelFormat::rgbFromPixel(Pixel p, ColourMap* cm, rdr::U8 *r, rdr::U8 *g, rdr::U8 *b) const |
| 171 | { |
| 172 | if (trueColour) { |
Pierre Ossman | 6e5cd5d | 2014-02-28 11:54:34 +0100 | [diff] [blame] | 173 | int mb, rb, gb, bb; |
| 174 | |
| 175 | /* Bit replication is much cheaper than multiplication and division */ |
| 176 | |
| 177 | mb = minBits; |
| 178 | rb = redBits; |
| 179 | gb = greenBits; |
| 180 | bb = blueBits; |
| 181 | |
| 182 | *r = (p >> redShift) << (8 - rb); |
| 183 | *g = (p >> greenShift) << (8 - gb); |
| 184 | *b = (p >> blueShift) << (8 - bb); |
| 185 | |
| 186 | while (mb < 8) { |
| 187 | *r = *r | (*r >> rb); |
| 188 | *g = *g | (*g >> gb); |
| 189 | *b = *b | (*b >> bb); |
| 190 | mb <<= 1; |
| 191 | rb <<= 1; |
| 192 | gb <<= 1; |
| 193 | bb <<= 1; |
| 194 | } |
Pierre Ossman | 67b2b2f | 2009-03-06 10:12:55 +0000 | [diff] [blame] | 195 | } else { |
| 196 | rdr::U16 r2, g2, b2; |
| 197 | |
| 198 | rgbFromPixel(p, cm, &r2, &g2, &b2); |
| 199 | |
| 200 | *r = r2 >> 8; |
| 201 | *g = g2 >> 8; |
| 202 | *b = b2 >> 8; |
| 203 | } |
| 204 | } |
| 205 | |
| 206 | |
| 207 | } |
| 208 | |