mirror of
https://github.com/openjdk/jdk.git
synced 2026-03-14 01:43:13 +00:00
8379256: Update GIFlib to 6.1.1
Reviewed-by: prr, kizune
This commit is contained in:
parent
9d04c8a8af
commit
8b8bb43396
@ -1,9 +1,9 @@
|
||||
## GIFLIB v5.2.2
|
||||
## GIFLIB v6.1.1
|
||||
|
||||
### GIFLIB License
|
||||
```
|
||||
|
||||
The GIFLIB distribution is Copyright (c) 1997 Eric S. Raymond
|
||||
= MIT LICENSE
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
of this software and associated documentation files (the "Software"), to deal
|
||||
@ -25,9 +25,15 @@ THE SOFTWARE.
|
||||
|
||||
---------------------------------
|
||||
The below applies to the following file(s):
|
||||
giflib/dgif_lib.c
|
||||
giflib/gifalloc.c
|
||||
giflib/gif_err.c
|
||||
giflib/openbsd-reallocarray.c
|
||||
|
||||
Copyright (C) 1989 Gershon Elber
|
||||
Copyright (C) 2008 Otto Moerbeek <otto@drijf.net>
|
||||
Copyright (C) Eric S. Raymond <esr@thyrsus.com>
|
||||
|
||||
SPDX-License-Identifier: MIT
|
||||
|
||||
|
||||
|
||||
@ -1,4 +1,4 @@
|
||||
The GIFLIB distribution is Copyright (c) 1997 Eric S. Raymond
|
||||
= MIT LICENSE
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
of this software and associated documentation files (the "Software"), to deal
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
@ -26,9 +26,9 @@
|
||||
|
||||
gif_err.c - handle error reporting for the GIF library.
|
||||
|
||||
SPDX-License-Identifier: MIT
|
||||
|
||||
****************************************************************************/
|
||||
// SPDX-License-Identifier: MIT
|
||||
// SPDX-File-Copyright-Txt: (C) Copyright 1989 Gershon Elber
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
@ -39,83 +39,83 @@ SPDX-License-Identifier: MIT
|
||||
Return a string description of the last GIF error
|
||||
*****************************************************************************/
|
||||
const char *GifErrorString(int ErrorCode) {
|
||||
const char *Err;
|
||||
const char *Err;
|
||||
|
||||
switch (ErrorCode) {
|
||||
case E_GIF_ERR_OPEN_FAILED:
|
||||
Err = "Failed to open given file";
|
||||
break;
|
||||
case E_GIF_ERR_WRITE_FAILED:
|
||||
Err = "Failed to write to given file";
|
||||
break;
|
||||
case E_GIF_ERR_HAS_SCRN_DSCR:
|
||||
Err = "Screen descriptor has already been set";
|
||||
break;
|
||||
case E_GIF_ERR_HAS_IMAG_DSCR:
|
||||
Err = "Image descriptor is still active";
|
||||
break;
|
||||
case E_GIF_ERR_NO_COLOR_MAP:
|
||||
Err = "Neither global nor local color map";
|
||||
break;
|
||||
case E_GIF_ERR_DATA_TOO_BIG:
|
||||
Err = "Number of pixels bigger than width * height";
|
||||
break;
|
||||
case E_GIF_ERR_NOT_ENOUGH_MEM:
|
||||
Err = "Failed to allocate required memory";
|
||||
break;
|
||||
case E_GIF_ERR_DISK_IS_FULL:
|
||||
Err = "Write failed (disk full?)";
|
||||
break;
|
||||
case E_GIF_ERR_CLOSE_FAILED:
|
||||
Err = "Failed to close given file";
|
||||
break;
|
||||
case E_GIF_ERR_NOT_WRITEABLE:
|
||||
Err = "Given file was not opened for write";
|
||||
break;
|
||||
case D_GIF_ERR_OPEN_FAILED:
|
||||
Err = "Failed to open given file";
|
||||
break;
|
||||
case D_GIF_ERR_READ_FAILED:
|
||||
Err = "Failed to read from given file";
|
||||
break;
|
||||
case D_GIF_ERR_NOT_GIF_FILE:
|
||||
Err = "Data is not in GIF format";
|
||||
break;
|
||||
case D_GIF_ERR_NO_SCRN_DSCR:
|
||||
Err = "No screen descriptor detected";
|
||||
break;
|
||||
case D_GIF_ERR_NO_IMAG_DSCR:
|
||||
Err = "No Image Descriptor detected";
|
||||
break;
|
||||
case D_GIF_ERR_NO_COLOR_MAP:
|
||||
Err = "Neither global nor local color map";
|
||||
break;
|
||||
case D_GIF_ERR_WRONG_RECORD:
|
||||
Err = "Wrong record type detected";
|
||||
break;
|
||||
case D_GIF_ERR_DATA_TOO_BIG:
|
||||
Err = "Number of pixels bigger than width * height";
|
||||
break;
|
||||
case D_GIF_ERR_NOT_ENOUGH_MEM:
|
||||
Err = "Failed to allocate required memory";
|
||||
break;
|
||||
case D_GIF_ERR_CLOSE_FAILED:
|
||||
Err = "Failed to close given file";
|
||||
break;
|
||||
case D_GIF_ERR_NOT_READABLE:
|
||||
Err = "Given file was not opened for read";
|
||||
break;
|
||||
case D_GIF_ERR_IMAGE_DEFECT:
|
||||
Err = "Image is defective, decoding aborted";
|
||||
break;
|
||||
case D_GIF_ERR_EOF_TOO_SOON:
|
||||
Err = "Image EOF detected before image complete";
|
||||
break;
|
||||
default:
|
||||
Err = NULL;
|
||||
break;
|
||||
}
|
||||
return Err;
|
||||
switch (ErrorCode) {
|
||||
case E_GIF_ERR_OPEN_FAILED:
|
||||
Err = "Failed to open given file";
|
||||
break;
|
||||
case E_GIF_ERR_WRITE_FAILED:
|
||||
Err = "Failed to write to given file";
|
||||
break;
|
||||
case E_GIF_ERR_HAS_SCRN_DSCR:
|
||||
Err = "Screen descriptor has already been set";
|
||||
break;
|
||||
case E_GIF_ERR_HAS_IMAG_DSCR:
|
||||
Err = "Image descriptor is still active";
|
||||
break;
|
||||
case E_GIF_ERR_NO_COLOR_MAP:
|
||||
Err = "Neither global nor local color map";
|
||||
break;
|
||||
case E_GIF_ERR_DATA_TOO_BIG:
|
||||
Err = "Number of pixels bigger than width * height";
|
||||
break;
|
||||
case E_GIF_ERR_NOT_ENOUGH_MEM:
|
||||
Err = "Failed to allocate required memory";
|
||||
break;
|
||||
case E_GIF_ERR_DISK_IS_FULL:
|
||||
Err = "Write failed (disk full?)";
|
||||
break;
|
||||
case E_GIF_ERR_CLOSE_FAILED:
|
||||
Err = "Failed to close given file";
|
||||
break;
|
||||
case E_GIF_ERR_NOT_WRITEABLE:
|
||||
Err = "Given file was not opened for write";
|
||||
break;
|
||||
case D_GIF_ERR_OPEN_FAILED:
|
||||
Err = "Failed to open given file";
|
||||
break;
|
||||
case D_GIF_ERR_READ_FAILED:
|
||||
Err = "Failed to read from given file";
|
||||
break;
|
||||
case D_GIF_ERR_NOT_GIF_FILE:
|
||||
Err = "Data is not in GIF format";
|
||||
break;
|
||||
case D_GIF_ERR_NO_SCRN_DSCR:
|
||||
Err = "No screen descriptor detected";
|
||||
break;
|
||||
case D_GIF_ERR_NO_IMAG_DSCR:
|
||||
Err = "No Image Descriptor detected";
|
||||
break;
|
||||
case D_GIF_ERR_NO_COLOR_MAP:
|
||||
Err = "Neither global nor local color map";
|
||||
break;
|
||||
case D_GIF_ERR_WRONG_RECORD:
|
||||
Err = "Wrong record type detected";
|
||||
break;
|
||||
case D_GIF_ERR_DATA_TOO_BIG:
|
||||
Err = "Number of pixels bigger than width * height";
|
||||
break;
|
||||
case D_GIF_ERR_NOT_ENOUGH_MEM:
|
||||
Err = "Failed to allocate required memory";
|
||||
break;
|
||||
case D_GIF_ERR_CLOSE_FAILED:
|
||||
Err = "Failed to close given file";
|
||||
break;
|
||||
case D_GIF_ERR_NOT_READABLE:
|
||||
Err = "Given file was not opened for read";
|
||||
break;
|
||||
case D_GIF_ERR_IMAGE_DEFECT:
|
||||
Err = "Image is defective, decoding aborted";
|
||||
break;
|
||||
case D_GIF_ERR_EOF_TOO_SOON:
|
||||
Err = "Image EOF detected before image complete";
|
||||
break;
|
||||
default:
|
||||
Err = NULL;
|
||||
break;
|
||||
}
|
||||
return Err;
|
||||
}
|
||||
|
||||
/* end */
|
||||
|
||||
@ -26,9 +26,8 @@
|
||||
|
||||
gif_hash.h - magfic constants and declarations for GIF LZW
|
||||
|
||||
SPDX-License-Identifier: MIT
|
||||
|
||||
******************************************************************************/
|
||||
// SPDX-License-Identifier: MIT
|
||||
|
||||
#ifndef _GIF_HASH_H_
|
||||
#define _GIF_HASH_H_
|
||||
@ -46,7 +45,7 @@ SPDX-License-Identifier: MIT
|
||||
|
||||
/* The 32 bits of the long are divided into two parts for the key & code: */
|
||||
/* 1. The code is 12 bits as our compression algorithm is limited to 12bits */
|
||||
/* 2. The key is 12 bits Prefix code + 8 bit new char or 20 bits. */
|
||||
/* 2. The key is 12 bits Prefix code + 8 bit new char or 20 bits. */
|
||||
/* The key is the upper 20 bits. The code is the lower 12. */
|
||||
#define HT_GET_KEY(l) (l >> 12)
|
||||
#define HT_GET_CODE(l) (l & 0x0FFF)
|
||||
@ -54,7 +53,7 @@ SPDX-License-Identifier: MIT
|
||||
#define HT_PUT_CODE(l) (l & 0x0FFF)
|
||||
|
||||
typedef struct GifHashTableType {
|
||||
uint32_t HTable[HT_SIZE];
|
||||
uint32_t HTable[HT_SIZE];
|
||||
} GifHashTableType;
|
||||
|
||||
GifHashTableType *_InitHashTable(void);
|
||||
|
||||
@ -37,9 +37,9 @@ SPDX-License-Identifier: MIT
|
||||
extern "C" {
|
||||
#endif /* __cplusplus */
|
||||
|
||||
#define GIFLIB_MAJOR 5
|
||||
#define GIFLIB_MINOR 2
|
||||
#define GIFLIB_RELEASE 2
|
||||
#define GIFLIB_MAJOR 6
|
||||
#define GIFLIB_MINOR 1
|
||||
#define GIFLIB_RELEASE 1
|
||||
|
||||
#define GIF_ERROR 0
|
||||
#define GIF_OK 1
|
||||
@ -60,26 +60,26 @@ typedef unsigned int GifPrefixType;
|
||||
typedef int GifWord;
|
||||
|
||||
typedef struct GifColorType {
|
||||
GifByteType Red, Green, Blue;
|
||||
GifByteType Red, Green, Blue;
|
||||
} GifColorType;
|
||||
|
||||
typedef struct ColorMapObject {
|
||||
int ColorCount;
|
||||
int BitsPerPixel;
|
||||
bool SortFlag;
|
||||
GifColorType *Colors; /* on malloc(3) heap */
|
||||
int ColorCount;
|
||||
int BitsPerPixel;
|
||||
bool SortFlag;
|
||||
GifColorType *Colors; /* on malloc(3) heap */
|
||||
} ColorMapObject;
|
||||
|
||||
typedef struct GifImageDesc {
|
||||
GifWord Left, Top, Width, Height; /* Current image dimensions. */
|
||||
bool Interlace; /* Sequential/Interlaced lines. */
|
||||
ColorMapObject *ColorMap; /* The local color map */
|
||||
GifWord Left, Top, Width, Height; /* Current image dimensions. */
|
||||
bool Interlace; /* Sequential/Interlaced lines. */
|
||||
ColorMapObject *ColorMap; /* The local color map */
|
||||
} GifImageDesc;
|
||||
|
||||
typedef struct ExtensionBlock {
|
||||
int ByteCount;
|
||||
GifByteType *Bytes; /* on malloc(3) heap */
|
||||
int Function; /* The block function code */
|
||||
int ByteCount;
|
||||
GifByteType *Bytes; /* on malloc(3) heap */
|
||||
int Function; /* The block function code */
|
||||
#define CONTINUE_EXT_FUNC_CODE 0x00 /* continuation subblock */
|
||||
#define COMMENT_EXT_FUNC_CODE 0xfe /* comment */
|
||||
#define GRAPHICS_EXT_FUNC_CODE 0xf9 /* graphics control (GIF89) */
|
||||
@ -88,36 +88,36 @@ typedef struct ExtensionBlock {
|
||||
} ExtensionBlock;
|
||||
|
||||
typedef struct SavedImage {
|
||||
GifImageDesc ImageDesc;
|
||||
GifByteType *RasterBits; /* on malloc(3) heap */
|
||||
int ExtensionBlockCount; /* Count of extensions before image */
|
||||
ExtensionBlock *ExtensionBlocks; /* Extensions before image */
|
||||
GifImageDesc ImageDesc;
|
||||
GifByteType *RasterBits; /* on malloc(3) heap */
|
||||
int ExtensionBlockCount; /* Count of extensions before image */
|
||||
ExtensionBlock *ExtensionBlocks; /* Extensions before image */
|
||||
} SavedImage;
|
||||
|
||||
typedef struct GifFileType {
|
||||
GifWord SWidth, SHeight; /* Size of virtual canvas */
|
||||
GifWord SColorResolution; /* How many colors can we generate? */
|
||||
GifWord SBackGroundColor; /* Background color for virtual canvas */
|
||||
GifByteType AspectByte; /* Used to compute pixel aspect ratio */
|
||||
ColorMapObject *SColorMap; /* Global colormap, NULL if nonexistent. */
|
||||
int ImageCount; /* Number of current image (both APIs) */
|
||||
GifImageDesc Image; /* Current image (low-level API) */
|
||||
SavedImage *SavedImages; /* Image sequence (high-level API) */
|
||||
int ExtensionBlockCount; /* Count extensions past last image */
|
||||
ExtensionBlock *ExtensionBlocks; /* Extensions past last image */
|
||||
int Error; /* Last error condition reported */
|
||||
void *UserData; /* hook to attach user data (TVT) */
|
||||
void *Private; /* Don't mess with this! */
|
||||
GifWord SWidth, SHeight; /* Size of virtual canvas */
|
||||
GifWord SColorResolution; /* How many colors can we generate? */
|
||||
GifWord SBackGroundColor; /* Background color for virtual canvas */
|
||||
GifByteType AspectByte; /* Used to compute pixel aspect ratio */
|
||||
ColorMapObject *SColorMap; /* Global colormap, NULL if nonexistent. */
|
||||
int ImageCount; /* Number of current image (both APIs) */
|
||||
GifImageDesc Image; /* Current image (low-level API) */
|
||||
SavedImage *SavedImages; /* Image sequence (high-level API) */
|
||||
int ExtensionBlockCount; /* Count extensions past last image */
|
||||
ExtensionBlock *ExtensionBlocks; /* Extensions past last image */
|
||||
int Error; /* Last error condition reported */
|
||||
void *UserData; /* hook to attach user data (TVT) */
|
||||
void *Private; /* Don't mess with this! */
|
||||
} GifFileType;
|
||||
|
||||
#define GIF_ASPECT_RATIO(n) ((n) + 15.0 / 64.0)
|
||||
|
||||
typedef enum {
|
||||
UNDEFINED_RECORD_TYPE,
|
||||
SCREEN_DESC_RECORD_TYPE,
|
||||
IMAGE_DESC_RECORD_TYPE, /* Begin with ',' */
|
||||
EXTENSION_RECORD_TYPE, /* Begin with '!' */
|
||||
TERMINATE_RECORD_TYPE /* Begin with ';' */
|
||||
UNDEFINED_RECORD_TYPE,
|
||||
SCREEN_DESC_RECORD_TYPE,
|
||||
IMAGE_DESC_RECORD_TYPE, /* Begin with ',' */
|
||||
EXTENSION_RECORD_TYPE, /* Begin with '!' */
|
||||
TERMINATE_RECORD_TYPE /* Begin with ';' */
|
||||
} GifRecordType;
|
||||
|
||||
/* func type to read gif data from arbitrary sources (TVT) */
|
||||
@ -133,14 +133,14 @@ typedef int (*OutputFunc)(GifFileType *, const GifByteType *, int);
|
||||
******************************************************************************/
|
||||
|
||||
typedef struct GraphicsControlBlock {
|
||||
int DisposalMode;
|
||||
int DisposalMode;
|
||||
#define DISPOSAL_UNSPECIFIED 0 /* No disposal specified. */
|
||||
#define DISPOSE_DO_NOT 1 /* Leave image in place */
|
||||
#define DISPOSE_BACKGROUND 2 /* Set area too background color */
|
||||
#define DISPOSE_PREVIOUS 3 /* Restore to previous content */
|
||||
bool UserInputFlag; /* User confirmation required before disposal */
|
||||
int DelayTime; /* pre-display delay in 0.01sec units */
|
||||
int TransparentColor; /* Palette index for transparency, -1 if none */
|
||||
bool UserInputFlag; /* User confirmation required before disposal */
|
||||
int DelayTime; /* pre-display delay in 0.01sec units */
|
||||
int TransparentColor; /* Palette index for transparency, -1 if none */
|
||||
#define NO_TRANSPARENT_COLOR -1
|
||||
} GraphicsControlBlock;
|
||||
|
||||
@ -153,21 +153,21 @@ GifFileType *EGifOpenFileName(const char *GifFileName,
|
||||
const bool GifTestExistence, int *Error);
|
||||
GifFileType *EGifOpenFileHandle(const int GifFileHandle, int *Error);
|
||||
GifFileType *EGifOpen(void *userPtr, OutputFunc writeFunc, int *Error);
|
||||
int EGifSpew(GifFileType *GifFile);
|
||||
int EGifSpew(GifFileType *GifFile, int *ErrorCode);
|
||||
const char *EGifGetGifVersion(GifFileType *GifFile); /* new in 5.x */
|
||||
int EGifCloseFile(GifFileType *GifFile, int *ErrorCode);
|
||||
|
||||
#define E_GIF_SUCCEEDED 0
|
||||
#define E_GIF_ERR_OPEN_FAILED 1 /* And EGif possible errors. */
|
||||
#define E_GIF_ERR_WRITE_FAILED 2
|
||||
#define E_GIF_ERR_HAS_SCRN_DSCR 3
|
||||
#define E_GIF_ERR_HAS_IMAG_DSCR 4
|
||||
#define E_GIF_ERR_NO_COLOR_MAP 5
|
||||
#define E_GIF_ERR_DATA_TOO_BIG 6
|
||||
#define E_GIF_ERR_NOT_ENOUGH_MEM 7
|
||||
#define E_GIF_ERR_DISK_IS_FULL 8
|
||||
#define E_GIF_ERR_CLOSE_FAILED 9
|
||||
#define E_GIF_ERR_NOT_WRITEABLE 10
|
||||
#define E_GIF_ERR_OPEN_FAILED 201 /* And EGif possible errors. */
|
||||
#define E_GIF_ERR_WRITE_FAILED 202
|
||||
#define E_GIF_ERR_HAS_SCRN_DSCR 203
|
||||
#define E_GIF_ERR_HAS_IMAG_DSCR 204
|
||||
#define E_GIF_ERR_NO_COLOR_MAP 205
|
||||
#define E_GIF_ERR_DATA_TOO_BIG 206
|
||||
#define E_GIF_ERR_NOT_ENOUGH_MEM 207
|
||||
#define E_GIF_ERR_DISK_IS_FULL 208
|
||||
#define E_GIF_ERR_CLOSE_FAILED 209
|
||||
#define E_GIF_ERR_NOT_WRITEABLE 210
|
||||
|
||||
/* These are legacy. You probably do not want to call them directly */
|
||||
int EGifPutScreenDesc(GifFileType *GifFile, const int GifWidth,
|
||||
|
||||
@ -60,30 +60,30 @@ SPDX-License-Identifier: MIT
|
||||
#define IS_WRITEABLE(Private) (Private->FileState & FILE_STATE_WRITE)
|
||||
|
||||
typedef struct GifFilePrivateType {
|
||||
GifWord FileState, FileHandle, /* Where all this data goes to! */
|
||||
BitsPerPixel, /* Bits per pixel (Codes uses at least this + 1). */
|
||||
ClearCode, /* The CLEAR LZ code. */
|
||||
EOFCode, /* The EOF LZ code. */
|
||||
RunningCode, /* The next code algorithm can generate. */
|
||||
RunningBits, /* The number of bits required to represent
|
||||
RunningCode. */
|
||||
MaxCode1, /* 1 bigger than max. possible code, in RunningBits bits.
|
||||
*/
|
||||
LastCode, /* The code before the current code. */
|
||||
CrntCode, /* Current algorithm code. */
|
||||
StackPtr, /* For character stack (see below). */
|
||||
CrntShiftState; /* Number of bits in CrntShiftDWord. */
|
||||
unsigned long CrntShiftDWord; /* For bytes decomposition into codes. */
|
||||
unsigned long PixelCount; /* Number of pixels in image. */
|
||||
FILE *File; /* File as stream. */
|
||||
InputFunc Read; /* function to read gif input (TVT) */
|
||||
OutputFunc Write; /* function to write gif output (MRB) */
|
||||
GifByteType Buf[256]; /* Compressed input is buffered here. */
|
||||
GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
|
||||
GifByteType Suffix[LZ_MAX_CODE + 1]; /* So we can trace the codes. */
|
||||
GifPrefixType Prefix[LZ_MAX_CODE + 1];
|
||||
GifHashTableType *HashTable;
|
||||
bool gif89;
|
||||
GifWord FileState, FileHandle, /* Where all this data goes to! */
|
||||
BitsPerPixel, /* Bits per pixel (Codes uses at least this + 1). */
|
||||
ClearCode, /* The CLEAR LZ code. */
|
||||
EOFCode, /* The EOF LZ code. */
|
||||
RunningCode, /* The next code algorithm can generate. */
|
||||
RunningBits, /* The number of bits required to represent
|
||||
RunningCode. */
|
||||
MaxCode1, /* 1 bigger than max. possible code, in RunningBits bits.
|
||||
*/
|
||||
LastCode, /* The code before the current code. */
|
||||
CrntCode, /* Current algorithm code. */
|
||||
StackPtr, /* For character stack (see below). */
|
||||
CrntShiftState; /* Number of bits in CrntShiftDWord. */
|
||||
unsigned long CrntShiftDWord; /* For bytes decomposition into codes. */
|
||||
unsigned long PixelCount; /* Number of pixels in image. */
|
||||
FILE *File; /* File as stream. */
|
||||
InputFunc Read; /* function to read gif input (TVT) */
|
||||
OutputFunc Write; /* function to write gif output (MRB) */
|
||||
GifByteType Buf[256]; /* Compressed input is buffered here. */
|
||||
GifByteType Stack[LZ_MAX_CODE]; /* Decoded pixels are stacked here. */
|
||||
GifByteType Suffix[LZ_MAX_CODE + 1]; /* So we can trace the codes. */
|
||||
GifPrefixType Prefix[LZ_MAX_CODE + 1];
|
||||
GifHashTableType *HashTable;
|
||||
bool gif89;
|
||||
} GifFilePrivateType;
|
||||
|
||||
#ifndef HAVE_REALLOCARRAY
|
||||
|
||||
@ -26,9 +26,9 @@
|
||||
|
||||
GIF construction tools
|
||||
|
||||
SPDX-License-Identifier: MIT
|
||||
|
||||
****************************************************************************/
|
||||
// SPDX-License-Identifier: MIT
|
||||
// SPDX-FileCopyrightText: Copyright (C) Eric S. Raymond <esr@thyrsus.com>
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
@ -45,14 +45,14 @@ SPDX-License-Identifier: MIT
|
||||
|
||||
/* return smallest bitfield size n will fit in */
|
||||
int GifBitSize(int n) {
|
||||
register int i;
|
||||
register int i;
|
||||
|
||||
for (i = 1; i <= 8; i++) {
|
||||
if ((1 << i) >= n) {
|
||||
break;
|
||||
for (i = 1; i <= 8; i++) {
|
||||
if ((1 << i) >= n) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
return (i);
|
||||
return (i);
|
||||
}
|
||||
|
||||
/******************************************************************************
|
||||
@ -64,64 +64,64 @@ int GifBitSize(int n) {
|
||||
* ColorMap if that pointer is non-NULL.
|
||||
*/
|
||||
ColorMapObject *GifMakeMapObject(int ColorCount, const GifColorType *ColorMap) {
|
||||
ColorMapObject *Object;
|
||||
ColorMapObject *Object;
|
||||
|
||||
/*** FIXME: Our ColorCount has to be a power of two. Is it necessary to
|
||||
* make the user know that or should we automatically round up instead?
|
||||
*/
|
||||
if (ColorCount != (1 << GifBitSize(ColorCount))) {
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
/*** FIXME: Our ColorCount has to be a power of two. Is it necessary to
|
||||
* make the user know that or should we automatically round up instead?
|
||||
*/
|
||||
if (ColorCount != (1 << GifBitSize(ColorCount))) {
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
|
||||
Object = (ColorMapObject *)malloc(sizeof(ColorMapObject));
|
||||
if (Object == (ColorMapObject *)NULL) {
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
Object = (ColorMapObject *)malloc(sizeof(ColorMapObject));
|
||||
if (Object == (ColorMapObject *)NULL) {
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
|
||||
Object->Colors =
|
||||
(GifColorType *)calloc(ColorCount, sizeof(GifColorType));
|
||||
if (Object->Colors == (GifColorType *)NULL) {
|
||||
free(Object);
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
Object->Colors =
|
||||
(GifColorType *)calloc(ColorCount, sizeof(GifColorType));
|
||||
if (Object->Colors == (GifColorType *)NULL) {
|
||||
free(Object);
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
|
||||
Object->ColorCount = ColorCount;
|
||||
Object->BitsPerPixel = GifBitSize(ColorCount);
|
||||
Object->SortFlag = false;
|
||||
Object->ColorCount = ColorCount;
|
||||
Object->BitsPerPixel = GifBitSize(ColorCount);
|
||||
Object->SortFlag = false;
|
||||
|
||||
if (ColorMap != NULL) {
|
||||
memcpy((char *)Object->Colors, (char *)ColorMap,
|
||||
ColorCount * sizeof(GifColorType));
|
||||
}
|
||||
if (ColorMap != NULL) {
|
||||
memcpy((char *)Object->Colors, (char *)ColorMap,
|
||||
ColorCount * sizeof(GifColorType));
|
||||
}
|
||||
|
||||
return (Object);
|
||||
return (Object);
|
||||
}
|
||||
|
||||
/*******************************************************************************
|
||||
Free a color map object
|
||||
*******************************************************************************/
|
||||
void GifFreeMapObject(ColorMapObject *Object) {
|
||||
if (Object != NULL) {
|
||||
(void)free(Object->Colors);
|
||||
(void)free(Object);
|
||||
}
|
||||
if (Object != NULL) {
|
||||
(void)free(Object->Colors);
|
||||
(void)free(Object);
|
||||
}
|
||||
}
|
||||
|
||||
#ifdef DEBUG
|
||||
void DumpColorMap(ColorMapObject *Object, FILE *fp) {
|
||||
if (Object != NULL) {
|
||||
int i, j, Len = Object->ColorCount;
|
||||
if (Object != NULL) {
|
||||
int i, j, Len = Object->ColorCount;
|
||||
|
||||
for (i = 0; i < Len; i += 4) {
|
||||
for (j = 0; j < 4 && j < Len; j++) {
|
||||
(void)fprintf(fp, "%3d: %02x %02x %02x ",
|
||||
i + j, Object->Colors[i + j].Red,
|
||||
Object->Colors[i + j].Green,
|
||||
Object->Colors[i + j].Blue);
|
||||
}
|
||||
(void)fprintf(fp, "\n");
|
||||
for (i = 0; i < Len; i += 4) {
|
||||
for (j = 0; j < 4 && j < Len; j++) {
|
||||
(void)fprintf(fp, "%3d: %02x %02x %02x ",
|
||||
i + j, Object->Colors[i + j].Red,
|
||||
Object->Colors[i + j].Green,
|
||||
Object->Colors[i + j].Blue);
|
||||
}
|
||||
(void)fprintf(fp, "\n");
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
#endif /* DEBUG */
|
||||
|
||||
@ -135,112 +135,112 @@ void DumpColorMap(ColorMapObject *Object, FILE *fp) {
|
||||
ColorMapObject *GifUnionColorMap(const ColorMapObject *ColorIn1,
|
||||
const ColorMapObject *ColorIn2,
|
||||
GifPixelType ColorTransIn2[]) {
|
||||
int i, j, CrntSlot, RoundUpTo, NewGifBitSize;
|
||||
ColorMapObject *ColorUnion;
|
||||
|
||||
/*
|
||||
* We don't worry about duplicates within either color map; if
|
||||
* the caller wants to resolve those, he can perform unions
|
||||
* with an empty color map.
|
||||
*/
|
||||
|
||||
/* Allocate table which will hold the result for sure. */
|
||||
ColorUnion = GifMakeMapObject(
|
||||
MAX(ColorIn1->ColorCount, ColorIn2->ColorCount) * 2, NULL);
|
||||
|
||||
if (ColorUnion == NULL) {
|
||||
return (NULL);
|
||||
}
|
||||
|
||||
/*
|
||||
* Copy ColorIn1 to ColorUnion.
|
||||
*/
|
||||
for (i = 0; i < ColorIn1->ColorCount; i++) {
|
||||
ColorUnion->Colors[i] = ColorIn1->Colors[i];
|
||||
}
|
||||
CrntSlot = ColorIn1->ColorCount;
|
||||
|
||||
/*
|
||||
* Potentially obnoxious hack:
|
||||
*
|
||||
* Back CrntSlot down past all contiguous {0, 0, 0} slots at the end
|
||||
* of table 1. This is very useful if your display is limited to
|
||||
* 16 colors.
|
||||
*/
|
||||
while (ColorIn1->Colors[CrntSlot - 1].Red == 0 &&
|
||||
ColorIn1->Colors[CrntSlot - 1].Green == 0 &&
|
||||
ColorIn1->Colors[CrntSlot - 1].Blue == 0) {
|
||||
CrntSlot--;
|
||||
}
|
||||
|
||||
/* Copy ColorIn2 to ColorUnion (use old colors if they exist): */
|
||||
for (i = 0; i < ColorIn2->ColorCount && CrntSlot <= 256; i++) {
|
||||
/* Let's see if this color already exists: */
|
||||
for (j = 0; j < ColorIn1->ColorCount; j++) {
|
||||
if (memcmp(&ColorIn1->Colors[j], &ColorIn2->Colors[i],
|
||||
sizeof(GifColorType)) == 0) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (j < ColorIn1->ColorCount) {
|
||||
ColorTransIn2[i] = j; /* color exists in Color1 */
|
||||
} else {
|
||||
/* Color is new - copy it to a new slot: */
|
||||
ColorUnion->Colors[CrntSlot] = ColorIn2->Colors[i];
|
||||
ColorTransIn2[i] = CrntSlot++;
|
||||
}
|
||||
}
|
||||
|
||||
if (CrntSlot > 256) {
|
||||
GifFreeMapObject(ColorUnion);
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
|
||||
NewGifBitSize = GifBitSize(CrntSlot);
|
||||
RoundUpTo = (1 << NewGifBitSize);
|
||||
|
||||
if (RoundUpTo != ColorUnion->ColorCount) {
|
||||
register GifColorType *Map = ColorUnion->Colors;
|
||||
int i, j, CrntSlot, RoundUpTo, NewGifBitSize;
|
||||
ColorMapObject *ColorUnion;
|
||||
|
||||
/*
|
||||
* Zero out slots up to next power of 2.
|
||||
* We know these slots exist because of the way ColorUnion's
|
||||
* start dimension was computed.
|
||||
* We don't worry about duplicates within either color map; if
|
||||
* the caller wants to resolve those, he can perform unions
|
||||
* with an empty color map.
|
||||
*/
|
||||
for (j = CrntSlot; j < RoundUpTo; j++) {
|
||||
Map[j].Red = Map[j].Green = Map[j].Blue = 0;
|
||||
|
||||
/* Allocate table which will hold the result for sure. */
|
||||
ColorUnion = GifMakeMapObject(
|
||||
MAX(ColorIn1->ColorCount, ColorIn2->ColorCount) * 2, NULL);
|
||||
|
||||
if (ColorUnion == NULL) {
|
||||
return (NULL);
|
||||
}
|
||||
|
||||
/* perhaps we can shrink the map? */
|
||||
if (RoundUpTo < ColorUnion->ColorCount) {
|
||||
GifColorType *new_map = (GifColorType *)reallocarray(
|
||||
Map, RoundUpTo, sizeof(GifColorType));
|
||||
if (new_map == NULL) {
|
||||
/*
|
||||
* Copy ColorIn1 to ColorUnion.
|
||||
*/
|
||||
for (i = 0; i < ColorIn1->ColorCount; i++) {
|
||||
ColorUnion->Colors[i] = ColorIn1->Colors[i];
|
||||
}
|
||||
CrntSlot = ColorIn1->ColorCount;
|
||||
|
||||
/*
|
||||
* Potentially obnoxious hack:
|
||||
*
|
||||
* Back CrntSlot down past all contiguous {0, 0, 0} slots at the end
|
||||
* of table 1. This is very useful if your display is limited to
|
||||
* 16 colors.
|
||||
*/
|
||||
while (ColorIn1->Colors[CrntSlot - 1].Red == 0 &&
|
||||
ColorIn1->Colors[CrntSlot - 1].Green == 0 &&
|
||||
ColorIn1->Colors[CrntSlot - 1].Blue == 0) {
|
||||
CrntSlot--;
|
||||
}
|
||||
|
||||
/* Copy ColorIn2 to ColorUnion (use old colors if they exist): */
|
||||
for (i = 0; i < ColorIn2->ColorCount && CrntSlot <= 256; i++) {
|
||||
/* Let's see if this color already exists: */
|
||||
for (j = 0; j < ColorIn1->ColorCount; j++) {
|
||||
if (memcmp(&ColorIn1->Colors[j], &ColorIn2->Colors[i],
|
||||
sizeof(GifColorType)) == 0) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (j < ColorIn1->ColorCount) {
|
||||
ColorTransIn2[i] = j; /* color exists in Color1 */
|
||||
} else {
|
||||
/* Color is new - copy it to a new slot: */
|
||||
ColorUnion->Colors[CrntSlot] = ColorIn2->Colors[i];
|
||||
ColorTransIn2[i] = CrntSlot++;
|
||||
}
|
||||
}
|
||||
|
||||
if (CrntSlot > 256) {
|
||||
GifFreeMapObject(ColorUnion);
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
ColorUnion->Colors = new_map;
|
||||
}
|
||||
}
|
||||
|
||||
ColorUnion->ColorCount = RoundUpTo;
|
||||
ColorUnion->BitsPerPixel = NewGifBitSize;
|
||||
NewGifBitSize = GifBitSize(CrntSlot);
|
||||
RoundUpTo = (1 << NewGifBitSize);
|
||||
|
||||
return (ColorUnion);
|
||||
if (RoundUpTo != ColorUnion->ColorCount) {
|
||||
register GifColorType *Map = ColorUnion->Colors;
|
||||
|
||||
/*
|
||||
* Zero out slots up to next power of 2.
|
||||
* We know these slots exist because of the way ColorUnion's
|
||||
* start dimension was computed.
|
||||
*/
|
||||
for (j = CrntSlot; j < RoundUpTo; j++) {
|
||||
Map[j].Red = Map[j].Green = Map[j].Blue = 0;
|
||||
}
|
||||
|
||||
/* perhaps we can shrink the map? */
|
||||
if (RoundUpTo < ColorUnion->ColorCount) {
|
||||
GifColorType *new_map = (GifColorType *)reallocarray(
|
||||
Map, RoundUpTo, sizeof(GifColorType));
|
||||
if (new_map == NULL) {
|
||||
GifFreeMapObject(ColorUnion);
|
||||
return ((ColorMapObject *)NULL);
|
||||
}
|
||||
ColorUnion->Colors = new_map;
|
||||
}
|
||||
}
|
||||
|
||||
ColorUnion->ColorCount = RoundUpTo;
|
||||
ColorUnion->BitsPerPixel = NewGifBitSize;
|
||||
|
||||
return (ColorUnion);
|
||||
}
|
||||
|
||||
/*******************************************************************************
|
||||
Apply a given color translation to the raster bits of an image
|
||||
*******************************************************************************/
|
||||
void GifApplyTranslation(SavedImage *Image, const GifPixelType Translation[]) {
|
||||
register int i;
|
||||
register int RasterSize =
|
||||
Image->ImageDesc.Height * Image->ImageDesc.Width;
|
||||
register int i;
|
||||
register int RasterSize =
|
||||
Image->ImageDesc.Height * Image->ImageDesc.Width;
|
||||
|
||||
for (i = 0; i < RasterSize; i++) {
|
||||
Image->RasterBits[i] = Translation[Image->RasterBits[i]];
|
||||
}
|
||||
for (i = 0; i < RasterSize; i++) {
|
||||
Image->RasterBits[i] = Translation[Image->RasterBits[i]];
|
||||
}
|
||||
}
|
||||
|
||||
/******************************************************************************
|
||||
@ -249,56 +249,56 @@ void GifApplyTranslation(SavedImage *Image, const GifPixelType Translation[]) {
|
||||
int GifAddExtensionBlock(int *ExtensionBlockCount,
|
||||
ExtensionBlock **ExtensionBlocks, int Function,
|
||||
unsigned int Len, unsigned char ExtData[]) {
|
||||
ExtensionBlock *ep;
|
||||
ExtensionBlock *ep;
|
||||
|
||||
if (*ExtensionBlocks == NULL) {
|
||||
*ExtensionBlocks =
|
||||
(ExtensionBlock *)malloc(sizeof(ExtensionBlock));
|
||||
} else {
|
||||
ExtensionBlock *ep_new = (ExtensionBlock *)reallocarray(
|
||||
*ExtensionBlocks, (*ExtensionBlockCount + 1),
|
||||
sizeof(ExtensionBlock));
|
||||
if (ep_new == NULL) {
|
||||
return (GIF_ERROR);
|
||||
if (*ExtensionBlocks == NULL) {
|
||||
*ExtensionBlocks =
|
||||
(ExtensionBlock *)malloc(sizeof(ExtensionBlock));
|
||||
} else {
|
||||
ExtensionBlock *ep_new = (ExtensionBlock *)reallocarray(
|
||||
*ExtensionBlocks, (*ExtensionBlockCount + 1),
|
||||
sizeof(ExtensionBlock));
|
||||
if (ep_new == NULL) {
|
||||
return (GIF_ERROR);
|
||||
}
|
||||
*ExtensionBlocks = ep_new;
|
||||
}
|
||||
*ExtensionBlocks = ep_new;
|
||||
}
|
||||
|
||||
if (*ExtensionBlocks == NULL) {
|
||||
return (GIF_ERROR);
|
||||
}
|
||||
if (*ExtensionBlocks == NULL) {
|
||||
return (GIF_ERROR);
|
||||
}
|
||||
|
||||
ep = &(*ExtensionBlocks)[(*ExtensionBlockCount)++];
|
||||
ep = &(*ExtensionBlocks)[(*ExtensionBlockCount)++];
|
||||
|
||||
ep->Function = Function;
|
||||
ep->ByteCount = Len;
|
||||
ep->Bytes = (GifByteType *)malloc(ep->ByteCount);
|
||||
if (ep->Bytes == NULL) {
|
||||
return (GIF_ERROR);
|
||||
}
|
||||
ep->Function = Function;
|
||||
ep->ByteCount = Len;
|
||||
ep->Bytes = (GifByteType *)malloc(ep->ByteCount);
|
||||
if (ep->Bytes == NULL) {
|
||||
return (GIF_ERROR);
|
||||
}
|
||||
|
||||
if (ExtData != NULL) {
|
||||
memcpy(ep->Bytes, ExtData, Len);
|
||||
}
|
||||
if (ExtData != NULL) {
|
||||
memcpy(ep->Bytes, ExtData, Len);
|
||||
}
|
||||
|
||||
return (GIF_OK);
|
||||
return (GIF_OK);
|
||||
}
|
||||
|
||||
void GifFreeExtensions(int *ExtensionBlockCount,
|
||||
ExtensionBlock **ExtensionBlocks) {
|
||||
ExtensionBlock *ep;
|
||||
ExtensionBlock *ep;
|
||||
|
||||
if (*ExtensionBlocks == NULL) {
|
||||
return;
|
||||
}
|
||||
if (*ExtensionBlocks == NULL) {
|
||||
return;
|
||||
}
|
||||
|
||||
for (ep = *ExtensionBlocks;
|
||||
ep < (*ExtensionBlocks + *ExtensionBlockCount); ep++) {
|
||||
(void)free((char *)ep->Bytes);
|
||||
}
|
||||
(void)free((char *)*ExtensionBlocks);
|
||||
*ExtensionBlocks = NULL;
|
||||
*ExtensionBlockCount = 0;
|
||||
for (ep = *ExtensionBlocks;
|
||||
ep < (*ExtensionBlocks + *ExtensionBlockCount); ep++) {
|
||||
(void)free((char *)ep->Bytes);
|
||||
}
|
||||
(void)free((char *)*ExtensionBlocks);
|
||||
*ExtensionBlocks = NULL;
|
||||
*ExtensionBlockCount = 0;
|
||||
}
|
||||
|
||||
/******************************************************************************
|
||||
@ -309,37 +309,37 @@ void GifFreeExtensions(int *ExtensionBlockCount,
|
||||
* Frees the last image in the GifFile->SavedImages array
|
||||
*/
|
||||
void FreeLastSavedImage(GifFileType *GifFile) {
|
||||
SavedImage *sp;
|
||||
SavedImage *sp;
|
||||
|
||||
if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
|
||||
return;
|
||||
}
|
||||
if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
|
||||
return;
|
||||
}
|
||||
|
||||
/* Remove one SavedImage from the GifFile */
|
||||
GifFile->ImageCount--;
|
||||
sp = &GifFile->SavedImages[GifFile->ImageCount];
|
||||
/* Remove one SavedImage from the GifFile */
|
||||
GifFile->ImageCount--;
|
||||
sp = &GifFile->SavedImages[GifFile->ImageCount];
|
||||
|
||||
/* Deallocate its Colormap */
|
||||
if (sp->ImageDesc.ColorMap != NULL) {
|
||||
GifFreeMapObject(sp->ImageDesc.ColorMap);
|
||||
sp->ImageDesc.ColorMap = NULL;
|
||||
}
|
||||
/* Deallocate its Colormap */
|
||||
if (sp->ImageDesc.ColorMap != NULL) {
|
||||
GifFreeMapObject(sp->ImageDesc.ColorMap);
|
||||
sp->ImageDesc.ColorMap = NULL;
|
||||
}
|
||||
|
||||
/* Deallocate the image data */
|
||||
if (sp->RasterBits != NULL) {
|
||||
free((char *)sp->RasterBits);
|
||||
}
|
||||
/* Deallocate the image data */
|
||||
if (sp->RasterBits != NULL) {
|
||||
free((char *)sp->RasterBits);
|
||||
}
|
||||
|
||||
/* Deallocate any extensions */
|
||||
GifFreeExtensions(&sp->ExtensionBlockCount, &sp->ExtensionBlocks);
|
||||
/* Deallocate any extensions */
|
||||
GifFreeExtensions(&sp->ExtensionBlockCount, &sp->ExtensionBlocks);
|
||||
|
||||
/*** FIXME: We could realloc the GifFile->SavedImages structure but is
|
||||
* there a point to it? Saves some memory but we'd have to do it every
|
||||
* time. If this is used in GifFreeSavedImages then it would be
|
||||
* inefficient (The whole array is going to be deallocated.) If we just
|
||||
* use it when we want to free the last Image it's convenient to do it
|
||||
* here.
|
||||
*/
|
||||
/*** FIXME: We could realloc the GifFile->SavedImages structure but is
|
||||
* there a point to it? Saves some memory but we'd have to do it every
|
||||
* time. If this is used in GifFreeSavedImages then it would be
|
||||
* inefficient (The whole array is going to be deallocated.) If we just
|
||||
* use it when we want to free the last Image it's convenient to do it
|
||||
* here.
|
||||
*/
|
||||
}
|
||||
|
||||
/*
|
||||
@ -347,103 +347,121 @@ void FreeLastSavedImage(GifFileType *GifFile) {
|
||||
*/
|
||||
SavedImage *GifMakeSavedImage(GifFileType *GifFile,
|
||||
const SavedImage *CopyFrom) {
|
||||
// cppcheck-suppress ctunullpointer
|
||||
if (GifFile->SavedImages == NULL) {
|
||||
GifFile->SavedImages = (SavedImage *)malloc(sizeof(SavedImage));
|
||||
} else {
|
||||
SavedImage *newSavedImages = (SavedImage *)reallocarray(
|
||||
GifFile->SavedImages, (GifFile->ImageCount + 1),
|
||||
sizeof(SavedImage));
|
||||
if (newSavedImages == NULL) {
|
||||
return ((SavedImage *)NULL);
|
||||
}
|
||||
GifFile->SavedImages = newSavedImages;
|
||||
}
|
||||
if (GifFile->SavedImages == NULL) {
|
||||
return ((SavedImage *)NULL);
|
||||
} else {
|
||||
SavedImage *sp = &GifFile->SavedImages[GifFile->ImageCount++];
|
||||
|
||||
if (CopyFrom != NULL) {
|
||||
memcpy((char *)sp, CopyFrom, sizeof(SavedImage));
|
||||
|
||||
/*
|
||||
* Make our own allocated copies of the heap fields in
|
||||
* the copied record. This guards against potential
|
||||
* aliasing problems.
|
||||
*/
|
||||
|
||||
/* first, the local color map */
|
||||
if (CopyFrom->ImageDesc.ColorMap != NULL) {
|
||||
sp->ImageDesc.ColorMap = GifMakeMapObject(
|
||||
CopyFrom->ImageDesc.ColorMap->ColorCount,
|
||||
CopyFrom->ImageDesc.ColorMap->Colors);
|
||||
if (sp->ImageDesc.ColorMap == NULL) {
|
||||
FreeLastSavedImage(GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
}
|
||||
|
||||
/* next, the raster */
|
||||
sp->RasterBits = (unsigned char *)reallocarray(
|
||||
NULL,
|
||||
(CopyFrom->ImageDesc.Height *
|
||||
CopyFrom->ImageDesc.Width),
|
||||
sizeof(GifPixelType));
|
||||
if (sp->RasterBits == NULL) {
|
||||
FreeLastSavedImage(GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
memcpy(sp->RasterBits, CopyFrom->RasterBits,
|
||||
sizeof(GifPixelType) *
|
||||
CopyFrom->ImageDesc.Height *
|
||||
CopyFrom->ImageDesc.Width);
|
||||
|
||||
/* finally, the extension blocks */
|
||||
if (CopyFrom->ExtensionBlocks != NULL) {
|
||||
sp->ExtensionBlocks =
|
||||
(ExtensionBlock *)reallocarray(
|
||||
NULL, CopyFrom->ExtensionBlockCount,
|
||||
sizeof(ExtensionBlock));
|
||||
if (sp->ExtensionBlocks == NULL) {
|
||||
FreeLastSavedImage(GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
memcpy(sp->ExtensionBlocks,
|
||||
CopyFrom->ExtensionBlocks,
|
||||
sizeof(ExtensionBlock) *
|
||||
CopyFrom->ExtensionBlockCount);
|
||||
}
|
||||
// cppcheck-suppress ctunullpointer
|
||||
if (GifFile->SavedImages == NULL) {
|
||||
GifFile->SavedImages = (SavedImage *)malloc(sizeof(SavedImage));
|
||||
} else {
|
||||
memset((char *)sp, '\0', sizeof(SavedImage));
|
||||
SavedImage *newSavedImages = (SavedImage *)reallocarray(
|
||||
GifFile->SavedImages, (GifFile->ImageCount + 1),
|
||||
sizeof(SavedImage));
|
||||
if (newSavedImages == NULL) {
|
||||
return ((SavedImage *)NULL);
|
||||
}
|
||||
GifFile->SavedImages = newSavedImages;
|
||||
}
|
||||
if (GifFile->SavedImages == NULL) {
|
||||
return ((SavedImage *)NULL);
|
||||
} else {
|
||||
SavedImage *sp = &GifFile->SavedImages[GifFile->ImageCount++];
|
||||
|
||||
return (sp);
|
||||
}
|
||||
if (CopyFrom != NULL) {
|
||||
memcpy((char *)sp, CopyFrom, sizeof(SavedImage));
|
||||
|
||||
/*
|
||||
* Make our own allocated copies of the heap fields in
|
||||
* the copied record. This guards against potential
|
||||
* aliasing problems.
|
||||
*/
|
||||
|
||||
/* first, the local color map */
|
||||
if (CopyFrom->ImageDesc.ColorMap != NULL) {
|
||||
sp->ImageDesc.ColorMap = GifMakeMapObject(
|
||||
CopyFrom->ImageDesc.ColorMap->ColorCount,
|
||||
CopyFrom->ImageDesc.ColorMap->Colors);
|
||||
if (sp->ImageDesc.ColorMap == NULL) {
|
||||
FreeLastSavedImage(GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
}
|
||||
|
||||
/* next, the raster */
|
||||
sp->RasterBits = (unsigned char *)reallocarray(
|
||||
NULL,
|
||||
(CopyFrom->ImageDesc.Height *
|
||||
CopyFrom->ImageDesc.Width),
|
||||
sizeof(GifPixelType));
|
||||
if (sp->RasterBits == NULL) {
|
||||
FreeLastSavedImage(GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
memcpy(sp->RasterBits, CopyFrom->RasterBits,
|
||||
sizeof(GifPixelType) *
|
||||
CopyFrom->ImageDesc.Height *
|
||||
CopyFrom->ImageDesc.Width);
|
||||
|
||||
/* finally, the extension blocks */
|
||||
if (CopyFrom->ExtensionBlocks != NULL) {
|
||||
int k;
|
||||
sp->ExtensionBlocks =
|
||||
(ExtensionBlock *)calloc(
|
||||
CopyFrom->ExtensionBlockCount,
|
||||
sizeof(ExtensionBlock));
|
||||
if (sp->ExtensionBlocks == NULL) {
|
||||
FreeLastSavedImage(GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
for (k = 0; k < CopyFrom->ExtensionBlockCount;
|
||||
k++) {
|
||||
ExtensionBlock *dst =
|
||||
&sp->ExtensionBlocks[k];
|
||||
ExtensionBlock *src =
|
||||
&CopyFrom->ExtensionBlocks[k];
|
||||
dst->Function = src->Function;
|
||||
dst->ByteCount = src->ByteCount;
|
||||
if (src->ByteCount > 0) {
|
||||
dst->Bytes =
|
||||
(GifByteType *)malloc(
|
||||
src->ByteCount);
|
||||
if (dst->Bytes == NULL) {
|
||||
FreeLastSavedImage(
|
||||
GifFile);
|
||||
return (SavedImage *)(NULL);
|
||||
}
|
||||
memcpy(dst->Bytes, src->Bytes,
|
||||
src->ByteCount);
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
memset((char *)sp, '\0', sizeof(SavedImage));
|
||||
}
|
||||
|
||||
return (sp);
|
||||
}
|
||||
}
|
||||
|
||||
void GifFreeSavedImages(GifFileType *GifFile) {
|
||||
SavedImage *sp;
|
||||
SavedImage *sp;
|
||||
|
||||
if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
|
||||
return;
|
||||
}
|
||||
for (sp = GifFile->SavedImages;
|
||||
sp < GifFile->SavedImages + GifFile->ImageCount; sp++) {
|
||||
if (sp->ImageDesc.ColorMap != NULL) {
|
||||
GifFreeMapObject(sp->ImageDesc.ColorMap);
|
||||
sp->ImageDesc.ColorMap = NULL;
|
||||
if ((GifFile == NULL) || (GifFile->SavedImages == NULL)) {
|
||||
return;
|
||||
}
|
||||
for (sp = GifFile->SavedImages;
|
||||
sp < GifFile->SavedImages + GifFile->ImageCount; sp++) {
|
||||
if (sp->ImageDesc.ColorMap != NULL) {
|
||||
GifFreeMapObject(sp->ImageDesc.ColorMap);
|
||||
sp->ImageDesc.ColorMap = NULL;
|
||||
}
|
||||
|
||||
if (sp->RasterBits != NULL) {
|
||||
free((char *)sp->RasterBits);
|
||||
if (sp->RasterBits != NULL) {
|
||||
free((char *)sp->RasterBits);
|
||||
}
|
||||
|
||||
GifFreeExtensions(&sp->ExtensionBlockCount,
|
||||
&sp->ExtensionBlocks);
|
||||
}
|
||||
|
||||
GifFreeExtensions(&sp->ExtensionBlockCount,
|
||||
&sp->ExtensionBlocks);
|
||||
}
|
||||
free((char *)GifFile->SavedImages);
|
||||
GifFile->SavedImages = NULL;
|
||||
free((char *)GifFile->SavedImages);
|
||||
GifFile->SavedImages = NULL;
|
||||
}
|
||||
|
||||
/* end */
|
||||
|
||||
@ -22,9 +22,8 @@
|
||||
* questions.
|
||||
*/
|
||||
|
||||
/* $OpenBSD: reallocarray.c,v 1.1 2014/05/08 21:43:49 deraadt Exp $ */
|
||||
/*
|
||||
* Copyright (c) 2008 Otto Moerbeek <otto@drijf.net>
|
||||
* SPDX-FileCopyrightText: Copyright (C) 2008 Otto Moerbeek <otto@drijf.net>
|
||||
* SPDX-License-Identifier: MIT
|
||||
*/
|
||||
|
||||
@ -44,55 +43,55 @@
|
||||
#define MUL_NO_OVERFLOW ((size_t)1 << (sizeof(size_t) * 4))
|
||||
|
||||
void *openbsd_reallocarray(void *optr, size_t nmemb, size_t size) {
|
||||
if ((nmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) &&
|
||||
nmemb > 0 && SIZE_MAX / nmemb < size) {
|
||||
errno = ENOMEM;
|
||||
return NULL;
|
||||
}
|
||||
/*
|
||||
* Head off variations in realloc behavior on different
|
||||
* platforms (reported by MarkR <mrogers6@users.sf.net>)
|
||||
*
|
||||
* The behaviour of reallocarray is implementation-defined if
|
||||
* nmemb or size is zero. It can return NULL or non-NULL
|
||||
* depending on the platform.
|
||||
* https://www.securecoding.cert.org/confluence/display/c/MEM04-C.Beware+of+zero-lengthallocations
|
||||
*
|
||||
* Here are some extracts from realloc man pages on different platforms.
|
||||
*
|
||||
* void realloc( void memblock, size_t size );
|
||||
*
|
||||
* Windows:
|
||||
*
|
||||
* If there is not enough available memory to expand the block
|
||||
* to the given size, the original block is left unchanged,
|
||||
* and NULL is returned. If size is zero, then the block
|
||||
* pointed to by memblock is freed; the return value is NULL,
|
||||
* and memblock is left pointing at a freed block.
|
||||
*
|
||||
* OpenBSD:
|
||||
*
|
||||
* If size or nmemb is equal to 0, a unique pointer to an
|
||||
* access protected, zero sized object is returned. Access via
|
||||
* this pointer will generate a SIGSEGV exception.
|
||||
*
|
||||
* Linux:
|
||||
*
|
||||
* If size was equal to 0, either NULL or a pointer suitable
|
||||
* to be passed to free() is returned.
|
||||
*
|
||||
* OS X:
|
||||
*
|
||||
* If size is zero and ptr is not NULL, a new, minimum sized
|
||||
* object is allocated and the original object is freed.
|
||||
*
|
||||
* It looks like images with zero width or height can trigger
|
||||
* this, and fuzzing behaviour will differ by platform, so
|
||||
* fuzzing on one platform may not detect zero-size allocation
|
||||
* problems on other platforms.
|
||||
*/
|
||||
if (size == 0 || nmemb == 0) {
|
||||
return NULL;
|
||||
}
|
||||
return realloc(optr, size * nmemb);
|
||||
if ((nmemb >= MUL_NO_OVERFLOW || size >= MUL_NO_OVERFLOW) &&
|
||||
nmemb > 0 && SIZE_MAX / nmemb < size) {
|
||||
errno = ENOMEM;
|
||||
return NULL;
|
||||
}
|
||||
/*
|
||||
* Head off variations in realloc behavior on different
|
||||
* platforms (reported by MarkR <mrogers6@users.sf.net>)
|
||||
*
|
||||
* The behaviour of reallocarray is implementation-defined if
|
||||
* nmemb or size is zero. It can return NULL or non-NULL
|
||||
* depending on the platform.
|
||||
* https://www.securecoding.cert.org/confluence/display/c/MEM04-C.Beware+of+zero-lengthallocations
|
||||
*
|
||||
* Here are some extracts from realloc man pages on different platforms.
|
||||
*
|
||||
* void realloc( void memblock, size_t size );
|
||||
*
|
||||
* Windows:
|
||||
*
|
||||
* If there is not enough available memory to expand the block
|
||||
* to the given size, the original block is left unchanged,
|
||||
* and NULL is returned. If size is zero, then the block
|
||||
* pointed to by memblock is freed; the return value is NULL,
|
||||
* and memblock is left pointing at a freed block.
|
||||
*
|
||||
* OpenBSD:
|
||||
*
|
||||
* If size or nmemb is equal to 0, a unique pointer to an
|
||||
* access protected, zero sized object is returned. Access via
|
||||
* this pointer will generate a SIGSEGV exception.
|
||||
*
|
||||
* Linux:
|
||||
*
|
||||
* If size was equal to 0, either NULL or a pointer suitable
|
||||
* to be passed to free() is returned.
|
||||
*
|
||||
* OS X:
|
||||
*
|
||||
* If size is zero and ptr is not NULL, a new, minimum sized
|
||||
* object is allocated and the original object is freed.
|
||||
*
|
||||
* It looks like images with zero width or height can trigger
|
||||
* this, and fuzzing behaviour will differ by platform, so
|
||||
* fuzzing on one platform may not detect zero-size allocation
|
||||
* problems on other platforms.
|
||||
*/
|
||||
if (size == 0 || nmemb == 0) {
|
||||
return NULL;
|
||||
}
|
||||
return realloc(optr, size * nmemb);
|
||||
}
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user