Lines Matching defs:entry
76 struct archive_entry *entry;
156 archive_entry_free(le->entry);
170 *f = NULL; /* Default: Don't return a second entry. */
175 *e = le->entry;
176 le->entry = NULL;
215 * Put the new entry in le, return the
216 * old entry from le.
219 *e = le->entry;
220 le->entry = t;
221 /* Make the old entry into a hardlink. */
226 * final entry as well. */
228 *f = le->entry;
229 le->entry = NULL;
237 le->entry = *e;
249 struct archive_entry *entry)
256 /* Free a held entry. */
259 archive_entry_free(res->spare->entry);
268 dev = archive_entry_dev(entry);
269 ino = archive_entry_ino64(entry);
272 /* Try to locate this entry in the links cache. */
280 * the entry if it hits zero. This saves
295 /* Defer freeing this entry. */
309 /* Free a held entry. */
329 /* Defer freeing this entry. */
339 struct archive_entry *entry)
344 /* Add this entry to the links cache. */
349 le->canonical = archive_entry_clone(entry);
355 hash = archive_entry_dev(entry) ^ archive_entry_ino64(entry);
358 /* If we could allocate the entry, record it. */
366 le->links = archive_entry_nlink(entry) - 1;
386 /* Remove entry from old bucket. */
390 /* Add entry to new bucket. */