Searched refs:num_nodes (Results 1 – 4 of 4) sorted by relevance
67 int num_nodes; member265 d->num_nodes++; in tipc_disc_add_dest()276 d->num_nodes--; in tipc_disc_remove_dest()277 num = d->num_nodes; in tipc_disc_remove_dest()304 if (tipc_node(d->domain) && d->num_nodes) { in tipc_disc_timeout()322 if (d->num_nodes && d->timer_intv > TIPC_DISC_SLOW) in tipc_disc_timeout()324 else if (!d->num_nodes && d->timer_intv > TIPC_DISC_FAST) in tipc_disc_timeout()374 d->num_nodes = 0; in tipc_disc_create()412 d->num_nodes = 0; in tipc_disc_reset()
110 u32 num_nodes; member
92 ceph_decode_8_safe(p, end, b->num_nodes, bad); in crush_decode_tree_bucket()93 b->node_weights = kcalloc(b->num_nodes, sizeof(u32), GFP_NOFS); in crush_decode_tree_bucket()96 ceph_decode_need(p, end, b->num_nodes * sizeof(u32), bad); in crush_decode_tree_bucket()97 for (j = 0; j < b->num_nodes; j++) in crush_decode_tree_bucket()
204 n = bucket->num_nodes >> 1; in bucket_tree_choose()