Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 20 of 20) sorted by relevance

/linux-2.4.37.9/fs/hfsplus/
Dbtree.c19 void hfsplus_close_btree(struct hfsplus_btree *tree) in hfsplus_close_btree()
42 static void hfsplus_read_treeinfo(hfsplus_btree *tree, hfsplus_btree_head *hdr) in hfsplus_read_treeinfo()
70 static void hfsplus_write_treeinfo(hfsplus_btree *tree, hfsplus_btree_head *hdr) in hfsplus_write_treeinfo()
85 hfsplus_btree *tree; in hfsplus_open_btree() local
140 void hfsplus_write_btree(struct hfsplus_btree *tree) in hfsplus_write_btree()
159 hfsplus_bnode *hfsplus_btree_alloc_node(hfsplus_btree *tree) in hfsplus_btree_alloc_node()
238 hfsplus_btree *tree; in hfsplus_btree_remove_node() local
274 hfsplus_btree *tree; in hfsplus_btree_free_node() local
Dbnode.c75 hfsplus_btree *tree; in hfsplus_bnode_read_key() local
122 struct hfsplus_btree *tree; in hfsplus_bnode_copybytes() local
315 int hfsplus_btree_add_level(hfsplus_btree *tree) in hfsplus_btree_add_level()
376 hfsplus_btree *tree; in hfsplus_bnode_split() local
486 hfsplus_btree *tree; in hfsplus_bnode_insert_rec() local
584 hfsplus_btree *tree; in hfsplus_update_idx_rec() local
675 hfsplus_btree *tree; in hfsplus_bnode_remove_rec() local
727 static int hfsplus_check_kh(hfsplus_btree *tree, u8 kind, u8 height) in hfsplus_check_kh()
755 hfsplus_bnode *__hfsplus_find_bnode(hfsplus_btree *tree, u32 cnid) in __hfsplus_find_bnode()
773 hfsplus_bnode *__hfsplus_create_bnode(hfsplus_btree *tree, u32 cnid) in __hfsplus_create_bnode()
[all …]
Dbfind.c57 hfsplus_btree *tree; in hfsplus_btree_find() local
128 struct hfsplus_btree *tree; in hfsplus_btree_move() local
188 int hfsplus_find_init(hfsplus_btree *tree, struct hfsplus_find_data *fd) in hfsplus_find_init()
Dinode.c61 struct hfsplus_btree *tree; in hfsplus_releasepage() local
Dhfsplus_fs.h88 struct hfsplus_btree *tree; member
200 hfsplus_btree *tree; member
/linux-2.4.37.9/fs/hfs/
Dballoc.c34 static hfs_buffer get_new_node(struct hfs_btree *tree, hfs_u32 node) in get_new_node()
70 static struct hfs_bnode_ref hfs_bnode_init(struct hfs_btree * tree, in hfs_bnode_init()
214 int hfs_bnode_bitop(struct hfs_btree *tree, hfs_u32 bitnr, int set) in hfs_bnode_bitop()
285 struct hfs_bnode_ref hfs_bnode_alloc(struct hfs_btree *tree) in hfs_bnode_alloc()
362 void hfs_btree_extend(struct hfs_btree *tree) in hfs_btree_extend()
429 struct hfs_btree *tree = bnr->bn->tree; in hfs_bnode_free() local
Dbinsert.c21 static inline void hfs_btree_lock(struct hfs_btree *tree) in hfs_btree_lock()
28 static inline void hfs_btree_unlock(struct hfs_btree *tree) in hfs_btree_unlock()
114 static void add_root(struct hfs_btree *tree, in add_root()
205 static struct hfs_bnode_ref insert_empty_bnode(struct hfs_btree *tree, in insert_empty_bnode()
376 struct hfs_btree *tree = brec->tree; in binsert() local
469 int hfs_binsert(struct hfs_btree *tree, const struct hfs_bkey *key, in hfs_binsert()
Dbrec.c36 static inline int overflow(const struct hfs_btree *tree, in overflow()
51 static inline int underflow(const struct hfs_btree *tree, in underflow()
200 struct hfs_belem *hfs_brec_init(struct hfs_brec *brec, struct hfs_btree *tree, in hfs_brec_init()
Dbdelete.c92 struct hfs_btree *tree = root->bn->tree; in del_root() local
297 struct hfs_btree *tree = brec->tree; in bdelete() local
448 int hfs_bdelete(struct hfs_btree *tree, const struct hfs_bkey *key) in hfs_bdelete()
Dbnode.c113 void hfs_bnode_read(struct hfs_bnode *bnode, struct hfs_btree *tree, in hfs_bnode_read()
432 struct hfs_bnode_ref hfs_bnode_find(struct hfs_btree *tree, in hfs_bnode_find()
Dbfind.c126 int hfs_bfind(struct hfs_brec *brec, struct hfs_btree *tree, in hfs_bfind()
Dhfs_btree.h54 #define bhash(tree, node) ((tree)->cache[(node) % HFS_CACHELEN]) argument
142 struct hfs_btree *tree; /* The tree to which this node member
Dhfs.h418 struct hfs_btree *tree; member
/linux-2.4.37.9/lib/zlib_deflate/
Ddeftree.c156 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument
160 # define send_code(s, c, tree) \ argument
351 #define pqremove(s, tree, top) \ argument
362 #define smaller(tree, n, m, depth) \ argument
372 local void pqdownheap(s, tree, k) in pqdownheap() argument
411 ct_data *tree = desc->dyn_tree; local
494 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument
540 ct_data *tree = desc->dyn_tree; local
623 local void scan_tree (s, tree, max_code) in scan_tree() argument
668 local void send_tree (s, tree, max_code) in send_tree() argument
/linux-2.4.37.9/lib/zlib_inflate/
Dinfutil.h164 inflate_huft *tree; /* pointer into tree */ member
/linux-2.4.37.9/fs/jfs/
Djfs_dmap.h164 struct dmaptree tree; /* 360: dmap tree */ member
/linux-2.4.37.9/arch/ppc64/boot/
Dzlib.c1659 inflate_huft *tree; /* pointer into tree */ member
/linux-2.4.37.9/arch/ppc/boot/lib/
Dzlib.c1643 inflate_huft *tree; /* pointer into tree */ member
/linux-2.4.37.9/net/sched/
Dsch_htb.c948 htb_lookup_leaf(HTB_ARGQ rb_root_t *tree,int prio,rb_node_t **pptr,u32 *pid) in htb_lookup_leaf()
/linux-2.4.37.9/drivers/net/tokenring/
Dsmctr.c782 DECODE_TREE_NODE *tree; in smctr_decode_firmware() local