libarchive/libarchive/archive_entry_link_resolver.c

161 	struct links_entry *le;
166 	while ((le = next_entry(res, NEXT_ENTRY_ALL)) != NULL)
167 		archive_entry_free(le->entry);
176 	struct links_entry *le;
182 		le = next_entry(res, NEXT_ENTRY_DEFERRED);
183 		if (le != NULL) {
184 			*e = le->entry;
185 			le->entry = NULL;
201 		le = find_entry(res, *e);
202 		if (le != NULL) {
205 			    archive_entry_pathname(le->canonical));
210 		le = find_entry(res, *e);
211 		if (le != NULL) {
213 			    archive_entry_pathname(le->canonical));
221 		le = find_entry(res, *e);
222 		if (le != NULL) {
224 			 * Put the new entry in le, return the
225 			 * old entry from le.
228 			*e = le->entry;
229 			le->entry = t;
233 			    archive_entry_pathname(le->canonical));
236 			if (le->links == 0) {
237 				*f = le->entry;
238 				le->entry = NULL;
245 			le = insert_entry(res, *e);
246 			if (le == NULL)
249 			le->entry = *e;
263 	struct links_entry	*le;
282 	for (le = res->buckets[bucket]; le != NULL; le = le->next) {
283 		if (le->hash == hash
284 		    && dev == archive_entry_dev(le->canonical)
285 		    && ino == archive_entry_ino64(le->canonical)) {
292 			--le->links;
293 			if (le->links > 0)
294 				return (le);
296 			if (le->previous != NULL)
297 				le->previous->next = le->next;
298 			if (le->next != NULL)
299 				le->next->previous = le->previous;
300 			if (res->buckets[bucket] == le)
301 				res->buckets[bucket] = le->next;
304 			res->spare = le;
305 			return (le);
314 	struct links_entry	*le;
327 		for (le = res->buckets[bucket]; le != NULL; le = le->next) {
328 			if (le->entry != NULL &&
331 			if (le->entry == NULL &&
335 			if (le->next != NULL)
336 				le->next->previous = le->previous;
337 			if (le->previous != NULL)
338 				le->previous->next = le->next;
340 				res->buckets[bucket] = le->next;
343 			res->spare = le;
344 			return (le);
354 	struct links_entry *le;
358 	le = calloc(1, sizeof(struct links_entry));
359 	if (le == NULL)
361 	le->canonical = archive_entry_clone(entry);
372 		res->buckets[bucket]->previous = le;
374 	le->next = res->buckets[bucket];
375 	le->previous = NULL;
376 	res->buckets[bucket] = le;
377 	le->hash = hash;
378 	le->links = archive_entry_nlink(entry) - 1;
379 	return (le);
385 	struct links_entry *le, **new_buckets;
401 			le = res->buckets[i];
402 			res->buckets[i] = le->next;
405 			bucket = le->hash & (new_size - 1);
408 				new_buckets[bucket]->previous = le;
409 			le->next = new_buckets[bucket];
410 			le->previous = NULL;
411 			new_buckets[bucket] = le;
424 	struct links_entry	*le;
434 	le = next_entry(res, NEXT_ENTRY_PARTIAL);
435 	if (le != NULL) {
436 		e = le->canonical;
438 			*links = le->links;
439 		le->canonical = NULL;