Lines Matching defs:entry
40 archive_entry_sparse_clear(struct archive_entry *entry)
44 while (entry->sparse_head != NULL) {
45 sp = entry->sparse_head->next;
46 free(entry->sparse_head);
47 entry->sparse_head = sp;
49 entry->sparse_tail = NULL;
53 archive_entry_sparse_add_entry(struct archive_entry *entry,
62 offset + length > archive_entry_size(entry))
65 if ((sp = entry->sparse_tail) != NULL) {
88 if (entry->sparse_head == NULL)
89 entry->sparse_head = entry->sparse_tail = sp;
92 if (entry->sparse_tail != NULL)
93 entry->sparse_tail->next = sp;
94 entry->sparse_tail = sp;
103 archive_entry_sparse_count(struct archive_entry *entry)
108 for (sp = entry->sparse_head; sp != NULL; sp = sp->next)
112 * Sanity check if this entry is exactly sparse.
117 sp = entry->sparse_head;
119 sp->length >= archive_entry_size(entry)) {
121 archive_entry_sparse_clear(entry);
129 archive_entry_sparse_reset(struct archive_entry * entry)
131 entry->sparse_p = entry->sparse_head;
133 return archive_entry_sparse_count(entry);
137 archive_entry_sparse_next(struct archive_entry * entry,
140 if (entry->sparse_p) {
141 *offset = entry->sparse_p->offset;
142 *length = entry->sparse_p->length;
144 entry->sparse_p = entry->sparse_p->next;