blob: 932221d445100db240777e03d480c01e1a13b705 [file] [log] [blame]
george82f891ccd2005-12-03 07:30:51 +00001/* Copyright (C) 2005 TightVNC Team. All Rights Reserved.
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// -=- ScaledPixelBuffer.cxx
20
21#include <rfb/ScaledPixelBuffer.h>
22
23#include <math.h>
24#include <memory.h>
25
26using namespace rdr;
27using namespace rfb;
28
29ScaledPixelBuffer::ScaledPixelBuffer(U8 *src_data_, int src_width_,
30 int src_height_, int scale)
31 : src_data(src_data_), src_width(src_width_), src_height(src_height_),
32 bpp(32), data(0) {
33
34 scale_ratio = double(scale) / 100;
35
36 width_ = (int)ceil(src_width * scale_ratio);
37 height_ = (int)ceil(src_height * scale_ratio);
38
39 data = new U8[width_ * height_ * 4];
40}
41
42ScaledPixelBuffer::~ScaledPixelBuffer() {
43 delete [] data;
44}
45
46const U8* ScaledPixelBuffer::getPixelsR(const Rect& r, int* stride) {
47 *stride = getStride();
48 return &data[(r.tl.x + (r.tl.y * *stride)) * bpp/8];
49}
50
51void ScaledPixelBuffer::getImage(void* imageBuf, const Rect& r, int outStride) {
52 int inStride;
53 const U8* pixels_data = getPixelsR(r, &inStride);
54 // We assume that the specified rectangle is pre-clipped to the buffer
55 int bytesPerPixel = bpp/8;
56 int inBytesPerRow = inStride * bytesPerPixel;
57 if (!outStride) outStride = r.width();
58 int outBytesPerRow = outStride * bytesPerPixel;
59 int bytesPerMemCpy = r.width() * bytesPerPixel;
60 U8* imageBufPos = (U8*)imageBuf;
61 const U8* end = pixels_data + (inBytesPerRow * r.height());
62 while (pixels_data < end) {
63 memcpy(imageBufPos, pixels_data, bytesPerMemCpy);
64 imageBufPos += outBytesPerRow;
65 pixels_data += inBytesPerRow;
66 }
67}
68
69void ScaledPixelBuffer::setScale(int scale) {
70 if (scale != scale_ratio * 100) {
71 scale_ratio = double(scale) / 100;
72
73 width_ = (int)ceil(src_width * scale_ratio);
74 height_ = (int)ceil(src_height * scale_ratio);
75
76 delete [] data;
77 data = new U8[width_ * height_ * 4];
78
79 scaleRect(Rect(0, 0, width_, height_));
80 }
81}
82
83void ScaledPixelBuffer::scaleRect(const Rect& r) {
84 static U8 *src_ptr, *ptr;
85 static U8 r0, r1, r2, r3;
86 static U8 g0, g1, g2, g3;
87 static U8 b0, b1, b2, b3;
88 static double c1_sub_dx, c1_sub_dy;
89 static double x_start, x_end, y_start, y_end;
90 static double dx, dy;
91 static int i, j;
92
93 // Calculate the scale boundaries
94 x_start = vncmax(0, (r.tl.x-1) * scale_ratio);
95 (x_start==int(x_start)) ? true : x_start=(int)(x_start+1);
96 x_end = vncmin(width_ - 1, r.br.x * scale_ratio);
97 ((x_end==int(x_end))&&(x_end!=width_-1)&&(x_end>0)) ? x_end-=1:x_end=(int)(x_end);
98 y_start = vncmax(0, (r.tl.y-1) * scale_ratio);
99 (y_start==int(y_start)) ? true : y_start=(int)(y_start+1);
100 y_end = vncmin(height_ - 1, r.br.y * scale_ratio);
101 ((y_end==int(y_end))&&(y_end!=height_-1)&&(y_end>0)) ? y_end-=1:y_end=(int)(y_end);
102
103 // Scale the source rect to the destination image buffer using
104 // bilinear interplation
105 for (int y = (int)y_start; y <= y_end; y++) {
106 j = (int)(dy = y / scale_ratio);
107 dy -= j;
108 c1_sub_dy = 1 - dy;
109
110 for (int x = (int)x_start; x <= x_end; x++) {
111 ptr = &data[(x + y*width_) * 4];
112
113 i = (int)(dx = x / scale_ratio);
114 dx -= i;
115 c1_sub_dx = 1 - dx;
116
117 src_ptr = &src_data[(i + (j*src_width))*4];
118 b0 = *src_ptr; g0 = *(src_ptr+1); r0 = *(src_ptr+2);
119 if (i+1 < src_width) {
120 b1 = *(src_ptr+4); g1 = *(src_ptr+5); r1 = *(src_ptr+6);
121 } else {
122 b1 = b0; r1 = r0; g1 = g0;
123 }
124 if (j+1 < src_height) {
125 src_ptr += src_width * 4;
126 b3 = *src_ptr; g3 = *(src_ptr+1); r3 = *(src_ptr+2);
127 } else {
128 b3 = b0; r3 = r0; g3 = g0;
129 }
130 if ((i+1 < src_width) && (j+1 < src_height)) {
131 b2 = *(src_ptr+4); g2 = *(src_ptr+5); r2 = *(src_ptr+6);
132 } else if (i+1 >= src_width) {
133 b2 = b3; r2 = r3; g2 = g3;
134 } else {
135 b2 = b1; r2 = r1; g2 = g1;
136 }
137 *ptr++ = (U8)((b0*c1_sub_dx+b1*dx)*c1_sub_dy + (b3*c1_sub_dx+b2*dx)*dy);
138 *ptr++ = (U8)((g0*c1_sub_dx+g1*dx)*c1_sub_dy + (g3*c1_sub_dx+g2*dx)*dy);
139 *ptr = (U8)((r0*c1_sub_dx+r1*dx)*c1_sub_dy + (r3*c1_sub_dx+r2*dx)*dy);
140 }
141 }
142}