Lines Matching defs:entry
241 name_addr_entry_t *entry;
260 * Locate the entry with the name in the NSM_ADDR_REG request if
261 * it exists. If it doesn't, create a new entry to hold this name.
265 for (entry = name_addr; entry; entry = entry->next) {
266 if (strcmp(regargs->name, entry->name) == 0) {
269 entry->name);
275 if (entry == NULL) {
276 entry = (name_addr_entry_t *)malloc(sizeof (*entry));
277 if (entry == NULL) {
280 "nsmaddrproc1_reg: no memory for entry\n");
286 entry->name = strdup(regargs->name);
287 if (entry->name == NULL) {
292 free(entry);
296 entry->addresses = NULL;
299 * Link the new entry onto the *head* of the name_addr
305 entry->next = name_addr;
306 name_addr = entry;
311 * add it to the entry's address list.
313 for (addr = entry->addresses; addr; addr = addr->next) {
327 addr->family, entry->name);
342 * If this name entry was just newly made in the
349 if (entry == name_addr && entry->addresses == NULL) {
351 free(entry->name);
352 free(entry);
381 addr->next = entry->addresses;
382 entry->addresses = addr;
397 * Insert an entry into the monitor_q. Space for the entry is allocated
407 name_addr_entry_t *entry;
410 /* Allocate entry for new */
422 /* Allocate entry for new mon_name */
432 /* Allocate entry for new my_name */
454 for (entry = name_addr; entry; entry = entry->next) {
455 if (strcmp(new->id.mon_id.mon_name, entry->name) != 0) {
459 for (addr = entry->addresses; addr; addr = addr->next) {
492 * with an entry in the list, space allocated for the
493 * new entry is released and nothing is inserted in the
531 * insert just after the entry having matching tuple.
612 /* if nl is not the first entry on list */
657 /* Allocate entry for mon_name */
667 /* Allocate entry for my_name */
896 name_addr_entry_t *entry;
904 for (entry = name_addr; entry != NULL; entry = entry->next) {
906 (entry->name ? entry->name : "(null)"));
907 for (addr = entry->addresses; addr; addr = addr->next) {
966 * entry found. The netbuf structure returned is converted into