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
|
///////////////////////////////////////////////////////////////////////////////
//
/// \file index.c
/// \brief Handling of Index in Metadata
//
// Copyright (C) 2007 Lasse Collin
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
///////////////////////////////////////////////////////////////////////////////
#include "common.h"
/**
* \brief Duplicates an Index list
*
* \return A copy of the Index list, or NULL if memory allocation
* failed or the original Index was empty.
*/
extern LZMA_API lzma_index *
lzma_index_dup(const lzma_index *old_current, lzma_allocator *allocator)
{
lzma_index *new_head = NULL;
lzma_index *new_current = NULL;
while (old_current != NULL) {
lzma_index *i = lzma_alloc(sizeof(lzma_index), allocator);
if (i == NULL) {
lzma_index_free(new_head, allocator);
return NULL;
}
i->total_size = old_current->total_size;
i->uncompressed_size = old_current->uncompressed_size;
i->next = NULL;
if (new_head == NULL)
new_head = i;
else
new_current->next = i;
new_current = i;
old_current = old_current->next;
}
return new_head;
}
/**
* \brief Frees an Index list
*
* All Index Recors in the list are freed. This function is convenient when
* getting rid of lzma_metadata structures containing an Index.
*/
extern LZMA_API void
lzma_index_free(lzma_index *i, lzma_allocator *allocator)
{
while (i != NULL) {
lzma_index *tmp = i->next;
lzma_free(i, allocator);
i = tmp;
}
return;
}
/**
* \brief Calculates properties of an Index list
*
*
*/
extern LZMA_API lzma_ret
lzma_index_count(const lzma_index *i, size_t *count,
lzma_vli *lzma_restrict total_size,
lzma_vli *lzma_restrict uncompressed_size)
{
*count = 0;
*total_size = 0;
*uncompressed_size = 0;
while (i != NULL) {
if (i->total_size == LZMA_VLI_VALUE_UNKNOWN) {
*total_size = LZMA_VLI_VALUE_UNKNOWN;
} else if (i->total_size > LZMA_VLI_VALUE_MAX) {
return LZMA_PROG_ERROR;
} else if (*total_size != LZMA_VLI_VALUE_UNKNOWN) {
*total_size += i->total_size;
if (*total_size > LZMA_VLI_VALUE_MAX)
return LZMA_PROG_ERROR;
}
if (i->uncompressed_size == LZMA_VLI_VALUE_UNKNOWN) {
*uncompressed_size = LZMA_VLI_VALUE_UNKNOWN;
} else if (i->uncompressed_size > LZMA_VLI_VALUE_MAX) {
return LZMA_PROG_ERROR;
} else if (*uncompressed_size != LZMA_VLI_VALUE_UNKNOWN) {
*uncompressed_size += i->uncompressed_size;
if (*uncompressed_size > LZMA_VLI_VALUE_MAX)
return LZMA_PROG_ERROR;
}
++*count;
i = i->next;
}
// FIXME ?
if (*total_size == LZMA_VLI_VALUE_UNKNOWN
|| *uncompressed_size == LZMA_VLI_VALUE_UNKNOWN)
return LZMA_HEADER_ERROR;
return LZMA_OK;
}
extern LZMA_API lzma_bool
lzma_index_is_equal(const lzma_index *a, const lzma_index *b)
{
while (a != NULL && b != NULL) {
if (a->total_size != b->total_size || a->uncompressed_size
!= b->uncompressed_size)
return false;
a = a->next;
b = b->next;
}
return a == b;
}
|
