Lines Matching defs:entry
41 * id. To implement dictionary entry delete, the locking strategy for graph
74 dict_entry_t *entry, tmp;
80 if ((entry = uu_list_find(dictionary->dict_list, &tmp, NULL,
84 id = entry->de_id;
101 dict_entry_t *entry, tmp;
110 if ((entry = uu_list_find(dictionary->dict_list, &tmp, NULL,
113 return (entry->de_id);
116 entry = startd_alloc(sizeof (dict_entry_t));
118 entry->de_id = dictionary->dict_new_id++;
119 entry->de_name = startd_alloc(strlen(name) + 1);
120 (void) strcpy((char *)entry->de_name, name);
122 uu_list_node_init(entry, &entry->de_link, dict_pool);
124 uu_list_insert(dictionary->dict_list, entry, idx);
127 return (entry->de_id);