libarchive/libarchive/archive_entry_link_resolver.c

162 	struct links_entry *le;
167 	while ((le = next_entry(res, NEXT_ENTRY_ALL)) != NULL)
168 		archive_entry_free(le->entry);
177 	struct links_entry *le;
183 		le = next_entry(res, NEXT_ENTRY_DEFERRED);
184 		if (le != NULL) {
185 			*e = le->entry;
186 			le->entry = NULL;
202 		le = find_entry(res, *e);
203 		if (le != NULL) {
206 			    archive_entry_pathname(le->canonical));
211 		le = find_entry(res, *e);
212 		if (le != NULL) {
214 			    archive_entry_pathname(le->canonical));
222 		le = find_entry(res, *e);
223 		if (le != NULL) {
225 			 * Put the new entry in le, return the
226 			 * old entry from le.
229 			*e = le->entry;
230 			le->entry = t;
234 			    archive_entry_pathname(le->canonical));
237 			if (le->links == 0) {
238 				*f = le->entry;
239 				le->entry = NULL;
246 			le = insert_entry(res, *e);
247 			if (le == NULL)
250 			le->entry = *e;
264 	struct links_entry	*le;
283 	for (le = res->buckets[bucket]; le != NULL; le = le->next) {
284 		if (le->hash == hash
285 		    && dev == archive_entry_dev(le->canonical)
286 		    && ino == archive_entry_ino64(le->canonical)) {
293 			--le->links;
294 			if (le->links > 0)
295 				return (le);
297 			if (le->previous != NULL)
298 				le->previous->next = le->next;
299 			if (le->next != NULL)
300 				le->next->previous = le->previous;
301 			if (res->buckets[bucket] == le)
302 				res->buckets[bucket] = le->next;
305 			res->spare = le;
306 			return (le);
315 	struct links_entry	*le;
328 		for (le = res->buckets[bucket]; le != NULL; le = le->next) {
329 			if (le->entry != NULL &&
332 			if (le->entry == NULL &&
336 			if (le->next != NULL)
337 				le->next->previous = le->previous;
338 			if (le->previous != NULL)
339 				le->previous->next = le->next;
341 				res->buckets[bucket] = le->next;
344 			res->spare = le;
345 			return (le);
355 	struct links_entry *le;
359 	le = calloc(1, sizeof(struct links_entry));
360 	if (le == NULL)
362 	le->canonical = archive_entry_clone(entry);
373 		res->buckets[bucket]->previous = le;
375 	le->next = res->buckets[bucket];
376 	le->previous = NULL;
377 	res->buckets[bucket] = le;
378 	le->hash = hash;
379 	le->links = archive_entry_nlink(entry) - 1;
380 	return (le);
386 	struct links_entry *le, **new_buckets;
402 			le = res->buckets[i];
403 			res->buckets[i] = le->next;
406 			bucket = le->hash & (new_size - 1);
409 				new_buckets[bucket]->previous = le;
410 			le->next = new_buckets[bucket];
411 			le->previous = NULL;
412 			new_buckets[bucket] = le;
425 	struct links_entry	*le;
435 	le = next_entry(res, NEXT_ENTRY_PARTIAL);
436 	if (le != NULL) {
437 		e = le->canonical;
439 			*links = le->links;
440 		le->canonical = NULL;