Lines Matching refs:entry2
230 struct mt_status_entry *entry2; in mt_status_tree_sbuf() local
245 STAILQ_FOREACH(entry2, &entry->child_entries, links) in mt_status_tree_sbuf()
246 mt_status_tree_sbuf(sb, entry2, indent + 2, sbuf_func, arg); in mt_status_tree_sbuf()
255 struct mt_status_entry *entry2; in mt_status_tree_print() local
258 STAILQ_FOREACH(entry2, &entry->child_entries, links) in mt_status_tree_print()
259 mt_status_tree_print(entry2, indent + 2, print_func, in mt_status_tree_print()
283 struct mt_status_entry *entry2; in mt_entry_find() local
321 STAILQ_FOREACH(entry2, &entry->child_entries, links) { in mt_entry_find()
324 entry3 = mt_entry_find(entry2, name); in mt_entry_find()
340 struct mt_status_entry *entry, *entry2; in mt_status_entry_find() local
343 entry2 = mt_entry_find(entry, name); in mt_status_entry_find()
344 if (entry2 != NULL) in mt_status_entry_find()
345 return (entry2); in mt_status_entry_find()
354 struct mt_status_entry *entry2, *entry3; in mt_status_entry_free() local
357 STAILQ_FOREACH_SAFE(entry2, &entry->child_entries, links, entry3) { in mt_status_entry_free()
358 STAILQ_REMOVE(&entry->child_entries, entry2, mt_status_entry, in mt_status_entry_free()
360 mt_status_entry_free(entry2); in mt_status_entry_free()
380 struct mt_status_entry *entry, *entry2; in mt_status_free() local
382 STAILQ_FOREACH_SAFE(entry, &status_data->entries, links, entry2) { in mt_status_free()