Home
last modified time | relevance | path

Searched refs:tag_ref_tree (Results 1 – 4 of 4) sorted by relevance

/net/netfilter/
Dxt_qtaguid_print.h34 void prdebug_tag_ref_tree(int indent_level, struct rb_root *tag_ref_tree);
99 void prdebug_tag_ref_tree(int indent_level, struct rb_root *tag_ref_tree) in prdebug_tag_ref_tree() argument
Dxt_qtaguid_print.c391 void prdebug_tag_ref_tree(int indent_level, struct rb_root *tag_ref_tree) in prdebug_tag_ref_tree() argument
400 if (RB_EMPTY_ROOT(tag_ref_tree)) { in prdebug_tag_ref_tree()
409 for (node = rb_first(tag_ref_tree); in prdebug_tag_ref_tree()
452 if (!RB_EMPTY_ROOT(&uid_tag_data_entry->tag_ref_tree)) { in prdebug_uid_tag_data_tree()
455 &uid_tag_data_entry->tag_ref_tree); in prdebug_uid_tag_data_tree()
Dxt_qtaguid_internal.h322 struct rb_root tag_ref_tree; member
Dxt_qtaguid.c444 utd_entry->tag_ref_tree = RB_ROOT; in get_uid_data()
477 tag_ref_tree_insert(tr_entry, &utd_entry->tag_ref_tree); in new_tag_ref()
505 tr_entry = tag_ref_tree_search(&utd_entry->tag_ref_tree, full_tag); in lookup_tag_ref()
538 if (RB_EMPTY_ROOT(&utd_entry->tag_ref_tree) && in put_utd_entry()
572 rb_erase(&tr_entry->tn.node, &utd_entry->tag_ref_tree); in free_tag_ref_from_utd_entry()
587 node = rb_first(&utd_entry->tag_ref_tree); in put_tag_ref_tree()
2849 tr = tag_ref_tree_search(&utd_entry->tag_ref_tree, in qtudev_release()