Lines Matching refs:entry2
231 struct mt_status_entry *entry2; in mt_status_tree_sbuf() local
246 STAILQ_FOREACH(entry2, &entry->child_entries, links) in mt_status_tree_sbuf()
247 mt_status_tree_sbuf(sb, entry2, indent + 2, sbuf_func, arg); in mt_status_tree_sbuf()
256 struct mt_status_entry *entry2; in mt_status_tree_print() local
259 STAILQ_FOREACH(entry2, &entry->child_entries, links) in mt_status_tree_print()
260 mt_status_tree_print(entry2, indent + 2, print_func, in mt_status_tree_print()
284 struct mt_status_entry *entry2; in mt_entry_find() local
322 STAILQ_FOREACH(entry2, &entry->child_entries, links) { in mt_entry_find()
325 entry3 = mt_entry_find(entry2, name); in mt_entry_find()
341 struct mt_status_entry *entry, *entry2; in mt_status_entry_find() local
344 entry2 = mt_entry_find(entry, name); in mt_status_entry_find()
345 if (entry2 != NULL) in mt_status_entry_find()
346 return (entry2); in mt_status_entry_find()
355 struct mt_status_entry *entry2, *entry3; in mt_status_entry_free() local
358 STAILQ_FOREACH_SAFE(entry2, &entry->child_entries, links, entry3) { in mt_status_entry_free()
359 STAILQ_REMOVE(&entry->child_entries, entry2, mt_status_entry, in mt_status_entry_free()
361 mt_status_entry_free(entry2); in mt_status_entry_free()
381 struct mt_status_entry *entry, *entry2; in mt_status_free() local
383 STAILQ_FOREACH_SAFE(entry, &status_data->entries, links, entry2) { in mt_status_free()