Lines Matching full:le
382 struct links_entry *le, **new_buckets; in linkchk() local
407 le = free_list; in linkchk()
408 free_list = le->next; in linkchk()
409 free(le); in linkchk()
421 le = buckets[i]; in linkchk()
422 buckets[i] = le->next; in linkchk()
425 hash = (le->dev ^ le->ino) % new_size; in linkchk()
429 le; in linkchk()
430 le->next = new_buckets[hash]; in linkchk()
431 le->previous = NULL; in linkchk()
432 new_buckets[hash] = le; in linkchk()
443 for (le = buckets[hash]; le != NULL; le = le->next) { in linkchk()
444 if (le->dev == st->st_dev && le->ino == st->st_ino) { in linkchk()
449 if (--le->links <= 0) { in linkchk()
450 if (le->previous != NULL) in linkchk()
451 le->previous->next = le->next; in linkchk()
452 if (le->next != NULL) in linkchk()
453 le->next->previous = le->previous; in linkchk()
454 if (buckets[hash] == le) in linkchk()
455 buckets[hash] = le->next; in linkchk()
459 free(le); in linkchk()
461 le->next = free_list; in linkchk()
462 free_list = le; in linkchk()
475 le = free_list; in linkchk()
476 free_list = le->next; in linkchk()
479 le = malloc(sizeof(struct links_entry)); in linkchk()
480 if (le == NULL) { in linkchk()
485 le->dev = st->st_dev; in linkchk()
486 le->ino = st->st_ino; in linkchk()
487 le->links = st->st_nlink - 1; in linkchk()
489 le->next = buckets[hash]; in linkchk()
490 le->previous = NULL; in linkchk()
492 buckets[hash]->previous = le; in linkchk()
493 buckets[hash] = le; in linkchk()