Home
last modified time | relevance | path

Searched refs:free_tree_node (Results 1 – 19 of 19) sorted by relevance

/dports/net/wireshark-lite/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c253 free_tree_node(wmem_allocator_t *allocator, wmem_tree_node_t* node, gboolean free_keys, gboolean fr… in free_tree_node() function
260 free_tree_node(allocator, node->left, free_keys, free_values); in free_tree_node()
269 free_tree_node(allocator, node->right, free_keys, free_values); in free_tree_node()
285 free_tree_node(tree->data_allocator, tree->root, free_keys, free_values); in wmem_tree_destroy()
/dports/net/wireshark/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c253 free_tree_node(wmem_allocator_t *allocator, wmem_tree_node_t* node, gboolean free_keys, gboolean fr… in free_tree_node() function
260 free_tree_node(allocator, node->left, free_keys, free_values); in free_tree_node()
269 free_tree_node(allocator, node->right, free_keys, free_values); in free_tree_node()
285 free_tree_node(tree->data_allocator, tree->root, free_keys, free_values); in wmem_tree_destroy()
/dports/net/tshark-lite/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c253 free_tree_node(wmem_allocator_t *allocator, wmem_tree_node_t* node, gboolean free_keys, gboolean fr… in free_tree_node() function
260 free_tree_node(allocator, node->left, free_keys, free_values); in free_tree_node()
269 free_tree_node(allocator, node->right, free_keys, free_values); in free_tree_node()
285 free_tree_node(tree->data_allocator, tree->root, free_keys, free_values); in wmem_tree_destroy()
/dports/net/tshark/wireshark-3.6.1/wsutil/wmem/
H A Dwmem_tree.c253 free_tree_node(wmem_allocator_t *allocator, wmem_tree_node_t* node, gboolean free_keys, gboolean fr… in free_tree_node() function
260 free_tree_node(allocator, node->left, free_keys, free_values); in free_tree_node()
269 free_tree_node(allocator, node->right, free_keys, free_values); in free_tree_node()
285 free_tree_node(tree->data_allocator, tree->root, free_keys, free_values); in wmem_tree_destroy()
/dports/net-mgmt/nagios-check_bacula11/bacula-11.0.5/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/net-mgmt/nagios-check_bacula9/bacula-9.6.7/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/sysutils/bacula11-client-static/bacula-11.0.5/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/sysutils/bacula9-client/bacula-9.6.7/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/sysutils/bacula9-client-static/bacula-9.6.7/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/sysutils/bacula9-server/bacula-9.6.7/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/sysutils/bacula11-server/bacula-11.0.5/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/sysutils/bacula11-client/bacula-11.0.5/src/lib/
H A Dtree.c120 static void free_tree_node(TREE_ROOT *root) in free_tree_node() function
132 free_tree_node(root); in tree_remove_node()
323 free_tree_node(root); /* free node allocated above */ in search_and_insert_tree_node()
/dports/textproc/sgrep/sgrep-0.99/
H A Deval.c55 int free_tree_node(struct TREE_NODE *node);
106 if (free_tree_node(root->left)) in eval()
113 if (free_tree_node(root->right)) in eval()
254 int free_tree_node(struct TREE_NODE *node) in free_tree_node() function
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/include/
H A Dsym_tm.h224 void free_tree_node PROTO((bc_node *n));
/dports/textproc/sgrep2/sgrep-1.94a/
H A Deval.c62 int free_tree_node(ParseTreeNode *node);
152 if (free_tree_node(root->left)) in recursive_eval()
159 if (free_tree_node(root->right)) in recursive_eval()
319 int free_tree_node(ParseTreeNode *node) in free_tree_node() function
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/TreeManager/
H A Dtm_func.c1952 free_tree_node(node);
2722 free_tree_node(n);
2854 free_tree_node(n);
2872 free_tree_node(n);
3021 free_tree_node(n);
3028 free_tree_node(n);
3685 free_tree_node(n);
3690 void free_tree_node(bc_node *n) function
/dports/textproc/augeas/augeas-1.12.0/src/
H A Daugeas.c641 static void free_tree_node(struct tree *tree) { in free_tree_node() function
660 free_tree_node(tree); in tree_unlink_raw()
1128 free_tree_node(del); in free_tree()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/LP/
H A Dlp_proccomm.c967 free_tree_node(n); in send_node_desc()
985 free_tree_node(n); in send_node_desc()
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/src/Master/
H A Dmaster_func.c967 free_tree_node(root); in ws_free_subtree()