summaryrefslogtreecommitdiffstats
path: root/common/rfb/PixelFormat.inl
blob: 5743e4955b217aa277cffad86b85d4bbb52b75d4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
/* Copyright 2009-2014 Pierre Ossman for Cendio AB
 * 
 * This is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 * 
 * This software is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with this software; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307,
 * USA.
 */

namespace rfb {


inline Pixel PixelFormat::pixelFromBuffer(const rdr::U8* buffer) const
{
  Pixel p;

  p = 0;

  if (bigEndian) {
    switch (bpp) {
    case 32:
      p |= ((Pixel)*(buffer++)) << 24;
      p |= ((Pixel)*(buffer++)) << 16;
    case 16:
      p |= ((Pixel)*(buffer++)) << 8;
    case 8:
      p |= *buffer;
    }
  } else {
    p |= buffer[0];
    if (bpp >= 16) {
      p |= ((Pixel)buffer[1]) << 8;
      if (bpp == 32) {
        p |= ((Pixel)buffer[2]) << 16;
        p |= ((Pixel)buffer[3]) << 24;
      }
    }
  }

  return p;
}


inline void PixelFormat::bufferFromPixel(rdr::U8* buffer, Pixel p) const
{
  if (bigEndian) {
    switch (bpp) {
    case 32:
      *(buffer++) = (p >> 24) & 0xff;
      *(buffer++) = (p >> 16) & 0xff;
    case 16:
      *(buffer++) = (p >>  8) & 0xff;
    case 8:
      *(buffer++) = (p >>  0) & 0xff;
    }
  } else {
    buffer[0] = (p >>  0) & 0xff;
    if (bpp >= 16) {
      buffer[1] = (p >>  8) & 0xff;
      if (bpp == 32) {
        buffer[2] = (p >> 16) & 0xff;
        buffer[3] = (p >> 24) & 0xff;
      }
    }
  }
}


inline void PixelFormat::rgbFromPixel(Pixel p, ColourMap* cm, rdr::U16 *r, rdr::U16 *g, rdr::U16 *b) const
{
  if (trueColour) {
    int mb, rb, gb, bb;

    /* Bit replication is much cheaper than multiplication and division */

    mb = minBits;
    rb = redBits;
    gb = greenBits;
    bb = blueBits;

    *r = (p >> redShift) << (16 - rb);
    *g = (p >> greenShift) << (16 - gb);
    *b = (p >> blueShift) << (16 - bb);

    while (mb < 16) {
      *r = *r | (*r >> rb);
      *g = *g | (*g >> gb);
      *b = *b | (*b >> bb);
      mb <<= 1;
      rb <<= 1;
      gb <<= 1;
      bb <<= 1;
    }
  } else if (cm) {
    int ir, ig, ib;
    cm->lookup(p, &ir, &ig, &ib);
    *r = ir;
    *g = ig;
    *b = ib;
  } else {
    // XXX just return 0 for colour map?
    *r = 0;
    *g = 0;
    *b = 0;
  }
}


inline void PixelFormat::rgbFromPixel(Pixel p, ColourMap* cm, rdr::U8 *r, rdr::U8 *g, rdr::U8 *b) const
{
  if (trueColour) {
    int mb, rb, gb, bb;

    /* Bit replication is much cheaper than multiplication and division */

    mb = minBits;
    rb = redBits;
    gb = greenBits;
    bb = blueBits;

    *r = (p >> redShift) << (8 - rb);
    *g = (p >> greenShift) << (8 - gb);
    *b = (p >> blueShift) << (8 - bb);

    while (mb < 8) {
      *r = *r | (*r >> rb);
      *g = *g | (*g >> gb);
      *b = *b | (*b >> bb);
      mb <<= 1;
      rb <<= 1;
      gb <<= 1;
      bb <<= 1;
    }
  } else {
    rdr::U16 r2, g2, b2;

    rgbFromPixel(p, cm, &r2, &g2, &b2);

    *r = r2 >> 8;
    *g = g2 >> 8;
    *b = b2 >> 8;
  }
}


}