| ︙ | | | ︙ | |
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
#import "OFOutOfMemoryException.h"
static struct of_huffman_tree *
newTree(void)
{
struct of_huffman_tree *tree;
if ((tree = malloc(sizeof(*tree))) == NULL)
@throw [OFOutOfMemoryException
exceptionWithRequestedSize: sizeof(*tree)];
tree->leaves[0] = tree->leaves[1] = NULL;
tree->value = 0xFFFF;
return tree;
}
static void
|
|
<
<
<
|
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
#import "OFOutOfMemoryException.h"
static struct of_huffman_tree *
newTree(void)
{
struct of_huffman_tree *tree;
tree = of_malloc(1, sizeof(*tree));
tree->leaves[0] = tree->leaves[1] = NULL;
tree->value = 0xFFFF;
return tree;
}
static void
|
| ︙ | | | ︙ | |
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
|
uint_fast8_t maxBit = 0;
@try {
for (uint16_t i = 0; i < count; i++) {
uint_fast8_t length = lengths[i];
if OF_UNLIKELY (length > maxBit) {
size_t size = (length + 1) * sizeof(uint16_t);
uint16_t *new;
if ((new = realloc(lengthCount, size)) == NULL)
@throw [OFOutOfMemoryException
exceptionWithRequestedSize: size];
new;
if ((new = realloc(nextCode, size)) == NULL)
@throw [OFOutOfMemoryException
exceptionWithRequestedSize: size];
nextCode = new;
|
<
<
<
<
<
<
<
|
|
|
<
<
|
<
|
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
uint_fast8_t maxBit = 0;
@try {
for (uint16_t i = 0; i < count; i++) {
uint_fast8_t length = lengths[i];
if OF_UNLIKELY (length > maxBit) {
lengthCount = of_realloc(lengthCount,
length + 1, sizeof(uint16_t));
nextCode = of_realloc(nextCode,
length + 1, sizeof(uint16_t));
for (uint_fast8_t j = maxBit + 1; j <= length;
j++) {
lengthCount[j] = 0;
nextCode[j] = 0;
}
|
| ︙ | | | ︙ | |
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
for (uint16_t i = 0; i <= maxCode; i++) {
uint8_t length = lengths[i];
if (length > 0)
insertTree(tree, nextCode[length]++, length, i);
}
} @finally {
free(lengthCount);
free(nextCode);
}
return tree;
}
struct of_huffman_tree *
of_huffman_tree_construct_single(uint16_t value)
|
|
|
|
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
for (uint16_t i = 0; i <= maxCode; i++) {
uint8_t length = lengths[i];
if (length > 0)
insertTree(tree, nextCode[length]++, length, i);
}
} @finally {
of_free(lengthCount);
of_free(nextCode);
}
return tree;
}
struct of_huffman_tree *
of_huffman_tree_construct_single(uint16_t value)
|
| ︙ | | | ︙ | |
137
138
139
140
141
142
143
144
145
|
void
of_huffman_tree_release(struct of_huffman_tree *tree)
{
for (uint_fast8_t i = 0; i < 2; i++)
if OF_LIKELY (tree->leaves[i] != NULL)
of_huffman_tree_release(tree->leaves[i]);
free(tree);
}
|
|
|
124
125
126
127
128
129
130
131
132
|
void
of_huffman_tree_release(struct of_huffman_tree *tree)
{
for (uint_fast8_t i = 0; i < 2; i++)
if OF_LIKELY (tree->leaves[i] != NULL)
of_huffman_tree_release(tree->leaves[i]);
of_free(tree);
}
|