Searched refs:weight (Results 1 – 10 of 10) sorted by relevance
/fs/afs/ |
D | vl_list.c | 195 bs.weight = afs_extract_le16(&b); in afs_extract_vlserver_list() 203 bs.name_len, bs.priority, bs.weight, in afs_extract_vlserver_list() 290 bs.weight > vllist->servers[j].weight) in afs_extract_vlserver_list() 303 vllist->servers[j].weight = bs.weight; in afs_extract_vlserver_list()
|
D | proc.c | 303 vlserver->name, entry->priority, entry->weight, in afs_proc_cell_vlservers_show()
|
D | internal.h | 444 u16 weight; /* Weight (as SRV) */ member
|
/fs/dlm/ |
D | member.c | 331 memb->weight = node->weight; in dlm_add_member() 403 if (memb->weight) in make_member_array() 404 total += memb->weight; in make_member_array() 420 if (!all_zero && !memb->weight) in make_member_array() 426 w = memb->weight; in make_member_array()
|
D | config.c | 302 int weight; member 568 nd->weight = 1; /* default weight of 1 if none is set */ in make_node() 796 return sprintf(buf, "%d\n", config_item_to_node(item)->weight); in node_weight_show() 802 int rc = kstrtoint(buf, 0, &config_item_to_node(item)->weight); in node_weight_store() 810 CONFIGFS_ATTR(node_, weight); 904 node->weight = nd->weight; in dlm_config_nodes()
|
D | config.h | 19 int weight; member
|
D | dlm_internal.h | 125 int weight; member
|
/fs/f2fs/ |
D | extent_cache.c | 802 unsigned int weight = sbi->last_age_weight; in __calculate_block_age() local 804 res = div_u64_rem(new, 100, &rem_new) * (100 - weight) in __calculate_block_age() 805 + div_u64_rem(old, 100, &rem_old) * weight; in __calculate_block_age() 808 res += rem_new * (100 - weight) / 100; in __calculate_block_age() 810 res += rem_old * weight / 100; in __calculate_block_age()
|
/fs/btrfs/ |
D | ordered-data.c | 1060 unsigned long weight; in clone_ordered_extent() local 1063 weight = hweight_long(flags_masked); in clone_ordered_extent() 1064 WARN_ON_ONCE(weight > 1); in clone_ordered_extent() 1065 if (!weight) in clone_ordered_extent()
|
/fs/xfs/ |
D | Kconfig | 138 lighter weight than XFS_DEBUG and does not modify algorithms and will
|