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
|
/*
*
* Gimp-Print color management module - traditional Gimp-Print algorithm.
*
* Copyright 1997-2000 Michael Sweet (mike@easysw.com) and
* Robert Krawitz (rlk@alum.mit.edu)
*
* This program 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 program 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 program. If not, see <https://www.gnu.org/licenses/>.
*/
/*
* This file must include only standard C header files. The core code must
* compile on generic platforms that don't support glib, gimp, gtk, etc.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <gutenprint/gutenprint.h>
#include "gutenprint-internal.h"
#include <gutenprint/gutenprint-intl-internal.h>
#include <gutenprint/curve-cache.h>
#include <math.h>
#ifdef HAVE_LIMITS_H
#include <limits.h>
#endif
#include <string.h>
void
stp_curve_free_curve_cache(stp_cached_curve_t *cache)
{
if (cache->curve)
stp_curve_destroy(cache->curve);
cache->curve = NULL;
cache->d_cache = NULL;
cache->s_cache = NULL;
cache->count = 0;
}
void
stp_curve_cache_curve_data(stp_cached_curve_t *cache)
{
if (cache->curve && !cache->d_cache)
{
cache->s_cache = stp_curve_get_ushort_data(cache->curve, &(cache->count));
cache->d_cache = stp_curve_get_data(cache->curve, &(cache->count));
}
}
stp_curve_t *
stp_curve_cache_get_curve(stp_cached_curve_t *cache)
{
return cache->curve;
}
void
stp_curve_cache_curve_invalidate(stp_cached_curve_t *cache)
{
cache->d_cache = NULL;
cache->s_cache = NULL;
cache->count = 0;
}
void
stp_curve_cache_set_curve(stp_cached_curve_t *cache, stp_curve_t *curve)
{
stp_curve_cache_curve_invalidate(cache);
cache->curve = curve;
}
void
stp_curve_cache_set_curve_copy(stp_cached_curve_t *cache, const stp_curve_t *curve)
{
stp_curve_cache_curve_invalidate(cache);
cache->curve = stp_curve_create_copy(curve);
}
size_t
stp_curve_cache_get_count(stp_cached_curve_t *cache)
{
if (cache->curve)
{
if (!cache->d_cache)
cache->d_cache = stp_curve_get_data(cache->curve, &(cache->count));
return cache->count;
}
else
return 0;
}
const unsigned short *
stp_curve_cache_get_ushort_data(stp_cached_curve_t *cache)
{
if (cache->curve)
{
if (!cache->s_cache)
cache->s_cache =
stp_curve_get_ushort_data(cache->curve, &(cache->count));
return cache->s_cache;
}
else
return NULL;
}
const double *
stp_curve_cache_get_double_data(stp_cached_curve_t *cache)
{
if (cache->curve)
{
if (!cache->d_cache)
cache->d_cache = stp_curve_get_data(cache->curve, &(cache->count));
return cache->d_cache;
}
else
return NULL;
}
void
stp_curve_cache_copy(stp_cached_curve_t *dest, const stp_cached_curve_t *src)
{
stp_curve_cache_curve_invalidate(dest);
if (dest != src)
{
if (src->curve)
stp_curve_cache_set_curve_copy(dest, src->curve);
}
}
|
