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 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325
|
/*************************************************************************
This project implements a complete(!) JPEG (Recommendation ITU-T
T.81 | ISO/IEC 10918-1) codec, plus a library that can be used to
encode and decode JPEG streams.
It also implements ISO/IEC 18477 aka JPEG XT which is an extension
towards intermediate, high-dynamic-range lossy and lossless coding
of JPEG. In specific, it supports ISO/IEC 18477-3/-6/-7/-8 encoding.
Note that only Profiles C and D of ISO/IEC 18477-7 are supported
here. Check the JPEG XT reference software for a full implementation
of ISO/IEC 18477-7.
Copyright (C) 2012-2018 Thomas Richter, University of Stuttgart and
Accusoft. (C) 2019-2020 Thomas Richter, Fraunhofer IIS.
This program is available under two licenses, GPLv3 and the ITU
Software licence Annex A Option 2, RAND conditions.
For the full text of the GPU license option, see README.license.gpl.
For the full text of the ITU license option, see README.license.itu.
You may freely select between these two options.
For the GPL option, please note the following:
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 3 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 <http://www.gnu.org/licenses/>.
*************************************************************************/
/*
* Tag item definitions
*
* $Id: tagitem.cpp,v 1.9 2020/04/08 10:05:41 thor Exp $
*
* Tag items provide a convenient mechanism to build functions with are
* easely extendable. A tag item consists of:
*
* A tag field that identifies the parameter type,
* the parameter itself.
*
* Special system parameters exist to link, filter, etc... tag items.
*
*/
/// Includes
#include "tagitem.hpp"
#include "types.hpp"
#include "tools/environment.hpp"
///
/// JPG_TagItem::NextTagItem
struct JPG_TagItem *JPG_TagItem::NextTagItem(void)
{
struct JPG_TagItem *current = this;
if (current == NULL)
return NULL;
//
// Just a standard user tag. The next one is behind this
// one.
if (current->ti_Tag & JPGTAG_TAG_USER)
current++;
while(true) {
switch (current->ti_Tag) {
case JPGTAG_TAG_DONE:
return NULL; // This is the end of the tag list. Return NULL
case JPGTAG_TAG_MORE:
// go to the next list
current = (struct JPG_TagItem *)(current->ti_Data.ti_pPtr);
if (current == NULL)
return NULL;
continue;
case JPGTAG_TAG_SKIP:
current = current + 1 + current->ti_Data.ti_lData; // skip this and the next n items
continue;
default:
if (current->ti_Tag & JPGTAG_TAG_USER)
return current;
// fall through
case JPGTAG_TAG_IGNORE:
current++;
continue;
}
}
return NULL;
}
///
/// JPG_TagItem::FindTagItem
struct JPG_TagItem *JPG_TagItem::FindTagItem(JPG_Tag id)
{
struct JPG_TagItem *current = this;
if (current == NULL)
return NULL;
while(true) {
switch (current->ti_Tag) {
case JPGTAG_TAG_DONE:
return NULL; // This is the end of the tag list. Return NULL
case JPGTAG_TAG_MORE:
// go to the next list
current = (struct JPG_TagItem *)(current->ti_Data.ti_pPtr);
if (current == NULL)
return NULL;
continue;
case JPGTAG_TAG_SKIP:
current = current + 1 + current->ti_Data.ti_lData; // skip this and the next n items
continue;
default:
if (current->ti_Tag & JPGTAG_TAG_USER) {
if (current->ti_Tag == id)
return current;
}
// Runs into the following
case JPGTAG_TAG_IGNORE:
current++;
continue;
}
}
return NULL;
}
///
/// JPG_TagItem::GetTagData
JPG_LONG JPG_TagItem::GetTagData(JPG_Tag id,JPG_LONG defdata) const
{
const struct JPG_TagItem *current;
if ((current = FindTagItem(id)) != NULL) {
return current->ti_Data.ti_lData;
}
return defdata;
}
///
/// JPG_TagItem::GetTagFloat
JPG_FLOAT JPG_TagItem::GetTagFloat(JPG_Tag id,JPG_FLOAT defdata) const
{
const struct JPG_TagItem *current;
if ((current = FindTagItem(id)) != NULL) {
return current->ti_Data.ti_fData;
}
return defdata;
}
///
/// JPG_TagItem::GetTagPtr
APTR JPG_TagItem::GetTagPtr(JPG_Tag id,APTR defptr) const
{
const struct JPG_TagItem *current;
if ((current = FindTagItem(id)) != NULL) {
return current->ti_Data.ti_pPtr;
}
return defptr;
}
///
/// JPG_TagItem::SetTagData
void JPG_TagItem::SetTagData(JPG_Tag id,JPG_LONG data)
{
struct JPG_TagItem *current;
if ((current = FindTagItem(id)) != NULL) {
current->ti_Data.ti_lData = data;
}
}
///
/// JPG_TagItem::SetTagFloat
void JPG_TagItem::SetTagFloat(JPG_Tag id,JPG_FLOAT data)
{
struct JPG_TagItem *current;
if ((current = FindTagItem(id)) != NULL) {
current->ti_Data.ti_fData = data;
}
}
///
/// JPG_TagItem::SetTagPtr
void JPG_TagItem::SetTagPtr(JPG_Tag id,APTR ptr)
{
struct JPG_TagItem *current;
if ((current = FindTagItem(id)) != NULL) {
current->ti_Data.ti_pPtr = ptr;
}
}
///
/// JPG_TagItem::SetTagSet
// Set the internal "tag set" flag.
void JPG_TagItem::SetTagSet()
{
ti_Tag |= JPGTAG_SET;
}
///
/// JPG_TagItem::ClearTagSets
// Clear the internal "tag set" flags recursively.
void JPG_TagItem::ClearTagSets()
{
struct JPG_TagItem *current = this;
while (current) {
if (current->ti_Tag & JPGTAG_SET) {
current->ti_Tag &= ~JPGTAG_SET;
} else {
// This tag is not set, drop it.
current->ti_Tag = JPGTAG_TAG_IGNORE;
}
current = current->NextTagItem();
}
}
///
/// JPG_TagItem::FilterTags
// Filtering of tags. The following method takes the current
// tag list, a tag list of defaults and a new taglist that
// should better be large enough. It takes the defaults,
// moves them to the new taglist and overrides its setting
// with that of this taglist. It returns the lenght of the
// new taglist. If the target taglist is NULL, it is not
// filled in, but tags are just counted.
JPG_LONG JPG_TagItem::FilterTags(struct JPG_TagItem *target,const struct JPG_TagItem *source,
const struct JPG_TagItem *defaults,const struct JPG_TagItem *drop)
{
LONG count = 0;
const struct JPG_TagItem *parse = source;
//
while(parse) {
if (parse->ti_Tag & JPGTAG_TAG_USER) {
// Got a setting tag, carry it over.
if (target) {
*target++ = *parse;
}
count++;
}
parse = parse->NextTagItem();
}
//
// Now go for the list of defaults. Whenever we do not find
// a default on the parent list, attach it.
while(defaults) {
if (defaults->ti_Tag & JPGTAG_TAG_USER) {
// Check whether there are any tags we shall not add from
// the defaults.
if (drop == NULL || drop->FindTagItem(defaults->ti_Tag) == NULL) {
if (source == NULL || source->FindTagItem(defaults->ti_Tag) == NULL) {
// Ok, we know nothing about this value, attach.
if (target) {
*target++ = *defaults;
}
count++;
}
}
}
defaults = defaults->NextTagItem();
}
//
// Now attach an End-Tag.
if (target) {
target->ti_Tag = JPGTAG_TAG_DONE;
target->ti_Data.ti_lData = 0;
}
count++;
return count;
}
///
/// JPG_TagItem::TagOn
// Attach a new tag list at the end of this tag list.
struct JPG_TagItem *JPG_TagItem::TagOn(struct JPG_TagItem *add)
{
struct JPG_TagItem *current = this;
while(current) {
switch (current->ti_Tag) {
case JPGTAG_TAG_DONE:
// This is the end of the tag list, attach here.
current->ti_Tag = JPGTAG_TAG_MORE;
current->ti_Data.ti_pPtr = add;
return current;
case JPGTAG_TAG_IGNORE:
current++; // Just skip the current item and continue
break;
case JPGTAG_TAG_MORE:
// go to the next list
current = (struct JPG_TagItem *)(current->ti_Data.ti_pPtr);
break;
case JPGTAG_TAG_SKIP:
current = current + 1 + current->ti_Data.ti_lData; // skip this and the next n items
break;
default:
// User tag, skip
current++;
break;
}
}
//
// Shouldn't go here, shuts up g++.
return NULL;
}
///
|