/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/include/ |
H A D | antlr3basetree.h | 2 /// Definition of the ANTLR3 base tree. 45 /// A generic tree implementation with no payload. You must subclass to 47 /// instead of the child-sibling approach in v2. A flat tree (a list) is 59 /// like to a tree node, in many cases saving the need to create their own tree 60 /// and tree adaptors. ANTLR does not use this pointer, but will copy it for you and so on. 65 /// as they belong to the common tree node that implements this. 70 /// and ascending trees as the tree walk progresses. 79 /// for the payload in the supplied tree. 81 pANTLR3_COMMON_TOKEN (*getToken) (struct ANTLR3_BASE_TREE_struct * tree); [all...] |
H A D | antlr3parsetree.h | 2 * Abstraction of Common tree to provide payload and string representation of node. 53 /** The payload that the parse tree node passes around 64 pANTLR3_BASE_TREE (*dupNode) (struct ANTLR3_PARSE_TREE_struct * tree); 68 ANTLR3_UINT32 (*getType) (struct ANTLR3_PARSE_TREE_struct * tree); 76 void (*free) (struct ANTLR3_PARSE_TREE_struct * tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/src/ |
H A D | antlr3basetree.c | 36 static void * getChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i); 37 static ANTLR3_UINT32 getChildCount (pANTLR3_BASE_TREE tree); 39 (pANTLR3_BASE_TREE tree); 40 static ANTLR3_UINT32 getLine (pANTLR3_BASE_TREE tree); 43 (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 type); 44 static void addChild (pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child); 45 static void addChildren (pANTLR3_BASE_TREE tree, pANTLR3_LIST kids); 48 static void freshenPACIndexesAll(pANTLR3_BASE_TREE tree); 49 static void freshenPACIndexes (pANTLR3_BASE_TREE tree, ANTLR3_UINT32 offset); 51 static void setChild (pANTLR3_BASE_TREE tree, ANTLR3_UINT3 58 antlr3BaseTreeNew(pANTLR3_BASE_TREE tree) argument 84 getCharPositionInLine(pANTLR3_BASE_TREE tree) argument 90 getLine(pANTLR3_BASE_TREE tree) argument 95 getFirstChildWithType(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 type) argument 119 getChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i) argument 131 getChildCount(pANTLR3_BASE_TREE tree) argument 144 addChild(pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE child) argument 222 addChildren(pANTLR3_BASE_TREE tree, pANTLR3_LIST kids) argument 236 setChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i, void * child) argument 246 deleteChild(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 i) argument 257 dupTree(pANTLR3_BASE_TREE tree) argument 288 toStringTree(pANTLR3_BASE_TREE tree) argument 461 freshenPACIndexesAll(pANTLR3_BASE_TREE tree) argument 470 freshenPACIndexes(pANTLR3_BASE_TREE tree, ANTLR3_UINT32 offset) argument [all...] |
H A D | antlr3commontree.c | 4 // starting point for your own tree. Though it is often easier just to tag things on 5 // to the user pointer in the tree unless you are building a different type 41 static pANTLR3_COMMON_TOKEN getToken (pANTLR3_BASE_TREE tree); 42 static pANTLR3_BASE_TREE dupNode (pANTLR3_BASE_TREE tree); 43 static ANTLR3_BOOLEAN isNilNode (pANTLR3_BASE_TREE tree); 44 static ANTLR3_UINT32 getType (pANTLR3_BASE_TREE tree); 45 static pANTLR3_STRING getText (pANTLR3_BASE_TREE tree); 46 static ANTLR3_UINT32 getLine (pANTLR3_BASE_TREE tree); 47 static ANTLR3_UINT32 getCharPositionInLine (pANTLR3_BASE_TREE tree); 48 static pANTLR3_STRING toString (pANTLR3_BASE_TREE tree); 156 pANTLR3_COMMON_TREE tree; local 212 newFromTree(pANTLR3_ARBORETUM factory, pANTLR3_COMMON_TREE tree) argument 288 antlr3SetCTAPI(pANTLR3_COMMON_TREE tree) argument 337 pANTLR3_COMMON_TREE tree; local 372 createChildrenList(pANTLR3_BASE_TREE tree) argument 379 getToken(pANTLR3_BASE_TREE tree) argument 391 dupNode(pANTLR3_BASE_TREE tree) argument 406 isNilNode(pANTLR3_BASE_TREE tree) argument 421 getType(pANTLR3_BASE_TREE tree) argument 438 getText(pANTLR3_BASE_TREE tree) argument 443 getLine(pANTLR3_BASE_TREE tree) argument 466 getCharPositionInLine(pANTLR3_BASE_TREE tree) argument 487 toString(pANTLR3_BASE_TREE tree) argument 502 getParent(pANTLR3_BASE_TREE tree) argument 508 setParent(pANTLR3_BASE_TREE tree, pANTLR3_BASE_TREE parent) argument 514 setChildIndex(pANTLR3_BASE_TREE tree, ANTLR3_INT32 i) argument 528 reuse(pANTLR3_BASE_TREE tree) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/x509v3/ |
H A D | pcy_lib.c | 70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument 72 if (!tree) 74 return tree->nlevel; 77 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, argument 80 if (!tree || (i < 0) || (i >= tree->nlevel)) 82 return tree->levels + i; 87 *tree) 89 if (!tree) 91 return tree [all...] |
H A D | pcy_tree.c | 67 * Enable this to print out the complete policy tree at various point during 98 static void tree_print(char *str, X509_POLICY_TREE *tree, argument 107 curr = tree->levels + tree->nlevel; 111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 112 for (plev = tree->levels; plev != curr; plev++) { 114 plev - tree->levels, plev->flags); 135 * Initialize policy tree. Return values: 139 * 2 Policy tree is empty. 147 X509_POLICY_TREE *tree; local 366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 428 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 488 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 561 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument 604 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument 663 tree_evaluate(X509_POLICY_TREE *tree) argument 693 X509_policy_tree_free(X509_POLICY_TREE *tree) argument 735 X509_POLICY_TREE *tree = NULL; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509v3/ |
H A D | pcy_lib.c | 70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument 72 if (!tree) 74 return tree->nlevel; 78 X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, int i) argument 80 if (!tree || (i < 0) || (i >= tree->nlevel)) 82 return tree->levels + i; 86 X509_policy_tree_get0_policies(const X509_POLICY_TREE *tree) 88 if (!tree) 90 return tree [all...] |
H A D | pcy_tree.c | 65 /* Initialize policy tree. Return values: 69 * 2 Policy tree is empty. 77 X509_POLICY_TREE *tree; local 149 /* If we get this far initialize the tree */ 151 tree = OPENSSL_malloc(sizeof(X509_POLICY_TREE)); 153 if (!tree) 156 tree->flags = 0; 157 tree->levels = OPENSSL_malloc(sizeof(X509_POLICY_LEVEL) * n); 158 tree->nlevel = 0; 159 tree 282 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 336 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 412 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument 458 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument 522 tree_evaluate(X509_POLICY_TREE *tree) argument 553 X509_policy_tree_free(X509_POLICY_TREE *tree) argument 598 X509_POLICY_TREE *tree = NULL; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/x509v3/ |
H A D | pcy_lib.c | 70 int X509_policy_tree_level_count(const X509_POLICY_TREE *tree) argument 72 if (!tree) 74 return tree->nlevel; 77 X509_POLICY_LEVEL *X509_policy_tree_get0_level(const X509_POLICY_TREE *tree, argument 80 if (!tree || (i < 0) || (i >= tree->nlevel)) 82 return tree->levels + i; 87 *tree) 89 if (!tree) 91 return tree [all...] |
H A D | pcy_tree.c | 67 * Enable this to print out the complete policy tree at various point during 98 static void tree_print(char *str, X509_POLICY_TREE *tree, argument 107 curr = tree->levels + tree->nlevel; 111 BIO_printf(err, "Printing Up to Level %ld\n", curr - tree->levels); 112 for (plev = tree->levels; plev != curr; plev++) { 114 plev - tree->levels, plev->flags); 135 * Initialize policy tree. Return values: 139 * 2 Policy tree is empty. 147 X509_POLICY_TREE *tree; local 366 tree_add_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, const ASN1_OBJECT *id, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 393 tree_link_unmatched(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_NODE *node, X509_POLICY_TREE *tree) argument 428 tree_link_any(X509_POLICY_LEVEL *curr, const X509_POLICY_CACHE *cache, X509_POLICY_TREE *tree) argument 488 tree_prune(X509_POLICY_TREE *tree, X509_POLICY_LEVEL *curr) argument 561 tree_calculate_authority_set(X509_POLICY_TREE *tree, STACK_OF(X509_POLICY_NODE) **pnodes) argument 604 tree_calculate_user_set(X509_POLICY_TREE *tree, STACK_OF(ASN1_OBJECT) *policy_oids, STACK_OF(X509_POLICY_NODE) *auth_nodes) argument 663 tree_evaluate(X509_POLICY_TREE *tree) argument 693 X509_policy_tree_free(X509_POLICY_TREE *tree) argument 735 X509_POLICY_TREE *tree = NULL; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/dbus-1.6.8/dbus/ |
H A D | dbus-object-tree.c | 2 /* dbus-object-tree.c DBusObjectTree (internals of DBusConnection) 25 #include "dbus-object-tree.h" 37 * @brief DBusObjectTree is used by DBusConnection to track the object tree 60 DBusConnection *connection; /**< Connection this tree belongs to */ 62 DBusObjectSubtree *root; /**< Root of the tree ("/" node) */ 85 * Creates a new object tree, representing a mapping from paths 88 * @param connection the connection this tree belongs to 89 * @returns the new tree or #NULL if no memory 94 DBusObjectTree *tree; local 101 tree 129 _dbus_object_tree_ref(DBusObjectTree *tree) argument 143 _dbus_object_tree_unref(DBusObjectTree *tree) argument 323 find_subtree(DBusObjectTree *tree, const char **path, int *index_in_parent) argument 342 lookup_subtree(DBusObjectTree *tree, const char **path) argument 352 find_handler(DBusObjectTree *tree, const char **path, dbus_bool_t *exact_match) argument 367 ensure_subtree(DBusObjectTree *tree, const char **path) argument 391 _dbus_object_tree_register(DBusObjectTree *tree, dbus_bool_t fallback, const char **path, const DBusObjectPathVTable *vtable, void *user_data, DBusError *error) argument 444 _dbus_object_tree_unregister_and_unlock(DBusObjectTree *tree, const char **path) argument 563 _dbus_object_tree_free_all_unlocked(DBusObjectTree *tree) argument 572 _dbus_object_tree_list_registered_unlocked(DBusObjectTree *tree, const char **parent_path, char ***child_entries) argument 616 handle_default_introspect_and_unlock(DBusObjectTree *tree, DBusMessage *message, const char **path) argument 747 _dbus_object_tree_dispatch_and_unlock(DBusObjectTree *tree, DBusMessage *message, dbus_bool_t *found_object) argument 919 _dbus_object_tree_get_user_data_unlocked(DBusObjectTree *tree, const char **path) argument 1050 _dbus_object_tree_list_registered_and_unlock(DBusObjectTree *tree, const char **parent_path, char ***child_entries) argument 1339 do_register(DBusObjectTree *tree, const char **path, dbus_bool_t fallback, int i, TreeTestData *tree_test_data) argument 1366 do_test_dispatch(DBusObjectTree *tree, const char **path, int i, TreeTestData *tree_test_data, int n_test_data) argument 1522 DBusObjectTree *tree; local [all...] |
H A D | dbus-object-tree.h | 2 /* dbus-object-tree.h DBusObjectTree (internals of DBusConnection) 33 DBusObjectTree* _dbus_object_tree_ref (DBusObjectTree *tree); 34 void _dbus_object_tree_unref (DBusObjectTree *tree); 36 dbus_bool_t _dbus_object_tree_register (DBusObjectTree *tree, 42 void _dbus_object_tree_unregister_and_unlock (DBusObjectTree *tree, 44 DBusHandlerResult _dbus_object_tree_dispatch_and_unlock (DBusObjectTree *tree, 47 void* _dbus_object_tree_get_user_data_unlocked (DBusObjectTree *tree, 49 void _dbus_object_tree_free_all_unlocked (DBusObjectTree *tree); 52 dbus_bool_t _dbus_object_tree_list_registered_and_unlock (DBusObjectTree *tree,
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfs/ |
H A D | btree.c | 20 struct hfs_btree *tree; local 26 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 27 if (!tree) 30 init_MUTEX(&tree->tree_lock); 31 spin_lock_init(&tree->hash_lock); 33 tree->sb = sb; 34 tree->cnid = id; 35 tree->keycmp = keycmp; 37 tree 127 hfs_btree_close(struct hfs_btree *tree) argument 149 hfs_btree_write(struct hfs_btree *tree) argument 179 struct hfs_btree *tree = prev->tree; local 212 hfs_bmap_alloc(struct hfs_btree *tree) argument 309 struct hfs_btree *tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfsplus_journal/ |
H A D | btree.c | 22 struct hfs_btree *tree; local 29 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 30 if (!tree) 33 mutex_init(&tree->tree_lock); 34 spin_lock_init(&tree->hash_lock); 35 tree->sb = sb; 36 tree->cnid = id; 40 tree->inode = inode; 42 if (!HFSPLUS_I(tree 134 hfs_btree_close(struct hfs_btree *tree) argument 156 hfs_btree_write(hfsplus_handle_t *hfsplus_handle,struct hfs_btree *tree) argument 187 struct hfs_btree *tree = prev->tree; local 218 hfs_bmap_alloc(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree) argument 316 struct hfs_btree *tree; local [all...] |
H A D | bfind.c | 14 int hfs_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) argument 18 fd->tree = tree; 20 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); 24 fd->key = ptr + tree->max_key_len + 2; 25 dprint(DBG_BNODE_REFS, "find_init: %d (%p)\n", tree->cnid, __builtin_return_address(0)); 26 mutex_lock(&tree->tree_lock); 34 dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0)); 35 mutex_unlock(&fd->tree->tree_lock); 36 fd->tree 39 hfsplus_journalled_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) argument 117 struct hfs_btree *tree; local 184 struct hfs_btree *tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/mxml-2.7/ |
H A D | testmxml.c | 67 mxml_node_t *tree, /* XML tree */ local 95 tree = mxmlNewElement(MXML_NO_PARENT, "element"); 97 if (!tree) 103 if (tree->type != MXML_ELEMENT) 106 tree->type < MXML_ELEMENT || tree->type > MXML_TEXT ? 107 "UNKNOWN" : types[tree->type], tree->type); 108 mxmlDelete(tree); [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfsplus/ |
H A D | btree.c | 22 struct hfs_btree *tree; local 29 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 30 if (!tree) 33 init_MUTEX(&tree->tree_lock); 34 spin_lock_init(&tree->hash_lock); 35 tree->sb = sb; 36 tree->cnid = id; 40 tree->inode = inode; 42 mapping = tree 99 hfs_btree_close(struct hfs_btree *tree) argument 121 hfs_btree_write(struct hfs_btree *tree) argument 151 struct hfs_btree *tree = prev->tree; local 182 hfs_bmap_alloc(struct hfs_btree *tree) argument 279 struct hfs_btree *tree; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libcsc-0.82.3/doc/manl/ |
H A D | csc_tree.l | 9 The CSCbinTree functions provide an interface to a balanced binary tree 10 subsystem. The tree is an opaque data type, and client code never has 12 tree can be deleted. 20 same tree. 23 tree 25 CSCbinTreeNew - create an empty libcsc balanced binary tree 26 CSCbinTreeDel - delete a libcsc balanced binary tree 27 CSCbinTreeInsert - insert a node into a libcsc balanced binary tree 28 CSCbinTreeTagOrderedInsert - put node into libcsc balanced binary tree 29 CSCbinTreeTraverse - traverse a libcsc balanced binary tree [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zebra/ospf6d/ |
H A D | ospf6_bintree.h | 7 struct bintree *tree; member in struct:bintree_node 30 void *bintree_lookup (void *data, struct bintree *tree); 31 void *bintree_lookup_min (struct bintree *tree); 32 void *bintree_lookup_max (struct bintree *tree); 34 int bintree_add (void *data, struct bintree *tree); 35 int bintree_remove (void *data, struct bintree *tree); 37 void bintree_head (struct bintree *tree, struct bintree_node *node);
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/dtc/ |
H A D | fstree.c | 31 struct node *tree; local 37 tree = build_node(NULL, NULL); 65 add_property(tree, prop); 74 add_child(tree, newchild); 81 return tree; 86 struct node *tree; local 88 tree = read_fstree(dirname); 89 tree = name_node(tree, "", NULL); 91 return build_boot_info(NULL, tree, [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/include/ |
H A D | adt_tree.h | 30 /* data structure used to build the tree */ 51 /* create a new tree, talloc_free() to throw it away */ 57 BOOL pathtree_add( SORTED_TREE *tree, const char *path, void *data_p ); 61 void* pathtree_find( SORTED_TREE *tree, char *key ); 65 void pathtree_print_keys( SORTED_TREE *tree, int debug );
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/tracing/ |
H A D | draw_functrace.py | 9 The resulted trace is processed into a tree to produce a more human 10 view of the call stack by drawing textual but hierarchical tree of 28 """ This class provides a tree representation of the functions 46 into the tree at the appropriate place. 59 tree = self 60 while tree != CallTree.ROOT and tree._func != func: 61 tree = tree._parent 62 if tree [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/ |
H A D | ref-cache.c | 124 struct btrfs_leaf_ref_tree *tree = root->ref_tree; local 127 tree = &root->fs_info->shared_ref_tree; 128 if (!tree) 131 spin_lock(&tree->lock); 132 while (!list_empty(&tree->list)) { 133 ref = list_entry(tree->list.next, struct btrfs_leaf_ref, list); 134 BUG_ON(ref->tree != tree); 138 cond_resched_lock(&tree->lock); 142 rb_erase(&ref->rb_node, &tree 163 struct btrfs_leaf_ref_tree *tree = root->ref_tree; local 192 struct btrfs_leaf_ref_tree *tree = root->ref_tree; local 217 struct btrfs_leaf_ref_tree *tree; local [all...] |
H A D | ref-cache.h | 22 /* bytenr and num_bytes find the extent in the extent allocation tree */ 33 struct btrfs_leaf_ref_tree *tree; member in struct:btrfs_leaf_ref 53 static inline void btrfs_leaf_ref_tree_init(struct btrfs_leaf_ref_tree *tree) argument 55 tree->root = RB_ROOT; 56 INIT_LIST_HEAD(&tree->list); 57 spin_lock_init(&tree->lock); 60 static inline int btrfs_leaf_ref_tree_empty(struct btrfs_leaf_ref_tree *tree) argument 62 return RB_EMPTY_ROOT(&tree->root); 65 void btrfs_leaf_ref_tree_init(struct btrfs_leaf_ref_tree *tree);
|
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/kernel/ |
H A D | audit_tree.c | 46 * the same tree. 53 * tree.chunks anchors chunk.owners[].list hash_lock 54 * tree.rules anchors rule.rlist audit_filter_mutex 55 * chunk.trees anchors tree.same_root hash_lock 59 * tree is refcounted; one reference for "some rules on rules_list refer to 75 struct audit_tree *tree; local 77 tree = kmalloc(sizeof(struct audit_tree) + strlen(s) + 1, GFP_KERNEL); 78 if (tree) { 79 atomic_set(&tree->count, 1); 80 tree 91 get_tree(struct audit_tree *tree) argument 98 struct audit_tree *tree = container_of(rcu, struct audit_tree, head); local 102 put_tree(struct audit_tree *tree) argument 109 audit_tree_path(struct audit_tree *tree) argument 204 audit_tree_match(struct audit_chunk *chunk, struct audit_tree *tree) argument 317 create_chunk(struct inode *inode, struct audit_tree *tree) argument 355 tag_chunk(struct inode *inode, struct audit_tree *tree) argument 453 kill_rules(struct audit_tree *tree) argument 500 trim_marked(struct audit_tree *tree) argument 547 struct audit_tree *tree; local 581 struct audit_tree *tree; local 636 audit_put_tree(struct audit_tree *tree) argument 649 struct audit_tree *seed = rule->tree, *tree; local 737 struct audit_tree *tree; local 776 struct audit_tree *tree; local [all...] |