/netgear-WNDR4500v2-V1.0.0.60_1.0.38/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...] |
H A D | pcy_node.c | 103 X509_POLICY_TREE *tree) 132 if (tree) 134 if (!tree->extra_data) 135 tree->extra_data = sk_X509_POLICY_DATA_new_null(); 136 if (!tree->extra_data) 138 if (!sk_X509_POLICY_DATA_push(tree->extra_data, data)) 100 level_add_node(X509_POLICY_LEVEL *level, X509_POLICY_DATA *data, X509_POLICY_NODE *parent, X509_POLICY_TREE *tree) argument
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/hfs/ |
H A D | btree.c | 19 struct hfs_btree *tree; local 25 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 26 if (!tree) 29 init_MUTEX(&tree->tree_lock); 30 spin_lock_init(&tree->hash_lock); 32 tree->sb = sb; 33 tree->cnid = id; 34 tree->keycmp = keycmp; 36 tree 101 hfs_btree_close(struct hfs_btree *tree) argument 123 hfs_btree_write(struct hfs_btree *tree) argument 153 struct hfs_btree *tree = prev->tree; local 186 hfs_bmap_alloc(struct hfs_btree *tree) argument 279 struct hfs_btree *tree; local [all...] |
H A D | brec.c | 15 static int hfs_btree_inc_height(struct hfs_btree *tree); 23 dataoff = node->tree->node_size - (rec + 2) * 2; 38 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { 39 if (node->tree->attributes & HFS_TREE_BIGKEYS) 40 retval = node->tree->max_key_len + 2; 42 retval = node->tree->max_key_len + 1; 44 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); 47 if (node->tree->attributes & HFS_TREE_BIGKEYS) 57 struct hfs_btree *tree; local 64 tree 167 struct hfs_btree *tree; local 220 struct hfs_btree *tree; local 329 struct hfs_btree *tree; local 425 hfs_btree_inc_height(struct hfs_btree *tree) argument [all...] |
H A D | bnode.c | 46 struct hfs_btree *tree; local 49 tree = node->tree; 51 tree->attributes & HFS_TREE_VARIDXKEYS) 54 key_len = tree->max_key_len + 1; 99 struct hfs_btree *tree; local 105 tree = src_node->tree; 146 off = node->tree->node_size - 2; 153 if (node->tree 172 struct hfs_btree *tree; local 217 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument 235 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument 314 hfs_bnode_find(struct hfs_btree *tree, u32 num) argument 407 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument 454 struct hfs_btree *tree = node->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 down(&tree->tree_lock); 34 dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0)); 35 up(&fd->tree->tree_lock); 36 fd->tree 85 struct hfs_btree *tree; local 152 struct hfs_btree *tree; local [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/hfsplus/ |
H A D | btree.c | 22 struct hfs_btree *tree; local 28 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 29 if (!tree) 32 init_MUTEX(&tree->tree_lock); 33 spin_lock_init(&tree->hash_lock); 34 tree->sb = sb; 35 tree->cnid = id; 36 tree->inode = iget(sb, id); 37 if (!tree 95 hfs_btree_close(struct hfs_btree *tree) argument 117 hfs_btree_write(struct hfs_btree *tree) argument 147 struct hfs_btree *tree = prev->tree; local 178 hfs_bmap_alloc(struct hfs_btree *tree) argument 271 struct hfs_btree *tree; local [all...] |
H A D | brec.c | 24 dataoff = node->tree->node_size - (rec + 2) * 2; 39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { 40 retval = node->tree->max_key_len + 2; 42 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); 45 if (node->tree->attributes & HFS_TREE_BIGKEYS) 55 struct hfs_btree *tree; local 62 tree = fd->tree; 64 if (!tree->root) 65 hfs_btree_inc_height(tree); 165 struct hfs_btree *tree; local 218 struct hfs_btree *tree; local 327 struct hfs_btree *tree; local 421 hfs_btree_inc_height(struct hfs_btree *tree) argument [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 down(&tree->tree_lock); 34 dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0)); 35 up(&fd->tree->tree_lock); 36 fd->tree 85 struct hfs_btree *tree; local 152 struct hfs_btree *tree; local [all...] |
H A D | bnode.c | 60 struct hfs_btree *tree; local 63 tree = node->tree; 65 tree->attributes & HFS_TREE_VARIDXKEYS) 68 key_len = tree->max_key_len + 2; 128 struct hfs_btree *tree; local 135 tree = src_node->tree; 306 off = node->tree->node_size - 2; 313 if (node->tree 332 struct hfs_btree *tree; local 377 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument 395 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument 474 hfs_bnode_find(struct hfs_btree *tree, u32 num) argument 567 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument 618 struct hfs_btree *tree = node->tree; local [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/fs/hfsplus_journal/ |
H A D | btree.c | 22 struct hfs_btree *tree; local 28 tree = kzalloc(sizeof(*tree), GFP_KERNEL); 29 if (!tree) 32 init_MUTEX(&tree->tree_lock); 33 spin_lock_init(&tree->hash_lock); 34 tree->sb = sb; 35 tree->cnid = id; 36 tree->inode = iget(sb, id); 37 if (!tree 101 hfs_btree_close(struct hfs_btree *tree) argument 123 hfs_btree_write(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree) argument 153 struct hfs_btree *tree = prev->tree; local 184 hfs_bmap_alloc(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree) argument 278 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 down(&tree->tree_lock); 34 dprint(DBG_BNODE_REFS, "find_exit: %d (%p)\n", fd->tree->cnid, __builtin_return_address(0)); 35 up(&fd->tree->tree_lock); 36 fd->tree 39 hfsplus_journalled_find_init(struct hfs_btree *tree, struct hfs_find_data *fd) argument 108 struct hfs_btree *tree; local 175 struct hfs_btree *tree; local [all...] |
H A D | brec.c | 24 dataoff = node->tree->node_size - (rec + 2) * 2; 39 !(node->tree->attributes & HFS_TREE_VARIDXKEYS)) { 40 retval = node->tree->max_key_len + 2; 42 recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); 45 if (node->tree->attributes & HFS_TREE_BIGKEYS) 55 struct hfs_btree *tree; local 62 tree = fd->tree; 64 if (!tree->root) 65 hfs_btree_inc_height(hfsplus_handle, tree); 166 struct hfs_btree *tree; local 220 struct hfs_btree *tree; local 330 struct hfs_btree *tree; local 424 hfs_btree_inc_height(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree) argument [all...] |
H A D | bnode.c | 60 struct hfs_btree *tree; local 63 tree = node->tree; 65 tree->attributes & HFS_TREE_VARIDXKEYS) 68 key_len = tree->max_key_len + 2; 128 struct hfs_btree *tree; local 135 tree = src_node->tree; 306 off = node->tree->node_size - 2; 313 if (node->tree 332 struct hfs_btree *tree; local 377 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument 395 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument 474 hfs_bnode_find(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree, u32 num) argument 567 hfs_bnode_create(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree, u32 num) argument 618 struct hfs_btree *tree = node->tree; local [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/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);
|
H A D | ospf6_bintree.c | 32 bintree_lookup (void *data, struct bintree *tree) argument 37 node = tree->root; 41 if (tree->cmp) 42 cmp = (*tree->cmp) (node->data, data); 62 bintree_lookup_min (struct bintree *tree) argument 65 node = bintree_lookup_node_min (tree->root); 72 bintree_lookup_max (struct bintree *tree) argument 75 node = bintree_lookup_node_max (tree->root); 82 bintree_add (void *data, struct bintree *tree) argument 87 node = tree 188 bintree_remove(void *data, struct bintree *tree) argument 275 bintree_head(struct bintree *tree, struct bintree_node *node) argument 383 struct bintree *tree; local 392 bintree_delete(struct bintree *tree) argument 430 bintree_print(void (*print) (int, void *), struct bintree *tree) argument [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/samba-3.0.13/source/include/ |
H A D | adt_tree.h | 30 /* data structure used to build the tree */ 52 void pathtree_destroy( SORTED_TREE *tree ); 56 BOOL pathtree_add( SORTED_TREE *tree, const char *path, void *data_p ); 60 void* pathtree_find( SORTED_TREE *tree, char *key ); 64 void pathtree_print_keys( SORTED_TREE *tree, int debug );
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/samba-3.0.13/source/lib/ |
H A D | adt_tree.c | 26 Initialize the tree's root. The cmp_fn is a callback function used 53 Initialize the tree's root. The cmp_fn is a callback function used 61 SORTED_TREE *tree = NULL; local 63 if ( !(tree = SMB_MALLOC_P(SORTED_TREE)) ) 66 ZERO_STRUCTP( tree ); 68 tree->compare = cmp_fn; 69 tree->free_func = free_fn; 71 if ( !(tree->root = SMB_MALLOC_P(TREE_NODE)) ) { 72 SAFE_FREE( tree ); 76 ZERO_STRUCTP( tree 242 pathtree_add( SORTED_TREE *tree, const char *path, void *data_p ) argument 360 pathtree_print_keys( SORTED_TREE *tree, int debug ) argument 382 pathtree_find( SORTED_TREE *tree, char *key ) argument [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/ffmpeg-0.5.1/libavutil/ |
H A D | tree.d | 1 libavutil/tree.o: libavutil/tree.c libavutil/common.h libavutil/mem.h config.h \ 4 libavutil/intfloat_readwrite.h libavutil/pixfmt.h libavutil/tree.h
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/net/sched/ |
H A D | ematch.c | 177 static inline struct tcf_ematch * tcf_em_get_match(struct tcf_ematch_tree *tree, argument 180 return &tree->matches[index]; 273 * tcf_em_tree_validate - validate ematch config TLV and build ematch tree 276 * @rta: ematch tree configuration TLV 277 * @tree: destination ematch tree variable to store the resulting 278 * ematch tree. 281 * ematch tree in @tree. The resulting tree mus 288 tcf_em_tree_validate(struct tcf_proto *tp, struct rtattr *rta, struct tcf_ematch_tree *tree) argument 383 tcf_em_tree_destroy(struct tcf_proto *tp, struct tcf_ematch_tree *tree) argument 418 tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) argument 473 __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, struct tcf_pkt_info *info) argument [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/samba-3.0.13/examples/libsmbclient/ |
H A D | Makefile | 13 all: testsmbc tree testacl testbrowse 23 tree: tree.o 24 @echo Linking tree
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/timemachine/gettext-0.17/gnulib-local/lib/libxml/ |
H A D | xinclude.in.h | 17 #include <libxml/tree.h> 102 xmlXIncludeProcessTree (xmlNodePtr tree); 104 xmlXIncludeProcessTreeFlags(xmlNodePtr tree, 118 xmlNodePtr tree);
|
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/ap/gpl/minidlna/zlib-1.2.3/ |
H A D | trees.c | 12 * Each code tree is stored in a compressed form which is itself 91 /* The static literal tree. Since the bit lengths are imposed, there is no 93 * The codes 286 and 287 are needed to build a canonical tree (see _tr_init 98 /* The static distance tree. (Actually a trivial tree since all codes use 122 const ct_data *static_tree; /* static tree or NULL */ 125 int elems; /* max number of elements in the tree */ 144 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 146 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 148 local void scan_tree OF((deflate_state *s, ct_data *tree, in 494 ct_data *tree = desc->dyn_tree; local 623 ct_data *tree = desc->dyn_tree; local [all...] |
/netgear-WNDR4500v2-V1.0.0.60_1.0.38/src/linux/linux-2.6/arch/sparc/prom/ |
H A D | Makefile | 7 palloc.o ranges.o segment.o console.o printf.o tree.o
|