Lines Matching refs:entry
50 static void __dgraph_entry_free(dgraph_entry_t * entry);
178 static void __dgraph_entry_free(dgraph_entry_t * entry)
180 if (entry->name) {
181 dgfree(entry->name);
182 entry->name = NULL;
184 if (entry->expected_kmod_name) {
185 dgfree(entry->expected_kmod_name);
186 entry->expected_kmod_name = NULL;
188 if (entry->expected_kmod_vers) {
189 dgfree(entry->expected_kmod_vers);
190 entry->expected_kmod_vers = NULL;
192 if (entry->dependencies) {
193 free(entry->dependencies);
194 entry->dependencies = NULL;
196 if (entry->symbols_malloc) {
197 free((void *) entry->symbols_malloc);
198 entry->symbols_malloc = 0;
200 free(entry);
251 /* Scan each entry in the graph for one that isn't in any other entry's
360 /* Put the dependencies of the scanning entry into the list.
453 /* Get the entry to check.
674 /* Create a dependency list for the entry. Start with 5 slots.
749 /* Find or add the entry for the new dependency.