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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <limits.h>
#include <vcl/bitmapaccess.hxx>
#include "octree.hxx"
#include "impoctree.hxx"
static const sal_uInt8 pImplMask[8] = { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 };
ImpNodeCache::ImpNodeCache( const sal_uLong nInitSize ) :
pActNode( nullptr )
{
const sal_uLong nSize = nInitSize + 4;
for( sal_uLong i = 0; i < nSize; i++ )
{
OctreeNode* pNewNode = new NODE;
pNewNode->pNextInCache = pActNode;
pActNode = pNewNode;
}
}
ImpNodeCache::~ImpNodeCache()
{
while( pActNode )
{
OctreeNode* pNode = pActNode;
pActNode = pNode->pNextInCache;
delete pNode;
}
}
Octree::Octree( const BitmapReadAccess& rReadAcc, sal_uLong nColors ) :
nMax ( nColors ),
nLeafCount ( 0L ),
pTree ( nullptr ),
pAcc ( &rReadAcc )
{
pNodeCache = new ImpNodeCache( nColors );
memset( pReduce, 0, ( OCTREE_BITS + 1 ) * sizeof( NODE* ) );
ImplCreateOctree();
}
Octree::~Octree()
{
ImplDeleteOctree( &pTree );
delete pNodeCache;
}
void Octree::ImplCreateOctree()
{
if( !!*pAcc )
{
const long nWidth = pAcc->Width();
const long nHeight = pAcc->Height();
if( pAcc->HasPalette() )
{
for( long nY = 0; nY < nHeight; nY++ )
{
for( long nX = 0; nX < nWidth; nX++ )
{
pColor = &(BitmapColor&) pAcc->GetPaletteColor( pAcc->GetPixelIndex( nY, nX ) );
nLevel = 0L;
ImplAdd( &pTree );
while( nLeafCount > nMax )
ImplReduce();
}
}
}
else
{
BitmapColor aColor;
pColor = &aColor;
for( long nY = 0; nY < nHeight; nY++ )
{
for( long nX = 0; nX < nWidth; nX++ )
{
aColor = pAcc->GetPixel( nY, nX );
nLevel = 0L;
ImplAdd( &pTree );
while( nLeafCount > nMax )
ImplReduce();
}
}
}
}
}
void Octree::ImplDeleteOctree( NODE** ppNode )
{
for ( sal_uLong i = 0UL; i < 8UL; i++ )
{
if ( (*ppNode)->pChild[ i ] )
ImplDeleteOctree( &(*ppNode)->pChild[ i ] );
}
pNodeCache->ImplReleaseNode( *ppNode );
*ppNode = nullptr;
}
void Octree::ImplAdd( NODE** ppNode )
{
// possibly generate new nodes
if( !*ppNode )
{
*ppNode = pNodeCache->ImplGetFreeNode();
(*ppNode)->bLeaf = ( OCTREE_BITS == nLevel );
if( (*ppNode)->bLeaf )
nLeafCount++;
else
{
(*ppNode)->pNext = pReduce[ nLevel ];
pReduce[ nLevel ] = *ppNode;
}
}
if( (*ppNode)->bLeaf )
{
(*ppNode)->nCount++;
(*ppNode)->nRed += pColor->GetRed();
(*ppNode)->nGreen += pColor->GetGreen();
(*ppNode)->nBlue += pColor->GetBlue();
}
else
{
const sal_uLong nShift = 7 - nLevel;
const sal_uInt8 cMask = pImplMask[ nLevel ];
const sal_uLong nIndex = ( ( ( pColor->GetRed() & cMask ) >> nShift ) << 2 ) |
( ( ( pColor->GetGreen() & cMask ) >> nShift ) << 1 ) |
( ( pColor->GetBlue() & cMask ) >> nShift );
nLevel++;
ImplAdd( &(*ppNode)->pChild[ nIndex ] );
}
}
void Octree::ImplReduce()
{
sal_uLong i;
NODE* pNode;
sal_uLong nRedSum = 0L;
sal_uLong nGreenSum = 0L;
sal_uLong nBlueSum = 0L;
sal_uLong nChildren = 0L;
for ( i = OCTREE_BITS - 1; i && !pReduce[i]; i-- ) {}
pNode = pReduce[ i ];
pReduce[ i ] = pNode->pNext;
for ( i = 0; i < 8; i++ )
{
if ( pNode->pChild[ i ] )
{
NODE* pChild = pNode->pChild[ i ];
nRedSum += pChild->nRed;
nGreenSum += pChild->nGreen;
nBlueSum += pChild->nBlue;
pNode->nCount += pChild->nCount;
pNodeCache->ImplReleaseNode( pNode->pChild[ i ] );
pNode->pChild[ i ] = nullptr;
nChildren++;
}
}
pNode->bLeaf = true;
pNode->nRed = nRedSum;
pNode->nGreen = nGreenSum;
pNode->nBlue = nBlueSum;
nLeafCount -= --nChildren;
}
void Octree::CreatePalette( NODE* pNode )
{
if( pNode->bLeaf )
{
pNode->nPalIndex = nPalIndex;
aPal[ nPalIndex++ ] = BitmapColor( (sal_uInt8) ( (double) pNode->nRed / pNode->nCount ),
(sal_uInt8) ( (double) pNode->nGreen / pNode->nCount ),
(sal_uInt8) ( (double) pNode->nBlue / pNode->nCount ) );
}
else for( sal_uLong i = 0UL; i < 8UL; i++ )
if( pNode->pChild[ i ] )
CreatePalette( pNode->pChild[ i ] );
}
void Octree::GetPalIndex( NODE* pNode )
{
if ( pNode->bLeaf )
nPalIndex = pNode->nPalIndex;
else
{
const sal_uLong nShift = 7 - nLevel;
const sal_uInt8 cMask = pImplMask[ nLevel++ ];
const sal_uLong nIndex = ( ( ( pColor->GetRed() & cMask ) >> nShift ) << 2 ) |
( ( ( pColor->GetGreen() & cMask ) >> nShift ) << 1 ) |
( ( pColor->GetBlue() & cMask ) >> nShift );
GetPalIndex( pNode->pChild[ nIndex ] );
}
}
InverseColorMap::InverseColorMap( const BitmapPalette& rPal ) :
nBits( 8 - OCTREE_BITS )
{
const sal_uLong nColorMax = 1 << OCTREE_BITS;
const sal_uLong xsqr = 1 << ( nBits << 1 );
const sal_uLong xsqr2 = xsqr << 1;
const sal_uLong nColors = rPal.GetEntryCount();
const long x = 1L << nBits;
const long x2 = x >> 1L;
sal_uLong r, g, b;
long rxx, gxx, bxx;
ImplCreateBuffers( nColorMax );
for( sal_uLong nIndex = 0; nIndex < nColors; nIndex++ )
{
const BitmapColor& rColor = rPal[ (sal_uInt16) nIndex ];
const long cRed = rColor.GetRed();
const long cGreen = rColor.GetGreen();
const long cBlue = rColor.GetBlue();
long rdist = cRed - x2;
long gdist = cGreen - x2;
long bdist = cBlue - x2;
rdist = rdist*rdist + gdist*gdist + bdist*bdist;
const long crinc = ( xsqr - ( cRed << nBits ) ) << 1L;
const long cginc = ( xsqr - ( cGreen << nBits ) ) << 1L;
const long cbinc = ( xsqr - ( cBlue << nBits ) ) << 1L;
sal_uLong* cdp = reinterpret_cast<sal_uLong*>(pBuffer);
sal_uInt8* crgbp = pMap;
for( r = 0, rxx = crinc; r < nColorMax; rdist += rxx, r++, rxx += xsqr2 )
{
for( g = 0, gdist = rdist, gxx = cginc; g < nColorMax; gdist += gxx, g++, gxx += xsqr2 )
{
for( b = 0, bdist = gdist, bxx = cbinc; b < nColorMax; bdist += bxx, b++, cdp++, crgbp++, bxx += xsqr2 )
if ( !nIndex || ( (long) *cdp ) > bdist )
{
*cdp = bdist;
*crgbp = (sal_uInt8) nIndex;
}
}
}
}
}
InverseColorMap::~InverseColorMap()
{
rtl_freeMemory( pBuffer );
rtl_freeMemory( pMap );
}
void InverseColorMap::ImplCreateBuffers( const sal_uLong nMax )
{
const sal_uLong nCount = nMax * nMax * nMax;
const sal_uLong nSize = nCount * sizeof( sal_uLong );
pMap = static_cast<sal_uInt8*>(rtl_allocateMemory( nCount ));
memset( pMap, 0x00, nCount );
pBuffer = static_cast<sal_uInt8*>(rtl_allocateMemory( nSize ));
memset( pBuffer, 0xff, nSize );
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
