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
|
/*************************************************************************
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/>.
*************************************************************************/
/*
** This is an Os abstraction of the stdlib
** include file. It might possibly contain fixes for
** various Os derivations from the intended stdlib.
**
** $Id: string.hpp,v 1.7 2014/09/30 08:33:18 thor Exp $
*/
#ifndef STRING_HPP
#define STRING_HPP
#include "config.h"
/// Standard headers
#ifdef DEPLOY_PICCLIB
# if defined(__cplusplus)
extern "C" {
# endif
# if defined(__IS_powerpc__)
# include <string.h>
# endif
# include "pegasus/picclib.h"
# if defined(__cplusplus)
}
# endif
#else
# if HAVE_STRING_H
# if !STDC_HEADERS && HAVE_MEMORY_H
# include <memory.h>
# endif
# include <string.h>
# endif
# if HAVE_STRINGS_H
# include <strings.h>
# endif
#endif
///
/// strSize: XML compliant string size computation
// Compute the length of the string in bytes (without the NUL!) for
// XML encoded strings. This can be either a UTF-8 string, or a UTF-16
// string. In the latter case, the string is expected to start with a
// byte-order mark (0xfeff for big and 0xfffe for little endian).
inline static size_t strSize(const unsigned char *data)
{
if (((data[0] == 0xff) && (data[1] == 0xfe)) ||
((data[0] == 0xfe) && (data[1] == 0xff))) {
const unsigned char *p = data;
// Repeat until a double 0 is found. Note that we cannot
// cast to UWORD since the alignment isn't clear.
do {
p += 2; // The first one isn't NUL for sure!
} while(p[0] | p[1]);
//
return p - data;
} else {
return strlen((const char *)data);
}
}
///
/// Provide quicker replacements for memset/memcpy/memmove
#ifndef DEPLOY_PICCLIB
# ifdef HAVE_BUILTIN_MEMSET
# undef memset
# define memset __builtin_memset
# endif
# ifdef HAVE_BUILTIN_MEMCPY
# undef memcpy
# define memcpy __builtin_memcpy
# endif
# ifdef HAVE_BUILTIN_MEMMOVE
# undef memmove
# define memmove __builtin_memmove
# endif
#endif
///
/// Check for memchr function and provide a replacement if we don't have it.
#if !HAVE_MEMCHR
inline static void *memchr(const void *s, int c, size_t n) throw()
{
const unsigned char *in = (const unsigned char *)s;
if (n) {
do {
if (*in == c) return const_cast<void *>(s);
in++;
} while(--n);
}
return 0;
}
#endif
///
/// Check for the memmove function and provide a replacement if we don't have it.
#if !HAVE_MEMMOVE
// This is not overly efficient, but it should at least work...
inline static void *memmove(void *dest, const void *src, size_t n) throw()
{
unsigned char *d = (unsigned char *)dest;
const unsigned char *s = (const unsigned char *)src;
if (n) {
if (s > d) {
// Source is behind dest, copy ascending.
do {
*d = *s;
d++,s++;
} while(--n);
} else if (s < d) {
// Source is in front of dest, copy descending.
s += n, d += n;
do {
--d,--s;
*d = *s;
} while(--n);
}
}
return dest;
}
#endif
///
/// Check for the memset function and provide a replacement if we don't
#if !HAVE_MEMSET
inline static void *memset(void *s, int c, size_t n) throw()
{
unsigned char *d = (unsigned char *)s;
if (n) {
do {
*d = c;
d++;
} while(--n);
}
return const_cast<void *>(s);
}
#endif
///
/// Check for availibility of the strchr function and provide a replacement if there is none.
#if !HAVE_STRCHR
inline static char *strchr(const char *s, int c) throw()
{
while(*s) {
if (*s == c) return const_cast<char *>(s);
s++;
}
return 0;
}
#endif
///
/// Check for strerror function
#if !HAVE_STRERROR
// we cannot really do much about it as this is Os depdendent. Yuck.
#define strerror(c) "unknown error"
#endif
///
/// Check for strrchr function and provide a replacement.
#if !HAVE_STRRCHR
inline static char *strrchr(const char *s, int c) throw()
{
const char *t = s + strlen(s);
while(t > s) {
t--;
if (*t == c) return const_cast<char *>(t);
}
return 0;
}
#endif
///
///
#endif
|