Home
last modified time | relevance | path

Searched defs:tn (Results 1 – 2 of 2) sorted by relevance

/fs/jffs2/
Dreadinode.c31 static int check_node_data(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) in check_node_data()
150 static int check_tn_node(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) in check_tn_node()
178 struct jffs2_tmp_dnode_info *tn = NULL; in jffs2_lookup_tn() local
199 static void jffs2_kill_tn(struct jffs2_sb_info *c, struct jffs2_tmp_dnode_info *tn) in jffs2_kill_tn()
220 struct jffs2_tmp_dnode_info *tn) in jffs2_add_tn_to_tree()
424 static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) in ver_insert()
546 struct jffs2_tmp_dnode_info *tn, *next; in jffs2_free_tmp_dnode_info_list() local
717 struct jffs2_tmp_dnode_info *tn; in read_dnode() local
Dnodelist.h354 #define tn_next(tn) rb_entry(rb_next(&(tn)->rb), struct jffs2_tmp_dnode_info, rb) argument
355 #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb) argument
356 #define tn_parent(tn) rb_entry(rb_parent(&(tn)->rb), struct jffs2_tmp_dnode_info, rb) argument
357 #define tn_left(tn) rb_entry((tn)->rb.rb_left, struct jffs2_tmp_dnode_info, rb) argument
358 #define tn_right(tn) rb_entry((tn)->rb.rb_right, struct jffs2_tmp_dnode_info, rb) argument
359 #define tn_erase(tn, list) rb_erase(&tn->rb, list) argument