Home
last modified time | relevance | path

Searched refs:be_node (Results 1 – 5 of 5) sorted by relevance

/linux-3.4.99/arch/powerpc/platforms/cell/
Dcbe_regs.c31 struct device_node *be_node; member
42 struct device_node *be_node; member
59 cbe_regs_maps[i].be_node == np) in cbe_find_map()
194 if(map->be_node) { in cbe_fill_regs_map()
197 be = map->be_node; in cbe_fill_regs_map()
244 cbe_thread_map[i].be_node = cbe_get_be_node(i); in cbe_regs_init()
271 map->be_node = thread->be_node; in cbe_regs_init()
/linux-3.4.99/fs/nfs/blocklayout/
Dextents.c456 INIT_LIST_HEAD(&be->be_node); in bl_alloc_extent()
467 list_for_each_entry(be, list, be_node) { in print_elist()
510 list_for_each_entry_safe_reverse(be, tmp, list, be_node) { in bl_add_merge_extent()
534 list_del(&be->be_node); in bl_add_merge_extent()
545 list_del(&be->be_node); in bl_add_merge_extent()
558 list_del(&be->be_node); in bl_add_merge_extent()
568 list_add(&new->be_node, &be->be_node); in bl_add_merge_extent()
600 list_for_each_entry_reverse(be, &bl->bl_extents[i], be_node) { in bl_find_get_extent()
639 list_for_each_entry_reverse(be, &bl->bl_extents[i], be_node) { in bl_find_get_extent_locked()
727 if (&be->be_node == head || be->be_node.prev == head) in _front_merge()
[all …]
Dblocklayoutdev.c353 list_add_tail(&be->be_node, &extents); in nfs4_blk_process_layoutget()
370 list_for_each_entry_safe(be, save, &extents, be_node) { in nfs4_blk_process_layoutget()
371 list_del(&be->be_node); in nfs4_blk_process_layoutget()
394 be_node); in nfs4_blk_process_layoutget()
395 list_del(&be->be_node); in nfs4_blk_process_layoutget()
Dblocklayout.h88 struct list_head be_node; /* link into lseg list */ member
Dblocklayout.c888 be_node); in release_extents()
889 list_del(&be->be_node); in release_extents()