Searched refs:tree (Results 26 - 50 of 694) sorted by relevance

1234567891011>>

/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfs/
H A Dbrec.c15 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) {
49 if (retval > node->tree->max_key_len + 2) {
56 if (retval > node->tree
68 struct hfs_btree *tree; local
178 struct hfs_btree *tree; local
231 struct hfs_btree *tree; local
352 struct hfs_btree *tree; local
448 hfs_btree_inc_height(struct hfs_btree *tree) argument
[all...]
H A Dbnode.c47 struct hfs_btree *tree; local
50 tree = node->tree;
52 tree->attributes & HFS_TREE_VARIDXKEYS)
55 key_len = tree->max_key_len + 1;
100 struct hfs_btree *tree; local
106 tree = src_node->tree;
147 off = node->tree->node_size - 2;
154 if (node->tree
173 struct hfs_btree *tree; local
218 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument
236 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument
315 hfs_bnode_find(struct hfs_btree *tree, u32 num) argument
408 hfs_bnode_create(struct hfs_btree *tree, u32 num) argument
455 struct hfs_btree *tree = node->tree; local
[all...]
H A Dbfind.c14 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
94 struct hfs_btree *tree; local
161 struct hfs_btree *tree; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/btrfs/
H A Dextent_io.h102 struct extent_io_tree *tree; member in struct:extent_state
155 void extent_io_tree_init(struct extent_io_tree *tree,
158 struct extent_io_tree *tree, struct page *page,
160 int try_release_extent_buffer(struct extent_io_tree *tree, struct page *page);
162 struct extent_io_tree *tree, struct page *page,
164 int lock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask);
165 int lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end,
167 int unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask);
168 int unlock_extent_cached(struct extent_io_tree *tree, u64 start, u64 end,
170 int try_lock_extent(struct extent_io_tree *tree, u6
[all...]
H A Dextent_map.h51 void extent_map_tree_init(struct extent_map_tree *tree, gfp_t mask);
52 struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
54 int add_extent_mapping(struct extent_map_tree *tree,
56 int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em);
62 int unpin_extent_cache(struct extent_map_tree *tree, u64 start, u64 len);
63 struct extent_map *search_extent_mapping(struct extent_map_tree *tree,
H A DMakefile4 btrfs-y += super.o ctree.o extent-tree.o print-tree.o root-tree.o dir-item.o \
6 transaction.o inode.o file.o tree-defrag.o \
9 export.o tree-log.o acl.o free-space-cache.o zlib.o \
H A Dextent_io.c40 struct extent_io_tree *tree; member in struct:extent_page_data
80 "state %lu in tree %p refs %d\n",
83 state->state, state->tree, atomic_read(&state->refs));
103 void extent_io_tree_init(struct extent_io_tree *tree, argument
106 tree->state = RB_ROOT;
107 tree->buffer = RB_ROOT;
108 tree->ops = NULL;
109 tree->dirty_bytes = 0;
110 spin_lock_init(&tree->lock);
111 spin_lock_init(&tree
181 __etree_search(struct extent_io_tree *tree, u64 offset, struct rb_node **prev_ret, struct rb_node **next_ret) argument
226 tree_search(struct extent_io_tree *tree, u64 offset) argument
238 buffer_tree_insert(struct extent_io_tree *tree, u64 offset, struct rb_node *node) argument
263 buffer_search(struct extent_io_tree *tree, u64 offset) argument
282 merge_cb(struct extent_io_tree *tree, struct extent_state *new, struct extent_state *other) argument
299 merge_state(struct extent_io_tree *tree, struct extent_state *state) argument
337 set_state_cb(struct extent_io_tree *tree, struct extent_state *state, int *bits) argument
348 clear_state_cb(struct extent_io_tree *tree, struct extent_state *state, int *bits) argument
365 insert_state(struct extent_io_tree *tree, struct extent_state *state, u64 start, u64 end, int *bits) argument
404 split_cb(struct extent_io_tree *tree, struct extent_state *orig, u64 split) argument
427 split_state(struct extent_io_tree *tree, struct extent_state *orig, struct extent_state *prealloc, u64 split) argument
456 clear_state_bit(struct extent_io_tree *tree, struct extent_state *state, int *bits, int wake) argument
499 clear_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, int bits, int wake, int delete, struct extent_state **cached_state, gfp_t mask) argument
663 wait_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, int bits) argument
707 set_state_bits(struct extent_io_tree *tree, struct extent_state *state, int *bits) argument
748 set_extent_bit(struct extent_io_tree *tree, u64 start, u64 end, int bits, int exclusive_bits, u64 *failed_start, struct extent_state **cached_state, gfp_t mask) argument
936 set_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
943 set_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits, gfp_t mask) argument
950 clear_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits, gfp_t mask) argument
956 set_extent_delalloc(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state, gfp_t mask) argument
964 clear_extent_dirty(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
972 set_extent_new(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
979 clear_extent_new(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
986 set_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
993 clear_extent_uptodate(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached_state, gfp_t mask) argument
1001 wait_on_extent_writeback(struct extent_io_tree *tree, u64 start, u64 end) argument
1010 lock_extent_bits(struct extent_io_tree *tree, u64 start, u64 end, int bits, struct extent_state **cached_state, gfp_t mask) argument
1030 lock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
1035 try_lock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
1052 unlock_extent_cached(struct extent_io_tree *tree, u64 start, u64 end, struct extent_state **cached, gfp_t mask) argument
1059 unlock_extent(struct extent_io_tree *tree, u64 start, u64 end, gfp_t mask) argument
1069 set_range_dirty(struct extent_io_tree *tree, u64 start, u64 end) argument
1088 set_range_writeback(struct extent_io_tree *tree, u64 start, u64 end) argument
1111 find_first_extent_bit(struct extent_io_tree *tree, u64 start, u64 *start_ret, u64 *end_ret, int bits) argument
1148 find_first_extent_bit_state(struct extent_io_tree *tree, u64 start, int bits) argument
1181 find_delalloc_range(struct extent_io_tree *tree, u64 *start, u64 *end, u64 max_bytes, struct extent_state **cached_state) argument
1333 find_lock_delalloc_range(struct inode *inode, struct extent_io_tree *tree, struct page *locked_page, u64 *start, u64 *end, u64 max_bytes) argument
1416 extent_clear_unlock_delalloc(struct inode *inode, struct extent_io_tree *tree, u64 start, u64 end, struct page *locked_page, unsigned long op) argument
1478 count_range_bits(struct extent_io_tree *tree, u64 *start, u64 search_end, u64 max_bytes, unsigned long bits) argument
1533 set_state_private(struct extent_io_tree *tree, u64 start, u64 private) argument
1560 get_state_private(struct extent_io_tree *tree, u64 start, u64 *private) argument
1593 test_range_bit(struct extent_io_tree *tree, u64 start, u64 end, int bits, int filled, struct extent_state *cached) argument
1646 check_page_uptodate(struct extent_io_tree *tree, struct page *page) argument
1660 check_page_locked(struct extent_io_tree *tree, struct page *page) argument
1674 check_page_writeback(struct extent_io_tree *tree, struct page *page) argument
1696 struct extent_io_tree *tree; local
1765 struct extent_io_tree *tree; local
1846 struct extent_io_tree *tree; local
1902 struct extent_io_tree *tree = bio->bi_private; local
1924 submit_extent_page(int rw, struct extent_io_tree *tree, struct page *page, sector_t sector, size_t size, unsigned long offset, struct block_device *bdev, struct bio **bio_ret, unsigned long max_pages, bio_end_io_t end_io_func, int mirror_num, unsigned long prev_bio_flags, unsigned long bio_flags) argument
2001 __extent_read_full_page(struct extent_io_tree *tree, struct page *page, get_extent_t *get_extent, struct bio **bio, int mirror_num, unsigned long *bio_flags) argument
2162 extent_read_full_page(struct extent_io_tree *tree, struct page *page, get_extent_t *get_extent) argument
2197 struct extent_io_tree *tree = epd->tree; local
2462 extent_write_cache_pages(struct extent_io_tree *tree, struct address_space *mapping, struct writeback_control *wbc, writepage_t writepage, void *data, void (*flush_fn)(void *)) argument
2583 extent_write_full_page(struct extent_io_tree *tree, struct page *page, get_extent_t *get_extent, struct writeback_control *wbc) argument
2612 extent_write_locked_range(struct extent_io_tree *tree, struct inode *inode, u64 start, u64 end, get_extent_t *get_extent, int mode) argument
2656 extent_writepages(struct extent_io_tree *tree, struct address_space *mapping, get_extent_t *get_extent, struct writeback_control *wbc) argument
2677 extent_readpages(struct extent_io_tree *tree, struct address_space *mapping, struct list_head *pages, unsigned nr_pages, get_extent_t get_extent) argument
2709 extent_invalidatepage(struct extent_io_tree *tree, struct page *page, unsigned long offset) argument
2734 extent_commit_write(struct extent_io_tree *tree, struct inode *inode, struct page *page, unsigned from, unsigned to) argument
2750 extent_prepare_write(struct extent_io_tree *tree, struct inode *inode, struct page *page, unsigned from, unsigned to, get_extent_t *get_extent) argument
2851 try_release_extent_state(struct extent_map_tree *map, struct extent_io_tree *tree, struct page *page, gfp_t mask) argument
2881 try_release_extent_mapping(struct extent_map_tree *map, struct extent_io_tree *tree, struct page *page, gfp_t mask) argument
3069 __alloc_extent_buffer(struct extent_io_tree *tree, u64 start, unsigned long len, gfp_t mask) argument
3106 alloc_extent_buffer(struct extent_io_tree *tree, u64 start, unsigned long len, struct page *page0, gfp_t mask) argument
3190 find_extent_buffer(struct extent_io_tree *tree, u64 start, unsigned long len, gfp_t mask) argument
3219 clear_extent_buffer_dirty(struct extent_io_tree *tree, struct extent_buffer *eb) argument
3252 wait_on_extent_buffer_writeback(struct extent_io_tree *tree, struct extent_buffer *eb) argument
3259 set_extent_buffer_dirty(struct extent_io_tree *tree, struct extent_buffer *eb) argument
3273 clear_extent_buffer_uptodate(struct extent_io_tree *tree, struct extent_buffer *eb, struct extent_state **cached_state) argument
3294 set_extent_buffer_uptodate(struct extent_io_tree *tree, struct extent_buffer *eb) argument
3318 extent_range_uptodate(struct extent_io_tree *tree, u64 start, u64 end) argument
3344 extent_buffer_uptodate(struct extent_io_tree *tree, struct extent_buffer *eb, struct extent_state *cached_state) argument
3373 read_extent_buffer_pages(struct extent_io_tree *tree, struct extent_buffer *eb, u64 start, int wait, get_extent_t *get_extent, int mirror_num) argument
3835 try_release_extent_buffer(struct extent_io_tree *tree, struct page *page) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/contrib/samples/deprecated/treelay/
H A Dtreelay.cpp91 frame->SetStatusText(_T("Hello, tree!"));
109 void MyApp::TreeTest(wxTreeLayoutStored& tree, wxDC& dc) argument
111 tree.Initialize(200);
113 tree.AddChild(_T("animal"));
114 tree.AddChild(_T("mammal"), _T("animal"));
115 tree.AddChild(_T("insect"), _T("animal"));
116 tree.AddChild(_T("bird"), _T("animal"));
118 tree.AddChild(_T("man"), _T("mammal"));
119 tree.AddChild(_T("cat"), _T("mammal"));
120 tree
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfsplus/
H A Dbrec.c24 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 Dbfind.c14 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 Dbnode.c60 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-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/hfsplus_journal/
H A Dbrec.c24 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);
47 if (retval > node->tree->max_key_len + 2) {
58 struct hfs_btree *tree; local
65 tree = fd->tree;
67 if (!tree->root)
68 hfs_btree_inc_height(hfsplus_handle, tree);
169 struct hfs_btree *tree; local
223 struct hfs_btree *tree; local
345 struct hfs_btree *tree; local
439 hfs_btree_inc_height(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree) argument
[all...]
H A Dbnode.c85 struct hfs_btree *tree; local
88 tree = node->tree;
90 tree->attributes & HFS_TREE_VARIDXKEYS ||
91 node->tree->cnid == HFSPLUS_ATTR_CNID)
94 key_len = tree->max_key_len + 2;
158 struct hfs_btree *tree; local
165 tree = src_node->tree;
336 off = node->tree
362 struct hfs_btree *tree; local
407 hfs_bnode_findhash(struct hfs_btree *tree, u32 cnid) argument
425 __hfs_bnode_create(struct hfs_btree *tree, u32 cnid) argument
504 hfs_bnode_find(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree, u32 num) argument
597 hfs_bnode_create(hfsplus_handle_t *hfsplus_handle, struct hfs_btree *tree, u32 num) argument
648 struct hfs_btree *tree = node->tree; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zebra/ospf6d/
H A Dospf6_bintree.c32 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-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/lib/
H A Dadt_tree.c51 Initialize the tree's root. The cmp_fn is a callback function used
57 SORTED_TREE *tree = NULL; local
59 if ( !(tree = TALLOC_ZERO_P(NULL, SORTED_TREE)) )
62 tree->compare = cmp_fn;
64 if ( !(tree->root = TALLOC_ZERO_P(tree, TREE_NODE)) ) {
65 TALLOC_FREE( tree );
69 tree->root->data_p = data_p;
71 return tree;
192 Add a new node into the tree give
195 pathtree_add( SORTED_TREE *tree, const char *path, void *data_p ) argument
313 pathtree_print_keys( SORTED_TREE *tree, int debug ) argument
335 pathtree_find( SORTED_TREE *tree, char *key ) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/xrc/
H A Dxh_tree.cpp47 XRC_MAKE_INSTANCE(tree, wxTreeCtrl)
49 tree->Create(m_parentAsWindow,
56 SetupWindow(tree);
58 return tree;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/forked-daapd-0.19/src/
H A DRSPParser.h100 // initialized but unused variable - tree rewrite variables declared but not needed
119 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
123 pANTLR3_BASE_TREE tree; member in struct:RSPParser_query_return_struct
130 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
134 pANTLR3_BASE_TREE tree; member in struct:RSPParser_expr_return_struct
141 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
145 pANTLR3_BASE_TREE tree; member in struct:RSPParser_aexpr_return_struct
152 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
156 pANTLR3_BASE_TREE tree; member in struct:RSPParser_crit_return_struct
163 /** Generic return elements for ANTLR3 rules that are not in tree parser
167 pANTLR3_BASE_TREE tree; member in struct:RSPParser_strcrit_return_struct
178 pANTLR3_BASE_TREE tree; member in struct:RSPParser_strop_return_struct
189 pANTLR3_BASE_TREE tree; member in struct:RSPParser_intcrit_return_struct
200 pANTLR3_BASE_TREE tree; member in struct:RSPParser_intop_return_struct
211 pANTLR3_BASE_TREE tree; member in struct:RSPParser_datecrit_return_struct
222 pANTLR3_BASE_TREE tree; member in struct:RSPParser_dateop_return_struct
233 pANTLR3_BASE_TREE tree; member in struct:RSPParser_datespec_return_struct
244 pANTLR3_BASE_TREE tree; member in struct:RSPParser_dateref_return_struct
255 pANTLR3_BASE_TREE tree; member in struct:RSPParser_dateintval_return_struct
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/forked-daapd-0.19/src/pregen/
H A DRSPParser.h100 // initialized but unused variable - tree rewrite variables declared but not needed
119 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
123 pANTLR3_BASE_TREE tree; member in struct:RSPParser_query_return_struct
130 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
134 pANTLR3_BASE_TREE tree; member in struct:RSPParser_expr_return_struct
141 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
145 pANTLR3_BASE_TREE tree; member in struct:RSPParser_aexpr_return_struct
152 /** Generic return elements for ANTLR3 rules that are not in tree parsers or returning trees
156 pANTLR3_BASE_TREE tree; member in struct:RSPParser_crit_return_struct
163 /** Generic return elements for ANTLR3 rules that are not in tree parser
167 pANTLR3_BASE_TREE tree; member in struct:RSPParser_strcrit_return_struct
178 pANTLR3_BASE_TREE tree; member in struct:RSPParser_strop_return_struct
189 pANTLR3_BASE_TREE tree; member in struct:RSPParser_intcrit_return_struct
200 pANTLR3_BASE_TREE tree; member in struct:RSPParser_intop_return_struct
211 pANTLR3_BASE_TREE tree; member in struct:RSPParser_datecrit_return_struct
222 pANTLR3_BASE_TREE tree; member in struct:RSPParser_dateop_return_struct
233 pANTLR3_BASE_TREE tree; member in struct:RSPParser_datespec_return_struct
244 pANTLR3_BASE_TREE tree; member in struct:RSPParser_dateref_return_struct
255 pANTLR3_BASE_TREE tree; member in struct:RSPParser_dateintval_return_struct
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/contrib/samples/ogl/studio/
H A Dproject.cpp75 // Fill out the project tree control
79 csProjectTreeCtrl& tree = *GetProjectTreeCtrl();
82 long level0 = tree.InsertItem(0, "Applications", 0, 0);
83 long level1 = tree.InsertItem(level0, "Projects", 0, 0);
84 tree.InsertItem(level1, "project1", 1, 1);
85 tree.InsertItem(level1, "project2", 1, 1);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/sched/
H A Dematch.c166 static inline struct tcf_ematch * tcf_em_get_match(struct tcf_ematch_tree *tree, argument
169 return &tree->matches[index];
280 * tcf_em_tree_validate - validate ematch config TLV and build ematch tree
283 * @nla: ematch tree configuration TLV
284 * @tree: destination ematch tree variable to store the resulting
285 * ematch tree.
288 * ematch tree in @tree. The resulting tree mus
295 tcf_em_tree_validate(struct tcf_proto *tp, struct nlattr *nla, struct tcf_ematch_tree *tree) argument
388 tcf_em_tree_destroy(struct tcf_proto *tp, struct tcf_ematch_tree *tree) argument
425 tcf_em_tree_dump(struct sk_buff *skb, struct tcf_ematch_tree *tree, int tlv) argument
485 __tcf_em_tree_match(struct sk_buff *skb, struct tcf_ematch_tree *tree, struct tcf_pkt_info *info) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/crypto/x509v3/
H A Dpcy_node.c103 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-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libcsc-0.82.3/src/
H A Dcsc_tree.c38 The balanced tree insertion algorithm is directly taken from Donald E.
50 The CSCbinTree functions provide an interface to a balanced binary tree
51 subsystem. The tree is an opaque data type, and client code never has
53 tree can be deleted.
61 same tree.
64 tree
66 CSCbinTreeNew - create an empty libcsc balanced binary tree
67 CSCbinTreeDel - delete a libcsc balanced binary tree
68 CSCbinTreeInsert - insert a node into a libcsc balanced binary tree
69 CSCbinTreeTagOrderedInsert - put node into libcsc balanced binary tree
761 CSCbinTreeDel( CSCbinTreeType const tree, CSCgenFnType cbFn ) argument
889 CSCbinTreeInsert( CSCbinTreeType const tree, CSCbinTreeNodeType const node, CSCcmpFnType cmpfn ) argument
1183 CSCbinTreeTagOrderedInsert( CSCbinTreeType const tree, CSCbinTreeNodeType const node ) argument
1286 CSCbinTreeTraverse( const char* const method, CSCbinTreeType const tree, CSCcmpFnType clientFn, const void* const clientData ) argument
1402 CSCbinTreeUserSearch( CSCbinTreeType const tree, CSCcmpFnType clientFn, const void* const clientData ) argument
1472 CSCbinTreeTagSearch( CSCbinTreeType const tree, long tag ) argument
1574 CSCbinTreeStat( CSCbinTreeType const tree, size_t* const countPtr, size_t* const heightPtr, size_t* const comparesPtr, size_t* const rotatesPtr ) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/dtc/
H A Dlivetree.c170 struct node *tree, uint32_t boot_cpuid_phys)
176 bi->dt = tree;
222 struct node *get_node_by_path(struct node *tree, const char *path) argument
228 return tree;
235 for_each_child(tree, child) {
245 struct node *get_node_by_label(struct node *tree, const char *label) argument
251 if (tree->label && streq(tree->label, label))
252 return tree;
254 for_each_child(tree, chil
169 build_boot_info(struct reserve_info *reservelist, struct node *tree, uint32_t boot_cpuid_phys) argument
263 get_node_by_phandle(struct node *tree, cell_t phandle) argument
281 get_node_by_ref(struct node *tree, const char *ref) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/doc/examples/
H A Dparse1.c3 * synopsis: Parse an XML file to a tree and free it
5 * into a tree and and xmlFreeDoc() to free the resulting tree
14 #include <libxml/tree.h>
20 * Parse the resource and free the resulting tree
24 xmlDocPtr doc; /* the resulting document tree */
H A Dparse3.c3 * synopsis: Parse an XML document in memory to a tree and free it
5 * into a tree and and xmlFreeDoc() to free the resulting tree
14 #include <libxml/tree.h>
23 * Parse the in memory document and free the resulting tree
27 xmlDocPtr doc; /* the resulting document tree */

Completed in 133 milliseconds

1234567891011>>