Lines Matching refs:entry
98 * If it is a "negative" entry, (i.e. for a name that is known NOT to
1149 * We failed to find an entry
1198 * Lookup an entry in the cache
1205 * cnp pointing to the name of the entry being sought. If the lookup
1234 /* We failed to find an entry */
1241 /* We don't want to have an entry, so dump it */
1303 * Add an entry to the cache...
1305 * that this entry is to be associated with has
1327 * Add an entry to the cache.
1350 * if the entry is for -ve caching vp is null
1360 * We allocate a new entry if we are less than the maximum
1368 * Allocate one more entry
1374 * reuse an old entry
1391 * Fill in cache info, if vp is NULL this is a "negative" cache entry.
1400 * make us the newest entry in the cache
1428 * this is a negative cache entry (vp == NULL)
1547 struct namecache *entry, *next;
1578 for (entry=old_head->lh_first; entry != NULL; entry=next) {
1583 hashval = hash_string(entry->nc_name, 0);
1584 entry->nc_hashval = hashval;
1585 head = NCHHASH(entry->nc_dvp, hashval);
1587 next = entry->nc_hash.le_next;
1588 LIST_INSERT_HEAD(head, entry, nc_hash);
1616 * that the entry is in use and
1636 * purge the entry associated with the
1676 * directory entry) can use this when creating or renaming
1746 string_t *entry, *next;
1772 for (entry=old_head->lh_first; entry != NULL; entry=next) {
1773 hashval = hash_string((const char *)entry->str, 0);
1779 next = entry->hash_chain.le_next;
1780 LIST_INSERT_HEAD(head, entry, hash_chain);
1813 string_t *entry;
1839 for (entry=head->lh_first; entry != NULL; chain_len++, entry=entry->hash_chain.le_next) {
1840 if (memcmp(entry->str, name, len) == 0 && entry->str[len] == '\0') {
1841 entry->refcount++;
1847 if (entry == NULL) {
1849 MALLOC(entry, string_t *, sizeof(string_t) + len + 1, M_TEMP, M_WAITOK);
1859 ptr = (char *)((char *)entry + sizeof(string_t));
1862 entry->str = ptr;
1863 entry->refcount = 1;
1864 LIST_INSERT_HEAD(head, entry, hash_chain);
1874 return (const char *)entry->str;
1895 string_t *entry;
1901 for (entry=head->lh_first; entry != NULL; entry=entry->hash_chain.le_next) {
1902 if (entry->str == nameref) {
1903 entry->refcount--;
1904 if (entry->refcount == 0) {
1905 LIST_REMOVE(entry, hash_chain);
1909 ptr = entry->str;
1910 entry->str = NULL;
1913 FREE(entry, M_TEMP);
1931 string_t *entry;
1938 for (entry=head->lh_first; entry != NULL; entry=entry->hash_chain.le_next) {
1939 printf("%6d - %s\n", entry->refcount, entry->str);