Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mobile
Path: blob/master/src/java.desktop/share/native/libawt/awt/image/dither.h
41159 views
1
/*
2
* Copyright (c) 2001, 2018, 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
#include "jni.h"
33
34
#ifdef __cplusplus
35
extern "C" {
36
#endif
37
38
JNIEXPORT extern sgn_ordered_dither_array std_img_oda_red;
39
JNIEXPORT extern sgn_ordered_dither_array std_img_oda_green;
40
JNIEXPORT extern sgn_ordered_dither_array std_img_oda_blue;
41
JNIEXPORT extern int std_odas_computed;
42
43
JNIEXPORT void JNICALL
44
make_dither_arrays(int cmapsize, ColorData *cData);
45
46
JNIEXPORT void JNICALL
47
initInverseGrayLut(int* prgb, int rgbsize, ColorData* cData);
48
49
/*
50
* state info needed for breadth-first recursion of color cube from
51
* initial palette entries within the cube
52
*/
53
54
typedef struct {
55
unsigned int depth;
56
unsigned int maxDepth;
57
58
unsigned char *usedFlags;
59
unsigned int activeEntries;
60
unsigned short *rgb;
61
unsigned char *indices;
62
unsigned char *iLUT;
63
} CubeStateInfo;
64
65
#define INSERTNEW(state, rgb, index) do { \
66
if (!state.usedFlags[rgb]) { \
67
state.usedFlags[rgb] = 1; \
68
state.iLUT[rgb] = index; \
69
state.rgb[state.activeEntries] = rgb; \
70
state.indices[state.activeEntries] = index; \
71
state.activeEntries++; \
72
} \
73
} while (0);
74
75
76
#define ACTIVATE(code, mask, delta, state, index) do { \
77
if (((rgb & mask) + delta) <= mask) { \
78
rgb += delta; \
79
INSERTNEW(state, rgb, index); \
80
rgb -= delta; \
81
} \
82
if ((rgb & mask) >= delta) { \
83
rgb -= delta; \
84
INSERTNEW(state, rgb, index); \
85
rgb += delta; \
86
} \
87
} while (0);
88
89
#ifdef __cplusplus
90
} /* extern "C" */
91
#endif
92
93