/asus-wl-520gu-7.0.1.45/src/router/samba/source/lib/ |
H A D | adt_tree.c | 25 Initialize the tree's root. The cmp_fn is a callback function used 52 Initialize the tree's root. The cmp_fn is a callback function used 60 SORTED_TREE *tree = NULL; local 62 if ( !(tree = (SORTED_TREE*)malloc( sizeof(SORTED_TREE) )) ) 65 ZERO_STRUCTP( tree ); 67 tree->compare = cmp_fn; 68 tree->free = free_fn; 70 if ( !(tree->root = (TREE_NODE*)malloc( sizeof(TREE_NODE) )) ) { 71 SAFE_FREE( tree ); 75 ZERO_STRUCTP( tree 241 sorted_tree_add( SORTED_TREE *tree, const char *path, void *data_p ) argument 359 sorted_tree_print_keys( SORTED_TREE *tree, int debug ) argument 381 sorted_tree_find( SORTED_TREE *tree, char *key ) argument [all...] |
/asus-wl-520gu-7.0.1.45/src/linux/linux/fs/hfs/ |
H A D | binsert.c | 8 static inline void hfs_btree_lock(struct hfs_btree *tree) argument 10 while (tree->lock) 11 hfs_sleep_on(&tree->wait); 12 tree->lock = 1; 15 static inline void hfs_btree_unlock(struct hfs_btree *tree) argument 17 tree->lock = 0; 18 hfs_wake_up(&tree->wait); 83 * Adds a new root to a B*-tree, increasing its height. 85 * struct hfs_btree *tree: the tree t 101 add_root(struct hfs_btree *tree, struct hfs_bnode *left, struct hfs_bnode *right) argument 192 insert_empty_bnode(struct hfs_btree *tree, struct hfs_bnode *left) argument 319 struct hfs_btree *tree = brec->tree; local 412 hfs_binsert(struct hfs_btree *tree, const struct hfs_bkey *key, const void *data, hfs_u16 datasize) argument [all...] |
H A D | balloc.c | 12 static hfs_buffer get_new_node(struct hfs_btree *tree, hfs_u32 node) argument 17 tmp = hfs_extent_map(&tree->entry.u.file.data_fork, node, 0); 19 retval = hfs_buffer_get(tree->sys_mdb, tmp, 0); 30 * struct hfs_btree *tree: Pointer to a B-tree 37 * 'tree' points to a "valid" (struct hfs_btree) 48 static struct hfs_bnode_ref hfs_bnode_init(struct hfs_btree * tree, argument 65 retval.bn->tree = tree; 71 retval.bn->buf = get_new_node(tree, nod 192 hfs_bnode_bitop(struct hfs_btree *tree, hfs_u32 bitnr, int set) argument 263 hfs_bnode_alloc(struct hfs_btree *tree) argument 340 hfs_btree_extend(struct hfs_btree *tree) argument 407 struct hfs_btree *tree = bnr->bn->tree; local [all...] |
H A D | bdelete.c | 70 * The current 'root' node is removed from the tree and the depth 71 * of the tree is reduced by one. 73 * child becomes the new root of the tree. 74 * If 'root' is an empty leaf node the tree becomes empty. 79 struct hfs_btree *tree = root->bn->tree; local 86 /* tree is empty */ 87 tree->bthRoot = 0; 88 tree->root = NULL; 89 tree 284 struct hfs_btree *tree = brec->tree; local 435 hfs_bdelete(struct hfs_btree *tree, const struct hfs_bkey *key) argument [all...] |
H A D | bfind.c | 42 * records in a B-tree. Given a B-tree and a key it locates the 70 * -ENOENT: tree is valid but empty or no "matching" record was located. 75 * valid B-tree failed indicating corruption of either the B-tree 77 * the B-tree. 82 * 'brec' is NULL or points to a (struct hfs_brec) with a 'tree' field 86 * If 'brec', 'brec->tree' or 'target' is NULL then -EINVAL is returned. 87 * If 'brec', 'brec->tree' and 'target' are non-NULL but the tree 113 hfs_bfind(struct hfs_brec *brec, struct hfs_btree *tree, const struct hfs_bkey *target, int flags) argument [all...] |
H A D | brec.c | 23 static inline int overflow(const struct hfs_btree *tree, argument 29 ROUND(tree->bthKeyLen+1))) ? HFS_BPATH_OVERFLOW : 0; 38 static inline int underflow(const struct hfs_btree *tree, argument 53 * Obtain access to a child of an internal node in a B-tree. 86 overflow(brec->tree, elem->bnr.bn) | 87 underflow(brec->tree, elem->bnr.bn); 107 elem->bnr = hfs_bnode_find(brec->tree, node, lock_type); 160 * Obtain access to the root node of a B-tree. 173 * 'tree' points to a valid (struct hfs_btree). 177 * of 'brec->tree' 187 hfs_brec_init(struct hfs_brec *brec, struct hfs_btree *tree, int flags) argument [all...] |
H A D | bnode.c | 46 if (bhash(bn->tree, bn->node) == bn) { 47 bhash(bn->tree, bn->node) = bn->next; 63 * struct hfs_btree *tree: pointer to the (struct hfs_btree) 73 * 'tree' points to a "valid" (struct hfs_btree). 74 * 'node' is an existing node number in the B-tree. 78 * The 'sticky', 'tree' and 'node' fields are initialized to the 95 void hfs_bnode_read(struct hfs_bnode *bnode, struct hfs_btree *tree, argument 105 bnode->tree = tree; 113 if ((bnode->next = bhash(tree, nod 414 hfs_bnode_find(struct hfs_btree *tree, hfs_u32 node, int lock_type) argument [all...] |
H A D | hfs_btree.h | 14 /* The number of hash buckets in a B-tree's bnode cache */ 23 #define ndHdrNode 0x01 /* The tree header node (node 0) */ 32 #define bthBadClose 0x00000001 /* b-tree not closed properly. not 38 b-tree but not in extents 39 b-tree (hfsplus). */ 44 #define bhash(tree, node) ((tree)->cache[(node) % HFS_CACHELEN]) 58 * The B-tree header record 61 * each B-tree file. It contains important information about the 62 * B-tree 132 struct hfs_btree *tree; /* The tree to which this node member in struct:hfs_bnode [all...] |
/asus-wl-520gu-7.0.1.45/src/router/e2fsprogs-1.40.8/lib/ext2fs/ |
H A D | ext3_extents.h | 42 #define ext_debug(tree,fmt,a...) \ 44 if (test_opt((tree)->inode->i_sb, EXTDEBUG)) \ 48 #define ext_debug(tree,fmt,a...) 63 * - tree depth (0 mean there is no tree yet. all extents in the inode) 69 * it's used at the bottom of the tree 97 __u16 eh_depth; /* has tree real underlaying blocks? */ 98 __u32 eh_generation; /* generation of the tree */ 147 #define EXT_ROOT_HDR(tree) \ 148 ((struct ext3_extent_header *) (tree) 229 ext3_ext_invalidate_cache(struct ext3_extents_tree *tree) argument [all...] |
/asus-wl-520gu-7.0.1.45/src/cfe/cfe/zlib/ |
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 495 ct_data *tree = desc->dyn_tree; local 624 ct_data *tree = desc->dyn_tree; local [all...] |
H A D | infcodes.c | 40 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon177::__anon178 42 } code; /* if LEN or DIST, where in tree */ 53 inflate_huft *ltree; /* literal/length/eob tree */ 54 inflate_huft *dtree; /* distance tree */ 119 c->sub.code.tree = c->ltree; 124 t = c->sub.code.tree + ((uInt)b & inflate_mask[j]); 146 c->sub.code.tree = t + t->base; 165 c->sub.code.tree = c->dtree; 171 t = c->sub.code.tree [all...] |
/asus-wl-520gu-7.0.1.45/src/linux/linux/lib/zlib_deflate/ |
H A D | deftree.c | 13 * Each code tree is stored in a compressed form which is itself 88 /* The static literal tree. Since the bit lengths are imposed, there is no 90 * The codes 286 and 287 are needed to build a canonical tree (see zlib_tr_init 95 /* The static distance tree. (Actually a trivial tree since all codes use 115 const ct_data *static_tree; /* static tree or NULL */ 118 int elems; /* max number of elements in the tree */ 137 local void pqdownheap OF((deflate_state *s, ct_data *tree, int k)); 139 local void gen_codes OF((ct_data *tree, int max_code, ushf *bl_count)); 141 local void scan_tree OF((deflate_state *s, ct_data *tree, in 411 ct_data *tree = desc->dyn_tree; local 540 ct_data *tree = desc->dyn_tree; local [all...] |
/asus-wl-520gu-7.0.1.45/src/router/acl/test/ |
H A D | Makefile | 36 LSRCFILES = run make-tree \
|
H A D | make-tree | 40 mkdir -p tree 41 cd tree
|
/asus-wl-520gu-7.0.1.45/src/router/samba/examples/libsmbclient/ |
H A D | Makefile | 13 all: testsmbc tree testacl 23 tree: tree.o 24 @echo Linking tree
|
H A D | tree.c | 4 SMB client GTK+ tree-based application 24 /* example-gtk+ application, ripped off from the gtk+ tree.c sample */ 35 guint32 type; /* Type of tree item, an SMBC_TYPE */ 70 * We walk back up the tree, picking up pieces until we hit a server or 83 /* Walk back up the tree, getting the private data */ 158 g_print ("select_child called for root tree %p, subtree %p, child %p\n", 311 g_print ("unselect_child called for root tree %p, subtree %p, child %p\n", 332 /* Get the level of the tree which the item is in */ 408 /* Add it to the parent tree */ 458 static void cb_selection_changed( GtkWidget *tree ) 614 GtkWidget *window, *scrolled_win, *scrolled_win2, *tree; local 685 GTK_SIGNAL_FUNC(cb_select_child), tree); local 687 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local 689 GTK_SIGNAL_FUNC(cb_selection_changed), tree); local 692 tree); local 742 GTK_SIGNAL_FUNC(cb_select_child), tree); local 744 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local 796 GTK_SIGNAL_FUNC(cb_select_child), tree); local 798 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local [all...] |
/asus-wl-520gu-7.0.1.45/src/linux/linux/arch/sparc/prom/ |
H A D | Makefile | 14 palloc.o ranges.o segment.o console.o printf.o tree.o
|
/asus-wl-520gu-7.0.1.45/src/linux/linux/arch/sparc64/prom/ |
H A D | Makefile | 11 tree.o console.o printf.o p1275.o map.o
|
/asus-wl-520gu-7.0.1.45/src/linux/linux/arch/mips/arc/ |
H A D | Makefile | 8 misc.o time.o tree.o
|
/asus-wl-520gu-7.0.1.45/src/router/busybox/ |
H A D | gzip.c | 451 * left-to-right output (useful for code strings from the tree routines), 1370 * Each code tree is stored in the ZIP file in a compressed form 1503 ush dad; /* father node in Huffman tree */ 1516 static ct_data dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 1517 static ct_data dyn_dtree[2 * D_CODES + 1]; /* distance tree */ 1521 /* The static literal tree. Since the bit lengths are imposed, there is no 1523 * The codes 286 and 287 are needed to build a canonical tree (see ct_init 1529 /* The static distance tree. (Actually a trivial tree since all codes use 1535 /* Huffman tree fo 1800 pqdownheap(ct_data *tree, int k) argument 1836 ct_data *tree = desc->dyn_tree; local 1931 gen_codes(ct_data *tree, int max_code) argument 1976 ct_data *tree = desc->dyn_tree; local 2065 scan_tree(ct_data *tree, int max_code) argument 2111 send_tree(ct_data *tree, int max_code) argument [all...] |
/asus-wl-520gu-7.0.1.45/src/router/rcamdmips/ |
H A D | gtree.c | 161 g_tree_destroy (GTree *tree) argument 165 g_return_if_fail (tree != NULL); 167 rtree = (GRealTree*) tree; 174 g_tree_insert (GTree *tree, argument 181 g_return_if_fail (tree != NULL); 183 rtree = (GRealTree*) tree; 191 g_tree_remove (GTree *tree, argument 196 g_return_if_fail (tree != NULL); 198 rtree = (GRealTree*) tree; 204 g_tree_lookup (GTree *tree, argument 217 g_tree_traverse(GTree *tree, GTraverseFunc traverse_func, GTraverseType traverse_type, gpointer data) argument 252 g_tree_search(GTree *tree, GSearchFunc search_func, gpointer data) argument 269 g_tree_height(GTree *tree) argument 284 g_tree_nnodes(GTree *tree) argument [all...] |
/asus-wl-520gu-7.0.1.45/src/router/samba/source/client/ |
H A D | tree.c | 3 SMB client GTK+ tree-based application 23 /* example-gtk+ application, ripped off from the gtk+ tree.c sample */ 34 guint32 type; /* Type of tree item, an SMBC_TYPE */ 68 * We walk back up the tree, picking up pieces until we hit a server or 81 /* Walk back up the tree, getting the private data */ 156 g_print ("select_child called for root tree %p, subtree %p, child %p\n", 309 g_print ("unselect_child called for root tree %p, subtree %p, child %p\n", 330 /* Get the level of the tree which the item is in */ 406 /* Add it to the parent tree */ 456 static void cb_selection_changed( GtkWidget *tree ) 612 GtkWidget *window, *scrolled_win, *scrolled_win2, *tree; local 683 GTK_SIGNAL_FUNC(cb_select_child), tree); local 685 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local 687 GTK_SIGNAL_FUNC(cb_selection_changed), tree); local 690 tree); local 740 GTK_SIGNAL_FUNC(cb_select_child), tree); local 742 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local 794 GTK_SIGNAL_FUNC(cb_select_child), tree); local 796 GTK_SIGNAL_FUNC(cb_unselect_child), tree); local [all...] |
/asus-wl-520gu-7.0.1.45/src/linux/linux/lib/zlib_inflate/ |
H A D | infcodes.c | 75 c->sub.code.tree = c->ltree; 80 t = c->sub.code.tree + ((uInt)b & zlib_inflate_mask[j]); 99 c->sub.code.tree = t + t->base; 117 c->sub.code.tree = c->dtree; 122 t = c->sub.code.tree + ((uInt)b & zlib_inflate_mask[j]); 135 c->sub.code.tree = t + t->base;
|
/asus-wl-520gu-7.0.1.45/src/router/ppp/pppdump/ |
H A D | zlib.c | 190 ush dad; /* father node in Huffman tree */ 203 ct_data *dyn_tree; /* the dynamic tree */ 205 static_tree_desc *stat_desc; /* the corresponding static tree */ 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 317 struct tree_desc_s l_desc; /* desc. for literal tree */ 318 struct tree_desc_s d_desc; /* desc. for distance tree */ 319 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 322 /* number of codes at each bit length for an optimal tree */ 1852 ct_data *tree = desc->dyn_tree; local 1981 ct_data *tree = desc->dyn_tree; local 4103 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon12081::__anon12082 [all...] |
/asus-wl-520gu-7.0.1.45/src/router/pppd/pppdump/ |
H A D | zlib.c | 190 ush dad; /* father node in Huffman tree */ 203 ct_data *dyn_tree; /* the dynamic tree */ 205 static_tree_desc *stat_desc; /* the corresponding static tree */ 313 struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ 314 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 315 struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ 317 struct tree_desc_s l_desc; /* desc. for literal tree */ 318 struct tree_desc_s d_desc; /* desc. for distance tree */ 319 struct tree_desc_s bl_desc; /* desc. for bit length tree */ 322 /* number of codes at each bit length for an optimal tree */ 1852 ct_data *tree = desc->dyn_tree; local 1981 ct_data *tree = desc->dyn_tree; local 4103 inflate_huft *tree; /* pointer into tree */ member in struct:inflate_codes_state::__anon12149::__anon12150 [all...] |