Lines Matching refs:entry2
233 struct mt_status_entry *entry2; in mt_status_tree_sbuf() local
248 STAILQ_FOREACH(entry2, &entry->child_entries, links) in mt_status_tree_sbuf()
249 mt_status_tree_sbuf(sb, entry2, indent + 2, sbuf_func, arg); in mt_status_tree_sbuf()
258 struct mt_status_entry *entry2; in mt_status_tree_print() local
261 STAILQ_FOREACH(entry2, &entry->child_entries, links) in mt_status_tree_print()
262 mt_status_tree_print(entry2, indent + 2, print_func, in mt_status_tree_print()
286 struct mt_status_entry *entry2; in mt_entry_find() local
324 STAILQ_FOREACH(entry2, &entry->child_entries, links) { in mt_entry_find()
327 entry3 = mt_entry_find(entry2, name); in mt_entry_find()
343 struct mt_status_entry *entry, *entry2; in mt_status_entry_find() local
346 entry2 = mt_entry_find(entry, name); in mt_status_entry_find()
347 if (entry2 != NULL) in mt_status_entry_find()
348 return (entry2); in mt_status_entry_find()
357 struct mt_status_entry *entry2, *entry3; in mt_status_entry_free() local
360 STAILQ_FOREACH_SAFE(entry2, &entry->child_entries, links, entry3) { in mt_status_entry_free()
361 STAILQ_REMOVE(&entry->child_entries, entry2, mt_status_entry, in mt_status_entry_free()
363 mt_status_entry_free(entry2); in mt_status_entry_free()
383 struct mt_status_entry *entry, *entry2; in mt_status_free() local
385 STAILQ_FOREACH_SAFE(entry, &status_data->entries, links, entry2) { in mt_status_free()