Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/openjdk-multiarch-jdk8u
Path: blob/aarch64-shenandoah-jdk8u272-b10/jdk/src/share/native/sun/awt/image/dither.h
38918 views
1
/*
2
* Copyright (c) 2001, Oracle and/or its affiliates. All rights reserved.
3
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4
*
5
* This code is free software; you can redistribute it and/or modify it
6
* under the terms of the GNU General Public License version 2 only, as
7
* published by the Free Software Foundation. Oracle designates this
8
* particular file as subject to the "Classpath" exception as provided
9
* by Oracle in the LICENSE file that accompanied this code.
10
*
11
* This code is distributed in the hope that it will be useful, but WITHOUT
12
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14
* version 2 for more details (a copy is included in the LICENSE file that
15
* accompanied this code).
16
*
17
* You should have received a copy of the GNU General Public License version
18
* 2 along with this work; if not, write to the Free Software Foundation,
19
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20
*
21
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22
* or visit www.oracle.com if you need additional information or have any
23
* questions.
24
*/
25
26
#include <stdio.h>
27
#include <stdlib.h>
28
#include <math.h>
29
#include <string.h>
30
31
#include "colordata.h"
32
33
#ifdef __cplusplus
34
extern "C" {
35
#endif
36
37
extern sgn_ordered_dither_array std_img_oda_red;
38
extern sgn_ordered_dither_array std_img_oda_green;
39
extern sgn_ordered_dither_array std_img_oda_blue;
40
extern int std_odas_computed;
41
42
void make_dither_arrays(int cmapsize, ColorData *cData);
43
void initInverseGrayLut(int* prgb, int rgbsize, ColorData* cData);
44
45
/*
46
* state info needed for breadth-first recursion of color cube from
47
* initial palette entries within the cube
48
*/
49
50
typedef struct {
51
unsigned int depth;
52
unsigned int maxDepth;
53
54
unsigned char *usedFlags;
55
unsigned int activeEntries;
56
unsigned short *rgb;
57
unsigned char *indices;
58
unsigned char *iLUT;
59
} CubeStateInfo;
60
61
#define INSERTNEW(state, rgb, index) do { \
62
if (!state.usedFlags[rgb]) { \
63
state.usedFlags[rgb] = 1; \
64
state.iLUT[rgb] = index; \
65
state.rgb[state.activeEntries] = rgb; \
66
state.indices[state.activeEntries] = index; \
67
state.activeEntries++; \
68
} \
69
} while (0);
70
71
72
#define ACTIVATE(code, mask, delta, state, index) do { \
73
if (((rgb & mask) + delta) <= mask) { \
74
rgb += delta; \
75
INSERTNEW(state, rgb, index); \
76
rgb -= delta; \
77
} \
78
if ((rgb & mask) >= delta) { \
79
rgb -= delta; \
80
INSERTNEW(state, rgb, index); \
81
rgb += delta; \
82
} \
83
} while (0);
84
85
#ifdef __cplusplus
86
} /* extern "C" */
87
#endif
88
89